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 "Support/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
74 : Broken(false), RealPass(true), action(AbortProcessAction),
75 DS(0), msgs( std::ios_base::app | std::ios_base::out ) {}
76 Verifier( VerifierFailureAction ctn )
77 : Broken(false), RealPass(true), action(ctn), DS(0),
78 msgs( std::ios_base::app | std::ios_base::out ) {}
80 : Broken(false), RealPass(true),
81 action( AB ? AbortProcessAction : PrintMessageAction), DS(0),
82 msgs( std::ios_base::app | std::ios_base::out ) {}
83 Verifier(DominatorSet &ds)
84 : Broken(false), RealPass(false), action(PrintMessageAction),
85 DS(&ds), msgs( std::ios_base::app | std::ios_base::out ) {}
88 bool doInitialization(Module &M) {
90 verifySymbolTable(M.getSymbolTable());
92 // If this is a real pass, in a pass manager, we must abort before
93 // returning back to the pass manager, or else the pass manager may try to
94 // run other passes on the broken module.
100 bool runOnFunction(Function &F) {
101 // Get dominator information if we are being run by PassManager
102 if (RealPass) DS = &getAnalysis<DominatorSet>();
105 // If this is a real pass, in a pass manager, we must abort before
106 // returning back to the pass manager, or else the pass manager may try to
107 // run other passes on the broken module.
114 bool doFinalization(Module &M) {
115 // Scan through, checking all of the external function's linkage now...
116 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
117 visitGlobalValue(*I);
119 // Check to make sure function prototypes are okay.
120 if (I->isExternal()) visitFunction(*I);
123 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
124 visitGlobalValue(*I);
128 // If the module is broken, abort at this time.
133 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
134 AU.setPreservesAll();
136 AU.addRequired<DominatorSet>();
139 /// abortIfBroken - If the module is broken and we are supposed to abort on
140 /// this condition, do so.
142 void abortIfBroken() {
145 msgs << "Broken module found, ";
148 case AbortProcessAction:
149 msgs << "compilation aborted!\n";
150 std::cerr << msgs.str();
152 case ThrowExceptionAction:
153 msgs << "verification terminated.\n";
155 case PrintMessageAction:
156 msgs << "verification continues.\n";
157 std::cerr << msgs.str();
159 case ReturnStatusAction:
166 // Verification methods...
167 void verifySymbolTable(SymbolTable &ST);
168 void visitGlobalValue(GlobalValue &GV);
169 void visitFunction(Function &F);
170 void visitBasicBlock(BasicBlock &BB);
171 void visitPHINode(PHINode &PN);
172 void visitBinaryOperator(BinaryOperator &B);
173 void visitShiftInst(ShiftInst &SI);
174 void visitVANextInst(VANextInst &VAN) { visitInstruction(VAN); }
175 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
176 void visitCallInst(CallInst &CI);
177 void visitGetElementPtrInst(GetElementPtrInst &GEP);
178 void visitLoadInst(LoadInst &LI);
179 void visitStoreInst(StoreInst &SI);
180 void visitInstruction(Instruction &I);
181 void visitTerminatorInst(TerminatorInst &I);
182 void visitReturnInst(ReturnInst &RI);
183 void visitSwitchInst(SwitchInst &SI);
184 void visitSelectInst(SelectInst &SI);
185 void visitUserOp1(Instruction &I);
186 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
187 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
190 void WriteValue(const Value *V) {
192 if (isa<Instruction>(V)) {
195 WriteAsOperand (msgs, V, true, true, Mod);
200 void WriteType(const Type* T ) {
202 WriteTypeSymbolic(msgs, T, Mod );
206 // CheckFailed - A check failed, so print out the condition and the message
207 // that failed. This provides a nice place to put a breakpoint if you want
208 // to see why something is not correct.
209 void CheckFailed(const std::string &Message,
210 const Value *V1 = 0, const Value *V2 = 0,
211 const Value *V3 = 0, const Value *V4 = 0) {
212 msgs << Message << "\n";
220 void CheckFailed( const std::string& Message, const Value* V1,
221 const Type* T2, const Value* V3 = 0 ) {
222 msgs << Message << "\n";
230 RegisterOpt<Verifier> X("verify", "Module Verifier");
231 } // End anonymous namespace
234 // Assert - We know that cond should be true, if not print an error message.
235 #define Assert(C, M) \
236 do { if (!(C)) { CheckFailed(M); return; } } while (0)
237 #define Assert1(C, M, V1) \
238 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
239 #define Assert2(C, M, V1, V2) \
240 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
241 #define Assert3(C, M, V1, V2, V3) \
242 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
243 #define Assert4(C, M, V1, V2, V3, V4) \
244 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
247 void Verifier::visitGlobalValue(GlobalValue &GV) {
248 Assert1(!GV.isExternal() || GV.hasExternalLinkage(),
249 "Global is external, but doesn't have external linkage!", &GV);
250 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
251 "Only global variables can have appending linkage!", &GV);
253 if (GV.hasAppendingLinkage()) {
254 GlobalVariable &GVar = cast<GlobalVariable>(GV);
255 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
256 "Only global arrays can have appending linkage!", &GV);
260 // verifySymbolTable - Verify that a function or module symbol table is ok
262 void Verifier::verifySymbolTable(SymbolTable &ST) {
264 // Loop over all of the values in all type planes in the symbol table.
265 for (SymbolTable::plane_const_iterator PI = ST.plane_begin(),
266 PE = ST.plane_end(); PI != PE; ++PI)
267 for (SymbolTable::value_const_iterator VI = PI->second.begin(),
268 VE = PI->second.end(); VI != VE; ++VI) {
269 Value *V = VI->second;
270 // Check that there are no void typed values in the symbol table. Values
271 // with a void type cannot be put into symbol tables because they cannot
273 Assert1(V->getType() != Type::VoidTy,
274 "Values with void type are not allowed to have names!", V);
278 // visitFunction - Verify that a function is ok.
280 void Verifier::visitFunction(Function &F) {
281 // Check function arguments...
282 const FunctionType *FT = F.getFunctionType();
283 unsigned NumArgs = F.getArgumentList().size();
285 Assert2(FT->getNumParams() == NumArgs,
286 "# formal arguments must match # of arguments for function type!",
288 Assert1(F.getReturnType()->isFirstClassType() ||
289 F.getReturnType() == Type::VoidTy,
290 "Functions cannot return aggregate values!", &F);
292 // Check that the argument values match the function type for this function...
294 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I, ++i) {
295 Assert2(I->getType() == FT->getParamType(i),
296 "Argument value does not match function argument type!",
297 I, FT->getParamType(i));
298 // Make sure no aggregates are passed by value.
299 Assert1(I->getType()->isFirstClassType(),
300 "Functions cannot take aggregates as arguments by value!", I);
303 if (!F.isExternal()) {
304 verifySymbolTable(F.getSymbolTable());
306 // Check the entry node
307 BasicBlock *Entry = &F.getEntryBlock();
308 Assert1(pred_begin(Entry) == pred_end(Entry),
309 "Entry block to function must not have predecessors!", Entry);
314 // verifyBasicBlock - Verify that a basic block is well formed...
316 void Verifier::visitBasicBlock(BasicBlock &BB) {
317 // Check constraints that this basic block imposes on all of the PHI nodes in
319 if (isa<PHINode>(BB.front())) {
320 std::vector<BasicBlock*> Preds(pred_begin(&BB), pred_end(&BB));
321 std::sort(Preds.begin(), Preds.end());
323 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
325 // Ensure that PHI nodes have at least one entry!
326 Assert1(PN->getNumIncomingValues() != 0,
327 "PHI nodes must have at least one entry. If the block is dead, "
328 "the PHI should be removed!", PN);
329 Assert1(PN->getNumIncomingValues() == Preds.size(),
330 "PHINode should have one entry for each predecessor of its "
331 "parent basic block!", PN);
333 // Get and sort all incoming values in the PHI node...
334 std::vector<std::pair<BasicBlock*, Value*> > Values;
335 Values.reserve(PN->getNumIncomingValues());
336 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
337 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
338 PN->getIncomingValue(i)));
339 std::sort(Values.begin(), Values.end());
341 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
342 // Check to make sure that if there is more than one entry for a
343 // particular basic block in this PHI node, that the incoming values are
346 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
347 Values[i].second == Values[i-1].second,
348 "PHI node has multiple entries for the same basic block with "
349 "different incoming values!", PN, Values[i].first,
350 Values[i].second, Values[i-1].second);
352 // Check to make sure that the predecessors and PHI node entries are
354 Assert3(Values[i].first == Preds[i],
355 "PHI node entries do not match predecessors!", PN,
356 Values[i].first, Preds[i]);
361 // Ensure that basic blocks have terminators!
362 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
365 void Verifier::visitTerminatorInst(TerminatorInst &I) {
366 // Ensure that terminators only exist at the end of the basic block.
367 Assert1(&I == I.getParent()->getTerminator(),
368 "Terminator found in the middle of a basic block!", I.getParent());
372 void Verifier::visitReturnInst(ReturnInst &RI) {
373 Function *F = RI.getParent()->getParent();
374 if (RI.getNumOperands() == 0)
375 Assert1(F->getReturnType() == Type::VoidTy,
376 "Function returns no value, but ret instruction found that does!",
379 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
380 "Function return type does not match operand "
381 "type of return inst!", &RI, F->getReturnType());
383 // Check to make sure that the return value has necessary properties for
385 visitTerminatorInst(RI);
388 void Verifier::visitSwitchInst(SwitchInst &SI) {
389 // Check to make sure that all of the constants in the switch instruction
390 // have the same type as the switched-on value.
391 const Type *SwitchTy = SI.getCondition()->getType();
392 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
393 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
394 "Switch constants must all be same type as switch value!", &SI);
396 visitTerminatorInst(SI);
399 void Verifier::visitSelectInst(SelectInst &SI) {
400 Assert1(SI.getCondition()->getType() == Type::BoolTy,
401 "Select condition type must be bool!", &SI);
402 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
403 "Select values must have identical types!", &SI);
404 Assert1(SI.getTrueValue()->getType() == SI.getType(),
405 "Select values must have same type as select instruction!", &SI);
409 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
410 /// a pass, if any exist, it's an error.
412 void Verifier::visitUserOp1(Instruction &I) {
413 Assert1(0, "User-defined operators should not live outside of a pass!",
417 /// visitPHINode - Ensure that a PHI node is well formed.
419 void Verifier::visitPHINode(PHINode &PN) {
420 // Ensure that the PHI nodes are all grouped together at the top of the block.
421 // This can be tested by checking whether the instruction before this is
422 // either nonexistent (because this is begin()) or is a PHI node. If not,
423 // then there is some other instruction before a PHI.
424 Assert2(&PN.getParent()->front() == &PN || isa<PHINode>(PN.getPrev()),
425 "PHI nodes not grouped at top of basic block!",
426 &PN, PN.getParent());
428 // Check that all of the operands of the PHI node have the same type as the
430 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
431 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
432 "PHI node operands are not the same type as the result!", &PN);
434 // All other PHI node constraints are checked in the visitBasicBlock method.
436 visitInstruction(PN);
439 void Verifier::visitCallInst(CallInst &CI) {
440 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
441 "Called function must be a pointer!", &CI);
442 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
443 Assert1(isa<FunctionType>(FPTy->getElementType()),
444 "Called function is not pointer to function type!", &CI);
446 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
448 // Verify that the correct number of arguments are being passed
450 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
451 "Called function requires more parameters than were provided!",&CI);
453 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
454 "Incorrect number of arguments passed to called function!", &CI);
456 // Verify that all arguments to the call match the function type...
457 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
458 Assert3(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
459 "Call parameter type does not match function signature!",
460 CI.getOperand(i+1), FTy->getParamType(i), &CI);
462 if (Function *F = CI.getCalledFunction())
463 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
464 visitIntrinsicFunctionCall(ID, CI);
466 visitInstruction(CI);
469 /// visitBinaryOperator - Check that both arguments to the binary operator are
470 /// of the same type!
472 void Verifier::visitBinaryOperator(BinaryOperator &B) {
473 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
474 "Both operands to a binary operator are not of the same type!", &B);
476 // Check that logical operators are only used with integral operands.
477 if (B.getOpcode() == Instruction::And || B.getOpcode() == Instruction::Or ||
478 B.getOpcode() == Instruction::Xor) {
479 Assert1(B.getType()->isIntegral(),
480 "Logical operators only work with integral types!", &B);
481 Assert1(B.getType() == B.getOperand(0)->getType(),
482 "Logical operators must have same type for operands and result!",
484 } else if (isa<SetCondInst>(B)) {
485 // Check that setcc instructions return bool
486 Assert1(B.getType() == Type::BoolTy,
487 "setcc instructions must return boolean values!", &B);
489 // Arithmetic operators only work on integer or fp values
490 Assert1(B.getType() == B.getOperand(0)->getType(),
491 "Arithmetic operators must have same type for operands and result!",
493 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint(),
494 "Arithmetic operators must have integer or fp type!", &B);
500 void Verifier::visitShiftInst(ShiftInst &SI) {
501 Assert1(SI.getType()->isInteger(),
502 "Shift must return an integer result!", &SI);
503 Assert1(SI.getType() == SI.getOperand(0)->getType(),
504 "Shift return type must be same as first operand!", &SI);
505 Assert1(SI.getOperand(1)->getType() == Type::UByteTy,
506 "Second operand to shift must be ubyte type!", &SI);
507 visitInstruction(SI);
510 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
512 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
513 std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true);
514 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
515 Assert2(PointerType::get(ElTy) == GEP.getType(),
516 "GEP is not of right type for indices!", &GEP, ElTy);
517 visitInstruction(GEP);
520 void Verifier::visitLoadInst(LoadInst &LI) {
522 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
523 Assert2(ElTy == LI.getType(),
524 "Load result type does not match pointer operand type!", &LI, ElTy);
525 visitInstruction(LI);
528 void Verifier::visitStoreInst(StoreInst &SI) {
530 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
531 Assert2(ElTy == SI.getOperand(0)->getType(),
532 "Stored value type does not match pointer operand type!", &SI, ElTy);
533 visitInstruction(SI);
537 /// verifyInstruction - Verify that an instruction is well formed.
539 void Verifier::visitInstruction(Instruction &I) {
540 BasicBlock *BB = I.getParent();
541 Assert1(BB, "Instruction not embedded in basic block!", &I);
543 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
544 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
546 Assert1(*UI != (User*)&I ||
547 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
548 "Only PHI nodes may reference their own value!", &I);
551 // Check that void typed values don't have names
552 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
553 "Instruction has a name, but provides a void value!", &I);
555 // Check that the return value of the instruction is either void or a legal
557 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
558 "Instruction returns a non-scalar type!", &I);
560 // Check that all uses of the instruction, if they are instructions
561 // themselves, actually have parent basic blocks. If the use is not an
562 // instruction, it is an error!
563 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
565 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
567 Instruction *Used = cast<Instruction>(*UI);
568 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
569 " embeded in a basic block!", &I, Used);
572 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
573 // Check to make sure that the "address of" an intrinsic function is never
575 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
576 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
577 "Cannot take the address of an intrinsic!", &I);
578 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
579 Assert1(OpBB->getParent() == BB->getParent(),
580 "Referring to a basic block in another function!", &I);
581 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
582 Assert1(OpArg->getParent() == BB->getParent(),
583 "Referring to an argument in another function!", &I);
584 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
585 BasicBlock *OpBlock = Op->getParent();
587 // Check that a definition dominates all of its uses.
588 if (!isa<PHINode>(I)) {
589 // Invoke results are only usable in the normal destination, not in the
590 // exceptional destination.
591 if (InvokeInst *II = dyn_cast<InvokeInst>(Op))
592 OpBlock = II->getNormalDest();
593 else if (OpBlock == BB) {
594 // If they are in the same basic block, make sure that the definition
595 // comes before the use.
596 Assert2(DS->dominates(Op, &I) ||
597 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
598 "Instruction does not dominate all uses!", Op, &I);
601 // Definition must dominate use unless use is unreachable!
602 Assert2(DS->dominates(OpBlock, BB) ||
603 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
604 "Instruction does not dominate all uses!", Op, &I);
606 // PHI nodes are more difficult than other nodes because they actually
607 // "use" the value in the predecessor basic blocks they correspond to.
608 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
609 Assert2(DS->dominates(OpBlock, PredBB) ||
610 !DS->dominates(&BB->getParent()->getEntryBlock(), PredBB),
611 "Instruction does not dominate all uses!", Op, &I);
617 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
619 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
620 Function *IF = CI.getCalledFunction();
621 const FunctionType *FT = IF->getFunctionType();
622 Assert1(IF->isExternal(), "Intrinsic functions should never be defined!", IF);
623 unsigned NumArgs = 0;
625 // FIXME: this should check the return type of each intrinsic as well, also
628 case Intrinsic::vastart:
629 Assert1(CI.getParent()->getParent()->getFunctionType()->isVarArg(),
630 "llvm.va_start intrinsic may only occur in function with variable"
634 case Intrinsic::vaend: NumArgs = 1; break;
635 case Intrinsic::vacopy: NumArgs = 1; break;
637 case Intrinsic::returnaddress:
638 case Intrinsic::frameaddress:
639 Assert1(isa<PointerType>(FT->getReturnType()),
640 "llvm.(frame|return)address must return pointers", IF);
641 Assert1(FT->getNumParams() == 1 && isa<ConstantInt>(CI.getOperand(1)),
642 "llvm.(frame|return)address require a single constant integer argument",
647 // Verify that read and write port have integral parameters of the correct
649 case Intrinsic::writeport:
650 Assert1(FT->getNumParams() == 2,
651 "Illegal # arguments for intrinsic function!", IF);
652 Assert1(FT->getParamType(0)->isIntegral(),
653 "First argument not unsigned int!", IF);
654 Assert1(FT->getParamType(1)->isUnsigned(),
655 "First argument not unsigned int!", IF);
659 case Intrinsic::writeio:
660 Assert1(FT->getNumParams() == 2,
661 "Illegal # arguments for intrinsic function!", IF);
662 Assert1(FT->getParamType(0)->isFirstClassType(),
663 "First argument not a first class type!", IF);
664 Assert1(isa<PointerType>(FT->getParamType(1)),
665 "Second argument not a pointer!", IF);
669 case Intrinsic::readport:
670 Assert1(FT->getNumParams() == 1,
671 "Illegal # arguments for intrinsic function!", IF);
672 Assert1(FT->getReturnType()->isFirstClassType(),
673 "Return type is not a first class type!", IF);
674 Assert1(FT->getParamType(0)->isUnsigned(),
675 "First argument not unsigned int!", IF);
679 case Intrinsic::readio: {
680 const PointerType *ParamType = dyn_cast<PointerType>(FT->getParamType(0));
681 const Type *ReturnType = FT->getReturnType();
683 Assert1(FT->getNumParams() == 1,
684 "Illegal # arguments for intrinsic function!", IF);
685 Assert1(ParamType, "First argument not a pointer!", IF);
686 Assert1(ParamType->getElementType() == ReturnType,
687 "Pointer type doesn't match return type!", IF);
692 case Intrinsic::isunordered:
693 Assert1(FT->getNumParams() == 2,
694 "Illegal # arguments for intrinsic function!", IF);
695 Assert1(FT->getReturnType() == Type::BoolTy,
696 "Return type is not bool!", IF);
697 Assert1(FT->getParamType(0) == FT->getParamType(1),
698 "Arguments must be of the same type!", IF);
699 Assert1(FT->getParamType(0)->isFloatingPoint(),
700 "Argument is not a floating point type!", IF);
704 case Intrinsic::setjmp: NumArgs = 1; break;
705 case Intrinsic::longjmp: NumArgs = 2; break;
706 case Intrinsic::sigsetjmp: NumArgs = 2; break;
707 case Intrinsic::siglongjmp: NumArgs = 2; break;
709 case Intrinsic::gcroot:
710 Assert1(FT->getNumParams() == 2,
711 "Illegal # arguments for intrinsic function!", IF);
712 Assert1(isa<Constant>(CI.getOperand(2)) ||
713 isa<GlobalValue>(CI.getOperand(2)),
714 "Second argument to llvm.gcroot must be a constant!", &CI);
717 case Intrinsic::gcread: NumArgs = 1; break;
718 case Intrinsic::gcwrite: NumArgs = 2; break;
720 case Intrinsic::dbg_stoppoint: NumArgs = 4; break;
721 case Intrinsic::dbg_region_start:NumArgs = 1; break;
722 case Intrinsic::dbg_region_end: NumArgs = 1; break;
723 case Intrinsic::dbg_func_start: NumArgs = 1; break;
724 case Intrinsic::dbg_declare: NumArgs = 1; break;
726 case Intrinsic::memcpy: NumArgs = 4; break;
727 case Intrinsic::memmove: NumArgs = 4; break;
728 case Intrinsic::memset: NumArgs = 4; break;
730 case Intrinsic::alpha_ctlz: NumArgs = 1; break;
731 case Intrinsic::alpha_cttz: NumArgs = 1; break;
732 case Intrinsic::alpha_ctpop: NumArgs = 1; break;
733 case Intrinsic::alpha_umulh: NumArgs = 2; break;
734 case Intrinsic::alpha_vecop: NumArgs = 4; break;
735 case Intrinsic::alpha_pup: NumArgs = 3; break;
736 case Intrinsic::alpha_bytezap: NumArgs = 2; break;
737 case Intrinsic::alpha_bytemanip: NumArgs = 3; break;
738 case Intrinsic::alpha_dfpbop: NumArgs = 3; break;
739 case Intrinsic::alpha_dfpuop: NumArgs = 2; break;
740 case Intrinsic::alpha_unordered: NumArgs = 2; break;
741 case Intrinsic::alpha_uqtodfp: NumArgs = 2; break;
742 case Intrinsic::alpha_uqtosfp: NumArgs = 2; break;
743 case Intrinsic::alpha_dfptosq: NumArgs = 2; break;
744 case Intrinsic::alpha_sfptosq: NumArgs = 2; break;
746 case Intrinsic::not_intrinsic:
747 assert(0 && "Invalid intrinsic!"); NumArgs = 0; break;
750 Assert1(FT->getNumParams() == NumArgs || (FT->getNumParams() < NumArgs &&
752 "Illegal # arguments for intrinsic function!", IF);
756 //===----------------------------------------------------------------------===//
757 // Implement the public interfaces to this file...
758 //===----------------------------------------------------------------------===//
760 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
761 return new Verifier(action);
765 // verifyFunction - Create
766 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
767 Function &F = const_cast<Function&>(f);
768 assert(!F.isExternal() && "Cannot verify external functions");
770 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
771 Verifier *V = new Verifier(action);
777 /// verifyModule - Check a module for errors, printing messages on stderr.
778 /// Return true if the module is corrupt.
780 bool llvm::verifyModule(const Module &M, VerifierFailureAction action) {
782 Verifier *V = new Verifier(action);