Bug Summary

File:lib/IR/Verifier.cpp
Warning:line 2168, column 7
Called C++ object pointer is null

Annotated Source Code

1//===-- Verifier.cpp - Implement the Module Verifier -----------------------==//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file defines the function verifier interface, that can be used for some
11// sanity checking of input to the system.
12//
13// Note that this does not provide full `Java style' security and verifications,
14// instead it just tries to ensure that code is well-formed.
15//
16// * Both of a binary operator's parameters are of the same type
17// * Verify that the indices of mem access instructions match other operands
18// * Verify that arithmetic and other things are only performed on first-class
19// types. Verify that shifts & logicals only happen on integrals f.e.
20// * All of the constants in a switch statement are of the correct type
21// * The code is in valid SSA form
22// * It should be illegal to put a label into any other type (like a structure)
23// or to return one. [except constant arrays!]
24// * Only phi nodes can be self referential: 'add i32 %0, %0 ; <int>:0' is bad
25// * PHI nodes must have an entry for each predecessor, with no extras.
26// * PHI nodes must be the first thing in a basic block, all grouped together
27// * PHI nodes must have at least one entry
28// * All basic blocks should only end with terminator insts, not contain them
29// * The entry node to a function must not have predecessors
30// * All Instructions must be embedded into a basic block
31// * Functions cannot take a void-typed parameter
32// * Verify that a function's argument list agrees with it's declared type.
33// * It is illegal to specify a name for a void value.
34// * It is illegal to have a internal global value with no initializer
35// * It is illegal to have a ret instruction that returns a value that does not
36// agree with the function return value type.
37// * Function call argument types match the function prototype
38// * A landing pad is defined by a landingpad instruction, and can be jumped to
39// only by the unwind edge of an invoke instruction.
40// * A landingpad instruction must be the first non-PHI instruction in the
41// block.
42// * Landingpad instructions must be in a function with a personality function.
43// * All other things that are tested by asserts spread about the code...
44//
45//===----------------------------------------------------------------------===//
46
47#include "llvm/IR/Verifier.h"
48#include "llvm/ADT/APFloat.h"
49#include "llvm/ADT/APInt.h"
50#include "llvm/ADT/ArrayRef.h"
51#include "llvm/ADT/DenseMap.h"
52#include "llvm/ADT/ilist.h"
53#include "llvm/ADT/MapVector.h"
54#include "llvm/ADT/Optional.h"
55#include "llvm/ADT/STLExtras.h"
56#include "llvm/ADT/SmallPtrSet.h"
57#include "llvm/ADT/SmallSet.h"
58#include "llvm/ADT/SmallVector.h"
59#include "llvm/ADT/StringMap.h"
60#include "llvm/ADT/StringRef.h"
61#include "llvm/ADT/Twine.h"
62#include "llvm/IR/Argument.h"
63#include "llvm/IR/Attributes.h"
64#include "llvm/IR/BasicBlock.h"
65#include "llvm/IR/CFG.h"
66#include "llvm/IR/CallSite.h"
67#include "llvm/IR/CallingConv.h"
68#include "llvm/IR/Comdat.h"
69#include "llvm/IR/Constant.h"
70#include "llvm/IR/ConstantRange.h"
71#include "llvm/IR/Constants.h"
72#include "llvm/IR/DataLayout.h"
73#include "llvm/IR/DebugInfo.h"
74#include "llvm/IR/DebugInfoMetadata.h"
75#include "llvm/IR/DebugLoc.h"
76#include "llvm/IR/DerivedTypes.h"
77#include "llvm/IR/DiagnosticInfo.h"
78#include "llvm/IR/Dominators.h"
79#include "llvm/IR/Function.h"
80#include "llvm/IR/GlobalAlias.h"
81#include "llvm/IR/GlobalValue.h"
82#include "llvm/IR/GlobalVariable.h"
83#include "llvm/IR/InlineAsm.h"
84#include "llvm/IR/InstrTypes.h"
85#include "llvm/IR/Instruction.h"
86#include "llvm/IR/Instructions.h"
87#include "llvm/IR/InstVisitor.h"
88#include "llvm/IR/IntrinsicInst.h"
89#include "llvm/IR/Intrinsics.h"
90#include "llvm/IR/LLVMContext.h"
91#include "llvm/IR/Metadata.h"
92#include "llvm/IR/Module.h"
93#include "llvm/IR/ModuleSlotTracker.h"
94#include "llvm/IR/PassManager.h"
95#include "llvm/IR/Statepoint.h"
96#include "llvm/IR/Type.h"
97#include "llvm/IR/Use.h"
98#include "llvm/IR/User.h"
99#include "llvm/IR/Value.h"
100#include "llvm/Pass.h"
101#include "llvm/Support/AtomicOrdering.h"
102#include "llvm/Support/Casting.h"
103#include "llvm/Support/CommandLine.h"
104#include "llvm/Support/Debug.h"
105#include "llvm/Support/Dwarf.h"
106#include "llvm/Support/ErrorHandling.h"
107#include "llvm/Support/MathExtras.h"
108#include "llvm/Support/raw_ostream.h"
109#include <algorithm>
110#include <cassert>
111#include <cstdint>
112#include <memory>
113#include <string>
114#include <utility>
115
116using namespace llvm;
117
118static cl::opt<bool> VerifyDebugInfo("verify-debug-info", cl::init(true));
119
120namespace llvm {
121
122struct VerifierSupport {
123 raw_ostream *OS;
124 const Module &M;
125 ModuleSlotTracker MST;
126 const DataLayout &DL;
127 LLVMContext &Context;
128
129 /// Track the brokenness of the module while recursively visiting.
130 bool Broken = false;
131 /// Broken debug info can be "recovered" from by stripping the debug info.
132 bool BrokenDebugInfo = false;
133 /// Whether to treat broken debug info as an error.
134 bool TreatBrokenDebugInfoAsError = true;
135
136 explicit VerifierSupport(raw_ostream *OS, const Module &M)
137 : OS(OS), M(M), MST(&M), DL(M.getDataLayout()), Context(M.getContext()) {}
138
139private:
140 void Write(const Module *M) {
141 *OS << "; ModuleID = '" << M->getModuleIdentifier() << "'\n";
142 }
143
144 void Write(const Value *V) {
145 if (!V)
146 return;
147 if (isa<Instruction>(V)) {
148 V->print(*OS, MST);
149 *OS << '\n';
150 } else {
151 V->printAsOperand(*OS, true, MST);
152 *OS << '\n';
153 }
154 }
155
156 void Write(ImmutableCallSite CS) {
157 Write(CS.getInstruction());
158 }
159
160 void Write(const Metadata *MD) {
161 if (!MD)
162 return;
163 MD->print(*OS, MST, &M);
164 *OS << '\n';
165 }
166
167 template <class T> void Write(const MDTupleTypedArrayWrapper<T> &MD) {
168 Write(MD.get());
169 }
170
171 void Write(const NamedMDNode *NMD) {
172 if (!NMD)
173 return;
174 NMD->print(*OS, MST);
175 *OS << '\n';
176 }
177
178 void Write(Type *T) {
179 if (!T)
180 return;
181 *OS << ' ' << *T;
182 }
183
184 void Write(const Comdat *C) {
185 if (!C)
186 return;
187 *OS << *C;
188 }
189
190 void Write(const APInt *AI) {
191 if (!AI)
192 return;
193 *OS << *AI << '\n';
194 }
195
196 void Write(const unsigned i) { *OS << i << '\n'; }
197
198 template <typename T> void Write(ArrayRef<T> Vs) {
199 for (const T &V : Vs)
200 Write(V);
201 }
202
203 template <typename T1, typename... Ts>
204 void WriteTs(const T1 &V1, const Ts &... Vs) {
205 Write(V1);
206 WriteTs(Vs...);
207 }
208
209 template <typename... Ts> void WriteTs() {}
210
211public:
212 /// \brief A check failed, so printout out the condition and the message.
213 ///
214 /// This provides a nice place to put a breakpoint if you want to see why
215 /// something is not correct.
216 void CheckFailed(const Twine &Message) {
217 if (OS)
218 *OS << Message << '\n';
219 Broken = true;
220 }
221
222 /// \brief A check failed (with values to print).
223 ///
224 /// This calls the Message-only version so that the above is easier to set a
225 /// breakpoint on.
226 template <typename T1, typename... Ts>
227 void CheckFailed(const Twine &Message, const T1 &V1, const Ts &... Vs) {
228 CheckFailed(Message);
229 if (OS)
230 WriteTs(V1, Vs...);
231 }
232
233 /// A debug info check failed.
234 void DebugInfoCheckFailed(const Twine &Message) {
235 if (OS)
236 *OS << Message << '\n';
237 Broken |= TreatBrokenDebugInfoAsError;
238 BrokenDebugInfo = true;
239 }
240
241 /// A debug info check failed (with values to print).
242 template <typename T1, typename... Ts>
243 void DebugInfoCheckFailed(const Twine &Message, const T1 &V1,
244 const Ts &... Vs) {
245 DebugInfoCheckFailed(Message);
246 if (OS)
247 WriteTs(V1, Vs...);
248 }
249};
250
251} // namespace llvm
252
253namespace {
254
255class Verifier : public InstVisitor<Verifier>, VerifierSupport {
256 friend class InstVisitor<Verifier>;
257
258 DominatorTree DT;
259
260 /// \brief When verifying a basic block, keep track of all of the
261 /// instructions we have seen so far.
262 ///
263 /// This allows us to do efficient dominance checks for the case when an
264 /// instruction has an operand that is an instruction in the same block.
265 SmallPtrSet<Instruction *, 16> InstsInThisBlock;
266
267 /// \brief Keep track of the metadata nodes that have been checked already.
268 SmallPtrSet<const Metadata *, 32> MDNodes;
269
270 /// Track all DICompileUnits visited.
271 SmallPtrSet<const Metadata *, 2> CUVisited;
272
273 /// \brief The result type for a landingpad.
274 Type *LandingPadResultTy;
275
276 /// \brief Whether we've seen a call to @llvm.localescape in this function
277 /// already.
278 bool SawFrameEscape;
279
280 /// Whether the current function has a DISubprogram attached to it.
281 bool HasDebugInfo = false;
282
283 /// Stores the count of how many objects were passed to llvm.localescape for a
284 /// given function and the largest index passed to llvm.localrecover.
285 DenseMap<Function *, std::pair<unsigned, unsigned>> FrameEscapeInfo;
286
287 // Maps catchswitches and cleanuppads that unwind to siblings to the
288 // terminators that indicate the unwind, used to detect cycles therein.
289 MapVector<Instruction *, TerminatorInst *> SiblingFuncletInfo;
290
291 /// Cache of constants visited in search of ConstantExprs.
292 SmallPtrSet<const Constant *, 32> ConstantExprVisited;
293
294 /// Cache of declarations of the llvm.experimental.deoptimize.<ty> intrinsic.
295 SmallVector<const Function *, 4> DeoptimizeDeclarations;
296
297 // Verify that this GlobalValue is only used in this module.
298 // This map is used to avoid visiting uses twice. We can arrive at a user
299 // twice, if they have multiple operands. In particular for very large
300 // constant expressions, we can arrive at a particular user many times.
301 SmallPtrSet<const Value *, 32> GlobalValueVisited;
302
303 // Keeps track of duplicate function argument debug info.
304 SmallVector<const DILocalVariable *, 16> DebugFnArgs;
305
306 TBAAVerifier TBAAVerifyHelper;
307
308 void checkAtomicMemAccessSize(Type *Ty, const Instruction *I);
309
310public:
311 explicit Verifier(raw_ostream *OS, bool ShouldTreatBrokenDebugInfoAsError,
312 const Module &M)
313 : VerifierSupport(OS, M), LandingPadResultTy(nullptr),
314 SawFrameEscape(false), TBAAVerifyHelper(this) {
315 TreatBrokenDebugInfoAsError = ShouldTreatBrokenDebugInfoAsError;
316 }
317
318 bool hasBrokenDebugInfo() const { return BrokenDebugInfo; }
319
320 bool verify(const Function &F) {
321 assert(F.getParent() == &M &&((F.getParent() == &M && "An instance of this class only works with a specific module!"
) ? static_cast<void> (0) : __assert_fail ("F.getParent() == &M && \"An instance of this class only works with a specific module!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 322, __PRETTY_FUNCTION__))
322 "An instance of this class only works with a specific module!")((F.getParent() == &M && "An instance of this class only works with a specific module!"
) ? static_cast<void> (0) : __assert_fail ("F.getParent() == &M && \"An instance of this class only works with a specific module!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 322, __PRETTY_FUNCTION__))
;
323
324 // First ensure the function is well-enough formed to compute dominance
325 // information, and directly compute a dominance tree. We don't rely on the
326 // pass manager to provide this as it isolates us from a potentially
327 // out-of-date dominator tree and makes it significantly more complex to run
328 // this code outside of a pass manager.
329 // FIXME: It's really gross that we have to cast away constness here.
330 if (!F.empty())
331 DT.recalculate(const_cast<Function &>(F));
332
333 for (const BasicBlock &BB : F) {
334 if (!BB.empty() && BB.back().isTerminator())
335 continue;
336
337 if (OS) {
338 *OS << "Basic Block in function '" << F.getName()
339 << "' does not have terminator!\n";
340 BB.printAsOperand(*OS, true, MST);
341 *OS << "\n";
342 }
343 return false;
344 }
345
346 Broken = false;
347 // FIXME: We strip const here because the inst visitor strips const.
348 visit(const_cast<Function &>(F));
349 verifySiblingFuncletUnwinds();
350 InstsInThisBlock.clear();
351 DebugFnArgs.clear();
352 LandingPadResultTy = nullptr;
353 SawFrameEscape = false;
354 SiblingFuncletInfo.clear();
355
356 return !Broken;
357 }
358
359 /// Verify the module that this instance of \c Verifier was initialized with.
360 bool verify() {
361 Broken = false;
362
363 // Collect all declarations of the llvm.experimental.deoptimize intrinsic.
364 for (const Function &F : M)
365 if (F.getIntrinsicID() == Intrinsic::experimental_deoptimize)
366 DeoptimizeDeclarations.push_back(&F);
367
368 // Now that we've visited every function, verify that we never asked to
369 // recover a frame index that wasn't escaped.
370 verifyFrameRecoverIndices();
371 for (const GlobalVariable &GV : M.globals())
372 visitGlobalVariable(GV);
373
374 for (const GlobalAlias &GA : M.aliases())
375 visitGlobalAlias(GA);
376
377 for (const NamedMDNode &NMD : M.named_metadata())
378 visitNamedMDNode(NMD);
379
380 for (const StringMapEntry<Comdat> &SMEC : M.getComdatSymbolTable())
381 visitComdat(SMEC.getValue());
382
383 visitModuleFlags(M);
384 visitModuleIdents(M);
385
386 verifyCompileUnits();
387
388 verifyDeoptimizeCallingConvs();
389
390 return !Broken;
391 }
392
393private:
394 // Verification methods...
395 void visitGlobalValue(const GlobalValue &GV);
396 void visitGlobalVariable(const GlobalVariable &GV);
397 void visitGlobalAlias(const GlobalAlias &GA);
398 void visitAliaseeSubExpr(const GlobalAlias &A, const Constant &C);
399 void visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias *> &Visited,
400 const GlobalAlias &A, const Constant &C);
401 void visitNamedMDNode(const NamedMDNode &NMD);
402 void visitMDNode(const MDNode &MD);
403 void visitMetadataAsValue(const MetadataAsValue &MD, Function *F);
404 void visitValueAsMetadata(const ValueAsMetadata &MD, Function *F);
405 void visitComdat(const Comdat &C);
406 void visitModuleIdents(const Module &M);
407 void visitModuleFlags(const Module &M);
408 void visitModuleFlag(const MDNode *Op,
409 DenseMap<const MDString *, const MDNode *> &SeenIDs,
410 SmallVectorImpl<const MDNode *> &Requirements);
411 void visitFunction(const Function &F);
412 void visitBasicBlock(BasicBlock &BB);
413 void visitRangeMetadata(Instruction &I, MDNode *Range, Type *Ty);
414 void visitDereferenceableMetadata(Instruction &I, MDNode *MD);
415
416 template <class Ty> bool isValidMetadataArray(const MDTuple &N);
417#define HANDLE_SPECIALIZED_MDNODE_LEAF(CLASS) void visit##CLASS(const CLASS &N);
418#include "llvm/IR/Metadata.def"
419 void visitDIScope(const DIScope &N);
420 void visitDIVariable(const DIVariable &N);
421 void visitDILexicalBlockBase(const DILexicalBlockBase &N);
422 void visitDITemplateParameter(const DITemplateParameter &N);
423
424 void visitTemplateParams(const MDNode &N, const Metadata &RawParams);
425
426 // InstVisitor overrides...
427 using InstVisitor<Verifier>::visit;
428 void visit(Instruction &I);
429
430 void visitTruncInst(TruncInst &I);
431 void visitZExtInst(ZExtInst &I);
432 void visitSExtInst(SExtInst &I);
433 void visitFPTruncInst(FPTruncInst &I);
434 void visitFPExtInst(FPExtInst &I);
435 void visitFPToUIInst(FPToUIInst &I);
436 void visitFPToSIInst(FPToSIInst &I);
437 void visitUIToFPInst(UIToFPInst &I);
438 void visitSIToFPInst(SIToFPInst &I);
439 void visitIntToPtrInst(IntToPtrInst &I);
440 void visitPtrToIntInst(PtrToIntInst &I);
441 void visitBitCastInst(BitCastInst &I);
442 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
443 void visitPHINode(PHINode &PN);
444 void visitBinaryOperator(BinaryOperator &B);
445 void visitICmpInst(ICmpInst &IC);
446 void visitFCmpInst(FCmpInst &FC);
447 void visitExtractElementInst(ExtractElementInst &EI);
448 void visitInsertElementInst(InsertElementInst &EI);
449 void visitShuffleVectorInst(ShuffleVectorInst &EI);
450 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
451 void visitCallInst(CallInst &CI);
452 void visitInvokeInst(InvokeInst &II);
453 void visitGetElementPtrInst(GetElementPtrInst &GEP);
454 void visitLoadInst(LoadInst &LI);
455 void visitStoreInst(StoreInst &SI);
456 void verifyDominatesUse(Instruction &I, unsigned i);
457 void visitInstruction(Instruction &I);
458 void visitTerminatorInst(TerminatorInst &I);
459 void visitBranchInst(BranchInst &BI);
460 void visitReturnInst(ReturnInst &RI);
461 void visitSwitchInst(SwitchInst &SI);
462 void visitIndirectBrInst(IndirectBrInst &BI);
463 void visitSelectInst(SelectInst &SI);
464 void visitUserOp1(Instruction &I);
465 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
466 void visitIntrinsicCallSite(Intrinsic::ID ID, CallSite CS);
467 void visitConstrainedFPIntrinsic(ConstrainedFPIntrinsic &FPI);
468 template <class DbgIntrinsicTy>
469 void visitDbgIntrinsic(StringRef Kind, DbgIntrinsicTy &DII);
470 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
471 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
472 void visitFenceInst(FenceInst &FI);
473 void visitAllocaInst(AllocaInst &AI);
474 void visitExtractValueInst(ExtractValueInst &EVI);
475 void visitInsertValueInst(InsertValueInst &IVI);
476 void visitEHPadPredecessors(Instruction &I);
477 void visitLandingPadInst(LandingPadInst &LPI);
478 void visitResumeInst(ResumeInst &RI);
479 void visitCatchPadInst(CatchPadInst &CPI);
480 void visitCatchReturnInst(CatchReturnInst &CatchReturn);
481 void visitCleanupPadInst(CleanupPadInst &CPI);
482 void visitFuncletPadInst(FuncletPadInst &FPI);
483 void visitCatchSwitchInst(CatchSwitchInst &CatchSwitch);
484 void visitCleanupReturnInst(CleanupReturnInst &CRI);
485
486 void verifyCallSite(CallSite CS);
487 void verifySwiftErrorCallSite(CallSite CS, const Value *SwiftErrorVal);
488 void verifySwiftErrorValue(const Value *SwiftErrorVal);
489 void verifyMustTailCall(CallInst &CI);
490 bool performTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
491 unsigned ArgNo, std::string &Suffix);
492 bool verifyAttributeCount(AttributeSet Attrs, unsigned Params);
493 void verifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
494 const Value *V);
495 void verifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
496 bool isReturnValue, const Value *V);
497 void verifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
498 const Value *V);
499 void verifyFunctionMetadata(ArrayRef<std::pair<unsigned, MDNode *>> MDs);
500
501 void visitConstantExprsRecursively(const Constant *EntryC);
502 void visitConstantExpr(const ConstantExpr *CE);
503 void verifyStatepoint(ImmutableCallSite CS);
504 void verifyFrameRecoverIndices();
505 void verifySiblingFuncletUnwinds();
506
507 void verifyFragmentExpression(const DbgInfoIntrinsic &I);
508 void verifyFnArgs(const DbgInfoIntrinsic &I);
509
510 /// Module-level debug info verification...
511 void verifyCompileUnits();
512
513 /// Module-level verification that all @llvm.experimental.deoptimize
514 /// declarations share the same calling convention.
515 void verifyDeoptimizeCallingConvs();
516};
517
518} // end anonymous namespace
519
520/// We know that cond should be true, if not print an error message.
521#define Assert(C, ...)do { if (!(C)) { CheckFailed(...); return; } } while (false) \
522 do { if (!(C)) { CheckFailed(__VA_ARGS__); return; } } while (false)
523
524/// We know that a debug info condition should be true, if not print
525/// an error message.
526#define AssertDI(C, ...)do { if (!(C)) { DebugInfoCheckFailed(...); return; } } while
(false)
\
527 do { if (!(C)) { DebugInfoCheckFailed(__VA_ARGS__); return; } } while (false)
528
529void Verifier::visit(Instruction &I) {
530 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
531 Assert(I.getOperand(i) != nullptr, "Operand is null", &I)do { if (!(I.getOperand(i) != nullptr)) { CheckFailed("Operand is null"
, &I); return; } } while (false)
;
532 InstVisitor<Verifier>::visit(I);
533}
534
535// Helper to recursively iterate over indirect users. By
536// returning false, the callback can ask to stop recursing
537// further.
538static void forEachUser(const Value *User,
539 SmallPtrSet<const Value *, 32> &Visited,
540 llvm::function_ref<bool(const Value *)> Callback) {
541 if (!Visited.insert(User).second)
542 return;
543 for (const Value *TheNextUser : User->materialized_users())
544 if (Callback(TheNextUser))
545 forEachUser(TheNextUser, Visited, Callback);
546}
547
548void Verifier::visitGlobalValue(const GlobalValue &GV) {
549 Assert(!GV.isDeclaration() || GV.hasValidDeclarationLinkage(),do { if (!(!GV.isDeclaration() || GV.hasValidDeclarationLinkage
())) { CheckFailed("Global is external, but doesn't have external or weak linkage!"
, &GV); return; } } while (false)
550 "Global is external, but doesn't have external or weak linkage!", &GV)do { if (!(!GV.isDeclaration() || GV.hasValidDeclarationLinkage
())) { CheckFailed("Global is external, but doesn't have external or weak linkage!"
, &GV); return; } } while (false)
;
551
552 Assert(GV.getAlignment() <= Value::MaximumAlignment,do { if (!(GV.getAlignment() <= Value::MaximumAlignment)) {
CheckFailed("huge alignment values are unsupported", &GV
); return; } } while (false)
553 "huge alignment values are unsupported", &GV)do { if (!(GV.getAlignment() <= Value::MaximumAlignment)) {
CheckFailed("huge alignment values are unsupported", &GV
); return; } } while (false)
;
554 Assert(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),do { if (!(!GV.hasAppendingLinkage() || isa<GlobalVariable
>(GV))) { CheckFailed("Only global variables can have appending linkage!"
, &GV); return; } } while (false)
555 "Only global variables can have appending linkage!", &GV)do { if (!(!GV.hasAppendingLinkage() || isa<GlobalVariable
>(GV))) { CheckFailed("Only global variables can have appending linkage!"
, &GV); return; } } while (false)
;
556
557 if (GV.hasAppendingLinkage()) {
558 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
559 Assert(GVar && GVar->getValueType()->isArrayTy(),do { if (!(GVar && GVar->getValueType()->isArrayTy
())) { CheckFailed("Only global arrays can have appending linkage!"
, GVar); return; } } while (false)
560 "Only global arrays can have appending linkage!", GVar)do { if (!(GVar && GVar->getValueType()->isArrayTy
())) { CheckFailed("Only global arrays can have appending linkage!"
, GVar); return; } } while (false)
;
561 }
562
563 if (GV.isDeclarationForLinker())
564 Assert(!GV.hasComdat(), "Declaration may not be in a Comdat!", &GV)do { if (!(!GV.hasComdat())) { CheckFailed("Declaration may not be in a Comdat!"
, &GV); return; } } while (false)
;
565
566 forEachUser(&GV, GlobalValueVisited, [&](const Value *V) -> bool {
567 if (const Instruction *I = dyn_cast<Instruction>(V)) {
568 if (!I->getParent() || !I->getParent()->getParent())
569 CheckFailed("Global is referenced by parentless instruction!", &GV, &M,
570 I);
571 else if (I->getParent()->getParent()->getParent() != &M)
572 CheckFailed("Global is referenced in a different module!", &GV, &M, I,
573 I->getParent()->getParent(),
574 I->getParent()->getParent()->getParent());
575 return false;
576 } else if (const Function *F = dyn_cast<Function>(V)) {
577 if (F->getParent() != &M)
578 CheckFailed("Global is used by function in a different module", &GV, &M,
579 F, F->getParent());
580 return false;
581 }
582 return true;
583 });
584}
585
586void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
587 if (GV.hasInitializer()) {
588 Assert(GV.getInitializer()->getType() == GV.getValueType(),do { if (!(GV.getInitializer()->getType() == GV.getValueType
())) { CheckFailed("Global variable initializer type does not match global "
"variable type!", &GV); return; } } while (false)
589 "Global variable initializer type does not match global "do { if (!(GV.getInitializer()->getType() == GV.getValueType
())) { CheckFailed("Global variable initializer type does not match global "
"variable type!", &GV); return; } } while (false)
590 "variable type!",do { if (!(GV.getInitializer()->getType() == GV.getValueType
())) { CheckFailed("Global variable initializer type does not match global "
"variable type!", &GV); return; } } while (false)
591 &GV)do { if (!(GV.getInitializer()->getType() == GV.getValueType
())) { CheckFailed("Global variable initializer type does not match global "
"variable type!", &GV); return; } } while (false)
;
592 // If the global has common linkage, it must have a zero initializer and
593 // cannot be constant.
594 if (GV.hasCommonLinkage()) {
595 Assert(GV.getInitializer()->isNullValue(),do { if (!(GV.getInitializer()->isNullValue())) { CheckFailed
("'common' global must have a zero initializer!", &GV); return
; } } while (false)
596 "'common' global must have a zero initializer!", &GV)do { if (!(GV.getInitializer()->isNullValue())) { CheckFailed
("'common' global must have a zero initializer!", &GV); return
; } } while (false)
;
597 Assert(!GV.isConstant(), "'common' global may not be marked constant!",do { if (!(!GV.isConstant())) { CheckFailed("'common' global may not be marked constant!"
, &GV); return; } } while (false)
598 &GV)do { if (!(!GV.isConstant())) { CheckFailed("'common' global may not be marked constant!"
, &GV); return; } } while (false)
;
599 Assert(!GV.hasComdat(), "'common' global may not be in a Comdat!", &GV)do { if (!(!GV.hasComdat())) { CheckFailed("'common' global may not be in a Comdat!"
, &GV); return; } } while (false)
;
600 }
601 }
602
603 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
604 GV.getName() == "llvm.global_dtors")) {
605 Assert(!GV.hasInitializer() || GV.hasAppendingLinkage(),do { if (!(!GV.hasInitializer() || GV.hasAppendingLinkage()))
{ CheckFailed("invalid linkage for intrinsic global variable"
, &GV); return; } } while (false)
606 "invalid linkage for intrinsic global variable", &GV)do { if (!(!GV.hasInitializer() || GV.hasAppendingLinkage()))
{ CheckFailed("invalid linkage for intrinsic global variable"
, &GV); return; } } while (false)
;
607 // Don't worry about emitting an error for it not being an array,
608 // visitGlobalValue will complain on appending non-array.
609 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getValueType())) {
610 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
611 PointerType *FuncPtrTy =
612 FunctionType::get(Type::getVoidTy(Context), false)->getPointerTo();
613 // FIXME: Reject the 2-field form in LLVM 4.0.
614 Assert(STy &&do { if (!(STy && (STy->getNumElements() == 2 || STy
->getNumElements() == 3) && STy->getTypeAtIndex
(0u)->isIntegerTy(32) && STy->getTypeAtIndex(1)
== FuncPtrTy)) { CheckFailed("wrong type for intrinsic global variable"
, &GV); return; } } while (false)
615 (STy->getNumElements() == 2 || STy->getNumElements() == 3) &&do { if (!(STy && (STy->getNumElements() == 2 || STy
->getNumElements() == 3) && STy->getTypeAtIndex
(0u)->isIntegerTy(32) && STy->getTypeAtIndex(1)
== FuncPtrTy)) { CheckFailed("wrong type for intrinsic global variable"
, &GV); return; } } while (false)
616 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&do { if (!(STy && (STy->getNumElements() == 2 || STy
->getNumElements() == 3) && STy->getTypeAtIndex
(0u)->isIntegerTy(32) && STy->getTypeAtIndex(1)
== FuncPtrTy)) { CheckFailed("wrong type for intrinsic global variable"
, &GV); return; } } while (false)
617 STy->getTypeAtIndex(1) == FuncPtrTy,do { if (!(STy && (STy->getNumElements() == 2 || STy
->getNumElements() == 3) && STy->getTypeAtIndex
(0u)->isIntegerTy(32) && STy->getTypeAtIndex(1)
== FuncPtrTy)) { CheckFailed("wrong type for intrinsic global variable"
, &GV); return; } } while (false)
618 "wrong type for intrinsic global variable", &GV)do { if (!(STy && (STy->getNumElements() == 2 || STy
->getNumElements() == 3) && STy->getTypeAtIndex
(0u)->isIntegerTy(32) && STy->getTypeAtIndex(1)
== FuncPtrTy)) { CheckFailed("wrong type for intrinsic global variable"
, &GV); return; } } while (false)
;
619 if (STy->getNumElements() == 3) {
620 Type *ETy = STy->getTypeAtIndex(2);
621 Assert(ETy->isPointerTy() &&do { if (!(ETy->isPointerTy() && cast<PointerType
>(ETy)->getElementType()->isIntegerTy(8))) { CheckFailed
("wrong type for intrinsic global variable", &GV); return
; } } while (false)
622 cast<PointerType>(ETy)->getElementType()->isIntegerTy(8),do { if (!(ETy->isPointerTy() && cast<PointerType
>(ETy)->getElementType()->isIntegerTy(8))) { CheckFailed
("wrong type for intrinsic global variable", &GV); return
; } } while (false)
623 "wrong type for intrinsic global variable", &GV)do { if (!(ETy->isPointerTy() && cast<PointerType
>(ETy)->getElementType()->isIntegerTy(8))) { CheckFailed
("wrong type for intrinsic global variable", &GV); return
; } } while (false)
;
624 }
625 }
626 }
627
628 if (GV.hasName() && (GV.getName() == "llvm.used" ||
629 GV.getName() == "llvm.compiler.used")) {
630 Assert(!GV.hasInitializer() || GV.hasAppendingLinkage(),do { if (!(!GV.hasInitializer() || GV.hasAppendingLinkage()))
{ CheckFailed("invalid linkage for intrinsic global variable"
, &GV); return; } } while (false)
631 "invalid linkage for intrinsic global variable", &GV)do { if (!(!GV.hasInitializer() || GV.hasAppendingLinkage()))
{ CheckFailed("invalid linkage for intrinsic global variable"
, &GV); return; } } while (false)
;
632 Type *GVType = GV.getValueType();
633 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
634 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
635 Assert(PTy, "wrong type for intrinsic global variable", &GV)do { if (!(PTy)) { CheckFailed("wrong type for intrinsic global variable"
, &GV); return; } } while (false)
;
636 if (GV.hasInitializer()) {
637 const Constant *Init = GV.getInitializer();
638 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
639 Assert(InitArray, "wrong initalizer for intrinsic global variable",do { if (!(InitArray)) { CheckFailed("wrong initalizer for intrinsic global variable"
, Init); return; } } while (false)
640 Init)do { if (!(InitArray)) { CheckFailed("wrong initalizer for intrinsic global variable"
, Init); return; } } while (false)
;
641 for (Value *Op : InitArray->operands()) {
642 Value *V = Op->stripPointerCastsNoFollowAliases();
643 Assert(isa<GlobalVariable>(V) || isa<Function>(V) ||do { if (!(isa<GlobalVariable>(V) || isa<Function>
(V) || isa<GlobalAlias>(V))) { CheckFailed("invalid llvm.used member"
, V); return; } } while (false)
644 isa<GlobalAlias>(V),do { if (!(isa<GlobalVariable>(V) || isa<Function>
(V) || isa<GlobalAlias>(V))) { CheckFailed("invalid llvm.used member"
, V); return; } } while (false)
645 "invalid llvm.used member", V)do { if (!(isa<GlobalVariable>(V) || isa<Function>
(V) || isa<GlobalAlias>(V))) { CheckFailed("invalid llvm.used member"
, V); return; } } while (false)
;
646 Assert(V->hasName(), "members of llvm.used must be named", V)do { if (!(V->hasName())) { CheckFailed("members of llvm.used must be named"
, V); return; } } while (false)
;
647 }
648 }
649 }
650 }
651
652 Assert(!GV.hasDLLImportStorageClass() ||do { if (!(!GV.hasDLLImportStorageClass() || (GV.isDeclaration
() && GV.hasExternalLinkage()) || GV.hasAvailableExternallyLinkage
())) { CheckFailed("Global is marked as dllimport, but not external"
, &GV); return; } } while (false)
653 (GV.isDeclaration() && GV.hasExternalLinkage()) ||do { if (!(!GV.hasDLLImportStorageClass() || (GV.isDeclaration
() && GV.hasExternalLinkage()) || GV.hasAvailableExternallyLinkage
())) { CheckFailed("Global is marked as dllimport, but not external"
, &GV); return; } } while (false)
654 GV.hasAvailableExternallyLinkage(),do { if (!(!GV.hasDLLImportStorageClass() || (GV.isDeclaration
() && GV.hasExternalLinkage()) || GV.hasAvailableExternallyLinkage
())) { CheckFailed("Global is marked as dllimport, but not external"
, &GV); return; } } while (false)
655 "Global is marked as dllimport, but not external", &GV)do { if (!(!GV.hasDLLImportStorageClass() || (GV.isDeclaration
() && GV.hasExternalLinkage()) || GV.hasAvailableExternallyLinkage
())) { CheckFailed("Global is marked as dllimport, but not external"
, &GV); return; } } while (false)
;
656
657 // Visit any debug info attachments.
658 SmallVector<MDNode *, 1> MDs;
659 GV.getMetadata(LLVMContext::MD_dbg, MDs);
660 for (auto *MD : MDs) {
661 if (auto *GVE = dyn_cast<DIGlobalVariableExpression>(MD))
662 visitDIGlobalVariableExpression(*GVE);
663 else
664 AssertDI(false, "!dbg attachment of global variable must be a "do { if (!(false)) { DebugInfoCheckFailed("!dbg attachment of global variable must be a "
"DIGlobalVariableExpression"); return; } } while (false)
665 "DIGlobalVariableExpression")do { if (!(false)) { DebugInfoCheckFailed("!dbg attachment of global variable must be a "
"DIGlobalVariableExpression"); return; } } while (false)
;
666 }
667
668 if (!GV.hasInitializer()) {
669 visitGlobalValue(GV);
670 return;
671 }
672
673 // Walk any aggregate initializers looking for bitcasts between address spaces
674 visitConstantExprsRecursively(GV.getInitializer());
675
676 visitGlobalValue(GV);
677}
678
679void Verifier::visitAliaseeSubExpr(const GlobalAlias &GA, const Constant &C) {
680 SmallPtrSet<const GlobalAlias*, 4> Visited;
681 Visited.insert(&GA);
682 visitAliaseeSubExpr(Visited, GA, C);
683}
684
685void Verifier::visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias*> &Visited,
686 const GlobalAlias &GA, const Constant &C) {
687 if (const auto *GV = dyn_cast<GlobalValue>(&C)) {
688 Assert(!GV->isDeclarationForLinker(), "Alias must point to a definition",do { if (!(!GV->isDeclarationForLinker())) { CheckFailed("Alias must point to a definition"
, &GA); return; } } while (false)
689 &GA)do { if (!(!GV->isDeclarationForLinker())) { CheckFailed("Alias must point to a definition"
, &GA); return; } } while (false)
;
690
691 if (const auto *GA2 = dyn_cast<GlobalAlias>(GV)) {
692 Assert(Visited.insert(GA2).second, "Aliases cannot form a cycle", &GA)do { if (!(Visited.insert(GA2).second)) { CheckFailed("Aliases cannot form a cycle"
, &GA); return; } } while (false)
;
693
694 Assert(!GA2->isInterposable(), "Alias cannot point to an interposable alias",do { if (!(!GA2->isInterposable())) { CheckFailed("Alias cannot point to an interposable alias"
, &GA); return; } } while (false)
695 &GA)do { if (!(!GA2->isInterposable())) { CheckFailed("Alias cannot point to an interposable alias"
, &GA); return; } } while (false)
;
696 } else {
697 // Only continue verifying subexpressions of GlobalAliases.
698 // Do not recurse into global initializers.
699 return;
700 }
701 }
702
703 if (const auto *CE = dyn_cast<ConstantExpr>(&C))
704 visitConstantExprsRecursively(CE);
705
706 for (const Use &U : C.operands()) {
707 Value *V = &*U;
708 if (const auto *GA2 = dyn_cast<GlobalAlias>(V))
709 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
710 else if (const auto *C2 = dyn_cast<Constant>(V))
711 visitAliaseeSubExpr(Visited, GA, *C2);
712 }
713}
714
715void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
716 Assert(GlobalAlias::isValidLinkage(GA.getLinkage()),do { if (!(GlobalAlias::isValidLinkage(GA.getLinkage()))) { CheckFailed
("Alias should have private, internal, linkonce, weak, linkonce_odr, "
"weak_odr, or external linkage!", &GA); return; } } while
(false)
717 "Alias should have private, internal, linkonce, weak, linkonce_odr, "do { if (!(GlobalAlias::isValidLinkage(GA.getLinkage()))) { CheckFailed
("Alias should have private, internal, linkonce, weak, linkonce_odr, "
"weak_odr, or external linkage!", &GA); return; } } while
(false)
718 "weak_odr, or external linkage!",do { if (!(GlobalAlias::isValidLinkage(GA.getLinkage()))) { CheckFailed
("Alias should have private, internal, linkonce, weak, linkonce_odr, "
"weak_odr, or external linkage!", &GA); return; } } while
(false)
719 &GA)do { if (!(GlobalAlias::isValidLinkage(GA.getLinkage()))) { CheckFailed
("Alias should have private, internal, linkonce, weak, linkonce_odr, "
"weak_odr, or external linkage!", &GA); return; } } while
(false)
;
720 const Constant *Aliasee = GA.getAliasee();
721 Assert(Aliasee, "Aliasee cannot be NULL!", &GA)do { if (!(Aliasee)) { CheckFailed("Aliasee cannot be NULL!",
&GA); return; } } while (false)
;
722 Assert(GA.getType() == Aliasee->getType(),do { if (!(GA.getType() == Aliasee->getType())) { CheckFailed
("Alias and aliasee types should match!", &GA); return; }
} while (false)
723 "Alias and aliasee types should match!", &GA)do { if (!(GA.getType() == Aliasee->getType())) { CheckFailed
("Alias and aliasee types should match!", &GA); return; }
} while (false)
;
724
725 Assert(isa<GlobalValue>(Aliasee) || isa<ConstantExpr>(Aliasee),do { if (!(isa<GlobalValue>(Aliasee) || isa<ConstantExpr
>(Aliasee))) { CheckFailed("Aliasee should be either GlobalValue or ConstantExpr"
, &GA); return; } } while (false)
726 "Aliasee should be either GlobalValue or ConstantExpr", &GA)do { if (!(isa<GlobalValue>(Aliasee) || isa<ConstantExpr
>(Aliasee))) { CheckFailed("Aliasee should be either GlobalValue or ConstantExpr"
, &GA); return; } } while (false)
;
727
728 visitAliaseeSubExpr(GA, *Aliasee);
729
730 visitGlobalValue(GA);
731}
732
733void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
734 // There used to be various other llvm.dbg.* nodes, but we don't support
735 // upgrading them and we want to reserve the namespace for future uses.
736 if (NMD.getName().startswith("llvm.dbg."))
737 AssertDI(NMD.getName() == "llvm.dbg.cu",do { if (!(NMD.getName() == "llvm.dbg.cu")) { DebugInfoCheckFailed
("unrecognized named metadata node in the llvm.dbg namespace"
, &NMD); return; } } while (false)
738 "unrecognized named metadata node in the llvm.dbg namespace",do { if (!(NMD.getName() == "llvm.dbg.cu")) { DebugInfoCheckFailed
("unrecognized named metadata node in the llvm.dbg namespace"
, &NMD); return; } } while (false)
739 &NMD)do { if (!(NMD.getName() == "llvm.dbg.cu")) { DebugInfoCheckFailed
("unrecognized named metadata node in the llvm.dbg namespace"
, &NMD); return; } } while (false)
;
740 for (const MDNode *MD : NMD.operands()) {
741 if (NMD.getName() == "llvm.dbg.cu")
742 AssertDI(MD && isa<DICompileUnit>(MD), "invalid compile unit", &NMD, MD)do { if (!(MD && isa<DICompileUnit>(MD))) { DebugInfoCheckFailed
("invalid compile unit", &NMD, MD); return; } } while (false
)
;
743
744 if (!MD)
745 continue;
746
747 visitMDNode(*MD);
748 }
749}
750
751void Verifier::visitMDNode(const MDNode &MD) {
752 // Only visit each node once. Metadata can be mutually recursive, so this
753 // avoids infinite recursion here, as well as being an optimization.
754 if (!MDNodes.insert(&MD).second)
755 return;
756
757 switch (MD.getMetadataID()) {
758 default:
759 llvm_unreachable("Invalid MDNode subclass")::llvm::llvm_unreachable_internal("Invalid MDNode subclass", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 759)
;
760 case Metadata::MDTupleKind:
761 break;
762#define HANDLE_SPECIALIZED_MDNODE_LEAF(CLASS) \
763 case Metadata::CLASS##Kind: \
764 visit##CLASS(cast<CLASS>(MD)); \
765 break;
766#include "llvm/IR/Metadata.def"
767 }
768
769 for (const Metadata *Op : MD.operands()) {
770 if (!Op)
771 continue;
772 Assert(!isa<LocalAsMetadata>(Op), "Invalid operand for global metadata!",do { if (!(!isa<LocalAsMetadata>(Op))) { CheckFailed("Invalid operand for global metadata!"
, &MD, Op); return; } } while (false)
773 &MD, Op)do { if (!(!isa<LocalAsMetadata>(Op))) { CheckFailed("Invalid operand for global metadata!"
, &MD, Op); return; } } while (false)
;
774 if (auto *N = dyn_cast<MDNode>(Op)) {
775 visitMDNode(*N);
776 continue;
777 }
778 if (auto *V = dyn_cast<ValueAsMetadata>(Op)) {
779 visitValueAsMetadata(*V, nullptr);
780 continue;
781 }
782 }
783
784 // Check these last, so we diagnose problems in operands first.
785 Assert(!MD.isTemporary(), "Expected no forward declarations!", &MD)do { if (!(!MD.isTemporary())) { CheckFailed("Expected no forward declarations!"
, &MD); return; } } while (false)
;
786 Assert(MD.isResolved(), "All nodes should be resolved!", &MD)do { if (!(MD.isResolved())) { CheckFailed("All nodes should be resolved!"
, &MD); return; } } while (false)
;
787}
788
789void Verifier::visitValueAsMetadata(const ValueAsMetadata &MD, Function *F) {
790 Assert(MD.getValue(), "Expected valid value", &MD)do { if (!(MD.getValue())) { CheckFailed("Expected valid value"
, &MD); return; } } while (false)
;
791 Assert(!MD.getValue()->getType()->isMetadataTy(),do { if (!(!MD.getValue()->getType()->isMetadataTy())) {
CheckFailed("Unexpected metadata round-trip through values",
&MD, MD.getValue()); return; } } while (false)
792 "Unexpected metadata round-trip through values", &MD, MD.getValue())do { if (!(!MD.getValue()->getType()->isMetadataTy())) {
CheckFailed("Unexpected metadata round-trip through values",
&MD, MD.getValue()); return; } } while (false)
;
793
794 auto *L = dyn_cast<LocalAsMetadata>(&MD);
795 if (!L)
796 return;
797
798 Assert(F, "function-local metadata used outside a function", L)do { if (!(F)) { CheckFailed("function-local metadata used outside a function"
, L); return; } } while (false)
;
799
800 // If this was an instruction, bb, or argument, verify that it is in the
801 // function that we expect.
802 Function *ActualF = nullptr;
803 if (Instruction *I = dyn_cast<Instruction>(L->getValue())) {
804 Assert(I->getParent(), "function-local metadata not in basic block", L, I)do { if (!(I->getParent())) { CheckFailed("function-local metadata not in basic block"
, L, I); return; } } while (false)
;
805 ActualF = I->getParent()->getParent();
806 } else if (BasicBlock *BB = dyn_cast<BasicBlock>(L->getValue()))
807 ActualF = BB->getParent();
808 else if (Argument *A = dyn_cast<Argument>(L->getValue()))
809 ActualF = A->getParent();
810 assert(ActualF && "Unimplemented function local metadata case!")((ActualF && "Unimplemented function local metadata case!"
) ? static_cast<void> (0) : __assert_fail ("ActualF && \"Unimplemented function local metadata case!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 810, __PRETTY_FUNCTION__))
;
811
812 Assert(ActualF == F, "function-local metadata used in wrong function", L)do { if (!(ActualF == F)) { CheckFailed("function-local metadata used in wrong function"
, L); return; } } while (false)
;
813}
814
815void Verifier::visitMetadataAsValue(const MetadataAsValue &MDV, Function *F) {
816 Metadata *MD = MDV.getMetadata();
817 if (auto *N = dyn_cast<MDNode>(MD)) {
818 visitMDNode(*N);
819 return;
820 }
821
822 // Only visit each node once. Metadata can be mutually recursive, so this
823 // avoids infinite recursion here, as well as being an optimization.
824 if (!MDNodes.insert(MD).second)
825 return;
826
827 if (auto *V = dyn_cast<ValueAsMetadata>(MD))
828 visitValueAsMetadata(*V, F);
829}
830
831static bool isType(const Metadata *MD) { return !MD || isa<DIType>(MD); }
832static bool isScope(const Metadata *MD) { return !MD || isa<DIScope>(MD); }
833static bool isDINode(const Metadata *MD) { return !MD || isa<DINode>(MD); }
834
835template <class Ty>
836static bool isValidMetadataArrayImpl(const MDTuple &N, bool AllowNull) {
837 for (Metadata *MD : N.operands()) {
838 if (MD) {
839 if (!isa<Ty>(MD))
840 return false;
841 } else {
842 if (!AllowNull)
843 return false;
844 }
845 }
846 return true;
847}
848
849template <class Ty> static bool isValidMetadataArray(const MDTuple &N) {
850 return isValidMetadataArrayImpl<Ty>(N, /* AllowNull */ false);
851}
852
853template <class Ty> static bool isValidMetadataNullArray(const MDTuple &N) {
854 return isValidMetadataArrayImpl<Ty>(N, /* AllowNull */ true);
855}
856
857void Verifier::visitDILocation(const DILocation &N) {
858 AssertDI(N.getRawScope() && isa<DILocalScope>(N.getRawScope()),do { if (!(N.getRawScope() && isa<DILocalScope>
(N.getRawScope()))) { DebugInfoCheckFailed("location requires a valid scope"
, &N, N.getRawScope()); return; } } while (false)
859 "location requires a valid scope", &N, N.getRawScope())do { if (!(N.getRawScope() && isa<DILocalScope>
(N.getRawScope()))) { DebugInfoCheckFailed("location requires a valid scope"
, &N, N.getRawScope()); return; } } while (false)
;
860 if (auto *IA = N.getRawInlinedAt())
861 AssertDI(isa<DILocation>(IA), "inlined-at should be a location", &N, IA)do { if (!(isa<DILocation>(IA))) { DebugInfoCheckFailed
("inlined-at should be a location", &N, IA); return; } } while
(false)
;
862}
863
864void Verifier::visitGenericDINode(const GenericDINode &N) {
865 AssertDI(N.getTag(), "invalid tag", &N)do { if (!(N.getTag())) { DebugInfoCheckFailed("invalid tag",
&N); return; } } while (false)
;
866}
867
868void Verifier::visitDIScope(const DIScope &N) {
869 if (auto *F = N.getRawFile())
870 AssertDI(isa<DIFile>(F), "invalid file", &N, F)do { if (!(isa<DIFile>(F))) { DebugInfoCheckFailed("invalid file"
, &N, F); return; } } while (false)
;
871}
872
873void Verifier::visitDISubrange(const DISubrange &N) {
874 AssertDI(N.getTag() == dwarf::DW_TAG_subrange_type, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_subrange_type)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
875 AssertDI(N.getCount() >= -1, "invalid subrange count", &N)do { if (!(N.getCount() >= -1)) { DebugInfoCheckFailed("invalid subrange count"
, &N); return; } } while (false)
;
876}
877
878void Verifier::visitDIEnumerator(const DIEnumerator &N) {
879 AssertDI(N.getTag() == dwarf::DW_TAG_enumerator, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_enumerator)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
880}
881
882void Verifier::visitDIBasicType(const DIBasicType &N) {
883 AssertDI(N.getTag() == dwarf::DW_TAG_base_type ||do { if (!(N.getTag() == dwarf::DW_TAG_base_type || N.getTag(
) == dwarf::DW_TAG_unspecified_type)) { DebugInfoCheckFailed(
"invalid tag", &N); return; } } while (false)
884 N.getTag() == dwarf::DW_TAG_unspecified_type,do { if (!(N.getTag() == dwarf::DW_TAG_base_type || N.getTag(
) == dwarf::DW_TAG_unspecified_type)) { DebugInfoCheckFailed(
"invalid tag", &N); return; } } while (false)
885 "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_base_type || N.getTag(
) == dwarf::DW_TAG_unspecified_type)) { DebugInfoCheckFailed(
"invalid tag", &N); return; } } while (false)
;
886}
887
888void Verifier::visitDIDerivedType(const DIDerivedType &N) {
889 // Common scope checks.
890 visitDIScope(N);
891
892 AssertDI(N.getTag() == dwarf::DW_TAG_typedef ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
893 N.getTag() == dwarf::DW_TAG_pointer_type ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
894 N.getTag() == dwarf::DW_TAG_ptr_to_member_type ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
895 N.getTag() == dwarf::DW_TAG_reference_type ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
896 N.getTag() == dwarf::DW_TAG_rvalue_reference_type ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
897 N.getTag() == dwarf::DW_TAG_const_type ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
898 N.getTag() == dwarf::DW_TAG_volatile_type ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
899 N.getTag() == dwarf::DW_TAG_restrict_type ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
900 N.getTag() == dwarf::DW_TAG_atomic_type ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
901 N.getTag() == dwarf::DW_TAG_member ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
902 N.getTag() == dwarf::DW_TAG_inheritance ||do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
903 N.getTag() == dwarf::DW_TAG_friend,do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
904 "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_typedef || N.getTag() ==
dwarf::DW_TAG_pointer_type || N.getTag() == dwarf::DW_TAG_ptr_to_member_type
|| N.getTag() == dwarf::DW_TAG_reference_type || N.getTag() ==
dwarf::DW_TAG_rvalue_reference_type || N.getTag() == dwarf::
DW_TAG_const_type || N.getTag() == dwarf::DW_TAG_volatile_type
|| N.getTag() == dwarf::DW_TAG_restrict_type || N.getTag() ==
dwarf::DW_TAG_atomic_type || N.getTag() == dwarf::DW_TAG_member
|| N.getTag() == dwarf::DW_TAG_inheritance || N.getTag() == dwarf
::DW_TAG_friend)) { DebugInfoCheckFailed("invalid tag", &
N); return; } } while (false)
;
905 if (N.getTag() == dwarf::DW_TAG_ptr_to_member_type) {
906 AssertDI(isType(N.getRawExtraData()), "invalid pointer to member type", &N,do { if (!(isType(N.getRawExtraData()))) { DebugInfoCheckFailed
("invalid pointer to member type", &N, N.getRawExtraData(
)); return; } } while (false)
907 N.getRawExtraData())do { if (!(isType(N.getRawExtraData()))) { DebugInfoCheckFailed
("invalid pointer to member type", &N, N.getRawExtraData(
)); return; } } while (false)
;
908 }
909
910 AssertDI(isScope(N.getRawScope()), "invalid scope", &N, N.getRawScope())do { if (!(isScope(N.getRawScope()))) { DebugInfoCheckFailed(
"invalid scope", &N, N.getRawScope()); return; } } while (
false)
;
911 AssertDI(isType(N.getRawBaseType()), "invalid base type", &N,do { if (!(isType(N.getRawBaseType()))) { DebugInfoCheckFailed
("invalid base type", &N, N.getRawBaseType()); return; } }
while (false)
912 N.getRawBaseType())do { if (!(isType(N.getRawBaseType()))) { DebugInfoCheckFailed
("invalid base type", &N, N.getRawBaseType()); return; } }
while (false)
;
913
914 if (N.getDWARFAddressSpace()) {
915 AssertDI(N.getTag() == dwarf::DW_TAG_pointer_type ||do { if (!(N.getTag() == dwarf::DW_TAG_pointer_type || N.getTag
() == dwarf::DW_TAG_reference_type)) { DebugInfoCheckFailed("DWARF address space only applies to pointer or reference types"
, &N); return; } } while (false)
916 N.getTag() == dwarf::DW_TAG_reference_type,do { if (!(N.getTag() == dwarf::DW_TAG_pointer_type || N.getTag
() == dwarf::DW_TAG_reference_type)) { DebugInfoCheckFailed("DWARF address space only applies to pointer or reference types"
, &N); return; } } while (false)
917 "DWARF address space only applies to pointer or reference types",do { if (!(N.getTag() == dwarf::DW_TAG_pointer_type || N.getTag
() == dwarf::DW_TAG_reference_type)) { DebugInfoCheckFailed("DWARF address space only applies to pointer or reference types"
, &N); return; } } while (false)
918 &N)do { if (!(N.getTag() == dwarf::DW_TAG_pointer_type || N.getTag
() == dwarf::DW_TAG_reference_type)) { DebugInfoCheckFailed("DWARF address space only applies to pointer or reference types"
, &N); return; } } while (false)
;
919 }
920}
921
922static bool hasConflictingReferenceFlags(unsigned Flags) {
923 return (Flags & DINode::FlagLValueReference) &&
924 (Flags & DINode::FlagRValueReference);
925}
926
927void Verifier::visitTemplateParams(const MDNode &N, const Metadata &RawParams) {
928 auto *Params = dyn_cast<MDTuple>(&RawParams);
929 AssertDI(Params, "invalid template params", &N, &RawParams)do { if (!(Params)) { DebugInfoCheckFailed("invalid template params"
, &N, &RawParams); return; } } while (false)
;
930 for (Metadata *Op : Params->operands()) {
931 AssertDI(Op && isa<DITemplateParameter>(Op), "invalid template parameter",do { if (!(Op && isa<DITemplateParameter>(Op)))
{ DebugInfoCheckFailed("invalid template parameter", &N,
Params, Op); return; } } while (false)
932 &N, Params, Op)do { if (!(Op && isa<DITemplateParameter>(Op)))
{ DebugInfoCheckFailed("invalid template parameter", &N,
Params, Op); return; } } while (false)
;
933 }
934}
935
936void Verifier::visitDICompositeType(const DICompositeType &N) {
937 // Common scope checks.
938 visitDIScope(N);
939
940 AssertDI(N.getTag() == dwarf::DW_TAG_array_type ||do { if (!(N.getTag() == dwarf::DW_TAG_array_type || N.getTag
() == dwarf::DW_TAG_structure_type || N.getTag() == dwarf::DW_TAG_union_type
|| N.getTag() == dwarf::DW_TAG_enumeration_type || N.getTag(
) == dwarf::DW_TAG_class_type)) { DebugInfoCheckFailed("invalid tag"
, &N); return; } } while (false)
941 N.getTag() == dwarf::DW_TAG_structure_type ||do { if (!(N.getTag() == dwarf::DW_TAG_array_type || N.getTag
() == dwarf::DW_TAG_structure_type || N.getTag() == dwarf::DW_TAG_union_type
|| N.getTag() == dwarf::DW_TAG_enumeration_type || N.getTag(
) == dwarf::DW_TAG_class_type)) { DebugInfoCheckFailed("invalid tag"
, &N); return; } } while (false)
942 N.getTag() == dwarf::DW_TAG_union_type ||do { if (!(N.getTag() == dwarf::DW_TAG_array_type || N.getTag
() == dwarf::DW_TAG_structure_type || N.getTag() == dwarf::DW_TAG_union_type
|| N.getTag() == dwarf::DW_TAG_enumeration_type || N.getTag(
) == dwarf::DW_TAG_class_type)) { DebugInfoCheckFailed("invalid tag"
, &N); return; } } while (false)
943 N.getTag() == dwarf::DW_TAG_enumeration_type ||do { if (!(N.getTag() == dwarf::DW_TAG_array_type || N.getTag
() == dwarf::DW_TAG_structure_type || N.getTag() == dwarf::DW_TAG_union_type
|| N.getTag() == dwarf::DW_TAG_enumeration_type || N.getTag(
) == dwarf::DW_TAG_class_type)) { DebugInfoCheckFailed("invalid tag"
, &N); return; } } while (false)
944 N.getTag() == dwarf::DW_TAG_class_type,do { if (!(N.getTag() == dwarf::DW_TAG_array_type || N.getTag
() == dwarf::DW_TAG_structure_type || N.getTag() == dwarf::DW_TAG_union_type
|| N.getTag() == dwarf::DW_TAG_enumeration_type || N.getTag(
) == dwarf::DW_TAG_class_type)) { DebugInfoCheckFailed("invalid tag"
, &N); return; } } while (false)
945 "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_array_type || N.getTag
() == dwarf::DW_TAG_structure_type || N.getTag() == dwarf::DW_TAG_union_type
|| N.getTag() == dwarf::DW_TAG_enumeration_type || N.getTag(
) == dwarf::DW_TAG_class_type)) { DebugInfoCheckFailed("invalid tag"
, &N); return; } } while (false)
;
946
947 AssertDI(isScope(N.getRawScope()), "invalid scope", &N, N.getRawScope())do { if (!(isScope(N.getRawScope()))) { DebugInfoCheckFailed(
"invalid scope", &N, N.getRawScope()); return; } } while (
false)
;
948 AssertDI(isType(N.getRawBaseType()), "invalid base type", &N,do { if (!(isType(N.getRawBaseType()))) { DebugInfoCheckFailed
("invalid base type", &N, N.getRawBaseType()); return; } }
while (false)
949 N.getRawBaseType())do { if (!(isType(N.getRawBaseType()))) { DebugInfoCheckFailed
("invalid base type", &N, N.getRawBaseType()); return; } }
while (false)
;
950
951 AssertDI(!N.getRawElements() || isa<MDTuple>(N.getRawElements()),do { if (!(!N.getRawElements() || isa<MDTuple>(N.getRawElements
()))) { DebugInfoCheckFailed("invalid composite elements", &
N, N.getRawElements()); return; } } while (false)
952 "invalid composite elements", &N, N.getRawElements())do { if (!(!N.getRawElements() || isa<MDTuple>(N.getRawElements
()))) { DebugInfoCheckFailed("invalid composite elements", &
N, N.getRawElements()); return; } } while (false)
;
953 AssertDI(isType(N.getRawVTableHolder()), "invalid vtable holder", &N,do { if (!(isType(N.getRawVTableHolder()))) { DebugInfoCheckFailed
("invalid vtable holder", &N, N.getRawVTableHolder()); return
; } } while (false)
954 N.getRawVTableHolder())do { if (!(isType(N.getRawVTableHolder()))) { DebugInfoCheckFailed
("invalid vtable holder", &N, N.getRawVTableHolder()); return
; } } while (false)
;
955 AssertDI(!hasConflictingReferenceFlags(N.getFlags()),do { if (!(!hasConflictingReferenceFlags(N.getFlags()))) { DebugInfoCheckFailed
("invalid reference flags", &N); return; } } while (false
)
956 "invalid reference flags", &N)do { if (!(!hasConflictingReferenceFlags(N.getFlags()))) { DebugInfoCheckFailed
("invalid reference flags", &N); return; } } while (false
)
;
957 if (auto *Params = N.getRawTemplateParams())
958 visitTemplateParams(N, *Params);
959
960 if (N.getTag() == dwarf::DW_TAG_class_type ||
961 N.getTag() == dwarf::DW_TAG_union_type) {
962 AssertDI(N.getFile() && !N.getFile()->getFilename().empty(),do { if (!(N.getFile() && !N.getFile()->getFilename
().empty())) { DebugInfoCheckFailed("class/union requires a filename"
, &N, N.getFile()); return; } } while (false)
963 "class/union requires a filename", &N, N.getFile())do { if (!(N.getFile() && !N.getFile()->getFilename
().empty())) { DebugInfoCheckFailed("class/union requires a filename"
, &N, N.getFile()); return; } } while (false)
;
964 }
965}
966
967void Verifier::visitDISubroutineType(const DISubroutineType &N) {
968 AssertDI(N.getTag() == dwarf::DW_TAG_subroutine_type, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_subroutine_type)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
969 if (auto *Types = N.getRawTypeArray()) {
970 AssertDI(isa<MDTuple>(Types), "invalid composite elements", &N, Types)do { if (!(isa<MDTuple>(Types))) { DebugInfoCheckFailed
("invalid composite elements", &N, Types); return; } } while
(false)
;
971 for (Metadata *Ty : N.getTypeArray()->operands()) {
972 AssertDI(isType(Ty), "invalid subroutine type ref", &N, Types, Ty)do { if (!(isType(Ty))) { DebugInfoCheckFailed("invalid subroutine type ref"
, &N, Types, Ty); return; } } while (false)
;
973 }
974 }
975 AssertDI(!hasConflictingReferenceFlags(N.getFlags()),do { if (!(!hasConflictingReferenceFlags(N.getFlags()))) { DebugInfoCheckFailed
("invalid reference flags", &N); return; } } while (false
)
976 "invalid reference flags", &N)do { if (!(!hasConflictingReferenceFlags(N.getFlags()))) { DebugInfoCheckFailed
("invalid reference flags", &N); return; } } while (false
)
;
977}
978
979void Verifier::visitDIFile(const DIFile &N) {
980 AssertDI(N.getTag() == dwarf::DW_TAG_file_type, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_file_type)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
981 AssertDI((N.getChecksumKind() != DIFile::CSK_None ||do { if (!((N.getChecksumKind() != DIFile::CSK_None || N.getChecksum
().empty()))) { DebugInfoCheckFailed("invalid checksum kind",
&N); return; } } while (false)
982 N.getChecksum().empty()), "invalid checksum kind", &N)do { if (!((N.getChecksumKind() != DIFile::CSK_None || N.getChecksum
().empty()))) { DebugInfoCheckFailed("invalid checksum kind",
&N); return; } } while (false)
;
983}
984
985void Verifier::visitDICompileUnit(const DICompileUnit &N) {
986 AssertDI(N.isDistinct(), "compile units must be distinct", &N)do { if (!(N.isDistinct())) { DebugInfoCheckFailed("compile units must be distinct"
, &N); return; } } while (false)
;
987 AssertDI(N.getTag() == dwarf::DW_TAG_compile_unit, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_compile_unit)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
988
989 // Don't bother verifying the compilation directory or producer string
990 // as those could be empty.
991 AssertDI(N.getRawFile() && isa<DIFile>(N.getRawFile()), "invalid file", &N,do { if (!(N.getRawFile() && isa<DIFile>(N.getRawFile
()))) { DebugInfoCheckFailed("invalid file", &N, N.getRawFile
()); return; } } while (false)
992 N.getRawFile())do { if (!(N.getRawFile() && isa<DIFile>(N.getRawFile
()))) { DebugInfoCheckFailed("invalid file", &N, N.getRawFile
()); return; } } while (false)
;
993 AssertDI(!N.getFile()->getFilename().empty(), "invalid filename", &N,do { if (!(!N.getFile()->getFilename().empty())) { DebugInfoCheckFailed
("invalid filename", &N, N.getFile()); return; } } while (
false)
994 N.getFile())do { if (!(!N.getFile()->getFilename().empty())) { DebugInfoCheckFailed
("invalid filename", &N, N.getFile()); return; } } while (
false)
;
995
996 AssertDI((N.getEmissionKind() <= DICompileUnit::LastEmissionKind),do { if (!((N.getEmissionKind() <= DICompileUnit::LastEmissionKind
))) { DebugInfoCheckFailed("invalid emission kind", &N); return
; } } while (false)
997 "invalid emission kind", &N)do { if (!((N.getEmissionKind() <= DICompileUnit::LastEmissionKind
))) { DebugInfoCheckFailed("invalid emission kind", &N); return
; } } while (false)
;
998
999 if (auto *Array = N.getRawEnumTypes()) {
1000 AssertDI(isa<MDTuple>(Array), "invalid enum list", &N, Array)do { if (!(isa<MDTuple>(Array))) { DebugInfoCheckFailed
("invalid enum list", &N, Array); return; } } while (false
)
;
1001 for (Metadata *Op : N.getEnumTypes()->operands()) {
1002 auto *Enum = dyn_cast_or_null<DICompositeType>(Op);
1003 AssertDI(Enum && Enum->getTag() == dwarf::DW_TAG_enumeration_type,do { if (!(Enum && Enum->getTag() == dwarf::DW_TAG_enumeration_type
)) { DebugInfoCheckFailed("invalid enum type", &N, N.getEnumTypes
(), Op); return; } } while (false)
1004 "invalid enum type", &N, N.getEnumTypes(), Op)do { if (!(Enum && Enum->getTag() == dwarf::DW_TAG_enumeration_type
)) { DebugInfoCheckFailed("invalid enum type", &N, N.getEnumTypes
(), Op); return; } } while (false)
;
1005 }
1006 }
1007 if (auto *Array = N.getRawRetainedTypes()) {
1008 AssertDI(isa<MDTuple>(Array), "invalid retained type list", &N, Array)do { if (!(isa<MDTuple>(Array))) { DebugInfoCheckFailed
("invalid retained type list", &N, Array); return; } } while
(false)
;
1009 for (Metadata *Op : N.getRetainedTypes()->operands()) {
1010 AssertDI(Op && (isa<DIType>(Op) ||do { if (!(Op && (isa<DIType>(Op) || (isa<DISubprogram
>(Op) && !cast<DISubprogram>(Op)->isDefinition
())))) { DebugInfoCheckFailed("invalid retained type", &N
, Op); return; } } while (false)
1011 (isa<DISubprogram>(Op) &&do { if (!(Op && (isa<DIType>(Op) || (isa<DISubprogram
>(Op) && !cast<DISubprogram>(Op)->isDefinition
())))) { DebugInfoCheckFailed("invalid retained type", &N
, Op); return; } } while (false)
1012 !cast<DISubprogram>(Op)->isDefinition())),do { if (!(Op && (isa<DIType>(Op) || (isa<DISubprogram
>(Op) && !cast<DISubprogram>(Op)->isDefinition
())))) { DebugInfoCheckFailed("invalid retained type", &N
, Op); return; } } while (false)
1013 "invalid retained type", &N, Op)do { if (!(Op && (isa<DIType>(Op) || (isa<DISubprogram
>(Op) && !cast<DISubprogram>(Op)->isDefinition
())))) { DebugInfoCheckFailed("invalid retained type", &N
, Op); return; } } while (false)
;
1014 }
1015 }
1016 if (auto *Array = N.getRawGlobalVariables()) {
1017 AssertDI(isa<MDTuple>(Array), "invalid global variable list", &N, Array)do { if (!(isa<MDTuple>(Array))) { DebugInfoCheckFailed
("invalid global variable list", &N, Array); return; } } while
(false)
;
1018 for (Metadata *Op : N.getGlobalVariables()->operands()) {
1019 AssertDI(Op && (isa<DIGlobalVariableExpression>(Op)),do { if (!(Op && (isa<DIGlobalVariableExpression>
(Op)))) { DebugInfoCheckFailed("invalid global variable ref",
&N, Op); return; } } while (false)
1020 "invalid global variable ref", &N, Op)do { if (!(Op && (isa<DIGlobalVariableExpression>
(Op)))) { DebugInfoCheckFailed("invalid global variable ref",
&N, Op); return; } } while (false)
;
1021 }
1022 }
1023 if (auto *Array = N.getRawImportedEntities()) {
1024 AssertDI(isa<MDTuple>(Array), "invalid imported entity list", &N, Array)do { if (!(isa<MDTuple>(Array))) { DebugInfoCheckFailed
("invalid imported entity list", &N, Array); return; } } while
(false)
;
1025 for (Metadata *Op : N.getImportedEntities()->operands()) {
1026 AssertDI(Op && isa<DIImportedEntity>(Op), "invalid imported entity ref",do { if (!(Op && isa<DIImportedEntity>(Op))) { DebugInfoCheckFailed
("invalid imported entity ref", &N, Op); return; } } while
(false)
1027 &N, Op)do { if (!(Op && isa<DIImportedEntity>(Op))) { DebugInfoCheckFailed
("invalid imported entity ref", &N, Op); return; } } while
(false)
;
1028 }
1029 }
1030 if (auto *Array = N.getRawMacros()) {
1031 AssertDI(isa<MDTuple>(Array), "invalid macro list", &N, Array)do { if (!(isa<MDTuple>(Array))) { DebugInfoCheckFailed
("invalid macro list", &N, Array); return; } } while (false
)
;
1032 for (Metadata *Op : N.getMacros()->operands()) {
1033 AssertDI(Op && isa<DIMacroNode>(Op), "invalid macro ref", &N, Op)do { if (!(Op && isa<DIMacroNode>(Op))) { DebugInfoCheckFailed
("invalid macro ref", &N, Op); return; } } while (false)
;
1034 }
1035 }
1036 CUVisited.insert(&N);
1037}
1038
1039void Verifier::visitDISubprogram(const DISubprogram &N) {
1040 AssertDI(N.getTag() == dwarf::DW_TAG_subprogram, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_subprogram)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
1041 AssertDI(isScope(N.getRawScope()), "invalid scope", &N, N.getRawScope())do { if (!(isScope(N.getRawScope()))) { DebugInfoCheckFailed(
"invalid scope", &N, N.getRawScope()); return; } } while (
false)
;
1042 if (auto *F = N.getRawFile())
1043 AssertDI(isa<DIFile>(F), "invalid file", &N, F)do { if (!(isa<DIFile>(F))) { DebugInfoCheckFailed("invalid file"
, &N, F); return; } } while (false)
;
1044 else
1045 AssertDI(N.getLine() == 0, "line specified with no file", &N, N.getLine())do { if (!(N.getLine() == 0)) { DebugInfoCheckFailed("line specified with no file"
, &N, N.getLine()); return; } } while (false)
;
1046 if (auto *T = N.getRawType())
1047 AssertDI(isa<DISubroutineType>(T), "invalid subroutine type", &N, T)do { if (!(isa<DISubroutineType>(T))) { DebugInfoCheckFailed
("invalid subroutine type", &N, T); return; } } while (false
)
;
1048 AssertDI(isType(N.getRawContainingType()), "invalid containing type", &N,do { if (!(isType(N.getRawContainingType()))) { DebugInfoCheckFailed
("invalid containing type", &N, N.getRawContainingType())
; return; } } while (false)
1049 N.getRawContainingType())do { if (!(isType(N.getRawContainingType()))) { DebugInfoCheckFailed
("invalid containing type", &N, N.getRawContainingType())
; return; } } while (false)
;
1050 if (auto *Params = N.getRawTemplateParams())
1051 visitTemplateParams(N, *Params);
1052 if (auto *S = N.getRawDeclaration())
1053 AssertDI(isa<DISubprogram>(S) && !cast<DISubprogram>(S)->isDefinition(),do { if (!(isa<DISubprogram>(S) && !cast<DISubprogram
>(S)->isDefinition())) { DebugInfoCheckFailed("invalid subprogram declaration"
, &N, S); return; } } while (false)
1054 "invalid subprogram declaration", &N, S)do { if (!(isa<DISubprogram>(S) && !cast<DISubprogram
>(S)->isDefinition())) { DebugInfoCheckFailed("invalid subprogram declaration"
, &N, S); return; } } while (false)
;
1055 if (auto *RawVars = N.getRawVariables()) {
1056 auto *Vars = dyn_cast<MDTuple>(RawVars);
1057 AssertDI(Vars, "invalid variable list", &N, RawVars)do { if (!(Vars)) { DebugInfoCheckFailed("invalid variable list"
, &N, RawVars); return; } } while (false)
;
1058 for (Metadata *Op : Vars->operands()) {
1059 AssertDI(Op && isa<DILocalVariable>(Op), "invalid local variable", &N,do { if (!(Op && isa<DILocalVariable>(Op))) { DebugInfoCheckFailed
("invalid local variable", &N, Vars, Op); return; } } while
(false)
1060 Vars, Op)do { if (!(Op && isa<DILocalVariable>(Op))) { DebugInfoCheckFailed
("invalid local variable", &N, Vars, Op); return; } } while
(false)
;
1061 }
1062 }
1063 AssertDI(!hasConflictingReferenceFlags(N.getFlags()),do { if (!(!hasConflictingReferenceFlags(N.getFlags()))) { DebugInfoCheckFailed
("invalid reference flags", &N); return; } } while (false
)
1064 "invalid reference flags", &N)do { if (!(!hasConflictingReferenceFlags(N.getFlags()))) { DebugInfoCheckFailed
("invalid reference flags", &N); return; } } while (false
)
;
1065
1066 auto *Unit = N.getRawUnit();
1067 if (N.isDefinition()) {
1068 // Subprogram definitions (not part of the type hierarchy).
1069 AssertDI(N.isDistinct(), "subprogram definitions must be distinct", &N)do { if (!(N.isDistinct())) { DebugInfoCheckFailed("subprogram definitions must be distinct"
, &N); return; } } while (false)
;
1070 AssertDI(Unit, "subprogram definitions must have a compile unit", &N)do { if (!(Unit)) { DebugInfoCheckFailed("subprogram definitions must have a compile unit"
, &N); return; } } while (false)
;
1071 AssertDI(isa<DICompileUnit>(Unit), "invalid unit type", &N, Unit)do { if (!(isa<DICompileUnit>(Unit))) { DebugInfoCheckFailed
("invalid unit type", &N, Unit); return; } } while (false
)
;
1072 } else {
1073 // Subprogram declarations (part of the type hierarchy).
1074 AssertDI(!Unit, "subprogram declarations must not have a compile unit", &N)do { if (!(!Unit)) { DebugInfoCheckFailed("subprogram declarations must not have a compile unit"
, &N); return; } } while (false)
;
1075 }
1076}
1077
1078void Verifier::visitDILexicalBlockBase(const DILexicalBlockBase &N) {
1079 AssertDI(N.getTag() == dwarf::DW_TAG_lexical_block, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_lexical_block)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
1080 AssertDI(N.getRawScope() && isa<DILocalScope>(N.getRawScope()),do { if (!(N.getRawScope() && isa<DILocalScope>
(N.getRawScope()))) { DebugInfoCheckFailed("invalid local scope"
, &N, N.getRawScope()); return; } } while (false)
1081 "invalid local scope", &N, N.getRawScope())do { if (!(N.getRawScope() && isa<DILocalScope>
(N.getRawScope()))) { DebugInfoCheckFailed("invalid local scope"
, &N, N.getRawScope()); return; } } while (false)
;
1082}
1083
1084void Verifier::visitDILexicalBlock(const DILexicalBlock &N) {
1085 visitDILexicalBlockBase(N);
1086
1087 AssertDI(N.getLine() || !N.getColumn(),do { if (!(N.getLine() || !N.getColumn())) { DebugInfoCheckFailed
("cannot have column info without line info", &N); return
; } } while (false)
1088 "cannot have column info without line info", &N)do { if (!(N.getLine() || !N.getColumn())) { DebugInfoCheckFailed
("cannot have column info without line info", &N); return
; } } while (false)
;
1089}
1090
1091void Verifier::visitDILexicalBlockFile(const DILexicalBlockFile &N) {
1092 visitDILexicalBlockBase(N);
1093}
1094
1095void Verifier::visitDINamespace(const DINamespace &N) {
1096 AssertDI(N.getTag() == dwarf::DW_TAG_namespace, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_namespace)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
1097 if (auto *S = N.getRawScope())
1098 AssertDI(isa<DIScope>(S), "invalid scope ref", &N, S)do { if (!(isa<DIScope>(S))) { DebugInfoCheckFailed("invalid scope ref"
, &N, S); return; } } while (false)
;
1099}
1100
1101void Verifier::visitDIMacro(const DIMacro &N) {
1102 AssertDI(N.getMacinfoType() == dwarf::DW_MACINFO_define ||do { if (!(N.getMacinfoType() == dwarf::DW_MACINFO_define || N
.getMacinfoType() == dwarf::DW_MACINFO_undef)) { DebugInfoCheckFailed
("invalid macinfo type", &N); return; } } while (false)
1103 N.getMacinfoType() == dwarf::DW_MACINFO_undef,do { if (!(N.getMacinfoType() == dwarf::DW_MACINFO_define || N
.getMacinfoType() == dwarf::DW_MACINFO_undef)) { DebugInfoCheckFailed
("invalid macinfo type", &N); return; } } while (false)
1104 "invalid macinfo type", &N)do { if (!(N.getMacinfoType() == dwarf::DW_MACINFO_define || N
.getMacinfoType() == dwarf::DW_MACINFO_undef)) { DebugInfoCheckFailed
("invalid macinfo type", &N); return; } } while (false)
;
1105 AssertDI(!N.getName().empty(), "anonymous macro", &N)do { if (!(!N.getName().empty())) { DebugInfoCheckFailed("anonymous macro"
, &N); return; } } while (false)
;
1106 if (!N.getValue().empty()) {
1107 assert(N.getValue().data()[0] != ' ' && "Macro value has a space prefix")((N.getValue().data()[0] != ' ' && "Macro value has a space prefix"
) ? static_cast<void> (0) : __assert_fail ("N.getValue().data()[0] != ' ' && \"Macro value has a space prefix\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 1107, __PRETTY_FUNCTION__))
;
1108 }
1109}
1110
1111void Verifier::visitDIMacroFile(const DIMacroFile &N) {
1112 AssertDI(N.getMacinfoType() == dwarf::DW_MACINFO_start_file,do { if (!(N.getMacinfoType() == dwarf::DW_MACINFO_start_file
)) { DebugInfoCheckFailed("invalid macinfo type", &N); return
; } } while (false)
1113 "invalid macinfo type", &N)do { if (!(N.getMacinfoType() == dwarf::DW_MACINFO_start_file
)) { DebugInfoCheckFailed("invalid macinfo type", &N); return
; } } while (false)
;
1114 if (auto *F = N.getRawFile())
1115 AssertDI(isa<DIFile>(F), "invalid file", &N, F)do { if (!(isa<DIFile>(F))) { DebugInfoCheckFailed("invalid file"
, &N, F); return; } } while (false)
;
1116
1117 if (auto *Array = N.getRawElements()) {
1118 AssertDI(isa<MDTuple>(Array), "invalid macro list", &N, Array)do { if (!(isa<MDTuple>(Array))) { DebugInfoCheckFailed
("invalid macro list", &N, Array); return; } } while (false
)
;
1119 for (Metadata *Op : N.getElements()->operands()) {
1120 AssertDI(Op && isa<DIMacroNode>(Op), "invalid macro ref", &N, Op)do { if (!(Op && isa<DIMacroNode>(Op))) { DebugInfoCheckFailed
("invalid macro ref", &N, Op); return; } } while (false)
;
1121 }
1122 }
1123}
1124
1125void Verifier::visitDIModule(const DIModule &N) {
1126 AssertDI(N.getTag() == dwarf::DW_TAG_module, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_module)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
1127 AssertDI(!N.getName().empty(), "anonymous module", &N)do { if (!(!N.getName().empty())) { DebugInfoCheckFailed("anonymous module"
, &N); return; } } while (false)
;
1128}
1129
1130void Verifier::visitDITemplateParameter(const DITemplateParameter &N) {
1131 AssertDI(isType(N.getRawType()), "invalid type ref", &N, N.getRawType())do { if (!(isType(N.getRawType()))) { DebugInfoCheckFailed("invalid type ref"
, &N, N.getRawType()); return; } } while (false)
;
1132}
1133
1134void Verifier::visitDITemplateTypeParameter(const DITemplateTypeParameter &N) {
1135 visitDITemplateParameter(N);
1136
1137 AssertDI(N.getTag() == dwarf::DW_TAG_template_type_parameter, "invalid tag",do { if (!(N.getTag() == dwarf::DW_TAG_template_type_parameter
)) { DebugInfoCheckFailed("invalid tag", &N); return; } }
while (false)
1138 &N)do { if (!(N.getTag() == dwarf::DW_TAG_template_type_parameter
)) { DebugInfoCheckFailed("invalid tag", &N); return; } }
while (false)
;
1139}
1140
1141void Verifier::visitDITemplateValueParameter(
1142 const DITemplateValueParameter &N) {
1143 visitDITemplateParameter(N);
1144
1145 AssertDI(N.getTag() == dwarf::DW_TAG_template_value_parameter ||do { if (!(N.getTag() == dwarf::DW_TAG_template_value_parameter
|| N.getTag() == dwarf::DW_TAG_GNU_template_template_param ||
N.getTag() == dwarf::DW_TAG_GNU_template_parameter_pack)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
1146 N.getTag() == dwarf::DW_TAG_GNU_template_template_param ||do { if (!(N.getTag() == dwarf::DW_TAG_template_value_parameter
|| N.getTag() == dwarf::DW_TAG_GNU_template_template_param ||
N.getTag() == dwarf::DW_TAG_GNU_template_parameter_pack)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
1147 N.getTag() == dwarf::DW_TAG_GNU_template_parameter_pack,do { if (!(N.getTag() == dwarf::DW_TAG_template_value_parameter
|| N.getTag() == dwarf::DW_TAG_GNU_template_template_param ||
N.getTag() == dwarf::DW_TAG_GNU_template_parameter_pack)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
1148 "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_template_value_parameter
|| N.getTag() == dwarf::DW_TAG_GNU_template_template_param ||
N.getTag() == dwarf::DW_TAG_GNU_template_parameter_pack)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
1149}
1150
1151void Verifier::visitDIVariable(const DIVariable &N) {
1152 if (auto *S = N.getRawScope())
1153 AssertDI(isa<DIScope>(S), "invalid scope", &N, S)do { if (!(isa<DIScope>(S))) { DebugInfoCheckFailed("invalid scope"
, &N, S); return; } } while (false)
;
1154 AssertDI(isType(N.getRawType()), "invalid type ref", &N, N.getRawType())do { if (!(isType(N.getRawType()))) { DebugInfoCheckFailed("invalid type ref"
, &N, N.getRawType()); return; } } while (false)
;
1155 if (auto *F = N.getRawFile())
1156 AssertDI(isa<DIFile>(F), "invalid file", &N, F)do { if (!(isa<DIFile>(F))) { DebugInfoCheckFailed("invalid file"
, &N, F); return; } } while (false)
;
1157}
1158
1159void Verifier::visitDIGlobalVariable(const DIGlobalVariable &N) {
1160 // Checks common to all variables.
1161 visitDIVariable(N);
1162
1163 AssertDI(N.getTag() == dwarf::DW_TAG_variable, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_variable)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
1164 AssertDI(!N.getName().empty(), "missing global variable name", &N)do { if (!(!N.getName().empty())) { DebugInfoCheckFailed("missing global variable name"
, &N); return; } } while (false)
;
1165 if (auto *Member = N.getRawStaticDataMemberDeclaration()) {
1166 AssertDI(isa<DIDerivedType>(Member),do { if (!(isa<DIDerivedType>(Member))) { DebugInfoCheckFailed
("invalid static data member declaration", &N, Member); return
; } } while (false)
1167 "invalid static data member declaration", &N, Member)do { if (!(isa<DIDerivedType>(Member))) { DebugInfoCheckFailed
("invalid static data member declaration", &N, Member); return
; } } while (false)
;
1168 }
1169}
1170
1171void Verifier::visitDILocalVariable(const DILocalVariable &N) {
1172 // Checks common to all variables.
1173 visitDIVariable(N);
1174
1175 AssertDI(N.getTag() == dwarf::DW_TAG_variable, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_variable)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
1176 AssertDI(N.getRawScope() && isa<DILocalScope>(N.getRawScope()),do { if (!(N.getRawScope() && isa<DILocalScope>
(N.getRawScope()))) { DebugInfoCheckFailed("local variable requires a valid scope"
, &N, N.getRawScope()); return; } } while (false)
1177 "local variable requires a valid scope", &N, N.getRawScope())do { if (!(N.getRawScope() && isa<DILocalScope>
(N.getRawScope()))) { DebugInfoCheckFailed("local variable requires a valid scope"
, &N, N.getRawScope()); return; } } while (false)
;
1178}
1179
1180void Verifier::visitDIExpression(const DIExpression &N) {
1181 AssertDI(N.isValid(), "invalid expression", &N)do { if (!(N.isValid())) { DebugInfoCheckFailed("invalid expression"
, &N); return; } } while (false)
;
1182}
1183
1184void Verifier::visitDIGlobalVariableExpression(
1185 const DIGlobalVariableExpression &GVE) {
1186 AssertDI(GVE.getVariable(), "missing variable")do { if (!(GVE.getVariable())) { DebugInfoCheckFailed("missing variable"
); return; } } while (false)
;
1187 if (auto *Var = GVE.getVariable())
1188 visitDIGlobalVariable(*Var);
1189 if (auto *Expr = GVE.getExpression())
1190 visitDIExpression(*Expr);
1191}
1192
1193void Verifier::visitDIObjCProperty(const DIObjCProperty &N) {
1194 AssertDI(N.getTag() == dwarf::DW_TAG_APPLE_property, "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_APPLE_property)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
1195 if (auto *T = N.getRawType())
1196 AssertDI(isType(T), "invalid type ref", &N, T)do { if (!(isType(T))) { DebugInfoCheckFailed("invalid type ref"
, &N, T); return; } } while (false)
;
1197 if (auto *F = N.getRawFile())
1198 AssertDI(isa<DIFile>(F), "invalid file", &N, F)do { if (!(isa<DIFile>(F))) { DebugInfoCheckFailed("invalid file"
, &N, F); return; } } while (false)
;
1199}
1200
1201void Verifier::visitDIImportedEntity(const DIImportedEntity &N) {
1202 AssertDI(N.getTag() == dwarf::DW_TAG_imported_module ||do { if (!(N.getTag() == dwarf::DW_TAG_imported_module || N.getTag
() == dwarf::DW_TAG_imported_declaration)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
1203 N.getTag() == dwarf::DW_TAG_imported_declaration,do { if (!(N.getTag() == dwarf::DW_TAG_imported_module || N.getTag
() == dwarf::DW_TAG_imported_declaration)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
1204 "invalid tag", &N)do { if (!(N.getTag() == dwarf::DW_TAG_imported_module || N.getTag
() == dwarf::DW_TAG_imported_declaration)) { DebugInfoCheckFailed
("invalid tag", &N); return; } } while (false)
;
1205 if (auto *S = N.getRawScope())
1206 AssertDI(isa<DIScope>(S), "invalid scope for imported entity", &N, S)do { if (!(isa<DIScope>(S))) { DebugInfoCheckFailed("invalid scope for imported entity"
, &N, S); return; } } while (false)
;
1207 AssertDI(isDINode(N.getRawEntity()), "invalid imported entity", &N,do { if (!(isDINode(N.getRawEntity()))) { DebugInfoCheckFailed
("invalid imported entity", &N, N.getRawEntity()); return
; } } while (false)
1208 N.getRawEntity())do { if (!(isDINode(N.getRawEntity()))) { DebugInfoCheckFailed
("invalid imported entity", &N, N.getRawEntity()); return
; } } while (false)
;
1209}
1210
1211void Verifier::visitComdat(const Comdat &C) {
1212 // The Module is invalid if the GlobalValue has private linkage. Entities
1213 // with private linkage don't have entries in the symbol table.
1214 if (const GlobalValue *GV = M.getNamedValue(C.getName()))
1215 Assert(!GV->hasPrivateLinkage(), "comdat global value has private linkage",do { if (!(!GV->hasPrivateLinkage())) { CheckFailed("comdat global value has private linkage"
, GV); return; } } while (false)
1216 GV)do { if (!(!GV->hasPrivateLinkage())) { CheckFailed("comdat global value has private linkage"
, GV); return; } } while (false)
;
1217}
1218
1219void Verifier::visitModuleIdents(const Module &M) {
1220 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
1221 if (!Idents)
1222 return;
1223
1224 // llvm.ident takes a list of metadata entry. Each entry has only one string.
1225 // Scan each llvm.ident entry and make sure that this requirement is met.
1226 for (const MDNode *N : Idents->operands()) {
1227 Assert(N->getNumOperands() == 1,do { if (!(N->getNumOperands() == 1)) { CheckFailed("incorrect number of operands in llvm.ident metadata"
, N); return; } } while (false)
1228 "incorrect number of operands in llvm.ident metadata", N)do { if (!(N->getNumOperands() == 1)) { CheckFailed("incorrect number of operands in llvm.ident metadata"
, N); return; } } while (false)
;
1229 Assert(dyn_cast_or_null<MDString>(N->getOperand(0)),do { if (!(dyn_cast_or_null<MDString>(N->getOperand(
0)))) { CheckFailed(("invalid value for llvm.ident metadata entry operand"
"(the operand should be a string)"), N->getOperand(0)); return
; } } while (false)
1230 ("invalid value for llvm.ident metadata entry operand"do { if (!(dyn_cast_or_null<MDString>(N->getOperand(
0)))) { CheckFailed(("invalid value for llvm.ident metadata entry operand"
"(the operand should be a string)"), N->getOperand(0)); return
; } } while (false)
1231 "(the operand should be a string)"),do { if (!(dyn_cast_or_null<MDString>(N->getOperand(
0)))) { CheckFailed(("invalid value for llvm.ident metadata entry operand"
"(the operand should be a string)"), N->getOperand(0)); return
; } } while (false)
1232 N->getOperand(0))do { if (!(dyn_cast_or_null<MDString>(N->getOperand(
0)))) { CheckFailed(("invalid value for llvm.ident metadata entry operand"
"(the operand should be a string)"), N->getOperand(0)); return
; } } while (false)
;
1233 }
1234}
1235
1236void Verifier::visitModuleFlags(const Module &M) {
1237 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
1238 if (!Flags) return;
1239
1240 // Scan each flag, and track the flags and requirements.
1241 DenseMap<const MDString*, const MDNode*> SeenIDs;
1242 SmallVector<const MDNode*, 16> Requirements;
1243 for (const MDNode *MDN : Flags->operands())
1244 visitModuleFlag(MDN, SeenIDs, Requirements);
1245
1246 // Validate that the requirements in the module are valid.
1247 for (const MDNode *Requirement : Requirements) {
1248 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
1249 const Metadata *ReqValue = Requirement->getOperand(1);
1250
1251 const MDNode *Op = SeenIDs.lookup(Flag);
1252 if (!Op) {
1253 CheckFailed("invalid requirement on flag, flag is not present in module",
1254 Flag);
1255 continue;
1256 }
1257
1258 if (Op->getOperand(2) != ReqValue) {
1259 CheckFailed(("invalid requirement on flag, "
1260 "flag does not have the required value"),
1261 Flag);
1262 continue;
1263 }
1264 }
1265}
1266
1267void
1268Verifier::visitModuleFlag(const MDNode *Op,
1269 DenseMap<const MDString *, const MDNode *> &SeenIDs,
1270 SmallVectorImpl<const MDNode *> &Requirements) {
1271 // Each module flag should have three arguments, the merge behavior (a
1272 // constant int), the flag ID (an MDString), and the value.
1273 Assert(Op->getNumOperands() == 3,do { if (!(Op->getNumOperands() == 3)) { CheckFailed("incorrect number of operands in module flag"
, Op); return; } } while (false)
1274 "incorrect number of operands in module flag", Op)do { if (!(Op->getNumOperands() == 3)) { CheckFailed("incorrect number of operands in module flag"
, Op); return; } } while (false)
;
1275 Module::ModFlagBehavior MFB;
1276 if (!Module::isValidModFlagBehavior(Op->getOperand(0), MFB)) {
1277 Assert(do { if (!(mdconst::dyn_extract_or_null<ConstantInt>(Op
->getOperand(0)))) { CheckFailed("invalid behavior operand in module flag (expected constant integer)"
, Op->getOperand(0)); return; } } while (false)
1278 mdconst::dyn_extract_or_null<ConstantInt>(Op->getOperand(0)),do { if (!(mdconst::dyn_extract_or_null<ConstantInt>(Op
->getOperand(0)))) { CheckFailed("invalid behavior operand in module flag (expected constant integer)"
, Op->getOperand(0)); return; } } while (false)
1279 "invalid behavior operand in module flag (expected constant integer)",do { if (!(mdconst::dyn_extract_or_null<ConstantInt>(Op
->getOperand(0)))) { CheckFailed("invalid behavior operand in module flag (expected constant integer)"
, Op->getOperand(0)); return; } } while (false)
1280 Op->getOperand(0))do { if (!(mdconst::dyn_extract_or_null<ConstantInt>(Op
->getOperand(0)))) { CheckFailed("invalid behavior operand in module flag (expected constant integer)"
, Op->getOperand(0)); return; } } while (false)
;
1281 Assert(false,do { if (!(false)) { CheckFailed("invalid behavior operand in module flag (unexpected constant)"
, Op->getOperand(0)); return; } } while (false)
1282 "invalid behavior operand in module flag (unexpected constant)",do { if (!(false)) { CheckFailed("invalid behavior operand in module flag (unexpected constant)"
, Op->getOperand(0)); return; } } while (false)
1283 Op->getOperand(0))do { if (!(false)) { CheckFailed("invalid behavior operand in module flag (unexpected constant)"
, Op->getOperand(0)); return; } } while (false)
;
1284 }
1285 MDString *ID = dyn_cast_or_null<MDString>(Op->getOperand(1));
1286 Assert(ID, "invalid ID operand in module flag (expected metadata string)",do { if (!(ID)) { CheckFailed("invalid ID operand in module flag (expected metadata string)"
, Op->getOperand(1)); return; } } while (false)
1287 Op->getOperand(1))do { if (!(ID)) { CheckFailed("invalid ID operand in module flag (expected metadata string)"
, Op->getOperand(1)); return; } } while (false)
;
1288
1289 // Sanity check the values for behaviors with additional requirements.
1290 switch (MFB) {
1291 case Module::Error:
1292 case Module::Warning:
1293 case Module::Override:
1294 // These behavior types accept any value.
1295 break;
1296
1297 case Module::Require: {
1298 // The value should itself be an MDNode with two operands, a flag ID (an
1299 // MDString), and a value.
1300 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
1301 Assert(Value && Value->getNumOperands() == 2,do { if (!(Value && Value->getNumOperands() == 2))
{ CheckFailed("invalid value for 'require' module flag (expected metadata pair)"
, Op->getOperand(2)); return; } } while (false)
1302 "invalid value for 'require' module flag (expected metadata pair)",do { if (!(Value && Value->getNumOperands() == 2))
{ CheckFailed("invalid value for 'require' module flag (expected metadata pair)"
, Op->getOperand(2)); return; } } while (false)
1303 Op->getOperand(2))do { if (!(Value && Value->getNumOperands() == 2))
{ CheckFailed("invalid value for 'require' module flag (expected metadata pair)"
, Op->getOperand(2)); return; } } while (false)
;
1304 Assert(isa<MDString>(Value->getOperand(0)),do { if (!(isa<MDString>(Value->getOperand(0)))) { CheckFailed
(("invalid value for 'require' module flag " "(first value operand should be a string)"
), Value->getOperand(0)); return; } } while (false)
1305 ("invalid value for 'require' module flag "do { if (!(isa<MDString>(Value->getOperand(0)))) { CheckFailed
(("invalid value for 'require' module flag " "(first value operand should be a string)"
), Value->getOperand(0)); return; } } while (false)
1306 "(first value operand should be a string)"),do { if (!(isa<MDString>(Value->getOperand(0)))) { CheckFailed
(("invalid value for 'require' module flag " "(first value operand should be a string)"
), Value->getOperand(0)); return; } } while (false)
1307 Value->getOperand(0))do { if (!(isa<MDString>(Value->getOperand(0)))) { CheckFailed
(("invalid value for 'require' module flag " "(first value operand should be a string)"
), Value->getOperand(0)); return; } } while (false)
;
1308
1309 // Append it to the list of requirements, to check once all module flags are
1310 // scanned.
1311 Requirements.push_back(Value);
1312 break;
1313 }
1314
1315 case Module::Append:
1316 case Module::AppendUnique: {
1317 // These behavior types require the operand be an MDNode.
1318 Assert(isa<MDNode>(Op->getOperand(2)),do { if (!(isa<MDNode>(Op->getOperand(2)))) { CheckFailed
("invalid value for 'append'-type module flag " "(expected a metadata node)"
, Op->getOperand(2)); return; } } while (false)
1319 "invalid value for 'append'-type module flag "do { if (!(isa<MDNode>(Op->getOperand(2)))) { CheckFailed
("invalid value for 'append'-type module flag " "(expected a metadata node)"
, Op->getOperand(2)); return; } } while (false)
1320 "(expected a metadata node)",do { if (!(isa<MDNode>(Op->getOperand(2)))) { CheckFailed
("invalid value for 'append'-type module flag " "(expected a metadata node)"
, Op->getOperand(2)); return; } } while (false)
1321 Op->getOperand(2))do { if (!(isa<MDNode>(Op->getOperand(2)))) { CheckFailed
("invalid value for 'append'-type module flag " "(expected a metadata node)"
, Op->getOperand(2)); return; } } while (false)
;
1322 break;
1323 }
1324 }
1325
1326 // Unless this is a "requires" flag, check the ID is unique.
1327 if (MFB != Module::Require) {
1328 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
1329 Assert(Inserted,do { if (!(Inserted)) { CheckFailed("module flag identifiers must be unique (or of 'require' type)"
, ID); return; } } while (false)
1330 "module flag identifiers must be unique (or of 'require' type)", ID)do { if (!(Inserted)) { CheckFailed("module flag identifiers must be unique (or of 'require' type)"
, ID); return; } } while (false)
;
1331 }
1332}
1333
1334void Verifier::verifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
1335 bool isFunction, const Value *V) {
1336 unsigned Slot = ~0U;
1337 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
1338 if (Attrs.getSlotIndex(I) == Idx) {
1339 Slot = I;
1340 break;
1341 }
1342
1343 assert(Slot != ~0U && "Attribute set inconsistency!")((Slot != ~0U && "Attribute set inconsistency!") ? static_cast
<void> (0) : __assert_fail ("Slot != ~0U && \"Attribute set inconsistency!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 1343, __PRETTY_FUNCTION__))
;
1344
1345 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
1346 I != E; ++I) {
1347 if (I->isStringAttribute())
1348 continue;
1349
1350 if (I->getKindAsEnum() == Attribute::NoReturn ||
1351 I->getKindAsEnum() == Attribute::NoUnwind ||
1352 I->getKindAsEnum() == Attribute::NoInline ||
1353 I->getKindAsEnum() == Attribute::AlwaysInline ||
1354 I->getKindAsEnum() == Attribute::OptimizeForSize ||
1355 I->getKindAsEnum() == Attribute::StackProtect ||
1356 I->getKindAsEnum() == Attribute::StackProtectReq ||
1357 I->getKindAsEnum() == Attribute::StackProtectStrong ||
1358 I->getKindAsEnum() == Attribute::SafeStack ||
1359 I->getKindAsEnum() == Attribute::NoRedZone ||
1360 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
1361 I->getKindAsEnum() == Attribute::Naked ||
1362 I->getKindAsEnum() == Attribute::InlineHint ||
1363 I->getKindAsEnum() == Attribute::StackAlignment ||
1364 I->getKindAsEnum() == Attribute::UWTable ||
1365 I->getKindAsEnum() == Attribute::NonLazyBind ||
1366 I->getKindAsEnum() == Attribute::ReturnsTwice ||
1367 I->getKindAsEnum() == Attribute::SanitizeAddress ||
1368 I->getKindAsEnum() == Attribute::SanitizeThread ||
1369 I->getKindAsEnum() == Attribute::SanitizeMemory ||
1370 I->getKindAsEnum() == Attribute::MinSize ||
1371 I->getKindAsEnum() == Attribute::NoDuplicate ||
1372 I->getKindAsEnum() == Attribute::Builtin ||
1373 I->getKindAsEnum() == Attribute::NoBuiltin ||
1374 I->getKindAsEnum() == Attribute::Cold ||
1375 I->getKindAsEnum() == Attribute::OptimizeNone ||
1376 I->getKindAsEnum() == Attribute::JumpTable ||
1377 I->getKindAsEnum() == Attribute::Convergent ||
1378 I->getKindAsEnum() == Attribute::ArgMemOnly ||
1379 I->getKindAsEnum() == Attribute::NoRecurse ||
1380 I->getKindAsEnum() == Attribute::InaccessibleMemOnly ||
1381 I->getKindAsEnum() == Attribute::InaccessibleMemOrArgMemOnly ||
1382 I->getKindAsEnum() == Attribute::AllocSize) {
1383 if (!isFunction) {
1384 CheckFailed("Attribute '" + I->getAsString() +
1385 "' only applies to functions!", V);
1386 return;
1387 }
1388 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
1389 I->getKindAsEnum() == Attribute::WriteOnly ||
1390 I->getKindAsEnum() == Attribute::ReadNone) {
1391 if (Idx == 0) {
1392 CheckFailed("Attribute '" + I->getAsString() +
1393 "' does not apply to function returns");
1394 return;
1395 }
1396 } else if (isFunction) {
1397 CheckFailed("Attribute '" + I->getAsString() +
1398 "' does not apply to functions!", V);
1399 return;
1400 }
1401 }
1402}
1403
1404// VerifyParameterAttrs - Check the given attributes for an argument or return
1405// value of the specified type. The value V is printed in error messages.
1406void Verifier::verifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
1407 bool isReturnValue, const Value *V) {
1408 if (!Attrs.hasAttributes(Idx))
1409 return;
1410
1411 verifyAttributeTypes(Attrs, Idx, false, V);
1412
1413 if (isReturnValue)
1414 Assert(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1415 !Attrs.hasAttribute(Idx, Attribute::Nest) &&do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1416 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1417 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1418 !Attrs.hasAttribute(Idx, Attribute::Returned) &&do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1419 !Attrs.hasAttribute(Idx, Attribute::InAlloca) &&do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1420 !Attrs.hasAttribute(Idx, Attribute::SwiftSelf) &&do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1421 !Attrs.hasAttribute(Idx, Attribute::SwiftError),do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1422 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1423 "'returned', 'swiftself', and 'swifterror' do not apply to return "do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1424 "values!",do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
1425 V)do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::Nest) && !Attrs.
hasAttribute(Idx, Attribute::StructRet) && !Attrs.hasAttribute
(Idx, Attribute::NoCapture) && !Attrs.hasAttribute(Idx
, Attribute::Returned) && !Attrs.hasAttribute(Idx, Attribute
::InAlloca) && !Attrs.hasAttribute(Idx, Attribute::SwiftSelf
) && !Attrs.hasAttribute(Idx, Attribute::SwiftError))
) { CheckFailed("Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', "
"'returned', 'swiftself', and 'swifterror' do not apply to return "
"values!", V); return; } } while (false)
;
1426
1427 // Check for mutually incompatible attributes. Only inreg is compatible with
1428 // sret.
1429 unsigned AttrCount = 0;
1430 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
1431 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
1432 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
1433 Attrs.hasAttribute(Idx, Attribute::InReg);
1434 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
1435 Assert(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "do { if (!(AttrCount <= 1)) { CheckFailed("Attributes 'byval', 'inalloca', 'inreg', 'nest', "
"and 'sret' are incompatible!", V); return; } } while (false
)
1436 "and 'sret' are incompatible!",do { if (!(AttrCount <= 1)) { CheckFailed("Attributes 'byval', 'inalloca', 'inreg', 'nest', "
"and 'sret' are incompatible!", V); return; } } while (false
)
1437 V)do { if (!(AttrCount <= 1)) { CheckFailed("Attributes 'byval', 'inalloca', 'inreg', 'nest', "
"and 'sret' are incompatible!", V); return; } } while (false
)
;
1438
1439 Assert(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&do { if (!(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'inalloca and readonly' are incompatible!", V
); return; } } while (false)
1440 Attrs.hasAttribute(Idx, Attribute::ReadOnly)),do { if (!(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'inalloca and readonly' are incompatible!", V
); return; } } while (false)
1441 "Attributes "do { if (!(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'inalloca and readonly' are incompatible!", V
); return; } } while (false)
1442 "'inalloca and readonly' are incompatible!",do { if (!(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'inalloca and readonly' are incompatible!", V
); return; } } while (false)
1443 V)do { if (!(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'inalloca and readonly' are incompatible!", V
); return; } } while (false)
;
1444
1445 Assert(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&do { if (!(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
Attrs.hasAttribute(Idx, Attribute::Returned)))) { CheckFailed
("Attributes " "'sret and returned' are incompatible!", V); return
; } } while (false)
1446 Attrs.hasAttribute(Idx, Attribute::Returned)),do { if (!(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
Attrs.hasAttribute(Idx, Attribute::Returned)))) { CheckFailed
("Attributes " "'sret and returned' are incompatible!", V); return
; } } while (false)
1447 "Attributes "do { if (!(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
Attrs.hasAttribute(Idx, Attribute::Returned)))) { CheckFailed
("Attributes " "'sret and returned' are incompatible!", V); return
; } } while (false)
1448 "'sret and returned' are incompatible!",do { if (!(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
Attrs.hasAttribute(Idx, Attribute::Returned)))) { CheckFailed
("Attributes " "'sret and returned' are incompatible!", V); return
; } } while (false)
1449 V)do { if (!(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
Attrs.hasAttribute(Idx, Attribute::Returned)))) { CheckFailed
("Attributes " "'sret and returned' are incompatible!", V); return
; } } while (false)
;
1450
1451 Assert(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
Attrs.hasAttribute(Idx, Attribute::SExt)))) { CheckFailed("Attributes "
"'zeroext and signext' are incompatible!", V); return; } } while
(false)
1452 Attrs.hasAttribute(Idx, Attribute::SExt)),do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
Attrs.hasAttribute(Idx, Attribute::SExt)))) { CheckFailed("Attributes "
"'zeroext and signext' are incompatible!", V); return; } } while
(false)
1453 "Attributes "do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
Attrs.hasAttribute(Idx, Attribute::SExt)))) { CheckFailed("Attributes "
"'zeroext and signext' are incompatible!", V); return; } } while
(false)
1454 "'zeroext and signext' are incompatible!",do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
Attrs.hasAttribute(Idx, Attribute::SExt)))) { CheckFailed("Attributes "
"'zeroext and signext' are incompatible!", V); return; } } while
(false)
1455 V)do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
Attrs.hasAttribute(Idx, Attribute::SExt)))) { CheckFailed("Attributes "
"'zeroext and signext' are incompatible!", V); return; } } while
(false)
;
1456
1457 Assert(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'readnone and readonly' are incompatible!", V
); return; } } while (false)
1458 Attrs.hasAttribute(Idx, Attribute::ReadOnly)),do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'readnone and readonly' are incompatible!", V
); return; } } while (false)
1459 "Attributes "do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'readnone and readonly' are incompatible!", V
); return; } } while (false)
1460 "'readnone and readonly' are incompatible!",do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'readnone and readonly' are incompatible!", V
); return; } } while (false)
1461 V)do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::ReadOnly)))) { CheckFailed
("Attributes " "'readnone and readonly' are incompatible!", V
); return; } } while (false)
;
1462
1463 Assert(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readnone and writeonly' are incompatible!", V
); return; } } while (false)
1464 Attrs.hasAttribute(Idx, Attribute::WriteOnly)),do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readnone and writeonly' are incompatible!", V
); return; } } while (false)
1465 "Attributes "do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readnone and writeonly' are incompatible!", V
); return; } } while (false)
1466 "'readnone and writeonly' are incompatible!",do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readnone and writeonly' are incompatible!", V
); return; } } while (false)
1467 V)do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readnone and writeonly' are incompatible!", V
); return; } } while (false)
;
1468
1469 Assert(!(Attrs.hasAttribute(Idx, Attribute::ReadOnly) &&do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadOnly) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readonly and writeonly' are incompatible!", V
); return; } } while (false)
1470 Attrs.hasAttribute(Idx, Attribute::WriteOnly)),do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadOnly) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readonly and writeonly' are incompatible!", V
); return; } } while (false)
1471 "Attributes "do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadOnly) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readonly and writeonly' are incompatible!", V
); return; } } while (false)
1472 "'readonly and writeonly' are incompatible!",do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadOnly) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readonly and writeonly' are incompatible!", V
); return; } } while (false)
1473 V)do { if (!(!(Attrs.hasAttribute(Idx, Attribute::ReadOnly) &&
Attrs.hasAttribute(Idx, Attribute::WriteOnly)))) { CheckFailed
("Attributes " "'readonly and writeonly' are incompatible!", V
); return; } } while (false)
;
1474
1475 Assert(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&do { if (!(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
Attrs.hasAttribute(Idx, Attribute::AlwaysInline)))) { CheckFailed
("Attributes " "'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
1476 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)),do { if (!(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
Attrs.hasAttribute(Idx, Attribute::AlwaysInline)))) { CheckFailed
("Attributes " "'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
1477 "Attributes "do { if (!(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
Attrs.hasAttribute(Idx, Attribute::AlwaysInline)))) { CheckFailed
("Attributes " "'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
1478 "'noinline and alwaysinline' are incompatible!",do { if (!(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
Attrs.hasAttribute(Idx, Attribute::AlwaysInline)))) { CheckFailed
("Attributes " "'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
1479 V)do { if (!(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
Attrs.hasAttribute(Idx, Attribute::AlwaysInline)))) { CheckFailed
("Attributes " "'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
;
1480
1481 Assert(do { if (!(!AttrBuilder(Attrs, Idx).overlaps(AttributeFuncs::
typeIncompatible(Ty)))) { CheckFailed("Wrong types for attribute: "
+ AttributeSet::get(Context, Idx, AttributeFuncs::typeIncompatible
(Ty)) .getAsString(Idx), V); return; } } while (false)
1482 !AttrBuilder(Attrs, Idx).overlaps(AttributeFuncs::typeIncompatible(Ty)),do { if (!(!AttrBuilder(Attrs, Idx).overlaps(AttributeFuncs::
typeIncompatible(Ty)))) { CheckFailed("Wrong types for attribute: "
+ AttributeSet::get(Context, Idx, AttributeFuncs::typeIncompatible
(Ty)) .getAsString(Idx), V); return; } } while (false)
1483 "Wrong types for attribute: " +do { if (!(!AttrBuilder(Attrs, Idx).overlaps(AttributeFuncs::
typeIncompatible(Ty)))) { CheckFailed("Wrong types for attribute: "
+ AttributeSet::get(Context, Idx, AttributeFuncs::typeIncompatible
(Ty)) .getAsString(Idx), V); return; } } while (false)
1484 AttributeSet::get(Context, Idx, AttributeFuncs::typeIncompatible(Ty))do { if (!(!AttrBuilder(Attrs, Idx).overlaps(AttributeFuncs::
typeIncompatible(Ty)))) { CheckFailed("Wrong types for attribute: "
+ AttributeSet::get(Context, Idx, AttributeFuncs::typeIncompatible
(Ty)) .getAsString(Idx), V); return; } } while (false)
1485 .getAsString(Idx),do { if (!(!AttrBuilder(Attrs, Idx).overlaps(AttributeFuncs::
typeIncompatible(Ty)))) { CheckFailed("Wrong types for attribute: "
+ AttributeSet::get(Context, Idx, AttributeFuncs::typeIncompatible
(Ty)) .getAsString(Idx), V); return; } } while (false)
1486 V)do { if (!(!AttrBuilder(Attrs, Idx).overlaps(AttributeFuncs::
typeIncompatible(Ty)))) { CheckFailed("Wrong types for attribute: "
+ AttributeSet::get(Context, Idx, AttributeFuncs::typeIncompatible
(Ty)) .getAsString(Idx), V); return; } } while (false)
;
1487
1488 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
1489 SmallPtrSet<Type*, 4> Visited;
1490 if (!PTy->getElementType()->isSized(&Visited)) {
1491 Assert(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::InAlloca))) { CheckFailed
("Attributes 'byval' and 'inalloca' do not support unsized types!"
, V); return; } } while (false)
1492 !Attrs.hasAttribute(Idx, Attribute::InAlloca),do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::InAlloca))) { CheckFailed
("Attributes 'byval' and 'inalloca' do not support unsized types!"
, V); return; } } while (false)
1493 "Attributes 'byval' and 'inalloca' do not support unsized types!",do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::InAlloca))) { CheckFailed
("Attributes 'byval' and 'inalloca' do not support unsized types!"
, V); return; } } while (false)
1494 V)do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
!Attrs.hasAttribute(Idx, Attribute::InAlloca))) { CheckFailed
("Attributes 'byval' and 'inalloca' do not support unsized types!"
, V); return; } } while (false)
;
1495 }
1496 if (!isa<PointerType>(PTy->getElementType()))
1497 Assert(!Attrs.hasAttribute(Idx, Attribute::SwiftError),do { if (!(!Attrs.hasAttribute(Idx, Attribute::SwiftError))) {
CheckFailed("Attribute 'swifterror' only applies to parameters "
"with pointer to pointer type!", V); return; } } while (false
)
1498 "Attribute 'swifterror' only applies to parameters "do { if (!(!Attrs.hasAttribute(Idx, Attribute::SwiftError))) {
CheckFailed("Attribute 'swifterror' only applies to parameters "
"with pointer to pointer type!", V); return; } } while (false
)
1499 "with pointer to pointer type!",do { if (!(!Attrs.hasAttribute(Idx, Attribute::SwiftError))) {
CheckFailed("Attribute 'swifterror' only applies to parameters "
"with pointer to pointer type!", V); return; } } while (false
)
1500 V)do { if (!(!Attrs.hasAttribute(Idx, Attribute::SwiftError))) {
CheckFailed("Attribute 'swifterror' only applies to parameters "
"with pointer to pointer type!", V); return; } } while (false
)
;
1501 } else {
1502 Assert(!Attrs.hasAttribute(Idx, Attribute::ByVal),do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal))) { CheckFailed
("Attribute 'byval' only applies to parameters with pointer type!"
, V); return; } } while (false)
1503 "Attribute 'byval' only applies to parameters with pointer type!",do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal))) { CheckFailed
("Attribute 'byval' only applies to parameters with pointer type!"
, V); return; } } while (false)
1504 V)do { if (!(!Attrs.hasAttribute(Idx, Attribute::ByVal))) { CheckFailed
("Attribute 'byval' only applies to parameters with pointer type!"
, V); return; } } while (false)
;
1505 Assert(!Attrs.hasAttribute(Idx, Attribute::SwiftError),do { if (!(!Attrs.hasAttribute(Idx, Attribute::SwiftError))) {
CheckFailed("Attribute 'swifterror' only applies to parameters "
"with pointer type!", V); return; } } while (false)
1506 "Attribute 'swifterror' only applies to parameters "do { if (!(!Attrs.hasAttribute(Idx, Attribute::SwiftError))) {
CheckFailed("Attribute 'swifterror' only applies to parameters "
"with pointer type!", V); return; } } while (false)
1507 "with pointer type!",do { if (!(!Attrs.hasAttribute(Idx, Attribute::SwiftError))) {
CheckFailed("Attribute 'swifterror' only applies to parameters "
"with pointer type!", V); return; } } while (false)
1508 V)do { if (!(!Attrs.hasAttribute(Idx, Attribute::SwiftError))) {
CheckFailed("Attribute 'swifterror' only applies to parameters "
"with pointer type!", V); return; } } while (false)
;
1509 }
1510}
1511
1512// Check parameter attributes against a function type.
1513// The value V is printed in error messages.
1514void Verifier::verifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
1515 const Value *V) {
1516 if (Attrs.isEmpty())
1517 return;
1518
1519 bool SawNest = false;
1520 bool SawReturned = false;
1521 bool SawSRet = false;
1522 bool SawSwiftSelf = false;
1523 bool SawSwiftError = false;
1524
1525 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
1526 unsigned Idx = Attrs.getSlotIndex(i);
1527
1528 Type *Ty;
1529 if (Idx == 0)
1530 Ty = FT->getReturnType();
1531 else if (Idx-1 < FT->getNumParams())
1532 Ty = FT->getParamType(Idx-1);
1533 else
1534 break; // VarArgs attributes, verified elsewhere.
1535
1536 verifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
1537
1538 if (Idx == 0)
1539 continue;
1540
1541 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1542 Assert(!SawNest, "More than one parameter has attribute nest!", V)do { if (!(!SawNest)) { CheckFailed("More than one parameter has attribute nest!"
, V); return; } } while (false)
;
1543 SawNest = true;
1544 }
1545
1546 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1547 Assert(!SawReturned, "More than one parameter has attribute returned!",do { if (!(!SawReturned)) { CheckFailed("More than one parameter has attribute returned!"
, V); return; } } while (false)
1548 V)do { if (!(!SawReturned)) { CheckFailed("More than one parameter has attribute returned!"
, V); return; } } while (false)
;
1549 Assert(Ty->canLosslesslyBitCastTo(FT->getReturnType()),do { if (!(Ty->canLosslesslyBitCastTo(FT->getReturnType
()))) { CheckFailed("Incompatible " "argument and return types for 'returned' attribute"
, V); return; } } while (false)
1550 "Incompatible "do { if (!(Ty->canLosslesslyBitCastTo(FT->getReturnType
()))) { CheckFailed("Incompatible " "argument and return types for 'returned' attribute"
, V); return; } } while (false)
1551 "argument and return types for 'returned' attribute",do { if (!(Ty->canLosslesslyBitCastTo(FT->getReturnType
()))) { CheckFailed("Incompatible " "argument and return types for 'returned' attribute"
, V); return; } } while (false)
1552 V)do { if (!(Ty->canLosslesslyBitCastTo(FT->getReturnType
()))) { CheckFailed("Incompatible " "argument and return types for 'returned' attribute"
, V); return; } } while (false)
;
1553 SawReturned = true;
1554 }
1555
1556 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
1557 Assert(!SawSRet, "Cannot have multiple 'sret' parameters!", V)do { if (!(!SawSRet)) { CheckFailed("Cannot have multiple 'sret' parameters!"
, V); return; } } while (false)
;
1558 Assert(Idx == 1 || Idx == 2,do { if (!(Idx == 1 || Idx == 2)) { CheckFailed("Attribute 'sret' is not on first or second parameter!"
, V); return; } } while (false)
1559 "Attribute 'sret' is not on first or second parameter!", V)do { if (!(Idx == 1 || Idx == 2)) { CheckFailed("Attribute 'sret' is not on first or second parameter!"
, V); return; } } while (false)
;
1560 SawSRet = true;
1561 }
1562
1563 if (Attrs.hasAttribute(Idx, Attribute::SwiftSelf)) {
1564 Assert(!SawSwiftSelf, "Cannot have multiple 'swiftself' parameters!", V)do { if (!(!SawSwiftSelf)) { CheckFailed("Cannot have multiple 'swiftself' parameters!"
, V); return; } } while (false)
;
1565 SawSwiftSelf = true;
1566 }
1567
1568 if (Attrs.hasAttribute(Idx, Attribute::SwiftError)) {
1569 Assert(!SawSwiftError, "Cannot have multiple 'swifterror' parameters!",do { if (!(!SawSwiftError)) { CheckFailed("Cannot have multiple 'swifterror' parameters!"
, V); return; } } while (false)
1570 V)do { if (!(!SawSwiftError)) { CheckFailed("Cannot have multiple 'swifterror' parameters!"
, V); return; } } while (false)
;
1571 SawSwiftError = true;
1572 }
1573
1574 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
1575 Assert(Idx == FT->getNumParams(), "inalloca isn't on the last parameter!",do { if (!(Idx == FT->getNumParams())) { CheckFailed("inalloca isn't on the last parameter!"
, V); return; } } while (false)
1576 V)do { if (!(Idx == FT->getNumParams())) { CheckFailed("inalloca isn't on the last parameter!"
, V); return; } } while (false)
;
1577 }
1578 }
1579
1580 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
1581 return;
1582
1583 verifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
1584
1585 Assert(do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::ReadOnly)))) { CheckFailed("Attributes 'readnone and readonly' are incompatible!"
, V); return; } } while (false)
1586 !(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::ReadNone) &&do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::ReadOnly)))) { CheckFailed("Attributes 'readnone and readonly' are incompatible!"
, V); return; } } while (false)
1587 Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::ReadOnly)),do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::ReadOnly)))) { CheckFailed("Attributes 'readnone and readonly' are incompatible!"
, V); return; } } while (false)
1588 "Attributes 'readnone and readonly' are incompatible!", V)do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::ReadOnly)))) { CheckFailed("Attributes 'readnone and readonly' are incompatible!"
, V); return; } } while (false)
;
1589
1590 Assert(do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::WriteOnly)))) { CheckFailed("Attributes 'readnone and writeonly' are incompatible!"
, V); return; } } while (false)
1591 !(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::ReadNone) &&do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::WriteOnly)))) { CheckFailed("Attributes 'readnone and writeonly' are incompatible!"
, V); return; } } while (false)
1592 Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::WriteOnly)),do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::WriteOnly)))) { CheckFailed("Attributes 'readnone and writeonly' are incompatible!"
, V); return; } } while (false)
1593 "Attributes 'readnone and writeonly' are incompatible!", V)do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::WriteOnly)))) { CheckFailed("Attributes 'readnone and writeonly' are incompatible!"
, V); return; } } while (false)
;
1594
1595 Assert(do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadOnly) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::WriteOnly)))) { CheckFailed("Attributes 'readonly and writeonly' are incompatible!"
, V); return; } } while (false)
1596 !(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::ReadOnly) &&do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadOnly) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::WriteOnly)))) { CheckFailed("Attributes 'readonly and writeonly' are incompatible!"
, V); return; } } while (false)
1597 Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::WriteOnly)),do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadOnly) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::WriteOnly)))) { CheckFailed("Attributes 'readonly and writeonly' are incompatible!"
, V); return; } } while (false)
1598 "Attributes 'readonly and writeonly' are incompatible!", V)do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadOnly) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::WriteOnly)))) { CheckFailed("Attributes 'readonly and writeonly' are incompatible!"
, V); return; } } while (false)
;
1599
1600 Assert(do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOrArgMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblemem_or_argmemonly' are incompatible!"
, V); return; } } while (false)
1601 !(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::ReadNone) &&do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOrArgMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblemem_or_argmemonly' are incompatible!"
, V); return; } } while (false)
1602 Attrs.hasAttribute(AttributeSet::FunctionIndex,do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOrArgMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblemem_or_argmemonly' are incompatible!"
, V); return; } } while (false)
1603 Attribute::InaccessibleMemOrArgMemOnly)),do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOrArgMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblemem_or_argmemonly' are incompatible!"
, V); return; } } while (false)
1604 "Attributes 'readnone and inaccessiblemem_or_argmemonly' are incompatible!", V)do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOrArgMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblemem_or_argmemonly' are incompatible!"
, V); return; } } while (false)
;
1605
1606 Assert(do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblememonly' are incompatible!"
, V); return; } } while (false)
1607 !(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::ReadNone) &&do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblememonly' are incompatible!"
, V); return; } } while (false)
1608 Attrs.hasAttribute(AttributeSet::FunctionIndex,do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblememonly' are incompatible!"
, V); return; } } while (false)
1609 Attribute::InaccessibleMemOnly)),do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblememonly' are incompatible!"
, V); return; } } while (false)
1610 "Attributes 'readnone and inaccessiblememonly' are incompatible!", V)do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::ReadNone) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::InaccessibleMemOnly)))) { CheckFailed("Attributes 'readnone and inaccessiblememonly' are incompatible!"
, V); return; } } while (false)
;
1611
1612 Assert(do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::NoInline) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::AlwaysInline)))) { CheckFailed("Attributes 'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
1613 !(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::NoInline) &&do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::NoInline) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::AlwaysInline)))) { CheckFailed("Attributes 'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
1614 Attrs.hasAttribute(AttributeSet::FunctionIndex,do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::NoInline) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::AlwaysInline)))) { CheckFailed("Attributes 'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
1615 Attribute::AlwaysInline)),do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::NoInline) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::AlwaysInline)))) { CheckFailed("Attributes 'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
1616 "Attributes 'noinline and alwaysinline' are incompatible!", V)do { if (!(!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::NoInline) && Attrs.hasAttribute(AttributeSet::FunctionIndex
, Attribute::AlwaysInline)))) { CheckFailed("Attributes 'noinline and alwaysinline' are incompatible!"
, V); return; } } while (false)
;
1617
1618 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1619 Attribute::OptimizeNone)) {
1620 Assert(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::NoInline),do { if (!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::NoInline))) { CheckFailed("Attribute 'optnone' requires 'noinline'!"
, V); return; } } while (false)
1621 "Attribute 'optnone' requires 'noinline'!", V)do { if (!(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::NoInline))) { CheckFailed("Attribute 'optnone' requires 'noinline'!"
, V); return; } } while (false)
;
1622
1623 Assert(!Attrs.hasAttribute(AttributeSet::FunctionIndex,do { if (!(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::OptimizeForSize))) { CheckFailed("Attributes 'optsize and optnone' are incompatible!"
, V); return; } } while (false)
1624 Attribute::OptimizeForSize),do { if (!(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::OptimizeForSize))) { CheckFailed("Attributes 'optsize and optnone' are incompatible!"
, V); return; } } while (false)
1625 "Attributes 'optsize and optnone' are incompatible!", V)do { if (!(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::OptimizeForSize))) { CheckFailed("Attributes 'optsize and optnone' are incompatible!"
, V); return; } } while (false)
;
1626
1627 Assert(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::MinSize),do { if (!(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::MinSize))) { CheckFailed("Attributes 'minsize and optnone' are incompatible!"
, V); return; } } while (false)
1628 "Attributes 'minsize and optnone' are incompatible!", V)do { if (!(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::MinSize))) { CheckFailed("Attributes 'minsize and optnone' are incompatible!"
, V); return; } } while (false)
;
1629 }
1630
1631 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1632 Attribute::JumpTable)) {
1633 const GlobalValue *GV = cast<GlobalValue>(V);
1634 Assert(GV->hasGlobalUnnamedAddr(),do { if (!(GV->hasGlobalUnnamedAddr())) { CheckFailed("Attribute 'jumptable' requires 'unnamed_addr'"
, V); return; } } while (false)
1635 "Attribute 'jumptable' requires 'unnamed_addr'", V)do { if (!(GV->hasGlobalUnnamedAddr())) { CheckFailed("Attribute 'jumptable' requires 'unnamed_addr'"
, V); return; } } while (false)
;
1636 }
1637
1638 if (Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::AllocSize)) {
1639 std::pair<unsigned, Optional<unsigned>> Args =
1640 Attrs.getAllocSizeArgs(AttributeSet::FunctionIndex);
1641
1642 auto CheckParam = [&](StringRef Name, unsigned ParamNo) {
1643 if (ParamNo >= FT->getNumParams()) {
1644 CheckFailed("'allocsize' " + Name + " argument is out of bounds", V);
1645 return false;
1646 }
1647
1648 if (!FT->getParamType(ParamNo)->isIntegerTy()) {
1649 CheckFailed("'allocsize' " + Name +
1650 " argument must refer to an integer parameter",
1651 V);
1652 return false;
1653 }
1654
1655 return true;
1656 };
1657
1658 if (!CheckParam("element size", Args.first))
1659 return;
1660
1661 if (Args.second && !CheckParam("number of elements", *Args.second))
1662 return;
1663 }
1664}
1665
1666void Verifier::verifyFunctionMetadata(
1667 ArrayRef<std::pair<unsigned, MDNode *>> MDs) {
1668 for (const auto &Pair : MDs) {
1669 if (Pair.first == LLVMContext::MD_prof) {
1670 MDNode *MD = Pair.second;
1671 Assert(MD->getNumOperands() >= 2,do { if (!(MD->getNumOperands() >= 2)) { CheckFailed("!prof annotations should have no less than 2 operands"
, MD); return; } } while (false)
1672 "!prof annotations should have no less than 2 operands", MD)do { if (!(MD->getNumOperands() >= 2)) { CheckFailed("!prof annotations should have no less than 2 operands"
, MD); return; } } while (false)
;
1673
1674 // Check first operand.
1675 Assert(MD->getOperand(0) != nullptr, "first operand should not be null",do { if (!(MD->getOperand(0) != nullptr)) { CheckFailed("first operand should not be null"
, MD); return; } } while (false)
1676 MD)do { if (!(MD->getOperand(0) != nullptr)) { CheckFailed("first operand should not be null"
, MD); return; } } while (false)
;
1677 Assert(isa<MDString>(MD->getOperand(0)),do { if (!(isa<MDString>(MD->getOperand(0)))) { CheckFailed
("expected string with name of the !prof annotation", MD); return
; } } while (false)
1678 "expected string with name of the !prof annotation", MD)do { if (!(isa<MDString>(MD->getOperand(0)))) { CheckFailed
("expected string with name of the !prof annotation", MD); return
; } } while (false)
;
1679 MDString *MDS = cast<MDString>(MD->getOperand(0));
1680 StringRef ProfName = MDS->getString();
1681 Assert(ProfName.equals("function_entry_count"),do { if (!(ProfName.equals("function_entry_count"))) { CheckFailed
("first operand should be 'function_entry_count'", MD); return
; } } while (false)
1682 "first operand should be 'function_entry_count'", MD)do { if (!(ProfName.equals("function_entry_count"))) { CheckFailed
("first operand should be 'function_entry_count'", MD); return
; } } while (false)
;
1683
1684 // Check second operand.
1685 Assert(MD->getOperand(1) != nullptr, "second operand should not be null",do { if (!(MD->getOperand(1) != nullptr)) { CheckFailed("second operand should not be null"
, MD); return; } } while (false)
1686 MD)do { if (!(MD->getOperand(1) != nullptr)) { CheckFailed("second operand should not be null"
, MD); return; } } while (false)
;
1687 Assert(isa<ConstantAsMetadata>(MD->getOperand(1)),do { if (!(isa<ConstantAsMetadata>(MD->getOperand(1)
))) { CheckFailed("expected integer argument to function_entry_count"
, MD); return; } } while (false)
1688 "expected integer argument to function_entry_count", MD)do { if (!(isa<ConstantAsMetadata>(MD->getOperand(1)
))) { CheckFailed("expected integer argument to function_entry_count"
, MD); return; } } while (false)
;
1689 }
1690 }
1691}
1692
1693void Verifier::visitConstantExprsRecursively(const Constant *EntryC) {
1694 if (!ConstantExprVisited.insert(EntryC).second)
1695 return;
1696
1697 SmallVector<const Constant *, 16> Stack;
1698 Stack.push_back(EntryC);
1699
1700 while (!Stack.empty()) {
1701 const Constant *C = Stack.pop_back_val();
1702
1703 // Check this constant expression.
1704 if (const auto *CE = dyn_cast<ConstantExpr>(C))
1705 visitConstantExpr(CE);
1706
1707 if (const auto *GV = dyn_cast<GlobalValue>(C)) {
1708 // Global Values get visited separately, but we do need to make sure
1709 // that the global value is in the correct module
1710 Assert(GV->getParent() == &M, "Referencing global in another module!",do { if (!(GV->getParent() == &M)) { CheckFailed("Referencing global in another module!"
, EntryC, &M, GV, GV->getParent()); return; } } while (
false)
1711 EntryC, &M, GV, GV->getParent())do { if (!(GV->getParent() == &M)) { CheckFailed("Referencing global in another module!"
, EntryC, &M, GV, GV->getParent()); return; } } while (
false)
;
1712 continue;
1713 }
1714
1715 // Visit all sub-expressions.
1716 for (const Use &U : C->operands()) {
1717 const auto *OpC = dyn_cast<Constant>(U);
1718 if (!OpC)
1719 continue;
1720 if (!ConstantExprVisited.insert(OpC).second)
1721 continue;
1722 Stack.push_back(OpC);
1723 }
1724 }
1725}
1726
1727void Verifier::visitConstantExpr(const ConstantExpr *CE) {
1728 if (CE->getOpcode() == Instruction::BitCast)
1729 Assert(CastInst::castIsValid(Instruction::BitCast, CE->getOperand(0),do { if (!(CastInst::castIsValid(Instruction::BitCast, CE->
getOperand(0), CE->getType()))) { CheckFailed("Invalid bitcast"
, CE); return; } } while (false)
1730 CE->getType()),do { if (!(CastInst::castIsValid(Instruction::BitCast, CE->
getOperand(0), CE->getType()))) { CheckFailed("Invalid bitcast"
, CE); return; } } while (false)
1731 "Invalid bitcast", CE)do { if (!(CastInst::castIsValid(Instruction::BitCast, CE->
getOperand(0), CE->getType()))) { CheckFailed("Invalid bitcast"
, CE); return; } } while (false)
;
1732
1733 if (CE->getOpcode() == Instruction::IntToPtr ||
1734 CE->getOpcode() == Instruction::PtrToInt) {
1735 auto *PtrTy = CE->getOpcode() == Instruction::IntToPtr
1736 ? CE->getType()
1737 : CE->getOperand(0)->getType();
1738 StringRef Msg = CE->getOpcode() == Instruction::IntToPtr
1739 ? "inttoptr not supported for non-integral pointers"
1740 : "ptrtoint not supported for non-integral pointers";
1741 Assert(do { if (!(!DL.isNonIntegralPointerType(cast<PointerType>
(PtrTy->getScalarType())))) { CheckFailed(Msg); return; } }
while (false)
1742 !DL.isNonIntegralPointerType(cast<PointerType>(PtrTy->getScalarType())),do { if (!(!DL.isNonIntegralPointerType(cast<PointerType>
(PtrTy->getScalarType())))) { CheckFailed(Msg); return; } }
while (false)
1743 Msg)do { if (!(!DL.isNonIntegralPointerType(cast<PointerType>
(PtrTy->getScalarType())))) { CheckFailed(Msg); return; } }
while (false)
;
1744 }
1745}
1746
1747bool Verifier::verifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1748 if (Attrs.getNumSlots() == 0)
1749 return true;
1750
1751 unsigned LastSlot = Attrs.getNumSlots() - 1;
1752 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1753 if (LastIndex <= Params
1754 || (LastIndex == AttributeSet::FunctionIndex
1755 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1756 return true;
1757
1758 return false;
1759}
1760
1761/// Verify that statepoint intrinsic is well formed.
1762void Verifier::verifyStatepoint(ImmutableCallSite CS) {
1763 assert(CS.getCalledFunction() &&((CS.getCalledFunction() && CS.getCalledFunction()->
getIntrinsicID() == Intrinsic::experimental_gc_statepoint) ? static_cast
<void> (0) : __assert_fail ("CS.getCalledFunction() && CS.getCalledFunction()->getIntrinsicID() == Intrinsic::experimental_gc_statepoint"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 1765, __PRETTY_FUNCTION__))
1764 CS.getCalledFunction()->getIntrinsicID() ==((CS.getCalledFunction() && CS.getCalledFunction()->
getIntrinsicID() == Intrinsic::experimental_gc_statepoint) ? static_cast
<void> (0) : __assert_fail ("CS.getCalledFunction() && CS.getCalledFunction()->getIntrinsicID() == Intrinsic::experimental_gc_statepoint"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 1765, __PRETTY_FUNCTION__))
1765 Intrinsic::experimental_gc_statepoint)((CS.getCalledFunction() && CS.getCalledFunction()->
getIntrinsicID() == Intrinsic::experimental_gc_statepoint) ? static_cast
<void> (0) : __assert_fail ("CS.getCalledFunction() && CS.getCalledFunction()->getIntrinsicID() == Intrinsic::experimental_gc_statepoint"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 1765, __PRETTY_FUNCTION__))
;
1766
1767 const Instruction &CI = *CS.getInstruction();
1768
1769 Assert(!CS.doesNotAccessMemory() && !CS.onlyReadsMemory() &&do { if (!(!CS.doesNotAccessMemory() && !CS.onlyReadsMemory
() && !CS.onlyAccessesArgMemory())) { CheckFailed("gc.statepoint must read and write all memory to preserve "
"reordering restrictions required by safepoint semantics", &
CI); return; } } while (false)
1770 !CS.onlyAccessesArgMemory(),do { if (!(!CS.doesNotAccessMemory() && !CS.onlyReadsMemory
() && !CS.onlyAccessesArgMemory())) { CheckFailed("gc.statepoint must read and write all memory to preserve "
"reordering restrictions required by safepoint semantics", &
CI); return; } } while (false)
1771 "gc.statepoint must read and write all memory to preserve "do { if (!(!CS.doesNotAccessMemory() && !CS.onlyReadsMemory
() && !CS.onlyAccessesArgMemory())) { CheckFailed("gc.statepoint must read and write all memory to preserve "
"reordering restrictions required by safepoint semantics", &
CI); return; } } while (false)
1772 "reordering restrictions required by safepoint semantics",do { if (!(!CS.doesNotAccessMemory() && !CS.onlyReadsMemory
() && !CS.onlyAccessesArgMemory())) { CheckFailed("gc.statepoint must read and write all memory to preserve "
"reordering restrictions required by safepoint semantics", &
CI); return; } } while (false)
1773 &CI)do { if (!(!CS.doesNotAccessMemory() && !CS.onlyReadsMemory
() && !CS.onlyAccessesArgMemory())) { CheckFailed("gc.statepoint must read and write all memory to preserve "
"reordering restrictions required by safepoint semantics", &
CI); return; } } while (false)
;
1774
1775 const Value *IDV = CS.getArgument(0);
1776 Assert(isa<ConstantInt>(IDV), "gc.statepoint ID must be a constant integer",do { if (!(isa<ConstantInt>(IDV))) { CheckFailed("gc.statepoint ID must be a constant integer"
, &CI); return; } } while (false)
1777 &CI)do { if (!(isa<ConstantInt>(IDV))) { CheckFailed("gc.statepoint ID must be a constant integer"
, &CI); return; } } while (false)
;
1778
1779 const Value *NumPatchBytesV = CS.getArgument(1);
1780 Assert(isa<ConstantInt>(NumPatchBytesV),do { if (!(isa<ConstantInt>(NumPatchBytesV))) { CheckFailed
("gc.statepoint number of patchable bytes must be a constant integer"
, &CI); return; } } while (false)
1781 "gc.statepoint number of patchable bytes must be a constant integer",do { if (!(isa<ConstantInt>(NumPatchBytesV))) { CheckFailed
("gc.statepoint number of patchable bytes must be a constant integer"
, &CI); return; } } while (false)
1782 &CI)do { if (!(isa<ConstantInt>(NumPatchBytesV))) { CheckFailed
("gc.statepoint number of patchable bytes must be a constant integer"
, &CI); return; } } while (false)
;
1783 const int64_t NumPatchBytes =
1784 cast<ConstantInt>(NumPatchBytesV)->getSExtValue();
1785 assert(isInt<32>(NumPatchBytes) && "NumPatchBytesV is an i32!")((isInt<32>(NumPatchBytes) && "NumPatchBytesV is an i32!"
) ? static_cast<void> (0) : __assert_fail ("isInt<32>(NumPatchBytes) && \"NumPatchBytesV is an i32!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 1785, __PRETTY_FUNCTION__))
;
1786 Assert(NumPatchBytes >= 0, "gc.statepoint number of patchable bytes must be "do { if (!(NumPatchBytes >= 0)) { CheckFailed("gc.statepoint number of patchable bytes must be "
"positive", &CI); return; } } while (false)
1787 "positive",do { if (!(NumPatchBytes >= 0)) { CheckFailed("gc.statepoint number of patchable bytes must be "
"positive", &CI); return; } } while (false)
1788 &CI)do { if (!(NumPatchBytes >= 0)) { CheckFailed("gc.statepoint number of patchable bytes must be "
"positive", &CI); return; } } while (false)
;
1789
1790 const Value *Target = CS.getArgument(2);
1791 auto *PT = dyn_cast<PointerType>(Target->getType());
1792 Assert(PT && PT->getElementType()->isFunctionTy(),do { if (!(PT && PT->getElementType()->isFunctionTy
())) { CheckFailed("gc.statepoint callee must be of function pointer type"
, &CI, Target); return; } } while (false)
1793 "gc.statepoint callee must be of function pointer type", &CI, Target)do { if (!(PT && PT->getElementType()->isFunctionTy
())) { CheckFailed("gc.statepoint callee must be of function pointer type"
, &CI, Target); return; } } while (false)
;
1794 FunctionType *TargetFuncType = cast<FunctionType>(PT->getElementType());
1795
1796 const Value *NumCallArgsV = CS.getArgument(3);
1797 Assert(isa<ConstantInt>(NumCallArgsV),do { if (!(isa<ConstantInt>(NumCallArgsV))) { CheckFailed
("gc.statepoint number of arguments to underlying call " "must be constant integer"
, &CI); return; } } while (false)
1798 "gc.statepoint number of arguments to underlying call "do { if (!(isa<ConstantInt>(NumCallArgsV))) { CheckFailed
("gc.statepoint number of arguments to underlying call " "must be constant integer"
, &CI); return; } } while (false)
1799 "must be constant integer",do { if (!(isa<ConstantInt>(NumCallArgsV))) { CheckFailed
("gc.statepoint number of arguments to underlying call " "must be constant integer"
, &CI); return; } } while (false)
1800 &CI)do { if (!(isa<ConstantInt>(NumCallArgsV))) { CheckFailed
("gc.statepoint number of arguments to underlying call " "must be constant integer"
, &CI); return; } } while (false)
;
1801 const int NumCallArgs = cast<ConstantInt>(NumCallArgsV)->getZExtValue();
1802 Assert(NumCallArgs >= 0,do { if (!(NumCallArgs >= 0)) { CheckFailed("gc.statepoint number of arguments to underlying call "
"must be positive", &CI); return; } } while (false)
1803 "gc.statepoint number of arguments to underlying call "do { if (!(NumCallArgs >= 0)) { CheckFailed("gc.statepoint number of arguments to underlying call "
"must be positive", &CI); return; } } while (false)
1804 "must be positive",do { if (!(NumCallArgs >= 0)) { CheckFailed("gc.statepoint number of arguments to underlying call "
"must be positive", &CI); return; } } while (false)
1805 &CI)do { if (!(NumCallArgs >= 0)) { CheckFailed("gc.statepoint number of arguments to underlying call "
"must be positive", &CI); return; } } while (false)
;
1806 const int NumParams = (int)TargetFuncType->getNumParams();
1807 if (TargetFuncType->isVarArg()) {
1808 Assert(NumCallArgs >= NumParams,do { if (!(NumCallArgs >= NumParams)) { CheckFailed("gc.statepoint mismatch in number of vararg call args"
, &CI); return; } } while (false)
1809 "gc.statepoint mismatch in number of vararg call args", &CI)do { if (!(NumCallArgs >= NumParams)) { CheckFailed("gc.statepoint mismatch in number of vararg call args"
, &CI); return; } } while (false)
;
1810
1811 // TODO: Remove this limitation
1812 Assert(TargetFuncType->getReturnType()->isVoidTy(),do { if (!(TargetFuncType->getReturnType()->isVoidTy())
) { CheckFailed("gc.statepoint doesn't support wrapping non-void "
"vararg functions yet", &CI); return; } } while (false)
1813 "gc.statepoint doesn't support wrapping non-void "do { if (!(TargetFuncType->getReturnType()->isVoidTy())
) { CheckFailed("gc.statepoint doesn't support wrapping non-void "
"vararg functions yet", &CI); return; } } while (false)
1814 "vararg functions yet",do { if (!(TargetFuncType->getReturnType()->isVoidTy())
) { CheckFailed("gc.statepoint doesn't support wrapping non-void "
"vararg functions yet", &CI); return; } } while (false)
1815 &CI)do { if (!(TargetFuncType->getReturnType()->isVoidTy())
) { CheckFailed("gc.statepoint doesn't support wrapping non-void "
"vararg functions yet", &CI); return; } } while (false)
;
1816 } else
1817 Assert(NumCallArgs == NumParams,do { if (!(NumCallArgs == NumParams)) { CheckFailed("gc.statepoint mismatch in number of call args"
, &CI); return; } } while (false)
1818 "gc.statepoint mismatch in number of call args", &CI)do { if (!(NumCallArgs == NumParams)) { CheckFailed("gc.statepoint mismatch in number of call args"
, &CI); return; } } while (false)
;
1819
1820 const Value *FlagsV = CS.getArgument(4);
1821 Assert(isa<ConstantInt>(FlagsV),do { if (!(isa<ConstantInt>(FlagsV))) { CheckFailed("gc.statepoint flags must be constant integer"
, &CI); return; } } while (false)
1822 "gc.statepoint flags must be constant integer", &CI)do { if (!(isa<ConstantInt>(FlagsV))) { CheckFailed("gc.statepoint flags must be constant integer"
, &CI); return; } } while (false)
;
1823 const uint64_t Flags = cast<ConstantInt>(FlagsV)->getZExtValue();
1824 Assert((Flags & ~(uint64_t)StatepointFlags::MaskAll) == 0,do { if (!((Flags & ~(uint64_t)StatepointFlags::MaskAll) ==
0)) { CheckFailed("unknown flag used in gc.statepoint flags argument"
, &CI); return; } } while (false)
1825 "unknown flag used in gc.statepoint flags argument", &CI)do { if (!((Flags & ~(uint64_t)StatepointFlags::MaskAll) ==
0)) { CheckFailed("unknown flag used in gc.statepoint flags argument"
, &CI); return; } } while (false)
;
1826
1827 // Verify that the types of the call parameter arguments match
1828 // the type of the wrapped callee.
1829 for (int i = 0; i < NumParams; i++) {
1830 Type *ParamType = TargetFuncType->getParamType(i);
1831 Type *ArgType = CS.getArgument(5 + i)->getType();
1832 Assert(ArgType == ParamType,do { if (!(ArgType == ParamType)) { CheckFailed("gc.statepoint call argument does not match wrapped "
"function type", &CI); return; } } while (false)
1833 "gc.statepoint call argument does not match wrapped "do { if (!(ArgType == ParamType)) { CheckFailed("gc.statepoint call argument does not match wrapped "
"function type", &CI); return; } } while (false)
1834 "function type",do { if (!(ArgType == ParamType)) { CheckFailed("gc.statepoint call argument does not match wrapped "
"function type", &CI); return; } } while (false)
1835 &CI)do { if (!(ArgType == ParamType)) { CheckFailed("gc.statepoint call argument does not match wrapped "
"function type", &CI); return; } } while (false)
;
1836 }
1837
1838 const int EndCallArgsInx = 4 + NumCallArgs;
1839
1840 const Value *NumTransitionArgsV = CS.getArgument(EndCallArgsInx+1);
1841 Assert(isa<ConstantInt>(NumTransitionArgsV),do { if (!(isa<ConstantInt>(NumTransitionArgsV))) { CheckFailed
("gc.statepoint number of transition arguments " "must be constant integer"
, &CI); return; } } while (false)
1842 "gc.statepoint number of transition arguments "do { if (!(isa<ConstantInt>(NumTransitionArgsV))) { CheckFailed
("gc.statepoint number of transition arguments " "must be constant integer"
, &CI); return; } } while (false)
1843 "must be constant integer",do { if (!(isa<ConstantInt>(NumTransitionArgsV))) { CheckFailed
("gc.statepoint number of transition arguments " "must be constant integer"
, &CI); return; } } while (false)
1844 &CI)do { if (!(isa<ConstantInt>(NumTransitionArgsV))) { CheckFailed
("gc.statepoint number of transition arguments " "must be constant integer"
, &CI); return; } } while (false)
;
1845 const int NumTransitionArgs =
1846 cast<ConstantInt>(NumTransitionArgsV)->getZExtValue();
1847 Assert(NumTransitionArgs >= 0,do { if (!(NumTransitionArgs >= 0)) { CheckFailed("gc.statepoint number of transition arguments must be positive"
, &CI); return; } } while (false)
1848 "gc.statepoint number of transition arguments must be positive", &CI)do { if (!(NumTransitionArgs >= 0)) { CheckFailed("gc.statepoint number of transition arguments must be positive"
, &CI); return; } } while (false)
;
1849 const int EndTransitionArgsInx = EndCallArgsInx + 1 + NumTransitionArgs;
1850
1851 const Value *NumDeoptArgsV = CS.getArgument(EndTransitionArgsInx+1);
1852 Assert(isa<ConstantInt>(NumDeoptArgsV),do { if (!(isa<ConstantInt>(NumDeoptArgsV))) { CheckFailed
("gc.statepoint number of deoptimization arguments " "must be constant integer"
, &CI); return; } } while (false)
1853 "gc.statepoint number of deoptimization arguments "do { if (!(isa<ConstantInt>(NumDeoptArgsV))) { CheckFailed
("gc.statepoint number of deoptimization arguments " "must be constant integer"
, &CI); return; } } while (false)
1854 "must be constant integer",do { if (!(isa<ConstantInt>(NumDeoptArgsV))) { CheckFailed
("gc.statepoint number of deoptimization arguments " "must be constant integer"
, &CI); return; } } while (false)
1855 &CI)do { if (!(isa<ConstantInt>(NumDeoptArgsV))) { CheckFailed
("gc.statepoint number of deoptimization arguments " "must be constant integer"
, &CI); return; } } while (false)
;
1856 const int NumDeoptArgs = cast<ConstantInt>(NumDeoptArgsV)->getZExtValue();
1857 Assert(NumDeoptArgs >= 0, "gc.statepoint number of deoptimization arguments "do { if (!(NumDeoptArgs >= 0)) { CheckFailed("gc.statepoint number of deoptimization arguments "
"must be positive", &CI); return; } } while (false)
1858 "must be positive",do { if (!(NumDeoptArgs >= 0)) { CheckFailed("gc.statepoint number of deoptimization arguments "
"must be positive", &CI); return; } } while (false)
1859 &CI)do { if (!(NumDeoptArgs >= 0)) { CheckFailed("gc.statepoint number of deoptimization arguments "
"must be positive", &CI); return; } } while (false)
;
1860
1861 const int ExpectedNumArgs =
1862 7 + NumCallArgs + NumTransitionArgs + NumDeoptArgs;
1863 Assert(ExpectedNumArgs <= (int)CS.arg_size(),do { if (!(ExpectedNumArgs <= (int)CS.arg_size())) { CheckFailed
("gc.statepoint too few arguments according to length fields"
, &CI); return; } } while (false)
1864 "gc.statepoint too few arguments according to length fields", &CI)do { if (!(ExpectedNumArgs <= (int)CS.arg_size())) { CheckFailed
("gc.statepoint too few arguments according to length fields"
, &CI); return; } } while (false)
;
1865
1866 // Check that the only uses of this gc.statepoint are gc.result or
1867 // gc.relocate calls which are tied to this statepoint and thus part
1868 // of the same statepoint sequence
1869 for (const User *U : CI.users()) {
1870 const CallInst *Call = dyn_cast<const CallInst>(U);
1871 Assert(Call, "illegal use of statepoint token", &CI, U)do { if (!(Call)) { CheckFailed("illegal use of statepoint token"
, &CI, U); return; } } while (false)
;
1872 if (!Call) continue;
1873 Assert(isa<GCRelocateInst>(Call) || isa<GCResultInst>(Call),do { if (!(isa<GCRelocateInst>(Call) || isa<GCResultInst
>(Call))) { CheckFailed("gc.result or gc.relocate are the only value uses "
"of a gc.statepoint", &CI, U); return; } } while (false)
1874 "gc.result or gc.relocate are the only value uses "do { if (!(isa<GCRelocateInst>(Call) || isa<GCResultInst
>(Call))) { CheckFailed("gc.result or gc.relocate are the only value uses "
"of a gc.statepoint", &CI, U); return; } } while (false)
1875 "of a gc.statepoint",do { if (!(isa<GCRelocateInst>(Call) || isa<GCResultInst
>(Call))) { CheckFailed("gc.result or gc.relocate are the only value uses "
"of a gc.statepoint", &CI, U); return; } } while (false)
1876 &CI, U)do { if (!(isa<GCRelocateInst>(Call) || isa<GCResultInst
>(Call))) { CheckFailed("gc.result or gc.relocate are the only value uses "
"of a gc.statepoint", &CI, U); return; } } while (false)
;
1877 if (isa<GCResultInst>(Call)) {
1878 Assert(Call->getArgOperand(0) == &CI,do { if (!(Call->getArgOperand(0) == &CI)) { CheckFailed
("gc.result connected to wrong gc.statepoint", &CI, Call)
; return; } } while (false)
1879 "gc.result connected to wrong gc.statepoint", &CI, Call)do { if (!(Call->getArgOperand(0) == &CI)) { CheckFailed
("gc.result connected to wrong gc.statepoint", &CI, Call)
; return; } } while (false)
;
1880 } else if (isa<GCRelocateInst>(Call)) {
1881 Assert(Call->getArgOperand(0) == &CI,do { if (!(Call->getArgOperand(0) == &CI)) { CheckFailed
("gc.relocate connected to wrong gc.statepoint", &CI, Call
); return; } } while (false)
1882 "gc.relocate connected to wrong gc.statepoint", &CI, Call)do { if (!(Call->getArgOperand(0) == &CI)) { CheckFailed
("gc.relocate connected to wrong gc.statepoint", &CI, Call
); return; } } while (false)
;
1883 }
1884 }
1885
1886 // Note: It is legal for a single derived pointer to be listed multiple
1887 // times. It's non-optimal, but it is legal. It can also happen after
1888 // insertion if we strip a bitcast away.
1889 // Note: It is really tempting to check that each base is relocated and
1890 // that a derived pointer is never reused as a base pointer. This turns
1891 // out to be problematic since optimizations run after safepoint insertion
1892 // can recognize equality properties that the insertion logic doesn't know
1893 // about. See example statepoint.ll in the verifier subdirectory
1894}
1895
1896void Verifier::verifyFrameRecoverIndices() {
1897 for (auto &Counts : FrameEscapeInfo) {
1898 Function *F = Counts.first;
1899 unsigned EscapedObjectCount = Counts.second.first;
1900 unsigned MaxRecoveredIndex = Counts.second.second;
1901 Assert(MaxRecoveredIndex <= EscapedObjectCount,do { if (!(MaxRecoveredIndex <= EscapedObjectCount)) { CheckFailed
("all indices passed to llvm.localrecover must be less than the "
"number of arguments passed ot llvm.localescape in the parent "
"function", F); return; } } while (false)
1902 "all indices passed to llvm.localrecover must be less than the "do { if (!(MaxRecoveredIndex <= EscapedObjectCount)) { CheckFailed
("all indices passed to llvm.localrecover must be less than the "
"number of arguments passed ot llvm.localescape in the parent "
"function", F); return; } } while (false)
1903 "number of arguments passed ot llvm.localescape in the parent "do { if (!(MaxRecoveredIndex <= EscapedObjectCount)) { CheckFailed
("all indices passed to llvm.localrecover must be less than the "
"number of arguments passed ot llvm.localescape in the parent "
"function", F); return; } } while (false)
1904 "function",do { if (!(MaxRecoveredIndex <= EscapedObjectCount)) { CheckFailed
("all indices passed to llvm.localrecover must be less than the "
"number of arguments passed ot llvm.localescape in the parent "
"function", F); return; } } while (false)
1905 F)do { if (!(MaxRecoveredIndex <= EscapedObjectCount)) { CheckFailed
("all indices passed to llvm.localrecover must be less than the "
"number of arguments passed ot llvm.localescape in the parent "
"function", F); return; } } while (false)
;
1906 }
1907}
1908
1909static Instruction *getSuccPad(TerminatorInst *Terminator) {
1910 BasicBlock *UnwindDest;
1911 if (auto *II = dyn_cast<InvokeInst>(Terminator))
1912 UnwindDest = II->getUnwindDest();
1913 else if (auto *CSI = dyn_cast<CatchSwitchInst>(Terminator))
1914 UnwindDest = CSI->getUnwindDest();
1915 else
1916 UnwindDest = cast<CleanupReturnInst>(Terminator)->getUnwindDest();
1917 return UnwindDest->getFirstNonPHI();
1918}
1919
1920void Verifier::verifySiblingFuncletUnwinds() {
1921 SmallPtrSet<Instruction *, 8> Visited;
1922 SmallPtrSet<Instruction *, 8> Active;
1923 for (const auto &Pair : SiblingFuncletInfo) {
1924 Instruction *PredPad = Pair.first;
1925 if (Visited.count(PredPad))
1926 continue;
1927 Active.insert(PredPad);
1928 TerminatorInst *Terminator = Pair.second;
1929 do {
1930 Instruction *SuccPad = getSuccPad(Terminator);
1931 if (Active.count(SuccPad)) {
1932 // Found a cycle; report error
1933 Instruction *CyclePad = SuccPad;
1934 SmallVector<Instruction *, 8> CycleNodes;
1935 do {
1936 CycleNodes.push_back(CyclePad);
1937 TerminatorInst *CycleTerminator = SiblingFuncletInfo[CyclePad];
1938 if (CycleTerminator != CyclePad)
1939 CycleNodes.push_back(CycleTerminator);
1940 CyclePad = getSuccPad(CycleTerminator);
1941 } while (CyclePad != SuccPad);
1942 Assert(false, "EH pads can't handle each other's exceptions",do { if (!(false)) { CheckFailed("EH pads can't handle each other's exceptions"
, ArrayRef<Instruction *>(CycleNodes)); return; } } while
(false)
1943 ArrayRef<Instruction *>(CycleNodes))do { if (!(false)) { CheckFailed("EH pads can't handle each other's exceptions"
, ArrayRef<Instruction *>(CycleNodes)); return; } } while
(false)
;
1944 }
1945 // Don't re-walk a node we've already checked
1946 if (!Visited.insert(SuccPad).second)
1947 break;
1948 // Walk to this successor if it has a map entry.
1949 PredPad = SuccPad;
1950 auto TermI = SiblingFuncletInfo.find(PredPad);
1951 if (TermI == SiblingFuncletInfo.end())
1952 break;
1953 Terminator = TermI->second;
1954 Active.insert(PredPad);
1955 } while (true);
1956 // Each node only has one successor, so we've walked all the active
1957 // nodes' successors.
1958 Active.clear();
1959 }
1960}
1961
1962// visitFunction - Verify that a function is ok.
1963//
1964void Verifier::visitFunction(const Function &F) {
1965 visitGlobalValue(F);
1966
1967 // Check function arguments.
1968 FunctionType *FT = F.getFunctionType();
1969 unsigned NumArgs = F.arg_size();
1970
1971 Assert(&Context == &F.getContext(),do { if (!(&Context == &F.getContext())) { CheckFailed
("Function context does not match Module context!", &F); return
; } } while (false)
1972 "Function context does not match Module context!", &F)do { if (!(&Context == &F.getContext())) { CheckFailed
("Function context does not match Module context!", &F); return
; } } while (false)
;
1973
1974 Assert(!F.hasCommonLinkage(), "Functions may not have common linkage", &F)do { if (!(!F.hasCommonLinkage())) { CheckFailed("Functions may not have common linkage"
, &F); return; } } while (false)
;
1975 Assert(FT->getNumParams() == NumArgs,do { if (!(FT->getNumParams() == NumArgs)) { CheckFailed("# formal arguments must match # of arguments for function type!"
, &F, FT); return; } } while (false)
1976 "# formal arguments must match # of arguments for function type!", &F,do { if (!(FT->getNumParams() == NumArgs)) { CheckFailed("# formal arguments must match # of arguments for function type!"
, &F, FT); return; } } while (false)
1977 FT)do { if (!(FT->getNumParams() == NumArgs)) { CheckFailed("# formal arguments must match # of arguments for function type!"
, &F, FT); return; } } while (false)
;
1978 Assert(F.getReturnType()->isFirstClassType() ||do { if (!(F.getReturnType()->isFirstClassType() || F.getReturnType
()->isVoidTy() || F.getReturnType()->isStructTy())) { CheckFailed
("Functions cannot return aggregate values!", &F); return
; } } while (false)
1979 F.getReturnType()->isVoidTy() || F.getReturnType()->isStructTy(),do { if (!(F.getReturnType()->isFirstClassType() || F.getReturnType
()->isVoidTy() || F.getReturnType()->isStructTy())) { CheckFailed
("Functions cannot return aggregate values!", &F); return
; } } while (false)
1980 "Functions cannot return aggregate values!", &F)do { if (!(F.getReturnType()->isFirstClassType() || F.getReturnType
()->isVoidTy() || F.getReturnType()->isStructTy())) { CheckFailed
("Functions cannot return aggregate values!", &F); return
; } } while (false)
;
1981
1982 Assert(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),do { if (!(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy
())) { CheckFailed("Invalid struct return type!", &F); return
; } } while (false)
1983 "Invalid struct return type!", &F)do { if (!(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy
())) { CheckFailed("Invalid struct return type!", &F); return
; } } while (false)
;
1984
1985 AttributeSet Attrs = F.getAttributes();
1986
1987 Assert(verifyAttributeCount(Attrs, FT->getNumParams()),do { if (!(verifyAttributeCount(Attrs, FT->getNumParams())
)) { CheckFailed("Attribute after last parameter!", &F); return
; } } while (false)
1988 "Attribute after last parameter!", &F)do { if (!(verifyAttributeCount(Attrs, FT->getNumParams())
)) { CheckFailed("Attribute after last parameter!", &F); return
; } } while (false)
;
1989
1990 // Check function attributes.
1991 verifyFunctionAttrs(FT, Attrs, &F);
1992
1993 // On function declarations/definitions, we do not support the builtin
1994 // attribute. We do not check this in VerifyFunctionAttrs since that is
1995 // checking for Attributes that can/can not ever be on functions.
1996 Assert(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::Builtin),do { if (!(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::Builtin))) { CheckFailed("Attribute 'builtin' can only be applied to a callsite."
, &F); return; } } while (false)
1997 "Attribute 'builtin' can only be applied to a callsite.", &F)do { if (!(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute
::Builtin))) { CheckFailed("Attribute 'builtin' can only be applied to a callsite."
, &F); return; } } while (false)
;
1998
1999 // Check that this function meets the restrictions on this calling convention.
2000 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
2001 // restrictions can be lifted.
2002 switch (F.getCallingConv()) {
1
Control jumps to the 'default' case at line 2003
2003 default:
2004 case CallingConv::C:
2005 break;
2
Execution continues on line 2017
2006 case CallingConv::Fast:
2007 case CallingConv::Cold:
2008 case CallingConv::Intel_OCL_BI:
2009 case CallingConv::PTX_Kernel:
2010 case CallingConv::PTX_Device:
2011 Assert(!F.isVarArg(), "Calling convention does not support varargs or "do { if (!(!F.isVarArg())) { CheckFailed("Calling convention does not support varargs or "
"perfect forwarding!", &F); return; } } while (false)
2012 "perfect forwarding!",do { if (!(!F.isVarArg())) { CheckFailed("Calling convention does not support varargs or "
"perfect forwarding!", &F); return; } } while (false)
2013 &F)do { if (!(!F.isVarArg())) { CheckFailed("Calling convention does not support varargs or "
"perfect forwarding!", &F); return; } } while (false)
;
2014 break;
2015 }
2016
2017 bool isLLVMdotName = F.getName().size() >= 5 &&
3
Assuming the condition is false
2018 F.getName().substr(0, 5) == "llvm.";
2019
2020 // Check that the argument values match the function type for this function...
2021 unsigned i = 0;
2022 for (const Argument &Arg : F.args()) {
4
Assuming '__begin' is equal to '__end'
2023 Assert(Arg.getType() == FT->getParamType(i),do { if (!(Arg.getType() == FT->getParamType(i))) { CheckFailed
("Argument value does not match function argument type!", &
Arg, FT->getParamType(i)); return; } } while (false)
2024 "Argument value does not match function argument type!", &Arg,do { if (!(Arg.getType() == FT->getParamType(i))) { CheckFailed
("Argument value does not match function argument type!", &
Arg, FT->getParamType(i)); return; } } while (false)
2025 FT->getParamType(i))do { if (!(Arg.getType() == FT->getParamType(i))) { CheckFailed
("Argument value does not match function argument type!", &
Arg, FT->getParamType(i)); return; } } while (false)
;
2026 Assert(Arg.getType()->isFirstClassType(),do { if (!(Arg.getType()->isFirstClassType())) { CheckFailed
("Function arguments must have first-class types!", &Arg)
; return; } } while (false)
2027 "Function arguments must have first-class types!", &Arg)do { if (!(Arg.getType()->isFirstClassType())) { CheckFailed
("Function arguments must have first-class types!", &Arg)
; return; } } while (false)
;
2028 if (!isLLVMdotName) {
2029 Assert(!Arg.getType()->isMetadataTy(),do { if (!(!Arg.getType()->isMetadataTy())) { CheckFailed(
"Function takes metadata but isn't an intrinsic", &Arg, &
F); return; } } while (false)
2030 "Function takes metadata but isn't an intrinsic", &Arg, &F)do { if (!(!Arg.getType()->isMetadataTy())) { CheckFailed(
"Function takes metadata but isn't an intrinsic", &Arg, &
F); return; } } while (false)
;
2031 Assert(!Arg.getType()->isTokenTy(),do { if (!(!Arg.getType()->isTokenTy())) { CheckFailed("Function takes token but isn't an intrinsic"
, &Arg, &F); return; } } while (false)
2032 "Function takes token but isn't an intrinsic", &Arg, &F)do { if (!(!Arg.getType()->isTokenTy())) { CheckFailed("Function takes token but isn't an intrinsic"
, &Arg, &F); return; } } while (false)
;
2033 }
2034
2035 // Check that swifterror argument is only used by loads and stores.
2036 if (Attrs.hasAttribute(i+1, Attribute::SwiftError)) {
2037 verifySwiftErrorValue(&Arg);
2038 }
2039 ++i;
2040 }
2041
2042 if (!isLLVMdotName)
5
Taking true branch
2043 Assert(!F.getReturnType()->isTokenTy(),do { if (!(!F.getReturnType()->isTokenTy())) { CheckFailed
("Functions returns a token but isn't an intrinsic", &F);
return; } } while (false)
2044 "Functions returns a token but isn't an intrinsic", &F)do { if (!(!F.getReturnType()->isTokenTy())) { CheckFailed
("Functions returns a token but isn't an intrinsic", &F);
return; } } while (false)
;
2045
2046 // Get the function metadata attachments.
2047 SmallVector<std::pair<unsigned, MDNode *>, 4> MDs;
2048 F.getAllMetadata(MDs);
2049 assert(F.hasMetadata() != MDs.empty() && "Bit out-of-sync")((F.hasMetadata() != MDs.empty() && "Bit out-of-sync"
) ? static_cast<void> (0) : __assert_fail ("F.hasMetadata() != MDs.empty() && \"Bit out-of-sync\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 2049, __PRETTY_FUNCTION__))
;
2050 verifyFunctionMetadata(MDs);
2051
2052 // Check validity of the personality function
2053 if (F.hasPersonalityFn()) {
6
Assuming the condition is false
7
Taking false branch
2054 auto *Per = dyn_cast<Function>(F.getPersonalityFn()->stripPointerCasts());
2055 if (Per)
2056 Assert(Per->getParent() == F.getParent(),do { if (!(Per->getParent() == F.getParent())) { CheckFailed
("Referencing personality function in another module!", &
F, F.getParent(), Per, Per->getParent()); return; } } while
(false)
2057 "Referencing personality function in another module!",do { if (!(Per->getParent() == F.getParent())) { CheckFailed
("Referencing personality function in another module!", &
F, F.getParent(), Per, Per->getParent()); return; } } while
(false)
2058 &F, F.getParent(), Per, Per->getParent())do { if (!(Per->getParent() == F.getParent())) { CheckFailed
("Referencing personality function in another module!", &
F, F.getParent(), Per, Per->getParent()); return; } } while
(false)
;
2059 }
2060
2061 if (F.isMaterializable()) {
8
Assuming the condition is false
9
Taking false branch
2062 // Function has a body somewhere we can't see.
2063 Assert(MDs.empty(), "unmaterialized function cannot have metadata", &F,do { if (!(MDs.empty())) { CheckFailed("unmaterialized function cannot have metadata"
, &F, MDs.empty() ? nullptr : MDs.front().second); return
; } } while (false)
2064 MDs.empty() ? nullptr : MDs.front().second)do { if (!(MDs.empty())) { CheckFailed("unmaterialized function cannot have metadata"
, &F, MDs.empty() ? nullptr : MDs.front().second); return
; } } while (false)
;
2065 } else if (F.isDeclaration()) {
10
Assuming the condition is false
11
Taking false branch
2066 for (const auto &I : MDs) {
2067 AssertDI(I.first != LLVMContext::MD_dbg,do { if (!(I.first != LLVMContext::MD_dbg)) { DebugInfoCheckFailed
("function declaration may not have a !dbg attachment", &
F); return; } } while (false)
2068 "function declaration may not have a !dbg attachment", &F)do { if (!(I.first != LLVMContext::MD_dbg)) { DebugInfoCheckFailed
("function declaration may not have a !dbg attachment", &
F); return; } } while (false)
;
2069 Assert(I.first != LLVMContext::MD_prof,do { if (!(I.first != LLVMContext::MD_prof)) { CheckFailed("function declaration may not have a !prof attachment"
, &F); return; } } while (false)
2070 "function declaration may not have a !prof attachment", &F)do { if (!(I.first != LLVMContext::MD_prof)) { CheckFailed("function declaration may not have a !prof attachment"
, &F); return; } } while (false)
;
2071
2072 // Verify the metadata itself.
2073 visitMDNode(*I.second);
2074 }
2075 Assert(!F.hasPersonalityFn(),do { if (!(!F.hasPersonalityFn())) { CheckFailed("Function declaration shouldn't have a personality routine"
, &F); return; } } while (false)
2076 "Function declaration shouldn't have a personality routine", &F)do { if (!(!F.hasPersonalityFn())) { CheckFailed("Function declaration shouldn't have a personality routine"
, &F); return; } } while (false)
;
2077 } else {
2078 // Verify that this function (which has a body) is not named "llvm.*". It
2079 // is not legal to define intrinsics.
2080 Assert(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F)do { if (!(!isLLVMdotName)) { CheckFailed("llvm intrinsics cannot be defined!"
, &F); return; } } while (false)
;
2081
2082 // Check the entry node
2083 const BasicBlock *Entry = &F.getEntryBlock();
2084 Assert(pred_empty(Entry),do { if (!(pred_empty(Entry))) { CheckFailed("Entry block to function must not have predecessors!"
, Entry); return; } } while (false)
2085 "Entry block to function must not have predecessors!", Entry)do { if (!(pred_empty(Entry))) { CheckFailed("Entry block to function must not have predecessors!"
, Entry); return; } } while (false)
;
2086
2087 // The address of the entry block cannot be taken, unless it is dead.
2088 if (Entry->hasAddressTaken()) {
12
Assuming the condition is false
13
Taking false branch
2089 Assert(!BlockAddress::lookup(Entry)->isConstantUsed(),do { if (!(!BlockAddress::lookup(Entry)->isConstantUsed())
) { CheckFailed("blockaddress may not be used with the entry block!"
, Entry); return; } } while (false)
2090 "blockaddress may not be used with the entry block!", Entry)do { if (!(!BlockAddress::lookup(Entry)->isConstantUsed())
) { CheckFailed("blockaddress may not be used with the entry block!"
, Entry); return; } } while (false)
;
2091 }
2092
2093 unsigned NumDebugAttachments = 0, NumProfAttachments = 0;
2094 // Visit metadata attachments.
2095 for (const auto &I : MDs) {
14
Assuming '__begin' is equal to '__end'
2096 // Verify that the attachment is legal.
2097 switch (I.first) {
2098 default:
2099 break;
2100 case LLVMContext::MD_dbg:
2101 ++NumDebugAttachments;
2102 AssertDI(NumDebugAttachments == 1,do { if (!(NumDebugAttachments == 1)) { DebugInfoCheckFailed(
"function must have a single !dbg attachment", &F, I.second
); return; } } while (false)
2103 "function must have a single !dbg attachment", &F, I.second)do { if (!(NumDebugAttachments == 1)) { DebugInfoCheckFailed(
"function must have a single !dbg attachment", &F, I.second
); return; } } while (false)
;
2104 AssertDI(isa<DISubprogram>(I.second),do { if (!(isa<DISubprogram>(I.second))) { DebugInfoCheckFailed
("function !dbg attachment must be a subprogram", &F, I.second
); return; } } while (false)
2105 "function !dbg attachment must be a subprogram", &F, I.second)do { if (!(isa<DISubprogram>(I.second))) { DebugInfoCheckFailed
("function !dbg attachment must be a subprogram", &F, I.second
); return; } } while (false)
;
2106 break;
2107 case LLVMContext::MD_prof:
2108 ++NumProfAttachments;
2109 Assert(NumProfAttachments == 1,do { if (!(NumProfAttachments == 1)) { CheckFailed("function must have a single !prof attachment"
, &F, I.second); return; } } while (false)
2110 "function must have a single !prof attachment", &F, I.second)do { if (!(NumProfAttachments == 1)) { CheckFailed("function must have a single !prof attachment"
, &F, I.second); return; } } while (false)
;
2111 break;
2112 }
2113
2114 // Verify the metadata itself.
2115 visitMDNode(*I.second);
2116 }
2117 }
2118
2119 // If this function is actually an intrinsic, verify that it is only used in
2120 // direct call/invokes, never having its "address taken".
2121 // Only do this if the module is materialized, otherwise we don't have all the
2122 // uses.
2123 if (F.getIntrinsicID() && F.getParent()->isMaterialized()) {
15
Assuming the condition is false
2124 const User *U;
2125 if (F.hasAddressTaken(&U))
2126 Assert(false, "Invalid user of intrinsic instruction!", U)do { if (!(false)) { CheckFailed("Invalid user of intrinsic instruction!"
, U); return; } } while (false)
;
2127 }
2128
2129 Assert(!F.hasDLLImportStorageClass() ||do { if (!(!F.hasDLLImportStorageClass() || (F.isDeclaration(
) && F.hasExternalLinkage()) || F.hasAvailableExternallyLinkage
())) { CheckFailed("Function is marked as dllimport, but not external."
, &F); return; } } while (false)
2130 (F.isDeclaration() && F.hasExternalLinkage()) ||do { if (!(!F.hasDLLImportStorageClass() || (F.isDeclaration(
) && F.hasExternalLinkage()) || F.hasAvailableExternallyLinkage
())) { CheckFailed("Function is marked as dllimport, but not external."
, &F); return; } } while (false)
2131 F.hasAvailableExternallyLinkage(),do { if (!(!F.hasDLLImportStorageClass() || (F.isDeclaration(
) && F.hasExternalLinkage()) || F.hasAvailableExternallyLinkage
())) { CheckFailed("Function is marked as dllimport, but not external."
, &F); return; } } while (false)
2132 "Function is marked as dllimport, but not external.", &F)do { if (!(!F.hasDLLImportStorageClass() || (F.isDeclaration(
) && F.hasExternalLinkage()) || F.hasAvailableExternallyLinkage
())) { CheckFailed("Function is marked as dllimport, but not external."
, &F); return; } } while (false)
;
2133
2134 auto *N = F.getSubprogram();
2135 HasDebugInfo = (N != nullptr);
16
Assuming the condition is true
2136 if (!HasDebugInfo)
17
Taking false branch
2137 return;
2138
2139 // Check that all !dbg attachments lead to back to N (or, at least, another
2140 // subprogram that describes the same function).
2141 //
2142 // FIXME: Check this incrementally while visiting !dbg attachments.
2143 // FIXME: Only check when N is the canonical subprogram for F.
2144 SmallPtrSet<const MDNode *, 32> Seen;
2145 for (auto &BB : F)
2146 for (auto &I : BB) {
2147 // Be careful about using DILocation here since we might be dealing with
2148 // broken code (this is the Verifier after all).
2149 DILocation *DL =
2150 dyn_cast_or_null<DILocation>(I.getDebugLoc().getAsMDNode());
2151 if (!DL)
18
Assuming 'DL' is non-null
19
Taking false branch
2152 continue;
2153 if (!Seen.insert(DL).second)
20
Assuming the condition is false
21
Taking false branch
2154 continue;
2155
2156 DILocalScope *Scope = DL->getInlinedAtScope();
2157 if (Scope && !Seen.insert(Scope).second)
22
Assuming 'Scope' is null
23
Taking false branch
2158 continue;
2159
2160 DISubprogram *SP = Scope ? Scope->getSubprogram() : nullptr;
24
'?' condition is false
25
'SP' initialized to a null pointer value
2161
2162 // Scope and SP could be the same MDNode and we don't want to skip
2163 // validation in that case
2164 if (SP && ((Scope != SP) && !Seen.insert(SP).second))
26
Taking false branch
2165 continue;
2166
2167 // FIXME: Once N is canonical, check "SP == &N".
2168 AssertDI(SP->describes(&F),do { if (!(SP->describes(&F))) { DebugInfoCheckFailed(
"!dbg attachment points at wrong subprogram for function", N,
&F, &I, DL, Scope, SP); return; } } while (false)
27
Within the expansion of the macro 'AssertDI':
a
Called C++ object pointer is null
2169 "!dbg attachment points at wrong subprogram for function", N, &F,do { if (!(SP->describes(&F))) { DebugInfoCheckFailed(
"!dbg attachment points at wrong subprogram for function", N,
&F, &I, DL, Scope, SP); return; } } while (false)
2170 &I, DL, Scope, SP)do { if (!(SP->describes(&F))) { DebugInfoCheckFailed(
"!dbg attachment points at wrong subprogram for function", N,
&F, &I, DL, Scope, SP); return; } } while (false)
;
2171 }
2172}
2173
2174// verifyBasicBlock - Verify that a basic block is well formed...
2175//
2176void Verifier::visitBasicBlock(BasicBlock &BB) {
2177 InstsInThisBlock.clear();
2178
2179 // Ensure that basic blocks have terminators!
2180 Assert(BB.getTerminator(), "Basic Block does not have terminator!", &BB)do { if (!(BB.getTerminator())) { CheckFailed("Basic Block does not have terminator!"
, &BB); return; } } while (false)
;
2181
2182 // Check constraints that this basic block imposes on all of the PHI nodes in
2183 // it.
2184 if (isa<PHINode>(BB.front())) {
2185 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
2186 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
2187 std::sort(Preds.begin(), Preds.end());
2188 PHINode *PN;
2189 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
2190 // Ensure that PHI nodes have at least one entry!
2191 Assert(PN->getNumIncomingValues() != 0,do { if (!(PN->getNumIncomingValues() != 0)) { CheckFailed
("PHI nodes must have at least one entry. If the block is dead, "
"the PHI should be removed!", PN); return; } } while (false)
2192 "PHI nodes must have at least one entry. If the block is dead, "do { if (!(PN->getNumIncomingValues() != 0)) { CheckFailed
("PHI nodes must have at least one entry. If the block is dead, "
"the PHI should be removed!", PN); return; } } while (false)
2193 "the PHI should be removed!",do { if (!(PN->getNumIncomingValues() != 0)) { CheckFailed
("PHI nodes must have at least one entry. If the block is dead, "
"the PHI should be removed!", PN); return; } } while (false)
2194 PN)do { if (!(PN->getNumIncomingValues() != 0)) { CheckFailed
("PHI nodes must have at least one entry. If the block is dead, "
"the PHI should be removed!", PN); return; } } while (false)
;
2195 Assert(PN->getNumIncomingValues() == Preds.size(),do { if (!(PN->getNumIncomingValues() == Preds.size())) { CheckFailed
("PHINode should have one entry for each predecessor of its "
"parent basic block!", PN); return; } } while (false)
2196 "PHINode should have one entry for each predecessor of its "do { if (!(PN->getNumIncomingValues() == Preds.size())) { CheckFailed
("PHINode should have one entry for each predecessor of its "
"parent basic block!", PN); return; } } while (false)
2197 "parent basic block!",do { if (!(PN->getNumIncomingValues() == Preds.size())) { CheckFailed
("PHINode should have one entry for each predecessor of its "
"parent basic block!", PN); return; } } while (false)
2198 PN)do { if (!(PN->getNumIncomingValues() == Preds.size())) { CheckFailed
("PHINode should have one entry for each predecessor of its "
"parent basic block!", PN); return; } } while (false)
;
2199
2200 // Get and sort all incoming values in the PHI node...
2201 Values.clear();
2202 Values.reserve(PN->getNumIncomingValues());
2203 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
2204 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
2205 PN->getIncomingValue(i)));
2206 std::sort(Values.begin(), Values.end());
2207
2208 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
2209 // Check to make sure that if there is more than one entry for a
2210 // particular basic block in this PHI node, that the incoming values are
2211 // all identical.
2212 //
2213 Assert(i == 0 || Values[i].first != Values[i - 1].first ||do { if (!(i == 0 || Values[i].first != Values[i - 1].first ||
Values[i].second == Values[i - 1].second)) { CheckFailed("PHI node has multiple entries for the same basic block with "
"different incoming values!", PN, Values[i].first, Values[i]
.second, Values[i - 1].second); return; } } while (false)
2214 Values[i].second == Values[i - 1].second,do { if (!(i == 0 || Values[i].first != Values[i - 1].first ||
Values[i].second == Values[i - 1].second)) { CheckFailed("PHI node has multiple entries for the same basic block with "
"different incoming values!", PN, Values[i].first, Values[i]
.second, Values[i - 1].second); return; } } while (false)
2215 "PHI node has multiple entries for the same basic block with "do { if (!(i == 0 || Values[i].first != Values[i - 1].first ||
Values[i].second == Values[i - 1].second)) { CheckFailed("PHI node has multiple entries for the same basic block with "
"different incoming values!", PN, Values[i].first, Values[i]
.second, Values[i - 1].second); return; } } while (false)
2216 "different incoming values!",do { if (!(i == 0 || Values[i].first != Values[i - 1].first ||
Values[i].second == Values[i - 1].second)) { CheckFailed("PHI node has multiple entries for the same basic block with "
"different incoming values!", PN, Values[i].first, Values[i]
.second, Values[i - 1].second); return; } } while (false)
2217 PN, Values[i].first, Values[i].second, Values[i - 1].second)do { if (!(i == 0 || Values[i].first != Values[i - 1].first ||
Values[i].second == Values[i - 1].second)) { CheckFailed("PHI node has multiple entries for the same basic block with "
"different incoming values!", PN, Values[i].first, Values[i]
.second, Values[i - 1].second); return; } } while (false)
;
2218
2219 // Check to make sure that the predecessors and PHI node entries are
2220 // matched up.
2221 Assert(Values[i].first == Preds[i],do { if (!(Values[i].first == Preds[i])) { CheckFailed("PHI node entries do not match predecessors!"
, PN, Values[i].first, Preds[i]); return; } } while (false)
2222 "PHI node entries do not match predecessors!", PN,do { if (!(Values[i].first == Preds[i])) { CheckFailed("PHI node entries do not match predecessors!"
, PN, Values[i].first, Preds[i]); return; } } while (false)
2223 Values[i].first, Preds[i])do { if (!(Values[i].first == Preds[i])) { CheckFailed("PHI node entries do not match predecessors!"
, PN, Values[i].first, Preds[i]); return; } } while (false)
;
2224 }
2225 }
2226 }
2227
2228 // Check that all instructions have their parent pointers set up correctly.
2229 for (auto &I : BB)
2230 {
2231 Assert(I.getParent() == &BB, "Instruction has bogus parent pointer!")do { if (!(I.getParent() == &BB)) { CheckFailed("Instruction has bogus parent pointer!"
); return; } } while (false)
;
2232 }
2233}
2234
2235void Verifier::visitTerminatorInst(TerminatorInst &I) {
2236 // Ensure that terminators only exist at the end of the basic block.
2237 Assert(&I == I.getParent()->getTerminator(),do { if (!(&I == I.getParent()->getTerminator())) { CheckFailed
("Terminator found in the middle of a basic block!", I.getParent
()); return; } } while (false)
2238 "Terminator found in the middle of a basic block!", I.getParent())do { if (!(&I == I.getParent()->getTerminator())) { CheckFailed
("Terminator found in the middle of a basic block!", I.getParent
()); return; } } while (false)
;
2239 visitInstruction(I);
2240}
2241
2242void Verifier::visitBranchInst(BranchInst &BI) {
2243 if (BI.isConditional()) {
2244 Assert(BI.getCondition()->getType()->isIntegerTy(1),do { if (!(BI.getCondition()->getType()->isIntegerTy(1)
)) { CheckFailed("Branch condition is not 'i1' type!", &BI
, BI.getCondition()); return; } } while (false)
2245 "Branch condition is not 'i1' type!", &BI, BI.getCondition())do { if (!(BI.getCondition()->getType()->isIntegerTy(1)
)) { CheckFailed("Branch condition is not 'i1' type!", &BI
, BI.getCondition()); return; } } while (false)
;
2246 }
2247 visitTerminatorInst(BI);
2248}
2249
2250void Verifier::visitReturnInst(ReturnInst &RI) {
2251 Function *F = RI.getParent()->getParent();
2252 unsigned N = RI.getNumOperands();
2253 if (F->getReturnType()->isVoidTy())
2254 Assert(N == 0,do { if (!(N == 0)) { CheckFailed("Found return instr that returns non-void in Function of void "
"return type!", &RI, F->getReturnType()); return; } }
while (false)
2255 "Found return instr that returns non-void in Function of void "do { if (!(N == 0)) { CheckFailed("Found return instr that returns non-void in Function of void "
"return type!", &RI, F->getReturnType()); return; } }
while (false)
2256 "return type!",do { if (!(N == 0)) { CheckFailed("Found return instr that returns non-void in Function of void "
"return type!", &RI, F->getReturnType()); return; } }
while (false)
2257 &RI, F->getReturnType())do { if (!(N == 0)) { CheckFailed("Found return instr that returns non-void in Function of void "
"return type!", &RI, F->getReturnType()); return; } }
while (false)
;
2258 else
2259 Assert(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),do { if (!(N == 1 && F->getReturnType() == RI.getOperand
(0)->getType())) { CheckFailed("Function return type does not match operand "
"type of return inst!", &RI, F->getReturnType()); return
; } } while (false)
2260 "Function return type does not match operand "do { if (!(N == 1 && F->getReturnType() == RI.getOperand
(0)->getType())) { CheckFailed("Function return type does not match operand "
"type of return inst!", &RI, F->getReturnType()); return
; } } while (false)
2261 "type of return inst!",do { if (!(N == 1 && F->getReturnType() == RI.getOperand
(0)->getType())) { CheckFailed("Function return type does not match operand "
"type of return inst!", &RI, F->getReturnType()); return
; } } while (false)
2262 &RI, F->getReturnType())do { if (!(N == 1 && F->getReturnType() == RI.getOperand
(0)->getType())) { CheckFailed("Function return type does not match operand "
"type of return inst!", &RI, F->getReturnType()); return
; } } while (false)
;
2263
2264 // Check to make sure that the return value has necessary properties for
2265 // terminators...
2266 visitTerminatorInst(RI);
2267}
2268
2269void Verifier::visitSwitchInst(SwitchInst &SI) {
2270 // Check to make sure that all of the constants in the switch instruction
2271 // have the same type as the switched-on value.
2272 Type *SwitchTy = SI.getCondition()->getType();
2273 SmallPtrSet<ConstantInt*, 32> Constants;
2274 for (auto &Case : SI.cases()) {
2275 Assert(Case.getCaseValue()->getType() == SwitchTy,do { if (!(Case.getCaseValue()->getType() == SwitchTy)) { CheckFailed
("Switch constants must all be same type as switch value!", &
SI); return; } } while (false)
2276 "Switch constants must all be same type as switch value!", &SI)do { if (!(Case.getCaseValue()->getType() == SwitchTy)) { CheckFailed
("Switch constants must all be same type as switch value!", &
SI); return; } } while (false)
;
2277 Assert(Constants.insert(Case.getCaseValue()).second,do { if (!(Constants.insert(Case.getCaseValue()).second)) { CheckFailed
("Duplicate integer as switch case", &SI, Case.getCaseValue
()); return; } } while (false)
2278 "Duplicate integer as switch case", &SI, Case.getCaseValue())do { if (!(Constants.insert(Case.getCaseValue()).second)) { CheckFailed
("Duplicate integer as switch case", &SI, Case.getCaseValue
()); return; } } while (false)
;
2279 }
2280
2281 visitTerminatorInst(SI);
2282}
2283
2284void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
2285 Assert(BI.getAddress()->getType()->isPointerTy(),do { if (!(BI.getAddress()->getType()->isPointerTy())) {
CheckFailed("Indirectbr operand must have pointer type!", &
BI); return; } } while (false)
2286 "Indirectbr operand must have pointer type!", &BI)do { if (!(BI.getAddress()->getType()->isPointerTy())) {
CheckFailed("Indirectbr operand must have pointer type!", &
BI); return; } } while (false)
;
2287 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
2288 Assert(BI.getDestination(i)->getType()->isLabelTy(),do { if (!(BI.getDestination(i)->getType()->isLabelTy()
)) { CheckFailed("Indirectbr destinations must all have pointer type!"
, &BI); return; } } while (false)
2289 "Indirectbr destinations must all have pointer type!", &BI)do { if (!(BI.getDestination(i)->getType()->isLabelTy()
)) { CheckFailed("Indirectbr destinations must all have pointer type!"
, &BI); return; } } while (false)
;
2290
2291 visitTerminatorInst(BI);
2292}
2293
2294void Verifier::visitSelectInst(SelectInst &SI) {
2295 Assert(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),do { if (!(!SelectInst::areInvalidOperands(SI.getOperand(0), SI
.getOperand(1), SI.getOperand(2)))) { CheckFailed("Invalid operands for select instruction!"
, &SI); return; } } while (false)
2296 SI.getOperand(2)),do { if (!(!SelectInst::areInvalidOperands(SI.getOperand(0), SI
.getOperand(1), SI.getOperand(2)))) { CheckFailed("Invalid operands for select instruction!"
, &SI); return; } } while (false)
2297 "Invalid operands for select instruction!", &SI)do { if (!(!SelectInst::areInvalidOperands(SI.getOperand(0), SI
.getOperand(1), SI.getOperand(2)))) { CheckFailed("Invalid operands for select instruction!"
, &SI); return; } } while (false)
;
2298
2299 Assert(SI.getTrueValue()->getType() == SI.getType(),do { if (!(SI.getTrueValue()->getType() == SI.getType())) {
CheckFailed("Select values must have same type as select instruction!"
, &SI); return; } } while (false)
2300 "Select values must have same type as select instruction!", &SI)do { if (!(SI.getTrueValue()->getType() == SI.getType())) {
CheckFailed("Select values must have same type as select instruction!"
, &SI); return; } } while (false)
;
2301 visitInstruction(SI);
2302}
2303
2304/// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
2305/// a pass, if any exist, it's an error.
2306///
2307void Verifier::visitUserOp1(Instruction &I) {
2308 Assert(false, "User-defined operators should not live outside of a pass!", &I)do { if (!(false)) { CheckFailed("User-defined operators should not live outside of a pass!"
, &I); return; } } while (false)
;
2309}
2310
2311void Verifier::visitTruncInst(TruncInst &I) {
2312 // Get the source and destination types
2313 Type *SrcTy = I.getOperand(0)->getType();
2314 Type *DestTy = I.getType();
2315
2316 // Get the size of the types in bits, we'll need this later
2317 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2318 unsigned DestBitSize = DestTy->getScalarSizeInBits();
2319
2320 Assert(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I)do { if (!(SrcTy->isIntOrIntVectorTy())) { CheckFailed("Trunc only operates on integer"
, &I); return; } } while (false)
;
2321 Assert(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I)do { if (!(DestTy->isIntOrIntVectorTy())) { CheckFailed("Trunc only produces integer"
, &I); return; } } while (false)
;
2322 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("trunc source and destination must both be a vector or neither"
, &I); return; } } while (false)
2323 "trunc source and destination must both be a vector or neither", &I)do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("trunc source and destination must both be a vector or neither"
, &I); return; } } while (false)
;
2324 Assert(SrcBitSize > DestBitSize, "DestTy too big for Trunc", &I)do { if (!(SrcBitSize > DestBitSize)) { CheckFailed("DestTy too big for Trunc"
, &I); return; } } while (false)
;
2325
2326 visitInstruction(I);
2327}
2328
2329void Verifier::visitZExtInst(ZExtInst &I) {
2330 // Get the source and destination types
2331 Type *SrcTy = I.getOperand(0)->getType();
2332 Type *DestTy = I.getType();
2333
2334 // Get the size of the types in bits, we'll need this later
2335 Assert(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I)do { if (!(SrcTy->isIntOrIntVectorTy())) { CheckFailed("ZExt only operates on integer"
, &I); return; } } while (false)
;
2336 Assert(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I)do { if (!(DestTy->isIntOrIntVectorTy())) { CheckFailed("ZExt only produces an integer"
, &I); return; } } while (false)
;
2337 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("zext source and destination must both be a vector or neither"
, &I); return; } } while (false)
2338 "zext source and destination must both be a vector or neither", &I)do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("zext source and destination must both be a vector or neither"
, &I); return; } } while (false)
;
2339 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2340 unsigned DestBitSize = DestTy->getScalarSizeInBits();
2341
2342 Assert(SrcBitSize < DestBitSize, "Type too small for ZExt", &I)do { if (!(SrcBitSize < DestBitSize)) { CheckFailed("Type too small for ZExt"
, &I); return; } } while (false)
;
2343
2344 visitInstruction(I);
2345}
2346
2347void Verifier::visitSExtInst(SExtInst &I) {
2348 // Get the source and destination types
2349 Type *SrcTy = I.getOperand(0)->getType();
2350 Type *DestTy = I.getType();
2351
2352 // Get the size of the types in bits, we'll need this later
2353 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2354 unsigned DestBitSize = DestTy->getScalarSizeInBits();
2355
2356 Assert(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I)do { if (!(SrcTy->isIntOrIntVectorTy())) { CheckFailed("SExt only operates on integer"
, &I); return; } } while (false)
;
2357 Assert(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I)do { if (!(DestTy->isIntOrIntVectorTy())) { CheckFailed("SExt only produces an integer"
, &I); return; } } while (false)
;
2358 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("sext source and destination must both be a vector or neither"
, &I); return; } } while (false)
2359 "sext source and destination must both be a vector or neither", &I)do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("sext source and destination must both be a vector or neither"
, &I); return; } } while (false)
;
2360 Assert(SrcBitSize < DestBitSize, "Type too small for SExt", &I)do { if (!(SrcBitSize < DestBitSize)) { CheckFailed("Type too small for SExt"
, &I); return; } } while (false)
;
2361
2362 visitInstruction(I);
2363}
2364
2365void Verifier::visitFPTruncInst(FPTruncInst &I) {
2366 // Get the source and destination types
2367 Type *SrcTy = I.getOperand(0)->getType();
2368 Type *DestTy = I.getType();
2369 // Get the size of the types in bits, we'll need this later
2370 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2371 unsigned DestBitSize = DestTy->getScalarSizeInBits();
2372
2373 Assert(SrcTy->isFPOrFPVectorTy(), "FPTrunc only operates on FP", &I)do { if (!(SrcTy->isFPOrFPVectorTy())) { CheckFailed("FPTrunc only operates on FP"
, &I); return; } } while (false)
;
2374 Assert(DestTy->isFPOrFPVectorTy(), "FPTrunc only produces an FP", &I)do { if (!(DestTy->isFPOrFPVectorTy())) { CheckFailed("FPTrunc only produces an FP"
, &I); return; } } while (false)
;
2375 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("fptrunc source and destination must both be a vector or neither"
, &I); return; } } while (false)
2376 "fptrunc source and destination must both be a vector or neither", &I)do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("fptrunc source and destination must both be a vector or neither"
, &I); return; } } while (false)
;
2377 Assert(SrcBitSize > DestBitSize, "DestTy too big for FPTrunc", &I)do { if (!(SrcBitSize > DestBitSize)) { CheckFailed("DestTy too big for FPTrunc"
, &I); return; } } while (false)
;
2378
2379 visitInstruction(I);
2380}
2381
2382void Verifier::visitFPExtInst(FPExtInst &I) {
2383 // Get the source and destination types
2384 Type *SrcTy = I.getOperand(0)->getType();
2385 Type *DestTy = I.getType();
2386
2387 // Get the size of the types in bits, we'll need this later
2388 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
2389 unsigned DestBitSize = DestTy->getScalarSizeInBits();
2390
2391 Assert(SrcTy->isFPOrFPVectorTy(), "FPExt only operates on FP", &I)do { if (!(SrcTy->isFPOrFPVectorTy())) { CheckFailed("FPExt only operates on FP"
, &I); return; } } while (false)
;
2392 Assert(DestTy->isFPOrFPVectorTy(), "FPExt only produces an FP", &I)do { if (!(DestTy->isFPOrFPVectorTy())) { CheckFailed("FPExt only produces an FP"
, &I); return; } } while (false)
;
2393 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("fpext source and destination must both be a vector or neither"
, &I); return; } } while (false)
2394 "fpext source and destination must both be a vector or neither", &I)do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("fpext source and destination must both be a vector or neither"
, &I); return; } } while (false)
;
2395 Assert(SrcBitSize < DestBitSize, "DestTy too small for FPExt", &I)do { if (!(SrcBitSize < DestBitSize)) { CheckFailed("DestTy too small for FPExt"
, &I); return; } } while (false)
;
2396
2397 visitInstruction(I);
2398}
2399
2400void Verifier::visitUIToFPInst(UIToFPInst &I) {
2401 // Get the source and destination types
2402 Type *SrcTy = I.getOperand(0)->getType();
2403 Type *DestTy = I.getType();
2404
2405 bool SrcVec = SrcTy->isVectorTy();
2406 bool DstVec = DestTy->isVectorTy();
2407
2408 Assert(SrcVec == DstVec,do { if (!(SrcVec == DstVec)) { CheckFailed("UIToFP source and dest must both be vector or scalar"
, &I); return; } } while (false)
2409 "UIToFP source and dest must both be vector or scalar", &I)do { if (!(SrcVec == DstVec)) { CheckFailed("UIToFP source and dest must both be vector or scalar"
, &I); return; } } while (false)
;
2410 Assert(SrcTy->isIntOrIntVectorTy(),do { if (!(SrcTy->isIntOrIntVectorTy())) { CheckFailed("UIToFP source must be integer or integer vector"
, &I); return; } } while (false)
2411 "UIToFP source must be integer or integer vector", &I)do { if (!(SrcTy->isIntOrIntVectorTy())) { CheckFailed("UIToFP source must be integer or integer vector"
, &I); return; } } while (false)
;
2412 Assert(DestTy->isFPOrFPVectorTy(), "UIToFP result must be FP or FP vector",do { if (!(DestTy->isFPOrFPVectorTy())) { CheckFailed("UIToFP result must be FP or FP vector"
, &I); return; } } while (false)
2413 &I)do { if (!(DestTy->isFPOrFPVectorTy())) { CheckFailed("UIToFP result must be FP or FP vector"
, &I); return; } } while (false)
;
2414
2415 if (SrcVec && DstVec)
2416 Assert(cast<VectorType>(SrcTy)->getNumElements() ==do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("UIToFP source and dest vector length mismatch", &I); return
; } } while (false)
2417 cast<VectorType>(DestTy)->getNumElements(),do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("UIToFP source and dest vector length mismatch", &I); return
; } } while (false)
2418 "UIToFP source and dest vector length mismatch", &I)do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("UIToFP source and dest vector length mismatch", &I); return
; } } while (false)
;
2419
2420 visitInstruction(I);
2421}
2422
2423void Verifier::visitSIToFPInst(SIToFPInst &I) {
2424 // Get the source and destination types
2425 Type *SrcTy = I.getOperand(0)->getType();
2426 Type *DestTy = I.getType();
2427
2428 bool SrcVec = SrcTy->isVectorTy();
2429 bool DstVec = DestTy->isVectorTy();
2430
2431 Assert(SrcVec == DstVec,do { if (!(SrcVec == DstVec)) { CheckFailed("SIToFP source and dest must both be vector or scalar"
, &I); return; } } while (false)
2432 "SIToFP source and dest must both be vector or scalar", &I)do { if (!(SrcVec == DstVec)) { CheckFailed("SIToFP source and dest must both be vector or scalar"
, &I); return; } } while (false)
;
2433 Assert(SrcTy->isIntOrIntVectorTy(),do { if (!(SrcTy->isIntOrIntVectorTy())) { CheckFailed("SIToFP source must be integer or integer vector"
, &I); return; } } while (false)
2434 "SIToFP source must be integer or integer vector", &I)do { if (!(SrcTy->isIntOrIntVectorTy())) { CheckFailed("SIToFP source must be integer or integer vector"
, &I); return; } } while (false)
;
2435 Assert(DestTy->isFPOrFPVectorTy(), "SIToFP result must be FP or FP vector",do { if (!(DestTy->isFPOrFPVectorTy())) { CheckFailed("SIToFP result must be FP or FP vector"
, &I); return; } } while (false)
2436 &I)do { if (!(DestTy->isFPOrFPVectorTy())) { CheckFailed("SIToFP result must be FP or FP vector"
, &I); return; } } while (false)
;
2437
2438 if (SrcVec && DstVec)
2439 Assert(cast<VectorType>(SrcTy)->getNumElements() ==do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("SIToFP source and dest vector length mismatch", &I); return
; } } while (false)
2440 cast<VectorType>(DestTy)->getNumElements(),do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("SIToFP source and dest vector length mismatch", &I); return
; } } while (false)
2441 "SIToFP source and dest vector length mismatch", &I)do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("SIToFP source and dest vector length mismatch", &I); return
; } } while (false)
;
2442
2443 visitInstruction(I);
2444}
2445
2446void Verifier::visitFPToUIInst(FPToUIInst &I) {
2447 // Get the source and destination types
2448 Type *SrcTy = I.getOperand(0)->getType();
2449 Type *DestTy = I.getType();
2450
2451 bool SrcVec = SrcTy->isVectorTy();
2452 bool DstVec = DestTy->isVectorTy();
2453
2454 Assert(SrcVec == DstVec,do { if (!(SrcVec == DstVec)) { CheckFailed("FPToUI source and dest must both be vector or scalar"
, &I); return; } } while (false)
2455 "FPToUI source and dest must both be vector or scalar", &I)do { if (!(SrcVec == DstVec)) { CheckFailed("FPToUI source and dest must both be vector or scalar"
, &I); return; } } while (false)
;
2456 Assert(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",do { if (!(SrcTy->isFPOrFPVectorTy())) { CheckFailed("FPToUI source must be FP or FP vector"
, &I); return; } } while (false)
2457 &I)do { if (!(SrcTy->isFPOrFPVectorTy())) { CheckFailed("FPToUI source must be FP or FP vector"
, &I); return; } } while (false)
;
2458 Assert(DestTy->isIntOrIntVectorTy(),do { if (!(DestTy->isIntOrIntVectorTy())) { CheckFailed("FPToUI result must be integer or integer vector"
, &I); return; } } while (false)
2459 "FPToUI result must be integer or integer vector", &I)do { if (!(DestTy->isIntOrIntVectorTy())) { CheckFailed("FPToUI result must be integer or integer vector"
, &I); return; } } while (false)
;
2460
2461 if (SrcVec && DstVec)
2462 Assert(cast<VectorType>(SrcTy)->getNumElements() ==do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("FPToUI source and dest vector length mismatch", &I); return
; } } while (false)
2463 cast<VectorType>(DestTy)->getNumElements(),do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("FPToUI source and dest vector length mismatch", &I); return
; } } while (false)
2464 "FPToUI source and dest vector length mismatch", &I)do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("FPToUI source and dest vector length mismatch", &I); return
; } } while (false)
;
2465
2466 visitInstruction(I);
2467}
2468
2469void Verifier::visitFPToSIInst(FPToSIInst &I) {
2470 // Get the source and destination types
2471 Type *SrcTy = I.getOperand(0)->getType();
2472 Type *DestTy = I.getType();
2473
2474 bool SrcVec = SrcTy->isVectorTy();
2475 bool DstVec = DestTy->isVectorTy();
2476
2477 Assert(SrcVec == DstVec,do { if (!(SrcVec == DstVec)) { CheckFailed("FPToSI source and dest must both be vector or scalar"
, &I); return; } } while (false)
2478 "FPToSI source and dest must both be vector or scalar", &I)do { if (!(SrcVec == DstVec)) { CheckFailed("FPToSI source and dest must both be vector or scalar"
, &I); return; } } while (false)
;
2479 Assert(SrcTy->isFPOrFPVectorTy(), "FPToSI source must be FP or FP vector",do { if (!(SrcTy->isFPOrFPVectorTy())) { CheckFailed("FPToSI source must be FP or FP vector"
, &I); return; } } while (false)
2480 &I)do { if (!(SrcTy->isFPOrFPVectorTy())) { CheckFailed("FPToSI source must be FP or FP vector"
, &I); return; } } while (false)
;
2481 Assert(DestTy->isIntOrIntVectorTy(),do { if (!(DestTy->isIntOrIntVectorTy())) { CheckFailed("FPToSI result must be integer or integer vector"
, &I); return; } } while (false)
2482 "FPToSI result must be integer or integer vector", &I)do { if (!(DestTy->isIntOrIntVectorTy())) { CheckFailed("FPToSI result must be integer or integer vector"
, &I); return; } } while (false)
;
2483
2484 if (SrcVec && DstVec)
2485 Assert(cast<VectorType>(SrcTy)->getNumElements() ==do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("FPToSI source and dest vector length mismatch", &I); return
; } } while (false)
2486 cast<VectorType>(DestTy)->getNumElements(),do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("FPToSI source and dest vector length mismatch", &I); return
; } } while (false)
2487 "FPToSI source and dest vector length mismatch", &I)do { if (!(cast<VectorType>(SrcTy)->getNumElements()
== cast<VectorType>(DestTy)->getNumElements())) { CheckFailed
("FPToSI source and dest vector length mismatch", &I); return
; } } while (false)
;
2488
2489 visitInstruction(I);
2490}
2491
2492void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
2493 // Get the source and destination types
2494 Type *SrcTy = I.getOperand(0)->getType();
2495 Type *DestTy = I.getType();
2496
2497 Assert(SrcTy->getScalarType()->isPointerTy(),do { if (!(SrcTy->getScalarType()->isPointerTy())) { CheckFailed
("PtrToInt source must be pointer", &I); return; } } while
(false)
2498 "PtrToInt source must be pointer", &I)do { if (!(SrcTy->getScalarType()->isPointerTy())) { CheckFailed
("PtrToInt source must be pointer", &I); return; } } while
(false)
;
2499
2500 if (auto *PTy = dyn_cast<PointerType>(SrcTy->getScalarType()))
2501 Assert(!DL.isNonIntegralPointerType(PTy),do { if (!(!DL.isNonIntegralPointerType(PTy))) { CheckFailed(
"ptrtoint not supported for non-integral pointers"); return; }
} while (false)
2502 "ptrtoint not supported for non-integral pointers")do { if (!(!DL.isNonIntegralPointerType(PTy))) { CheckFailed(
"ptrtoint not supported for non-integral pointers"); return; }
} while (false)
;
2503
2504 Assert(DestTy->getScalarType()->isIntegerTy(),do { if (!(DestTy->getScalarType()->isIntegerTy())) { CheckFailed
("PtrToInt result must be integral", &I); return; } } while
(false)
2505 "PtrToInt result must be integral", &I)do { if (!(DestTy->getScalarType()->isIntegerTy())) { CheckFailed
("PtrToInt result must be integral", &I); return; } } while
(false)
;
2506 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(), "PtrToInt type mismatch",do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("PtrToInt type mismatch", &I); return; } }
while (false)
2507 &I)do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("PtrToInt type mismatch", &I); return; } }
while (false)
;
2508
2509 if (SrcTy->isVectorTy()) {
2510 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
2511 VectorType *VDest = dyn_cast<VectorType>(DestTy);
2512 Assert(VSrc->getNumElements() == VDest->getNumElements(),do { if (!(VSrc->getNumElements() == VDest->getNumElements
())) { CheckFailed("PtrToInt Vector width mismatch", &I);
return; } } while (false)
2513 "PtrToInt Vector width mismatch", &I)do { if (!(VSrc->getNumElements() == VDest->getNumElements
())) { CheckFailed("PtrToInt Vector width mismatch", &I);
return; } } while (false)
;
2514 }
2515
2516 visitInstruction(I);
2517}
2518
2519void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
2520 // Get the source and destination types
2521 Type *SrcTy = I.getOperand(0)->getType();
2522 Type *DestTy = I.getType();
2523
2524 Assert(SrcTy->getScalarType()->isIntegerTy(),do { if (!(SrcTy->getScalarType()->isIntegerTy())) { CheckFailed
("IntToPtr source must be an integral", &I); return; } } while
(false)
2525 "IntToPtr source must be an integral", &I)do { if (!(SrcTy->getScalarType()->isIntegerTy())) { CheckFailed
("IntToPtr source must be an integral", &I); return; } } while
(false)
;
2526 Assert(DestTy->getScalarType()->isPointerTy(),do { if (!(DestTy->getScalarType()->isPointerTy())) { CheckFailed
("IntToPtr result must be a pointer", &I); return; } } while
(false)
2527 "IntToPtr result must be a pointer", &I)do { if (!(DestTy->getScalarType()->isPointerTy())) { CheckFailed
("IntToPtr result must be a pointer", &I); return; } } while
(false)
;
2528
2529 if (auto *PTy = dyn_cast<PointerType>(DestTy->getScalarType()))
2530 Assert(!DL.isNonIntegralPointerType(PTy),do { if (!(!DL.isNonIntegralPointerType(PTy))) { CheckFailed(
"inttoptr not supported for non-integral pointers"); return; }
} while (false)
2531 "inttoptr not supported for non-integral pointers")do { if (!(!DL.isNonIntegralPointerType(PTy))) { CheckFailed(
"inttoptr not supported for non-integral pointers"); return; }
} while (false)
;
2532
2533 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(), "IntToPtr type mismatch",do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("IntToPtr type mismatch", &I); return; } }
while (false)
2534 &I)do { if (!(SrcTy->isVectorTy() == DestTy->isVectorTy())
) { CheckFailed("IntToPtr type mismatch", &I); return; } }
while (false)
;
2535 if (SrcTy->isVectorTy()) {
2536 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
2537 VectorType *VDest = dyn_cast<VectorType>(DestTy);
2538 Assert(VSrc->getNumElements() == VDest->getNumElements(),do { if (!(VSrc->getNumElements() == VDest->getNumElements
())) { CheckFailed("IntToPtr Vector width mismatch", &I);
return; } } while (false)
2539 "IntToPtr Vector width mismatch", &I)do { if (!(VSrc->getNumElements() == VDest->getNumElements
())) { CheckFailed("IntToPtr Vector width mismatch", &I);
return; } } while (false)
;
2540 }
2541 visitInstruction(I);
2542}
2543
2544void Verifier::visitBitCastInst(BitCastInst &I) {
2545 Assert(do { if (!(CastInst::castIsValid(Instruction::BitCast, I.getOperand
(0), I.getType()))) { CheckFailed("Invalid bitcast", &I);
return; } } while (false)
2546 CastInst::castIsValid(Instruction::BitCast, I.getOperand(0), I.getType()),do { if (!(CastInst::castIsValid(Instruction::BitCast, I.getOperand
(0), I.getType()))) { CheckFailed("Invalid bitcast", &I);
return; } } while (false)
2547 "Invalid bitcast", &I)do { if (!(CastInst::castIsValid(Instruction::BitCast, I.getOperand
(0), I.getType()))) { CheckFailed("Invalid bitcast", &I);
return; } } while (false)
;
2548 visitInstruction(I);
2549}
2550
2551void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
2552 Type *SrcTy = I.getOperand(0)->getType();
2553 Type *DestTy = I.getType();
2554
2555 Assert(SrcTy->isPtrOrPtrVectorTy(), "AddrSpaceCast source must be a pointer",do { if (!(SrcTy->isPtrOrPtrVectorTy())) { CheckFailed("AddrSpaceCast source must be a pointer"
, &I); return; } } while (false)
2556 &I)do { if (!(SrcTy->isPtrOrPtrVectorTy())) { CheckFailed("AddrSpaceCast source must be a pointer"
, &I); return; } } while (false)
;
2557 Assert(DestTy->isPtrOrPtrVectorTy(), "AddrSpaceCast result must be a pointer",do { if (!(DestTy->isPtrOrPtrVectorTy())) { CheckFailed("AddrSpaceCast result must be a pointer"
, &I); return; } } while (false)
2558 &I)do { if (!(DestTy->isPtrOrPtrVectorTy())) { CheckFailed("AddrSpaceCast result must be a pointer"
, &I); return; } } while (false)
;
2559 Assert(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),do { if (!(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace
())) { CheckFailed("AddrSpaceCast must be between different address spaces"
, &I); return; } } while (false)
2560 "AddrSpaceCast must be between different address spaces", &I)do { if (!(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace
())) { CheckFailed("AddrSpaceCast must be between different address spaces"
, &I); return; } } while (false)
;
2561 if (SrcTy->isVectorTy())
2562 Assert(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),do { if (!(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements
())) { CheckFailed("AddrSpaceCast vector pointer number of elements mismatch"
, &I); return; } } while (false)
2563 "AddrSpaceCast vector pointer number of elements mismatch", &I)do { if (!(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements
())) { CheckFailed("AddrSpaceCast vector pointer number of elements mismatch"
, &I); return; } } while (false)
;
2564 visitInstruction(I);
2565}
2566
2567/// visitPHINode - Ensure that a PHI node is well formed.
2568///
2569void Verifier::visitPHINode(PHINode &PN) {
2570 // Ensure that the PHI nodes are all grouped together at the top of the block.
2571 // This can be tested by checking whether the instruction before this is
2572 // either nonexistent (because this is begin()) or is a PHI node. If not,
2573 // then there is some other instruction before a PHI.
2574 Assert(&PN == &PN.getParent()->front() ||do { if (!(&PN == &PN.getParent()->front() || isa<
PHINode>(--BasicBlock::iterator(&PN)))) { CheckFailed(
"PHI nodes not grouped at top of basic block!", &PN, PN.getParent
()); return; } } while (false)
2575 isa<PHINode>(--BasicBlock::iterator(&PN)),do { if (!(&PN == &PN.getParent()->front() || isa<
PHINode>(--BasicBlock::iterator(&PN)))) { CheckFailed(
"PHI nodes not grouped at top of basic block!", &PN, PN.getParent
()); return; } } while (false)
2576 "PHI nodes not grouped at top of basic block!", &PN, PN.getParent())do { if (!(&PN == &PN.getParent()->front() || isa<
PHINode>(--BasicBlock::iterator(&PN)))) { CheckFailed(
"PHI nodes not grouped at top of basic block!", &PN, PN.getParent
()); return; } } while (false)
;
2577
2578 // Check that a PHI doesn't yield a Token.
2579 Assert(!PN.getType()->isTokenTy(), "PHI nodes cannot have token type!")do { if (!(!PN.getType()->isTokenTy())) { CheckFailed("PHI nodes cannot have token type!"
); return; } } while (false)
;
2580
2581 // Check that all of the values of the PHI node have the same type as the
2582 // result, and that the incoming blocks are really basic blocks.
2583 for (Value *IncValue : PN.incoming_values()) {
2584 Assert(PN.getType() == IncValue->getType(),do { if (!(PN.getType() == IncValue->getType())) { CheckFailed
("PHI node operands are not the same type as the result!", &
PN); return; } } while (false)
2585 "PHI node operands are not the same type as the result!", &PN)do { if (!(PN.getType() == IncValue->getType())) { CheckFailed
("PHI node operands are not the same type as the result!", &
PN); return; } } while (false)
;
2586 }
2587
2588 // All other PHI node constraints are checked in the visitBasicBlock method.
2589
2590 visitInstruction(PN);
2591}
2592
2593void Verifier::verifyCallSite(CallSite CS) {
2594 Instruction *I = CS.getInstruction();
2595
2596 Assert(CS.getCalledValue()->getType()->isPointerTy(),do { if (!(CS.getCalledValue()->getType()->isPointerTy(
))) { CheckFailed("Called function must be a pointer!", I); return
; } } while (false)
2597 "Called function must be a pointer!", I)do { if (!(CS.getCalledValue()->getType()->isPointerTy(
))) { CheckFailed("Called function must be a pointer!", I); return
; } } while (false)
;
2598 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
2599
2600 Assert(FPTy->getElementType()->isFunctionTy(),do { if (!(FPTy->getElementType()->isFunctionTy())) { CheckFailed
("Called function is not pointer to function type!", I); return
; } } while (false)
2601 "Called function is not pointer to function type!", I)do { if (!(FPTy->getElementType()->isFunctionTy())) { CheckFailed
("Called function is not pointer to function type!", I); return
; } } while (false)
;
2602
2603 Assert(FPTy->getElementType() == CS.getFunctionType(),do { if (!(FPTy->getElementType() == CS.getFunctionType())
) { CheckFailed("Called function is not the same type as the call!"
, I); return; } } while (false)
2604 "Called function is not the same type as the call!", I)do { if (!(FPTy->getElementType() == CS.getFunctionType())
) { CheckFailed("Called function is not the same type as the call!"
, I); return; } } while (false)
;
2605
2606 FunctionType *FTy = CS.getFunctionType();
2607
2608 // Verify that the correct number of arguments are being passed
2609 if (FTy->isVarArg())
2610 Assert(CS.arg_size() >= FTy->getNumParams(),do { if (!(CS.arg_size() >= FTy->getNumParams())) { CheckFailed
("Called function requires more parameters than were provided!"
, I); return; } } while (false)
2611 "Called function requires more parameters than were provided!", I)do { if (!(CS.arg_size() >= FTy->getNumParams())) { CheckFailed
("Called function requires more parameters than were provided!"
, I); return; } } while (false)
;
2612 else
2613 Assert(CS.arg_size() == FTy->getNumParams(),do { if (!(CS.arg_size() == FTy->getNumParams())) { CheckFailed
("Incorrect number of arguments passed to called function!", I
); return; } } while (false)
2614 "Incorrect number of arguments passed to called function!", I)do { if (!(CS.arg_size() == FTy->getNumParams())) { CheckFailed
("Incorrect number of arguments passed to called function!", I
); return; } } while (false)
;
2615
2616 // Verify that all arguments to the call match the function type.
2617 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
2618 Assert(CS.getArgument(i)->getType() == FTy->getParamType(i),do { if (!(CS.getArgument(i)->getType() == FTy->getParamType
(i))) { CheckFailed("Call parameter type does not match function signature!"
, CS.getArgument(i), FTy->getParamType(i), I); return; } }
while (false)
2619 "Call parameter type does not match function signature!",do { if (!(CS.getArgument(i)->getType() == FTy->getParamType
(i))) { CheckFailed("Call parameter type does not match function signature!"
, CS.getArgument(i), FTy->getParamType(i), I); return; } }
while (false)
2620 CS.getArgument(i), FTy->getParamType(i), I)do { if (!(CS.getArgument(i)->getType() == FTy->getParamType
(i))) { CheckFailed("Call parameter type does not match function signature!"
, CS.getArgument(i), FTy->getParamType(i), I); return; } }
while (false)
;
2621
2622 AttributeSet Attrs = CS.getAttributes();
2623
2624 Assert(verifyAttributeCount(Attrs, CS.arg_size()),do { if (!(verifyAttributeCount(Attrs, CS.arg_size()))) { CheckFailed
("Attribute after last parameter!", I); return; } } while (false
)
2625 "Attribute after last parameter!", I)do { if (!(verifyAttributeCount(Attrs, CS.arg_size()))) { CheckFailed
("Attribute after last parameter!", I); return; } } while (false
)
;
2626
2627 // Verify call attributes.
2628 verifyFunctionAttrs(FTy, Attrs, I);
2629
2630 // Conservatively check the inalloca argument.
2631 // We have a bug if we can find that there is an underlying alloca without
2632 // inalloca.
2633 if (CS.hasInAllocaArgument()) {
2634 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
2635 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
2636 Assert(AI->isUsedWithInAlloca(),do { if (!(AI->isUsedWithInAlloca())) { CheckFailed("inalloca argument for call has mismatched alloca"
, AI, I); return; } } while (false)
2637 "inalloca argument for call has mismatched alloca", AI, I)do { if (!(AI->isUsedWithInAlloca())) { CheckFailed("inalloca argument for call has mismatched alloca"
, AI, I); return; } } while (false)
;
2638 }
2639
2640 // For each argument of the callsite, if it has the swifterror argument,
2641 // make sure the underlying alloca/parameter it comes from has a swifterror as
2642 // well.
2643 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
2644 if (CS.paramHasAttr(i+1, Attribute::SwiftError)) {
2645 Value *SwiftErrorArg = CS.getArgument(i);
2646 if (auto AI = dyn_cast<AllocaInst>(SwiftErrorArg->stripInBoundsOffsets())) {
2647 Assert(AI->isSwiftError(),do { if (!(AI->isSwiftError())) { CheckFailed("swifterror argument for call has mismatched alloca"
, AI, I); return; } } while (false)
2648 "swifterror argument for call has mismatched alloca", AI, I)do { if (!(AI->isSwiftError())) { CheckFailed("swifterror argument for call has mismatched alloca"
, AI, I); return; } } while (false)
;
2649 continue;
2650 }
2651 auto ArgI = dyn_cast<Argument>(SwiftErrorArg);
2652 Assert(ArgI, "swifterror argument should come from an alloca or parameter", SwiftErrorArg, I)do { if (!(ArgI)) { CheckFailed("swifterror argument should come from an alloca or parameter"
, SwiftErrorArg, I); return; } } while (false)
;
2653 Assert(ArgI->hasSwiftErrorAttr(),do { if (!(ArgI->hasSwiftErrorAttr())) { CheckFailed("swifterror argument for call has mismatched parameter"
, ArgI, I); return; } } while (false)
2654 "swifterror argument for call has mismatched parameter", ArgI, I)do { if (!(ArgI->hasSwiftErrorAttr())) { CheckFailed("swifterror argument for call has mismatched parameter"
, ArgI, I); return; } } while (false)
;
2655 }
2656
2657 if (FTy->isVarArg()) {
2658 // FIXME? is 'nest' even legal here?
2659 bool SawNest = false;
2660 bool SawReturned = false;
2661
2662 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
2663 if (Attrs.hasAttribute(Idx, Attribute::Nest))
2664 SawNest = true;
2665 if (Attrs.hasAttribute(Idx, Attribute::Returned))
2666 SawReturned = true;
2667 }
2668
2669 // Check attributes on the varargs part.
2670 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
2671 Type *Ty = CS.getArgument(Idx-1)->getType();
2672 verifyParameterAttrs(Attrs, Idx, Ty, false, I);
2673
2674 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
2675 Assert(!SawNest, "More than one parameter has attribute nest!", I)do { if (!(!SawNest)) { CheckFailed("More than one parameter has attribute nest!"
, I); return; } } while (false)
;
2676 SawNest = true;
2677 }
2678
2679 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
2680 Assert(!SawReturned, "More than one parameter has attribute returned!",do { if (!(!SawReturned)) { CheckFailed("More than one parameter has attribute returned!"
, I); return; } } while (false)
2681 I)do { if (!(!SawReturned)) { CheckFailed("More than one parameter has attribute returned!"
, I); return; } } while (false)
;
2682 Assert(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),do { if (!(Ty->canLosslesslyBitCastTo(FTy->getReturnType
()))) { CheckFailed("Incompatible argument and return types for 'returned' "
"attribute", I); return; } } while (false)
2683 "Incompatible argument and return types for 'returned' "do { if (!(Ty->canLosslesslyBitCastTo(FTy->getReturnType
()))) { CheckFailed("Incompatible argument and return types for 'returned' "
"attribute", I); return; } } while (false)
2684 "attribute",do { if (!(Ty->canLosslesslyBitCastTo(FTy->getReturnType
()))) { CheckFailed("Incompatible argument and return types for 'returned' "
"attribute", I); return; } } while (false)
2685 I)do { if (!(Ty->canLosslesslyBitCastTo(FTy->getReturnType
()))) { CheckFailed("Incompatible argument and return types for 'returned' "
"attribute", I); return; } } while (false)
;
2686 SawReturned = true;
2687 }
2688
2689 Assert(!Attrs.hasAttribute(Idx, Attribute::StructRet),do { if (!(!Attrs.hasAttribute(Idx, Attribute::StructRet))) {
CheckFailed("Attribute 'sret' cannot be used for vararg call arguments!"
, I); return; } } while (false)
2690 "Attribute 'sret' cannot be used for vararg call arguments!", I)do { if (!(!Attrs.hasAttribute(Idx, Attribute::StructRet))) {
CheckFailed("Attribute 'sret' cannot be used for vararg call arguments!"
, I); return; } } while (false)
;
2691
2692 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
2693 Assert(Idx == CS.arg_size(), "inalloca isn't on the last argument!", I)do { if (!(Idx == CS.arg_size())) { CheckFailed("inalloca isn't on the last argument!"
, I); return; } } while (false)
;
2694 }
2695 }
2696
2697 // Verify that there's no metadata unless it's a direct call to an intrinsic.
2698 if (CS.getCalledFunction() == nullptr ||
2699 !CS.getCalledFunction()->getName().startswith("llvm.")) {
2700 for (Type *ParamTy : FTy->params()) {
2701 Assert(!ParamTy->isMetadataTy(),do { if (!(!ParamTy->isMetadataTy())) { CheckFailed("Function has metadata parameter but isn't an intrinsic"
, I); return; } } while (false)
2702 "Function has metadata parameter but isn't an intrinsic", I)do { if (!(!ParamTy->isMetadataTy())) { CheckFailed("Function has metadata parameter but isn't an intrinsic"
, I); return; } } while (false)
;
2703 Assert(!ParamTy->isTokenTy(),do { if (!(!ParamTy->isTokenTy())) { CheckFailed("Function has token parameter but isn't an intrinsic"
, I); return; } } while (false)
2704 "Function has token parameter but isn't an intrinsic", I)do { if (!(!ParamTy->isTokenTy())) { CheckFailed("Function has token parameter but isn't an intrinsic"
, I); return; } } while (false)
;
2705 }
2706 }
2707
2708 // Verify that indirect calls don't return tokens.
2709 if (CS.getCalledFunction() == nullptr)
2710 Assert(!FTy->getReturnType()->isTokenTy(),do { if (!(!FTy->getReturnType()->isTokenTy())) { CheckFailed
("Return type cannot be token for indirect call!"); return; }
} while (false)
2711 "Return type cannot be token for indirect call!")do { if (!(!FTy->getReturnType()->isTokenTy())) { CheckFailed
("Return type cannot be token for indirect call!"); return; }
} while (false)
;
2712
2713 if (Function *F = CS.getCalledFunction())
2714 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2715 visitIntrinsicCallSite(ID, CS);
2716
2717 // Verify that a callsite has at most one "deopt", at most one "funclet" and
2718 // at most one "gc-transition" operand bundle.
2719 bool FoundDeoptBundle = false, FoundFuncletBundle = false,
2720 FoundGCTransitionBundle = false;
2721 for (unsigned i = 0, e = CS.getNumOperandBundles(); i < e; ++i) {
2722 OperandBundleUse BU = CS.getOperandBundleAt(i);
2723 uint32_t Tag = BU.getTagID();
2724 if (Tag == LLVMContext::OB_deopt) {
2725 Assert(!FoundDeoptBundle, "Multiple deopt operand bundles", I)do { if (!(!FoundDeoptBundle)) { CheckFailed("Multiple deopt operand bundles"
, I); return; } } while (false)
;
2726 FoundDeoptBundle = true;
2727 } else if (Tag == LLVMContext::OB_gc_transition) {
2728 Assert(!FoundGCTransitionBundle, "Multiple gc-transition operand bundles",do { if (!(!FoundGCTransitionBundle)) { CheckFailed("Multiple gc-transition operand bundles"
, I); return; } } while (false)
2729 I)do { if (!(!FoundGCTransitionBundle)) { CheckFailed("Multiple gc-transition operand bundles"
, I); return; } } while (false)
;
2730 FoundGCTransitionBundle = true;
2731 } else if (Tag == LLVMContext::OB_funclet) {
2732 Assert(!FoundFuncletBundle, "Multiple funclet operand bundles", I)do { if (!(!FoundFuncletBundle)) { CheckFailed("Multiple funclet operand bundles"
, I); return; } } while (false)
;
2733 FoundFuncletBundle = true;
2734 Assert(BU.Inputs.size() == 1,do { if (!(BU.Inputs.size() == 1)) { CheckFailed("Expected exactly one funclet bundle operand"
, I); return; } } while (false)
2735 "Expected exactly one funclet bundle operand", I)do { if (!(BU.Inputs.size() == 1)) { CheckFailed("Expected exactly one funclet bundle operand"
, I); return; } } while (false)
;
2736 Assert(isa<FuncletPadInst>(BU.Inputs.front()),do { if (!(isa<FuncletPadInst>(BU.Inputs.front()))) { CheckFailed
("Funclet bundle operands should correspond to a FuncletPadInst"
, I); return; } } while (false)
2737 "Funclet bundle operands should correspond to a FuncletPadInst",do { if (!(isa<FuncletPadInst>(BU.Inputs.front()))) { CheckFailed
("Funclet bundle operands should correspond to a FuncletPadInst"
, I); return; } } while (false)
2738 I)do { if (!(isa<FuncletPadInst>(BU.Inputs.front()))) { CheckFailed
("Funclet bundle operands should correspond to a FuncletPadInst"
, I); return; } } while (false)
;
2739 }
2740 }
2741
2742 // Verify that each inlinable callsite of a debug-info-bearing function in a
2743 // debug-info-bearing function has a debug location attached to it. Failure to
2744 // do so causes assertion failures when the inliner sets up inline scope info.
2745 if (I->getFunction()->getSubprogram() && CS.getCalledFunction() &&
2746 CS.getCalledFunction()->getSubprogram())
2747 AssertDI(I->getDebugLoc(), "inlinable function call in a function with "do { if (!(I->getDebugLoc())) { DebugInfoCheckFailed("inlinable function call in a function with "
"debug info must have a !dbg location", I); return; } } while
(false)
2748 "debug info must have a !dbg location",do { if (!(I->getDebugLoc())) { DebugInfoCheckFailed("inlinable function call in a function with "
"debug info must have a !dbg location", I); return; } } while
(false)
2749 I)do { if (!(I->getDebugLoc())) { DebugInfoCheckFailed("inlinable function call in a function with "
"debug info must have a !dbg location", I); return; } } while
(false)
;
2750
2751 visitInstruction(*I);
2752}
2753
2754/// Two types are "congruent" if they are identical, or if they are both pointer
2755/// types with different pointee types and the same address space.
2756static bool isTypeCongruent(Type *L, Type *R) {
2757 if (L == R)
2758 return true;
2759 PointerType *PL = dyn_cast<PointerType>(L);
2760 PointerType *PR = dyn_cast<PointerType>(R);
2761 if (!PL || !PR)
2762 return false;
2763 return PL->getAddressSpace() == PR->getAddressSpace();
2764}
2765
2766static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
2767 static const Attribute::AttrKind ABIAttrs[] = {
2768 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
2769 Attribute::InReg, Attribute::Returned, Attribute::SwiftSelf,
2770 Attribute::SwiftError};
2771 AttrBuilder Copy;
2772 for (auto AK : ABIAttrs) {
2773 if (Attrs.hasAttribute(I + 1, AK))
2774 Copy.addAttribute(AK);
2775 }
2776 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
2777 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
2778 return Copy;
2779}
2780
2781void Verifier::verifyMustTailCall(CallInst &CI) {
2782 Assert(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI)do { if (!(!CI.isInlineAsm())) { CheckFailed("cannot use musttail call with inline asm"
, &CI); return; } } while (false)
;
2783
2784 // - The caller and callee prototypes must match. Pointer types of
2785 // parameters or return types may differ in pointee type, but not
2786 // address space.
2787 Function *F = CI.getParent()->getParent();
2788 FunctionType *CallerTy = F->getFunctionType();
2789 FunctionType *CalleeTy = CI.getFunctionType();
2790 Assert(CallerTy->getNumParams() == CalleeTy->getNumParams(),do { if (!(CallerTy->getNumParams() == CalleeTy->getNumParams
())) { CheckFailed("cannot guarantee tail call due to mismatched parameter counts"
, &CI); return; } } while (false)
2791 "cannot guarantee tail call due to mismatched parameter counts", &CI)do { if (!(CallerTy->getNumParams() == CalleeTy->getNumParams
())) { CheckFailed("cannot guarantee tail call due to mismatched parameter counts"
, &CI); return; } } while (false)
;
2792 Assert(CallerTy->isVarArg() == CalleeTy->isVarArg(),do { if (!(CallerTy->isVarArg() == CalleeTy->isVarArg()
)) { CheckFailed("cannot guarantee tail call due to mismatched varargs"
, &CI); return; } } while (false)
2793 "cannot guarantee tail call due to mismatched varargs", &CI)do { if (!(CallerTy->isVarArg() == CalleeTy->isVarArg()
)) { CheckFailed("cannot guarantee tail call due to mismatched varargs"
, &CI); return; } } while (false)
;
2794 Assert(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),do { if (!(isTypeCongruent(CallerTy->getReturnType(), CalleeTy
->getReturnType()))) { CheckFailed("cannot guarantee tail call due to mismatched return types"
, &CI); return; } } while (false)
2795 "cannot guarantee tail call due to mismatched return types", &CI)do { if (!(isTypeCongruent(CallerTy->getReturnType(), CalleeTy
->getReturnType()))) { CheckFailed("cannot guarantee tail call due to mismatched return types"
, &CI); return; } } while (false)
;
2796 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
2797 Assert(do { if (!(isTypeCongruent(CallerTy->getParamType(I), CalleeTy
->getParamType(I)))) { CheckFailed("cannot guarantee tail call due to mismatched parameter types"
, &CI); return; } } while (false)
2798 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),do { if (!(isTypeCongruent(CallerTy->getParamType(I), CalleeTy
->getParamType(I)))) { CheckFailed("cannot guarantee tail call due to mismatched parameter types"
, &CI); return; } } while (false)
2799 "cannot guarantee tail call due to mismatched parameter types", &CI)do { if (!(isTypeCongruent(CallerTy->getParamType(I), CalleeTy
->getParamType(I)))) { CheckFailed("cannot guarantee tail call due to mismatched parameter types"
, &CI); return; } } while (false)
;
2800 }
2801
2802 // - The calling conventions of the caller and callee must match.
2803 Assert(F->getCallingConv() == CI.getCallingConv(),do { if (!(F->getCallingConv() == CI.getCallingConv())) { CheckFailed
("cannot guarantee tail call due to mismatched calling conv",
&CI); return; } } while (false)
2804 "cannot guarantee tail call due to mismatched calling conv", &CI)do { if (!(F->getCallingConv() == CI.getCallingConv())) { CheckFailed
("cannot guarantee tail call due to mismatched calling conv",
&CI); return; } } while (false)
;
2805
2806 // - All ABI-impacting function attributes, such as sret, byval, inreg,
2807 // returned, and inalloca, must match.
2808 AttributeSet CallerAttrs = F->getAttributes();
2809 AttributeSet CalleeAttrs = CI.getAttributes();
2810 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
2811 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
2812 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
2813 Assert(CallerABIAttrs == CalleeABIAttrs,do { if (!(CallerABIAttrs == CalleeABIAttrs)) { CheckFailed("cannot guarantee tail call due to mismatched ABI impacting "
"function attributes", &CI, CI.getOperand(I)); return; }
} while (false)
2814 "cannot guarantee tail call due to mismatched ABI impacting "do { if (!(CallerABIAttrs == CalleeABIAttrs)) { CheckFailed("cannot guarantee tail call due to mismatched ABI impacting "
"function attributes", &CI, CI.getOperand(I)); return; }
} while (false)
2815 "function attributes",do { if (!(CallerABIAttrs == CalleeABIAttrs)) { CheckFailed("cannot guarantee tail call due to mismatched ABI impacting "
"function attributes", &CI, CI.getOperand(I)); return; }
} while (false)
2816 &CI, CI.getOperand(I))do { if (!(CallerABIAttrs == CalleeABIAttrs)) { CheckFailed("cannot guarantee tail call due to mismatched ABI impacting "
"function attributes", &CI, CI.getOperand(I)); return; }
} while (false)
;
2817 }
2818
2819 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
2820 // or a pointer bitcast followed by a ret instruction.
2821 // - The ret instruction must return the (possibly bitcasted) value
2822 // produced by the call or void.
2823 Value *RetVal = &CI;
2824 Instruction *Next = CI.getNextNode();
2825
2826 // Handle the optional bitcast.
2827 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
2828 Assert(BI->getOperand(0) == RetVal,do { if (!(BI->getOperand(0) == RetVal)) { CheckFailed("bitcast following musttail call must use the call"
, BI); return; } } while (false)
2829 "bitcast following musttail call must use the call", BI)do { if (!(BI->getOperand(0) == RetVal)) { CheckFailed("bitcast following musttail call must use the call"
, BI); return; } } while (false)
;
2830 RetVal = BI;
2831 Next = BI->getNextNode();
2832 }
2833
2834 // Check the return.
2835 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
2836 Assert(Ret, "musttail call must be precede a ret with an optional bitcast",do { if (!(Ret)) { CheckFailed("musttail call must be precede a ret with an optional bitcast"
, &CI); return; } } while (false)
2837 &CI)do { if (!(Ret)) { CheckFailed("musttail call must be precede a ret with an optional bitcast"
, &CI); return; } } while (false)
;
2838 Assert(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,do { if (!(!Ret->getReturnValue() || Ret->getReturnValue
() == RetVal)) { CheckFailed("musttail call result must be returned"
, Ret); return; } } while (false)
2839 "musttail call result must be returned", Ret)do { if (!(!Ret->getReturnValue() || Ret->getReturnValue
() == RetVal)) { CheckFailed("musttail call result must be returned"
, Ret); return; } } while (false)
;
2840}
2841
2842void Verifier::visitCallInst(CallInst &CI) {
2843 verifyCallSite(&CI);
2844
2845 if (CI.isMustTailCall())
2846 verifyMustTailCall(CI);
2847}
2848
2849void Verifier::visitInvokeInst(InvokeInst &II) {
2850 verifyCallSite(&II);
2851
2852 // Verify that the first non-PHI instruction of the unwind destination is an
2853 // exception handling instruction.
2854 Assert(do { if (!(II.getUnwindDest()->isEHPad())) { CheckFailed("The unwind destination does not have an exception handling instruction!"
, &II); return; } } while (false)
2855 II.getUnwindDest()->isEHPad(),do { if (!(II.getUnwindDest()->isEHPad())) { CheckFailed("The unwind destination does not have an exception handling instruction!"
, &II); return; } } while (false)
2856 "The unwind destination does not have an exception handling instruction!",do { if (!(II.getUnwindDest()->isEHPad())) { CheckFailed("The unwind destination does not have an exception handling instruction!"
, &II); return; } } while (false)
2857 &II)do { if (!(II.getUnwindDest()->isEHPad())) { CheckFailed("The unwind destination does not have an exception handling instruction!"
, &II); return; } } while (false)
;
2858
2859 visitTerminatorInst(II);
2860}
2861
2862/// visitBinaryOperator - Check that both arguments to the binary operator are
2863/// of the same type!
2864///
2865void Verifier::visitBinaryOperator(BinaryOperator &B) {
2866 Assert(B.getOperand(0)->getType() == B.getOperand(1)->getType(),do { if (!(B.getOperand(0)->getType() == B.getOperand(1)->
getType())) { CheckFailed("Both operands to a binary operator are not of the same type!"
, &B); return; } } while (false)
2867 "Both operands to a binary operator are not of the same type!", &B)do { if (!(B.getOperand(0)->getType() == B.getOperand(1)->
getType())) { CheckFailed("Both operands to a binary operator are not of the same type!"
, &B); return; } } while (false)
;
2868
2869 switch (B.getOpcode()) {
2870 // Check that integer arithmetic operators are only used with
2871 // integral operands.
2872 case Instruction::Add:
2873 case Instruction::Sub:
2874 case Instruction::Mul:
2875 case Instruction::SDiv:
2876 case Instruction::UDiv:
2877 case Instruction::SRem:
2878 case Instruction::URem:
2879 Assert(B.getType()->isIntOrIntVectorTy(),do { if (!(B.getType()->isIntOrIntVectorTy())) { CheckFailed
("Integer arithmetic operators only work with integral types!"
, &B); return; } } while (false)
2880 "Integer arithmetic operators only work with integral types!", &B)do { if (!(B.getType()->isIntOrIntVectorTy())) { CheckFailed
("Integer arithmetic operators only work with integral types!"
, &B); return; } } while (false)
;
2881 Assert(B.getType() == B.getOperand(0)->getType(),do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Integer arithmetic operators must have same type " "for operands and result!"
, &B); return; } } while (false)
2882 "Integer arithmetic operators must have same type "do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Integer arithmetic operators must have same type " "for operands and result!"
, &B); return; } } while (false)
2883 "for operands and result!",do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Integer arithmetic operators must have same type " "for operands and result!"
, &B); return; } } while (false)
2884 &B)do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Integer arithmetic operators must have same type " "for operands and result!"
, &B); return; } } while (false)
;
2885 break;
2886 // Check that floating-point arithmetic operators are only used with
2887 // floating-point operands.
2888 case Instruction::FAdd:
2889 case Instruction::FSub:
2890 case Instruction::FMul:
2891 case Instruction::FDiv:
2892 case Instruction::FRem:
2893 Assert(B.getType()->isFPOrFPVectorTy(),do { if (!(B.getType()->isFPOrFPVectorTy())) { CheckFailed
("Floating-point arithmetic operators only work with " "floating-point types!"
, &B); return; } } while (false)
2894 "Floating-point arithmetic operators only work with "do { if (!(B.getType()->isFPOrFPVectorTy())) { CheckFailed
("Floating-point arithmetic operators only work with " "floating-point types!"
, &B); return; } } while (false)
2895 "floating-point types!",do { if (!(B.getType()->isFPOrFPVectorTy())) { CheckFailed
("Floating-point arithmetic operators only work with " "floating-point types!"
, &B); return; } } while (false)
2896 &B)do { if (!(B.getType()->isFPOrFPVectorTy())) { CheckFailed
("Floating-point arithmetic operators only work with " "floating-point types!"
, &B); return; } } while (false)
;
2897 Assert(B.getType() == B.getOperand(0)->getType(),do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Floating-point arithmetic operators must have same type " "for operands and result!"
, &B); return; } } while (false)
2898 "Floating-point arithmetic operators must have same type "do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Floating-point arithmetic operators must have same type " "for operands and result!"
, &B); return; } } while (false)
2899 "for operands and result!",do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Floating-point arithmetic operators must have same type " "for operands and result!"
, &B); return; } } while (false)
2900 &B)do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Floating-point arithmetic operators must have same type " "for operands and result!"
, &B); return; } } while (false)
;
2901 break;
2902 // Check that logical operators are only used with integral operands.
2903 case Instruction::And:
2904 case Instruction::Or:
2905 case Instruction::Xor:
2906 Assert(B.getType()->isIntOrIntVectorTy(),do { if (!(B.getType()->isIntOrIntVectorTy())) { CheckFailed
("Logical operators only work with integral types!", &B);
return; } } while (false)
2907 "Logical operators only work with integral types!", &B)do { if (!(B.getType()->isIntOrIntVectorTy())) { CheckFailed
("Logical operators only work with integral types!", &B);
return; } } while (false)
;
2908 Assert(B.getType() == B.getOperand(0)->getType(),do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Logical operators must have same type for operands and result!"
, &B); return; } } while (false)
2909 "Logical operators must have same type for operands and result!",do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Logical operators must have same type for operands and result!"
, &B); return; } } while (false)
2910 &B)do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Logical operators must have same type for operands and result!"
, &B); return; } } while (false)
;
2911 break;
2912 case Instruction::Shl:
2913 case Instruction::LShr:
2914 case Instruction::AShr:
2915 Assert(B.getType()->isIntOrIntVectorTy(),do { if (!(B.getType()->isIntOrIntVectorTy())) { CheckFailed
("Shifts only work with integral types!", &B); return; } }
while (false)
2916 "Shifts only work with integral types!", &B)do { if (!(B.getType()->isIntOrIntVectorTy())) { CheckFailed
("Shifts only work with integral types!", &B); return; } }
while (false)
;
2917 Assert(B.getType() == B.getOperand(0)->getType(),do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Shift return type must be same as operands!", &B); return
; } } while (false)
2918 "Shift return type must be same as operands!", &B)do { if (!(B.getType() == B.getOperand(0)->getType())) { CheckFailed
("Shift return type must be same as operands!", &B); return
; } } while (false)
;
2919 break;
2920 default:
2921 llvm_unreachable("Unknown BinaryOperator opcode!")::llvm::llvm_unreachable_internal("Unknown BinaryOperator opcode!"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 2921)
;
2922 }
2923
2924 visitInstruction(B);
2925}
2926
2927void Verifier::visitICmpInst(ICmpInst &IC) {
2928 // Check that the operands are the same type
2929 Type *Op0Ty = IC.getOperand(0)->getType();
2930 Type *Op1Ty = IC.getOperand(1)->getType();
2931 Assert(Op0Ty == Op1Ty,do { if (!(Op0Ty == Op1Ty)) { CheckFailed("Both operands to ICmp instruction are not of the same type!"
, &IC); return; } } while (false)
2932 "Both operands to ICmp instruction are not of the same type!", &IC)do { if (!(Op0Ty == Op1Ty)) { CheckFailed("Both operands to ICmp instruction are not of the same type!"
, &IC); return; } } while (false)
;
2933 // Check that the operands are the right type
2934 Assert(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),do { if (!(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType
()->isPointerTy())) { CheckFailed("Invalid operand types for ICmp instruction"
, &IC); return; } } while (false)
2935 "Invalid operand types for ICmp instruction", &IC)do { if (!(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType
()->isPointerTy())) { CheckFailed("Invalid operand types for ICmp instruction"
, &IC); return; } } while (false)
;
2936 // Check that the predicate is valid.
2937 Assert(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&do { if (!(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE
&& IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE
)) { CheckFailed("Invalid predicate in ICmp instruction!", &
IC); return; } } while (false)
2938 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,do { if (!(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE
&& IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE
)) { CheckFailed("Invalid predicate in ICmp instruction!", &
IC); return; } } while (false)
2939 "Invalid predicate in ICmp instruction!", &IC)do { if (!(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE
&& IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE
)) { CheckFailed("Invalid predicate in ICmp instruction!", &
IC); return; } } while (false)
;
2940
2941 visitInstruction(IC);
2942}
2943
2944void Verifier::visitFCmpInst(FCmpInst &FC) {
2945 // Check that the operands are the same type
2946 Type *Op0Ty = FC.getOperand(0)->getType();
2947 Type *Op1Ty = FC.getOperand(1)->getType();
2948 Assert(Op0Ty == Op1Ty,do { if (!(Op0Ty == Op1Ty)) { CheckFailed("Both operands to FCmp instruction are not of the same type!"
, &FC); return; } } while (false)
2949 "Both operands to FCmp instruction are not of the same type!", &FC)do { if (!(Op0Ty == Op1Ty)) { CheckFailed("Both operands to FCmp instruction are not of the same type!"
, &FC); return; } } while (false)
;
2950 // Check that the operands are the right type
2951 Assert(Op0Ty->isFPOrFPVectorTy(),do { if (!(Op0Ty->isFPOrFPVectorTy())) { CheckFailed("Invalid operand types for FCmp instruction"
, &FC); return; } } while (false)
2952 "Invalid operand types for FCmp instruction", &FC)do { if (!(Op0Ty->isFPOrFPVectorTy())) { CheckFailed("Invalid operand types for FCmp instruction"
, &FC); return; } } while (false)
;
2953 // Check that the predicate is valid.
2954 Assert(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&do { if (!(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE
&& FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE
)) { CheckFailed("Invalid predicate in FCmp instruction!", &
FC); return; } } while (false)
2955 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,do { if (!(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE
&& FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE
)) { CheckFailed("Invalid predicate in FCmp instruction!", &
FC); return; } } while (false)
2956 "Invalid predicate in FCmp instruction!", &FC)do { if (!(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE
&& FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE
)) { CheckFailed("Invalid predicate in FCmp instruction!", &
FC); return; } } while (false)
;
2957
2958 visitInstruction(FC);
2959}
2960
2961void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
2962 Assert(do { if (!(ExtractElementInst::isValidOperands(EI.getOperand(
0), EI.getOperand(1)))) { CheckFailed("Invalid extractelement operands!"
, &EI); return; } } while (false)
2963 ExtractElementInst::isValidOperands(EI.getOperand(0), EI.getOperand(1)),do { if (!(ExtractElementInst::isValidOperands(EI.getOperand(
0), EI.getOperand(1)))) { CheckFailed("Invalid extractelement operands!"
, &EI); return; } } while (false)
2964 "Invalid extractelement operands!", &EI)do { if (!(ExtractElementInst::isValidOperands(EI.getOperand(
0), EI.getOperand(1)))) { CheckFailed("Invalid extractelement operands!"
, &EI); return; } } while (false)
;
2965 visitInstruction(EI);
2966}
2967
2968void Verifier::visitInsertElementInst(InsertElementInst &IE) {
2969 Assert(InsertElementInst::isValidOperands(IE.getOperand(0), IE.getOperand(1),do { if (!(InsertElementInst::isValidOperands(IE.getOperand(0
), IE.getOperand(1), IE.getOperand(2)))) { CheckFailed("Invalid insertelement operands!"
, &IE); return; } } while (false)
2970 IE.getOperand(2)),do { if (!(InsertElementInst::isValidOperands(IE.getOperand(0
), IE.getOperand(1), IE.getOperand(2)))) { CheckFailed("Invalid insertelement operands!"
, &IE); return; } } while (false)
2971 "Invalid insertelement operands!", &IE)do { if (!(InsertElementInst::isValidOperands(IE.getOperand(0
), IE.getOperand(1), IE.getOperand(2)))) { CheckFailed("Invalid insertelement operands!"
, &IE); return; } } while (false)
;
2972 visitInstruction(IE);
2973}
2974
2975void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
2976 Assert(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),do { if (!(ShuffleVectorInst::isValidOperands(SV.getOperand(0
), SV.getOperand(1), SV.getOperand(2)))) { CheckFailed("Invalid shufflevector operands!"
, &SV); return; } } while (false)
2977 SV.getOperand(2)),do { if (!(ShuffleVectorInst::isValidOperands(SV.getOperand(0
), SV.getOperand(1), SV.getOperand(2)))) { CheckFailed("Invalid shufflevector operands!"
, &SV); return; } } while (false)
2978 "Invalid shufflevector operands!", &SV)do { if (!(ShuffleVectorInst::isValidOperands(SV.getOperand(0
), SV.getOperand(1), SV.getOperand(2)))) { CheckFailed("Invalid shufflevector operands!"
, &SV); return; } } while (false)
;
2979 visitInstruction(SV);
2980}
2981
2982void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
2983 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
2984
2985 Assert(isa<PointerType>(TargetTy),do { if (!(isa<PointerType>(TargetTy))) { CheckFailed("GEP base pointer is not a vector or a vector of pointers"
, &GEP); return; } } while (false)
2986 "GEP base pointer is not a vector or a vector of pointers", &GEP)do { if (!(isa<PointerType>(TargetTy))) { CheckFailed("GEP base pointer is not a vector or a vector of pointers"
, &GEP); return; } } while (false)
;
2987 Assert(GEP.getSourceElementType()->isSized(), "GEP into unsized type!", &GEP)do { if (!(GEP.getSourceElementType()->isSized())) { CheckFailed
("GEP into unsized type!", &GEP); return; } } while (false
)
;
2988 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
2989 Type *ElTy =
2990 GetElementPtrInst::getIndexedType(GEP.getSourceElementType(), Idxs);
2991 Assert(ElTy, "Invalid indices for GEP pointer type!", &GEP)do { if (!(ElTy)) { CheckFailed("Invalid indices for GEP pointer type!"
, &GEP); return; } } while (false)
;
2992
2993 Assert(GEP.getType()->getScalarType()->isPointerTy() &&do { if (!(GEP.getType()->getScalarType()->isPointerTy(
) && GEP.getResultElementType() == ElTy)) { CheckFailed
("GEP is not of right type for indices!", &GEP, ElTy); return
; } } while (false)
2994 GEP.getResultElementType() == ElTy,do { if (!(GEP.getType()->getScalarType()->isPointerTy(
) && GEP.getResultElementType() == ElTy)) { CheckFailed
("GEP is not of right type for indices!", &GEP, ElTy); return
; } } while (false)
2995 "GEP is not of right type for indices!", &GEP, ElTy)do { if (!(GEP.getType()->getScalarType()->isPointerTy(
) && GEP.getResultElementType() == ElTy)) { CheckFailed
("GEP is not of right type for indices!", &GEP, ElTy); return
; } } while (false)
;
2996
2997 if (GEP.getType()->isVectorTy()) {
2998 // Additional checks for vector GEPs.
2999 unsigned GEPWidth = GEP.getType()->getVectorNumElements();
3000 if (GEP.getPointerOperandType()->isVectorTy())
3001 Assert(GEPWidth == GEP.getPointerOperandType()->getVectorNumElements(),do { if (!(GEPWidth == GEP.getPointerOperandType()->getVectorNumElements
())) { CheckFailed("Vector GEP result width doesn't match operand's"
, &GEP); return; } } while (false)
3002 "Vector GEP result width doesn't match operand's", &GEP)do { if (!(GEPWidth == GEP.getPointerOperandType()->getVectorNumElements
())) { CheckFailed("Vector GEP result width doesn't match operand's"
, &GEP); return; } } while (false)
;
3003 for (Value *Idx : Idxs) {
3004 Type *IndexTy = Idx->getType();
3005 if (IndexTy->isVectorTy()) {
3006 unsigned IndexWidth = IndexTy->getVectorNumElements();
3007 Assert(IndexWidth == GEPWidth, "Invalid GEP index vector width", &GEP)do { if (!(IndexWidth == GEPWidth)) { CheckFailed("Invalid GEP index vector width"
, &GEP); return; } } while (false)
;
3008 }
3009 Assert(IndexTy->getScalarType()->isIntegerTy(),do { if (!(IndexTy->getScalarType()->isIntegerTy())) { CheckFailed
("All GEP indices should be of integer type"); return; } } while
(false)
3010 "All GEP indices should be of integer type")do { if (!(IndexTy->getScalarType()->isIntegerTy())) { CheckFailed
("All GEP indices should be of integer type"); return; } } while
(false)
;
3011 }
3012 }
3013 visitInstruction(GEP);
3014}
3015
3016static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
3017 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
3018}
3019
3020void Verifier::visitRangeMetadata(Instruction &I, MDNode *Range, Type *Ty) {
3021 assert(Range && Range == I.getMetadata(LLVMContext::MD_range) &&((Range && Range == I.getMetadata(LLVMContext::MD_range
) && "precondition violation") ? static_cast<void>
(0) : __assert_fail ("Range && Range == I.getMetadata(LLVMContext::MD_range) && \"precondition violation\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 3022, __PRETTY_FUNCTION__))
3022 "precondition violation")((Range && Range == I.getMetadata(LLVMContext::MD_range
) && "precondition violation") ? static_cast<void>
(0) : __assert_fail ("Range && Range == I.getMetadata(LLVMContext::MD_range) && \"precondition violation\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 3022, __PRETTY_FUNCTION__))
;
3023
3024 unsigned NumOperands = Range->getNumOperands();
3025 Assert(NumOperands % 2 == 0, "Unfinished range!", Range)do { if (!(NumOperands % 2 == 0)) { CheckFailed("Unfinished range!"
, Range); return; } } while (false)
;
3026 unsigned NumRanges = NumOperands / 2;
3027 Assert(NumRanges >= 1, "It should have at least one range!", Range)do { if (!(NumRanges >= 1)) { CheckFailed("It should have at least one range!"
, Range); return; } } while (false)
;
3028
3029 ConstantRange LastRange(1); // Dummy initial value
3030 for (unsigned i = 0; i < NumRanges; ++i) {
3031 ConstantInt *Low =
3032 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i));
3033 Assert(Low, "The lower limit must be an integer!", Low)do { if (!(Low)) { CheckFailed("The lower limit must be an integer!"
, Low); return; } } while (false)
;
3034 ConstantInt *High =
3035 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i + 1));
3036 Assert(High, "The upper limit must be an integer!", High)do { if (!(High)) { CheckFailed("The upper limit must be an integer!"
, High); return; } } while (false)
;
3037 Assert(High->getType() == Low->getType() && High->getType() == Ty,do { if (!(High->getType() == Low->getType() &&
High->getType() == Ty)) { CheckFailed("Range types must match instruction type!"
, &I); return; } } while (false)
3038 "Range types must match instruction type!", &I)do { if (!(High->getType() == Low->getType() &&
High->getType() == Ty)) { CheckFailed("Range types must match instruction type!"
, &I); return; } } while (false)
;
3039
3040 APInt HighV = High->getValue();
3041 APInt LowV = Low->getValue();
3042 ConstantRange CurRange(LowV, HighV);
3043 Assert(!CurRange.isEmptySet() && !CurRange.isFullSet(),do { if (!(!CurRange.isEmptySet() && !CurRange.isFullSet
())) { CheckFailed("Range must not be empty!", Range); return
; } } while (false)
3044 "Range must not be empty!", Range)do { if (!(!CurRange.isEmptySet() && !CurRange.isFullSet
())) { CheckFailed("Range must not be empty!", Range); return
; } } while (false)
;
3045 if (i != 0) {
3046 Assert(CurRange.intersectWith(LastRange).isEmptySet(),do { if (!(CurRange.intersectWith(LastRange).isEmptySet())) {
CheckFailed("Intervals are overlapping", Range); return; } }
while (false)
3047 "Intervals are overlapping", Range)do { if (!(CurRange.intersectWith(LastRange).isEmptySet())) {
CheckFailed("Intervals are overlapping", Range); return; } }
while (false)
;
3048 Assert(LowV.sgt(LastRange.getLower()), "Intervals are not in order",do { if (!(LowV.sgt(LastRange.getLower()))) { CheckFailed("Intervals are not in order"
, Range); return; } } while (false)
3049 Range)do { if (!(LowV.sgt(LastRange.getLower()))) { CheckFailed("Intervals are not in order"
, Range); return; } } while (false)
;
3050 Assert(!isContiguous(CurRange, LastRange), "Intervals are contiguous",do { if (!(!isContiguous(CurRange, LastRange))) { CheckFailed
("Intervals are contiguous", Range); return; } } while (false
)
3051 Range)do { if (!(!isContiguous(CurRange, LastRange))) { CheckFailed
("Intervals are contiguous", Range); return; } } while (false
)
;
3052 }
3053 LastRange = ConstantRange(LowV, HighV);
3054 }
3055 if (NumRanges > 2) {
3056 APInt FirstLow =
3057 mdconst::dyn_extract<ConstantInt>(Range->getOperand(0))->getValue();
3058 APInt FirstHigh =
3059 mdconst::dyn_extract<ConstantInt>(Range->getOperand(1))->getValue();
3060 ConstantRange FirstRange(FirstLow, FirstHigh);
3061 Assert(FirstRange.intersectWith(LastRange).isEmptySet(),do { if (!(FirstRange.intersectWith(LastRange).isEmptySet()))
{ CheckFailed("Intervals are overlapping", Range); return; }
} while (false)
3062 "Intervals are overlapping", Range)do { if (!(FirstRange.intersectWith(LastRange).isEmptySet()))
{ CheckFailed("Intervals are overlapping", Range); return; }
} while (false)
;
3063 Assert(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",do { if (!(!isContiguous(FirstRange, LastRange))) { CheckFailed
("Intervals are contiguous", Range); return; } } while (false
)
3064 Range)do { if (!(!isContiguous(FirstRange, LastRange))) { CheckFailed
("Intervals are contiguous", Range); return; } } while (false
)
;
3065 }
3066}
3067
3068void Verifier::checkAtomicMemAccessSize(Type *Ty, const Instruction *I) {
3069 unsigned Size = DL.getTypeSizeInBits(Ty);
3070 Assert(Size >= 8, "atomic memory access' size must be byte-sized", Ty, I)do { if (!(Size >= 8)) { CheckFailed("atomic memory access' size must be byte-sized"
, Ty, I); return; } } while (false)
;
3071 Assert(!(Size & (Size - 1)),do { if (!(!(Size & (Size - 1)))) { CheckFailed("atomic memory access' operand must have a power-of-two size"
, Ty, I); return; } } while (false)
3072 "atomic memory access' operand must have a power-of-two size", Ty, I)do { if (!(!(Size & (Size - 1)))) { CheckFailed("atomic memory access' operand must have a power-of-two size"
, Ty, I); return; } } while (false)
;
3073}
3074
3075void Verifier::visitLoadInst(LoadInst &LI) {
3076 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
3077 Assert(PTy, "Load operand must be a pointer.", &LI)do { if (!(PTy)) { CheckFailed("Load operand must be a pointer."
, &LI); return; } } while (false)
;
3078 Type *ElTy = LI.getType();
3079 Assert(LI.getAlignment() <= Value::MaximumAlignment,do { if (!(LI.getAlignment() <= Value::MaximumAlignment)) {
CheckFailed("huge alignment values are unsupported", &LI
); return; } } while (false)
3080 "huge alignment values are unsupported", &LI)do { if (!(LI.getAlignment() <= Value::MaximumAlignment)) {
CheckFailed("huge alignment values are unsupported", &LI
); return; } } while (false)
;
3081 Assert(ElTy->isSized(), "loading unsized types is not allowed", &LI)do { if (!(ElTy->isSized())) { CheckFailed("loading unsized types is not allowed"
, &LI); return; } } while (false)
;
3082 if (LI.isAtomic()) {
3083 Assert(LI.getOrdering() != AtomicOrdering::Release &&do { if (!(LI.getOrdering() != AtomicOrdering::Release &&
LI.getOrdering() != AtomicOrdering::AcquireRelease)) { CheckFailed
("Load cannot have Release ordering", &LI); return; } } while
(false)
3084 LI.getOrdering() != AtomicOrdering::AcquireRelease,do { if (!(LI.getOrdering() != AtomicOrdering::Release &&
LI.getOrdering() != AtomicOrdering::AcquireRelease)) { CheckFailed
("Load cannot have Release ordering", &LI); return; } } while
(false)
3085 "Load cannot have Release ordering", &LI)do { if (!(LI.getOrdering() != AtomicOrdering::Release &&
LI.getOrdering() != AtomicOrdering::AcquireRelease)) { CheckFailed
("Load cannot have Release ordering", &LI); return; } } while
(false)
;
3086 Assert(LI.getAlignment() != 0,do { if (!(LI.getAlignment() != 0)) { CheckFailed("Atomic load must specify explicit alignment"
, &LI); return; } } while (false)
3087 "Atomic load must specify explicit alignment", &LI)do { if (!(LI.getAlignment() != 0)) { CheckFailed("Atomic load must specify explicit alignment"
, &LI); return; } } while (false)
;
3088 Assert(ElTy->isIntegerTy() || ElTy->isPointerTy() ||do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic load operand must have integer, pointer, or floating point "
"type!", ElTy, &LI); return; } } while (false)
3089 ElTy->isFloatingPointTy(),do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic load operand must have integer, pointer, or floating point "
"type!", ElTy, &LI); return; } } while (false)
3090 "atomic load operand must have integer, pointer, or floating point "do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic load operand must have integer, pointer, or floating point "
"type!", ElTy, &LI); return; } } while (false)
3091 "type!",do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic load operand must have integer, pointer, or floating point "
"type!", ElTy, &LI); return; } } while (false)
3092 ElTy, &LI)do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic load operand must have integer, pointer, or floating point "
"type!", ElTy, &LI); return; } } while (false)
;
3093 checkAtomicMemAccessSize(ElTy, &LI);
3094 } else {
3095 Assert(LI.getSynchScope() == CrossThread,do { if (!(LI.getSynchScope() == CrossThread)) { CheckFailed(
"Non-atomic load cannot have SynchronizationScope specified",
&LI); return; } } while (false)
3096 "Non-atomic load cannot have SynchronizationScope specified", &LI)do { if (!(LI.getSynchScope() == CrossThread)) { CheckFailed(
"Non-atomic load cannot have SynchronizationScope specified",
&LI); return; } } while (false)
;
3097 }
3098
3099 visitInstruction(LI);
3100}
3101
3102void Verifier::visitStoreInst(StoreInst &SI) {
3103 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
3104 Assert(PTy, "Store operand must be a pointer.", &SI)do { if (!(PTy)) { CheckFailed("Store operand must be a pointer."
, &SI); return; } } while (false)
;
3105 Type *ElTy = PTy->getElementType();
3106 Assert(ElTy == SI.getOperand(0)->getType(),do { if (!(ElTy == SI.getOperand(0)->getType())) { CheckFailed
("Stored value type does not match pointer operand type!", &
SI, ElTy); return; } } while (false)
3107 "Stored value type does not match pointer operand type!", &SI, ElTy)do { if (!(ElTy == SI.getOperand(0)->getType())) { CheckFailed
("Stored value type does not match pointer operand type!", &
SI, ElTy); return; } } while (false)
;
3108 Assert(SI.getAlignment() <= Value::MaximumAlignment,do { if (!(SI.getAlignment() <= Value::MaximumAlignment)) {
CheckFailed("huge alignment values are unsupported", &SI
); return; } } while (false)
3109 "huge alignment values are unsupported", &SI)do { if (!(SI.getAlignment() <= Value::MaximumAlignment)) {
CheckFailed("huge alignment values are unsupported", &SI
); return; } } while (false)
;
3110 Assert(ElTy->isSized(), "storing unsized types is not allowed", &SI)do { if (!(ElTy->isSized())) { CheckFailed("storing unsized types is not allowed"
, &SI); return; } } while (false)
;
3111 if (SI.isAtomic()) {
3112 Assert(SI.getOrdering() != AtomicOrdering::Acquire &&do { if (!(SI.getOrdering() != AtomicOrdering::Acquire &&
SI.getOrdering() != AtomicOrdering::AcquireRelease)) { CheckFailed
("Store cannot have Acquire ordering", &SI); return; } } while
(false)
3113 SI.getOrdering() != AtomicOrdering::AcquireRelease,do { if (!(SI.getOrdering() != AtomicOrdering::Acquire &&
SI.getOrdering() != AtomicOrdering::AcquireRelease)) { CheckFailed
("Store cannot have Acquire ordering", &SI); return; } } while
(false)
3114 "Store cannot have Acquire ordering", &SI)do { if (!(SI.getOrdering() != AtomicOrdering::Acquire &&
SI.getOrdering() != AtomicOrdering::AcquireRelease)) { CheckFailed
("Store cannot have Acquire ordering", &SI); return; } } while
(false)
;
3115 Assert(SI.getAlignment() != 0,do { if (!(SI.getAlignment() != 0)) { CheckFailed("Atomic store must specify explicit alignment"
, &SI); return; } } while (false)
3116 "Atomic store must specify explicit alignment", &SI)do { if (!(SI.getAlignment() != 0)) { CheckFailed("Atomic store must specify explicit alignment"
, &SI); return; } } while (false)
;
3117 Assert(ElTy->isIntegerTy() || ElTy->isPointerTy() ||do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic store operand must have integer, pointer, or floating point "
"type!", ElTy, &SI); return; } } while (false)
3118 ElTy->isFloatingPointTy(),do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic store operand must have integer, pointer, or floating point "
"type!", ElTy, &SI); return; } } while (false)
3119 "atomic store operand must have integer, pointer, or floating point "do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic store operand must have integer, pointer, or floating point "
"type!", ElTy, &SI); return; } } while (false)
3120 "type!",do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic store operand must have integer, pointer, or floating point "
"type!", ElTy, &SI); return; } } while (false)
3121 ElTy, &SI)do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy() ||
ElTy->isFloatingPointTy())) { CheckFailed("atomic store operand must have integer, pointer, or floating point "
"type!", ElTy, &SI); return; } } while (false)
;
3122 checkAtomicMemAccessSize(ElTy, &SI);
3123 } else {
3124 Assert(SI.getSynchScope() == CrossThread,do { if (!(SI.getSynchScope() == CrossThread)) { CheckFailed(
"Non-atomic store cannot have SynchronizationScope specified"
, &SI); return; } } while (false)
3125 "Non-atomic store cannot have SynchronizationScope specified", &SI)do { if (!(SI.getSynchScope() == CrossThread)) { CheckFailed(
"Non-atomic store cannot have SynchronizationScope specified"
, &SI); return; } } while (false)
;
3126 }
3127 visitInstruction(SI);
3128}
3129
3130/// Check that SwiftErrorVal is used as a swifterror argument in CS.
3131void Verifier::verifySwiftErrorCallSite(CallSite CS,
3132 const Value *SwiftErrorVal) {
3133 unsigned Idx = 0;
3134 for (CallSite::arg_iterator I = CS.arg_begin(), E = CS.arg_end();
3135 I != E; ++I, ++Idx) {
3136 if (*I == SwiftErrorVal) {
3137 Assert(CS.paramHasAttr(Idx+1, Attribute::SwiftError),do { if (!(CS.paramHasAttr(Idx+1, Attribute::SwiftError))) { CheckFailed
("swifterror value when used in a callsite should be marked "
"with swifterror attribute", SwiftErrorVal, CS); return; } }
while (false)
3138 "swifterror value when used in a callsite should be marked "do { if (!(CS.paramHasAttr(Idx+1, Attribute::SwiftError))) { CheckFailed
("swifterror value when used in a callsite should be marked "
"with swifterror attribute", SwiftErrorVal, CS); return; } }
while (false)
3139 "with swifterror attribute",do { if (!(CS.paramHasAttr(Idx+1, Attribute::SwiftError))) { CheckFailed
("swifterror value when used in a callsite should be marked "
"with swifterror attribute", SwiftErrorVal, CS); return; } }
while (false)
3140 SwiftErrorVal, CS)do { if (!(CS.paramHasAttr(Idx+1, Attribute::SwiftError))) { CheckFailed
("swifterror value when used in a callsite should be marked "
"with swifterror attribute", SwiftErrorVal, CS); return; } }
while (false)
;
3141 }
3142 }
3143}
3144
3145void Verifier::verifySwiftErrorValue(const Value *SwiftErrorVal) {
3146 // Check that swifterror value is only used by loads, stores, or as
3147 // a swifterror argument.
3148 for (const User *U : SwiftErrorVal->users()) {
3149 Assert(isa<LoadInst>(U) || isa<StoreInst>(U) || isa<CallInst>(U) ||do { if (!(isa<LoadInst>(U) || isa<StoreInst>(U) ||
isa<CallInst>(U) || isa<InvokeInst>(U))) { CheckFailed
("swifterror value can only be loaded and stored from, or " "as a swifterror argument!"
, SwiftErrorVal, U); return; } } while (false)
3150 isa<InvokeInst>(U),do { if (!(isa<LoadInst>(U) || isa<StoreInst>(U) ||
isa<CallInst>(U) || isa<InvokeInst>(U))) { CheckFailed
("swifterror value can only be loaded and stored from, or " "as a swifterror argument!"
, SwiftErrorVal, U); return; } } while (false)
3151 "swifterror value can only be loaded and stored from, or "do { if (!(isa<LoadInst>(U) || isa<StoreInst>(U) ||
isa<CallInst>(U) || isa<InvokeInst>(U))) { CheckFailed
("swifterror value can only be loaded and stored from, or " "as a swifterror argument!"
, SwiftErrorVal, U); return; } } while (false)
3152 "as a swifterror argument!",do { if (!(isa<LoadInst>(U) || isa<StoreInst>(U) ||
isa<CallInst>(U) || isa<InvokeInst>(U))) { CheckFailed
("swifterror value can only be loaded and stored from, or " "as a swifterror argument!"
, SwiftErrorVal, U); return; } } while (false)
3153 SwiftErrorVal, U)do { if (!(isa<LoadInst>(U) || isa<StoreInst>(U) ||
isa<CallInst>(U) || isa<InvokeInst>(U))) { CheckFailed
("swifterror value can only be loaded and stored from, or " "as a swifterror argument!"
, SwiftErrorVal, U); return; } } while (false)
;
3154 // If it is used by a store, check it is the second operand.
3155 if (auto StoreI = dyn_cast<StoreInst>(U))
3156 Assert(StoreI->getOperand(1) == SwiftErrorVal,do { if (!(StoreI->getOperand(1) == SwiftErrorVal)) { CheckFailed
("swifterror value should be the second operand when used " "by stores"
, SwiftErrorVal, U); return; } } while (false)
3157 "swifterror value should be the second operand when used "do { if (!(StoreI->getOperand(1) == SwiftErrorVal)) { CheckFailed
("swifterror value should be the second operand when used " "by stores"
, SwiftErrorVal, U); return; } } while (false)
3158 "by stores", SwiftErrorVal, U)do { if (!(StoreI->getOperand(1) == SwiftErrorVal)) { CheckFailed
("swifterror value should be the second operand when used " "by stores"
, SwiftErrorVal, U); return; } } while (false)
;
3159 if (auto CallI = dyn_cast<CallInst>(U))
3160 verifySwiftErrorCallSite(const_cast<CallInst*>(CallI), SwiftErrorVal);
3161 if (auto II = dyn_cast<InvokeInst>(U))
3162 verifySwiftErrorCallSite(const_cast<InvokeInst*>(II), SwiftErrorVal);
3163 }
3164}
3165
3166void Verifier::visitAllocaInst(AllocaInst &AI) {
3167 SmallPtrSet<Type*, 4> Visited;
3168 PointerType *PTy = AI.getType();
3169 Assert(PTy->getAddressSpace() == 0,do { if (!(PTy->getAddressSpace() == 0)) { CheckFailed("Allocation instruction pointer not in the generic address space!"
, &AI); return; } } while (false)
3170 "Allocation instruction pointer not in the generic address space!",do { if (!(PTy->getAddressSpace() == 0)) { CheckFailed("Allocation instruction pointer not in the generic address space!"
, &AI); return; } } while (false)
3171 &AI)do { if (!(PTy->getAddressSpace() == 0)) { CheckFailed("Allocation instruction pointer not in the generic address space!"
, &AI); return; } } while (false)
;
3172 Assert(AI.getAllocatedType()->isSized(&Visited),do { if (!(AI.getAllocatedType()->isSized(&Visited))) {
CheckFailed("Cannot allocate unsized type", &AI); return
; } } while (false)
3173 "Cannot allocate unsized type", &AI)do { if (!(AI.getAllocatedType()->isSized(&Visited))) {
CheckFailed("Cannot allocate unsized type", &AI); return
; } } while (false)
;
3174 Assert(AI.getArraySize()->getType()->isIntegerTy(),do { if (!(AI.getArraySize()->getType()->isIntegerTy())
) { CheckFailed("Alloca array size must have integer type", &
AI); return; } } while (false)
3175 "Alloca array size must have integer type", &AI)do { if (!(AI.getArraySize()->getType()->isIntegerTy())
) { CheckFailed("Alloca array size must have integer type", &
AI); return; } } while (false)
;
3176 Assert(AI.getAlignment() <= Value::MaximumAlignment,do { if (!(AI.getAlignment() <= Value::MaximumAlignment)) {
CheckFailed("huge alignment values are unsupported", &AI
); return; } } while (false)
3177 "huge alignment values are unsupported", &AI)do { if (!(AI.getAlignment() <= Value::MaximumAlignment)) {
CheckFailed("huge alignment values are unsupported", &AI
); return; } } while (false)
;
3178
3179 if (AI.isSwiftError()) {
3180 verifySwiftErrorValue(&AI);
3181 }
3182
3183 visitInstruction(AI);
3184}
3185
3186void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
3187
3188 // FIXME: more conditions???
3189 Assert(CXI.getSuccessOrdering() != AtomicOrdering::NotAtomic,do { if (!(CXI.getSuccessOrdering() != AtomicOrdering::NotAtomic
)) { CheckFailed("cmpxchg instructions must be atomic.", &
CXI); return; } } while (false)
3190 "cmpxchg instructions must be atomic.", &CXI)do { if (!(CXI.getSuccessOrdering() != AtomicOrdering::NotAtomic
)) { CheckFailed("cmpxchg instructions must be atomic.", &
CXI); return; } } while (false)
;
3191 Assert(CXI.getFailureOrdering() != AtomicOrdering::NotAtomic,do { if (!(CXI.getFailureOrdering() != AtomicOrdering::NotAtomic
)) { CheckFailed("cmpxchg instructions must be atomic.", &
CXI); return; } } while (false)
3192 "cmpxchg instructions must be atomic.", &CXI)do { if (!(CXI.getFailureOrdering() != AtomicOrdering::NotAtomic
)) { CheckFailed("cmpxchg instructions must be atomic.", &
CXI); return; } } while (false)
;
3193 Assert(CXI.getSuccessOrdering() != AtomicOrdering::Unordered,do { if (!(CXI.getSuccessOrdering() != AtomicOrdering::Unordered
)) { CheckFailed("cmpxchg instructions cannot be unordered.",
&CXI); return; } } while (false)
3194 "cmpxchg instructions cannot be unordered.", &CXI)do { if (!(CXI.getSuccessOrdering() != AtomicOrdering::Unordered
)) { CheckFailed("cmpxchg instructions cannot be unordered.",
&CXI); return; } } while (false)
;
3195 Assert(CXI.getFailureOrdering() != AtomicOrdering::Unordered,do { if (!(CXI.getFailureOrdering() != AtomicOrdering::Unordered
)) { CheckFailed("cmpxchg instructions cannot be unordered.",
&CXI); return; } } while (false)
3196 "cmpxchg instructions cannot be unordered.", &CXI)do { if (!(CXI.getFailureOrdering() != AtomicOrdering::Unordered
)) { CheckFailed("cmpxchg instructions cannot be unordered.",
&CXI); return; } } while (false)
;
3197 Assert(!isStrongerThan(CXI.getFailureOrdering(), CXI.getSuccessOrdering()),do { if (!(!isStrongerThan(CXI.getFailureOrdering(), CXI.getSuccessOrdering
()))) { CheckFailed("cmpxchg instructions failure argument shall be no stronger than the "
"success argument", &CXI); return; } } while (false)
3198 "cmpxchg instructions failure argument shall be no stronger than the "do { if (!(!isStrongerThan(CXI.getFailureOrdering(), CXI.getSuccessOrdering
()))) { CheckFailed("cmpxchg instructions failure argument shall be no stronger than the "
"success argument", &CXI); return; } } while (false)
3199 "success argument",do { if (!(!isStrongerThan(CXI.getFailureOrdering(), CXI.getSuccessOrdering
()))) { CheckFailed("cmpxchg instructions failure argument shall be no stronger than the "
"success argument", &CXI); return; } } while (false)
3200 &CXI)do { if (!(!isStrongerThan(CXI.getFailureOrdering(), CXI.getSuccessOrdering
()))) { CheckFailed("cmpxchg instructions failure argument shall be no stronger than the "
"success argument", &CXI); return; } } while (false)
;
3201 Assert(CXI.getFailureOrdering() != AtomicOrdering::Release &&do { if (!(CXI.getFailureOrdering() != AtomicOrdering::Release
&& CXI.getFailureOrdering() != AtomicOrdering::AcquireRelease
)) { CheckFailed("cmpxchg failure ordering cannot include release semantics"
, &CXI); return; } } while (false)
3202 CXI.getFailureOrdering() != AtomicOrdering::AcquireRelease,do { if (!(CXI.getFailureOrdering() != AtomicOrdering::Release
&& CXI.getFailureOrdering() != AtomicOrdering::AcquireRelease
)) { CheckFailed("cmpxchg failure ordering cannot include release semantics"
, &CXI); return; } } while (false)
3203 "cmpxchg failure ordering cannot include release semantics", &CXI)do { if (!(CXI.getFailureOrdering() != AtomicOrdering::Release
&& CXI.getFailureOrdering() != AtomicOrdering::AcquireRelease
)) { CheckFailed("cmpxchg failure ordering cannot include release semantics"
, &CXI); return; } } while (false)
;
3204
3205 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
3206 Assert(PTy, "First cmpxchg operand must be a pointer.", &CXI)do { if (!(PTy)) { CheckFailed("First cmpxchg operand must be a pointer."
, &CXI); return; } } while (false)
;
3207 Type *ElTy = PTy->getElementType();
3208 Assert(ElTy->isIntegerTy() || ElTy->isPointerTy(),do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy()))
{ CheckFailed("cmpxchg operand must have integer or pointer type"
, ElTy, &CXI); return; } } while (false)
3209 "cmpxchg operand must have integer or pointer type",do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy()))
{ CheckFailed("cmpxchg operand must have integer or pointer type"
, ElTy, &CXI); return; } } while (false)
3210 ElTy, &CXI)do { if (!(ElTy->isIntegerTy() || ElTy->isPointerTy()))
{ CheckFailed("cmpxchg operand must have integer or pointer type"
, ElTy, &CXI); return; } } while (false)
;
3211 checkAtomicMemAccessSize(ElTy, &CXI);
3212 Assert(ElTy == CXI.getOperand(1)->getType(),do { if (!(ElTy == CXI.getOperand(1)->getType())) { CheckFailed
("Expected value type does not match pointer operand type!", &
CXI, ElTy); return; } } while (false)
3213 "Expected value type does not match pointer operand type!", &CXI,do { if (!(ElTy == CXI.getOperand(1)->getType())) { CheckFailed
("Expected value type does not match pointer operand type!", &
CXI, ElTy); return; } } while (false)
3214 ElTy)do { if (!(ElTy == CXI.getOperand(1)->getType())) { CheckFailed
("Expected value type does not match pointer operand type!", &
CXI, ElTy); return; } } while (false)
;
3215 Assert(ElTy == CXI.getOperand(2)->getType(),do { if (!(ElTy == CXI.getOperand(2)->getType())) { CheckFailed
("Stored value type does not match pointer operand type!", &
CXI, ElTy); return; } } while (false)
3216 "Stored value type does not match pointer operand type!", &CXI, ElTy)do { if (!(ElTy == CXI.getOperand(2)->getType())) { CheckFailed
("Stored value type does not match pointer operand type!", &
CXI, ElTy); return; } } while (false)
;
3217 visitInstruction(CXI);
3218}
3219
3220void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
3221 Assert(RMWI.getOrdering() != AtomicOrdering::NotAtomic,do { if (!(RMWI.getOrdering() != AtomicOrdering::NotAtomic)) {
CheckFailed("atomicrmw instructions must be atomic.", &RMWI
); return; } } while (false)
3222 "atomicrmw instructions must be atomic.", &RMWI)do { if (!(RMWI.getOrdering() != AtomicOrdering::NotAtomic)) {
CheckFailed("atomicrmw instructions must be atomic.", &RMWI
); return; } } while (false)
;
3223 Assert(RMWI.getOrdering() != AtomicOrdering::Unordered,do { if (!(RMWI.getOrdering() != AtomicOrdering::Unordered)) {
CheckFailed("atomicrmw instructions cannot be unordered.", &
RMWI); return; } } while (false)
3224 "atomicrmw instructions cannot be unordered.", &RMWI)do { if (!(RMWI.getOrdering() != AtomicOrdering::Unordered)) {
CheckFailed("atomicrmw instructions cannot be unordered.", &
RMWI); return; } } while (false)
;
3225 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
3226 Assert(PTy, "First atomicrmw operand must be a pointer.", &RMWI)do { if (!(PTy)) { CheckFailed("First atomicrmw operand must be a pointer."
, &RMWI); return; } } while (false)
;
3227 Type *ElTy = PTy->getElementType();
3228 Assert(ElTy->isIntegerTy(), "atomicrmw operand must have integer type!",do { if (!(ElTy->isIntegerTy())) { CheckFailed("atomicrmw operand must have integer type!"
, &RMWI, ElTy); return; } } while (false)
3229 &RMWI, ElTy)do { if (!(ElTy->isIntegerTy())) { CheckFailed("atomicrmw operand must have integer type!"
, &RMWI, ElTy); return; } } while (false)
;
3230 checkAtomicMemAccessSize(ElTy, &RMWI);
3231 Assert(ElTy == RMWI.getOperand(1)->getType(),do { if (!(ElTy == RMWI.getOperand(1)->getType())) { CheckFailed
("Argument value type does not match pointer operand type!", &
RMWI, ElTy); return; } } while (false)
3232 "Argument value type does not match pointer operand type!", &RMWI,do { if (!(ElTy == RMWI.getOperand(1)->getType())) { CheckFailed
("Argument value type does not match pointer operand type!", &
RMWI, ElTy); return; } } while (false)
3233 ElTy)do { if (!(ElTy == RMWI.getOperand(1)->getType())) { CheckFailed
("Argument value type does not match pointer operand type!", &
RMWI, ElTy); return; } } while (false)
;
3234 Assert(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&do { if (!(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation
() && RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP
)) { CheckFailed("Invalid binary operation!", &RMWI); return
; } } while (false)
3235 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,do { if (!(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation
() && RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP
)) { CheckFailed("Invalid binary operation!", &RMWI); return
; } } while (false)
3236 "Invalid binary operation!", &RMWI)do { if (!(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation
() && RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP
)) { CheckFailed("Invalid binary operation!", &RMWI); return
; } } while (false)
;
3237 visitInstruction(RMWI);
3238}
3239
3240void Verifier::visitFenceInst(FenceInst &FI) {
3241 const AtomicOrdering Ordering = FI.getOrdering();
3242 Assert(Ordering == AtomicOrdering::Acquire ||do { if (!(Ordering == AtomicOrdering::Acquire || Ordering ==
AtomicOrdering::Release || Ordering == AtomicOrdering::AcquireRelease
|| Ordering == AtomicOrdering::SequentiallyConsistent)) { CheckFailed
("fence instructions may only have acquire, release, acq_rel, or "
"seq_cst ordering.", &FI); return; } } while (false)
3243 Ordering == AtomicOrdering::Release ||do { if (!(Ordering == AtomicOrdering::Acquire || Ordering ==
AtomicOrdering::Release || Ordering == AtomicOrdering::AcquireRelease
|| Ordering == AtomicOrdering::SequentiallyConsistent)) { CheckFailed
("fence instructions may only have acquire, release, acq_rel, or "
"seq_cst ordering.", &FI); return; } } while (false)
3244 Ordering == AtomicOrdering::AcquireRelease ||do { if (!(Ordering == AtomicOrdering::Acquire || Ordering ==
AtomicOrdering::Release || Ordering == AtomicOrdering::AcquireRelease
|| Ordering == AtomicOrdering::SequentiallyConsistent)) { CheckFailed
("fence instructions may only have acquire, release, acq_rel, or "
"seq_cst ordering.", &FI); return; } } while (false)
3245 Ordering == AtomicOrdering::SequentiallyConsistent,do { if (!(Ordering == AtomicOrdering::Acquire || Ordering ==
AtomicOrdering::Release || Ordering == AtomicOrdering::AcquireRelease
|| Ordering == AtomicOrdering::SequentiallyConsistent)) { CheckFailed
("fence instructions may only have acquire, release, acq_rel, or "
"seq_cst ordering.", &FI); return; } } while (false)
3246 "fence instructions may only have acquire, release, acq_rel, or "do { if (!(Ordering == AtomicOrdering::Acquire || Ordering ==
AtomicOrdering::Release || Ordering == AtomicOrdering::AcquireRelease
|| Ordering == AtomicOrdering::SequentiallyConsistent)) { CheckFailed
("fence instructions may only have acquire, release, acq_rel, or "
"seq_cst ordering.", &FI); return; } } while (false)
3247 "seq_cst ordering.",do { if (!(Ordering == AtomicOrdering::Acquire || Ordering ==
AtomicOrdering::Release || Ordering == AtomicOrdering::AcquireRelease
|| Ordering == AtomicOrdering::SequentiallyConsistent)) { CheckFailed
("fence instructions may only have acquire, release, acq_rel, or "
"seq_cst ordering.", &FI); return; } } while (false)
3248 &FI)do { if (!(Ordering == AtomicOrdering::Acquire || Ordering ==
AtomicOrdering::Release || Ordering == AtomicOrdering::AcquireRelease
|| Ordering == AtomicOrdering::SequentiallyConsistent)) { CheckFailed
("fence instructions may only have acquire, release, acq_rel, or "
"seq_cst ordering.", &FI); return; } } while (false)
;
3249 visitInstruction(FI);
3250}
3251
3252void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
3253 Assert(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),do { if (!(ExtractValueInst::getIndexedType(EVI.getAggregateOperand
()->getType(), EVI.getIndices()) == EVI.getType())) { CheckFailed
("Invalid ExtractValueInst operands!", &EVI); return; } }
while (false)
3254 EVI.getIndices()) == EVI.getType(),do { if (!(ExtractValueInst::getIndexedType(EVI.getAggregateOperand
()->getType(), EVI.getIndices()) == EVI.getType())) { CheckFailed
("Invalid ExtractValueInst operands!", &EVI); return; } }
while (false)
3255 "Invalid ExtractValueInst operands!", &EVI)do { if (!(ExtractValueInst::getIndexedType(EVI.getAggregateOperand
()->getType(), EVI.getIndices()) == EVI.getType())) { CheckFailed
("Invalid ExtractValueInst operands!", &EVI); return; } }
while (false)
;
3256
3257 visitInstruction(EVI);
3258}
3259
3260void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
3261 Assert(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),do { if (!(ExtractValueInst::getIndexedType(IVI.getAggregateOperand
()->getType(), IVI.getIndices()) == IVI.getOperand(1)->
getType())) { CheckFailed("Invalid InsertValueInst operands!"
, &IVI); return; } } while (false)
3262 IVI.getIndices()) ==do { if (!(ExtractValueInst::getIndexedType(IVI.getAggregateOperand
()->getType(), IVI.getIndices()) == IVI.getOperand(1)->
getType())) { CheckFailed("Invalid InsertValueInst operands!"
, &IVI); return; } } while (false)
3263 IVI.getOperand(1)->getType(),do { if (!(ExtractValueInst::getIndexedType(IVI.getAggregateOperand
()->getType(), IVI.getIndices()) == IVI.getOperand(1)->
getType())) { CheckFailed("Invalid InsertValueInst operands!"
, &IVI); return; } } while (false)
3264 "Invalid InsertValueInst operands!", &IVI)do { if (!(ExtractValueInst::getIndexedType(IVI.getAggregateOperand
()->getType(), IVI.getIndices()) == IVI.getOperand(1)->
getType())) { CheckFailed("Invalid InsertValueInst operands!"
, &IVI); return; } } while (false)
;
3265
3266 visitInstruction(IVI);
3267}
3268
3269static Value *getParentPad(Value *EHPad) {
3270 if (auto *FPI = dyn_cast<FuncletPadInst>(EHPad))
3271 return FPI->getParentPad();
3272
3273 return cast<CatchSwitchInst>(EHPad)->getParentPad();
3274}
3275
3276void Verifier::visitEHPadPredecessors(Instruction &I) {
3277 assert(I.isEHPad())((I.isEHPad()) ? static_cast<void> (0) : __assert_fail (
"I.isEHPad()", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 3277, __PRETTY_FUNCTION__))
;
3278
3279 BasicBlock *BB = I.getParent();
3280 Function *F = BB->getParent();
3281
3282 Assert(BB != &F->getEntryBlock(), "EH pad cannot be in entry block.", &I)do { if (!(BB != &F->getEntryBlock())) { CheckFailed("EH pad cannot be in entry block."
, &I); return; } } while (false)
;
3283
3284 if (auto *LPI = dyn_cast<LandingPadInst>(&I)) {
3285 // The landingpad instruction defines its parent as a landing pad block. The
3286 // landing pad block may be branched to only by the unwind edge of an
3287 // invoke.
3288 for (BasicBlock *PredBB : predecessors(BB)) {
3289 const auto *II = dyn_cast<InvokeInst>(PredBB->getTerminator());
3290 Assert(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,do { if (!(II && II->getUnwindDest() == BB &&
II->getNormalDest() != BB)) { CheckFailed("Block containing LandingPadInst must be jumped to "
"only by the unwind edge of an invoke.", LPI); return; } } while
(false)
3291 "Block containing LandingPadInst must be jumped to "do { if (!(II && II->getUnwindDest() == BB &&
II->getNormalDest() != BB)) { CheckFailed("Block containing LandingPadInst must be jumped to "
"only by the unwind edge of an invoke.", LPI); return; } } while
(false)
3292 "only by the unwind edge of an invoke.",do { if (!(II && II->getUnwindDest() == BB &&
II->getNormalDest() != BB)) { CheckFailed("Block containing LandingPadInst must be jumped to "
"only by the unwind edge of an invoke.", LPI); return; } } while
(false)
3293 LPI)do { if (!(II && II->getUnwindDest() == BB &&
II->getNormalDest() != BB)) { CheckFailed("Block containing LandingPadInst must be jumped to "
"only by the unwind edge of an invoke.", LPI); return; } } while
(false)
;
3294 }
3295 return;
3296 }
3297 if (auto *CPI = dyn_cast<CatchPadInst>(&I)) {
3298 if (!pred_empty(BB))
3299 Assert(BB->getUniquePredecessor() == CPI->getCatchSwitch()->getParent(),do { if (!(BB->getUniquePredecessor() == CPI->getCatchSwitch
()->getParent())) { CheckFailed("Block containg CatchPadInst must be jumped to "
"only by its catchswitch.", CPI); return; } } while (false)
3300 "Block containg CatchPadInst must be jumped to "do { if (!(BB->getUniquePredecessor() == CPI->getCatchSwitch
()->getParent())) { CheckFailed("Block containg CatchPadInst must be jumped to "
"only by its catchswitch.", CPI); return; } } while (false)
3301 "only by its catchswitch.",do { if (!(BB->getUniquePredecessor() == CPI->getCatchSwitch
()->getParent())) { CheckFailed("Block containg CatchPadInst must be jumped to "
"only by its catchswitch.", CPI); return; } } while (false)
3302 CPI)do { if (!(BB->getUniquePredecessor() == CPI->getCatchSwitch
()->getParent())) { CheckFailed("Block containg CatchPadInst must be jumped to "
"only by its catchswitch.", CPI); return; } } while (false)
;
3303 Assert(BB != CPI->getCatchSwitch()->getUnwindDest(),do { if (!(BB != CPI->getCatchSwitch()->getUnwindDest()
)) { CheckFailed("Catchswitch cannot unwind to one of its catchpads"
, CPI->getCatchSwitch(), CPI); return; } } while (false)
3304 "Catchswitch cannot unwind to one of its catchpads",do { if (!(BB != CPI->getCatchSwitch()->getUnwindDest()
)) { CheckFailed("Catchswitch cannot unwind to one of its catchpads"
, CPI->getCatchSwitch(), CPI); return; } } while (false)
3305 CPI->getCatchSwitch(), CPI)do { if (!(BB != CPI->getCatchSwitch()->getUnwindDest()
)) { CheckFailed("Catchswitch cannot unwind to one of its catchpads"
, CPI->getCatchSwitch(), CPI); return; } } while (false)
;
3306 return;
3307 }
3308
3309 // Verify that each pred has a legal terminator with a legal to/from EH
3310 // pad relationship.
3311 Instruction *ToPad = &I;
3312 Value *ToPadParent = getParentPad(ToPad);
3313 for (BasicBlock *PredBB : predecessors(BB)) {
3314 TerminatorInst *TI = PredBB->getTerminator();
3315 Value *FromPad;
3316 if (auto *II = dyn_cast<InvokeInst>(TI)) {
3317 Assert(II->getUnwindDest() == BB && II->getNormalDest() != BB,do { if (!(II->getUnwindDest() == BB && II->getNormalDest
() != BB)) { CheckFailed("EH pad must be jumped to via an unwind edge"
, ToPad, II); return; } } while (false)
3318 "EH pad must be jumped to via an unwind edge", ToPad, II)do { if (!(II->getUnwindDest() == BB && II->getNormalDest
() != BB)) { CheckFailed("EH pad must be jumped to via an unwind edge"
, ToPad, II); return; } } while (false)
;
3319 if (auto Bundle = II->getOperandBundle(LLVMContext::OB_funclet))
3320 FromPad = Bundle->Inputs[0];
3321 else
3322 FromPad = ConstantTokenNone::get(II->getContext());
3323 } else if (auto *CRI = dyn_cast<CleanupReturnInst>(TI)) {
3324 FromPad = CRI->getOperand(0);
3325 Assert(FromPad != ToPadParent, "A cleanupret must exit its cleanup", CRI)do { if (!(FromPad != ToPadParent)) { CheckFailed("A cleanupret must exit its cleanup"
, CRI); return; } } while (false)
;
3326 } else if (auto *CSI = dyn_cast<CatchSwitchInst>(TI)) {
3327 FromPad = CSI;
3328 } else {
3329 Assert(false, "EH pad must be jumped to via an unwind edge", ToPad, TI)do { if (!(false)) { CheckFailed("EH pad must be jumped to via an unwind edge"
, ToPad, TI); return; } } while (false)
;
3330 }
3331
3332 // The edge may exit from zero or more nested pads.
3333 SmallSet<Value *, 8> Seen;
3334 for (;; FromPad = getParentPad(FromPad)) {
3335 Assert(FromPad != ToPad,do { if (!(FromPad != ToPad)) { CheckFailed("EH pad cannot handle exceptions raised within it"
, FromPad, TI); return; } } while (false)
3336 "EH pad cannot handle exceptions raised within it", FromPad, TI)do { if (!(FromPad != ToPad)) { CheckFailed("EH pad cannot handle exceptions raised within it"
, FromPad, TI); return; } } while (false)
;
3337 if (FromPad == ToPadParent) {
3338 // This is a legal unwind edge.
3339 break;
3340 }
3341 Assert(!isa<ConstantTokenNone>(FromPad),do { if (!(!isa<ConstantTokenNone>(FromPad))) { CheckFailed
("A single unwind edge may only enter one EH pad", TI); return
; } } while (false)
3342 "A single unwind edge may only enter one EH pad", TI)do { if (!(!isa<ConstantTokenNone>(FromPad))) { CheckFailed
("A single unwind edge may only enter one EH pad", TI); return
; } } while (false)
;
3343 Assert(Seen.insert(FromPad).second,do { if (!(Seen.insert(FromPad).second)) { CheckFailed("EH pad jumps through a cycle of pads"
, FromPad); return; } } while (false)
3344 "EH pad jumps through a cycle of pads", FromPad)do { if (!(Seen.insert(FromPad).second)) { CheckFailed("EH pad jumps through a cycle of pads"
, FromPad); return; } } while (false)
;
3345 }
3346 }
3347}
3348
3349void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
3350 // The landingpad instruction is ill-formed if it doesn't have any clauses and
3351 // isn't a cleanup.
3352 Assert(LPI.getNumClauses() > 0 || LPI.isCleanup(),do { if (!(LPI.getNumClauses() > 0 || LPI.isCleanup())) { CheckFailed
("LandingPadInst needs at least one clause or to be a cleanup."
, &LPI); return; } } while (false)
3353 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI)do { if (!(LPI.getNumClauses() > 0 || LPI.isCleanup())) { CheckFailed
("LandingPadInst needs at least one clause or to be a cleanup."
, &LPI); return; } } while (false)
;
3354
3355 visitEHPadPredecessors(LPI);
3356
3357 if (!LandingPadResultTy)
3358 LandingPadResultTy = LPI.getType();
3359 else
3360 Assert(LandingPadResultTy == LPI.getType(),do { if (!(LandingPadResultTy == LPI.getType())) { CheckFailed
("The landingpad instruction should have a consistent result type "
"inside a function.", &LPI); return; } } while (false)
3361 "The landingpad instruction should have a consistent result type "do { if (!(LandingPadResultTy == LPI.getType())) { CheckFailed
("The landingpad instruction should have a consistent result type "
"inside a function.", &LPI); return; } } while (false)
3362 "inside a function.",do { if (!(LandingPadResultTy == LPI.getType())) { CheckFailed
("The landingpad instruction should have a consistent result type "
"inside a function.", &LPI); return; } } while (false)
3363 &LPI)do { if (!(LandingPadResultTy == LPI.getType())) { CheckFailed
("The landingpad instruction should have a consistent result type "
"inside a function.", &LPI); return; } } while (false)
;
3364
3365 Function *F = LPI.getParent()->getParent();
3366 Assert(F->hasPersonalityFn(),do { if (!(F->hasPersonalityFn())) { CheckFailed("LandingPadInst needs to be in a function with a personality."
, &LPI); return; } } while (false)
3367 "LandingPadInst needs to be in a function with a personality.", &LPI)do { if (!(F->hasPersonalityFn())) { CheckFailed("LandingPadInst needs to be in a function with a personality."
, &LPI); return; } } while (false)
;
3368
3369 // The landingpad instruction must be the first non-PHI instruction in the
3370 // block.
3371 Assert(LPI.getParent()->getLandingPadInst() == &LPI,do { if (!(LPI.getParent()->getLandingPadInst() == &LPI
)) { CheckFailed("LandingPadInst not the first non-PHI instruction in the block."
, &LPI); return; } } while (false)
3372 "LandingPadInst not the first non-PHI instruction in the block.",do { if (!(LPI.getParent()->getLandingPadInst() == &LPI
)) { CheckFailed("LandingPadInst not the first non-PHI instruction in the block."
, &LPI); return; } } while (false)
3373 &LPI)do { if (!(LPI.getParent()->getLandingPadInst() == &LPI
)) { CheckFailed("LandingPadInst not the first non-PHI instruction in the block."
, &LPI); return; } } while (false)
;
3374
3375 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
3376 Constant *Clause = LPI.getClause(i);
3377 if (LPI.isCatch(i)) {
3378 Assert(isa<PointerType>(Clause->getType()),do { if (!(isa<PointerType>(Clause->getType()))) { CheckFailed
("Catch operand does not have pointer type!", &LPI); return
; } } while (false)
3379 "Catch operand does not have pointer type!", &LPI)do { if (!(isa<PointerType>(Clause->getType()))) { CheckFailed
("Catch operand does not have pointer type!", &LPI); return
; } } while (false)
;
3380 } else {
3381 Assert(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI)do { if (!(LPI.isFilter(i))) { CheckFailed("Clause is neither catch nor filter!"
, &LPI); return; } } while (false)
;
3382 Assert(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),do { if (!(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero
>(Clause))) { CheckFailed("Filter operand is not an array of constants!"
, &LPI); return; } } while (false)
3383 "Filter operand is not an array of constants!", &LPI)do { if (!(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero
>(Clause))) { CheckFailed("Filter operand is not an array of constants!"
, &LPI); return; } } while (false)
;
3384 }
3385 }
3386
3387 visitInstruction(LPI);
3388}
3389
3390void Verifier::visitResumeInst(ResumeInst &RI) {
3391 Assert(RI.getFunction()->hasPersonalityFn(),do { if (!(RI.getFunction()->hasPersonalityFn())) { CheckFailed
("ResumeInst needs to be in a function with a personality.", &
RI); return; } } while (false)
3392 "ResumeInst needs to be in a function with a personality.", &RI)do { if (!(RI.getFunction()->hasPersonalityFn())) { CheckFailed
("ResumeInst needs to be in a function with a personality.", &
RI); return; } } while (false)
;
3393
3394 if (!LandingPadResultTy)
3395 LandingPadResultTy = RI.getValue()->getType();
3396 else
3397 Assert(LandingPadResultTy == RI.getValue()->getType(),do { if (!(LandingPadResultTy == RI.getValue()->getType())
) { CheckFailed("The resume instruction should have a consistent result type "
"inside a function.", &RI); return; } } while (false)
3398 "The resume instruction should have a consistent result type "do { if (!(LandingPadResultTy == RI.getValue()->getType())
) { CheckFailed("The resume instruction should have a consistent result type "
"inside a function.", &RI); return; } } while (false)
3399 "inside a function.",do { if (!(LandingPadResultTy == RI.getValue()->getType())
) { CheckFailed("The resume instruction should have a consistent result type "
"inside a function.", &RI); return; } } while (false)
3400 &RI)do { if (!(LandingPadResultTy == RI.getValue()->getType())
) { CheckFailed("The resume instruction should have a consistent result type "
"inside a function.", &RI); return; } } while (false)
;
3401
3402 visitTerminatorInst(RI);
3403}
3404
3405void Verifier::visitCatchPadInst(CatchPadInst &CPI) {
3406 BasicBlock *BB = CPI.getParent();
3407
3408 Function *F = BB->getParent();
3409 Assert(F->hasPersonalityFn(),do { if (!(F->hasPersonalityFn())) { CheckFailed("CatchPadInst needs to be in a function with a personality."
, &CPI); return; } } while (false)
3410 "CatchPadInst needs to be in a function with a personality.", &CPI)do { if (!(F->hasPersonalityFn())) { CheckFailed("CatchPadInst needs to be in a function with a personality."
, &CPI); return; } } while (false)
;
3411
3412 Assert(isa<CatchSwitchInst>(CPI.getParentPad()),do { if (!(isa<CatchSwitchInst>(CPI.getParentPad()))) {
CheckFailed("CatchPadInst needs to be directly nested in a CatchSwitchInst."
, CPI.getParentPad()); return; } } while (false)
3413 "CatchPadInst needs to be directly nested in a CatchSwitchInst.",do { if (!(isa<CatchSwitchInst>(CPI.getParentPad()))) {
CheckFailed("CatchPadInst needs to be directly nested in a CatchSwitchInst."
, CPI.getParentPad()); return; } } while (false)
3414 CPI.getParentPad())do { if (!(isa<CatchSwitchInst>(CPI.getParentPad()))) {
CheckFailed("CatchPadInst needs to be directly nested in a CatchSwitchInst."
, CPI.getParentPad()); return; } } while (false)
;
3415
3416 // The catchpad instruction must be the first non-PHI instruction in the
3417 // block.
3418 Assert(BB->getFirstNonPHI() == &CPI,do { if (!(BB->getFirstNonPHI() == &CPI)) { CheckFailed
("CatchPadInst not the first non-PHI instruction in the block."
, &CPI); return; } } while (false)
3419 "CatchPadInst not the first non-PHI instruction in the block.", &CPI)do { if (!(BB->getFirstNonPHI() == &CPI)) { CheckFailed
("CatchPadInst not the first non-PHI instruction in the block."
, &CPI); return; } } while (false)
;
3420
3421 visitEHPadPredecessors(CPI);
3422 visitFuncletPadInst(CPI);
3423}
3424
3425void Verifier::visitCatchReturnInst(CatchReturnInst &CatchReturn) {
3426 Assert(isa<CatchPadInst>(CatchReturn.getOperand(0)),do { if (!(isa<CatchPadInst>(CatchReturn.getOperand(0))
)) { CheckFailed("CatchReturnInst needs to be provided a CatchPad"
, &CatchReturn, CatchReturn.getOperand(0)); return; } } while
(false)
3427 "CatchReturnInst needs to be provided a CatchPad", &CatchReturn,do { if (!(isa<CatchPadInst>(CatchReturn.getOperand(0))
)) { CheckFailed("CatchReturnInst needs to be provided a CatchPad"
, &CatchReturn, CatchReturn.getOperand(0)); return; } } while
(false)
3428 CatchReturn.getOperand(0))do { if (!(isa<CatchPadInst>(CatchReturn.getOperand(0))
)) { CheckFailed("CatchReturnInst needs to be provided a CatchPad"
, &CatchReturn, CatchReturn.getOperand(0)); return; } } while
(false)
;
3429
3430 visitTerminatorInst(CatchReturn);
3431}
3432
3433void Verifier::visitCleanupPadInst(CleanupPadInst &CPI) {
3434 BasicBlock *BB = CPI.getParent();
3435
3436 Function *F = BB->getParent();
3437 Assert(F->hasPersonalityFn(),do { if (!(F->hasPersonalityFn())) { CheckFailed("CleanupPadInst needs to be in a function with a personality."
, &CPI); return; } } while (false)
3438 "CleanupPadInst needs to be in a function with a personality.", &CPI)do { if (!(F->hasPersonalityFn())) { CheckFailed("CleanupPadInst needs to be in a function with a personality."
, &CPI); return; } } while (false)
;
3439
3440 // The cleanuppad instruction must be the first non-PHI instruction in the
3441 // block.
3442 Assert(BB->getFirstNonPHI() == &CPI,do { if (!(BB->getFirstNonPHI() == &CPI)) { CheckFailed
("CleanupPadInst not the first non-PHI instruction in the block."
, &CPI); return; } } while (false)
3443 "CleanupPadInst not the first non-PHI instruction in the block.",do { if (!(BB->getFirstNonPHI() == &CPI)) { CheckFailed
("CleanupPadInst not the first non-PHI instruction in the block."
, &CPI); return; } } while (false)
3444 &CPI)do { if (!(BB->getFirstNonPHI() == &CPI)) { CheckFailed
("CleanupPadInst not the first non-PHI instruction in the block."
, &CPI); return; } } while (false)
;
3445
3446 auto *ParentPad = CPI.getParentPad();
3447 Assert(isa<ConstantTokenNone>(ParentPad) || isa<FuncletPadInst>(ParentPad),do { if (!(isa<ConstantTokenNone>(ParentPad) || isa<
FuncletPadInst>(ParentPad))) { CheckFailed("CleanupPadInst has an invalid parent."
, &CPI); return; } } while (false)
3448 "CleanupPadInst has an invalid parent.", &CPI)do { if (!(isa<ConstantTokenNone>(ParentPad) || isa<
FuncletPadInst>(ParentPad))) { CheckFailed("CleanupPadInst has an invalid parent."
, &CPI); return; } } while (false)
;
3449
3450 visitEHPadPredecessors(CPI);
3451 visitFuncletPadInst(CPI);
3452}
3453
3454void Verifier::visitFuncletPadInst(FuncletPadInst &FPI) {
3455 User *FirstUser = nullptr;
3456 Value *FirstUnwindPad = nullptr;
3457 SmallVector<FuncletPadInst *, 8> Worklist({&FPI});
3458 SmallSet<FuncletPadInst *, 8> Seen;
3459
3460 while (!Worklist.empty()) {
3461 FuncletPadInst *CurrentPad = Worklist.pop_back_val();
3462 Assert(Seen.insert(CurrentPad).second,do { if (!(Seen.insert(CurrentPad).second)) { CheckFailed("FuncletPadInst must not be nested within itself"
, CurrentPad); return; } } while (false)
3463 "FuncletPadInst must not be nested within itself", CurrentPad)do { if (!(Seen.insert(CurrentPad).second)) { CheckFailed("FuncletPadInst must not be nested within itself"
, CurrentPad); return; } } while (false)
;
3464 Value *UnresolvedAncestorPad = nullptr;
3465 for (User *U : CurrentPad->users()) {
3466 BasicBlock *UnwindDest;
3467 if (auto *CRI = dyn_cast<CleanupReturnInst>(U)) {
3468 UnwindDest = CRI->getUnwindDest();
3469 } else if (auto *CSI = dyn_cast<CatchSwitchInst>(U)) {
3470 // We allow catchswitch unwind to caller to nest
3471 // within an outer pad that unwinds somewhere else,
3472 // because catchswitch doesn't have a nounwind variant.
3473 // See e.g. SimplifyCFGOpt::SimplifyUnreachable.
3474 if (CSI->unwindsToCaller())
3475 continue;
3476 UnwindDest = CSI->getUnwindDest();
3477 } else if (auto *II = dyn_cast<InvokeInst>(U)) {
3478 UnwindDest = II->getUnwindDest();
3479 } else if (isa<CallInst>(U)) {
3480 // Calls which don't unwind may be found inside funclet
3481 // pads that unwind somewhere else. We don't *require*
3482 // such calls to be annotated nounwind.
3483 continue;
3484 } else if (auto *CPI = dyn_cast<CleanupPadInst>(U)) {
3485 // The unwind dest for a cleanup can only be found by
3486 // recursive search. Add it to the worklist, and we'll
3487 // search for its first use that determines where it unwinds.
3488 Worklist.push_back(CPI);
3489 continue;
3490 } else {
3491 Assert(isa<CatchReturnInst>(U), "Bogus funclet pad use", U)do { if (!(isa<CatchReturnInst>(U))) { CheckFailed("Bogus funclet pad use"
, U); return; } } while (false)
;
3492 continue;
3493 }
3494
3495 Value *UnwindPad;
3496 bool ExitsFPI;
3497 if (UnwindDest) {
3498 UnwindPad = UnwindDest->getFirstNonPHI();
3499 if (!cast<Instruction>(UnwindPad)->isEHPad())
3500 continue;
3501 Value *UnwindParent = getParentPad(UnwindPad);
3502 // Ignore unwind edges that don't exit CurrentPad.
3503 if (UnwindParent == CurrentPad)
3504 continue;
3505 // Determine whether the original funclet pad is exited,
3506 // and if we are scanning nested pads determine how many
3507 // of them are exited so we can stop searching their
3508 // children.
3509 Value *ExitedPad = CurrentPad;
3510 ExitsFPI = false;
3511 do {
3512 if (ExitedPad == &FPI) {
3513 ExitsFPI = true;
3514 // Now we can resolve any ancestors of CurrentPad up to
3515 // FPI, but not including FPI since we need to make sure
3516 // to check all direct users of FPI for consistency.
3517 UnresolvedAncestorPad = &FPI;
3518 break;
3519 }
3520 Value *ExitedParent = getParentPad(ExitedPad);
3521 if (ExitedParent == UnwindParent) {
3522 // ExitedPad is the ancestor-most pad which this unwind
3523 // edge exits, so we can resolve up to it, meaning that
3524 // ExitedParent is the first ancestor still unresolved.
3525 UnresolvedAncestorPad = ExitedParent;
3526 break;
3527 }
3528 ExitedPad = ExitedParent;
3529 } while (!isa<ConstantTokenNone>(ExitedPad));
3530 } else {
3531 // Unwinding to caller exits all pads.
3532 UnwindPad = ConstantTokenNone::get(FPI.getContext());
3533 ExitsFPI = true;
3534 UnresolvedAncestorPad = &FPI;
3535 }
3536
3537 if (ExitsFPI) {
3538 // This unwind edge exits FPI. Make sure it agrees with other
3539 // such edges.
3540 if (FirstUser) {
3541 Assert(UnwindPad == FirstUnwindPad, "Unwind edges out of a funclet "do { if (!(UnwindPad == FirstUnwindPad)) { CheckFailed("Unwind edges out of a funclet "
"pad must have the same unwind " "dest", &FPI, U, FirstUser
); return; } } while (false)
3542 "pad must have the same unwind "do { if (!(UnwindPad == FirstUnwindPad)) { CheckFailed("Unwind edges out of a funclet "
"pad must have the same unwind " "dest", &FPI, U, FirstUser
); return; } } while (false)
3543 "dest",do { if (!(UnwindPad == FirstUnwindPad)) { CheckFailed("Unwind edges out of a funclet "
"pad must have the same unwind " "dest", &FPI, U, FirstUser
); return; } } while (false)
3544 &FPI, U, FirstUser)do { if (!(UnwindPad == FirstUnwindPad)) { CheckFailed("Unwind edges out of a funclet "
"pad must have the same unwind " "dest", &FPI, U, FirstUser
); return; } } while (false)
;
3545 } else {
3546 FirstUser = U;
3547 FirstUnwindPad = UnwindPad;
3548 // Record cleanup sibling unwinds for verifySiblingFuncletUnwinds
3549 if (isa<CleanupPadInst>(&FPI) && !isa<ConstantTokenNone>(UnwindPad) &&
3550 getParentPad(UnwindPad) == getParentPad(&FPI))
3551 SiblingFuncletInfo[&FPI] = cast<TerminatorInst>(U);
3552 }
3553 }
3554 // Make sure we visit all uses of FPI, but for nested pads stop as
3555 // soon as we know where they unwind to.
3556 if (CurrentPad != &FPI)
3557 break;
3558 }
3559 if (UnresolvedAncestorPad) {
3560 if (CurrentPad == UnresolvedAncestorPad) {
3561 // When CurrentPad is FPI itself, we don't mark it as resolved even if
3562 // we've found an unwind edge that exits it, because we need to verify
3563 // all direct uses of FPI.
3564 assert(CurrentPad == &FPI)((CurrentPad == &FPI) ? static_cast<void> (0) : __assert_fail
("CurrentPad == &FPI", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 3564, __PRETTY_FUNCTION__))
;
3565 continue;
3566 }
3567 // Pop off the worklist any nested pads that we've found an unwind
3568 // destination for. The pads on the worklist are the uncles,
3569 // great-uncles, etc. of CurrentPad. We've found an unwind destination
3570 // for all ancestors of CurrentPad up to but not including
3571 // UnresolvedAncestorPad.
3572 Value *ResolvedPad = CurrentPad;
3573 while (!Worklist.empty()) {
3574 Value *UnclePad = Worklist.back();
3575 Value *AncestorPad = getParentPad(UnclePad);
3576 // Walk ResolvedPad up the ancestor list until we either find the
3577 // uncle's parent or the last resolved ancestor.
3578 while (ResolvedPad != AncestorPad) {
3579 Value *ResolvedParent = getParentPad(ResolvedPad);
3580 if (ResolvedParent == UnresolvedAncestorPad) {
3581 break;
3582 }
3583 ResolvedPad = ResolvedParent;
3584 }
3585 // If the resolved ancestor search didn't find the uncle's parent,
3586 // then the uncle is not yet resolved.
3587 if (ResolvedPad != AncestorPad)
3588 break;
3589 // This uncle is resolved, so pop it from the worklist.
3590 Worklist.pop_back();
3591 }
3592 }
3593 }
3594
3595 if (FirstUnwindPad) {
3596 if (auto *CatchSwitch = dyn_cast<CatchSwitchInst>(FPI.getParentPad())) {
3597 BasicBlock *SwitchUnwindDest = CatchSwitch->getUnwindDest();
3598 Value *SwitchUnwindPad;
3599 if (SwitchUnwindDest)
3600 SwitchUnwindPad = SwitchUnwindDest->getFirstNonPHI();
3601 else
3602 SwitchUnwindPad = ConstantTokenNone::get(FPI.getContext());
3603 Assert(SwitchUnwindPad == FirstUnwindPad,do { if (!(SwitchUnwindPad == FirstUnwindPad)) { CheckFailed(
"Unwind edges out of a catch must have the same unwind dest as "
"the parent catchswitch", &FPI, FirstUser, CatchSwitch);
return; } } while (false)
3604 "Unwind edges out of a catch must have the same unwind dest as "do { if (!(SwitchUnwindPad == FirstUnwindPad)) { CheckFailed(
"Unwind edges out of a catch must have the same unwind dest as "
"the parent catchswitch", &FPI, FirstUser, CatchSwitch);
return; } } while (false)
3605 "the parent catchswitch",do { if (!(SwitchUnwindPad == FirstUnwindPad)) { CheckFailed(
"Unwind edges out of a catch must have the same unwind dest as "
"the parent catchswitch", &FPI, FirstUser, CatchSwitch);
return; } } while (false)
3606 &FPI, FirstUser, CatchSwitch)do { if (!(SwitchUnwindPad == FirstUnwindPad)) { CheckFailed(
"Unwind edges out of a catch must have the same unwind dest as "
"the parent catchswitch", &FPI, FirstUser, CatchSwitch);
return; } } while (false)
;
3607 }
3608 }
3609
3610 visitInstruction(FPI);
3611}
3612
3613void Verifier::visitCatchSwitchInst(CatchSwitchInst &CatchSwitch) {
3614 BasicBlock *BB = CatchSwitch.getParent();
3615
3616 Function *F = BB->getParent();
3617 Assert(F->hasPersonalityFn(),do { if (!(F->hasPersonalityFn())) { CheckFailed("CatchSwitchInst needs to be in a function with a personality."
, &CatchSwitch); return; } } while (false)
3618 "CatchSwitchInst needs to be in a function with a personality.",do { if (!(F->hasPersonalityFn())) { CheckFailed("CatchSwitchInst needs to be in a function with a personality."
, &CatchSwitch); return; } } while (false)
3619 &CatchSwitch)do { if (!(F->hasPersonalityFn())) { CheckFailed("CatchSwitchInst needs to be in a function with a personality."
, &CatchSwitch); return; } } while (false)
;
3620
3621 // The catchswitch instruction must be the first non-PHI instruction in the
3622 // block.
3623 Assert(BB->getFirstNonPHI() == &CatchSwitch,do { if (!(BB->getFirstNonPHI() == &CatchSwitch)) { CheckFailed
("CatchSwitchInst not the first non-PHI instruction in the block."
, &CatchSwitch); return; } } while (false)
3624 "CatchSwitchInst not the first non-PHI instruction in the block.",do { if (!(BB->getFirstNonPHI() == &CatchSwitch)) { CheckFailed
("CatchSwitchInst not the first non-PHI instruction in the block."
, &CatchSwitch); return; } } while (false)
3625 &CatchSwitch)do { if (!(BB->getFirstNonPHI() == &CatchSwitch)) { CheckFailed
("CatchSwitchInst not the first non-PHI instruction in the block."
, &CatchSwitch); return; } } while (false)
;
3626
3627 auto *ParentPad = CatchSwitch.getParentPad();
3628 Assert(isa<ConstantTokenNone>(ParentPad) || isa<FuncletPadInst>(ParentPad),do { if (!(isa<ConstantTokenNone>(ParentPad) || isa<
FuncletPadInst>(ParentPad))) { CheckFailed("CatchSwitchInst has an invalid parent."
, ParentPad); return; } } while (false)
3629 "CatchSwitchInst has an invalid parent.", ParentPad)do { if (!(isa<ConstantTokenNone>(ParentPad) || isa<
FuncletPadInst>(ParentPad))) { CheckFailed("CatchSwitchInst has an invalid parent."
, ParentPad); return; } } while (false)
;
3630
3631 if (BasicBlock *UnwindDest = CatchSwitch.getUnwindDest()) {
3632 Instruction *I = UnwindDest->getFirstNonPHI();
3633 Assert(I->isEHPad() && !isa<LandingPadInst>(I),do { if (!(I->isEHPad() && !isa<LandingPadInst>
(I))) { CheckFailed("CatchSwitchInst must unwind to an EH block which is not a "
"landingpad.", &CatchSwitch); return; } } while (false)
3634 "CatchSwitchInst must unwind to an EH block which is not a "do { if (!(I->isEHPad() && !isa<LandingPadInst>
(I))) { CheckFailed("CatchSwitchInst must unwind to an EH block which is not a "
"landingpad.", &CatchSwitch); return; } } while (false)
3635 "landingpad.",do { if (!(I->isEHPad() && !isa<LandingPadInst>
(I))) { CheckFailed("CatchSwitchInst must unwind to an EH block which is not a "
"landingpad.", &CatchSwitch); return; } } while (false)
3636 &CatchSwitch)do { if (!(I->isEHPad() && !isa<LandingPadInst>
(I))) { CheckFailed("CatchSwitchInst must unwind to an EH block which is not a "
"landingpad.", &CatchSwitch); return; } } while (false)
;
3637
3638 // Record catchswitch sibling unwinds for verifySiblingFuncletUnwinds
3639 if (getParentPad(I) == ParentPad)
3640 SiblingFuncletInfo[&CatchSwitch] = &CatchSwitch;
3641 }
3642
3643 Assert(CatchSwitch.getNumHandlers() != 0,do { if (!(CatchSwitch.getNumHandlers() != 0)) { CheckFailed(
"CatchSwitchInst cannot have empty handler list", &CatchSwitch
); return; } } while (false)
3644 "CatchSwitchInst cannot have empty handler list", &CatchSwitch)do { if (!(CatchSwitch.getNumHandlers() != 0)) { CheckFailed(
"CatchSwitchInst cannot have empty handler list", &CatchSwitch
); return; } } while (false)
;
3645
3646 for (BasicBlock *Handler : CatchSwitch.handlers()) {
3647 Assert(isa<CatchPadInst>(Handler->getFirstNonPHI()),do { if (!(isa<CatchPadInst>(Handler->getFirstNonPHI
()))) { CheckFailed("CatchSwitchInst handlers must be catchpads"
, &CatchSwitch, Handler); return; } } while (false)
3648 "CatchSwitchInst handlers must be catchpads", &CatchSwitch, Handler)do { if (!(isa<CatchPadInst>(Handler->getFirstNonPHI
()))) { CheckFailed("CatchSwitchInst handlers must be catchpads"
, &CatchSwitch, Handler); return; } } while (false)
;
3649 }
3650
3651 visitEHPadPredecessors(CatchSwitch);
3652 visitTerminatorInst(CatchSwitch);
3653}
3654
3655void Verifier::visitCleanupReturnInst(CleanupReturnInst &CRI) {
3656 Assert(isa<CleanupPadInst>(CRI.getOperand(0)),do { if (!(isa<CleanupPadInst>(CRI.getOperand(0)))) { CheckFailed
("CleanupReturnInst needs to be provided a CleanupPad", &
CRI, CRI.getOperand(0)); return; } } while (false)
3657 "CleanupReturnInst needs to be provided a CleanupPad", &CRI,do { if (!(isa<CleanupPadInst>(CRI.getOperand(0)))) { CheckFailed
("CleanupReturnInst needs to be provided a CleanupPad", &
CRI, CRI.getOperand(0)); return; } } while (false)
3658 CRI.getOperand(0))do { if (!(isa<CleanupPadInst>(CRI.getOperand(0)))) { CheckFailed
("CleanupReturnInst needs to be provided a CleanupPad", &
CRI, CRI.getOperand(0)); return; } } while (false)
;
3659
3660 if (BasicBlock *UnwindDest = CRI.getUnwindDest()) {
3661 Instruction *I = UnwindDest->getFirstNonPHI();
3662 Assert(I->isEHPad() && !isa<LandingPadInst>(I),do { if (!(I->isEHPad() && !isa<LandingPadInst>
(I))) { CheckFailed("CleanupReturnInst must unwind to an EH block which is not a "
"landingpad.", &CRI); return; } } while (false)
3663 "CleanupReturnInst must unwind to an EH block which is not a "do { if (!(I->isEHPad() && !isa<LandingPadInst>
(I))) { CheckFailed("CleanupReturnInst must unwind to an EH block which is not a "
"landingpad.", &CRI); return; } } while (false)
3664 "landingpad.",do { if (!(I->isEHPad() && !isa<LandingPadInst>
(I))) { CheckFailed("CleanupReturnInst must unwind to an EH block which is not a "
"landingpad.", &CRI); return; } } while (false)
3665 &CRI)do { if (!(I->isEHPad() && !isa<LandingPadInst>
(I))) { CheckFailed("CleanupReturnInst must unwind to an EH block which is not a "
"landingpad.", &CRI); return; } } while (false)
;
3666 }
3667
3668 visitTerminatorInst(CRI);
3669}
3670
3671void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
3672 Instruction *Op = cast<Instruction>(I.getOperand(i));
3673 // If the we have an invalid invoke, don't try to compute the dominance.
3674 // We already reject it in the invoke specific checks and the dominance
3675 // computation doesn't handle multiple edges.
3676 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
3677 if (II->getNormalDest() == II->getUnwindDest())
3678 return;
3679 }
3680
3681 // Quick check whether the def has already been encountered in the same block.
3682 // PHI nodes are not checked to prevent accepting preceeding PHIs, because PHI
3683 // uses are defined to happen on the incoming edge, not at the instruction.
3684 //
3685 // FIXME: If this operand is a MetadataAsValue (wrapping a LocalAsMetadata)
3686 // wrapping an SSA value, assert that we've already encountered it. See
3687 // related FIXME in Mapper::mapLocalAsMetadata in ValueMapper.cpp.
3688 if (!isa<PHINode>(I) && InstsInThisBlock.count(Op))
3689 return;
3690
3691 const Use &U = I.getOperandUse(i);
3692 Assert(DT.dominates(Op, U),do { if (!(DT.dominates(Op, U))) { CheckFailed("Instruction does not dominate all uses!"
, Op, &I); return; } } while (false)
3693 "Instruction does not dominate all uses!", Op, &I)do { if (!(DT.dominates(Op, U))) { CheckFailed("Instruction does not dominate all uses!"
, Op, &I); return; } } while (false)
;
3694}
3695
3696void Verifier::visitDereferenceableMetadata(Instruction& I, MDNode* MD) {
3697 Assert(I.getType()->isPointerTy(), "dereferenceable, dereferenceable_or_null "do { if (!(I.getType()->isPointerTy())) { CheckFailed("dereferenceable, dereferenceable_or_null "
"apply only to pointer types", &I); return; } } while (false
)
3698 "apply only to pointer types", &I)do { if (!(I.getType()->isPointerTy())) { CheckFailed("dereferenceable, dereferenceable_or_null "
"apply only to pointer types", &I); return; } } while (false
)
;
3699 Assert(isa<LoadInst>(I),do { if (!(isa<LoadInst>(I))) { CheckFailed("dereferenceable, dereferenceable_or_null apply only to load"
" instructions, use attributes for calls or invokes", &I
); return; } } while (false)
3700 "dereferenceable, dereferenceable_or_null apply only to load"do { if (!(isa<LoadInst>(I))) { CheckFailed("dereferenceable, dereferenceable_or_null apply only to load"
" instructions, use attributes for calls or invokes", &I
); return; } } while (false)
3701 " instructions, use attributes for calls or invokes", &I)do { if (!(isa<LoadInst>(I))) { CheckFailed("dereferenceable, dereferenceable_or_null apply only to load"
" instructions, use attributes for calls or invokes", &I
); return; } } while (false)
;
3702 Assert(MD->getNumOperands() == 1, "dereferenceable, dereferenceable_or_null "do { if (!(MD->getNumOperands() == 1)) { CheckFailed("dereferenceable, dereferenceable_or_null "
"take one operand!", &I); return; } } while (false)
3703 "take one operand!", &I)do { if (!(MD->getNumOperands() == 1)) { CheckFailed("dereferenceable, dereferenceable_or_null "
"take one operand!", &I); return; } } while (false)
;
3704 ConstantInt *CI = mdconst::dyn_extract<ConstantInt>(MD->getOperand(0));
3705 Assert(CI && CI->getType()->isIntegerTy(64), "dereferenceable, "do { if (!(CI && CI->getType()->isIntegerTy(64)
)) { CheckFailed("dereferenceable, " "dereferenceable_or_null metadata value must be an i64!"
, &I); return; } } while (false)
3706 "dereferenceable_or_null metadata value must be an i64!", &I)do { if (!(CI && CI->getType()->isIntegerTy(64)
)) { CheckFailed("dereferenceable, " "dereferenceable_or_null metadata value must be an i64!"
, &I); return; } } while (false)
;
3707}
3708
3709/// verifyInstruction - Verify that an instruction is well formed.
3710///
3711void Verifier::visitInstruction(Instruction &I) {
3712 BasicBlock *BB = I.getParent();
3713 Assert(BB, "Instruction not embedded in basic block!", &I)do { if (!(BB)) { CheckFailed("Instruction not embedded in basic block!"
, &I); return; } } while (false)
;
3714
3715 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
3716 for (User *U : I.users()) {
3717 Assert(U != (User *)&I || !DT.isReachableFromEntry(BB),do { if (!(U != (User *)&I || !DT.isReachableFromEntry(BB
))) { CheckFailed("Only PHI nodes may reference their own value!"
, &I); return; } } while (false)
3718 "Only PHI nodes may reference their own value!", &I)do { if (!(U != (User *)&I || !DT.isReachableFromEntry(BB
))) { CheckFailed("Only PHI nodes may reference their own value!"
, &I); return; } } while (false)
;
3719 }
3720 }
3721
3722 // Check that void typed values don't have names
3723 Assert(!I.getType()->isVoidTy() || !I.hasName(),do { if (!(!I.getType()->isVoidTy() || !I.hasName())) { CheckFailed
("Instruction has a name, but provides a void value!", &I
); return; } } while (false)
3724 "Instruction has a name, but provides a void value!", &I)do { if (!(!I.getType()->isVoidTy() || !I.hasName())) { CheckFailed
("Instruction has a name, but provides a void value!", &I
); return; } } while (false)
;
3725
3726 // Check that the return value of the instruction is either void or a legal
3727 // value type.
3728 Assert(I.getType()->isVoidTy() || I.getType()->isFirstClassType(),do { if (!(I.getType()->isVoidTy() || I.getType()->isFirstClassType
())) { CheckFailed("Instruction returns a non-scalar type!", &
I); return; } } while (false)
3729 "Instruction returns a non-scalar type!", &I)do { if (!(I.getType()->isVoidTy() || I.getType()->isFirstClassType
())) { CheckFailed("Instruction returns a non-scalar type!", &
I); return; } } while (false)
;
3730
3731 // Check that the instruction doesn't produce metadata. Calls are already
3732 // checked against the callee type.
3733 Assert(!I.getType()->isMetadataTy() || isa<CallInst>(I) || isa<InvokeInst>(I),do { if (!(!I.getType()->isMetadataTy() || isa<CallInst
>(I) || isa<InvokeInst>(I))) { CheckFailed("Invalid use of metadata!"
, &I); return; } } while (false)
3734 "Invalid use of metadata!", &I)do { if (!(!I.getType()->isMetadataTy() || isa<CallInst
>(I) || isa<InvokeInst>(I))) { CheckFailed("Invalid use of metadata!"
, &I); return; } } while (false)
;
3735
3736 // Check that all uses of the instruction, if they are instructions
3737 // themselves, actually have parent basic blocks. If the use is not an
3738 // instruction, it is an error!
3739 for (Use &U : I.uses()) {
3740 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
3741 Assert(Used->getParent() != nullptr,do { if (!(Used->getParent() != nullptr)) { CheckFailed("Instruction referencing"
" instruction not embedded in a basic block!", &I, Used)
; return; } } while (false)
3742 "Instruction referencing"do { if (!(Used->getParent() != nullptr)) { CheckFailed("Instruction referencing"
" instruction not embedded in a basic block!", &I, Used)
; return; } } while (false)
3743 " instruction not embedded in a basic block!",do { if (!(Used->getParent() != nullptr)) { CheckFailed("Instruction referencing"
" instruction not embedded in a basic block!", &I, Used)
; return; } } while (false)
3744 &I, Used)do { if (!(Used->getParent() != nullptr)) { CheckFailed("Instruction referencing"
" instruction not embedded in a basic block!", &I, Used)
; return; } } while (false)
;
3745 else {
3746 CheckFailed("Use of instruction is not an instruction!", U);
3747 return;
3748 }
3749 }
3750
3751 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
3752 Assert(I.getOperand(i) != nullptr, "Instruction has null operand!", &I)do { if (!(I.getOperand(i) != nullptr)) { CheckFailed("Instruction has null operand!"
, &I); return; } } while (false)
;
3753
3754 // Check to make sure that only first-class-values are operands to
3755 // instructions.
3756 if (!I.getOperand(i)->getType()->isFirstClassType()) {
3757 Assert(false, "Instruction operands must be first-class values!", &I)do { if (!(false)) { CheckFailed("Instruction operands must be first-class values!"
, &I); return; } } while (false)
;
3758 }
3759
3760 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
3761 // Check to make sure that the "address of" an intrinsic function is never
3762 // taken.
3763 Assert(do { if (!(!F->isIntrinsic() || i == (isa<CallInst>(
I) ? e - 1 : isa<InvokeInst>(I) ? e - 3 : 0))) { CheckFailed
("Cannot take the address of an intrinsic!", &I); return;
} } while (false)
3764 !F->isIntrinsic() ||do { if (!(!F->isIntrinsic() || i == (isa<CallInst>(
I) ? e - 1 : isa<InvokeInst>(I) ? e - 3 : 0))) { CheckFailed
("Cannot take the address of an intrinsic!", &I); return;
} } while (false)
3765 i == (isa<CallInst>(I) ? e - 1 : isa<InvokeInst>(I) ? e - 3 : 0),do { if (!(!F->isIntrinsic() || i == (isa<CallInst>(
I) ? e - 1 : isa<InvokeInst>(I) ? e - 3 : 0))) { CheckFailed
("Cannot take the address of an intrinsic!", &I); return;
} } while (false)
3766 "Cannot take the address of an intrinsic!", &I)do { if (!(!F->isIntrinsic() || i == (isa<CallInst>(
I) ? e - 1 : isa<InvokeInst>(I) ? e - 3 : 0))) { CheckFailed
("Cannot take the address of an intrinsic!", &I); return;
} } while (false)
;
3767 Assert(do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3768 !F->isIntrinsic() || isa<CallInst>(I) ||do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3769 F->getIntrinsicID() == Intrinsic::donothing ||do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3770 F->getIntrinsicID() == Intrinsic::coro_resume ||do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3771 F->getIntrinsicID() == Intrinsic::coro_destroy ||do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3772 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void ||do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3773 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64 ||do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3774 F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3775 "Cannot invoke an intrinsic other than donothing, patchpoint, "do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3776 "statepoint, coro_resume or coro_destroy",do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
3777 &I)do { if (!(!F->isIntrinsic() || isa<CallInst>(I) || F
->getIntrinsicID() == Intrinsic::donothing || F->getIntrinsicID
() == Intrinsic::coro_resume || F->getIntrinsicID() == Intrinsic
::coro_destroy || F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void
|| F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64
|| F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint
)) { CheckFailed("Cannot invoke an intrinsic other than donothing, patchpoint, "
"statepoint, coro_resume or coro_destroy", &I); return; }
} while (false)
;
3778 Assert(F->getParent() == &M, "Referencing function in another module!",do { if (!(F->getParent() == &M)) { CheckFailed("Referencing function in another module!"
, &I, &M, F, F->getParent()); return; } } while (false
)
3779 &I, &M, F, F->getParent())do { if (!(F->getParent() == &M)) { CheckFailed("Referencing function in another module!"
, &I, &M, F, F->getParent()); return; } } while (false
)
;
3780 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
3781 Assert(OpBB->getParent() == BB->getParent(),do { if (!(OpBB->getParent() == BB->getParent())) { CheckFailed
("Referring to a basic block in another function!", &I); return
; } } while (false)
3782 "Referring to a basic block in another function!", &I)do { if (!(OpBB->getParent() == BB->getParent())) { CheckFailed
("Referring to a basic block in another function!", &I); return
; } } while (false)
;
3783 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
3784 Assert(OpArg->getParent() == BB->getParent(),do { if (!(OpArg->getParent() == BB->getParent())) { CheckFailed
("Referring to an argument in another function!", &I); return
; } } while (false)
3785 "Referring to an argument in another function!", &I)do { if (!(OpArg->getParent() == BB->getParent())) { CheckFailed
("Referring to an argument in another function!", &I); return
; } } while (false)
;
3786 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
3787 Assert(GV->getParent() == &M, "Referencing global in another module!", &I,do { if (!(GV->getParent() == &M)) { CheckFailed("Referencing global in another module!"
, &I, &M, GV, GV->getParent()); return; } } while (
false)
3788 &M, GV, GV->getParent())do { if (!(GV->getParent() == &M)) { CheckFailed("Referencing global in another module!"
, &I, &M, GV, GV->getParent()); return; } } while (
false)
;
3789 } else if (isa<Instruction>(I.getOperand(i))) {
3790 verifyDominatesUse(I, i);
3791 } else if (isa<InlineAsm>(I.getOperand(i))) {
3792 Assert((i + 1 == e && isa<CallInst>(I)) ||do { if (!((i + 1 == e && isa<CallInst>(I)) || (
i + 3 == e && isa<InvokeInst>(I)))) { CheckFailed
("Cannot take the address of an inline asm!", &I); return
; } } while (false)
3793 (i + 3 == e && isa<InvokeInst>(I)),do { if (!((i + 1 == e && isa<CallInst>(I)) || (
i + 3 == e && isa<InvokeInst>(I)))) { CheckFailed
("Cannot take the address of an inline asm!", &I); return
; } } while (false)
3794 "Cannot take the address of an inline asm!", &I)do { if (!((i + 1 == e && isa<CallInst>(I)) || (
i + 3 == e && isa<InvokeInst>(I)))) { CheckFailed
("Cannot take the address of an inline asm!", &I); return
; } } while (false)
;
3795 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
3796 if (CE->getType()->isPtrOrPtrVectorTy() ||
3797 !DL.getNonIntegralAddressSpaces().empty()) {
3798 // If we have a ConstantExpr pointer, we need to see if it came from an
3799 // illegal bitcast. If the datalayout string specifies non-integral
3800 // address spaces then we also need to check for illegal ptrtoint and
3801 // inttoptr expressions.
3802 visitConstantExprsRecursively(CE);
3803 }
3804 }
3805 }
3806
3807 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
3808 Assert(I.getType()->isFPOrFPVectorTy(),do { if (!(I.getType()->isFPOrFPVectorTy())) { CheckFailed
("fpmath requires a floating point result!", &I); return;
} } while (false)
3809 "fpmath requires a floating point result!", &I)do { if (!(I.getType()->isFPOrFPVectorTy())) { CheckFailed
("fpmath requires a floating point result!", &I); return;
} } while (false)
;
3810 Assert(MD->getNumOperands() == 1, "fpmath takes one operand!", &I)do { if (!(MD->getNumOperands() == 1)) { CheckFailed("fpmath takes one operand!"
, &I); return; } } while (false)
;
3811 if (ConstantFP *CFP0 =
3812 mdconst::dyn_extract_or_null<ConstantFP>(MD->getOperand(0))) {
3813 const APFloat &Accuracy = CFP0->getValueAPF();
3814 Assert(&Accuracy.getSemantics() == &APFloat::IEEEsingle(),do { if (!(&Accuracy.getSemantics() == &APFloat::IEEEsingle
())) { CheckFailed("fpmath accuracy must have float type", &
I); return; } } while (false)
3815 "fpmath accuracy must have float type", &I)do { if (!(&Accuracy.getSemantics() == &APFloat::IEEEsingle
())) { CheckFailed("fpmath accuracy must have float type", &
I); return; } } while (false)
;
3816 Assert(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),do { if (!(Accuracy.isFiniteNonZero() && !Accuracy.isNegative
())) { CheckFailed("fpmath accuracy not a positive number!", &
I); return; } } while (false)
3817 "fpmath accuracy not a positive number!", &I)do { if (!(Accuracy.isFiniteNonZero() && !Accuracy.isNegative
())) { CheckFailed("fpmath accuracy not a positive number!", &
I); return; } } while (false)
;
3818 } else {
3819 Assert(false, "invalid fpmath accuracy!", &I)do { if (!(false)) { CheckFailed("invalid fpmath accuracy!", &
I); return; } } while (false)
;
3820 }
3821 }
3822
3823 if (MDNode *Range = I.getMetadata(LLVMContext::MD_range)) {
3824 Assert(isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),do { if (!(isa<LoadInst>(I) || isa<CallInst>(I) ||
isa<InvokeInst>(I))) { CheckFailed("Ranges are only for loads, calls and invokes!"
, &I); return; } } while (false)
3825 "Ranges are only for loads, calls and invokes!", &I)do { if (!(isa<LoadInst>(I) || isa<CallInst>(I) ||
isa<InvokeInst>(I))) { CheckFailed("Ranges are only for loads, calls and invokes!"
, &I); return; } } while (false)
;
3826 visitRangeMetadata(I, Range, I.getType());
3827 }
3828
3829 if (I.getMetadata(LLVMContext::MD_nonnull)) {
3830 Assert(I.getType()->isPointerTy(), "nonnull applies only to pointer types",do { if (!(I.getType()->isPointerTy())) { CheckFailed("nonnull applies only to pointer types"
, &I); return; } } while (false)
3831 &I)do { if (!(I.getType()->isPointerTy())) { CheckFailed("nonnull applies only to pointer types"
, &I); return; } } while (false)
;
3832 Assert(isa<LoadInst>(I),do { if (!(isa<LoadInst>(I))) { CheckFailed("nonnull applies only to load instructions, use attributes"
" for calls or invokes", &I); return; } } while (false)
3833 "nonnull applies only to load instructions, use attributes"do { if (!(isa<LoadInst>(I))) { CheckFailed("nonnull applies only to load instructions, use attributes"
" for calls or invokes", &I); return; } } while (false)
3834 " for calls or invokes",do { if (!(isa<LoadInst>(I))) { CheckFailed("nonnull applies only to load instructions, use attributes"
" for calls or invokes", &I); return; } } while (false)
3835 &I)do { if (!(isa<LoadInst>(I))) { CheckFailed("nonnull applies only to load instructions, use attributes"
" for calls or invokes", &I); return; } } while (false)
;
3836 }
3837
3838 if (MDNode *MD = I.getMetadata(LLVMContext::MD_dereferenceable))
3839 visitDereferenceableMetadata(I, MD);
3840
3841 if (MDNode *MD = I.getMetadata(LLVMContext::MD_dereferenceable_or_null))
3842 visitDereferenceableMetadata(I, MD);
3843
3844 if (MDNode *TBAA = I.getMetadata(LLVMContext::MD_tbaa))
3845 TBAAVerifyHelper.visitTBAAMetadata(I, TBAA);
3846
3847 if (MDNode *AlignMD = I.getMetadata(LLVMContext::MD_align)) {
3848 Assert(I.getType()->isPointerTy(), "align applies only to pointer types",do { if (!(I.getType()->isPointerTy())) { CheckFailed("align applies only to pointer types"
, &I); return; } } while (false)
3849 &I)do { if (!(I.getType()->isPointerTy())) { CheckFailed("align applies only to pointer types"
, &I); return; } } while (false)
;
3850 Assert(isa<LoadInst>(I), "align applies only to load instructions, "do { if (!(isa<LoadInst>(I))) { CheckFailed("align applies only to load instructions, "
"use attributes for calls or invokes", &I); return; } } while
(false)
3851 "use attributes for calls or invokes", &I)do { if (!(isa<LoadInst>(I))) { CheckFailed("align applies only to load instructions, "
"use attributes for calls or invokes", &I); return; } } while
(false)
;
3852 Assert(AlignMD->getNumOperands() == 1, "align takes one operand!", &I)do { if (!(AlignMD->getNumOperands() == 1)) { CheckFailed(
"align takes one operand!", &I); return; } } while (false
)
;
3853 ConstantInt *CI = mdconst::dyn_extract<ConstantInt>(AlignMD->getOperand(0));
3854 Assert(CI && CI->getType()->isIntegerTy(64),do { if (!(CI && CI->getType()->isIntegerTy(64)
)) { CheckFailed("align metadata value must be an i64!", &
I); return; } } while (false)
3855 "align metadata value must be an i64!", &I)do { if (!(CI && CI->getType()->isIntegerTy(64)
)) { CheckFailed("align metadata value must be an i64!", &
I); return; } } while (false)
;
3856 uint64_t Align = CI->getZExtValue();
3857 Assert(isPowerOf2_64(Align),do { if (!(isPowerOf2_64(Align))) { CheckFailed("align metadata value must be a power of 2!"
, &I); return; } } while (false)
3858 "align metadata value must be a power of 2!", &I)do { if (!(isPowerOf2_64(Align))) { CheckFailed("align metadata value must be a power of 2!"
, &I); return; } } while (false)
;
3859 Assert(Align <= Value::MaximumAlignment,do { if (!(Align <= Value::MaximumAlignment)) { CheckFailed
("alignment is larger that implementation defined limit", &
I); return; } } while (false)
3860 "alignment is larger that implementation defined limit", &I)do { if (!(Align <= Value::MaximumAlignment)) { CheckFailed
("alignment is larger that implementation defined limit", &
I); return; } } while (false)
;
3861 }
3862
3863 if (MDNode *N = I.getDebugLoc().getAsMDNode()) {
3864 AssertDI(isa<DILocation>(N), "invalid !dbg metadata attachment", &I, N)do { if (!(isa<DILocation>(N))) { DebugInfoCheckFailed(
"invalid !dbg metadata attachment", &I, N); return; } } while
(false)
;
3865 visitMDNode(*N);
3866 }
3867
3868 if (auto *DII = dyn_cast<DbgInfoIntrinsic>(&I))
3869 verifyFragmentExpression(*DII);
3870
3871 InstsInThisBlock.insert(&I);
3872}
3873
3874/// Allow intrinsics to be verified in different ways.
3875void Verifier::visitIntrinsicCallSite(Intrinsic::ID ID, CallSite CS) {
3876 Function *IF = CS.getCalledFunction();
3877 Assert(IF->isDeclaration(), "Intrinsic functions should never be defined!",do { if (!(IF->isDeclaration())) { CheckFailed("Intrinsic functions should never be defined!"
, IF); return; } } while (false)
3878 IF)do { if (!(IF->isDeclaration())) { CheckFailed("Intrinsic functions should never be defined!"
, IF); return; } } while (false)
;
3879
3880 // Verify that the intrinsic prototype lines up with what the .td files
3881 // describe.
3882 FunctionType *IFTy = IF->getFunctionType();
3883 bool IsVarArg = IFTy->isVarArg();
3884
3885 SmallVector<Intrinsic::IITDescriptor, 8> Table;
3886 getIntrinsicInfoTableEntries(ID, Table);
3887 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
3888
3889 SmallVector<Type *, 4> ArgTys;
3890 Assert(!Intrinsic::matchIntrinsicType(IFTy->getReturnType(),do { if (!(!Intrinsic::matchIntrinsicType(IFTy->getReturnType
(), TableRef, ArgTys))) { CheckFailed("Intrinsic has incorrect return type!"
, IF); return; } } while (false)
3891 TableRef, ArgTys),do { if (!(!Intrinsic::matchIntrinsicType(IFTy->getReturnType
(), TableRef, ArgTys))) { CheckFailed("Intrinsic has incorrect return type!"
, IF); return; } } while (false)
3892 "Intrinsic has incorrect return type!", IF)do { if (!(!Intrinsic::matchIntrinsicType(IFTy->getReturnType
(), TableRef, ArgTys))) { CheckFailed("Intrinsic has incorrect return type!"
, IF); return; } } while (false)
;
3893 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
3894 Assert(!Intrinsic::matchIntrinsicType(IFTy->getParamType(i),do { if (!(!Intrinsic::matchIntrinsicType(IFTy->getParamType
(i), TableRef, ArgTys))) { CheckFailed("Intrinsic has incorrect argument type!"
, IF); return; } } while (false)
3895 TableRef, ArgTys),do { if (!(!Intrinsic::matchIntrinsicType(IFTy->getParamType
(i), TableRef, ArgTys))) { CheckFailed("Intrinsic has incorrect argument type!"
, IF); return; } } while (false)
3896 "Intrinsic has incorrect argument type!", IF)do { if (!(!Intrinsic::matchIntrinsicType(IFTy->getParamType
(i), TableRef, ArgTys))) { CheckFailed("Intrinsic has incorrect argument type!"
, IF); return; } } while (false)
;
3897
3898 // Verify if the intrinsic call matches the vararg property.
3899 if (IsVarArg)
3900 Assert(!Intrinsic::matchIntrinsicVarArg(IsVarArg, TableRef),do { if (!(!Intrinsic::matchIntrinsicVarArg(IsVarArg, TableRef
))) { CheckFailed("Intrinsic was not defined with variable arguments!"
, IF); return; } } while (false)
3901 "Intrinsic was not defined with variable arguments!", IF)do { if (!(!Intrinsic::matchIntrinsicVarArg(IsVarArg, TableRef
))) { CheckFailed("Intrinsic was not defined with variable arguments!"
, IF); return; } } while (false)
;
3902 else
3903 Assert(!Intrinsic::matchIntrinsicVarArg(IsVarArg, TableRef),do { if (!(!Intrinsic::matchIntrinsicVarArg(IsVarArg, TableRef
))) { CheckFailed("Callsite was not defined with variable arguments!"
, IF); return; } } while (false)
3904 "Callsite was not defined with variable arguments!", IF)do { if (!(!Intrinsic::matchIntrinsicVarArg(IsVarArg, TableRef
))) { CheckFailed("Callsite was not defined with variable arguments!"
, IF); return; } } while (false)
;
3905
3906 // All descriptors should be absorbed by now.
3907 Assert(TableRef.empty(), "Intrinsic has too few arguments!", IF)do { if (!(TableRef.empty())) { CheckFailed("Intrinsic has too few arguments!"
, IF); return; } } while (false)
;
3908
3909 // Now that we have the intrinsic ID and the actual argument types (and we
3910 // know they are legal for the intrinsic!) get the intrinsic name through the
3911 // usual means. This allows us to verify the mangling of argument types into
3912 // the name.
3913 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
3914 Assert(ExpectedName == IF->getName(),do { if (!(ExpectedName == IF->getName())) { CheckFailed("Intrinsic name not mangled correctly for type arguments! "
"Should be: " + ExpectedName, IF); return; } } while (false)
3915 "Intrinsic name not mangled correctly for type arguments! "do { if (!(ExpectedName == IF->getName())) { CheckFailed("Intrinsic name not mangled correctly for type arguments! "
"Should be: " + ExpectedName, IF); return; } } while (false)
3916 "Should be: " +do { if (!(ExpectedName == IF->getName())) { CheckFailed("Intrinsic name not mangled correctly for type arguments! "
"Should be: " + ExpectedName, IF); return; } } while (false)
3917 ExpectedName,do { if (!(ExpectedName == IF->getName())) { CheckFailed("Intrinsic name not mangled correctly for type arguments! "
"Should be: " + ExpectedName, IF); return; } } while (false)
3918 IF)do { if (!(ExpectedName == IF->getName())) { CheckFailed("Intrinsic name not mangled correctly for type arguments! "
"Should be: " + ExpectedName, IF); return; } } while (false)
;
3919
3920 // If the intrinsic takes MDNode arguments, verify that they are either global
3921 // or are local to *this* function.
3922 for (Value *V : CS.args())
3923 if (auto *MD = dyn_cast<MetadataAsValue>(V))
3924 visitMetadataAsValue(*MD, CS.getCaller());
3925
3926 switch (ID) {
3927 default:
3928 break;
3929 case Intrinsic::coro_id: {
3930 auto *InfoArg = CS.getArgOperand(3)->stripPointerCasts();
3931 if (isa<ConstantPointerNull>(InfoArg))
3932 break;
3933 auto *GV = dyn_cast<GlobalVariable>(InfoArg);
3934 Assert(GV && GV->isConstant() && GV->hasDefinitiveInitializer(),do { if (!(GV && GV->isConstant() && GV->
hasDefinitiveInitializer())) { CheckFailed("info argument of llvm.coro.begin must refer to an initialized "
"constant"); return; } } while (false)
3935 "info argument of llvm.coro.begin must refer to an initialized "do { if (!(GV && GV->isConstant() && GV->
hasDefinitiveInitializer())) { CheckFailed("info argument of llvm.coro.begin must refer to an initialized "
"constant"); return; } } while (false)
3936 "constant")do { if (!(GV && GV->isConstant() && GV->
hasDefinitiveInitializer())) { CheckFailed("info argument of llvm.coro.begin must refer to an initialized "
"constant"); return; } } while (false)
;
3937 Constant *Init = GV->getInitializer();
3938 Assert(isa<ConstantStruct>(Init) || isa<ConstantArray>(Init),do { if (!(isa<ConstantStruct>(Init) || isa<ConstantArray
>(Init))) { CheckFailed("info argument of llvm.coro.begin must refer to either a struct or "
"an array"); return; } } while (false)
3939 "info argument of llvm.coro.begin must refer to either a struct or "do { if (!(isa<ConstantStruct>(Init) || isa<ConstantArray
>(Init))) { CheckFailed("info argument of llvm.coro.begin must refer to either a struct or "
"an array"); return; } } while (false)
3940 "an array")do { if (!(isa<ConstantStruct>(Init) || isa<ConstantArray
>(Init))) { CheckFailed("info argument of llvm.coro.begin must refer to either a struct or "
"an array"); return; } } while (false)
;
3941 break;
3942 }
3943 case Intrinsic::ctlz: // llvm.ctlz
3944 case Intrinsic::cttz: // llvm.cttz
3945 Assert(isa<ConstantInt>(CS.getArgOperand(1)),do { if (!(isa<ConstantInt>(CS.getArgOperand(1)))) { CheckFailed
("is_zero_undef argument of bit counting intrinsics must be a "
"constant int", CS); return; } } while (false)
3946 "is_zero_undef argument of bit counting intrinsics must be a "do { if (!(isa<ConstantInt>(CS.getArgOperand(1)))) { CheckFailed
("is_zero_undef argument of bit counting intrinsics must be a "
"constant int", CS); return; } } while (false)
3947 "constant int",do { if (!(isa<ConstantInt>(CS.getArgOperand(1)))) { CheckFailed
("is_zero_undef argument of bit counting intrinsics must be a "
"constant int", CS); return; } } while (false)
3948 CS)do { if (!(isa<ConstantInt>(CS.getArgOperand(1)))) { CheckFailed
("is_zero_undef argument of bit counting intrinsics must be a "
"constant int", CS); return; } } while (false)
;
3949 break;
3950 case Intrinsic::experimental_constrained_fadd:
3951 case Intrinsic::experimental_constrained_fsub:
3952 case Intrinsic::experimental_constrained_fmul:
3953 case Intrinsic::experimental_constrained_fdiv:
3954 case Intrinsic::experimental_constrained_frem:
3955 visitConstrainedFPIntrinsic(
3956 cast<ConstrainedFPIntrinsic>(*CS.getInstruction()));
3957 break;
3958 case Intrinsic::dbg_declare: // llvm.dbg.declare
3959 Assert(isa<MetadataAsValue>(CS.getArgOperand(0)),do { if (!(isa<MetadataAsValue>(CS.getArgOperand(0)))) {
CheckFailed("invalid llvm.dbg.declare intrinsic call 1", CS)
; return; } } while (false)
3960 "invalid llvm.dbg.declare intrinsic call 1", CS)do { if (!(isa<MetadataAsValue>(CS.getArgOperand(0)))) {
CheckFailed("invalid llvm.dbg.declare intrinsic call 1", CS)
; return; } } while (false)
;
3961 visitDbgIntrinsic("declare", cast<DbgDeclareInst>(*CS.getInstruction()));
3962 break;
3963 case Intrinsic::dbg_value: // llvm.dbg.value
3964 visitDbgIntrinsic("value", cast<DbgValueInst>(*CS.getInstruction()));
3965 break;
3966 case Intrinsic::memcpy:
3967 case Intrinsic::memmove:
3968 case Intrinsic::memset: {
3969 ConstantInt *AlignCI = dyn_cast<ConstantInt>(CS.getArgOperand(3));
3970 Assert(AlignCI,do { if (!(AlignCI)) { CheckFailed("alignment argument of memory intrinsics must be a constant int"
, CS); return; } } while (false)
3971 "alignment argument of memory intrinsics must be a constant int",do { if (!(AlignCI)) { CheckFailed("alignment argument of memory intrinsics must be a constant int"
, CS); return; } } while (false)
3972 CS)do { if (!(AlignCI)) { CheckFailed("alignment argument of memory intrinsics must be a constant int"
, CS); return; } } while (false)
;
3973 const APInt &AlignVal = AlignCI->getValue();
3974 Assert(AlignCI->isZero() || AlignVal.isPowerOf2(),do { if (!(AlignCI->isZero() || AlignVal.isPowerOf2())) { CheckFailed
("alignment argument of memory intrinsics must be a power of 2"
, CS); return; } } while (false)
3975 "alignment argument of memory intrinsics must be a power of 2", CS)do { if (!(AlignCI->isZero() || AlignVal.isPowerOf2())) { CheckFailed
("alignment argument of memory intrinsics must be a power of 2"
, CS); return; } } while (false)
;
3976 Assert(isa<ConstantInt>(CS.getArgOperand(4)),do { if (!(isa<ConstantInt>(CS.getArgOperand(4)))) { CheckFailed
("isvolatile argument of memory intrinsics must be a constant int"
, CS); return; } } while (false)
3977 "isvolatile argument of memory intrinsics must be a constant int",do { if (!(isa<ConstantInt>(CS.getArgOperand(4)))) { CheckFailed
("isvolatile argument of memory intrinsics must be a constant int"
, CS); return; } } while (false)
3978 CS)do { if (!(isa<ConstantInt>(CS.getArgOperand(4)))) { CheckFailed
("isvolatile argument of memory intrinsics must be a constant int"
, CS); return; } } while (false)
;
3979 break;
3980 }
3981 case Intrinsic::memcpy_element_atomic: {
3982 ConstantInt *ElementSizeCI = dyn_cast<ConstantInt>(CS.getArgOperand(3));
3983 Assert(ElementSizeCI, "element size of the element-wise atomic memory "do { if (!(ElementSizeCI)) { CheckFailed("element size of the element-wise atomic memory "
"intrinsic must be a constant int", CS); return; } } while (
false)
3984 "intrinsic must be a constant int",do { if (!(ElementSizeCI)) { CheckFailed("element size of the element-wise atomic memory "
"intrinsic must be a constant int", CS); return; } } while (
false)
3985 CS)do { if (!(ElementSizeCI)) { CheckFailed("element size of the element-wise atomic memory "
"intrinsic must be a constant int", CS); return; } } while (
false)
;
3986 const APInt &ElementSizeVal = ElementSizeCI->getValue();
3987 Assert(ElementSizeVal.isPowerOf2(),do { if (!(ElementSizeVal.isPowerOf2())) { CheckFailed("element size of the element-wise atomic memory intrinsic "
"must be a power of 2", CS); return; } } while (false)
3988 "element size of the element-wise atomic memory intrinsic "do { if (!(ElementSizeVal.isPowerOf2())) { CheckFailed("element size of the element-wise atomic memory intrinsic "
"must be a power of 2", CS); return; } } while (false)
3989 "must be a power of 2",do { if (!(ElementSizeVal.isPowerOf2())) { CheckFailed("element size of the element-wise atomic memory intrinsic "
"must be a power of 2", CS); return; } } while (false)
3990 CS)do { if (!(ElementSizeVal.isPowerOf2())) { CheckFailed("element size of the element-wise atomic memory intrinsic "
"must be a power of 2", CS); return; } } while (false)
;
3991
3992 auto IsValidAlignment = [&](uint64_t Alignment) {
3993 return isPowerOf2_64(Alignment) && ElementSizeVal.ule(Alignment);
3994 };
3995
3996 uint64_t DstAlignment = CS.getParamAlignment(1),
3997 SrcAlignment = CS.getParamAlignment(2);
3998
3999 Assert(IsValidAlignment(DstAlignment),do { if (!(IsValidAlignment(DstAlignment))) { CheckFailed("incorrect alignment of the destination argument"
, CS); return; } } while (false)
4000 "incorrect alignment of the destination argument",do { if (!(IsValidAlignment(DstAlignment))) { CheckFailed("incorrect alignment of the destination argument"
, CS); return; } } while (false)
4001 CS)do { if (!(IsValidAlignment(DstAlignment))) { CheckFailed("incorrect alignment of the destination argument"
, CS); return; } } while (false)
;
4002 Assert(IsValidAlignment(SrcAlignment),do { if (!(IsValidAlignment(SrcAlignment))) { CheckFailed("incorrect alignment of the source argument"
, CS); return; } } while (false)
4003 "incorrect alignment of the source argument",do { if (!(IsValidAlignment(SrcAlignment))) { CheckFailed("incorrect alignment of the source argument"
, CS); return; } } while (false)
4004 CS)do { if (!(IsValidAlignment(SrcAlignment))) { CheckFailed("incorrect alignment of the source argument"
, CS); return; } } while (false)
;
4005 break;
4006 }
4007 case Intrinsic::gcroot:
4008 case Intrinsic::gcwrite:
4009 case Intrinsic::gcread:
4010 if (ID == Intrinsic::gcroot) {
4011 AllocaInst *AI =
4012 dyn_cast<AllocaInst>(CS.getArgOperand(0)->stripPointerCasts());
4013 Assert(AI, "llvm.gcroot parameter #1 must be an alloca.", CS)do { if (!(AI)) { CheckFailed("llvm.gcroot parameter #1 must be an alloca."
, CS); return; } } while (false)
;
4014 Assert(isa<Constant>(CS.getArgOperand(1)),do { if (!(isa<Constant>(CS.getArgOperand(1)))) { CheckFailed
("llvm.gcroot parameter #2 must be a constant.", CS); return;
} } while (false)
4015 "llvm.gcroot parameter #2 must be a constant.", CS)do { if (!(isa<Constant>(CS.getArgOperand(1)))) { CheckFailed
("llvm.gcroot parameter #2 must be a constant.", CS); return;
} } while (false)
;
4016 if (!AI->getAllocatedType()->isPointerTy()) {
4017 Assert(!isa<ConstantPointerNull>(CS.getArgOperand(1)),do { if (!(!isa<ConstantPointerNull>(CS.getArgOperand(1
)))) { CheckFailed("llvm.gcroot parameter #1 must either be a pointer alloca, "
"or argument #2 must be a non-null constant.", CS); return; }
} while (false)
4018 "llvm.gcroot parameter #1 must either be a pointer alloca, "do { if (!(!isa<ConstantPointerNull>(CS.getArgOperand(1
)))) { CheckFailed("llvm.gcroot parameter #1 must either be a pointer alloca, "
"or argument #2 must be a non-null constant.", CS); return; }
} while (false)
4019 "or argument #2 must be a non-null constant.",do { if (!(!isa<ConstantPointerNull>(CS.getArgOperand(1
)))) { CheckFailed("llvm.gcroot parameter #1 must either be a pointer alloca, "
"or argument #2 must be a non-null constant.", CS); return; }
} while (false)
4020 CS)do { if (!(!isa<ConstantPointerNull>(CS.getArgOperand(1
)))) { CheckFailed("llvm.gcroot parameter #1 must either be a pointer alloca, "
"or argument #2 must be a non-null constant.", CS); return; }
} while (false)
;
4021 }
4022 }
4023
4024 Assert(CS.getParent()->getParent()->hasGC(),do { if (!(CS.getParent()->getParent()->hasGC())) { CheckFailed
("Enclosing function does not use GC.", CS); return; } } while
(false)
4025 "Enclosing function does not use GC.", CS)do { if (!(CS.getParent()->getParent()->hasGC())) { CheckFailed
("Enclosing function does not use GC.", CS); return; } } while
(false)
;
4026 break;
4027 case Intrinsic::init_trampoline:
4028 Assert(isa<Function>(CS.getArgOperand(1)->stripPointerCasts()),do { if (!(isa<Function>(CS.getArgOperand(1)->stripPointerCasts
()))) { CheckFailed("llvm.init_trampoline parameter #2 must resolve to a function."
, CS); return; } } while (false)
4029 "llvm.init_trampoline parameter #2 must resolve to a function.",do { if (!(isa<Function>(CS.getArgOperand(1)->stripPointerCasts
()))) { CheckFailed("llvm.init_trampoline parameter #2 must resolve to a function."
, CS); return; } } while (false)
4030 CS)do { if (!(isa<Function>(CS.getArgOperand(1)->stripPointerCasts
()))) { CheckFailed("llvm.init_trampoline parameter #2 must resolve to a function."
, CS); return; } } while (false)
;
4031 break;
4032 case Intrinsic::prefetch:
4033 Assert(isa<ConstantInt>(CS.getArgOperand(1)) &&do { if (!(isa<ConstantInt>(CS.getArgOperand(1)) &&
isa<ConstantInt>(CS.getArgOperand(2)) && cast<
ConstantInt>(CS.getArgOperand(1))->getZExtValue() < 2
&& cast<ConstantInt>(CS.getArgOperand(2))->
getZExtValue() < 4)) { CheckFailed("invalid arguments to llvm.prefetch"
, CS); return; } } while (false)
4034 isa<ConstantInt>(CS.getArgOperand(2)) &&do { if (!(isa<ConstantInt>(CS.getArgOperand(1)) &&
isa<ConstantInt>(CS.getArgOperand(2)) && cast<
ConstantInt>(CS.getArgOperand(1))->getZExtValue() < 2
&& cast<ConstantInt>(CS.getArgOperand(2))->
getZExtValue() < 4)) { CheckFailed("invalid arguments to llvm.prefetch"
, CS); return; } } while (false)
4035 cast<ConstantInt>(CS.getArgOperand(1))->getZExtValue() < 2 &&do { if (!(isa<ConstantInt>(CS.getArgOperand(1)) &&
isa<ConstantInt>(CS.getArgOperand(2)) && cast<
ConstantInt>(CS.getArgOperand(1))->getZExtValue() < 2
&& cast<ConstantInt>(CS.getArgOperand(2))->
getZExtValue() < 4)) { CheckFailed("invalid arguments to llvm.prefetch"
, CS); return; } } while (false)
4036 cast<ConstantInt>(CS.getArgOperand(2))->getZExtValue() < 4,do { if (!(isa<ConstantInt>(CS.getArgOperand(1)) &&
isa<ConstantInt>(CS.getArgOperand(2)) && cast<
ConstantInt>(CS.getArgOperand(1))->getZExtValue() < 2
&& cast<ConstantInt>(CS.getArgOperand(2))->
getZExtValue() < 4)) { CheckFailed("invalid arguments to llvm.prefetch"
, CS); return; } } while (false)
4037 "invalid arguments to llvm.prefetch", CS)do { if (!(isa<ConstantInt>(CS.getArgOperand(1)) &&
isa<ConstantInt>(CS.getArgOperand(2)) && cast<
ConstantInt>(CS.getArgOperand(1))->getZExtValue() < 2
&& cast<ConstantInt>(CS.getArgOperand(2))->
getZExtValue() < 4)) { CheckFailed("invalid arguments to llvm.prefetch"
, CS); return; } } while (false)
;
4038 break;
4039 case Intrinsic::stackprotector:
4040 Assert(isa<AllocaInst>(CS.getArgOperand(1)->stripPointerCasts()),do { if (!(isa<AllocaInst>(CS.getArgOperand(1)->stripPointerCasts
()))) { CheckFailed("llvm.stackprotector parameter #2 must resolve to an alloca."
, CS); return; } } while (false)
4041 "llvm.stackprotector parameter #2 must resolve to an alloca.", CS)do { if (!(isa<AllocaInst>(CS.getArgOperand(1)->stripPointerCasts
()))) { CheckFailed("llvm.stackprotector parameter #2 must resolve to an alloca."
, CS); return; } } while (false)
;
4042 break;
4043 case Intrinsic::lifetime_start:
4044 case Intrinsic::lifetime_end:
4045 case Intrinsic::invariant_start:
4046 Assert(isa<ConstantInt>(CS.getArgOperand(0)),do { if (!(isa<ConstantInt>(CS.getArgOperand(0)))) { CheckFailed
("size argument of memory use markers must be a constant integer"
, CS); return; } } while (false)
4047 "size argument of memory use markers must be a constant integer",do { if (!(isa<ConstantInt>(CS.getArgOperand(0)))) { CheckFailed
("size argument of memory use markers must be a constant integer"
, CS); return; } } while (false)
4048 CS)do { if (!(isa<ConstantInt>(CS.getArgOperand(0)))) { CheckFailed
("size argument of memory use markers must be a constant integer"
, CS); return; } } while (false)
;
4049 break;
4050 case Intrinsic::invariant_end:
4051 Assert(isa<ConstantInt>(CS.getArgOperand(1)),do { if (!(isa<ConstantInt>(CS.getArgOperand(1)))) { CheckFailed
("llvm.invariant.end parameter #2 must be a constant integer"
, CS); return; } } while (false)
4052 "llvm.invariant.end parameter #2 must be a constant integer", CS)do { if (!(isa<ConstantInt>(CS.getArgOperand(1)))) { CheckFailed
("llvm.invariant.end parameter #2 must be a constant integer"
, CS); return; } } while (false)
;
4053 break;
4054
4055 case Intrinsic::localescape: {
4056 BasicBlock *BB = CS.getParent();
4057 Assert(BB == &BB->getParent()->front(),do { if (!(BB == &BB->getParent()->front())) { CheckFailed
("llvm.localescape used outside of entry block", CS); return;
} } while (false)
4058 "llvm.localescape used outside of entry block", CS)do { if (!(BB == &BB->getParent()->front())) { CheckFailed
("llvm.localescape used outside of entry block", CS); return;
} } while (false)
;
4059 Assert(!SawFrameEscape,do { if (!(!SawFrameEscape)) { CheckFailed("multiple calls to llvm.localescape in one function"
, CS); return; } } while (false)
4060 "multiple calls to llvm.localescape in one function", CS)do { if (!(!SawFrameEscape)) { CheckFailed("multiple calls to llvm.localescape in one function"
, CS); return; } } while (false)
;
4061 for (Value *Arg : CS.args()) {
4062 if (isa<ConstantPointerNull>(Arg))
4063 continue; // Null values are allowed as placeholders.
4064 auto *AI = dyn_cast<AllocaInst>(Arg->stripPointerCasts());
4065 Assert(AI && AI->isStaticAlloca(),do { if (!(AI && AI->isStaticAlloca())) { CheckFailed
("llvm.localescape only accepts static allocas", CS); return;
} } while (false)
4066 "llvm.localescape only accepts static allocas", CS)do { if (!(AI && AI->isStaticAlloca())) { CheckFailed
("llvm.localescape only accepts static allocas", CS); return;
} } while (false)
;
4067 }
4068 FrameEscapeInfo[BB->getParent()].first = CS.getNumArgOperands();
4069 SawFrameEscape = true;
4070 break;
4071 }
4072 case Intrinsic::localrecover: {
4073 Value *FnArg = CS.getArgOperand(0)->stripPointerCasts();
4074 Function *Fn = dyn_cast<Function>(FnArg);
4075 Assert(Fn && !Fn->isDeclaration(),do { if (!(Fn && !Fn->isDeclaration())) { CheckFailed
("llvm.localrecover first " "argument must be function defined in this module"
, CS); return; } } while (false)
4076 "llvm.localrecover first "do { if (!(Fn && !Fn->isDeclaration())) { CheckFailed
("llvm.localrecover first " "argument must be function defined in this module"
, CS); return; } } while (false)
4077 "argument must be function defined in this module",do { if (!(Fn && !Fn->isDeclaration())) { CheckFailed
("llvm.localrecover first " "argument must be function defined in this module"
, CS); return; } } while (false)
4078 CS)do { if (!(Fn && !Fn->isDeclaration())) { CheckFailed
("llvm.localrecover first " "argument must be function defined in this module"
, CS); return; } } while (false)
;
4079 auto *IdxArg = dyn_cast<ConstantInt>(CS.getArgOperand(2));
4080 Assert(IdxArg, "idx argument of llvm.localrecover must be a constant int",do { if (!(IdxArg)) { CheckFailed("idx argument of llvm.localrecover must be a constant int"
, CS); return; } } while (false)
4081 CS)do { if (!(IdxArg)) { CheckFailed("idx argument of llvm.localrecover must be a constant int"
, CS); return; } } while (false)
;
4082 auto &Entry = FrameEscapeInfo[Fn];
4083 Entry.second = unsigned(
4084 std::max(uint64_t(Entry.second), IdxArg->getLimitedValue(~0U) + 1));
4085 break;
4086 }
4087
4088 case Intrinsic::experimental_gc_statepoint:
4089 Assert(!CS.isInlineAsm(),do { if (!(!CS.isInlineAsm())) { CheckFailed("gc.statepoint support for inline assembly unimplemented"
, CS); return; } } while (false)
4090 "gc.statepoint support for inline assembly unimplemented", CS)do { if (!(!CS.isInlineAsm())) { CheckFailed("gc.statepoint support for inline assembly unimplemented"
, CS); return; } } while (false)
;
4091 Assert(CS.getParent()->getParent()->hasGC(),do { if (!(CS.getParent()->getParent()->hasGC())) { CheckFailed
("Enclosing function does not use GC.", CS); return; } } while
(false)
4092 "Enclosing function does not use GC.", CS)do { if (!(CS.getParent()->getParent()->hasGC())) { CheckFailed
("Enclosing function does not use GC.", CS); return; } } while
(false)
;
4093
4094 verifyStatepoint(CS);
4095 break;
4096 case Intrinsic::experimental_gc_result: {
4097 Assert(CS.getParent()->getParent()->hasGC(),do { if (!(CS.getParent()->getParent()->hasGC())) { CheckFailed
("Enclosing function does not use GC.", CS); return; } } while
(false)
4098 "Enclosing function does not use GC.", CS)do { if (!(CS.getParent()->getParent()->hasGC())) { CheckFailed
("Enclosing function does not use GC.", CS); return; } } while
(false)
;
4099 // Are we tied to a statepoint properly?
4100 CallSite StatepointCS(CS.getArgOperand(0));
4101 const Function *StatepointFn =
4102 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : nullptr;
4103 Assert(StatepointFn && StatepointFn->isDeclaration() &&do { if (!(StatepointFn && StatepointFn->isDeclaration
() && StatepointFn->getIntrinsicID() == Intrinsic::
experimental_gc_statepoint)) { CheckFailed("gc.result operand #1 must be from a statepoint"
, CS, CS.getArgOperand(0)); return; } } while (false)
4104 StatepointFn->getIntrinsicID() ==do { if (!(StatepointFn && StatepointFn->isDeclaration
() && StatepointFn->getIntrinsicID() == Intrinsic::
experimental_gc_statepoint)) { CheckFailed("gc.result operand #1 must be from a statepoint"
, CS, CS.getArgOperand(0)); return; } } while (false)
4105 Intrinsic::experimental_gc_statepoint,do { if (!(StatepointFn && StatepointFn->isDeclaration
() && StatepointFn->getIntrinsicID() == Intrinsic::
experimental_gc_statepoint)) { CheckFailed("gc.result operand #1 must be from a statepoint"
, CS, CS.getArgOperand(0)); return; } } while (false)
4106 "gc.result operand #1 must be from a statepoint", CS,do { if (!(StatepointFn && StatepointFn->isDeclaration
() && StatepointFn->getIntrinsicID() == Intrinsic::
experimental_gc_statepoint)) { CheckFailed("gc.result operand #1 must be from a statepoint"
, CS, CS.getArgOperand(0)); return; } } while (false)
4107 CS.getArgOperand(0))do { if (!(StatepointFn && StatepointFn->isDeclaration
() && StatepointFn->getIntrinsicID() == Intrinsic::
experimental_gc_statepoint)) { CheckFailed("gc.result operand #1 must be from a statepoint"
, CS, CS.getArgOperand(0)); return; } } while (false)
;
4108
4109 // Assert that result type matches wrapped callee.
4110 const Value *Target = StatepointCS.getArgument(2);
4111 auto *PT = cast<PointerType>(Target->getType());
4112 auto *TargetFuncType = cast<FunctionType>(PT->getElementType());
4113 Assert(CS.getType() == TargetFuncType->getReturnType(),do { if (!(CS.getType() == TargetFuncType->getReturnType()
)) { CheckFailed("gc.result result type does not match wrapped callee"
, CS); return; } } while (false)
4114 "gc.result result type does not match wrapped callee", CS)do { if (!(CS.getType() == TargetFuncType->getReturnType()
)) { CheckFailed("gc.result result type does not match wrapped callee"
, CS); return; } } while (false)
;
4115 break;
4116 }
4117 case Intrinsic::experimental_gc_relocate: {
4118 Assert(CS.getNumArgOperands() == 3, "wrong number of arguments", CS)do { if (!(CS.getNumArgOperands() == 3)) { CheckFailed("wrong number of arguments"
, CS); return; } } while (false)
;
4119
4120 Assert(isa<PointerType>(CS.getType()->getScalarType()),do { if (!(isa<PointerType>(CS.getType()->getScalarType
()))) { CheckFailed("gc.relocate must return a pointer or a vector of pointers"
, CS); return; } } while (false)
4121 "gc.relocate must return a pointer or a vector of pointers", CS)do { if (!(isa<PointerType>(CS.getType()->getScalarType
()))) { CheckFailed("gc.relocate must return a pointer or a vector of pointers"
, CS); return; } } while (false)
;
4122
4123 // Check that this relocate is correctly tied to the statepoint
4124
4125 // This is case for relocate on the unwinding path of an invoke statepoint
4126 if (LandingPadInst *LandingPad =
4127 dyn_cast<LandingPadInst>(CS.getArgOperand(0))) {
4128
4129 const BasicBlock *InvokeBB =
4130 LandingPad->getParent()->getUniquePredecessor();
4131
4132 // Landingpad relocates should have only one predecessor with invoke
4133 // statepoint terminator
4134 Assert(InvokeBB, "safepoints should have unique landingpads",do { if (!(InvokeBB)) { CheckFailed("safepoints should have unique landingpads"
, LandingPad->getParent()); return; } } while (false)
4135 LandingPad->getParent())do { if (!(InvokeBB)) { CheckFailed("safepoints should have unique landingpads"
, LandingPad->getParent()); return; } } while (false)
;
4136 Assert(InvokeBB->getTerminator(), "safepoint block should be well formed",do { if (!(InvokeBB->getTerminator())) { CheckFailed("safepoint block should be well formed"
, InvokeBB); return; } } while (false)
4137 InvokeBB)do { if (!(InvokeBB->getTerminator())) { CheckFailed("safepoint block should be well formed"
, InvokeBB); return; } } while (false)
;
4138 Assert(isStatepoint(InvokeBB->getTerminator()),do { if (!(isStatepoint(InvokeBB->getTerminator()))) { CheckFailed
("gc relocate should be linked to a statepoint", InvokeBB); return
; } } while (false)
4139 "gc relocate should be linked to a statepoint", InvokeBB)do { if (!(isStatepoint(InvokeBB->getTerminator()))) { CheckFailed
("gc relocate should be linked to a statepoint", InvokeBB); return
; } } while (false)
;
4140 }
4141 else {
4142 // In all other cases relocate should be tied to the statepoint directly.
4143 // This covers relocates on a normal return path of invoke statepoint and
4144 // relocates of a call statepoint.
4145 auto Token = CS.getArgOperand(0);
4146 Assert(isa<Instruction>(Token) && isStatepoint(cast<Instruction>(Token)),do { if (!(isa<Instruction>(Token) && isStatepoint
(cast<Instruction>(Token)))) { CheckFailed("gc relocate is incorrectly tied to the statepoint"
, CS, Token); return; } } while (false)
4147 "gc relocate is incorrectly tied to the statepoint", CS, Token)do { if (!(isa<Instruction>(Token) && isStatepoint
(cast<Instruction>(Token)))) { CheckFailed("gc relocate is incorrectly tied to the statepoint"
, CS, Token); return; } } while (false)
;
4148 }
4149
4150 // Verify rest of the relocate arguments.
4151
4152 ImmutableCallSite StatepointCS(
4153 cast<GCRelocateInst>(*CS.getInstruction()).getStatepoint());
4154
4155 // Both the base and derived must be piped through the safepoint.
4156 Value* Base = CS.getArgOperand(1);
4157 Assert(isa<ConstantInt>(Base),do { if (!(isa<ConstantInt>(Base))) { CheckFailed("gc.relocate operand #2 must be integer offset"
, CS); return; } } while (false)
4158 "gc.relocate operand #2 must be integer offset", CS)do { if (!(isa<ConstantInt>(Base))) { CheckFailed("gc.relocate operand #2 must be integer offset"
, CS); return; } } while (false)
;
4159
4160 Value* Derived = CS.getArgOperand(2);
4161 Assert(isa<ConstantInt>(Derived),do { if (!(isa<ConstantInt>(Derived))) { CheckFailed("gc.relocate operand #3 must be integer offset"
, CS); return; } } while (false)
4162 "gc.relocate operand #3 must be integer offset", CS)do { if (!(isa<ConstantInt>(Derived))) { CheckFailed("gc.relocate operand #3 must be integer offset"
, CS); return; } } while (false)
;
4163
4164 const int BaseIndex = cast<ConstantInt>(Base)->getZExtValue();
4165 const int DerivedIndex = cast<ConstantInt>(Derived)->getZExtValue();
4166 // Check the bounds
4167 Assert(0 <= BaseIndex && BaseIndex < (int)StatepointCS.arg_size(),do { if (!(0 <= BaseIndex && BaseIndex < (int)StatepointCS
.arg_size())) { CheckFailed("gc.relocate: statepoint base index out of bounds"
, CS); return; } } while (false)
4168 "gc.relocate: statepoint base index out of bounds", CS)do { if (!(0 <= BaseIndex && BaseIndex < (int)StatepointCS
.arg_size())) { CheckFailed("gc.relocate: statepoint base index out of bounds"
, CS); return; } } while (false)
;
4169 Assert(0 <= DerivedIndex && DerivedIndex < (int)StatepointCS.arg_size(),do { if (!(0 <= DerivedIndex && DerivedIndex < (
int)StatepointCS.arg_size())) { CheckFailed("gc.relocate: statepoint derived index out of bounds"
, CS); return; } } while (false)
4170 "gc.relocate: statepoint derived index out of bounds", CS)do { if (!(0 <= DerivedIndex && DerivedIndex < (
int)StatepointCS.arg_size())) { CheckFailed("gc.relocate: statepoint derived index out of bounds"
, CS); return; } } while (false)
;
4171
4172 // Check that BaseIndex and DerivedIndex fall within the 'gc parameters'
4173 // section of the statepoint's argument.
4174 Assert(StatepointCS.arg_size() > 0,do { if (!(StatepointCS.arg_size() > 0)) { CheckFailed("gc.statepoint: insufficient arguments"
); return; } } while (false)
4175 "gc.statepoint: insufficient arguments")do { if (!(StatepointCS.arg_size() > 0)) { CheckFailed("gc.statepoint: insufficient arguments"
); return; } } while (false)
;
4176 Assert(isa<ConstantInt>(StatepointCS.getArgument(3)),do { if (!(isa<ConstantInt>(StatepointCS.getArgument(3)
))) { CheckFailed("gc.statement: number of call arguments must be constant integer"
); return; } } while (false)
4177 "gc.statement: number of call arguments must be constant integer")do { if (!(isa<ConstantInt>(StatepointCS.getArgument(3)
))) { CheckFailed("gc.statement: number of call arguments must be constant integer"
); return; } } while (false)
;
4178 const unsigned NumCallArgs =
4179 cast<ConstantInt>(StatepointCS.getArgument(3))->getZExtValue();
4180 Assert(StatepointCS.arg_size() > NumCallArgs + 5,do { if (!(StatepointCS.arg_size() > NumCallArgs + 5)) { CheckFailed
("gc.statepoint: mismatch in number of call arguments"); return
; } } while (false)
4181 "gc.statepoint: mismatch in number of call arguments")do { if (!(StatepointCS.arg_size() > NumCallArgs + 5)) { CheckFailed
("gc.statepoint: mismatch in number of call arguments"); return
; } } while (false)
;
4182 Assert(isa<ConstantInt>(StatepointCS.getArgument(NumCallArgs + 5)),do { if (!(isa<ConstantInt>(StatepointCS.getArgument(NumCallArgs
+ 5)))) { CheckFailed("gc.statepoint: number of transition arguments must be "
"a constant integer"); return; } } while (false)
4183 "gc.statepoint: number of transition arguments must be "do { if (!(isa<ConstantInt>(StatepointCS.getArgument(NumCallArgs
+ 5)))) { CheckFailed("gc.statepoint: number of transition arguments must be "
"a constant integer"); return; } } while (false)
4184 "a constant integer")do { if (!(isa<ConstantInt>(StatepointCS.getArgument(NumCallArgs
+ 5)))) { CheckFailed("gc.statepoint: number of transition arguments must be "
"a constant integer"); return; } } while (false)
;
4185 const int NumTransitionArgs =
4186 cast<ConstantInt>(StatepointCS.getArgument(NumCallArgs + 5))
4187 ->getZExtValue();
4188 const int DeoptArgsStart = 4 + NumCallArgs + 1 + NumTransitionArgs + 1;
4189 Assert(isa<ConstantInt>(StatepointCS.getArgument(DeoptArgsStart)),do { if (!(isa<ConstantInt>(StatepointCS.getArgument(DeoptArgsStart
)))) { CheckFailed("gc.statepoint: number of deoptimization arguments must be "
"a constant integer"); return; } } while (false)
4190 "gc.statepoint: number of deoptimization arguments must be "do { if (!(isa<ConstantInt>(StatepointCS.getArgument(DeoptArgsStart
)))) { CheckFailed("gc.statepoint: number of deoptimization arguments must be "
"a constant integer"); return; } } while (false)
4191 "a constant integer")do { if (!(isa<ConstantInt>(StatepointCS.getArgument(DeoptArgsStart
)))) { CheckFailed("gc.statepoint: number of deoptimization arguments must be "
"a constant integer"); return; } } while (false)
;
4192 const int NumDeoptArgs =
4193 cast<ConstantInt>(StatepointCS.getArgument(DeoptArgsStart))
4194 ->getZExtValue();
4195 const int GCParamArgsStart = DeoptArgsStart + 1 + NumDeoptArgs;
4196 const int GCParamArgsEnd = StatepointCS.arg_size();
4197 Assert(GCParamArgsStart <= BaseIndex && BaseIndex < GCParamArgsEnd,do { if (!(GCParamArgsStart <= BaseIndex && BaseIndex
< GCParamArgsEnd)) { CheckFailed("gc.relocate: statepoint base index doesn't fall within the "
"'gc parameters' section of the statepoint call", CS); return
; } } while (false)
4198 "gc.relocate: statepoint base index doesn't fall within the "do { if (!(GCParamArgsStart <= BaseIndex && BaseIndex
< GCParamArgsEnd)) { CheckFailed("gc.relocate: statepoint base index doesn't fall within the "
"'gc parameters' section of the statepoint call", CS); return
; } } while (false)
4199 "'gc parameters' section of the statepoint call",do { if (!(GCParamArgsStart <= BaseIndex && BaseIndex
< GCParamArgsEnd)) { CheckFailed("gc.relocate: statepoint base index doesn't fall within the "
"'gc parameters' section of the statepoint call", CS); return
; } } while (false)
4200 CS)do { if (!(GCParamArgsStart <= BaseIndex && BaseIndex
< GCParamArgsEnd)) { CheckFailed("gc.relocate: statepoint base index doesn't fall within the "
"'gc parameters' section of the statepoint call", CS); return
; } } while (false)
;
4201 Assert(GCParamArgsStart <= DerivedIndex && DerivedIndex < GCParamArgsEnd,do { if (!(GCParamArgsStart <= DerivedIndex && DerivedIndex
< GCParamArgsEnd)) { CheckFailed("gc.relocate: statepoint derived index doesn't fall within the "
"'gc parameters' section of the statepoint call", CS); return
; } } while (false)
4202 "gc.relocate: statepoint derived index doesn't fall within the "do { if (!(GCParamArgsStart <= DerivedIndex && DerivedIndex
< GCParamArgsEnd)) { CheckFailed("gc.relocate: statepoint derived index doesn't fall within the "
"'gc parameters' section of the statepoint call", CS); return
; } } while (false)
4203 "'gc parameters' section of the statepoint call",do { if (!(GCParamArgsStart <= DerivedIndex && DerivedIndex
< GCParamArgsEnd)) { CheckFailed("gc.relocate: statepoint derived index doesn't fall within the "
"'gc parameters' section of the statepoint call", CS); return
; } } while (false)
4204 CS)do { if (!(GCParamArgsStart <= DerivedIndex && DerivedIndex
< GCParamArgsEnd)) { CheckFailed("gc.relocate: statepoint derived index doesn't fall within the "
"'gc parameters' section of the statepoint call", CS); return
; } } while (false)
;
4205
4206 // Relocated value must be either a pointer type or vector-of-pointer type,
4207 // but gc_relocate does not need to return the same pointer type as the
4208 // relocated pointer. It can be casted to the correct type later if it's
4209 // desired. However, they must have the same address space and 'vectorness'
4210 GCRelocateInst &Relocate = cast<GCRelocateInst>(*CS.getInstruction());
4211 Assert(Relocate.getDerivedPtr()->getType()->getScalarType()->isPointerTy(),do { if (!(Relocate.getDerivedPtr()->getType()->getScalarType
()->isPointerTy())) { CheckFailed("gc.relocate: relocated value must be a gc pointer"
, CS); return; } } while (false)
4212 "gc.relocate: relocated value must be a gc pointer", CS)do { if (!(Relocate.getDerivedPtr()->getType()->getScalarType
()->isPointerTy())) { CheckFailed("gc.relocate: relocated value must be a gc pointer"
, CS); return; } } while (false)
;
4213
4214 auto ResultType = CS.getType();
4215 auto DerivedType = Relocate.getDerivedPtr()->getType();
4216 Assert(ResultType->isVectorTy() == DerivedType->isVectorTy(),do { if (!(ResultType->isVectorTy() == DerivedType->isVectorTy
())) { CheckFailed("gc.relocate: vector relocates to vector and pointer to pointer"
, CS); return; } } while (false)
4217 "gc.relocate: vector relocates to vector and pointer to pointer",do { if (!(ResultType->isVectorTy() == DerivedType->isVectorTy
())) { CheckFailed("gc.relocate: vector relocates to vector and pointer to pointer"
, CS); return; } } while (false)
4218 CS)do { if (!(ResultType->isVectorTy() == DerivedType->isVectorTy
())) { CheckFailed("gc.relocate: vector relocates to vector and pointer to pointer"
, CS); return; } } while (false)
;
4219 Assert(do { if (!(ResultType->getPointerAddressSpace() == DerivedType
->getPointerAddressSpace())) { CheckFailed("gc.relocate: relocating a pointer shouldn't change its address space"
, CS); return; } } while (false)
4220 ResultType->getPointerAddressSpace() ==do { if (!(ResultType->getPointerAddressSpace() == DerivedType
->getPointerAddressSpace())) { CheckFailed("gc.relocate: relocating a pointer shouldn't change its address space"
, CS); return; } } while (false)
4221 DerivedType->getPointerAddressSpace(),do { if (!(ResultType->getPointerAddressSpace() == DerivedType
->getPointerAddressSpace())) { CheckFailed("gc.relocate: relocating a pointer shouldn't change its address space"
, CS); return; } } while (false)
4222 "gc.relocate: relocating a pointer shouldn't change its address space",do { if (!(ResultType->getPointerAddressSpace() == DerivedType
->getPointerAddressSpace())) { CheckFailed("gc.relocate: relocating a pointer shouldn't change its address space"
, CS); return; } } while (false)
4223 CS)do { if (!(ResultType->getPointerAddressSpace() == DerivedType
->getPointerAddressSpace())) { CheckFailed("gc.relocate: relocating a pointer shouldn't change its address space"
, CS); return; } } while (false)
;
4224 break;
4225 }
4226 case Intrinsic::eh_exceptioncode:
4227 case Intrinsic::eh_exceptionpointer: {
4228 Assert(isa<CatchPadInst>(CS.getArgOperand(0)),do { if (!(isa<CatchPadInst>(CS.getArgOperand(0)))) { CheckFailed
("eh.exceptionpointer argument must be a catchpad", CS); return
; } } while (false)
4229 "eh.exceptionpointer argument must be a catchpad", CS)do { if (!(isa<CatchPadInst>(CS.getArgOperand(0)))) { CheckFailed
("eh.exceptionpointer argument must be a catchpad", CS); return
; } } while (false)
;
4230 break;
4231 }
4232 case Intrinsic::masked_load: {
4233 Assert(CS.getType()->isVectorTy(), "masked_load: must return a vector", CS)do { if (!(CS.getType()->isVectorTy())) { CheckFailed("masked_load: must return a vector"
, CS); return; } } while (false)
;
4234
4235 Value *Ptr = CS.getArgOperand(0);
4236 //Value *Alignment = CS.getArgOperand(1);
4237 Value *Mask = CS.getArgOperand(2);
4238 Value *PassThru = CS.getArgOperand(3);
4239 Assert(Mask->getType()->isVectorTy(),do { if (!(Mask->getType()->isVectorTy())) { CheckFailed
("masked_load: mask must be vector", CS); return; } } while (
false)
4240 "masked_load: mask must be vector", CS)do { if (!(Mask->getType()->isVectorTy())) { CheckFailed
("masked_load: mask must be vector", CS); return; } } while (
false)
;
4241
4242 // DataTy is the overloaded type
4243 Type *DataTy = cast<PointerType>(Ptr->getType())->getElementType();
4244 Assert(DataTy == CS.getType(),do { if (!(DataTy == CS.getType())) { CheckFailed("masked_load: return must match pointer type"
, CS); return; } } while (false)
4245 "masked_load: return must match pointer type", CS)do { if (!(DataTy == CS.getType())) { CheckFailed("masked_load: return must match pointer type"
, CS); return; } } while (false)
;
4246 Assert(PassThru->getType() == DataTy,do { if (!(PassThru->getType() == DataTy)) { CheckFailed("masked_load: pass through and data type must match"
, CS); return; } } while (false)
4247 "masked_load: pass through and data type must match", CS)do { if (!(PassThru->getType() == DataTy)) { CheckFailed("masked_load: pass through and data type must match"
, CS); return; } } while (false)
;
4248 Assert(Mask->getType()->getVectorNumElements() ==do { if (!(Mask->getType()->getVectorNumElements() == DataTy
->getVectorNumElements())) { CheckFailed("masked_load: vector mask must be same length as data"
, CS); return; } } while (false)
4249 DataTy->getVectorNumElements(),do { if (!(Mask->getType()->getVectorNumElements() == DataTy
->getVectorNumElements())) { CheckFailed("masked_load: vector mask must be same length as data"
, CS); return; } } while (false)
4250 "masked_load: vector mask must be same length as data", CS)do { if (!(Mask->getType()->getVectorNumElements() == DataTy
->getVectorNumElements())) { CheckFailed("masked_load: vector mask must be same length as data"
, CS); return; } } while (false)
;
4251 break;
4252 }
4253 case Intrinsic::masked_store: {
4254 Value *Val = CS.getArgOperand(0);
4255 Value *Ptr = CS.getArgOperand(1);
4256 //Value *Alignment = CS.getArgOperand(2);
4257 Value *Mask = CS.getArgOperand(3);
4258 Assert(Mask->getType()->isVectorTy(),do { if (!(Mask->getType()->isVectorTy())) { CheckFailed
("masked_store: mask must be vector", CS); return; } } while (
false)
4259 "masked_store: mask must be vector", CS)do { if (!(Mask->getType()->isVectorTy())) { CheckFailed
("masked_store: mask must be vector", CS); return; } } while (
false)
;
4260
4261 // DataTy is the overloaded type
4262 Type *DataTy = cast<PointerType>(Ptr->getType())->getElementType();
4263 Assert(DataTy == Val->getType(),do { if (!(DataTy == Val->getType())) { CheckFailed("masked_store: storee must match pointer type"
, CS); return; } } while (false)
4264 "masked_store: storee must match pointer type", CS)do { if (!(DataTy == Val->getType())) { CheckFailed("masked_store: storee must match pointer type"
, CS); return; } } while (false)
;
4265 Assert(Mask->getType()->getVectorNumElements() ==do { if (!(Mask->getType()->getVectorNumElements() == DataTy
->getVectorNumElements())) { CheckFailed("masked_store: vector mask must be same length as data"
, CS); return; } } while (false)
4266 DataTy->getVectorNumElements(),do { if (!(Mask->getType()->getVectorNumElements() == DataTy
->getVectorNumElements())) { CheckFailed("masked_store: vector mask must be same length as data"
, CS); return; } } while (false)
4267 "masked_store: vector mask must be same length as data", CS)do { if (!(Mask->getType()->getVectorNumElements() == DataTy
->getVectorNumElements())) { CheckFailed("masked_store: vector mask must be same length as data"
, CS); return; } } while (false)
;
4268 break;
4269 }
4270
4271 case Intrinsic::experimental_guard: {
4272 Assert(CS.isCall(), "experimental_guard cannot be invoked", CS)do { if (!(CS.isCall())) { CheckFailed("experimental_guard cannot be invoked"
, CS); return; } } while (false)
;
4273 Assert(CS.countOperandBundlesOfType(LLVMContext::OB_deopt) == 1,do { if (!(CS.countOperandBundlesOfType(LLVMContext::OB_deopt
) == 1)) { CheckFailed("experimental_guard must have exactly one "
"\"deopt\" operand bundle"); return; } } while (false)
4274 "experimental_guard must have exactly one "do { if (!(CS.countOperandBundlesOfType(LLVMContext::OB_deopt
) == 1)) { CheckFailed("experimental_guard must have exactly one "
"\"deopt\" operand bundle"); return; } } while (false)
4275 "\"deopt\" operand bundle")do { if (!(CS.countOperandBundlesOfType(LLVMContext::OB_deopt
) == 1)) { CheckFailed("experimental_guard must have exactly one "
"\"deopt\" operand bundle"); return; } } while (false)
;
4276 break;
4277 }
4278
4279 case Intrinsic::experimental_deoptimize: {
4280 Assert(CS.isCall(), "experimental_deoptimize cannot be invoked", CS)do { if (!(CS.isCall())) { CheckFailed("experimental_deoptimize cannot be invoked"
, CS); return; } } while (false)
;
4281 Assert(CS.countOperandBundlesOfType(LLVMContext::OB_deopt) == 1,do { if (!(CS.countOperandBundlesOfType(LLVMContext::OB_deopt
) == 1)) { CheckFailed("experimental_deoptimize must have exactly one "
"\"deopt\" operand bundle"); return; } } while (false)
4282 "experimental_deoptimize must have exactly one "do { if (!(CS.countOperandBundlesOfType(LLVMContext::OB_deopt
) == 1)) { CheckFailed("experimental_deoptimize must have exactly one "
"\"deopt\" operand bundle"); return; } } while (false)
4283 "\"deopt\" operand bundle")do { if (!(CS.countOperandBundlesOfType(LLVMContext::OB_deopt
) == 1)) { CheckFailed("experimental_deoptimize must have exactly one "
"\"deopt\" operand bundle"); return; } } while (false)
;
4284 Assert(CS.getType() == CS.getInstruction()->getFunction()->getReturnType(),do { if (!(CS.getType() == CS.getInstruction()->getFunction
()->getReturnType())) { CheckFailed("experimental_deoptimize return type must match caller return type"
); return; } } while (false)
4285 "experimental_deoptimize return type must match caller return type")do { if (!(CS.getType() == CS.getInstruction()->getFunction
()->getReturnType())) { CheckFailed("experimental_deoptimize return type must match caller return type"
); return; } } while (false)
;
4286
4287 if (CS.isCall()) {
4288 auto *DeoptCI = CS.getInstruction();
4289 auto *RI = dyn_cast<ReturnInst>(DeoptCI->getNextNode());
4290 Assert(RI,do { if (!(RI)) { CheckFailed("calls to experimental_deoptimize must be followed by a return"
); return; } } while (false)
4291 "calls to experimental_deoptimize must be followed by a return")do { if (!(RI)) { CheckFailed("calls to experimental_deoptimize must be followed by a return"
); return; } } while (false)
;
4292
4293 if (!CS.getType()->isVoidTy() && RI)
4294 Assert(RI->getReturnValue() == DeoptCI,do { if (!(RI->getReturnValue() == DeoptCI)) { CheckFailed
("calls to experimental_deoptimize must be followed by a return "
"of the value computed by experimental_deoptimize"); return;
} } while (false)
4295 "calls to experimental_deoptimize must be followed by a return "do { if (!(RI->getReturnValue() == DeoptCI)) { CheckFailed
("calls to experimental_deoptimize must be followed by a return "
"of the value computed by experimental_deoptimize"); return;
} } while (false)
4296 "of the value computed by experimental_deoptimize")do { if (!(RI->getReturnValue() == DeoptCI)) { CheckFailed
("calls to experimental_deoptimize must be followed by a return "
"of the value computed by experimental_deoptimize"); return;
} } while (false)
;
4297 }
4298
4299 break;
4300 }
4301 };
4302}
4303
4304/// \brief Carefully grab the subprogram from a local scope.
4305///
4306/// This carefully grabs the subprogram from a local scope, avoiding the
4307/// built-in assertions that would typically fire.
4308static DISubprogram *getSubprogram(Metadata *LocalScope) {
4309 if (!LocalScope)
4310 return nullptr;
4311
4312 if (auto *SP = dyn_cast<DISubprogram>(LocalScope))
4313 return SP;
4314
4315 if (auto *LB = dyn_cast<DILexicalBlockBase>(LocalScope))
4316 return getSubprogram(LB->getRawScope());
4317
4318 // Just return null; broken scope chains are checked elsewhere.
4319 assert(!isa<DILocalScope>(LocalScope) && "Unknown type of local scope")((!isa<DILocalScope>(LocalScope) && "Unknown type of local scope"
) ? static_cast<void> (0) : __assert_fail ("!isa<DILocalScope>(LocalScope) && \"Unknown type of local scope\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 4319, __PRETTY_FUNCTION__))
;
4320 return nullptr;
4321}
4322
4323void Verifier::visitConstrainedFPIntrinsic(ConstrainedFPIntrinsic &FPI) {
4324 Assert(isa<MetadataAsValue>(FPI.getOperand(2)),do { if (!(isa<MetadataAsValue>(FPI.getOperand(2)))) { CheckFailed
("invalid rounding mode argument", &FPI); return; } } while
(false)
4325 "invalid rounding mode argument", &FPI)do { if (!(isa<MetadataAsValue>(FPI.getOperand(2)))) { CheckFailed
("invalid rounding mode argument", &FPI); return; } } while
(false)
;
4326 Assert(FPI.getRoundingMode() != ConstrainedFPIntrinsic::rmInvalid,do { if (!(FPI.getRoundingMode() != ConstrainedFPIntrinsic::rmInvalid
)) { CheckFailed("invalid rounding mode argument", &FPI);
return; } } while (false)
4327 "invalid rounding mode argument", &FPI)do { if (!(FPI.getRoundingMode() != ConstrainedFPIntrinsic::rmInvalid
)) { CheckFailed("invalid rounding mode argument", &FPI);
return; } } while (false)
;
4328 Assert(FPI.getExceptionBehavior() != ConstrainedFPIntrinsic::ebInvalid,do { if (!(FPI.getExceptionBehavior() != ConstrainedFPIntrinsic
::ebInvalid)) { CheckFailed("invalid exception behavior argument"
, &FPI); return; } } while (false)
4329 "invalid exception behavior argument", &FPI)do { if (!(FPI.getExceptionBehavior() != ConstrainedFPIntrinsic
::ebInvalid)) { CheckFailed("invalid exception behavior argument"
, &FPI); return; } } while (false)
;
4330}
4331
4332template <class DbgIntrinsicTy>
4333void Verifier::visitDbgIntrinsic(StringRef Kind, DbgIntrinsicTy &DII) {
4334 auto *MD = cast<MetadataAsValue>(DII.getArgOperand(0))->getMetadata();
4335 AssertDI(isa<ValueAsMetadata>(MD) ||do { if (!(isa<ValueAsMetadata>(MD) || (isa<MDNode>
(MD) && !cast<MDNode>(MD)->getNumOperands())
)) { DebugInfoCheckFailed("invalid llvm.dbg." + Kind + " intrinsic address/value"
, &DII, MD); return; } } while (false)
4336 (isa<MDNode>(MD) && !cast<MDNode>(MD)->getNumOperands()),do { if (!(isa<ValueAsMetadata>(MD) || (isa<MDNode>
(MD) && !cast<MDNode>(MD)->getNumOperands())
)) { DebugInfoCheckFailed("invalid llvm.dbg." + Kind + " intrinsic address/value"
, &DII, MD); return; } } while (false)
4337 "invalid llvm.dbg." + Kind + " intrinsic address/value", &DII, MD)do { if (!(isa<ValueAsMetadata>(MD) || (isa<MDNode>
(MD) && !cast<MDNode>(MD)->getNumOperands())
)) { DebugInfoCheckFailed("invalid llvm.dbg." + Kind + " intrinsic address/value"
, &DII, MD); return; } } while (false)
;
4338 AssertDI(isa<DILocalVariable>(DII.getRawVariable()),do { if (!(isa<DILocalVariable>(DII.getRawVariable())))
{ DebugInfoCheckFailed("invalid llvm.dbg." + Kind + " intrinsic variable"
, &DII, DII.getRawVariable()); return; } } while (false)
4339 "invalid llvm.dbg." + Kind + " intrinsic variable", &DII,do { if (!(isa<DILocalVariable>(DII.getRawVariable())))
{ DebugInfoCheckFailed("invalid llvm.dbg." + Kind + " intrinsic variable"
, &DII, DII.getRawVariable()); return; } } while (false)
4340 DII.getRawVariable())do { if (!(isa<DILocalVariable>(DII.getRawVariable())))
{ DebugInfoCheckFailed("invalid llvm.dbg." + Kind + " intrinsic variable"
, &DII, DII.getRawVariable()); return; } } while (false)
;
4341 AssertDI(isa<DIExpression>(DII.getRawExpression()),do { if (!(isa<DIExpression>(DII.getRawExpression()))) {
DebugInfoCheckFailed("invalid llvm.dbg." + Kind + " intrinsic expression"
, &DII, DII.getRawExpression()); return; } } while (false
)
4342 "invalid llvm.dbg." + Kind + " intrinsic expression", &DII,do { if (!(isa<DIExpression>(DII.getRawExpression()))) {
DebugInfoCheckFailed("invalid llvm.dbg." + Kind + " intrinsic expression"
, &DII, DII.getRawExpression()); return; } } while (false
)
4343 DII.getRawExpression())do { if (!(isa<DIExpression>(DII.getRawExpression()))) {
DebugInfoCheckFailed("invalid llvm.dbg." + Kind + " intrinsic expression"
, &DII, DII.getRawExpression()); return; } } while (false
)
;
4344
4345 // Ignore broken !dbg attachments; they're checked elsewhere.
4346 if (MDNode *N = DII.getDebugLoc().getAsMDNode())
4347 if (!isa<DILocation>(N))
4348 return;
4349
4350 BasicBlock *BB = DII.getParent();
4351 Function *F = BB ? BB->getParent() : nullptr;
4352
4353 // The scopes for variables and !dbg attachments must agree.
4354 DILocalVariable *Var = DII.getVariable();
4355 DILocation *Loc = DII.getDebugLoc();
4356 Assert(Loc, "llvm.dbg." + Kind + " intrinsic requires a !dbg attachment",do { if (!(Loc)) { CheckFailed("llvm.dbg." + Kind + " intrinsic requires a !dbg attachment"
, &DII, BB, F); return; } } while (false)
4357 &DII, BB, F)do { if (!(Loc)) { CheckFailed("llvm.dbg." + Kind + " intrinsic requires a !dbg attachment"
, &DII, BB, F); return; } } while (false)
;
4358
4359 DISubprogram *VarSP = getSubprogram(Var->getRawScope());
4360 DISubprogram *LocSP = getSubprogram(Loc->getRawScope());
4361 if (!VarSP || !LocSP)
4362 return; // Broken scope chains are checked elsewhere.
4363
4364 AssertDI(VarSP == LocSP, "mismatched subprogram between llvm.dbg." + Kind +do { if (!(VarSP == LocSP)) { DebugInfoCheckFailed("mismatched subprogram between llvm.dbg."
+ Kind + " variable and !dbg attachment", &DII, BB, F, Var
, Var->getScope()->getSubprogram(), Loc, Loc->getScope
()->getSubprogram()); return; } } while (false)
4365 " variable and !dbg attachment",do { if (!(VarSP == LocSP)) { DebugInfoCheckFailed("mismatched subprogram between llvm.dbg."
+ Kind + " variable and !dbg attachment", &DII, BB, F, Var
, Var->getScope()->getSubprogram(), Loc, Loc->getScope
()->getSubprogram()); return; } } while (false)
4366 &DII, BB, F, Var, Var->getScope()->getSubprogram(), Loc,do { if (!(VarSP == LocSP)) { DebugInfoCheckFailed("mismatched subprogram between llvm.dbg."
+ Kind + " variable and !dbg attachment", &DII, BB, F, Var
, Var->getScope()->getSubprogram(), Loc, Loc->getScope
()->getSubprogram()); return; } } while (false)
4367 Loc->getScope()->getSubprogram())do { if (!(VarSP == LocSP)) { DebugInfoCheckFailed("mismatched subprogram between llvm.dbg."
+ Kind + " variable and !dbg attachment", &DII, BB, F, Var
, Var->getScope()->getSubprogram(), Loc, Loc->getScope
()->getSubprogram()); return; } } while (false)
;
4368
4369 verifyFnArgs(DII);
4370}
4371
4372static uint64_t getVariableSize(const DILocalVariable &V) {
4373 // Be careful of broken types (checked elsewhere).
4374 const Metadata *RawType = V.getRawType();
4375 while (RawType) {
4376 // Try to get the size directly.
4377 if (auto *T = dyn_cast<DIType>(RawType))
4378 if (uint64_t Size = T->getSizeInBits())
4379 return Size;
4380
4381 if (auto *DT = dyn_cast<DIDerivedType>(RawType)) {
4382 // Look at the base type.
4383 RawType = DT->getRawBaseType();
4384 continue;
4385 }
4386
4387 // Missing type or size.
4388 break;
4389 }
4390
4391 // Fail gracefully.
4392 return 0;
4393}
4394
4395void Verifier::verifyFragmentExpression(const DbgInfoIntrinsic &I) {
4396 DILocalVariable *V;
4397 DIExpression *E;
4398 if (auto *DVI = dyn_cast<DbgValueInst>(&I)) {
4399 V = dyn_cast_or_null<DILocalVariable>(DVI->getRawVariable());
4400 E = dyn_cast_or_null<DIExpression>(DVI->getRawExpression());
4401 } else {
4402 auto *DDI = cast<DbgDeclareInst>(&I);
4403 V = dyn_cast_or_null<DILocalVariable>(DDI->getRawVariable());
4404 E = dyn_cast_or_null<DIExpression>(DDI->getRawExpression());
4405 }
4406
4407 // We don't know whether this intrinsic verified correctly.
4408 if (!V || !E || !E->isValid())
4409 return;
4410
4411 // Nothing to do if this isn't a bit piece expression.
4412 auto Fragment = E->getFragmentInfo();
4413 if (!Fragment)
4414 return;
4415
4416 // The frontend helps out GDB by emitting the members of local anonymous
4417 // unions as artificial local variables with shared storage. When SROA splits
4418 // the storage for artificial local variables that are smaller than the entire
4419 // union, the overhang piece will be outside of the allotted space for the
4420 // variable and this check fails.
4421 // FIXME: Remove this check as soon as clang stops doing this; it hides bugs.
4422 if (V->isArtificial())
4423 return;
4424
4425 // If there's no size, the type is broken, but that should be checked
4426 // elsewhere.
4427 uint64_t VarSize = getVariableSize(*V);
4428 if (!VarSize)
4429 return;
4430
4431 unsigned FragSize = Fragment->SizeInBits;
4432 unsigned FragOffset = Fragment->OffsetInBits;
4433 AssertDI(FragSize + FragOffset <= VarSize,do { if (!(FragSize + FragOffset <= VarSize)) { DebugInfoCheckFailed
("fragment is larger than or outside of variable", &I, V,
E); return; } } while (false)
4434 "fragment is larger than or outside of variable", &I, V, E)do { if (!(FragSize + FragOffset <= VarSize)) { DebugInfoCheckFailed
("fragment is larger than or outside of variable", &I, V,
E); return; } } while (false)
;
4435 AssertDI(FragSize != VarSize, "fragment covers entire variable", &I, V, E)do { if (!(FragSize != VarSize)) { DebugInfoCheckFailed("fragment covers entire variable"
, &I, V, E); return; } } while (false)
;
4436}
4437
4438void Verifier::verifyFnArgs(const DbgInfoIntrinsic &I) {
4439 // This function does not take the scope of noninlined function arguments into
4440 // account. Don't run it if current function is nodebug, because it may
4441 // contain inlined debug intrinsics.
4442 if (!HasDebugInfo)
4443 return;
4444
4445 DILocalVariable *Var;
4446 if (auto *DV = dyn_cast<DbgValueInst>(&I)) {
4447 // For performance reasons only check non-inlined ones.
4448 if (DV->getDebugLoc()->getInlinedAt())
4449 return;
4450 Var = DV->getVariable();
4451 } else {
4452 auto *DD = cast<DbgDeclareInst>(&I);
4453 if (DD->getDebugLoc()->getInlinedAt())
4454 return;
4455 Var = DD->getVariable();
4456 }
4457 AssertDI(Var, "dbg intrinsic without variable")do { if (!(Var)) { DebugInfoCheckFailed("dbg intrinsic without variable"
); return; } } while (false)
;
4458
4459 unsigned ArgNo = Var->getArg();
4460 if (!ArgNo)
4461 return;
4462
4463 // Verify there are no duplicate function argument debug info entries.
4464 // These will cause hard-to-debug assertions in the DWARF backend.
4465 if (DebugFnArgs.size() < ArgNo)
4466 DebugFnArgs.resize(ArgNo, nullptr);
4467
4468 auto *Prev = DebugFnArgs[ArgNo - 1];
4469 DebugFnArgs[ArgNo - 1] = Var;
4470 AssertDI(!Prev || (Prev == Var), "conflicting debug info for argument", &I,do { if (!(!Prev || (Prev == Var))) { DebugInfoCheckFailed("conflicting debug info for argument"
, &I, Prev, Var); return; } } while (false)
4471 Prev, Var)do { if (!(!Prev || (Prev == Var))) { DebugInfoCheckFailed("conflicting debug info for argument"
, &I, Prev, Var); return; } } while (false)
;
4472}
4473
4474void Verifier::verifyCompileUnits() {
4475 auto *CUs = M.getNamedMetadata("llvm.dbg.cu");
4476 SmallPtrSet<const Metadata *, 2> Listed;
4477 if (CUs)
4478 Listed.insert(CUs->op_begin(), CUs->op_end());
4479 for (auto *CU : CUVisited)
4480 AssertDI(Listed.count(CU), "DICompileUnit not listed in llvm.dbg.cu", CU)do { if (!(Listed.count(CU))) { DebugInfoCheckFailed("DICompileUnit not listed in llvm.dbg.cu"
, CU); return; } } while (false)
;
4481 CUVisited.clear();
4482}
4483
4484void Verifier::verifyDeoptimizeCallingConvs() {
4485 if (DeoptimizeDeclarations.empty())
4486 return;
4487
4488 const Function *First = DeoptimizeDeclarations[0];
4489 for (auto *F : makeArrayRef(DeoptimizeDeclarations).slice(1)) {
4490 Assert(First->getCallingConv() == F->getCallingConv(),do { if (!(First->getCallingConv() == F->getCallingConv
())) { CheckFailed("All llvm.experimental.deoptimize declarations must have the same "
"calling convention", First, F); return; } } while (false)
4491 "All llvm.experimental.deoptimize declarations must have the same "do { if (!(First->getCallingConv() == F->getCallingConv
())) { CheckFailed("All llvm.experimental.deoptimize declarations must have the same "
"calling convention", First, F); return; } } while (false)
4492 "calling convention",do { if (!(First->getCallingConv() == F->getCallingConv
())) { CheckFailed("All llvm.experimental.deoptimize declarations must have the same "
"calling convention", First, F); return; } } while (false)
4493 First, F)do { if (!(First->getCallingConv() == F->getCallingConv
())) { CheckFailed("All llvm.experimental.deoptimize declarations must have the same "
"calling convention", First, F); return; } } while (false)
;
4494 }
4495}
4496
4497//===----------------------------------------------------------------------===//
4498// Implement the public interfaces to this file...
4499//===----------------------------------------------------------------------===//
4500
4501bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
4502 Function &F = const_cast<Function &>(f);
4503
4504 // Don't use a raw_null_ostream. Printing IR is expensive.
4505 Verifier V(OS, /*ShouldTreatBrokenDebugInfoAsError=*/true, *f.getParent());
4506
4507 // Note that this function's return value is inverted from what you would
4508 // expect of a function called "verify".
4509 return !V.verify(F);
4510}
4511
4512bool llvm::verifyModule(const Module &M, raw_ostream *OS,
4513 bool *BrokenDebugInfo) {
4514 // Don't use a raw_null_ostream. Printing IR is expensive.
4515 Verifier V(OS, /*ShouldTreatBrokenDebugInfoAsError=*/!BrokenDebugInfo, M);
4516
4517 bool Broken = false;
4518 for (const Function &F : M)
4519 Broken |= !V.verify(F);
4520
4521 Broken |= !V.verify();
4522 if (BrokenDebugInfo)
4523 *BrokenDebugInfo = V.hasBrokenDebugInfo();
4524 // Note that this function's return value is inverted from what you would
4525 // expect of a function called "verify".
4526 return Broken;
4527}
4528
4529namespace {
4530
4531struct VerifierLegacyPass : public FunctionPass {
4532 static char ID;
4533
4534 std::unique_ptr<Verifier> V;
4535 bool FatalErrors = true;
4536
4537 VerifierLegacyPass() : FunctionPass(ID) {
4538 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
4539 }
4540 explicit VerifierLegacyPass(bool FatalErrors)
4541 : FunctionPass(ID),
4542 FatalErrors(FatalErrors) {
4543 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
4544 }
4545
4546 bool doInitialization(Module &M) override {
4547 V = llvm::make_unique<Verifier>(
4548 &dbgs(), /*ShouldTreatBrokenDebugInfoAsError=*/false, M);
4549 return false;
4550 }
4551
4552 bool runOnFunction(Function &F) override {
4553 if (!V->verify(F) && FatalErrors)
4554 report_fatal_error("Broken function found, compilation aborted!");
4555
4556 return false;
4557 }
4558
4559 bool doFinalization(Module &M) override {
4560 bool HasErrors = false;
4561 for (Function &F : M)
4562 if (F.isDeclaration())
4563 HasErrors |= !V->verify(F);
4564
4565 HasErrors |= !V->verify();
4566 if (FatalErrors) {
4567 if (HasErrors)
4568 report_fatal_error("Broken module found, compilation aborted!");
4569 assert(!V->hasBrokenDebugInfo() && "Module contains invalid debug info")((!V->hasBrokenDebugInfo() && "Module contains invalid debug info"
) ? static_cast<void> (0) : __assert_fail ("!V->hasBrokenDebugInfo() && \"Module contains invalid debug info\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 4569, __PRETTY_FUNCTION__))
;
4570 }
4571
4572 // Strip broken debug info.
4573 if (V->hasBrokenDebugInfo()) {
4574 DiagnosticInfoIgnoringInvalidDebugMetadata DiagInvalid(M);
4575 M.getContext().diagnose(DiagInvalid);
4576 if (!StripDebugInfo(M))
4577 report_fatal_error("Failed to strip malformed debug info");
4578 }
4579 return false;
4580 }
4581
4582 void getAnalysisUsage(AnalysisUsage &AU) const override {
4583 AU.setPreservesAll();
4584 }
4585};
4586
4587} // end anonymous namespace
4588
4589/// Helper to issue failure from the TBAA verification
4590template <typename... Tys> void TBAAVerifier::CheckFailed(Tys &&... Args) {
4591 if (Diagnostic)
4592 return Diagnostic->CheckFailed(Args...);
4593}
4594
4595#define AssertTBAA(C, ...)do { if (!(C)) { CheckFailed(...); return false; } } while (false
)
\
4596 do { \
4597 if (!(C)) { \
4598 CheckFailed(__VA_ARGS__); \
4599 return false; \
4600 } \
4601 } while (false)
4602
4603/// Verify that \p BaseNode can be used as the "base type" in the struct-path
4604/// TBAA scheme. This means \p BaseNode is either a scalar node, or a
4605/// struct-type node describing an aggregate data structure (like a struct).
4606TBAAVerifier::TBAABaseNodeSummary
4607TBAAVerifier::verifyTBAABaseNode(Instruction &I, const MDNode *BaseNode) {
4608 if (BaseNode->getNumOperands() < 2) {
4609 CheckFailed("Base nodes must have at least two operands", &I, BaseNode);
4610 return {true, ~0u};
4611 }
4612
4613 auto Itr = TBAABaseNodes.find(BaseNode);
4614 if (Itr != TBAABaseNodes.end())
4615 return Itr->second;
4616
4617 auto Result = verifyTBAABaseNodeImpl(I, BaseNode);
4618 auto InsertResult = TBAABaseNodes.insert({BaseNode, Result});
4619 (void)InsertResult;
4620 assert(InsertResult.second && "We just checked!")((InsertResult.second && "We just checked!") ? static_cast
<void> (0) : __assert_fail ("InsertResult.second && \"We just checked!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 4620, __PRETTY_FUNCTION__))
;
4621 return Result;
4622}
4623
4624TBAAVerifier::TBAABaseNodeSummary
4625TBAAVerifier::verifyTBAABaseNodeImpl(Instruction &I, const MDNode *BaseNode) {
4626 const TBAAVerifier::TBAABaseNodeSummary InvalidNode = {true, ~0u};
4627
4628 if (BaseNode->getNumOperands() == 2) {
4629 // Scalar nodes can only be accessed at offset 0.
4630 return isValidScalarTBAANode(BaseNode)
4631 ? TBAAVerifier::TBAABaseNodeSummary({false, 0})
4632 : InvalidNode;
4633 }
4634
4635 if (BaseNode->getNumOperands() % 2 != 1) {
4636 CheckFailed("Struct tag nodes must have an odd number of operands!",
4637 BaseNode);
4638 return InvalidNode;
4639 }
4640
4641 if (!isa<MDString>(BaseNode->getOperand(0))) {
4642 CheckFailed("Struct tag nodes have a string as their first operand",
4643 BaseNode);
4644 return InvalidNode;
4645 }
4646
4647 bool Failed = false;
4648
4649 Optional<APInt> PrevOffset;
4650 unsigned BitWidth = ~0u;
4651
4652 // We've already checked that BaseNode is not a degenerate root node with one
4653 // operand in \c verifyTBAABaseNode, so this loop should run at least once.
4654 for (unsigned Idx = 1; Idx < BaseNode->getNumOperands(); Idx += 2) {
4655 const MDOperand &FieldTy = BaseNode->getOperand(Idx);
4656 const MDOperand &FieldOffset = BaseNode->getOperand(Idx + 1);
4657 if (!isa<MDNode>(FieldTy)) {
4658 CheckFailed("Incorrect field entry in struct type node!", &I, BaseNode);
4659 Failed = true;
4660 continue;
4661 }
4662
4663 auto *OffsetEntryCI =
4664 mdconst::dyn_extract_or_null<ConstantInt>(FieldOffset);
4665 if (!OffsetEntryCI) {
4666 CheckFailed("Offset entries must be constants!", &I, BaseNode);
4667 Failed = true;
4668 continue;
4669 }
4670
4671 if (BitWidth == ~0u)
4672 BitWidth = OffsetEntryCI->getBitWidth();
4673
4674 if (OffsetEntryCI->getBitWidth() != BitWidth) {
4675 CheckFailed(
4676 "Bitwidth between the offsets and struct type entries must match", &I,
4677 BaseNode);
4678 Failed = true;
4679 continue;
4680 }
4681
4682 // NB! As far as I can tell, we generate a non-strictly increasing offset
4683 // sequence only from structs that have zero size bit fields. When
4684 // recursing into a contained struct in \c getFieldNodeFromTBAABaseNode we
4685 // pick the field lexically the latest in struct type metadata node. This
4686 // mirrors the actual behavior of the alias analysis implementation.
4687 bool IsAscending =
4688 !PrevOffset || PrevOffset->ule(OffsetEntryCI->getValue());
4689
4690 if (!IsAscending) {
4691 CheckFailed("Offsets must be increasing!", &I, BaseNode);
4692 Failed = true;
4693 }
4694
4695 PrevOffset = OffsetEntryCI->getValue();
4696 }
4697
4698 return Failed ? InvalidNode
4699 : TBAAVerifier::TBAABaseNodeSummary(false, BitWidth);
4700}
4701
4702static bool IsRootTBAANode(const MDNode *MD) {
4703 return MD->getNumOperands() < 2;
4704}
4705
4706static bool IsScalarTBAANodeImpl(const MDNode *MD,
4707 SmallPtrSetImpl<const MDNode *> &Visited) {
4708 if (MD->getNumOperands() != 2 && MD->getNumOperands() != 3)
4709 return false;
4710
4711 if (!isa<MDString>(MD->getOperand(0)))
4712 return false;
4713
4714 if (MD->getNumOperands() == 3) {
4715 auto *Offset = mdconst::dyn_extract<ConstantInt>(MD->getOperand(2));
4716 if (!(Offset && Offset->isZero() && isa<MDString>(MD->getOperand(0))))
4717 return false;
4718 }
4719
4720 auto *Parent = dyn_cast_or_null<MDNode>(MD->getOperand(1));
4721 return Parent && Visited.insert(Parent).second &&
4722 (IsRootTBAANode(Parent) || IsScalarTBAANodeImpl(Parent, Visited));
4723}
4724
4725bool TBAAVerifier::isValidScalarTBAANode(const MDNode *MD) {
4726 auto ResultIt = TBAAScalarNodes.find(MD);
4727 if (ResultIt != TBAAScalarNodes.end())
4728 return ResultIt->second;
4729
4730 SmallPtrSet<const MDNode *, 4> Visited;
4731 bool Result = IsScalarTBAANodeImpl(MD, Visited);
4732 auto InsertResult = TBAAScalarNodes.insert({MD, Result});
4733 (void)InsertResult;
4734 assert(InsertResult.second && "Just checked!")((InsertResult.second && "Just checked!") ? static_cast
<void> (0) : __assert_fail ("InsertResult.second && \"Just checked!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 4734, __PRETTY_FUNCTION__))
;
4735
4736 return Result;
4737}
4738
4739/// Returns the field node at the offset \p Offset in \p BaseNode. Update \p
4740/// Offset in place to be the offset within the field node returned.
4741///
4742/// We assume we've okayed \p BaseNode via \c verifyTBAABaseNode.
4743MDNode *TBAAVerifier::getFieldNodeFromTBAABaseNode(Instruction &I,
4744 const MDNode *BaseNode,
4745 APInt &Offset) {
4746 assert(BaseNode->getNumOperands() >= 2 && "Invalid base node!")((BaseNode->getNumOperands() >= 2 && "Invalid base node!"
) ? static_cast<void> (0) : __assert_fail ("BaseNode->getNumOperands() >= 2 && \"Invalid base node!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 4746, __PRETTY_FUNCTION__))
;
4747
4748 // Scalar nodes have only one possible "field" -- their parent in the access
4749 // hierarchy. Offset must be zero at this point, but our caller is supposed
4750 // to Assert that.
4751 if (BaseNode->getNumOperands() == 2)
4752 return cast<MDNode>(BaseNode->getOperand(1));
4753
4754 for (unsigned Idx = 1; Idx < BaseNode->getNumOperands(); Idx += 2) {
4755 auto *OffsetEntryCI =
4756 mdconst::extract<ConstantInt>(BaseNode->getOperand(Idx + 1));
4757 if (OffsetEntryCI->getValue().ugt(Offset)) {
4758 if (Idx == 1) {
4759 CheckFailed("Could not find TBAA parent in struct type node", &I,
4760 BaseNode, &Offset);
4761 return nullptr;
4762 }
4763
4764 auto *PrevOffsetEntryCI =
4765 mdconst::extract<ConstantInt>(BaseNode->getOperand(Idx - 1));
4766 Offset -= PrevOffsetEntryCI->getValue();
4767 return cast<MDNode>(BaseNode->getOperand(Idx - 2));
4768 }
4769 }
4770
4771 auto *LastOffsetEntryCI = mdconst::extract<ConstantInt>(
4772 BaseNode->getOperand(BaseNode->getNumOperands() - 1));
4773
4774 Offset -= LastOffsetEntryCI->getValue();
4775 return cast<MDNode>(BaseNode->getOperand(BaseNode->getNumOperands() - 2));
4776}
4777
4778bool TBAAVerifier::visitTBAAMetadata(Instruction &I, const MDNode *MD) {
4779 AssertTBAA(isa<LoadInst>(I) || isa<StoreInst>(I) || isa<CallInst>(I) ||do { if (!(isa<LoadInst>(I) || isa<StoreInst>(I) ||
isa<CallInst>(I) || isa<VAArgInst>(I) || isa<
AtomicRMWInst>(I) || isa<AtomicCmpXchgInst>(I))) { CheckFailed
("TBAA is only for loads, stores and calls!", &I); return
false; } } while (false)
4780 isa<VAArgInst>(I) || isa<AtomicRMWInst>(I) ||do { if (!(isa<LoadInst>(I) || isa<StoreInst>(I) ||
isa<CallInst>(I) || isa<VAArgInst>(I) || isa<
AtomicRMWInst>(I) || isa<AtomicCmpXchgInst>(I))) { CheckFailed
("TBAA is only for loads, stores and calls!", &I); return
false; } } while (false)
4781 isa<AtomicCmpXchgInst>(I),do { if (!(isa<LoadInst>(I) || isa<StoreInst>(I) ||
isa<CallInst>(I) || isa<VAArgInst>(I) || isa<
AtomicRMWInst>(I) || isa<AtomicCmpXchgInst>(I))) { CheckFailed
("TBAA is only for loads, stores and calls!", &I); return
false; } } while (false)
4782 "TBAA is only for loads, stores and calls!", &I)do { if (!(isa<LoadInst>(I) || isa<StoreInst>(I) ||
isa<CallInst>(I) || isa<VAArgInst>(I) || isa<
AtomicRMWInst>(I) || isa<AtomicCmpXchgInst>(I))) { CheckFailed
("TBAA is only for loads, stores and calls!", &I); return
false; } } while (false)
;
4783
4784 bool IsStructPathTBAA =
4785 isa<MDNode>(MD->getOperand(0)) && MD->getNumOperands() >= 3;
4786
4787 AssertTBAA(do { if (!(IsStructPathTBAA)) { CheckFailed("Old-style TBAA is no longer allowed, use struct-path TBAA instead"
, &I); return false; } } while (false)
4788 IsStructPathTBAA,do { if (!(IsStructPathTBAA)) { CheckFailed("Old-style TBAA is no longer allowed, use struct-path TBAA instead"
, &I); return false; } } while (false)
4789 "Old-style TBAA is no longer allowed, use struct-path TBAA instead", &I)do { if (!(IsStructPathTBAA)) { CheckFailed("Old-style TBAA is no longer allowed, use struct-path TBAA instead"
, &I); return false; } } while (false)
;
4790
4791 AssertTBAA(MD->getNumOperands() < 5,do { if (!(MD->getNumOperands() < 5)) { CheckFailed("Struct tag metadata must have either 3 or 4 operands"
, &I, MD); return false; } } while (false)
4792 "Struct tag metadata must have either 3 or 4 operands", &I, MD)do { if (!(MD->getNumOperands() < 5)) { CheckFailed("Struct tag metadata must have either 3 or 4 operands"
, &I, MD); return false; } } while (false)
;
4793
4794 MDNode *BaseNode = dyn_cast_or_null<MDNode>(MD->getOperand(0));
4795 MDNode *AccessType = dyn_cast_or_null<MDNode>(MD->getOperand(1));
4796
4797 if (MD->getNumOperands() == 4) {
4798 auto *IsImmutableCI =
4799 mdconst::dyn_extract_or_null<ConstantInt>(MD->getOperand(3));
4800 AssertTBAA(IsImmutableCI,do { if (!(IsImmutableCI)) { CheckFailed("Immutability tag on struct tag metadata must be a constant"
, &I, MD); return false; } } while (false)
4801 "Immutability tag on struct tag metadata must be a constant", &I,do { if (!(IsImmutableCI)) { CheckFailed("Immutability tag on struct tag metadata must be a constant"
, &I, MD); return false; } } while (false)
4802 MD)do { if (!(IsImmutableCI)) { CheckFailed("Immutability tag on struct tag metadata must be a constant"
, &I, MD); return false; } } while (false)
;
4803 AssertTBAA(do { if (!(IsImmutableCI->isZero() || IsImmutableCI->isOne
())) { CheckFailed("Immutability part of the struct tag metadata must be either 0 or 1"
, &I, MD); return false; } } while (false)
4804 IsImmutableCI->isZero() || IsImmutableCI->isOne(),do { if (!(IsImmutableCI->isZero() || IsImmutableCI->isOne
())) { CheckFailed("Immutability part of the struct tag metadata must be either 0 or 1"
, &I, MD); return false; } } while (false)
4805 "Immutability part of the struct tag metadata must be either 0 or 1",do { if (!(IsImmutableCI->isZero() || IsImmutableCI->isOne
())) { CheckFailed("Immutability part of the struct tag metadata must be either 0 or 1"
, &I, MD); return false; } } while (false)
4806 &I, MD)do { if (!(IsImmutableCI->isZero() || IsImmutableCI->isOne
())) { CheckFailed("Immutability part of the struct tag metadata must be either 0 or 1"
, &I, MD); return false; } } while (false)
;
4807 }
4808
4809 AssertTBAA(BaseNode && AccessType,do { if (!(BaseNode && AccessType)) { CheckFailed("Malformed struct tag metadata: base and access-type "
"should be non-null and point to Metadata nodes", &I, MD
, BaseNode, AccessType); return false; } } while (false)
4810 "Malformed struct tag metadata: base and access-type "do { if (!(BaseNode && AccessType)) { CheckFailed("Malformed struct tag metadata: base and access-type "
"should be non-null and point to Metadata nodes", &I, MD
, BaseNode, AccessType); return false; } } while (false)
4811 "should be non-null and point to Metadata nodes",do { if (!(BaseNode && AccessType)) { CheckFailed("Malformed struct tag metadata: base and access-type "
"should be non-null and point to Metadata nodes", &I, MD
, BaseNode, AccessType); return false; } } while (false)
4812 &I, MD, BaseNode, AccessType)do { if (!(BaseNode && AccessType)) { CheckFailed("Malformed struct tag metadata: base and access-type "
"should be non-null and point to Metadata nodes", &I, MD
, BaseNode, AccessType); return false; } } while (false)
;
4813
4814 AssertTBAA(isValidScalarTBAANode(AccessType),do { if (!(isValidScalarTBAANode(AccessType))) { CheckFailed(
"Access type node must be a valid scalar type", &I, MD, AccessType
); return false; } } while (false)
4815 "Access type node must be a valid scalar type", &I, MD,do { if (!(isValidScalarTBAANode(AccessType))) { CheckFailed(
"Access type node must be a valid scalar type", &I, MD, AccessType
); return false; } } while (false)
4816 AccessType)do { if (!(isValidScalarTBAANode(AccessType))) { CheckFailed(
"Access type node must be a valid scalar type", &I, MD, AccessType
); return false; } } while (false)
;
4817
4818 auto *OffsetCI = mdconst::dyn_extract_or_null<ConstantInt>(MD->getOperand(2));
4819 AssertTBAA(OffsetCI, "Offset must be constant integer", &I, MD)do { if (!(OffsetCI)) { CheckFailed("Offset must be constant integer"
, &I, MD); return false; } } while (false)
;
4820
4821 APInt Offset = OffsetCI->getValue();
4822 bool SeenAccessTypeInPath = false;
4823
4824 SmallPtrSet<MDNode *, 4> StructPath;
4825
4826 for (/* empty */; BaseNode && !IsRootTBAANode(BaseNode);
4827 BaseNode = getFieldNodeFromTBAABaseNode(I, BaseNode, Offset)) {
4828 if (!StructPath.insert(BaseNode).second) {
4829 CheckFailed("Cycle detected in struct path", &I, MD);
4830 return false;
4831 }
4832
4833 bool Invalid;
4834 unsigned BaseNodeBitWidth;
4835 std::tie(Invalid, BaseNodeBitWidth) = verifyTBAABaseNode(I, BaseNode);
4836
4837 // If the base node is invalid in itself, then we've already printed all the
4838 // errors we wanted to print.
4839 if (Invalid)
4840 return false;
4841
4842 SeenAccessTypeInPath |= BaseNode == AccessType;
4843
4844 if (isValidScalarTBAANode(BaseNode) || BaseNode == AccessType)
4845 AssertTBAA(Offset == 0, "Offset not zero at the point of scalar access",do { if (!(Offset == 0)) { CheckFailed("Offset not zero at the point of scalar access"
, &I, MD, &Offset); return false; } } while (false)
4846 &I, MD, &Offset)do { if (!(Offset == 0)) { CheckFailed("Offset not zero at the point of scalar access"
, &I, MD, &Offset); return false; } } while (false)
;
4847
4848 AssertTBAA(BaseNodeBitWidth == Offset.getBitWidth() ||do { if (!(BaseNodeBitWidth == Offset.getBitWidth() || (BaseNodeBitWidth
== 0 && Offset == 0))) { CheckFailed("Access bit-width not the same as description bit-width"
, &I, MD, BaseNodeBitWidth, Offset.getBitWidth()); return
false; } } while (false)
4849 (BaseNodeBitWidth == 0 && Offset == 0),do { if (!(BaseNodeBitWidth == Offset.getBitWidth() || (BaseNodeBitWidth
== 0 && Offset == 0))) { CheckFailed("Access bit-width not the same as description bit-width"
, &I, MD, BaseNodeBitWidth, Offset.getBitWidth()); return
false; } } while (false)
4850 "Access bit-width not the same as description bit-width", &I, MD,do { if (!(BaseNodeBitWidth == Offset.getBitWidth() || (BaseNodeBitWidth
== 0 && Offset == 0))) { CheckFailed("Access bit-width not the same as description bit-width"
, &I, MD, BaseNodeBitWidth, Offset.getBitWidth()); return
false; } } while (false)
4851 BaseNodeBitWidth, Offset.getBitWidth())do { if (!(BaseNodeBitWidth == Offset.getBitWidth() || (BaseNodeBitWidth
== 0 && Offset == 0))) { CheckFailed("Access bit-width not the same as description bit-width"
, &I, MD, BaseNodeBitWidth, Offset.getBitWidth()); return
false; } } while (false)
;
4852 }
4853
4854 AssertTBAA(SeenAccessTypeInPath, "Did not see access type in access path!",do { if (!(SeenAccessTypeInPath)) { CheckFailed("Did not see access type in access path!"
, &I, MD); return false; } } while (false)
4855 &I, MD)do { if (!(SeenAccessTypeInPath)) { CheckFailed("Did not see access type in access path!"
, &I, MD); return false; } } while (false)
;
4856 return true;
4857}
4858
4859char VerifierLegacyPass::ID = 0;
4860INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)static void *initializeVerifierLegacyPassPassOnce(PassRegistry
&Registry) { PassInfo *PI = new PassInfo( "Module Verifier"
, "verify", &VerifierLegacyPass::ID, PassInfo::NormalCtor_t
(callDefaultCtor<VerifierLegacyPass>), false, false); Registry
.registerPass(*PI, true); return PI; } static llvm::once_flag
InitializeVerifierLegacyPassPassFlag; void llvm::initializeVerifierLegacyPassPass
(PassRegistry &Registry) { llvm::call_once(InitializeVerifierLegacyPassPassFlag
, initializeVerifierLegacyPassPassOnce, std::ref(Registry)); }
4861
4862FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
4863 return new VerifierLegacyPass(FatalErrors);
4864}
4865
4866AnalysisKey VerifierAnalysis::Key;
4867VerifierAnalysis::Result VerifierAnalysis::run(Module &M,
4868 ModuleAnalysisManager &) {
4869 Result Res;
4870 Res.IRBroken = llvm::verifyModule(M, &dbgs(), &Res.DebugInfoBroken);
4871 return Res;
4872}
4873
4874VerifierAnalysis::Result VerifierAnalysis::run(Function &F,
4875 FunctionAnalysisManager &) {
4876 return { llvm::verifyFunction(F, &dbgs()), false };
4877}
4878
4879PreservedAnalyses VerifierPass::run(Module &M, ModuleAnalysisManager &AM) {
4880 auto Res = AM.getResult<VerifierAnalysis>(M);
4881 if (FatalErrors) {
4882 if (Res.IRBroken)
4883 report_fatal_error("Broken module found, compilation aborted!");
4884 assert(!Res.DebugInfoBroken && "Module contains invalid debug info")((!Res.DebugInfoBroken && "Module contains invalid debug info"
) ? static_cast<void> (0) : __assert_fail ("!Res.DebugInfoBroken && \"Module contains invalid debug info\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn298304/lib/IR/Verifier.cpp"
, 4884, __PRETTY_FUNCTION__))
;
4885 }
4886
4887 // Strip broken debug info.
4888 if (Res.DebugInfoBroken) {
4889 DiagnosticInfoIgnoringInvalidDebugMetadata DiagInvalid(M);
4890 M.getContext().diagnose(DiagInvalid);
4891 if (!StripDebugInfo(M))
4892 report_fatal_error("Failed to strip malformed debug info");
4893 }
4894 return PreservedAnalyses::all();
4895}
4896
4897PreservedAnalyses VerifierPass::run(Function &F, FunctionAnalysisManager &AM) {
4898 auto res = AM.getResult<VerifierAnalysis>(F);
4899 if (res.IRBroken && FatalErrors)
4900 report_fatal_error("Broken function found, compilation aborted!");
4901
4902 return PreservedAnalyses::all();
4903}