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((intptr_t)&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;
121 : FunctionPass((intptr_t)&ID),
122 Broken(false), RealPass(true), action(AbortProcessAction),
123 DT(0), msgs( std::ios::app | std::ios::out ) {}
124 explicit Verifier(VerifierFailureAction ctn)
125 : FunctionPass((intptr_t)&ID),
126 Broken(false), RealPass(true), action(ctn), DT(0),
127 msgs( std::ios::app | std::ios::out ) {}
128 explicit Verifier(bool AB)
129 : FunctionPass((intptr_t)&ID),
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)
134 : FunctionPass((intptr_t)&ID),
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() {
202 msgs << "Broken module found, ";
204 case AbortProcessAction:
205 msgs << "compilation aborted!\n";
208 case PrintMessageAction:
209 msgs << "verification continues.\n";
212 case ReturnStatusAction:
213 msgs << "compilation terminated.\n";
221 // Verification methods...
222 void verifyTypeSymbolTable(TypeSymbolTable &ST);
223 void visitGlobalValue(GlobalValue &GV);
224 void visitGlobalVariable(GlobalVariable &GV);
225 void visitGlobalAlias(GlobalAlias &GA);
226 void visitFunction(Function &F);
227 void visitBasicBlock(BasicBlock &BB);
228 void visitTruncInst(TruncInst &I);
229 void visitZExtInst(ZExtInst &I);
230 void visitSExtInst(SExtInst &I);
231 void visitFPTruncInst(FPTruncInst &I);
232 void visitFPExtInst(FPExtInst &I);
233 void visitFPToUIInst(FPToUIInst &I);
234 void visitFPToSIInst(FPToSIInst &I);
235 void visitUIToFPInst(UIToFPInst &I);
236 void visitSIToFPInst(SIToFPInst &I);
237 void visitIntToPtrInst(IntToPtrInst &I);
238 void visitPtrToIntInst(PtrToIntInst &I);
239 void visitBitCastInst(BitCastInst &I);
240 void visitPHINode(PHINode &PN);
241 void visitBinaryOperator(BinaryOperator &B);
242 void visitICmpInst(ICmpInst &IC);
243 void visitFCmpInst(FCmpInst &FC);
244 void visitExtractElementInst(ExtractElementInst &EI);
245 void visitInsertElementInst(InsertElementInst &EI);
246 void visitShuffleVectorInst(ShuffleVectorInst &EI);
247 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
248 void visitCallInst(CallInst &CI);
249 void visitInvokeInst(InvokeInst &II);
250 void visitGetElementPtrInst(GetElementPtrInst &GEP);
251 void visitLoadInst(LoadInst &LI);
252 void visitStoreInst(StoreInst &SI);
253 void visitInstruction(Instruction &I);
254 void visitTerminatorInst(TerminatorInst &I);
255 void visitReturnInst(ReturnInst &RI);
256 void visitSwitchInst(SwitchInst &SI);
257 void visitSelectInst(SelectInst &SI);
258 void visitUserOp1(Instruction &I);
259 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
260 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
261 void visitAllocationInst(AllocationInst &AI);
262 void visitGetResultInst(GetResultInst &GRI);
264 void VerifyCallSite(CallSite CS);
265 void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
266 unsigned Count, ...);
267 void VerifyAttrs(ParameterAttributes Attrs, const Type *Ty,
268 bool isReturnValue, const Value *V);
269 void VerifyFunctionAttrs(const FunctionType *FT, const PAListPtr &Attrs,
272 void WriteValue(const Value *V) {
274 if (isa<Instruction>(V)) {
277 WriteAsOperand(msgs, V, true, Mod);
282 void WriteType(const Type* T ) {
284 WriteTypeSymbolic(msgs, T, Mod );
288 // CheckFailed - A check failed, so print out the condition and the message
289 // that failed. This provides a nice place to put a breakpoint if you want
290 // to see why something is not correct.
291 void CheckFailed(const std::string &Message,
292 const Value *V1 = 0, const Value *V2 = 0,
293 const Value *V3 = 0, const Value *V4 = 0) {
294 msgs << Message << "\n";
302 void CheckFailed( const std::string& Message, const Value* V1,
303 const Type* T2, const Value* V3 = 0 ) {
304 msgs << Message << "\n";
311 } // End anonymous namespace
313 char Verifier::ID = 0;
314 static RegisterPass<Verifier> X("verify", "Module Verifier");
316 // Assert - We know that cond should be true, if not print an error message.
317 #define Assert(C, M) \
318 do { if (!(C)) { CheckFailed(M); return; } } while (0)
319 #define Assert1(C, M, V1) \
320 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
321 #define Assert2(C, M, V1, V2) \
322 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
323 #define Assert3(C, M, V1, V2, V3) \
324 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
325 #define Assert4(C, M, V1, V2, V3, V4) \
326 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
329 void Verifier::visitGlobalValue(GlobalValue &GV) {
330 Assert1(!GV.isDeclaration() ||
331 GV.hasExternalLinkage() ||
332 GV.hasDLLImportLinkage() ||
333 GV.hasExternalWeakLinkage() ||
334 (isa<GlobalAlias>(GV) &&
335 (GV.hasInternalLinkage() || GV.hasWeakLinkage())),
336 "Global is external, but doesn't have external or dllimport or weak linkage!",
339 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
340 "Global is marked as dllimport, but not external", &GV);
342 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
343 "Only global variables can have appending linkage!", &GV);
345 if (GV.hasAppendingLinkage()) {
346 GlobalVariable &GVar = cast<GlobalVariable>(GV);
347 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
348 "Only global arrays can have appending linkage!", &GV);
352 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
353 if (GV.hasInitializer()) {
354 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
355 "Global variable initializer type does not match global "
356 "variable type!", &GV);
358 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
359 GV.hasExternalWeakLinkage(),
360 "invalid linkage type for global declaration", &GV);
363 visitGlobalValue(GV);
366 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
367 Assert1(!GA.getName().empty(),
368 "Alias name cannot be empty!", &GA);
369 Assert1(GA.hasExternalLinkage() || GA.hasInternalLinkage() ||
371 "Alias should have external or external weak linkage!", &GA);
372 Assert1(GA.getAliasee(),
373 "Aliasee cannot be NULL!", &GA);
374 Assert1(GA.getType() == GA.getAliasee()->getType(),
375 "Alias and aliasee types should match!", &GA);
377 if (!isa<GlobalValue>(GA.getAliasee())) {
378 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
379 Assert1(CE && CE->getOpcode() == Instruction::BitCast &&
380 isa<GlobalValue>(CE->getOperand(0)),
381 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
385 const GlobalValue* Aliasee = GA.resolveAliasedGlobal();
387 "Aliasing chain should end with function or global variable", &GA);
389 visitGlobalValue(GA);
392 void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
395 // VerifyAttrs - Check the given parameter attributes for an argument or return
396 // value of the specified type. The value V is printed in error messages.
397 void Verifier::VerifyAttrs(ParameterAttributes Attrs, const Type *Ty,
398 bool isReturnValue, const Value *V) {
399 if (Attrs == ParamAttr::None)
403 ParameterAttributes RetI = Attrs & ParamAttr::ParameterOnly;
404 Assert1(!RetI, "Attribute " + ParamAttr::getAsString(RetI) +
405 "does not apply to return values!", V);
407 ParameterAttributes ParmI = Attrs & ParamAttr::ReturnOnly;
408 Assert1(!ParmI, "Attribute " + ParamAttr::getAsString(ParmI) +
409 "only applies to return values!", V);
413 i < array_lengthof(ParamAttr::MutuallyIncompatible); ++i) {
414 ParameterAttributes MutI = Attrs & ParamAttr::MutuallyIncompatible[i];
415 Assert1(!(MutI & (MutI - 1)), "Attributes " +
416 ParamAttr::getAsString(MutI) + "are incompatible!", V);
419 ParameterAttributes TypeI = Attrs & ParamAttr::typeIncompatible(Ty);
420 Assert1(!TypeI, "Wrong type for attribute " +
421 ParamAttr::getAsString(TypeI), V);
424 // VerifyFunctionAttrs - Check parameter attributes against a function type.
425 // The value V is printed in error messages.
426 void Verifier::VerifyFunctionAttrs(const FunctionType *FT,
427 const PAListPtr &Attrs,
432 bool SawNest = false;
434 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
435 const ParamAttrsWithIndex &Attr = Attrs.getSlot(i);
439 Ty = FT->getReturnType();
440 else if (Attr.Index-1 < FT->getNumParams())
441 Ty = FT->getParamType(Attr.Index-1);
443 break; // VarArgs attributes, don't verify.
445 VerifyAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
447 if (Attr.Attrs & ParamAttr::Nest) {
448 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
452 if (Attr.Attrs & ParamAttr::StructRet)
453 Assert1(Attr.Index == 1, "Attribute sret not on first parameter!", V);
457 // visitFunction - Verify that a function is ok.
459 void Verifier::visitFunction(Function &F) {
460 // Check function arguments.
461 const FunctionType *FT = F.getFunctionType();
462 unsigned NumArgs = F.arg_size();
464 Assert2(FT->getNumParams() == NumArgs,
465 "# formal arguments must match # of arguments for function type!",
467 Assert1(F.getReturnType()->isFirstClassType() ||
468 F.getReturnType() == Type::VoidTy ||
469 isa<StructType>(F.getReturnType()),
470 "Functions cannot return aggregate values!", &F);
472 Assert1(!F.hasStructRetAttr() || F.getReturnType() == Type::VoidTy,
473 "Invalid struct return type!", &F);
475 const PAListPtr &Attrs = F.getParamAttrs();
477 Assert1(Attrs.isEmpty() ||
478 Attrs.getSlot(Attrs.getNumSlots()-1).Index <= FT->getNumParams(),
479 "Attributes after last parameter!", &F);
481 // Check function attributes.
482 VerifyFunctionAttrs(FT, Attrs, &F);
484 // Check that this function meets the restrictions on this calling convention.
485 switch (F.getCallingConv()) {
490 case CallingConv::Fast:
491 case CallingConv::Cold:
492 case CallingConv::X86_FastCall:
493 Assert1(!F.isVarArg(),
494 "Varargs functions must have C calling conventions!", &F);
498 // Check that the argument values match the function type for this function...
500 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
502 Assert2(I->getType() == FT->getParamType(i),
503 "Argument value does not match function argument type!",
504 I, FT->getParamType(i));
505 // Make sure no aggregates are passed by value.
506 Assert1(I->getType()->isFirstClassType(),
507 "Functions cannot take aggregates as arguments by value!", I);
510 if (F.isDeclaration()) {
511 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
512 F.hasExternalWeakLinkage(),
513 "invalid linkage type for function declaration", &F);
515 // Verify that this function (which has a body) is not named "llvm.*". It
516 // is not legal to define intrinsics.
517 if (F.getName().size() >= 5)
518 Assert1(F.getName().substr(0, 5) != "llvm.",
519 "llvm intrinsics cannot be defined!", &F);
521 // Check the entry node
522 BasicBlock *Entry = &F.getEntryBlock();
523 Assert1(pred_begin(Entry) == pred_end(Entry),
524 "Entry block to function must not have predecessors!", Entry);
529 // verifyBasicBlock - Verify that a basic block is well formed...
531 void Verifier::visitBasicBlock(BasicBlock &BB) {
532 InstsInThisBlock.clear();
534 // Ensure that basic blocks have terminators!
535 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
537 // Check constraints that this basic block imposes on all of the PHI nodes in
539 if (isa<PHINode>(BB.front())) {
540 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
541 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
542 std::sort(Preds.begin(), Preds.end());
544 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
546 // Ensure that PHI nodes have at least one entry!
547 Assert1(PN->getNumIncomingValues() != 0,
548 "PHI nodes must have at least one entry. If the block is dead, "
549 "the PHI should be removed!", PN);
550 Assert1(PN->getNumIncomingValues() == Preds.size(),
551 "PHINode should have one entry for each predecessor of its "
552 "parent basic block!", PN);
554 // Get and sort all incoming values in the PHI node...
556 Values.reserve(PN->getNumIncomingValues());
557 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
558 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
559 PN->getIncomingValue(i)));
560 std::sort(Values.begin(), Values.end());
562 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
563 // Check to make sure that if there is more than one entry for a
564 // particular basic block in this PHI node, that the incoming values are
567 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
568 Values[i].second == Values[i-1].second,
569 "PHI node has multiple entries for the same basic block with "
570 "different incoming values!", PN, Values[i].first,
571 Values[i].second, Values[i-1].second);
573 // Check to make sure that the predecessors and PHI node entries are
575 Assert3(Values[i].first == Preds[i],
576 "PHI node entries do not match predecessors!", PN,
577 Values[i].first, Preds[i]);
583 void Verifier::visitTerminatorInst(TerminatorInst &I) {
584 // Ensure that terminators only exist at the end of the basic block.
585 Assert1(&I == I.getParent()->getTerminator(),
586 "Terminator found in the middle of a basic block!", I.getParent());
590 void Verifier::visitReturnInst(ReturnInst &RI) {
591 Function *F = RI.getParent()->getParent();
592 unsigned N = RI.getNumOperands();
593 if (F->getReturnType() == Type::VoidTy)
595 "Found return instr that returns void in Function of non-void "
596 "return type!", &RI, F->getReturnType());
597 else if (const StructType *STy = dyn_cast<StructType>(F->getReturnType())) {
598 Assert2(STy->getNumElements() == N,
599 "Incorrect number of return values in ret instruction!",
600 &RI, F->getReturnType());
601 for (unsigned i = 0; i != N; ++i)
602 Assert2(STy->getElementType(i) == RI.getOperand(i)->getType(),
603 "Function return type does not match operand "
604 "type of return inst!", &RI, F->getReturnType());
606 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
607 "Function return type does not match operand "
608 "type of return inst!", &RI, F->getReturnType());
611 // Check to make sure that the return value has necessary properties for
613 visitTerminatorInst(RI);
616 void Verifier::visitSwitchInst(SwitchInst &SI) {
617 // Check to make sure that all of the constants in the switch instruction
618 // have the same type as the switched-on value.
619 const Type *SwitchTy = SI.getCondition()->getType();
620 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
621 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
622 "Switch constants must all be same type as switch value!", &SI);
624 visitTerminatorInst(SI);
627 void Verifier::visitSelectInst(SelectInst &SI) {
628 Assert1(SI.getCondition()->getType() == Type::Int1Ty,
629 "Select condition type must be bool!", &SI);
630 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
631 "Select values must have identical types!", &SI);
632 Assert1(SI.getTrueValue()->getType() == SI.getType(),
633 "Select values must have same type as select instruction!", &SI);
634 visitInstruction(SI);
638 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
639 /// a pass, if any exist, it's an error.
641 void Verifier::visitUserOp1(Instruction &I) {
642 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
645 void Verifier::visitTruncInst(TruncInst &I) {
646 // Get the source and destination types
647 const Type *SrcTy = I.getOperand(0)->getType();
648 const Type *DestTy = I.getType();
650 // Get the size of the types in bits, we'll need this later
651 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
652 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
654 Assert1(SrcTy->isInteger(), "Trunc only operates on integer", &I);
655 Assert1(DestTy->isInteger(), "Trunc only produces integer", &I);
656 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
661 void Verifier::visitZExtInst(ZExtInst &I) {
662 // Get the source and destination types
663 const Type *SrcTy = I.getOperand(0)->getType();
664 const Type *DestTy = I.getType();
666 // Get the size of the types in bits, we'll need this later
667 Assert1(SrcTy->isInteger(), "ZExt only operates on integer", &I);
668 Assert1(DestTy->isInteger(), "ZExt only produces an integer", &I);
669 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
670 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
672 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
677 void Verifier::visitSExtInst(SExtInst &I) {
678 // Get the source and destination types
679 const Type *SrcTy = I.getOperand(0)->getType();
680 const Type *DestTy = I.getType();
682 // Get the size of the types in bits, we'll need this later
683 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
684 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
686 Assert1(SrcTy->isInteger(), "SExt only operates on integer", &I);
687 Assert1(DestTy->isInteger(), "SExt only produces an integer", &I);
688 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
693 void Verifier::visitFPTruncInst(FPTruncInst &I) {
694 // Get the source and destination types
695 const Type *SrcTy = I.getOperand(0)->getType();
696 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->isFloatingPoint(),"FPTrunc only operates on FP", &I);
702 Assert1(DestTy->isFloatingPoint(),"FPTrunc only produces an FP", &I);
703 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
708 void Verifier::visitFPExtInst(FPExtInst &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 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
715 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
717 Assert1(SrcTy->isFloatingPoint(),"FPExt only operates on FP", &I);
718 Assert1(DestTy->isFloatingPoint(),"FPExt only produces an FP", &I);
719 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
724 void Verifier::visitUIToFPInst(UIToFPInst &I) {
725 // Get the source and destination types
726 const Type *SrcTy = I.getOperand(0)->getType();
727 const Type *DestTy = I.getType();
729 bool SrcVec = isa<VectorType>(SrcTy);
730 bool DstVec = isa<VectorType>(DestTy);
732 Assert1(SrcVec == DstVec,
733 "UIToFP source and dest must both be vector or scalar", &I);
734 Assert1(SrcTy->isIntOrIntVector(),
735 "UIToFP source must be integer or integer vector", &I);
736 Assert1(DestTy->isFPOrFPVector(),
737 "UIToFP result must be FP or FP vector", &I);
739 if (SrcVec && DstVec)
740 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
741 cast<VectorType>(DestTy)->getNumElements(),
742 "UIToFP source and dest vector length mismatch", &I);
747 void Verifier::visitSIToFPInst(SIToFPInst &I) {
748 // Get the source and destination types
749 const Type *SrcTy = I.getOperand(0)->getType();
750 const Type *DestTy = I.getType();
752 bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
753 bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
755 Assert1(SrcVec == DstVec,
756 "SIToFP source and dest must both be vector or scalar", &I);
757 Assert1(SrcTy->isIntOrIntVector(),
758 "SIToFP source must be integer or integer vector", &I);
759 Assert1(DestTy->isFPOrFPVector(),
760 "SIToFP result must be FP or FP vector", &I);
762 if (SrcVec && DstVec)
763 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
764 cast<VectorType>(DestTy)->getNumElements(),
765 "SIToFP source and dest vector length mismatch", &I);
770 void Verifier::visitFPToUIInst(FPToUIInst &I) {
771 // Get the source and destination types
772 const Type *SrcTy = I.getOperand(0)->getType();
773 const Type *DestTy = I.getType();
775 bool SrcVec = isa<VectorType>(SrcTy);
776 bool DstVec = isa<VectorType>(DestTy);
778 Assert1(SrcVec == DstVec,
779 "FPToUI source and dest must both be vector or scalar", &I);
780 Assert1(SrcTy->isFPOrFPVector(), "FPToUI source must be FP or FP vector", &I);
781 Assert1(DestTy->isIntOrIntVector(),
782 "FPToUI result must be integer or integer vector", &I);
784 if (SrcVec && DstVec)
785 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
786 cast<VectorType>(DestTy)->getNumElements(),
787 "FPToUI source and dest vector length mismatch", &I);
792 void Verifier::visitFPToSIInst(FPToSIInst &I) {
793 // Get the source and destination types
794 const Type *SrcTy = I.getOperand(0)->getType();
795 const Type *DestTy = I.getType();
797 bool SrcVec = isa<VectorType>(SrcTy);
798 bool DstVec = isa<VectorType>(DestTy);
800 Assert1(SrcVec == DstVec,
801 "FPToSI source and dest must both be vector or scalar", &I);
802 Assert1(SrcTy->isFPOrFPVector(),
803 "FPToSI source must be FP or FP vector", &I);
804 Assert1(DestTy->isIntOrIntVector(),
805 "FPToSI result must be integer or integer vector", &I);
807 if (SrcVec && DstVec)
808 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
809 cast<VectorType>(DestTy)->getNumElements(),
810 "FPToSI source and dest vector length mismatch", &I);
815 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
816 // Get the source and destination types
817 const Type *SrcTy = I.getOperand(0)->getType();
818 const Type *DestTy = I.getType();
820 Assert1(isa<PointerType>(SrcTy), "PtrToInt source must be pointer", &I);
821 Assert1(DestTy->isInteger(), "PtrToInt result must be integral", &I);
826 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
827 // Get the source and destination types
828 const Type *SrcTy = I.getOperand(0)->getType();
829 const Type *DestTy = I.getType();
831 Assert1(SrcTy->isInteger(), "IntToPtr source must be an integral", &I);
832 Assert1(isa<PointerType>(DestTy), "IntToPtr result must be a pointer",&I);
837 void Verifier::visitBitCastInst(BitCastInst &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->getPrimitiveSizeInBits();
844 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
846 // BitCast implies a no-op cast of type only. No bits change.
847 // However, you can't cast pointers to anything but pointers.
848 Assert1(isa<PointerType>(DestTy) == isa<PointerType>(DestTy),
849 "Bitcast requires both operands to be pointer or neither", &I);
850 Assert1(SrcBitSize == DestBitSize, "Bitcast requies types of same width", &I);
855 /// visitPHINode - Ensure that a PHI node is well formed.
857 void Verifier::visitPHINode(PHINode &PN) {
858 // Ensure that the PHI nodes are all grouped together at the top of the block.
859 // This can be tested by checking whether the instruction before this is
860 // either nonexistent (because this is begin()) or is a PHI node. If not,
861 // then there is some other instruction before a PHI.
862 Assert2(&PN == &PN.getParent()->front() ||
863 isa<PHINode>(--BasicBlock::iterator(&PN)),
864 "PHI nodes not grouped at top of basic block!",
865 &PN, PN.getParent());
867 // Check that all of the operands of the PHI node have the same type as the
869 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
870 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
871 "PHI node operands are not the same type as the result!", &PN);
873 // All other PHI node constraints are checked in the visitBasicBlock method.
875 visitInstruction(PN);
878 void Verifier::VerifyCallSite(CallSite CS) {
879 Instruction *I = CS.getInstruction();
881 Assert1(isa<PointerType>(CS.getCalledValue()->getType()),
882 "Called function must be a pointer!", I);
883 const PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
884 Assert1(isa<FunctionType>(FPTy->getElementType()),
885 "Called function is not pointer to function type!", I);
887 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
889 // Verify that the correct number of arguments are being passed
891 Assert1(CS.arg_size() >= FTy->getNumParams(),
892 "Called function requires more parameters than were provided!",I);
894 Assert1(CS.arg_size() == FTy->getNumParams(),
895 "Incorrect number of arguments passed to called function!", I);
897 // Verify that all arguments to the call match the function type...
898 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
899 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
900 "Call parameter type does not match function signature!",
901 CS.getArgument(i), FTy->getParamType(i), I);
903 const PAListPtr &Attrs = CS.getParamAttrs();
905 Assert1(Attrs.isEmpty() ||
906 Attrs.getSlot(Attrs.getNumSlots()-1).Index <= CS.arg_size(),
907 "Attributes after last parameter!", I);
909 // Verify call attributes.
910 VerifyFunctionAttrs(FTy, Attrs, I);
913 // Check attributes on the varargs part.
914 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
915 ParameterAttributes Attr = Attrs.getParamAttrs(Idx);
917 VerifyAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
919 ParameterAttributes VArgI = Attr & ParamAttr::VarArgsIncompatible;
920 Assert1(!VArgI, "Attribute " + ParamAttr::getAsString(VArgI) +
921 "cannot be used for vararg call arguments!", I);
924 visitInstruction(*I);
927 void Verifier::visitCallInst(CallInst &CI) {
930 if (Function *F = CI.getCalledFunction()) {
931 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
932 visitIntrinsicFunctionCall(ID, CI);
936 void Verifier::visitInvokeInst(InvokeInst &II) {
940 /// visitBinaryOperator - Check that both arguments to the binary operator are
941 /// of the same type!
943 void Verifier::visitBinaryOperator(BinaryOperator &B) {
944 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
945 "Both operands to a binary operator are not of the same type!", &B);
947 switch (B.getOpcode()) {
948 // Check that logical operators are only used with integral operands.
949 case Instruction::And:
950 case Instruction::Or:
951 case Instruction::Xor:
952 Assert1(B.getType()->isInteger() ||
953 (isa<VectorType>(B.getType()) &&
954 cast<VectorType>(B.getType())->getElementType()->isInteger()),
955 "Logical operators only work with integral types!", &B);
956 Assert1(B.getType() == B.getOperand(0)->getType(),
957 "Logical operators must have same type for operands and result!",
960 case Instruction::Shl:
961 case Instruction::LShr:
962 case Instruction::AShr:
963 Assert1(B.getType()->isInteger(),
964 "Shift must return an integer result!", &B);
965 Assert1(B.getType() == B.getOperand(0)->getType(),
966 "Shift return type must be same as operands!", &B);
969 // Arithmetic operators only work on integer or fp values
970 Assert1(B.getType() == B.getOperand(0)->getType(),
971 "Arithmetic operators must have same type for operands and result!",
973 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint() ||
974 isa<VectorType>(B.getType()),
975 "Arithmetic operators must have integer, fp, or vector type!", &B);
982 void Verifier::visitICmpInst(ICmpInst& IC) {
983 // Check that the operands are the same type
984 const Type* Op0Ty = IC.getOperand(0)->getType();
985 const Type* Op1Ty = IC.getOperand(1)->getType();
986 Assert1(Op0Ty == Op1Ty,
987 "Both operands to ICmp instruction are not of the same type!", &IC);
988 // Check that the operands are the right type
989 Assert1(Op0Ty->isInteger() || isa<PointerType>(Op0Ty),
990 "Invalid operand types for ICmp instruction", &IC);
991 visitInstruction(IC);
994 void Verifier::visitFCmpInst(FCmpInst& FC) {
995 // Check that the operands are the same type
996 const Type* Op0Ty = FC.getOperand(0)->getType();
997 const Type* Op1Ty = FC.getOperand(1)->getType();
998 Assert1(Op0Ty == Op1Ty,
999 "Both operands to FCmp instruction are not of the same type!", &FC);
1000 // Check that the operands are the right type
1001 Assert1(Op0Ty->isFloatingPoint(),
1002 "Invalid operand types for FCmp instruction", &FC);
1003 visitInstruction(FC);
1006 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1007 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1009 "Invalid extractelement operands!", &EI);
1010 visitInstruction(EI);
1013 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1014 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1017 "Invalid insertelement operands!", &IE);
1018 visitInstruction(IE);
1021 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1022 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1024 "Invalid shufflevector operands!", &SV);
1025 Assert1(SV.getType() == SV.getOperand(0)->getType(),
1026 "Result of shufflevector must match first operand type!", &SV);
1028 // Check to see if Mask is valid.
1029 if (const ConstantVector *MV = dyn_cast<ConstantVector>(SV.getOperand(2))) {
1030 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
1031 Assert1(isa<ConstantInt>(MV->getOperand(i)) ||
1032 isa<UndefValue>(MV->getOperand(i)),
1033 "Invalid shufflevector shuffle mask!", &SV);
1036 Assert1(isa<UndefValue>(SV.getOperand(2)) ||
1037 isa<ConstantAggregateZero>(SV.getOperand(2)),
1038 "Invalid shufflevector shuffle mask!", &SV);
1041 visitInstruction(SV);
1044 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1045 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1047 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
1048 Idxs.begin(), Idxs.end());
1049 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1050 Assert2(isa<PointerType>(GEP.getType()) &&
1051 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1052 "GEP is not of right type for indices!", &GEP, ElTy);
1053 visitInstruction(GEP);
1056 void Verifier::visitLoadInst(LoadInst &LI) {
1058 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
1059 Assert2(ElTy == LI.getType(),
1060 "Load result type does not match pointer operand type!", &LI, ElTy);
1061 visitInstruction(LI);
1064 void Verifier::visitStoreInst(StoreInst &SI) {
1066 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
1067 Assert2(ElTy == SI.getOperand(0)->getType(),
1068 "Stored value type does not match pointer operand type!", &SI, ElTy);
1069 visitInstruction(SI);
1072 void Verifier::visitAllocationInst(AllocationInst &AI) {
1073 const PointerType *PTy = AI.getType();
1074 Assert1(PTy->getAddressSpace() == 0,
1075 "Allocation instruction pointer not in the generic address space!",
1077 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1079 visitInstruction(AI);
1082 void Verifier::visitGetResultInst(GetResultInst &GRI) {
1083 Assert1(GetResultInst::isValidOperands(GRI.getAggregateValue(),
1085 "Invalid GetResultInst operands!", &GRI);
1086 Assert1(isa<CallInst>(GRI.getAggregateValue()) ||
1087 isa<InvokeInst>(GRI.getAggregateValue()) ||
1088 isa<UndefValue>(GRI.getAggregateValue()),
1089 "GetResultInst operand must be a call/invoke/undef!", &GRI);
1091 visitInstruction(GRI);
1095 /// verifyInstruction - Verify that an instruction is well formed.
1097 void Verifier::visitInstruction(Instruction &I) {
1098 BasicBlock *BB = I.getParent();
1099 Assert1(BB, "Instruction not embedded in basic block!", &I);
1101 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1102 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1104 Assert1(*UI != (User*)&I ||
1105 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1106 "Only PHI nodes may reference their own value!", &I);
1109 // Verify that if this is a terminator that it is at the end of the block.
1110 if (isa<TerminatorInst>(I))
1111 Assert1(BB->getTerminator() == &I, "Terminator not at end of block!", &I);
1114 // Check that void typed values don't have names
1115 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
1116 "Instruction has a name, but provides a void value!", &I);
1118 // Check that the return value of the instruction is either void or a legal
1120 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType()
1121 || ((isa<CallInst>(I) || isa<InvokeInst>(I))
1122 && isa<StructType>(I.getType())),
1123 "Instruction returns a non-scalar type!", &I);
1125 // Check that all uses of the instruction, if they are instructions
1126 // themselves, actually have parent basic blocks. If the use is not an
1127 // instruction, it is an error!
1128 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1130 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
1132 Instruction *Used = cast<Instruction>(*UI);
1133 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1134 " embeded in a basic block!", &I, Used);
1137 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1138 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1140 // Check to make sure that only first-class-values are operands to
1142 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1143 if (isa<ReturnInst>(I) || isa<GetResultInst>(I))
1144 Assert1(isa<StructType>(I.getOperand(i)->getType()),
1145 "Invalid ReturnInst operands!", &I);
1146 else if (isa<CallInst>(I) || isa<InvokeInst>(I)) {
1147 if (const PointerType *PT = dyn_cast<PointerType>
1148 (I.getOperand(i)->getType())) {
1149 const Type *ETy = PT->getElementType();
1150 Assert1(isa<StructType>(ETy), "Invalid CallInst operands!", &I);
1153 Assert1(0, "Invalid CallInst operands!", &I);
1156 Assert1(0, "Instruction operands must be first-class values!", &I);
1159 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1160 // Check to make sure that the "address of" an intrinsic function is never
1162 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
1163 "Cannot take the address of an intrinsic!", &I);
1164 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1166 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1167 Assert1(OpBB->getParent() == BB->getParent(),
1168 "Referring to a basic block in another function!", &I);
1169 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1170 Assert1(OpArg->getParent() == BB->getParent(),
1171 "Referring to an argument in another function!", &I);
1172 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1173 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1175 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
1176 BasicBlock *OpBlock = Op->getParent();
1178 // Check that a definition dominates all of its uses.
1179 if (!isa<PHINode>(I)) {
1180 // Invoke results are only usable in the normal destination, not in the
1181 // exceptional destination.
1182 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1183 OpBlock = II->getNormalDest();
1185 Assert2(OpBlock != II->getUnwindDest(),
1186 "No uses of invoke possible due to dominance structure!",
1189 // If the normal successor of an invoke instruction has multiple
1190 // predecessors, then the normal edge from the invoke is critical, so
1191 // the invoke value can only be live if the destination block
1192 // dominates all of it's predecessors (other than the invoke) or if
1193 // the invoke value is only used by a phi in the successor.
1194 if (!OpBlock->getSinglePredecessor() &&
1195 DT->dominates(&BB->getParent()->getEntryBlock(), BB)) {
1196 // The first case we allow is if the use is a PHI operand in the
1197 // normal block, and if that PHI operand corresponds to the invoke's
1200 if (PHINode *PN = dyn_cast<PHINode>(&I))
1201 if (PN->getParent() == OpBlock &&
1202 PN->getIncomingBlock(i/2) == Op->getParent())
1205 // If it is used by something non-phi, then the other case is that
1206 // 'OpBlock' dominates all of its predecessors other than the
1207 // invoke. In this case, the invoke value can still be used.
1210 for (pred_iterator PI = pred_begin(OpBlock),
1211 E = pred_end(OpBlock); PI != E; ++PI) {
1212 if (*PI != II->getParent() && !DT->dominates(OpBlock, *PI)) {
1219 "Invoke value defined on critical edge but not dead!", &I,
1222 } else if (OpBlock == BB) {
1223 // If they are in the same basic block, make sure that the definition
1224 // comes before the use.
1225 Assert2(InstsInThisBlock.count(Op) ||
1226 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1227 "Instruction does not dominate all uses!", Op, &I);
1230 // Definition must dominate use unless use is unreachable!
1231 Assert2(DT->dominates(Op, &I) ||
1232 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1233 "Instruction does not dominate all uses!", Op, &I);
1235 // PHI nodes are more difficult than other nodes because they actually
1236 // "use" the value in the predecessor basic blocks they correspond to.
1237 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
1238 Assert2(DT->dominates(OpBlock, PredBB) ||
1239 !DT->dominates(&BB->getParent()->getEntryBlock(), PredBB),
1240 "Instruction does not dominate all uses!", Op, &I);
1242 } else if (isa<InlineAsm>(I.getOperand(i))) {
1243 Assert1(i == 0 && (isa<CallInst>(I) || isa<InvokeInst>(I)),
1244 "Cannot take the address of an inline asm!", &I);
1247 InstsInThisBlock.insert(&I);
1250 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1252 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1253 Function *IF = CI.getCalledFunction();
1254 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1257 #define GET_INTRINSIC_VERIFIER
1258 #include "llvm/Intrinsics.gen"
1259 #undef GET_INTRINSIC_VERIFIER
1264 case Intrinsic::gcroot:
1265 case Intrinsic::gcwrite:
1266 case Intrinsic::gcread: {
1267 Type *PtrTy = PointerType::getUnqual(Type::Int8Ty),
1268 *PtrPtrTy = PointerType::getUnqual(PtrTy);
1273 case Intrinsic::gcroot:
1274 Assert1(CI.getOperand(1)->getType() == PtrPtrTy,
1275 "Intrinsic parameter #1 is not i8**.", &CI);
1276 Assert1(CI.getOperand(2)->getType() == PtrTy,
1277 "Intrinsic parameter #2 is not i8*.", &CI);
1278 Assert1(isa<AllocaInst>(CI.getOperand(1)->stripPointerCasts()),
1279 "llvm.gcroot parameter #1 must be an alloca.", &CI);
1280 Assert1(isa<Constant>(CI.getOperand(2)),
1281 "llvm.gcroot parameter #2 must be a constant.", &CI);
1283 case Intrinsic::gcwrite:
1284 Assert1(CI.getOperand(1)->getType() == PtrTy,
1285 "Intrinsic parameter #1 is not a i8*.", &CI);
1286 Assert1(CI.getOperand(2)->getType() == PtrTy,
1287 "Intrinsic parameter #2 is not a i8*.", &CI);
1288 Assert1(CI.getOperand(3)->getType() == PtrPtrTy,
1289 "Intrinsic parameter #3 is not a i8**.", &CI);
1291 case Intrinsic::gcread:
1292 Assert1(CI.getOperand(1)->getType() == PtrTy,
1293 "Intrinsic parameter #1 is not a i8*.", &CI);
1294 Assert1(CI.getOperand(2)->getType() == PtrPtrTy,
1295 "Intrinsic parameter #2 is not a i8**.", &CI);
1299 Assert1(CI.getParent()->getParent()->hasCollector(),
1300 "Enclosing function does not specify a collector algorithm.",
1303 case Intrinsic::init_trampoline:
1304 Assert1(isa<Function>(CI.getOperand(2)->stripPointerCasts()),
1305 "llvm.init_trampoline parameter #2 must resolve to a function.",
1311 /// VerifyIntrinsicPrototype - TableGen emits calls to this function into
1312 /// Intrinsics.gen. This implements a little state machine that verifies the
1313 /// prototype of intrinsics.
1314 void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID,
1316 unsigned Count, ...) {
1318 va_start(VA, Count);
1320 const FunctionType *FTy = F->getFunctionType();
1322 // For overloaded intrinsics, the Suffix of the function name must match the
1323 // types of the arguments. This variable keeps track of the expected
1324 // suffix, to be checked at the end.
1327 if (FTy->getNumParams() + FTy->isVarArg() != Count - 1) {
1328 CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
1332 // Note that "arg#0" is the return type.
1333 for (unsigned ArgNo = 0; ArgNo < Count; ++ArgNo) {
1334 MVT::ValueType VT = va_arg(VA, MVT::ValueType);
1336 if (VT == MVT::isVoid && ArgNo > 0) {
1337 if (!FTy->isVarArg())
1338 CheckFailed("Intrinsic prototype has no '...'!", F);
1344 Ty = FTy->getReturnType();
1346 Ty = FTy->getParamType(ArgNo-1);
1348 unsigned NumElts = 0;
1349 const Type *EltTy = Ty;
1350 if (const VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1351 EltTy = VTy->getElementType();
1352 NumElts = VTy->getNumElements();
1358 if (Ty != FTy->getReturnType()) {
1359 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
1360 "match return type.", F);
1364 if (Ty != FTy->getParamType(Match-1)) {
1365 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
1366 "match parameter %" + utostr(Match-1) + ".", F);
1370 } else if (VT == MVT::iAny) {
1371 if (!EltTy->isInteger()) {
1373 CheckFailed("Intrinsic result type is not "
1374 "an integer type.", F);
1376 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
1377 "an integer type.", F);
1380 unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
1383 Suffix += "v" + utostr(NumElts);
1384 Suffix += "i" + utostr(GotBits);;
1385 // Check some constraints on various intrinsics.
1387 default: break; // Not everything needs to be checked.
1388 case Intrinsic::bswap:
1389 if (GotBits < 16 || GotBits % 16 != 0)
1390 CheckFailed("Intrinsic requires even byte width argument", F);
1393 } else if (VT == MVT::fAny) {
1394 if (!EltTy->isFloatingPoint()) {
1396 CheckFailed("Intrinsic result type is not "
1397 "a floating-point type.", F);
1399 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
1400 "a floating-point type.", F);
1405 Suffix += "v" + utostr(NumElts);
1406 Suffix += MVT::getValueTypeString(MVT::getValueType(EltTy));
1407 } else if (VT == MVT::iPTR) {
1408 if (!isa<PointerType>(Ty)) {
1410 CheckFailed("Intrinsic result type is not a "
1411 "pointer and a pointer is required.", F);
1413 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not a "
1414 "pointer and a pointer is required.", F);
1417 } else if (MVT::isVector(VT)) {
1418 // If this is a vector argument, verify the number and type of elements.
1419 if (MVT::getVectorElementType(VT) != MVT::getValueType(EltTy)) {
1420 CheckFailed("Intrinsic prototype has incorrect vector element type!",
1424 if (MVT::getVectorNumElements(VT) != NumElts) {
1425 CheckFailed("Intrinsic prototype has incorrect number of "
1426 "vector elements!",F);
1429 } else if (MVT::getTypeForValueType(VT) != EltTy) {
1431 CheckFailed("Intrinsic prototype has incorrect result type!", F);
1433 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is wrong!",F);
1435 } else if (EltTy != Ty) {
1437 CheckFailed("Intrinsic result type is vector "
1438 "and a scalar is required.", F);
1440 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is vector "
1441 "and a scalar is required.", F);
1447 // If we computed a Suffix then the intrinsic is overloaded and we need to
1448 // make sure that the name of the function is correct. We add the suffix to
1449 // the name of the intrinsic and compare against the given function name. If
1450 // they are not the same, the function name is invalid. This ensures that
1451 // overloading of intrinsics uses a sane and consistent naming convention.
1452 if (!Suffix.empty()) {
1453 std::string Name(Intrinsic::getName(ID));
1454 if (Name + Suffix != F->getName())
1455 CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
1456 F->getName().substr(Name.length()) + "'. It should be '" +
1460 // Check parameter attributes.
1461 Assert1(F->getParamAttrs() == Intrinsic::getParamAttrs(ID),
1462 "Intrinsic has wrong parameter attributes!", F);
1466 //===----------------------------------------------------------------------===//
1467 // Implement the public interfaces to this file...
1468 //===----------------------------------------------------------------------===//
1470 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1471 return new Verifier(action);
1475 // verifyFunction - Create
1476 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1477 Function &F = const_cast<Function&>(f);
1478 assert(!F.isDeclaration() && "Cannot verify external functions");
1480 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
1481 Verifier *V = new Verifier(action);
1487 /// verifyModule - Check a module for errors, printing messages on stderr.
1488 /// Return true if the module is corrupt.
1490 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1491 std::string *ErrorInfo) {
1493 Verifier *V = new Verifier(action);
1497 if (ErrorInfo && V->Broken)
1498 *ErrorInfo = V->msgs.str();