1 //===-- Verifier.cpp - Implement the Module Verifier -------------*- C++ -*-==//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the function verifier interface, that can be used for some
11 // sanity checking of input to the system.
13 // Note that this does not provide full `Java style' security and verifications,
14 // instead it just tries to ensure that code is well-formed.
16 // * Both of a binary operator's parameters are of the same type
17 // * Verify that the indices of mem access instructions match other operands
18 // * Verify that arithmetic and other things are only performed on first-class
19 // types. Verify that shifts & logicals only happen on integrals f.e.
20 // * All of the constants in a switch statement are of the correct type
21 // * The code is in valid SSA form
22 // * It should be illegal to put a label into any other type (like a structure)
23 // or to return one. [except constant arrays!]
24 // * Only phi nodes can be self referential: 'add int %0, %0 ; <int>:0' is bad
25 // * PHI nodes must have an entry for each predecessor, with no extras.
26 // * PHI nodes must be the first thing in a basic block, all grouped together
27 // * PHI nodes must have at least one entry
28 // * All basic blocks should only end with terminator insts, not contain them
29 // * The entry node to a function must not have predecessors
30 // * All Instructions must be embedded into a basic block
31 // * Functions cannot take a void-typed parameter
32 // * Verify that a function's argument list agrees with it's declared type.
33 // * It is illegal to specify a name for a void value.
34 // * It is illegal to have a internal global value with no initializer
35 // * It is illegal to have a ret instruction that returns a value that does not
36 // agree with the function return value type.
37 // * Function call argument types match the function prototype
38 // * All other things that are tested by asserts spread about the code...
40 //===----------------------------------------------------------------------===//
42 #include "llvm/Analysis/Verifier.h"
43 #include "llvm/Assembly/Writer.h"
44 #include "llvm/CallingConv.h"
45 #include "llvm/Constants.h"
46 #include "llvm/Pass.h"
47 #include "llvm/Module.h"
48 #include "llvm/ModuleProvider.h"
49 #include "llvm/DerivedTypes.h"
50 #include "llvm/Instructions.h"
51 #include "llvm/Intrinsics.h"
52 #include "llvm/PassManager.h"
53 #include "llvm/SymbolTable.h"
54 #include "llvm/Analysis/Dominators.h"
55 #include "llvm/Support/CFG.h"
56 #include "llvm/Support/InstVisitor.h"
57 #include "llvm/ADT/STLExtras.h"
63 namespace { // Anonymous namespace for class
65 struct Verifier : public FunctionPass, InstVisitor<Verifier> {
66 bool Broken; // Is this module found to be broken?
67 bool RealPass; // Are we not being run by a PassManager?
68 VerifierFailureAction action;
69 // What to do if verification fails.
70 Module *Mod; // Module we are verifying right now
71 ETForest *EF; // ET-Forest, caution can be null!
72 std::stringstream msgs; // A stringstream to collect messages
74 /// InstInThisBlock - when verifying a basic block, keep track of all of the
75 /// instructions we have seen so far. This allows us to do efficient
76 /// dominance checks for the case when an instruction has an operand that is
77 /// an instruction in the same block.
78 std::set<Instruction*> InstsInThisBlock;
81 : Broken(false), RealPass(true), action(AbortProcessAction),
82 EF(0), msgs( std::ios::app | std::ios::out ) {}
83 Verifier( VerifierFailureAction ctn )
84 : Broken(false), RealPass(true), action(ctn), EF(0),
85 msgs( std::ios::app | std::ios::out ) {}
87 : Broken(false), RealPass(true),
88 action( AB ? AbortProcessAction : PrintMessageAction), EF(0),
89 msgs( std::ios::app | std::ios::out ) {}
90 Verifier(ETForest &ef)
91 : Broken(false), RealPass(false), action(PrintMessageAction),
92 EF(&ef), msgs( std::ios::app | std::ios::out ) {}
95 bool doInitialization(Module &M) {
97 verifySymbolTable(M.getSymbolTable());
99 // If this is a real pass, in a pass manager, we must abort before
100 // returning back to the pass manager, or else the pass manager may try to
101 // run other passes on the broken module.
107 bool runOnFunction(Function &F) {
108 // Get dominator information if we are being run by PassManager
109 if (RealPass) EF = &getAnalysis<ETForest>();
111 InstsInThisBlock.clear();
113 // If this is a real pass, in a pass manager, we must abort before
114 // returning back to the pass manager, or else the pass manager may try to
115 // run other passes on the broken module.
122 bool doFinalization(Module &M) {
123 // Scan through, checking all of the external function's linkage now...
124 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
125 visitGlobalValue(*I);
127 // Check to make sure function prototypes are okay.
128 if (I->isExternal()) visitFunction(*I);
131 for (Module::global_iterator I = M.global_begin(), E = M.global_end(); I != E; ++I)
132 visitGlobalVariable(*I);
134 // If the module is broken, abort at this time.
139 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
140 AU.setPreservesAll();
142 AU.addRequired<ETForest>();
145 /// abortIfBroken - If the module is broken and we are supposed to abort on
146 /// this condition, do so.
148 void abortIfBroken() {
151 msgs << "Broken module found, ";
154 case AbortProcessAction:
155 msgs << "compilation aborted!\n";
156 std::cerr << msgs.str();
158 case ThrowExceptionAction:
159 msgs << "verification terminated.\n";
161 case PrintMessageAction:
162 msgs << "verification continues.\n";
163 std::cerr << msgs.str();
165 case ReturnStatusAction:
172 // Verification methods...
173 void verifySymbolTable(SymbolTable &ST);
174 void visitGlobalValue(GlobalValue &GV);
175 void visitGlobalVariable(GlobalVariable &GV);
176 void visitFunction(Function &F);
177 void visitBasicBlock(BasicBlock &BB);
178 void visitPHINode(PHINode &PN);
179 void visitBinaryOperator(BinaryOperator &B);
180 void visitShiftInst(ShiftInst &SI);
181 void visitExtractElementInst(ExtractElementInst &EI);
182 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
183 void visitCallInst(CallInst &CI);
184 void visitGetElementPtrInst(GetElementPtrInst &GEP);
185 void visitLoadInst(LoadInst &LI);
186 void visitStoreInst(StoreInst &SI);
187 void visitInstruction(Instruction &I);
188 void visitTerminatorInst(TerminatorInst &I);
189 void visitReturnInst(ReturnInst &RI);
190 void visitSwitchInst(SwitchInst &SI);
191 void visitSelectInst(SelectInst &SI);
192 void visitUserOp1(Instruction &I);
193 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
194 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
197 void WriteValue(const Value *V) {
199 if (isa<Instruction>(V)) {
202 WriteAsOperand (msgs, V, true, true, Mod);
207 void WriteType(const Type* T ) {
209 WriteTypeSymbolic(msgs, T, Mod );
213 // CheckFailed - A check failed, so print out the condition and the message
214 // that failed. This provides a nice place to put a breakpoint if you want
215 // to see why something is not correct.
216 void CheckFailed(const std::string &Message,
217 const Value *V1 = 0, const Value *V2 = 0,
218 const Value *V3 = 0, const Value *V4 = 0) {
219 msgs << Message << "\n";
227 void CheckFailed( const std::string& Message, const Value* V1,
228 const Type* T2, const Value* V3 = 0 ) {
229 msgs << Message << "\n";
237 RegisterOpt<Verifier> X("verify", "Module Verifier");
238 } // End anonymous namespace
241 // Assert - We know that cond should be true, if not print an error message.
242 #define Assert(C, M) \
243 do { if (!(C)) { CheckFailed(M); return; } } while (0)
244 #define Assert1(C, M, V1) \
245 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
246 #define Assert2(C, M, V1, V2) \
247 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
248 #define Assert3(C, M, V1, V2, V3) \
249 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
250 #define Assert4(C, M, V1, V2, V3, V4) \
251 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
254 void Verifier::visitGlobalValue(GlobalValue &GV) {
255 Assert1(!GV.isExternal() || GV.hasExternalLinkage(),
256 "Global is external, but doesn't have external linkage!", &GV);
257 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
258 "Only global variables can have appending linkage!", &GV);
260 if (GV.hasAppendingLinkage()) {
261 GlobalVariable &GVar = cast<GlobalVariable>(GV);
262 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
263 "Only global arrays can have appending linkage!", &GV);
267 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
268 if (GV.hasInitializer())
269 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
270 "Global variable initializer type does not match global "
271 "variable type!", &GV);
273 visitGlobalValue(GV);
277 // verifySymbolTable - Verify that a function or module symbol table is ok
279 void Verifier::verifySymbolTable(SymbolTable &ST) {
281 // Loop over all of the values in all type planes in the symbol table.
282 for (SymbolTable::plane_const_iterator PI = ST.plane_begin(),
283 PE = ST.plane_end(); PI != PE; ++PI)
284 for (SymbolTable::value_const_iterator VI = PI->second.begin(),
285 VE = PI->second.end(); VI != VE; ++VI) {
286 Value *V = VI->second;
287 // Check that there are no void typed values in the symbol table. Values
288 // with a void type cannot be put into symbol tables because they cannot
290 Assert1(V->getType() != Type::VoidTy,
291 "Values with void type are not allowed to have names!", V);
295 // visitFunction - Verify that a function is ok.
297 void Verifier::visitFunction(Function &F) {
298 Assert1(!F.isVarArg() || F.getCallingConv() == CallingConv::C,
299 "Varargs functions must have C calling conventions!", &F);
301 // Check function arguments.
302 const FunctionType *FT = F.getFunctionType();
303 unsigned NumArgs = F.getArgumentList().size();
305 Assert2(FT->getNumParams() == NumArgs,
306 "# formal arguments must match # of arguments for function type!",
308 Assert1(F.getReturnType()->isFirstClassType() ||
309 F.getReturnType() == Type::VoidTy,
310 "Functions cannot return aggregate values!", &F);
312 // Check that the argument values match the function type for this function...
314 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I, ++i) {
315 Assert2(I->getType() == FT->getParamType(i),
316 "Argument value does not match function argument type!",
317 I, FT->getParamType(i));
318 // Make sure no aggregates are passed by value.
319 Assert1(I->getType()->isFirstClassType(),
320 "Functions cannot take aggregates as arguments by value!", I);
323 if (!F.isExternal()) {
324 verifySymbolTable(F.getSymbolTable());
326 // Check the entry node
327 BasicBlock *Entry = &F.getEntryBlock();
328 Assert1(pred_begin(Entry) == pred_end(Entry),
329 "Entry block to function must not have predecessors!", Entry);
334 // verifyBasicBlock - Verify that a basic block is well formed...
336 void Verifier::visitBasicBlock(BasicBlock &BB) {
337 InstsInThisBlock.clear();
339 // Ensure that basic blocks have terminators!
340 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
342 // Check constraints that this basic block imposes on all of the PHI nodes in
344 if (isa<PHINode>(BB.front())) {
345 std::vector<BasicBlock*> Preds(pred_begin(&BB), pred_end(&BB));
346 std::sort(Preds.begin(), Preds.end());
348 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
350 // Ensure that PHI nodes have at least one entry!
351 Assert1(PN->getNumIncomingValues() != 0,
352 "PHI nodes must have at least one entry. If the block is dead, "
353 "the PHI should be removed!", PN);
354 Assert1(PN->getNumIncomingValues() == Preds.size(),
355 "PHINode should have one entry for each predecessor of its "
356 "parent basic block!", PN);
358 // Get and sort all incoming values in the PHI node...
359 std::vector<std::pair<BasicBlock*, Value*> > Values;
360 Values.reserve(PN->getNumIncomingValues());
361 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
362 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
363 PN->getIncomingValue(i)));
364 std::sort(Values.begin(), Values.end());
366 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
367 // Check to make sure that if there is more than one entry for a
368 // particular basic block in this PHI node, that the incoming values are
371 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
372 Values[i].second == Values[i-1].second,
373 "PHI node has multiple entries for the same basic block with "
374 "different incoming values!", PN, Values[i].first,
375 Values[i].second, Values[i-1].second);
377 // Check to make sure that the predecessors and PHI node entries are
379 Assert3(Values[i].first == Preds[i],
380 "PHI node entries do not match predecessors!", PN,
381 Values[i].first, Preds[i]);
387 void Verifier::visitTerminatorInst(TerminatorInst &I) {
388 // Ensure that terminators only exist at the end of the basic block.
389 Assert1(&I == I.getParent()->getTerminator(),
390 "Terminator found in the middle of a basic block!", I.getParent());
394 void Verifier::visitReturnInst(ReturnInst &RI) {
395 Function *F = RI.getParent()->getParent();
396 if (RI.getNumOperands() == 0)
397 Assert2(F->getReturnType() == Type::VoidTy,
398 "Found return instr that returns void in Function of non-void "
399 "return type!", &RI, F->getReturnType());
401 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
402 "Function return type does not match operand "
403 "type of return inst!", &RI, F->getReturnType());
405 // Check to make sure that the return value has necessary properties for
407 visitTerminatorInst(RI);
410 void Verifier::visitSwitchInst(SwitchInst &SI) {
411 // Check to make sure that all of the constants in the switch instruction
412 // have the same type as the switched-on value.
413 const Type *SwitchTy = SI.getCondition()->getType();
414 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
415 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
416 "Switch constants must all be same type as switch value!", &SI);
418 visitTerminatorInst(SI);
421 void Verifier::visitSelectInst(SelectInst &SI) {
422 Assert1(SI.getCondition()->getType() == Type::BoolTy,
423 "Select condition type must be bool!", &SI);
424 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
425 "Select values must have identical types!", &SI);
426 Assert1(SI.getTrueValue()->getType() == SI.getType(),
427 "Select values must have same type as select instruction!", &SI);
428 visitInstruction(SI);
432 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
433 /// a pass, if any exist, it's an error.
435 void Verifier::visitUserOp1(Instruction &I) {
436 Assert1(0, "User-defined operators should not live outside of a pass!",
440 /// visitPHINode - Ensure that a PHI node is well formed.
442 void Verifier::visitPHINode(PHINode &PN) {
443 // Ensure that the PHI nodes are all grouped together at the top of the block.
444 // This can be tested by checking whether the instruction before this is
445 // either nonexistent (because this is begin()) or is a PHI node. If not,
446 // then there is some other instruction before a PHI.
447 Assert2(&PN.getParent()->front() == &PN || isa<PHINode>(PN.getPrev()),
448 "PHI nodes not grouped at top of basic block!",
449 &PN, PN.getParent());
451 // Check that all of the operands of the PHI node have the same type as the
453 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
454 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
455 "PHI node operands are not the same type as the result!", &PN);
457 // All other PHI node constraints are checked in the visitBasicBlock method.
459 visitInstruction(PN);
462 void Verifier::visitCallInst(CallInst &CI) {
463 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
464 "Called function must be a pointer!", &CI);
465 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
466 Assert1(isa<FunctionType>(FPTy->getElementType()),
467 "Called function is not pointer to function type!", &CI);
469 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
471 // Verify that the correct number of arguments are being passed
473 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
474 "Called function requires more parameters than were provided!",&CI);
476 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
477 "Incorrect number of arguments passed to called function!", &CI);
479 // Verify that all arguments to the call match the function type...
480 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
481 Assert3(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
482 "Call parameter type does not match function signature!",
483 CI.getOperand(i+1), FTy->getParamType(i), &CI);
485 if (Function *F = CI.getCalledFunction())
486 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
487 visitIntrinsicFunctionCall(ID, CI);
489 visitInstruction(CI);
492 /// visitBinaryOperator - Check that both arguments to the binary operator are
493 /// of the same type!
495 void Verifier::visitBinaryOperator(BinaryOperator &B) {
496 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
497 "Both operands to a binary operator are not of the same type!", &B);
499 // Check that logical operators are only used with integral operands.
500 if (B.getOpcode() == Instruction::And || B.getOpcode() == Instruction::Or ||
501 B.getOpcode() == Instruction::Xor) {
502 Assert1(B.getType()->isIntegral() ||
503 (isa<PackedType>(B.getType()) &&
504 cast<PackedType>(B.getType())->getElementType()->isIntegral()),
505 "Logical operators only work with integral types!", &B);
506 Assert1(B.getType() == B.getOperand(0)->getType(),
507 "Logical operators must have same type for operands and result!",
509 } else if (isa<SetCondInst>(B)) {
510 // Check that setcc instructions return bool
511 Assert1(B.getType() == Type::BoolTy,
512 "setcc instructions must return boolean values!", &B);
514 // Arithmetic operators only work on integer or fp values
515 Assert1(B.getType() == B.getOperand(0)->getType(),
516 "Arithmetic operators must have same type for operands and result!",
518 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint() ||
519 isa<PackedType>(B.getType()),
520 "Arithmetic operators must have integer, fp, or packed type!", &B);
526 void Verifier::visitShiftInst(ShiftInst &SI) {
527 Assert1(SI.getType()->isInteger(),
528 "Shift must return an integer result!", &SI);
529 Assert1(SI.getType() == SI.getOperand(0)->getType(),
530 "Shift return type must be same as first operand!", &SI);
531 Assert1(SI.getOperand(1)->getType() == Type::UByteTy,
532 "Second operand to shift must be ubyte type!", &SI);
533 visitInstruction(SI);
536 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
537 Assert1(isa<PackedType>(EI.getOperand(0)->getType()),
538 "First operand to extractelement must be packed type!", &EI);
539 Assert1(EI.getOperand(1)->getType() == Type::UIntTy,
540 "Second operand to extractelement must be uint type!", &EI);
541 Assert1(EI.getType() ==
542 cast<PackedType>(EI.getOperand(0)->getType())->getElementType(),
543 "Extractelement return type must be same as "
544 "first operand element type!", &EI);
545 visitInstruction(EI);
548 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
550 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
551 std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true);
552 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
553 Assert2(PointerType::get(ElTy) == GEP.getType(),
554 "GEP is not of right type for indices!", &GEP, ElTy);
555 visitInstruction(GEP);
558 void Verifier::visitLoadInst(LoadInst &LI) {
560 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
561 Assert2(ElTy == LI.getType(),
562 "Load result type does not match pointer operand type!", &LI, ElTy);
563 visitInstruction(LI);
566 void Verifier::visitStoreInst(StoreInst &SI) {
568 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
569 Assert2(ElTy == SI.getOperand(0)->getType(),
570 "Stored value type does not match pointer operand type!", &SI, ElTy);
571 visitInstruction(SI);
575 /// verifyInstruction - Verify that an instruction is well formed.
577 void Verifier::visitInstruction(Instruction &I) {
578 BasicBlock *BB = I.getParent();
579 Assert1(BB, "Instruction not embedded in basic block!", &I);
581 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
582 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
584 Assert1(*UI != (User*)&I ||
585 !EF->dominates(&BB->getParent()->getEntryBlock(), BB),
586 "Only PHI nodes may reference their own value!", &I);
589 // Check that void typed values don't have names
590 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
591 "Instruction has a name, but provides a void value!", &I);
593 // Check that the return value of the instruction is either void or a legal
595 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
596 "Instruction returns a non-scalar type!", &I);
598 // Check that all uses of the instruction, if they are instructions
599 // themselves, actually have parent basic blocks. If the use is not an
600 // instruction, it is an error!
601 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
603 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
605 Instruction *Used = cast<Instruction>(*UI);
606 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
607 " embeded in a basic block!", &I, Used);
610 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
611 // Check to make sure that the "address of" an intrinsic function is never
613 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
614 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
615 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
616 "Cannot take the address of an intrinsic!", &I);
617 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
618 Assert1(OpBB->getParent() == BB->getParent(),
619 "Referring to a basic block in another function!", &I);
620 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
621 Assert1(OpArg->getParent() == BB->getParent(),
622 "Referring to an argument in another function!", &I);
623 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
624 BasicBlock *OpBlock = Op->getParent();
626 // Check that a definition dominates all of its uses.
627 if (!isa<PHINode>(I)) {
628 // Invoke results are only usable in the normal destination, not in the
629 // exceptional destination.
630 if (InvokeInst *II = dyn_cast<InvokeInst>(Op))
631 OpBlock = II->getNormalDest();
632 else if (OpBlock == BB) {
633 // If they are in the same basic block, make sure that the definition
634 // comes before the use.
635 Assert2(InstsInThisBlock.count(Op) ||
636 !EF->dominates(&BB->getParent()->getEntryBlock(), BB),
637 "Instruction does not dominate all uses!", Op, &I);
640 // Definition must dominate use unless use is unreachable!
641 Assert2(EF->dominates(OpBlock, BB) ||
642 !EF->dominates(&BB->getParent()->getEntryBlock(), BB),
643 "Instruction does not dominate all uses!", Op, &I);
645 // PHI nodes are more difficult than other nodes because they actually
646 // "use" the value in the predecessor basic blocks they correspond to.
647 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
648 Assert2(EF->dominates(OpBlock, PredBB) ||
649 !EF->dominates(&BB->getParent()->getEntryBlock(), PredBB),
650 "Instruction does not dominate all uses!", Op, &I);
654 InstsInThisBlock.insert(&I);
657 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
659 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
660 Function *IF = CI.getCalledFunction();
661 const FunctionType *FT = IF->getFunctionType();
662 Assert1(IF->isExternal(), "Intrinsic functions should never be defined!", IF);
663 unsigned NumArgs = 0;
665 // FIXME: this should check the return type of each intrinsic as well, also
668 case Intrinsic::vastart:
669 Assert1(CI.getParent()->getParent()->getFunctionType()->isVarArg(),
670 "llvm.va_start intrinsic may only occur in function with variable"
674 case Intrinsic::vaend: NumArgs = 1; break;
675 case Intrinsic::vacopy: NumArgs = 2; break;
677 case Intrinsic::returnaddress:
678 case Intrinsic::frameaddress:
679 Assert1(isa<PointerType>(FT->getReturnType()),
680 "llvm.(frame|return)address must return pointers", IF);
681 Assert1(FT->getNumParams() == 1 && isa<ConstantInt>(CI.getOperand(1)),
682 "llvm.(frame|return)address require a single constant integer argument",
687 // Verify that read and write port have integral parameters of the correct
689 case Intrinsic::writeport:
690 Assert1(FT->getNumParams() == 2,
691 "Illegal # arguments for intrinsic function!", IF);
692 Assert1(FT->getParamType(0)->isIntegral(),
693 "First argument not unsigned int!", IF);
694 Assert1(FT->getParamType(1)->isUnsigned(),
695 "First argument not unsigned int!", IF);
699 case Intrinsic::writeio:
700 Assert1(FT->getNumParams() == 2,
701 "Illegal # arguments for intrinsic function!", IF);
702 Assert1(FT->getParamType(0)->isFirstClassType(),
703 "First argument not a first class type!", IF);
704 Assert1(isa<PointerType>(FT->getParamType(1)),
705 "Second argument not a pointer!", IF);
709 case Intrinsic::readport:
710 Assert1(FT->getNumParams() == 1,
711 "Illegal # arguments for intrinsic function!", IF);
712 Assert1(FT->getReturnType()->isFirstClassType(),
713 "Return type is not a first class type!", IF);
714 Assert1(FT->getParamType(0)->isUnsigned(),
715 "First argument not unsigned int!", IF);
719 case Intrinsic::readio: {
720 const PointerType *ParamType = dyn_cast<PointerType>(FT->getParamType(0));
721 const Type *ReturnType = FT->getReturnType();
723 Assert1(FT->getNumParams() == 1,
724 "Illegal # arguments for intrinsic function!", IF);
725 Assert1(ParamType, "First argument not a pointer!", IF);
726 Assert1(ParamType->getElementType() == ReturnType,
727 "Pointer type doesn't match return type!", IF);
732 case Intrinsic::isunordered:
733 Assert1(FT->getNumParams() == 2,
734 "Illegal # arguments for intrinsic function!", IF);
735 Assert1(FT->getReturnType() == Type::BoolTy,
736 "Return type is not bool!", IF);
737 Assert1(FT->getParamType(0) == FT->getParamType(1),
738 "Arguments must be of the same type!", IF);
739 Assert1(FT->getParamType(0)->isFloatingPoint(),
740 "Argument is not a floating point type!", IF);
744 case Intrinsic::readcyclecounter:
745 Assert1(FT->getNumParams() == 0,
746 "Illegal # arguments for intrinsic function!", IF);
747 Assert1(FT->getReturnType() == Type::ULongTy,
748 "Return type is not ulong!", IF);
752 case Intrinsic::ctpop:
753 case Intrinsic::ctlz:
754 case Intrinsic::cttz:
755 Assert1(FT->getNumParams() == 1,
756 "Illegal # arguments for intrinsic function!", IF);
757 Assert1(FT->getReturnType() == FT->getParamType(0),
758 "Return type does not match source type", IF);
759 Assert1(FT->getParamType(0)->isIntegral(),
760 "Argument must be of an int type!", IF);
764 case Intrinsic::sqrt:
765 Assert1(FT->getNumParams() == 1,
766 "Illegal # arguments for intrinsic function!", IF);
767 Assert1(FT->getParamType(0)->isFloatingPoint(),
768 "Argument is not a floating point type!", IF);
769 Assert1(FT->getReturnType() == FT->getParamType(0),
770 "Return type is not the same as argument type!", IF);
774 case Intrinsic::setjmp: NumArgs = 1; break;
775 case Intrinsic::longjmp: NumArgs = 2; break;
776 case Intrinsic::sigsetjmp: NumArgs = 2; break;
777 case Intrinsic::siglongjmp: NumArgs = 2; break;
779 case Intrinsic::gcroot:
780 Assert1(FT->getNumParams() == 2,
781 "Illegal # arguments for intrinsic function!", IF);
782 Assert1(isa<Constant>(CI.getOperand(2)),
783 "Second argument to llvm.gcroot must be a constant!", &CI);
786 case Intrinsic::gcread: NumArgs = 2; break;
787 case Intrinsic::gcwrite: NumArgs = 3; break;
789 case Intrinsic::dbg_stoppoint: NumArgs = 4; break;
790 case Intrinsic::dbg_region_start:NumArgs = 1; break;
791 case Intrinsic::dbg_region_end: NumArgs = 1; break;
792 case Intrinsic::dbg_func_start: NumArgs = 1; break;
793 case Intrinsic::dbg_declare: NumArgs = 1; break;
795 case Intrinsic::memcpy: NumArgs = 4; break;
796 case Intrinsic::memmove: NumArgs = 4; break;
797 case Intrinsic::memset: NumArgs = 4; break;
799 case Intrinsic::prefetch: NumArgs = 3; break;
800 case Intrinsic::pcmarker:
802 Assert1(isa<Constant>(CI.getOperand(1)),
803 "First argument to llvm.pcmarker must be a constant!", &CI);
806 case Intrinsic::not_intrinsic:
807 assert(0 && "Invalid intrinsic!"); NumArgs = 0; break;
810 Assert1(FT->getNumParams() == NumArgs || (FT->getNumParams() < NumArgs &&
812 "Illegal # arguments for intrinsic function!", IF);
816 //===----------------------------------------------------------------------===//
817 // Implement the public interfaces to this file...
818 //===----------------------------------------------------------------------===//
820 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
821 return new Verifier(action);
825 // verifyFunction - Create
826 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
827 Function &F = const_cast<Function&>(f);
828 assert(!F.isExternal() && "Cannot verify external functions");
830 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
831 Verifier *V = new Verifier(action);
837 /// verifyModule - Check a module for errors, printing messages on stderr.
838 /// Return true if the module is corrupt.
840 bool llvm::verifyModule(const Module &M, VerifierFailureAction action) {
842 Verifier *V = new Verifier(action);