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/Analysis/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/Analysis/Dominators.h"
55 #include "llvm/Assembly/Writer.h"
56 #include "llvm/DebugInfo.h"
57 #include "llvm/IR/CallingConv.h"
58 #include "llvm/IR/Constants.h"
59 #include "llvm/IR/DataLayout.h"
60 #include "llvm/IR/DerivedTypes.h"
61 #include "llvm/IR/InlineAsm.h"
62 #include "llvm/IR/IntrinsicInst.h"
63 #include "llvm/IR/LLVMContext.h"
64 #include "llvm/IR/Metadata.h"
65 #include "llvm/IR/Module.h"
66 #include "llvm/InstVisitor.h"
67 #include "llvm/Pass.h"
68 #include "llvm/PassManager.h"
69 #include "llvm/Support/CFG.h"
70 #include "llvm/Support/CallSite.h"
71 #include "llvm/Support/CommandLine.h"
72 #include "llvm/Support/ConstantRange.h"
73 #include "llvm/Support/Debug.h"
74 #include "llvm/Support/ErrorHandling.h"
75 #include "llvm/Support/raw_ostream.h"
80 static cl::opt<bool> DisableDebugInfoVerifier("disable-debug-info-verifier",
83 namespace { // Anonymous namespace for class
84 struct PreVerifier : public FunctionPass {
85 static char ID; // Pass ID, replacement for typeid
87 PreVerifier() : FunctionPass(ID) {
88 initializePreVerifierPass(*PassRegistry::getPassRegistry());
91 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
95 // Check that the prerequisites for successful DominatorTree construction
97 bool runOnFunction(Function &F) {
100 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
101 if (I->empty() || !I->back().isTerminator()) {
102 dbgs() << "Basic Block in function '" << F.getName()
103 << "' does not have terminator!\n";
104 WriteAsOperand(dbgs(), I, true);
111 report_fatal_error("Broken module, no Basic Block terminator!");
118 char PreVerifier::ID = 0;
119 INITIALIZE_PASS(PreVerifier, "preverify", "Preliminary module verification",
121 static char &PreVerifyID = PreVerifier::ID;
124 struct Verifier : public FunctionPass, public InstVisitor<Verifier> {
125 static char ID; // Pass ID, replacement for typeid
126 bool Broken; // Is this module found to be broken?
127 VerifierFailureAction action;
128 // What to do if verification fails.
129 Module *Mod; // Module we are verifying right now
130 LLVMContext *Context; // Context within which we are verifying
131 DominatorTree *DT; // Dominator Tree, caution can be null!
132 const DataLayout *DL;
134 std::string Messages;
135 raw_string_ostream MessagesStr;
137 /// InstInThisBlock - when verifying a basic block, keep track of all of the
138 /// instructions we have seen so far. This allows us to do efficient
139 /// dominance checks for the case when an instruction has an operand that is
140 /// an instruction in the same block.
141 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
143 /// MDNodes - keep track of the metadata nodes that have been checked
145 SmallPtrSet<MDNode *, 32> MDNodes;
147 /// PersonalityFn - The personality function referenced by the
148 /// LandingPadInsts. All LandingPadInsts within the same function must use
149 /// the same personality function.
150 const Value *PersonalityFn;
152 /// Finder keeps track of all debug info MDNodes in a Module.
153 DebugInfoFinder Finder;
156 : FunctionPass(ID), Broken(false),
157 action(AbortProcessAction), Mod(0), Context(0), DT(0), DL(0),
158 MessagesStr(Messages), PersonalityFn(0) {
159 initializeVerifierPass(*PassRegistry::getPassRegistry());
161 explicit Verifier(VerifierFailureAction ctn)
162 : FunctionPass(ID), Broken(false), action(ctn), Mod(0),
163 Context(0), DT(0), DL(0), MessagesStr(Messages), PersonalityFn(0) {
164 initializeVerifierPass(*PassRegistry::getPassRegistry());
167 bool doInitialization(Module &M) {
169 Context = &M.getContext();
172 DL = getAnalysisIfAvailable<DataLayout>();
173 if (!DisableDebugInfoVerifier)
174 Finder.processModule(M);
176 // We must abort before returning back to the pass manager, or else the
177 // pass manager may try to run other passes on the broken module.
178 return abortIfBroken();
181 bool runOnFunction(Function &F) {
182 // Get dominator information if we are being run by PassManager
183 DT = &getAnalysis<DominatorTree>();
186 if (!Context) Context = &F.getContext();
189 InstsInThisBlock.clear();
192 // We must abort before returning back to the pass manager, or else the
193 // pass manager may try to run other passes on the broken module.
194 return abortIfBroken();
197 bool doFinalization(Module &M) {
198 // Scan through, checking all of the external function's linkage now...
199 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
200 visitGlobalValue(*I);
202 // Check to make sure function prototypes are okay.
203 if (I->isDeclaration()) visitFunction(*I);
206 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
208 visitGlobalVariable(*I);
210 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
212 visitGlobalAlias(*I);
214 for (Module::named_metadata_iterator I = M.named_metadata_begin(),
215 E = M.named_metadata_end(); I != E; ++I)
216 visitNamedMDNode(*I);
220 // Verify Debug Info.
223 // If the module is broken, abort at this time.
224 return abortIfBroken();
227 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
228 AU.setPreservesAll();
229 AU.addRequiredID(PreVerifyID);
230 AU.addRequired<DominatorTree>();
233 /// abortIfBroken - If the module is broken and we are supposed to abort on
234 /// this condition, do so.
236 bool abortIfBroken() {
237 if (!Broken) return false;
238 MessagesStr << "Broken module found, ";
240 case AbortProcessAction:
241 MessagesStr << "compilation aborted!\n";
242 dbgs() << MessagesStr.str();
243 // Client should choose different reaction if abort is not desired
245 case PrintMessageAction:
246 MessagesStr << "verification continues.\n";
247 dbgs() << MessagesStr.str();
249 case ReturnStatusAction:
250 MessagesStr << "compilation terminated.\n";
253 llvm_unreachable("Invalid action");
257 // Verification methods...
258 void visitGlobalValue(GlobalValue &GV);
259 void visitGlobalVariable(GlobalVariable &GV);
260 void visitGlobalAlias(GlobalAlias &GA);
261 void visitNamedMDNode(NamedMDNode &NMD);
262 void visitMDNode(MDNode &MD, Function *F);
263 void visitModuleFlags(Module &M);
264 void visitModuleFlag(MDNode *Op, DenseMap<MDString*, MDNode*> &SeenIDs,
265 SmallVectorImpl<MDNode*> &Requirements);
266 void visitFunction(Function &F);
267 void visitBasicBlock(BasicBlock &BB);
268 using InstVisitor<Verifier>::visit;
270 void visit(Instruction &I);
272 void visitTruncInst(TruncInst &I);
273 void visitZExtInst(ZExtInst &I);
274 void visitSExtInst(SExtInst &I);
275 void visitFPTruncInst(FPTruncInst &I);
276 void visitFPExtInst(FPExtInst &I);
277 void visitFPToUIInst(FPToUIInst &I);
278 void visitFPToSIInst(FPToSIInst &I);
279 void visitUIToFPInst(UIToFPInst &I);
280 void visitSIToFPInst(SIToFPInst &I);
281 void visitIntToPtrInst(IntToPtrInst &I);
282 void visitPtrToIntInst(PtrToIntInst &I);
283 void visitBitCastInst(BitCastInst &I);
284 void visitPHINode(PHINode &PN);
285 void visitBinaryOperator(BinaryOperator &B);
286 void visitICmpInst(ICmpInst &IC);
287 void visitFCmpInst(FCmpInst &FC);
288 void visitExtractElementInst(ExtractElementInst &EI);
289 void visitInsertElementInst(InsertElementInst &EI);
290 void visitShuffleVectorInst(ShuffleVectorInst &EI);
291 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
292 void visitCallInst(CallInst &CI);
293 void visitInvokeInst(InvokeInst &II);
294 void visitGetElementPtrInst(GetElementPtrInst &GEP);
295 void visitLoadInst(LoadInst &LI);
296 void visitStoreInst(StoreInst &SI);
297 void verifyDominatesUse(Instruction &I, unsigned i);
298 void visitInstruction(Instruction &I);
299 void visitTerminatorInst(TerminatorInst &I);
300 void visitBranchInst(BranchInst &BI);
301 void visitReturnInst(ReturnInst &RI);
302 void visitSwitchInst(SwitchInst &SI);
303 void visitIndirectBrInst(IndirectBrInst &BI);
304 void visitSelectInst(SelectInst &SI);
305 void visitUserOp1(Instruction &I);
306 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
307 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
308 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
309 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
310 void visitFenceInst(FenceInst &FI);
311 void visitAllocaInst(AllocaInst &AI);
312 void visitExtractValueInst(ExtractValueInst &EVI);
313 void visitInsertValueInst(InsertValueInst &IVI);
314 void visitLandingPadInst(LandingPadInst &LPI);
316 void VerifyCallSite(CallSite CS);
317 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty,
318 int VT, unsigned ArgNo, std::string &Suffix);
319 bool VerifyIntrinsicType(Type *Ty,
320 ArrayRef<Intrinsic::IITDescriptor> &Infos,
321 SmallVectorImpl<Type*> &ArgTys);
322 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
323 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
324 bool isFunction, const Value *V);
325 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
326 bool isReturnValue, const Value *V);
327 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
330 void VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy);
331 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
333 void verifyDebugInfo(Module &M);
335 void WriteValue(const Value *V) {
337 if (isa<Instruction>(V)) {
338 MessagesStr << *V << '\n';
340 WriteAsOperand(MessagesStr, V, true, Mod);
345 void WriteType(Type *T) {
347 MessagesStr << ' ' << *T;
351 // CheckFailed - A check failed, so print out the condition and the message
352 // that failed. This provides a nice place to put a breakpoint if you want
353 // to see why something is not correct.
354 void CheckFailed(const Twine &Message,
355 const Value *V1 = 0, const Value *V2 = 0,
356 const Value *V3 = 0, const Value *V4 = 0) {
357 MessagesStr << Message.str() << "\n";
365 void CheckFailed(const Twine &Message, const Value *V1,
366 Type *T2, const Value *V3 = 0) {
367 MessagesStr << Message.str() << "\n";
374 void CheckFailed(const Twine &Message, Type *T1,
375 Type *T2 = 0, Type *T3 = 0) {
376 MessagesStr << Message.str() << "\n";
383 } // End anonymous namespace
385 char Verifier::ID = 0;
386 INITIALIZE_PASS_BEGIN(Verifier, "verify", "Module Verifier", false, false)
387 INITIALIZE_PASS_DEPENDENCY(PreVerifier)
388 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
389 INITIALIZE_PASS_END(Verifier, "verify", "Module Verifier", false, false)
391 // Assert - We know that cond should be true, if not print an error message.
392 #define Assert(C, M) \
393 do { if (!(C)) { CheckFailed(M); return; } } while (0)
394 #define Assert1(C, M, V1) \
395 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
396 #define Assert2(C, M, V1, V2) \
397 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
398 #define Assert3(C, M, V1, V2, V3) \
399 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
400 #define Assert4(C, M, V1, V2, V3, V4) \
401 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
403 void Verifier::visit(Instruction &I) {
404 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
405 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
406 InstVisitor<Verifier>::visit(I);
410 void Verifier::visitGlobalValue(GlobalValue &GV) {
411 Assert1(!GV.isDeclaration() ||
412 GV.isMaterializable() ||
413 GV.hasExternalLinkage() ||
414 GV.hasDLLImportLinkage() ||
415 GV.hasExternalWeakLinkage() ||
416 (isa<GlobalAlias>(GV) &&
417 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
418 "Global is external, but doesn't have external or dllimport or weak linkage!",
421 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
422 "Global is marked as dllimport, but not external", &GV);
424 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
425 "Only global variables can have appending linkage!", &GV);
427 if (GV.hasAppendingLinkage()) {
428 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
429 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
430 "Only global arrays can have appending linkage!", GVar);
433 Assert1(!GV.hasLinkOnceODRAutoHideLinkage() || GV.hasDefaultVisibility(),
434 "linkonce_odr_auto_hide can only have default visibility!",
438 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
439 if (GV.hasInitializer()) {
440 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
441 "Global variable initializer type does not match global "
442 "variable type!", &GV);
444 // If the global has common linkage, it must have a zero initializer and
445 // cannot be constant.
446 if (GV.hasCommonLinkage()) {
447 Assert1(GV.getInitializer()->isNullValue(),
448 "'common' global must have a zero initializer!", &GV);
449 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
453 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
454 GV.hasExternalWeakLinkage(),
455 "invalid linkage type for global declaration", &GV);
458 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
459 GV.getName() == "llvm.global_dtors")) {
460 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
461 "invalid linkage for intrinsic global variable", &GV);
462 // Don't worry about emitting an error for it not being an array,
463 // visitGlobalValue will complain on appending non-array.
464 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType())) {
465 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
466 PointerType *FuncPtrTy =
467 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
468 Assert1(STy && STy->getNumElements() == 2 &&
469 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
470 STy->getTypeAtIndex(1) == FuncPtrTy,
471 "wrong type for intrinsic global variable", &GV);
475 if (GV.hasName() && (GV.getName() == "llvm.used" ||
476 GV.getName() == "llvm.compiler.used")) {
477 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
478 "invalid linkage for intrinsic global variable", &GV);
479 Type *GVType = GV.getType()->getElementType();
480 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
481 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
482 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
483 if (GV.hasInitializer()) {
484 Constant *Init = GV.getInitializer();
485 ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
486 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
488 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
489 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
491 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
492 "invalid llvm.used member", V);
493 Assert1(V->hasName(), "members of llvm.used must be named", V);
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))
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::visitGlobalAlias(GlobalAlias &GA) {
530 Assert1(!GA.getName().empty(),
531 "Alias name cannot be empty!", &GA);
532 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
533 "Alias should have external or external weak linkage!", &GA);
534 Assert1(GA.getAliasee(),
535 "Aliasee cannot be NULL!", &GA);
536 Assert1(GA.getType() == GA.getAliasee()->getType(),
537 "Alias and aliasee types should match!", &GA);
538 Assert1(!GA.hasUnnamedAddr(), "Alias cannot have unnamed_addr!", &GA);
540 Constant *Aliasee = GA.getAliasee();
542 if (!isa<GlobalValue>(Aliasee)) {
543 ConstantExpr *CE = dyn_cast<ConstantExpr>(Aliasee);
545 (CE->getOpcode() == Instruction::BitCast ||
546 CE->getOpcode() == Instruction::GetElementPtr) &&
547 isa<GlobalValue>(CE->getOperand(0)),
548 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
551 if (CE->getOpcode() == Instruction::BitCast) {
552 unsigned SrcAS = CE->getOperand(0)->getType()->getPointerAddressSpace();
553 unsigned DstAS = CE->getType()->getPointerAddressSpace();
555 Assert1(SrcAS == DstAS,
556 "Alias bitcasts cannot be between different address spaces",
561 const GlobalValue* Resolved = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
563 "Aliasing chain should end with function or global variable", &GA);
565 visitGlobalValue(GA);
568 void Verifier::visitNamedMDNode(NamedMDNode &NMD) {
569 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
570 MDNode *MD = NMD.getOperand(i);
574 Assert1(!MD->isFunctionLocal(),
575 "Named metadata operand cannot be function local!", MD);
580 void Verifier::visitMDNode(MDNode &MD, Function *F) {
581 // Only visit each node once. Metadata can be mutually recursive, so this
582 // avoids infinite recursion here, as well as being an optimization.
583 if (!MDNodes.insert(&MD))
586 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
587 Value *Op = MD.getOperand(i);
590 if (isa<Constant>(Op) || isa<MDString>(Op))
592 if (MDNode *N = dyn_cast<MDNode>(Op)) {
593 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
594 "Global metadata operand cannot be function local!", &MD, N);
598 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
600 // If this was an instruction, bb, or argument, verify that it is in the
601 // function that we expect.
602 Function *ActualF = 0;
603 if (Instruction *I = dyn_cast<Instruction>(Op))
604 ActualF = I->getParent()->getParent();
605 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
606 ActualF = BB->getParent();
607 else if (Argument *A = dyn_cast<Argument>(Op))
608 ActualF = A->getParent();
609 assert(ActualF && "Unimplemented function local metadata case!");
611 Assert2(ActualF == F, "function-local metadata used in wrong function",
616 void Verifier::visitModuleFlags(Module &M) {
617 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
620 // Scan each flag, and track the flags and requirements.
621 DenseMap<MDString*, MDNode*> SeenIDs;
622 SmallVector<MDNode*, 16> Requirements;
623 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
624 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
627 // Validate that the requirements in the module are valid.
628 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
629 MDNode *Requirement = Requirements[I];
630 MDString *Flag = cast<MDString>(Requirement->getOperand(0));
631 Value *ReqValue = Requirement->getOperand(1);
633 MDNode *Op = SeenIDs.lookup(Flag);
635 CheckFailed("invalid requirement on flag, flag is not present in module",
640 if (Op->getOperand(2) != ReqValue) {
641 CheckFailed(("invalid requirement on flag, "
642 "flag does not have the required value"),
649 void Verifier::visitModuleFlag(MDNode *Op, DenseMap<MDString*, MDNode*>&SeenIDs,
650 SmallVectorImpl<MDNode*> &Requirements) {
651 // Each module flag should have three arguments, the merge behavior (a
652 // constant int), the flag ID (an MDString), and the value.
653 Assert1(Op->getNumOperands() == 3,
654 "incorrect number of operands in module flag", Op);
655 ConstantInt *Behavior = dyn_cast<ConstantInt>(Op->getOperand(0));
656 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
658 "invalid behavior operand in module flag (expected constant integer)",
660 unsigned BehaviorValue = Behavior->getZExtValue();
662 "invalid ID operand in module flag (expected metadata string)",
665 // Sanity check the values for behaviors with additional requirements.
666 switch (BehaviorValue) {
669 "invalid behavior operand in module flag (unexpected constant)",
674 case Module::Warning:
675 case Module::Override:
676 // These behavior types accept any value.
679 case Module::Require: {
680 // The value should itself be an MDNode with two operands, a flag ID (an
681 // MDString), and a value.
682 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
683 Assert1(Value && Value->getNumOperands() == 2,
684 "invalid value for 'require' module flag (expected metadata pair)",
686 Assert1(isa<MDString>(Value->getOperand(0)),
687 ("invalid value for 'require' module flag "
688 "(first value operand should be a string)"),
689 Value->getOperand(0));
691 // Append it to the list of requirements, to check once all module flags are
693 Requirements.push_back(Value);
698 case Module::AppendUnique: {
699 // These behavior types require the operand be an MDNode.
700 Assert1(isa<MDNode>(Op->getOperand(2)),
701 "invalid value for 'append'-type module flag "
702 "(expected a metadata node)", Op->getOperand(2));
707 // Unless this is a "requires" flag, check the ID is unique.
708 if (BehaviorValue != Module::Require) {
709 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
711 "module flag identifiers must be unique (or of 'require' type)",
716 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
717 bool isFunction, const Value *V) {
719 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
720 if (Attrs.getSlotIndex(I) == Idx) {
725 assert(Slot != ~0U && "Attribute set inconsistency!");
727 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
729 if (I->isStringAttribute())
732 if (I->getKindAsEnum() == Attribute::NoReturn ||
733 I->getKindAsEnum() == Attribute::NoUnwind ||
734 I->getKindAsEnum() == Attribute::NoInline ||
735 I->getKindAsEnum() == Attribute::AlwaysInline ||
736 I->getKindAsEnum() == Attribute::OptimizeForSize ||
737 I->getKindAsEnum() == Attribute::StackProtect ||
738 I->getKindAsEnum() == Attribute::StackProtectReq ||
739 I->getKindAsEnum() == Attribute::StackProtectStrong ||
740 I->getKindAsEnum() == Attribute::NoRedZone ||
741 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
742 I->getKindAsEnum() == Attribute::Naked ||
743 I->getKindAsEnum() == Attribute::InlineHint ||
744 I->getKindAsEnum() == Attribute::StackAlignment ||
745 I->getKindAsEnum() == Attribute::UWTable ||
746 I->getKindAsEnum() == Attribute::NonLazyBind ||
747 I->getKindAsEnum() == Attribute::ReturnsTwice ||
748 I->getKindAsEnum() == Attribute::SanitizeAddress ||
749 I->getKindAsEnum() == Attribute::SanitizeThread ||
750 I->getKindAsEnum() == Attribute::SanitizeMemory ||
751 I->getKindAsEnum() == Attribute::MinSize ||
752 I->getKindAsEnum() == Attribute::NoDuplicate ||
753 I->getKindAsEnum() == Attribute::Builtin ||
754 I->getKindAsEnum() == Attribute::NoBuiltin ||
755 I->getKindAsEnum() == Attribute::Cold ||
756 I->getKindAsEnum() == Attribute::OptimizeNone) {
758 CheckFailed("Attribute '" + I->getAsString() +
759 "' only applies to functions!", V);
762 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
763 I->getKindAsEnum() == Attribute::ReadNone) {
765 CheckFailed("Attribute '" + I->getAsString() +
766 "' does not apply to function returns");
769 } else if (isFunction) {
770 CheckFailed("Attribute '" + I->getAsString() +
771 "' does not apply to functions!", V);
777 // VerifyParameterAttrs - Check the given attributes for an argument or return
778 // value of the specified type. The value V is printed in error messages.
779 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
780 bool isReturnValue, const Value *V) {
781 if (!Attrs.hasAttributes(Idx))
784 VerifyAttributeTypes(Attrs, Idx, false, V);
787 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
788 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
789 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
790 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
791 !Attrs.hasAttribute(Idx, Attribute::Returned),
792 "Attribute 'byval', 'nest', 'sret', 'nocapture', and 'returned' "
793 "do not apply to return values!", V);
795 // Check for mutually incompatible attributes.
796 Assert1(!((Attrs.hasAttribute(Idx, Attribute::ByVal) &&
797 Attrs.hasAttribute(Idx, Attribute::Nest)) ||
798 (Attrs.hasAttribute(Idx, Attribute::ByVal) &&
799 Attrs.hasAttribute(Idx, Attribute::StructRet)) ||
800 (Attrs.hasAttribute(Idx, Attribute::Nest) &&
801 Attrs.hasAttribute(Idx, Attribute::StructRet))), "Attributes "
802 "'byval, nest, and sret' are incompatible!", V);
804 Assert1(!((Attrs.hasAttribute(Idx, Attribute::ByVal) &&
805 Attrs.hasAttribute(Idx, Attribute::Nest)) ||
806 (Attrs.hasAttribute(Idx, Attribute::ByVal) &&
807 Attrs.hasAttribute(Idx, Attribute::InReg)) ||
808 (Attrs.hasAttribute(Idx, Attribute::Nest) &&
809 Attrs.hasAttribute(Idx, Attribute::InReg))), "Attributes "
810 "'byval, nest, and inreg' are incompatible!", V);
812 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
813 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
814 "'sret and returned' are incompatible!", V);
816 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
817 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
818 "'zeroext and signext' are incompatible!", V);
820 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
821 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
822 "'readnone and readonly' are incompatible!", V);
824 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
825 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
826 "'noinline and alwaysinline' are incompatible!", V);
828 Assert1(!AttrBuilder(Attrs, Idx).
829 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
830 "Wrong types for attribute: " +
831 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
833 if (PointerType *PTy = dyn_cast<PointerType>(Ty))
834 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) ||
835 PTy->getElementType()->isSized(),
836 "Attribute 'byval' does not support unsized types!", V);
838 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
839 "Attribute 'byval' only applies to parameters with pointer type!",
843 // VerifyFunctionAttrs - Check parameter attributes against a function type.
844 // The value V is printed in error messages.
845 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
850 bool SawNest = false;
851 bool SawReturned = false;
853 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
854 unsigned Idx = Attrs.getSlotIndex(i);
858 Ty = FT->getReturnType();
859 else if (Idx-1 < FT->getNumParams())
860 Ty = FT->getParamType(Idx-1);
862 break; // VarArgs attributes, verified elsewhere.
864 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
869 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
870 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
874 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
875 Assert1(!SawReturned, "More than one parameter has attribute returned!",
877 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
878 "argument and return types for 'returned' attribute", V);
882 if (Attrs.hasAttribute(Idx, Attribute::StructRet))
883 Assert1(Idx == 1, "Attribute sret is not on first parameter!", V);
886 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
889 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
891 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
892 Attribute::ReadNone) &&
893 Attrs.hasAttribute(AttributeSet::FunctionIndex,
894 Attribute::ReadOnly)),
895 "Attributes 'readnone and readonly' are incompatible!", V);
897 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
898 Attribute::NoInline) &&
899 Attrs.hasAttribute(AttributeSet::FunctionIndex,
900 Attribute::AlwaysInline)),
901 "Attributes 'noinline and alwaysinline' are incompatible!", V);
903 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
904 Attribute::OptimizeNone)) {
905 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
906 Attribute::AlwaysInline),
907 "Attributes 'alwaysinline and optnone' are incompatible!", V);
909 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
910 Attribute::OptimizeForSize),
911 "Attributes 'optsize and optnone' are incompatible!", V);
913 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
915 "Attributes 'minsize and optnone' are incompatible!", V);
919 void Verifier::VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy) {
920 // Get the size of the types in bits, we'll need this later
921 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
922 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
924 // BitCast implies a no-op cast of type only. No bits change.
925 // However, you can't cast pointers to anything but pointers.
926 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
927 "Bitcast requires both operands to be pointer or neither", V);
928 Assert1(SrcBitSize == DestBitSize,
929 "Bitcast requires types of same width", V);
931 // Disallow aggregates.
932 Assert1(!SrcTy->isAggregateType(),
933 "Bitcast operand must not be aggregate", V);
934 Assert1(!DestTy->isAggregateType(),
935 "Bitcast type must not be aggregate", V);
937 // Without datalayout, assume all address spaces are the same size.
938 // Don't check if both types are not pointers.
939 // Skip casts between scalars and vectors.
941 !SrcTy->isPtrOrPtrVectorTy() ||
942 !DestTy->isPtrOrPtrVectorTy() ||
943 SrcTy->isVectorTy() != DestTy->isVectorTy()) {
947 unsigned SrcAS = SrcTy->getPointerAddressSpace();
948 unsigned DstAS = DestTy->getPointerAddressSpace();
950 unsigned SrcASSize = DL->getPointerSizeInBits(SrcAS);
951 unsigned DstASSize = DL->getPointerSizeInBits(DstAS);
952 Assert1(SrcASSize == DstASSize,
953 "Bitcasts between pointers of different address spaces must have "
954 "the same size pointers, otherwise use PtrToInt/IntToPtr.", V);
957 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
958 if (CE->getOpcode() == Instruction::BitCast) {
959 Type *SrcTy = CE->getOperand(0)->getType();
960 Type *DstTy = CE->getType();
961 VerifyBitcastType(CE, DstTy, SrcTy);
965 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
966 if (Attrs.getNumSlots() == 0)
969 unsigned LastSlot = Attrs.getNumSlots() - 1;
970 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
971 if (LastIndex <= Params
972 || (LastIndex == AttributeSet::FunctionIndex
973 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
979 // visitFunction - Verify that a function is ok.
981 void Verifier::visitFunction(Function &F) {
982 // Check function arguments.
983 FunctionType *FT = F.getFunctionType();
984 unsigned NumArgs = F.arg_size();
986 Assert1(Context == &F.getContext(),
987 "Function context does not match Module context!", &F);
989 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
990 Assert2(FT->getNumParams() == NumArgs,
991 "# formal arguments must match # of arguments for function type!",
993 Assert1(F.getReturnType()->isFirstClassType() ||
994 F.getReturnType()->isVoidTy() ||
995 F.getReturnType()->isStructTy(),
996 "Functions cannot return aggregate values!", &F);
998 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
999 "Invalid struct return type!", &F);
1001 AttributeSet Attrs = F.getAttributes();
1003 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1004 "Attribute after last parameter!", &F);
1006 // Check function attributes.
1007 VerifyFunctionAttrs(FT, Attrs, &F);
1009 // On function declarations/definitions, we do not support the builtin
1010 // attribute. We do not check this in VerifyFunctionAttrs since that is
1011 // checking for Attributes that can/can not ever be on functions.
1012 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1013 Attribute::Builtin),
1014 "Attribute 'builtin' can only be applied to a callsite.", &F);
1016 // Check that this function meets the restrictions on this calling convention.
1017 switch (F.getCallingConv()) {
1020 case CallingConv::C:
1022 case CallingConv::Fast:
1023 case CallingConv::Cold:
1024 case CallingConv::X86_FastCall:
1025 case CallingConv::X86_ThisCall:
1026 case CallingConv::Intel_OCL_BI:
1027 case CallingConv::PTX_Kernel:
1028 case CallingConv::PTX_Device:
1029 Assert1(!F.isVarArg(),
1030 "Varargs functions must have C calling conventions!", &F);
1034 bool isLLVMdotName = F.getName().size() >= 5 &&
1035 F.getName().substr(0, 5) == "llvm.";
1037 // Check that the argument values match the function type for this function...
1039 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
1041 Assert2(I->getType() == FT->getParamType(i),
1042 "Argument value does not match function argument type!",
1043 I, FT->getParamType(i));
1044 Assert1(I->getType()->isFirstClassType(),
1045 "Function arguments must have first-class types!", I);
1047 Assert2(!I->getType()->isMetadataTy(),
1048 "Function takes metadata but isn't an intrinsic", I, &F);
1051 if (F.isMaterializable()) {
1052 // Function has a body somewhere we can't see.
1053 } else if (F.isDeclaration()) {
1054 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
1055 F.hasExternalWeakLinkage(),
1056 "invalid linkage type for function declaration", &F);
1058 // Verify that this function (which has a body) is not named "llvm.*". It
1059 // is not legal to define intrinsics.
1060 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1062 // Check the entry node
1063 BasicBlock *Entry = &F.getEntryBlock();
1064 Assert1(pred_begin(Entry) == pred_end(Entry),
1065 "Entry block to function must not have predecessors!", Entry);
1067 // The address of the entry block cannot be taken, unless it is dead.
1068 if (Entry->hasAddressTaken()) {
1069 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
1070 "blockaddress may not be used with the entry block!", Entry);
1074 // If this function is actually an intrinsic, verify that it is only used in
1075 // direct call/invokes, never having its "address taken".
1076 if (F.getIntrinsicID()) {
1078 if (F.hasAddressTaken(&U))
1079 Assert1(0, "Invalid user of intrinsic instruction!", U);
1083 // verifyBasicBlock - Verify that a basic block is well formed...
1085 void Verifier::visitBasicBlock(BasicBlock &BB) {
1086 InstsInThisBlock.clear();
1088 // Ensure that basic blocks have terminators!
1089 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1091 // Check constraints that this basic block imposes on all of the PHI nodes in
1093 if (isa<PHINode>(BB.front())) {
1094 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1095 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1096 std::sort(Preds.begin(), Preds.end());
1098 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1099 // Ensure that PHI nodes have at least one entry!
1100 Assert1(PN->getNumIncomingValues() != 0,
1101 "PHI nodes must have at least one entry. If the block is dead, "
1102 "the PHI should be removed!", PN);
1103 Assert1(PN->getNumIncomingValues() == Preds.size(),
1104 "PHINode should have one entry for each predecessor of its "
1105 "parent basic block!", PN);
1107 // Get and sort all incoming values in the PHI node...
1109 Values.reserve(PN->getNumIncomingValues());
1110 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1111 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1112 PN->getIncomingValue(i)));
1113 std::sort(Values.begin(), Values.end());
1115 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1116 // Check to make sure that if there is more than one entry for a
1117 // particular basic block in this PHI node, that the incoming values are
1120 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1121 Values[i].second == Values[i-1].second,
1122 "PHI node has multiple entries for the same basic block with "
1123 "different incoming values!", PN, Values[i].first,
1124 Values[i].second, Values[i-1].second);
1126 // Check to make sure that the predecessors and PHI node entries are
1128 Assert3(Values[i].first == Preds[i],
1129 "PHI node entries do not match predecessors!", PN,
1130 Values[i].first, Preds[i]);
1136 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1137 // Ensure that terminators only exist at the end of the basic block.
1138 Assert1(&I == I.getParent()->getTerminator(),
1139 "Terminator found in the middle of a basic block!", I.getParent());
1140 visitInstruction(I);
1143 void Verifier::visitBranchInst(BranchInst &BI) {
1144 if (BI.isConditional()) {
1145 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1146 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1148 visitTerminatorInst(BI);
1151 void Verifier::visitReturnInst(ReturnInst &RI) {
1152 Function *F = RI.getParent()->getParent();
1153 unsigned N = RI.getNumOperands();
1154 if (F->getReturnType()->isVoidTy())
1156 "Found return instr that returns non-void in Function of void "
1157 "return type!", &RI, F->getReturnType());
1159 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1160 "Function return type does not match operand "
1161 "type of return inst!", &RI, F->getReturnType());
1163 // Check to make sure that the return value has necessary properties for
1165 visitTerminatorInst(RI);
1168 void Verifier::visitSwitchInst(SwitchInst &SI) {
1169 // Check to make sure that all of the constants in the switch instruction
1170 // have the same type as the switched-on value.
1171 Type *SwitchTy = SI.getCondition()->getType();
1172 SmallPtrSet<ConstantInt*, 32> Constants;
1173 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1174 Assert1(i.getCaseValue()->getType() == SwitchTy,
1175 "Switch constants must all be same type as switch value!", &SI);
1176 Assert2(Constants.insert(i.getCaseValue()),
1177 "Duplicate integer as switch case", &SI, i.getCaseValue());
1180 visitTerminatorInst(SI);
1183 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1184 Assert1(BI.getAddress()->getType()->isPointerTy(),
1185 "Indirectbr operand must have pointer type!", &BI);
1186 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1187 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1188 "Indirectbr destinations must all have pointer type!", &BI);
1190 visitTerminatorInst(BI);
1193 void Verifier::visitSelectInst(SelectInst &SI) {
1194 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1196 "Invalid operands for select instruction!", &SI);
1198 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1199 "Select values must have same type as select instruction!", &SI);
1200 visitInstruction(SI);
1203 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1204 /// a pass, if any exist, it's an error.
1206 void Verifier::visitUserOp1(Instruction &I) {
1207 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1210 void Verifier::visitTruncInst(TruncInst &I) {
1211 // Get the source and destination types
1212 Type *SrcTy = I.getOperand(0)->getType();
1213 Type *DestTy = I.getType();
1215 // Get the size of the types in bits, we'll need this later
1216 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1217 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1219 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1220 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1221 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1222 "trunc source and destination must both be a vector or neither", &I);
1223 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1225 visitInstruction(I);
1228 void Verifier::visitZExtInst(ZExtInst &I) {
1229 // Get the source and destination types
1230 Type *SrcTy = I.getOperand(0)->getType();
1231 Type *DestTy = I.getType();
1233 // Get the size of the types in bits, we'll need this later
1234 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1235 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1236 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1237 "zext source and destination must both be a vector or neither", &I);
1238 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1239 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1241 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1243 visitInstruction(I);
1246 void Verifier::visitSExtInst(SExtInst &I) {
1247 // Get the source and destination types
1248 Type *SrcTy = I.getOperand(0)->getType();
1249 Type *DestTy = I.getType();
1251 // Get the size of the types in bits, we'll need this later
1252 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1253 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1255 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1256 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1257 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1258 "sext source and destination must both be a vector or neither", &I);
1259 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1261 visitInstruction(I);
1264 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1265 // Get the source and destination types
1266 Type *SrcTy = I.getOperand(0)->getType();
1267 Type *DestTy = I.getType();
1268 // Get the size of the types in bits, we'll need this later
1269 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1270 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1272 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1273 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1274 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1275 "fptrunc source and destination must both be a vector or neither",&I);
1276 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1278 visitInstruction(I);
1281 void Verifier::visitFPExtInst(FPExtInst &I) {
1282 // Get the source and destination types
1283 Type *SrcTy = I.getOperand(0)->getType();
1284 Type *DestTy = I.getType();
1286 // Get the size of the types in bits, we'll need this later
1287 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1288 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1290 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1291 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1292 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1293 "fpext source and destination must both be a vector or neither", &I);
1294 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1296 visitInstruction(I);
1299 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1300 // Get the source and destination types
1301 Type *SrcTy = I.getOperand(0)->getType();
1302 Type *DestTy = I.getType();
1304 bool SrcVec = SrcTy->isVectorTy();
1305 bool DstVec = DestTy->isVectorTy();
1307 Assert1(SrcVec == DstVec,
1308 "UIToFP source and dest must both be vector or scalar", &I);
1309 Assert1(SrcTy->isIntOrIntVectorTy(),
1310 "UIToFP source must be integer or integer vector", &I);
1311 Assert1(DestTy->isFPOrFPVectorTy(),
1312 "UIToFP result must be FP or FP vector", &I);
1314 if (SrcVec && DstVec)
1315 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1316 cast<VectorType>(DestTy)->getNumElements(),
1317 "UIToFP source and dest vector length mismatch", &I);
1319 visitInstruction(I);
1322 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1323 // Get the source and destination types
1324 Type *SrcTy = I.getOperand(0)->getType();
1325 Type *DestTy = I.getType();
1327 bool SrcVec = SrcTy->isVectorTy();
1328 bool DstVec = DestTy->isVectorTy();
1330 Assert1(SrcVec == DstVec,
1331 "SIToFP source and dest must both be vector or scalar", &I);
1332 Assert1(SrcTy->isIntOrIntVectorTy(),
1333 "SIToFP source must be integer or integer vector", &I);
1334 Assert1(DestTy->isFPOrFPVectorTy(),
1335 "SIToFP result must be FP or FP vector", &I);
1337 if (SrcVec && DstVec)
1338 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1339 cast<VectorType>(DestTy)->getNumElements(),
1340 "SIToFP source and dest vector length mismatch", &I);
1342 visitInstruction(I);
1345 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1346 // Get the source and destination types
1347 Type *SrcTy = I.getOperand(0)->getType();
1348 Type *DestTy = I.getType();
1350 bool SrcVec = SrcTy->isVectorTy();
1351 bool DstVec = DestTy->isVectorTy();
1353 Assert1(SrcVec == DstVec,
1354 "FPToUI source and dest must both be vector or scalar", &I);
1355 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1357 Assert1(DestTy->isIntOrIntVectorTy(),
1358 "FPToUI result must be integer or integer vector", &I);
1360 if (SrcVec && DstVec)
1361 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1362 cast<VectorType>(DestTy)->getNumElements(),
1363 "FPToUI source and dest vector length mismatch", &I);
1365 visitInstruction(I);
1368 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1369 // Get the source and destination types
1370 Type *SrcTy = I.getOperand(0)->getType();
1371 Type *DestTy = I.getType();
1373 bool SrcVec = SrcTy->isVectorTy();
1374 bool DstVec = DestTy->isVectorTy();
1376 Assert1(SrcVec == DstVec,
1377 "FPToSI source and dest must both be vector or scalar", &I);
1378 Assert1(SrcTy->isFPOrFPVectorTy(),
1379 "FPToSI source must be FP or FP vector", &I);
1380 Assert1(DestTy->isIntOrIntVectorTy(),
1381 "FPToSI result must be integer or integer vector", &I);
1383 if (SrcVec && DstVec)
1384 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1385 cast<VectorType>(DestTy)->getNumElements(),
1386 "FPToSI source and dest vector length mismatch", &I);
1388 visitInstruction(I);
1391 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1392 // Get the source and destination types
1393 Type *SrcTy = I.getOperand(0)->getType();
1394 Type *DestTy = I.getType();
1396 Assert1(SrcTy->getScalarType()->isPointerTy(),
1397 "PtrToInt source must be pointer", &I);
1398 Assert1(DestTy->getScalarType()->isIntegerTy(),
1399 "PtrToInt result must be integral", &I);
1400 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1401 "PtrToInt type mismatch", &I);
1403 if (SrcTy->isVectorTy()) {
1404 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1405 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1406 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1407 "PtrToInt Vector width mismatch", &I);
1410 visitInstruction(I);
1413 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1414 // Get the source and destination types
1415 Type *SrcTy = I.getOperand(0)->getType();
1416 Type *DestTy = I.getType();
1418 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1419 "IntToPtr source must be an integral", &I);
1420 Assert1(DestTy->getScalarType()->isPointerTy(),
1421 "IntToPtr result must be a pointer",&I);
1422 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1423 "IntToPtr type mismatch", &I);
1424 if (SrcTy->isVectorTy()) {
1425 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1426 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1427 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1428 "IntToPtr Vector width mismatch", &I);
1430 visitInstruction(I);
1433 void Verifier::visitBitCastInst(BitCastInst &I) {
1434 Type *SrcTy = I.getOperand(0)->getType();
1435 Type *DestTy = I.getType();
1436 VerifyBitcastType(&I, DestTy, SrcTy);
1437 visitInstruction(I);
1440 /// visitPHINode - Ensure that a PHI node is well formed.
1442 void Verifier::visitPHINode(PHINode &PN) {
1443 // Ensure that the PHI nodes are all grouped together at the top of the block.
1444 // This can be tested by checking whether the instruction before this is
1445 // either nonexistent (because this is begin()) or is a PHI node. If not,
1446 // then there is some other instruction before a PHI.
1447 Assert2(&PN == &PN.getParent()->front() ||
1448 isa<PHINode>(--BasicBlock::iterator(&PN)),
1449 "PHI nodes not grouped at top of basic block!",
1450 &PN, PN.getParent());
1452 // Check that all of the values of the PHI node have the same type as the
1453 // result, and that the incoming blocks are really basic blocks.
1454 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1455 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1456 "PHI node operands are not the same type as the result!", &PN);
1459 // All other PHI node constraints are checked in the visitBasicBlock method.
1461 visitInstruction(PN);
1464 void Verifier::VerifyCallSite(CallSite CS) {
1465 Instruction *I = CS.getInstruction();
1467 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1468 "Called function must be a pointer!", I);
1469 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1471 Assert1(FPTy->getElementType()->isFunctionTy(),
1472 "Called function is not pointer to function type!", I);
1473 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1475 // Verify that the correct number of arguments are being passed
1476 if (FTy->isVarArg())
1477 Assert1(CS.arg_size() >= FTy->getNumParams(),
1478 "Called function requires more parameters than were provided!",I);
1480 Assert1(CS.arg_size() == FTy->getNumParams(),
1481 "Incorrect number of arguments passed to called function!", I);
1483 // Verify that all arguments to the call match the function type.
1484 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1485 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1486 "Call parameter type does not match function signature!",
1487 CS.getArgument(i), FTy->getParamType(i), I);
1489 AttributeSet Attrs = CS.getAttributes();
1491 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1492 "Attribute after last parameter!", I);
1494 // Verify call attributes.
1495 VerifyFunctionAttrs(FTy, Attrs, I);
1497 if (FTy->isVarArg()) {
1498 // FIXME? is 'nest' even legal here?
1499 bool SawNest = false;
1500 bool SawReturned = false;
1502 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1503 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1505 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1509 // Check attributes on the varargs part.
1510 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1511 Type *Ty = CS.getArgument(Idx-1)->getType();
1512 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1514 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1515 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1519 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1520 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1522 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1523 "Incompatible argument and return types for 'returned' "
1528 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1529 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1533 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1534 if (CS.getCalledFunction() == 0 ||
1535 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1536 for (FunctionType::param_iterator PI = FTy->param_begin(),
1537 PE = FTy->param_end(); PI != PE; ++PI)
1538 Assert1(!(*PI)->isMetadataTy(),
1539 "Function has metadata parameter but isn't an intrinsic", I);
1542 visitInstruction(*I);
1545 void Verifier::visitCallInst(CallInst &CI) {
1546 VerifyCallSite(&CI);
1548 if (Function *F = CI.getCalledFunction())
1549 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1550 visitIntrinsicFunctionCall(ID, CI);
1553 void Verifier::visitInvokeInst(InvokeInst &II) {
1554 VerifyCallSite(&II);
1556 // Verify that there is a landingpad instruction as the first non-PHI
1557 // instruction of the 'unwind' destination.
1558 Assert1(II.getUnwindDest()->isLandingPad(),
1559 "The unwind destination does not have a landingpad instruction!",&II);
1561 visitTerminatorInst(II);
1564 /// visitBinaryOperator - Check that both arguments to the binary operator are
1565 /// of the same type!
1567 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1568 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1569 "Both operands to a binary operator are not of the same type!", &B);
1571 switch (B.getOpcode()) {
1572 // Check that integer arithmetic operators are only used with
1573 // integral operands.
1574 case Instruction::Add:
1575 case Instruction::Sub:
1576 case Instruction::Mul:
1577 case Instruction::SDiv:
1578 case Instruction::UDiv:
1579 case Instruction::SRem:
1580 case Instruction::URem:
1581 Assert1(B.getType()->isIntOrIntVectorTy(),
1582 "Integer arithmetic operators only work with integral types!", &B);
1583 Assert1(B.getType() == B.getOperand(0)->getType(),
1584 "Integer arithmetic operators must have same type "
1585 "for operands and result!", &B);
1587 // Check that floating-point arithmetic operators are only used with
1588 // floating-point operands.
1589 case Instruction::FAdd:
1590 case Instruction::FSub:
1591 case Instruction::FMul:
1592 case Instruction::FDiv:
1593 case Instruction::FRem:
1594 Assert1(B.getType()->isFPOrFPVectorTy(),
1595 "Floating-point arithmetic operators only work with "
1596 "floating-point types!", &B);
1597 Assert1(B.getType() == B.getOperand(0)->getType(),
1598 "Floating-point arithmetic operators must have same type "
1599 "for operands and result!", &B);
1601 // Check that logical operators are only used with integral operands.
1602 case Instruction::And:
1603 case Instruction::Or:
1604 case Instruction::Xor:
1605 Assert1(B.getType()->isIntOrIntVectorTy(),
1606 "Logical operators only work with integral types!", &B);
1607 Assert1(B.getType() == B.getOperand(0)->getType(),
1608 "Logical operators must have same type for operands and result!",
1611 case Instruction::Shl:
1612 case Instruction::LShr:
1613 case Instruction::AShr:
1614 Assert1(B.getType()->isIntOrIntVectorTy(),
1615 "Shifts only work with integral types!", &B);
1616 Assert1(B.getType() == B.getOperand(0)->getType(),
1617 "Shift return type must be same as operands!", &B);
1620 llvm_unreachable("Unknown BinaryOperator opcode!");
1623 visitInstruction(B);
1626 void Verifier::visitICmpInst(ICmpInst &IC) {
1627 // Check that the operands are the same type
1628 Type *Op0Ty = IC.getOperand(0)->getType();
1629 Type *Op1Ty = IC.getOperand(1)->getType();
1630 Assert1(Op0Ty == Op1Ty,
1631 "Both operands to ICmp instruction are not of the same type!", &IC);
1632 // Check that the operands are the right type
1633 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1634 "Invalid operand types for ICmp instruction", &IC);
1635 // Check that the predicate is valid.
1636 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1637 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1638 "Invalid predicate in ICmp instruction!", &IC);
1640 visitInstruction(IC);
1643 void Verifier::visitFCmpInst(FCmpInst &FC) {
1644 // Check that the operands are the same type
1645 Type *Op0Ty = FC.getOperand(0)->getType();
1646 Type *Op1Ty = FC.getOperand(1)->getType();
1647 Assert1(Op0Ty == Op1Ty,
1648 "Both operands to FCmp instruction are not of the same type!", &FC);
1649 // Check that the operands are the right type
1650 Assert1(Op0Ty->isFPOrFPVectorTy(),
1651 "Invalid operand types for FCmp instruction", &FC);
1652 // Check that the predicate is valid.
1653 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1654 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1655 "Invalid predicate in FCmp instruction!", &FC);
1657 visitInstruction(FC);
1660 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1661 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1663 "Invalid extractelement operands!", &EI);
1664 visitInstruction(EI);
1667 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1668 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1671 "Invalid insertelement operands!", &IE);
1672 visitInstruction(IE);
1675 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1676 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1678 "Invalid shufflevector operands!", &SV);
1679 visitInstruction(SV);
1682 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1683 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1685 Assert1(isa<PointerType>(TargetTy),
1686 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1687 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1688 "GEP into unsized type!", &GEP);
1689 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1690 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1693 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1695 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1696 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1698 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1699 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1700 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1702 if (GEP.getPointerOperandType()->isVectorTy()) {
1703 // Additional checks for vector GEPs.
1704 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1705 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1706 "Vector GEP result width doesn't match operand's", &GEP);
1707 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1708 Type *IndexTy = Idxs[i]->getType();
1709 Assert1(IndexTy->isVectorTy(),
1710 "Vector GEP must have vector indices!", &GEP);
1711 unsigned IndexWidth = IndexTy->getVectorNumElements();
1712 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1715 visitInstruction(GEP);
1718 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1719 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1722 void Verifier::visitLoadInst(LoadInst &LI) {
1723 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1724 Assert1(PTy, "Load operand must be a pointer.", &LI);
1725 Type *ElTy = PTy->getElementType();
1726 Assert2(ElTy == LI.getType(),
1727 "Load result type does not match pointer operand type!", &LI, ElTy);
1728 if (LI.isAtomic()) {
1729 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1730 "Load cannot have Release ordering", &LI);
1731 Assert1(LI.getAlignment() != 0,
1732 "Atomic load must specify explicit alignment", &LI);
1733 if (!ElTy->isPointerTy()) {
1734 Assert2(ElTy->isIntegerTy(),
1735 "atomic store operand must have integer type!",
1737 unsigned Size = ElTy->getPrimitiveSizeInBits();
1738 Assert2(Size >= 8 && !(Size & (Size - 1)),
1739 "atomic store operand must be power-of-two byte-sized integer",
1743 Assert1(LI.getSynchScope() == CrossThread,
1744 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1747 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1748 unsigned NumOperands = Range->getNumOperands();
1749 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1750 unsigned NumRanges = NumOperands / 2;
1751 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1753 ConstantRange LastRange(1); // Dummy initial value
1754 for (unsigned i = 0; i < NumRanges; ++i) {
1755 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1756 Assert1(Low, "The lower limit must be an integer!", Low);
1757 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1758 Assert1(High, "The upper limit must be an integer!", High);
1759 Assert1(High->getType() == Low->getType() &&
1760 High->getType() == ElTy, "Range types must match load type!",
1763 APInt HighV = High->getValue();
1764 APInt LowV = Low->getValue();
1765 ConstantRange CurRange(LowV, HighV);
1766 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1767 "Range must not be empty!", Range);
1769 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1770 "Intervals are overlapping", Range);
1771 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1773 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1776 LastRange = ConstantRange(LowV, HighV);
1778 if (NumRanges > 2) {
1780 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1782 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1783 ConstantRange FirstRange(FirstLow, FirstHigh);
1784 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1785 "Intervals are overlapping", Range);
1786 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1793 visitInstruction(LI);
1796 void Verifier::visitStoreInst(StoreInst &SI) {
1797 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1798 Assert1(PTy, "Store operand must be a pointer.", &SI);
1799 Type *ElTy = PTy->getElementType();
1800 Assert2(ElTy == SI.getOperand(0)->getType(),
1801 "Stored value type does not match pointer operand type!",
1803 if (SI.isAtomic()) {
1804 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1805 "Store cannot have Acquire ordering", &SI);
1806 Assert1(SI.getAlignment() != 0,
1807 "Atomic store must specify explicit alignment", &SI);
1808 if (!ElTy->isPointerTy()) {
1809 Assert2(ElTy->isIntegerTy(),
1810 "atomic store operand must have integer type!",
1812 unsigned Size = ElTy->getPrimitiveSizeInBits();
1813 Assert2(Size >= 8 && !(Size & (Size - 1)),
1814 "atomic store operand must be power-of-two byte-sized integer",
1818 Assert1(SI.getSynchScope() == CrossThread,
1819 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1821 visitInstruction(SI);
1824 void Verifier::visitAllocaInst(AllocaInst &AI) {
1825 PointerType *PTy = AI.getType();
1826 Assert1(PTy->getAddressSpace() == 0,
1827 "Allocation instruction pointer not in the generic address space!",
1829 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1831 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
1832 "Alloca array size must have integer type", &AI);
1833 visitInstruction(AI);
1836 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
1837 Assert1(CXI.getOrdering() != NotAtomic,
1838 "cmpxchg instructions must be atomic.", &CXI);
1839 Assert1(CXI.getOrdering() != Unordered,
1840 "cmpxchg instructions cannot be unordered.", &CXI);
1841 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
1842 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
1843 Type *ElTy = PTy->getElementType();
1844 Assert2(ElTy->isIntegerTy(),
1845 "cmpxchg operand must have integer type!",
1847 unsigned Size = ElTy->getPrimitiveSizeInBits();
1848 Assert2(Size >= 8 && !(Size & (Size - 1)),
1849 "cmpxchg operand must be power-of-two byte-sized integer",
1851 Assert2(ElTy == CXI.getOperand(1)->getType(),
1852 "Expected value type does not match pointer operand type!",
1854 Assert2(ElTy == CXI.getOperand(2)->getType(),
1855 "Stored value type does not match pointer operand type!",
1857 visitInstruction(CXI);
1860 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
1861 Assert1(RMWI.getOrdering() != NotAtomic,
1862 "atomicrmw instructions must be atomic.", &RMWI);
1863 Assert1(RMWI.getOrdering() != Unordered,
1864 "atomicrmw instructions cannot be unordered.", &RMWI);
1865 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
1866 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
1867 Type *ElTy = PTy->getElementType();
1868 Assert2(ElTy->isIntegerTy(),
1869 "atomicrmw operand must have integer type!",
1871 unsigned Size = ElTy->getPrimitiveSizeInBits();
1872 Assert2(Size >= 8 && !(Size & (Size - 1)),
1873 "atomicrmw operand must be power-of-two byte-sized integer",
1875 Assert2(ElTy == RMWI.getOperand(1)->getType(),
1876 "Argument value type does not match pointer operand type!",
1878 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
1879 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
1880 "Invalid binary operation!", &RMWI);
1881 visitInstruction(RMWI);
1884 void Verifier::visitFenceInst(FenceInst &FI) {
1885 const AtomicOrdering Ordering = FI.getOrdering();
1886 Assert1(Ordering == Acquire || Ordering == Release ||
1887 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
1888 "fence instructions may only have "
1889 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
1890 visitInstruction(FI);
1893 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1894 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1895 EVI.getIndices()) ==
1897 "Invalid ExtractValueInst operands!", &EVI);
1899 visitInstruction(EVI);
1902 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1903 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1904 IVI.getIndices()) ==
1905 IVI.getOperand(1)->getType(),
1906 "Invalid InsertValueInst operands!", &IVI);
1908 visitInstruction(IVI);
1911 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
1912 BasicBlock *BB = LPI.getParent();
1914 // The landingpad instruction is ill-formed if it doesn't have any clauses and
1916 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
1917 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
1919 // The landingpad instruction defines its parent as a landing pad block. The
1920 // landing pad block may be branched to only by the unwind edge of an invoke.
1921 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
1922 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
1923 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
1924 "Block containing LandingPadInst must be jumped to "
1925 "only by the unwind edge of an invoke.", &LPI);
1928 // The landingpad instruction must be the first non-PHI instruction in the
1930 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
1931 "LandingPadInst not the first non-PHI instruction in the block.",
1934 // The personality functions for all landingpad instructions within the same
1935 // function should match.
1937 Assert1(LPI.getPersonalityFn() == PersonalityFn,
1938 "Personality function doesn't match others in function", &LPI);
1939 PersonalityFn = LPI.getPersonalityFn();
1941 // All operands must be constants.
1942 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
1944 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
1945 Value *Clause = LPI.getClause(i);
1946 Assert1(isa<Constant>(Clause), "Clause is not constant!", &LPI);
1947 if (LPI.isCatch(i)) {
1948 Assert1(isa<PointerType>(Clause->getType()),
1949 "Catch operand does not have pointer type!", &LPI);
1951 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
1952 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
1953 "Filter operand is not an array of constants!", &LPI);
1957 visitInstruction(LPI);
1960 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
1961 Instruction *Op = cast<Instruction>(I.getOperand(i));
1962 // If the we have an invalid invoke, don't try to compute the dominance.
1963 // We already reject it in the invoke specific checks and the dominance
1964 // computation doesn't handle multiple edges.
1965 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1966 if (II->getNormalDest() == II->getUnwindDest())
1970 const Use &U = I.getOperandUse(i);
1971 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, U),
1972 "Instruction does not dominate all uses!", Op, &I);
1975 /// verifyInstruction - Verify that an instruction is well formed.
1977 void Verifier::visitInstruction(Instruction &I) {
1978 BasicBlock *BB = I.getParent();
1979 Assert1(BB, "Instruction not embedded in basic block!", &I);
1981 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1982 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1984 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
1985 "Only PHI nodes may reference their own value!", &I);
1988 // Check that void typed values don't have names
1989 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1990 "Instruction has a name, but provides a void value!", &I);
1992 // Check that the return value of the instruction is either void or a legal
1994 Assert1(I.getType()->isVoidTy() ||
1995 I.getType()->isFirstClassType(),
1996 "Instruction returns a non-scalar type!", &I);
1998 // Check that the instruction doesn't produce metadata. Calls are already
1999 // checked against the callee type.
2000 Assert1(!I.getType()->isMetadataTy() ||
2001 isa<CallInst>(I) || isa<InvokeInst>(I),
2002 "Invalid use of metadata!", &I);
2004 // Check that all uses of the instruction, if they are instructions
2005 // themselves, actually have parent basic blocks. If the use is not an
2006 // instruction, it is an error!
2007 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
2009 if (Instruction *Used = dyn_cast<Instruction>(*UI))
2010 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
2011 " embedded in a basic block!", &I, Used);
2013 CheckFailed("Use of instruction is not an instruction!", *UI);
2018 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2019 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
2021 // Check to make sure that only first-class-values are operands to
2023 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2024 Assert1(0, "Instruction operands must be first-class values!", &I);
2027 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2028 // Check to make sure that the "address of" an intrinsic function is never
2030 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
2031 "Cannot take the address of an intrinsic!", &I);
2032 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2033 F->getIntrinsicID() == Intrinsic::donothing,
2034 "Cannot invoke an intrinsinc other than donothing", &I);
2035 Assert1(F->getParent() == Mod, "Referencing function in another module!",
2037 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2038 Assert1(OpBB->getParent() == BB->getParent(),
2039 "Referring to a basic block in another function!", &I);
2040 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2041 Assert1(OpArg->getParent() == BB->getParent(),
2042 "Referring to an argument in another function!", &I);
2043 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2044 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
2046 } else if (isa<Instruction>(I.getOperand(i))) {
2047 verifyDominatesUse(I, i);
2048 } else if (isa<InlineAsm>(I.getOperand(i))) {
2049 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2050 (i + 3 == e && isa<InvokeInst>(I)),
2051 "Cannot take the address of an inline asm!", &I);
2052 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2053 if (CE->getType()->isPtrOrPtrVectorTy()) {
2054 // If we have a ConstantExpr pointer, we need to see if it came from an
2055 // illegal bitcast (inttoptr <constant int> )
2056 SmallVector<const ConstantExpr *, 4> Stack;
2057 SmallPtrSet<const ConstantExpr *, 4> Visited;
2058 Stack.push_back(CE);
2060 while (!Stack.empty()) {
2061 const ConstantExpr *V = Stack.pop_back_val();
2062 if (!Visited.insert(V))
2065 VerifyConstantExprBitcastType(V);
2067 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2068 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2069 Stack.push_back(Op);
2076 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2077 Assert1(I.getType()->isFPOrFPVectorTy(),
2078 "fpmath requires a floating point result!", &I);
2079 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2080 Value *Op0 = MD->getOperand(0);
2081 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
2082 APFloat Accuracy = CFP0->getValueAPF();
2083 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2084 "fpmath accuracy not a positive number!", &I);
2086 Assert1(false, "invalid fpmath accuracy!", &I);
2090 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
2091 Assert1(!MD || isa<LoadInst>(I), "Ranges are only for loads!", &I);
2093 if (!DisableDebugInfoVerifier) {
2094 MD = I.getMetadata(LLVMContext::MD_dbg);
2095 Finder.processLocation(DILocation(MD));
2098 InstsInThisBlock.insert(&I);
2101 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2102 /// intrinsic argument or return value) matches the type constraints specified
2103 /// by the .td file (e.g. an "any integer" argument really is an integer).
2105 /// This return true on error but does not print a message.
2106 bool Verifier::VerifyIntrinsicType(Type *Ty,
2107 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2108 SmallVectorImpl<Type*> &ArgTys) {
2109 using namespace Intrinsic;
2111 // If we ran out of descriptors, there are too many arguments.
2112 if (Infos.empty()) return true;
2113 IITDescriptor D = Infos.front();
2114 Infos = Infos.slice(1);
2117 case IITDescriptor::Void: return !Ty->isVoidTy();
2118 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2119 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2120 case IITDescriptor::Half: return !Ty->isHalfTy();
2121 case IITDescriptor::Float: return !Ty->isFloatTy();
2122 case IITDescriptor::Double: return !Ty->isDoubleTy();
2123 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2124 case IITDescriptor::Vector: {
2125 VectorType *VT = dyn_cast<VectorType>(Ty);
2126 return VT == 0 || VT->getNumElements() != D.Vector_Width ||
2127 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2129 case IITDescriptor::Pointer: {
2130 PointerType *PT = dyn_cast<PointerType>(Ty);
2131 return PT == 0 || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2132 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2135 case IITDescriptor::Struct: {
2136 StructType *ST = dyn_cast<StructType>(Ty);
2137 if (ST == 0 || ST->getNumElements() != D.Struct_NumElements)
2140 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2141 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2146 case IITDescriptor::Argument:
2147 // Two cases here - If this is the second occurrence of an argument, verify
2148 // that the later instance matches the previous instance.
2149 if (D.getArgumentNumber() < ArgTys.size())
2150 return Ty != ArgTys[D.getArgumentNumber()];
2152 // Otherwise, if this is the first instance of an argument, record it and
2153 // verify the "Any" kind.
2154 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2155 ArgTys.push_back(Ty);
2157 switch (D.getArgumentKind()) {
2158 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2159 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2160 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2161 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2163 llvm_unreachable("all argument kinds not covered");
2165 case IITDescriptor::ExtendVecArgument:
2166 // This may only be used when referring to a previous vector argument.
2167 return D.getArgumentNumber() >= ArgTys.size() ||
2168 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2169 VectorType::getExtendedElementVectorType(
2170 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2172 case IITDescriptor::TruncVecArgument:
2173 // This may only be used when referring to a previous vector argument.
2174 return D.getArgumentNumber() >= ArgTys.size() ||
2175 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2176 VectorType::getTruncatedElementVectorType(
2177 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2179 llvm_unreachable("unhandled");
2182 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2184 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2185 Function *IF = CI.getCalledFunction();
2186 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2189 // Verify that the intrinsic prototype lines up with what the .td files
2191 FunctionType *IFTy = IF->getFunctionType();
2192 Assert1(!IFTy->isVarArg(), "Intrinsic prototypes are not varargs", IF);
2194 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2195 getIntrinsicInfoTableEntries(ID, Table);
2196 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2198 SmallVector<Type *, 4> ArgTys;
2199 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2200 "Intrinsic has incorrect return type!", IF);
2201 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2202 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2203 "Intrinsic has incorrect argument type!", IF);
2204 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2206 // Now that we have the intrinsic ID and the actual argument types (and we
2207 // know they are legal for the intrinsic!) get the intrinsic name through the
2208 // usual means. This allows us to verify the mangling of argument types into
2210 Assert1(Intrinsic::getName(ID, ArgTys) == IF->getName(),
2211 "Intrinsic name not mangled correctly for type arguments!", IF);
2213 // If the intrinsic takes MDNode arguments, verify that they are either global
2214 // or are local to *this* function.
2215 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2216 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
2217 visitMDNode(*MD, CI.getParent()->getParent());
2222 case Intrinsic::ctlz: // llvm.ctlz
2223 case Intrinsic::cttz: // llvm.cttz
2224 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2225 "is_zero_undef argument of bit counting intrinsics must be a "
2226 "constant int", &CI);
2228 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2229 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2230 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2231 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
2232 Assert1(MD->getNumOperands() == 1,
2233 "invalid llvm.dbg.declare intrinsic call 2", &CI);
2234 if (!DisableDebugInfoVerifier)
2235 Finder.processDeclare(cast<DbgDeclareInst>(&CI));
2237 case Intrinsic::dbg_value: { //llvm.dbg.value
2238 if (!DisableDebugInfoVerifier) {
2239 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2240 "invalid llvm.dbg.value intrinsic call 1", &CI);
2241 Finder.processValue(cast<DbgValueInst>(&CI));
2245 case Intrinsic::memcpy:
2246 case Intrinsic::memmove:
2247 case Intrinsic::memset:
2248 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2249 "alignment argument of memory intrinsics must be a constant int",
2251 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2252 "isvolatile argument of memory intrinsics must be a constant int",
2255 case Intrinsic::gcroot:
2256 case Intrinsic::gcwrite:
2257 case Intrinsic::gcread:
2258 if (ID == Intrinsic::gcroot) {
2260 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2261 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2262 Assert1(isa<Constant>(CI.getArgOperand(1)),
2263 "llvm.gcroot parameter #2 must be a constant.", &CI);
2264 if (!AI->getType()->getElementType()->isPointerTy()) {
2265 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2266 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2267 "or argument #2 must be a non-null constant.", &CI);
2271 Assert1(CI.getParent()->getParent()->hasGC(),
2272 "Enclosing function does not use GC.", &CI);
2274 case Intrinsic::init_trampoline:
2275 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2276 "llvm.init_trampoline parameter #2 must resolve to a function.",
2279 case Intrinsic::prefetch:
2280 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2281 isa<ConstantInt>(CI.getArgOperand(2)) &&
2282 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2283 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2284 "invalid arguments to llvm.prefetch",
2287 case Intrinsic::stackprotector:
2288 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2289 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2292 case Intrinsic::lifetime_start:
2293 case Intrinsic::lifetime_end:
2294 case Intrinsic::invariant_start:
2295 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2296 "size argument of memory use markers must be a constant integer",
2299 case Intrinsic::invariant_end:
2300 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2301 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2306 void Verifier::verifyDebugInfo(Module &M) {
2307 // Verify Debug Info.
2308 if (!DisableDebugInfoVerifier) {
2309 for (DebugInfoFinder::iterator I = Finder.compile_unit_begin(),
2310 E = Finder.compile_unit_end(); I != E; ++I)
2311 Assert1(DICompileUnit(*I).Verify(), "DICompileUnit does not Verify!", *I);
2312 for (DebugInfoFinder::iterator I = Finder.subprogram_begin(),
2313 E = Finder.subprogram_end(); I != E; ++I)
2314 Assert1(DISubprogram(*I).Verify(), "DISubprogram does not Verify!", *I);
2315 for (DebugInfoFinder::iterator I = Finder.global_variable_begin(),
2316 E = Finder.global_variable_end(); I != E; ++I)
2317 Assert1(DIGlobalVariable(*I).Verify(),
2318 "DIGlobalVariable does not Verify!", *I);
2319 for (DebugInfoFinder::iterator I = Finder.type_begin(),
2320 E = Finder.type_end(); I != E; ++I)
2321 Assert1(DIType(*I).Verify(), "DIType does not Verify!", *I);
2322 for (DebugInfoFinder::iterator I = Finder.scope_begin(),
2323 E = Finder.scope_end(); I != E; ++I)
2324 Assert1(DIScope(*I).Verify(), "DIScope does not Verify!", *I);
2328 //===----------------------------------------------------------------------===//
2329 // Implement the public interfaces to this file...
2330 //===----------------------------------------------------------------------===//
2332 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
2333 return new Verifier(action);
2337 /// verifyFunction - Check a function for errors, printing messages on stderr.
2338 /// Return true if the function is corrupt.
2340 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
2341 Function &F = const_cast<Function&>(f);
2342 assert(!F.isDeclaration() && "Cannot verify external functions");
2344 FunctionPassManager FPM(F.getParent());
2345 Verifier *V = new Verifier(action);
2351 /// verifyModule - Check a module for errors, printing messages on stderr.
2352 /// Return true if the module is corrupt.
2354 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
2355 std::string *ErrorInfo) {
2357 Verifier *V = new Verifier(action);
2359 PM.run(const_cast<Module&>(M));
2361 if (ErrorInfo && V->Broken)
2362 *ErrorInfo = V->MessagesStr.str();