1 //===-- Verifier.cpp - Implement the Module Verifier -------------*- C++ -*-==//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the function verifier interface, that can be used for some
11 // sanity checking of input to the system.
13 // Note that this does not provide full `Java style' security and verifications,
14 // instead it just tries to ensure that code is well-formed.
16 // * Both of a binary operator's parameters are of the same type
17 // * Verify that the indices of mem access instructions match other operands
18 // * Verify that arithmetic and other things are only performed on first-class
19 // types. Verify that shifts & logicals only happen on integrals f.e.
20 // * All of the constants in a switch statement are of the correct type
21 // * The code is in valid SSA form
22 // * It should be illegal to put a label into any other type (like a structure)
23 // or to return one. [except constant arrays!]
24 // * Only phi nodes can be self referential: 'add i32 %0, %0 ; <int>:0' is bad
25 // * PHI nodes must have an entry for each predecessor, with no extras.
26 // * PHI nodes must be the first thing in a basic block, all grouped together
27 // * PHI nodes must have at least one entry
28 // * All basic blocks should only end with terminator insts, not contain them
29 // * The entry node to a function must not have predecessors
30 // * All Instructions must be embedded into a basic block
31 // * Functions cannot take a void-typed parameter
32 // * Verify that a function's argument list agrees with it's declared type.
33 // * It is illegal to specify a name for a void value.
34 // * It is illegal to have a internal global value with no initializer
35 // * It is illegal to have a ret instruction that returns a value that does not
36 // agree with the function return value type.
37 // * Function call argument types match the function prototype
38 // * All other things that are tested by asserts spread about the code...
40 //===----------------------------------------------------------------------===//
42 #include "llvm/Analysis/Verifier.h"
43 #include "llvm/CallingConv.h"
44 #include "llvm/Constants.h"
45 #include "llvm/DerivedTypes.h"
46 #include "llvm/InlineAsm.h"
47 #include "llvm/IntrinsicInst.h"
48 #include "llvm/Metadata.h"
49 #include "llvm/Module.h"
50 #include "llvm/ModuleProvider.h"
51 #include "llvm/Pass.h"
52 #include "llvm/PassManager.h"
53 #include "llvm/TypeSymbolTable.h"
54 #include "llvm/Analysis/Dominators.h"
55 #include "llvm/Assembly/Writer.h"
56 #include "llvm/CodeGen/ValueTypes.h"
57 #include "llvm/Support/CallSite.h"
58 #include "llvm/Support/CFG.h"
59 #include "llvm/Support/InstVisitor.h"
60 #include "llvm/ADT/SetVector.h"
61 #include "llvm/ADT/SmallPtrSet.h"
62 #include "llvm/ADT/SmallVector.h"
63 #include "llvm/ADT/StringExtras.h"
64 #include "llvm/ADT/STLExtras.h"
65 #include "llvm/Support/ErrorHandling.h"
66 #include "llvm/Support/raw_ostream.h"
71 namespace { // Anonymous namespace for class
72 struct PreVerifier : public FunctionPass {
73 static char ID; // Pass ID, replacement for typeid
75 PreVerifier() : FunctionPass(&ID) { }
77 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
81 // Check that the prerequisites for successful DominatorTree construction
83 bool runOnFunction(Function &F) {
86 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
87 if (I->empty() || !I->back().isTerminator()) {
88 errs() << "Basic Block does not have terminator!\n";
89 WriteAsOperand(errs(), I, true);
96 llvm_report_error("Broken module, no Basic Block terminator!");
103 char PreVerifier::ID = 0;
104 static RegisterPass<PreVerifier>
105 PreVer("preverify", "Preliminary module verification");
106 static const PassInfo *const PreVerifyID = &PreVer;
109 class TypeSet : public AbstractTypeUser {
113 /// Insert a type into the set of types.
114 bool insert(const Type *Ty) {
115 if (!Types.insert(Ty))
117 if (Ty->isAbstract())
118 Ty->addAbstractTypeUser(this);
122 // Remove ourselves as abstract type listeners for any types that remain
123 // abstract when the TypeSet is destroyed.
125 for (SmallSetVector<const Type *, 16>::iterator I = Types.begin(),
126 E = Types.end(); I != E; ++I) {
128 if (Ty->isAbstract())
129 Ty->removeAbstractTypeUser(this);
133 // Abstract type user interface.
135 /// Remove types from the set when refined. Do not insert the type it was
136 /// refined to because that type hasn't been verified yet.
137 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
139 OldTy->removeAbstractTypeUser(this);
142 /// Stop listening for changes to a type which is no longer abstract.
143 void typeBecameConcrete(const DerivedType *AbsTy) {
144 AbsTy->removeAbstractTypeUser(this);
150 SmallSetVector<const Type *, 16> Types;
153 TypeSet(const TypeSet &);
154 TypeSet &operator=(const TypeSet &);
157 struct Verifier : public FunctionPass, public InstVisitor<Verifier> {
158 static char ID; // Pass ID, replacement for typeid
159 bool Broken; // Is this module found to be broken?
160 bool RealPass; // Are we not being run by a PassManager?
161 VerifierFailureAction action;
162 // What to do if verification fails.
163 Module *Mod; // Module we are verifying right now
164 DominatorTree *DT; // Dominator Tree, caution can be null!
166 std::string Messages;
167 raw_string_ostream MessagesStr;
169 /// InstInThisBlock - when verifying a basic block, keep track of all of the
170 /// instructions we have seen so far. This allows us to do efficient
171 /// dominance checks for the case when an instruction has an operand that is
172 /// an instruction in the same block.
173 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
175 /// Types - keep track of the types that have been checked already.
180 Broken(false), RealPass(true), action(AbortProcessAction),
181 DT(0), MessagesStr(Messages) {}
182 explicit Verifier(VerifierFailureAction ctn)
184 Broken(false), RealPass(true), action(ctn), DT(0),
185 MessagesStr(Messages) {}
186 explicit Verifier(bool AB)
188 Broken(false), RealPass(true),
189 action( AB ? AbortProcessAction : PrintMessageAction), DT(0),
190 MessagesStr(Messages) {}
191 explicit Verifier(DominatorTree &dt)
193 Broken(false), RealPass(false), action(PrintMessageAction),
194 DT(&dt), MessagesStr(Messages) {}
197 bool doInitialization(Module &M) {
199 verifyTypeSymbolTable(M.getTypeSymbolTable());
201 // If this is a real pass, in a pass manager, we must abort before
202 // returning back to the pass manager, or else the pass manager may try to
203 // run other passes on the broken module.
205 return abortIfBroken();
209 bool runOnFunction(Function &F) {
210 // Get dominator information if we are being run by PassManager
211 if (RealPass) DT = &getAnalysis<DominatorTree>();
216 InstsInThisBlock.clear();
218 // If this is a real pass, in a pass manager, we must abort before
219 // returning back to the pass manager, or else the pass manager may try to
220 // run other passes on the broken module.
222 return abortIfBroken();
227 bool doFinalization(Module &M) {
228 // Scan through, checking all of the external function's linkage now...
229 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
230 visitGlobalValue(*I);
232 // Check to make sure function prototypes are okay.
233 if (I->isDeclaration()) visitFunction(*I);
236 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
238 visitGlobalVariable(*I);
240 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
242 visitGlobalAlias(*I);
244 // If the module is broken, abort at this time.
245 return abortIfBroken();
248 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
249 AU.setPreservesAll();
250 AU.addRequiredID(PreVerifyID);
252 AU.addRequired<DominatorTree>();
255 /// abortIfBroken - If the module is broken and we are supposed to abort on
256 /// this condition, do so.
258 bool abortIfBroken() {
259 if (!Broken) return false;
260 MessagesStr << "Broken module found, ";
262 default: llvm_unreachable("Unknown action");
263 case AbortProcessAction:
264 MessagesStr << "compilation aborted!\n";
265 errs() << MessagesStr.str();
266 // Client should choose different reaction if abort is not desired
268 case PrintMessageAction:
269 MessagesStr << "verification continues.\n";
270 errs() << MessagesStr.str();
272 case ReturnStatusAction:
273 MessagesStr << "compilation terminated.\n";
279 // Verification methods...
280 void verifyTypeSymbolTable(TypeSymbolTable &ST);
281 void visitGlobalValue(GlobalValue &GV);
282 void visitGlobalVariable(GlobalVariable &GV);
283 void visitGlobalAlias(GlobalAlias &GA);
284 void visitFunction(Function &F);
285 void visitBasicBlock(BasicBlock &BB);
286 using InstVisitor<Verifier>::visit;
288 void visit(Instruction &I);
290 void visitTruncInst(TruncInst &I);
291 void visitZExtInst(ZExtInst &I);
292 void visitSExtInst(SExtInst &I);
293 void visitFPTruncInst(FPTruncInst &I);
294 void visitFPExtInst(FPExtInst &I);
295 void visitFPToUIInst(FPToUIInst &I);
296 void visitFPToSIInst(FPToSIInst &I);
297 void visitUIToFPInst(UIToFPInst &I);
298 void visitSIToFPInst(SIToFPInst &I);
299 void visitIntToPtrInst(IntToPtrInst &I);
300 void visitPtrToIntInst(PtrToIntInst &I);
301 void visitBitCastInst(BitCastInst &I);
302 void visitPHINode(PHINode &PN);
303 void visitBinaryOperator(BinaryOperator &B);
304 void visitICmpInst(ICmpInst &IC);
305 void visitFCmpInst(FCmpInst &FC);
306 void visitExtractElementInst(ExtractElementInst &EI);
307 void visitInsertElementInst(InsertElementInst &EI);
308 void visitShuffleVectorInst(ShuffleVectorInst &EI);
309 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
310 void visitCallInst(CallInst &CI);
311 void visitInvokeInst(InvokeInst &II);
312 void visitGetElementPtrInst(GetElementPtrInst &GEP);
313 void visitLoadInst(LoadInst &LI);
314 void visitStoreInst(StoreInst &SI);
315 void visitInstruction(Instruction &I);
316 void visitTerminatorInst(TerminatorInst &I);
317 void visitReturnInst(ReturnInst &RI);
318 void visitSwitchInst(SwitchInst &SI);
319 void visitSelectInst(SelectInst &SI);
320 void visitUserOp1(Instruction &I);
321 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
322 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
323 void visitAllocaInst(AllocaInst &AI);
324 void visitExtractValueInst(ExtractValueInst &EVI);
325 void visitInsertValueInst(InsertValueInst &IVI);
327 void VerifyCallSite(CallSite CS);
328 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
329 int VT, unsigned ArgNo, std::string &Suffix);
330 void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
331 unsigned RetNum, unsigned ParamNum, ...);
332 void VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
333 bool isReturnValue, const Value *V);
334 void VerifyFunctionAttrs(const FunctionType *FT, const AttrListPtr &Attrs,
336 void VerifyType(const Type *Ty);
338 void WriteValue(const Value *V) {
340 if (isa<Instruction>(V)) {
341 MessagesStr << *V << '\n';
343 WriteAsOperand(MessagesStr, V, true, Mod);
348 void WriteType(const Type *T) {
351 WriteTypeSymbolic(MessagesStr, T, Mod);
355 // CheckFailed - A check failed, so print out the condition and the message
356 // that failed. This provides a nice place to put a breakpoint if you want
357 // to see why something is not correct.
358 void CheckFailed(const Twine &Message,
359 const Value *V1 = 0, const Value *V2 = 0,
360 const Value *V3 = 0, const Value *V4 = 0) {
361 MessagesStr << Message.str() << "\n";
369 void CheckFailed(const Twine &Message, const Value *V1,
370 const Type *T2, const Value *V3 = 0) {
371 MessagesStr << Message.str() << "\n";
378 void CheckFailed(const Twine &Message, const Type *T1,
379 const Type *T2 = 0, const Type *T3 = 0) {
380 MessagesStr << Message.str() << "\n";
387 } // End anonymous namespace
389 char Verifier::ID = 0;
390 static RegisterPass<Verifier> X("verify", "Module Verifier");
392 // Assert - We know that cond should be true, if not print an error message.
393 #define Assert(C, M) \
394 do { if (!(C)) { CheckFailed(M); return; } } while (0)
395 #define Assert1(C, M, V1) \
396 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
397 #define Assert2(C, M, V1, V2) \
398 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
399 #define Assert3(C, M, V1, V2, V3) \
400 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
401 #define Assert4(C, M, V1, V2, V3, V4) \
402 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
404 void Verifier::visit(Instruction &I) {
405 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
406 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
407 InstVisitor<Verifier>::visit(I);
411 void Verifier::visitGlobalValue(GlobalValue &GV) {
412 Assert1(!GV.isDeclaration() ||
413 GV.hasExternalLinkage() ||
414 GV.hasDLLImportLinkage() ||
415 GV.hasExternalWeakLinkage() ||
416 GV.hasGhostLinkage() ||
417 (isa<GlobalAlias>(GV) &&
418 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
419 "Global is external, but doesn't have external or dllimport or weak linkage!",
422 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
423 "Global is marked as dllimport, but not external", &GV);
425 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
426 "Only global variables can have appending linkage!", &GV);
428 if (GV.hasAppendingLinkage()) {
429 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
430 Assert1(GVar && isa<ArrayType>(GVar->getType()->getElementType()),
431 "Only global arrays can have appending linkage!", GVar);
435 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
436 if (GV.hasInitializer()) {
437 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
438 "Global variable initializer type does not match global "
439 "variable type!", &GV);
441 // If the global has common linkage, it must have a zero initializer and
442 // cannot be constant.
443 if (GV.hasCommonLinkage()) {
444 Assert1(GV.getInitializer()->isNullValue(),
445 "'common' global must have a zero initializer!", &GV);
446 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
450 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
451 GV.hasExternalWeakLinkage(),
452 "invalid linkage type for global declaration", &GV);
455 visitGlobalValue(GV);
458 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
459 Assert1(!GA.getName().empty(),
460 "Alias name cannot be empty!", &GA);
461 Assert1(GA.hasExternalLinkage() || GA.hasLocalLinkage() ||
463 "Alias should have external or external weak linkage!", &GA);
464 Assert1(GA.getAliasee(),
465 "Aliasee cannot be NULL!", &GA);
466 Assert1(GA.getType() == GA.getAliasee()->getType(),
467 "Alias and aliasee types should match!", &GA);
469 if (!isa<GlobalValue>(GA.getAliasee())) {
470 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
472 (CE->getOpcode() == Instruction::BitCast ||
473 CE->getOpcode() == Instruction::GetElementPtr) &&
474 isa<GlobalValue>(CE->getOperand(0)),
475 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
479 const GlobalValue* Aliasee = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
481 "Aliasing chain should end with function or global variable", &GA);
483 visitGlobalValue(GA);
486 void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
487 for (TypeSymbolTable::iterator I = ST.begin(), E = ST.end(); I != E; ++I)
488 VerifyType(I->second);
491 // VerifyParameterAttrs - Check the given attributes for an argument or return
492 // value of the specified type. The value V is printed in error messages.
493 void Verifier::VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
494 bool isReturnValue, const Value *V) {
495 if (Attrs == Attribute::None)
498 Attributes FnCheckAttr = Attrs & Attribute::FunctionOnly;
499 Assert1(!FnCheckAttr, "Attribute " + Attribute::getAsString(FnCheckAttr) +
500 " only applies to the function!", V);
503 Attributes RetI = Attrs & Attribute::ParameterOnly;
504 Assert1(!RetI, "Attribute " + Attribute::getAsString(RetI) +
505 " does not apply to return values!", V);
509 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
510 Attributes MutI = Attrs & Attribute::MutuallyIncompatible[i];
511 Assert1(!(MutI & (MutI - 1)), "Attributes " +
512 Attribute::getAsString(MutI) + " are incompatible!", V);
515 Attributes TypeI = Attrs & Attribute::typeIncompatible(Ty);
516 Assert1(!TypeI, "Wrong type for attribute " +
517 Attribute::getAsString(TypeI), V);
519 Attributes ByValI = Attrs & Attribute::ByVal;
520 if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
521 Assert1(!ByValI || PTy->getElementType()->isSized(),
522 "Attribute " + Attribute::getAsString(ByValI) +
523 " does not support unsized types!", V);
526 "Attribute " + Attribute::getAsString(ByValI) +
527 " only applies to parameters with pointer type!", V);
531 // VerifyFunctionAttrs - Check parameter attributes against a function type.
532 // The value V is printed in error messages.
533 void Verifier::VerifyFunctionAttrs(const FunctionType *FT,
534 const AttrListPtr &Attrs,
539 bool SawNest = false;
541 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
542 const AttributeWithIndex &Attr = Attrs.getSlot(i);
546 Ty = FT->getReturnType();
547 else if (Attr.Index-1 < FT->getNumParams())
548 Ty = FT->getParamType(Attr.Index-1);
550 break; // VarArgs attributes, verified elsewhere.
552 VerifyParameterAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
554 if (Attr.Attrs & Attribute::Nest) {
555 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
559 if (Attr.Attrs & Attribute::StructRet)
560 Assert1(Attr.Index == 1, "Attribute sret not on first parameter!", V);
563 Attributes FAttrs = Attrs.getFnAttributes();
564 Attributes NotFn = FAttrs & (~Attribute::FunctionOnly);
565 Assert1(!NotFn, "Attribute " + Attribute::getAsString(NotFn) +
566 " does not apply to the function!", V);
569 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
570 Attributes MutI = FAttrs & Attribute::MutuallyIncompatible[i];
571 Assert1(!(MutI & (MutI - 1)), "Attributes " +
572 Attribute::getAsString(MutI) + " are incompatible!", V);
576 static bool VerifyAttributeCount(const AttrListPtr &Attrs, unsigned Params) {
580 unsigned LastSlot = Attrs.getNumSlots() - 1;
581 unsigned LastIndex = Attrs.getSlot(LastSlot).Index;
582 if (LastIndex <= Params
583 || (LastIndex == (unsigned)~0
584 && (LastSlot == 0 || Attrs.getSlot(LastSlot - 1).Index <= Params)))
590 // visitFunction - Verify that a function is ok.
592 void Verifier::visitFunction(Function &F) {
593 // Check function arguments.
594 const FunctionType *FT = F.getFunctionType();
595 unsigned NumArgs = F.arg_size();
597 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
598 Assert2(FT->getNumParams() == NumArgs,
599 "# formal arguments must match # of arguments for function type!",
601 Assert1(F.getReturnType()->isFirstClassType() ||
602 F.getReturnType()->isVoidTy() ||
603 isa<StructType>(F.getReturnType()),
604 "Functions cannot return aggregate values!", &F);
606 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
607 "Invalid struct return type!", &F);
609 const AttrListPtr &Attrs = F.getAttributes();
611 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
612 "Attributes after last parameter!", &F);
614 // Check function attributes.
615 VerifyFunctionAttrs(FT, Attrs, &F);
617 // Check that this function meets the restrictions on this calling convention.
618 switch (F.getCallingConv()) {
623 case CallingConv::Fast:
624 case CallingConv::Cold:
625 case CallingConv::X86_FastCall:
626 Assert1(!F.isVarArg(),
627 "Varargs functions must have C calling conventions!", &F);
631 bool isLLVMdotName = F.getName().size() >= 5 &&
632 F.getName().substr(0, 5) == "llvm.";
634 // Check that the argument values match the function type for this function...
636 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
638 Assert2(I->getType() == FT->getParamType(i),
639 "Argument value does not match function argument type!",
640 I, FT->getParamType(i));
641 Assert1(I->getType()->isFirstClassType(),
642 "Function arguments must have first-class types!", I);
644 Assert2(!I->getType()->isMetadataTy(),
645 "Function takes metadata but isn't an intrinsic", I, &F);
648 if (F.isDeclaration()) {
649 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
650 F.hasExternalWeakLinkage() || F.hasGhostLinkage(),
651 "invalid linkage type for function declaration", &F);
653 // Verify that this function (which has a body) is not named "llvm.*". It
654 // is not legal to define intrinsics.
655 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
657 // Check the entry node
658 BasicBlock *Entry = &F.getEntryBlock();
659 Assert1(pred_begin(Entry) == pred_end(Entry),
660 "Entry block to function must not have predecessors!", Entry);
663 // If this function is actually an intrinsic, verify that it is only used in
664 // direct call/invokes, never having its "address taken".
665 if (F.getIntrinsicID()) {
666 for (Value::use_iterator UI = F.use_begin(), E = F.use_end(); UI != E;++UI){
667 User *U = cast<User>(UI);
668 if ((isa<CallInst>(U) || isa<InvokeInst>(U)) && UI.getOperandNo() == 0)
669 continue; // Direct calls/invokes are ok.
671 Assert1(0, "Invalid user of intrinsic instruction!", U);
676 // verifyBasicBlock - Verify that a basic block is well formed...
678 void Verifier::visitBasicBlock(BasicBlock &BB) {
679 InstsInThisBlock.clear();
681 // Ensure that basic blocks have terminators!
682 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
684 // Check constraints that this basic block imposes on all of the PHI nodes in
686 if (isa<PHINode>(BB.front())) {
687 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
688 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
689 std::sort(Preds.begin(), Preds.end());
691 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
692 // Ensure that PHI nodes have at least one entry!
693 Assert1(PN->getNumIncomingValues() != 0,
694 "PHI nodes must have at least one entry. If the block is dead, "
695 "the PHI should be removed!", PN);
696 Assert1(PN->getNumIncomingValues() == Preds.size(),
697 "PHINode should have one entry for each predecessor of its "
698 "parent basic block!", PN);
700 // Get and sort all incoming values in the PHI node...
702 Values.reserve(PN->getNumIncomingValues());
703 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
704 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
705 PN->getIncomingValue(i)));
706 std::sort(Values.begin(), Values.end());
708 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
709 // Check to make sure that if there is more than one entry for a
710 // particular basic block in this PHI node, that the incoming values are
713 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
714 Values[i].second == Values[i-1].second,
715 "PHI node has multiple entries for the same basic block with "
716 "different incoming values!", PN, Values[i].first,
717 Values[i].second, Values[i-1].second);
719 // Check to make sure that the predecessors and PHI node entries are
721 Assert3(Values[i].first == Preds[i],
722 "PHI node entries do not match predecessors!", PN,
723 Values[i].first, Preds[i]);
729 void Verifier::visitTerminatorInst(TerminatorInst &I) {
730 // Ensure that terminators only exist at the end of the basic block.
731 Assert1(&I == I.getParent()->getTerminator(),
732 "Terminator found in the middle of a basic block!", I.getParent());
736 void Verifier::visitReturnInst(ReturnInst &RI) {
737 Function *F = RI.getParent()->getParent();
738 unsigned N = RI.getNumOperands();
739 if (F->getReturnType()->isVoidTy())
741 "Found return instr that returns non-void in Function of void "
742 "return type!", &RI, F->getReturnType());
743 else if (N == 1 && F->getReturnType() == RI.getOperand(0)->getType()) {
744 // Exactly one return value and it matches the return type. Good.
745 } else if (const StructType *STy = dyn_cast<StructType>(F->getReturnType())) {
746 // The return type is a struct; check for multiple return values.
747 Assert2(STy->getNumElements() == N,
748 "Incorrect number of return values in ret instruction!",
749 &RI, F->getReturnType());
750 for (unsigned i = 0; i != N; ++i)
751 Assert2(STy->getElementType(i) == RI.getOperand(i)->getType(),
752 "Function return type does not match operand "
753 "type of return inst!", &RI, F->getReturnType());
754 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(F->getReturnType())) {
755 // The return type is an array; check for multiple return values.
756 Assert2(ATy->getNumElements() == N,
757 "Incorrect number of return values in ret instruction!",
758 &RI, F->getReturnType());
759 for (unsigned i = 0; i != N; ++i)
760 Assert2(ATy->getElementType() == RI.getOperand(i)->getType(),
761 "Function return type does not match operand "
762 "type of return inst!", &RI, F->getReturnType());
764 CheckFailed("Function return type does not match operand "
765 "type of return inst!", &RI, F->getReturnType());
768 // Check to make sure that the return value has necessary properties for
770 visitTerminatorInst(RI);
773 void Verifier::visitSwitchInst(SwitchInst &SI) {
774 // Check to make sure that all of the constants in the switch instruction
775 // have the same type as the switched-on value.
776 const Type *SwitchTy = SI.getCondition()->getType();
777 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
778 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
779 "Switch constants must all be same type as switch value!", &SI);
781 visitTerminatorInst(SI);
784 void Verifier::visitSelectInst(SelectInst &SI) {
785 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
787 "Invalid operands for select instruction!", &SI);
789 Assert1(SI.getTrueValue()->getType() == SI.getType(),
790 "Select values must have same type as select instruction!", &SI);
791 visitInstruction(SI);
794 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
795 /// a pass, if any exist, it's an error.
797 void Verifier::visitUserOp1(Instruction &I) {
798 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
801 void Verifier::visitTruncInst(TruncInst &I) {
802 // Get the source and destination types
803 const Type *SrcTy = I.getOperand(0)->getType();
804 const Type *DestTy = I.getType();
806 // Get the size of the types in bits, we'll need this later
807 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
808 unsigned DestBitSize = DestTy->getScalarSizeInBits();
810 Assert1(SrcTy->isIntOrIntVector(), "Trunc only operates on integer", &I);
811 Assert1(DestTy->isIntOrIntVector(), "Trunc only produces integer", &I);
812 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
813 "trunc source and destination must both be a vector or neither", &I);
814 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
819 void Verifier::visitZExtInst(ZExtInst &I) {
820 // Get the source and destination types
821 const Type *SrcTy = I.getOperand(0)->getType();
822 const Type *DestTy = I.getType();
824 // Get the size of the types in bits, we'll need this later
825 Assert1(SrcTy->isIntOrIntVector(), "ZExt only operates on integer", &I);
826 Assert1(DestTy->isIntOrIntVector(), "ZExt only produces an integer", &I);
827 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
828 "zext source and destination must both be a vector or neither", &I);
829 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
830 unsigned DestBitSize = DestTy->getScalarSizeInBits();
832 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
837 void Verifier::visitSExtInst(SExtInst &I) {
838 // Get the source and destination types
839 const Type *SrcTy = I.getOperand(0)->getType();
840 const Type *DestTy = I.getType();
842 // Get the size of the types in bits, we'll need this later
843 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
844 unsigned DestBitSize = DestTy->getScalarSizeInBits();
846 Assert1(SrcTy->isIntOrIntVector(), "SExt only operates on integer", &I);
847 Assert1(DestTy->isIntOrIntVector(), "SExt only produces an integer", &I);
848 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
849 "sext source and destination must both be a vector or neither", &I);
850 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
855 void Verifier::visitFPTruncInst(FPTruncInst &I) {
856 // Get the source and destination types
857 const Type *SrcTy = I.getOperand(0)->getType();
858 const Type *DestTy = I.getType();
859 // Get the size of the types in bits, we'll need this later
860 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
861 unsigned DestBitSize = DestTy->getScalarSizeInBits();
863 Assert1(SrcTy->isFPOrFPVector(),"FPTrunc only operates on FP", &I);
864 Assert1(DestTy->isFPOrFPVector(),"FPTrunc only produces an FP", &I);
865 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
866 "fptrunc source and destination must both be a vector or neither",&I);
867 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
872 void Verifier::visitFPExtInst(FPExtInst &I) {
873 // Get the source and destination types
874 const Type *SrcTy = I.getOperand(0)->getType();
875 const Type *DestTy = I.getType();
877 // Get the size of the types in bits, we'll need this later
878 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
879 unsigned DestBitSize = DestTy->getScalarSizeInBits();
881 Assert1(SrcTy->isFPOrFPVector(),"FPExt only operates on FP", &I);
882 Assert1(DestTy->isFPOrFPVector(),"FPExt only produces an FP", &I);
883 Assert1(isa<VectorType>(SrcTy) == isa<VectorType>(DestTy),
884 "fpext source and destination must both be a vector or neither", &I);
885 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
890 void Verifier::visitUIToFPInst(UIToFPInst &I) {
891 // Get the source and destination types
892 const Type *SrcTy = I.getOperand(0)->getType();
893 const Type *DestTy = I.getType();
895 bool SrcVec = isa<VectorType>(SrcTy);
896 bool DstVec = isa<VectorType>(DestTy);
898 Assert1(SrcVec == DstVec,
899 "UIToFP source and dest must both be vector or scalar", &I);
900 Assert1(SrcTy->isIntOrIntVector(),
901 "UIToFP source must be integer or integer vector", &I);
902 Assert1(DestTy->isFPOrFPVector(),
903 "UIToFP result must be FP or FP vector", &I);
905 if (SrcVec && DstVec)
906 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
907 cast<VectorType>(DestTy)->getNumElements(),
908 "UIToFP source and dest vector length mismatch", &I);
913 void Verifier::visitSIToFPInst(SIToFPInst &I) {
914 // Get the source and destination types
915 const Type *SrcTy = I.getOperand(0)->getType();
916 const Type *DestTy = I.getType();
918 bool SrcVec = isa<VectorType>(SrcTy);
919 bool DstVec = isa<VectorType>(DestTy);
921 Assert1(SrcVec == DstVec,
922 "SIToFP source and dest must both be vector or scalar", &I);
923 Assert1(SrcTy->isIntOrIntVector(),
924 "SIToFP source must be integer or integer vector", &I);
925 Assert1(DestTy->isFPOrFPVector(),
926 "SIToFP result must be FP or FP vector", &I);
928 if (SrcVec && DstVec)
929 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
930 cast<VectorType>(DestTy)->getNumElements(),
931 "SIToFP source and dest vector length mismatch", &I);
936 void Verifier::visitFPToUIInst(FPToUIInst &I) {
937 // Get the source and destination types
938 const Type *SrcTy = I.getOperand(0)->getType();
939 const Type *DestTy = I.getType();
941 bool SrcVec = isa<VectorType>(SrcTy);
942 bool DstVec = isa<VectorType>(DestTy);
944 Assert1(SrcVec == DstVec,
945 "FPToUI source and dest must both be vector or scalar", &I);
946 Assert1(SrcTy->isFPOrFPVector(), "FPToUI source must be FP or FP vector", &I);
947 Assert1(DestTy->isIntOrIntVector(),
948 "FPToUI result must be integer or integer vector", &I);
950 if (SrcVec && DstVec)
951 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
952 cast<VectorType>(DestTy)->getNumElements(),
953 "FPToUI source and dest vector length mismatch", &I);
958 void Verifier::visitFPToSIInst(FPToSIInst &I) {
959 // Get the source and destination types
960 const Type *SrcTy = I.getOperand(0)->getType();
961 const Type *DestTy = I.getType();
963 bool SrcVec = isa<VectorType>(SrcTy);
964 bool DstVec = isa<VectorType>(DestTy);
966 Assert1(SrcVec == DstVec,
967 "FPToSI source and dest must both be vector or scalar", &I);
968 Assert1(SrcTy->isFPOrFPVector(),
969 "FPToSI source must be FP or FP vector", &I);
970 Assert1(DestTy->isIntOrIntVector(),
971 "FPToSI result must be integer or integer vector", &I);
973 if (SrcVec && DstVec)
974 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
975 cast<VectorType>(DestTy)->getNumElements(),
976 "FPToSI source and dest vector length mismatch", &I);
981 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
982 // Get the source and destination types
983 const Type *SrcTy = I.getOperand(0)->getType();
984 const Type *DestTy = I.getType();
986 Assert1(isa<PointerType>(SrcTy), "PtrToInt source must be pointer", &I);
987 Assert1(DestTy->isInteger(), "PtrToInt result must be integral", &I);
992 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
993 // Get the source and destination types
994 const Type *SrcTy = I.getOperand(0)->getType();
995 const Type *DestTy = I.getType();
997 Assert1(SrcTy->isInteger(), "IntToPtr source must be an integral", &I);
998 Assert1(isa<PointerType>(DestTy), "IntToPtr result must be a pointer",&I);
1000 visitInstruction(I);
1003 void Verifier::visitBitCastInst(BitCastInst &I) {
1004 // Get the source and destination types
1005 const Type *SrcTy = I.getOperand(0)->getType();
1006 const Type *DestTy = I.getType();
1008 // Get the size of the types in bits, we'll need this later
1009 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1010 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
1012 // BitCast implies a no-op cast of type only. No bits change.
1013 // However, you can't cast pointers to anything but pointers.
1014 Assert1(isa<PointerType>(DestTy) == isa<PointerType>(DestTy),
1015 "Bitcast requires both operands to be pointer or neither", &I);
1016 Assert1(SrcBitSize == DestBitSize, "Bitcast requires types of same width",&I);
1018 // Disallow aggregates.
1019 Assert1(!SrcTy->isAggregateType(),
1020 "Bitcast operand must not be aggregate", &I);
1021 Assert1(!DestTy->isAggregateType(),
1022 "Bitcast type must not be aggregate", &I);
1024 visitInstruction(I);
1027 /// visitPHINode - Ensure that a PHI node is well formed.
1029 void Verifier::visitPHINode(PHINode &PN) {
1030 // Ensure that the PHI nodes are all grouped together at the top of the block.
1031 // This can be tested by checking whether the instruction before this is
1032 // either nonexistent (because this is begin()) or is a PHI node. If not,
1033 // then there is some other instruction before a PHI.
1034 Assert2(&PN == &PN.getParent()->front() ||
1035 isa<PHINode>(--BasicBlock::iterator(&PN)),
1036 "PHI nodes not grouped at top of basic block!",
1037 &PN, PN.getParent());
1039 // Check that all of the values of the PHI node have the same type as the
1040 // result, and that the incoming blocks are really basic blocks.
1041 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1042 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1043 "PHI node operands are not the same type as the result!", &PN);
1044 Assert1(isa<BasicBlock>(PN.getOperand(
1045 PHINode::getOperandNumForIncomingBlock(i))),
1046 "PHI node incoming block is not a BasicBlock!", &PN);
1049 // All other PHI node constraints are checked in the visitBasicBlock method.
1051 visitInstruction(PN);
1054 void Verifier::VerifyCallSite(CallSite CS) {
1055 Instruction *I = CS.getInstruction();
1057 Assert1(isa<PointerType>(CS.getCalledValue()->getType()),
1058 "Called function must be a pointer!", I);
1059 const PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1061 Assert1(isa<FunctionType>(FPTy->getElementType()),
1062 "Called function is not pointer to function type!", I);
1063 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1065 // Verify that the correct number of arguments are being passed
1066 if (FTy->isVarArg())
1067 Assert1(CS.arg_size() >= FTy->getNumParams(),
1068 "Called function requires more parameters than were provided!",I);
1070 Assert1(CS.arg_size() == FTy->getNumParams(),
1071 "Incorrect number of arguments passed to called function!", I);
1073 // Verify that all arguments to the call match the function type...
1074 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1075 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1076 "Call parameter type does not match function signature!",
1077 CS.getArgument(i), FTy->getParamType(i), I);
1079 const AttrListPtr &Attrs = CS.getAttributes();
1081 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1082 "Attributes after last parameter!", I);
1084 // Verify call attributes.
1085 VerifyFunctionAttrs(FTy, Attrs, I);
1087 if (FTy->isVarArg())
1088 // Check attributes on the varargs part.
1089 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1090 Attributes Attr = Attrs.getParamAttributes(Idx);
1092 VerifyParameterAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
1094 Attributes VArgI = Attr & Attribute::VarArgsIncompatible;
1095 Assert1(!VArgI, "Attribute " + Attribute::getAsString(VArgI) +
1096 " cannot be used for vararg call arguments!", I);
1099 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1100 if (!CS.getCalledFunction() || CS.getCalledFunction()->getName().size() < 5 ||
1101 CS.getCalledFunction()->getName().substr(0, 5) != "llvm.") {
1102 for (FunctionType::param_iterator PI = FTy->param_begin(),
1103 PE = FTy->param_end(); PI != PE; ++PI)
1104 Assert1(!PI->get()->isMetadataTy(),
1105 "Function has metadata parameter but isn't an intrinsic", I);
1108 visitInstruction(*I);
1111 void Verifier::visitCallInst(CallInst &CI) {
1112 VerifyCallSite(&CI);
1114 if (Function *F = CI.getCalledFunction())
1115 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1116 visitIntrinsicFunctionCall(ID, CI);
1119 void Verifier::visitInvokeInst(InvokeInst &II) {
1120 VerifyCallSite(&II);
1123 /// visitBinaryOperator - Check that both arguments to the binary operator are
1124 /// of the same type!
1126 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1127 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1128 "Both operands to a binary operator are not of the same type!", &B);
1130 switch (B.getOpcode()) {
1131 // Check that integer arithmetic operators are only used with
1132 // integral operands.
1133 case Instruction::Add:
1134 case Instruction::Sub:
1135 case Instruction::Mul:
1136 case Instruction::SDiv:
1137 case Instruction::UDiv:
1138 case Instruction::SRem:
1139 case Instruction::URem:
1140 Assert1(B.getType()->isIntOrIntVector(),
1141 "Integer arithmetic operators only work with integral types!", &B);
1142 Assert1(B.getType() == B.getOperand(0)->getType(),
1143 "Integer arithmetic operators must have same type "
1144 "for operands and result!", &B);
1146 // Check that floating-point arithmetic operators are only used with
1147 // floating-point operands.
1148 case Instruction::FAdd:
1149 case Instruction::FSub:
1150 case Instruction::FMul:
1151 case Instruction::FDiv:
1152 case Instruction::FRem:
1153 Assert1(B.getType()->isFPOrFPVector(),
1154 "Floating-point arithmetic operators only work with "
1155 "floating-point types!", &B);
1156 Assert1(B.getType() == B.getOperand(0)->getType(),
1157 "Floating-point arithmetic operators must have same type "
1158 "for operands and result!", &B);
1160 // Check that logical operators are only used with integral operands.
1161 case Instruction::And:
1162 case Instruction::Or:
1163 case Instruction::Xor:
1164 Assert1(B.getType()->isIntOrIntVector(),
1165 "Logical operators only work with integral types!", &B);
1166 Assert1(B.getType() == B.getOperand(0)->getType(),
1167 "Logical operators must have same type for operands and result!",
1170 case Instruction::Shl:
1171 case Instruction::LShr:
1172 case Instruction::AShr:
1173 Assert1(B.getType()->isIntOrIntVector(),
1174 "Shifts only work with integral types!", &B);
1175 Assert1(B.getType() == B.getOperand(0)->getType(),
1176 "Shift return type must be same as operands!", &B);
1179 llvm_unreachable("Unknown BinaryOperator opcode!");
1182 visitInstruction(B);
1185 void Verifier::visitICmpInst(ICmpInst& IC) {
1186 // Check that the operands are the same type
1187 const Type* Op0Ty = IC.getOperand(0)->getType();
1188 const Type* Op1Ty = IC.getOperand(1)->getType();
1189 Assert1(Op0Ty == Op1Ty,
1190 "Both operands to ICmp instruction are not of the same type!", &IC);
1191 // Check that the operands are the right type
1192 Assert1(Op0Ty->isIntOrIntVector() || isa<PointerType>(Op0Ty),
1193 "Invalid operand types for ICmp instruction", &IC);
1195 visitInstruction(IC);
1198 void Verifier::visitFCmpInst(FCmpInst& FC) {
1199 // Check that the operands are the same type
1200 const Type* Op0Ty = FC.getOperand(0)->getType();
1201 const Type* Op1Ty = FC.getOperand(1)->getType();
1202 Assert1(Op0Ty == Op1Ty,
1203 "Both operands to FCmp instruction are not of the same type!", &FC);
1204 // Check that the operands are the right type
1205 Assert1(Op0Ty->isFPOrFPVector(),
1206 "Invalid operand types for FCmp instruction", &FC);
1207 visitInstruction(FC);
1210 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1211 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1213 "Invalid extractelement operands!", &EI);
1214 visitInstruction(EI);
1217 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1218 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1221 "Invalid insertelement operands!", &IE);
1222 visitInstruction(IE);
1225 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1226 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1228 "Invalid shufflevector operands!", &SV);
1230 const VectorType *VTy = dyn_cast<VectorType>(SV.getOperand(0)->getType());
1231 Assert1(VTy, "Operands are not a vector type", &SV);
1233 // Check to see if Mask is valid.
1234 if (const ConstantVector *MV = dyn_cast<ConstantVector>(SV.getOperand(2))) {
1235 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1236 if (ConstantInt* CI = dyn_cast<ConstantInt>(MV->getOperand(i))) {
1237 Assert1(!CI->uge(VTy->getNumElements()*2),
1238 "Invalid shufflevector shuffle mask!", &SV);
1240 Assert1(isa<UndefValue>(MV->getOperand(i)),
1241 "Invalid shufflevector shuffle mask!", &SV);
1245 Assert1(isa<UndefValue>(SV.getOperand(2)) ||
1246 isa<ConstantAggregateZero>(SV.getOperand(2)),
1247 "Invalid shufflevector shuffle mask!", &SV);
1250 visitInstruction(SV);
1253 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1254 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1256 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
1257 Idxs.begin(), Idxs.end());
1258 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1259 Assert2(isa<PointerType>(GEP.getType()) &&
1260 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1261 "GEP is not of right type for indices!", &GEP, ElTy);
1262 visitInstruction(GEP);
1265 void Verifier::visitLoadInst(LoadInst &LI) {
1266 const PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1267 Assert1(PTy, "Load operand must be a pointer.", &LI);
1268 const Type *ElTy = PTy->getElementType();
1269 Assert2(ElTy == LI.getType(),
1270 "Load result type does not match pointer operand type!", &LI, ElTy);
1271 visitInstruction(LI);
1274 void Verifier::visitStoreInst(StoreInst &SI) {
1275 const PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1276 Assert1(PTy, "Load operand must be a pointer.", &SI);
1277 const Type *ElTy = PTy->getElementType();
1278 Assert2(ElTy == SI.getOperand(0)->getType(),
1279 "Stored value type does not match pointer operand type!",
1281 visitInstruction(SI);
1284 void Verifier::visitAllocaInst(AllocaInst &AI) {
1285 const PointerType *PTy = AI.getType();
1286 Assert1(PTy->getAddressSpace() == 0,
1287 "Allocation instruction pointer not in the generic address space!",
1289 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1291 visitInstruction(AI);
1294 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1295 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1296 EVI.idx_begin(), EVI.idx_end()) ==
1298 "Invalid ExtractValueInst operands!", &EVI);
1300 visitInstruction(EVI);
1303 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1304 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1305 IVI.idx_begin(), IVI.idx_end()) ==
1306 IVI.getOperand(1)->getType(),
1307 "Invalid InsertValueInst operands!", &IVI);
1309 visitInstruction(IVI);
1312 /// verifyInstruction - Verify that an instruction is well formed.
1314 void Verifier::visitInstruction(Instruction &I) {
1315 BasicBlock *BB = I.getParent();
1316 Assert1(BB, "Instruction not embedded in basic block!", &I);
1318 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1319 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1321 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
1322 "Only PHI nodes may reference their own value!", &I);
1325 // Verify that if this is a terminator that it is at the end of the block.
1326 if (isa<TerminatorInst>(I))
1327 Assert1(BB->getTerminator() == &I, "Terminator not at end of block!", &I);
1329 // Check that void typed values don't have names
1330 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1331 "Instruction has a name, but provides a void value!", &I);
1333 // Check that the return value of the instruction is either void or a legal
1335 Assert1(I.getType()->isVoidTy() ||
1336 I.getType()->isFirstClassType(),
1337 "Instruction returns a non-scalar type!", &I);
1339 // Check that the instruction doesn't produce metadata. Calls are already
1340 // checked against the callee type.
1341 Assert1(!I.getType()->isMetadataTy() ||
1342 isa<CallInst>(I) || isa<InvokeInst>(I),
1343 "Invalid use of metadata!", &I);
1345 // Check that all uses of the instruction, if they are instructions
1346 // themselves, actually have parent basic blocks. If the use is not an
1347 // instruction, it is an error!
1348 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1350 if (Instruction *Used = dyn_cast<Instruction>(*UI))
1351 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1352 " embedded in a basic block!", &I, Used);
1354 CheckFailed("Use of instruction is not an instruction!", *UI);
1359 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1360 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1362 // Check to make sure that only first-class-values are operands to
1364 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1365 Assert1(0, "Instruction operands must be first-class values!", &I);
1368 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1369 // Check to make sure that the "address of" an intrinsic function is never
1371 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
1372 "Cannot take the address of an intrinsic!", &I);
1373 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1375 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1376 Assert1(OpBB->getParent() == BB->getParent(),
1377 "Referring to a basic block in another function!", &I);
1378 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1379 Assert1(OpArg->getParent() == BB->getParent(),
1380 "Referring to an argument in another function!", &I);
1381 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1382 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1384 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
1385 BasicBlock *OpBlock = Op->getParent();
1387 // Check that a definition dominates all of its uses.
1388 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1389 // Invoke results are only usable in the normal destination, not in the
1390 // exceptional destination.
1391 BasicBlock *NormalDest = II->getNormalDest();
1393 Assert2(NormalDest != II->getUnwindDest(),
1394 "No uses of invoke possible due to dominance structure!",
1397 // PHI nodes differ from other nodes because they actually "use" the
1398 // value in the predecessor basic blocks they correspond to.
1399 BasicBlock *UseBlock = BB;
1400 if (isa<PHINode>(I))
1401 UseBlock = dyn_cast<BasicBlock>(I.getOperand(i+1));
1402 Assert2(UseBlock, "Invoke operand is PHI node with bad incoming-BB",
1405 if (isa<PHINode>(I) && UseBlock == OpBlock) {
1406 // Special case of a phi node in the normal destination or the unwind
1408 Assert2(BB == NormalDest || !DT->isReachableFromEntry(UseBlock),
1409 "Invoke result not available in the unwind destination!",
1412 Assert2(DT->dominates(NormalDest, UseBlock) ||
1413 !DT->isReachableFromEntry(UseBlock),
1414 "Invoke result does not dominate all uses!", Op, &I);
1416 // If the normal successor of an invoke instruction has multiple
1417 // predecessors, then the normal edge from the invoke is critical,
1418 // so the invoke value can only be live if the destination block
1419 // dominates all of it's predecessors (other than the invoke).
1420 if (!NormalDest->getSinglePredecessor() &&
1421 DT->isReachableFromEntry(UseBlock))
1422 // If it is used by something non-phi, then the other case is that
1423 // 'NormalDest' dominates all of its predecessors other than the
1424 // invoke. In this case, the invoke value can still be used.
1425 for (pred_iterator PI = pred_begin(NormalDest),
1426 E = pred_end(NormalDest); PI != E; ++PI)
1427 if (*PI != II->getParent() && !DT->dominates(NormalDest, *PI) &&
1428 DT->isReachableFromEntry(*PI)) {
1429 CheckFailed("Invoke result does not dominate all uses!", Op,&I);
1433 } else if (isa<PHINode>(I)) {
1434 // PHI nodes are more difficult than other nodes because they actually
1435 // "use" the value in the predecessor basic blocks they correspond to.
1436 BasicBlock *PredBB = dyn_cast<BasicBlock>(I.getOperand(i+1));
1437 Assert2(PredBB && (DT->dominates(OpBlock, PredBB) ||
1438 !DT->isReachableFromEntry(PredBB)),
1439 "Instruction does not dominate all uses!", Op, &I);
1441 if (OpBlock == BB) {
1442 // If they are in the same basic block, make sure that the definition
1443 // comes before the use.
1444 Assert2(InstsInThisBlock.count(Op) || !DT->isReachableFromEntry(BB),
1445 "Instruction does not dominate all uses!", Op, &I);
1448 // Definition must dominate use unless use is unreachable!
1449 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, &I) ||
1450 !DT->isReachableFromEntry(BB),
1451 "Instruction does not dominate all uses!", Op, &I);
1453 } else if (isa<InlineAsm>(I.getOperand(i))) {
1454 Assert1(i == 0 && (isa<CallInst>(I) || isa<InvokeInst>(I)),
1455 "Cannot take the address of an inline asm!", &I);
1458 InstsInThisBlock.insert(&I);
1460 VerifyType(I.getType());
1463 /// VerifyType - Verify that a type is well formed.
1465 void Verifier::VerifyType(const Type *Ty) {
1466 if (!Types.insert(Ty)) return;
1468 switch (Ty->getTypeID()) {
1469 case Type::FunctionTyID: {
1470 const FunctionType *FTy = cast<FunctionType>(Ty);
1472 const Type *RetTy = FTy->getReturnType();
1473 Assert2(FunctionType::isValidReturnType(RetTy),
1474 "Function type with invalid return type", RetTy, FTy);
1477 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i) {
1478 const Type *ElTy = FTy->getParamType(i);
1479 Assert2(FunctionType::isValidArgumentType(ElTy),
1480 "Function type with invalid parameter type", ElTy, FTy);
1484 case Type::StructTyID: {
1485 const StructType *STy = cast<StructType>(Ty);
1486 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1487 const Type *ElTy = STy->getElementType(i);
1488 Assert2(StructType::isValidElementType(ElTy),
1489 "Structure type with invalid element type", ElTy, STy);
1493 case Type::ArrayTyID: {
1494 const ArrayType *ATy = cast<ArrayType>(Ty);
1495 Assert1(ArrayType::isValidElementType(ATy->getElementType()),
1496 "Array type with invalid element type", ATy);
1497 VerifyType(ATy->getElementType());
1499 case Type::PointerTyID: {
1500 const PointerType *PTy = cast<PointerType>(Ty);
1501 Assert1(PointerType::isValidElementType(PTy->getElementType()),
1502 "Pointer type with invalid element type", PTy);
1503 VerifyType(PTy->getElementType());
1505 case Type::VectorTyID: {
1506 const VectorType *VTy = cast<VectorType>(Ty);
1507 Assert1(VectorType::isValidElementType(VTy->getElementType()),
1508 "Vector type with invalid element type", VTy);
1509 VerifyType(VTy->getElementType());
1516 // Flags used by TableGen to mark intrinsic parameters with the
1517 // LLVMExtendedElementVectorType and LLVMTruncatedElementVectorType classes.
1518 static const unsigned ExtendedElementVectorType = 0x40000000;
1519 static const unsigned TruncatedElementVectorType = 0x20000000;
1521 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1523 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1524 Function *IF = CI.getCalledFunction();
1525 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1528 #define GET_INTRINSIC_VERIFIER
1529 #include "llvm/Intrinsics.gen"
1530 #undef GET_INTRINSIC_VERIFIER
1535 case Intrinsic::dbg_declare: // llvm.dbg.declare
1536 if (Constant *C = dyn_cast<Constant>(CI.getOperand(1)))
1537 Assert1(C && !isa<ConstantPointerNull>(C),
1538 "invalid llvm.dbg.declare intrinsic call", &CI);
1540 case Intrinsic::memcpy:
1541 case Intrinsic::memmove:
1542 case Intrinsic::memset:
1543 Assert1(isa<ConstantInt>(CI.getOperand(4)),
1544 "alignment argument of memory intrinsics must be a constant int",
1547 case Intrinsic::gcroot:
1548 case Intrinsic::gcwrite:
1549 case Intrinsic::gcread:
1550 if (ID == Intrinsic::gcroot) {
1552 dyn_cast<AllocaInst>(CI.getOperand(1)->stripPointerCasts());
1553 Assert1(AI && isa<PointerType>(AI->getType()->getElementType()),
1554 "llvm.gcroot parameter #1 must be a pointer alloca.", &CI);
1555 Assert1(isa<Constant>(CI.getOperand(2)),
1556 "llvm.gcroot parameter #2 must be a constant.", &CI);
1559 Assert1(CI.getParent()->getParent()->hasGC(),
1560 "Enclosing function does not use GC.", &CI);
1562 case Intrinsic::init_trampoline:
1563 Assert1(isa<Function>(CI.getOperand(2)->stripPointerCasts()),
1564 "llvm.init_trampoline parameter #2 must resolve to a function.",
1567 case Intrinsic::prefetch:
1568 Assert1(isa<ConstantInt>(CI.getOperand(2)) &&
1569 isa<ConstantInt>(CI.getOperand(3)) &&
1570 cast<ConstantInt>(CI.getOperand(2))->getZExtValue() < 2 &&
1571 cast<ConstantInt>(CI.getOperand(3))->getZExtValue() < 4,
1572 "invalid arguments to llvm.prefetch",
1575 case Intrinsic::stackprotector:
1576 Assert1(isa<AllocaInst>(CI.getOperand(2)->stripPointerCasts()),
1577 "llvm.stackprotector parameter #2 must resolve to an alloca.",
1580 case Intrinsic::lifetime_start:
1581 case Intrinsic::lifetime_end:
1582 case Intrinsic::invariant_start:
1583 Assert1(isa<ConstantInt>(CI.getOperand(1)),
1584 "size argument of memory use markers must be a constant integer",
1587 case Intrinsic::invariant_end:
1588 Assert1(isa<ConstantInt>(CI.getOperand(2)),
1589 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
1594 /// Produce a string to identify an intrinsic parameter or return value.
1595 /// The ArgNo value numbers the return values from 0 to NumRets-1 and the
1596 /// parameters beginning with NumRets.
1598 static std::string IntrinsicParam(unsigned ArgNo, unsigned NumRets) {
1599 if (ArgNo < NumRets) {
1601 return "Intrinsic result type";
1603 return "Intrinsic result type #" + utostr(ArgNo);
1605 return "Intrinsic parameter #" + utostr(ArgNo - NumRets);
1608 bool Verifier::PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
1609 int VT, unsigned ArgNo, std::string &Suffix) {
1610 const FunctionType *FTy = F->getFunctionType();
1612 unsigned NumElts = 0;
1613 const Type *EltTy = Ty;
1614 const VectorType *VTy = dyn_cast<VectorType>(Ty);
1616 EltTy = VTy->getElementType();
1617 NumElts = VTy->getNumElements();
1620 const Type *RetTy = FTy->getReturnType();
1621 const StructType *ST = dyn_cast<StructType>(RetTy);
1622 unsigned NumRets = 1;
1624 NumRets = ST->getNumElements();
1629 // Check flags that indicate a type that is an integral vector type with
1630 // elements that are larger or smaller than the elements of the matched
1632 if ((Match & (ExtendedElementVectorType |
1633 TruncatedElementVectorType)) != 0) {
1634 const IntegerType *IEltTy = dyn_cast<IntegerType>(EltTy);
1635 if (!VTy || !IEltTy) {
1636 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not "
1637 "an integral vector type.", F);
1640 // Adjust the current Ty (in the opposite direction) rather than
1641 // the type being matched against.
1642 if ((Match & ExtendedElementVectorType) != 0) {
1643 if ((IEltTy->getBitWidth() & 1) != 0) {
1644 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " vector "
1645 "element bit-width is odd.", F);
1648 Ty = VectorType::getTruncatedElementVectorType(VTy);
1650 Ty = VectorType::getExtendedElementVectorType(VTy);
1651 Match &= ~(ExtendedElementVectorType | TruncatedElementVectorType);
1654 if (Match <= static_cast<int>(NumRets - 1)) {
1656 RetTy = ST->getElementType(Match);
1659 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " does not "
1660 "match return type.", F);
1664 if (Ty != FTy->getParamType(Match - NumRets)) {
1665 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " does not "
1666 "match parameter %" + utostr(Match - NumRets) + ".", F);
1670 } else if (VT == MVT::iAny) {
1671 if (!EltTy->isInteger()) {
1672 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not "
1673 "an integer type.", F);
1677 unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
1681 Suffix += "v" + utostr(NumElts);
1683 Suffix += "i" + utostr(GotBits);
1685 // Check some constraints on various intrinsics.
1687 default: break; // Not everything needs to be checked.
1688 case Intrinsic::bswap:
1689 if (GotBits < 16 || GotBits % 16 != 0) {
1690 CheckFailed("Intrinsic requires even byte width argument", F);
1695 } else if (VT == MVT::fAny) {
1696 if (!EltTy->isFloatingPoint()) {
1697 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not "
1698 "a floating-point type.", F);
1705 Suffix += "v" + utostr(NumElts);
1707 Suffix += EVT::getEVT(EltTy).getEVTString();
1708 } else if (VT == MVT::vAny) {
1710 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not a vector type.", F);
1713 Suffix += ".v" + utostr(NumElts) + EVT::getEVT(EltTy).getEVTString();
1714 } else if (VT == MVT::iPTR) {
1715 if (!isa<PointerType>(Ty)) {
1716 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not a "
1717 "pointer and a pointer is required.", F);
1720 } else if (VT == MVT::iPTRAny) {
1721 // Outside of TableGen, we don't distinguish iPTRAny (to any address space)
1722 // and iPTR. In the verifier, we can not distinguish which case we have so
1723 // allow either case to be legal.
1724 if (const PointerType* PTyp = dyn_cast<PointerType>(Ty)) {
1725 Suffix += ".p" + utostr(PTyp->getAddressSpace()) +
1726 EVT::getEVT(PTyp->getElementType()).getEVTString();
1728 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is not a "
1729 "pointer and a pointer is required.", F);
1732 } else if (EVT((MVT::SimpleValueType)VT).isVector()) {
1733 EVT VVT = EVT((MVT::SimpleValueType)VT);
1735 // If this is a vector argument, verify the number and type of elements.
1736 if (VVT.getVectorElementType() != EVT::getEVT(EltTy)) {
1737 CheckFailed("Intrinsic prototype has incorrect vector element type!", F);
1741 if (VVT.getVectorNumElements() != NumElts) {
1742 CheckFailed("Intrinsic prototype has incorrect number of "
1743 "vector elements!", F);
1746 } else if (EVT((MVT::SimpleValueType)VT).getTypeForEVT(Ty->getContext()) !=
1748 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is wrong!", F);
1750 } else if (EltTy != Ty) {
1751 CheckFailed(IntrinsicParam(ArgNo, NumRets) + " is a vector "
1752 "and a scalar is required.", F);
1759 /// VerifyIntrinsicPrototype - TableGen emits calls to this function into
1760 /// Intrinsics.gen. This implements a little state machine that verifies the
1761 /// prototype of intrinsics.
1762 void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
1764 unsigned ParamNum, ...) {
1766 va_start(VA, ParamNum);
1767 const FunctionType *FTy = F->getFunctionType();
1769 // For overloaded intrinsics, the Suffix of the function name must match the
1770 // types of the arguments. This variable keeps track of the expected
1771 // suffix, to be checked at the end.
1774 if (FTy->getNumParams() + FTy->isVarArg() != ParamNum) {
1775 CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
1779 const Type *Ty = FTy->getReturnType();
1780 const StructType *ST = dyn_cast<StructType>(Ty);
1782 // Verify the return types.
1783 if (ST && ST->getNumElements() != RetNum) {
1784 CheckFailed("Intrinsic prototype has incorrect number of return types!", F);
1788 for (unsigned ArgNo = 0; ArgNo < RetNum; ++ArgNo) {
1789 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1791 if (ST) Ty = ST->getElementType(ArgNo);
1793 if (!PerformTypeCheck(ID, F, Ty, VT, ArgNo, Suffix))
1797 // Verify the parameter types.
1798 for (unsigned ArgNo = 0; ArgNo < ParamNum; ++ArgNo) {
1799 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1801 if (VT == MVT::isVoid && ArgNo > 0) {
1802 if (!FTy->isVarArg())
1803 CheckFailed("Intrinsic prototype has no '...'!", F);
1807 if (!PerformTypeCheck(ID, F, FTy->getParamType(ArgNo), VT, ArgNo + RetNum,
1814 // For intrinsics without pointer arguments, if we computed a Suffix then the
1815 // intrinsic is overloaded and we need to make sure that the name of the
1816 // function is correct. We add the suffix to the name of the intrinsic and
1817 // compare against the given function name. If they are not the same, the
1818 // function name is invalid. This ensures that overloading of intrinsics
1819 // uses a sane and consistent naming convention. Note that intrinsics with
1820 // pointer argument may or may not be overloaded so we will check assuming it
1821 // has a suffix and not.
1822 if (!Suffix.empty()) {
1823 std::string Name(Intrinsic::getName(ID));
1824 if (Name + Suffix != F->getName()) {
1825 CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
1826 F->getName().substr(Name.length()) + "'. It should be '" +
1831 // Check parameter attributes.
1832 Assert1(F->getAttributes() == Intrinsic::getAttributes(ID),
1833 "Intrinsic has wrong parameter attributes!", F);
1837 //===----------------------------------------------------------------------===//
1838 // Implement the public interfaces to this file...
1839 //===----------------------------------------------------------------------===//
1841 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1842 return new Verifier(action);
1846 // verifyFunction - Create
1847 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1848 Function &F = const_cast<Function&>(f);
1849 assert(!F.isDeclaration() && "Cannot verify external functions");
1851 ExistingModuleProvider MP(F.getParent());
1852 FunctionPassManager FPM(&MP);
1853 Verifier *V = new Verifier(action);
1860 /// verifyModule - Check a module for errors, printing messages on stderr.
1861 /// Return true if the module is corrupt.
1863 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1864 std::string *ErrorInfo) {
1866 Verifier *V = new Verifier(action);
1868 PM.run(const_cast<Module&>(M));
1870 if (ErrorInfo && V->Broken)
1871 *ErrorInfo = V->MessagesStr.str();