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/Pass.h"
51 #include "llvm/PassManager.h"
52 #include "llvm/TypeSymbolTable.h"
53 #include "llvm/Analysis/Dominators.h"
54 #include "llvm/Assembly/Writer.h"
55 #include "llvm/CodeGen/ValueTypes.h"
56 #include "llvm/Support/CallSite.h"
57 #include "llvm/Support/CFG.h"
58 #include "llvm/Support/Debug.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 dbgs() << "Basic Block does not have terminator!\n";
89 WriteAsOperand(dbgs(), 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 LLVMContext *Context; // Context within which we are verifying
165 DominatorTree *DT; // Dominator Tree, caution can be null!
167 std::string Messages;
168 raw_string_ostream MessagesStr;
170 /// InstInThisBlock - when verifying a basic block, keep track of all of the
171 /// instructions we have seen so far. This allows us to do efficient
172 /// dominance checks for the case when an instruction has an operand that is
173 /// an instruction in the same block.
174 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
176 /// Types - keep track of the types that have been checked already.
181 Broken(false), RealPass(true), action(AbortProcessAction),
182 Mod(0), Context(0), DT(0), MessagesStr(Messages) {}
183 explicit Verifier(VerifierFailureAction ctn)
185 Broken(false), RealPass(true), action(ctn), Mod(0), Context(0), DT(0),
186 MessagesStr(Messages) {}
187 explicit Verifier(bool AB)
189 Broken(false), RealPass(true),
190 action( AB ? AbortProcessAction : PrintMessageAction), Mod(0),
191 Context(0), DT(0), MessagesStr(Messages) {}
192 explicit Verifier(DominatorTree &dt)
194 Broken(false), RealPass(false), action(PrintMessageAction), Mod(0),
195 Context(0), DT(&dt), MessagesStr(Messages) {}
198 bool doInitialization(Module &M) {
200 Context = &M.getContext();
201 verifyTypeSymbolTable(M.getTypeSymbolTable());
203 // If this is a real pass, in a pass manager, we must abort before
204 // returning back to the pass manager, or else the pass manager may try to
205 // run other passes on the broken module.
207 return abortIfBroken();
211 bool runOnFunction(Function &F) {
212 // Get dominator information if we are being run by PassManager
213 if (RealPass) DT = &getAnalysis<DominatorTree>();
216 if (!Context) Context = &F.getContext();
219 InstsInThisBlock.clear();
221 // If this is a real pass, in a pass manager, we must abort before
222 // returning back to the pass manager, or else the pass manager may try to
223 // run other passes on the broken module.
225 return abortIfBroken();
230 bool doFinalization(Module &M) {
231 // Scan through, checking all of the external function's linkage now...
232 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
233 visitGlobalValue(*I);
235 // Check to make sure function prototypes are okay.
236 if (I->isDeclaration()) visitFunction(*I);
239 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
241 visitGlobalVariable(*I);
243 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
245 visitGlobalAlias(*I);
247 // If the module is broken, abort at this time.
248 return abortIfBroken();
251 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
252 AU.setPreservesAll();
253 AU.addRequiredID(PreVerifyID);
255 AU.addRequired<DominatorTree>();
258 /// abortIfBroken - If the module is broken and we are supposed to abort on
259 /// this condition, do so.
261 bool abortIfBroken() {
262 if (!Broken) return false;
263 MessagesStr << "Broken module found, ";
265 default: llvm_unreachable("Unknown action");
266 case AbortProcessAction:
267 MessagesStr << "compilation aborted!\n";
268 dbgs() << MessagesStr.str();
269 // Client should choose different reaction if abort is not desired
271 case PrintMessageAction:
272 MessagesStr << "verification continues.\n";
273 dbgs() << MessagesStr.str();
275 case ReturnStatusAction:
276 MessagesStr << "compilation terminated.\n";
282 // Verification methods...
283 void verifyTypeSymbolTable(TypeSymbolTable &ST);
284 void visitGlobalValue(GlobalValue &GV);
285 void visitGlobalVariable(GlobalVariable &GV);
286 void visitGlobalAlias(GlobalAlias &GA);
287 void visitFunction(Function &F);
288 void visitBasicBlock(BasicBlock &BB);
289 using InstVisitor<Verifier>::visit;
291 void visit(Instruction &I);
293 void visitTruncInst(TruncInst &I);
294 void visitZExtInst(ZExtInst &I);
295 void visitSExtInst(SExtInst &I);
296 void visitFPTruncInst(FPTruncInst &I);
297 void visitFPExtInst(FPExtInst &I);
298 void visitFPToUIInst(FPToUIInst &I);
299 void visitFPToSIInst(FPToSIInst &I);
300 void visitUIToFPInst(UIToFPInst &I);
301 void visitSIToFPInst(SIToFPInst &I);
302 void visitIntToPtrInst(IntToPtrInst &I);
303 void visitPtrToIntInst(PtrToIntInst &I);
304 void visitBitCastInst(BitCastInst &I);
305 void visitPHINode(PHINode &PN);
306 void visitBinaryOperator(BinaryOperator &B);
307 void visitICmpInst(ICmpInst &IC);
308 void visitFCmpInst(FCmpInst &FC);
309 void visitExtractElementInst(ExtractElementInst &EI);
310 void visitInsertElementInst(InsertElementInst &EI);
311 void visitShuffleVectorInst(ShuffleVectorInst &EI);
312 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
313 void visitCallInst(CallInst &CI);
314 void visitInvokeInst(InvokeInst &II);
315 void visitGetElementPtrInst(GetElementPtrInst &GEP);
316 void visitLoadInst(LoadInst &LI);
317 void visitStoreInst(StoreInst &SI);
318 void visitInstruction(Instruction &I);
319 void visitTerminatorInst(TerminatorInst &I);
320 void visitReturnInst(ReturnInst &RI);
321 void visitSwitchInst(SwitchInst &SI);
322 void visitSelectInst(SelectInst &SI);
323 void visitUserOp1(Instruction &I);
324 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
325 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
326 void visitAllocaInst(AllocaInst &AI);
327 void visitExtractValueInst(ExtractValueInst &EVI);
328 void visitInsertValueInst(InsertValueInst &IVI);
330 void VerifyCallSite(CallSite CS);
331 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
332 int VT, unsigned ArgNo, std::string &Suffix);
333 void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
334 unsigned RetNum, unsigned ParamNum, ...);
335 void VerifyFunctionLocalMetadata(MDNode *N, Function *F,
336 SmallPtrSet<MDNode *, 32> &Visited);
337 void VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
338 bool isReturnValue, const Value *V);
339 void VerifyFunctionAttrs(const FunctionType *FT, const AttrListPtr &Attrs,
341 void VerifyType(const Type *Ty);
343 void WriteValue(const Value *V) {
345 if (isa<Instruction>(V)) {
346 MessagesStr << *V << '\n';
348 WriteAsOperand(MessagesStr, V, true, Mod);
353 void WriteType(const Type *T) {
356 WriteTypeSymbolic(MessagesStr, T, Mod);
360 // CheckFailed - A check failed, so print out the condition and the message
361 // that failed. This provides a nice place to put a breakpoint if you want
362 // to see why something is not correct.
363 void CheckFailed(const Twine &Message,
364 const Value *V1 = 0, const Value *V2 = 0,
365 const Value *V3 = 0, const Value *V4 = 0) {
366 MessagesStr << Message.str() << "\n";
374 void CheckFailed(const Twine &Message, const Value *V1,
375 const Type *T2, const Value *V3 = 0) {
376 MessagesStr << Message.str() << "\n";
383 void CheckFailed(const Twine &Message, const Type *T1,
384 const Type *T2 = 0, const Type *T3 = 0) {
385 MessagesStr << Message.str() << "\n";
392 } // End anonymous namespace
394 char Verifier::ID = 0;
395 static RegisterPass<Verifier> X("verify", "Module Verifier");
397 // Assert - We know that cond should be true, if not print an error message.
398 #define Assert(C, M) \
399 do { if (!(C)) { CheckFailed(M); return; } } while (0)
400 #define Assert1(C, M, V1) \
401 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
402 #define Assert2(C, M, V1, V2) \
403 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
404 #define Assert3(C, M, V1, V2, V3) \
405 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
406 #define Assert4(C, M, V1, V2, V3, V4) \
407 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
409 void Verifier::visit(Instruction &I) {
410 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
411 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
412 InstVisitor<Verifier>::visit(I);
416 void Verifier::visitGlobalValue(GlobalValue &GV) {
417 Assert1(!GV.isDeclaration() ||
418 GV.isMaterializable() ||
419 GV.hasExternalLinkage() ||
420 GV.hasDLLImportLinkage() ||
421 GV.hasExternalWeakLinkage() ||
422 (isa<GlobalAlias>(GV) &&
423 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
424 "Global is external, but doesn't have external or dllimport or weak linkage!",
427 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
428 "Global is marked as dllimport, but not external", &GV);
430 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
431 "Only global variables can have appending linkage!", &GV);
433 if (GV.hasAppendingLinkage()) {
434 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
435 Assert1(GVar && isa<ArrayType>(GVar->getType()->getElementType()),
436 "Only global arrays can have appending linkage!", GVar);
440 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
441 if (GV.hasInitializer()) {
442 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
443 "Global variable initializer type does not match global "
444 "variable type!", &GV);
446 // If the global has common linkage, it must have a zero initializer and
447 // cannot be constant.
448 if (GV.hasCommonLinkage()) {
449 Assert1(GV.getInitializer()->isNullValue(),
450 "'common' global must have a zero initializer!", &GV);
451 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
455 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
456 GV.hasExternalWeakLinkage(),
457 "invalid linkage type for global declaration", &GV);
460 visitGlobalValue(GV);
463 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
464 Assert1(!GA.getName().empty(),
465 "Alias name cannot be empty!", &GA);
466 Assert1(GA.hasExternalLinkage() || GA.hasLocalLinkage() ||
468 "Alias should have external or external weak linkage!", &GA);
469 Assert1(GA.getAliasee(),
470 "Aliasee cannot be NULL!", &GA);
471 Assert1(GA.getType() == GA.getAliasee()->getType(),
472 "Alias and aliasee types should match!", &GA);
474 if (!isa<GlobalValue>(GA.getAliasee())) {
475 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
477 (CE->getOpcode() == Instruction::BitCast ||
478 CE->getOpcode() == Instruction::GetElementPtr) &&
479 isa<GlobalValue>(CE->getOperand(0)),
480 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
484 const GlobalValue* Aliasee = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
486 "Aliasing chain should end with function or global variable", &GA);
488 visitGlobalValue(GA);
491 void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
492 for (TypeSymbolTable::iterator I = ST.begin(), E = ST.end(); I != E; ++I)
493 VerifyType(I->second);
496 // VerifyParameterAttrs - Check the given attributes for an argument or return
497 // value of the specified type. The value V is printed in error messages.
498 void Verifier::VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
499 bool isReturnValue, const Value *V) {
500 if (Attrs == Attribute::None)
503 Attributes FnCheckAttr = Attrs & Attribute::FunctionOnly;
504 Assert1(!FnCheckAttr, "Attribute " + Attribute::getAsString(FnCheckAttr) +
505 " only applies to the function!", V);
508 Attributes RetI = Attrs & Attribute::ParameterOnly;
509 Assert1(!RetI, "Attribute " + Attribute::getAsString(RetI) +
510 " does not apply to return values!", V);
514 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
515 Attributes MutI = Attrs & Attribute::MutuallyIncompatible[i];
516 Assert1(!(MutI & (MutI - 1)), "Attributes " +
517 Attribute::getAsString(MutI) + " are incompatible!", V);
520 Attributes TypeI = Attrs & Attribute::typeIncompatible(Ty);
521 Assert1(!TypeI, "Wrong type for attribute " +
522 Attribute::getAsString(TypeI), V);
524 Attributes ByValI = Attrs & Attribute::ByVal;
525 if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
526 Assert1(!ByValI || PTy->getElementType()->isSized(),
527 "Attribute " + Attribute::getAsString(ByValI) +
528 " does not support unsized types!", V);
531 "Attribute " + Attribute::getAsString(ByValI) +
532 " only applies to parameters with pointer type!", V);
536 // VerifyFunctionAttrs - Check parameter attributes against a function type.
537 // The value V is printed in error messages.
538 void Verifier::VerifyFunctionAttrs(const FunctionType *FT,
539 const AttrListPtr &Attrs,
544 bool SawNest = false;
546 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
547 const AttributeWithIndex &Attr = Attrs.getSlot(i);
551 Ty = FT->getReturnType();
552 else if (Attr.Index-1 < FT->getNumParams())
553 Ty = FT->getParamType(Attr.Index-1);
555 break; // VarArgs attributes, verified elsewhere.
557 VerifyParameterAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
559 if (Attr.Attrs & Attribute::Nest) {
560 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
564 if (Attr.Attrs & Attribute::StructRet)
565 Assert1(Attr.Index == 1, "Attribute sret not on first parameter!", V);
568 Attributes FAttrs = Attrs.getFnAttributes();
569 Attributes NotFn = FAttrs & (~Attribute::FunctionOnly);
570 Assert1(!NotFn, "Attribute " + Attribute::getAsString(NotFn) +
571 " does not apply to the function!", V);
574 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
575 Attributes MutI = FAttrs & Attribute::MutuallyIncompatible[i];
576 Assert1(!(MutI & (MutI - 1)), "Attributes " +
577 Attribute::getAsString(MutI) + " are incompatible!", V);
581 static bool VerifyAttributeCount(const AttrListPtr &Attrs, unsigned Params) {
585 unsigned LastSlot = Attrs.getNumSlots() - 1;
586 unsigned LastIndex = Attrs.getSlot(LastSlot).Index;
587 if (LastIndex <= Params
588 || (LastIndex == (unsigned)~0
589 && (LastSlot == 0 || Attrs.getSlot(LastSlot - 1).Index <= Params)))
595 // visitFunction - Verify that a function is ok.
597 void Verifier::visitFunction(Function &F) {
598 // Check function arguments.
599 const FunctionType *FT = F.getFunctionType();
600 unsigned NumArgs = F.arg_size();
602 Assert1(Context == &F.getContext(),
603 "Function context does not match Module context!", &F);
605 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
606 Assert2(FT->getNumParams() == NumArgs,
607 "# formal arguments must match # of arguments for function type!",
609 Assert1(F.getReturnType()->isFirstClassType() ||
610 F.getReturnType()->isVoidTy() ||
611 isa<StructType>(F.getReturnType()),
612 "Functions cannot return aggregate values!", &F);
614 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
615 "Invalid struct return type!", &F);
617 const AttrListPtr &Attrs = F.getAttributes();
619 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
620 "Attributes after last parameter!", &F);
622 // Check function attributes.
623 VerifyFunctionAttrs(FT, Attrs, &F);
625 // Check that this function meets the restrictions on this calling convention.
626 switch (F.getCallingConv()) {
631 case CallingConv::Fast:
632 case CallingConv::Cold:
633 case CallingConv::X86_FastCall:
634 Assert1(!F.isVarArg(),
635 "Varargs functions must have C calling conventions!", &F);
639 bool isLLVMdotName = F.getName().size() >= 5 &&
640 F.getName().substr(0, 5) == "llvm.";
642 // Check that the argument values match the function type for this function...
644 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
646 Assert2(I->getType() == FT->getParamType(i),
647 "Argument value does not match function argument type!",
648 I, FT->getParamType(i));
649 Assert1(I->getType()->isFirstClassType(),
650 "Function arguments must have first-class types!", I);
652 Assert2(!I->getType()->isMetadataTy(),
653 "Function takes metadata but isn't an intrinsic", I, &F);
656 if (F.isMaterializable()) {
657 // Function has a body somewhere we can't see.
658 } else if (F.isDeclaration()) {
659 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
660 F.hasExternalWeakLinkage(),
661 "invalid linkage type for function declaration", &F);
663 // Verify that this function (which has a body) is not named "llvm.*". It
664 // is not legal to define intrinsics.
665 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
667 // Check the entry node
668 BasicBlock *Entry = &F.getEntryBlock();
669 Assert1(pred_begin(Entry) == pred_end(Entry),
670 "Entry block to function must not have predecessors!", Entry);
672 // The address of the entry block cannot be taken, unless it is dead.
673 if (Entry->hasAddressTaken()) {
674 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
675 "blockaddress may not be used with the entry block!", Entry);
679 // If this function is actually an intrinsic, verify that it is only used in
680 // direct call/invokes, never having its "address taken".
681 if (F.getIntrinsicID()) {
682 for (Value::use_iterator UI = F.use_begin(), E = F.use_end(); UI != E;++UI){
683 User *U = cast<User>(UI);
684 if ((isa<CallInst>(U) || isa<InvokeInst>(U)) && UI.getOperandNo() == 0)
685 continue; // Direct calls/invokes are ok.
687 Assert1(0, "Invalid user of intrinsic instruction!", U);
692 // verifyBasicBlock - Verify that a basic block is well formed...
694 void Verifier::visitBasicBlock(BasicBlock &BB) {
695 InstsInThisBlock.clear();
697 // Ensure that basic blocks have terminators!
698 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
700 // Check constraints that this basic block imposes on all of the PHI nodes in
702 if (isa<PHINode>(BB.front())) {
703 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
704 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
705 std::sort(Preds.begin(), Preds.end());
707 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
708 // Ensure that PHI nodes have at least one entry!
709 Assert1(PN->getNumIncomingValues() != 0,
710 "PHI nodes must have at least one entry. If the block is dead, "
711 "the PHI should be removed!", PN);
712 Assert1(PN->getNumIncomingValues() == Preds.size(),
713 "PHINode should have one entry for each predecessor of its "
714 "parent basic block!", PN);
716 // Get and sort all incoming values in the PHI node...
718 Values.reserve(PN->getNumIncomingValues());
719 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
720 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
721 PN->getIncomingValue(i)));
722 std::sort(Values.begin(), Values.end());
724 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
725 // Check to make sure that if there is more than one entry for a
726 // particular basic block in this PHI node, that the incoming values are
729 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
730 Values[i].second == Values[i-1].second,
731 "PHI node has multiple entries for the same basic block with "
732 "different incoming values!", PN, Values[i].first,
733 Values[i].second, Values[i-1].second);
735 // Check to make sure that the predecessors and PHI node entries are
737 Assert3(Values[i].first == Preds[i],
738 "PHI node entries do not match predecessors!", PN,
739 Values[i].first, Preds[i]);
745 void Verifier::visitTerminatorInst(TerminatorInst &I) {
746 // Ensure that terminators only exist at the end of the basic block.
747 Assert1(&I == I.getParent()->getTerminator(),
748 "Terminator found in the middle of a basic block!", I.getParent());
752 void Verifier::visitReturnInst(ReturnInst &RI) {
753 Function *F = RI.getParent()->getParent();
754 unsigned N = RI.getNumOperands();
755 if (F->getReturnType()->isVoidTy())
757 "Found return instr that returns non-void in Function of void "
758 "return type!", &RI, F->getReturnType());
759 else if (N == 1 && F->getReturnType() == RI.getOperand(0)->getType()) {
760 // Exactly one return value and it matches the return type. Good.
761 } else if (const StructType *STy = dyn_cast<StructType>(F->getReturnType())) {
762 // The return type is a struct; check for multiple return values.
763 Assert2(STy->getNumElements() == N,
764 "Incorrect number of return values in ret instruction!",
765 &RI, F->getReturnType());
766 for (unsigned i = 0; i != N; ++i)
767 Assert2(STy->getElementType(i) == RI.getOperand(i)->getType(),
768 "Function return type does not match operand "
769 "type of return inst!", &RI, F->getReturnType());
770 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(F->getReturnType())) {
771 // The return type is an array; check for multiple return values.
772 Assert2(ATy->getNumElements() == N,
773 "Incorrect number of return values in ret instruction!",
774 &RI, F->getReturnType());
775 for (unsigned i = 0; i != N; ++i)
776 Assert2(ATy->getElementType() == RI.getOperand(i)->getType(),
777 "Function return type does not match operand "
778 "type of return inst!", &RI, F->getReturnType());
780 CheckFailed("Function return type does not match operand "
781 "type of return inst!", &RI, F->getReturnType());
784 // Check to make sure that the return value has necessary properties for
786 visitTerminatorInst(RI);
789 void Verifier::visitSwitchInst(SwitchInst &SI) {
790 // Check to make sure that all of the constants in the switch instruction
791 // have the same type as the switched-on value.
792 const Type *SwitchTy = SI.getCondition()->getType();
793 SmallPtrSet<ConstantInt*, 32> Constants;
794 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i) {
795 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
796 "Switch constants must all be same type as switch value!", &SI);
797 Assert2(Constants.insert(SI.getCaseValue(i)),
798 "Duplicate integer as switch case", &SI, SI.getCaseValue(i));
801 visitTerminatorInst(SI);
804 void Verifier::visitSelectInst(SelectInst &SI) {
805 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
807 "Invalid operands for select instruction!", &SI);
809 Assert1(SI.getTrueValue()->getType() == SI.getType(),
810 "Select values must have same type as select instruction!", &SI);
811 visitInstruction(SI);
814 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
815 /// a pass, if any exist, it's an error.
817 void Verifier::visitUserOp1(Instruction &I) {
818 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
821 void Verifier::visitTruncInst(TruncInst &I) {
822 // Get the source and destination types
823 const Type *SrcTy = I.getOperand(0)->getType();
824 const Type *DestTy = I.getType();
826 // Get the size of the types in bits, we'll need this later
827 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
828 unsigned DestBitSize = DestTy->getScalarSizeInBits();
830 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
831 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
832 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
833 "trunc source and destination must both be a vector or neither", &I);
834 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
839 void Verifier::visitZExtInst(ZExtInst &I) {
840 // Get the source and destination types
841 const Type *SrcTy = I.getOperand(0)->getType();
842 const Type *DestTy = I.getType();
844 // Get the size of the types in bits, we'll need this later
845 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
846 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
847 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
848 "zext source and destination must both be a vector or neither", &I);
849 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
850 unsigned DestBitSize = DestTy->getScalarSizeInBits();
852 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
857 void Verifier::visitSExtInst(SExtInst &I) {
858 // Get the source and destination types
859 const Type *SrcTy = I.getOperand(0)->getType();
860 const Type *DestTy = I.getType();
862 // Get the size of the types in bits, we'll need this later
863 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
864 unsigned DestBitSize = DestTy->getScalarSizeInBits();
866 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
867 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
868 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
869 "sext source and destination must both be a vector or neither", &I);
870 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
875 void Verifier::visitFPTruncInst(FPTruncInst &I) {
876 // Get the source and destination types
877 const Type *SrcTy = I.getOperand(0)->getType();
878 const Type *DestTy = I.getType();
879 // Get the size of the types in bits, we'll need this later
880 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
881 unsigned DestBitSize = DestTy->getScalarSizeInBits();
883 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
884 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
885 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
886 "fptrunc source and destination must both be a vector or neither",&I);
887 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
892 void Verifier::visitFPExtInst(FPExtInst &I) {
893 // Get the source and destination types
894 const Type *SrcTy = I.getOperand(0)->getType();
895 const Type *DestTy = I.getType();
897 // Get the size of the types in bits, we'll need this later
898 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
899 unsigned DestBitSize = DestTy->getScalarSizeInBits();
901 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
902 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
903 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
904 "fpext source and destination must both be a vector or neither", &I);
905 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
910 void Verifier::visitUIToFPInst(UIToFPInst &I) {
911 // Get the source and destination types
912 const Type *SrcTy = I.getOperand(0)->getType();
913 const Type *DestTy = I.getType();
915 bool SrcVec = isa<VectorType>(SrcTy);
916 bool DstVec = isa<VectorType>(DestTy);
918 Assert1(SrcVec == DstVec,
919 "UIToFP source and dest must both be vector or scalar", &I);
920 Assert1(SrcTy->isIntOrIntVectorTy(),
921 "UIToFP source must be integer or integer vector", &I);
922 Assert1(DestTy->isFPOrFPVectorTy(),
923 "UIToFP result must be FP or FP vector", &I);
925 if (SrcVec && DstVec)
926 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
927 cast<VectorType>(DestTy)->getNumElements(),
928 "UIToFP source and dest vector length mismatch", &I);
933 void Verifier::visitSIToFPInst(SIToFPInst &I) {
934 // Get the source and destination types
935 const Type *SrcTy = I.getOperand(0)->getType();
936 const Type *DestTy = I.getType();
938 bool SrcVec = isa<VectorType>(SrcTy);
939 bool DstVec = isa<VectorType>(DestTy);
941 Assert1(SrcVec == DstVec,
942 "SIToFP source and dest must both be vector or scalar", &I);
943 Assert1(SrcTy->isIntOrIntVectorTy(),
944 "SIToFP source must be integer or integer vector", &I);
945 Assert1(DestTy->isFPOrFPVectorTy(),
946 "SIToFP result must be FP or FP vector", &I);
948 if (SrcVec && DstVec)
949 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
950 cast<VectorType>(DestTy)->getNumElements(),
951 "SIToFP source and dest vector length mismatch", &I);
956 void Verifier::visitFPToUIInst(FPToUIInst &I) {
957 // Get the source and destination types
958 const Type *SrcTy = I.getOperand(0)->getType();
959 const Type *DestTy = I.getType();
961 bool SrcVec = isa<VectorType>(SrcTy);
962 bool DstVec = isa<VectorType>(DestTy);
964 Assert1(SrcVec == DstVec,
965 "FPToUI source and dest must both be vector or scalar", &I);
966 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
968 Assert1(DestTy->isIntOrIntVectorTy(),
969 "FPToUI result must be integer or integer vector", &I);
971 if (SrcVec && DstVec)
972 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
973 cast<VectorType>(DestTy)->getNumElements(),
974 "FPToUI source and dest vector length mismatch", &I);
979 void Verifier::visitFPToSIInst(FPToSIInst &I) {
980 // Get the source and destination types
981 const Type *SrcTy = I.getOperand(0)->getType();
982 const Type *DestTy = I.getType();
984 bool SrcVec = isa<VectorType>(SrcTy);
985 bool DstVec = isa<VectorType>(DestTy);
987 Assert1(SrcVec == DstVec,
988 "FPToSI source and dest must both be vector or scalar", &I);
989 Assert1(SrcTy->isFPOrFPVectorTy(),
990 "FPToSI source must be FP or FP vector", &I);
991 Assert1(DestTy->isIntOrIntVectorTy(),
992 "FPToSI result must be integer or integer vector", &I);
994 if (SrcVec && DstVec)
995 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
996 cast<VectorType>(DestTy)->getNumElements(),
997 "FPToSI source and dest vector length mismatch", &I);
1002 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1003 // Get the source and destination types
1004 const Type *SrcTy = I.getOperand(0)->getType();
1005 const Type *DestTy = I.getType();
1007 Assert1(isa<PointerType>(SrcTy), "PtrToInt source must be pointer", &I);
1008 Assert1(DestTy->isIntegerTy(), "PtrToInt result must be integral", &I);
1010 visitInstruction(I);
1013 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1014 // Get the source and destination types
1015 const Type *SrcTy = I.getOperand(0)->getType();
1016 const Type *DestTy = I.getType();
1018 Assert1(SrcTy->isIntegerTy(), "IntToPtr source must be an integral", &I);
1019 Assert1(isa<PointerType>(DestTy), "IntToPtr result must be a pointer",&I);
1021 visitInstruction(I);
1024 void Verifier::visitBitCastInst(BitCastInst &I) {
1025 // Get the source and destination types
1026 const Type *SrcTy = I.getOperand(0)->getType();
1027 const Type *DestTy = I.getType();
1029 // Get the size of the types in bits, we'll need this later
1030 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1031 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
1033 // BitCast implies a no-op cast of type only. No bits change.
1034 // However, you can't cast pointers to anything but pointers.
1035 Assert1(isa<PointerType>(DestTy) == isa<PointerType>(DestTy),
1036 "Bitcast requires both operands to be pointer or neither", &I);
1037 Assert1(SrcBitSize == DestBitSize, "Bitcast requires types of same width",&I);
1039 // Disallow aggregates.
1040 Assert1(!SrcTy->isAggregateType(),
1041 "Bitcast operand must not be aggregate", &I);
1042 Assert1(!DestTy->isAggregateType(),
1043 "Bitcast type must not be aggregate", &I);
1045 visitInstruction(I);
1048 /// visitPHINode - Ensure that a PHI node is well formed.
1050 void Verifier::visitPHINode(PHINode &PN) {
1051 // Ensure that the PHI nodes are all grouped together at the top of the block.
1052 // This can be tested by checking whether the instruction before this is
1053 // either nonexistent (because this is begin()) or is a PHI node. If not,
1054 // then there is some other instruction before a PHI.
1055 Assert2(&PN == &PN.getParent()->front() ||
1056 isa<PHINode>(--BasicBlock::iterator(&PN)),
1057 "PHI nodes not grouped at top of basic block!",
1058 &PN, PN.getParent());
1060 // Check that all of the values of the PHI node have the same type as the
1061 // result, and that the incoming blocks are really basic blocks.
1062 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1063 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1064 "PHI node operands are not the same type as the result!", &PN);
1065 Assert1(isa<BasicBlock>(PN.getOperand(
1066 PHINode::getOperandNumForIncomingBlock(i))),
1067 "PHI node incoming block is not a BasicBlock!", &PN);
1070 // All other PHI node constraints are checked in the visitBasicBlock method.
1072 visitInstruction(PN);
1075 void Verifier::VerifyCallSite(CallSite CS) {
1076 Instruction *I = CS.getInstruction();
1078 Assert1(isa<PointerType>(CS.getCalledValue()->getType()),
1079 "Called function must be a pointer!", I);
1080 const PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1082 Assert1(isa<FunctionType>(FPTy->getElementType()),
1083 "Called function is not pointer to function type!", I);
1084 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1086 // Verify that the correct number of arguments are being passed
1087 if (FTy->isVarArg())
1088 Assert1(CS.arg_size() >= FTy->getNumParams(),
1089 "Called function requires more parameters than were provided!",I);
1091 Assert1(CS.arg_size() == FTy->getNumParams(),
1092 "Incorrect number of arguments passed to called function!", I);
1094 // Verify that all arguments to the call match the function type...
1095 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1096 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1097 "Call parameter type does not match function signature!",
1098 CS.getArgument(i), FTy->getParamType(i), I);
1100 const AttrListPtr &Attrs = CS.getAttributes();
1102 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1103 "Attributes after last parameter!", I);
1105 // Verify call attributes.
1106 VerifyFunctionAttrs(FTy, Attrs, I);
1108 if (FTy->isVarArg())
1109 // Check attributes on the varargs part.
1110 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1111 Attributes Attr = Attrs.getParamAttributes(Idx);
1113 VerifyParameterAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
1115 Attributes VArgI = Attr & Attribute::VarArgsIncompatible;
1116 Assert1(!VArgI, "Attribute " + Attribute::getAsString(VArgI) +
1117 " cannot be used for vararg call arguments!", I);
1120 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1121 if (!CS.getCalledFunction() || CS.getCalledFunction()->getName().size() < 5 ||
1122 CS.getCalledFunction()->getName().substr(0, 5) != "llvm.") {
1123 for (FunctionType::param_iterator PI = FTy->param_begin(),
1124 PE = FTy->param_end(); PI != PE; ++PI)
1125 Assert1(!PI->get()->isMetadataTy(),
1126 "Function has metadata parameter but isn't an intrinsic", I);
1129 visitInstruction(*I);
1132 void Verifier::visitCallInst(CallInst &CI) {
1133 VerifyCallSite(&CI);
1135 if (Function *F = CI.getCalledFunction())
1136 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1137 visitIntrinsicFunctionCall(ID, CI);
1140 void Verifier::visitInvokeInst(InvokeInst &II) {
1141 VerifyCallSite(&II);
1144 /// visitBinaryOperator - Check that both arguments to the binary operator are
1145 /// of the same type!
1147 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1148 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1149 "Both operands to a binary operator are not of the same type!", &B);
1151 switch (B.getOpcode()) {
1152 // Check that integer arithmetic operators are only used with
1153 // integral operands.
1154 case Instruction::Add:
1155 case Instruction::Sub:
1156 case Instruction::Mul:
1157 case Instruction::SDiv:
1158 case Instruction::UDiv:
1159 case Instruction::SRem:
1160 case Instruction::URem:
1161 Assert1(B.getType()->isIntOrIntVectorTy(),
1162 "Integer arithmetic operators only work with integral types!", &B);
1163 Assert1(B.getType() == B.getOperand(0)->getType(),
1164 "Integer arithmetic operators must have same type "
1165 "for operands and result!", &B);
1167 // Check that floating-point arithmetic operators are only used with
1168 // floating-point operands.
1169 case Instruction::FAdd:
1170 case Instruction::FSub:
1171 case Instruction::FMul:
1172 case Instruction::FDiv:
1173 case Instruction::FRem:
1174 Assert1(B.getType()->isFPOrFPVectorTy(),
1175 "Floating-point arithmetic operators only work with "
1176 "floating-point types!", &B);
1177 Assert1(B.getType() == B.getOperand(0)->getType(),
1178 "Floating-point arithmetic operators must have same type "
1179 "for operands and result!", &B);
1181 // Check that logical operators are only used with integral operands.
1182 case Instruction::And:
1183 case Instruction::Or:
1184 case Instruction::Xor:
1185 Assert1(B.getType()->isIntOrIntVectorTy(),
1186 "Logical operators only work with integral types!", &B);
1187 Assert1(B.getType() == B.getOperand(0)->getType(),
1188 "Logical operators must have same type for operands and result!",
1191 case Instruction::Shl:
1192 case Instruction::LShr:
1193 case Instruction::AShr:
1194 Assert1(B.getType()->isIntOrIntVectorTy(),
1195 "Shifts only work with integral types!", &B);
1196 Assert1(B.getType() == B.getOperand(0)->getType(),
1197 "Shift return type must be same as operands!", &B);
1200 llvm_unreachable("Unknown BinaryOperator opcode!");
1203 visitInstruction(B);
1206 void Verifier::visitICmpInst(ICmpInst& IC) {
1207 // Check that the operands are the same type
1208 const Type* Op0Ty = IC.getOperand(0)->getType();
1209 const Type* Op1Ty = IC.getOperand(1)->getType();
1210 Assert1(Op0Ty == Op1Ty,
1211 "Both operands to ICmp instruction are not of the same type!", &IC);
1212 // Check that the operands are the right type
1213 Assert1(Op0Ty->isIntOrIntVectorTy() || isa<PointerType>(Op0Ty),
1214 "Invalid operand types for ICmp instruction", &IC);
1216 visitInstruction(IC);
1219 void Verifier::visitFCmpInst(FCmpInst& FC) {
1220 // Check that the operands are the same type
1221 const Type* Op0Ty = FC.getOperand(0)->getType();
1222 const Type* Op1Ty = FC.getOperand(1)->getType();
1223 Assert1(Op0Ty == Op1Ty,
1224 "Both operands to FCmp instruction are not of the same type!", &FC);
1225 // Check that the operands are the right type
1226 Assert1(Op0Ty->isFPOrFPVectorTy(),
1227 "Invalid operand types for FCmp instruction", &FC);
1228 visitInstruction(FC);
1231 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1232 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1234 "Invalid extractelement operands!", &EI);
1235 visitInstruction(EI);
1238 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1239 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1242 "Invalid insertelement operands!", &IE);
1243 visitInstruction(IE);
1246 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1247 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1249 "Invalid shufflevector operands!", &SV);
1251 const VectorType *VTy = dyn_cast<VectorType>(SV.getOperand(0)->getType());
1252 Assert1(VTy, "Operands are not a vector type", &SV);
1254 // Check to see if Mask is valid.
1255 if (const ConstantVector *MV = dyn_cast<ConstantVector>(SV.getOperand(2))) {
1256 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1257 if (ConstantInt* CI = dyn_cast<ConstantInt>(MV->getOperand(i))) {
1258 Assert1(!CI->uge(VTy->getNumElements()*2),
1259 "Invalid shufflevector shuffle mask!", &SV);
1261 Assert1(isa<UndefValue>(MV->getOperand(i)),
1262 "Invalid shufflevector shuffle mask!", &SV);
1266 Assert1(isa<UndefValue>(SV.getOperand(2)) ||
1267 isa<ConstantAggregateZero>(SV.getOperand(2)),
1268 "Invalid shufflevector shuffle mask!", &SV);
1271 visitInstruction(SV);
1274 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1275 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1277 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
1278 Idxs.begin(), Idxs.end());
1279 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1280 Assert2(isa<PointerType>(GEP.getType()) &&
1281 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1282 "GEP is not of right type for indices!", &GEP, ElTy);
1283 visitInstruction(GEP);
1286 void Verifier::visitLoadInst(LoadInst &LI) {
1287 const PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1288 Assert1(PTy, "Load operand must be a pointer.", &LI);
1289 const Type *ElTy = PTy->getElementType();
1290 Assert2(ElTy == LI.getType(),
1291 "Load result type does not match pointer operand type!", &LI, ElTy);
1292 visitInstruction(LI);
1295 void Verifier::visitStoreInst(StoreInst &SI) {
1296 const PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1297 Assert1(PTy, "Load operand must be a pointer.", &SI);
1298 const Type *ElTy = PTy->getElementType();
1299 Assert2(ElTy == SI.getOperand(0)->getType(),
1300 "Stored value type does not match pointer operand type!",
1302 visitInstruction(SI);
1305 void Verifier::visitAllocaInst(AllocaInst &AI) {
1306 const PointerType *PTy = AI.getType();
1307 Assert1(PTy->getAddressSpace() == 0,
1308 "Allocation instruction pointer not in the generic address space!",
1310 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1312 Assert1(AI.getArraySize()->getType()->isIntegerTy(32),
1313 "Alloca array size must be i32", &AI);
1314 visitInstruction(AI);
1317 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1318 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1319 EVI.idx_begin(), EVI.idx_end()) ==
1321 "Invalid ExtractValueInst operands!", &EVI);
1323 visitInstruction(EVI);
1326 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1327 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1328 IVI.idx_begin(), IVI.idx_end()) ==
1329 IVI.getOperand(1)->getType(),
1330 "Invalid InsertValueInst operands!", &IVI);
1332 visitInstruction(IVI);
1335 /// verifyInstruction - Verify that an instruction is well formed.
1337 void Verifier::visitInstruction(Instruction &I) {
1338 BasicBlock *BB = I.getParent();
1339 Assert1(BB, "Instruction not embedded in basic block!", &I);
1341 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1342 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1344 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
1345 "Only PHI nodes may reference their own value!", &I);
1348 // Verify that if this is a terminator that it is at the end of the block.
1349 if (isa<TerminatorInst>(I))
1350 Assert1(BB->getTerminator() == &I, "Terminator not at end of block!", &I);
1352 // Check that void typed values don't have names
1353 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1354 "Instruction has a name, but provides a void value!", &I);
1356 // Check that the return value of the instruction is either void or a legal
1358 Assert1(I.getType()->isVoidTy() ||
1359 I.getType()->isFirstClassType(),
1360 "Instruction returns a non-scalar type!", &I);
1362 // Check that the instruction doesn't produce metadata. Calls are already
1363 // checked against the callee type.
1364 Assert1(!I.getType()->isMetadataTy() ||
1365 isa<CallInst>(I) || isa<InvokeInst>(I),
1366 "Invalid use of metadata!", &I);
1368 // Check that all uses of the instruction, if they are instructions
1369 // themselves, actually have parent basic blocks. If the use is not an
1370 // instruction, it is an error!
1371 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1373 if (Instruction *Used = dyn_cast<Instruction>(*UI))
1374 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1375 " embedded in a basic block!", &I, Used);
1377 CheckFailed("Use of instruction is not an instruction!", *UI);
1382 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1383 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1385 // Check to make sure that only first-class-values are operands to
1387 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1388 Assert1(0, "Instruction operands must be first-class values!", &I);
1391 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1392 // Check to make sure that the "address of" an intrinsic function is never
1394 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
1395 "Cannot take the address of an intrinsic!", &I);
1396 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1398 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1399 Assert1(OpBB->getParent() == BB->getParent(),
1400 "Referring to a basic block in another function!", &I);
1401 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1402 Assert1(OpArg->getParent() == BB->getParent(),
1403 "Referring to an argument in another function!", &I);
1404 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1405 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1407 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
1408 BasicBlock *OpBlock = Op->getParent();
1410 // Check that a definition dominates all of its uses.
1411 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1412 // Invoke results are only usable in the normal destination, not in the
1413 // exceptional destination.
1414 BasicBlock *NormalDest = II->getNormalDest();
1416 Assert2(NormalDest != II->getUnwindDest(),
1417 "No uses of invoke possible due to dominance structure!",
1420 // PHI nodes differ from other nodes because they actually "use" the
1421 // value in the predecessor basic blocks they correspond to.
1422 BasicBlock *UseBlock = BB;
1423 if (isa<PHINode>(I))
1424 UseBlock = dyn_cast<BasicBlock>(I.getOperand(i+1));
1425 Assert2(UseBlock, "Invoke operand is PHI node with bad incoming-BB",
1428 if (isa<PHINode>(I) && UseBlock == OpBlock) {
1429 // Special case of a phi node in the normal destination or the unwind
1431 Assert2(BB == NormalDest || !DT->isReachableFromEntry(UseBlock),
1432 "Invoke result not available in the unwind destination!",
1435 Assert2(DT->dominates(NormalDest, UseBlock) ||
1436 !DT->isReachableFromEntry(UseBlock),
1437 "Invoke result does not dominate all uses!", Op, &I);
1439 // If the normal successor of an invoke instruction has multiple
1440 // predecessors, then the normal edge from the invoke is critical,
1441 // so the invoke value can only be live if the destination block
1442 // dominates all of it's predecessors (other than the invoke).
1443 if (!NormalDest->getSinglePredecessor() &&
1444 DT->isReachableFromEntry(UseBlock))
1445 // If it is used by something non-phi, then the other case is that
1446 // 'NormalDest' dominates all of its predecessors other than the
1447 // invoke. In this case, the invoke value can still be used.
1448 for (pred_iterator PI = pred_begin(NormalDest),
1449 E = pred_end(NormalDest); PI != E; ++PI)
1450 if (*PI != II->getParent() && !DT->dominates(NormalDest, *PI) &&
1451 DT->isReachableFromEntry(*PI)) {
1452 CheckFailed("Invoke result does not dominate all uses!", Op,&I);
1456 } else if (isa<PHINode>(I)) {
1457 // PHI nodes are more difficult than other nodes because they actually
1458 // "use" the value in the predecessor basic blocks they correspond to.
1459 BasicBlock *PredBB = dyn_cast<BasicBlock>(I.getOperand(i+1));
1460 Assert2(PredBB && (DT->dominates(OpBlock, PredBB) ||
1461 !DT->isReachableFromEntry(PredBB)),
1462 "Instruction does not dominate all uses!", Op, &I);
1464 if (OpBlock == BB) {
1465 // If they are in the same basic block, make sure that the definition
1466 // comes before the use.
1467 Assert2(InstsInThisBlock.count(Op) || !DT->isReachableFromEntry(BB),
1468 "Instruction does not dominate all uses!", Op, &I);
1471 // Definition must dominate use unless use is unreachable!
1472 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, &I) ||
1473 !DT->isReachableFromEntry(BB),
1474 "Instruction does not dominate all uses!", Op, &I);
1476 } else if (isa<InlineAsm>(I.getOperand(i))) {
1477 Assert1(i == 0 && (isa<CallInst>(I) || isa<InvokeInst>(I)),
1478 "Cannot take the address of an inline asm!", &I);
1481 InstsInThisBlock.insert(&I);
1483 VerifyType(I.getType());
1486 /// VerifyType - Verify that a type is well formed.
1488 void Verifier::VerifyType(const Type *Ty) {
1489 if (!Types.insert(Ty)) return;
1491 Assert1(Context == &Ty->getContext(),
1492 "Type context does not match Module context!", Ty);
1494 switch (Ty->getTypeID()) {
1495 case Type::FunctionTyID: {
1496 const FunctionType *FTy = cast<FunctionType>(Ty);
1498 const Type *RetTy = FTy->getReturnType();
1499 Assert2(FunctionType::isValidReturnType(RetTy),
1500 "Function type with invalid return type", RetTy, FTy);
1503 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i) {
1504 const Type *ElTy = FTy->getParamType(i);
1505 Assert2(FunctionType::isValidArgumentType(ElTy),
1506 "Function type with invalid parameter type", ElTy, FTy);
1510 case Type::StructTyID: {
1511 const StructType *STy = cast<StructType>(Ty);
1512 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1513 const Type *ElTy = STy->getElementType(i);
1514 Assert2(StructType::isValidElementType(ElTy),
1515 "Structure type with invalid element type", ElTy, STy);
1519 case Type::ArrayTyID: {
1520 const ArrayType *ATy = cast<ArrayType>(Ty);
1521 Assert1(ArrayType::isValidElementType(ATy->getElementType()),
1522 "Array type with invalid element type", ATy);
1523 VerifyType(ATy->getElementType());
1525 case Type::PointerTyID: {
1526 const PointerType *PTy = cast<PointerType>(Ty);
1527 Assert1(PointerType::isValidElementType(PTy->getElementType()),
1528 "Pointer type with invalid element type", PTy);
1529 VerifyType(PTy->getElementType());
1531 case Type::VectorTyID: {
1532 const VectorType *VTy = cast<VectorType>(Ty);
1533 Assert1(VectorType::isValidElementType(VTy->getElementType()),
1534 "Vector type with invalid element type", VTy);
1535 VerifyType(VTy->getElementType());
1542 /// VerifyFunctionLocalMetadata - Verify that the specified MDNode is local to
1543 /// specified Function.
1544 void Verifier::VerifyFunctionLocalMetadata(MDNode *N, Function *F,
1545 SmallPtrSet<MDNode *, 32> &Visited) {
1546 assert(N->isFunctionLocal() && "Should only be called on function-local MD");
1548 // Only visit each node once.
1549 if (!Visited.insert(N))
1552 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
1553 Value *V = N->getOperand(i);
1556 Function *ActualF = 0;
1557 if (Instruction *I = dyn_cast<Instruction>(V))
1558 ActualF = I->getParent()->getParent();
1559 else if (BasicBlock *BB = dyn_cast<BasicBlock>(V))
1560 ActualF = BB->getParent();
1561 else if (Argument *A = dyn_cast<Argument>(V))
1562 ActualF = A->getParent();
1563 else if (MDNode *MD = dyn_cast<MDNode>(V))
1564 if (MD->isFunctionLocal())
1565 VerifyFunctionLocalMetadata(MD, F, Visited);
1567 // If this was an instruction, bb, or argument, verify that it is in the
1568 // function that we expect.
1569 Assert1(ActualF == 0 || ActualF == F,
1570 "function-local metadata used in wrong function", N);
1574 // Flags used by TableGen to mark intrinsic parameters with the
1575 // LLVMExtendedElementVectorType and LLVMTruncatedElementVectorType classes.
1576 static const unsigned ExtendedElementVectorType = 0x40000000;
1577 static const unsigned TruncatedElementVectorType = 0x20000000;
1579 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1581 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1582 Function *IF = CI.getCalledFunction();
1583 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1586 #define GET_INTRINSIC_VERIFIER
1587 #include "llvm/Intrinsics.gen"
1588 #undef GET_INTRINSIC_VERIFIER
1590 // If the intrinsic takes MDNode arguments, verify that they are either global
1591 // or are local to *this* function.
1592 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
1593 if (MDNode *MD = dyn_cast<MDNode>(CI.getOperand(i))) {
1594 if (!MD->isFunctionLocal()) continue;
1595 SmallPtrSet<MDNode *, 32> Visited;
1596 VerifyFunctionLocalMetadata(MD, CI.getParent()->getParent(), Visited);
1602 case Intrinsic::dbg_declare: { // llvm.dbg.declare
1603 Assert1(CI.getOperand(1) && isa<MDNode>(CI.getOperand(1)),
1604 "invalid llvm.dbg.declare intrinsic call 1", &CI);
1605 MDNode *MD = cast<MDNode>(CI.getOperand(1));
1606 Assert1(MD->getNumOperands() == 1,
1607 "invalid llvm.dbg.declare intrinsic call 2", &CI);
1608 if (MD->getOperand(0))
1609 if (Constant *C = dyn_cast<Constant>(MD->getOperand(0)))
1610 Assert1(C && !isa<ConstantPointerNull>(C),
1611 "invalid llvm.dbg.declare intrinsic call 3", &CI);
1613 case Intrinsic::memcpy:
1614 case Intrinsic::memmove:
1615 case Intrinsic::memset:
1616 Assert1(isa<ConstantInt>(CI.getOperand(4)),
1617 "alignment argument of memory intrinsics must be a constant int",
1620 case Intrinsic::gcroot:
1621 case Intrinsic::gcwrite:
1622 case Intrinsic::gcread:
1623 if (ID == Intrinsic::gcroot) {
1625 dyn_cast<AllocaInst>(CI.getOperand(1)->stripPointerCasts());
1626 Assert1(AI && isa<PointerType>(AI->getType()->getElementType()),
1627 "llvm.gcroot parameter #1 must be a pointer alloca.", &CI);
1628 Assert1(isa<Constant>(CI.getOperand(2)),
1629 "llvm.gcroot parameter #2 must be a constant.", &CI);
1632 Assert1(CI.getParent()->getParent()->hasGC(),
1633 "Enclosing function does not use GC.", &CI);
1635 case Intrinsic::init_trampoline:
1636 Assert1(isa<Function>(CI.getOperand(2)->stripPointerCasts()),
1637 "llvm.init_trampoline parameter #2 must resolve to a function.",
1640 case Intrinsic::prefetch:
1641 Assert1(isa<ConstantInt>(CI.getOperand(2)) &&
1642 isa<ConstantInt>(CI.getOperand(3)) &&
1643 cast<ConstantInt>(CI.getOperand(2))->getZExtValue() < 2 &&
1644 cast<ConstantInt>(CI.getOperand(3))->getZExtValue() < 4,
1645 "invalid arguments to llvm.prefetch",
1648 case Intrinsic::stackprotector:
1649 Assert1(isa<AllocaInst>(CI.getOperand(2)->stripPointerCasts()),
1650 "llvm.stackprotector parameter #2 must resolve to an alloca.",
1653 case Intrinsic::lifetime_start:
1654 case Intrinsic::lifetime_end:
1655 case Intrinsic::invariant_start:
1656 Assert1(isa<ConstantInt>(CI.getOperand(1)),
1657 "size argument of memory use markers must be a constant integer",
1660 case Intrinsic::invariant_end:
1661 Assert1(isa<ConstantInt>(CI.getOperand(2)),
1662 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
1667 /// Produce a string to identify an intrinsic parameter or return value.
1668 /// The ArgNo value numbers the return values from 0 to NumRets-1 and the
1669 /// parameters beginning with NumRets.
1671 static std::string IntrinsicParam(unsigned ArgNo, unsigned NumRets) {
1672 if (ArgNo < NumRets) {
1674 return "Intrinsic result type";
1676 return "Intrinsic result type #" + utostr(ArgNo);
1678 return "Intrinsic parameter #" + utostr(ArgNo - NumRets);
1681 bool Verifier::PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
1682 int VT, unsigned ArgNo, std::string &Suffix) {
1683 const FunctionType *FTy = F->getFunctionType();
1685 unsigned NumElts = 0;
1686 const Type *EltTy = Ty;
1687 const VectorType *VTy = dyn_cast<VectorType>(Ty);
1689 EltTy = VTy->getElementType();
1690 NumElts = VTy->getNumElements();
1693 const Type *RetTy = FTy->getReturnType();
1694 const StructType *ST = dyn_cast<StructType>(RetTy);
1695 unsigned NumRets = 1;
1697 NumRets = ST->getNumElements();
1702 // Check flags that indicate a type that is an integral vector type with
1703 // elements that are larger or smaller than the elements of the matched
1705 if ((Match & (ExtendedElementVectorType |
1706 TruncatedElementVectorType)) != 0) {
1707 const IntegerType *IEltTy = dyn_cast<IntegerType>(EltTy);
1708 if (!VTy || !IEltTy) {
1709 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not "
1710 "an integral vector type.", F);
1713 // Adjust the current Ty (in the opposite direction) rather than
1714 // the type being matched against.
1715 if ((Match & ExtendedElementVectorType) != 0) {
1716 if ((IEltTy->getBitWidth() & 1) != 0) {
1717 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " vector "
1718 "element bit-width is odd.", F);
1721 Ty = VectorType::getTruncatedElementVectorType(VTy);
1723 Ty = VectorType::getExtendedElementVectorType(VTy);
1724 Match &= ~(ExtendedElementVectorType | TruncatedElementVectorType);
1727 if (Match <= static_cast<int>(NumRets - 1)) {
1729 RetTy = ST->getElementType(Match);
1732 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " does not "
1733 "match return type.", F);
1737 if (Ty != FTy->getParamType(Match - NumRets)) {
1738 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " does not "
1739 "match parameter %" + utostr(Match - NumRets) + ".", F);
1743 } else if (VT == MVT::iAny) {
1744 if (!EltTy->isIntegerTy()) {
1745 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not "
1746 "an integer type.", F);
1750 unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
1754 Suffix += "v" + utostr(NumElts);
1756 Suffix += "i" + utostr(GotBits);
1758 // Check some constraints on various intrinsics.
1760 default: break; // Not everything needs to be checked.
1761 case Intrinsic::bswap:
1762 if (GotBits < 16 || GotBits % 16 != 0) {
1763 CheckFailed("Intrinsic requires even byte width argument", F);
1768 } else if (VT == MVT::fAny) {
1769 if (!EltTy->isFloatingPointTy()) {
1770 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not "
1771 "a floating-point type.", F);
1778 Suffix += "v" + utostr(NumElts);
1780 Suffix += EVT::getEVT(EltTy).getEVTString();
1781 } else if (VT == MVT::vAny) {
1783 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not a vector type.", F);
1786 Suffix += ".v" + utostr(NumElts) + EVT::getEVT(EltTy).getEVTString();
1787 } else if (VT == MVT::iPTR) {
1788 if (!isa<PointerType>(Ty)) {
1789 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not a "
1790 "pointer and a pointer is required.", F);
1793 } else if (VT == MVT::iPTRAny) {
1794 // Outside of TableGen, we don't distinguish iPTRAny (to any address space)
1795 // and iPTR. In the verifier, we can not distinguish which case we have so
1796 // allow either case to be legal.
1797 if (const PointerType* PTyp = dyn_cast<PointerType>(Ty)) {
1798 Suffix += ".p" + utostr(PTyp->getAddressSpace()) +
1799 EVT::getEVT(PTyp->getElementType()).getEVTString();
1801 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not a "
1802 "pointer and a pointer is required.", F);
1805 } else if (EVT((MVT::SimpleValueType)VT).isVector()) {
1806 EVT VVT = EVT((MVT::SimpleValueType)VT);
1808 // If this is a vector argument, verify the number and type of elements.
1809 if (VVT.getVectorElementType() != EVT::getEVT(EltTy)) {
1810 CheckFailed("Intrinsic prototype has incorrect vector element type!", F);
1814 if (VVT.getVectorNumElements() != NumElts) {
1815 CheckFailed("Intrinsic prototype has incorrect number of "
1816 "vector elements!", F);
1819 } else if (EVT((MVT::SimpleValueType)VT).getTypeForEVT(Ty->getContext()) !=
1821 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is wrong!", F);
1823 } else if (EltTy != Ty) {
1824 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is a vector "
1825 "and a scalar is required.", F);
1832 /// VerifyIntrinsicPrototype - TableGen emits calls to this function into
1833 /// Intrinsics.gen. This implements a little state machine that verifies the
1834 /// prototype of intrinsics.
1835 void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
1837 unsigned ParamNum, ...) {
1839 va_start(VA, ParamNum);
1840 const FunctionType *FTy = F->getFunctionType();
1842 // For overloaded intrinsics, the Suffix of the function name must match the
1843 // types of the arguments. This variable keeps track of the expected
1844 // suffix, to be checked at the end.
1847 if (FTy->getNumParams() + FTy->isVarArg() != ParamNum) {
1848 CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
1852 const Type *Ty = FTy->getReturnType();
1853 const StructType *ST = dyn_cast<StructType>(Ty);
1855 // Verify the return types.
1856 if (ST && ST->getNumElements() != RetNum) {
1857 CheckFailed("Intrinsic prototype has incorrect number of return types!", F);
1861 for (unsigned ArgNo = 0; ArgNo < RetNum; ++ArgNo) {
1862 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1864 if (ST) Ty = ST->getElementType(ArgNo);
1866 if (!PerformTypeCheck(ID, F, Ty, VT, ArgNo, Suffix))
1870 // Verify the parameter types.
1871 for (unsigned ArgNo = 0; ArgNo < ParamNum; ++ArgNo) {
1872 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1874 if (VT == MVT::isVoid && ArgNo > 0) {
1875 if (!FTy->isVarArg())
1876 CheckFailed("Intrinsic prototype has no '...'!", F);
1880 if (!PerformTypeCheck(ID, F, FTy->getParamType(ArgNo), VT, ArgNo + RetNum,
1887 // For intrinsics without pointer arguments, if we computed a Suffix then the
1888 // intrinsic is overloaded and we need to make sure that the name of the
1889 // function is correct. We add the suffix to the name of the intrinsic and
1890 // compare against the given function name. If they are not the same, the
1891 // function name is invalid. This ensures that overloading of intrinsics
1892 // uses a sane and consistent naming convention. Note that intrinsics with
1893 // pointer argument may or may not be overloaded so we will check assuming it
1894 // has a suffix and not.
1895 if (!Suffix.empty()) {
1896 std::string Name(Intrinsic::getName(ID));
1897 if (Name + Suffix != F->getName()) {
1898 CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
1899 F->getName().substr(Name.length()) + "'. It should be '" +
1904 // Check parameter attributes.
1905 Assert1(F->getAttributes() == Intrinsic::getAttributes(ID),
1906 "Intrinsic has wrong parameter attributes!", F);
1910 //===----------------------------------------------------------------------===//
1911 // Implement the public interfaces to this file...
1912 //===----------------------------------------------------------------------===//
1914 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1915 return new Verifier(action);
1919 // verifyFunction - Create
1920 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1921 Function &F = const_cast<Function&>(f);
1922 assert(!F.isDeclaration() && "Cannot verify external functions");
1924 FunctionPassManager FPM(F.getParent());
1925 Verifier *V = new Verifier(action);
1931 /// verifyModule - Check a module for errors, printing messages on stderr.
1932 /// Return true if the module is corrupt.
1934 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1935 std::string *ErrorInfo) {
1937 Verifier *V = new Verifier(action);
1939 PM.run(const_cast<Module&>(M));
1941 if (ErrorInfo && V->Broken)
1942 *ErrorInfo = V->MessagesStr.str();