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 int %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/Assembly/Writer.h"
44 #include "llvm/CallingConv.h"
45 #include "llvm/Constants.h"
46 #include "llvm/Pass.h"
47 #include "llvm/Module.h"
48 #include "llvm/ModuleProvider.h"
49 #include "llvm/ParameterAttributes.h"
50 #include "llvm/DerivedTypes.h"
51 #include "llvm/InlineAsm.h"
52 #include "llvm/IntrinsicInst.h"
53 #include "llvm/PassManager.h"
54 #include "llvm/Analysis/Dominators.h"
55 #include "llvm/CodeGen/ValueTypes.h"
56 #include "llvm/Support/CallSite.h"
57 #include "llvm/Support/CFG.h"
58 #include "llvm/Support/InstVisitor.h"
59 #include "llvm/Support/Streams.h"
60 #include "llvm/ADT/SmallPtrSet.h"
61 #include "llvm/ADT/SmallVector.h"
62 #include "llvm/ADT/StringExtras.h"
63 #include "llvm/ADT/STLExtras.h"
64 #include "llvm/Support/Compiler.h"
70 namespace { // Anonymous namespace for class
71 struct VISIBILITY_HIDDEN PreVerifier : public FunctionPass {
72 static char ID; // Pass ID, replacement for typeid
74 PreVerifier() : FunctionPass((intptr_t)&ID) { }
76 // Check that the prerequisites for successful DominatorTree construction
78 bool runOnFunction(Function &F) {
81 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
82 if (I->empty() || !I->back().isTerminator()) {
83 cerr << "Basic Block does not have terminator!\n";
84 WriteAsOperand(*cerr, I, true);
97 char PreVerifier::ID = 0;
98 RegisterPass<PreVerifier> PreVer("preverify", "Preliminary module verification");
99 const PassInfo *PreVerifyID = PreVer.getPassInfo();
101 struct VISIBILITY_HIDDEN
102 Verifier : public FunctionPass, InstVisitor<Verifier> {
103 static char ID; // Pass ID, replacement for typeid
104 bool Broken; // Is this module found to be broken?
105 bool RealPass; // Are we not being run by a PassManager?
106 VerifierFailureAction action;
107 // What to do if verification fails.
108 Module *Mod; // Module we are verifying right now
109 DominatorTree *DT; // Dominator Tree, caution can be null!
110 std::stringstream msgs; // A stringstream to collect messages
112 /// InstInThisBlock - when verifying a basic block, keep track of all of the
113 /// instructions we have seen so far. This allows us to do efficient
114 /// dominance checks for the case when an instruction has an operand that is
115 /// an instruction in the same block.
116 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
119 : FunctionPass((intptr_t)&ID),
120 Broken(false), RealPass(true), action(AbortProcessAction),
121 DT(0), msgs( std::ios::app | std::ios::out ) {}
122 Verifier( VerifierFailureAction ctn )
123 : FunctionPass((intptr_t)&ID),
124 Broken(false), RealPass(true), action(ctn), DT(0),
125 msgs( std::ios::app | std::ios::out ) {}
127 : FunctionPass((intptr_t)&ID),
128 Broken(false), RealPass(true),
129 action( AB ? AbortProcessAction : PrintMessageAction), DT(0),
130 msgs( std::ios::app | std::ios::out ) {}
131 Verifier(DominatorTree &dt)
132 : FunctionPass((intptr_t)&ID),
133 Broken(false), RealPass(false), action(PrintMessageAction),
134 DT(&dt), msgs( std::ios::app | std::ios::out ) {}
137 bool doInitialization(Module &M) {
139 verifyTypeSymbolTable(M.getTypeSymbolTable());
141 // If this is a real pass, in a pass manager, we must abort before
142 // returning back to the pass manager, or else the pass manager may try to
143 // run other passes on the broken module.
145 return abortIfBroken();
149 bool runOnFunction(Function &F) {
150 // Get dominator information if we are being run by PassManager
151 if (RealPass) DT = &getAnalysis<DominatorTree>();
156 InstsInThisBlock.clear();
158 // If this is a real pass, in a pass manager, we must abort before
159 // returning back to the pass manager, or else the pass manager may try to
160 // run other passes on the broken module.
162 return abortIfBroken();
167 bool doFinalization(Module &M) {
168 // Scan through, checking all of the external function's linkage now...
169 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
170 visitGlobalValue(*I);
172 // Check to make sure function prototypes are okay.
173 if (I->isDeclaration()) visitFunction(*I);
176 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
178 visitGlobalVariable(*I);
180 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
182 visitGlobalAlias(*I);
184 // If the module is broken, abort at this time.
185 return abortIfBroken();
188 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
189 AU.setPreservesAll();
190 AU.addRequiredID(PreVerifyID);
192 AU.addRequired<DominatorTree>();
195 /// abortIfBroken - If the module is broken and we are supposed to abort on
196 /// this condition, do so.
198 bool abortIfBroken() {
200 msgs << "Broken module found, ";
202 case AbortProcessAction:
203 msgs << "compilation aborted!\n";
206 case PrintMessageAction:
207 msgs << "verification continues.\n";
210 case ReturnStatusAction:
211 msgs << "compilation terminated.\n";
219 // Verification methods...
220 void verifyTypeSymbolTable(TypeSymbolTable &ST);
221 void visitGlobalValue(GlobalValue &GV);
222 void visitGlobalVariable(GlobalVariable &GV);
223 void visitGlobalAlias(GlobalAlias &GA);
224 void visitFunction(Function &F);
225 void visitBasicBlock(BasicBlock &BB);
226 void visitTruncInst(TruncInst &I);
227 void visitZExtInst(ZExtInst &I);
228 void visitSExtInst(SExtInst &I);
229 void visitFPTruncInst(FPTruncInst &I);
230 void visitFPExtInst(FPExtInst &I);
231 void visitFPToUIInst(FPToUIInst &I);
232 void visitFPToSIInst(FPToSIInst &I);
233 void visitUIToFPInst(UIToFPInst &I);
234 void visitSIToFPInst(SIToFPInst &I);
235 void visitIntToPtrInst(IntToPtrInst &I);
236 void visitPtrToIntInst(PtrToIntInst &I);
237 void visitBitCastInst(BitCastInst &I);
238 void visitPHINode(PHINode &PN);
239 void visitBinaryOperator(BinaryOperator &B);
240 void visitICmpInst(ICmpInst &IC);
241 void visitFCmpInst(FCmpInst &FC);
242 void visitExtractElementInst(ExtractElementInst &EI);
243 void visitInsertElementInst(InsertElementInst &EI);
244 void visitShuffleVectorInst(ShuffleVectorInst &EI);
245 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
246 void visitCallInst(CallInst &CI);
247 void visitInvokeInst(InvokeInst &II);
248 void visitGetElementPtrInst(GetElementPtrInst &GEP);
249 void visitLoadInst(LoadInst &LI);
250 void visitStoreInst(StoreInst &SI);
251 void visitInstruction(Instruction &I);
252 void visitTerminatorInst(TerminatorInst &I);
253 void visitReturnInst(ReturnInst &RI);
254 void visitSwitchInst(SwitchInst &SI);
255 void visitSelectInst(SelectInst &SI);
256 void visitUserOp1(Instruction &I);
257 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
258 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
259 void visitAllocationInst(AllocationInst &AI);
261 void VerifyCallSite(CallSite CS);
262 void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
263 unsigned Count, ...);
264 void VerifyAttrs(uint16_t Attrs, const Type *Ty, bool isReturnValue,
266 void VerifyFunctionAttrs(const FunctionType *FT, const ParamAttrsList *Attrs,
269 void WriteValue(const Value *V) {
271 if (isa<Instruction>(V)) {
274 WriteAsOperand(msgs, V, true, Mod);
279 void WriteType(const Type* T ) {
281 WriteTypeSymbolic(msgs, T, Mod );
285 // CheckFailed - A check failed, so print out the condition and the message
286 // that failed. This provides a nice place to put a breakpoint if you want
287 // to see why something is not correct.
288 void CheckFailed(const std::string &Message,
289 const Value *V1 = 0, const Value *V2 = 0,
290 const Value *V3 = 0, const Value *V4 = 0) {
291 msgs << Message << "\n";
299 void CheckFailed( const std::string& Message, const Value* V1,
300 const Type* T2, const Value* V3 = 0 ) {
301 msgs << Message << "\n";
309 char Verifier::ID = 0;
310 RegisterPass<Verifier> X("verify", "Module Verifier");
311 } // End anonymous namespace
314 // Assert - We know that cond should be true, if not print an error message.
315 #define Assert(C, M) \
316 do { if (!(C)) { CheckFailed(M); return; } } while (0)
317 #define Assert1(C, M, V1) \
318 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
319 #define Assert2(C, M, V1, V2) \
320 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
321 #define Assert3(C, M, V1, V2, V3) \
322 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
323 #define Assert4(C, M, V1, V2, V3, V4) \
324 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
327 void Verifier::visitGlobalValue(GlobalValue &GV) {
328 Assert1(!GV.isDeclaration() ||
329 GV.hasExternalLinkage() ||
330 GV.hasDLLImportLinkage() ||
331 GV.hasExternalWeakLinkage() ||
332 (isa<GlobalAlias>(GV) &&
333 (GV.hasInternalLinkage() || GV.hasWeakLinkage())),
334 "Global is external, but doesn't have external or dllimport or weak linkage!",
337 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
338 "Global is marked as dllimport, but not external", &GV);
340 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
341 "Only global variables can have appending linkage!", &GV);
343 if (GV.hasAppendingLinkage()) {
344 GlobalVariable &GVar = cast<GlobalVariable>(GV);
345 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
346 "Only global arrays can have appending linkage!", &GV);
350 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
351 if (GV.hasInitializer()) {
352 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
353 "Global variable initializer type does not match global "
354 "variable type!", &GV);
356 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
357 GV.hasExternalWeakLinkage(),
358 "invalid linkage type for global declaration", &GV);
361 visitGlobalValue(GV);
364 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
365 Assert1(!GA.getName().empty(),
366 "Alias name cannot be empty!", &GA);
367 Assert1(GA.hasExternalLinkage() || GA.hasInternalLinkage() ||
369 "Alias should have external or external weak linkage!", &GA);
370 Assert1(GA.getType() == GA.getAliasee()->getType(),
371 "Alias and aliasee types should match!", &GA);
373 if (!isa<GlobalValue>(GA.getAliasee())) {
374 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
375 Assert1(CE && CE->getOpcode() == Instruction::BitCast &&
376 isa<GlobalValue>(CE->getOperand(0)),
377 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
381 visitGlobalValue(GA);
384 void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
387 // VerifyAttrs - Check the given parameter attributes for an argument or return
388 // value of the specified type. The value V is printed in error messages.
389 void Verifier::VerifyAttrs(uint16_t Attrs, const Type *Ty, bool isReturnValue,
391 if (Attrs == ParamAttr::None)
395 uint16_t RetI = Attrs & ParamAttr::ParameterOnly;
396 Assert1(!RetI, "Attribute " + ParamAttrsList::getParamAttrsText(RetI) +
397 "does not apply to return values!", V);
399 uint16_t ParmI = Attrs & ParamAttr::ReturnOnly;
400 Assert1(!ParmI, "Attribute " + ParamAttrsList::getParamAttrsText(ParmI) +
401 "only applies to return values!", V);
405 i < array_lengthof(ParamAttr::MutuallyIncompatible); ++i) {
406 uint16_t MutI = Attrs & ParamAttr::MutuallyIncompatible[i];
407 Assert1(!(MutI & (MutI - 1)), "Attributes " +
408 ParamAttrsList::getParamAttrsText(MutI) + "are incompatible!", V);
411 uint16_t TypeI = Attrs & ParamAttr::typeIncompatible(Ty);
412 Assert1(!TypeI, "Wrong type for attribute " +
413 ParamAttrsList::getParamAttrsText(TypeI), V);
416 // VerifyFunctionAttrs - Check parameter attributes against a function type.
417 // The value V is printed in error messages.
418 void Verifier::VerifyFunctionAttrs(const FunctionType *FT,
419 const ParamAttrsList *Attrs,
424 bool SawNest = false;
426 for (unsigned Idx = 0; Idx <= FT->getNumParams(); ++Idx) {
427 uint16_t Attr = Attrs->getParamAttrs(Idx);
429 VerifyAttrs(Attr, FT->getParamType(Idx-1), !Idx, V);
431 if (Attr & ParamAttr::Nest) {
432 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
436 if (Attr & ParamAttr::StructRet) {
437 Assert1(Idx == 1, "Attribute sret not on first parameter!", V);
442 // visitFunction - Verify that a function is ok.
444 void Verifier::visitFunction(Function &F) {
445 // Check function arguments.
446 const FunctionType *FT = F.getFunctionType();
447 unsigned NumArgs = F.arg_size();
449 Assert2(FT->getNumParams() == NumArgs,
450 "# formal arguments must match # of arguments for function type!",
452 Assert1(F.getReturnType()->isFirstClassType() ||
453 F.getReturnType() == Type::VoidTy,
454 "Functions cannot return aggregate values!", &F);
456 Assert1(!F.isStructReturn() || FT->getReturnType() == Type::VoidTy,
457 "Invalid struct-return function!", &F);
459 const ParamAttrsList *Attrs = F.getParamAttrs();
463 Attrs->getParamIndex(Attrs->size()-1) <= FT->getNumParams()),
464 "Attributes after last parameter!", &F);
466 // Check function attributes.
467 VerifyFunctionAttrs(FT, Attrs, &F);
469 // Check that this function meets the restrictions on this calling convention.
470 switch (F.getCallingConv()) {
475 case CallingConv::Fast:
476 case CallingConv::Cold:
477 case CallingConv::X86_FastCall:
478 Assert1(!F.isVarArg(),
479 "Varargs functions must have C calling conventions!", &F);
483 // Check that the argument values match the function type for this function...
485 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
487 Assert2(I->getType() == FT->getParamType(i),
488 "Argument value does not match function argument type!",
489 I, FT->getParamType(i));
490 // Make sure no aggregates are passed by value.
491 Assert1(I->getType()->isFirstClassType(),
492 "Functions cannot take aggregates as arguments by value!", I);
495 if (F.isDeclaration()) {
496 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
497 F.hasExternalWeakLinkage(),
498 "invalid linkage type for function declaration", &F);
500 // Verify that this function (which has a body) is not named "llvm.*". It
501 // is not legal to define intrinsics.
502 if (F.getName().size() >= 5)
503 Assert1(F.getName().substr(0, 5) != "llvm.",
504 "llvm intrinsics cannot be defined!", &F);
506 // Check the entry node
507 BasicBlock *Entry = &F.getEntryBlock();
508 Assert1(pred_begin(Entry) == pred_end(Entry),
509 "Entry block to function must not have predecessors!", Entry);
514 // verifyBasicBlock - Verify that a basic block is well formed...
516 void Verifier::visitBasicBlock(BasicBlock &BB) {
517 InstsInThisBlock.clear();
519 // Ensure that basic blocks have terminators!
520 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
522 // Check constraints that this basic block imposes on all of the PHI nodes in
524 if (isa<PHINode>(BB.front())) {
525 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
526 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
527 std::sort(Preds.begin(), Preds.end());
529 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
531 // Ensure that PHI nodes have at least one entry!
532 Assert1(PN->getNumIncomingValues() != 0,
533 "PHI nodes must have at least one entry. If the block is dead, "
534 "the PHI should be removed!", PN);
535 Assert1(PN->getNumIncomingValues() == Preds.size(),
536 "PHINode should have one entry for each predecessor of its "
537 "parent basic block!", PN);
539 // Get and sort all incoming values in the PHI node...
541 Values.reserve(PN->getNumIncomingValues());
542 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
543 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
544 PN->getIncomingValue(i)));
545 std::sort(Values.begin(), Values.end());
547 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
548 // Check to make sure that if there is more than one entry for a
549 // particular basic block in this PHI node, that the incoming values are
552 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
553 Values[i].second == Values[i-1].second,
554 "PHI node has multiple entries for the same basic block with "
555 "different incoming values!", PN, Values[i].first,
556 Values[i].second, Values[i-1].second);
558 // Check to make sure that the predecessors and PHI node entries are
560 Assert3(Values[i].first == Preds[i],
561 "PHI node entries do not match predecessors!", PN,
562 Values[i].first, Preds[i]);
568 void Verifier::visitTerminatorInst(TerminatorInst &I) {
569 // Ensure that terminators only exist at the end of the basic block.
570 Assert1(&I == I.getParent()->getTerminator(),
571 "Terminator found in the middle of a basic block!", I.getParent());
575 void Verifier::visitReturnInst(ReturnInst &RI) {
576 Function *F = RI.getParent()->getParent();
577 if (RI.getNumOperands() == 0)
578 Assert2(F->getReturnType() == Type::VoidTy,
579 "Found return instr that returns void in Function of non-void "
580 "return type!", &RI, F->getReturnType());
582 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
583 "Function return type does not match operand "
584 "type of return inst!", &RI, F->getReturnType());
586 // Check to make sure that the return value has necessary properties for
588 visitTerminatorInst(RI);
591 void Verifier::visitSwitchInst(SwitchInst &SI) {
592 // Check to make sure that all of the constants in the switch instruction
593 // have the same type as the switched-on value.
594 const Type *SwitchTy = SI.getCondition()->getType();
595 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
596 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
597 "Switch constants must all be same type as switch value!", &SI);
599 visitTerminatorInst(SI);
602 void Verifier::visitSelectInst(SelectInst &SI) {
603 Assert1(SI.getCondition()->getType() == Type::Int1Ty,
604 "Select condition type must be bool!", &SI);
605 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
606 "Select values must have identical types!", &SI);
607 Assert1(SI.getTrueValue()->getType() == SI.getType(),
608 "Select values must have same type as select instruction!", &SI);
609 visitInstruction(SI);
613 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
614 /// a pass, if any exist, it's an error.
616 void Verifier::visitUserOp1(Instruction &I) {
617 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
620 void Verifier::visitTruncInst(TruncInst &I) {
621 // Get the source and destination types
622 const Type *SrcTy = I.getOperand(0)->getType();
623 const Type *DestTy = I.getType();
625 // Get the size of the types in bits, we'll need this later
626 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
627 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
629 Assert1(SrcTy->isInteger(), "Trunc only operates on integer", &I);
630 Assert1(DestTy->isInteger(), "Trunc only produces integer", &I);
631 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
636 void Verifier::visitZExtInst(ZExtInst &I) {
637 // Get the source and destination types
638 const Type *SrcTy = I.getOperand(0)->getType();
639 const Type *DestTy = I.getType();
641 // Get the size of the types in bits, we'll need this later
642 Assert1(SrcTy->isInteger(), "ZExt only operates on integer", &I);
643 Assert1(DestTy->isInteger(), "ZExt only produces an integer", &I);
644 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
645 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
647 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
652 void Verifier::visitSExtInst(SExtInst &I) {
653 // Get the source and destination types
654 const Type *SrcTy = I.getOperand(0)->getType();
655 const Type *DestTy = I.getType();
657 // Get the size of the types in bits, we'll need this later
658 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
659 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
661 Assert1(SrcTy->isInteger(), "SExt only operates on integer", &I);
662 Assert1(DestTy->isInteger(), "SExt only produces an integer", &I);
663 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
668 void Verifier::visitFPTruncInst(FPTruncInst &I) {
669 // Get the source and destination types
670 const Type *SrcTy = I.getOperand(0)->getType();
671 const Type *DestTy = I.getType();
672 // Get the size of the types in bits, we'll need this later
673 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
674 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
676 Assert1(SrcTy->isFloatingPoint(),"FPTrunc only operates on FP", &I);
677 Assert1(DestTy->isFloatingPoint(),"FPTrunc only produces an FP", &I);
678 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
683 void Verifier::visitFPExtInst(FPExtInst &I) {
684 // Get the source and destination types
685 const Type *SrcTy = I.getOperand(0)->getType();
686 const Type *DestTy = I.getType();
688 // Get the size of the types in bits, we'll need this later
689 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
690 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
692 Assert1(SrcTy->isFloatingPoint(),"FPExt only operates on FP", &I);
693 Assert1(DestTy->isFloatingPoint(),"FPExt only produces an FP", &I);
694 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
699 void Verifier::visitUIToFPInst(UIToFPInst &I) {
700 // Get the source and destination types
701 const Type *SrcTy = I.getOperand(0)->getType();
702 const Type *DestTy = I.getType();
704 bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
705 bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
707 Assert1(SrcVec == DstVec,"UIToFP source and dest must both be vector or scalar", &I);
708 Assert1(SrcTy->isIntOrIntVector(),"UIToFP source must be integer or integer vector", &I);
709 Assert1(DestTy->isFPOrFPVector(),"UIToFP result must be FP or FP vector", &I);
711 if (SrcVec && DstVec)
712 Assert1(cast<VectorType>(SrcTy)->getNumElements() == cast<VectorType>(DestTy)->getNumElements(),
713 "UIToFP source and dest vector length mismatch", &I);
718 void Verifier::visitSIToFPInst(SIToFPInst &I) {
719 // Get the source and destination types
720 const Type *SrcTy = I.getOperand(0)->getType();
721 const Type *DestTy = I.getType();
723 bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
724 bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
726 Assert1(SrcVec == DstVec,"SIToFP source and dest must both be vector or scalar", &I);
727 Assert1(SrcTy->isIntOrIntVector(),"SIToFP source must be integer or integer vector", &I);
728 Assert1(DestTy->isFPOrFPVector(),"SIToFP result must be FP or FP vector", &I);
730 if (SrcVec && DstVec)
731 Assert1(cast<VectorType>(SrcTy)->getNumElements() == cast<VectorType>(DestTy)->getNumElements(),
732 "SIToFP source and dest vector length mismatch", &I);
737 void Verifier::visitFPToUIInst(FPToUIInst &I) {
738 // Get the source and destination types
739 const Type *SrcTy = I.getOperand(0)->getType();
740 const Type *DestTy = I.getType();
742 bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
743 bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
745 Assert1(SrcVec == DstVec,"FPToUI source and dest must both be vector or scalar", &I);
746 Assert1(SrcTy->isFPOrFPVector(),"FPToUI source must be FP or FP vector", &I);
747 Assert1(DestTy->isIntOrIntVector(),"FPToUI result must be integer or integer vector", &I);
749 if (SrcVec && DstVec)
750 Assert1(cast<VectorType>(SrcTy)->getNumElements() == cast<VectorType>(DestTy)->getNumElements(),
751 "FPToUI source and dest vector length mismatch", &I);
756 void Verifier::visitFPToSIInst(FPToSIInst &I) {
757 // Get the source and destination types
758 const Type *SrcTy = I.getOperand(0)->getType();
759 const Type *DestTy = I.getType();
761 bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
762 bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
764 Assert1(SrcVec == DstVec,"FPToSI source and dest must both be vector or scalar", &I);
765 Assert1(SrcTy->isFPOrFPVector(),"FPToSI source must be FP or FP vector", &I);
766 Assert1(DestTy->isIntOrIntVector(),"FPToSI result must be integer or integer vector", &I);
768 if (SrcVec && DstVec)
769 Assert1(cast<VectorType>(SrcTy)->getNumElements() == cast<VectorType>(DestTy)->getNumElements(),
770 "FPToSI source and dest vector length mismatch", &I);
775 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
776 // Get the source and destination types
777 const Type *SrcTy = I.getOperand(0)->getType();
778 const Type *DestTy = I.getType();
780 Assert1(isa<PointerType>(SrcTy), "PtrToInt source must be pointer", &I);
781 Assert1(DestTy->isInteger(), "PtrToInt result must be integral", &I);
786 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
787 // Get the source and destination types
788 const Type *SrcTy = I.getOperand(0)->getType();
789 const Type *DestTy = I.getType();
791 Assert1(SrcTy->isInteger(), "IntToPtr source must be an integral", &I);
792 Assert1(isa<PointerType>(DestTy), "IntToPtr result must be a pointer",&I);
797 void Verifier::visitBitCastInst(BitCastInst &I) {
798 // Get the source and destination types
799 const Type *SrcTy = I.getOperand(0)->getType();
800 const Type *DestTy = I.getType();
802 // Get the size of the types in bits, we'll need this later
803 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
804 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
806 // BitCast implies a no-op cast of type only. No bits change.
807 // However, you can't cast pointers to anything but pointers.
808 Assert1(isa<PointerType>(DestTy) == isa<PointerType>(DestTy),
809 "Bitcast requires both operands to be pointer or neither", &I);
810 Assert1(SrcBitSize == DestBitSize, "Bitcast requies types of same width", &I);
815 /// visitPHINode - Ensure that a PHI node is well formed.
817 void Verifier::visitPHINode(PHINode &PN) {
818 // Ensure that the PHI nodes are all grouped together at the top of the block.
819 // This can be tested by checking whether the instruction before this is
820 // either nonexistent (because this is begin()) or is a PHI node. If not,
821 // then there is some other instruction before a PHI.
822 Assert2(&PN == &PN.getParent()->front() ||
823 isa<PHINode>(--BasicBlock::iterator(&PN)),
824 "PHI nodes not grouped at top of basic block!",
825 &PN, PN.getParent());
827 // Check that all of the operands of the PHI node have the same type as the
829 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
830 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
831 "PHI node operands are not the same type as the result!", &PN);
833 // All other PHI node constraints are checked in the visitBasicBlock method.
835 visitInstruction(PN);
838 void Verifier::VerifyCallSite(CallSite CS) {
839 Instruction *I = CS.getInstruction();
841 Assert1(isa<PointerType>(CS.getCalledValue()->getType()),
842 "Called function must be a pointer!", I);
843 const PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
844 Assert1(isa<FunctionType>(FPTy->getElementType()),
845 "Called function is not pointer to function type!", I);
847 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
849 // Verify that the correct number of arguments are being passed
851 Assert1(CS.arg_size() >= FTy->getNumParams(),
852 "Called function requires more parameters than were provided!",I);
854 Assert1(CS.arg_size() == FTy->getNumParams(),
855 "Incorrect number of arguments passed to called function!", I);
857 // Verify that all arguments to the call match the function type...
858 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
859 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
860 "Call parameter type does not match function signature!",
861 CS.getArgument(i), FTy->getParamType(i), I);
863 const ParamAttrsList *Attrs = CS.getParamAttrs();
867 Attrs->getParamIndex(Attrs->size()-1) <= CS.arg_size()),
868 "Attributes after last argument!", I);
870 // Verify call attributes.
871 VerifyFunctionAttrs(FTy, Attrs, I);
873 if (Attrs && FTy->isVarArg())
874 // Check attributes on the varargs part.
875 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
876 uint16_t Attr = Attrs->getParamAttrs(Idx);
878 VerifyAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
880 uint16_t VArgI = Attr & ParamAttr::VarArgsIncompatible;
881 Assert1(!VArgI, "Attribute " + ParamAttrsList::getParamAttrsText(VArgI) +
882 "cannot be used for vararg call arguments!", I);
885 visitInstruction(*I);
888 void Verifier::visitCallInst(CallInst &CI) {
891 if (Function *F = CI.getCalledFunction()) {
892 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
893 visitIntrinsicFunctionCall(ID, CI);
897 void Verifier::visitInvokeInst(InvokeInst &II) {
901 /// visitBinaryOperator - Check that both arguments to the binary operator are
902 /// of the same type!
904 void Verifier::visitBinaryOperator(BinaryOperator &B) {
905 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
906 "Both operands to a binary operator are not of the same type!", &B);
908 switch (B.getOpcode()) {
909 // Check that logical operators are only used with integral operands.
910 case Instruction::And:
911 case Instruction::Or:
912 case Instruction::Xor:
913 Assert1(B.getType()->isInteger() ||
914 (isa<VectorType>(B.getType()) &&
915 cast<VectorType>(B.getType())->getElementType()->isInteger()),
916 "Logical operators only work with integral types!", &B);
917 Assert1(B.getType() == B.getOperand(0)->getType(),
918 "Logical operators must have same type for operands and result!",
921 case Instruction::Shl:
922 case Instruction::LShr:
923 case Instruction::AShr:
924 Assert1(B.getType()->isInteger(),
925 "Shift must return an integer result!", &B);
926 Assert1(B.getType() == B.getOperand(0)->getType(),
927 "Shift return type must be same as operands!", &B);
930 // Arithmetic operators only work on integer or fp values
931 Assert1(B.getType() == B.getOperand(0)->getType(),
932 "Arithmetic operators must have same type for operands and result!",
934 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint() ||
935 isa<VectorType>(B.getType()),
936 "Arithmetic operators must have integer, fp, or vector type!", &B);
943 void Verifier::visitICmpInst(ICmpInst& IC) {
944 // Check that the operands are the same type
945 const Type* Op0Ty = IC.getOperand(0)->getType();
946 const Type* Op1Ty = IC.getOperand(1)->getType();
947 Assert1(Op0Ty == Op1Ty,
948 "Both operands to ICmp instruction are not of the same type!", &IC);
949 // Check that the operands are the right type
950 Assert1(Op0Ty->isInteger() || isa<PointerType>(Op0Ty),
951 "Invalid operand types for ICmp instruction", &IC);
952 visitInstruction(IC);
955 void Verifier::visitFCmpInst(FCmpInst& FC) {
956 // Check that the operands are the same type
957 const Type* Op0Ty = FC.getOperand(0)->getType();
958 const Type* Op1Ty = FC.getOperand(1)->getType();
959 Assert1(Op0Ty == Op1Ty,
960 "Both operands to FCmp instruction are not of the same type!", &FC);
961 // Check that the operands are the right type
962 Assert1(Op0Ty->isFloatingPoint(),
963 "Invalid operand types for FCmp instruction", &FC);
964 visitInstruction(FC);
967 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
968 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
970 "Invalid extractelement operands!", &EI);
971 visitInstruction(EI);
974 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
975 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
978 "Invalid insertelement operands!", &IE);
979 visitInstruction(IE);
982 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
983 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
985 "Invalid shufflevector operands!", &SV);
986 Assert1(SV.getType() == SV.getOperand(0)->getType(),
987 "Result of shufflevector must match first operand type!", &SV);
989 // Check to see if Mask is valid.
990 if (const ConstantVector *MV = dyn_cast<ConstantVector>(SV.getOperand(2))) {
991 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
992 Assert1(isa<ConstantInt>(MV->getOperand(i)) ||
993 isa<UndefValue>(MV->getOperand(i)),
994 "Invalid shufflevector shuffle mask!", &SV);
997 Assert1(isa<UndefValue>(SV.getOperand(2)) ||
998 isa<ConstantAggregateZero>(SV.getOperand(2)),
999 "Invalid shufflevector shuffle mask!", &SV);
1002 visitInstruction(SV);
1005 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1006 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1008 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
1009 Idxs.begin(), Idxs.end(), true);
1010 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1011 Assert2(isa<PointerType>(GEP.getType()) &&
1012 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1013 "GEP is not of right type for indices!", &GEP, ElTy);
1014 visitInstruction(GEP);
1017 void Verifier::visitLoadInst(LoadInst &LI) {
1019 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
1020 Assert2(ElTy == LI.getType(),
1021 "Load result type does not match pointer operand type!", &LI, ElTy);
1022 visitInstruction(LI);
1025 void Verifier::visitStoreInst(StoreInst &SI) {
1027 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
1028 Assert2(ElTy == SI.getOperand(0)->getType(),
1029 "Stored value type does not match pointer operand type!", &SI, ElTy);
1030 visitInstruction(SI);
1033 void Verifier::visitAllocationInst(AllocationInst &AI) {
1034 const PointerType *Ptr = AI.getType();
1035 Assert(Ptr->getAddressSpace() == 0,
1036 "Allocation instruction pointer not in the generic address space!");
1037 visitInstruction(AI);
1041 /// verifyInstruction - Verify that an instruction is well formed.
1043 void Verifier::visitInstruction(Instruction &I) {
1044 BasicBlock *BB = I.getParent();
1045 Assert1(BB, "Instruction not embedded in basic block!", &I);
1047 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1048 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1050 Assert1(*UI != (User*)&I ||
1051 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1052 "Only PHI nodes may reference their own value!", &I);
1055 // Check that void typed values don't have names
1056 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
1057 "Instruction has a name, but provides a void value!", &I);
1059 // Check that the return value of the instruction is either void or a legal
1061 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
1062 "Instruction returns a non-scalar type!", &I);
1064 // Check that all uses of the instruction, if they are instructions
1065 // themselves, actually have parent basic blocks. If the use is not an
1066 // instruction, it is an error!
1067 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1069 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
1071 Instruction *Used = cast<Instruction>(*UI);
1072 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1073 " embeded in a basic block!", &I, Used);
1076 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1077 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1079 // Check to make sure that only first-class-values are operands to
1081 Assert1(I.getOperand(i)->getType()->isFirstClassType(),
1082 "Instruction operands must be first-class values!", &I);
1084 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1085 // Check to make sure that the "address of" an intrinsic function is never
1087 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
1088 "Cannot take the address of an intrinsic!", &I);
1089 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1091 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1092 Assert1(OpBB->getParent() == BB->getParent(),
1093 "Referring to a basic block in another function!", &I);
1094 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1095 Assert1(OpArg->getParent() == BB->getParent(),
1096 "Referring to an argument in another function!", &I);
1097 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1098 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1100 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
1101 BasicBlock *OpBlock = Op->getParent();
1103 // Check that a definition dominates all of its uses.
1104 if (!isa<PHINode>(I)) {
1105 // Invoke results are only usable in the normal destination, not in the
1106 // exceptional destination.
1107 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1108 OpBlock = II->getNormalDest();
1110 Assert2(OpBlock != II->getUnwindDest(),
1111 "No uses of invoke possible due to dominance structure!",
1114 // If the normal successor of an invoke instruction has multiple
1115 // predecessors, then the normal edge from the invoke is critical, so
1116 // the invoke value can only be live if the destination block
1117 // dominates all of it's predecessors (other than the invoke) or if
1118 // the invoke value is only used by a phi in the successor.
1119 if (!OpBlock->getSinglePredecessor() &&
1120 DT->dominates(&BB->getParent()->getEntryBlock(), BB)) {
1121 // The first case we allow is if the use is a PHI operand in the
1122 // normal block, and if that PHI operand corresponds to the invoke's
1125 if (PHINode *PN = dyn_cast<PHINode>(&I))
1126 if (PN->getParent() == OpBlock &&
1127 PN->getIncomingBlock(i/2) == Op->getParent())
1130 // If it is used by something non-phi, then the other case is that
1131 // 'OpBlock' dominates all of its predecessors other than the
1132 // invoke. In this case, the invoke value can still be used.
1135 for (pred_iterator PI = pred_begin(OpBlock),
1136 E = pred_end(OpBlock); PI != E; ++PI) {
1137 if (*PI != II->getParent() && !DT->dominates(OpBlock, *PI)) {
1144 "Invoke value defined on critical edge but not dead!", &I,
1147 } else if (OpBlock == BB) {
1148 // If they are in the same basic block, make sure that the definition
1149 // comes before the use.
1150 Assert2(InstsInThisBlock.count(Op) ||
1151 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1152 "Instruction does not dominate all uses!", Op, &I);
1155 // Definition must dominate use unless use is unreachable!
1156 Assert2(DT->dominates(OpBlock, BB) ||
1157 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1158 "Instruction does not dominate all uses!", Op, &I);
1160 // PHI nodes are more difficult than other nodes because they actually
1161 // "use" the value in the predecessor basic blocks they correspond to.
1162 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
1163 Assert2(DT->dominates(OpBlock, PredBB) ||
1164 !DT->dominates(&BB->getParent()->getEntryBlock(), PredBB),
1165 "Instruction does not dominate all uses!", Op, &I);
1167 } else if (isa<InlineAsm>(I.getOperand(i))) {
1168 Assert1(i == 0 && (isa<CallInst>(I) || isa<InvokeInst>(I)),
1169 "Cannot take the address of an inline asm!", &I);
1172 InstsInThisBlock.insert(&I);
1175 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1177 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1178 Function *IF = CI.getCalledFunction();
1179 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1182 #define GET_INTRINSIC_VERIFIER
1183 #include "llvm/Intrinsics.gen"
1184 #undef GET_INTRINSIC_VERIFIER
1189 case Intrinsic::gcroot:
1190 case Intrinsic::gcwrite:
1191 case Intrinsic::gcread: {
1192 Type *PtrTy = PointerType::getUnqual(Type::Int8Ty),
1193 *PtrPtrTy = PointerType::getUnqual(PtrTy);
1198 case Intrinsic::gcroot:
1199 Assert1(CI.getOperand(1)->getType() == PtrPtrTy,
1200 "Intrinsic parameter #1 is not i8**.", &CI);
1201 Assert1(CI.getOperand(2)->getType() == PtrTy,
1202 "Intrinsic parameter #2 is not i8*.", &CI);
1203 Assert1(isa<AllocaInst>(
1204 IntrinsicInst::StripPointerCasts(CI.getOperand(1))),
1205 "llvm.gcroot parameter #1 must be an alloca.", &CI);
1206 Assert1(isa<Constant>(CI.getOperand(2)),
1207 "llvm.gcroot parameter #2 must be a constant.", &CI);
1209 case Intrinsic::gcwrite:
1210 Assert1(CI.getOperand(1)->getType() == PtrTy,
1211 "Intrinsic parameter #1 is not a i8*.", &CI);
1212 Assert1(CI.getOperand(2)->getType() == PtrTy,
1213 "Intrinsic parameter #2 is not a i8*.", &CI);
1214 Assert1(CI.getOperand(3)->getType() == PtrPtrTy,
1215 "Intrinsic parameter #3 is not a i8**.", &CI);
1217 case Intrinsic::gcread:
1218 Assert1(CI.getOperand(1)->getType() == PtrTy,
1219 "Intrinsic parameter #1 is not a i8*.", &CI);
1220 Assert1(CI.getOperand(2)->getType() == PtrPtrTy,
1221 "Intrinsic parameter #2 is not a i8**.", &CI);
1225 Assert1(CI.getParent()->getParent()->hasCollector(),
1226 "Enclosing function does not specify a collector algorithm.",
1229 case Intrinsic::init_trampoline:
1230 Assert1(isa<Function>(IntrinsicInst::StripPointerCasts(CI.getOperand(2))),
1231 "llvm.init_trampoline parameter #2 must resolve to a function.",
1237 /// VerifyIntrinsicPrototype - TableGen emits calls to this function into
1238 /// Intrinsics.gen. This implements a little state machine that verifies the
1239 /// prototype of intrinsics.
1240 void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID,
1242 unsigned Count, ...) {
1244 va_start(VA, Count);
1246 const FunctionType *FTy = F->getFunctionType();
1248 // For overloaded intrinsics, the Suffix of the function name must match the
1249 // types of the arguments. This variable keeps track of the expected
1250 // suffix, to be checked at the end.
1253 if (FTy->getNumParams() + FTy->isVarArg() != Count - 1) {
1254 CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
1258 // Note that "arg#0" is the return type.
1259 for (unsigned ArgNo = 0; ArgNo < Count; ++ArgNo) {
1260 MVT::ValueType VT = va_arg(VA, MVT::ValueType);
1262 if (VT == MVT::isVoid && ArgNo > 0) {
1263 if (!FTy->isVarArg())
1264 CheckFailed("Intrinsic prototype has no '...'!", F);
1270 Ty = FTy->getReturnType();
1272 Ty = FTy->getParamType(ArgNo-1);
1274 unsigned NumElts = 0;
1275 const Type *EltTy = Ty;
1276 if (const VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1277 EltTy = VTy->getElementType();
1278 NumElts = VTy->getNumElements();
1284 if (Ty != FTy->getReturnType()) {
1285 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
1286 "match return type.", F);
1290 if (Ty != FTy->getParamType(Match-1)) {
1291 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
1292 "match parameter %" + utostr(Match-1) + ".", F);
1296 } else if (VT == MVT::iAny) {
1297 if (!EltTy->isInteger()) {
1299 CheckFailed("Intrinsic result type is not "
1300 "an integer type.", F);
1302 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
1303 "an integer type.", F);
1306 unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
1309 Suffix += "v" + utostr(NumElts);
1310 Suffix += "i" + utostr(GotBits);;
1311 // Check some constraints on various intrinsics.
1313 default: break; // Not everything needs to be checked.
1314 case Intrinsic::bswap:
1315 if (GotBits < 16 || GotBits % 16 != 0)
1316 CheckFailed("Intrinsic requires even byte width argument", F);
1319 } else if (VT == MVT::fAny) {
1320 if (!EltTy->isFloatingPoint()) {
1322 CheckFailed("Intrinsic result type is not "
1323 "a floating-point type.", F);
1325 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
1326 "a floating-point type.", F);
1331 Suffix += "v" + utostr(NumElts);
1332 Suffix += MVT::getValueTypeString(MVT::getValueType(EltTy));
1333 } else if (VT == MVT::iPTR) {
1334 if (!isa<PointerType>(Ty)) {
1336 CheckFailed("Intrinsic result type is not a "
1337 "pointer and a pointer is required.", F);
1339 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not a "
1340 "pointer and a pointer is required.", F);
1343 } else if (MVT::isVector(VT)) {
1344 // If this is a vector argument, verify the number and type of elements.
1345 if (MVT::getVectorElementType(VT) != MVT::getValueType(EltTy)) {
1346 CheckFailed("Intrinsic prototype has incorrect vector element type!",
1350 if (MVT::getVectorNumElements(VT) != NumElts) {
1351 CheckFailed("Intrinsic prototype has incorrect number of "
1352 "vector elements!",F);
1355 } else if (MVT::getTypeForValueType(VT) != EltTy) {
1357 CheckFailed("Intrinsic prototype has incorrect result type!", F);
1359 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is wrong!",F);
1361 } else if (EltTy != Ty) {
1363 CheckFailed("Intrinsic result type is vector "
1364 "and a scalar is required.", F);
1366 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is vector "
1367 "and a scalar is required.", F);
1373 // If we computed a Suffix then the intrinsic is overloaded and we need to
1374 // make sure that the name of the function is correct. We add the suffix to
1375 // the name of the intrinsic and compare against the given function name. If
1376 // they are not the same, the function name is invalid. This ensures that
1377 // overloading of intrinsics uses a sane and consistent naming convention.
1378 if (!Suffix.empty()) {
1379 std::string Name(Intrinsic::getName(ID));
1380 if (Name + Suffix != F->getName())
1381 CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
1382 F->getName().substr(Name.length()) + "'. It should be '" +
1388 //===----------------------------------------------------------------------===//
1389 // Implement the public interfaces to this file...
1390 //===----------------------------------------------------------------------===//
1392 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1393 return new Verifier(action);
1397 // verifyFunction - Create
1398 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1399 Function &F = const_cast<Function&>(f);
1400 assert(!F.isDeclaration() && "Cannot verify external functions");
1402 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
1403 Verifier *V = new Verifier(action);
1409 /// verifyModule - Check a module for errors, printing messages on stderr.
1410 /// Return true if the module is corrupt.
1412 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1413 std::string *ErrorInfo) {
1415 Verifier *V = new Verifier(action);
1419 if (ErrorInfo && V->Broken)
1420 *ErrorInfo = V->msgs.str();