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;
184 const DataLayout *DL;
187 /// \brief When verifying a basic block, keep track of all of the
188 /// instructions we have seen so far.
190 /// This allows us to do efficient dominance checks for the case when an
191 /// instruction has an operand that is an instruction in the same block.
192 SmallPtrSet<Instruction *, 16> InstsInThisBlock;
194 /// \brief Keep track of the metadata nodes that have been checked already.
195 SmallPtrSet<Metadata *, 32> MDNodes;
197 /// \brief The personality function referenced by the LandingPadInsts.
198 /// All LandingPadInsts within the same function must use the same
199 /// personality function.
200 const Value *PersonalityFn;
203 explicit Verifier(raw_ostream &OS = dbgs())
204 : VerifierSupport(OS), Context(nullptr), DL(nullptr),
205 PersonalityFn(nullptr) {}
207 bool verify(const Function &F) {
209 Context = &M->getContext();
211 // First ensure the function is well-enough formed to compute dominance
214 OS << "Function '" << F.getName()
215 << "' does not contain an entry block!\n";
218 for (Function::const_iterator I = F.begin(), E = F.end(); I != E; ++I) {
219 if (I->empty() || !I->back().isTerminator()) {
220 OS << "Basic Block in function '" << F.getName()
221 << "' does not have terminator!\n";
222 I->printAsOperand(OS, true);
228 // Now directly compute a dominance tree. We don't rely on the pass
229 // manager to provide this as it isolates us from a potentially
230 // out-of-date dominator tree and makes it significantly more complex to
231 // run this code outside of a pass manager.
232 // FIXME: It's really gross that we have to cast away constness here.
233 DT.recalculate(const_cast<Function &>(F));
236 // FIXME: We strip const here because the inst visitor strips const.
237 visit(const_cast<Function &>(F));
238 InstsInThisBlock.clear();
239 PersonalityFn = nullptr;
244 bool verify(const Module &M) {
246 Context = &M.getContext();
249 // Scan through, checking all of the external function's linkage now...
250 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I) {
251 visitGlobalValue(*I);
253 // Check to make sure function prototypes are okay.
254 if (I->isDeclaration())
258 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
260 visitGlobalVariable(*I);
262 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
264 visitGlobalAlias(*I);
266 for (Module::const_named_metadata_iterator I = M.named_metadata_begin(),
267 E = M.named_metadata_end();
269 visitNamedMDNode(*I);
271 for (const StringMapEntry<Comdat> &SMEC : M.getComdatSymbolTable())
272 visitComdat(SMEC.getValue());
275 visitModuleIdents(M);
281 // Verification methods...
282 void visitGlobalValue(const GlobalValue &GV);
283 void visitGlobalVariable(const GlobalVariable &GV);
284 void visitGlobalAlias(const GlobalAlias &GA);
285 void visitAliaseeSubExpr(const GlobalAlias &A, const Constant &C);
286 void visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias *> &Visited,
287 const GlobalAlias &A, const Constant &C);
288 void visitNamedMDNode(const NamedMDNode &NMD);
289 void visitMDNode(MDNode &MD);
290 void visitMetadataAsValue(MetadataAsValue &MD, Function *F);
291 void visitValueAsMetadata(ValueAsMetadata &MD, Function *F);
292 void visitComdat(const Comdat &C);
293 void visitModuleIdents(const Module &M);
294 void visitModuleFlags(const Module &M);
295 void visitModuleFlag(const MDNode *Op,
296 DenseMap<const MDString *, const MDNode *> &SeenIDs,
297 SmallVectorImpl<const MDNode *> &Requirements);
298 void visitFunction(const Function &F);
299 void visitBasicBlock(BasicBlock &BB);
300 void visitRangeMetadata(Instruction& I, MDNode* Range, Type* Ty);
303 // InstVisitor overrides...
304 using InstVisitor<Verifier>::visit;
305 void visit(Instruction &I);
307 void visitTruncInst(TruncInst &I);
308 void visitZExtInst(ZExtInst &I);
309 void visitSExtInst(SExtInst &I);
310 void visitFPTruncInst(FPTruncInst &I);
311 void visitFPExtInst(FPExtInst &I);
312 void visitFPToUIInst(FPToUIInst &I);
313 void visitFPToSIInst(FPToSIInst &I);
314 void visitUIToFPInst(UIToFPInst &I);
315 void visitSIToFPInst(SIToFPInst &I);
316 void visitIntToPtrInst(IntToPtrInst &I);
317 void visitPtrToIntInst(PtrToIntInst &I);
318 void visitBitCastInst(BitCastInst &I);
319 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
320 void visitPHINode(PHINode &PN);
321 void visitBinaryOperator(BinaryOperator &B);
322 void visitICmpInst(ICmpInst &IC);
323 void visitFCmpInst(FCmpInst &FC);
324 void visitExtractElementInst(ExtractElementInst &EI);
325 void visitInsertElementInst(InsertElementInst &EI);
326 void visitShuffleVectorInst(ShuffleVectorInst &EI);
327 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
328 void visitCallInst(CallInst &CI);
329 void visitInvokeInst(InvokeInst &II);
330 void visitGetElementPtrInst(GetElementPtrInst &GEP);
331 void visitLoadInst(LoadInst &LI);
332 void visitStoreInst(StoreInst &SI);
333 void verifyDominatesUse(Instruction &I, unsigned i);
334 void visitInstruction(Instruction &I);
335 void visitTerminatorInst(TerminatorInst &I);
336 void visitBranchInst(BranchInst &BI);
337 void visitReturnInst(ReturnInst &RI);
338 void visitSwitchInst(SwitchInst &SI);
339 void visitIndirectBrInst(IndirectBrInst &BI);
340 void visitSelectInst(SelectInst &SI);
341 void visitUserOp1(Instruction &I);
342 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
343 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
344 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
345 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
346 void visitFenceInst(FenceInst &FI);
347 void visitAllocaInst(AllocaInst &AI);
348 void visitExtractValueInst(ExtractValueInst &EVI);
349 void visitInsertValueInst(InsertValueInst &IVI);
350 void visitLandingPadInst(LandingPadInst &LPI);
352 void VerifyCallSite(CallSite CS);
353 void verifyMustTailCall(CallInst &CI);
354 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
355 unsigned ArgNo, std::string &Suffix);
356 bool VerifyIntrinsicType(Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
357 SmallVectorImpl<Type *> &ArgTys);
358 bool VerifyIntrinsicIsVarArg(bool isVarArg,
359 ArrayRef<Intrinsic::IITDescriptor> &Infos);
360 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
361 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
363 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
364 bool isReturnValue, const Value *V);
365 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
368 void VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy);
369 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
371 class DebugInfoVerifier : public VerifierSupport {
373 explicit DebugInfoVerifier(raw_ostream &OS = dbgs()) : VerifierSupport(OS) {}
375 bool verify(const Module &M) {
382 void verifyDebugInfo();
383 void processInstructions(DebugInfoFinder &Finder);
384 void processCallInst(DebugInfoFinder &Finder, const CallInst &CI);
386 } // End anonymous namespace
388 // Assert - We know that cond should be true, if not print an error message.
389 #define Assert(C, M) \
390 do { if (!(C)) { CheckFailed(M); return; } } while (0)
391 #define Assert1(C, M, V1) \
392 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
393 #define Assert2(C, M, V1, V2) \
394 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
395 #define Assert3(C, M, V1, V2, V3) \
396 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
397 #define Assert4(C, M, V1, V2, V3, V4) \
398 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
400 void Verifier::visit(Instruction &I) {
401 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
402 Assert1(I.getOperand(i) != nullptr, "Operand is null", &I);
403 InstVisitor<Verifier>::visit(I);
407 void Verifier::visitGlobalValue(const GlobalValue &GV) {
408 Assert1(!GV.isDeclaration() || GV.hasExternalLinkage() ||
409 GV.hasExternalWeakLinkage(),
410 "Global is external, but doesn't have external or weak linkage!",
413 Assert1(GV.getAlignment() <= Value::MaximumAlignment,
414 "huge alignment values are unsupported", &GV);
415 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
416 "Only global variables can have appending linkage!", &GV);
418 if (GV.hasAppendingLinkage()) {
419 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
420 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
421 "Only global arrays can have appending linkage!", GVar);
425 void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
426 if (GV.hasInitializer()) {
427 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
428 "Global variable initializer type does not match global "
429 "variable type!", &GV);
431 // If the global has common linkage, it must have a zero initializer and
432 // cannot be constant.
433 if (GV.hasCommonLinkage()) {
434 Assert1(GV.getInitializer()->isNullValue(),
435 "'common' global must have a zero initializer!", &GV);
436 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
438 Assert1(!GV.hasComdat(), "'common' global may not be in a Comdat!", &GV);
441 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
442 "invalid linkage type for global declaration", &GV);
445 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
446 GV.getName() == "llvm.global_dtors")) {
447 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
448 "invalid linkage for intrinsic global variable", &GV);
449 // Don't worry about emitting an error for it not being an array,
450 // visitGlobalValue will complain on appending non-array.
451 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType()->getElementType())) {
452 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
453 PointerType *FuncPtrTy =
454 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
455 // FIXME: Reject the 2-field form in LLVM 4.0.
456 Assert1(STy && (STy->getNumElements() == 2 ||
457 STy->getNumElements() == 3) &&
458 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
459 STy->getTypeAtIndex(1) == FuncPtrTy,
460 "wrong type for intrinsic global variable", &GV);
461 if (STy->getNumElements() == 3) {
462 Type *ETy = STy->getTypeAtIndex(2);
463 Assert1(ETy->isPointerTy() &&
464 cast<PointerType>(ETy)->getElementType()->isIntegerTy(8),
465 "wrong type for intrinsic global variable", &GV);
470 if (GV.hasName() && (GV.getName() == "llvm.used" ||
471 GV.getName() == "llvm.compiler.used")) {
472 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
473 "invalid linkage for intrinsic global variable", &GV);
474 Type *GVType = GV.getType()->getElementType();
475 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
476 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
477 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
478 if (GV.hasInitializer()) {
479 const Constant *Init = GV.getInitializer();
480 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
481 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
483 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
484 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
486 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
487 "invalid llvm.used member", V);
488 Assert1(V->hasName(), "members of llvm.used must be named", V);
494 Assert1(!GV.hasDLLImportStorageClass() ||
495 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
496 GV.hasAvailableExternallyLinkage(),
497 "Global is marked as dllimport, but not external", &GV);
499 if (!GV.hasInitializer()) {
500 visitGlobalValue(GV);
504 // Walk any aggregate initializers looking for bitcasts between address spaces
505 SmallPtrSet<const Value *, 4> Visited;
506 SmallVector<const Value *, 4> WorkStack;
507 WorkStack.push_back(cast<Value>(GV.getInitializer()));
509 while (!WorkStack.empty()) {
510 const Value *V = WorkStack.pop_back_val();
511 if (!Visited.insert(V).second)
514 if (const User *U = dyn_cast<User>(V)) {
515 for (unsigned I = 0, N = U->getNumOperands(); I != N; ++I)
516 WorkStack.push_back(U->getOperand(I));
519 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
520 VerifyConstantExprBitcastType(CE);
526 visitGlobalValue(GV);
529 void Verifier::visitAliaseeSubExpr(const GlobalAlias &GA, const Constant &C) {
530 SmallPtrSet<const GlobalAlias*, 4> Visited;
532 visitAliaseeSubExpr(Visited, GA, C);
535 void Verifier::visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias*> &Visited,
536 const GlobalAlias &GA, const Constant &C) {
537 if (const auto *GV = dyn_cast<GlobalValue>(&C)) {
538 Assert1(!GV->isDeclaration(), "Alias must point to a definition", &GA);
540 if (const auto *GA2 = dyn_cast<GlobalAlias>(GV)) {
541 Assert1(Visited.insert(GA2).second, "Aliases cannot form a cycle", &GA);
543 Assert1(!GA2->mayBeOverridden(), "Alias cannot point to a weak alias",
546 // Only continue verifying subexpressions of GlobalAliases.
547 // Do not recurse into global initializers.
552 if (const auto *CE = dyn_cast<ConstantExpr>(&C))
553 VerifyConstantExprBitcastType(CE);
555 for (const Use &U : C.operands()) {
557 if (const auto *GA2 = dyn_cast<GlobalAlias>(V))
558 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
559 else if (const auto *C2 = dyn_cast<Constant>(V))
560 visitAliaseeSubExpr(Visited, GA, *C2);
564 void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
565 Assert1(!GA.getName().empty(),
566 "Alias name cannot be empty!", &GA);
567 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
568 "Alias should have private, internal, linkonce, weak, linkonce_odr, "
569 "weak_odr, or external linkage!",
571 const Constant *Aliasee = GA.getAliasee();
572 Assert1(Aliasee, "Aliasee cannot be NULL!", &GA);
573 Assert1(GA.getType() == Aliasee->getType(),
574 "Alias and aliasee types should match!", &GA);
576 Assert1(isa<GlobalValue>(Aliasee) || isa<ConstantExpr>(Aliasee),
577 "Aliasee should be either GlobalValue or ConstantExpr", &GA);
579 visitAliaseeSubExpr(GA, *Aliasee);
581 visitGlobalValue(GA);
584 void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
585 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
586 MDNode *MD = NMD.getOperand(i);
594 void Verifier::visitMDNode(MDNode &MD) {
595 // Only visit each node once. Metadata can be mutually recursive, so this
596 // avoids infinite recursion here, as well as being an optimization.
597 if (!MDNodes.insert(&MD).second)
600 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
601 Metadata *Op = MD.getOperand(i);
604 Assert2(!isa<LocalAsMetadata>(Op), "Invalid operand for global metadata!",
606 if (auto *N = dyn_cast<MDNode>(Op)) {
610 if (auto *V = dyn_cast<ValueAsMetadata>(Op)) {
611 visitValueAsMetadata(*V, nullptr);
616 // Check these last, so we diagnose problems in operands first.
617 Assert1(!isa<MDNodeFwdDecl>(MD), "Expected no forward declarations!", &MD);
618 Assert1(MD.isResolved(), "All nodes should be resolved!", &MD);
621 void Verifier::visitValueAsMetadata(ValueAsMetadata &MD, Function *F) {
622 Assert1(MD.getValue(), "Expected valid value", &MD);
623 Assert2(!MD.getValue()->getType()->isMetadataTy(),
624 "Unexpected metadata round-trip through values", &MD, MD.getValue());
626 auto *L = dyn_cast<LocalAsMetadata>(&MD);
630 Assert1(F, "function-local metadata used outside a function", L);
632 // If this was an instruction, bb, or argument, verify that it is in the
633 // function that we expect.
634 Function *ActualF = nullptr;
635 if (Instruction *I = dyn_cast<Instruction>(L->getValue())) {
636 Assert2(I->getParent(), "function-local metadata not in basic block", L, I);
637 ActualF = I->getParent()->getParent();
638 } else if (BasicBlock *BB = dyn_cast<BasicBlock>(L->getValue()))
639 ActualF = BB->getParent();
640 else if (Argument *A = dyn_cast<Argument>(L->getValue()))
641 ActualF = A->getParent();
642 assert(ActualF && "Unimplemented function local metadata case!");
644 Assert1(ActualF == F, "function-local metadata used in wrong function", L);
647 void Verifier::visitMetadataAsValue(MetadataAsValue &MDV, Function *F) {
648 Metadata *MD = MDV.getMetadata();
649 if (auto *N = dyn_cast<MDNode>(MD)) {
654 // Only visit each node once. Metadata can be mutually recursive, so this
655 // avoids infinite recursion here, as well as being an optimization.
656 if (!MDNodes.insert(MD).second)
659 if (auto *V = dyn_cast<ValueAsMetadata>(MD))
660 visitValueAsMetadata(*V, F);
663 void Verifier::visitComdat(const Comdat &C) {
664 // All Comdat::SelectionKind values other than Comdat::Any require a
665 // GlobalValue with the same name as the Comdat.
666 const GlobalValue *GV = M->getNamedValue(C.getName());
667 if (C.getSelectionKind() != Comdat::Any)
669 "comdat selection kind requires a global value with the same name",
671 // The Module is invalid if the GlobalValue has private linkage. Entities
672 // with private linkage don't have entries in the symbol table.
674 Assert1(!GV->hasPrivateLinkage(), "comdat global value has private linkage",
678 void Verifier::visitModuleIdents(const Module &M) {
679 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
683 // llvm.ident takes a list of metadata entry. Each entry has only one string.
684 // Scan each llvm.ident entry and make sure that this requirement is met.
685 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
686 const MDNode *N = Idents->getOperand(i);
687 Assert1(N->getNumOperands() == 1,
688 "incorrect number of operands in llvm.ident metadata", N);
689 Assert1(isa<MDString>(N->getOperand(0)),
690 ("invalid value for llvm.ident metadata entry operand"
691 "(the operand should be a string)"),
696 void Verifier::visitModuleFlags(const Module &M) {
697 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
700 // Scan each flag, and track the flags and requirements.
701 DenseMap<const MDString*, const MDNode*> SeenIDs;
702 SmallVector<const MDNode*, 16> Requirements;
703 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
704 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
707 // Validate that the requirements in the module are valid.
708 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
709 const MDNode *Requirement = Requirements[I];
710 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
711 const Metadata *ReqValue = Requirement->getOperand(1);
713 const MDNode *Op = SeenIDs.lookup(Flag);
715 CheckFailed("invalid requirement on flag, flag is not present in module",
720 if (Op->getOperand(2) != ReqValue) {
721 CheckFailed(("invalid requirement on flag, "
722 "flag does not have the required value"),
730 Verifier::visitModuleFlag(const MDNode *Op,
731 DenseMap<const MDString *, const MDNode *> &SeenIDs,
732 SmallVectorImpl<const MDNode *> &Requirements) {
733 // Each module flag should have three arguments, the merge behavior (a
734 // constant int), the flag ID (an MDString), and the value.
735 Assert1(Op->getNumOperands() == 3,
736 "incorrect number of operands in module flag", Op);
737 Module::ModFlagBehavior MFB;
738 if (!Module::isValidModFlagBehavior(Op->getOperand(0), MFB)) {
740 mdconst::dyn_extract<ConstantInt>(Op->getOperand(0)),
741 "invalid behavior operand in module flag (expected constant integer)",
744 "invalid behavior operand in module flag (unexpected constant)",
747 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
749 "invalid ID operand in module flag (expected metadata string)",
752 // Sanity check the values for behaviors with additional requirements.
755 case Module::Warning:
756 case Module::Override:
757 // These behavior types accept any value.
760 case Module::Require: {
761 // The value should itself be an MDNode with two operands, a flag ID (an
762 // MDString), and a value.
763 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
764 Assert1(Value && Value->getNumOperands() == 2,
765 "invalid value for 'require' module flag (expected metadata pair)",
767 Assert1(isa<MDString>(Value->getOperand(0)),
768 ("invalid value for 'require' module flag "
769 "(first value operand should be a string)"),
770 Value->getOperand(0));
772 // Append it to the list of requirements, to check once all module flags are
774 Requirements.push_back(Value);
779 case Module::AppendUnique: {
780 // These behavior types require the operand be an MDNode.
781 Assert1(isa<MDNode>(Op->getOperand(2)),
782 "invalid value for 'append'-type module flag "
783 "(expected a metadata node)", Op->getOperand(2));
788 // Unless this is a "requires" flag, check the ID is unique.
789 if (MFB != Module::Require) {
790 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
792 "module flag identifiers must be unique (or of 'require' type)",
797 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
798 bool isFunction, const Value *V) {
800 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
801 if (Attrs.getSlotIndex(I) == Idx) {
806 assert(Slot != ~0U && "Attribute set inconsistency!");
808 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
810 if (I->isStringAttribute())
813 if (I->getKindAsEnum() == Attribute::NoReturn ||
814 I->getKindAsEnum() == Attribute::NoUnwind ||
815 I->getKindAsEnum() == Attribute::NoInline ||
816 I->getKindAsEnum() == Attribute::AlwaysInline ||
817 I->getKindAsEnum() == Attribute::OptimizeForSize ||
818 I->getKindAsEnum() == Attribute::StackProtect ||
819 I->getKindAsEnum() == Attribute::StackProtectReq ||
820 I->getKindAsEnum() == Attribute::StackProtectStrong ||
821 I->getKindAsEnum() == Attribute::NoRedZone ||
822 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
823 I->getKindAsEnum() == Attribute::Naked ||
824 I->getKindAsEnum() == Attribute::InlineHint ||
825 I->getKindAsEnum() == Attribute::StackAlignment ||
826 I->getKindAsEnum() == Attribute::UWTable ||
827 I->getKindAsEnum() == Attribute::NonLazyBind ||
828 I->getKindAsEnum() == Attribute::ReturnsTwice ||
829 I->getKindAsEnum() == Attribute::SanitizeAddress ||
830 I->getKindAsEnum() == Attribute::SanitizeThread ||
831 I->getKindAsEnum() == Attribute::SanitizeMemory ||
832 I->getKindAsEnum() == Attribute::MinSize ||
833 I->getKindAsEnum() == Attribute::NoDuplicate ||
834 I->getKindAsEnum() == Attribute::Builtin ||
835 I->getKindAsEnum() == Attribute::NoBuiltin ||
836 I->getKindAsEnum() == Attribute::Cold ||
837 I->getKindAsEnum() == Attribute::OptimizeNone ||
838 I->getKindAsEnum() == Attribute::JumpTable) {
840 CheckFailed("Attribute '" + I->getAsString() +
841 "' only applies to functions!", V);
844 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
845 I->getKindAsEnum() == Attribute::ReadNone) {
847 CheckFailed("Attribute '" + I->getAsString() +
848 "' does not apply to function returns");
851 } else if (isFunction) {
852 CheckFailed("Attribute '" + I->getAsString() +
853 "' does not apply to functions!", V);
859 // VerifyParameterAttrs - Check the given attributes for an argument or return
860 // value of the specified type. The value V is printed in error messages.
861 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
862 bool isReturnValue, const Value *V) {
863 if (!Attrs.hasAttributes(Idx))
866 VerifyAttributeTypes(Attrs, Idx, false, V);
869 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
870 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
871 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
872 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
873 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
874 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
875 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
876 "'returned' do not apply to return values!", V);
878 // Check for mutually incompatible attributes. Only inreg is compatible with
880 unsigned AttrCount = 0;
881 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
882 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
883 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
884 Attrs.hasAttribute(Idx, Attribute::InReg);
885 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
886 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
887 "and 'sret' are incompatible!", V);
889 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
890 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
891 "'inalloca and readonly' are incompatible!", V);
893 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
894 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
895 "'sret and returned' are incompatible!", V);
897 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
898 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
899 "'zeroext and signext' are incompatible!", V);
901 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
902 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
903 "'readnone and readonly' are incompatible!", V);
905 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
906 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
907 "'noinline and alwaysinline' are incompatible!", V);
909 Assert1(!AttrBuilder(Attrs, Idx).
910 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
911 "Wrong types for attribute: " +
912 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
914 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
915 if (!PTy->getElementType()->isSized()) {
916 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
917 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
918 "Attributes 'byval' and 'inalloca' do not support unsized types!",
922 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
923 "Attribute 'byval' only applies to parameters with pointer type!",
928 // VerifyFunctionAttrs - Check parameter attributes against a function type.
929 // The value V is printed in error messages.
930 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
935 bool SawNest = false;
936 bool SawReturned = false;
937 bool SawSRet = false;
939 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
940 unsigned Idx = Attrs.getSlotIndex(i);
944 Ty = FT->getReturnType();
945 else if (Idx-1 < FT->getNumParams())
946 Ty = FT->getParamType(Idx-1);
948 break; // VarArgs attributes, verified elsewhere.
950 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
955 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
956 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
960 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
961 Assert1(!SawReturned, "More than one parameter has attribute returned!",
963 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
964 "argument and return types for 'returned' attribute", V);
968 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
969 Assert1(!SawSRet, "Cannot have multiple 'sret' parameters!", V);
970 Assert1(Idx == 1 || Idx == 2,
971 "Attribute 'sret' is not on first or second parameter!", V);
975 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
976 Assert1(Idx == FT->getNumParams(),
977 "inalloca isn't on the last parameter!", V);
981 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
984 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
986 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
987 Attribute::ReadNone) &&
988 Attrs.hasAttribute(AttributeSet::FunctionIndex,
989 Attribute::ReadOnly)),
990 "Attributes 'readnone and readonly' are incompatible!", V);
992 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
993 Attribute::NoInline) &&
994 Attrs.hasAttribute(AttributeSet::FunctionIndex,
995 Attribute::AlwaysInline)),
996 "Attributes 'noinline and alwaysinline' are incompatible!", V);
998 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
999 Attribute::OptimizeNone)) {
1000 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1001 Attribute::NoInline),
1002 "Attribute 'optnone' requires 'noinline'!", V);
1004 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1005 Attribute::OptimizeForSize),
1006 "Attributes 'optsize and optnone' are incompatible!", V);
1008 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1009 Attribute::MinSize),
1010 "Attributes 'minsize and optnone' are incompatible!", V);
1013 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1014 Attribute::JumpTable)) {
1015 const GlobalValue *GV = cast<GlobalValue>(V);
1016 Assert1(GV->hasUnnamedAddr(),
1017 "Attribute 'jumptable' requires 'unnamed_addr'", V);
1022 void Verifier::VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy) {
1023 // Get the size of the types in bits, we'll need this later
1024 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1025 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
1027 // BitCast implies a no-op cast of type only. No bits change.
1028 // However, you can't cast pointers to anything but pointers.
1029 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
1030 "Bitcast requires both operands to be pointer or neither", V);
1031 Assert1(SrcBitSize == DestBitSize,
1032 "Bitcast requires types of same width", V);
1034 // Disallow aggregates.
1035 Assert1(!SrcTy->isAggregateType(),
1036 "Bitcast operand must not be aggregate", V);
1037 Assert1(!DestTy->isAggregateType(),
1038 "Bitcast type must not be aggregate", V);
1040 // Without datalayout, assume all address spaces are the same size.
1041 // Don't check if both types are not pointers.
1042 // Skip casts between scalars and vectors.
1044 !SrcTy->isPtrOrPtrVectorTy() ||
1045 !DestTy->isPtrOrPtrVectorTy() ||
1046 SrcTy->isVectorTy() != DestTy->isVectorTy()) {
1050 unsigned SrcAS = SrcTy->getPointerAddressSpace();
1051 unsigned DstAS = DestTy->getPointerAddressSpace();
1053 Assert1(SrcAS == DstAS,
1054 "Bitcasts between pointers of different address spaces is not legal."
1055 "Use AddrSpaceCast instead.", V);
1058 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
1059 if (CE->getOpcode() == Instruction::BitCast) {
1060 Type *SrcTy = CE->getOperand(0)->getType();
1061 Type *DstTy = CE->getType();
1062 VerifyBitcastType(CE, DstTy, SrcTy);
1066 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1067 if (Attrs.getNumSlots() == 0)
1070 unsigned LastSlot = Attrs.getNumSlots() - 1;
1071 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1072 if (LastIndex <= Params
1073 || (LastIndex == AttributeSet::FunctionIndex
1074 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1080 // visitFunction - Verify that a function is ok.
1082 void Verifier::visitFunction(const Function &F) {
1083 // Check function arguments.
1084 FunctionType *FT = F.getFunctionType();
1085 unsigned NumArgs = F.arg_size();
1087 Assert1(Context == &F.getContext(),
1088 "Function context does not match Module context!", &F);
1090 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1091 Assert2(FT->getNumParams() == NumArgs,
1092 "# formal arguments must match # of arguments for function type!",
1094 Assert1(F.getReturnType()->isFirstClassType() ||
1095 F.getReturnType()->isVoidTy() ||
1096 F.getReturnType()->isStructTy(),
1097 "Functions cannot return aggregate values!", &F);
1099 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1100 "Invalid struct return type!", &F);
1102 AttributeSet Attrs = F.getAttributes();
1104 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1105 "Attribute after last parameter!", &F);
1107 // Check function attributes.
1108 VerifyFunctionAttrs(FT, Attrs, &F);
1110 // On function declarations/definitions, we do not support the builtin
1111 // attribute. We do not check this in VerifyFunctionAttrs since that is
1112 // checking for Attributes that can/can not ever be on functions.
1113 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1114 Attribute::Builtin),
1115 "Attribute 'builtin' can only be applied to a callsite.", &F);
1117 // Check that this function meets the restrictions on this calling convention.
1118 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
1119 // restrictions can be lifted.
1120 switch (F.getCallingConv()) {
1122 case CallingConv::C:
1124 case CallingConv::Fast:
1125 case CallingConv::Cold:
1126 case CallingConv::Intel_OCL_BI:
1127 case CallingConv::PTX_Kernel:
1128 case CallingConv::PTX_Device:
1129 Assert1(!F.isVarArg(), "Calling convention does not support varargs or "
1130 "perfect forwarding!", &F);
1134 bool isLLVMdotName = F.getName().size() >= 5 &&
1135 F.getName().substr(0, 5) == "llvm.";
1137 // Check that the argument values match the function type for this function...
1139 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1141 Assert2(I->getType() == FT->getParamType(i),
1142 "Argument value does not match function argument type!",
1143 I, FT->getParamType(i));
1144 Assert1(I->getType()->isFirstClassType(),
1145 "Function arguments must have first-class types!", I);
1147 Assert2(!I->getType()->isMetadataTy(),
1148 "Function takes metadata but isn't an intrinsic", I, &F);
1151 if (F.isMaterializable()) {
1152 // Function has a body somewhere we can't see.
1153 } else if (F.isDeclaration()) {
1154 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1155 "invalid linkage type for function declaration", &F);
1157 // Verify that this function (which has a body) is not named "llvm.*". It
1158 // is not legal to define intrinsics.
1159 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1161 // Check the entry node
1162 const BasicBlock *Entry = &F.getEntryBlock();
1163 Assert1(pred_begin(Entry) == pred_end(Entry),
1164 "Entry block to function must not have predecessors!", Entry);
1166 // The address of the entry block cannot be taken, unless it is dead.
1167 if (Entry->hasAddressTaken()) {
1168 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1169 "blockaddress may not be used with the entry block!", Entry);
1173 // If this function is actually an intrinsic, verify that it is only used in
1174 // direct call/invokes, never having its "address taken".
1175 if (F.getIntrinsicID()) {
1177 if (F.hasAddressTaken(&U))
1178 Assert1(0, "Invalid user of intrinsic instruction!", U);
1181 Assert1(!F.hasDLLImportStorageClass() ||
1182 (F.isDeclaration() && F.hasExternalLinkage()) ||
1183 F.hasAvailableExternallyLinkage(),
1184 "Function is marked as dllimport, but not external.", &F);
1187 // verifyBasicBlock - Verify that a basic block is well formed...
1189 void Verifier::visitBasicBlock(BasicBlock &BB) {
1190 InstsInThisBlock.clear();
1192 // Ensure that basic blocks have terminators!
1193 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1195 // Check constraints that this basic block imposes on all of the PHI nodes in
1197 if (isa<PHINode>(BB.front())) {
1198 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1199 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1200 std::sort(Preds.begin(), Preds.end());
1202 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1203 // Ensure that PHI nodes have at least one entry!
1204 Assert1(PN->getNumIncomingValues() != 0,
1205 "PHI nodes must have at least one entry. If the block is dead, "
1206 "the PHI should be removed!", PN);
1207 Assert1(PN->getNumIncomingValues() == Preds.size(),
1208 "PHINode should have one entry for each predecessor of its "
1209 "parent basic block!", PN);
1211 // Get and sort all incoming values in the PHI node...
1213 Values.reserve(PN->getNumIncomingValues());
1214 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1215 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1216 PN->getIncomingValue(i)));
1217 std::sort(Values.begin(), Values.end());
1219 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1220 // Check to make sure that if there is more than one entry for a
1221 // particular basic block in this PHI node, that the incoming values are
1224 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1225 Values[i].second == Values[i-1].second,
1226 "PHI node has multiple entries for the same basic block with "
1227 "different incoming values!", PN, Values[i].first,
1228 Values[i].second, Values[i-1].second);
1230 // Check to make sure that the predecessors and PHI node entries are
1232 Assert3(Values[i].first == Preds[i],
1233 "PHI node entries do not match predecessors!", PN,
1234 Values[i].first, Preds[i]);
1239 // Check that all instructions have their parent pointers set up correctly.
1242 Assert(I.getParent() == &BB, "Instruction has bogus parent pointer!");
1246 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1247 // Ensure that terminators only exist at the end of the basic block.
1248 Assert1(&I == I.getParent()->getTerminator(),
1249 "Terminator found in the middle of a basic block!", I.getParent());
1250 visitInstruction(I);
1253 void Verifier::visitBranchInst(BranchInst &BI) {
1254 if (BI.isConditional()) {
1255 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1256 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1258 visitTerminatorInst(BI);
1261 void Verifier::visitReturnInst(ReturnInst &RI) {
1262 Function *F = RI.getParent()->getParent();
1263 unsigned N = RI.getNumOperands();
1264 if (F->getReturnType()->isVoidTy())
1266 "Found return instr that returns non-void in Function of void "
1267 "return type!", &RI, F->getReturnType());
1269 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1270 "Function return type does not match operand "
1271 "type of return inst!", &RI, F->getReturnType());
1273 // Check to make sure that the return value has necessary properties for
1275 visitTerminatorInst(RI);
1278 void Verifier::visitSwitchInst(SwitchInst &SI) {
1279 // Check to make sure that all of the constants in the switch instruction
1280 // have the same type as the switched-on value.
1281 Type *SwitchTy = SI.getCondition()->getType();
1282 SmallPtrSet<ConstantInt*, 32> Constants;
1283 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1284 Assert1(i.getCaseValue()->getType() == SwitchTy,
1285 "Switch constants must all be same type as switch value!", &SI);
1286 Assert2(Constants.insert(i.getCaseValue()).second,
1287 "Duplicate integer as switch case", &SI, i.getCaseValue());
1290 visitTerminatorInst(SI);
1293 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1294 Assert1(BI.getAddress()->getType()->isPointerTy(),
1295 "Indirectbr operand must have pointer type!", &BI);
1296 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1297 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1298 "Indirectbr destinations must all have pointer type!", &BI);
1300 visitTerminatorInst(BI);
1303 void Verifier::visitSelectInst(SelectInst &SI) {
1304 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1306 "Invalid operands for select instruction!", &SI);
1308 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1309 "Select values must have same type as select instruction!", &SI);
1310 visitInstruction(SI);
1313 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1314 /// a pass, if any exist, it's an error.
1316 void Verifier::visitUserOp1(Instruction &I) {
1317 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1320 void Verifier::visitTruncInst(TruncInst &I) {
1321 // Get the source and destination types
1322 Type *SrcTy = I.getOperand(0)->getType();
1323 Type *DestTy = I.getType();
1325 // Get the size of the types in bits, we'll need this later
1326 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1327 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1329 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1330 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1331 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1332 "trunc source and destination must both be a vector or neither", &I);
1333 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1335 visitInstruction(I);
1338 void Verifier::visitZExtInst(ZExtInst &I) {
1339 // Get the source and destination types
1340 Type *SrcTy = I.getOperand(0)->getType();
1341 Type *DestTy = I.getType();
1343 // Get the size of the types in bits, we'll need this later
1344 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1345 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1346 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1347 "zext source and destination must both be a vector or neither", &I);
1348 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1349 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1351 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1353 visitInstruction(I);
1356 void Verifier::visitSExtInst(SExtInst &I) {
1357 // Get the source and destination types
1358 Type *SrcTy = I.getOperand(0)->getType();
1359 Type *DestTy = I.getType();
1361 // Get the size of the types in bits, we'll need this later
1362 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1363 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1365 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1366 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1367 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1368 "sext source and destination must both be a vector or neither", &I);
1369 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1371 visitInstruction(I);
1374 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1375 // Get the source and destination types
1376 Type *SrcTy = I.getOperand(0)->getType();
1377 Type *DestTy = I.getType();
1378 // Get the size of the types in bits, we'll need this later
1379 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1380 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1382 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1383 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1384 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1385 "fptrunc source and destination must both be a vector or neither",&I);
1386 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1388 visitInstruction(I);
1391 void Verifier::visitFPExtInst(FPExtInst &I) {
1392 // Get the source and destination types
1393 Type *SrcTy = I.getOperand(0)->getType();
1394 Type *DestTy = I.getType();
1396 // Get the size of the types in bits, we'll need this later
1397 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1398 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1400 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1401 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1402 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1403 "fpext source and destination must both be a vector or neither", &I);
1404 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1406 visitInstruction(I);
1409 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1410 // Get the source and destination types
1411 Type *SrcTy = I.getOperand(0)->getType();
1412 Type *DestTy = I.getType();
1414 bool SrcVec = SrcTy->isVectorTy();
1415 bool DstVec = DestTy->isVectorTy();
1417 Assert1(SrcVec == DstVec,
1418 "UIToFP source and dest must both be vector or scalar", &I);
1419 Assert1(SrcTy->isIntOrIntVectorTy(),
1420 "UIToFP source must be integer or integer vector", &I);
1421 Assert1(DestTy->isFPOrFPVectorTy(),
1422 "UIToFP result must be FP or FP vector", &I);
1424 if (SrcVec && DstVec)
1425 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1426 cast<VectorType>(DestTy)->getNumElements(),
1427 "UIToFP source and dest vector length mismatch", &I);
1429 visitInstruction(I);
1432 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1433 // Get the source and destination types
1434 Type *SrcTy = I.getOperand(0)->getType();
1435 Type *DestTy = I.getType();
1437 bool SrcVec = SrcTy->isVectorTy();
1438 bool DstVec = DestTy->isVectorTy();
1440 Assert1(SrcVec == DstVec,
1441 "SIToFP source and dest must both be vector or scalar", &I);
1442 Assert1(SrcTy->isIntOrIntVectorTy(),
1443 "SIToFP source must be integer or integer vector", &I);
1444 Assert1(DestTy->isFPOrFPVectorTy(),
1445 "SIToFP result must be FP or FP vector", &I);
1447 if (SrcVec && DstVec)
1448 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1449 cast<VectorType>(DestTy)->getNumElements(),
1450 "SIToFP source and dest vector length mismatch", &I);
1452 visitInstruction(I);
1455 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1456 // Get the source and destination types
1457 Type *SrcTy = I.getOperand(0)->getType();
1458 Type *DestTy = I.getType();
1460 bool SrcVec = SrcTy->isVectorTy();
1461 bool DstVec = DestTy->isVectorTy();
1463 Assert1(SrcVec == DstVec,
1464 "FPToUI source and dest must both be vector or scalar", &I);
1465 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1467 Assert1(DestTy->isIntOrIntVectorTy(),
1468 "FPToUI result must be integer or integer vector", &I);
1470 if (SrcVec && DstVec)
1471 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1472 cast<VectorType>(DestTy)->getNumElements(),
1473 "FPToUI source and dest vector length mismatch", &I);
1475 visitInstruction(I);
1478 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1479 // Get the source and destination types
1480 Type *SrcTy = I.getOperand(0)->getType();
1481 Type *DestTy = I.getType();
1483 bool SrcVec = SrcTy->isVectorTy();
1484 bool DstVec = DestTy->isVectorTy();
1486 Assert1(SrcVec == DstVec,
1487 "FPToSI source and dest must both be vector or scalar", &I);
1488 Assert1(SrcTy->isFPOrFPVectorTy(),
1489 "FPToSI source must be FP or FP vector", &I);
1490 Assert1(DestTy->isIntOrIntVectorTy(),
1491 "FPToSI result must be integer or integer vector", &I);
1493 if (SrcVec && DstVec)
1494 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1495 cast<VectorType>(DestTy)->getNumElements(),
1496 "FPToSI source and dest vector length mismatch", &I);
1498 visitInstruction(I);
1501 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1502 // Get the source and destination types
1503 Type *SrcTy = I.getOperand(0)->getType();
1504 Type *DestTy = I.getType();
1506 Assert1(SrcTy->getScalarType()->isPointerTy(),
1507 "PtrToInt source must be pointer", &I);
1508 Assert1(DestTy->getScalarType()->isIntegerTy(),
1509 "PtrToInt result must be integral", &I);
1510 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1511 "PtrToInt type mismatch", &I);
1513 if (SrcTy->isVectorTy()) {
1514 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1515 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1516 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1517 "PtrToInt Vector width mismatch", &I);
1520 visitInstruction(I);
1523 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1524 // Get the source and destination types
1525 Type *SrcTy = I.getOperand(0)->getType();
1526 Type *DestTy = I.getType();
1528 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1529 "IntToPtr source must be an integral", &I);
1530 Assert1(DestTy->getScalarType()->isPointerTy(),
1531 "IntToPtr result must be a pointer",&I);
1532 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1533 "IntToPtr type mismatch", &I);
1534 if (SrcTy->isVectorTy()) {
1535 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1536 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1537 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1538 "IntToPtr Vector width mismatch", &I);
1540 visitInstruction(I);
1543 void Verifier::visitBitCastInst(BitCastInst &I) {
1544 Type *SrcTy = I.getOperand(0)->getType();
1545 Type *DestTy = I.getType();
1546 VerifyBitcastType(&I, DestTy, SrcTy);
1547 visitInstruction(I);
1550 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1551 Type *SrcTy = I.getOperand(0)->getType();
1552 Type *DestTy = I.getType();
1554 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1555 "AddrSpaceCast source must be a pointer", &I);
1556 Assert1(DestTy->isPtrOrPtrVectorTy(),
1557 "AddrSpaceCast result must be a pointer", &I);
1558 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1559 "AddrSpaceCast must be between different address spaces", &I);
1560 if (SrcTy->isVectorTy())
1561 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1562 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1563 visitInstruction(I);
1566 /// visitPHINode - Ensure that a PHI node is well formed.
1568 void Verifier::visitPHINode(PHINode &PN) {
1569 // Ensure that the PHI nodes are all grouped together at the top of the block.
1570 // This can be tested by checking whether the instruction before this is
1571 // either nonexistent (because this is begin()) or is a PHI node. If not,
1572 // then there is some other instruction before a PHI.
1573 Assert2(&PN == &PN.getParent()->front() ||
1574 isa<PHINode>(--BasicBlock::iterator(&PN)),
1575 "PHI nodes not grouped at top of basic block!",
1576 &PN, PN.getParent());
1578 // Check that all of the values of the PHI node have the same type as the
1579 // result, and that the incoming blocks are really basic blocks.
1580 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1581 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1582 "PHI node operands are not the same type as the result!", &PN);
1585 // All other PHI node constraints are checked in the visitBasicBlock method.
1587 visitInstruction(PN);
1590 void Verifier::VerifyCallSite(CallSite CS) {
1591 Instruction *I = CS.getInstruction();
1593 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1594 "Called function must be a pointer!", I);
1595 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1597 Assert1(FPTy->getElementType()->isFunctionTy(),
1598 "Called function is not pointer to function type!", I);
1599 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1601 // Verify that the correct number of arguments are being passed
1602 if (FTy->isVarArg())
1603 Assert1(CS.arg_size() >= FTy->getNumParams(),
1604 "Called function requires more parameters than were provided!",I);
1606 Assert1(CS.arg_size() == FTy->getNumParams(),
1607 "Incorrect number of arguments passed to called function!", I);
1609 // Verify that all arguments to the call match the function type.
1610 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1611 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1612 "Call parameter type does not match function signature!",
1613 CS.getArgument(i), FTy->getParamType(i), I);
1615 AttributeSet Attrs = CS.getAttributes();
1617 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1618 "Attribute after last parameter!", I);
1620 // Verify call attributes.
1621 VerifyFunctionAttrs(FTy, Attrs, I);
1623 // Conservatively check the inalloca argument.
1624 // We have a bug if we can find that there is an underlying alloca without
1626 if (CS.hasInAllocaArgument()) {
1627 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
1628 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
1629 Assert2(AI->isUsedWithInAlloca(),
1630 "inalloca argument for call has mismatched alloca", AI, I);
1633 if (FTy->isVarArg()) {
1634 // FIXME? is 'nest' even legal here?
1635 bool SawNest = false;
1636 bool SawReturned = false;
1638 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1639 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1641 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1645 // Check attributes on the varargs part.
1646 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1647 Type *Ty = CS.getArgument(Idx-1)->getType();
1648 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1650 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1651 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1655 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1656 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1658 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1659 "Incompatible argument and return types for 'returned' "
1664 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1665 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1667 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1668 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1673 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1674 if (CS.getCalledFunction() == nullptr ||
1675 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1676 for (FunctionType::param_iterator PI = FTy->param_begin(),
1677 PE = FTy->param_end(); PI != PE; ++PI)
1678 Assert1(!(*PI)->isMetadataTy(),
1679 "Function has metadata parameter but isn't an intrinsic", I);
1682 visitInstruction(*I);
1685 /// Two types are "congruent" if they are identical, or if they are both pointer
1686 /// types with different pointee types and the same address space.
1687 static bool isTypeCongruent(Type *L, Type *R) {
1690 PointerType *PL = dyn_cast<PointerType>(L);
1691 PointerType *PR = dyn_cast<PointerType>(R);
1694 return PL->getAddressSpace() == PR->getAddressSpace();
1697 static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
1698 static const Attribute::AttrKind ABIAttrs[] = {
1699 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
1700 Attribute::InReg, Attribute::Returned};
1702 for (auto AK : ABIAttrs) {
1703 if (Attrs.hasAttribute(I + 1, AK))
1704 Copy.addAttribute(AK);
1706 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
1707 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
1711 void Verifier::verifyMustTailCall(CallInst &CI) {
1712 Assert1(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI);
1714 // - The caller and callee prototypes must match. Pointer types of
1715 // parameters or return types may differ in pointee type, but not
1717 Function *F = CI.getParent()->getParent();
1718 auto GetFnTy = [](Value *V) {
1719 return cast<FunctionType>(
1720 cast<PointerType>(V->getType())->getElementType());
1722 FunctionType *CallerTy = GetFnTy(F);
1723 FunctionType *CalleeTy = GetFnTy(CI.getCalledValue());
1724 Assert1(CallerTy->getNumParams() == CalleeTy->getNumParams(),
1725 "cannot guarantee tail call due to mismatched parameter counts", &CI);
1726 Assert1(CallerTy->isVarArg() == CalleeTy->isVarArg(),
1727 "cannot guarantee tail call due to mismatched varargs", &CI);
1728 Assert1(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),
1729 "cannot guarantee tail call due to mismatched return types", &CI);
1730 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1732 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),
1733 "cannot guarantee tail call due to mismatched parameter types", &CI);
1736 // - The calling conventions of the caller and callee must match.
1737 Assert1(F->getCallingConv() == CI.getCallingConv(),
1738 "cannot guarantee tail call due to mismatched calling conv", &CI);
1740 // - All ABI-impacting function attributes, such as sret, byval, inreg,
1741 // returned, and inalloca, must match.
1742 AttributeSet CallerAttrs = F->getAttributes();
1743 AttributeSet CalleeAttrs = CI.getAttributes();
1744 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1745 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
1746 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
1747 Assert2(CallerABIAttrs == CalleeABIAttrs,
1748 "cannot guarantee tail call due to mismatched ABI impacting "
1749 "function attributes", &CI, CI.getOperand(I));
1752 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
1753 // or a pointer bitcast followed by a ret instruction.
1754 // - The ret instruction must return the (possibly bitcasted) value
1755 // produced by the call or void.
1756 Value *RetVal = &CI;
1757 Instruction *Next = CI.getNextNode();
1759 // Handle the optional bitcast.
1760 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
1761 Assert1(BI->getOperand(0) == RetVal,
1762 "bitcast following musttail call must use the call", BI);
1764 Next = BI->getNextNode();
1767 // Check the return.
1768 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
1769 Assert1(Ret, "musttail call must be precede a ret with an optional bitcast",
1771 Assert1(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,
1772 "musttail call result must be returned", Ret);
1775 void Verifier::visitCallInst(CallInst &CI) {
1776 VerifyCallSite(&CI);
1778 if (CI.isMustTailCall())
1779 verifyMustTailCall(CI);
1781 if (Function *F = CI.getCalledFunction())
1782 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1783 visitIntrinsicFunctionCall(ID, CI);
1786 void Verifier::visitInvokeInst(InvokeInst &II) {
1787 VerifyCallSite(&II);
1789 // Verify that there is a landingpad instruction as the first non-PHI
1790 // instruction of the 'unwind' destination.
1791 Assert1(II.getUnwindDest()->isLandingPad(),
1792 "The unwind destination does not have a landingpad instruction!",&II);
1794 visitTerminatorInst(II);
1797 /// visitBinaryOperator - Check that both arguments to the binary operator are
1798 /// of the same type!
1800 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1801 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1802 "Both operands to a binary operator are not of the same type!", &B);
1804 switch (B.getOpcode()) {
1805 // Check that integer arithmetic operators are only used with
1806 // integral operands.
1807 case Instruction::Add:
1808 case Instruction::Sub:
1809 case Instruction::Mul:
1810 case Instruction::SDiv:
1811 case Instruction::UDiv:
1812 case Instruction::SRem:
1813 case Instruction::URem:
1814 Assert1(B.getType()->isIntOrIntVectorTy(),
1815 "Integer arithmetic operators only work with integral types!", &B);
1816 Assert1(B.getType() == B.getOperand(0)->getType(),
1817 "Integer arithmetic operators must have same type "
1818 "for operands and result!", &B);
1820 // Check that floating-point arithmetic operators are only used with
1821 // floating-point operands.
1822 case Instruction::FAdd:
1823 case Instruction::FSub:
1824 case Instruction::FMul:
1825 case Instruction::FDiv:
1826 case Instruction::FRem:
1827 Assert1(B.getType()->isFPOrFPVectorTy(),
1828 "Floating-point arithmetic operators only work with "
1829 "floating-point types!", &B);
1830 Assert1(B.getType() == B.getOperand(0)->getType(),
1831 "Floating-point arithmetic operators must have same type "
1832 "for operands and result!", &B);
1834 // Check that logical operators are only used with integral operands.
1835 case Instruction::And:
1836 case Instruction::Or:
1837 case Instruction::Xor:
1838 Assert1(B.getType()->isIntOrIntVectorTy(),
1839 "Logical operators only work with integral types!", &B);
1840 Assert1(B.getType() == B.getOperand(0)->getType(),
1841 "Logical operators must have same type for operands and result!",
1844 case Instruction::Shl:
1845 case Instruction::LShr:
1846 case Instruction::AShr:
1847 Assert1(B.getType()->isIntOrIntVectorTy(),
1848 "Shifts only work with integral types!", &B);
1849 Assert1(B.getType() == B.getOperand(0)->getType(),
1850 "Shift return type must be same as operands!", &B);
1853 llvm_unreachable("Unknown BinaryOperator opcode!");
1856 visitInstruction(B);
1859 void Verifier::visitICmpInst(ICmpInst &IC) {
1860 // Check that the operands are the same type
1861 Type *Op0Ty = IC.getOperand(0)->getType();
1862 Type *Op1Ty = IC.getOperand(1)->getType();
1863 Assert1(Op0Ty == Op1Ty,
1864 "Both operands to ICmp instruction are not of the same type!", &IC);
1865 // Check that the operands are the right type
1866 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1867 "Invalid operand types for ICmp instruction", &IC);
1868 // Check that the predicate is valid.
1869 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1870 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1871 "Invalid predicate in ICmp instruction!", &IC);
1873 visitInstruction(IC);
1876 void Verifier::visitFCmpInst(FCmpInst &FC) {
1877 // Check that the operands are the same type
1878 Type *Op0Ty = FC.getOperand(0)->getType();
1879 Type *Op1Ty = FC.getOperand(1)->getType();
1880 Assert1(Op0Ty == Op1Ty,
1881 "Both operands to FCmp instruction are not of the same type!", &FC);
1882 // Check that the operands are the right type
1883 Assert1(Op0Ty->isFPOrFPVectorTy(),
1884 "Invalid operand types for FCmp instruction", &FC);
1885 // Check that the predicate is valid.
1886 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1887 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1888 "Invalid predicate in FCmp instruction!", &FC);
1890 visitInstruction(FC);
1893 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1894 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1896 "Invalid extractelement operands!", &EI);
1897 visitInstruction(EI);
1900 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1901 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1904 "Invalid insertelement operands!", &IE);
1905 visitInstruction(IE);
1908 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1909 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1911 "Invalid shufflevector operands!", &SV);
1912 visitInstruction(SV);
1915 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1916 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1918 Assert1(isa<PointerType>(TargetTy),
1919 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1920 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1921 "GEP into unsized type!", &GEP);
1922 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1923 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1926 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1928 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1929 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1931 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1932 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1933 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1935 if (GEP.getPointerOperandType()->isVectorTy()) {
1936 // Additional checks for vector GEPs.
1937 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1938 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1939 "Vector GEP result width doesn't match operand's", &GEP);
1940 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1941 Type *IndexTy = Idxs[i]->getType();
1942 Assert1(IndexTy->isVectorTy(),
1943 "Vector GEP must have vector indices!", &GEP);
1944 unsigned IndexWidth = IndexTy->getVectorNumElements();
1945 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1948 visitInstruction(GEP);
1951 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1952 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1955 void Verifier::visitRangeMetadata(Instruction& I,
1956 MDNode* Range, Type* Ty) {
1958 Range == I.getMetadata(LLVMContext::MD_range) &&
1959 "precondition violation");
1961 unsigned NumOperands = Range->getNumOperands();
1962 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1963 unsigned NumRanges = NumOperands / 2;
1964 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1966 ConstantRange LastRange(1); // Dummy initial value
1967 for (unsigned i = 0; i < NumRanges; ++i) {
1969 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i));
1970 Assert1(Low, "The lower limit must be an integer!", Low);
1972 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i + 1));
1973 Assert1(High, "The upper limit must be an integer!", High);
1974 Assert1(High->getType() == Low->getType() &&
1975 High->getType() == Ty, "Range types must match instruction type!",
1978 APInt HighV = High->getValue();
1979 APInt LowV = Low->getValue();
1980 ConstantRange CurRange(LowV, HighV);
1981 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1982 "Range must not be empty!", Range);
1984 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1985 "Intervals are overlapping", Range);
1986 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1988 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1991 LastRange = ConstantRange(LowV, HighV);
1993 if (NumRanges > 2) {
1995 mdconst::dyn_extract<ConstantInt>(Range->getOperand(0))->getValue();
1997 mdconst::dyn_extract<ConstantInt>(Range->getOperand(1))->getValue();
1998 ConstantRange FirstRange(FirstLow, FirstHigh);
1999 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
2000 "Intervals are overlapping", Range);
2001 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
2006 void Verifier::visitLoadInst(LoadInst &LI) {
2007 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
2008 Assert1(PTy, "Load operand must be a pointer.", &LI);
2009 Type *ElTy = PTy->getElementType();
2010 Assert2(ElTy == LI.getType(),
2011 "Load result type does not match pointer operand type!", &LI, ElTy);
2012 Assert1(LI.getAlignment() <= Value::MaximumAlignment,
2013 "huge alignment values are unsupported", &LI);
2014 if (LI.isAtomic()) {
2015 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
2016 "Load cannot have Release ordering", &LI);
2017 Assert1(LI.getAlignment() != 0,
2018 "Atomic load must specify explicit alignment", &LI);
2019 if (!ElTy->isPointerTy()) {
2020 Assert2(ElTy->isIntegerTy(),
2021 "atomic load operand must have integer type!",
2023 unsigned Size = ElTy->getPrimitiveSizeInBits();
2024 Assert2(Size >= 8 && !(Size & (Size - 1)),
2025 "atomic load operand must be power-of-two byte-sized integer",
2029 Assert1(LI.getSynchScope() == CrossThread,
2030 "Non-atomic load cannot have SynchronizationScope specified", &LI);
2033 visitInstruction(LI);
2036 void Verifier::visitStoreInst(StoreInst &SI) {
2037 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
2038 Assert1(PTy, "Store operand must be a pointer.", &SI);
2039 Type *ElTy = PTy->getElementType();
2040 Assert2(ElTy == SI.getOperand(0)->getType(),
2041 "Stored value type does not match pointer operand type!",
2043 Assert1(SI.getAlignment() <= Value::MaximumAlignment,
2044 "huge alignment values are unsupported", &SI);
2045 if (SI.isAtomic()) {
2046 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
2047 "Store cannot have Acquire ordering", &SI);
2048 Assert1(SI.getAlignment() != 0,
2049 "Atomic store must specify explicit alignment", &SI);
2050 if (!ElTy->isPointerTy()) {
2051 Assert2(ElTy->isIntegerTy(),
2052 "atomic store operand must have integer type!",
2054 unsigned Size = ElTy->getPrimitiveSizeInBits();
2055 Assert2(Size >= 8 && !(Size & (Size - 1)),
2056 "atomic store operand must be power-of-two byte-sized integer",
2060 Assert1(SI.getSynchScope() == CrossThread,
2061 "Non-atomic store cannot have SynchronizationScope specified", &SI);
2063 visitInstruction(SI);
2066 void Verifier::visitAllocaInst(AllocaInst &AI) {
2067 SmallPtrSet<const Type*, 4> Visited;
2068 PointerType *PTy = AI.getType();
2069 Assert1(PTy->getAddressSpace() == 0,
2070 "Allocation instruction pointer not in the generic address space!",
2072 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
2074 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
2075 "Alloca array size must have integer type", &AI);
2076 Assert1(AI.getAlignment() <= Value::MaximumAlignment,
2077 "huge alignment values are unsupported", &AI);
2079 visitInstruction(AI);
2082 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
2084 // FIXME: more conditions???
2085 Assert1(CXI.getSuccessOrdering() != NotAtomic,
2086 "cmpxchg instructions must be atomic.", &CXI);
2087 Assert1(CXI.getFailureOrdering() != NotAtomic,
2088 "cmpxchg instructions must be atomic.", &CXI);
2089 Assert1(CXI.getSuccessOrdering() != Unordered,
2090 "cmpxchg instructions cannot be unordered.", &CXI);
2091 Assert1(CXI.getFailureOrdering() != Unordered,
2092 "cmpxchg instructions cannot be unordered.", &CXI);
2093 Assert1(CXI.getSuccessOrdering() >= CXI.getFailureOrdering(),
2094 "cmpxchg instructions be at least as constrained on success as fail",
2096 Assert1(CXI.getFailureOrdering() != Release &&
2097 CXI.getFailureOrdering() != AcquireRelease,
2098 "cmpxchg failure ordering cannot include release semantics", &CXI);
2100 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
2101 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
2102 Type *ElTy = PTy->getElementType();
2103 Assert2(ElTy->isIntegerTy(),
2104 "cmpxchg operand must have integer type!",
2106 unsigned Size = ElTy->getPrimitiveSizeInBits();
2107 Assert2(Size >= 8 && !(Size & (Size - 1)),
2108 "cmpxchg operand must be power-of-two byte-sized integer",
2110 Assert2(ElTy == CXI.getOperand(1)->getType(),
2111 "Expected value type does not match pointer operand type!",
2113 Assert2(ElTy == CXI.getOperand(2)->getType(),
2114 "Stored value type does not match pointer operand type!",
2116 visitInstruction(CXI);
2119 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
2120 Assert1(RMWI.getOrdering() != NotAtomic,
2121 "atomicrmw instructions must be atomic.", &RMWI);
2122 Assert1(RMWI.getOrdering() != Unordered,
2123 "atomicrmw instructions cannot be unordered.", &RMWI);
2124 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
2125 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
2126 Type *ElTy = PTy->getElementType();
2127 Assert2(ElTy->isIntegerTy(),
2128 "atomicrmw operand must have integer type!",
2130 unsigned Size = ElTy->getPrimitiveSizeInBits();
2131 Assert2(Size >= 8 && !(Size & (Size - 1)),
2132 "atomicrmw operand must be power-of-two byte-sized integer",
2134 Assert2(ElTy == RMWI.getOperand(1)->getType(),
2135 "Argument value type does not match pointer operand type!",
2137 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
2138 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
2139 "Invalid binary operation!", &RMWI);
2140 visitInstruction(RMWI);
2143 void Verifier::visitFenceInst(FenceInst &FI) {
2144 const AtomicOrdering Ordering = FI.getOrdering();
2145 Assert1(Ordering == Acquire || Ordering == Release ||
2146 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
2147 "fence instructions may only have "
2148 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
2149 visitInstruction(FI);
2152 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
2153 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
2154 EVI.getIndices()) ==
2156 "Invalid ExtractValueInst operands!", &EVI);
2158 visitInstruction(EVI);
2161 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
2162 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
2163 IVI.getIndices()) ==
2164 IVI.getOperand(1)->getType(),
2165 "Invalid InsertValueInst operands!", &IVI);
2167 visitInstruction(IVI);
2170 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
2171 BasicBlock *BB = LPI.getParent();
2173 // The landingpad instruction is ill-formed if it doesn't have any clauses and
2175 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
2176 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
2178 // The landingpad instruction defines its parent as a landing pad block. The
2179 // landing pad block may be branched to only by the unwind edge of an invoke.
2180 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
2181 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
2182 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
2183 "Block containing LandingPadInst must be jumped to "
2184 "only by the unwind edge of an invoke.", &LPI);
2187 // The landingpad instruction must be the first non-PHI instruction in the
2189 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
2190 "LandingPadInst not the first non-PHI instruction in the block.",
2193 // The personality functions for all landingpad instructions within the same
2194 // function should match.
2196 Assert1(LPI.getPersonalityFn() == PersonalityFn,
2197 "Personality function doesn't match others in function", &LPI);
2198 PersonalityFn = LPI.getPersonalityFn();
2200 // All operands must be constants.
2201 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
2203 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
2204 Constant *Clause = LPI.getClause(i);
2205 if (LPI.isCatch(i)) {
2206 Assert1(isa<PointerType>(Clause->getType()),
2207 "Catch operand does not have pointer type!", &LPI);
2209 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
2210 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
2211 "Filter operand is not an array of constants!", &LPI);
2215 visitInstruction(LPI);
2218 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
2219 Instruction *Op = cast<Instruction>(I.getOperand(i));
2220 // If the we have an invalid invoke, don't try to compute the dominance.
2221 // We already reject it in the invoke specific checks and the dominance
2222 // computation doesn't handle multiple edges.
2223 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2224 if (II->getNormalDest() == II->getUnwindDest())
2228 const Use &U = I.getOperandUse(i);
2229 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
2230 "Instruction does not dominate all uses!", Op, &I);
2233 /// verifyInstruction - Verify that an instruction is well formed.
2235 void Verifier::visitInstruction(Instruction &I) {
2236 BasicBlock *BB = I.getParent();
2237 Assert1(BB, "Instruction not embedded in basic block!", &I);
2239 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2240 for (User *U : I.users()) {
2241 Assert1(U != (User*)&I || !DT.isReachableFromEntry(BB),
2242 "Only PHI nodes may reference their own value!", &I);
2246 // Check that void typed values don't have names
2247 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2248 "Instruction has a name, but provides a void value!", &I);
2250 // Check that the return value of the instruction is either void or a legal
2252 Assert1(I.getType()->isVoidTy() ||
2253 I.getType()->isFirstClassType(),
2254 "Instruction returns a non-scalar type!", &I);
2256 // Check that the instruction doesn't produce metadata. Calls are already
2257 // checked against the callee type.
2258 Assert1(!I.getType()->isMetadataTy() ||
2259 isa<CallInst>(I) || isa<InvokeInst>(I),
2260 "Invalid use of metadata!", &I);
2262 // Check that all uses of the instruction, if they are instructions
2263 // themselves, actually have parent basic blocks. If the use is not an
2264 // instruction, it is an error!
2265 for (Use &U : I.uses()) {
2266 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
2267 Assert2(Used->getParent() != nullptr, "Instruction referencing"
2268 " instruction not embedded in a basic block!", &I, Used);
2270 CheckFailed("Use of instruction is not an instruction!", U);
2275 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2276 Assert1(I.getOperand(i) != nullptr, "Instruction has null operand!", &I);
2278 // Check to make sure that only first-class-values are operands to
2280 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2281 Assert1(0, "Instruction operands must be first-class values!", &I);
2284 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2285 // Check to make sure that the "address of" an intrinsic function is never
2287 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 :
2288 isa<InvokeInst>(I) ? e-3 : 0),
2289 "Cannot take the address of an intrinsic!", &I);
2290 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2291 F->getIntrinsicID() == Intrinsic::donothing ||
2292 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void ||
2293 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64,
2294 "Cannot invoke an intrinsinc other than"
2295 " donothing or patchpoint", &I);
2296 Assert1(F->getParent() == M, "Referencing function in another module!",
2298 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2299 Assert1(OpBB->getParent() == BB->getParent(),
2300 "Referring to a basic block in another function!", &I);
2301 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2302 Assert1(OpArg->getParent() == BB->getParent(),
2303 "Referring to an argument in another function!", &I);
2304 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2305 Assert1(GV->getParent() == M, "Referencing global in another module!",
2307 } else if (isa<Instruction>(I.getOperand(i))) {
2308 verifyDominatesUse(I, i);
2309 } else if (isa<InlineAsm>(I.getOperand(i))) {
2310 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2311 (i + 3 == e && isa<InvokeInst>(I)),
2312 "Cannot take the address of an inline asm!", &I);
2313 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2314 if (CE->getType()->isPtrOrPtrVectorTy()) {
2315 // If we have a ConstantExpr pointer, we need to see if it came from an
2316 // illegal bitcast (inttoptr <constant int> )
2317 SmallVector<const ConstantExpr *, 4> Stack;
2318 SmallPtrSet<const ConstantExpr *, 4> Visited;
2319 Stack.push_back(CE);
2321 while (!Stack.empty()) {
2322 const ConstantExpr *V = Stack.pop_back_val();
2323 if (!Visited.insert(V).second)
2326 VerifyConstantExprBitcastType(V);
2328 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2329 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2330 Stack.push_back(Op);
2337 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2338 Assert1(I.getType()->isFPOrFPVectorTy(),
2339 "fpmath requires a floating point result!", &I);
2340 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2341 if (ConstantFP *CFP0 =
2342 mdconst::dyn_extract_or_null<ConstantFP>(MD->getOperand(0))) {
2343 APFloat Accuracy = CFP0->getValueAPF();
2344 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2345 "fpmath accuracy not a positive number!", &I);
2347 Assert1(false, "invalid fpmath accuracy!", &I);
2351 if (MDNode *Range = I.getMetadata(LLVMContext::MD_range)) {
2352 Assert1(isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),
2353 "Ranges are only for loads, calls and invokes!", &I);
2354 visitRangeMetadata(I, Range, I.getType());
2357 if (I.getMetadata(LLVMContext::MD_nonnull)) {
2358 Assert1(I.getType()->isPointerTy(),
2359 "nonnull applies only to pointer types", &I);
2360 Assert1(isa<LoadInst>(I),
2361 "nonnull applies only to load instructions, use attributes"
2362 " for calls or invokes", &I);
2365 InstsInThisBlock.insert(&I);
2368 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2369 /// intrinsic argument or return value) matches the type constraints specified
2370 /// by the .td file (e.g. an "any integer" argument really is an integer).
2372 /// This return true on error but does not print a message.
2373 bool Verifier::VerifyIntrinsicType(Type *Ty,
2374 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2375 SmallVectorImpl<Type*> &ArgTys) {
2376 using namespace Intrinsic;
2378 // If we ran out of descriptors, there are too many arguments.
2379 if (Infos.empty()) return true;
2380 IITDescriptor D = Infos.front();
2381 Infos = Infos.slice(1);
2384 case IITDescriptor::Void: return !Ty->isVoidTy();
2385 case IITDescriptor::VarArg: return true;
2386 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2387 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2388 case IITDescriptor::Half: return !Ty->isHalfTy();
2389 case IITDescriptor::Float: return !Ty->isFloatTy();
2390 case IITDescriptor::Double: return !Ty->isDoubleTy();
2391 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2392 case IITDescriptor::Vector: {
2393 VectorType *VT = dyn_cast<VectorType>(Ty);
2394 return !VT || VT->getNumElements() != D.Vector_Width ||
2395 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2397 case IITDescriptor::Pointer: {
2398 PointerType *PT = dyn_cast<PointerType>(Ty);
2399 return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2400 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2403 case IITDescriptor::Struct: {
2404 StructType *ST = dyn_cast<StructType>(Ty);
2405 if (!ST || ST->getNumElements() != D.Struct_NumElements)
2408 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2409 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2414 case IITDescriptor::Argument:
2415 // Two cases here - If this is the second occurrence of an argument, verify
2416 // that the later instance matches the previous instance.
2417 if (D.getArgumentNumber() < ArgTys.size())
2418 return Ty != ArgTys[D.getArgumentNumber()];
2420 // Otherwise, if this is the first instance of an argument, record it and
2421 // verify the "Any" kind.
2422 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2423 ArgTys.push_back(Ty);
2425 switch (D.getArgumentKind()) {
2426 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2427 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2428 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2429 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2431 llvm_unreachable("all argument kinds not covered");
2433 case IITDescriptor::ExtendArgument: {
2434 // This may only be used when referring to a previous vector argument.
2435 if (D.getArgumentNumber() >= ArgTys.size())
2438 Type *NewTy = ArgTys[D.getArgumentNumber()];
2439 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2440 NewTy = VectorType::getExtendedElementVectorType(VTy);
2441 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2442 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2448 case IITDescriptor::TruncArgument: {
2449 // This may only be used when referring to a previous vector argument.
2450 if (D.getArgumentNumber() >= ArgTys.size())
2453 Type *NewTy = ArgTys[D.getArgumentNumber()];
2454 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2455 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2456 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2457 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
2463 case IITDescriptor::HalfVecArgument:
2464 // This may only be used when referring to a previous vector argument.
2465 return D.getArgumentNumber() >= ArgTys.size() ||
2466 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2467 VectorType::getHalfElementsVectorType(
2468 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2469 case IITDescriptor::SameVecWidthArgument: {
2470 if (D.getArgumentNumber() >= ArgTys.size())
2472 VectorType * ReferenceType =
2473 dyn_cast<VectorType>(ArgTys[D.getArgumentNumber()]);
2474 VectorType *ThisArgType = dyn_cast<VectorType>(Ty);
2475 if (!ThisArgType || !ReferenceType ||
2476 (ReferenceType->getVectorNumElements() !=
2477 ThisArgType->getVectorNumElements()))
2479 return VerifyIntrinsicType(ThisArgType->getVectorElementType(),
2483 llvm_unreachable("unhandled");
2486 /// \brief Verify if the intrinsic has variable arguments.
2487 /// This method is intended to be called after all the fixed arguments have been
2490 /// This method returns true on error and does not print an error message.
2492 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2493 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2494 using namespace Intrinsic;
2496 // If there are no descriptors left, then it can't be a vararg.
2498 return isVarArg ? true : false;
2500 // There should be only one descriptor remaining at this point.
2501 if (Infos.size() != 1)
2504 // Check and verify the descriptor.
2505 IITDescriptor D = Infos.front();
2506 Infos = Infos.slice(1);
2507 if (D.Kind == IITDescriptor::VarArg)
2508 return isVarArg ? false : true;
2513 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2515 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2516 Function *IF = CI.getCalledFunction();
2517 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2520 // Verify that the intrinsic prototype lines up with what the .td files
2522 FunctionType *IFTy = IF->getFunctionType();
2523 bool IsVarArg = IFTy->isVarArg();
2525 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2526 getIntrinsicInfoTableEntries(ID, Table);
2527 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2529 SmallVector<Type *, 4> ArgTys;
2530 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2531 "Intrinsic has incorrect return type!", IF);
2532 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2533 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2534 "Intrinsic has incorrect argument type!", IF);
2536 // Verify if the intrinsic call matches the vararg property.
2538 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2539 "Intrinsic was not defined with variable arguments!", IF);
2541 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2542 "Callsite was not defined with variable arguments!", IF);
2544 // All descriptors should be absorbed by now.
2545 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2547 // Now that we have the intrinsic ID and the actual argument types (and we
2548 // know they are legal for the intrinsic!) get the intrinsic name through the
2549 // usual means. This allows us to verify the mangling of argument types into
2551 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
2552 Assert1(ExpectedName == IF->getName(),
2553 "Intrinsic name not mangled correctly for type arguments! "
2554 "Should be: " + ExpectedName, IF);
2556 // If the intrinsic takes MDNode arguments, verify that they are either global
2557 // or are local to *this* function.
2558 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2559 if (auto *MD = dyn_cast<MetadataAsValue>(CI.getArgOperand(i)))
2560 visitMetadataAsValue(*MD, CI.getParent()->getParent());
2565 case Intrinsic::ctlz: // llvm.ctlz
2566 case Intrinsic::cttz: // llvm.cttz
2567 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2568 "is_zero_undef argument of bit counting intrinsics must be a "
2569 "constant int", &CI);
2571 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2572 Assert1(CI.getArgOperand(0) && isa<MetadataAsValue>(CI.getArgOperand(0)),
2573 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2575 case Intrinsic::memcpy:
2576 case Intrinsic::memmove:
2577 case Intrinsic::memset:
2578 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2579 "alignment argument of memory intrinsics must be a constant int",
2581 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2582 "isvolatile argument of memory intrinsics must be a constant int",
2585 case Intrinsic::gcroot:
2586 case Intrinsic::gcwrite:
2587 case Intrinsic::gcread:
2588 if (ID == Intrinsic::gcroot) {
2590 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2591 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2592 Assert1(isa<Constant>(CI.getArgOperand(1)),
2593 "llvm.gcroot parameter #2 must be a constant.", &CI);
2594 if (!AI->getType()->getElementType()->isPointerTy()) {
2595 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2596 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2597 "or argument #2 must be a non-null constant.", &CI);
2601 Assert1(CI.getParent()->getParent()->hasGC(),
2602 "Enclosing function does not use GC.", &CI);
2604 case Intrinsic::init_trampoline:
2605 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2606 "llvm.init_trampoline parameter #2 must resolve to a function.",
2609 case Intrinsic::prefetch:
2610 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2611 isa<ConstantInt>(CI.getArgOperand(2)) &&
2612 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2613 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2614 "invalid arguments to llvm.prefetch",
2617 case Intrinsic::stackprotector:
2618 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2619 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2622 case Intrinsic::lifetime_start:
2623 case Intrinsic::lifetime_end:
2624 case Intrinsic::invariant_start:
2625 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2626 "size argument of memory use markers must be a constant integer",
2629 case Intrinsic::invariant_end:
2630 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2631 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2634 case Intrinsic::experimental_gc_statepoint: {
2635 Assert1(!CI.doesNotAccessMemory() &&
2636 !CI.onlyReadsMemory(),
2637 "gc.statepoint must read and write memory to preserve "
2638 "reordering restrictions required by safepoint semantics", &CI);
2639 Assert1(!CI.isInlineAsm(),
2640 "gc.statepoint support for inline assembly unimplemented", &CI);
2642 const Value *Target = CI.getArgOperand(0);
2643 const PointerType *PT = dyn_cast<PointerType>(Target->getType());
2644 Assert2(PT && PT->getElementType()->isFunctionTy(),
2645 "gc.statepoint callee must be of function pointer type",
2647 FunctionType *TargetFuncType = cast<FunctionType>(PT->getElementType());
2648 Assert1(!TargetFuncType->isVarArg(),
2649 "gc.statepoint support for var arg functions not implemented", &CI);
2651 const Value *NumCallArgsV = CI.getArgOperand(1);
2652 Assert1(isa<ConstantInt>(NumCallArgsV),
2653 "gc.statepoint number of arguments to underlying call "
2654 "must be constant integer", &CI);
2655 const int NumCallArgs = cast<ConstantInt>(NumCallArgsV)->getZExtValue();
2656 Assert1(NumCallArgs >= 0,
2657 "gc.statepoint number of arguments to underlying call "
2658 "must be positive", &CI);
2659 Assert1(NumCallArgs == (int)TargetFuncType->getNumParams(),
2660 "gc.statepoint mismatch in number of call args", &CI);
2662 const Value *Unused = CI.getArgOperand(2);
2663 Assert1(isa<ConstantInt>(Unused) &&
2664 cast<ConstantInt>(Unused)->isNullValue(),
2665 "gc.statepoint parameter #3 must be zero", &CI);
2667 // Verify that the types of the call parameter arguments match
2668 // the type of the wrapped callee.
2669 for (int i = 0; i < NumCallArgs; i++) {
2670 Type *ParamType = TargetFuncType->getParamType(i);
2671 Type *ArgType = CI.getArgOperand(3+i)->getType();
2672 Assert1(ArgType == ParamType,
2673 "gc.statepoint call argument does not match wrapped "
2674 "function type", &CI);
2676 const int EndCallArgsInx = 2+NumCallArgs;
2677 const Value *NumDeoptArgsV = CI.getArgOperand(EndCallArgsInx+1);
2678 Assert1(isa<ConstantInt>(NumDeoptArgsV),
2679 "gc.statepoint number of deoptimization arguments "
2680 "must be constant integer", &CI);
2681 const int NumDeoptArgs = cast<ConstantInt>(NumDeoptArgsV)->getZExtValue();
2682 Assert1(NumDeoptArgs >= 0,
2683 "gc.statepoint number of deoptimization arguments "
2684 "must be positive", &CI);
2686 Assert1(4 + NumCallArgs + NumDeoptArgs <= (int)CI.getNumArgOperands(),
2687 "gc.statepoint too few arguments according to length fields", &CI);
2689 // Check that the only uses of this gc.statepoint are gc.result or
2690 // gc.relocate calls which are tied to this statepoint and thus part
2691 // of the same statepoint sequence
2692 for (User *U : CI.users()) {
2693 const CallInst *Call = dyn_cast<const CallInst>(U);
2694 Assert2(Call, "illegal use of statepoint token", &CI, U);
2695 if (!Call) continue;
2696 Assert2(isGCRelocate(Call) || isGCResult(Call),
2697 "gc.result or gc.relocate are the only value uses"
2698 "of a gc.statepoint", &CI, U);
2699 if (isGCResult(Call)) {
2700 Assert2(Call->getArgOperand(0) == &CI,
2701 "gc.result connected to wrong gc.statepoint",
2703 } else if (isGCRelocate(Call)) {
2704 Assert2(Call->getArgOperand(0) == &CI,
2705 "gc.relocate connected to wrong gc.statepoint",
2710 // Note: It is legal for a single derived pointer to be listed multiple
2711 // times. It's non-optimal, but it is legal. It can also happen after
2712 // insertion if we strip a bitcast away.
2713 // Note: It is really tempting to check that each base is relocated and
2714 // that a derived pointer is never reused as a base pointer. This turns
2715 // out to be problematic since optimizations run after safepoint insertion
2716 // can recognize equality properties that the insertion logic doesn't know
2717 // about. See example statepoint.ll in the verifier subdirectory
2720 case Intrinsic::experimental_gc_result_int:
2721 case Intrinsic::experimental_gc_result_float:
2722 case Intrinsic::experimental_gc_result_ptr: {
2723 // Are we tied to a statepoint properly?
2724 CallSite StatepointCS(CI.getArgOperand(0));
2725 const Function *StatepointFn = StatepointCS.getCalledFunction();
2726 Assert2(StatepointFn && StatepointFn->isDeclaration() &&
2727 StatepointFn->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2728 "token must be from a statepoint", &CI, CI.getArgOperand(0));
2730 // Assert that result type matches wrapped callee.
2731 const Value *Target = StatepointCS.getArgument(0);
2732 const PointerType *PT = cast<PointerType>(Target->getType());
2733 const FunctionType *TargetFuncType =
2734 cast<FunctionType>(PT->getElementType());
2735 Assert1(CI.getType() == TargetFuncType->getReturnType(),
2736 "gc.result result type does not match wrapped callee",
2740 case Intrinsic::experimental_gc_relocate: {
2741 // Are we tied to a statepoint properly?
2742 CallSite StatepointCS(CI.getArgOperand(0));
2743 const Function *StatepointFn =
2744 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : NULL;
2745 Assert2(StatepointFn && StatepointFn->isDeclaration() &&
2746 StatepointFn->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2747 "token must be from a statepoint", &CI, CI.getArgOperand(0));
2749 // Both the base and derived must be piped through the safepoint
2750 Value* Base = CI.getArgOperand(1);
2751 Assert1( isa<ConstantInt>(Base), "must be integer offset", &CI);
2753 Value* Derived = CI.getArgOperand(2);
2754 Assert1( isa<ConstantInt>(Derived), "must be integer offset", &CI);
2756 const int BaseIndex = cast<ConstantInt>(Base)->getZExtValue();
2757 const int DerivedIndex = cast<ConstantInt>(Derived)->getZExtValue();
2759 Assert1(0 <= BaseIndex &&
2760 BaseIndex < (int)StatepointCS.arg_size(),
2761 "index out of bounds", &CI);
2762 Assert1(0 <= DerivedIndex &&
2763 DerivedIndex < (int)StatepointCS.arg_size(),
2764 "index out of bounds", &CI);
2766 // Assert that the result type matches the type of the relocated pointer
2767 GCRelocateOperands Operands(&CI);
2768 Assert1(Operands.derivedPtr()->getType() == CI.getType(),
2769 "gc.relocate: relocating a pointer shouldn't change it's type",
2776 void DebugInfoVerifier::verifyDebugInfo() {
2777 if (!VerifyDebugInfo)
2780 DebugInfoFinder Finder;
2781 Finder.processModule(*M);
2782 processInstructions(Finder);
2784 // Verify Debug Info.
2786 // NOTE: The loud braces are necessary for MSVC compatibility.
2787 for (DICompileUnit CU : Finder.compile_units()) {
2788 Assert1(CU.Verify(), "DICompileUnit does not Verify!", CU);
2790 for (DISubprogram S : Finder.subprograms()) {
2791 Assert1(S.Verify(), "DISubprogram does not Verify!", S);
2793 for (DIGlobalVariable GV : Finder.global_variables()) {
2794 Assert1(GV.Verify(), "DIGlobalVariable does not Verify!", GV);
2796 for (DIType T : Finder.types()) {
2797 Assert1(T.Verify(), "DIType does not Verify!", T);
2799 for (DIScope S : Finder.scopes()) {
2800 Assert1(S.Verify(), "DIScope does not Verify!", S);
2804 void DebugInfoVerifier::processInstructions(DebugInfoFinder &Finder) {
2805 for (const Function &F : *M)
2806 for (auto I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2807 if (MDNode *MD = I->getMetadata(LLVMContext::MD_dbg))
2808 Finder.processLocation(*M, DILocation(MD));
2809 if (const CallInst *CI = dyn_cast<CallInst>(&*I))
2810 processCallInst(Finder, *CI);
2814 void DebugInfoVerifier::processCallInst(DebugInfoFinder &Finder,
2815 const CallInst &CI) {
2816 if (Function *F = CI.getCalledFunction())
2817 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2819 case Intrinsic::dbg_declare:
2820 Finder.processDeclare(*M, cast<DbgDeclareInst>(&CI));
2822 case Intrinsic::dbg_value:
2823 Finder.processValue(*M, cast<DbgValueInst>(&CI));
2830 //===----------------------------------------------------------------------===//
2831 // Implement the public interfaces to this file...
2832 //===----------------------------------------------------------------------===//
2834 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
2835 Function &F = const_cast<Function &>(f);
2836 assert(!F.isDeclaration() && "Cannot verify external functions");
2838 raw_null_ostream NullStr;
2839 Verifier V(OS ? *OS : NullStr);
2841 // Note that this function's return value is inverted from what you would
2842 // expect of a function called "verify".
2843 return !V.verify(F);
2846 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
2847 raw_null_ostream NullStr;
2848 Verifier V(OS ? *OS : NullStr);
2850 bool Broken = false;
2851 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
2852 if (!I->isDeclaration() && !I->isMaterializable())
2853 Broken |= !V.verify(*I);
2855 // Note that this function's return value is inverted from what you would
2856 // expect of a function called "verify".
2857 DebugInfoVerifier DIV(OS ? *OS : NullStr);
2858 return !V.verify(M) || !DIV.verify(M) || Broken;
2862 struct VerifierLegacyPass : public FunctionPass {
2868 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
2869 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2871 explicit VerifierLegacyPass(bool FatalErrors)
2872 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2873 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2876 bool runOnFunction(Function &F) override {
2877 if (!V.verify(F) && FatalErrors)
2878 report_fatal_error("Broken function found, compilation aborted!");
2883 bool doFinalization(Module &M) override {
2884 if (!V.verify(M) && FatalErrors)
2885 report_fatal_error("Broken module found, compilation aborted!");
2890 void getAnalysisUsage(AnalysisUsage &AU) const override {
2891 AU.setPreservesAll();
2894 struct DebugInfoVerifierLegacyPass : public ModulePass {
2897 DebugInfoVerifier V;
2900 DebugInfoVerifierLegacyPass() : ModulePass(ID), FatalErrors(true) {
2901 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2903 explicit DebugInfoVerifierLegacyPass(bool FatalErrors)
2904 : ModulePass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2905 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2908 bool runOnModule(Module &M) override {
2909 if (!V.verify(M) && FatalErrors)
2910 report_fatal_error("Broken debug info found, compilation aborted!");
2915 void getAnalysisUsage(AnalysisUsage &AU) const override {
2916 AU.setPreservesAll();
2921 char VerifierLegacyPass::ID = 0;
2922 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
2924 char DebugInfoVerifierLegacyPass::ID = 0;
2925 INITIALIZE_PASS(DebugInfoVerifierLegacyPass, "verify-di", "Debug Info Verifier",
2928 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
2929 return new VerifierLegacyPass(FatalErrors);
2932 ModulePass *llvm::createDebugInfoVerifierPass(bool FatalErrors) {
2933 return new DebugInfoVerifierLegacyPass(FatalErrors);
2936 PreservedAnalyses VerifierPass::run(Module *M) {
2937 if (verifyModule(*M, &dbgs()) && FatalErrors)
2938 report_fatal_error("Broken module found, compilation aborted!");
2940 return PreservedAnalyses::all();
2943 PreservedAnalyses VerifierPass::run(Function *F) {
2944 if (verifyFunction(*F, &dbgs()) && FatalErrors)
2945 report_fatal_error("Broken function found, compilation aborted!");
2947 return PreservedAnalyses::all();