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 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 // . Function's 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"
61 namespace { // Anonymous namespace for class
63 struct Verifier : public FunctionPass, InstVisitor<Verifier> {
64 bool Broken; // Is this module found to be broken?
65 bool RealPass; // Are we not being run by a PassManager?
66 VerifierFailureAction action;
67 // What to do if verification fails.
68 Module *Mod; // Module we are verifying right now
69 DominatorSet *DS; // Dominator set, caution can be null!
70 std::stringstream msgs; // A stringstream to collect messages
73 : Broken(false), RealPass(true), action(AbortProcessAction),
74 DS(0), msgs( std::ios_base::app | std::ios_base::out ) {}
75 Verifier( VerifierFailureAction ctn )
76 : Broken(false), RealPass(true), action(ctn), DS(0),
77 msgs( std::ios_base::app | std::ios_base::out ) {}
79 : Broken(false), RealPass(true),
80 action( AB ? AbortProcessAction : PrintMessageAction), DS(0),
81 msgs( std::ios_base::app | std::ios_base::out ) {}
82 Verifier(DominatorSet &ds)
83 : Broken(false), RealPass(false), action(PrintMessageAction),
84 DS(&ds), msgs( std::ios_base::app | std::ios_base::out ) {}
87 bool doInitialization(Module &M) {
89 verifySymbolTable(M.getSymbolTable());
91 // If this is a real pass, in a pass manager, we must abort before
92 // returning back to the pass manager, or else the pass manager may try to
93 // run other passes on the broken module.
99 bool runOnFunction(Function &F) {
100 // Get dominator information if we are being run by PassManager
101 if (RealPass) DS = &getAnalysis<DominatorSet>();
104 // If this is a real pass, in a pass manager, we must abort before
105 // returning back to the pass manager, or else the pass manager may try to
106 // run other passes on the broken module.
113 bool doFinalization(Module &M) {
114 // Scan through, checking all of the external function's linkage now...
115 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
116 visitGlobalValue(*I);
118 // Check to make sure function prototypes are okay.
119 if (I->isExternal()) visitFunction(*I);
122 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
123 visitGlobalValue(*I);
127 // If the module is broken, abort at this time.
132 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
133 AU.setPreservesAll();
135 AU.addRequired<DominatorSet>();
138 /// abortIfBroken - If the module is broken and we are supposed to abort on
139 /// this condition, do so.
141 void abortIfBroken() {
144 msgs << "Broken module found, ";
147 case AbortProcessAction:
148 msgs << "compilation aborted!\n";
149 std::cerr << msgs.str();
151 case ThrowExceptionAction:
152 msgs << "verification terminated.\n";
154 case PrintMessageAction:
155 msgs << "verification continues.\n";
156 std::cerr << msgs.str();
158 case ReturnStatusAction:
165 // Verification methods...
166 void verifySymbolTable(SymbolTable &ST);
167 void visitGlobalValue(GlobalValue &GV);
168 void visitFunction(Function &F);
169 void visitBasicBlock(BasicBlock &BB);
170 void visitPHINode(PHINode &PN);
171 void visitBinaryOperator(BinaryOperator &B);
172 void visitShiftInst(ShiftInst &SI);
173 void visitVANextInst(VANextInst &VAN) { visitInstruction(VAN); }
174 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
175 void visitCallInst(CallInst &CI);
176 void visitGetElementPtrInst(GetElementPtrInst &GEP);
177 void visitLoadInst(LoadInst &LI);
178 void visitStoreInst(StoreInst &SI);
179 void visitInstruction(Instruction &I);
180 void visitTerminatorInst(TerminatorInst &I);
181 void visitReturnInst(ReturnInst &RI);
182 void visitSwitchInst(SwitchInst &SI);
183 void visitSelectInst(SelectInst &SI);
184 void visitUserOp1(Instruction &I);
185 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
186 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
189 void WriteValue(const Value *V) {
191 if (isa<Instruction>(V)) {
194 WriteAsOperand (msgs, V, true, true, Mod);
199 void WriteType(const Type* T ) {
201 WriteTypeSymbolic(msgs, T, Mod );
205 // CheckFailed - A check failed, so print out the condition and the message
206 // that failed. This provides a nice place to put a breakpoint if you want
207 // to see why something is not correct.
208 void CheckFailed(const std::string &Message,
209 const Value *V1 = 0, const Value *V2 = 0,
210 const Value *V3 = 0, const Value *V4 = 0) {
211 msgs << Message << "\n";
219 void CheckFailed( const std::string& Message, const Value* V1,
220 const Type* T2, const Value* V3 = 0 ) {
221 msgs << Message << "\n";
229 RegisterOpt<Verifier> X("verify", "Module Verifier");
230 } // End anonymous namespace
233 // Assert - We know that cond should be true, if not print an error message.
234 #define Assert(C, M) \
235 do { if (!(C)) { CheckFailed(M); return; } } while (0)
236 #define Assert1(C, M, V1) \
237 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
238 #define Assert2(C, M, V1, V2) \
239 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
240 #define Assert3(C, M, V1, V2, V3) \
241 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
242 #define Assert4(C, M, V1, V2, V3, V4) \
243 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
246 void Verifier::visitGlobalValue(GlobalValue &GV) {
247 Assert1(!GV.isExternal() || GV.hasExternalLinkage(),
248 "Global is external, but doesn't have external linkage!", &GV);
249 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
250 "Only global variables can have appending linkage!", &GV);
252 if (GV.hasAppendingLinkage()) {
253 GlobalVariable &GVar = cast<GlobalVariable>(GV);
254 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
255 "Only global arrays can have appending linkage!", &GV);
259 // verifySymbolTable - Verify that a function or module symbol table is ok
261 void Verifier::verifySymbolTable(SymbolTable &ST) {
263 // Loop over all of the values in all type planes in the symbol table.
264 for (SymbolTable::plane_const_iterator PI = ST.plane_begin(),
265 PE = ST.plane_end(); PI != PE; ++PI)
266 for (SymbolTable::value_const_iterator VI = PI->second.begin(),
267 VE = PI->second.end(); VI != VE; ++VI) {
268 Value *V = VI->second;
269 // Check that there are no void typed values in the symbol table. Values
270 // with a void type cannot be put into symbol tables because they cannot
272 Assert1(V->getType() != Type::VoidTy,
273 "Values with void type are not allowed to have names!", V);
277 // visitFunction - Verify that a function is ok.
279 void Verifier::visitFunction(Function &F) {
280 // Check function arguments...
281 const FunctionType *FT = F.getFunctionType();
282 unsigned NumArgs = F.getArgumentList().size();
284 Assert2(FT->getNumParams() == NumArgs,
285 "# formal arguments must match # of arguments for function type!",
287 Assert1(F.getReturnType()->isFirstClassType() ||
288 F.getReturnType() == Type::VoidTy,
289 "Functions cannot return aggregate values!", &F);
291 // Check that the argument values match the function type for this function...
293 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I, ++i) {
294 Assert2(I->getType() == FT->getParamType(i),
295 "Argument value does not match function argument type!",
296 I, FT->getParamType(i));
297 // Make sure no aggregates are passed by value.
298 Assert1(I->getType()->isFirstClassType(),
299 "Functions cannot take aggregates as arguments by value!", I);
302 if (!F.isExternal()) {
303 verifySymbolTable(F.getSymbolTable());
305 // Check the entry node
306 BasicBlock *Entry = &F.getEntryBlock();
307 Assert1(pred_begin(Entry) == pred_end(Entry),
308 "Entry block to function must not have predecessors!", Entry);
313 // verifyBasicBlock - Verify that a basic block is well formed...
315 void Verifier::visitBasicBlock(BasicBlock &BB) {
316 // Check constraints that this basic block imposes on all of the PHI nodes in
318 if (isa<PHINode>(BB.front())) {
319 std::vector<BasicBlock*> Preds(pred_begin(&BB), pred_end(&BB));
320 std::sort(Preds.begin(), Preds.end());
322 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
324 // Ensure that PHI nodes have at least one entry!
325 Assert1(PN->getNumIncomingValues() != 0,
326 "PHI nodes must have at least one entry. If the block is dead, "
327 "the PHI should be removed!", PN);
328 Assert1(PN->getNumIncomingValues() == Preds.size(),
329 "PHINode should have one entry for each predecessor of its "
330 "parent basic block!", PN);
332 // Get and sort all incoming values in the PHI node...
333 std::vector<std::pair<BasicBlock*, Value*> > Values;
334 Values.reserve(PN->getNumIncomingValues());
335 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
336 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
337 PN->getIncomingValue(i)));
338 std::sort(Values.begin(), Values.end());
340 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
341 // Check to make sure that if there is more than one entry for a
342 // particular basic block in this PHI node, that the incoming values are
345 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
346 Values[i].second == Values[i-1].second,
347 "PHI node has multiple entries for the same basic block with "
348 "different incoming values!", PN, Values[i].first,
349 Values[i].second, Values[i-1].second);
351 // Check to make sure that the predecessors and PHI node entries are
353 Assert3(Values[i].first == Preds[i],
354 "PHI node entries do not match predecessors!", PN,
355 Values[i].first, Preds[i]);
360 // Ensure that basic blocks have terminators!
361 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
364 void Verifier::visitTerminatorInst(TerminatorInst &I) {
365 // Ensure that terminators only exist at the end of the basic block.
366 Assert1(&I == I.getParent()->getTerminator(),
367 "Terminator found in the middle of a basic block!", I.getParent());
371 void Verifier::visitReturnInst(ReturnInst &RI) {
372 Function *F = RI.getParent()->getParent();
373 if (RI.getNumOperands() == 0)
374 Assert1(F->getReturnType() == Type::VoidTy,
375 "Function returns no value, but ret instruction found that does!",
378 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
379 "Function return type does not match operand "
380 "type of return inst!", &RI, F->getReturnType());
382 // Check to make sure that the return value has necessary properties for
384 visitTerminatorInst(RI);
387 void Verifier::visitSwitchInst(SwitchInst &SI) {
388 // Check to make sure that all of the constants in the switch instruction
389 // have the same type as the switched-on value.
390 const Type *SwitchTy = SI.getCondition()->getType();
391 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
392 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
393 "Switch constants must all be same type as switch value!", &SI);
395 visitTerminatorInst(SI);
398 void Verifier::visitSelectInst(SelectInst &SI) {
399 Assert1(SI.getCondition()->getType() == Type::BoolTy,
400 "Select condition type must be bool!", &SI);
401 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
402 "Select values must have identical types!", &SI);
403 Assert1(SI.getTrueValue()->getType() == SI.getType(),
404 "Select values must have same type as select instruction!", &SI);
408 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
409 /// a pass, if any exist, it's an error.
411 void Verifier::visitUserOp1(Instruction &I) {
412 Assert1(0, "User-defined operators should not live outside of a pass!",
416 /// visitPHINode - Ensure that a PHI node is well formed.
418 void Verifier::visitPHINode(PHINode &PN) {
419 // Ensure that the PHI nodes are all grouped together at the top of the block.
420 // This can be tested by checking whether the instruction before this is
421 // either nonexistent (because this is begin()) or is a PHI node. If not,
422 // then there is some other instruction before a PHI.
423 Assert2(&PN.getParent()->front() == &PN || isa<PHINode>(PN.getPrev()),
424 "PHI nodes not grouped at top of basic block!",
425 &PN, PN.getParent());
427 // Check that all of the operands of the PHI node have the same type as the
429 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
430 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
431 "PHI node operands are not the same type as the result!", &PN);
433 // All other PHI node constraints are checked in the visitBasicBlock method.
435 visitInstruction(PN);
438 void Verifier::visitCallInst(CallInst &CI) {
439 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
440 "Called function must be a pointer!", &CI);
441 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
442 Assert1(isa<FunctionType>(FPTy->getElementType()),
443 "Called function is not pointer to function type!", &CI);
445 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
447 // Verify that the correct number of arguments are being passed
449 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
450 "Called function requires more parameters than were provided!",&CI);
452 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
453 "Incorrect number of arguments passed to called function!", &CI);
455 // Verify that all arguments to the call match the function type...
456 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
457 Assert3(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
458 "Call parameter type does not match function signature!",
459 CI.getOperand(i+1), FTy->getParamType(i), &CI);
461 if (Function *F = CI.getCalledFunction())
462 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
463 visitIntrinsicFunctionCall(ID, CI);
465 visitInstruction(CI);
468 /// visitBinaryOperator - Check that both arguments to the binary operator are
469 /// of the same type!
471 void Verifier::visitBinaryOperator(BinaryOperator &B) {
472 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
473 "Both operands to a binary operator are not of the same type!", &B);
475 // Check that logical operators are only used with integral operands.
476 if (B.getOpcode() == Instruction::And || B.getOpcode() == Instruction::Or ||
477 B.getOpcode() == Instruction::Xor) {
478 Assert1(B.getType()->isIntegral(),
479 "Logical operators only work with integral types!", &B);
480 Assert1(B.getType() == B.getOperand(0)->getType(),
481 "Logical operators must have same type for operands and result!",
483 } else if (isa<SetCondInst>(B)) {
484 // Check that setcc instructions return bool
485 Assert1(B.getType() == Type::BoolTy,
486 "setcc instructions must return boolean values!", &B);
488 // Arithmetic operators only work on integer or fp values
489 Assert1(B.getType() == B.getOperand(0)->getType(),
490 "Arithmetic operators must have same type for operands and result!",
492 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint(),
493 "Arithmetic operators must have integer or fp type!", &B);
499 void Verifier::visitShiftInst(ShiftInst &SI) {
500 Assert1(SI.getType()->isInteger(),
501 "Shift must return an integer result!", &SI);
502 Assert1(SI.getType() == SI.getOperand(0)->getType(),
503 "Shift return type must be same as first operand!", &SI);
504 Assert1(SI.getOperand(1)->getType() == Type::UByteTy,
505 "Second operand to shift must be ubyte type!", &SI);
506 visitInstruction(SI);
509 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
511 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
512 std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true);
513 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
514 Assert2(PointerType::get(ElTy) == GEP.getType(),
515 "GEP is not of right type for indices!", &GEP, ElTy);
516 visitInstruction(GEP);
519 void Verifier::visitLoadInst(LoadInst &LI) {
521 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
522 Assert2(ElTy == LI.getType(),
523 "Load result type does not match pointer operand type!", &LI, ElTy);
524 visitInstruction(LI);
527 void Verifier::visitStoreInst(StoreInst &SI) {
529 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
530 Assert2(ElTy == SI.getOperand(0)->getType(),
531 "Stored value type does not match pointer operand type!", &SI, ElTy);
532 visitInstruction(SI);
536 /// verifyInstruction - Verify that an instruction is well formed.
538 void Verifier::visitInstruction(Instruction &I) {
539 BasicBlock *BB = I.getParent();
540 Assert1(BB, "Instruction not embedded in basic block!", &I);
542 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
543 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
545 Assert1(*UI != (User*)&I ||
546 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
547 "Only PHI nodes may reference their own value!", &I);
550 // Check that void typed values don't have names
551 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
552 "Instruction has a name, but provides a void value!", &I);
554 // Check that the return value of the instruction is either void or a legal
556 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
557 "Instruction returns a non-scalar type!", &I);
559 // Check that all uses of the instruction, if they are instructions
560 // themselves, actually have parent basic blocks. If the use is not an
561 // instruction, it is an error!
562 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
564 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
566 Instruction *Used = cast<Instruction>(*UI);
567 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
568 " embeded in a basic block!", &I, Used);
571 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
572 // Check to make sure that the "address of" an intrinsic function is never
574 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
575 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
576 "Cannot take the address of an intrinsic!", &I);
577 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
578 Assert1(OpBB->getParent() == BB->getParent(),
579 "Referring to a basic block in another function!", &I);
580 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
581 Assert1(OpArg->getParent() == BB->getParent(),
582 "Referring to an argument in another function!", &I);
583 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
584 BasicBlock *OpBlock = Op->getParent();
586 // Check that a definition dominates all of its uses.
587 if (!isa<PHINode>(I)) {
588 // Invoke results are only usable in the normal destination, not in the
589 // exceptional destination.
590 if (InvokeInst *II = dyn_cast<InvokeInst>(Op))
591 OpBlock = II->getNormalDest();
592 else if (OpBlock == BB) {
593 // If they are in the same basic block, make sure that the definition
594 // comes before the use.
595 Assert2(DS->dominates(Op, &I),
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(FT->getParamType(1)->getPrimitiveID() == Type::PointerTyID,
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::setjmp: NumArgs = 1; break;
691 case Intrinsic::longjmp: NumArgs = 2; break;
692 case Intrinsic::sigsetjmp: NumArgs = 2; break;
693 case Intrinsic::siglongjmp: NumArgs = 2; break;
695 case Intrinsic::gcroot:
696 Assert1(FT->getNumParams() == 2,
697 "Illegal # arguments for intrinsic function!", IF);
698 Assert1(isa<Constant>(CI.getOperand(2)) ||
699 isa<GlobalValue>(CI.getOperand(2)),
700 "Second argument to llvm.gcroot must be a constant!", &CI);
703 case Intrinsic::gcread: NumArgs = 1; break;
704 case Intrinsic::gcwrite: NumArgs = 2; break;
706 case Intrinsic::dbg_stoppoint: NumArgs = 4; break;
707 case Intrinsic::dbg_region_start:NumArgs = 1; break;
708 case Intrinsic::dbg_region_end: NumArgs = 1; break;
709 case Intrinsic::dbg_func_start: NumArgs = 1; break;
710 case Intrinsic::dbg_declare: NumArgs = 1; break;
712 case Intrinsic::memcpy: NumArgs = 4; break;
713 case Intrinsic::memmove: NumArgs = 4; break;
714 case Intrinsic::memset: NumArgs = 4; break;
716 case Intrinsic::alpha_ctlz: NumArgs = 1; break;
717 case Intrinsic::alpha_cttz: NumArgs = 1; break;
718 case Intrinsic::alpha_ctpop: NumArgs = 1; break;
719 case Intrinsic::alpha_umulh: NumArgs = 2; break;
720 case Intrinsic::alpha_vecop: NumArgs = 4; break;
721 case Intrinsic::alpha_pup: NumArgs = 3; break;
722 case Intrinsic::alpha_bytezap: NumArgs = 2; break;
723 case Intrinsic::alpha_bytemanip: NumArgs = 3; break;
724 case Intrinsic::alpha_dfpbop: NumArgs = 3; break;
725 case Intrinsic::alpha_dfpuop: NumArgs = 2; break;
726 case Intrinsic::alpha_unordered: NumArgs = 2; break;
727 case Intrinsic::alpha_uqtodfp: NumArgs = 2; break;
728 case Intrinsic::alpha_uqtosfp: NumArgs = 2; break;
729 case Intrinsic::alpha_dfptosq: NumArgs = 2; break;
730 case Intrinsic::alpha_sfptosq: NumArgs = 2; break;
732 case Intrinsic::not_intrinsic:
733 assert(0 && "Invalid intrinsic!"); NumArgs = 0; break;
736 Assert1(FT->getNumParams() == NumArgs || (FT->getNumParams() < NumArgs &&
738 "Illegal # arguments for intrinsic function!", IF);
742 //===----------------------------------------------------------------------===//
743 // Implement the public interfaces to this file...
744 //===----------------------------------------------------------------------===//
746 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
747 return new Verifier(action);
751 // verifyFunction - Create
752 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
753 Function &F = const_cast<Function&>(f);
754 assert(!F.isExternal() && "Cannot verify external functions");
756 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
757 Verifier *V = new Verifier(action);
763 /// verifyModule - Check a module for errors, printing messages on stderr.
764 /// Return true if the module is corrupt.
766 bool llvm::verifyModule(const Module &M, VerifierFailureAction action) {
768 Verifier *V = new Verifier(action);