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/Constants.h"
45 #include "llvm/Pass.h"
46 #include "llvm/Module.h"
47 #include "llvm/ModuleProvider.h"
48 #include "llvm/DerivedTypes.h"
49 #include "llvm/Instructions.h"
50 #include "llvm/Intrinsics.h"
51 #include "llvm/PassManager.h"
52 #include "llvm/SymbolTable.h"
53 #include "llvm/Analysis/Dominators.h"
54 #include "llvm/Support/CFG.h"
55 #include "llvm/Support/InstVisitor.h"
56 #include "llvm/ADT/STLExtras.h"
62 namespace { // Anonymous namespace for class
64 struct Verifier : public FunctionPass, InstVisitor<Verifier> {
65 bool Broken; // Is this module found to be broken?
66 bool RealPass; // Are we not being run by a PassManager?
67 VerifierFailureAction action;
68 // What to do if verification fails.
69 Module *Mod; // Module we are verifying right now
70 DominatorSet *DS; // Dominator set, caution can be null!
71 std::stringstream msgs; // A stringstream to collect messages
73 /// InstInThisBlock - when verifying a basic block, keep track of all of the
74 /// instructions we have seen so far. This allows us to do efficient
75 /// dominance checks for the case when an instruction has an operand that is
76 /// an instruction in the same block.
77 std::set<Instruction*> InstsInThisBlock;
80 : Broken(false), RealPass(true), action(AbortProcessAction),
81 DS(0), msgs( std::ios_base::app | std::ios_base::out ) {}
82 Verifier( VerifierFailureAction ctn )
83 : Broken(false), RealPass(true), action(ctn), DS(0),
84 msgs( std::ios_base::app | std::ios_base::out ) {}
86 : Broken(false), RealPass(true),
87 action( AB ? AbortProcessAction : PrintMessageAction), DS(0),
88 msgs( std::ios_base::app | std::ios_base::out ) {}
89 Verifier(DominatorSet &ds)
90 : Broken(false), RealPass(false), action(PrintMessageAction),
91 DS(&ds), msgs( std::ios_base::app | std::ios_base::out ) {}
94 bool doInitialization(Module &M) {
96 verifySymbolTable(M.getSymbolTable());
98 // If this is a real pass, in a pass manager, we must abort before
99 // returning back to the pass manager, or else the pass manager may try to
100 // run other passes on the broken module.
106 bool runOnFunction(Function &F) {
107 // Get dominator information if we are being run by PassManager
108 if (RealPass) DS = &getAnalysis<DominatorSet>();
110 InstsInThisBlock.clear();
112 // If this is a real pass, in a pass manager, we must abort before
113 // returning back to the pass manager, or else the pass manager may try to
114 // run other passes on the broken module.
121 bool doFinalization(Module &M) {
122 // Scan through, checking all of the external function's linkage now...
123 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
124 visitGlobalValue(*I);
126 // Check to make sure function prototypes are okay.
127 if (I->isExternal()) visitFunction(*I);
130 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
131 visitGlobalValue(*I);
133 // If the module is broken, abort at this time.
138 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
139 AU.setPreservesAll();
141 AU.addRequired<DominatorSet>();
144 /// abortIfBroken - If the module is broken and we are supposed to abort on
145 /// this condition, do so.
147 void abortIfBroken() {
150 msgs << "Broken module found, ";
153 case AbortProcessAction:
154 msgs << "compilation aborted!\n";
155 std::cerr << msgs.str();
157 case ThrowExceptionAction:
158 msgs << "verification terminated.\n";
160 case PrintMessageAction:
161 msgs << "verification continues.\n";
162 std::cerr << msgs.str();
164 case ReturnStatusAction:
171 // Verification methods...
172 void verifySymbolTable(SymbolTable &ST);
173 void visitGlobalValue(GlobalValue &GV);
174 void visitFunction(Function &F);
175 void visitBasicBlock(BasicBlock &BB);
176 void visitPHINode(PHINode &PN);
177 void visitBinaryOperator(BinaryOperator &B);
178 void visitShiftInst(ShiftInst &SI);
179 void visitVANextInst(VANextInst &VAN) { visitInstruction(VAN); }
180 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
181 void visitCallInst(CallInst &CI);
182 void visitGetElementPtrInst(GetElementPtrInst &GEP);
183 void visitLoadInst(LoadInst &LI);
184 void visitStoreInst(StoreInst &SI);
185 void visitInstruction(Instruction &I);
186 void visitTerminatorInst(TerminatorInst &I);
187 void visitReturnInst(ReturnInst &RI);
188 void visitSwitchInst(SwitchInst &SI);
189 void visitSelectInst(SelectInst &SI);
190 void visitUserOp1(Instruction &I);
191 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
192 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
195 void WriteValue(const Value *V) {
197 if (isa<Instruction>(V)) {
200 WriteAsOperand (msgs, V, true, true, Mod);
205 void WriteType(const Type* T ) {
207 WriteTypeSymbolic(msgs, T, Mod );
211 // CheckFailed - A check failed, so print out the condition and the message
212 // that failed. This provides a nice place to put a breakpoint if you want
213 // to see why something is not correct.
214 void CheckFailed(const std::string &Message,
215 const Value *V1 = 0, const Value *V2 = 0,
216 const Value *V3 = 0, const Value *V4 = 0) {
217 msgs << Message << "\n";
225 void CheckFailed( const std::string& Message, const Value* V1,
226 const Type* T2, const Value* V3 = 0 ) {
227 msgs << Message << "\n";
235 RegisterOpt<Verifier> X("verify", "Module Verifier");
236 } // End anonymous namespace
239 // Assert - We know that cond should be true, if not print an error message.
240 #define Assert(C, M) \
241 do { if (!(C)) { CheckFailed(M); return; } } while (0)
242 #define Assert1(C, M, V1) \
243 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
244 #define Assert2(C, M, V1, V2) \
245 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
246 #define Assert3(C, M, V1, V2, V3) \
247 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
248 #define Assert4(C, M, V1, V2, V3, V4) \
249 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
252 void Verifier::visitGlobalValue(GlobalValue &GV) {
253 Assert1(!GV.isExternal() || GV.hasExternalLinkage(),
254 "Global is external, but doesn't have external linkage!", &GV);
255 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
256 "Only global variables can have appending linkage!", &GV);
258 if (GV.hasAppendingLinkage()) {
259 GlobalVariable &GVar = cast<GlobalVariable>(GV);
260 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
261 "Only global arrays can have appending linkage!", &GV);
265 // verifySymbolTable - Verify that a function or module symbol table is ok
267 void Verifier::verifySymbolTable(SymbolTable &ST) {
269 // Loop over all of the values in all type planes in the symbol table.
270 for (SymbolTable::plane_const_iterator PI = ST.plane_begin(),
271 PE = ST.plane_end(); PI != PE; ++PI)
272 for (SymbolTable::value_const_iterator VI = PI->second.begin(),
273 VE = PI->second.end(); VI != VE; ++VI) {
274 Value *V = VI->second;
275 // Check that there are no void typed values in the symbol table. Values
276 // with a void type cannot be put into symbol tables because they cannot
278 Assert1(V->getType() != Type::VoidTy,
279 "Values with void type are not allowed to have names!", V);
283 // visitFunction - Verify that a function is ok.
285 void Verifier::visitFunction(Function &F) {
286 // Check function arguments...
287 const FunctionType *FT = F.getFunctionType();
288 unsigned NumArgs = F.getArgumentList().size();
290 Assert2(FT->getNumParams() == NumArgs,
291 "# formal arguments must match # of arguments for function type!",
293 Assert1(F.getReturnType()->isFirstClassType() ||
294 F.getReturnType() == Type::VoidTy,
295 "Functions cannot return aggregate values!", &F);
297 // Check that the argument values match the function type for this function...
299 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I, ++i) {
300 Assert2(I->getType() == FT->getParamType(i),
301 "Argument value does not match function argument type!",
302 I, FT->getParamType(i));
303 // Make sure no aggregates are passed by value.
304 Assert1(I->getType()->isFirstClassType(),
305 "Functions cannot take aggregates as arguments by value!", I);
308 if (!F.isExternal()) {
309 verifySymbolTable(F.getSymbolTable());
311 // Check the entry node
312 BasicBlock *Entry = &F.getEntryBlock();
313 Assert1(pred_begin(Entry) == pred_end(Entry),
314 "Entry block to function must not have predecessors!", Entry);
319 // verifyBasicBlock - Verify that a basic block is well formed...
321 void Verifier::visitBasicBlock(BasicBlock &BB) {
322 InstsInThisBlock.clear();
324 // Check constraints that this basic block imposes on all of the PHI nodes in
326 if (isa<PHINode>(BB.front())) {
327 std::vector<BasicBlock*> Preds(pred_begin(&BB), pred_end(&BB));
328 std::sort(Preds.begin(), Preds.end());
330 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
332 // Ensure that PHI nodes have at least one entry!
333 Assert1(PN->getNumIncomingValues() != 0,
334 "PHI nodes must have at least one entry. If the block is dead, "
335 "the PHI should be removed!", PN);
336 Assert1(PN->getNumIncomingValues() == Preds.size(),
337 "PHINode should have one entry for each predecessor of its "
338 "parent basic block!", PN);
340 // Get and sort all incoming values in the PHI node...
341 std::vector<std::pair<BasicBlock*, Value*> > Values;
342 Values.reserve(PN->getNumIncomingValues());
343 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
344 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
345 PN->getIncomingValue(i)));
346 std::sort(Values.begin(), Values.end());
348 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
349 // Check to make sure that if there is more than one entry for a
350 // particular basic block in this PHI node, that the incoming values are
353 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
354 Values[i].second == Values[i-1].second,
355 "PHI node has multiple entries for the same basic block with "
356 "different incoming values!", PN, Values[i].first,
357 Values[i].second, Values[i-1].second);
359 // Check to make sure that the predecessors and PHI node entries are
361 Assert3(Values[i].first == Preds[i],
362 "PHI node entries do not match predecessors!", PN,
363 Values[i].first, Preds[i]);
368 // Ensure that basic blocks have terminators!
369 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
372 void Verifier::visitTerminatorInst(TerminatorInst &I) {
373 // Ensure that terminators only exist at the end of the basic block.
374 Assert1(&I == I.getParent()->getTerminator(),
375 "Terminator found in the middle of a basic block!", I.getParent());
379 void Verifier::visitReturnInst(ReturnInst &RI) {
380 Function *F = RI.getParent()->getParent();
381 if (RI.getNumOperands() == 0)
382 Assert1(F->getReturnType() == Type::VoidTy,
383 "Function returns no value, but ret instruction found that does!",
386 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
387 "Function return type does not match operand "
388 "type of return inst!", &RI, F->getReturnType());
390 // Check to make sure that the return value has necessary properties for
392 visitTerminatorInst(RI);
395 void Verifier::visitSwitchInst(SwitchInst &SI) {
396 // Check to make sure that all of the constants in the switch instruction
397 // have the same type as the switched-on value.
398 const Type *SwitchTy = SI.getCondition()->getType();
399 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
400 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
401 "Switch constants must all be same type as switch value!", &SI);
403 visitTerminatorInst(SI);
406 void Verifier::visitSelectInst(SelectInst &SI) {
407 Assert1(SI.getCondition()->getType() == Type::BoolTy,
408 "Select condition type must be bool!", &SI);
409 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
410 "Select values must have identical types!", &SI);
411 Assert1(SI.getTrueValue()->getType() == SI.getType(),
412 "Select values must have same type as select instruction!", &SI);
413 visitInstruction(SI);
417 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
418 /// a pass, if any exist, it's an error.
420 void Verifier::visitUserOp1(Instruction &I) {
421 Assert1(0, "User-defined operators should not live outside of a pass!",
425 /// visitPHINode - Ensure that a PHI node is well formed.
427 void Verifier::visitPHINode(PHINode &PN) {
428 // Ensure that the PHI nodes are all grouped together at the top of the block.
429 // This can be tested by checking whether the instruction before this is
430 // either nonexistent (because this is begin()) or is a PHI node. If not,
431 // then there is some other instruction before a PHI.
432 Assert2(&PN.getParent()->front() == &PN || isa<PHINode>(PN.getPrev()),
433 "PHI nodes not grouped at top of basic block!",
434 &PN, PN.getParent());
436 // Check that all of the operands of the PHI node have the same type as the
438 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
439 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
440 "PHI node operands are not the same type as the result!", &PN);
442 // All other PHI node constraints are checked in the visitBasicBlock method.
444 visitInstruction(PN);
447 void Verifier::visitCallInst(CallInst &CI) {
448 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
449 "Called function must be a pointer!", &CI);
450 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
451 Assert1(isa<FunctionType>(FPTy->getElementType()),
452 "Called function is not pointer to function type!", &CI);
454 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
456 // Verify that the correct number of arguments are being passed
458 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
459 "Called function requires more parameters than were provided!",&CI);
461 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
462 "Incorrect number of arguments passed to called function!", &CI);
464 // Verify that all arguments to the call match the function type...
465 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
466 Assert3(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
467 "Call parameter type does not match function signature!",
468 CI.getOperand(i+1), FTy->getParamType(i), &CI);
470 if (Function *F = CI.getCalledFunction())
471 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
472 visitIntrinsicFunctionCall(ID, CI);
474 visitInstruction(CI);
477 /// visitBinaryOperator - Check that both arguments to the binary operator are
478 /// of the same type!
480 void Verifier::visitBinaryOperator(BinaryOperator &B) {
481 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
482 "Both operands to a binary operator are not of the same type!", &B);
484 // Check that logical operators are only used with integral operands.
485 if (B.getOpcode() == Instruction::And || B.getOpcode() == Instruction::Or ||
486 B.getOpcode() == Instruction::Xor) {
487 Assert1(B.getType()->isIntegral(),
488 "Logical operators only work with integral types!", &B);
489 Assert1(B.getType() == B.getOperand(0)->getType(),
490 "Logical operators must have same type for operands and result!",
492 } else if (isa<SetCondInst>(B)) {
493 // Check that setcc instructions return bool
494 Assert1(B.getType() == Type::BoolTy,
495 "setcc instructions must return boolean values!", &B);
497 // Arithmetic operators only work on integer or fp values
498 Assert1(B.getType() == B.getOperand(0)->getType(),
499 "Arithmetic operators must have same type for operands and result!",
501 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint() ||
502 isa<PackedType>(B.getType()),
503 "Arithmetic operators must have integer, fp, or packed type!", &B);
509 void Verifier::visitShiftInst(ShiftInst &SI) {
510 Assert1(SI.getType()->isInteger(),
511 "Shift must return an integer result!", &SI);
512 Assert1(SI.getType() == SI.getOperand(0)->getType(),
513 "Shift return type must be same as first operand!", &SI);
514 Assert1(SI.getOperand(1)->getType() == Type::UByteTy,
515 "Second operand to shift must be ubyte type!", &SI);
516 visitInstruction(SI);
519 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
521 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
522 std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true);
523 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
524 Assert2(PointerType::get(ElTy) == GEP.getType(),
525 "GEP is not of right type for indices!", &GEP, ElTy);
526 visitInstruction(GEP);
529 void Verifier::visitLoadInst(LoadInst &LI) {
531 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
532 Assert2(ElTy == LI.getType(),
533 "Load result type does not match pointer operand type!", &LI, ElTy);
534 visitInstruction(LI);
537 void Verifier::visitStoreInst(StoreInst &SI) {
539 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
540 Assert2(ElTy == SI.getOperand(0)->getType(),
541 "Stored value type does not match pointer operand type!", &SI, ElTy);
542 visitInstruction(SI);
546 /// verifyInstruction - Verify that an instruction is well formed.
548 void Verifier::visitInstruction(Instruction &I) {
549 BasicBlock *BB = I.getParent();
550 Assert1(BB, "Instruction not embedded in basic block!", &I);
552 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
553 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
555 Assert1(*UI != (User*)&I ||
556 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
557 "Only PHI nodes may reference their own value!", &I);
560 // Check that void typed values don't have names
561 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
562 "Instruction has a name, but provides a void value!", &I);
564 // Check that the return value of the instruction is either void or a legal
566 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
567 "Instruction returns a non-scalar type!", &I);
569 // Check that all uses of the instruction, if they are instructions
570 // themselves, actually have parent basic blocks. If the use is not an
571 // instruction, it is an error!
572 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
574 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
576 Instruction *Used = cast<Instruction>(*UI);
577 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
578 " embeded in a basic block!", &I, Used);
581 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
582 // Check to make sure that the "address of" an intrinsic function is never
584 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
585 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
586 "Cannot take the address of an intrinsic!", &I);
587 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
588 Assert1(OpBB->getParent() == BB->getParent(),
589 "Referring to a basic block in another function!", &I);
590 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
591 Assert1(OpArg->getParent() == BB->getParent(),
592 "Referring to an argument in another function!", &I);
593 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
594 BasicBlock *OpBlock = Op->getParent();
596 // Check that a definition dominates all of its uses.
597 if (!isa<PHINode>(I)) {
598 // Invoke results are only usable in the normal destination, not in the
599 // exceptional destination.
600 if (InvokeInst *II = dyn_cast<InvokeInst>(Op))
601 OpBlock = II->getNormalDest();
602 else if (OpBlock == BB) {
603 // If they are in the same basic block, make sure that the definition
604 // comes before the use.
605 Assert2(InstsInThisBlock.count(Op) ||
606 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
607 "Instruction does not dominate all uses!", Op, &I);
610 // Definition must dominate use unless use is unreachable!
611 Assert2(DS->dominates(OpBlock, BB) ||
612 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
613 "Instruction does not dominate all uses!", Op, &I);
615 // PHI nodes are more difficult than other nodes because they actually
616 // "use" the value in the predecessor basic blocks they correspond to.
617 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
618 Assert2(DS->dominates(OpBlock, PredBB) ||
619 !DS->dominates(&BB->getParent()->getEntryBlock(), PredBB),
620 "Instruction does not dominate all uses!", Op, &I);
624 InstsInThisBlock.insert(&I);
627 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
629 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
630 Function *IF = CI.getCalledFunction();
631 const FunctionType *FT = IF->getFunctionType();
632 Assert1(IF->isExternal(), "Intrinsic functions should never be defined!", IF);
633 unsigned NumArgs = 0;
635 // FIXME: this should check the return type of each intrinsic as well, also
638 case Intrinsic::vastart:
639 Assert1(CI.getParent()->getParent()->getFunctionType()->isVarArg(),
640 "llvm.va_start intrinsic may only occur in function with variable"
644 case Intrinsic::vaend: NumArgs = 1; break;
645 case Intrinsic::vacopy: NumArgs = 1; break;
647 case Intrinsic::returnaddress:
648 case Intrinsic::frameaddress:
649 Assert1(isa<PointerType>(FT->getReturnType()),
650 "llvm.(frame|return)address must return pointers", IF);
651 Assert1(FT->getNumParams() == 1 && isa<ConstantInt>(CI.getOperand(1)),
652 "llvm.(frame|return)address require a single constant integer argument",
657 // Verify that read and write port have integral parameters of the correct
659 case Intrinsic::writeport:
660 Assert1(FT->getNumParams() == 2,
661 "Illegal # arguments for intrinsic function!", IF);
662 Assert1(FT->getParamType(0)->isIntegral(),
663 "First argument not unsigned int!", IF);
664 Assert1(FT->getParamType(1)->isUnsigned(),
665 "First argument not unsigned int!", IF);
669 case Intrinsic::writeio:
670 Assert1(FT->getNumParams() == 2,
671 "Illegal # arguments for intrinsic function!", IF);
672 Assert1(FT->getParamType(0)->isFirstClassType(),
673 "First argument not a first class type!", IF);
674 Assert1(isa<PointerType>(FT->getParamType(1)),
675 "Second argument not a pointer!", IF);
679 case Intrinsic::readport:
680 Assert1(FT->getNumParams() == 1,
681 "Illegal # arguments for intrinsic function!", IF);
682 Assert1(FT->getReturnType()->isFirstClassType(),
683 "Return type is not a first class type!", IF);
684 Assert1(FT->getParamType(0)->isUnsigned(),
685 "First argument not unsigned int!", IF);
689 case Intrinsic::readio: {
690 const PointerType *ParamType = dyn_cast<PointerType>(FT->getParamType(0));
691 const Type *ReturnType = FT->getReturnType();
693 Assert1(FT->getNumParams() == 1,
694 "Illegal # arguments for intrinsic function!", IF);
695 Assert1(ParamType, "First argument not a pointer!", IF);
696 Assert1(ParamType->getElementType() == ReturnType,
697 "Pointer type doesn't match return type!", IF);
702 case Intrinsic::isunordered:
703 Assert1(FT->getNumParams() == 2,
704 "Illegal # arguments for intrinsic function!", IF);
705 Assert1(FT->getReturnType() == Type::BoolTy,
706 "Return type is not bool!", IF);
707 Assert1(FT->getParamType(0) == FT->getParamType(1),
708 "Arguments must be of the same type!", IF);
709 Assert1(FT->getParamType(0)->isFloatingPoint(),
710 "Argument is not a floating point type!", IF);
714 case Intrinsic::setjmp: NumArgs = 1; break;
715 case Intrinsic::longjmp: NumArgs = 2; break;
716 case Intrinsic::sigsetjmp: NumArgs = 2; break;
717 case Intrinsic::siglongjmp: NumArgs = 2; break;
719 case Intrinsic::gcroot:
720 Assert1(FT->getNumParams() == 2,
721 "Illegal # arguments for intrinsic function!", IF);
722 Assert1(isa<Constant>(CI.getOperand(2)),
723 "Second argument to llvm.gcroot must be a constant!", &CI);
726 case Intrinsic::gcread: NumArgs = 2; break;
727 case Intrinsic::gcwrite: NumArgs = 3; break;
729 case Intrinsic::dbg_stoppoint: NumArgs = 4; break;
730 case Intrinsic::dbg_region_start:NumArgs = 1; break;
731 case Intrinsic::dbg_region_end: NumArgs = 1; break;
732 case Intrinsic::dbg_func_start: NumArgs = 1; break;
733 case Intrinsic::dbg_declare: NumArgs = 1; break;
735 case Intrinsic::memcpy: NumArgs = 4; break;
736 case Intrinsic::memmove: NumArgs = 4; break;
737 case Intrinsic::memset: NumArgs = 4; break;
739 case Intrinsic::not_intrinsic:
740 assert(0 && "Invalid intrinsic!"); NumArgs = 0; break;
743 Assert1(FT->getNumParams() == NumArgs || (FT->getNumParams() < NumArgs &&
745 "Illegal # arguments for intrinsic function!", IF);
749 //===----------------------------------------------------------------------===//
750 // Implement the public interfaces to this file...
751 //===----------------------------------------------------------------------===//
753 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
754 return new Verifier(action);
758 // verifyFunction - Create
759 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
760 Function &F = const_cast<Function&>(f);
761 assert(!F.isExternal() && "Cannot verify external functions");
763 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
764 Verifier *V = new Verifier(action);
770 /// verifyModule - Check a module for errors, printing messages on stderr.
771 /// Return true if the module is corrupt.
773 bool llvm::verifyModule(const Module &M, VerifierFailureAction action) {
775 Verifier *V = new Verifier(action);