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/Module.h"
49 #include "llvm/ModuleProvider.h"
50 #include "llvm/Pass.h"
51 #include "llvm/PassManager.h"
52 #include "llvm/Analysis/Dominators.h"
53 #include "llvm/Assembly/Writer.h"
54 #include "llvm/CodeGen/ValueTypes.h"
55 #include "llvm/Support/CallSite.h"
56 #include "llvm/Support/CFG.h"
57 #include "llvm/Support/InstVisitor.h"
58 #include "llvm/Support/Streams.h"
59 #include "llvm/ADT/SmallPtrSet.h"
60 #include "llvm/ADT/SmallVector.h"
61 #include "llvm/ADT/StringExtras.h"
62 #include "llvm/ADT/STLExtras.h"
63 #include "llvm/Support/Compiler.h"
69 namespace { // Anonymous namespace for class
70 struct VISIBILITY_HIDDEN PreVerifier : public FunctionPass {
71 static char ID; // Pass ID, replacement for typeid
73 PreVerifier() : FunctionPass(&ID) { }
75 // Check that the prerequisites for successful DominatorTree construction
77 bool runOnFunction(Function &F) {
80 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
81 if (I->empty() || !I->back().isTerminator()) {
82 cerr << "Basic Block does not have terminator!\n";
83 WriteAsOperand(*cerr, I, true);
97 char PreVerifier::ID = 0;
98 static RegisterPass<PreVerifier>
99 PreVer("preverify", "Preliminary module verification");
100 static const PassInfo *const PreVerifyID = &PreVer;
103 struct VISIBILITY_HIDDEN
104 Verifier : public FunctionPass, InstVisitor<Verifier> {
105 static char ID; // Pass ID, replacement for typeid
106 bool Broken; // Is this module found to be broken?
107 bool RealPass; // Are we not being run by a PassManager?
108 VerifierFailureAction action;
109 // What to do if verification fails.
110 Module *Mod; // Module we are verifying right now
111 DominatorTree *DT; // Dominator Tree, caution can be null!
112 std::stringstream msgs; // A stringstream to collect messages
114 /// InstInThisBlock - when verifying a basic block, keep track of all of the
115 /// instructions we have seen so far. This allows us to do efficient
116 /// dominance checks for the case when an instruction has an operand that is
117 /// an instruction in the same block.
118 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
122 Broken(false), RealPass(true), action(AbortProcessAction),
123 DT(0), msgs( std::ios::app | std::ios::out ) {}
124 explicit Verifier(VerifierFailureAction ctn)
126 Broken(false), RealPass(true), action(ctn), DT(0),
127 msgs( std::ios::app | std::ios::out ) {}
128 explicit Verifier(bool AB)
130 Broken(false), RealPass(true),
131 action( AB ? AbortProcessAction : PrintMessageAction), DT(0),
132 msgs( std::ios::app | std::ios::out ) {}
133 explicit Verifier(DominatorTree &dt)
135 Broken(false), RealPass(false), action(PrintMessageAction),
136 DT(&dt), msgs( std::ios::app | std::ios::out ) {}
139 bool doInitialization(Module &M) {
141 verifyTypeSymbolTable(M.getTypeSymbolTable());
143 // If this is a real pass, in a pass manager, we must abort before
144 // returning back to the pass manager, or else the pass manager may try to
145 // run other passes on the broken module.
147 return abortIfBroken();
151 bool runOnFunction(Function &F) {
152 // Get dominator information if we are being run by PassManager
153 if (RealPass) DT = &getAnalysis<DominatorTree>();
158 InstsInThisBlock.clear();
160 // If this is a real pass, in a pass manager, we must abort before
161 // returning back to the pass manager, or else the pass manager may try to
162 // run other passes on the broken module.
164 return abortIfBroken();
169 bool doFinalization(Module &M) {
170 // Scan through, checking all of the external function's linkage now...
171 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
172 visitGlobalValue(*I);
174 // Check to make sure function prototypes are okay.
175 if (I->isDeclaration()) visitFunction(*I);
178 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
180 visitGlobalVariable(*I);
182 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
184 visitGlobalAlias(*I);
186 // If the module is broken, abort at this time.
187 return abortIfBroken();
190 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
191 AU.setPreservesAll();
192 AU.addRequiredID(PreVerifyID);
194 AU.addRequired<DominatorTree>();
197 /// abortIfBroken - If the module is broken and we are supposed to abort on
198 /// this condition, do so.
200 bool abortIfBroken() {
201 if (!Broken) return false;
202 msgs << "Broken module found, ";
204 default: assert(0 && "Unknown action");
205 case AbortProcessAction:
206 msgs << "compilation aborted!\n";
209 case PrintMessageAction:
210 msgs << "verification continues.\n";
213 case ReturnStatusAction:
214 msgs << "compilation terminated.\n";
220 // Verification methods...
221 void verifyTypeSymbolTable(TypeSymbolTable &ST);
222 void visitGlobalValue(GlobalValue &GV);
223 void visitGlobalVariable(GlobalVariable &GV);
224 void visitGlobalAlias(GlobalAlias &GA);
225 void visitFunction(Function &F);
226 void visitBasicBlock(BasicBlock &BB);
227 using InstVisitor<Verifier>::visit;
229 void visit(Instruction &I);
231 void visitTruncInst(TruncInst &I);
232 void visitZExtInst(ZExtInst &I);
233 void visitSExtInst(SExtInst &I);
234 void visitFPTruncInst(FPTruncInst &I);
235 void visitFPExtInst(FPExtInst &I);
236 void visitFPToUIInst(FPToUIInst &I);
237 void visitFPToSIInst(FPToSIInst &I);
238 void visitUIToFPInst(UIToFPInst &I);
239 void visitSIToFPInst(SIToFPInst &I);
240 void visitIntToPtrInst(IntToPtrInst &I);
241 void visitPtrToIntInst(PtrToIntInst &I);
242 void visitBitCastInst(BitCastInst &I);
243 void visitPHINode(PHINode &PN);
244 void visitBinaryOperator(BinaryOperator &B);
245 void visitICmpInst(ICmpInst &IC);
246 void visitFCmpInst(FCmpInst &FC);
247 void visitExtractElementInst(ExtractElementInst &EI);
248 void visitInsertElementInst(InsertElementInst &EI);
249 void visitShuffleVectorInst(ShuffleVectorInst &EI);
250 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
251 void visitCallInst(CallInst &CI);
252 void visitInvokeInst(InvokeInst &II);
253 void visitGetElementPtrInst(GetElementPtrInst &GEP);
254 void visitLoadInst(LoadInst &LI);
255 void visitStoreInst(StoreInst &SI);
256 void visitInstruction(Instruction &I);
257 void visitTerminatorInst(TerminatorInst &I);
258 void visitReturnInst(ReturnInst &RI);
259 void visitSwitchInst(SwitchInst &SI);
260 void visitSelectInst(SelectInst &SI);
261 void visitUserOp1(Instruction &I);
262 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
263 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
264 void visitAllocationInst(AllocationInst &AI);
265 void visitExtractValueInst(ExtractValueInst &EVI);
266 void visitInsertValueInst(InsertValueInst &IVI);
268 void VerifyCallSite(CallSite CS);
269 void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
270 unsigned Count, ...);
271 void VerifyAttrs(ParameterAttributes Attrs, const Type *Ty,
272 bool isReturnValue, const Value *V);
273 void VerifyFunctionAttrs(const FunctionType *FT, const PAListPtr &Attrs,
276 void WriteValue(const Value *V) {
278 if (isa<Instruction>(V)) {
281 WriteAsOperand(msgs, V, true, Mod);
286 void WriteType(const Type *T) {
288 WriteTypeSymbolic(msgs, T, Mod );
292 // CheckFailed - A check failed, so print out the condition and the message
293 // that failed. This provides a nice place to put a breakpoint if you want
294 // to see why something is not correct.
295 void CheckFailed(const std::string &Message,
296 const Value *V1 = 0, const Value *V2 = 0,
297 const Value *V3 = 0, const Value *V4 = 0) {
298 msgs << Message << "\n";
306 void CheckFailed( const std::string& Message, const Value* V1,
307 const Type* T2, const Value* V3 = 0 ) {
308 msgs << Message << "\n";
315 } // End anonymous namespace
317 char Verifier::ID = 0;
318 static RegisterPass<Verifier> X("verify", "Module Verifier");
320 // Assert - We know that cond should be true, if not print an error message.
321 #define Assert(C, M) \
322 do { if (!(C)) { CheckFailed(M); return; } } while (0)
323 #define Assert1(C, M, V1) \
324 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
325 #define Assert2(C, M, V1, V2) \
326 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
327 #define Assert3(C, M, V1, V2, V3) \
328 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
329 #define Assert4(C, M, V1, V2, V3, V4) \
330 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
333 void Verifier::visit(Instruction &I) {
334 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
335 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
336 InstVisitor<Verifier>::visit(I);
340 void Verifier::visitGlobalValue(GlobalValue &GV) {
341 Assert1(!GV.isDeclaration() ||
342 GV.hasExternalLinkage() ||
343 GV.hasDLLImportLinkage() ||
344 GV.hasExternalWeakLinkage() ||
345 GV.hasGhostLinkage() ||
346 (isa<GlobalAlias>(GV) &&
347 (GV.hasInternalLinkage() || GV.hasWeakLinkage())),
348 "Global is external, but doesn't have external or dllimport or weak linkage!",
351 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
352 "Global is marked as dllimport, but not external", &GV);
354 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
355 "Only global variables can have appending linkage!", &GV);
357 if (GV.hasAppendingLinkage()) {
358 GlobalVariable &GVar = cast<GlobalVariable>(GV);
359 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
360 "Only global arrays can have appending linkage!", &GV);
364 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
365 if (GV.hasInitializer()) {
366 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
367 "Global variable initializer type does not match global "
368 "variable type!", &GV);
370 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
371 GV.hasExternalWeakLinkage(),
372 "invalid linkage type for global declaration", &GV);
375 visitGlobalValue(GV);
378 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
379 Assert1(!GA.getName().empty(),
380 "Alias name cannot be empty!", &GA);
381 Assert1(GA.hasExternalLinkage() || GA.hasInternalLinkage() ||
383 "Alias should have external or external weak linkage!", &GA);
384 Assert1(GA.getAliasee(),
385 "Aliasee cannot be NULL!", &GA);
386 Assert1(GA.getType() == GA.getAliasee()->getType(),
387 "Alias and aliasee types should match!", &GA);
389 if (!isa<GlobalValue>(GA.getAliasee())) {
390 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
391 Assert1(CE && CE->getOpcode() == Instruction::BitCast &&
392 isa<GlobalValue>(CE->getOperand(0)),
393 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
397 const GlobalValue* Aliasee = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
399 "Aliasing chain should end with function or global variable", &GA);
401 visitGlobalValue(GA);
404 void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
407 // VerifyAttrs - Check the given parameter attributes for an argument or return
408 // value of the specified type. The value V is printed in error messages.
409 void Verifier::VerifyAttrs(ParameterAttributes Attrs, const Type *Ty,
410 bool isReturnValue, const Value *V) {
411 if (Attrs == ParamAttr::None)
415 ParameterAttributes RetI = Attrs & ParamAttr::ParameterOnly;
416 Assert1(!RetI, "Attribute " + ParamAttr::getAsString(RetI) +
417 " does not apply to return values!", V);
419 ParameterAttributes ParmI = Attrs & ParamAttr::ReturnOnly;
420 Assert1(!ParmI, "Attribute " + ParamAttr::getAsString(ParmI) +
421 " only applies to return values!", V);
425 i < array_lengthof(ParamAttr::MutuallyIncompatible); ++i) {
426 ParameterAttributes MutI = Attrs & ParamAttr::MutuallyIncompatible[i];
427 Assert1(!(MutI & (MutI - 1)), "Attributes " +
428 ParamAttr::getAsString(MutI) + " are incompatible!", V);
431 ParameterAttributes TypeI = Attrs & ParamAttr::typeIncompatible(Ty);
432 Assert1(!TypeI, "Wrong type for attribute " +
433 ParamAttr::getAsString(TypeI), V);
435 ParameterAttributes ByValI = Attrs & ParamAttr::ByVal;
436 if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
437 Assert1(!ByValI || PTy->getElementType()->isSized(),
438 "Attribute " + ParamAttr::getAsString(ByValI) +
439 " does not support unsized types!", V);
442 "Attribute " + ParamAttr::getAsString(ByValI) +
443 " only applies to parameters with pointer type!", V);
447 // VerifyFunctionAttrs - Check parameter attributes against a function type.
448 // The value V is printed in error messages.
449 void Verifier::VerifyFunctionAttrs(const FunctionType *FT,
450 const PAListPtr &Attrs,
455 bool SawNest = false;
457 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
458 const ParamAttrsWithIndex &Attr = Attrs.getSlot(i);
462 Ty = FT->getReturnType();
463 else if (Attr.Index-1 < FT->getNumParams())
464 Ty = FT->getParamType(Attr.Index-1);
466 break; // VarArgs attributes, don't verify.
468 VerifyAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
470 if (Attr.Attrs & ParamAttr::Nest) {
471 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
475 if (Attr.Attrs & ParamAttr::StructRet)
476 Assert1(Attr.Index == 1, "Attribute sret not on first parameter!", V);
480 // visitFunction - Verify that a function is ok.
482 void Verifier::visitFunction(Function &F) {
483 // Check function arguments.
484 const FunctionType *FT = F.getFunctionType();
485 unsigned NumArgs = F.arg_size();
487 Assert2(FT->getNumParams() == NumArgs,
488 "# formal arguments must match # of arguments for function type!",
490 Assert1(F.getReturnType()->isFirstClassType() ||
491 F.getReturnType() == Type::VoidTy ||
492 isa<StructType>(F.getReturnType()),
493 "Functions cannot return aggregate values!", &F);
495 Assert1(!F.hasStructRetAttr() || F.getReturnType() == Type::VoidTy,
496 "Invalid struct return type!", &F);
498 const PAListPtr &Attrs = F.getParamAttrs();
500 Assert1(Attrs.isEmpty() ||
501 Attrs.getSlot(Attrs.getNumSlots()-1).Index <= FT->getNumParams(),
502 "Attributes after last parameter!", &F);
504 // Check function attributes.
505 VerifyFunctionAttrs(FT, Attrs, &F);
507 // Check that this function meets the restrictions on this calling convention.
508 switch (F.getCallingConv()) {
512 case CallingConv::X86_SSECall:
514 case CallingConv::Fast:
515 case CallingConv::Cold:
516 case CallingConv::X86_FastCall:
517 Assert1(!F.isVarArg(),
518 "Varargs functions must have C calling conventions!", &F);
522 // Check that the argument values match the function type for this function...
524 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
526 Assert2(I->getType() == FT->getParamType(i),
527 "Argument value does not match function argument type!",
528 I, FT->getParamType(i));
529 Assert1(I->getType()->isFirstClassType(),
530 "Function arguments must have first-class types!", I);
533 if (F.isDeclaration()) {
534 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
535 F.hasExternalWeakLinkage() || F.hasGhostLinkage(),
536 "invalid linkage type for function declaration", &F);
538 // Verify that this function (which has a body) is not named "llvm.*". It
539 // is not legal to define intrinsics.
540 if (F.getName().size() >= 5)
541 Assert1(F.getName().substr(0, 5) != "llvm.",
542 "llvm intrinsics cannot be defined!", &F);
544 // Check the entry node
545 BasicBlock *Entry = &F.getEntryBlock();
546 Assert1(pred_begin(Entry) == pred_end(Entry),
547 "Entry block to function must not have predecessors!", Entry);
552 // verifyBasicBlock - Verify that a basic block is well formed...
554 void Verifier::visitBasicBlock(BasicBlock &BB) {
555 InstsInThisBlock.clear();
557 // Ensure that basic blocks have terminators!
558 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
560 // Check constraints that this basic block imposes on all of the PHI nodes in
562 if (isa<PHINode>(BB.front())) {
563 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
564 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
565 std::sort(Preds.begin(), Preds.end());
567 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
569 // Ensure that PHI nodes have at least one entry!
570 Assert1(PN->getNumIncomingValues() != 0,
571 "PHI nodes must have at least one entry. If the block is dead, "
572 "the PHI should be removed!", PN);
573 Assert1(PN->getNumIncomingValues() == Preds.size(),
574 "PHINode should have one entry for each predecessor of its "
575 "parent basic block!", PN);
577 // Get and sort all incoming values in the PHI node...
579 Values.reserve(PN->getNumIncomingValues());
580 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
581 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
582 PN->getIncomingValue(i)));
583 std::sort(Values.begin(), Values.end());
585 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
586 // Check to make sure that if there is more than one entry for a
587 // particular basic block in this PHI node, that the incoming values are
590 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
591 Values[i].second == Values[i-1].second,
592 "PHI node has multiple entries for the same basic block with "
593 "different incoming values!", PN, Values[i].first,
594 Values[i].second, Values[i-1].second);
596 // Check to make sure that the predecessors and PHI node entries are
598 Assert3(Values[i].first == Preds[i],
599 "PHI node entries do not match predecessors!", PN,
600 Values[i].first, Preds[i]);
606 void Verifier::visitTerminatorInst(TerminatorInst &I) {
607 // Ensure that terminators only exist at the end of the basic block.
608 Assert1(&I == I.getParent()->getTerminator(),
609 "Terminator found in the middle of a basic block!", I.getParent());
613 void Verifier::visitReturnInst(ReturnInst &RI) {
614 Function *F = RI.getParent()->getParent();
615 unsigned N = RI.getNumOperands();
616 if (F->getReturnType() == Type::VoidTy)
618 "Found return instr that returns void in Function of non-void "
619 "return type!", &RI, F->getReturnType());
620 else if (N == 1 && F->getReturnType() == RI.getOperand(0)->getType()) {
621 // Exactly one return value and it matches the return type. Good.
622 } else if (const StructType *STy = dyn_cast<StructType>(F->getReturnType())) {
623 // The return type is a struct; check for multiple return values.
624 Assert2(STy->getNumElements() == N,
625 "Incorrect number of return values in ret instruction!",
626 &RI, F->getReturnType());
627 for (unsigned i = 0; i != N; ++i)
628 Assert2(STy->getElementType(i) == RI.getOperand(i)->getType(),
629 "Function return type does not match operand "
630 "type of return inst!", &RI, F->getReturnType());
631 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(F->getReturnType())) {
632 // The return type is an array; check for multiple return values.
633 Assert2(ATy->getNumElements() == N,
634 "Incorrect number of return values in ret instruction!",
635 &RI, F->getReturnType());
636 for (unsigned i = 0; i != N; ++i)
637 Assert2(ATy->getElementType() == RI.getOperand(i)->getType(),
638 "Function return type does not match operand "
639 "type of return inst!", &RI, F->getReturnType());
641 CheckFailed("Function return type does not match operand "
642 "type of return inst!", &RI, F->getReturnType());
645 // Check to make sure that the return value has necessary properties for
647 visitTerminatorInst(RI);
650 void Verifier::visitSwitchInst(SwitchInst &SI) {
651 // Check to make sure that all of the constants in the switch instruction
652 // have the same type as the switched-on value.
653 const Type *SwitchTy = SI.getCondition()->getType();
654 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
655 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
656 "Switch constants must all be same type as switch value!", &SI);
658 visitTerminatorInst(SI);
661 void Verifier::visitSelectInst(SelectInst &SI) {
662 if (const VectorType* vt
663 = dyn_cast<VectorType>(SI.getCondition()->getType())) {
664 Assert1( vt->getElementType() == Type::Int1Ty,
665 "Select condition type must be vector of bool!", &SI);
666 if (const VectorType* val_vt
667 = dyn_cast<VectorType>(SI.getTrueValue()->getType())) {
668 Assert1( vt->getNumElements() == val_vt->getNumElements(),
669 "Select vector size != value vector size", &SI);
671 Assert1(0, "Vector select values must have vector types", &SI);
674 Assert1(SI.getCondition()->getType() == Type::Int1Ty,
675 "Select condition type must be bool!", &SI);
677 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
678 "Select values must have identical types!", &SI);
679 Assert1(SI.getTrueValue()->getType() == SI.getType(),
680 "Select values must have same type as select instruction!", &SI);
681 visitInstruction(SI);
685 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
686 /// a pass, if any exist, it's an error.
688 void Verifier::visitUserOp1(Instruction &I) {
689 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
692 void Verifier::visitTruncInst(TruncInst &I) {
693 // Get the source and destination types
694 const Type *SrcTy = I.getOperand(0)->getType();
695 const Type *DestTy = I.getType();
697 // Get the size of the types in bits, we'll need this later
698 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
699 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
701 Assert1(SrcTy->isIntOrIntVector(), "Trunc only operates on integer", &I);
702 Assert1(DestTy->isIntOrIntVector(), "Trunc only produces integer", &I);
703 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
708 void Verifier::visitZExtInst(ZExtInst &I) {
709 // Get the source and destination types
710 const Type *SrcTy = I.getOperand(0)->getType();
711 const Type *DestTy = I.getType();
713 // Get the size of the types in bits, we'll need this later
714 Assert1(SrcTy->isIntOrIntVector(), "ZExt only operates on integer", &I);
715 Assert1(DestTy->isIntOrIntVector(), "ZExt only produces an integer", &I);
716 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
717 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
719 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
724 void Verifier::visitSExtInst(SExtInst &I) {
725 // Get the source and destination types
726 const Type *SrcTy = I.getOperand(0)->getType();
727 const Type *DestTy = I.getType();
729 // Get the size of the types in bits, we'll need this later
730 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
731 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
733 Assert1(SrcTy->isIntOrIntVector(), "SExt only operates on integer", &I);
734 Assert1(DestTy->isIntOrIntVector(), "SExt only produces an integer", &I);
735 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
740 void Verifier::visitFPTruncInst(FPTruncInst &I) {
741 // Get the source and destination types
742 const Type *SrcTy = I.getOperand(0)->getType();
743 const Type *DestTy = I.getType();
744 // Get the size of the types in bits, we'll need this later
745 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
746 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
748 Assert1(SrcTy->isFPOrFPVector(),"FPTrunc only operates on FP", &I);
749 Assert1(DestTy->isFPOrFPVector(),"FPTrunc only produces an FP", &I);
750 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
755 void Verifier::visitFPExtInst(FPExtInst &I) {
756 // Get the source and destination types
757 const Type *SrcTy = I.getOperand(0)->getType();
758 const Type *DestTy = I.getType();
760 // Get the size of the types in bits, we'll need this later
761 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
762 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
764 Assert1(SrcTy->isFPOrFPVector(),"FPExt only operates on FP", &I);
765 Assert1(DestTy->isFPOrFPVector(),"FPExt only produces an FP", &I);
766 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
771 void Verifier::visitUIToFPInst(UIToFPInst &I) {
772 // Get the source and destination types
773 const Type *SrcTy = I.getOperand(0)->getType();
774 const Type *DestTy = I.getType();
776 bool SrcVec = isa<VectorType>(SrcTy);
777 bool DstVec = isa<VectorType>(DestTy);
779 Assert1(SrcVec == DstVec,
780 "UIToFP source and dest must both be vector or scalar", &I);
781 Assert1(SrcTy->isIntOrIntVector(),
782 "UIToFP source must be integer or integer vector", &I);
783 Assert1(DestTy->isFPOrFPVector(),
784 "UIToFP result must be FP or FP vector", &I);
786 if (SrcVec && DstVec)
787 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
788 cast<VectorType>(DestTy)->getNumElements(),
789 "UIToFP source and dest vector length mismatch", &I);
794 void Verifier::visitSIToFPInst(SIToFPInst &I) {
795 // Get the source and destination types
796 const Type *SrcTy = I.getOperand(0)->getType();
797 const Type *DestTy = I.getType();
799 bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
800 bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
802 Assert1(SrcVec == DstVec,
803 "SIToFP source and dest must both be vector or scalar", &I);
804 Assert1(SrcTy->isIntOrIntVector(),
805 "SIToFP source must be integer or integer vector", &I);
806 Assert1(DestTy->isFPOrFPVector(),
807 "SIToFP result must be FP or FP vector", &I);
809 if (SrcVec && DstVec)
810 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
811 cast<VectorType>(DestTy)->getNumElements(),
812 "SIToFP source and dest vector length mismatch", &I);
817 void Verifier::visitFPToUIInst(FPToUIInst &I) {
818 // Get the source and destination types
819 const Type *SrcTy = I.getOperand(0)->getType();
820 const Type *DestTy = I.getType();
822 bool SrcVec = isa<VectorType>(SrcTy);
823 bool DstVec = isa<VectorType>(DestTy);
825 Assert1(SrcVec == DstVec,
826 "FPToUI source and dest must both be vector or scalar", &I);
827 Assert1(SrcTy->isFPOrFPVector(), "FPToUI source must be FP or FP vector", &I);
828 Assert1(DestTy->isIntOrIntVector(),
829 "FPToUI result must be integer or integer vector", &I);
831 if (SrcVec && DstVec)
832 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
833 cast<VectorType>(DestTy)->getNumElements(),
834 "FPToUI source and dest vector length mismatch", &I);
839 void Verifier::visitFPToSIInst(FPToSIInst &I) {
840 // Get the source and destination types
841 const Type *SrcTy = I.getOperand(0)->getType();
842 const Type *DestTy = I.getType();
844 bool SrcVec = isa<VectorType>(SrcTy);
845 bool DstVec = isa<VectorType>(DestTy);
847 Assert1(SrcVec == DstVec,
848 "FPToSI source and dest must both be vector or scalar", &I);
849 Assert1(SrcTy->isFPOrFPVector(),
850 "FPToSI source must be FP or FP vector", &I);
851 Assert1(DestTy->isIntOrIntVector(),
852 "FPToSI result must be integer or integer vector", &I);
854 if (SrcVec && DstVec)
855 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
856 cast<VectorType>(DestTy)->getNumElements(),
857 "FPToSI source and dest vector length mismatch", &I);
862 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
863 // Get the source and destination types
864 const Type *SrcTy = I.getOperand(0)->getType();
865 const Type *DestTy = I.getType();
867 Assert1(isa<PointerType>(SrcTy), "PtrToInt source must be pointer", &I);
868 Assert1(DestTy->isInteger(), "PtrToInt result must be integral", &I);
873 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
874 // Get the source and destination types
875 const Type *SrcTy = I.getOperand(0)->getType();
876 const Type *DestTy = I.getType();
878 Assert1(SrcTy->isInteger(), "IntToPtr source must be an integral", &I);
879 Assert1(isa<PointerType>(DestTy), "IntToPtr result must be a pointer",&I);
884 void Verifier::visitBitCastInst(BitCastInst &I) {
885 // Get the source and destination types
886 const Type *SrcTy = I.getOperand(0)->getType();
887 const Type *DestTy = I.getType();
889 // Get the size of the types in bits, we'll need this later
890 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
891 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
893 // BitCast implies a no-op cast of type only. No bits change.
894 // However, you can't cast pointers to anything but pointers.
895 Assert1(isa<PointerType>(DestTy) == isa<PointerType>(DestTy),
896 "Bitcast requires both operands to be pointer or neither", &I);
897 Assert1(SrcBitSize == DestBitSize, "Bitcast requies types of same width", &I);
899 // Disallow aggregates.
900 Assert1(!SrcTy->isAggregateType(),
901 "Bitcast operand must not be aggregate", &I);
902 Assert1(!DestTy->isAggregateType(),
903 "Bitcast type must not be aggregate", &I);
908 /// visitPHINode - Ensure that a PHI node is well formed.
910 void Verifier::visitPHINode(PHINode &PN) {
911 // Ensure that the PHI nodes are all grouped together at the top of the block.
912 // This can be tested by checking whether the instruction before this is
913 // either nonexistent (because this is begin()) or is a PHI node. If not,
914 // then there is some other instruction before a PHI.
915 Assert2(&PN == &PN.getParent()->front() ||
916 isa<PHINode>(--BasicBlock::iterator(&PN)),
917 "PHI nodes not grouped at top of basic block!",
918 &PN, PN.getParent());
920 // Check that all of the operands of the PHI node have the same type as the
922 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
923 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
924 "PHI node operands are not the same type as the result!", &PN);
926 // All other PHI node constraints are checked in the visitBasicBlock method.
928 visitInstruction(PN);
931 void Verifier::VerifyCallSite(CallSite CS) {
932 Instruction *I = CS.getInstruction();
934 Assert1(isa<PointerType>(CS.getCalledValue()->getType()),
935 "Called function must be a pointer!", I);
936 const PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
937 Assert1(isa<FunctionType>(FPTy->getElementType()),
938 "Called function is not pointer to function type!", I);
940 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
942 // Verify that the correct number of arguments are being passed
944 Assert1(CS.arg_size() >= FTy->getNumParams(),
945 "Called function requires more parameters than were provided!",I);
947 Assert1(CS.arg_size() == FTy->getNumParams(),
948 "Incorrect number of arguments passed to called function!", I);
950 // Verify that all arguments to the call match the function type...
951 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
952 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
953 "Call parameter type does not match function signature!",
954 CS.getArgument(i), FTy->getParamType(i), I);
956 const PAListPtr &Attrs = CS.getParamAttrs();
958 Assert1(Attrs.isEmpty() ||
959 Attrs.getSlot(Attrs.getNumSlots()-1).Index <= CS.arg_size(),
960 "Attributes after last parameter!", I);
962 // Verify call attributes.
963 VerifyFunctionAttrs(FTy, Attrs, I);
966 // Check attributes on the varargs part.
967 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
968 ParameterAttributes Attr = Attrs.getParamAttrs(Idx);
970 VerifyAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
972 ParameterAttributes VArgI = Attr & ParamAttr::VarArgsIncompatible;
973 Assert1(!VArgI, "Attribute " + ParamAttr::getAsString(VArgI) +
974 " cannot be used for vararg call arguments!", I);
977 visitInstruction(*I);
980 void Verifier::visitCallInst(CallInst &CI) {
983 if (Function *F = CI.getCalledFunction()) {
984 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
985 visitIntrinsicFunctionCall(ID, CI);
989 void Verifier::visitInvokeInst(InvokeInst &II) {
993 /// visitBinaryOperator - Check that both arguments to the binary operator are
994 /// of the same type!
996 void Verifier::visitBinaryOperator(BinaryOperator &B) {
997 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
998 "Both operands to a binary operator are not of the same type!", &B);
1000 switch (B.getOpcode()) {
1001 // Check that logical operators are only used with integral operands.
1002 case Instruction::And:
1003 case Instruction::Or:
1004 case Instruction::Xor:
1005 Assert1(B.getType()->isInteger() ||
1006 (isa<VectorType>(B.getType()) &&
1007 cast<VectorType>(B.getType())->getElementType()->isInteger()),
1008 "Logical operators only work with integral types!", &B);
1009 Assert1(B.getType() == B.getOperand(0)->getType(),
1010 "Logical operators must have same type for operands and result!",
1013 case Instruction::Shl:
1014 case Instruction::LShr:
1015 case Instruction::AShr:
1016 Assert1(B.getType()->isInteger() ||
1017 (isa<VectorType>(B.getType()) &&
1018 cast<VectorType>(B.getType())->getElementType()->isInteger()),
1019 "Shifts only work with integral types!", &B);
1020 Assert1(B.getType() == B.getOperand(0)->getType(),
1021 "Shift return type must be same as operands!", &B);
1024 // Arithmetic operators only work on integer or fp values
1025 Assert1(B.getType() == B.getOperand(0)->getType(),
1026 "Arithmetic operators must have same type for operands and result!",
1028 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint() ||
1029 isa<VectorType>(B.getType()),
1030 "Arithmetic operators must have integer, fp, or vector type!", &B);
1034 visitInstruction(B);
1037 void Verifier::visitICmpInst(ICmpInst& IC) {
1038 // Check that the operands are the same type
1039 const Type* Op0Ty = IC.getOperand(0)->getType();
1040 const Type* Op1Ty = IC.getOperand(1)->getType();
1041 Assert1(Op0Ty == Op1Ty,
1042 "Both operands to ICmp instruction are not of the same type!", &IC);
1043 // Check that the operands are the right type
1044 Assert1(Op0Ty->isIntOrIntVector() || isa<PointerType>(Op0Ty),
1045 "Invalid operand types for ICmp instruction", &IC);
1046 visitInstruction(IC);
1049 void Verifier::visitFCmpInst(FCmpInst& FC) {
1050 // Check that the operands are the same type
1051 const Type* Op0Ty = FC.getOperand(0)->getType();
1052 const Type* Op1Ty = FC.getOperand(1)->getType();
1053 Assert1(Op0Ty == Op1Ty,
1054 "Both operands to FCmp instruction are not of the same type!", &FC);
1055 // Check that the operands are the right type
1056 Assert1(Op0Ty->isFPOrFPVector(),
1057 "Invalid operand types for FCmp instruction", &FC);
1058 visitInstruction(FC);
1061 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1062 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1064 "Invalid extractelement operands!", &EI);
1065 visitInstruction(EI);
1068 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1069 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1072 "Invalid insertelement operands!", &IE);
1073 visitInstruction(IE);
1076 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1077 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1079 "Invalid shufflevector operands!", &SV);
1080 Assert1(SV.getType() == SV.getOperand(0)->getType(),
1081 "Result of shufflevector must match first operand type!", &SV);
1083 // Check to see if Mask is valid.
1084 if (const ConstantVector *MV = dyn_cast<ConstantVector>(SV.getOperand(2))) {
1085 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1086 if (ConstantInt* CI = dyn_cast<ConstantInt>(MV->getOperand(i))) {
1087 Assert1(!CI->uge(MV->getNumOperands()*2),
1088 "Invalid shufflevector shuffle mask!", &SV);
1090 Assert1(isa<UndefValue>(MV->getOperand(i)),
1091 "Invalid shufflevector shuffle mask!", &SV);
1095 Assert1(isa<UndefValue>(SV.getOperand(2)) ||
1096 isa<ConstantAggregateZero>(SV.getOperand(2)),
1097 "Invalid shufflevector shuffle mask!", &SV);
1100 visitInstruction(SV);
1103 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1104 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1106 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
1107 Idxs.begin(), Idxs.end());
1108 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1109 Assert2(isa<PointerType>(GEP.getType()) &&
1110 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1111 "GEP is not of right type for indices!", &GEP, ElTy);
1112 visitInstruction(GEP);
1115 void Verifier::visitLoadInst(LoadInst &LI) {
1117 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
1118 Assert2(ElTy == LI.getType(),
1119 "Load result type does not match pointer operand type!", &LI, ElTy);
1120 visitInstruction(LI);
1123 void Verifier::visitStoreInst(StoreInst &SI) {
1125 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
1126 Assert2(ElTy == SI.getOperand(0)->getType(),
1127 "Stored value type does not match pointer operand type!", &SI, ElTy);
1128 visitInstruction(SI);
1131 void Verifier::visitAllocationInst(AllocationInst &AI) {
1132 const PointerType *PTy = AI.getType();
1133 Assert1(PTy->getAddressSpace() == 0,
1134 "Allocation instruction pointer not in the generic address space!",
1136 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1138 visitInstruction(AI);
1141 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1142 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1143 EVI.idx_begin(), EVI.idx_end()) ==
1145 "Invalid ExtractValueInst operands!", &EVI);
1147 visitInstruction(EVI);
1150 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1151 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1152 IVI.idx_begin(), IVI.idx_end()) ==
1153 IVI.getOperand(1)->getType(),
1154 "Invalid InsertValueInst operands!", &IVI);
1156 visitInstruction(IVI);
1159 /// verifyInstruction - Verify that an instruction is well formed.
1161 void Verifier::visitInstruction(Instruction &I) {
1162 BasicBlock *BB = I.getParent();
1163 Assert1(BB, "Instruction not embedded in basic block!", &I);
1165 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1166 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1168 Assert1(*UI != (User*)&I ||
1169 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1170 "Only PHI nodes may reference their own value!", &I);
1173 // Verify that if this is a terminator that it is at the end of the block.
1174 if (isa<TerminatorInst>(I))
1175 Assert1(BB->getTerminator() == &I, "Terminator not at end of block!", &I);
1178 // Check that void typed values don't have names
1179 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
1180 "Instruction has a name, but provides a void value!", &I);
1182 // Check that the return value of the instruction is either void or a legal
1184 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType()
1185 || ((isa<CallInst>(I) || isa<InvokeInst>(I))
1186 && isa<StructType>(I.getType())),
1187 "Instruction returns a non-scalar type!", &I);
1189 // Check that all uses of the instruction, if they are instructions
1190 // themselves, actually have parent basic blocks. If the use is not an
1191 // instruction, it is an error!
1192 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1194 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
1196 Instruction *Used = cast<Instruction>(*UI);
1197 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1198 " embeded in a basic block!", &I, Used);
1201 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1202 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1204 // Check to make sure that only first-class-values are operands to
1206 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1207 Assert1(0, "Instruction operands must be first-class values!", &I);
1210 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1211 // Check to make sure that the "address of" an intrinsic function is never
1213 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
1214 "Cannot take the address of an intrinsic!", &I);
1215 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1217 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1218 Assert1(OpBB->getParent() == BB->getParent(),
1219 "Referring to a basic block in another function!", &I);
1220 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1221 Assert1(OpArg->getParent() == BB->getParent(),
1222 "Referring to an argument in another function!", &I);
1223 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1224 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1226 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
1227 BasicBlock *OpBlock = Op->getParent();
1229 // Check that a definition dominates all of its uses.
1230 if (!isa<PHINode>(I)) {
1231 // Invoke results are only usable in the normal destination, not in the
1232 // exceptional destination.
1233 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1234 OpBlock = II->getNormalDest();
1236 Assert2(OpBlock != II->getUnwindDest(),
1237 "No uses of invoke possible due to dominance structure!",
1240 // If the normal successor of an invoke instruction has multiple
1241 // predecessors, then the normal edge from the invoke is critical, so
1242 // the invoke value can only be live if the destination block
1243 // dominates all of it's predecessors (other than the invoke) or if
1244 // the invoke value is only used by a phi in the successor.
1245 if (!OpBlock->getSinglePredecessor() &&
1246 DT->dominates(&BB->getParent()->getEntryBlock(), BB)) {
1247 // The first case we allow is if the use is a PHI operand in the
1248 // normal block, and if that PHI operand corresponds to the invoke's
1251 if (PHINode *PN = dyn_cast<PHINode>(&I))
1252 if (PN->getParent() == OpBlock &&
1253 PN->getIncomingBlock(i/2) == Op->getParent())
1256 // If it is used by something non-phi, then the other case is that
1257 // 'OpBlock' dominates all of its predecessors other than the
1258 // invoke. In this case, the invoke value can still be used.
1261 for (pred_iterator PI = pred_begin(OpBlock),
1262 E = pred_end(OpBlock); PI != E; ++PI) {
1263 if (*PI != II->getParent() && !DT->dominates(OpBlock, *PI)) {
1270 "Invoke value defined on critical edge but not dead!", &I,
1273 } else if (OpBlock == BB) {
1274 // If they are in the same basic block, make sure that the definition
1275 // comes before the use.
1276 Assert2(InstsInThisBlock.count(Op) ||
1277 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1278 "Instruction does not dominate all uses!", Op, &I);
1281 // Definition must dominate use unless use is unreachable!
1282 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, &I) ||
1283 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1284 "Instruction does not dominate all uses!", Op, &I);
1286 // PHI nodes are more difficult than other nodes because they actually
1287 // "use" the value in the predecessor basic blocks they correspond to.
1288 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
1289 Assert2(DT->dominates(OpBlock, PredBB) ||
1290 !DT->dominates(&BB->getParent()->getEntryBlock(), PredBB),
1291 "Instruction does not dominate all uses!", Op, &I);
1293 } else if (isa<InlineAsm>(I.getOperand(i))) {
1294 Assert1(i == 0 && (isa<CallInst>(I) || isa<InvokeInst>(I)),
1295 "Cannot take the address of an inline asm!", &I);
1298 InstsInThisBlock.insert(&I);
1301 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1303 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1304 Function *IF = CI.getCalledFunction();
1305 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1308 #define GET_INTRINSIC_VERIFIER
1309 #include "llvm/Intrinsics.gen"
1310 #undef GET_INTRINSIC_VERIFIER
1315 case Intrinsic::memcpy_i32:
1316 case Intrinsic::memcpy_i64:
1317 case Intrinsic::memmove_i32:
1318 case Intrinsic::memmove_i64:
1319 case Intrinsic::memset_i32:
1320 case Intrinsic::memset_i64:
1321 Assert1(isa<ConstantInt>(CI.getOperand(4)),
1322 "alignment argument of memory intrinsics must be a constant int",
1325 case Intrinsic::gcroot:
1326 case Intrinsic::gcwrite:
1327 case Intrinsic::gcread:
1328 if (ID == Intrinsic::gcroot) {
1329 Assert1(isa<AllocaInst>(CI.getOperand(1)->stripPointerCasts()),
1330 "llvm.gcroot parameter #1 must be an alloca.", &CI);
1331 Assert1(isa<Constant>(CI.getOperand(2)),
1332 "llvm.gcroot parameter #2 must be a constant.", &CI);
1335 Assert1(CI.getParent()->getParent()->hasGC(),
1336 "Enclosing function does not use GC.", &CI);
1338 case Intrinsic::init_trampoline:
1339 Assert1(isa<Function>(CI.getOperand(2)->stripPointerCasts()),
1340 "llvm.init_trampoline parameter #2 must resolve to a function.",
1346 /// VerifyIntrinsicPrototype - TableGen emits calls to this function into
1347 /// Intrinsics.gen. This implements a little state machine that verifies the
1348 /// prototype of intrinsics.
1349 void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID,
1351 unsigned Count, ...) {
1353 va_start(VA, Count);
1354 const FunctionType *FTy = F->getFunctionType();
1356 // For overloaded intrinsics, the Suffix of the function name must match the
1357 // types of the arguments. This variable keeps track of the expected
1358 // suffix, to be checked at the end.
1361 if (FTy->getNumParams() + FTy->isVarArg() != Count - 1) {
1362 CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
1366 // Note that "arg#0" is the return type.
1367 for (unsigned ArgNo = 0; ArgNo < Count; ++ArgNo) {
1368 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1370 if (VT == MVT::isVoid && ArgNo > 0) {
1371 if (!FTy->isVarArg())
1372 CheckFailed("Intrinsic prototype has no '...'!", F);
1378 Ty = FTy->getReturnType();
1380 Ty = FTy->getParamType(ArgNo-1);
1382 unsigned NumElts = 0;
1383 const Type *EltTy = Ty;
1384 if (const VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1385 EltTy = VTy->getElementType();
1386 NumElts = VTy->getNumElements();
1392 if (Ty != FTy->getReturnType()) {
1393 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
1394 "match return type.", F);
1398 if (Ty != FTy->getParamType(Match-1)) {
1399 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
1400 "match parameter %" + utostr(Match-1) + ".", F);
1404 } else if (VT == MVT::iAny) {
1405 if (!EltTy->isInteger()) {
1407 CheckFailed("Intrinsic result type is not "
1408 "an integer type.", F);
1410 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
1411 "an integer type.", F);
1414 unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
1417 Suffix += "v" + utostr(NumElts);
1418 Suffix += "i" + utostr(GotBits);;
1419 // Check some constraints on various intrinsics.
1421 default: break; // Not everything needs to be checked.
1422 case Intrinsic::bswap:
1423 if (GotBits < 16 || GotBits % 16 != 0)
1424 CheckFailed("Intrinsic requires even byte width argument", F);
1427 } else if (VT == MVT::fAny) {
1428 if (!EltTy->isFloatingPoint()) {
1430 CheckFailed("Intrinsic result type is not "
1431 "a floating-point type.", F);
1433 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
1434 "a floating-point type.", F);
1439 Suffix += "v" + utostr(NumElts);
1440 Suffix += MVT::getMVT(EltTy).getMVTString();
1441 } else if (VT == MVT::iPTR) {
1442 if (!isa<PointerType>(Ty)) {
1444 CheckFailed("Intrinsic result type is not a "
1445 "pointer and a pointer is required.", F);
1447 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not a "
1448 "pointer and a pointer is required.", F);
1450 } else if (VT == MVT::iPTRAny) {
1451 // Outside of TableGen, we don't distinguish iPTRAny (to any address
1452 // space) and iPTR. In the verifier, we can not distinguish which case
1453 // we have so allow either case to be legal.
1454 if (const PointerType* PTyp = dyn_cast<PointerType>(Ty)) {
1455 Suffix += ".p" + utostr(PTyp->getAddressSpace()) +
1456 MVT::getMVT(PTyp->getElementType()).getMVTString();
1459 CheckFailed("Intrinsic result type is not a "
1460 "pointer and a pointer is required.", F);
1462 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not a "
1463 "pointer and a pointer is required.", F);
1466 } else if (MVT((MVT::SimpleValueType)VT).isVector()) {
1467 MVT VVT = MVT((MVT::SimpleValueType)VT);
1468 // If this is a vector argument, verify the number and type of elements.
1469 if (VVT.getVectorElementType() != MVT::getMVT(EltTy)) {
1470 CheckFailed("Intrinsic prototype has incorrect vector element type!",
1474 if (VVT.getVectorNumElements() != NumElts) {
1475 CheckFailed("Intrinsic prototype has incorrect number of "
1476 "vector elements!",F);
1479 } else if (MVT((MVT::SimpleValueType)VT).getTypeForMVT() != EltTy) {
1481 CheckFailed("Intrinsic prototype has incorrect result type!", F);
1483 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is wrong!",F);
1485 } else if (EltTy != Ty) {
1487 CheckFailed("Intrinsic result type is vector "
1488 "and a scalar is required.", F);
1490 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is vector "
1491 "and a scalar is required.", F);
1497 // For intrinsics without pointer arguments, if we computed a Suffix then the
1498 // intrinsic is overloaded and we need to make sure that the name of the
1499 // function is correct. We add the suffix to the name of the intrinsic and
1500 // compare against the given function name. If they are not the same, the
1501 // function name is invalid. This ensures that overloading of intrinsics
1502 // uses a sane and consistent naming convention. Note that intrinsics with
1503 // pointer argument may or may not be overloaded so we will check assuming it
1504 // has a suffix and not.
1505 if (!Suffix.empty()) {
1506 std::string Name(Intrinsic::getName(ID));
1507 if (Name + Suffix != F->getName()) {
1508 CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
1509 F->getName().substr(Name.length()) + "'. It should be '" +
1514 // Check parameter attributes.
1515 Assert1(F->getParamAttrs() == Intrinsic::getParamAttrs(ID),
1516 "Intrinsic has wrong parameter attributes!", F);
1520 //===----------------------------------------------------------------------===//
1521 // Implement the public interfaces to this file...
1522 //===----------------------------------------------------------------------===//
1524 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1525 return new Verifier(action);
1529 // verifyFunction - Create
1530 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1531 Function &F = const_cast<Function&>(f);
1532 assert(!F.isDeclaration() && "Cannot verify external functions");
1534 ExistingModuleProvider MP(F.getParent());
1535 FunctionPassManager FPM(&MP);
1536 Verifier *V = new Verifier(action);
1543 /// verifyModule - Check a module for errors, printing messages on stderr.
1544 /// Return true if the module is corrupt.
1546 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1547 std::string *ErrorInfo) {
1549 Verifier *V = new Verifier(action);
1551 PM.run(const_cast<Module&>(M));
1553 if (ErrorInfo && V->Broken)
1554 *ErrorInfo = V->msgs.str();