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);
126 // If the module is broken, abort at this time.
131 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
132 AU.setPreservesAll();
134 AU.addRequired<DominatorSet>();
137 /// abortIfBroken - If the module is broken and we are supposed to abort on
138 /// this condition, do so.
140 void abortIfBroken() {
143 msgs << "Broken module found, ";
146 case AbortProcessAction:
147 msgs << "compilation aborted!\n";
148 std::cerr << msgs.str();
150 case ThrowExceptionAction:
151 msgs << "verification terminated.\n";
153 case PrintMessageAction:
154 msgs << "verification continues.\n";
155 std::cerr << msgs.str();
157 case ReturnStatusAction:
164 // Verification methods...
165 void verifySymbolTable(SymbolTable &ST);
166 void visitGlobalValue(GlobalValue &GV);
167 void visitFunction(Function &F);
168 void visitBasicBlock(BasicBlock &BB);
169 void visitPHINode(PHINode &PN);
170 void visitBinaryOperator(BinaryOperator &B);
171 void visitShiftInst(ShiftInst &SI);
172 void visitVANextInst(VANextInst &VAN) { visitInstruction(VAN); }
173 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
174 void visitCallInst(CallInst &CI);
175 void visitGetElementPtrInst(GetElementPtrInst &GEP);
176 void visitLoadInst(LoadInst &LI);
177 void visitStoreInst(StoreInst &SI);
178 void visitInstruction(Instruction &I);
179 void visitTerminatorInst(TerminatorInst &I);
180 void visitReturnInst(ReturnInst &RI);
181 void visitSwitchInst(SwitchInst &SI);
182 void visitSelectInst(SelectInst &SI);
183 void visitUserOp1(Instruction &I);
184 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
185 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
188 void WriteValue(const Value *V) {
190 if (isa<Instruction>(V)) {
193 WriteAsOperand (msgs, V, true, true, Mod);
198 void WriteType(const Type* T ) {
200 WriteTypeSymbolic(msgs, T, Mod );
204 // CheckFailed - A check failed, so print out the condition and the message
205 // that failed. This provides a nice place to put a breakpoint if you want
206 // to see why something is not correct.
207 void CheckFailed(const std::string &Message,
208 const Value *V1 = 0, const Value *V2 = 0,
209 const Value *V3 = 0, const Value *V4 = 0) {
210 msgs << Message << "\n";
218 void CheckFailed( const std::string& Message, const Value* V1,
219 const Type* T2, const Value* V3 = 0 ) {
220 msgs << Message << "\n";
228 RegisterOpt<Verifier> X("verify", "Module Verifier");
229 } // End anonymous namespace
232 // Assert - We know that cond should be true, if not print an error message.
233 #define Assert(C, M) \
234 do { if (!(C)) { CheckFailed(M); return; } } while (0)
235 #define Assert1(C, M, V1) \
236 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
237 #define Assert2(C, M, V1, V2) \
238 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
239 #define Assert3(C, M, V1, V2, V3) \
240 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
241 #define Assert4(C, M, V1, V2, V3, V4) \
242 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
245 void Verifier::visitGlobalValue(GlobalValue &GV) {
246 Assert1(!GV.isExternal() || GV.hasExternalLinkage(),
247 "Global is external, but doesn't have external linkage!", &GV);
248 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
249 "Only global variables can have appending linkage!", &GV);
251 if (GV.hasAppendingLinkage()) {
252 GlobalVariable &GVar = cast<GlobalVariable>(GV);
253 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
254 "Only global arrays can have appending linkage!", &GV);
258 // verifySymbolTable - Verify that a function or module symbol table is ok
260 void Verifier::verifySymbolTable(SymbolTable &ST) {
262 // Loop over all of the values in all type planes in the symbol table.
263 for (SymbolTable::plane_const_iterator PI = ST.plane_begin(),
264 PE = ST.plane_end(); PI != PE; ++PI)
265 for (SymbolTable::value_const_iterator VI = PI->second.begin(),
266 VE = PI->second.end(); VI != VE; ++VI) {
267 Value *V = VI->second;
268 // Check that there are no void typed values in the symbol table. Values
269 // with a void type cannot be put into symbol tables because they cannot
271 Assert1(V->getType() != Type::VoidTy,
272 "Values with void type are not allowed to have names!", V);
276 // visitFunction - Verify that a function is ok.
278 void Verifier::visitFunction(Function &F) {
279 // Check function arguments...
280 const FunctionType *FT = F.getFunctionType();
281 unsigned NumArgs = F.getArgumentList().size();
283 Assert2(FT->getNumParams() == NumArgs,
284 "# formal arguments must match # of arguments for function type!",
286 Assert1(F.getReturnType()->isFirstClassType() ||
287 F.getReturnType() == Type::VoidTy,
288 "Functions cannot return aggregate values!", &F);
290 // Check that the argument values match the function type for this function...
292 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I, ++i) {
293 Assert2(I->getType() == FT->getParamType(i),
294 "Argument value does not match function argument type!",
295 I, FT->getParamType(i));
296 // Make sure no aggregates are passed by value.
297 Assert1(I->getType()->isFirstClassType(),
298 "Functions cannot take aggregates as arguments by value!", I);
301 if (!F.isExternal()) {
302 verifySymbolTable(F.getSymbolTable());
304 // Check the entry node
305 BasicBlock *Entry = &F.getEntryBlock();
306 Assert1(pred_begin(Entry) == pred_end(Entry),
307 "Entry block to function must not have predecessors!", Entry);
312 // verifyBasicBlock - Verify that a basic block is well formed...
314 void Verifier::visitBasicBlock(BasicBlock &BB) {
315 // Check constraints that this basic block imposes on all of the PHI nodes in
317 if (isa<PHINode>(BB.front())) {
318 std::vector<BasicBlock*> Preds(pred_begin(&BB), pred_end(&BB));
319 std::sort(Preds.begin(), Preds.end());
321 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
323 // Ensure that PHI nodes have at least one entry!
324 Assert1(PN->getNumIncomingValues() != 0,
325 "PHI nodes must have at least one entry. If the block is dead, "
326 "the PHI should be removed!", PN);
327 Assert1(PN->getNumIncomingValues() == Preds.size(),
328 "PHINode should have one entry for each predecessor of its "
329 "parent basic block!", PN);
331 // Get and sort all incoming values in the PHI node...
332 std::vector<std::pair<BasicBlock*, Value*> > Values;
333 Values.reserve(PN->getNumIncomingValues());
334 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
335 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
336 PN->getIncomingValue(i)));
337 std::sort(Values.begin(), Values.end());
339 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
340 // Check to make sure that if there is more than one entry for a
341 // particular basic block in this PHI node, that the incoming values are
344 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
345 Values[i].second == Values[i-1].second,
346 "PHI node has multiple entries for the same basic block with "
347 "different incoming values!", PN, Values[i].first,
348 Values[i].second, Values[i-1].second);
350 // Check to make sure that the predecessors and PHI node entries are
352 Assert3(Values[i].first == Preds[i],
353 "PHI node entries do not match predecessors!", PN,
354 Values[i].first, Preds[i]);
359 // Ensure that basic blocks have terminators!
360 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
363 void Verifier::visitTerminatorInst(TerminatorInst &I) {
364 // Ensure that terminators only exist at the end of the basic block.
365 Assert1(&I == I.getParent()->getTerminator(),
366 "Terminator found in the middle of a basic block!", I.getParent());
370 void Verifier::visitReturnInst(ReturnInst &RI) {
371 Function *F = RI.getParent()->getParent();
372 if (RI.getNumOperands() == 0)
373 Assert1(F->getReturnType() == Type::VoidTy,
374 "Function returns no value, but ret instruction found that does!",
377 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
378 "Function return type does not match operand "
379 "type of return inst!", &RI, F->getReturnType());
381 // Check to make sure that the return value has necessary properties for
383 visitTerminatorInst(RI);
386 void Verifier::visitSwitchInst(SwitchInst &SI) {
387 // Check to make sure that all of the constants in the switch instruction
388 // have the same type as the switched-on value.
389 const Type *SwitchTy = SI.getCondition()->getType();
390 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
391 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
392 "Switch constants must all be same type as switch value!", &SI);
394 visitTerminatorInst(SI);
397 void Verifier::visitSelectInst(SelectInst &SI) {
398 Assert1(SI.getCondition()->getType() == Type::BoolTy,
399 "Select condition type must be bool!", &SI);
400 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
401 "Select values must have identical types!", &SI);
402 Assert1(SI.getTrueValue()->getType() == SI.getType(),
403 "Select values must have same type as select instruction!", &SI);
407 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
408 /// a pass, if any exist, it's an error.
410 void Verifier::visitUserOp1(Instruction &I) {
411 Assert1(0, "User-defined operators should not live outside of a pass!",
415 /// visitPHINode - Ensure that a PHI node is well formed.
417 void Verifier::visitPHINode(PHINode &PN) {
418 // Ensure that the PHI nodes are all grouped together at the top of the block.
419 // This can be tested by checking whether the instruction before this is
420 // either nonexistent (because this is begin()) or is a PHI node. If not,
421 // then there is some other instruction before a PHI.
422 Assert2(&PN.getParent()->front() == &PN || isa<PHINode>(PN.getPrev()),
423 "PHI nodes not grouped at top of basic block!",
424 &PN, PN.getParent());
426 // Check that all of the operands of the PHI node have the same type as the
428 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
429 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
430 "PHI node operands are not the same type as the result!", &PN);
432 // All other PHI node constraints are checked in the visitBasicBlock method.
434 visitInstruction(PN);
437 void Verifier::visitCallInst(CallInst &CI) {
438 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
439 "Called function must be a pointer!", &CI);
440 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
441 Assert1(isa<FunctionType>(FPTy->getElementType()),
442 "Called function is not pointer to function type!", &CI);
444 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
446 // Verify that the correct number of arguments are being passed
448 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
449 "Called function requires more parameters than were provided!",&CI);
451 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
452 "Incorrect number of arguments passed to called function!", &CI);
454 // Verify that all arguments to the call match the function type...
455 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
456 Assert3(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
457 "Call parameter type does not match function signature!",
458 CI.getOperand(i+1), FTy->getParamType(i), &CI);
460 if (Function *F = CI.getCalledFunction())
461 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
462 visitIntrinsicFunctionCall(ID, CI);
464 visitInstruction(CI);
467 /// visitBinaryOperator - Check that both arguments to the binary operator are
468 /// of the same type!
470 void Verifier::visitBinaryOperator(BinaryOperator &B) {
471 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
472 "Both operands to a binary operator are not of the same type!", &B);
474 // Check that logical operators are only used with integral operands.
475 if (B.getOpcode() == Instruction::And || B.getOpcode() == Instruction::Or ||
476 B.getOpcode() == Instruction::Xor) {
477 Assert1(B.getType()->isIntegral(),
478 "Logical operators only work with integral types!", &B);
479 Assert1(B.getType() == B.getOperand(0)->getType(),
480 "Logical operators must have same type for operands and result!",
482 } else if (isa<SetCondInst>(B)) {
483 // Check that setcc instructions return bool
484 Assert1(B.getType() == Type::BoolTy,
485 "setcc instructions must return boolean values!", &B);
487 // Arithmetic operators only work on integer or fp values
488 Assert1(B.getType() == B.getOperand(0)->getType(),
489 "Arithmetic operators must have same type for operands and result!",
491 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint(),
492 "Arithmetic operators must have integer or fp type!", &B);
498 void Verifier::visitShiftInst(ShiftInst &SI) {
499 Assert1(SI.getType()->isInteger(),
500 "Shift must return an integer result!", &SI);
501 Assert1(SI.getType() == SI.getOperand(0)->getType(),
502 "Shift return type must be same as first operand!", &SI);
503 Assert1(SI.getOperand(1)->getType() == Type::UByteTy,
504 "Second operand to shift must be ubyte type!", &SI);
505 visitInstruction(SI);
508 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
510 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
511 std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true);
512 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
513 Assert2(PointerType::get(ElTy) == GEP.getType(),
514 "GEP is not of right type for indices!", &GEP, ElTy);
515 visitInstruction(GEP);
518 void Verifier::visitLoadInst(LoadInst &LI) {
520 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
521 Assert2(ElTy == LI.getType(),
522 "Load result type does not match pointer operand type!", &LI, ElTy);
523 visitInstruction(LI);
526 void Verifier::visitStoreInst(StoreInst &SI) {
528 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
529 Assert2(ElTy == SI.getOperand(0)->getType(),
530 "Stored value type does not match pointer operand type!", &SI, ElTy);
531 visitInstruction(SI);
535 /// verifyInstruction - Verify that an instruction is well formed.
537 void Verifier::visitInstruction(Instruction &I) {
538 BasicBlock *BB = I.getParent();
539 Assert1(BB, "Instruction not embedded in basic block!", &I);
541 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
542 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
544 Assert1(*UI != (User*)&I ||
545 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
546 "Only PHI nodes may reference their own value!", &I);
549 // Check that void typed values don't have names
550 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
551 "Instruction has a name, but provides a void value!", &I);
553 // Check that the return value of the instruction is either void or a legal
555 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
556 "Instruction returns a non-scalar type!", &I);
558 // Check that all uses of the instruction, if they are instructions
559 // themselves, actually have parent basic blocks. If the use is not an
560 // instruction, it is an error!
561 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
563 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
565 Instruction *Used = cast<Instruction>(*UI);
566 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
567 " embeded in a basic block!", &I, Used);
570 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
571 // Check to make sure that the "address of" an intrinsic function is never
573 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
574 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
575 "Cannot take the address of an intrinsic!", &I);
576 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
577 Assert1(OpBB->getParent() == BB->getParent(),
578 "Referring to a basic block in another function!", &I);
579 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
580 Assert1(OpArg->getParent() == BB->getParent(),
581 "Referring to an argument in another function!", &I);
582 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
583 BasicBlock *OpBlock = Op->getParent();
585 // Check that a definition dominates all of its uses.
586 if (!isa<PHINode>(I)) {
587 // Invoke results are only usable in the normal destination, not in the
588 // exceptional destination.
589 if (InvokeInst *II = dyn_cast<InvokeInst>(Op))
590 OpBlock = II->getNormalDest();
591 else if (OpBlock == BB) {
592 // If they are in the same basic block, make sure that the definition
593 // comes before the use.
594 Assert2(DS->dominates(Op, &I) ||
595 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
596 "Instruction does not dominate all uses!", Op, &I);
599 // Definition must dominate use unless use is unreachable!
600 Assert2(DS->dominates(OpBlock, BB) ||
601 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
602 "Instruction does not dominate all uses!", Op, &I);
604 // PHI nodes are more difficult than other nodes because they actually
605 // "use" the value in the predecessor basic blocks they correspond to.
606 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
607 Assert2(DS->dominates(OpBlock, PredBB) ||
608 !DS->dominates(&BB->getParent()->getEntryBlock(), PredBB),
609 "Instruction does not dominate all uses!", Op, &I);
615 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
617 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
618 Function *IF = CI.getCalledFunction();
619 const FunctionType *FT = IF->getFunctionType();
620 Assert1(IF->isExternal(), "Intrinsic functions should never be defined!", IF);
621 unsigned NumArgs = 0;
623 // FIXME: this should check the return type of each intrinsic as well, also
626 case Intrinsic::vastart:
627 Assert1(CI.getParent()->getParent()->getFunctionType()->isVarArg(),
628 "llvm.va_start intrinsic may only occur in function with variable"
632 case Intrinsic::vaend: NumArgs = 1; break;
633 case Intrinsic::vacopy: NumArgs = 1; break;
635 case Intrinsic::returnaddress:
636 case Intrinsic::frameaddress:
637 Assert1(isa<PointerType>(FT->getReturnType()),
638 "llvm.(frame|return)address must return pointers", IF);
639 Assert1(FT->getNumParams() == 1 && isa<ConstantInt>(CI.getOperand(1)),
640 "llvm.(frame|return)address require a single constant integer argument",
645 // Verify that read and write port have integral parameters of the correct
647 case Intrinsic::writeport:
648 Assert1(FT->getNumParams() == 2,
649 "Illegal # arguments for intrinsic function!", IF);
650 Assert1(FT->getParamType(0)->isIntegral(),
651 "First argument not unsigned int!", IF);
652 Assert1(FT->getParamType(1)->isUnsigned(),
653 "First argument not unsigned int!", IF);
657 case Intrinsic::writeio:
658 Assert1(FT->getNumParams() == 2,
659 "Illegal # arguments for intrinsic function!", IF);
660 Assert1(FT->getParamType(0)->isFirstClassType(),
661 "First argument not a first class type!", IF);
662 Assert1(isa<PointerType>(FT->getParamType(1)),
663 "Second argument not a pointer!", IF);
667 case Intrinsic::readport:
668 Assert1(FT->getNumParams() == 1,
669 "Illegal # arguments for intrinsic function!", IF);
670 Assert1(FT->getReturnType()->isFirstClassType(),
671 "Return type is not a first class type!", IF);
672 Assert1(FT->getParamType(0)->isUnsigned(),
673 "First argument not unsigned int!", IF);
677 case Intrinsic::readio: {
678 const PointerType *ParamType = dyn_cast<PointerType>(FT->getParamType(0));
679 const Type *ReturnType = FT->getReturnType();
681 Assert1(FT->getNumParams() == 1,
682 "Illegal # arguments for intrinsic function!", IF);
683 Assert1(ParamType, "First argument not a pointer!", IF);
684 Assert1(ParamType->getElementType() == ReturnType,
685 "Pointer type doesn't match return type!", IF);
690 case Intrinsic::isunordered:
691 Assert1(FT->getNumParams() == 2,
692 "Illegal # arguments for intrinsic function!", IF);
693 Assert1(FT->getReturnType() == Type::BoolTy,
694 "Return type is not bool!", IF);
695 Assert1(FT->getParamType(0) == FT->getParamType(1),
696 "Arguments must be of the same type!", IF);
697 Assert1(FT->getParamType(0)->isFloatingPoint(),
698 "Argument is not a floating point type!", IF);
702 case Intrinsic::setjmp: NumArgs = 1; break;
703 case Intrinsic::longjmp: NumArgs = 2; break;
704 case Intrinsic::sigsetjmp: NumArgs = 2; break;
705 case Intrinsic::siglongjmp: NumArgs = 2; break;
707 case Intrinsic::gcroot:
708 Assert1(FT->getNumParams() == 2,
709 "Illegal # arguments for intrinsic function!", IF);
710 Assert1(isa<Constant>(CI.getOperand(2)),
711 "Second argument to llvm.gcroot must be a constant!", &CI);
714 case Intrinsic::gcread: NumArgs = 2; break;
715 case Intrinsic::gcwrite: NumArgs = 3; break;
717 case Intrinsic::dbg_stoppoint: NumArgs = 4; break;
718 case Intrinsic::dbg_region_start:NumArgs = 1; break;
719 case Intrinsic::dbg_region_end: NumArgs = 1; break;
720 case Intrinsic::dbg_func_start: NumArgs = 1; break;
721 case Intrinsic::dbg_declare: NumArgs = 1; break;
723 case Intrinsic::memcpy: NumArgs = 4; break;
724 case Intrinsic::memmove: NumArgs = 4; break;
725 case Intrinsic::memset: NumArgs = 4; break;
727 case Intrinsic::alpha_ctlz: NumArgs = 1; break;
728 case Intrinsic::alpha_cttz: NumArgs = 1; break;
729 case Intrinsic::alpha_ctpop: NumArgs = 1; break;
730 case Intrinsic::alpha_umulh: NumArgs = 2; break;
731 case Intrinsic::alpha_vecop: NumArgs = 4; break;
732 case Intrinsic::alpha_pup: NumArgs = 3; break;
733 case Intrinsic::alpha_bytezap: NumArgs = 2; break;
734 case Intrinsic::alpha_bytemanip: NumArgs = 3; break;
735 case Intrinsic::alpha_dfpbop: NumArgs = 3; break;
736 case Intrinsic::alpha_dfpuop: NumArgs = 2; break;
737 case Intrinsic::alpha_unordered: NumArgs = 2; break;
738 case Intrinsic::alpha_uqtodfp: NumArgs = 2; break;
739 case Intrinsic::alpha_uqtosfp: NumArgs = 2; break;
740 case Intrinsic::alpha_dfptosq: NumArgs = 2; break;
741 case Intrinsic::alpha_sfptosq: NumArgs = 2; break;
743 case Intrinsic::not_intrinsic:
744 assert(0 && "Invalid intrinsic!"); NumArgs = 0; break;
747 Assert1(FT->getNumParams() == NumArgs || (FT->getNumParams() < NumArgs &&
749 "Illegal # arguments for intrinsic function!", IF);
753 //===----------------------------------------------------------------------===//
754 // Implement the public interfaces to this file...
755 //===----------------------------------------------------------------------===//
757 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
758 return new Verifier(action);
762 // verifyFunction - Create
763 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
764 Function &F = const_cast<Function&>(f);
765 assert(!F.isExternal() && "Cannot verify external functions");
767 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
768 Verifier *V = new Verifier(action);
774 /// verifyModule - Check a module for errors, printing messages on stderr.
775 /// Return true if the module is corrupt.
777 bool llvm::verifyModule(const Module &M, VerifierFailureAction action) {
779 Verifier *V = new Verifier(action);