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<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(MDNode &MD);
294 void visitMetadataAsValue(MetadataAsValue &MD, Function *F);
295 void visitValueAsMetadata(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);
307 // InstVisitor overrides...
308 using InstVisitor<Verifier>::visit;
309 void visit(Instruction &I);
311 void visitTruncInst(TruncInst &I);
312 void visitZExtInst(ZExtInst &I);
313 void visitSExtInst(SExtInst &I);
314 void visitFPTruncInst(FPTruncInst &I);
315 void visitFPExtInst(FPExtInst &I);
316 void visitFPToUIInst(FPToUIInst &I);
317 void visitFPToSIInst(FPToSIInst &I);
318 void visitUIToFPInst(UIToFPInst &I);
319 void visitSIToFPInst(SIToFPInst &I);
320 void visitIntToPtrInst(IntToPtrInst &I);
321 void visitPtrToIntInst(PtrToIntInst &I);
322 void visitBitCastInst(BitCastInst &I);
323 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
324 void visitPHINode(PHINode &PN);
325 void visitBinaryOperator(BinaryOperator &B);
326 void visitICmpInst(ICmpInst &IC);
327 void visitFCmpInst(FCmpInst &FC);
328 void visitExtractElementInst(ExtractElementInst &EI);
329 void visitInsertElementInst(InsertElementInst &EI);
330 void visitShuffleVectorInst(ShuffleVectorInst &EI);
331 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
332 void visitCallInst(CallInst &CI);
333 void visitInvokeInst(InvokeInst &II);
334 void visitGetElementPtrInst(GetElementPtrInst &GEP);
335 void visitLoadInst(LoadInst &LI);
336 void visitStoreInst(StoreInst &SI);
337 void verifyDominatesUse(Instruction &I, unsigned i);
338 void visitInstruction(Instruction &I);
339 void visitTerminatorInst(TerminatorInst &I);
340 void visitBranchInst(BranchInst &BI);
341 void visitReturnInst(ReturnInst &RI);
342 void visitSwitchInst(SwitchInst &SI);
343 void visitIndirectBrInst(IndirectBrInst &BI);
344 void visitSelectInst(SelectInst &SI);
345 void visitUserOp1(Instruction &I);
346 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
347 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
348 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
349 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
350 void visitFenceInst(FenceInst &FI);
351 void visitAllocaInst(AllocaInst &AI);
352 void visitExtractValueInst(ExtractValueInst &EVI);
353 void visitInsertValueInst(InsertValueInst &IVI);
354 void visitLandingPadInst(LandingPadInst &LPI);
356 void VerifyCallSite(CallSite CS);
357 void verifyMustTailCall(CallInst &CI);
358 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
359 unsigned ArgNo, std::string &Suffix);
360 bool VerifyIntrinsicType(Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
361 SmallVectorImpl<Type *> &ArgTys);
362 bool VerifyIntrinsicIsVarArg(bool isVarArg,
363 ArrayRef<Intrinsic::IITDescriptor> &Infos);
364 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
365 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
367 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
368 bool isReturnValue, const Value *V);
369 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
372 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
373 void VerifyStatepoint(ImmutableCallSite CS);
375 class DebugInfoVerifier : public VerifierSupport {
377 explicit DebugInfoVerifier(raw_ostream &OS = dbgs()) : VerifierSupport(OS) {}
379 bool verify(const Module &M) {
386 void verifyDebugInfo();
387 void processInstructions(DebugInfoFinder &Finder);
388 void processCallInst(DebugInfoFinder &Finder, const CallInst &CI);
390 } // End anonymous namespace
392 // Assert - We know that cond should be true, if not print an error message.
393 #define Assert(C, M) \
394 do { if (!(C)) { CheckFailed(M); return; } } while (0)
395 #define Assert1(C, M, V1) \
396 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
397 #define Assert2(C, M, V1, V2) \
398 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
399 #define Assert3(C, M, V1, V2, V3) \
400 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
401 #define Assert4(C, M, V1, V2, V3, V4) \
402 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
404 void Verifier::visit(Instruction &I) {
405 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
406 Assert1(I.getOperand(i) != nullptr, "Operand is null", &I);
407 InstVisitor<Verifier>::visit(I);
411 void Verifier::visitGlobalValue(const GlobalValue &GV) {
412 Assert1(!GV.isDeclaration() || GV.hasExternalLinkage() ||
413 GV.hasExternalWeakLinkage(),
414 "Global is external, but doesn't have external or weak linkage!",
417 Assert1(GV.getAlignment() <= Value::MaximumAlignment,
418 "huge alignment values are unsupported", &GV);
419 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
420 "Only global variables can have appending linkage!", &GV);
422 if (GV.hasAppendingLinkage()) {
423 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
424 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
425 "Only global arrays can have appending linkage!", GVar);
429 void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
430 if (GV.hasInitializer()) {
431 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
432 "Global variable initializer type does not match global "
433 "variable type!", &GV);
435 // If the global has common linkage, it must have a zero initializer and
436 // cannot be constant.
437 if (GV.hasCommonLinkage()) {
438 Assert1(GV.getInitializer()->isNullValue(),
439 "'common' global must have a zero initializer!", &GV);
440 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
442 Assert1(!GV.hasComdat(), "'common' global may not be in a Comdat!", &GV);
445 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
446 "invalid linkage type for global declaration", &GV);
449 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
450 GV.getName() == "llvm.global_dtors")) {
451 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
452 "invalid linkage for intrinsic global variable", &GV);
453 // Don't worry about emitting an error for it not being an array,
454 // visitGlobalValue will complain on appending non-array.
455 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType()->getElementType())) {
456 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
457 PointerType *FuncPtrTy =
458 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
459 // FIXME: Reject the 2-field form in LLVM 4.0.
460 Assert1(STy && (STy->getNumElements() == 2 ||
461 STy->getNumElements() == 3) &&
462 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
463 STy->getTypeAtIndex(1) == FuncPtrTy,
464 "wrong type for intrinsic global variable", &GV);
465 if (STy->getNumElements() == 3) {
466 Type *ETy = STy->getTypeAtIndex(2);
467 Assert1(ETy->isPointerTy() &&
468 cast<PointerType>(ETy)->getElementType()->isIntegerTy(8),
469 "wrong type for intrinsic global variable", &GV);
474 if (GV.hasName() && (GV.getName() == "llvm.used" ||
475 GV.getName() == "llvm.compiler.used")) {
476 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
477 "invalid linkage for intrinsic global variable", &GV);
478 Type *GVType = GV.getType()->getElementType();
479 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
480 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
481 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
482 if (GV.hasInitializer()) {
483 const Constant *Init = GV.getInitializer();
484 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
485 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
487 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
488 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
490 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
491 "invalid llvm.used member", V);
492 Assert1(V->hasName(), "members of llvm.used must be named", V);
498 Assert1(!GV.hasDLLImportStorageClass() ||
499 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
500 GV.hasAvailableExternallyLinkage(),
501 "Global is marked as dllimport, but not external", &GV);
503 if (!GV.hasInitializer()) {
504 visitGlobalValue(GV);
508 // Walk any aggregate initializers looking for bitcasts between address spaces
509 SmallPtrSet<const Value *, 4> Visited;
510 SmallVector<const Value *, 4> WorkStack;
511 WorkStack.push_back(cast<Value>(GV.getInitializer()));
513 while (!WorkStack.empty()) {
514 const Value *V = WorkStack.pop_back_val();
515 if (!Visited.insert(V).second)
518 if (const User *U = dyn_cast<User>(V)) {
519 for (unsigned I = 0, N = U->getNumOperands(); I != N; ++I)
520 WorkStack.push_back(U->getOperand(I));
523 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
524 VerifyConstantExprBitcastType(CE);
530 visitGlobalValue(GV);
533 void Verifier::visitAliaseeSubExpr(const GlobalAlias &GA, const Constant &C) {
534 SmallPtrSet<const GlobalAlias*, 4> Visited;
536 visitAliaseeSubExpr(Visited, GA, C);
539 void Verifier::visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias*> &Visited,
540 const GlobalAlias &GA, const Constant &C) {
541 if (const auto *GV = dyn_cast<GlobalValue>(&C)) {
542 Assert1(!GV->isDeclaration(), "Alias must point to a definition", &GA);
544 if (const auto *GA2 = dyn_cast<GlobalAlias>(GV)) {
545 Assert1(Visited.insert(GA2).second, "Aliases cannot form a cycle", &GA);
547 Assert1(!GA2->mayBeOverridden(), "Alias cannot point to a weak alias",
550 // Only continue verifying subexpressions of GlobalAliases.
551 // Do not recurse into global initializers.
556 if (const auto *CE = dyn_cast<ConstantExpr>(&C))
557 VerifyConstantExprBitcastType(CE);
559 for (const Use &U : C.operands()) {
561 if (const auto *GA2 = dyn_cast<GlobalAlias>(V))
562 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
563 else if (const auto *C2 = dyn_cast<Constant>(V))
564 visitAliaseeSubExpr(Visited, GA, *C2);
568 void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
569 Assert1(!GA.getName().empty(),
570 "Alias name cannot be empty!", &GA);
571 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
572 "Alias should have private, internal, linkonce, weak, linkonce_odr, "
573 "weak_odr, or external linkage!",
575 const Constant *Aliasee = GA.getAliasee();
576 Assert1(Aliasee, "Aliasee cannot be NULL!", &GA);
577 Assert1(GA.getType() == Aliasee->getType(),
578 "Alias and aliasee types should match!", &GA);
580 Assert1(isa<GlobalValue>(Aliasee) || isa<ConstantExpr>(Aliasee),
581 "Aliasee should be either GlobalValue or ConstantExpr", &GA);
583 visitAliaseeSubExpr(GA, *Aliasee);
585 visitGlobalValue(GA);
588 void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
589 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
590 MDNode *MD = NMD.getOperand(i);
598 void Verifier::visitMDNode(MDNode &MD) {
599 // Only visit each node once. Metadata can be mutually recursive, so this
600 // avoids infinite recursion here, as well as being an optimization.
601 if (!MDNodes.insert(&MD).second)
604 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
605 Metadata *Op = MD.getOperand(i);
608 Assert2(!isa<LocalAsMetadata>(Op), "Invalid operand for global metadata!",
610 if (auto *N = dyn_cast<MDNode>(Op)) {
614 if (auto *V = dyn_cast<ValueAsMetadata>(Op)) {
615 visitValueAsMetadata(*V, nullptr);
620 // Check these last, so we diagnose problems in operands first.
621 Assert1(!MD.isTemporary(), "Expected no forward declarations!", &MD);
622 Assert1(MD.isResolved(), "All nodes should be resolved!", &MD);
625 void Verifier::visitValueAsMetadata(ValueAsMetadata &MD, Function *F) {
626 Assert1(MD.getValue(), "Expected valid value", &MD);
627 Assert2(!MD.getValue()->getType()->isMetadataTy(),
628 "Unexpected metadata round-trip through values", &MD, MD.getValue());
630 auto *L = dyn_cast<LocalAsMetadata>(&MD);
634 Assert1(F, "function-local metadata used outside a function", L);
636 // If this was an instruction, bb, or argument, verify that it is in the
637 // function that we expect.
638 Function *ActualF = nullptr;
639 if (Instruction *I = dyn_cast<Instruction>(L->getValue())) {
640 Assert2(I->getParent(), "function-local metadata not in basic block", L, I);
641 ActualF = I->getParent()->getParent();
642 } else if (BasicBlock *BB = dyn_cast<BasicBlock>(L->getValue()))
643 ActualF = BB->getParent();
644 else if (Argument *A = dyn_cast<Argument>(L->getValue()))
645 ActualF = A->getParent();
646 assert(ActualF && "Unimplemented function local metadata case!");
648 Assert1(ActualF == F, "function-local metadata used in wrong function", L);
651 void Verifier::visitMetadataAsValue(MetadataAsValue &MDV, Function *F) {
652 Metadata *MD = MDV.getMetadata();
653 if (auto *N = dyn_cast<MDNode>(MD)) {
658 // Only visit each node once. Metadata can be mutually recursive, so this
659 // avoids infinite recursion here, as well as being an optimization.
660 if (!MDNodes.insert(MD).second)
663 if (auto *V = dyn_cast<ValueAsMetadata>(MD))
664 visitValueAsMetadata(*V, F);
667 void Verifier::visitComdat(const Comdat &C) {
668 // All Comdat::SelectionKind values other than Comdat::Any require a
669 // GlobalValue with the same name as the Comdat.
670 const GlobalValue *GV = M->getNamedValue(C.getName());
671 if (C.getSelectionKind() != Comdat::Any)
673 "comdat selection kind requires a global value with the same name",
675 // The Module is invalid if the GlobalValue has private linkage. Entities
676 // with private linkage don't have entries in the symbol table.
678 Assert1(!GV->hasPrivateLinkage(), "comdat global value has private linkage",
682 void Verifier::visitModuleIdents(const Module &M) {
683 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
687 // llvm.ident takes a list of metadata entry. Each entry has only one string.
688 // Scan each llvm.ident entry and make sure that this requirement is met.
689 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
690 const MDNode *N = Idents->getOperand(i);
691 Assert1(N->getNumOperands() == 1,
692 "incorrect number of operands in llvm.ident metadata", N);
693 Assert1(isa<MDString>(N->getOperand(0)),
694 ("invalid value for llvm.ident metadata entry operand"
695 "(the operand should be a string)"),
700 void Verifier::visitModuleFlags(const Module &M) {
701 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
704 // Scan each flag, and track the flags and requirements.
705 DenseMap<const MDString*, const MDNode*> SeenIDs;
706 SmallVector<const MDNode*, 16> Requirements;
707 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
708 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
711 // Validate that the requirements in the module are valid.
712 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
713 const MDNode *Requirement = Requirements[I];
714 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
715 const Metadata *ReqValue = Requirement->getOperand(1);
717 const MDNode *Op = SeenIDs.lookup(Flag);
719 CheckFailed("invalid requirement on flag, flag is not present in module",
724 if (Op->getOperand(2) != ReqValue) {
725 CheckFailed(("invalid requirement on flag, "
726 "flag does not have the required value"),
734 Verifier::visitModuleFlag(const MDNode *Op,
735 DenseMap<const MDString *, const MDNode *> &SeenIDs,
736 SmallVectorImpl<const MDNode *> &Requirements) {
737 // Each module flag should have three arguments, the merge behavior (a
738 // constant int), the flag ID (an MDString), and the value.
739 Assert1(Op->getNumOperands() == 3,
740 "incorrect number of operands in module flag", Op);
741 Module::ModFlagBehavior MFB;
742 if (!Module::isValidModFlagBehavior(Op->getOperand(0), MFB)) {
744 mdconst::dyn_extract<ConstantInt>(Op->getOperand(0)),
745 "invalid behavior operand in module flag (expected constant integer)",
748 "invalid behavior operand in module flag (unexpected constant)",
751 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
753 "invalid ID operand in module flag (expected metadata string)",
756 // Sanity check the values for behaviors with additional requirements.
759 case Module::Warning:
760 case Module::Override:
761 // These behavior types accept any value.
764 case Module::Require: {
765 // The value should itself be an MDNode with two operands, a flag ID (an
766 // MDString), and a value.
767 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
768 Assert1(Value && Value->getNumOperands() == 2,
769 "invalid value for 'require' module flag (expected metadata pair)",
771 Assert1(isa<MDString>(Value->getOperand(0)),
772 ("invalid value for 'require' module flag "
773 "(first value operand should be a string)"),
774 Value->getOperand(0));
776 // Append it to the list of requirements, to check once all module flags are
778 Requirements.push_back(Value);
783 case Module::AppendUnique: {
784 // These behavior types require the operand be an MDNode.
785 Assert1(isa<MDNode>(Op->getOperand(2)),
786 "invalid value for 'append'-type module flag "
787 "(expected a metadata node)", Op->getOperand(2));
792 // Unless this is a "requires" flag, check the ID is unique.
793 if (MFB != Module::Require) {
794 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
796 "module flag identifiers must be unique (or of 'require' type)",
801 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
802 bool isFunction, const Value *V) {
804 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
805 if (Attrs.getSlotIndex(I) == Idx) {
810 assert(Slot != ~0U && "Attribute set inconsistency!");
812 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
814 if (I->isStringAttribute())
817 if (I->getKindAsEnum() == Attribute::NoReturn ||
818 I->getKindAsEnum() == Attribute::NoUnwind ||
819 I->getKindAsEnum() == Attribute::NoInline ||
820 I->getKindAsEnum() == Attribute::AlwaysInline ||
821 I->getKindAsEnum() == Attribute::OptimizeForSize ||
822 I->getKindAsEnum() == Attribute::StackProtect ||
823 I->getKindAsEnum() == Attribute::StackProtectReq ||
824 I->getKindAsEnum() == Attribute::StackProtectStrong ||
825 I->getKindAsEnum() == Attribute::NoRedZone ||
826 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
827 I->getKindAsEnum() == Attribute::Naked ||
828 I->getKindAsEnum() == Attribute::InlineHint ||
829 I->getKindAsEnum() == Attribute::StackAlignment ||
830 I->getKindAsEnum() == Attribute::UWTable ||
831 I->getKindAsEnum() == Attribute::NonLazyBind ||
832 I->getKindAsEnum() == Attribute::ReturnsTwice ||
833 I->getKindAsEnum() == Attribute::SanitizeAddress ||
834 I->getKindAsEnum() == Attribute::SanitizeThread ||
835 I->getKindAsEnum() == Attribute::SanitizeMemory ||
836 I->getKindAsEnum() == Attribute::MinSize ||
837 I->getKindAsEnum() == Attribute::NoDuplicate ||
838 I->getKindAsEnum() == Attribute::Builtin ||
839 I->getKindAsEnum() == Attribute::NoBuiltin ||
840 I->getKindAsEnum() == Attribute::Cold ||
841 I->getKindAsEnum() == Attribute::OptimizeNone ||
842 I->getKindAsEnum() == Attribute::JumpTable) {
844 CheckFailed("Attribute '" + I->getAsString() +
845 "' only applies to functions!", V);
848 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
849 I->getKindAsEnum() == Attribute::ReadNone) {
851 CheckFailed("Attribute '" + I->getAsString() +
852 "' does not apply to function returns");
855 } else if (isFunction) {
856 CheckFailed("Attribute '" + I->getAsString() +
857 "' does not apply to functions!", V);
863 // VerifyParameterAttrs - Check the given attributes for an argument or return
864 // value of the specified type. The value V is printed in error messages.
865 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
866 bool isReturnValue, const Value *V) {
867 if (!Attrs.hasAttributes(Idx))
870 VerifyAttributeTypes(Attrs, Idx, false, V);
873 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
874 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
875 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
876 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
877 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
878 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
879 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
880 "'returned' do not apply to return values!", V);
882 // Check for mutually incompatible attributes. Only inreg is compatible with
884 unsigned AttrCount = 0;
885 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
886 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
887 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
888 Attrs.hasAttribute(Idx, Attribute::InReg);
889 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
890 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
891 "and 'sret' are incompatible!", V);
893 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
894 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
895 "'inalloca and readonly' are incompatible!", V);
897 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
898 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
899 "'sret and returned' are incompatible!", V);
901 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
902 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
903 "'zeroext and signext' are incompatible!", V);
905 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
906 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
907 "'readnone and readonly' are incompatible!", V);
909 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
910 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
911 "'noinline and alwaysinline' are incompatible!", V);
913 Assert1(!AttrBuilder(Attrs, Idx).
914 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
915 "Wrong types for attribute: " +
916 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
918 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
919 if (!PTy->getElementType()->isSized()) {
920 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
921 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
922 "Attributes 'byval' and 'inalloca' do not support unsized types!",
926 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
927 "Attribute 'byval' only applies to parameters with pointer type!",
932 // VerifyFunctionAttrs - Check parameter attributes against a function type.
933 // The value V is printed in error messages.
934 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
939 bool SawNest = false;
940 bool SawReturned = false;
941 bool SawSRet = false;
943 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
944 unsigned Idx = Attrs.getSlotIndex(i);
948 Ty = FT->getReturnType();
949 else if (Idx-1 < FT->getNumParams())
950 Ty = FT->getParamType(Idx-1);
952 break; // VarArgs attributes, verified elsewhere.
954 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
959 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
960 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
964 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
965 Assert1(!SawReturned, "More than one parameter has attribute returned!",
967 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
968 "argument and return types for 'returned' attribute", V);
972 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
973 Assert1(!SawSRet, "Cannot have multiple 'sret' parameters!", V);
974 Assert1(Idx == 1 || Idx == 2,
975 "Attribute 'sret' is not on first or second parameter!", V);
979 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
980 Assert1(Idx == FT->getNumParams(),
981 "inalloca isn't on the last parameter!", V);
985 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
988 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
990 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
991 Attribute::ReadNone) &&
992 Attrs.hasAttribute(AttributeSet::FunctionIndex,
993 Attribute::ReadOnly)),
994 "Attributes 'readnone and readonly' are incompatible!", V);
996 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
997 Attribute::NoInline) &&
998 Attrs.hasAttribute(AttributeSet::FunctionIndex,
999 Attribute::AlwaysInline)),
1000 "Attributes 'noinline and alwaysinline' are incompatible!", V);
1002 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1003 Attribute::OptimizeNone)) {
1004 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1005 Attribute::NoInline),
1006 "Attribute 'optnone' requires 'noinline'!", V);
1008 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1009 Attribute::OptimizeForSize),
1010 "Attributes 'optsize and optnone' are incompatible!", V);
1012 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1013 Attribute::MinSize),
1014 "Attributes 'minsize and optnone' are incompatible!", V);
1017 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1018 Attribute::JumpTable)) {
1019 const GlobalValue *GV = cast<GlobalValue>(V);
1020 Assert1(GV->hasUnnamedAddr(),
1021 "Attribute 'jumptable' requires 'unnamed_addr'", V);
1026 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
1027 if (CE->getOpcode() != Instruction::BitCast)
1030 Assert1(CastInst::castIsValid(Instruction::BitCast, CE->getOperand(0),
1032 "Invalid bitcast", CE);
1035 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1036 if (Attrs.getNumSlots() == 0)
1039 unsigned LastSlot = Attrs.getNumSlots() - 1;
1040 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1041 if (LastIndex <= Params
1042 || (LastIndex == AttributeSet::FunctionIndex
1043 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1049 /// \brief Verify that statepoint intrinsic is well formed.
1050 void Verifier::VerifyStatepoint(ImmutableCallSite CS) {
1051 assert(CS.getCalledFunction() &&
1052 CS.getCalledFunction()->getIntrinsicID() ==
1053 Intrinsic::experimental_gc_statepoint);
1055 const Instruction &CI = *CS.getInstruction();
1057 Assert1(!CS.doesNotAccessMemory() &&
1058 !CS.onlyReadsMemory(),
1059 "gc.statepoint must read and write memory to preserve "
1060 "reordering restrictions required by safepoint semantics", &CI);
1062 const Value *Target = CS.getArgument(0);
1063 const PointerType *PT = dyn_cast<PointerType>(Target->getType());
1064 Assert2(PT && PT->getElementType()->isFunctionTy(),
1065 "gc.statepoint callee must be of function pointer type",
1067 FunctionType *TargetFuncType = cast<FunctionType>(PT->getElementType());
1069 const Value *NumCallArgsV = CS.getArgument(1);
1070 Assert1(isa<ConstantInt>(NumCallArgsV),
1071 "gc.statepoint number of arguments to underlying call "
1072 "must be constant integer", &CI);
1073 const int NumCallArgs = cast<ConstantInt>(NumCallArgsV)->getZExtValue();
1074 Assert1(NumCallArgs >= 0,
1075 "gc.statepoint number of arguments to underlying call "
1076 "must be positive", &CI);
1077 const int NumParams = (int)TargetFuncType->getNumParams();
1078 if (TargetFuncType->isVarArg()) {
1079 Assert1(NumCallArgs >= NumParams,
1080 "gc.statepoint mismatch in number of vararg call args", &CI);
1082 // TODO: Remove this limitation
1083 Assert1(TargetFuncType->getReturnType()->isVoidTy(),
1084 "gc.statepoint doesn't support wrapping non-void "
1085 "vararg functions yet", &CI);
1087 Assert1(NumCallArgs == NumParams,
1088 "gc.statepoint mismatch in number of call args", &CI);
1090 const Value *Unused = CS.getArgument(2);
1091 Assert1(isa<ConstantInt>(Unused) &&
1092 cast<ConstantInt>(Unused)->isNullValue(),
1093 "gc.statepoint parameter #3 must be zero", &CI);
1095 // Verify that the types of the call parameter arguments match
1096 // the type of the wrapped callee.
1097 for (int i = 0; i < NumParams; i++) {
1098 Type *ParamType = TargetFuncType->getParamType(i);
1099 Type *ArgType = CS.getArgument(3+i)->getType();
1100 Assert1(ArgType == ParamType,
1101 "gc.statepoint call argument does not match wrapped "
1102 "function type", &CI);
1104 const int EndCallArgsInx = 2+NumCallArgs;
1105 const Value *NumDeoptArgsV = CS.getArgument(EndCallArgsInx+1);
1106 Assert1(isa<ConstantInt>(NumDeoptArgsV),
1107 "gc.statepoint number of deoptimization arguments "
1108 "must be constant integer", &CI);
1109 const int NumDeoptArgs = cast<ConstantInt>(NumDeoptArgsV)->getZExtValue();
1110 Assert1(NumDeoptArgs >= 0,
1111 "gc.statepoint number of deoptimization arguments "
1112 "must be positive", &CI);
1114 Assert1(4 + NumCallArgs + NumDeoptArgs <= (int)CS.arg_size(),
1115 "gc.statepoint too few arguments according to length fields", &CI);
1117 // Check that the only uses of this gc.statepoint are gc.result or
1118 // gc.relocate calls which are tied to this statepoint and thus part
1119 // of the same statepoint sequence
1120 for (const User *U : CI.users()) {
1121 const CallInst *Call = dyn_cast<const CallInst>(U);
1122 Assert2(Call, "illegal use of statepoint token", &CI, U);
1123 if (!Call) continue;
1124 Assert2(isGCRelocate(Call) || isGCResult(Call),
1125 "gc.result or gc.relocate are the only value uses"
1126 "of a gc.statepoint", &CI, U);
1127 if (isGCResult(Call)) {
1128 Assert2(Call->getArgOperand(0) == &CI,
1129 "gc.result connected to wrong gc.statepoint",
1131 } else if (isGCRelocate(Call)) {
1132 Assert2(Call->getArgOperand(0) == &CI,
1133 "gc.relocate connected to wrong gc.statepoint",
1138 // Note: It is legal for a single derived pointer to be listed multiple
1139 // times. It's non-optimal, but it is legal. It can also happen after
1140 // insertion if we strip a bitcast away.
1141 // Note: It is really tempting to check that each base is relocated and
1142 // that a derived pointer is never reused as a base pointer. This turns
1143 // out to be problematic since optimizations run after safepoint insertion
1144 // can recognize equality properties that the insertion logic doesn't know
1145 // about. See example statepoint.ll in the verifier subdirectory
1148 // visitFunction - Verify that a function is ok.
1150 void Verifier::visitFunction(const Function &F) {
1151 // Check function arguments.
1152 FunctionType *FT = F.getFunctionType();
1153 unsigned NumArgs = F.arg_size();
1155 Assert1(Context == &F.getContext(),
1156 "Function context does not match Module context!", &F);
1158 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1159 Assert2(FT->getNumParams() == NumArgs,
1160 "# formal arguments must match # of arguments for function type!",
1162 Assert1(F.getReturnType()->isFirstClassType() ||
1163 F.getReturnType()->isVoidTy() ||
1164 F.getReturnType()->isStructTy(),
1165 "Functions cannot return aggregate values!", &F);
1167 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1168 "Invalid struct return type!", &F);
1170 AttributeSet Attrs = F.getAttributes();
1172 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1173 "Attribute after last parameter!", &F);
1175 // Check function attributes.
1176 VerifyFunctionAttrs(FT, Attrs, &F);
1178 // On function declarations/definitions, we do not support the builtin
1179 // attribute. We do not check this in VerifyFunctionAttrs since that is
1180 // checking for Attributes that can/can not ever be on functions.
1181 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1182 Attribute::Builtin),
1183 "Attribute 'builtin' can only be applied to a callsite.", &F);
1185 // Check that this function meets the restrictions on this calling convention.
1186 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
1187 // restrictions can be lifted.
1188 switch (F.getCallingConv()) {
1190 case CallingConv::C:
1192 case CallingConv::Fast:
1193 case CallingConv::Cold:
1194 case CallingConv::Intel_OCL_BI:
1195 case CallingConv::PTX_Kernel:
1196 case CallingConv::PTX_Device:
1197 Assert1(!F.isVarArg(), "Calling convention does not support varargs or "
1198 "perfect forwarding!", &F);
1202 bool isLLVMdotName = F.getName().size() >= 5 &&
1203 F.getName().substr(0, 5) == "llvm.";
1205 // Check that the argument values match the function type for this function...
1207 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1209 Assert2(I->getType() == FT->getParamType(i),
1210 "Argument value does not match function argument type!",
1211 I, FT->getParamType(i));
1212 Assert1(I->getType()->isFirstClassType(),
1213 "Function arguments must have first-class types!", I);
1215 Assert2(!I->getType()->isMetadataTy(),
1216 "Function takes metadata but isn't an intrinsic", I, &F);
1219 if (F.isMaterializable()) {
1220 // Function has a body somewhere we can't see.
1221 } else if (F.isDeclaration()) {
1222 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1223 "invalid linkage type for function declaration", &F);
1225 // Verify that this function (which has a body) is not named "llvm.*". It
1226 // is not legal to define intrinsics.
1227 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1229 // Check the entry node
1230 const BasicBlock *Entry = &F.getEntryBlock();
1231 Assert1(pred_empty(Entry),
1232 "Entry block to function must not have predecessors!", Entry);
1234 // The address of the entry block cannot be taken, unless it is dead.
1235 if (Entry->hasAddressTaken()) {
1236 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1237 "blockaddress may not be used with the entry block!", Entry);
1241 // If this function is actually an intrinsic, verify that it is only used in
1242 // direct call/invokes, never having its "address taken".
1243 if (F.getIntrinsicID()) {
1245 if (F.hasAddressTaken(&U))
1246 Assert1(0, "Invalid user of intrinsic instruction!", U);
1249 Assert1(!F.hasDLLImportStorageClass() ||
1250 (F.isDeclaration() && F.hasExternalLinkage()) ||
1251 F.hasAvailableExternallyLinkage(),
1252 "Function is marked as dllimport, but not external.", &F);
1255 // verifyBasicBlock - Verify that a basic block is well formed...
1257 void Verifier::visitBasicBlock(BasicBlock &BB) {
1258 InstsInThisBlock.clear();
1260 // Ensure that basic blocks have terminators!
1261 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1263 // Check constraints that this basic block imposes on all of the PHI nodes in
1265 if (isa<PHINode>(BB.front())) {
1266 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1267 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1268 std::sort(Preds.begin(), Preds.end());
1270 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1271 // Ensure that PHI nodes have at least one entry!
1272 Assert1(PN->getNumIncomingValues() != 0,
1273 "PHI nodes must have at least one entry. If the block is dead, "
1274 "the PHI should be removed!", PN);
1275 Assert1(PN->getNumIncomingValues() == Preds.size(),
1276 "PHINode should have one entry for each predecessor of its "
1277 "parent basic block!", PN);
1279 // Get and sort all incoming values in the PHI node...
1281 Values.reserve(PN->getNumIncomingValues());
1282 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1283 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1284 PN->getIncomingValue(i)));
1285 std::sort(Values.begin(), Values.end());
1287 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1288 // Check to make sure that if there is more than one entry for a
1289 // particular basic block in this PHI node, that the incoming values are
1292 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1293 Values[i].second == Values[i-1].second,
1294 "PHI node has multiple entries for the same basic block with "
1295 "different incoming values!", PN, Values[i].first,
1296 Values[i].second, Values[i-1].second);
1298 // Check to make sure that the predecessors and PHI node entries are
1300 Assert3(Values[i].first == Preds[i],
1301 "PHI node entries do not match predecessors!", PN,
1302 Values[i].first, Preds[i]);
1307 // Check that all instructions have their parent pointers set up correctly.
1310 Assert(I.getParent() == &BB, "Instruction has bogus parent pointer!");
1314 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1315 // Ensure that terminators only exist at the end of the basic block.
1316 Assert1(&I == I.getParent()->getTerminator(),
1317 "Terminator found in the middle of a basic block!", I.getParent());
1318 visitInstruction(I);
1321 void Verifier::visitBranchInst(BranchInst &BI) {
1322 if (BI.isConditional()) {
1323 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1324 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1326 visitTerminatorInst(BI);
1329 void Verifier::visitReturnInst(ReturnInst &RI) {
1330 Function *F = RI.getParent()->getParent();
1331 unsigned N = RI.getNumOperands();
1332 if (F->getReturnType()->isVoidTy())
1334 "Found return instr that returns non-void in Function of void "
1335 "return type!", &RI, F->getReturnType());
1337 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1338 "Function return type does not match operand "
1339 "type of return inst!", &RI, F->getReturnType());
1341 // Check to make sure that the return value has necessary properties for
1343 visitTerminatorInst(RI);
1346 void Verifier::visitSwitchInst(SwitchInst &SI) {
1347 // Check to make sure that all of the constants in the switch instruction
1348 // have the same type as the switched-on value.
1349 Type *SwitchTy = SI.getCondition()->getType();
1350 SmallPtrSet<ConstantInt*, 32> Constants;
1351 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1352 Assert1(i.getCaseValue()->getType() == SwitchTy,
1353 "Switch constants must all be same type as switch value!", &SI);
1354 Assert2(Constants.insert(i.getCaseValue()).second,
1355 "Duplicate integer as switch case", &SI, i.getCaseValue());
1358 visitTerminatorInst(SI);
1361 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1362 Assert1(BI.getAddress()->getType()->isPointerTy(),
1363 "Indirectbr operand must have pointer type!", &BI);
1364 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1365 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1366 "Indirectbr destinations must all have pointer type!", &BI);
1368 visitTerminatorInst(BI);
1371 void Verifier::visitSelectInst(SelectInst &SI) {
1372 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1374 "Invalid operands for select instruction!", &SI);
1376 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1377 "Select values must have same type as select instruction!", &SI);
1378 visitInstruction(SI);
1381 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1382 /// a pass, if any exist, it's an error.
1384 void Verifier::visitUserOp1(Instruction &I) {
1385 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1388 void Verifier::visitTruncInst(TruncInst &I) {
1389 // Get the source and destination types
1390 Type *SrcTy = I.getOperand(0)->getType();
1391 Type *DestTy = I.getType();
1393 // Get the size of the types in bits, we'll need this later
1394 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1395 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1397 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1398 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1399 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1400 "trunc source and destination must both be a vector or neither", &I);
1401 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1403 visitInstruction(I);
1406 void Verifier::visitZExtInst(ZExtInst &I) {
1407 // Get the source and destination types
1408 Type *SrcTy = I.getOperand(0)->getType();
1409 Type *DestTy = I.getType();
1411 // Get the size of the types in bits, we'll need this later
1412 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1413 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1414 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1415 "zext source and destination must both be a vector or neither", &I);
1416 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1417 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1419 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1421 visitInstruction(I);
1424 void Verifier::visitSExtInst(SExtInst &I) {
1425 // Get the source and destination types
1426 Type *SrcTy = I.getOperand(0)->getType();
1427 Type *DestTy = I.getType();
1429 // Get the size of the types in bits, we'll need this later
1430 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1431 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1433 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1434 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1435 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1436 "sext source and destination must both be a vector or neither", &I);
1437 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1439 visitInstruction(I);
1442 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1443 // Get the source and destination types
1444 Type *SrcTy = I.getOperand(0)->getType();
1445 Type *DestTy = I.getType();
1446 // Get the size of the types in bits, we'll need this later
1447 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1448 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1450 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1451 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1452 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1453 "fptrunc source and destination must both be a vector or neither",&I);
1454 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1456 visitInstruction(I);
1459 void Verifier::visitFPExtInst(FPExtInst &I) {
1460 // Get the source and destination types
1461 Type *SrcTy = I.getOperand(0)->getType();
1462 Type *DestTy = I.getType();
1464 // Get the size of the types in bits, we'll need this later
1465 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1466 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1468 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1469 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1470 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1471 "fpext source and destination must both be a vector or neither", &I);
1472 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1474 visitInstruction(I);
1477 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1478 // Get the source and destination types
1479 Type *SrcTy = I.getOperand(0)->getType();
1480 Type *DestTy = I.getType();
1482 bool SrcVec = SrcTy->isVectorTy();
1483 bool DstVec = DestTy->isVectorTy();
1485 Assert1(SrcVec == DstVec,
1486 "UIToFP source and dest must both be vector or scalar", &I);
1487 Assert1(SrcTy->isIntOrIntVectorTy(),
1488 "UIToFP source must be integer or integer vector", &I);
1489 Assert1(DestTy->isFPOrFPVectorTy(),
1490 "UIToFP result must be FP or FP vector", &I);
1492 if (SrcVec && DstVec)
1493 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1494 cast<VectorType>(DestTy)->getNumElements(),
1495 "UIToFP source and dest vector length mismatch", &I);
1497 visitInstruction(I);
1500 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1501 // Get the source and destination types
1502 Type *SrcTy = I.getOperand(0)->getType();
1503 Type *DestTy = I.getType();
1505 bool SrcVec = SrcTy->isVectorTy();
1506 bool DstVec = DestTy->isVectorTy();
1508 Assert1(SrcVec == DstVec,
1509 "SIToFP source and dest must both be vector or scalar", &I);
1510 Assert1(SrcTy->isIntOrIntVectorTy(),
1511 "SIToFP source must be integer or integer vector", &I);
1512 Assert1(DestTy->isFPOrFPVectorTy(),
1513 "SIToFP result must be FP or FP vector", &I);
1515 if (SrcVec && DstVec)
1516 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1517 cast<VectorType>(DestTy)->getNumElements(),
1518 "SIToFP source and dest vector length mismatch", &I);
1520 visitInstruction(I);
1523 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1524 // Get the source and destination types
1525 Type *SrcTy = I.getOperand(0)->getType();
1526 Type *DestTy = I.getType();
1528 bool SrcVec = SrcTy->isVectorTy();
1529 bool DstVec = DestTy->isVectorTy();
1531 Assert1(SrcVec == DstVec,
1532 "FPToUI source and dest must both be vector or scalar", &I);
1533 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1535 Assert1(DestTy->isIntOrIntVectorTy(),
1536 "FPToUI result must be integer or integer vector", &I);
1538 if (SrcVec && DstVec)
1539 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1540 cast<VectorType>(DestTy)->getNumElements(),
1541 "FPToUI source and dest vector length mismatch", &I);
1543 visitInstruction(I);
1546 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1547 // Get the source and destination types
1548 Type *SrcTy = I.getOperand(0)->getType();
1549 Type *DestTy = I.getType();
1551 bool SrcVec = SrcTy->isVectorTy();
1552 bool DstVec = DestTy->isVectorTy();
1554 Assert1(SrcVec == DstVec,
1555 "FPToSI source and dest must both be vector or scalar", &I);
1556 Assert1(SrcTy->isFPOrFPVectorTy(),
1557 "FPToSI source must be FP or FP vector", &I);
1558 Assert1(DestTy->isIntOrIntVectorTy(),
1559 "FPToSI result must be integer or integer vector", &I);
1561 if (SrcVec && DstVec)
1562 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1563 cast<VectorType>(DestTy)->getNumElements(),
1564 "FPToSI source and dest vector length mismatch", &I);
1566 visitInstruction(I);
1569 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1570 // Get the source and destination types
1571 Type *SrcTy = I.getOperand(0)->getType();
1572 Type *DestTy = I.getType();
1574 Assert1(SrcTy->getScalarType()->isPointerTy(),
1575 "PtrToInt source must be pointer", &I);
1576 Assert1(DestTy->getScalarType()->isIntegerTy(),
1577 "PtrToInt result must be integral", &I);
1578 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1579 "PtrToInt type mismatch", &I);
1581 if (SrcTy->isVectorTy()) {
1582 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1583 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1584 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1585 "PtrToInt Vector width mismatch", &I);
1588 visitInstruction(I);
1591 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1592 // Get the source and destination types
1593 Type *SrcTy = I.getOperand(0)->getType();
1594 Type *DestTy = I.getType();
1596 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1597 "IntToPtr source must be an integral", &I);
1598 Assert1(DestTy->getScalarType()->isPointerTy(),
1599 "IntToPtr result must be a pointer",&I);
1600 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1601 "IntToPtr type mismatch", &I);
1602 if (SrcTy->isVectorTy()) {
1603 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1604 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1605 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1606 "IntToPtr Vector width mismatch", &I);
1608 visitInstruction(I);
1611 void Verifier::visitBitCastInst(BitCastInst &I) {
1613 CastInst::castIsValid(Instruction::BitCast, I.getOperand(0), I.getType()),
1614 "Invalid bitcast", &I);
1615 visitInstruction(I);
1618 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1619 Type *SrcTy = I.getOperand(0)->getType();
1620 Type *DestTy = I.getType();
1622 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1623 "AddrSpaceCast source must be a pointer", &I);
1624 Assert1(DestTy->isPtrOrPtrVectorTy(),
1625 "AddrSpaceCast result must be a pointer", &I);
1626 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1627 "AddrSpaceCast must be between different address spaces", &I);
1628 if (SrcTy->isVectorTy())
1629 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1630 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1631 visitInstruction(I);
1634 /// visitPHINode - Ensure that a PHI node is well formed.
1636 void Verifier::visitPHINode(PHINode &PN) {
1637 // Ensure that the PHI nodes are all grouped together at the top of the block.
1638 // This can be tested by checking whether the instruction before this is
1639 // either nonexistent (because this is begin()) or is a PHI node. If not,
1640 // then there is some other instruction before a PHI.
1641 Assert2(&PN == &PN.getParent()->front() ||
1642 isa<PHINode>(--BasicBlock::iterator(&PN)),
1643 "PHI nodes not grouped at top of basic block!",
1644 &PN, PN.getParent());
1646 // Check that all of the values of the PHI node have the same type as the
1647 // result, and that the incoming blocks are really basic blocks.
1648 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1649 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1650 "PHI node operands are not the same type as the result!", &PN);
1653 // All other PHI node constraints are checked in the visitBasicBlock method.
1655 visitInstruction(PN);
1658 void Verifier::VerifyCallSite(CallSite CS) {
1659 Instruction *I = CS.getInstruction();
1661 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1662 "Called function must be a pointer!", I);
1663 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1665 Assert1(FPTy->getElementType()->isFunctionTy(),
1666 "Called function is not pointer to function type!", I);
1667 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1669 // Verify that the correct number of arguments are being passed
1670 if (FTy->isVarArg())
1671 Assert1(CS.arg_size() >= FTy->getNumParams(),
1672 "Called function requires more parameters than were provided!",I);
1674 Assert1(CS.arg_size() == FTy->getNumParams(),
1675 "Incorrect number of arguments passed to called function!", I);
1677 // Verify that all arguments to the call match the function type.
1678 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1679 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1680 "Call parameter type does not match function signature!",
1681 CS.getArgument(i), FTy->getParamType(i), I);
1683 AttributeSet Attrs = CS.getAttributes();
1685 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1686 "Attribute after last parameter!", I);
1688 // Verify call attributes.
1689 VerifyFunctionAttrs(FTy, Attrs, I);
1691 // Conservatively check the inalloca argument.
1692 // We have a bug if we can find that there is an underlying alloca without
1694 if (CS.hasInAllocaArgument()) {
1695 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
1696 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
1697 Assert2(AI->isUsedWithInAlloca(),
1698 "inalloca argument for call has mismatched alloca", AI, I);
1701 if (FTy->isVarArg()) {
1702 // FIXME? is 'nest' even legal here?
1703 bool SawNest = false;
1704 bool SawReturned = false;
1706 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1707 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1709 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1713 // Check attributes on the varargs part.
1714 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1715 Type *Ty = CS.getArgument(Idx-1)->getType();
1716 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1718 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1719 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1723 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1724 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1726 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1727 "Incompatible argument and return types for 'returned' "
1732 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1733 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1735 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1736 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1741 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1742 if (CS.getCalledFunction() == nullptr ||
1743 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1744 for (FunctionType::param_iterator PI = FTy->param_begin(),
1745 PE = FTy->param_end(); PI != PE; ++PI)
1746 Assert1(!(*PI)->isMetadataTy(),
1747 "Function has metadata parameter but isn't an intrinsic", I);
1750 visitInstruction(*I);
1753 /// Two types are "congruent" if they are identical, or if they are both pointer
1754 /// types with different pointee types and the same address space.
1755 static bool isTypeCongruent(Type *L, Type *R) {
1758 PointerType *PL = dyn_cast<PointerType>(L);
1759 PointerType *PR = dyn_cast<PointerType>(R);
1762 return PL->getAddressSpace() == PR->getAddressSpace();
1765 static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
1766 static const Attribute::AttrKind ABIAttrs[] = {
1767 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
1768 Attribute::InReg, Attribute::Returned};
1770 for (auto AK : ABIAttrs) {
1771 if (Attrs.hasAttribute(I + 1, AK))
1772 Copy.addAttribute(AK);
1774 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
1775 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
1779 void Verifier::verifyMustTailCall(CallInst &CI) {
1780 Assert1(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI);
1782 // - The caller and callee prototypes must match. Pointer types of
1783 // parameters or return types may differ in pointee type, but not
1785 Function *F = CI.getParent()->getParent();
1786 auto GetFnTy = [](Value *V) {
1787 return cast<FunctionType>(
1788 cast<PointerType>(V->getType())->getElementType());
1790 FunctionType *CallerTy = GetFnTy(F);
1791 FunctionType *CalleeTy = GetFnTy(CI.getCalledValue());
1792 Assert1(CallerTy->getNumParams() == CalleeTy->getNumParams(),
1793 "cannot guarantee tail call due to mismatched parameter counts", &CI);
1794 Assert1(CallerTy->isVarArg() == CalleeTy->isVarArg(),
1795 "cannot guarantee tail call due to mismatched varargs", &CI);
1796 Assert1(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),
1797 "cannot guarantee tail call due to mismatched return types", &CI);
1798 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1800 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),
1801 "cannot guarantee tail call due to mismatched parameter types", &CI);
1804 // - The calling conventions of the caller and callee must match.
1805 Assert1(F->getCallingConv() == CI.getCallingConv(),
1806 "cannot guarantee tail call due to mismatched calling conv", &CI);
1808 // - All ABI-impacting function attributes, such as sret, byval, inreg,
1809 // returned, and inalloca, must match.
1810 AttributeSet CallerAttrs = F->getAttributes();
1811 AttributeSet CalleeAttrs = CI.getAttributes();
1812 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1813 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
1814 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
1815 Assert2(CallerABIAttrs == CalleeABIAttrs,
1816 "cannot guarantee tail call due to mismatched ABI impacting "
1817 "function attributes", &CI, CI.getOperand(I));
1820 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
1821 // or a pointer bitcast followed by a ret instruction.
1822 // - The ret instruction must return the (possibly bitcasted) value
1823 // produced by the call or void.
1824 Value *RetVal = &CI;
1825 Instruction *Next = CI.getNextNode();
1827 // Handle the optional bitcast.
1828 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
1829 Assert1(BI->getOperand(0) == RetVal,
1830 "bitcast following musttail call must use the call", BI);
1832 Next = BI->getNextNode();
1835 // Check the return.
1836 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
1837 Assert1(Ret, "musttail call must be precede a ret with an optional bitcast",
1839 Assert1(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,
1840 "musttail call result must be returned", Ret);
1843 void Verifier::visitCallInst(CallInst &CI) {
1844 VerifyCallSite(&CI);
1846 if (CI.isMustTailCall())
1847 verifyMustTailCall(CI);
1849 if (Function *F = CI.getCalledFunction())
1850 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1851 visitIntrinsicFunctionCall(ID, CI);
1854 void Verifier::visitInvokeInst(InvokeInst &II) {
1855 VerifyCallSite(&II);
1857 // Verify that there is a landingpad instruction as the first non-PHI
1858 // instruction of the 'unwind' destination.
1859 Assert1(II.getUnwindDest()->isLandingPad(),
1860 "The unwind destination does not have a landingpad instruction!",&II);
1862 visitTerminatorInst(II);
1865 /// visitBinaryOperator - Check that both arguments to the binary operator are
1866 /// of the same type!
1868 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1869 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1870 "Both operands to a binary operator are not of the same type!", &B);
1872 switch (B.getOpcode()) {
1873 // Check that integer arithmetic operators are only used with
1874 // integral operands.
1875 case Instruction::Add:
1876 case Instruction::Sub:
1877 case Instruction::Mul:
1878 case Instruction::SDiv:
1879 case Instruction::UDiv:
1880 case Instruction::SRem:
1881 case Instruction::URem:
1882 Assert1(B.getType()->isIntOrIntVectorTy(),
1883 "Integer arithmetic operators only work with integral types!", &B);
1884 Assert1(B.getType() == B.getOperand(0)->getType(),
1885 "Integer arithmetic operators must have same type "
1886 "for operands and result!", &B);
1888 // Check that floating-point arithmetic operators are only used with
1889 // floating-point operands.
1890 case Instruction::FAdd:
1891 case Instruction::FSub:
1892 case Instruction::FMul:
1893 case Instruction::FDiv:
1894 case Instruction::FRem:
1895 Assert1(B.getType()->isFPOrFPVectorTy(),
1896 "Floating-point arithmetic operators only work with "
1897 "floating-point types!", &B);
1898 Assert1(B.getType() == B.getOperand(0)->getType(),
1899 "Floating-point arithmetic operators must have same type "
1900 "for operands and result!", &B);
1902 // Check that logical operators are only used with integral operands.
1903 case Instruction::And:
1904 case Instruction::Or:
1905 case Instruction::Xor:
1906 Assert1(B.getType()->isIntOrIntVectorTy(),
1907 "Logical operators only work with integral types!", &B);
1908 Assert1(B.getType() == B.getOperand(0)->getType(),
1909 "Logical operators must have same type for operands and result!",
1912 case Instruction::Shl:
1913 case Instruction::LShr:
1914 case Instruction::AShr:
1915 Assert1(B.getType()->isIntOrIntVectorTy(),
1916 "Shifts only work with integral types!", &B);
1917 Assert1(B.getType() == B.getOperand(0)->getType(),
1918 "Shift return type must be same as operands!", &B);
1921 llvm_unreachable("Unknown BinaryOperator opcode!");
1924 visitInstruction(B);
1927 void Verifier::visitICmpInst(ICmpInst &IC) {
1928 // Check that the operands are the same type
1929 Type *Op0Ty = IC.getOperand(0)->getType();
1930 Type *Op1Ty = IC.getOperand(1)->getType();
1931 Assert1(Op0Ty == Op1Ty,
1932 "Both operands to ICmp instruction are not of the same type!", &IC);
1933 // Check that the operands are the right type
1934 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1935 "Invalid operand types for ICmp instruction", &IC);
1936 // Check that the predicate is valid.
1937 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1938 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1939 "Invalid predicate in ICmp instruction!", &IC);
1941 visitInstruction(IC);
1944 void Verifier::visitFCmpInst(FCmpInst &FC) {
1945 // Check that the operands are the same type
1946 Type *Op0Ty = FC.getOperand(0)->getType();
1947 Type *Op1Ty = FC.getOperand(1)->getType();
1948 Assert1(Op0Ty == Op1Ty,
1949 "Both operands to FCmp instruction are not of the same type!", &FC);
1950 // Check that the operands are the right type
1951 Assert1(Op0Ty->isFPOrFPVectorTy(),
1952 "Invalid operand types for FCmp instruction", &FC);
1953 // Check that the predicate is valid.
1954 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1955 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1956 "Invalid predicate in FCmp instruction!", &FC);
1958 visitInstruction(FC);
1961 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1962 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1964 "Invalid extractelement operands!", &EI);
1965 visitInstruction(EI);
1968 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1969 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1972 "Invalid insertelement operands!", &IE);
1973 visitInstruction(IE);
1976 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1977 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1979 "Invalid shufflevector operands!", &SV);
1980 visitInstruction(SV);
1983 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1984 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1986 Assert1(isa<PointerType>(TargetTy),
1987 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1988 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1989 "GEP into unsized type!", &GEP);
1990 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1991 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1994 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1996 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1997 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1999 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
2000 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
2001 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
2003 if (GEP.getPointerOperandType()->isVectorTy()) {
2004 // Additional checks for vector GEPs.
2005 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
2006 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
2007 "Vector GEP result width doesn't match operand's", &GEP);
2008 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
2009 Type *IndexTy = Idxs[i]->getType();
2010 Assert1(IndexTy->isVectorTy(),
2011 "Vector GEP must have vector indices!", &GEP);
2012 unsigned IndexWidth = IndexTy->getVectorNumElements();
2013 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
2016 visitInstruction(GEP);
2019 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
2020 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
2023 void Verifier::visitRangeMetadata(Instruction& I,
2024 MDNode* Range, Type* Ty) {
2026 Range == I.getMetadata(LLVMContext::MD_range) &&
2027 "precondition violation");
2029 unsigned NumOperands = Range->getNumOperands();
2030 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
2031 unsigned NumRanges = NumOperands / 2;
2032 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
2034 ConstantRange LastRange(1); // Dummy initial value
2035 for (unsigned i = 0; i < NumRanges; ++i) {
2037 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i));
2038 Assert1(Low, "The lower limit must be an integer!", Low);
2040 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i + 1));
2041 Assert1(High, "The upper limit must be an integer!", High);
2042 Assert1(High->getType() == Low->getType() &&
2043 High->getType() == Ty, "Range types must match instruction type!",
2046 APInt HighV = High->getValue();
2047 APInt LowV = Low->getValue();
2048 ConstantRange CurRange(LowV, HighV);
2049 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
2050 "Range must not be empty!", Range);
2052 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
2053 "Intervals are overlapping", Range);
2054 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
2056 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
2059 LastRange = ConstantRange(LowV, HighV);
2061 if (NumRanges > 2) {
2063 mdconst::dyn_extract<ConstantInt>(Range->getOperand(0))->getValue();
2065 mdconst::dyn_extract<ConstantInt>(Range->getOperand(1))->getValue();
2066 ConstantRange FirstRange(FirstLow, FirstHigh);
2067 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
2068 "Intervals are overlapping", Range);
2069 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
2074 void Verifier::visitLoadInst(LoadInst &LI) {
2075 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
2076 Assert1(PTy, "Load operand must be a pointer.", &LI);
2077 Type *ElTy = PTy->getElementType();
2078 Assert2(ElTy == LI.getType(),
2079 "Load result type does not match pointer operand type!", &LI, ElTy);
2080 Assert1(LI.getAlignment() <= Value::MaximumAlignment,
2081 "huge alignment values are unsupported", &LI);
2082 if (LI.isAtomic()) {
2083 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
2084 "Load cannot have Release ordering", &LI);
2085 Assert1(LI.getAlignment() != 0,
2086 "Atomic load must specify explicit alignment", &LI);
2087 if (!ElTy->isPointerTy()) {
2088 Assert2(ElTy->isIntegerTy(),
2089 "atomic load operand must have integer type!",
2091 unsigned Size = ElTy->getPrimitiveSizeInBits();
2092 Assert2(Size >= 8 && !(Size & (Size - 1)),
2093 "atomic load operand must be power-of-two byte-sized integer",
2097 Assert1(LI.getSynchScope() == CrossThread,
2098 "Non-atomic load cannot have SynchronizationScope specified", &LI);
2101 visitInstruction(LI);
2104 void Verifier::visitStoreInst(StoreInst &SI) {
2105 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
2106 Assert1(PTy, "Store operand must be a pointer.", &SI);
2107 Type *ElTy = PTy->getElementType();
2108 Assert2(ElTy == SI.getOperand(0)->getType(),
2109 "Stored value type does not match pointer operand type!",
2111 Assert1(SI.getAlignment() <= Value::MaximumAlignment,
2112 "huge alignment values are unsupported", &SI);
2113 if (SI.isAtomic()) {
2114 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
2115 "Store cannot have Acquire ordering", &SI);
2116 Assert1(SI.getAlignment() != 0,
2117 "Atomic store must specify explicit alignment", &SI);
2118 if (!ElTy->isPointerTy()) {
2119 Assert2(ElTy->isIntegerTy(),
2120 "atomic store operand must have integer type!",
2122 unsigned Size = ElTy->getPrimitiveSizeInBits();
2123 Assert2(Size >= 8 && !(Size & (Size - 1)),
2124 "atomic store operand must be power-of-two byte-sized integer",
2128 Assert1(SI.getSynchScope() == CrossThread,
2129 "Non-atomic store cannot have SynchronizationScope specified", &SI);
2131 visitInstruction(SI);
2134 void Verifier::visitAllocaInst(AllocaInst &AI) {
2135 SmallPtrSet<const Type*, 4> Visited;
2136 PointerType *PTy = AI.getType();
2137 Assert1(PTy->getAddressSpace() == 0,
2138 "Allocation instruction pointer not in the generic address space!",
2140 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
2142 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
2143 "Alloca array size must have integer type", &AI);
2144 Assert1(AI.getAlignment() <= Value::MaximumAlignment,
2145 "huge alignment values are unsupported", &AI);
2147 visitInstruction(AI);
2150 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
2152 // FIXME: more conditions???
2153 Assert1(CXI.getSuccessOrdering() != NotAtomic,
2154 "cmpxchg instructions must be atomic.", &CXI);
2155 Assert1(CXI.getFailureOrdering() != NotAtomic,
2156 "cmpxchg instructions must be atomic.", &CXI);
2157 Assert1(CXI.getSuccessOrdering() != Unordered,
2158 "cmpxchg instructions cannot be unordered.", &CXI);
2159 Assert1(CXI.getFailureOrdering() != Unordered,
2160 "cmpxchg instructions cannot be unordered.", &CXI);
2161 Assert1(CXI.getSuccessOrdering() >= CXI.getFailureOrdering(),
2162 "cmpxchg instructions be at least as constrained on success as fail",
2164 Assert1(CXI.getFailureOrdering() != Release &&
2165 CXI.getFailureOrdering() != AcquireRelease,
2166 "cmpxchg failure ordering cannot include release semantics", &CXI);
2168 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
2169 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
2170 Type *ElTy = PTy->getElementType();
2171 Assert2(ElTy->isIntegerTy(),
2172 "cmpxchg operand must have integer type!",
2174 unsigned Size = ElTy->getPrimitiveSizeInBits();
2175 Assert2(Size >= 8 && !(Size & (Size - 1)),
2176 "cmpxchg operand must be power-of-two byte-sized integer",
2178 Assert2(ElTy == CXI.getOperand(1)->getType(),
2179 "Expected value type does not match pointer operand type!",
2181 Assert2(ElTy == CXI.getOperand(2)->getType(),
2182 "Stored value type does not match pointer operand type!",
2184 visitInstruction(CXI);
2187 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
2188 Assert1(RMWI.getOrdering() != NotAtomic,
2189 "atomicrmw instructions must be atomic.", &RMWI);
2190 Assert1(RMWI.getOrdering() != Unordered,
2191 "atomicrmw instructions cannot be unordered.", &RMWI);
2192 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
2193 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
2194 Type *ElTy = PTy->getElementType();
2195 Assert2(ElTy->isIntegerTy(),
2196 "atomicrmw operand must have integer type!",
2198 unsigned Size = ElTy->getPrimitiveSizeInBits();
2199 Assert2(Size >= 8 && !(Size & (Size - 1)),
2200 "atomicrmw operand must be power-of-two byte-sized integer",
2202 Assert2(ElTy == RMWI.getOperand(1)->getType(),
2203 "Argument value type does not match pointer operand type!",
2205 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
2206 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
2207 "Invalid binary operation!", &RMWI);
2208 visitInstruction(RMWI);
2211 void Verifier::visitFenceInst(FenceInst &FI) {
2212 const AtomicOrdering Ordering = FI.getOrdering();
2213 Assert1(Ordering == Acquire || Ordering == Release ||
2214 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
2215 "fence instructions may only have "
2216 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
2217 visitInstruction(FI);
2220 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
2221 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
2222 EVI.getIndices()) ==
2224 "Invalid ExtractValueInst operands!", &EVI);
2226 visitInstruction(EVI);
2229 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
2230 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
2231 IVI.getIndices()) ==
2232 IVI.getOperand(1)->getType(),
2233 "Invalid InsertValueInst operands!", &IVI);
2235 visitInstruction(IVI);
2238 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
2239 BasicBlock *BB = LPI.getParent();
2241 // The landingpad instruction is ill-formed if it doesn't have any clauses and
2243 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
2244 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
2246 // The landingpad instruction defines its parent as a landing pad block. The
2247 // landing pad block may be branched to only by the unwind edge of an invoke.
2248 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
2249 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
2250 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
2251 "Block containing LandingPadInst must be jumped to "
2252 "only by the unwind edge of an invoke.", &LPI);
2255 // The landingpad instruction must be the first non-PHI instruction in the
2257 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
2258 "LandingPadInst not the first non-PHI instruction in the block.",
2261 // The personality functions for all landingpad instructions within the same
2262 // function should match.
2264 Assert1(LPI.getPersonalityFn() == PersonalityFn,
2265 "Personality function doesn't match others in function", &LPI);
2266 PersonalityFn = LPI.getPersonalityFn();
2268 // All operands must be constants.
2269 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
2271 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
2272 Constant *Clause = LPI.getClause(i);
2273 if (LPI.isCatch(i)) {
2274 Assert1(isa<PointerType>(Clause->getType()),
2275 "Catch operand does not have pointer type!", &LPI);
2277 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
2278 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
2279 "Filter operand is not an array of constants!", &LPI);
2283 visitInstruction(LPI);
2286 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
2287 Instruction *Op = cast<Instruction>(I.getOperand(i));
2288 // If the we have an invalid invoke, don't try to compute the dominance.
2289 // We already reject it in the invoke specific checks and the dominance
2290 // computation doesn't handle multiple edges.
2291 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2292 if (II->getNormalDest() == II->getUnwindDest())
2296 const Use &U = I.getOperandUse(i);
2297 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
2298 "Instruction does not dominate all uses!", Op, &I);
2301 /// verifyInstruction - Verify that an instruction is well formed.
2303 void Verifier::visitInstruction(Instruction &I) {
2304 BasicBlock *BB = I.getParent();
2305 Assert1(BB, "Instruction not embedded in basic block!", &I);
2307 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2308 for (User *U : I.users()) {
2309 Assert1(U != (User*)&I || !DT.isReachableFromEntry(BB),
2310 "Only PHI nodes may reference their own value!", &I);
2314 // Check that void typed values don't have names
2315 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2316 "Instruction has a name, but provides a void value!", &I);
2318 // Check that the return value of the instruction is either void or a legal
2320 Assert1(I.getType()->isVoidTy() ||
2321 I.getType()->isFirstClassType(),
2322 "Instruction returns a non-scalar type!", &I);
2324 // Check that the instruction doesn't produce metadata. Calls are already
2325 // checked against the callee type.
2326 Assert1(!I.getType()->isMetadataTy() ||
2327 isa<CallInst>(I) || isa<InvokeInst>(I),
2328 "Invalid use of metadata!", &I);
2330 // Check that all uses of the instruction, if they are instructions
2331 // themselves, actually have parent basic blocks. If the use is not an
2332 // instruction, it is an error!
2333 for (Use &U : I.uses()) {
2334 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
2335 Assert2(Used->getParent() != nullptr, "Instruction referencing"
2336 " instruction not embedded in a basic block!", &I, Used);
2338 CheckFailed("Use of instruction is not an instruction!", U);
2343 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2344 Assert1(I.getOperand(i) != nullptr, "Instruction has null operand!", &I);
2346 // Check to make sure that only first-class-values are operands to
2348 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2349 Assert1(0, "Instruction operands must be first-class values!", &I);
2352 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2353 // Check to make sure that the "address of" an intrinsic function is never
2355 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 :
2356 isa<InvokeInst>(I) ? e-3 : 0),
2357 "Cannot take the address of an intrinsic!", &I);
2358 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2359 F->getIntrinsicID() == Intrinsic::donothing ||
2360 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void ||
2361 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64,
2362 "Cannot invoke an intrinsinc other than"
2363 " donothing or patchpoint", &I);
2364 Assert1(F->getParent() == M, "Referencing function in another module!",
2366 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2367 Assert1(OpBB->getParent() == BB->getParent(),
2368 "Referring to a basic block in another function!", &I);
2369 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2370 Assert1(OpArg->getParent() == BB->getParent(),
2371 "Referring to an argument in another function!", &I);
2372 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2373 Assert1(GV->getParent() == M, "Referencing global in another module!",
2375 } else if (isa<Instruction>(I.getOperand(i))) {
2376 verifyDominatesUse(I, i);
2377 } else if (isa<InlineAsm>(I.getOperand(i))) {
2378 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2379 (i + 3 == e && isa<InvokeInst>(I)),
2380 "Cannot take the address of an inline asm!", &I);
2381 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2382 if (CE->getType()->isPtrOrPtrVectorTy()) {
2383 // If we have a ConstantExpr pointer, we need to see if it came from an
2384 // illegal bitcast (inttoptr <constant int> )
2385 SmallVector<const ConstantExpr *, 4> Stack;
2386 SmallPtrSet<const ConstantExpr *, 4> Visited;
2387 Stack.push_back(CE);
2389 while (!Stack.empty()) {
2390 const ConstantExpr *V = Stack.pop_back_val();
2391 if (!Visited.insert(V).second)
2394 VerifyConstantExprBitcastType(V);
2396 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2397 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2398 Stack.push_back(Op);
2405 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2406 Assert1(I.getType()->isFPOrFPVectorTy(),
2407 "fpmath requires a floating point result!", &I);
2408 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2409 if (ConstantFP *CFP0 =
2410 mdconst::dyn_extract_or_null<ConstantFP>(MD->getOperand(0))) {
2411 APFloat Accuracy = CFP0->getValueAPF();
2412 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2413 "fpmath accuracy not a positive number!", &I);
2415 Assert1(false, "invalid fpmath accuracy!", &I);
2419 if (MDNode *Range = I.getMetadata(LLVMContext::MD_range)) {
2420 Assert1(isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),
2421 "Ranges are only for loads, calls and invokes!", &I);
2422 visitRangeMetadata(I, Range, I.getType());
2425 if (I.getMetadata(LLVMContext::MD_nonnull)) {
2426 Assert1(I.getType()->isPointerTy(),
2427 "nonnull applies only to pointer types", &I);
2428 Assert1(isa<LoadInst>(I),
2429 "nonnull applies only to load instructions, use attributes"
2430 " for calls or invokes", &I);
2433 InstsInThisBlock.insert(&I);
2436 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2437 /// intrinsic argument or return value) matches the type constraints specified
2438 /// by the .td file (e.g. an "any integer" argument really is an integer).
2440 /// This return true on error but does not print a message.
2441 bool Verifier::VerifyIntrinsicType(Type *Ty,
2442 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2443 SmallVectorImpl<Type*> &ArgTys) {
2444 using namespace Intrinsic;
2446 // If we ran out of descriptors, there are too many arguments.
2447 if (Infos.empty()) return true;
2448 IITDescriptor D = Infos.front();
2449 Infos = Infos.slice(1);
2452 case IITDescriptor::Void: return !Ty->isVoidTy();
2453 case IITDescriptor::VarArg: return true;
2454 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2455 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2456 case IITDescriptor::Half: return !Ty->isHalfTy();
2457 case IITDescriptor::Float: return !Ty->isFloatTy();
2458 case IITDescriptor::Double: return !Ty->isDoubleTy();
2459 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2460 case IITDescriptor::Vector: {
2461 VectorType *VT = dyn_cast<VectorType>(Ty);
2462 return !VT || VT->getNumElements() != D.Vector_Width ||
2463 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2465 case IITDescriptor::Pointer: {
2466 PointerType *PT = dyn_cast<PointerType>(Ty);
2467 return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2468 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2471 case IITDescriptor::Struct: {
2472 StructType *ST = dyn_cast<StructType>(Ty);
2473 if (!ST || ST->getNumElements() != D.Struct_NumElements)
2476 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2477 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2482 case IITDescriptor::Argument:
2483 // Two cases here - If this is the second occurrence of an argument, verify
2484 // that the later instance matches the previous instance.
2485 if (D.getArgumentNumber() < ArgTys.size())
2486 return Ty != ArgTys[D.getArgumentNumber()];
2488 // Otherwise, if this is the first instance of an argument, record it and
2489 // verify the "Any" kind.
2490 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2491 ArgTys.push_back(Ty);
2493 switch (D.getArgumentKind()) {
2494 case IITDescriptor::AK_Any: return false; // Success
2495 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2496 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2497 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2498 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2500 llvm_unreachable("all argument kinds not covered");
2502 case IITDescriptor::ExtendArgument: {
2503 // This may only be used when referring to a previous vector argument.
2504 if (D.getArgumentNumber() >= ArgTys.size())
2507 Type *NewTy = ArgTys[D.getArgumentNumber()];
2508 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2509 NewTy = VectorType::getExtendedElementVectorType(VTy);
2510 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2511 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2517 case IITDescriptor::TruncArgument: {
2518 // This may only be used when referring to a previous vector argument.
2519 if (D.getArgumentNumber() >= ArgTys.size())
2522 Type *NewTy = ArgTys[D.getArgumentNumber()];
2523 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2524 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2525 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2526 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
2532 case IITDescriptor::HalfVecArgument:
2533 // This may only be used when referring to a previous vector argument.
2534 return D.getArgumentNumber() >= ArgTys.size() ||
2535 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2536 VectorType::getHalfElementsVectorType(
2537 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2538 case IITDescriptor::SameVecWidthArgument: {
2539 if (D.getArgumentNumber() >= ArgTys.size())
2541 VectorType * ReferenceType =
2542 dyn_cast<VectorType>(ArgTys[D.getArgumentNumber()]);
2543 VectorType *ThisArgType = dyn_cast<VectorType>(Ty);
2544 if (!ThisArgType || !ReferenceType ||
2545 (ReferenceType->getVectorNumElements() !=
2546 ThisArgType->getVectorNumElements()))
2548 return VerifyIntrinsicType(ThisArgType->getVectorElementType(),
2551 case IITDescriptor::PtrToArgument: {
2552 if (D.getArgumentNumber() >= ArgTys.size())
2554 Type * ReferenceType = ArgTys[D.getArgumentNumber()];
2555 PointerType *ThisArgType = dyn_cast<PointerType>(Ty);
2556 return (!ThisArgType || ThisArgType->getElementType() != ReferenceType);
2559 llvm_unreachable("unhandled");
2562 /// \brief Verify if the intrinsic has variable arguments.
2563 /// This method is intended to be called after all the fixed arguments have been
2566 /// This method returns true on error and does not print an error message.
2568 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2569 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2570 using namespace Intrinsic;
2572 // If there are no descriptors left, then it can't be a vararg.
2574 return isVarArg ? true : false;
2576 // There should be only one descriptor remaining at this point.
2577 if (Infos.size() != 1)
2580 // Check and verify the descriptor.
2581 IITDescriptor D = Infos.front();
2582 Infos = Infos.slice(1);
2583 if (D.Kind == IITDescriptor::VarArg)
2584 return isVarArg ? false : true;
2589 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2591 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2592 Function *IF = CI.getCalledFunction();
2593 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2596 // Verify that the intrinsic prototype lines up with what the .td files
2598 FunctionType *IFTy = IF->getFunctionType();
2599 bool IsVarArg = IFTy->isVarArg();
2601 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2602 getIntrinsicInfoTableEntries(ID, Table);
2603 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2605 SmallVector<Type *, 4> ArgTys;
2606 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2607 "Intrinsic has incorrect return type!", IF);
2608 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2609 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2610 "Intrinsic has incorrect argument type!", IF);
2612 // Verify if the intrinsic call matches the vararg property.
2614 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2615 "Intrinsic was not defined with variable arguments!", IF);
2617 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2618 "Callsite was not defined with variable arguments!", IF);
2620 // All descriptors should be absorbed by now.
2621 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2623 // Now that we have the intrinsic ID and the actual argument types (and we
2624 // know they are legal for the intrinsic!) get the intrinsic name through the
2625 // usual means. This allows us to verify the mangling of argument types into
2627 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
2628 Assert1(ExpectedName == IF->getName(),
2629 "Intrinsic name not mangled correctly for type arguments! "
2630 "Should be: " + ExpectedName, IF);
2632 // If the intrinsic takes MDNode arguments, verify that they are either global
2633 // or are local to *this* function.
2634 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2635 if (auto *MD = dyn_cast<MetadataAsValue>(CI.getArgOperand(i)))
2636 visitMetadataAsValue(*MD, CI.getParent()->getParent());
2641 case Intrinsic::ctlz: // llvm.ctlz
2642 case Intrinsic::cttz: // llvm.cttz
2643 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2644 "is_zero_undef argument of bit counting intrinsics must be a "
2645 "constant int", &CI);
2647 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2648 Assert1(CI.getArgOperand(0) && isa<MetadataAsValue>(CI.getArgOperand(0)),
2649 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2651 case Intrinsic::memcpy:
2652 case Intrinsic::memmove:
2653 case Intrinsic::memset:
2654 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2655 "alignment argument of memory intrinsics must be a constant int",
2657 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2658 "isvolatile argument of memory intrinsics must be a constant int",
2661 case Intrinsic::gcroot:
2662 case Intrinsic::gcwrite:
2663 case Intrinsic::gcread:
2664 if (ID == Intrinsic::gcroot) {
2666 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2667 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2668 Assert1(isa<Constant>(CI.getArgOperand(1)),
2669 "llvm.gcroot parameter #2 must be a constant.", &CI);
2670 if (!AI->getType()->getElementType()->isPointerTy()) {
2671 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2672 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2673 "or argument #2 must be a non-null constant.", &CI);
2677 Assert1(CI.getParent()->getParent()->hasGC(),
2678 "Enclosing function does not use GC.", &CI);
2680 case Intrinsic::init_trampoline:
2681 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2682 "llvm.init_trampoline parameter #2 must resolve to a function.",
2685 case Intrinsic::prefetch:
2686 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2687 isa<ConstantInt>(CI.getArgOperand(2)) &&
2688 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2689 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2690 "invalid arguments to llvm.prefetch",
2693 case Intrinsic::stackprotector:
2694 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2695 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2698 case Intrinsic::lifetime_start:
2699 case Intrinsic::lifetime_end:
2700 case Intrinsic::invariant_start:
2701 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2702 "size argument of memory use markers must be a constant integer",
2705 case Intrinsic::invariant_end:
2706 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2707 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2710 case Intrinsic::frameallocate: {
2711 BasicBlock *BB = CI.getParent();
2712 Assert1(BB == &BB->getParent()->front(),
2713 "llvm.frameallocate used outside of entry block", &CI);
2714 Assert1(!SawFrameAllocate,
2715 "multiple calls to llvm.frameallocate in one function", &CI);
2716 SawFrameAllocate = true;
2717 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2718 "llvm.frameallocate argument must be constant integer size", &CI);
2721 case Intrinsic::framerecover: {
2722 Value *FnArg = CI.getArgOperand(0)->stripPointerCasts();
2723 Function *Fn = dyn_cast<Function>(FnArg);
2724 Assert1(Fn && !Fn->isDeclaration(), "llvm.framerecover first "
2725 "argument must be function defined in this module", &CI);
2729 case Intrinsic::experimental_gc_statepoint:
2730 Assert1(!CI.isInlineAsm(),
2731 "gc.statepoint support for inline assembly unimplemented", &CI);
2733 VerifyStatepoint(ImmutableCallSite(&CI));
2735 case Intrinsic::experimental_gc_result_int:
2736 case Intrinsic::experimental_gc_result_float:
2737 case Intrinsic::experimental_gc_result_ptr:
2738 case Intrinsic::experimental_gc_result: {
2739 // Are we tied to a statepoint properly?
2740 CallSite StatepointCS(CI.getArgOperand(0));
2741 const Function *StatepointFn =
2742 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : nullptr;
2743 Assert2(StatepointFn && StatepointFn->isDeclaration() &&
2744 StatepointFn->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2745 "gc.result operand #1 must be from a statepoint",
2746 &CI, CI.getArgOperand(0));
2748 // Assert that result type matches wrapped callee.
2749 const Value *Target = StatepointCS.getArgument(0);
2750 const PointerType *PT = cast<PointerType>(Target->getType());
2751 const FunctionType *TargetFuncType =
2752 cast<FunctionType>(PT->getElementType());
2753 Assert1(CI.getType() == TargetFuncType->getReturnType(),
2754 "gc.result result type does not match wrapped callee",
2758 case Intrinsic::experimental_gc_relocate: {
2759 // Are we tied to a statepoint properly?
2760 CallSite StatepointCS(CI.getArgOperand(0));
2761 const Function *StatepointFn =
2762 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : nullptr;
2763 Assert2(StatepointFn && StatepointFn->isDeclaration() &&
2764 StatepointFn->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2765 "gc.relocate operand #1 must be from a statepoint",
2766 &CI, CI.getArgOperand(0));
2768 // Both the base and derived must be piped through the safepoint
2769 Value* Base = CI.getArgOperand(1);
2770 Assert1(isa<ConstantInt>(Base),
2771 "gc.relocate operand #2 must be integer offset", &CI);
2773 Value* Derived = CI.getArgOperand(2);
2774 Assert1(isa<ConstantInt>(Derived),
2775 "gc.relocate operand #3 must be integer offset", &CI);
2777 const int BaseIndex = cast<ConstantInt>(Base)->getZExtValue();
2778 const int DerivedIndex = cast<ConstantInt>(Derived)->getZExtValue();
2780 Assert1(0 <= BaseIndex &&
2781 BaseIndex < (int)StatepointCS.arg_size(),
2782 "gc.relocate: statepoint base index out of bounds", &CI);
2783 Assert1(0 <= DerivedIndex &&
2784 DerivedIndex < (int)StatepointCS.arg_size(),
2785 "gc.relocate: statepoint derived index out of bounds", &CI);
2787 // Check that BaseIndex and DerivedIndex fall within the 'gc parameters'
2788 // section of the statepoint's argument
2789 const int NumCallArgs =
2790 cast<ConstantInt>(StatepointCS.getArgument(1))->getZExtValue();
2791 const int NumDeoptArgs =
2792 cast<ConstantInt>(StatepointCS.getArgument(NumCallArgs + 3))->getZExtValue();
2793 const int GCParamArgsStart = NumCallArgs + NumDeoptArgs + 4;
2794 const int GCParamArgsEnd = StatepointCS.arg_size();
2795 Assert1(GCParamArgsStart <= BaseIndex &&
2796 BaseIndex < GCParamArgsEnd,
2797 "gc.relocate: statepoint base index doesn't fall within the "
2798 "'gc parameters' section of the statepoint call", &CI);
2799 Assert1(GCParamArgsStart <= DerivedIndex &&
2800 DerivedIndex < GCParamArgsEnd,
2801 "gc.relocate: statepoint derived index doesn't fall within the "
2802 "'gc parameters' section of the statepoint call", &CI);
2805 // Assert that the result type matches the type of the relocated pointer
2806 GCRelocateOperands Operands(&CI);
2807 Assert1(Operands.derivedPtr()->getType() == CI.getType(),
2808 "gc.relocate: relocating a pointer shouldn't change its type",
2815 void DebugInfoVerifier::verifyDebugInfo() {
2816 if (!VerifyDebugInfo)
2819 DebugInfoFinder Finder;
2820 Finder.processModule(*M);
2821 processInstructions(Finder);
2823 // Verify Debug Info.
2825 // NOTE: The loud braces are necessary for MSVC compatibility.
2826 for (DICompileUnit CU : Finder.compile_units()) {
2827 Assert1(CU.Verify(), "DICompileUnit does not Verify!", CU);
2829 for (DISubprogram S : Finder.subprograms()) {
2830 Assert1(S.Verify(), "DISubprogram does not Verify!", S);
2832 for (DIGlobalVariable GV : Finder.global_variables()) {
2833 Assert1(GV.Verify(), "DIGlobalVariable does not Verify!", GV);
2835 for (DIType T : Finder.types()) {
2836 Assert1(T.Verify(), "DIType does not Verify!", T);
2838 for (DIScope S : Finder.scopes()) {
2839 Assert1(S.Verify(), "DIScope does not Verify!", S);
2843 void DebugInfoVerifier::processInstructions(DebugInfoFinder &Finder) {
2844 for (const Function &F : *M)
2845 for (auto I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2846 if (MDNode *MD = I->getMetadata(LLVMContext::MD_dbg))
2847 Finder.processLocation(*M, DILocation(MD));
2848 if (const CallInst *CI = dyn_cast<CallInst>(&*I))
2849 processCallInst(Finder, *CI);
2853 void DebugInfoVerifier::processCallInst(DebugInfoFinder &Finder,
2854 const CallInst &CI) {
2855 if (Function *F = CI.getCalledFunction())
2856 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2858 case Intrinsic::dbg_declare: {
2859 auto *DDI = cast<DbgDeclareInst>(&CI);
2860 Finder.processDeclare(*M, DDI);
2861 if (auto E = DDI->getExpression())
2862 Assert1(DIExpression(E).Verify(), "DIExpression does not Verify!", E);
2865 case Intrinsic::dbg_value: {
2866 auto *DVI = cast<DbgValueInst>(&CI);
2867 Finder.processValue(*M, DVI);
2868 if (auto E = DVI->getExpression())
2869 Assert1(DIExpression(E).Verify(), "DIExpression does not Verify!", E);
2877 //===----------------------------------------------------------------------===//
2878 // Implement the public interfaces to this file...
2879 //===----------------------------------------------------------------------===//
2881 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
2882 Function &F = const_cast<Function &>(f);
2883 assert(!F.isDeclaration() && "Cannot verify external functions");
2885 raw_null_ostream NullStr;
2886 Verifier V(OS ? *OS : NullStr);
2888 // Note that this function's return value is inverted from what you would
2889 // expect of a function called "verify".
2890 return !V.verify(F);
2893 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
2894 raw_null_ostream NullStr;
2895 Verifier V(OS ? *OS : NullStr);
2897 bool Broken = false;
2898 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
2899 if (!I->isDeclaration() && !I->isMaterializable())
2900 Broken |= !V.verify(*I);
2902 // Note that this function's return value is inverted from what you would
2903 // expect of a function called "verify".
2904 DebugInfoVerifier DIV(OS ? *OS : NullStr);
2905 return !V.verify(M) || !DIV.verify(M) || Broken;
2909 struct VerifierLegacyPass : public FunctionPass {
2915 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
2916 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2918 explicit VerifierLegacyPass(bool FatalErrors)
2919 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2920 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2923 bool runOnFunction(Function &F) override {
2924 if (!V.verify(F) && FatalErrors)
2925 report_fatal_error("Broken function found, compilation aborted!");
2930 bool doFinalization(Module &M) override {
2931 if (!V.verify(M) && FatalErrors)
2932 report_fatal_error("Broken module found, compilation aborted!");
2937 void getAnalysisUsage(AnalysisUsage &AU) const override {
2938 AU.setPreservesAll();
2941 struct DebugInfoVerifierLegacyPass : public ModulePass {
2944 DebugInfoVerifier V;
2947 DebugInfoVerifierLegacyPass() : ModulePass(ID), FatalErrors(true) {
2948 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2950 explicit DebugInfoVerifierLegacyPass(bool FatalErrors)
2951 : ModulePass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2952 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2955 bool runOnModule(Module &M) override {
2956 if (!V.verify(M) && FatalErrors)
2957 report_fatal_error("Broken debug info found, compilation aborted!");
2962 void getAnalysisUsage(AnalysisUsage &AU) const override {
2963 AU.setPreservesAll();
2968 char VerifierLegacyPass::ID = 0;
2969 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
2971 char DebugInfoVerifierLegacyPass::ID = 0;
2972 INITIALIZE_PASS(DebugInfoVerifierLegacyPass, "verify-di", "Debug Info Verifier",
2975 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
2976 return new VerifierLegacyPass(FatalErrors);
2979 ModulePass *llvm::createDebugInfoVerifierPass(bool FatalErrors) {
2980 return new DebugInfoVerifierLegacyPass(FatalErrors);
2983 PreservedAnalyses VerifierPass::run(Module &M) {
2984 if (verifyModule(M, &dbgs()) && FatalErrors)
2985 report_fatal_error("Broken module found, compilation aborted!");
2987 return PreservedAnalyses::all();
2990 PreservedAnalyses VerifierPass::run(Function &F) {
2991 if (verifyFunction(F, &dbgs()) && FatalErrors)
2992 report_fatal_error("Broken function found, compilation aborted!");
2994 return PreservedAnalyses::all();