1 //===-- Verifier.cpp - Implement the Module Verifier -----------------------==//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the function verifier interface, that can be used for some
11 // sanity checking of input to the system.
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.
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
42 // * All landingpad instructions must use the same personality function with
44 // * All other things that are tested by asserts spread about the code...
46 //===----------------------------------------------------------------------===//
48 #include "llvm/IR/Verifier.h"
49 #include "llvm/ADT/STLExtras.h"
50 #include "llvm/ADT/SetVector.h"
51 #include "llvm/ADT/SmallPtrSet.h"
52 #include "llvm/ADT/SmallVector.h"
53 #include "llvm/ADT/StringExtras.h"
54 #include "llvm/IR/CFG.h"
55 #include "llvm/IR/CallSite.h"
56 #include "llvm/IR/CallingConv.h"
57 #include "llvm/IR/ConstantRange.h"
58 #include "llvm/IR/Constants.h"
59 #include "llvm/IR/DataLayout.h"
60 #include "llvm/IR/DebugInfo.h"
61 #include "llvm/IR/DerivedTypes.h"
62 #include "llvm/IR/Dominators.h"
63 #include "llvm/IR/InlineAsm.h"
64 #include "llvm/IR/InstIterator.h"
65 #include "llvm/IR/InstVisitor.h"
66 #include "llvm/IR/IntrinsicInst.h"
67 #include "llvm/IR/LLVMContext.h"
68 #include "llvm/IR/Metadata.h"
69 #include "llvm/IR/Module.h"
70 #include "llvm/IR/PassManager.h"
71 #include "llvm/IR/Statepoint.h"
72 #include "llvm/Pass.h"
73 #include "llvm/Support/CommandLine.h"
74 #include "llvm/Support/Debug.h"
75 #include "llvm/Support/ErrorHandling.h"
76 #include "llvm/Support/raw_ostream.h"
81 static cl::opt<bool> VerifyDebugInfo("verify-debug-info", cl::init(false));
84 struct VerifierSupport {
88 /// \brief Track the brokenness of the module while recursively visiting.
91 explicit VerifierSupport(raw_ostream &OS)
92 : OS(OS), M(nullptr), Broken(false) {}
94 void WriteValue(const Value *V) {
97 if (isa<Instruction>(V)) {
100 V->printAsOperand(OS, true, M);
105 void WriteMetadata(const Metadata *MD) {
108 MD->printAsOperand(OS, true, M);
112 void WriteType(Type *T) {
118 void WriteComdat(const Comdat *C) {
124 // CheckFailed - A check failed, so print out the condition and the message
125 // that failed. This provides a nice place to put a breakpoint if you want
126 // to see why something is not correct.
127 void CheckFailed(const Twine &Message, const Value *V1 = nullptr,
128 const Value *V2 = nullptr, const Value *V3 = nullptr,
129 const Value *V4 = nullptr) {
130 OS << Message.str() << "\n";
138 void CheckFailed(const Twine &Message, const Metadata *V1, const Metadata *V2,
139 const Metadata *V3 = nullptr, const Metadata *V4 = nullptr) {
140 OS << Message.str() << "\n";
148 void CheckFailed(const Twine &Message, const Metadata *V1,
149 const Value *V2 = nullptr) {
150 OS << Message.str() << "\n";
156 void CheckFailed(const Twine &Message, const Value *V1, Type *T2,
157 const Value *V3 = nullptr) {
158 OS << Message.str() << "\n";
165 void CheckFailed(const Twine &Message, Type *T1, Type *T2 = nullptr,
166 Type *T3 = nullptr) {
167 OS << Message.str() << "\n";
174 void CheckFailed(const Twine &Message, const Comdat *C) {
175 OS << Message.str() << "\n";
180 class Verifier : public InstVisitor<Verifier>, VerifierSupport {
181 friend class InstVisitor<Verifier>;
183 LLVMContext *Context;
186 /// \brief When verifying a basic block, keep track of all of the
187 /// instructions we have seen so far.
189 /// This allows us to do efficient dominance checks for the case when an
190 /// instruction has an operand that is an instruction in the same block.
191 SmallPtrSet<Instruction *, 16> InstsInThisBlock;
193 /// \brief Keep track of the metadata nodes that have been checked already.
194 SmallPtrSet<const Metadata *, 32> MDNodes;
196 /// \brief The personality function referenced by the LandingPadInsts.
197 /// All LandingPadInsts within the same function must use the same
198 /// personality function.
199 const Value *PersonalityFn;
201 /// \brief Whether we've seen a call to @llvm.frameallocate in this function
203 bool SawFrameAllocate;
206 explicit Verifier(raw_ostream &OS = dbgs())
207 : VerifierSupport(OS), Context(nullptr), PersonalityFn(nullptr),
208 SawFrameAllocate(false) {}
210 bool verify(const Function &F) {
212 Context = &M->getContext();
214 // First ensure the function is well-enough formed to compute dominance
217 OS << "Function '" << F.getName()
218 << "' does not contain an entry block!\n";
221 for (Function::const_iterator I = F.begin(), E = F.end(); I != E; ++I) {
222 if (I->empty() || !I->back().isTerminator()) {
223 OS << "Basic Block in function '" << F.getName()
224 << "' does not have terminator!\n";
225 I->printAsOperand(OS, true);
231 // Now directly compute a dominance tree. We don't rely on the pass
232 // manager to provide this as it isolates us from a potentially
233 // out-of-date dominator tree and makes it significantly more complex to
234 // run this code outside of a pass manager.
235 // FIXME: It's really gross that we have to cast away constness here.
236 DT.recalculate(const_cast<Function &>(F));
239 // FIXME: We strip const here because the inst visitor strips const.
240 visit(const_cast<Function &>(F));
241 InstsInThisBlock.clear();
242 PersonalityFn = nullptr;
243 SawFrameAllocate = false;
248 bool verify(const Module &M) {
250 Context = &M.getContext();
253 // Scan through, checking all of the external function's linkage now...
254 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I) {
255 visitGlobalValue(*I);
257 // Check to make sure function prototypes are okay.
258 if (I->isDeclaration())
262 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
264 visitGlobalVariable(*I);
266 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
268 visitGlobalAlias(*I);
270 for (Module::const_named_metadata_iterator I = M.named_metadata_begin(),
271 E = M.named_metadata_end();
273 visitNamedMDNode(*I);
275 for (const StringMapEntry<Comdat> &SMEC : M.getComdatSymbolTable())
276 visitComdat(SMEC.getValue());
279 visitModuleIdents(M);
285 // Verification methods...
286 void visitGlobalValue(const GlobalValue &GV);
287 void visitGlobalVariable(const GlobalVariable &GV);
288 void visitGlobalAlias(const GlobalAlias &GA);
289 void visitAliaseeSubExpr(const GlobalAlias &A, const Constant &C);
290 void visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias *> &Visited,
291 const GlobalAlias &A, const Constant &C);
292 void visitNamedMDNode(const NamedMDNode &NMD);
293 void visitMDNode(const MDNode &MD);
294 void visitMetadataAsValue(const MetadataAsValue &MD, Function *F);
295 void visitValueAsMetadata(const ValueAsMetadata &MD, Function *F);
296 void visitComdat(const Comdat &C);
297 void visitModuleIdents(const Module &M);
298 void visitModuleFlags(const Module &M);
299 void visitModuleFlag(const MDNode *Op,
300 DenseMap<const MDString *, const MDNode *> &SeenIDs,
301 SmallVectorImpl<const MDNode *> &Requirements);
302 void visitFunction(const Function &F);
303 void visitBasicBlock(BasicBlock &BB);
304 void visitRangeMetadata(Instruction& I, MDNode* Range, Type* Ty);
306 #define HANDLE_SPECIALIZED_MDNODE_LEAF(CLASS) void visit##CLASS(const CLASS &N);
307 #include "llvm/IR/Metadata.def"
309 // InstVisitor overrides...
310 using InstVisitor<Verifier>::visit;
311 void visit(Instruction &I);
313 void visitTruncInst(TruncInst &I);
314 void visitZExtInst(ZExtInst &I);
315 void visitSExtInst(SExtInst &I);
316 void visitFPTruncInst(FPTruncInst &I);
317 void visitFPExtInst(FPExtInst &I);
318 void visitFPToUIInst(FPToUIInst &I);
319 void visitFPToSIInst(FPToSIInst &I);
320 void visitUIToFPInst(UIToFPInst &I);
321 void visitSIToFPInst(SIToFPInst &I);
322 void visitIntToPtrInst(IntToPtrInst &I);
323 void visitPtrToIntInst(PtrToIntInst &I);
324 void visitBitCastInst(BitCastInst &I);
325 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
326 void visitPHINode(PHINode &PN);
327 void visitBinaryOperator(BinaryOperator &B);
328 void visitICmpInst(ICmpInst &IC);
329 void visitFCmpInst(FCmpInst &FC);
330 void visitExtractElementInst(ExtractElementInst &EI);
331 void visitInsertElementInst(InsertElementInst &EI);
332 void visitShuffleVectorInst(ShuffleVectorInst &EI);
333 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
334 void visitCallInst(CallInst &CI);
335 void visitInvokeInst(InvokeInst &II);
336 void visitGetElementPtrInst(GetElementPtrInst &GEP);
337 void visitLoadInst(LoadInst &LI);
338 void visitStoreInst(StoreInst &SI);
339 void verifyDominatesUse(Instruction &I, unsigned i);
340 void visitInstruction(Instruction &I);
341 void visitTerminatorInst(TerminatorInst &I);
342 void visitBranchInst(BranchInst &BI);
343 void visitReturnInst(ReturnInst &RI);
344 void visitSwitchInst(SwitchInst &SI);
345 void visitIndirectBrInst(IndirectBrInst &BI);
346 void visitSelectInst(SelectInst &SI);
347 void visitUserOp1(Instruction &I);
348 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
349 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
350 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
351 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
352 void visitFenceInst(FenceInst &FI);
353 void visitAllocaInst(AllocaInst &AI);
354 void visitExtractValueInst(ExtractValueInst &EVI);
355 void visitInsertValueInst(InsertValueInst &IVI);
356 void visitLandingPadInst(LandingPadInst &LPI);
358 void VerifyCallSite(CallSite CS);
359 void verifyMustTailCall(CallInst &CI);
360 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
361 unsigned ArgNo, std::string &Suffix);
362 bool VerifyIntrinsicType(Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
363 SmallVectorImpl<Type *> &ArgTys);
364 bool VerifyIntrinsicIsVarArg(bool isVarArg,
365 ArrayRef<Intrinsic::IITDescriptor> &Infos);
366 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
367 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
369 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
370 bool isReturnValue, const Value *V);
371 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
374 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
375 void VerifyStatepoint(ImmutableCallSite CS);
377 class DebugInfoVerifier : public VerifierSupport {
379 explicit DebugInfoVerifier(raw_ostream &OS = dbgs()) : VerifierSupport(OS) {}
381 bool verify(const Module &M) {
388 void verifyDebugInfo();
389 void processInstructions(DebugInfoFinder &Finder);
390 void processCallInst(DebugInfoFinder &Finder, const CallInst &CI);
392 } // End anonymous namespace
394 // Assert - We know that cond should be true, if not print an error message.
395 #define Assert(C, M) \
396 do { if (!(C)) { CheckFailed(M); return; } } while (0)
397 #define Assert1(C, M, V1) \
398 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
399 #define Assert2(C, M, V1, V2) \
400 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
401 #define Assert3(C, M, V1, V2, V3) \
402 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
403 #define Assert4(C, M, V1, V2, V3, V4) \
404 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
406 void Verifier::visit(Instruction &I) {
407 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
408 Assert1(I.getOperand(i) != nullptr, "Operand is null", &I);
409 InstVisitor<Verifier>::visit(I);
413 void Verifier::visitGlobalValue(const GlobalValue &GV) {
414 Assert1(!GV.isDeclaration() || GV.hasExternalLinkage() ||
415 GV.hasExternalWeakLinkage(),
416 "Global is external, but doesn't have external or weak linkage!",
419 Assert1(GV.getAlignment() <= Value::MaximumAlignment,
420 "huge alignment values are unsupported", &GV);
421 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
422 "Only global variables can have appending linkage!", &GV);
424 if (GV.hasAppendingLinkage()) {
425 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
426 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
427 "Only global arrays can have appending linkage!", GVar);
431 void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
432 if (GV.hasInitializer()) {
433 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
434 "Global variable initializer type does not match global "
435 "variable type!", &GV);
437 // If the global has common linkage, it must have a zero initializer and
438 // cannot be constant.
439 if (GV.hasCommonLinkage()) {
440 Assert1(GV.getInitializer()->isNullValue(),
441 "'common' global must have a zero initializer!", &GV);
442 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
444 Assert1(!GV.hasComdat(), "'common' global may not be in a Comdat!", &GV);
447 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
448 "invalid linkage type for global declaration", &GV);
451 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
452 GV.getName() == "llvm.global_dtors")) {
453 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
454 "invalid linkage for intrinsic global variable", &GV);
455 // Don't worry about emitting an error for it not being an array,
456 // visitGlobalValue will complain on appending non-array.
457 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType()->getElementType())) {
458 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
459 PointerType *FuncPtrTy =
460 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
461 // FIXME: Reject the 2-field form in LLVM 4.0.
462 Assert1(STy && (STy->getNumElements() == 2 ||
463 STy->getNumElements() == 3) &&
464 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
465 STy->getTypeAtIndex(1) == FuncPtrTy,
466 "wrong type for intrinsic global variable", &GV);
467 if (STy->getNumElements() == 3) {
468 Type *ETy = STy->getTypeAtIndex(2);
469 Assert1(ETy->isPointerTy() &&
470 cast<PointerType>(ETy)->getElementType()->isIntegerTy(8),
471 "wrong type for intrinsic global variable", &GV);
476 if (GV.hasName() && (GV.getName() == "llvm.used" ||
477 GV.getName() == "llvm.compiler.used")) {
478 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
479 "invalid linkage for intrinsic global variable", &GV);
480 Type *GVType = GV.getType()->getElementType();
481 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
482 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
483 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
484 if (GV.hasInitializer()) {
485 const Constant *Init = GV.getInitializer();
486 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
487 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
489 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
490 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
492 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
493 "invalid llvm.used member", V);
494 Assert1(V->hasName(), "members of llvm.used must be named", V);
500 Assert1(!GV.hasDLLImportStorageClass() ||
501 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
502 GV.hasAvailableExternallyLinkage(),
503 "Global is marked as dllimport, but not external", &GV);
505 if (!GV.hasInitializer()) {
506 visitGlobalValue(GV);
510 // Walk any aggregate initializers looking for bitcasts between address spaces
511 SmallPtrSet<const Value *, 4> Visited;
512 SmallVector<const Value *, 4> WorkStack;
513 WorkStack.push_back(cast<Value>(GV.getInitializer()));
515 while (!WorkStack.empty()) {
516 const Value *V = WorkStack.pop_back_val();
517 if (!Visited.insert(V).second)
520 if (const User *U = dyn_cast<User>(V)) {
521 for (unsigned I = 0, N = U->getNumOperands(); I != N; ++I)
522 WorkStack.push_back(U->getOperand(I));
525 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
526 VerifyConstantExprBitcastType(CE);
532 visitGlobalValue(GV);
535 void Verifier::visitAliaseeSubExpr(const GlobalAlias &GA, const Constant &C) {
536 SmallPtrSet<const GlobalAlias*, 4> Visited;
538 visitAliaseeSubExpr(Visited, GA, C);
541 void Verifier::visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias*> &Visited,
542 const GlobalAlias &GA, const Constant &C) {
543 if (const auto *GV = dyn_cast<GlobalValue>(&C)) {
544 Assert1(!GV->isDeclaration(), "Alias must point to a definition", &GA);
546 if (const auto *GA2 = dyn_cast<GlobalAlias>(GV)) {
547 Assert1(Visited.insert(GA2).second, "Aliases cannot form a cycle", &GA);
549 Assert1(!GA2->mayBeOverridden(), "Alias cannot point to a weak alias",
552 // Only continue verifying subexpressions of GlobalAliases.
553 // Do not recurse into global initializers.
558 if (const auto *CE = dyn_cast<ConstantExpr>(&C))
559 VerifyConstantExprBitcastType(CE);
561 for (const Use &U : C.operands()) {
563 if (const auto *GA2 = dyn_cast<GlobalAlias>(V))
564 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
565 else if (const auto *C2 = dyn_cast<Constant>(V))
566 visitAliaseeSubExpr(Visited, GA, *C2);
570 void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
571 Assert1(!GA.getName().empty(),
572 "Alias name cannot be empty!", &GA);
573 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
574 "Alias should have private, internal, linkonce, weak, linkonce_odr, "
575 "weak_odr, or external linkage!",
577 const Constant *Aliasee = GA.getAliasee();
578 Assert1(Aliasee, "Aliasee cannot be NULL!", &GA);
579 Assert1(GA.getType() == Aliasee->getType(),
580 "Alias and aliasee types should match!", &GA);
582 Assert1(isa<GlobalValue>(Aliasee) || isa<ConstantExpr>(Aliasee),
583 "Aliasee should be either GlobalValue or ConstantExpr", &GA);
585 visitAliaseeSubExpr(GA, *Aliasee);
587 visitGlobalValue(GA);
590 void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
591 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
592 MDNode *MD = NMD.getOperand(i);
600 void Verifier::visitMDNode(const MDNode &MD) {
601 // Only visit each node once. Metadata can be mutually recursive, so this
602 // avoids infinite recursion here, as well as being an optimization.
603 if (!MDNodes.insert(&MD).second)
606 switch (MD.getMetadataID()) {
608 llvm_unreachable("Invalid MDNode subclass");
609 case Metadata::MDTupleKind:
611 #define HANDLE_SPECIALIZED_MDNODE_LEAF(CLASS) \
612 case Metadata::CLASS##Kind: \
613 visit##CLASS(cast<CLASS>(MD)); \
615 #include "llvm/IR/Metadata.def"
618 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
619 Metadata *Op = MD.getOperand(i);
622 Assert2(!isa<LocalAsMetadata>(Op), "Invalid operand for global metadata!",
624 if (auto *N = dyn_cast<MDNode>(Op)) {
628 if (auto *V = dyn_cast<ValueAsMetadata>(Op)) {
629 visitValueAsMetadata(*V, nullptr);
634 // Check these last, so we diagnose problems in operands first.
635 Assert1(!MD.isTemporary(), "Expected no forward declarations!", &MD);
636 Assert1(MD.isResolved(), "All nodes should be resolved!", &MD);
639 void Verifier::visitValueAsMetadata(const ValueAsMetadata &MD, Function *F) {
640 Assert1(MD.getValue(), "Expected valid value", &MD);
641 Assert2(!MD.getValue()->getType()->isMetadataTy(),
642 "Unexpected metadata round-trip through values", &MD, MD.getValue());
644 auto *L = dyn_cast<LocalAsMetadata>(&MD);
648 Assert1(F, "function-local metadata used outside a function", L);
650 // If this was an instruction, bb, or argument, verify that it is in the
651 // function that we expect.
652 Function *ActualF = nullptr;
653 if (Instruction *I = dyn_cast<Instruction>(L->getValue())) {
654 Assert2(I->getParent(), "function-local metadata not in basic block", L, I);
655 ActualF = I->getParent()->getParent();
656 } else if (BasicBlock *BB = dyn_cast<BasicBlock>(L->getValue()))
657 ActualF = BB->getParent();
658 else if (Argument *A = dyn_cast<Argument>(L->getValue()))
659 ActualF = A->getParent();
660 assert(ActualF && "Unimplemented function local metadata case!");
662 Assert1(ActualF == F, "function-local metadata used in wrong function", L);
665 void Verifier::visitMetadataAsValue(const MetadataAsValue &MDV, Function *F) {
666 Metadata *MD = MDV.getMetadata();
667 if (auto *N = dyn_cast<MDNode>(MD)) {
672 // Only visit each node once. Metadata can be mutually recursive, so this
673 // avoids infinite recursion here, as well as being an optimization.
674 if (!MDNodes.insert(MD).second)
677 if (auto *V = dyn_cast<ValueAsMetadata>(MD))
678 visitValueAsMetadata(*V, F);
681 void Verifier::visitMDLocation(const MDLocation &N) {
682 Assert1(N.getScope(), "location requires a valid scope", &N);
683 if (N.getInlinedAt())
684 Assert2(isa<MDLocation>(N.getInlinedAt()),
685 "inlined-at should be a location", &N, N.getInlinedAt());
688 void Verifier::visitGenericDebugNode(const GenericDebugNode &) {}
689 void Verifier::visitMDSubrange(const MDSubrange &) {}
690 void Verifier::visitMDEnumerator(const MDEnumerator &) {}
691 void Verifier::visitMDBasicType(const MDBasicType &) {}
692 void Verifier::visitMDDerivedType(const MDDerivedType &) {}
693 void Verifier::visitMDCompositeType(const MDCompositeType &) {}
694 void Verifier::visitMDSubroutineType(const MDSubroutineType &) {}
695 void Verifier::visitMDFile(const MDFile &) {}
696 void Verifier::visitMDCompileUnit(const MDCompileUnit &) {}
697 void Verifier::visitMDSubprogram(const MDSubprogram &) {}
698 void Verifier::visitMDLexicalBlock(const MDLexicalBlock &) {}
699 void Verifier::visitMDLexicalBlockFile(const MDLexicalBlockFile &) {}
700 void Verifier::visitMDNamespace(const MDNamespace &) {}
701 void Verifier::visitMDTemplateTypeParameter(const MDTemplateTypeParameter &) {}
702 void Verifier::visitMDTemplateValueParameter(const MDTemplateValueParameter &) {
704 void Verifier::visitMDGlobalVariable(const MDGlobalVariable &) {}
705 void Verifier::visitMDLocalVariable(const MDLocalVariable &) {}
706 void Verifier::visitMDExpression(const MDExpression &) {}
707 void Verifier::visitMDObjCProperty(const MDObjCProperty &) {}
708 void Verifier::visitMDImportedEntity(const MDImportedEntity &) {}
710 void Verifier::visitComdat(const Comdat &C) {
711 // All Comdat::SelectionKind values other than Comdat::Any require a
712 // GlobalValue with the same name as the Comdat.
713 const GlobalValue *GV = M->getNamedValue(C.getName());
714 if (C.getSelectionKind() != Comdat::Any)
716 "comdat selection kind requires a global value with the same name",
718 // The Module is invalid if the GlobalValue has private linkage. Entities
719 // with private linkage don't have entries in the symbol table.
721 Assert1(!GV->hasPrivateLinkage(), "comdat global value has private linkage",
725 void Verifier::visitModuleIdents(const Module &M) {
726 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
730 // llvm.ident takes a list of metadata entry. Each entry has only one string.
731 // Scan each llvm.ident entry and make sure that this requirement is met.
732 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
733 const MDNode *N = Idents->getOperand(i);
734 Assert1(N->getNumOperands() == 1,
735 "incorrect number of operands in llvm.ident metadata", N);
736 Assert1(isa<MDString>(N->getOperand(0)),
737 ("invalid value for llvm.ident metadata entry operand"
738 "(the operand should be a string)"),
743 void Verifier::visitModuleFlags(const Module &M) {
744 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
747 // Scan each flag, and track the flags and requirements.
748 DenseMap<const MDString*, const MDNode*> SeenIDs;
749 SmallVector<const MDNode*, 16> Requirements;
750 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
751 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
754 // Validate that the requirements in the module are valid.
755 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
756 const MDNode *Requirement = Requirements[I];
757 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
758 const Metadata *ReqValue = Requirement->getOperand(1);
760 const MDNode *Op = SeenIDs.lookup(Flag);
762 CheckFailed("invalid requirement on flag, flag is not present in module",
767 if (Op->getOperand(2) != ReqValue) {
768 CheckFailed(("invalid requirement on flag, "
769 "flag does not have the required value"),
777 Verifier::visitModuleFlag(const MDNode *Op,
778 DenseMap<const MDString *, const MDNode *> &SeenIDs,
779 SmallVectorImpl<const MDNode *> &Requirements) {
780 // Each module flag should have three arguments, the merge behavior (a
781 // constant int), the flag ID (an MDString), and the value.
782 Assert1(Op->getNumOperands() == 3,
783 "incorrect number of operands in module flag", Op);
784 Module::ModFlagBehavior MFB;
785 if (!Module::isValidModFlagBehavior(Op->getOperand(0), MFB)) {
787 mdconst::dyn_extract<ConstantInt>(Op->getOperand(0)),
788 "invalid behavior operand in module flag (expected constant integer)",
791 "invalid behavior operand in module flag (unexpected constant)",
794 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
796 "invalid ID operand in module flag (expected metadata string)",
799 // Sanity check the values for behaviors with additional requirements.
802 case Module::Warning:
803 case Module::Override:
804 // These behavior types accept any value.
807 case Module::Require: {
808 // The value should itself be an MDNode with two operands, a flag ID (an
809 // MDString), and a value.
810 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
811 Assert1(Value && Value->getNumOperands() == 2,
812 "invalid value for 'require' module flag (expected metadata pair)",
814 Assert1(isa<MDString>(Value->getOperand(0)),
815 ("invalid value for 'require' module flag "
816 "(first value operand should be a string)"),
817 Value->getOperand(0));
819 // Append it to the list of requirements, to check once all module flags are
821 Requirements.push_back(Value);
826 case Module::AppendUnique: {
827 // These behavior types require the operand be an MDNode.
828 Assert1(isa<MDNode>(Op->getOperand(2)),
829 "invalid value for 'append'-type module flag "
830 "(expected a metadata node)", Op->getOperand(2));
835 // Unless this is a "requires" flag, check the ID is unique.
836 if (MFB != Module::Require) {
837 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
839 "module flag identifiers must be unique (or of 'require' type)",
844 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
845 bool isFunction, const Value *V) {
847 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
848 if (Attrs.getSlotIndex(I) == Idx) {
853 assert(Slot != ~0U && "Attribute set inconsistency!");
855 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
857 if (I->isStringAttribute())
860 if (I->getKindAsEnum() == Attribute::NoReturn ||
861 I->getKindAsEnum() == Attribute::NoUnwind ||
862 I->getKindAsEnum() == Attribute::NoInline ||
863 I->getKindAsEnum() == Attribute::AlwaysInline ||
864 I->getKindAsEnum() == Attribute::OptimizeForSize ||
865 I->getKindAsEnum() == Attribute::StackProtect ||
866 I->getKindAsEnum() == Attribute::StackProtectReq ||
867 I->getKindAsEnum() == Attribute::StackProtectStrong ||
868 I->getKindAsEnum() == Attribute::NoRedZone ||
869 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
870 I->getKindAsEnum() == Attribute::Naked ||
871 I->getKindAsEnum() == Attribute::InlineHint ||
872 I->getKindAsEnum() == Attribute::StackAlignment ||
873 I->getKindAsEnum() == Attribute::UWTable ||
874 I->getKindAsEnum() == Attribute::NonLazyBind ||
875 I->getKindAsEnum() == Attribute::ReturnsTwice ||
876 I->getKindAsEnum() == Attribute::SanitizeAddress ||
877 I->getKindAsEnum() == Attribute::SanitizeThread ||
878 I->getKindAsEnum() == Attribute::SanitizeMemory ||
879 I->getKindAsEnum() == Attribute::MinSize ||
880 I->getKindAsEnum() == Attribute::NoDuplicate ||
881 I->getKindAsEnum() == Attribute::Builtin ||
882 I->getKindAsEnum() == Attribute::NoBuiltin ||
883 I->getKindAsEnum() == Attribute::Cold ||
884 I->getKindAsEnum() == Attribute::OptimizeNone ||
885 I->getKindAsEnum() == Attribute::JumpTable) {
887 CheckFailed("Attribute '" + I->getAsString() +
888 "' only applies to functions!", V);
891 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
892 I->getKindAsEnum() == Attribute::ReadNone) {
894 CheckFailed("Attribute '" + I->getAsString() +
895 "' does not apply to function returns");
898 } else if (isFunction) {
899 CheckFailed("Attribute '" + I->getAsString() +
900 "' does not apply to functions!", V);
906 // VerifyParameterAttrs - Check the given attributes for an argument or return
907 // value of the specified type. The value V is printed in error messages.
908 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
909 bool isReturnValue, const Value *V) {
910 if (!Attrs.hasAttributes(Idx))
913 VerifyAttributeTypes(Attrs, Idx, false, V);
916 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
917 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
918 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
919 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
920 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
921 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
922 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
923 "'returned' do not apply to return values!", V);
925 // Check for mutually incompatible attributes. Only inreg is compatible with
927 unsigned AttrCount = 0;
928 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
929 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
930 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
931 Attrs.hasAttribute(Idx, Attribute::InReg);
932 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
933 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
934 "and 'sret' are incompatible!", V);
936 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
937 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
938 "'inalloca and readonly' are incompatible!", V);
940 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
941 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
942 "'sret and returned' are incompatible!", V);
944 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
945 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
946 "'zeroext and signext' are incompatible!", V);
948 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
949 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
950 "'readnone and readonly' are incompatible!", V);
952 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
953 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
954 "'noinline and alwaysinline' are incompatible!", V);
956 Assert1(!AttrBuilder(Attrs, Idx).
957 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
958 "Wrong types for attribute: " +
959 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
961 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
962 if (!PTy->getElementType()->isSized()) {
963 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
964 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
965 "Attributes 'byval' and 'inalloca' do not support unsized types!",
969 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
970 "Attribute 'byval' only applies to parameters with pointer type!",
975 // VerifyFunctionAttrs - Check parameter attributes against a function type.
976 // The value V is printed in error messages.
977 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
982 bool SawNest = false;
983 bool SawReturned = false;
984 bool SawSRet = false;
986 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
987 unsigned Idx = Attrs.getSlotIndex(i);
991 Ty = FT->getReturnType();
992 else if (Idx-1 < FT->getNumParams())
993 Ty = FT->getParamType(Idx-1);
995 break; // VarArgs attributes, verified elsewhere.
997 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
1002 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1003 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
1007 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1008 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1010 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
1011 "argument and return types for 'returned' attribute", V);
1015 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
1016 Assert1(!SawSRet, "Cannot have multiple 'sret' parameters!", V);
1017 Assert1(Idx == 1 || Idx == 2,
1018 "Attribute 'sret' is not on first or second parameter!", V);
1022 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
1023 Assert1(Idx == FT->getNumParams(),
1024 "inalloca isn't on the last parameter!", V);
1028 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
1031 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
1033 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1034 Attribute::ReadNone) &&
1035 Attrs.hasAttribute(AttributeSet::FunctionIndex,
1036 Attribute::ReadOnly)),
1037 "Attributes 'readnone and readonly' are incompatible!", V);
1039 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1040 Attribute::NoInline) &&
1041 Attrs.hasAttribute(AttributeSet::FunctionIndex,
1042 Attribute::AlwaysInline)),
1043 "Attributes 'noinline and alwaysinline' are incompatible!", V);
1045 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1046 Attribute::OptimizeNone)) {
1047 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1048 Attribute::NoInline),
1049 "Attribute 'optnone' requires 'noinline'!", V);
1051 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1052 Attribute::OptimizeForSize),
1053 "Attributes 'optsize and optnone' are incompatible!", V);
1055 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1056 Attribute::MinSize),
1057 "Attributes 'minsize and optnone' are incompatible!", V);
1060 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1061 Attribute::JumpTable)) {
1062 const GlobalValue *GV = cast<GlobalValue>(V);
1063 Assert1(GV->hasUnnamedAddr(),
1064 "Attribute 'jumptable' requires 'unnamed_addr'", V);
1069 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
1070 if (CE->getOpcode() != Instruction::BitCast)
1073 Assert1(CastInst::castIsValid(Instruction::BitCast, CE->getOperand(0),
1075 "Invalid bitcast", CE);
1078 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1079 if (Attrs.getNumSlots() == 0)
1082 unsigned LastSlot = Attrs.getNumSlots() - 1;
1083 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1084 if (LastIndex <= Params
1085 || (LastIndex == AttributeSet::FunctionIndex
1086 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1092 /// \brief Verify that statepoint intrinsic is well formed.
1093 void Verifier::VerifyStatepoint(ImmutableCallSite CS) {
1094 assert(CS.getCalledFunction() &&
1095 CS.getCalledFunction()->getIntrinsicID() ==
1096 Intrinsic::experimental_gc_statepoint);
1098 const Instruction &CI = *CS.getInstruction();
1100 Assert1(!CS.doesNotAccessMemory() &&
1101 !CS.onlyReadsMemory(),
1102 "gc.statepoint must read and write memory to preserve "
1103 "reordering restrictions required by safepoint semantics", &CI);
1105 const Value *Target = CS.getArgument(0);
1106 const PointerType *PT = dyn_cast<PointerType>(Target->getType());
1107 Assert2(PT && PT->getElementType()->isFunctionTy(),
1108 "gc.statepoint callee must be of function pointer type",
1110 FunctionType *TargetFuncType = cast<FunctionType>(PT->getElementType());
1112 const Value *NumCallArgsV = CS.getArgument(1);
1113 Assert1(isa<ConstantInt>(NumCallArgsV),
1114 "gc.statepoint number of arguments to underlying call "
1115 "must be constant integer", &CI);
1116 const int NumCallArgs = cast<ConstantInt>(NumCallArgsV)->getZExtValue();
1117 Assert1(NumCallArgs >= 0,
1118 "gc.statepoint number of arguments to underlying call "
1119 "must be positive", &CI);
1120 const int NumParams = (int)TargetFuncType->getNumParams();
1121 if (TargetFuncType->isVarArg()) {
1122 Assert1(NumCallArgs >= NumParams,
1123 "gc.statepoint mismatch in number of vararg call args", &CI);
1125 // TODO: Remove this limitation
1126 Assert1(TargetFuncType->getReturnType()->isVoidTy(),
1127 "gc.statepoint doesn't support wrapping non-void "
1128 "vararg functions yet", &CI);
1130 Assert1(NumCallArgs == NumParams,
1131 "gc.statepoint mismatch in number of call args", &CI);
1133 const Value *Unused = CS.getArgument(2);
1134 Assert1(isa<ConstantInt>(Unused) &&
1135 cast<ConstantInt>(Unused)->isNullValue(),
1136 "gc.statepoint parameter #3 must be zero", &CI);
1138 // Verify that the types of the call parameter arguments match
1139 // the type of the wrapped callee.
1140 for (int i = 0; i < NumParams; i++) {
1141 Type *ParamType = TargetFuncType->getParamType(i);
1142 Type *ArgType = CS.getArgument(3+i)->getType();
1143 Assert1(ArgType == ParamType,
1144 "gc.statepoint call argument does not match wrapped "
1145 "function type", &CI);
1147 const int EndCallArgsInx = 2+NumCallArgs;
1148 const Value *NumDeoptArgsV = CS.getArgument(EndCallArgsInx+1);
1149 Assert1(isa<ConstantInt>(NumDeoptArgsV),
1150 "gc.statepoint number of deoptimization arguments "
1151 "must be constant integer", &CI);
1152 const int NumDeoptArgs = cast<ConstantInt>(NumDeoptArgsV)->getZExtValue();
1153 Assert1(NumDeoptArgs >= 0,
1154 "gc.statepoint number of deoptimization arguments "
1155 "must be positive", &CI);
1157 Assert1(4 + NumCallArgs + NumDeoptArgs <= (int)CS.arg_size(),
1158 "gc.statepoint too few arguments according to length fields", &CI);
1160 // Check that the only uses of this gc.statepoint are gc.result or
1161 // gc.relocate calls which are tied to this statepoint and thus part
1162 // of the same statepoint sequence
1163 for (const User *U : CI.users()) {
1164 const CallInst *Call = dyn_cast<const CallInst>(U);
1165 Assert2(Call, "illegal use of statepoint token", &CI, U);
1166 if (!Call) continue;
1167 Assert2(isGCRelocate(Call) || isGCResult(Call),
1168 "gc.result or gc.relocate are the only value uses"
1169 "of a gc.statepoint", &CI, U);
1170 if (isGCResult(Call)) {
1171 Assert2(Call->getArgOperand(0) == &CI,
1172 "gc.result connected to wrong gc.statepoint",
1174 } else if (isGCRelocate(Call)) {
1175 Assert2(Call->getArgOperand(0) == &CI,
1176 "gc.relocate connected to wrong gc.statepoint",
1181 // Note: It is legal for a single derived pointer to be listed multiple
1182 // times. It's non-optimal, but it is legal. It can also happen after
1183 // insertion if we strip a bitcast away.
1184 // Note: It is really tempting to check that each base is relocated and
1185 // that a derived pointer is never reused as a base pointer. This turns
1186 // out to be problematic since optimizations run after safepoint insertion
1187 // can recognize equality properties that the insertion logic doesn't know
1188 // about. See example statepoint.ll in the verifier subdirectory
1191 // visitFunction - Verify that a function is ok.
1193 void Verifier::visitFunction(const Function &F) {
1194 // Check function arguments.
1195 FunctionType *FT = F.getFunctionType();
1196 unsigned NumArgs = F.arg_size();
1198 Assert1(Context == &F.getContext(),
1199 "Function context does not match Module context!", &F);
1201 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1202 Assert2(FT->getNumParams() == NumArgs,
1203 "# formal arguments must match # of arguments for function type!",
1205 Assert1(F.getReturnType()->isFirstClassType() ||
1206 F.getReturnType()->isVoidTy() ||
1207 F.getReturnType()->isStructTy(),
1208 "Functions cannot return aggregate values!", &F);
1210 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1211 "Invalid struct return type!", &F);
1213 AttributeSet Attrs = F.getAttributes();
1215 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1216 "Attribute after last parameter!", &F);
1218 // Check function attributes.
1219 VerifyFunctionAttrs(FT, Attrs, &F);
1221 // On function declarations/definitions, we do not support the builtin
1222 // attribute. We do not check this in VerifyFunctionAttrs since that is
1223 // checking for Attributes that can/can not ever be on functions.
1224 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1225 Attribute::Builtin),
1226 "Attribute 'builtin' can only be applied to a callsite.", &F);
1228 // Check that this function meets the restrictions on this calling convention.
1229 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
1230 // restrictions can be lifted.
1231 switch (F.getCallingConv()) {
1233 case CallingConv::C:
1235 case CallingConv::Fast:
1236 case CallingConv::Cold:
1237 case CallingConv::Intel_OCL_BI:
1238 case CallingConv::PTX_Kernel:
1239 case CallingConv::PTX_Device:
1240 Assert1(!F.isVarArg(), "Calling convention does not support varargs or "
1241 "perfect forwarding!", &F);
1245 bool isLLVMdotName = F.getName().size() >= 5 &&
1246 F.getName().substr(0, 5) == "llvm.";
1248 // Check that the argument values match the function type for this function...
1250 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1252 Assert2(I->getType() == FT->getParamType(i),
1253 "Argument value does not match function argument type!",
1254 I, FT->getParamType(i));
1255 Assert1(I->getType()->isFirstClassType(),
1256 "Function arguments must have first-class types!", I);
1258 Assert2(!I->getType()->isMetadataTy(),
1259 "Function takes metadata but isn't an intrinsic", I, &F);
1262 if (F.isMaterializable()) {
1263 // Function has a body somewhere we can't see.
1264 } else if (F.isDeclaration()) {
1265 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1266 "invalid linkage type for function declaration", &F);
1268 // Verify that this function (which has a body) is not named "llvm.*". It
1269 // is not legal to define intrinsics.
1270 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1272 // Check the entry node
1273 const BasicBlock *Entry = &F.getEntryBlock();
1274 Assert1(pred_empty(Entry),
1275 "Entry block to function must not have predecessors!", Entry);
1277 // The address of the entry block cannot be taken, unless it is dead.
1278 if (Entry->hasAddressTaken()) {
1279 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1280 "blockaddress may not be used with the entry block!", Entry);
1284 // If this function is actually an intrinsic, verify that it is only used in
1285 // direct call/invokes, never having its "address taken".
1286 if (F.getIntrinsicID()) {
1288 if (F.hasAddressTaken(&U))
1289 Assert1(0, "Invalid user of intrinsic instruction!", U);
1292 Assert1(!F.hasDLLImportStorageClass() ||
1293 (F.isDeclaration() && F.hasExternalLinkage()) ||
1294 F.hasAvailableExternallyLinkage(),
1295 "Function is marked as dllimport, but not external.", &F);
1298 // verifyBasicBlock - Verify that a basic block is well formed...
1300 void Verifier::visitBasicBlock(BasicBlock &BB) {
1301 InstsInThisBlock.clear();
1303 // Ensure that basic blocks have terminators!
1304 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1306 // Check constraints that this basic block imposes on all of the PHI nodes in
1308 if (isa<PHINode>(BB.front())) {
1309 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1310 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1311 std::sort(Preds.begin(), Preds.end());
1313 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1314 // Ensure that PHI nodes have at least one entry!
1315 Assert1(PN->getNumIncomingValues() != 0,
1316 "PHI nodes must have at least one entry. If the block is dead, "
1317 "the PHI should be removed!", PN);
1318 Assert1(PN->getNumIncomingValues() == Preds.size(),
1319 "PHINode should have one entry for each predecessor of its "
1320 "parent basic block!", PN);
1322 // Get and sort all incoming values in the PHI node...
1324 Values.reserve(PN->getNumIncomingValues());
1325 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1326 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1327 PN->getIncomingValue(i)));
1328 std::sort(Values.begin(), Values.end());
1330 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1331 // Check to make sure that if there is more than one entry for a
1332 // particular basic block in this PHI node, that the incoming values are
1335 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1336 Values[i].second == Values[i-1].second,
1337 "PHI node has multiple entries for the same basic block with "
1338 "different incoming values!", PN, Values[i].first,
1339 Values[i].second, Values[i-1].second);
1341 // Check to make sure that the predecessors and PHI node entries are
1343 Assert3(Values[i].first == Preds[i],
1344 "PHI node entries do not match predecessors!", PN,
1345 Values[i].first, Preds[i]);
1350 // Check that all instructions have their parent pointers set up correctly.
1353 Assert(I.getParent() == &BB, "Instruction has bogus parent pointer!");
1357 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1358 // Ensure that terminators only exist at the end of the basic block.
1359 Assert1(&I == I.getParent()->getTerminator(),
1360 "Terminator found in the middle of a basic block!", I.getParent());
1361 visitInstruction(I);
1364 void Verifier::visitBranchInst(BranchInst &BI) {
1365 if (BI.isConditional()) {
1366 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1367 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1369 visitTerminatorInst(BI);
1372 void Verifier::visitReturnInst(ReturnInst &RI) {
1373 Function *F = RI.getParent()->getParent();
1374 unsigned N = RI.getNumOperands();
1375 if (F->getReturnType()->isVoidTy())
1377 "Found return instr that returns non-void in Function of void "
1378 "return type!", &RI, F->getReturnType());
1380 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1381 "Function return type does not match operand "
1382 "type of return inst!", &RI, F->getReturnType());
1384 // Check to make sure that the return value has necessary properties for
1386 visitTerminatorInst(RI);
1389 void Verifier::visitSwitchInst(SwitchInst &SI) {
1390 // Check to make sure that all of the constants in the switch instruction
1391 // have the same type as the switched-on value.
1392 Type *SwitchTy = SI.getCondition()->getType();
1393 SmallPtrSet<ConstantInt*, 32> Constants;
1394 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1395 Assert1(i.getCaseValue()->getType() == SwitchTy,
1396 "Switch constants must all be same type as switch value!", &SI);
1397 Assert2(Constants.insert(i.getCaseValue()).second,
1398 "Duplicate integer as switch case", &SI, i.getCaseValue());
1401 visitTerminatorInst(SI);
1404 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1405 Assert1(BI.getAddress()->getType()->isPointerTy(),
1406 "Indirectbr operand must have pointer type!", &BI);
1407 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1408 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1409 "Indirectbr destinations must all have pointer type!", &BI);
1411 visitTerminatorInst(BI);
1414 void Verifier::visitSelectInst(SelectInst &SI) {
1415 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1417 "Invalid operands for select instruction!", &SI);
1419 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1420 "Select values must have same type as select instruction!", &SI);
1421 visitInstruction(SI);
1424 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1425 /// a pass, if any exist, it's an error.
1427 void Verifier::visitUserOp1(Instruction &I) {
1428 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1431 void Verifier::visitTruncInst(TruncInst &I) {
1432 // Get the source and destination types
1433 Type *SrcTy = I.getOperand(0)->getType();
1434 Type *DestTy = I.getType();
1436 // Get the size of the types in bits, we'll need this later
1437 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1438 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1440 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1441 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1442 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1443 "trunc source and destination must both be a vector or neither", &I);
1444 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1446 visitInstruction(I);
1449 void Verifier::visitZExtInst(ZExtInst &I) {
1450 // Get the source and destination types
1451 Type *SrcTy = I.getOperand(0)->getType();
1452 Type *DestTy = I.getType();
1454 // Get the size of the types in bits, we'll need this later
1455 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1456 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1457 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1458 "zext source and destination must both be a vector or neither", &I);
1459 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1460 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1462 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1464 visitInstruction(I);
1467 void Verifier::visitSExtInst(SExtInst &I) {
1468 // Get the source and destination types
1469 Type *SrcTy = I.getOperand(0)->getType();
1470 Type *DestTy = I.getType();
1472 // Get the size of the types in bits, we'll need this later
1473 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1474 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1476 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1477 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1478 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1479 "sext source and destination must both be a vector or neither", &I);
1480 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1482 visitInstruction(I);
1485 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1486 // Get the source and destination types
1487 Type *SrcTy = I.getOperand(0)->getType();
1488 Type *DestTy = I.getType();
1489 // Get the size of the types in bits, we'll need this later
1490 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1491 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1493 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1494 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1495 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1496 "fptrunc source and destination must both be a vector or neither",&I);
1497 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1499 visitInstruction(I);
1502 void Verifier::visitFPExtInst(FPExtInst &I) {
1503 // Get the source and destination types
1504 Type *SrcTy = I.getOperand(0)->getType();
1505 Type *DestTy = I.getType();
1507 // Get the size of the types in bits, we'll need this later
1508 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1509 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1511 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1512 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1513 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1514 "fpext source and destination must both be a vector or neither", &I);
1515 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1517 visitInstruction(I);
1520 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1521 // Get the source and destination types
1522 Type *SrcTy = I.getOperand(0)->getType();
1523 Type *DestTy = I.getType();
1525 bool SrcVec = SrcTy->isVectorTy();
1526 bool DstVec = DestTy->isVectorTy();
1528 Assert1(SrcVec == DstVec,
1529 "UIToFP source and dest must both be vector or scalar", &I);
1530 Assert1(SrcTy->isIntOrIntVectorTy(),
1531 "UIToFP source must be integer or integer vector", &I);
1532 Assert1(DestTy->isFPOrFPVectorTy(),
1533 "UIToFP result must be FP or FP vector", &I);
1535 if (SrcVec && DstVec)
1536 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1537 cast<VectorType>(DestTy)->getNumElements(),
1538 "UIToFP source and dest vector length mismatch", &I);
1540 visitInstruction(I);
1543 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1544 // Get the source and destination types
1545 Type *SrcTy = I.getOperand(0)->getType();
1546 Type *DestTy = I.getType();
1548 bool SrcVec = SrcTy->isVectorTy();
1549 bool DstVec = DestTy->isVectorTy();
1551 Assert1(SrcVec == DstVec,
1552 "SIToFP source and dest must both be vector or scalar", &I);
1553 Assert1(SrcTy->isIntOrIntVectorTy(),
1554 "SIToFP source must be integer or integer vector", &I);
1555 Assert1(DestTy->isFPOrFPVectorTy(),
1556 "SIToFP result must be FP or FP vector", &I);
1558 if (SrcVec && DstVec)
1559 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1560 cast<VectorType>(DestTy)->getNumElements(),
1561 "SIToFP source and dest vector length mismatch", &I);
1563 visitInstruction(I);
1566 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1567 // Get the source and destination types
1568 Type *SrcTy = I.getOperand(0)->getType();
1569 Type *DestTy = I.getType();
1571 bool SrcVec = SrcTy->isVectorTy();
1572 bool DstVec = DestTy->isVectorTy();
1574 Assert1(SrcVec == DstVec,
1575 "FPToUI source and dest must both be vector or scalar", &I);
1576 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1578 Assert1(DestTy->isIntOrIntVectorTy(),
1579 "FPToUI result must be integer or integer vector", &I);
1581 if (SrcVec && DstVec)
1582 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1583 cast<VectorType>(DestTy)->getNumElements(),
1584 "FPToUI source and dest vector length mismatch", &I);
1586 visitInstruction(I);
1589 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1590 // Get the source and destination types
1591 Type *SrcTy = I.getOperand(0)->getType();
1592 Type *DestTy = I.getType();
1594 bool SrcVec = SrcTy->isVectorTy();
1595 bool DstVec = DestTy->isVectorTy();
1597 Assert1(SrcVec == DstVec,
1598 "FPToSI source and dest must both be vector or scalar", &I);
1599 Assert1(SrcTy->isFPOrFPVectorTy(),
1600 "FPToSI source must be FP or FP vector", &I);
1601 Assert1(DestTy->isIntOrIntVectorTy(),
1602 "FPToSI result must be integer or integer vector", &I);
1604 if (SrcVec && DstVec)
1605 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1606 cast<VectorType>(DestTy)->getNumElements(),
1607 "FPToSI source and dest vector length mismatch", &I);
1609 visitInstruction(I);
1612 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1613 // Get the source and destination types
1614 Type *SrcTy = I.getOperand(0)->getType();
1615 Type *DestTy = I.getType();
1617 Assert1(SrcTy->getScalarType()->isPointerTy(),
1618 "PtrToInt source must be pointer", &I);
1619 Assert1(DestTy->getScalarType()->isIntegerTy(),
1620 "PtrToInt result must be integral", &I);
1621 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1622 "PtrToInt type mismatch", &I);
1624 if (SrcTy->isVectorTy()) {
1625 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1626 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1627 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1628 "PtrToInt Vector width mismatch", &I);
1631 visitInstruction(I);
1634 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1635 // Get the source and destination types
1636 Type *SrcTy = I.getOperand(0)->getType();
1637 Type *DestTy = I.getType();
1639 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1640 "IntToPtr source must be an integral", &I);
1641 Assert1(DestTy->getScalarType()->isPointerTy(),
1642 "IntToPtr result must be a pointer",&I);
1643 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1644 "IntToPtr type mismatch", &I);
1645 if (SrcTy->isVectorTy()) {
1646 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1647 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1648 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1649 "IntToPtr Vector width mismatch", &I);
1651 visitInstruction(I);
1654 void Verifier::visitBitCastInst(BitCastInst &I) {
1656 CastInst::castIsValid(Instruction::BitCast, I.getOperand(0), I.getType()),
1657 "Invalid bitcast", &I);
1658 visitInstruction(I);
1661 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1662 Type *SrcTy = I.getOperand(0)->getType();
1663 Type *DestTy = I.getType();
1665 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1666 "AddrSpaceCast source must be a pointer", &I);
1667 Assert1(DestTy->isPtrOrPtrVectorTy(),
1668 "AddrSpaceCast result must be a pointer", &I);
1669 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1670 "AddrSpaceCast must be between different address spaces", &I);
1671 if (SrcTy->isVectorTy())
1672 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1673 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1674 visitInstruction(I);
1677 /// visitPHINode - Ensure that a PHI node is well formed.
1679 void Verifier::visitPHINode(PHINode &PN) {
1680 // Ensure that the PHI nodes are all grouped together at the top of the block.
1681 // This can be tested by checking whether the instruction before this is
1682 // either nonexistent (because this is begin()) or is a PHI node. If not,
1683 // then there is some other instruction before a PHI.
1684 Assert2(&PN == &PN.getParent()->front() ||
1685 isa<PHINode>(--BasicBlock::iterator(&PN)),
1686 "PHI nodes not grouped at top of basic block!",
1687 &PN, PN.getParent());
1689 // Check that all of the values of the PHI node have the same type as the
1690 // result, and that the incoming blocks are really basic blocks.
1691 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1692 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1693 "PHI node operands are not the same type as the result!", &PN);
1696 // All other PHI node constraints are checked in the visitBasicBlock method.
1698 visitInstruction(PN);
1701 void Verifier::VerifyCallSite(CallSite CS) {
1702 Instruction *I = CS.getInstruction();
1704 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1705 "Called function must be a pointer!", I);
1706 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1708 Assert1(FPTy->getElementType()->isFunctionTy(),
1709 "Called function is not pointer to function type!", I);
1710 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1712 // Verify that the correct number of arguments are being passed
1713 if (FTy->isVarArg())
1714 Assert1(CS.arg_size() >= FTy->getNumParams(),
1715 "Called function requires more parameters than were provided!",I);
1717 Assert1(CS.arg_size() == FTy->getNumParams(),
1718 "Incorrect number of arguments passed to called function!", I);
1720 // Verify that all arguments to the call match the function type.
1721 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1722 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1723 "Call parameter type does not match function signature!",
1724 CS.getArgument(i), FTy->getParamType(i), I);
1726 AttributeSet Attrs = CS.getAttributes();
1728 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1729 "Attribute after last parameter!", I);
1731 // Verify call attributes.
1732 VerifyFunctionAttrs(FTy, Attrs, I);
1734 // Conservatively check the inalloca argument.
1735 // We have a bug if we can find that there is an underlying alloca without
1737 if (CS.hasInAllocaArgument()) {
1738 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
1739 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
1740 Assert2(AI->isUsedWithInAlloca(),
1741 "inalloca argument for call has mismatched alloca", AI, I);
1744 if (FTy->isVarArg()) {
1745 // FIXME? is 'nest' even legal here?
1746 bool SawNest = false;
1747 bool SawReturned = false;
1749 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1750 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1752 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1756 // Check attributes on the varargs part.
1757 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1758 Type *Ty = CS.getArgument(Idx-1)->getType();
1759 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1761 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1762 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1766 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1767 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1769 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1770 "Incompatible argument and return types for 'returned' "
1775 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1776 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1778 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1779 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1784 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1785 if (CS.getCalledFunction() == nullptr ||
1786 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1787 for (FunctionType::param_iterator PI = FTy->param_begin(),
1788 PE = FTy->param_end(); PI != PE; ++PI)
1789 Assert1(!(*PI)->isMetadataTy(),
1790 "Function has metadata parameter but isn't an intrinsic", I);
1793 visitInstruction(*I);
1796 /// Two types are "congruent" if they are identical, or if they are both pointer
1797 /// types with different pointee types and the same address space.
1798 static bool isTypeCongruent(Type *L, Type *R) {
1801 PointerType *PL = dyn_cast<PointerType>(L);
1802 PointerType *PR = dyn_cast<PointerType>(R);
1805 return PL->getAddressSpace() == PR->getAddressSpace();
1808 static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
1809 static const Attribute::AttrKind ABIAttrs[] = {
1810 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
1811 Attribute::InReg, Attribute::Returned};
1813 for (auto AK : ABIAttrs) {
1814 if (Attrs.hasAttribute(I + 1, AK))
1815 Copy.addAttribute(AK);
1817 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
1818 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
1822 void Verifier::verifyMustTailCall(CallInst &CI) {
1823 Assert1(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI);
1825 // - The caller and callee prototypes must match. Pointer types of
1826 // parameters or return types may differ in pointee type, but not
1828 Function *F = CI.getParent()->getParent();
1829 auto GetFnTy = [](Value *V) {
1830 return cast<FunctionType>(
1831 cast<PointerType>(V->getType())->getElementType());
1833 FunctionType *CallerTy = GetFnTy(F);
1834 FunctionType *CalleeTy = GetFnTy(CI.getCalledValue());
1835 Assert1(CallerTy->getNumParams() == CalleeTy->getNumParams(),
1836 "cannot guarantee tail call due to mismatched parameter counts", &CI);
1837 Assert1(CallerTy->isVarArg() == CalleeTy->isVarArg(),
1838 "cannot guarantee tail call due to mismatched varargs", &CI);
1839 Assert1(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),
1840 "cannot guarantee tail call due to mismatched return types", &CI);
1841 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1843 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),
1844 "cannot guarantee tail call due to mismatched parameter types", &CI);
1847 // - The calling conventions of the caller and callee must match.
1848 Assert1(F->getCallingConv() == CI.getCallingConv(),
1849 "cannot guarantee tail call due to mismatched calling conv", &CI);
1851 // - All ABI-impacting function attributes, such as sret, byval, inreg,
1852 // returned, and inalloca, must match.
1853 AttributeSet CallerAttrs = F->getAttributes();
1854 AttributeSet CalleeAttrs = CI.getAttributes();
1855 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1856 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
1857 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
1858 Assert2(CallerABIAttrs == CalleeABIAttrs,
1859 "cannot guarantee tail call due to mismatched ABI impacting "
1860 "function attributes", &CI, CI.getOperand(I));
1863 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
1864 // or a pointer bitcast followed by a ret instruction.
1865 // - The ret instruction must return the (possibly bitcasted) value
1866 // produced by the call or void.
1867 Value *RetVal = &CI;
1868 Instruction *Next = CI.getNextNode();
1870 // Handle the optional bitcast.
1871 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
1872 Assert1(BI->getOperand(0) == RetVal,
1873 "bitcast following musttail call must use the call", BI);
1875 Next = BI->getNextNode();
1878 // Check the return.
1879 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
1880 Assert1(Ret, "musttail call must be precede a ret with an optional bitcast",
1882 Assert1(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,
1883 "musttail call result must be returned", Ret);
1886 void Verifier::visitCallInst(CallInst &CI) {
1887 VerifyCallSite(&CI);
1889 if (CI.isMustTailCall())
1890 verifyMustTailCall(CI);
1892 if (Function *F = CI.getCalledFunction())
1893 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1894 visitIntrinsicFunctionCall(ID, CI);
1897 void Verifier::visitInvokeInst(InvokeInst &II) {
1898 VerifyCallSite(&II);
1900 // Verify that there is a landingpad instruction as the first non-PHI
1901 // instruction of the 'unwind' destination.
1902 Assert1(II.getUnwindDest()->isLandingPad(),
1903 "The unwind destination does not have a landingpad instruction!",&II);
1905 visitTerminatorInst(II);
1908 /// visitBinaryOperator - Check that both arguments to the binary operator are
1909 /// of the same type!
1911 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1912 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1913 "Both operands to a binary operator are not of the same type!", &B);
1915 switch (B.getOpcode()) {
1916 // Check that integer arithmetic operators are only used with
1917 // integral operands.
1918 case Instruction::Add:
1919 case Instruction::Sub:
1920 case Instruction::Mul:
1921 case Instruction::SDiv:
1922 case Instruction::UDiv:
1923 case Instruction::SRem:
1924 case Instruction::URem:
1925 Assert1(B.getType()->isIntOrIntVectorTy(),
1926 "Integer arithmetic operators only work with integral types!", &B);
1927 Assert1(B.getType() == B.getOperand(0)->getType(),
1928 "Integer arithmetic operators must have same type "
1929 "for operands and result!", &B);
1931 // Check that floating-point arithmetic operators are only used with
1932 // floating-point operands.
1933 case Instruction::FAdd:
1934 case Instruction::FSub:
1935 case Instruction::FMul:
1936 case Instruction::FDiv:
1937 case Instruction::FRem:
1938 Assert1(B.getType()->isFPOrFPVectorTy(),
1939 "Floating-point arithmetic operators only work with "
1940 "floating-point types!", &B);
1941 Assert1(B.getType() == B.getOperand(0)->getType(),
1942 "Floating-point arithmetic operators must have same type "
1943 "for operands and result!", &B);
1945 // Check that logical operators are only used with integral operands.
1946 case Instruction::And:
1947 case Instruction::Or:
1948 case Instruction::Xor:
1949 Assert1(B.getType()->isIntOrIntVectorTy(),
1950 "Logical operators only work with integral types!", &B);
1951 Assert1(B.getType() == B.getOperand(0)->getType(),
1952 "Logical operators must have same type for operands and result!",
1955 case Instruction::Shl:
1956 case Instruction::LShr:
1957 case Instruction::AShr:
1958 Assert1(B.getType()->isIntOrIntVectorTy(),
1959 "Shifts only work with integral types!", &B);
1960 Assert1(B.getType() == B.getOperand(0)->getType(),
1961 "Shift return type must be same as operands!", &B);
1964 llvm_unreachable("Unknown BinaryOperator opcode!");
1967 visitInstruction(B);
1970 void Verifier::visitICmpInst(ICmpInst &IC) {
1971 // Check that the operands are the same type
1972 Type *Op0Ty = IC.getOperand(0)->getType();
1973 Type *Op1Ty = IC.getOperand(1)->getType();
1974 Assert1(Op0Ty == Op1Ty,
1975 "Both operands to ICmp instruction are not of the same type!", &IC);
1976 // Check that the operands are the right type
1977 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1978 "Invalid operand types for ICmp instruction", &IC);
1979 // Check that the predicate is valid.
1980 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1981 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1982 "Invalid predicate in ICmp instruction!", &IC);
1984 visitInstruction(IC);
1987 void Verifier::visitFCmpInst(FCmpInst &FC) {
1988 // Check that the operands are the same type
1989 Type *Op0Ty = FC.getOperand(0)->getType();
1990 Type *Op1Ty = FC.getOperand(1)->getType();
1991 Assert1(Op0Ty == Op1Ty,
1992 "Both operands to FCmp instruction are not of the same type!", &FC);
1993 // Check that the operands are the right type
1994 Assert1(Op0Ty->isFPOrFPVectorTy(),
1995 "Invalid operand types for FCmp instruction", &FC);
1996 // Check that the predicate is valid.
1997 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1998 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1999 "Invalid predicate in FCmp instruction!", &FC);
2001 visitInstruction(FC);
2004 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
2005 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
2007 "Invalid extractelement operands!", &EI);
2008 visitInstruction(EI);
2011 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
2012 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
2015 "Invalid insertelement operands!", &IE);
2016 visitInstruction(IE);
2019 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
2020 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
2022 "Invalid shufflevector operands!", &SV);
2023 visitInstruction(SV);
2026 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
2027 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
2029 Assert1(isa<PointerType>(TargetTy),
2030 "GEP base pointer is not a vector or a vector of pointers", &GEP);
2031 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
2032 "GEP into unsized type!", &GEP);
2033 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
2034 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
2037 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
2039 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
2040 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
2042 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
2043 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
2044 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
2046 if (GEP.getPointerOperandType()->isVectorTy()) {
2047 // Additional checks for vector GEPs.
2048 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
2049 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
2050 "Vector GEP result width doesn't match operand's", &GEP);
2051 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
2052 Type *IndexTy = Idxs[i]->getType();
2053 Assert1(IndexTy->isVectorTy(),
2054 "Vector GEP must have vector indices!", &GEP);
2055 unsigned IndexWidth = IndexTy->getVectorNumElements();
2056 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
2059 visitInstruction(GEP);
2062 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
2063 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
2066 void Verifier::visitRangeMetadata(Instruction& I,
2067 MDNode* Range, Type* Ty) {
2069 Range == I.getMetadata(LLVMContext::MD_range) &&
2070 "precondition violation");
2072 unsigned NumOperands = Range->getNumOperands();
2073 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
2074 unsigned NumRanges = NumOperands / 2;
2075 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
2077 ConstantRange LastRange(1); // Dummy initial value
2078 for (unsigned i = 0; i < NumRanges; ++i) {
2080 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i));
2081 Assert1(Low, "The lower limit must be an integer!", Low);
2083 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i + 1));
2084 Assert1(High, "The upper limit must be an integer!", High);
2085 Assert1(High->getType() == Low->getType() &&
2086 High->getType() == Ty, "Range types must match instruction type!",
2089 APInt HighV = High->getValue();
2090 APInt LowV = Low->getValue();
2091 ConstantRange CurRange(LowV, HighV);
2092 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
2093 "Range must not be empty!", Range);
2095 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
2096 "Intervals are overlapping", Range);
2097 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
2099 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
2102 LastRange = ConstantRange(LowV, HighV);
2104 if (NumRanges > 2) {
2106 mdconst::dyn_extract<ConstantInt>(Range->getOperand(0))->getValue();
2108 mdconst::dyn_extract<ConstantInt>(Range->getOperand(1))->getValue();
2109 ConstantRange FirstRange(FirstLow, FirstHigh);
2110 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
2111 "Intervals are overlapping", Range);
2112 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
2117 void Verifier::visitLoadInst(LoadInst &LI) {
2118 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
2119 Assert1(PTy, "Load operand must be a pointer.", &LI);
2120 Type *ElTy = PTy->getElementType();
2121 Assert2(ElTy == LI.getType(),
2122 "Load result type does not match pointer operand type!", &LI, ElTy);
2123 Assert1(LI.getAlignment() <= Value::MaximumAlignment,
2124 "huge alignment values are unsupported", &LI);
2125 if (LI.isAtomic()) {
2126 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
2127 "Load cannot have Release ordering", &LI);
2128 Assert1(LI.getAlignment() != 0,
2129 "Atomic load must specify explicit alignment", &LI);
2130 if (!ElTy->isPointerTy()) {
2131 Assert2(ElTy->isIntegerTy(),
2132 "atomic load operand must have integer type!",
2134 unsigned Size = ElTy->getPrimitiveSizeInBits();
2135 Assert2(Size >= 8 && !(Size & (Size - 1)),
2136 "atomic load operand must be power-of-two byte-sized integer",
2140 Assert1(LI.getSynchScope() == CrossThread,
2141 "Non-atomic load cannot have SynchronizationScope specified", &LI);
2144 visitInstruction(LI);
2147 void Verifier::visitStoreInst(StoreInst &SI) {
2148 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
2149 Assert1(PTy, "Store operand must be a pointer.", &SI);
2150 Type *ElTy = PTy->getElementType();
2151 Assert2(ElTy == SI.getOperand(0)->getType(),
2152 "Stored value type does not match pointer operand type!",
2154 Assert1(SI.getAlignment() <= Value::MaximumAlignment,
2155 "huge alignment values are unsupported", &SI);
2156 if (SI.isAtomic()) {
2157 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
2158 "Store cannot have Acquire ordering", &SI);
2159 Assert1(SI.getAlignment() != 0,
2160 "Atomic store must specify explicit alignment", &SI);
2161 if (!ElTy->isPointerTy()) {
2162 Assert2(ElTy->isIntegerTy(),
2163 "atomic store operand must have integer type!",
2165 unsigned Size = ElTy->getPrimitiveSizeInBits();
2166 Assert2(Size >= 8 && !(Size & (Size - 1)),
2167 "atomic store operand must be power-of-two byte-sized integer",
2171 Assert1(SI.getSynchScope() == CrossThread,
2172 "Non-atomic store cannot have SynchronizationScope specified", &SI);
2174 visitInstruction(SI);
2177 void Verifier::visitAllocaInst(AllocaInst &AI) {
2178 SmallPtrSet<const Type*, 4> Visited;
2179 PointerType *PTy = AI.getType();
2180 Assert1(PTy->getAddressSpace() == 0,
2181 "Allocation instruction pointer not in the generic address space!",
2183 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
2185 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
2186 "Alloca array size must have integer type", &AI);
2187 Assert1(AI.getAlignment() <= Value::MaximumAlignment,
2188 "huge alignment values are unsupported", &AI);
2190 visitInstruction(AI);
2193 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
2195 // FIXME: more conditions???
2196 Assert1(CXI.getSuccessOrdering() != NotAtomic,
2197 "cmpxchg instructions must be atomic.", &CXI);
2198 Assert1(CXI.getFailureOrdering() != NotAtomic,
2199 "cmpxchg instructions must be atomic.", &CXI);
2200 Assert1(CXI.getSuccessOrdering() != Unordered,
2201 "cmpxchg instructions cannot be unordered.", &CXI);
2202 Assert1(CXI.getFailureOrdering() != Unordered,
2203 "cmpxchg instructions cannot be unordered.", &CXI);
2204 Assert1(CXI.getSuccessOrdering() >= CXI.getFailureOrdering(),
2205 "cmpxchg instructions be at least as constrained on success as fail",
2207 Assert1(CXI.getFailureOrdering() != Release &&
2208 CXI.getFailureOrdering() != AcquireRelease,
2209 "cmpxchg failure ordering cannot include release semantics", &CXI);
2211 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
2212 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
2213 Type *ElTy = PTy->getElementType();
2214 Assert2(ElTy->isIntegerTy(),
2215 "cmpxchg operand must have integer type!",
2217 unsigned Size = ElTy->getPrimitiveSizeInBits();
2218 Assert2(Size >= 8 && !(Size & (Size - 1)),
2219 "cmpxchg operand must be power-of-two byte-sized integer",
2221 Assert2(ElTy == CXI.getOperand(1)->getType(),
2222 "Expected value type does not match pointer operand type!",
2224 Assert2(ElTy == CXI.getOperand(2)->getType(),
2225 "Stored value type does not match pointer operand type!",
2227 visitInstruction(CXI);
2230 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
2231 Assert1(RMWI.getOrdering() != NotAtomic,
2232 "atomicrmw instructions must be atomic.", &RMWI);
2233 Assert1(RMWI.getOrdering() != Unordered,
2234 "atomicrmw instructions cannot be unordered.", &RMWI);
2235 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
2236 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
2237 Type *ElTy = PTy->getElementType();
2238 Assert2(ElTy->isIntegerTy(),
2239 "atomicrmw operand must have integer type!",
2241 unsigned Size = ElTy->getPrimitiveSizeInBits();
2242 Assert2(Size >= 8 && !(Size & (Size - 1)),
2243 "atomicrmw operand must be power-of-two byte-sized integer",
2245 Assert2(ElTy == RMWI.getOperand(1)->getType(),
2246 "Argument value type does not match pointer operand type!",
2248 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
2249 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
2250 "Invalid binary operation!", &RMWI);
2251 visitInstruction(RMWI);
2254 void Verifier::visitFenceInst(FenceInst &FI) {
2255 const AtomicOrdering Ordering = FI.getOrdering();
2256 Assert1(Ordering == Acquire || Ordering == Release ||
2257 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
2258 "fence instructions may only have "
2259 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
2260 visitInstruction(FI);
2263 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
2264 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
2265 EVI.getIndices()) ==
2267 "Invalid ExtractValueInst operands!", &EVI);
2269 visitInstruction(EVI);
2272 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
2273 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
2274 IVI.getIndices()) ==
2275 IVI.getOperand(1)->getType(),
2276 "Invalid InsertValueInst operands!", &IVI);
2278 visitInstruction(IVI);
2281 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
2282 BasicBlock *BB = LPI.getParent();
2284 // The landingpad instruction is ill-formed if it doesn't have any clauses and
2286 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
2287 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
2289 // The landingpad instruction defines its parent as a landing pad block. The
2290 // landing pad block may be branched to only by the unwind edge of an invoke.
2291 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
2292 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
2293 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
2294 "Block containing LandingPadInst must be jumped to "
2295 "only by the unwind edge of an invoke.", &LPI);
2298 // The landingpad instruction must be the first non-PHI instruction in the
2300 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
2301 "LandingPadInst not the first non-PHI instruction in the block.",
2304 // The personality functions for all landingpad instructions within the same
2305 // function should match.
2307 Assert1(LPI.getPersonalityFn() == PersonalityFn,
2308 "Personality function doesn't match others in function", &LPI);
2309 PersonalityFn = LPI.getPersonalityFn();
2311 // All operands must be constants.
2312 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
2314 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
2315 Constant *Clause = LPI.getClause(i);
2316 if (LPI.isCatch(i)) {
2317 Assert1(isa<PointerType>(Clause->getType()),
2318 "Catch operand does not have pointer type!", &LPI);
2320 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
2321 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
2322 "Filter operand is not an array of constants!", &LPI);
2326 visitInstruction(LPI);
2329 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
2330 Instruction *Op = cast<Instruction>(I.getOperand(i));
2331 // If the we have an invalid invoke, don't try to compute the dominance.
2332 // We already reject it in the invoke specific checks and the dominance
2333 // computation doesn't handle multiple edges.
2334 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2335 if (II->getNormalDest() == II->getUnwindDest())
2339 const Use &U = I.getOperandUse(i);
2340 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
2341 "Instruction does not dominate all uses!", Op, &I);
2344 /// verifyInstruction - Verify that an instruction is well formed.
2346 void Verifier::visitInstruction(Instruction &I) {
2347 BasicBlock *BB = I.getParent();
2348 Assert1(BB, "Instruction not embedded in basic block!", &I);
2350 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2351 for (User *U : I.users()) {
2352 Assert1(U != (User*)&I || !DT.isReachableFromEntry(BB),
2353 "Only PHI nodes may reference their own value!", &I);
2357 // Check that void typed values don't have names
2358 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2359 "Instruction has a name, but provides a void value!", &I);
2361 // Check that the return value of the instruction is either void or a legal
2363 Assert1(I.getType()->isVoidTy() ||
2364 I.getType()->isFirstClassType(),
2365 "Instruction returns a non-scalar type!", &I);
2367 // Check that the instruction doesn't produce metadata. Calls are already
2368 // checked against the callee type.
2369 Assert1(!I.getType()->isMetadataTy() ||
2370 isa<CallInst>(I) || isa<InvokeInst>(I),
2371 "Invalid use of metadata!", &I);
2373 // Check that all uses of the instruction, if they are instructions
2374 // themselves, actually have parent basic blocks. If the use is not an
2375 // instruction, it is an error!
2376 for (Use &U : I.uses()) {
2377 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
2378 Assert2(Used->getParent() != nullptr, "Instruction referencing"
2379 " instruction not embedded in a basic block!", &I, Used);
2381 CheckFailed("Use of instruction is not an instruction!", U);
2386 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2387 Assert1(I.getOperand(i) != nullptr, "Instruction has null operand!", &I);
2389 // Check to make sure that only first-class-values are operands to
2391 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2392 Assert1(0, "Instruction operands must be first-class values!", &I);
2395 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2396 // Check to make sure that the "address of" an intrinsic function is never
2398 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 :
2399 isa<InvokeInst>(I) ? e-3 : 0),
2400 "Cannot take the address of an intrinsic!", &I);
2401 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2402 F->getIntrinsicID() == Intrinsic::donothing ||
2403 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void ||
2404 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64,
2405 "Cannot invoke an intrinsinc other than"
2406 " donothing or patchpoint", &I);
2407 Assert1(F->getParent() == M, "Referencing function in another module!",
2409 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2410 Assert1(OpBB->getParent() == BB->getParent(),
2411 "Referring to a basic block in another function!", &I);
2412 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2413 Assert1(OpArg->getParent() == BB->getParent(),
2414 "Referring to an argument in another function!", &I);
2415 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2416 Assert1(GV->getParent() == M, "Referencing global in another module!",
2418 } else if (isa<Instruction>(I.getOperand(i))) {
2419 verifyDominatesUse(I, i);
2420 } else if (isa<InlineAsm>(I.getOperand(i))) {
2421 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2422 (i + 3 == e && isa<InvokeInst>(I)),
2423 "Cannot take the address of an inline asm!", &I);
2424 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2425 if (CE->getType()->isPtrOrPtrVectorTy()) {
2426 // If we have a ConstantExpr pointer, we need to see if it came from an
2427 // illegal bitcast (inttoptr <constant int> )
2428 SmallVector<const ConstantExpr *, 4> Stack;
2429 SmallPtrSet<const ConstantExpr *, 4> Visited;
2430 Stack.push_back(CE);
2432 while (!Stack.empty()) {
2433 const ConstantExpr *V = Stack.pop_back_val();
2434 if (!Visited.insert(V).second)
2437 VerifyConstantExprBitcastType(V);
2439 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2440 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2441 Stack.push_back(Op);
2448 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2449 Assert1(I.getType()->isFPOrFPVectorTy(),
2450 "fpmath requires a floating point result!", &I);
2451 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2452 if (ConstantFP *CFP0 =
2453 mdconst::dyn_extract_or_null<ConstantFP>(MD->getOperand(0))) {
2454 APFloat Accuracy = CFP0->getValueAPF();
2455 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2456 "fpmath accuracy not a positive number!", &I);
2458 Assert1(false, "invalid fpmath accuracy!", &I);
2462 if (MDNode *Range = I.getMetadata(LLVMContext::MD_range)) {
2463 Assert1(isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),
2464 "Ranges are only for loads, calls and invokes!", &I);
2465 visitRangeMetadata(I, Range, I.getType());
2468 if (I.getMetadata(LLVMContext::MD_nonnull)) {
2469 Assert1(I.getType()->isPointerTy(),
2470 "nonnull applies only to pointer types", &I);
2471 Assert1(isa<LoadInst>(I),
2472 "nonnull applies only to load instructions, use attributes"
2473 " for calls or invokes", &I);
2476 InstsInThisBlock.insert(&I);
2479 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2480 /// intrinsic argument or return value) matches the type constraints specified
2481 /// by the .td file (e.g. an "any integer" argument really is an integer).
2483 /// This return true on error but does not print a message.
2484 bool Verifier::VerifyIntrinsicType(Type *Ty,
2485 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2486 SmallVectorImpl<Type*> &ArgTys) {
2487 using namespace Intrinsic;
2489 // If we ran out of descriptors, there are too many arguments.
2490 if (Infos.empty()) return true;
2491 IITDescriptor D = Infos.front();
2492 Infos = Infos.slice(1);
2495 case IITDescriptor::Void: return !Ty->isVoidTy();
2496 case IITDescriptor::VarArg: return true;
2497 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2498 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2499 case IITDescriptor::Half: return !Ty->isHalfTy();
2500 case IITDescriptor::Float: return !Ty->isFloatTy();
2501 case IITDescriptor::Double: return !Ty->isDoubleTy();
2502 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2503 case IITDescriptor::Vector: {
2504 VectorType *VT = dyn_cast<VectorType>(Ty);
2505 return !VT || VT->getNumElements() != D.Vector_Width ||
2506 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2508 case IITDescriptor::Pointer: {
2509 PointerType *PT = dyn_cast<PointerType>(Ty);
2510 return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2511 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2514 case IITDescriptor::Struct: {
2515 StructType *ST = dyn_cast<StructType>(Ty);
2516 if (!ST || ST->getNumElements() != D.Struct_NumElements)
2519 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2520 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2525 case IITDescriptor::Argument:
2526 // Two cases here - If this is the second occurrence of an argument, verify
2527 // that the later instance matches the previous instance.
2528 if (D.getArgumentNumber() < ArgTys.size())
2529 return Ty != ArgTys[D.getArgumentNumber()];
2531 // Otherwise, if this is the first instance of an argument, record it and
2532 // verify the "Any" kind.
2533 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2534 ArgTys.push_back(Ty);
2536 switch (D.getArgumentKind()) {
2537 case IITDescriptor::AK_Any: return false; // Success
2538 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2539 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2540 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2541 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2543 llvm_unreachable("all argument kinds not covered");
2545 case IITDescriptor::ExtendArgument: {
2546 // This may only be used when referring to a previous vector argument.
2547 if (D.getArgumentNumber() >= ArgTys.size())
2550 Type *NewTy = ArgTys[D.getArgumentNumber()];
2551 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2552 NewTy = VectorType::getExtendedElementVectorType(VTy);
2553 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2554 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2560 case IITDescriptor::TruncArgument: {
2561 // This may only be used when referring to a previous vector argument.
2562 if (D.getArgumentNumber() >= ArgTys.size())
2565 Type *NewTy = ArgTys[D.getArgumentNumber()];
2566 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2567 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2568 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2569 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
2575 case IITDescriptor::HalfVecArgument:
2576 // This may only be used when referring to a previous vector argument.
2577 return D.getArgumentNumber() >= ArgTys.size() ||
2578 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2579 VectorType::getHalfElementsVectorType(
2580 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2581 case IITDescriptor::SameVecWidthArgument: {
2582 if (D.getArgumentNumber() >= ArgTys.size())
2584 VectorType * ReferenceType =
2585 dyn_cast<VectorType>(ArgTys[D.getArgumentNumber()]);
2586 VectorType *ThisArgType = dyn_cast<VectorType>(Ty);
2587 if (!ThisArgType || !ReferenceType ||
2588 (ReferenceType->getVectorNumElements() !=
2589 ThisArgType->getVectorNumElements()))
2591 return VerifyIntrinsicType(ThisArgType->getVectorElementType(),
2594 case IITDescriptor::PtrToArgument: {
2595 if (D.getArgumentNumber() >= ArgTys.size())
2597 Type * ReferenceType = ArgTys[D.getArgumentNumber()];
2598 PointerType *ThisArgType = dyn_cast<PointerType>(Ty);
2599 return (!ThisArgType || ThisArgType->getElementType() != ReferenceType);
2601 case IITDescriptor::VecOfPtrsToElt: {
2602 if (D.getArgumentNumber() >= ArgTys.size())
2604 VectorType * ReferenceType =
2605 dyn_cast<VectorType> (ArgTys[D.getArgumentNumber()]);
2606 VectorType *ThisArgVecTy = dyn_cast<VectorType>(Ty);
2607 if (!ThisArgVecTy || !ReferenceType ||
2608 (ReferenceType->getVectorNumElements() !=
2609 ThisArgVecTy->getVectorNumElements()))
2611 PointerType *ThisArgEltTy =
2612 dyn_cast<PointerType>(ThisArgVecTy->getVectorElementType());
2615 return (!(ThisArgEltTy->getElementType() ==
2616 ReferenceType->getVectorElementType()));
2619 llvm_unreachable("unhandled");
2622 /// \brief Verify if the intrinsic has variable arguments.
2623 /// This method is intended to be called after all the fixed arguments have been
2626 /// This method returns true on error and does not print an error message.
2628 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2629 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2630 using namespace Intrinsic;
2632 // If there are no descriptors left, then it can't be a vararg.
2634 return isVarArg ? true : false;
2636 // There should be only one descriptor remaining at this point.
2637 if (Infos.size() != 1)
2640 // Check and verify the descriptor.
2641 IITDescriptor D = Infos.front();
2642 Infos = Infos.slice(1);
2643 if (D.Kind == IITDescriptor::VarArg)
2644 return isVarArg ? false : true;
2649 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2651 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2652 Function *IF = CI.getCalledFunction();
2653 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2656 // Verify that the intrinsic prototype lines up with what the .td files
2658 FunctionType *IFTy = IF->getFunctionType();
2659 bool IsVarArg = IFTy->isVarArg();
2661 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2662 getIntrinsicInfoTableEntries(ID, Table);
2663 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2665 SmallVector<Type *, 4> ArgTys;
2666 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2667 "Intrinsic has incorrect return type!", IF);
2668 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2669 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2670 "Intrinsic has incorrect argument type!", IF);
2672 // Verify if the intrinsic call matches the vararg property.
2674 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2675 "Intrinsic was not defined with variable arguments!", IF);
2677 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2678 "Callsite was not defined with variable arguments!", IF);
2680 // All descriptors should be absorbed by now.
2681 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2683 // Now that we have the intrinsic ID and the actual argument types (and we
2684 // know they are legal for the intrinsic!) get the intrinsic name through the
2685 // usual means. This allows us to verify the mangling of argument types into
2687 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
2688 Assert1(ExpectedName == IF->getName(),
2689 "Intrinsic name not mangled correctly for type arguments! "
2690 "Should be: " + ExpectedName, IF);
2692 // If the intrinsic takes MDNode arguments, verify that they are either global
2693 // or are local to *this* function.
2694 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2695 if (auto *MD = dyn_cast<MetadataAsValue>(CI.getArgOperand(i)))
2696 visitMetadataAsValue(*MD, CI.getParent()->getParent());
2701 case Intrinsic::ctlz: // llvm.ctlz
2702 case Intrinsic::cttz: // llvm.cttz
2703 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2704 "is_zero_undef argument of bit counting intrinsics must be a "
2705 "constant int", &CI);
2707 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2708 Assert1(CI.getArgOperand(0) && isa<MetadataAsValue>(CI.getArgOperand(0)),
2709 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2711 case Intrinsic::memcpy:
2712 case Intrinsic::memmove:
2713 case Intrinsic::memset:
2714 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2715 "alignment argument of memory intrinsics must be a constant int",
2717 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2718 "isvolatile argument of memory intrinsics must be a constant int",
2721 case Intrinsic::gcroot:
2722 case Intrinsic::gcwrite:
2723 case Intrinsic::gcread:
2724 if (ID == Intrinsic::gcroot) {
2726 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2727 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2728 Assert1(isa<Constant>(CI.getArgOperand(1)),
2729 "llvm.gcroot parameter #2 must be a constant.", &CI);
2730 if (!AI->getType()->getElementType()->isPointerTy()) {
2731 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2732 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2733 "or argument #2 must be a non-null constant.", &CI);
2737 Assert1(CI.getParent()->getParent()->hasGC(),
2738 "Enclosing function does not use GC.", &CI);
2740 case Intrinsic::init_trampoline:
2741 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2742 "llvm.init_trampoline parameter #2 must resolve to a function.",
2745 case Intrinsic::prefetch:
2746 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2747 isa<ConstantInt>(CI.getArgOperand(2)) &&
2748 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2749 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2750 "invalid arguments to llvm.prefetch",
2753 case Intrinsic::stackprotector:
2754 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2755 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2758 case Intrinsic::lifetime_start:
2759 case Intrinsic::lifetime_end:
2760 case Intrinsic::invariant_start:
2761 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2762 "size argument of memory use markers must be a constant integer",
2765 case Intrinsic::invariant_end:
2766 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2767 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2770 case Intrinsic::frameallocate: {
2771 BasicBlock *BB = CI.getParent();
2772 Assert1(BB == &BB->getParent()->front(),
2773 "llvm.frameallocate used outside of entry block", &CI);
2774 Assert1(!SawFrameAllocate,
2775 "multiple calls to llvm.frameallocate in one function", &CI);
2776 SawFrameAllocate = true;
2777 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2778 "llvm.frameallocate argument must be constant integer size", &CI);
2781 case Intrinsic::framerecover: {
2782 Value *FnArg = CI.getArgOperand(0)->stripPointerCasts();
2783 Function *Fn = dyn_cast<Function>(FnArg);
2784 Assert1(Fn && !Fn->isDeclaration(), "llvm.framerecover first "
2785 "argument must be function defined in this module", &CI);
2789 case Intrinsic::experimental_gc_statepoint:
2790 Assert1(!CI.isInlineAsm(),
2791 "gc.statepoint support for inline assembly unimplemented", &CI);
2793 VerifyStatepoint(ImmutableCallSite(&CI));
2795 case Intrinsic::experimental_gc_result_int:
2796 case Intrinsic::experimental_gc_result_float:
2797 case Intrinsic::experimental_gc_result_ptr:
2798 case Intrinsic::experimental_gc_result: {
2799 // Are we tied to a statepoint properly?
2800 CallSite StatepointCS(CI.getArgOperand(0));
2801 const Function *StatepointFn =
2802 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : nullptr;
2803 Assert2(StatepointFn && StatepointFn->isDeclaration() &&
2804 StatepointFn->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2805 "gc.result operand #1 must be from a statepoint",
2806 &CI, CI.getArgOperand(0));
2808 // Assert that result type matches wrapped callee.
2809 const Value *Target = StatepointCS.getArgument(0);
2810 const PointerType *PT = cast<PointerType>(Target->getType());
2811 const FunctionType *TargetFuncType =
2812 cast<FunctionType>(PT->getElementType());
2813 Assert1(CI.getType() == TargetFuncType->getReturnType(),
2814 "gc.result result type does not match wrapped callee",
2818 case Intrinsic::experimental_gc_relocate: {
2819 // Are we tied to a statepoint properly?
2820 CallSite StatepointCS(CI.getArgOperand(0));
2821 const Function *StatepointFn =
2822 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : nullptr;
2823 Assert2(StatepointFn && StatepointFn->isDeclaration() &&
2824 StatepointFn->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2825 "gc.relocate operand #1 must be from a statepoint",
2826 &CI, CI.getArgOperand(0));
2828 // Both the base and derived must be piped through the safepoint
2829 Value* Base = CI.getArgOperand(1);
2830 Assert1(isa<ConstantInt>(Base),
2831 "gc.relocate operand #2 must be integer offset", &CI);
2833 Value* Derived = CI.getArgOperand(2);
2834 Assert1(isa<ConstantInt>(Derived),
2835 "gc.relocate operand #3 must be integer offset", &CI);
2837 const int BaseIndex = cast<ConstantInt>(Base)->getZExtValue();
2838 const int DerivedIndex = cast<ConstantInt>(Derived)->getZExtValue();
2840 Assert1(0 <= BaseIndex &&
2841 BaseIndex < (int)StatepointCS.arg_size(),
2842 "gc.relocate: statepoint base index out of bounds", &CI);
2843 Assert1(0 <= DerivedIndex &&
2844 DerivedIndex < (int)StatepointCS.arg_size(),
2845 "gc.relocate: statepoint derived index out of bounds", &CI);
2847 // Check that BaseIndex and DerivedIndex fall within the 'gc parameters'
2848 // section of the statepoint's argument
2849 const int NumCallArgs =
2850 cast<ConstantInt>(StatepointCS.getArgument(1))->getZExtValue();
2851 const int NumDeoptArgs =
2852 cast<ConstantInt>(StatepointCS.getArgument(NumCallArgs + 3))->getZExtValue();
2853 const int GCParamArgsStart = NumCallArgs + NumDeoptArgs + 4;
2854 const int GCParamArgsEnd = StatepointCS.arg_size();
2855 Assert1(GCParamArgsStart <= BaseIndex &&
2856 BaseIndex < GCParamArgsEnd,
2857 "gc.relocate: statepoint base index doesn't fall within the "
2858 "'gc parameters' section of the statepoint call", &CI);
2859 Assert1(GCParamArgsStart <= DerivedIndex &&
2860 DerivedIndex < GCParamArgsEnd,
2861 "gc.relocate: statepoint derived index doesn't fall within the "
2862 "'gc parameters' section of the statepoint call", &CI);
2865 // Assert that the result type matches the type of the relocated pointer
2866 GCRelocateOperands Operands(&CI);
2867 Assert1(Operands.derivedPtr()->getType() == CI.getType(),
2868 "gc.relocate: relocating a pointer shouldn't change its type",
2875 void DebugInfoVerifier::verifyDebugInfo() {
2876 if (!VerifyDebugInfo)
2879 DebugInfoFinder Finder;
2880 Finder.processModule(*M);
2881 processInstructions(Finder);
2883 // Verify Debug Info.
2885 // NOTE: The loud braces are necessary for MSVC compatibility.
2886 for (DICompileUnit CU : Finder.compile_units()) {
2887 Assert1(CU.Verify(), "DICompileUnit does not Verify!", CU);
2889 for (DISubprogram S : Finder.subprograms()) {
2890 Assert1(S.Verify(), "DISubprogram does not Verify!", S);
2892 for (DIGlobalVariable GV : Finder.global_variables()) {
2893 Assert1(GV.Verify(), "DIGlobalVariable does not Verify!", GV);
2895 for (DIType T : Finder.types()) {
2896 Assert1(T.Verify(), "DIType does not Verify!", T);
2898 for (DIScope S : Finder.scopes()) {
2899 Assert1(S.Verify(), "DIScope does not Verify!", S);
2903 void DebugInfoVerifier::processInstructions(DebugInfoFinder &Finder) {
2904 for (const Function &F : *M)
2905 for (auto I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2906 if (MDNode *MD = I->getMetadata(LLVMContext::MD_dbg))
2907 Finder.processLocation(*M, DILocation(MD));
2908 if (const CallInst *CI = dyn_cast<CallInst>(&*I))
2909 processCallInst(Finder, *CI);
2913 void DebugInfoVerifier::processCallInst(DebugInfoFinder &Finder,
2914 const CallInst &CI) {
2915 if (Function *F = CI.getCalledFunction())
2916 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2918 case Intrinsic::dbg_declare: {
2919 auto *DDI = cast<DbgDeclareInst>(&CI);
2920 Finder.processDeclare(*M, DDI);
2921 if (auto E = DDI->getExpression())
2922 Assert1(DIExpression(E).Verify(), "DIExpression does not Verify!", E);
2925 case Intrinsic::dbg_value: {
2926 auto *DVI = cast<DbgValueInst>(&CI);
2927 Finder.processValue(*M, DVI);
2928 if (auto E = DVI->getExpression())
2929 Assert1(DIExpression(E).Verify(), "DIExpression does not Verify!", E);
2937 //===----------------------------------------------------------------------===//
2938 // Implement the public interfaces to this file...
2939 //===----------------------------------------------------------------------===//
2941 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
2942 Function &F = const_cast<Function &>(f);
2943 assert(!F.isDeclaration() && "Cannot verify external functions");
2945 raw_null_ostream NullStr;
2946 Verifier V(OS ? *OS : NullStr);
2948 // Note that this function's return value is inverted from what you would
2949 // expect of a function called "verify".
2950 return !V.verify(F);
2953 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
2954 raw_null_ostream NullStr;
2955 Verifier V(OS ? *OS : NullStr);
2957 bool Broken = false;
2958 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
2959 if (!I->isDeclaration() && !I->isMaterializable())
2960 Broken |= !V.verify(*I);
2962 // Note that this function's return value is inverted from what you would
2963 // expect of a function called "verify".
2964 DebugInfoVerifier DIV(OS ? *OS : NullStr);
2965 return !V.verify(M) || !DIV.verify(M) || Broken;
2969 struct VerifierLegacyPass : public FunctionPass {
2975 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
2976 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2978 explicit VerifierLegacyPass(bool FatalErrors)
2979 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2980 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2983 bool runOnFunction(Function &F) override {
2984 if (!V.verify(F) && FatalErrors)
2985 report_fatal_error("Broken function found, compilation aborted!");
2990 bool doFinalization(Module &M) override {
2991 if (!V.verify(M) && FatalErrors)
2992 report_fatal_error("Broken module found, compilation aborted!");
2997 void getAnalysisUsage(AnalysisUsage &AU) const override {
2998 AU.setPreservesAll();
3001 struct DebugInfoVerifierLegacyPass : public ModulePass {
3004 DebugInfoVerifier V;
3007 DebugInfoVerifierLegacyPass() : ModulePass(ID), FatalErrors(true) {
3008 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3010 explicit DebugInfoVerifierLegacyPass(bool FatalErrors)
3011 : ModulePass(ID), V(dbgs()), FatalErrors(FatalErrors) {
3012 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3015 bool runOnModule(Module &M) override {
3016 if (!V.verify(M) && FatalErrors)
3017 report_fatal_error("Broken debug info found, compilation aborted!");
3022 void getAnalysisUsage(AnalysisUsage &AU) const override {
3023 AU.setPreservesAll();
3028 char VerifierLegacyPass::ID = 0;
3029 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
3031 char DebugInfoVerifierLegacyPass::ID = 0;
3032 INITIALIZE_PASS(DebugInfoVerifierLegacyPass, "verify-di", "Debug Info Verifier",
3035 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
3036 return new VerifierLegacyPass(FatalErrors);
3039 ModulePass *llvm::createDebugInfoVerifierPass(bool FatalErrors) {
3040 return new DebugInfoVerifierLegacyPass(FatalErrors);
3043 PreservedAnalyses VerifierPass::run(Module &M) {
3044 if (verifyModule(M, &dbgs()) && FatalErrors)
3045 report_fatal_error("Broken module found, compilation aborted!");
3047 return PreservedAnalyses::all();
3050 PreservedAnalyses VerifierPass::run(Function &F) {
3051 if (verifyFunction(F, &dbgs()) && FatalErrors)
3052 report_fatal_error("Broken function found, compilation aborted!");
3054 return PreservedAnalyses::all();