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 report_fatal_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 visitBranchInst(BranchInst &BI);
321 void visitReturnInst(ReturnInst &RI);
322 void visitSwitchInst(SwitchInst &SI);
323 void visitSelectInst(SelectInst &SI);
324 void visitUserOp1(Instruction &I);
325 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
326 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
327 void visitAllocaInst(AllocaInst &AI);
328 void visitExtractValueInst(ExtractValueInst &EVI);
329 void visitInsertValueInst(InsertValueInst &IVI);
331 void VerifyCallSite(CallSite CS);
332 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
333 int VT, unsigned ArgNo, std::string &Suffix);
334 void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
335 unsigned RetNum, unsigned ParamNum, ...);
336 void VerifyFunctionLocalMetadata(MDNode *N, Function *F,
337 SmallPtrSet<MDNode *, 32> &Visited);
338 void VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
339 bool isReturnValue, const Value *V);
340 void VerifyFunctionAttrs(const FunctionType *FT, const AttrListPtr &Attrs,
342 void VerifyType(const Type *Ty);
344 void WriteValue(const Value *V) {
346 if (isa<Instruction>(V)) {
347 MessagesStr << *V << '\n';
349 WriteAsOperand(MessagesStr, V, true, Mod);
354 void WriteType(const Type *T) {
357 WriteTypeSymbolic(MessagesStr, T, Mod);
361 // CheckFailed - A check failed, so print out the condition and the message
362 // that failed. This provides a nice place to put a breakpoint if you want
363 // to see why something is not correct.
364 void CheckFailed(const Twine &Message,
365 const Value *V1 = 0, const Value *V2 = 0,
366 const Value *V3 = 0, const Value *V4 = 0) {
367 MessagesStr << Message.str() << "\n";
375 void CheckFailed(const Twine &Message, const Value *V1,
376 const Type *T2, const Value *V3 = 0) {
377 MessagesStr << Message.str() << "\n";
384 void CheckFailed(const Twine &Message, const Type *T1,
385 const Type *T2 = 0, const Type *T3 = 0) {
386 MessagesStr << Message.str() << "\n";
393 } // End anonymous namespace
395 char Verifier::ID = 0;
396 static RegisterPass<Verifier> X("verify", "Module Verifier");
398 // Assert - We know that cond should be true, if not print an error message.
399 #define Assert(C, M) \
400 do { if (!(C)) { CheckFailed(M); return; } } while (0)
401 #define Assert1(C, M, V1) \
402 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
403 #define Assert2(C, M, V1, V2) \
404 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
405 #define Assert3(C, M, V1, V2, V3) \
406 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
407 #define Assert4(C, M, V1, V2, V3, V4) \
408 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
410 void Verifier::visit(Instruction &I) {
411 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
412 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
413 InstVisitor<Verifier>::visit(I);
417 void Verifier::visitGlobalValue(GlobalValue &GV) {
418 Assert1(!GV.isDeclaration() ||
419 GV.isMaterializable() ||
420 GV.hasExternalLinkage() ||
421 GV.hasDLLImportLinkage() ||
422 GV.hasExternalWeakLinkage() ||
423 (isa<GlobalAlias>(GV) &&
424 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
425 "Global is external, but doesn't have external or dllimport or weak linkage!",
428 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
429 "Global is marked as dllimport, but not external", &GV);
431 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
432 "Only global variables can have appending linkage!", &GV);
434 if (GV.hasAppendingLinkage()) {
435 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
436 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
437 "Only global arrays can have appending linkage!", GVar);
441 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
442 if (GV.hasInitializer()) {
443 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
444 "Global variable initializer type does not match global "
445 "variable type!", &GV);
447 // If the global has common linkage, it must have a zero initializer and
448 // cannot be constant.
449 if (GV.hasCommonLinkage()) {
450 Assert1(GV.getInitializer()->isNullValue(),
451 "'common' global must have a zero initializer!", &GV);
452 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
456 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
457 GV.hasExternalWeakLinkage(),
458 "invalid linkage type for global declaration", &GV);
461 visitGlobalValue(GV);
464 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
465 Assert1(!GA.getName().empty(),
466 "Alias name cannot be empty!", &GA);
467 Assert1(GA.hasExternalLinkage() || GA.hasLocalLinkage() ||
469 "Alias should have external or external weak linkage!", &GA);
470 Assert1(GA.getAliasee(),
471 "Aliasee cannot be NULL!", &GA);
472 Assert1(GA.getType() == GA.getAliasee()->getType(),
473 "Alias and aliasee types should match!", &GA);
475 if (!isa<GlobalValue>(GA.getAliasee())) {
476 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
478 (CE->getOpcode() == Instruction::BitCast ||
479 CE->getOpcode() == Instruction::GetElementPtr) &&
480 isa<GlobalValue>(CE->getOperand(0)),
481 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
485 const GlobalValue* Aliasee = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
487 "Aliasing chain should end with function or global variable", &GA);
489 visitGlobalValue(GA);
492 void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
493 for (TypeSymbolTable::iterator I = ST.begin(), E = ST.end(); I != E; ++I)
494 VerifyType(I->second);
497 // VerifyParameterAttrs - Check the given attributes for an argument or return
498 // value of the specified type. The value V is printed in error messages.
499 void Verifier::VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
500 bool isReturnValue, const Value *V) {
501 if (Attrs == Attribute::None)
504 Attributes FnCheckAttr = Attrs & Attribute::FunctionOnly;
505 Assert1(!FnCheckAttr, "Attribute " + Attribute::getAsString(FnCheckAttr) +
506 " only applies to the function!", V);
509 Attributes RetI = Attrs & Attribute::ParameterOnly;
510 Assert1(!RetI, "Attribute " + Attribute::getAsString(RetI) +
511 " does not apply to return values!", V);
515 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
516 Attributes MutI = Attrs & Attribute::MutuallyIncompatible[i];
517 Assert1(!(MutI & (MutI - 1)), "Attributes " +
518 Attribute::getAsString(MutI) + " are incompatible!", V);
521 Attributes TypeI = Attrs & Attribute::typeIncompatible(Ty);
522 Assert1(!TypeI, "Wrong type for attribute " +
523 Attribute::getAsString(TypeI), V);
525 Attributes ByValI = Attrs & Attribute::ByVal;
526 if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
527 Assert1(!ByValI || PTy->getElementType()->isSized(),
528 "Attribute " + Attribute::getAsString(ByValI) +
529 " does not support unsized types!", V);
532 "Attribute " + Attribute::getAsString(ByValI) +
533 " only applies to parameters with pointer type!", V);
537 // VerifyFunctionAttrs - Check parameter attributes against a function type.
538 // The value V is printed in error messages.
539 void Verifier::VerifyFunctionAttrs(const FunctionType *FT,
540 const AttrListPtr &Attrs,
545 bool SawNest = false;
547 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
548 const AttributeWithIndex &Attr = Attrs.getSlot(i);
552 Ty = FT->getReturnType();
553 else if (Attr.Index-1 < FT->getNumParams())
554 Ty = FT->getParamType(Attr.Index-1);
556 break; // VarArgs attributes, verified elsewhere.
558 VerifyParameterAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
560 if (Attr.Attrs & Attribute::Nest) {
561 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
565 if (Attr.Attrs & Attribute::StructRet)
566 Assert1(Attr.Index == 1, "Attribute sret not on first parameter!", V);
569 Attributes FAttrs = Attrs.getFnAttributes();
570 Attributes NotFn = FAttrs & (~Attribute::FunctionOnly);
571 Assert1(!NotFn, "Attribute " + Attribute::getAsString(NotFn) +
572 " does not apply to the function!", V);
575 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
576 Attributes MutI = FAttrs & Attribute::MutuallyIncompatible[i];
577 Assert1(!(MutI & (MutI - 1)), "Attributes " +
578 Attribute::getAsString(MutI) + " are incompatible!", V);
582 static bool VerifyAttributeCount(const AttrListPtr &Attrs, unsigned Params) {
586 unsigned LastSlot = Attrs.getNumSlots() - 1;
587 unsigned LastIndex = Attrs.getSlot(LastSlot).Index;
588 if (LastIndex <= Params
589 || (LastIndex == (unsigned)~0
590 && (LastSlot == 0 || Attrs.getSlot(LastSlot - 1).Index <= Params)))
596 // visitFunction - Verify that a function is ok.
598 void Verifier::visitFunction(Function &F) {
599 // Check function arguments.
600 const FunctionType *FT = F.getFunctionType();
601 unsigned NumArgs = F.arg_size();
603 Assert1(Context == &F.getContext(),
604 "Function context does not match Module context!", &F);
606 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
607 Assert2(FT->getNumParams() == NumArgs,
608 "# formal arguments must match # of arguments for function type!",
610 Assert1(F.getReturnType()->isFirstClassType() ||
611 F.getReturnType()->isVoidTy() ||
612 F.getReturnType()->isStructTy(),
613 "Functions cannot return aggregate values!", &F);
615 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
616 "Invalid struct return type!", &F);
618 const AttrListPtr &Attrs = F.getAttributes();
620 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
621 "Attributes after last parameter!", &F);
623 // Check function attributes.
624 VerifyFunctionAttrs(FT, Attrs, &F);
626 // Check that this function meets the restrictions on this calling convention.
627 switch (F.getCallingConv()) {
632 case CallingConv::Fast:
633 case CallingConv::Cold:
634 case CallingConv::X86_FastCall:
635 Assert1(!F.isVarArg(),
636 "Varargs functions must have C calling conventions!", &F);
640 bool isLLVMdotName = F.getName().size() >= 5 &&
641 F.getName().substr(0, 5) == "llvm.";
643 // Check that the argument values match the function type for this function...
645 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
647 Assert2(I->getType() == FT->getParamType(i),
648 "Argument value does not match function argument type!",
649 I, FT->getParamType(i));
650 Assert1(I->getType()->isFirstClassType(),
651 "Function arguments must have first-class types!", I);
653 Assert2(!I->getType()->isMetadataTy(),
654 "Function takes metadata but isn't an intrinsic", I, &F);
657 if (F.isMaterializable()) {
658 // Function has a body somewhere we can't see.
659 } else if (F.isDeclaration()) {
660 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
661 F.hasExternalWeakLinkage(),
662 "invalid linkage type for function declaration", &F);
664 // Verify that this function (which has a body) is not named "llvm.*". It
665 // is not legal to define intrinsics.
666 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
668 // Check the entry node
669 BasicBlock *Entry = &F.getEntryBlock();
670 Assert1(pred_begin(Entry) == pred_end(Entry),
671 "Entry block to function must not have predecessors!", Entry);
673 // The address of the entry block cannot be taken, unless it is dead.
674 if (Entry->hasAddressTaken()) {
675 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
676 "blockaddress may not be used with the entry block!", Entry);
680 // If this function is actually an intrinsic, verify that it is only used in
681 // direct call/invokes, never having its "address taken".
682 if (F.getIntrinsicID()) {
684 if (F.hasAddressTaken(&U))
685 Assert1(0, "Invalid user of intrinsic instruction!", U);
689 // verifyBasicBlock - Verify that a basic block is well formed...
691 void Verifier::visitBasicBlock(BasicBlock &BB) {
692 InstsInThisBlock.clear();
694 // Ensure that basic blocks have terminators!
695 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
697 // Check constraints that this basic block imposes on all of the PHI nodes in
699 if (isa<PHINode>(BB.front())) {
700 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
701 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
702 std::sort(Preds.begin(), Preds.end());
704 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
705 // Ensure that PHI nodes have at least one entry!
706 Assert1(PN->getNumIncomingValues() != 0,
707 "PHI nodes must have at least one entry. If the block is dead, "
708 "the PHI should be removed!", PN);
709 Assert1(PN->getNumIncomingValues() == Preds.size(),
710 "PHINode should have one entry for each predecessor of its "
711 "parent basic block!", PN);
713 // Get and sort all incoming values in the PHI node...
715 Values.reserve(PN->getNumIncomingValues());
716 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
717 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
718 PN->getIncomingValue(i)));
719 std::sort(Values.begin(), Values.end());
721 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
722 // Check to make sure that if there is more than one entry for a
723 // particular basic block in this PHI node, that the incoming values are
726 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
727 Values[i].second == Values[i-1].second,
728 "PHI node has multiple entries for the same basic block with "
729 "different incoming values!", PN, Values[i].first,
730 Values[i].second, Values[i-1].second);
732 // Check to make sure that the predecessors and PHI node entries are
734 Assert3(Values[i].first == Preds[i],
735 "PHI node entries do not match predecessors!", PN,
736 Values[i].first, Preds[i]);
742 void Verifier::visitTerminatorInst(TerminatorInst &I) {
743 // Ensure that terminators only exist at the end of the basic block.
744 Assert1(&I == I.getParent()->getTerminator(),
745 "Terminator found in the middle of a basic block!", I.getParent());
749 void Verifier::visitBranchInst(BranchInst &BI) {
750 if (BI.isConditional()) {
751 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
752 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
754 visitTerminatorInst(BI);
757 void Verifier::visitReturnInst(ReturnInst &RI) {
758 Function *F = RI.getParent()->getParent();
759 unsigned N = RI.getNumOperands();
760 if (F->getReturnType()->isVoidTy())
762 "Found return instr that returns non-void in Function of void "
763 "return type!", &RI, F->getReturnType());
764 else if (N == 1 && F->getReturnType() == RI.getOperand(0)->getType()) {
765 // Exactly one return value and it matches the return type. Good.
766 } else if (const StructType *STy = dyn_cast<StructType>(F->getReturnType())) {
767 // The return type is a struct; check for multiple return values.
768 Assert2(STy->getNumElements() == N,
769 "Incorrect number of return values in ret instruction!",
770 &RI, F->getReturnType());
771 for (unsigned i = 0; i != N; ++i)
772 Assert2(STy->getElementType(i) == RI.getOperand(i)->getType(),
773 "Function return type does not match operand "
774 "type of return inst!", &RI, F->getReturnType());
775 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(F->getReturnType())) {
776 // The return type is an array; check for multiple return values.
777 Assert2(ATy->getNumElements() == N,
778 "Incorrect number of return values in ret instruction!",
779 &RI, F->getReturnType());
780 for (unsigned i = 0; i != N; ++i)
781 Assert2(ATy->getElementType() == RI.getOperand(i)->getType(),
782 "Function return type does not match operand "
783 "type of return inst!", &RI, F->getReturnType());
785 CheckFailed("Function return type does not match operand "
786 "type of return inst!", &RI, F->getReturnType());
789 // Check to make sure that the return value has necessary properties for
791 visitTerminatorInst(RI);
794 void Verifier::visitSwitchInst(SwitchInst &SI) {
795 // Check to make sure that all of the constants in the switch instruction
796 // have the same type as the switched-on value.
797 const Type *SwitchTy = SI.getCondition()->getType();
798 SmallPtrSet<ConstantInt*, 32> Constants;
799 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i) {
800 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
801 "Switch constants must all be same type as switch value!", &SI);
802 Assert2(Constants.insert(SI.getCaseValue(i)),
803 "Duplicate integer as switch case", &SI, SI.getCaseValue(i));
806 visitTerminatorInst(SI);
809 void Verifier::visitSelectInst(SelectInst &SI) {
810 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
812 "Invalid operands for select instruction!", &SI);
814 Assert1(SI.getTrueValue()->getType() == SI.getType(),
815 "Select values must have same type as select instruction!", &SI);
816 visitInstruction(SI);
819 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
820 /// a pass, if any exist, it's an error.
822 void Verifier::visitUserOp1(Instruction &I) {
823 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
826 void Verifier::visitTruncInst(TruncInst &I) {
827 // Get the source and destination types
828 const Type *SrcTy = I.getOperand(0)->getType();
829 const Type *DestTy = I.getType();
831 // Get the size of the types in bits, we'll need this later
832 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
833 unsigned DestBitSize = DestTy->getScalarSizeInBits();
835 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
836 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
837 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
838 "trunc source and destination must both be a vector or neither", &I);
839 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
844 void Verifier::visitZExtInst(ZExtInst &I) {
845 // Get the source and destination types
846 const Type *SrcTy = I.getOperand(0)->getType();
847 const Type *DestTy = I.getType();
849 // Get the size of the types in bits, we'll need this later
850 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
851 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
852 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
853 "zext source and destination must both be a vector or neither", &I);
854 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
855 unsigned DestBitSize = DestTy->getScalarSizeInBits();
857 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
862 void Verifier::visitSExtInst(SExtInst &I) {
863 // Get the source and destination types
864 const Type *SrcTy = I.getOperand(0)->getType();
865 const Type *DestTy = I.getType();
867 // Get the size of the types in bits, we'll need this later
868 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
869 unsigned DestBitSize = DestTy->getScalarSizeInBits();
871 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
872 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
873 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
874 "sext source and destination must both be a vector or neither", &I);
875 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
880 void Verifier::visitFPTruncInst(FPTruncInst &I) {
881 // Get the source and destination types
882 const Type *SrcTy = I.getOperand(0)->getType();
883 const Type *DestTy = I.getType();
884 // Get the size of the types in bits, we'll need this later
885 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
886 unsigned DestBitSize = DestTy->getScalarSizeInBits();
888 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
889 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
890 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
891 "fptrunc source and destination must both be a vector or neither",&I);
892 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
897 void Verifier::visitFPExtInst(FPExtInst &I) {
898 // Get the source and destination types
899 const Type *SrcTy = I.getOperand(0)->getType();
900 const Type *DestTy = I.getType();
902 // Get the size of the types in bits, we'll need this later
903 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
904 unsigned DestBitSize = DestTy->getScalarSizeInBits();
906 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
907 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
908 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
909 "fpext source and destination must both be a vector or neither", &I);
910 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
915 void Verifier::visitUIToFPInst(UIToFPInst &I) {
916 // Get the source and destination types
917 const Type *SrcTy = I.getOperand(0)->getType();
918 const Type *DestTy = I.getType();
920 bool SrcVec = SrcTy->isVectorTy();
921 bool DstVec = DestTy->isVectorTy();
923 Assert1(SrcVec == DstVec,
924 "UIToFP source and dest must both be vector or scalar", &I);
925 Assert1(SrcTy->isIntOrIntVectorTy(),
926 "UIToFP source must be integer or integer vector", &I);
927 Assert1(DestTy->isFPOrFPVectorTy(),
928 "UIToFP result must be FP or FP vector", &I);
930 if (SrcVec && DstVec)
931 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
932 cast<VectorType>(DestTy)->getNumElements(),
933 "UIToFP source and dest vector length mismatch", &I);
938 void Verifier::visitSIToFPInst(SIToFPInst &I) {
939 // Get the source and destination types
940 const Type *SrcTy = I.getOperand(0)->getType();
941 const Type *DestTy = I.getType();
943 bool SrcVec = SrcTy->isVectorTy();
944 bool DstVec = DestTy->isVectorTy();
946 Assert1(SrcVec == DstVec,
947 "SIToFP source and dest must both be vector or scalar", &I);
948 Assert1(SrcTy->isIntOrIntVectorTy(),
949 "SIToFP source must be integer or integer vector", &I);
950 Assert1(DestTy->isFPOrFPVectorTy(),
951 "SIToFP result must be FP or FP vector", &I);
953 if (SrcVec && DstVec)
954 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
955 cast<VectorType>(DestTy)->getNumElements(),
956 "SIToFP source and dest vector length mismatch", &I);
961 void Verifier::visitFPToUIInst(FPToUIInst &I) {
962 // Get the source and destination types
963 const Type *SrcTy = I.getOperand(0)->getType();
964 const Type *DestTy = I.getType();
966 bool SrcVec = SrcTy->isVectorTy();
967 bool DstVec = DestTy->isVectorTy();
969 Assert1(SrcVec == DstVec,
970 "FPToUI source and dest must both be vector or scalar", &I);
971 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
973 Assert1(DestTy->isIntOrIntVectorTy(),
974 "FPToUI result must be integer or integer vector", &I);
976 if (SrcVec && DstVec)
977 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
978 cast<VectorType>(DestTy)->getNumElements(),
979 "FPToUI source and dest vector length mismatch", &I);
984 void Verifier::visitFPToSIInst(FPToSIInst &I) {
985 // Get the source and destination types
986 const Type *SrcTy = I.getOperand(0)->getType();
987 const Type *DestTy = I.getType();
989 bool SrcVec = SrcTy->isVectorTy();
990 bool DstVec = DestTy->isVectorTy();
992 Assert1(SrcVec == DstVec,
993 "FPToSI source and dest must both be vector or scalar", &I);
994 Assert1(SrcTy->isFPOrFPVectorTy(),
995 "FPToSI source must be FP or FP vector", &I);
996 Assert1(DestTy->isIntOrIntVectorTy(),
997 "FPToSI result must be integer or integer vector", &I);
999 if (SrcVec && DstVec)
1000 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1001 cast<VectorType>(DestTy)->getNumElements(),
1002 "FPToSI source and dest vector length mismatch", &I);
1004 visitInstruction(I);
1007 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1008 // Get the source and destination types
1009 const Type *SrcTy = I.getOperand(0)->getType();
1010 const Type *DestTy = I.getType();
1012 Assert1(SrcTy->isPointerTy(), "PtrToInt source must be pointer", &I);
1013 Assert1(DestTy->isIntegerTy(), "PtrToInt result must be integral", &I);
1015 visitInstruction(I);
1018 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1019 // Get the source and destination types
1020 const Type *SrcTy = I.getOperand(0)->getType();
1021 const Type *DestTy = I.getType();
1023 Assert1(SrcTy->isIntegerTy(), "IntToPtr source must be an integral", &I);
1024 Assert1(DestTy->isPointerTy(), "IntToPtr result must be a pointer",&I);
1026 visitInstruction(I);
1029 void Verifier::visitBitCastInst(BitCastInst &I) {
1030 // Get the source and destination types
1031 const Type *SrcTy = I.getOperand(0)->getType();
1032 const Type *DestTy = I.getType();
1034 // Get the size of the types in bits, we'll need this later
1035 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1036 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
1038 // BitCast implies a no-op cast of type only. No bits change.
1039 // However, you can't cast pointers to anything but pointers.
1040 Assert1(DestTy->isPointerTy() == DestTy->isPointerTy(),
1041 "Bitcast requires both operands to be pointer or neither", &I);
1042 Assert1(SrcBitSize == DestBitSize, "Bitcast requires types of same width",&I);
1044 // Disallow aggregates.
1045 Assert1(!SrcTy->isAggregateType(),
1046 "Bitcast operand must not be aggregate", &I);
1047 Assert1(!DestTy->isAggregateType(),
1048 "Bitcast type must not be aggregate", &I);
1050 visitInstruction(I);
1053 /// visitPHINode - Ensure that a PHI node is well formed.
1055 void Verifier::visitPHINode(PHINode &PN) {
1056 // Ensure that the PHI nodes are all grouped together at the top of the block.
1057 // This can be tested by checking whether the instruction before this is
1058 // either nonexistent (because this is begin()) or is a PHI node. If not,
1059 // then there is some other instruction before a PHI.
1060 Assert2(&PN == &PN.getParent()->front() ||
1061 isa<PHINode>(--BasicBlock::iterator(&PN)),
1062 "PHI nodes not grouped at top of basic block!",
1063 &PN, PN.getParent());
1065 // Check that all of the values of the PHI node have the same type as the
1066 // result, and that the incoming blocks are really basic blocks.
1067 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1068 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1069 "PHI node operands are not the same type as the result!", &PN);
1070 Assert1(isa<BasicBlock>(PN.getOperand(
1071 PHINode::getOperandNumForIncomingBlock(i))),
1072 "PHI node incoming block is not a BasicBlock!", &PN);
1075 // All other PHI node constraints are checked in the visitBasicBlock method.
1077 visitInstruction(PN);
1080 void Verifier::VerifyCallSite(CallSite CS) {
1081 Instruction *I = CS.getInstruction();
1083 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1084 "Called function must be a pointer!", I);
1085 const PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1087 Assert1(FPTy->getElementType()->isFunctionTy(),
1088 "Called function is not pointer to function type!", I);
1089 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1091 // Verify that the correct number of arguments are being passed
1092 if (FTy->isVarArg())
1093 Assert1(CS.arg_size() >= FTy->getNumParams(),
1094 "Called function requires more parameters than were provided!",I);
1096 Assert1(CS.arg_size() == FTy->getNumParams(),
1097 "Incorrect number of arguments passed to called function!", I);
1099 // Verify that all arguments to the call match the function type...
1100 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1101 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1102 "Call parameter type does not match function signature!",
1103 CS.getArgument(i), FTy->getParamType(i), I);
1105 const AttrListPtr &Attrs = CS.getAttributes();
1107 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1108 "Attributes after last parameter!", I);
1110 // Verify call attributes.
1111 VerifyFunctionAttrs(FTy, Attrs, I);
1113 if (FTy->isVarArg())
1114 // Check attributes on the varargs part.
1115 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1116 Attributes Attr = Attrs.getParamAttributes(Idx);
1118 VerifyParameterAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
1120 Attributes VArgI = Attr & Attribute::VarArgsIncompatible;
1121 Assert1(!VArgI, "Attribute " + Attribute::getAsString(VArgI) +
1122 " cannot be used for vararg call arguments!", I);
1125 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1126 if (!CS.getCalledFunction() || CS.getCalledFunction()->getName().size() < 5 ||
1127 CS.getCalledFunction()->getName().substr(0, 5) != "llvm.") {
1128 for (FunctionType::param_iterator PI = FTy->param_begin(),
1129 PE = FTy->param_end(); PI != PE; ++PI)
1130 Assert1(!PI->get()->isMetadataTy(),
1131 "Function has metadata parameter but isn't an intrinsic", I);
1134 visitInstruction(*I);
1137 void Verifier::visitCallInst(CallInst &CI) {
1138 VerifyCallSite(&CI);
1140 if (Function *F = CI.getCalledFunction())
1141 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1142 visitIntrinsicFunctionCall(ID, CI);
1145 void Verifier::visitInvokeInst(InvokeInst &II) {
1146 VerifyCallSite(&II);
1149 /// visitBinaryOperator - Check that both arguments to the binary operator are
1150 /// of the same type!
1152 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1153 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1154 "Both operands to a binary operator are not of the same type!", &B);
1156 switch (B.getOpcode()) {
1157 // Check that integer arithmetic operators are only used with
1158 // integral operands.
1159 case Instruction::Add:
1160 case Instruction::Sub:
1161 case Instruction::Mul:
1162 case Instruction::SDiv:
1163 case Instruction::UDiv:
1164 case Instruction::SRem:
1165 case Instruction::URem:
1166 Assert1(B.getType()->isIntOrIntVectorTy(),
1167 "Integer arithmetic operators only work with integral types!", &B);
1168 Assert1(B.getType() == B.getOperand(0)->getType(),
1169 "Integer arithmetic operators must have same type "
1170 "for operands and result!", &B);
1172 // Check that floating-point arithmetic operators are only used with
1173 // floating-point operands.
1174 case Instruction::FAdd:
1175 case Instruction::FSub:
1176 case Instruction::FMul:
1177 case Instruction::FDiv:
1178 case Instruction::FRem:
1179 Assert1(B.getType()->isFPOrFPVectorTy(),
1180 "Floating-point arithmetic operators only work with "
1181 "floating-point types!", &B);
1182 Assert1(B.getType() == B.getOperand(0)->getType(),
1183 "Floating-point arithmetic operators must have same type "
1184 "for operands and result!", &B);
1186 // Check that logical operators are only used with integral operands.
1187 case Instruction::And:
1188 case Instruction::Or:
1189 case Instruction::Xor:
1190 Assert1(B.getType()->isIntOrIntVectorTy(),
1191 "Logical operators only work with integral types!", &B);
1192 Assert1(B.getType() == B.getOperand(0)->getType(),
1193 "Logical operators must have same type for operands and result!",
1196 case Instruction::Shl:
1197 case Instruction::LShr:
1198 case Instruction::AShr:
1199 Assert1(B.getType()->isIntOrIntVectorTy(),
1200 "Shifts only work with integral types!", &B);
1201 Assert1(B.getType() == B.getOperand(0)->getType(),
1202 "Shift return type must be same as operands!", &B);
1205 llvm_unreachable("Unknown BinaryOperator opcode!");
1208 visitInstruction(B);
1211 void Verifier::visitICmpInst(ICmpInst& IC) {
1212 // Check that the operands are the same type
1213 const Type* Op0Ty = IC.getOperand(0)->getType();
1214 const Type* Op1Ty = IC.getOperand(1)->getType();
1215 Assert1(Op0Ty == Op1Ty,
1216 "Both operands to ICmp instruction are not of the same type!", &IC);
1217 // Check that the operands are the right type
1218 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->isPointerTy(),
1219 "Invalid operand types for ICmp instruction", &IC);
1221 visitInstruction(IC);
1224 void Verifier::visitFCmpInst(FCmpInst& FC) {
1225 // Check that the operands are the same type
1226 const Type* Op0Ty = FC.getOperand(0)->getType();
1227 const Type* Op1Ty = FC.getOperand(1)->getType();
1228 Assert1(Op0Ty == Op1Ty,
1229 "Both operands to FCmp instruction are not of the same type!", &FC);
1230 // Check that the operands are the right type
1231 Assert1(Op0Ty->isFPOrFPVectorTy(),
1232 "Invalid operand types for FCmp instruction", &FC);
1233 visitInstruction(FC);
1236 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1237 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1239 "Invalid extractelement operands!", &EI);
1240 visitInstruction(EI);
1243 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1244 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1247 "Invalid insertelement operands!", &IE);
1248 visitInstruction(IE);
1251 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1252 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1254 "Invalid shufflevector operands!", &SV);
1256 const VectorType *VTy = dyn_cast<VectorType>(SV.getOperand(0)->getType());
1257 Assert1(VTy, "Operands are not a vector type", &SV);
1259 // Check to see if Mask is valid.
1260 if (const ConstantVector *MV = dyn_cast<ConstantVector>(SV.getOperand(2))) {
1261 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1262 if (ConstantInt* CI = dyn_cast<ConstantInt>(MV->getOperand(i))) {
1263 Assert1(!CI->uge(VTy->getNumElements()*2),
1264 "Invalid shufflevector shuffle mask!", &SV);
1266 Assert1(isa<UndefValue>(MV->getOperand(i)),
1267 "Invalid shufflevector shuffle mask!", &SV);
1271 Assert1(isa<UndefValue>(SV.getOperand(2)) ||
1272 isa<ConstantAggregateZero>(SV.getOperand(2)),
1273 "Invalid shufflevector shuffle mask!", &SV);
1276 visitInstruction(SV);
1279 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1280 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1282 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
1283 Idxs.begin(), Idxs.end());
1284 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1285 Assert2(GEP.getType()->isPointerTy() &&
1286 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1287 "GEP is not of right type for indices!", &GEP, ElTy);
1288 visitInstruction(GEP);
1291 void Verifier::visitLoadInst(LoadInst &LI) {
1292 const PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1293 Assert1(PTy, "Load operand must be a pointer.", &LI);
1294 const Type *ElTy = PTy->getElementType();
1295 Assert2(ElTy == LI.getType(),
1296 "Load result type does not match pointer operand type!", &LI, ElTy);
1297 visitInstruction(LI);
1300 void Verifier::visitStoreInst(StoreInst &SI) {
1301 const PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1302 Assert1(PTy, "Load operand must be a pointer.", &SI);
1303 const Type *ElTy = PTy->getElementType();
1304 Assert2(ElTy == SI.getOperand(0)->getType(),
1305 "Stored value type does not match pointer operand type!",
1307 visitInstruction(SI);
1310 void Verifier::visitAllocaInst(AllocaInst &AI) {
1311 const PointerType *PTy = AI.getType();
1312 Assert1(PTy->getAddressSpace() == 0,
1313 "Allocation instruction pointer not in the generic address space!",
1315 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1317 Assert1(AI.getArraySize()->getType()->isIntegerTy(32),
1318 "Alloca array size must be i32", &AI);
1319 visitInstruction(AI);
1322 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1323 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1324 EVI.idx_begin(), EVI.idx_end()) ==
1326 "Invalid ExtractValueInst operands!", &EVI);
1328 visitInstruction(EVI);
1331 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1332 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1333 IVI.idx_begin(), IVI.idx_end()) ==
1334 IVI.getOperand(1)->getType(),
1335 "Invalid InsertValueInst operands!", &IVI);
1337 visitInstruction(IVI);
1340 /// verifyInstruction - Verify that an instruction is well formed.
1342 void Verifier::visitInstruction(Instruction &I) {
1343 BasicBlock *BB = I.getParent();
1344 Assert1(BB, "Instruction not embedded in basic block!", &I);
1346 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1347 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1349 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
1350 "Only PHI nodes may reference their own value!", &I);
1353 // Verify that if this is a terminator that it is at the end of the block.
1354 if (isa<TerminatorInst>(I))
1355 Assert1(BB->getTerminator() == &I, "Terminator not at end of block!", &I);
1357 // Check that void typed values don't have names
1358 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1359 "Instruction has a name, but provides a void value!", &I);
1361 // Check that the return value of the instruction is either void or a legal
1363 Assert1(I.getType()->isVoidTy() ||
1364 I.getType()->isFirstClassType(),
1365 "Instruction returns a non-scalar type!", &I);
1367 // Check that the instruction doesn't produce metadata. Calls are already
1368 // checked against the callee type.
1369 Assert1(!I.getType()->isMetadataTy() ||
1370 isa<CallInst>(I) || isa<InvokeInst>(I),
1371 "Invalid use of metadata!", &I);
1373 // Check that all uses of the instruction, if they are instructions
1374 // themselves, actually have parent basic blocks. If the use is not an
1375 // instruction, it is an error!
1376 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1378 if (Instruction *Used = dyn_cast<Instruction>(*UI))
1379 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1380 " embedded in a basic block!", &I, Used);
1382 CheckFailed("Use of instruction is not an instruction!", *UI);
1387 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1388 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1390 // Check to make sure that only first-class-values are operands to
1392 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1393 Assert1(0, "Instruction operands must be first-class values!", &I);
1396 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1397 // Check to make sure that the "address of" an intrinsic function is never
1399 Assert1(!F->isIntrinsic() || (i + 1 == e && isa<CallInst>(I)),
1400 "Cannot take the address of an intrinsic!", &I);
1401 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1403 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1404 Assert1(OpBB->getParent() == BB->getParent(),
1405 "Referring to a basic block in another function!", &I);
1406 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1407 Assert1(OpArg->getParent() == BB->getParent(),
1408 "Referring to an argument in another function!", &I);
1409 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1410 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1412 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
1413 BasicBlock *OpBlock = Op->getParent();
1415 // Check that a definition dominates all of its uses.
1416 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1417 // Invoke results are only usable in the normal destination, not in the
1418 // exceptional destination.
1419 BasicBlock *NormalDest = II->getNormalDest();
1421 Assert2(NormalDest != II->getUnwindDest(),
1422 "No uses of invoke possible due to dominance structure!",
1425 // PHI nodes differ from other nodes because they actually "use" the
1426 // value in the predecessor basic blocks they correspond to.
1427 BasicBlock *UseBlock = BB;
1428 if (isa<PHINode>(I))
1429 UseBlock = dyn_cast<BasicBlock>(I.getOperand(i+1));
1430 Assert2(UseBlock, "Invoke operand is PHI node with bad incoming-BB",
1433 if (isa<PHINode>(I) && UseBlock == OpBlock) {
1434 // Special case of a phi node in the normal destination or the unwind
1436 Assert2(BB == NormalDest || !DT->isReachableFromEntry(UseBlock),
1437 "Invoke result not available in the unwind destination!",
1440 Assert2(DT->dominates(NormalDest, UseBlock) ||
1441 !DT->isReachableFromEntry(UseBlock),
1442 "Invoke result does not dominate all uses!", Op, &I);
1444 // If the normal successor of an invoke instruction has multiple
1445 // predecessors, then the normal edge from the invoke is critical,
1446 // so the invoke value can only be live if the destination block
1447 // dominates all of it's predecessors (other than the invoke).
1448 if (!NormalDest->getSinglePredecessor() &&
1449 DT->isReachableFromEntry(UseBlock))
1450 // If it is used by something non-phi, then the other case is that
1451 // 'NormalDest' dominates all of its predecessors other than the
1452 // invoke. In this case, the invoke value can still be used.
1453 for (pred_iterator PI = pred_begin(NormalDest),
1454 E = pred_end(NormalDest); PI != E; ++PI)
1455 if (*PI != II->getParent() && !DT->dominates(NormalDest, *PI) &&
1456 DT->isReachableFromEntry(*PI)) {
1457 CheckFailed("Invoke result does not dominate all uses!", Op,&I);
1461 } else if (isa<PHINode>(I)) {
1462 // PHI nodes are more difficult than other nodes because they actually
1463 // "use" the value in the predecessor basic blocks they correspond to.
1464 BasicBlock *PredBB = dyn_cast<BasicBlock>(I.getOperand(i+1));
1465 Assert2(PredBB && (DT->dominates(OpBlock, PredBB) ||
1466 !DT->isReachableFromEntry(PredBB)),
1467 "Instruction does not dominate all uses!", Op, &I);
1469 if (OpBlock == BB) {
1470 // If they are in the same basic block, make sure that the definition
1471 // comes before the use.
1472 Assert2(InstsInThisBlock.count(Op) || !DT->isReachableFromEntry(BB),
1473 "Instruction does not dominate all uses!", Op, &I);
1476 // Definition must dominate use unless use is unreachable!
1477 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, &I) ||
1478 !DT->isReachableFromEntry(BB),
1479 "Instruction does not dominate all uses!", Op, &I);
1481 } else if (isa<InlineAsm>(I.getOperand(i))) {
1482 Assert1((i + 1 == e && isa<CallInst>(I)) ||
1483 (i + 3 == e && isa<InvokeInst>(I)),
1484 "Cannot take the address of an inline asm!", &I);
1487 InstsInThisBlock.insert(&I);
1489 VerifyType(I.getType());
1492 /// VerifyType - Verify that a type is well formed.
1494 void Verifier::VerifyType(const Type *Ty) {
1495 if (!Types.insert(Ty)) return;
1497 Assert1(Context == &Ty->getContext(),
1498 "Type context does not match Module context!", Ty);
1500 switch (Ty->getTypeID()) {
1501 case Type::FunctionTyID: {
1502 const FunctionType *FTy = cast<FunctionType>(Ty);
1504 const Type *RetTy = FTy->getReturnType();
1505 Assert2(FunctionType::isValidReturnType(RetTy),
1506 "Function type with invalid return type", RetTy, FTy);
1509 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i) {
1510 const Type *ElTy = FTy->getParamType(i);
1511 Assert2(FunctionType::isValidArgumentType(ElTy),
1512 "Function type with invalid parameter type", ElTy, FTy);
1516 case Type::StructTyID: {
1517 const StructType *STy = cast<StructType>(Ty);
1518 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1519 const Type *ElTy = STy->getElementType(i);
1520 Assert2(StructType::isValidElementType(ElTy),
1521 "Structure type with invalid element type", ElTy, STy);
1525 case Type::UnionTyID: {
1526 const UnionType *UTy = cast<UnionType>(Ty);
1527 for (unsigned i = 0, e = UTy->getNumElements(); i != e; ++i) {
1528 const Type *ElTy = UTy->getElementType(i);
1529 Assert2(UnionType::isValidElementType(ElTy),
1530 "Union type with invalid element type", ElTy, UTy);
1534 case Type::ArrayTyID: {
1535 const ArrayType *ATy = cast<ArrayType>(Ty);
1536 Assert1(ArrayType::isValidElementType(ATy->getElementType()),
1537 "Array type with invalid element type", ATy);
1538 VerifyType(ATy->getElementType());
1540 case Type::PointerTyID: {
1541 const PointerType *PTy = cast<PointerType>(Ty);
1542 Assert1(PointerType::isValidElementType(PTy->getElementType()),
1543 "Pointer type with invalid element type", PTy);
1544 VerifyType(PTy->getElementType());
1546 case Type::VectorTyID: {
1547 const VectorType *VTy = cast<VectorType>(Ty);
1548 Assert1(VectorType::isValidElementType(VTy->getElementType()),
1549 "Vector type with invalid element type", VTy);
1550 VerifyType(VTy->getElementType());
1557 /// VerifyFunctionLocalMetadata - Verify that the specified MDNode is local to
1558 /// specified Function.
1559 void Verifier::VerifyFunctionLocalMetadata(MDNode *N, Function *F,
1560 SmallPtrSet<MDNode *, 32> &Visited) {
1561 assert(N->isFunctionLocal() && "Should only be called on function-local MD");
1563 // Only visit each node once.
1564 if (!Visited.insert(N))
1567 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
1568 Value *V = N->getOperand(i);
1571 Function *ActualF = 0;
1572 if (Instruction *I = dyn_cast<Instruction>(V))
1573 ActualF = I->getParent()->getParent();
1574 else if (BasicBlock *BB = dyn_cast<BasicBlock>(V))
1575 ActualF = BB->getParent();
1576 else if (Argument *A = dyn_cast<Argument>(V))
1577 ActualF = A->getParent();
1578 else if (MDNode *MD = dyn_cast<MDNode>(V))
1579 if (MD->isFunctionLocal())
1580 VerifyFunctionLocalMetadata(MD, F, Visited);
1582 // If this was an instruction, bb, or argument, verify that it is in the
1583 // function that we expect.
1584 Assert1(ActualF == 0 || ActualF == F,
1585 "function-local metadata used in wrong function", N);
1589 // Flags used by TableGen to mark intrinsic parameters with the
1590 // LLVMExtendedElementVectorType and LLVMTruncatedElementVectorType classes.
1591 static const unsigned ExtendedElementVectorType = 0x40000000;
1592 static const unsigned TruncatedElementVectorType = 0x20000000;
1594 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1596 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1597 Function *IF = CI.getCalledFunction();
1598 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1601 #define GET_INTRINSIC_VERIFIER
1602 #include "llvm/Intrinsics.gen"
1603 #undef GET_INTRINSIC_VERIFIER
1605 // If the intrinsic takes MDNode arguments, verify that they are either global
1606 // or are local to *this* function.
1607 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
1608 if (MDNode *MD = dyn_cast<MDNode>(CI.getOperand(i))) {
1609 if (!MD->isFunctionLocal()) continue;
1610 SmallPtrSet<MDNode *, 32> Visited;
1611 VerifyFunctionLocalMetadata(MD, CI.getParent()->getParent(), Visited);
1617 case Intrinsic::dbg_declare: { // llvm.dbg.declare
1618 Assert1(CI.getOperand(0) && isa<MDNode>(CI.getOperand(0)),
1619 "invalid llvm.dbg.declare intrinsic call 1", &CI);
1620 MDNode *MD = cast<MDNode>(CI.getOperand(0));
1621 Assert1(MD->getNumOperands() == 1,
1622 "invalid llvm.dbg.declare intrinsic call 2", &CI);
1624 case Intrinsic::memcpy:
1625 case Intrinsic::memmove:
1626 case Intrinsic::memset:
1627 Assert1(isa<ConstantInt>(CI.getOperand(3)),
1628 "alignment argument of memory intrinsics must be a constant int",
1631 case Intrinsic::gcroot:
1632 case Intrinsic::gcwrite:
1633 case Intrinsic::gcread:
1634 if (ID == Intrinsic::gcroot) {
1636 dyn_cast<AllocaInst>(CI.getOperand(0)->stripPointerCasts());
1637 Assert1(AI && AI->getType()->getElementType()->isPointerTy(),
1638 "llvm.gcroot parameter #1 must be a pointer alloca.", &CI);
1639 Assert1(isa<Constant>(CI.getOperand(1)),
1640 "llvm.gcroot parameter #2 must be a constant.", &CI);
1643 Assert1(CI.getParent()->getParent()->hasGC(),
1644 "Enclosing function does not use GC.", &CI);
1646 case Intrinsic::init_trampoline:
1647 Assert1(isa<Function>(CI.getOperand(1)->stripPointerCasts()),
1648 "llvm.init_trampoline parameter #2 must resolve to a function.",
1651 case Intrinsic::prefetch:
1652 Assert1(isa<ConstantInt>(CI.getOperand(1)) &&
1653 isa<ConstantInt>(CI.getOperand(2)) &&
1654 cast<ConstantInt>(CI.getOperand(1))->getZExtValue() < 2 &&
1655 cast<ConstantInt>(CI.getOperand(2))->getZExtValue() < 4,
1656 "invalid arguments to llvm.prefetch",
1659 case Intrinsic::stackprotector:
1660 Assert1(isa<AllocaInst>(CI.getOperand(1)->stripPointerCasts()),
1661 "llvm.stackprotector parameter #2 must resolve to an alloca.",
1664 case Intrinsic::lifetime_start:
1665 case Intrinsic::lifetime_end:
1666 case Intrinsic::invariant_start:
1667 Assert1(isa<ConstantInt>(CI.getOperand(0)),
1668 "size argument of memory use markers must be a constant integer",
1671 case Intrinsic::invariant_end:
1672 Assert1(isa<ConstantInt>(CI.getOperand(1)),
1673 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
1678 /// Produce a string to identify an intrinsic parameter or return value.
1679 /// The ArgNo value numbers the return values from 0 to NumRets-1 and the
1680 /// parameters beginning with NumRets.
1682 static std::string IntrinsicParam(unsigned ArgNo, unsigned NumRets) {
1683 if (ArgNo >= NumRets)
1684 return "Intrinsic parameter #" + utostr(ArgNo - NumRets);
1686 return "Intrinsic result type";
1687 return "Intrinsic result type #" + utostr(ArgNo);
1690 bool Verifier::PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
1691 int VT, unsigned ArgNo, std::string &Suffix) {
1692 const FunctionType *FTy = F->getFunctionType();
1694 unsigned NumElts = 0;
1695 const Type *EltTy = Ty;
1696 const VectorType *VTy = dyn_cast<VectorType>(Ty);
1698 EltTy = VTy->getElementType();
1699 NumElts = VTy->getNumElements();
1702 const Type *RetTy = FTy->getReturnType();
1703 const StructType *ST = dyn_cast<StructType>(RetTy);
1704 unsigned NumRetVals;
1705 if (RetTy->isVoidTy())
1708 NumRetVals = ST->getNumElements();
1715 // Check flags that indicate a type that is an integral vector type with
1716 // elements that are larger or smaller than the elements of the matched
1718 if ((Match & (ExtendedElementVectorType |
1719 TruncatedElementVectorType)) != 0) {
1720 const IntegerType *IEltTy = dyn_cast<IntegerType>(EltTy);
1721 if (!VTy || !IEltTy) {
1722 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not "
1723 "an integral vector type.", F);
1726 // Adjust the current Ty (in the opposite direction) rather than
1727 // the type being matched against.
1728 if ((Match & ExtendedElementVectorType) != 0) {
1729 if ((IEltTy->getBitWidth() & 1) != 0) {
1730 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " vector "
1731 "element bit-width is odd.", F);
1734 Ty = VectorType::getTruncatedElementVectorType(VTy);
1736 Ty = VectorType::getExtendedElementVectorType(VTy);
1737 Match &= ~(ExtendedElementVectorType | TruncatedElementVectorType);
1740 if (Match <= static_cast<int>(NumRetVals - 1)) {
1742 RetTy = ST->getElementType(Match);
1745 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " does not "
1746 "match return type.", F);
1750 if (Ty != FTy->getParamType(Match - NumRetVals)) {
1751 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " does not "
1752 "match parameter %" + utostr(Match - NumRetVals) + ".", F);
1756 } else if (VT == MVT::iAny) {
1757 if (!EltTy->isIntegerTy()) {
1758 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not "
1759 "an integer type.", F);
1763 unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
1767 Suffix += "v" + utostr(NumElts);
1769 Suffix += "i" + utostr(GotBits);
1771 // Check some constraints on various intrinsics.
1773 default: break; // Not everything needs to be checked.
1774 case Intrinsic::bswap:
1775 if (GotBits < 16 || GotBits % 16 != 0) {
1776 CheckFailed("Intrinsic requires even byte width argument", F);
1781 } else if (VT == MVT::fAny) {
1782 if (!EltTy->isFloatingPointTy()) {
1783 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not "
1784 "a floating-point type.", F);
1791 Suffix += "v" + utostr(NumElts);
1793 Suffix += EVT::getEVT(EltTy).getEVTString();
1794 } else if (VT == MVT::vAny) {
1796 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not a vector type.",
1800 Suffix += ".v" + utostr(NumElts) + EVT::getEVT(EltTy).getEVTString();
1801 } else if (VT == MVT::iPTR) {
1802 if (!Ty->isPointerTy()) {
1803 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not a "
1804 "pointer and a pointer is required.", F);
1807 } else if (VT == MVT::iPTRAny) {
1808 // Outside of TableGen, we don't distinguish iPTRAny (to any address space)
1809 // and iPTR. In the verifier, we can not distinguish which case we have so
1810 // allow either case to be legal.
1811 if (const PointerType* PTyp = dyn_cast<PointerType>(Ty)) {
1812 Suffix += ".p" + utostr(PTyp->getAddressSpace()) +
1813 EVT::getEVT(PTyp->getElementType()).getEVTString();
1815 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not a "
1816 "pointer and a pointer is required.", F);
1819 } else if (EVT((MVT::SimpleValueType)VT).isVector()) {
1820 EVT VVT = EVT((MVT::SimpleValueType)VT);
1822 // If this is a vector argument, verify the number and type of elements.
1823 if (VVT.getVectorElementType() != EVT::getEVT(EltTy)) {
1824 CheckFailed("Intrinsic prototype has incorrect vector element type!", F);
1828 if (VVT.getVectorNumElements() != NumElts) {
1829 CheckFailed("Intrinsic prototype has incorrect number of "
1830 "vector elements!", F);
1833 } else if (EVT((MVT::SimpleValueType)VT).getTypeForEVT(Ty->getContext()) !=
1835 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is wrong!", F);
1837 } else if (EltTy != Ty) {
1838 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is a vector "
1839 "and a scalar is required.", F);
1846 /// VerifyIntrinsicPrototype - TableGen emits calls to this function into
1847 /// Intrinsics.gen. This implements a little state machine that verifies the
1848 /// prototype of intrinsics.
1849 void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
1850 unsigned NumRetVals,
1851 unsigned NumParams, ...) {
1853 va_start(VA, NumParams);
1854 const FunctionType *FTy = F->getFunctionType();
1856 // For overloaded intrinsics, the Suffix of the function name must match the
1857 // types of the arguments. This variable keeps track of the expected
1858 // suffix, to be checked at the end.
1861 if (FTy->getNumParams() + FTy->isVarArg() != NumParams) {
1862 CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
1866 const Type *Ty = FTy->getReturnType();
1867 const StructType *ST = dyn_cast<StructType>(Ty);
1869 if (NumRetVals == 0 && !Ty->isVoidTy()) {
1870 CheckFailed("Intrinsic should return void", F);
1874 // Verify the return types.
1875 if (ST && ST->getNumElements() != NumRetVals) {
1876 CheckFailed("Intrinsic prototype has incorrect number of return types!", F);
1880 for (unsigned ArgNo = 0; ArgNo != NumRetVals; ++ArgNo) {
1881 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1883 if (ST) Ty = ST->getElementType(ArgNo);
1884 if (!PerformTypeCheck(ID, F, Ty, VT, ArgNo, Suffix))
1888 // Verify the parameter types.
1889 for (unsigned ArgNo = 0; ArgNo != NumParams; ++ArgNo) {
1890 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1892 if (VT == MVT::isVoid && ArgNo > 0) {
1893 if (!FTy->isVarArg())
1894 CheckFailed("Intrinsic prototype has no '...'!", F);
1898 if (!PerformTypeCheck(ID, F, FTy->getParamType(ArgNo), VT,
1899 ArgNo + NumRetVals, Suffix))
1905 // For intrinsics without pointer arguments, if we computed a Suffix then the
1906 // intrinsic is overloaded and we need to make sure that the name of the
1907 // function is correct. We add the suffix to the name of the intrinsic and
1908 // compare against the given function name. If they are not the same, the
1909 // function name is invalid. This ensures that overloading of intrinsics
1910 // uses a sane and consistent naming convention. Note that intrinsics with
1911 // pointer argument may or may not be overloaded so we will check assuming it
1912 // has a suffix and not.
1913 if (!Suffix.empty()) {
1914 std::string Name(Intrinsic::getName(ID));
1915 if (Name + Suffix != F->getName()) {
1916 CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
1917 F->getName().substr(Name.length()) + "'. It should be '" +
1922 // Check parameter attributes.
1923 Assert1(F->getAttributes() == Intrinsic::getAttributes(ID),
1924 "Intrinsic has wrong parameter attributes!", F);
1928 //===----------------------------------------------------------------------===//
1929 // Implement the public interfaces to this file...
1930 //===----------------------------------------------------------------------===//
1932 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1933 return new Verifier(action);
1937 /// verifyFunction - Check a function for errors, printing messages on stderr.
1938 /// Return true if the function is corrupt.
1940 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1941 Function &F = const_cast<Function&>(f);
1942 assert(!F.isDeclaration() && "Cannot verify external functions");
1944 FunctionPassManager FPM(F.getParent());
1945 Verifier *V = new Verifier(action);
1951 /// verifyModule - Check a module for errors, printing messages on stderr.
1952 /// Return true if the module is corrupt.
1954 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1955 std::string *ErrorInfo) {
1957 Verifier *V = new Verifier(action);
1959 PM.run(const_cast<Module&>(M));
1961 if (ErrorInfo && V->Broken)
1962 *ErrorInfo = V->MessagesStr.str();