1 //===-- Verifier.cpp - Implement the Module Verifier -------------*- C++ -*-==//
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 // * All other things that are tested by asserts spread about the code...
40 //===----------------------------------------------------------------------===//
42 #include "llvm/Analysis/Verifier.h"
43 #include "llvm/CallingConv.h"
44 #include "llvm/Constants.h"
45 #include "llvm/DerivedTypes.h"
46 #include "llvm/InlineAsm.h"
47 #include "llvm/IntrinsicInst.h"
48 #include "llvm/Metadata.h"
49 #include "llvm/Module.h"
50 #include "llvm/ModuleProvider.h"
51 #include "llvm/Pass.h"
52 #include "llvm/PassManager.h"
53 #include "llvm/TypeSymbolTable.h"
54 #include "llvm/Analysis/Dominators.h"
55 #include "llvm/Assembly/Writer.h"
56 #include "llvm/CodeGen/ValueTypes.h"
57 #include "llvm/Support/CallSite.h"
58 #include "llvm/Support/CFG.h"
59 #include "llvm/Support/InstVisitor.h"
60 #include "llvm/ADT/SetVector.h"
61 #include "llvm/ADT/SmallPtrSet.h"
62 #include "llvm/ADT/SmallVector.h"
63 #include "llvm/ADT/StringExtras.h"
64 #include "llvm/ADT/STLExtras.h"
65 #include "llvm/Support/ErrorHandling.h"
66 #include "llvm/Support/raw_ostream.h"
71 namespace { // Anonymous namespace for class
72 struct PreVerifier : public FunctionPass {
73 static char ID; // Pass ID, replacement for typeid
75 PreVerifier() : FunctionPass(&ID) { }
77 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
81 // Check that the prerequisites for successful DominatorTree construction
83 bool runOnFunction(Function &F) {
86 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
87 if (I->empty() || !I->back().isTerminator()) {
88 errs() << "Basic Block does not have terminator!\n";
89 WriteAsOperand(errs(), I, true);
96 llvm_report_error("Broken module, no Basic Block terminator!");
103 char PreVerifier::ID = 0;
104 static RegisterPass<PreVerifier>
105 PreVer("preverify", "Preliminary module verification");
106 static const PassInfo *const PreVerifyID = &PreVer;
109 class TypeSet : public AbstractTypeUser {
113 /// Insert a type into the set of types.
114 bool insert(const Type *Ty) {
115 if (!Types.insert(Ty))
117 if (Ty->isAbstract())
118 Ty->addAbstractTypeUser(this);
122 // Remove ourselves as abstract type listeners for any types that remain
123 // abstract when the TypeSet is destroyed.
125 for (SmallSetVector<const Type *, 16>::iterator I = Types.begin(),
126 E = Types.end(); I != E; ++I) {
128 if (Ty->isAbstract())
129 Ty->removeAbstractTypeUser(this);
133 // Abstract type user interface.
135 /// Remove types from the set when refined. Do not insert the type it was
136 /// refined to because that type hasn't been verified yet.
137 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
139 OldTy->removeAbstractTypeUser(this);
142 /// Stop listening for changes to a type which is no longer abstract.
143 void typeBecameConcrete(const DerivedType *AbsTy) {
144 AbsTy->removeAbstractTypeUser(this);
150 SmallSetVector<const Type *, 16> Types;
153 TypeSet(const TypeSet &);
154 TypeSet &operator=(const TypeSet &);
157 struct Verifier : public FunctionPass, public InstVisitor<Verifier> {
158 static char ID; // Pass ID, replacement for typeid
159 bool Broken; // Is this module found to be broken?
160 bool RealPass; // Are we not being run by a PassManager?
161 VerifierFailureAction action;
162 // What to do if verification fails.
163 Module *Mod; // Module we are verifying right now
164 DominatorTree *DT; // Dominator Tree, caution can be null!
166 std::string Messages;
167 raw_string_ostream MessagesStr;
169 /// InstInThisBlock - when verifying a basic block, keep track of all of the
170 /// instructions we have seen so far. This allows us to do efficient
171 /// dominance checks for the case when an instruction has an operand that is
172 /// an instruction in the same block.
173 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
175 /// Types - keep track of the types that have been checked already.
180 Broken(false), RealPass(true), action(AbortProcessAction),
181 DT(0), MessagesStr(Messages) {}
182 explicit Verifier(VerifierFailureAction ctn)
184 Broken(false), RealPass(true), action(ctn), DT(0),
185 MessagesStr(Messages) {}
186 explicit Verifier(bool AB)
188 Broken(false), RealPass(true),
189 action( AB ? AbortProcessAction : PrintMessageAction), DT(0),
190 MessagesStr(Messages) {}
191 explicit Verifier(DominatorTree &dt)
193 Broken(false), RealPass(false), action(PrintMessageAction),
194 DT(&dt), MessagesStr(Messages) {}
197 bool doInitialization(Module &M) {
199 verifyTypeSymbolTable(M.getTypeSymbolTable());
201 // If this is a real pass, in a pass manager, we must abort before
202 // returning back to the pass manager, or else the pass manager may try to
203 // run other passes on the broken module.
205 return abortIfBroken();
209 bool runOnFunction(Function &F) {
210 // Get dominator information if we are being run by PassManager
211 if (RealPass) DT = &getAnalysis<DominatorTree>();
216 InstsInThisBlock.clear();
218 // If this is a real pass, in a pass manager, we must abort before
219 // returning back to the pass manager, or else the pass manager may try to
220 // run other passes on the broken module.
222 return abortIfBroken();
227 bool doFinalization(Module &M) {
228 // Scan through, checking all of the external function's linkage now...
229 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
230 visitGlobalValue(*I);
232 // Check to make sure function prototypes are okay.
233 if (I->isDeclaration()) visitFunction(*I);
236 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
238 visitGlobalVariable(*I);
240 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
242 visitGlobalAlias(*I);
244 // If the module is broken, abort at this time.
245 return abortIfBroken();
248 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
249 AU.setPreservesAll();
250 AU.addRequiredID(PreVerifyID);
252 AU.addRequired<DominatorTree>();
255 /// abortIfBroken - If the module is broken and we are supposed to abort on
256 /// this condition, do so.
258 bool abortIfBroken() {
259 if (!Broken) return false;
260 MessagesStr << "Broken module found, ";
262 default: llvm_unreachable("Unknown action");
263 case AbortProcessAction:
264 MessagesStr << "compilation aborted!\n";
265 errs() << MessagesStr.str();
266 // Client should choose different reaction if abort is not desired
268 case PrintMessageAction:
269 MessagesStr << "verification continues.\n";
270 errs() << MessagesStr.str();
272 case ReturnStatusAction:
273 MessagesStr << "compilation terminated.\n";
279 // Verification methods...
280 void verifyTypeSymbolTable(TypeSymbolTable &ST);
281 void visitGlobalValue(GlobalValue &GV);
282 void visitGlobalVariable(GlobalVariable &GV);
283 void visitGlobalAlias(GlobalAlias &GA);
284 void visitFunction(Function &F);
285 void visitBasicBlock(BasicBlock &BB);
286 using InstVisitor<Verifier>::visit;
288 void visit(Instruction &I);
290 void visitTruncInst(TruncInst &I);
291 void visitZExtInst(ZExtInst &I);
292 void visitSExtInst(SExtInst &I);
293 void visitFPTruncInst(FPTruncInst &I);
294 void visitFPExtInst(FPExtInst &I);
295 void visitFPToUIInst(FPToUIInst &I);
296 void visitFPToSIInst(FPToSIInst &I);
297 void visitUIToFPInst(UIToFPInst &I);
298 void visitSIToFPInst(SIToFPInst &I);
299 void visitIntToPtrInst(IntToPtrInst &I);
300 void visitPtrToIntInst(PtrToIntInst &I);
301 void visitBitCastInst(BitCastInst &I);
302 void visitPHINode(PHINode &PN);
303 void visitBinaryOperator(BinaryOperator &B);
304 void visitICmpInst(ICmpInst &IC);
305 void visitFCmpInst(FCmpInst &FC);
306 void visitExtractElementInst(ExtractElementInst &EI);
307 void visitInsertElementInst(InsertElementInst &EI);
308 void visitShuffleVectorInst(ShuffleVectorInst &EI);
309 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
310 void visitCallInst(CallInst &CI);
311 void visitInvokeInst(InvokeInst &II);
312 void visitGetElementPtrInst(GetElementPtrInst &GEP);
313 void visitLoadInst(LoadInst &LI);
314 void visitStoreInst(StoreInst &SI);
315 void visitInstruction(Instruction &I);
316 void visitTerminatorInst(TerminatorInst &I);
317 void visitReturnInst(ReturnInst &RI);
318 void visitSwitchInst(SwitchInst &SI);
319 void visitSelectInst(SelectInst &SI);
320 void visitUserOp1(Instruction &I);
321 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
322 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
323 void visitAllocaInst(AllocaInst &AI);
324 void visitExtractValueInst(ExtractValueInst &EVI);
325 void visitInsertValueInst(InsertValueInst &IVI);
327 void VerifyCallSite(CallSite CS);
328 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
329 int VT, unsigned ArgNo, std::string &Suffix);
330 void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
331 unsigned RetNum, unsigned ParamNum, ...);
332 void VerifyFunctionLocalMetadata(MDNode *N, Function *F,
333 SmallPtrSet<MDNode *, 32> &Visited);
334 void VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
335 bool isReturnValue, const Value *V);
336 void VerifyFunctionAttrs(const FunctionType *FT, const AttrListPtr &Attrs,
338 void VerifyType(const Type *Ty);
340 void WriteValue(const Value *V) {
342 if (isa<Instruction>(V)) {
343 MessagesStr << *V << '\n';
345 WriteAsOperand(MessagesStr, V, true, Mod);
350 void WriteType(const Type *T) {
353 WriteTypeSymbolic(MessagesStr, T, Mod);
357 // CheckFailed - A check failed, so print out the condition and the message
358 // that failed. This provides a nice place to put a breakpoint if you want
359 // to see why something is not correct.
360 void CheckFailed(const Twine &Message,
361 const Value *V1 = 0, const Value *V2 = 0,
362 const Value *V3 = 0, const Value *V4 = 0) {
363 MessagesStr << Message.str() << "\n";
371 void CheckFailed(const Twine &Message, const Value *V1,
372 const Type *T2, const Value *V3 = 0) {
373 MessagesStr << Message.str() << "\n";
380 void CheckFailed(const Twine &Message, const Type *T1,
381 const Type *T2 = 0, const Type *T3 = 0) {
382 MessagesStr << Message.str() << "\n";
389 } // End anonymous namespace
391 char Verifier::ID = 0;
392 static RegisterPass<Verifier> X("verify", "Module Verifier");
394 // Assert - We know that cond should be true, if not print an error message.
395 #define Assert(C, M) \
396 do { if (!(C)) { CheckFailed(M); return; } } while (0)
397 #define Assert1(C, M, V1) \
398 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
399 #define Assert2(C, M, V1, V2) \
400 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
401 #define Assert3(C, M, V1, V2, V3) \
402 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
403 #define Assert4(C, M, V1, V2, V3, V4) \
404 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
406 void Verifier::visit(Instruction &I) {
407 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
408 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
409 InstVisitor<Verifier>::visit(I);
413 void Verifier::visitGlobalValue(GlobalValue &GV) {
414 Assert1(!GV.isDeclaration() ||
415 GV.hasExternalLinkage() ||
416 GV.hasDLLImportLinkage() ||
417 GV.hasExternalWeakLinkage() ||
418 GV.hasGhostLinkage() ||
419 (isa<GlobalAlias>(GV) &&
420 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
421 "Global is external, but doesn't have external or dllimport or weak linkage!",
424 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
425 "Global is marked as dllimport, but not external", &GV);
427 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
428 "Only global variables can have appending linkage!", &GV);
430 if (GV.hasAppendingLinkage()) {
431 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
432 Assert1(GVar && isa<ArrayType>(GVar->getType()->getElementType()),
433 "Only global arrays can have appending linkage!", GVar);
437 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
438 if (GV.hasInitializer()) {
439 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
440 "Global variable initializer type does not match global "
441 "variable type!", &GV);
443 // If the global has common linkage, it must have a zero initializer and
444 // cannot be constant.
445 if (GV.hasCommonLinkage()) {
446 Assert1(GV.getInitializer()->isNullValue(),
447 "'common' global must have a zero initializer!", &GV);
448 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
452 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
453 GV.hasExternalWeakLinkage(),
454 "invalid linkage type for global declaration", &GV);
457 visitGlobalValue(GV);
460 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
461 Assert1(!GA.getName().empty(),
462 "Alias name cannot be empty!", &GA);
463 Assert1(GA.hasExternalLinkage() || GA.hasLocalLinkage() ||
465 "Alias should have external or external weak linkage!", &GA);
466 Assert1(GA.getAliasee(),
467 "Aliasee cannot be NULL!", &GA);
468 Assert1(GA.getType() == GA.getAliasee()->getType(),
469 "Alias and aliasee types should match!", &GA);
471 if (!isa<GlobalValue>(GA.getAliasee())) {
472 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
474 (CE->getOpcode() == Instruction::BitCast ||
475 CE->getOpcode() == Instruction::GetElementPtr) &&
476 isa<GlobalValue>(CE->getOperand(0)),
477 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
481 const GlobalValue* Aliasee = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
483 "Aliasing chain should end with function or global variable", &GA);
485 visitGlobalValue(GA);
488 void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
489 for (TypeSymbolTable::iterator I = ST.begin(), E = ST.end(); I != E; ++I)
490 VerifyType(I->second);
493 // VerifyParameterAttrs - Check the given attributes for an argument or return
494 // value of the specified type. The value V is printed in error messages.
495 void Verifier::VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
496 bool isReturnValue, const Value *V) {
497 if (Attrs == Attribute::None)
500 Attributes FnCheckAttr = Attrs & Attribute::FunctionOnly;
501 Assert1(!FnCheckAttr, "Attribute " + Attribute::getAsString(FnCheckAttr) +
502 " only applies to the function!", V);
505 Attributes RetI = Attrs & Attribute::ParameterOnly;
506 Assert1(!RetI, "Attribute " + Attribute::getAsString(RetI) +
507 " does not apply to return values!", V);
511 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
512 Attributes MutI = Attrs & Attribute::MutuallyIncompatible[i];
513 Assert1(!(MutI & (MutI - 1)), "Attributes " +
514 Attribute::getAsString(MutI) + " are incompatible!", V);
517 Attributes TypeI = Attrs & Attribute::typeIncompatible(Ty);
518 Assert1(!TypeI, "Wrong type for attribute " +
519 Attribute::getAsString(TypeI), V);
521 Attributes ByValI = Attrs & Attribute::ByVal;
522 if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
523 Assert1(!ByValI || PTy->getElementType()->isSized(),
524 "Attribute " + Attribute::getAsString(ByValI) +
525 " does not support unsized types!", V);
528 "Attribute " + Attribute::getAsString(ByValI) +
529 " only applies to parameters with pointer type!", V);
533 // VerifyFunctionAttrs - Check parameter attributes against a function type.
534 // The value V is printed in error messages.
535 void Verifier::VerifyFunctionAttrs(const FunctionType *FT,
536 const AttrListPtr &Attrs,
541 bool SawNest = false;
543 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
544 const AttributeWithIndex &Attr = Attrs.getSlot(i);
548 Ty = FT->getReturnType();
549 else if (Attr.Index-1 < FT->getNumParams())
550 Ty = FT->getParamType(Attr.Index-1);
552 break; // VarArgs attributes, verified elsewhere.
554 VerifyParameterAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
556 if (Attr.Attrs & Attribute::Nest) {
557 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
561 if (Attr.Attrs & Attribute::StructRet)
562 Assert1(Attr.Index == 1, "Attribute sret not on first parameter!", V);
565 Attributes FAttrs = Attrs.getFnAttributes();
566 Attributes NotFn = FAttrs & (~Attribute::FunctionOnly);
567 Assert1(!NotFn, "Attribute " + Attribute::getAsString(NotFn) +
568 " does not apply to the function!", V);
571 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
572 Attributes MutI = FAttrs & Attribute::MutuallyIncompatible[i];
573 Assert1(!(MutI & (MutI - 1)), "Attributes " +
574 Attribute::getAsString(MutI) + " are incompatible!", V);
578 static bool VerifyAttributeCount(const AttrListPtr &Attrs, unsigned Params) {
582 unsigned LastSlot = Attrs.getNumSlots() - 1;
583 unsigned LastIndex = Attrs.getSlot(LastSlot).Index;
584 if (LastIndex <= Params
585 || (LastIndex == (unsigned)~0
586 && (LastSlot == 0 || Attrs.getSlot(LastSlot - 1).Index <= Params)))
592 // visitFunction - Verify that a function is ok.
594 void Verifier::visitFunction(Function &F) {
595 // Check function arguments.
596 const FunctionType *FT = F.getFunctionType();
597 unsigned NumArgs = F.arg_size();
599 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
600 Assert2(FT->getNumParams() == NumArgs,
601 "# formal arguments must match # of arguments for function type!",
603 Assert1(F.getReturnType()->isFirstClassType() ||
604 F.getReturnType()->isVoidTy() ||
605 isa<StructType>(F.getReturnType()),
606 "Functions cannot return aggregate values!", &F);
608 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
609 "Invalid struct return type!", &F);
611 const AttrListPtr &Attrs = F.getAttributes();
613 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
614 "Attributes after last parameter!", &F);
616 // Check function attributes.
617 VerifyFunctionAttrs(FT, Attrs, &F);
619 // Check that this function meets the restrictions on this calling convention.
620 switch (F.getCallingConv()) {
625 case CallingConv::Fast:
626 case CallingConv::Cold:
627 case CallingConv::X86_FastCall:
628 Assert1(!F.isVarArg(),
629 "Varargs functions must have C calling conventions!", &F);
633 bool isLLVMdotName = F.getName().size() >= 5 &&
634 F.getName().substr(0, 5) == "llvm.";
636 // Check that the argument values match the function type for this function...
638 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
640 Assert2(I->getType() == FT->getParamType(i),
641 "Argument value does not match function argument type!",
642 I, FT->getParamType(i));
643 Assert1(I->getType()->isFirstClassType(),
644 "Function arguments must have first-class types!", I);
646 Assert2(!I->getType()->isMetadataTy(),
647 "Function takes metadata but isn't an intrinsic", I, &F);
650 if (F.isDeclaration()) {
651 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
652 F.hasExternalWeakLinkage() || F.hasGhostLinkage(),
653 "invalid linkage type for function declaration", &F);
655 // Verify that this function (which has a body) is not named "llvm.*". It
656 // is not legal to define intrinsics.
657 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
659 // Check the entry node
660 BasicBlock *Entry = &F.getEntryBlock();
661 Assert1(pred_begin(Entry) == pred_end(Entry),
662 "Entry block to function must not have predecessors!", Entry);
664 // The address of the entry block cannot be taken, unless it is dead.
665 if (Entry->hasAddressTaken()) {
666 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
667 "blockaddress may not be used with the entry block!", Entry);
671 // If this function is actually an intrinsic, verify that it is only used in
672 // direct call/invokes, never having its "address taken".
673 if (F.getIntrinsicID()) {
674 for (Value::use_iterator UI = F.use_begin(), E = F.use_end(); UI != E;++UI){
675 User *U = cast<User>(UI);
676 if ((isa<CallInst>(U) || isa<InvokeInst>(U)) && UI.getOperandNo() == 0)
677 continue; // Direct calls/invokes are ok.
679 Assert1(0, "Invalid user of intrinsic instruction!", U);
684 // verifyBasicBlock - Verify that a basic block is well formed...
686 void Verifier::visitBasicBlock(BasicBlock &BB) {
687 InstsInThisBlock.clear();
689 // Ensure that basic blocks have terminators!
690 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
692 // Check constraints that this basic block imposes on all of the PHI nodes in
694 if (isa<PHINode>(BB.front())) {
695 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
696 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
697 std::sort(Preds.begin(), Preds.end());
699 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
700 // Ensure that PHI nodes have at least one entry!
701 Assert1(PN->getNumIncomingValues() != 0,
702 "PHI nodes must have at least one entry. If the block is dead, "
703 "the PHI should be removed!", PN);
704 Assert1(PN->getNumIncomingValues() == Preds.size(),
705 "PHINode should have one entry for each predecessor of its "
706 "parent basic block!", PN);
708 // Get and sort all incoming values in the PHI node...
710 Values.reserve(PN->getNumIncomingValues());
711 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
712 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
713 PN->getIncomingValue(i)));
714 std::sort(Values.begin(), Values.end());
716 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
717 // Check to make sure that if there is more than one entry for a
718 // particular basic block in this PHI node, that the incoming values are
721 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
722 Values[i].second == Values[i-1].second,
723 "PHI node has multiple entries for the same basic block with "
724 "different incoming values!", PN, Values[i].first,
725 Values[i].second, Values[i-1].second);
727 // Check to make sure that the predecessors and PHI node entries are
729 Assert3(Values[i].first == Preds[i],
730 "PHI node entries do not match predecessors!", PN,
731 Values[i].first, Preds[i]);
737 void Verifier::visitTerminatorInst(TerminatorInst &I) {
738 // Ensure that terminators only exist at the end of the basic block.
739 Assert1(&I == I.getParent()->getTerminator(),
740 "Terminator found in the middle of a basic block!", I.getParent());
744 void Verifier::visitReturnInst(ReturnInst &RI) {
745 Function *F = RI.getParent()->getParent();
746 unsigned N = RI.getNumOperands();
747 if (F->getReturnType()->isVoidTy())
749 "Found return instr that returns non-void in Function of void "
750 "return type!", &RI, F->getReturnType());
751 else if (N == 1 && F->getReturnType() == RI.getOperand(0)->getType()) {
752 // Exactly one return value and it matches the return type. Good.
753 } else if (const StructType *STy = dyn_cast<StructType>(F->getReturnType())) {
754 // The return type is a struct; check for multiple return values.
755 Assert2(STy->getNumElements() == N,
756 "Incorrect number of return values in ret instruction!",
757 &RI, F->getReturnType());
758 for (unsigned i = 0; i != N; ++i)
759 Assert2(STy->getElementType(i) == RI.getOperand(i)->getType(),
760 "Function return type does not match operand "
761 "type of return inst!", &RI, F->getReturnType());
762 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(F->getReturnType())) {
763 // The return type is an array; check for multiple return values.
764 Assert2(ATy->getNumElements() == N,
765 "Incorrect number of return values in ret instruction!",
766 &RI, F->getReturnType());
767 for (unsigned i = 0; i != N; ++i)
768 Assert2(ATy->getElementType() == RI.getOperand(i)->getType(),
769 "Function return type does not match operand "
770 "type of return inst!", &RI, F->getReturnType());
772 CheckFailed("Function return type does not match operand "
773 "type of return inst!", &RI, F->getReturnType());
776 // Check to make sure that the return value has necessary properties for
778 visitTerminatorInst(RI);
781 void Verifier::visitSwitchInst(SwitchInst &SI) {
782 // Check to make sure that all of the constants in the switch instruction
783 // have the same type as the switched-on value.
784 const Type *SwitchTy = SI.getCondition()->getType();
785 SmallPtrSet<ConstantInt*, 32> Constants;
786 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i) {
787 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
788 "Switch constants must all be same type as switch value!", &SI);
789 Assert2(Constants.insert(SI.getCaseValue(i)),
790 "Duplicate integer as switch case", &SI, SI.getCaseValue(i));
793 visitTerminatorInst(SI);
796 void Verifier::visitSelectInst(SelectInst &SI) {
797 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
799 "Invalid operands for select instruction!", &SI);
801 Assert1(SI.getTrueValue()->getType() == SI.getType(),
802 "Select values must have same type as select instruction!", &SI);
803 visitInstruction(SI);
806 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
807 /// a pass, if any exist, it's an error.
809 void Verifier::visitUserOp1(Instruction &I) {
810 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
813 void Verifier::visitTruncInst(TruncInst &I) {
814 // Get the source and destination types
815 const Type *SrcTy = I.getOperand(0)->getType();
816 const Type *DestTy = I.getType();
818 // Get the size of the types in bits, we'll need this later
819 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
820 unsigned DestBitSize = DestTy->getScalarSizeInBits();
822 Assert1(SrcTy->isIntOrIntVector(), "Trunc only operates on integer", &I);
823 Assert1(DestTy->isIntOrIntVector(), "Trunc only produces integer", &I);
824 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
825 "trunc source and destination must both be a vector or neither", &I);
826 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
831 void Verifier::visitZExtInst(ZExtInst &I) {
832 // Get the source and destination types
833 const Type *SrcTy = I.getOperand(0)->getType();
834 const Type *DestTy = I.getType();
836 // Get the size of the types in bits, we'll need this later
837 Assert1(SrcTy->isIntOrIntVector(), "ZExt only operates on integer", &I);
838 Assert1(DestTy->isIntOrIntVector(), "ZExt only produces an integer", &I);
839 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
840 "zext source and destination must both be a vector or neither", &I);
841 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
842 unsigned DestBitSize = DestTy->getScalarSizeInBits();
844 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
849 void Verifier::visitSExtInst(SExtInst &I) {
850 // Get the source and destination types
851 const Type *SrcTy = I.getOperand(0)->getType();
852 const Type *DestTy = I.getType();
854 // Get the size of the types in bits, we'll need this later
855 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
856 unsigned DestBitSize = DestTy->getScalarSizeInBits();
858 Assert1(SrcTy->isIntOrIntVector(), "SExt only operates on integer", &I);
859 Assert1(DestTy->isIntOrIntVector(), "SExt only produces an integer", &I);
860 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
861 "sext source and destination must both be a vector or neither", &I);
862 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
867 void Verifier::visitFPTruncInst(FPTruncInst &I) {
868 // Get the source and destination types
869 const Type *SrcTy = I.getOperand(0)->getType();
870 const Type *DestTy = I.getType();
871 // Get the size of the types in bits, we'll need this later
872 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
873 unsigned DestBitSize = DestTy->getScalarSizeInBits();
875 Assert1(SrcTy->isFPOrFPVector(),"FPTrunc only operates on FP", &I);
876 Assert1(DestTy->isFPOrFPVector(),"FPTrunc only produces an FP", &I);
877 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
878 "fptrunc source and destination must both be a vector or neither",&I);
879 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
884 void Verifier::visitFPExtInst(FPExtInst &I) {
885 // Get the source and destination types
886 const Type *SrcTy = I.getOperand(0)->getType();
887 const Type *DestTy = I.getType();
889 // Get the size of the types in bits, we'll need this later
890 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
891 unsigned DestBitSize = DestTy->getScalarSizeInBits();
893 Assert1(SrcTy->isFPOrFPVector(),"FPExt only operates on FP", &I);
894 Assert1(DestTy->isFPOrFPVector(),"FPExt only produces an FP", &I);
895 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
896 "fpext source and destination must both be a vector or neither", &I);
897 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
902 void Verifier::visitUIToFPInst(UIToFPInst &I) {
903 // Get the source and destination types
904 const Type *SrcTy = I.getOperand(0)->getType();
905 const Type *DestTy = I.getType();
907 bool SrcVec = isa<VectorType>(SrcTy);
908 bool DstVec = isa<VectorType>(DestTy);
910 Assert1(SrcVec == DstVec,
911 "UIToFP source and dest must both be vector or scalar", &I);
912 Assert1(SrcTy->isIntOrIntVector(),
913 "UIToFP source must be integer or integer vector", &I);
914 Assert1(DestTy->isFPOrFPVector(),
915 "UIToFP result must be FP or FP vector", &I);
917 if (SrcVec && DstVec)
918 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
919 cast<VectorType>(DestTy)->getNumElements(),
920 "UIToFP source and dest vector length mismatch", &I);
925 void Verifier::visitSIToFPInst(SIToFPInst &I) {
926 // Get the source and destination types
927 const Type *SrcTy = I.getOperand(0)->getType();
928 const Type *DestTy = I.getType();
930 bool SrcVec = isa<VectorType>(SrcTy);
931 bool DstVec = isa<VectorType>(DestTy);
933 Assert1(SrcVec == DstVec,
934 "SIToFP source and dest must both be vector or scalar", &I);
935 Assert1(SrcTy->isIntOrIntVector(),
936 "SIToFP source must be integer or integer vector", &I);
937 Assert1(DestTy->isFPOrFPVector(),
938 "SIToFP result must be FP or FP vector", &I);
940 if (SrcVec && DstVec)
941 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
942 cast<VectorType>(DestTy)->getNumElements(),
943 "SIToFP source and dest vector length mismatch", &I);
948 void Verifier::visitFPToUIInst(FPToUIInst &I) {
949 // Get the source and destination types
950 const Type *SrcTy = I.getOperand(0)->getType();
951 const Type *DestTy = I.getType();
953 bool SrcVec = isa<VectorType>(SrcTy);
954 bool DstVec = isa<VectorType>(DestTy);
956 Assert1(SrcVec == DstVec,
957 "FPToUI source and dest must both be vector or scalar", &I);
958 Assert1(SrcTy->isFPOrFPVector(), "FPToUI source must be FP or FP vector", &I);
959 Assert1(DestTy->isIntOrIntVector(),
960 "FPToUI result must be integer or integer vector", &I);
962 if (SrcVec && DstVec)
963 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
964 cast<VectorType>(DestTy)->getNumElements(),
965 "FPToUI source and dest vector length mismatch", &I);
970 void Verifier::visitFPToSIInst(FPToSIInst &I) {
971 // Get the source and destination types
972 const Type *SrcTy = I.getOperand(0)->getType();
973 const Type *DestTy = I.getType();
975 bool SrcVec = isa<VectorType>(SrcTy);
976 bool DstVec = isa<VectorType>(DestTy);
978 Assert1(SrcVec == DstVec,
979 "FPToSI source and dest must both be vector or scalar", &I);
980 Assert1(SrcTy->isFPOrFPVector(),
981 "FPToSI source must be FP or FP vector", &I);
982 Assert1(DestTy->isIntOrIntVector(),
983 "FPToSI result must be integer or integer vector", &I);
985 if (SrcVec && DstVec)
986 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
987 cast<VectorType>(DestTy)->getNumElements(),
988 "FPToSI source and dest vector length mismatch", &I);
993 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
994 // Get the source and destination types
995 const Type *SrcTy = I.getOperand(0)->getType();
996 const Type *DestTy = I.getType();
998 Assert1(isa<PointerType>(SrcTy), "PtrToInt source must be pointer", &I);
999 Assert1(DestTy->isInteger(), "PtrToInt result must be integral", &I);
1001 visitInstruction(I);
1004 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1005 // Get the source and destination types
1006 const Type *SrcTy = I.getOperand(0)->getType();
1007 const Type *DestTy = I.getType();
1009 Assert1(SrcTy->isInteger(), "IntToPtr source must be an integral", &I);
1010 Assert1(isa<PointerType>(DestTy), "IntToPtr result must be a pointer",&I);
1012 visitInstruction(I);
1015 void Verifier::visitBitCastInst(BitCastInst &I) {
1016 // Get the source and destination types
1017 const Type *SrcTy = I.getOperand(0)->getType();
1018 const Type *DestTy = I.getType();
1020 // Get the size of the types in bits, we'll need this later
1021 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1022 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
1024 // BitCast implies a no-op cast of type only. No bits change.
1025 // However, you can't cast pointers to anything but pointers.
1026 Assert1(isa<PointerType>(DestTy) == isa<PointerType>(DestTy),
1027 "Bitcast requires both operands to be pointer or neither", &I);
1028 Assert1(SrcBitSize == DestBitSize, "Bitcast requires types of same width",&I);
1030 // Disallow aggregates.
1031 Assert1(!SrcTy->isAggregateType(),
1032 "Bitcast operand must not be aggregate", &I);
1033 Assert1(!DestTy->isAggregateType(),
1034 "Bitcast type must not be aggregate", &I);
1036 visitInstruction(I);
1039 /// visitPHINode - Ensure that a PHI node is well formed.
1041 void Verifier::visitPHINode(PHINode &PN) {
1042 // Ensure that the PHI nodes are all grouped together at the top of the block.
1043 // This can be tested by checking whether the instruction before this is
1044 // either nonexistent (because this is begin()) or is a PHI node. If not,
1045 // then there is some other instruction before a PHI.
1046 Assert2(&PN == &PN.getParent()->front() ||
1047 isa<PHINode>(--BasicBlock::iterator(&PN)),
1048 "PHI nodes not grouped at top of basic block!",
1049 &PN, PN.getParent());
1051 // Check that all of the values of the PHI node have the same type as the
1052 // result, and that the incoming blocks are really basic blocks.
1053 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1054 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1055 "PHI node operands are not the same type as the result!", &PN);
1056 Assert1(isa<BasicBlock>(PN.getOperand(
1057 PHINode::getOperandNumForIncomingBlock(i))),
1058 "PHI node incoming block is not a BasicBlock!", &PN);
1061 // All other PHI node constraints are checked in the visitBasicBlock method.
1063 visitInstruction(PN);
1066 void Verifier::VerifyCallSite(CallSite CS) {
1067 Instruction *I = CS.getInstruction();
1069 Assert1(isa<PointerType>(CS.getCalledValue()->getType()),
1070 "Called function must be a pointer!", I);
1071 const PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1073 Assert1(isa<FunctionType>(FPTy->getElementType()),
1074 "Called function is not pointer to function type!", I);
1075 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1077 // Verify that the correct number of arguments are being passed
1078 if (FTy->isVarArg())
1079 Assert1(CS.arg_size() >= FTy->getNumParams(),
1080 "Called function requires more parameters than were provided!",I);
1082 Assert1(CS.arg_size() == FTy->getNumParams(),
1083 "Incorrect number of arguments passed to called function!", I);
1085 // Verify that all arguments to the call match the function type...
1086 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1087 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1088 "Call parameter type does not match function signature!",
1089 CS.getArgument(i), FTy->getParamType(i), I);
1091 const AttrListPtr &Attrs = CS.getAttributes();
1093 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1094 "Attributes after last parameter!", I);
1096 // Verify call attributes.
1097 VerifyFunctionAttrs(FTy, Attrs, I);
1099 if (FTy->isVarArg())
1100 // Check attributes on the varargs part.
1101 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1102 Attributes Attr = Attrs.getParamAttributes(Idx);
1104 VerifyParameterAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
1106 Attributes VArgI = Attr & Attribute::VarArgsIncompatible;
1107 Assert1(!VArgI, "Attribute " + Attribute::getAsString(VArgI) +
1108 " cannot be used for vararg call arguments!", I);
1111 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1112 if (!CS.getCalledFunction() || CS.getCalledFunction()->getName().size() < 5 ||
1113 CS.getCalledFunction()->getName().substr(0, 5) != "llvm.") {
1114 for (FunctionType::param_iterator PI = FTy->param_begin(),
1115 PE = FTy->param_end(); PI != PE; ++PI)
1116 Assert1(!PI->get()->isMetadataTy(),
1117 "Function has metadata parameter but isn't an intrinsic", I);
1120 visitInstruction(*I);
1123 void Verifier::visitCallInst(CallInst &CI) {
1124 VerifyCallSite(&CI);
1126 if (Function *F = CI.getCalledFunction())
1127 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1128 visitIntrinsicFunctionCall(ID, CI);
1131 void Verifier::visitInvokeInst(InvokeInst &II) {
1132 VerifyCallSite(&II);
1135 /// visitBinaryOperator - Check that both arguments to the binary operator are
1136 /// of the same type!
1138 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1139 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1140 "Both operands to a binary operator are not of the same type!", &B);
1142 switch (B.getOpcode()) {
1143 // Check that integer arithmetic operators are only used with
1144 // integral operands.
1145 case Instruction::Add:
1146 case Instruction::Sub:
1147 case Instruction::Mul:
1148 case Instruction::SDiv:
1149 case Instruction::UDiv:
1150 case Instruction::SRem:
1151 case Instruction::URem:
1152 Assert1(B.getType()->isIntOrIntVector(),
1153 "Integer arithmetic operators only work with integral types!", &B);
1154 Assert1(B.getType() == B.getOperand(0)->getType(),
1155 "Integer arithmetic operators must have same type "
1156 "for operands and result!", &B);
1158 // Check that floating-point arithmetic operators are only used with
1159 // floating-point operands.
1160 case Instruction::FAdd:
1161 case Instruction::FSub:
1162 case Instruction::FMul:
1163 case Instruction::FDiv:
1164 case Instruction::FRem:
1165 Assert1(B.getType()->isFPOrFPVector(),
1166 "Floating-point arithmetic operators only work with "
1167 "floating-point types!", &B);
1168 Assert1(B.getType() == B.getOperand(0)->getType(),
1169 "Floating-point arithmetic operators must have same type "
1170 "for operands and result!", &B);
1172 // Check that logical operators are only used with integral operands.
1173 case Instruction::And:
1174 case Instruction::Or:
1175 case Instruction::Xor:
1176 Assert1(B.getType()->isIntOrIntVector(),
1177 "Logical operators only work with integral types!", &B);
1178 Assert1(B.getType() == B.getOperand(0)->getType(),
1179 "Logical operators must have same type for operands and result!",
1182 case Instruction::Shl:
1183 case Instruction::LShr:
1184 case Instruction::AShr:
1185 Assert1(B.getType()->isIntOrIntVector(),
1186 "Shifts only work with integral types!", &B);
1187 Assert1(B.getType() == B.getOperand(0)->getType(),
1188 "Shift return type must be same as operands!", &B);
1191 llvm_unreachable("Unknown BinaryOperator opcode!");
1194 visitInstruction(B);
1197 void Verifier::visitICmpInst(ICmpInst& IC) {
1198 // Check that the operands are the same type
1199 const Type* Op0Ty = IC.getOperand(0)->getType();
1200 const Type* Op1Ty = IC.getOperand(1)->getType();
1201 Assert1(Op0Ty == Op1Ty,
1202 "Both operands to ICmp instruction are not of the same type!", &IC);
1203 // Check that the operands are the right type
1204 Assert1(Op0Ty->isIntOrIntVector() || isa<PointerType>(Op0Ty),
1205 "Invalid operand types for ICmp instruction", &IC);
1207 visitInstruction(IC);
1210 void Verifier::visitFCmpInst(FCmpInst& FC) {
1211 // Check that the operands are the same type
1212 const Type* Op0Ty = FC.getOperand(0)->getType();
1213 const Type* Op1Ty = FC.getOperand(1)->getType();
1214 Assert1(Op0Ty == Op1Ty,
1215 "Both operands to FCmp instruction are not of the same type!", &FC);
1216 // Check that the operands are the right type
1217 Assert1(Op0Ty->isFPOrFPVector(),
1218 "Invalid operand types for FCmp instruction", &FC);
1219 visitInstruction(FC);
1222 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1223 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1225 "Invalid extractelement operands!", &EI);
1226 visitInstruction(EI);
1229 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1230 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1233 "Invalid insertelement operands!", &IE);
1234 visitInstruction(IE);
1237 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1238 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1240 "Invalid shufflevector operands!", &SV);
1242 const VectorType *VTy = dyn_cast<VectorType>(SV.getOperand(0)->getType());
1243 Assert1(VTy, "Operands are not a vector type", &SV);
1245 // Check to see if Mask is valid.
1246 if (const ConstantVector *MV = dyn_cast<ConstantVector>(SV.getOperand(2))) {
1247 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1248 if (ConstantInt* CI = dyn_cast<ConstantInt>(MV->getOperand(i))) {
1249 Assert1(!CI->uge(VTy->getNumElements()*2),
1250 "Invalid shufflevector shuffle mask!", &SV);
1252 Assert1(isa<UndefValue>(MV->getOperand(i)),
1253 "Invalid shufflevector shuffle mask!", &SV);
1257 Assert1(isa<UndefValue>(SV.getOperand(2)) ||
1258 isa<ConstantAggregateZero>(SV.getOperand(2)),
1259 "Invalid shufflevector shuffle mask!", &SV);
1262 visitInstruction(SV);
1265 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1266 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1268 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
1269 Idxs.begin(), Idxs.end());
1270 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1271 Assert2(isa<PointerType>(GEP.getType()) &&
1272 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1273 "GEP is not of right type for indices!", &GEP, ElTy);
1274 visitInstruction(GEP);
1277 void Verifier::visitLoadInst(LoadInst &LI) {
1278 const PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1279 Assert1(PTy, "Load operand must be a pointer.", &LI);
1280 const Type *ElTy = PTy->getElementType();
1281 Assert2(ElTy == LI.getType(),
1282 "Load result type does not match pointer operand type!", &LI, ElTy);
1283 visitInstruction(LI);
1286 void Verifier::visitStoreInst(StoreInst &SI) {
1287 const PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1288 Assert1(PTy, "Load operand must be a pointer.", &SI);
1289 const Type *ElTy = PTy->getElementType();
1290 Assert2(ElTy == SI.getOperand(0)->getType(),
1291 "Stored value type does not match pointer operand type!",
1293 visitInstruction(SI);
1296 void Verifier::visitAllocaInst(AllocaInst &AI) {
1297 const PointerType *PTy = AI.getType();
1298 Assert1(PTy->getAddressSpace() == 0,
1299 "Allocation instruction pointer not in the generic address space!",
1301 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1303 visitInstruction(AI);
1306 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1307 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1308 EVI.idx_begin(), EVI.idx_end()) ==
1310 "Invalid ExtractValueInst operands!", &EVI);
1312 visitInstruction(EVI);
1315 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1316 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1317 IVI.idx_begin(), IVI.idx_end()) ==
1318 IVI.getOperand(1)->getType(),
1319 "Invalid InsertValueInst operands!", &IVI);
1321 visitInstruction(IVI);
1324 /// verifyInstruction - Verify that an instruction is well formed.
1326 void Verifier::visitInstruction(Instruction &I) {
1327 BasicBlock *BB = I.getParent();
1328 Assert1(BB, "Instruction not embedded in basic block!", &I);
1330 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1331 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1333 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
1334 "Only PHI nodes may reference their own value!", &I);
1337 // Verify that if this is a terminator that it is at the end of the block.
1338 if (isa<TerminatorInst>(I))
1339 Assert1(BB->getTerminator() == &I, "Terminator not at end of block!", &I);
1341 // Check that void typed values don't have names
1342 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1343 "Instruction has a name, but provides a void value!", &I);
1345 // Check that the return value of the instruction is either void or a legal
1347 Assert1(I.getType()->isVoidTy() ||
1348 I.getType()->isFirstClassType(),
1349 "Instruction returns a non-scalar type!", &I);
1351 // Check that the instruction doesn't produce metadata. Calls are already
1352 // checked against the callee type.
1353 Assert1(!I.getType()->isMetadataTy() ||
1354 isa<CallInst>(I) || isa<InvokeInst>(I),
1355 "Invalid use of metadata!", &I);
1357 // Check that all uses of the instruction, if they are instructions
1358 // themselves, actually have parent basic blocks. If the use is not an
1359 // instruction, it is an error!
1360 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1362 if (Instruction *Used = dyn_cast<Instruction>(*UI))
1363 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1364 " embedded in a basic block!", &I, Used);
1366 CheckFailed("Use of instruction is not an instruction!", *UI);
1371 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1372 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1374 // Check to make sure that only first-class-values are operands to
1376 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1377 Assert1(0, "Instruction operands must be first-class values!", &I);
1380 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1381 // Check to make sure that the "address of" an intrinsic function is never
1383 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
1384 "Cannot take the address of an intrinsic!", &I);
1385 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1387 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1388 Assert1(OpBB->getParent() == BB->getParent(),
1389 "Referring to a basic block in another function!", &I);
1390 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1391 Assert1(OpArg->getParent() == BB->getParent(),
1392 "Referring to an argument in another function!", &I);
1393 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1394 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1396 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
1397 BasicBlock *OpBlock = Op->getParent();
1399 // Check that a definition dominates all of its uses.
1400 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1401 // Invoke results are only usable in the normal destination, not in the
1402 // exceptional destination.
1403 BasicBlock *NormalDest = II->getNormalDest();
1405 Assert2(NormalDest != II->getUnwindDest(),
1406 "No uses of invoke possible due to dominance structure!",
1409 // PHI nodes differ from other nodes because they actually "use" the
1410 // value in the predecessor basic blocks they correspond to.
1411 BasicBlock *UseBlock = BB;
1412 if (isa<PHINode>(I))
1413 UseBlock = dyn_cast<BasicBlock>(I.getOperand(i+1));
1414 Assert2(UseBlock, "Invoke operand is PHI node with bad incoming-BB",
1417 if (isa<PHINode>(I) && UseBlock == OpBlock) {
1418 // Special case of a phi node in the normal destination or the unwind
1420 Assert2(BB == NormalDest || !DT->isReachableFromEntry(UseBlock),
1421 "Invoke result not available in the unwind destination!",
1424 Assert2(DT->dominates(NormalDest, UseBlock) ||
1425 !DT->isReachableFromEntry(UseBlock),
1426 "Invoke result does not dominate all uses!", Op, &I);
1428 // If the normal successor of an invoke instruction has multiple
1429 // predecessors, then the normal edge from the invoke is critical,
1430 // so the invoke value can only be live if the destination block
1431 // dominates all of it's predecessors (other than the invoke).
1432 if (!NormalDest->getSinglePredecessor() &&
1433 DT->isReachableFromEntry(UseBlock))
1434 // If it is used by something non-phi, then the other case is that
1435 // 'NormalDest' dominates all of its predecessors other than the
1436 // invoke. In this case, the invoke value can still be used.
1437 for (pred_iterator PI = pred_begin(NormalDest),
1438 E = pred_end(NormalDest); PI != E; ++PI)
1439 if (*PI != II->getParent() && !DT->dominates(NormalDest, *PI) &&
1440 DT->isReachableFromEntry(*PI)) {
1441 CheckFailed("Invoke result does not dominate all uses!", Op,&I);
1445 } else if (isa<PHINode>(I)) {
1446 // PHI nodes are more difficult than other nodes because they actually
1447 // "use" the value in the predecessor basic blocks they correspond to.
1448 BasicBlock *PredBB = dyn_cast<BasicBlock>(I.getOperand(i+1));
1449 Assert2(PredBB && (DT->dominates(OpBlock, PredBB) ||
1450 !DT->isReachableFromEntry(PredBB)),
1451 "Instruction does not dominate all uses!", Op, &I);
1453 if (OpBlock == BB) {
1454 // If they are in the same basic block, make sure that the definition
1455 // comes before the use.
1456 Assert2(InstsInThisBlock.count(Op) || !DT->isReachableFromEntry(BB),
1457 "Instruction does not dominate all uses!", Op, &I);
1460 // Definition must dominate use unless use is unreachable!
1461 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, &I) ||
1462 !DT->isReachableFromEntry(BB),
1463 "Instruction does not dominate all uses!", Op, &I);
1465 } else if (isa<InlineAsm>(I.getOperand(i))) {
1466 Assert1(i == 0 && (isa<CallInst>(I) || isa<InvokeInst>(I)),
1467 "Cannot take the address of an inline asm!", &I);
1470 InstsInThisBlock.insert(&I);
1472 VerifyType(I.getType());
1475 /// VerifyType - Verify that a type is well formed.
1477 void Verifier::VerifyType(const Type *Ty) {
1478 if (!Types.insert(Ty)) return;
1480 Assert1(&Mod->getContext() == &Ty->getContext(),
1481 "Type context does not match Module context!", Ty);
1483 switch (Ty->getTypeID()) {
1484 case Type::FunctionTyID: {
1485 const FunctionType *FTy = cast<FunctionType>(Ty);
1487 const Type *RetTy = FTy->getReturnType();
1488 Assert2(FunctionType::isValidReturnType(RetTy),
1489 "Function type with invalid return type", RetTy, FTy);
1492 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i) {
1493 const Type *ElTy = FTy->getParamType(i);
1494 Assert2(FunctionType::isValidArgumentType(ElTy),
1495 "Function type with invalid parameter type", ElTy, FTy);
1499 case Type::StructTyID: {
1500 const StructType *STy = cast<StructType>(Ty);
1501 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1502 const Type *ElTy = STy->getElementType(i);
1503 Assert2(StructType::isValidElementType(ElTy),
1504 "Structure type with invalid element type", ElTy, STy);
1508 case Type::ArrayTyID: {
1509 const ArrayType *ATy = cast<ArrayType>(Ty);
1510 Assert1(ArrayType::isValidElementType(ATy->getElementType()),
1511 "Array type with invalid element type", ATy);
1512 VerifyType(ATy->getElementType());
1514 case Type::PointerTyID: {
1515 const PointerType *PTy = cast<PointerType>(Ty);
1516 Assert1(PointerType::isValidElementType(PTy->getElementType()),
1517 "Pointer type with invalid element type", PTy);
1518 VerifyType(PTy->getElementType());
1520 case Type::VectorTyID: {
1521 const VectorType *VTy = cast<VectorType>(Ty);
1522 Assert1(VectorType::isValidElementType(VTy->getElementType()),
1523 "Vector type with invalid element type", VTy);
1524 VerifyType(VTy->getElementType());
1531 /// VerifyFunctionLocalMetadata - Verify that the specified MDNode is local to
1532 /// specified Function.
1533 void Verifier::VerifyFunctionLocalMetadata(MDNode *N, Function *F,
1534 SmallPtrSet<MDNode *, 32> &Visited) {
1535 assert(N->isFunctionLocal() && "Should only be called on function-local MD");
1537 // Only visit each node once.
1538 if (!Visited.insert(N))
1541 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
1542 Value *V = N->getOperand(i);
1545 Function *ActualF = 0;
1546 if (Instruction *I = dyn_cast<Instruction>(V))
1547 ActualF = I->getParent()->getParent();
1548 else if (BasicBlock *BB = dyn_cast<BasicBlock>(V))
1549 ActualF = BB->getParent();
1550 else if (Argument *A = dyn_cast<Argument>(V))
1551 ActualF = A->getParent();
1552 else if (MDNode *MD = dyn_cast<MDNode>(V))
1553 if (MD->isFunctionLocal())
1554 VerifyFunctionLocalMetadata(MD, F, Visited);
1556 // If this was an instruction, bb, or argument, verify that it is in the
1557 // function that we expect.
1558 Assert1(ActualF == 0 || ActualF == F,
1559 "function-local metadata used in wrong function", N);
1563 // Flags used by TableGen to mark intrinsic parameters with the
1564 // LLVMExtendedElementVectorType and LLVMTruncatedElementVectorType classes.
1565 static const unsigned ExtendedElementVectorType = 0x40000000;
1566 static const unsigned TruncatedElementVectorType = 0x20000000;
1568 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1570 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1571 Function *IF = CI.getCalledFunction();
1572 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1575 #define GET_INTRINSIC_VERIFIER
1576 #include "llvm/Intrinsics.gen"
1577 #undef GET_INTRINSIC_VERIFIER
1579 // If the intrinsic takes MDNode arguments, verify that they are either global
1580 // or are local to *this* function.
1581 for (unsigned i = 0, e = CI.getNumOperands(); i != e; ++i)
1582 if (MDNode *MD = dyn_cast<MDNode>(CI.getOperand(i))) {
1583 if (!MD->isFunctionLocal()) continue;
1584 SmallPtrSet<MDNode *, 32> Visited;
1585 VerifyFunctionLocalMetadata(MD, CI.getParent()->getParent(), Visited);
1591 case Intrinsic::dbg_declare: // llvm.dbg.declare
1592 if (Constant *C = dyn_cast<Constant>(CI.getOperand(1)))
1593 Assert1(C && !isa<ConstantPointerNull>(C),
1594 "invalid llvm.dbg.declare intrinsic call", &CI);
1596 case Intrinsic::memcpy:
1597 case Intrinsic::memmove:
1598 case Intrinsic::memset:
1599 Assert1(isa<ConstantInt>(CI.getOperand(4)),
1600 "alignment argument of memory intrinsics must be a constant int",
1603 case Intrinsic::gcroot:
1604 case Intrinsic::gcwrite:
1605 case Intrinsic::gcread:
1606 if (ID == Intrinsic::gcroot) {
1608 dyn_cast<AllocaInst>(CI.getOperand(1)->stripPointerCasts());
1609 Assert1(AI && isa<PointerType>(AI->getType()->getElementType()),
1610 "llvm.gcroot parameter #1 must be a pointer alloca.", &CI);
1611 Assert1(isa<Constant>(CI.getOperand(2)),
1612 "llvm.gcroot parameter #2 must be a constant.", &CI);
1615 Assert1(CI.getParent()->getParent()->hasGC(),
1616 "Enclosing function does not use GC.", &CI);
1618 case Intrinsic::init_trampoline:
1619 Assert1(isa<Function>(CI.getOperand(2)->stripPointerCasts()),
1620 "llvm.init_trampoline parameter #2 must resolve to a function.",
1623 case Intrinsic::prefetch:
1624 Assert1(isa<ConstantInt>(CI.getOperand(2)) &&
1625 isa<ConstantInt>(CI.getOperand(3)) &&
1626 cast<ConstantInt>(CI.getOperand(2))->getZExtValue() < 2 &&
1627 cast<ConstantInt>(CI.getOperand(3))->getZExtValue() < 4,
1628 "invalid arguments to llvm.prefetch",
1631 case Intrinsic::stackprotector:
1632 Assert1(isa<AllocaInst>(CI.getOperand(2)->stripPointerCasts()),
1633 "llvm.stackprotector parameter #2 must resolve to an alloca.",
1636 case Intrinsic::lifetime_start:
1637 case Intrinsic::lifetime_end:
1638 case Intrinsic::invariant_start:
1639 Assert1(isa<ConstantInt>(CI.getOperand(1)),
1640 "size argument of memory use markers must be a constant integer",
1643 case Intrinsic::invariant_end:
1644 Assert1(isa<ConstantInt>(CI.getOperand(2)),
1645 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
1650 /// Produce a string to identify an intrinsic parameter or return value.
1651 /// The ArgNo value numbers the return values from 0 to NumRets-1 and the
1652 /// parameters beginning with NumRets.
1654 static std::string IntrinsicParam(unsigned ArgNo, unsigned NumRets) {
1655 if (ArgNo < NumRets) {
1657 return "Intrinsic result type";
1659 return "Intrinsic result type #" + utostr(ArgNo);
1661 return "Intrinsic parameter #" + utostr(ArgNo - NumRets);
1664 bool Verifier::PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
1665 int VT, unsigned ArgNo, std::string &Suffix) {
1666 const FunctionType *FTy = F->getFunctionType();
1668 unsigned NumElts = 0;
1669 const Type *EltTy = Ty;
1670 const VectorType *VTy = dyn_cast<VectorType>(Ty);
1672 EltTy = VTy->getElementType();
1673 NumElts = VTy->getNumElements();
1676 const Type *RetTy = FTy->getReturnType();
1677 const StructType *ST = dyn_cast<StructType>(RetTy);
1678 unsigned NumRets = 1;
1680 NumRets = ST->getNumElements();
1685 // Check flags that indicate a type that is an integral vector type with
1686 // elements that are larger or smaller than the elements of the matched
1688 if ((Match & (ExtendedElementVectorType |
1689 TruncatedElementVectorType)) != 0) {
1690 const IntegerType *IEltTy = dyn_cast<IntegerType>(EltTy);
1691 if (!VTy || !IEltTy) {
1692 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not "
1693 "an integral vector type.", F);
1696 // Adjust the current Ty (in the opposite direction) rather than
1697 // the type being matched against.
1698 if ((Match & ExtendedElementVectorType) != 0) {
1699 if ((IEltTy->getBitWidth() & 1) != 0) {
1700 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " vector "
1701 "element bit-width is odd.", F);
1704 Ty = VectorType::getTruncatedElementVectorType(VTy);
1706 Ty = VectorType::getExtendedElementVectorType(VTy);
1707 Match &= ~(ExtendedElementVectorType | TruncatedElementVectorType);
1710 if (Match <= static_cast<int>(NumRets - 1)) {
1712 RetTy = ST->getElementType(Match);
1715 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " does not "
1716 "match return type.", F);
1720 if (Ty != FTy->getParamType(Match - NumRets)) {
1721 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " does not "
1722 "match parameter %" + utostr(Match - NumRets) + ".", F);
1726 } else if (VT == MVT::iAny) {
1727 if (!EltTy->isInteger()) {
1728 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not "
1729 "an integer type.", F);
1733 unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
1737 Suffix += "v" + utostr(NumElts);
1739 Suffix += "i" + utostr(GotBits);
1741 // Check some constraints on various intrinsics.
1743 default: break; // Not everything needs to be checked.
1744 case Intrinsic::bswap:
1745 if (GotBits < 16 || GotBits % 16 != 0) {
1746 CheckFailed("Intrinsic requires even byte width argument", F);
1751 } else if (VT == MVT::fAny) {
1752 if (!EltTy->isFloatingPoint()) {
1753 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not "
1754 "a floating-point type.", F);
1761 Suffix += "v" + utostr(NumElts);
1763 Suffix += EVT::getEVT(EltTy).getEVTString();
1764 } else if (VT == MVT::vAny) {
1766 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not a vector type.", F);
1769 Suffix += ".v" + utostr(NumElts) + EVT::getEVT(EltTy).getEVTString();
1770 } else if (VT == MVT::iPTR) {
1771 if (!isa<PointerType>(Ty)) {
1772 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not a "
1773 "pointer and a pointer is required.", F);
1776 } else if (VT == MVT::iPTRAny) {
1777 // Outside of TableGen, we don't distinguish iPTRAny (to any address space)
1778 // and iPTR. In the verifier, we can not distinguish which case we have so
1779 // allow either case to be legal.
1780 if (const PointerType* PTyp = dyn_cast<PointerType>(Ty)) {
1781 Suffix += ".p" + utostr(PTyp->getAddressSpace()) +
1782 EVT::getEVT(PTyp->getElementType()).getEVTString();
1784 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not a "
1785 "pointer and a pointer is required.", F);
1788 } else if (EVT((MVT::SimpleValueType)VT).isVector()) {
1789 EVT VVT = EVT((MVT::SimpleValueType)VT);
1791 // If this is a vector argument, verify the number and type of elements.
1792 if (VVT.getVectorElementType() != EVT::getEVT(EltTy)) {
1793 CheckFailed("Intrinsic prototype has incorrect vector element type!", F);
1797 if (VVT.getVectorNumElements() != NumElts) {
1798 CheckFailed("Intrinsic prototype has incorrect number of "
1799 "vector elements!", F);
1802 } else if (EVT((MVT::SimpleValueType)VT).getTypeForEVT(Ty->getContext()) !=
1804 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is wrong!", F);
1806 } else if (EltTy != Ty) {
1807 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is a vector "
1808 "and a scalar is required.", F);
1815 /// VerifyIntrinsicPrototype - TableGen emits calls to this function into
1816 /// Intrinsics.gen. This implements a little state machine that verifies the
1817 /// prototype of intrinsics.
1818 void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
1820 unsigned ParamNum, ...) {
1822 va_start(VA, ParamNum);
1823 const FunctionType *FTy = F->getFunctionType();
1825 // For overloaded intrinsics, the Suffix of the function name must match the
1826 // types of the arguments. This variable keeps track of the expected
1827 // suffix, to be checked at the end.
1830 if (FTy->getNumParams() + FTy->isVarArg() != ParamNum) {
1831 CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
1835 const Type *Ty = FTy->getReturnType();
1836 const StructType *ST = dyn_cast<StructType>(Ty);
1838 // Verify the return types.
1839 if (ST && ST->getNumElements() != RetNum) {
1840 CheckFailed("Intrinsic prototype has incorrect number of return types!", F);
1844 for (unsigned ArgNo = 0; ArgNo < RetNum; ++ArgNo) {
1845 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1847 if (ST) Ty = ST->getElementType(ArgNo);
1849 if (!PerformTypeCheck(ID, F, Ty, VT, ArgNo, Suffix))
1853 // Verify the parameter types.
1854 for (unsigned ArgNo = 0; ArgNo < ParamNum; ++ArgNo) {
1855 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1857 if (VT == MVT::isVoid && ArgNo > 0) {
1858 if (!FTy->isVarArg())
1859 CheckFailed("Intrinsic prototype has no '...'!", F);
1863 if (!PerformTypeCheck(ID, F, FTy->getParamType(ArgNo), VT, ArgNo + RetNum,
1870 // For intrinsics without pointer arguments, if we computed a Suffix then the
1871 // intrinsic is overloaded and we need to make sure that the name of the
1872 // function is correct. We add the suffix to the name of the intrinsic and
1873 // compare against the given function name. If they are not the same, the
1874 // function name is invalid. This ensures that overloading of intrinsics
1875 // uses a sane and consistent naming convention. Note that intrinsics with
1876 // pointer argument may or may not be overloaded so we will check assuming it
1877 // has a suffix and not.
1878 if (!Suffix.empty()) {
1879 std::string Name(Intrinsic::getName(ID));
1880 if (Name + Suffix != F->getName()) {
1881 CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
1882 F->getName().substr(Name.length()) + "'. It should be '" +
1887 // Check parameter attributes.
1888 Assert1(F->getAttributes() == Intrinsic::getAttributes(ID),
1889 "Intrinsic has wrong parameter attributes!", F);
1893 //===----------------------------------------------------------------------===//
1894 // Implement the public interfaces to this file...
1895 //===----------------------------------------------------------------------===//
1897 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1898 return new Verifier(action);
1902 // verifyFunction - Create
1903 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1904 Function &F = const_cast<Function&>(f);
1905 assert(!F.isDeclaration() && "Cannot verify external functions");
1907 ExistingModuleProvider MP(F.getParent());
1908 FunctionPassManager FPM(&MP);
1909 Verifier *V = new Verifier(action);
1916 /// verifyModule - Check a module for errors, printing messages on stderr.
1917 /// Return true if the module is corrupt.
1919 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1920 std::string *ErrorInfo) {
1922 Verifier *V = new Verifier(action);
1924 PM.run(const_cast<Module&>(M));
1926 if (ErrorInfo && V->Broken)
1927 *ErrorInfo = V->MessagesStr.str();