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"
60 namespace { // Anonymous namespace for class
62 struct Verifier : public FunctionPass, InstVisitor<Verifier> {
63 bool Broken; // Is this module found to be broken?
64 bool RealPass; // Are we not being run by a PassManager?
65 bool AbortBroken; // If broken, should it or should it not abort?
66 Module *Mod; // Module we are verifying right now
67 DominatorSet *DS; // Dominator set, caution can be null!
69 Verifier() : Broken(false), RealPass(true), AbortBroken(true), DS(0) {}
70 Verifier(bool AB) : Broken(false), RealPass(true), AbortBroken(AB), DS(0) {}
71 Verifier(DominatorSet &ds)
72 : Broken(false), RealPass(false), AbortBroken(false), DS(&ds) {}
75 bool doInitialization(Module &M) {
77 verifySymbolTable(M.getSymbolTable());
79 // If this is a real pass, in a pass manager, we must abort before
80 // returning back to the pass manager, or else the pass manager may try to
81 // run other passes on the broken module.
87 bool runOnFunction(Function &F) {
88 // Get dominator information if we are being run by PassManager
89 if (RealPass) DS = &getAnalysis<DominatorSet>();
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.
101 bool doFinalization(Module &M) {
102 // Scan through, checking all of the external function's linkage now...
103 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
104 visitGlobalValue(*I);
106 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
107 visitGlobalValue(*I);
109 // If the module is broken, abort at this time.
114 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
115 AU.setPreservesAll();
117 AU.addRequired<DominatorSet>();
120 /// abortIfBroken - If the module is broken and we are supposed to abort on
121 /// this condition, do so.
123 void abortIfBroken() const {
124 if (Broken && AbortBroken) {
125 std::cerr << "Broken module found, compilation aborted!\n";
131 // Verification methods...
132 void verifySymbolTable(SymbolTable &ST);
133 void visitGlobalValue(GlobalValue &GV);
134 void visitFunction(Function &F);
135 void visitBasicBlock(BasicBlock &BB);
136 void visitPHINode(PHINode &PN);
137 void visitBinaryOperator(BinaryOperator &B);
138 void visitShiftInst(ShiftInst &SI);
139 void visitVANextInst(VANextInst &VAN) { visitInstruction(VAN); }
140 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
141 void visitCallInst(CallInst &CI);
142 void visitGetElementPtrInst(GetElementPtrInst &GEP);
143 void visitLoadInst(LoadInst &LI);
144 void visitStoreInst(StoreInst &SI);
145 void visitInstruction(Instruction &I);
146 void visitTerminatorInst(TerminatorInst &I);
147 void visitReturnInst(ReturnInst &RI);
148 void visitSelectInst(SelectInst &SI);
149 void visitUserOp1(Instruction &I);
150 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
151 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
154 void WriteValue(const Value *V) {
156 if (isa<Instruction>(V)) {
158 } else if (const Type *Ty = dyn_cast<Type>(V)) {
159 WriteTypeSymbolic(std::cerr, Ty, Mod);
161 WriteAsOperand (std::cerr, V, true, true, Mod);
167 // CheckFailed - A check failed, so print out the condition and the message
168 // that failed. This provides a nice place to put a breakpoint if you want
169 // to see why something is not correct.
170 void CheckFailed(const std::string &Message,
171 const Value *V1 = 0, const Value *V2 = 0,
172 const Value *V3 = 0, const Value *V4 = 0) {
173 std::cerr << Message << "\n";
182 RegisterOpt<Verifier> X("verify", "Module Verifier");
183 } // End anonymous namespace
186 // Assert - We know that cond should be true, if not print an error message.
187 #define Assert(C, M) \
188 do { if (!(C)) { CheckFailed(M); return; } } while (0)
189 #define Assert1(C, M, V1) \
190 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
191 #define Assert2(C, M, V1, V2) \
192 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
193 #define Assert3(C, M, V1, V2, V3) \
194 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
195 #define Assert4(C, M, V1, V2, V3, V4) \
196 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
199 void Verifier::visitGlobalValue(GlobalValue &GV) {
200 Assert1(!GV.isExternal() || GV.hasExternalLinkage(),
201 "Global is external, but doesn't have external linkage!", &GV);
202 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
203 "Only global variables can have appending linkage!", &GV);
205 if (GV.hasAppendingLinkage()) {
206 GlobalVariable &GVar = cast<GlobalVariable>(GV);
207 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
208 "Only global arrays can have appending linkage!", &GV);
212 // verifySymbolTable - Verify that a function or module symbol table is ok
214 void Verifier::verifySymbolTable(SymbolTable &ST) {
215 // Loop over all of the types in the symbol table...
216 for (SymbolTable::iterator TI = ST.begin(), TE = ST.end(); TI != TE; ++TI)
217 for (SymbolTable::type_iterator I = TI->second.begin(),
218 E = TI->second.end(); I != E; ++I) {
219 Value *V = I->second;
221 // Check that there are no void typed values in the symbol table. Values
222 // with a void type cannot be put into symbol tables because they cannot
224 Assert1(V->getType() != Type::VoidTy,
225 "Values with void type are not allowed to have names!", V);
230 // visitFunction - Verify that a function is ok.
232 void Verifier::visitFunction(Function &F) {
233 // Check function arguments...
234 const FunctionType *FT = F.getFunctionType();
235 unsigned NumArgs = F.getArgumentList().size();
237 Assert2(FT->getNumParams() == NumArgs,
238 "# formal arguments must match # of arguments for function type!",
240 Assert1(F.getReturnType()->isFirstClassType() ||
241 F.getReturnType() == Type::VoidTy,
242 "Functions cannot return aggregate values!", &F);
244 // Check that the argument values match the function type for this function...
246 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I, ++i)
247 Assert2(I->getType() == FT->getParamType(i),
248 "Argument value does not match function argument type!",
249 I, FT->getParamType(i));
251 if (!F.isExternal()) {
252 verifySymbolTable(F.getSymbolTable());
254 // Check the entry node
255 BasicBlock *Entry = &F.getEntryBlock();
256 Assert1(pred_begin(Entry) == pred_end(Entry),
257 "Entry block to function must not have predecessors!", Entry);
262 // verifyBasicBlock - Verify that a basic block is well formed...
264 void Verifier::visitBasicBlock(BasicBlock &BB) {
265 // Check constraints that this basic block imposes on all of the PHI nodes in
267 if (isa<PHINode>(BB.front())) {
268 std::vector<BasicBlock*> Preds(pred_begin(&BB), pred_end(&BB));
269 std::sort(Preds.begin(), Preds.end());
271 for (BasicBlock::iterator I = BB.begin();
272 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
274 // Ensure that PHI nodes have at least one entry!
275 Assert1(PN->getNumIncomingValues() != 0,
276 "PHI nodes must have at least one entry. If the block is dead, "
277 "the PHI should be removed!", PN);
278 Assert1(PN->getNumIncomingValues() >= Preds.size(),
279 "PHINode has more entries than the basic block has predecessors!",
281 Assert1(PN->getNumIncomingValues() <= Preds.size(),
282 "PHINode has less entries than the basic block has predecessors!",
285 // Get and sort all incoming values in the PHI node...
286 std::vector<std::pair<BasicBlock*, Value*> > Values;
287 Values.reserve(PN->getNumIncomingValues());
288 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
289 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
290 PN->getIncomingValue(i)));
291 std::sort(Values.begin(), Values.end());
293 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
294 // Check to make sure that if there is more than one entry for a
295 // particular basic block in this PHI node, that the incoming values are
298 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
299 Values[i].second == Values[i-1].second,
300 "PHI node has multiple entries for the same basic block with "
301 "different incoming values!", PN, Values[i].first,
302 Values[i].second, Values[i-1].second);
304 // Check to make sure that the predecessors and PHI node entries are
306 Assert3(Values[i].first == Preds[i],
307 "PHI node entries do not match predecessors!", PN,
308 Values[i].first, Preds[i]);
313 // Ensure that basic blocks have terminators!
314 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
317 void Verifier::visitTerminatorInst(TerminatorInst &I) {
318 // Ensure that terminators only exist at the end of the basic block.
319 Assert1(&I == I.getParent()->getTerminator(),
320 "Terminator found in the middle of a basic block!", I.getParent());
324 void Verifier::visitReturnInst(ReturnInst &RI) {
325 Function *F = RI.getParent()->getParent();
326 if (RI.getNumOperands() == 0)
327 Assert1(F->getReturnType() == Type::VoidTy,
328 "Function returns no value, but ret instruction found that does!",
331 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
332 "Function return type does not match operand "
333 "type of return inst!", &RI, F->getReturnType());
335 // Check to make sure that the return value has necessary properties for
337 visitTerminatorInst(RI);
340 void Verifier::visitSelectInst(SelectInst &SI) {
341 Assert1(SI.getCondition()->getType() == Type::BoolTy,
342 "Select condition type must be bool!", &SI);
343 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
344 "Select values must have identical types!", &SI);
345 Assert1(SI.getTrueValue()->getType() == SI.getType(),
346 "Select values must have same type as select instruction!", &SI);
350 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
351 /// a pass, if any exist, it's an error.
353 void Verifier::visitUserOp1(Instruction &I) {
354 Assert1(0, "User-defined operators should not live outside of a pass!",
358 /// visitPHINode - Ensure that a PHI node is well formed.
360 void Verifier::visitPHINode(PHINode &PN) {
361 // Ensure that the PHI nodes are all grouped together at the top of the block.
362 // This can be tested by checking whether the instruction before this is
363 // either nonexistent (because this is begin()) or is a PHI node. If not,
364 // then there is some other instruction before a PHI.
365 Assert2(&PN.getParent()->front() == &PN || isa<PHINode>(PN.getPrev()),
366 "PHI nodes not grouped at top of basic block!",
367 &PN, PN.getParent());
369 // Check that all of the operands of the PHI node have the same type as the
371 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
372 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
373 "PHI node operands are not the same type as the result!", &PN);
375 // All other PHI node constraints are checked in the visitBasicBlock method.
377 visitInstruction(PN);
380 void Verifier::visitCallInst(CallInst &CI) {
381 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
382 "Called function must be a pointer!", &CI);
383 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
384 Assert1(isa<FunctionType>(FPTy->getElementType()),
385 "Called function is not pointer to function type!", &CI);
387 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
389 // Verify that the correct number of arguments are being passed
391 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
392 "Called function requires more parameters than were provided!",&CI);
394 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
395 "Incorrect number of arguments passed to called function!", &CI);
397 // Verify that all arguments to the call match the function type...
398 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
399 Assert3(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
400 "Call parameter type does not match function signature!",
401 CI.getOperand(i+1), FTy->getParamType(i), &CI);
403 if (Function *F = CI.getCalledFunction())
404 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
405 visitIntrinsicFunctionCall(ID, CI);
407 visitInstruction(CI);
410 /// visitBinaryOperator - Check that both arguments to the binary operator are
411 /// of the same type!
413 void Verifier::visitBinaryOperator(BinaryOperator &B) {
414 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
415 "Both operands to a binary operator are not of the same type!", &B);
417 // Check that logical operators are only used with integral operands.
418 if (B.getOpcode() == Instruction::And || B.getOpcode() == Instruction::Or ||
419 B.getOpcode() == Instruction::Xor) {
420 Assert1(B.getType()->isIntegral(),
421 "Logical operators only work with integral types!", &B);
422 Assert1(B.getType() == B.getOperand(0)->getType(),
423 "Logical operators must have same type for operands and result!",
425 } else if (isa<SetCondInst>(B)) {
426 // Check that setcc instructions return bool
427 Assert1(B.getType() == Type::BoolTy,
428 "setcc instructions must return boolean values!", &B);
430 // Arithmetic operators only work on integer or fp values
431 Assert1(B.getType() == B.getOperand(0)->getType(),
432 "Arithmetic operators must have same type for operands and result!",
434 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint(),
435 "Arithmetic operators must have integer or fp type!", &B);
441 void Verifier::visitShiftInst(ShiftInst &SI) {
442 Assert1(SI.getType()->isInteger(),
443 "Shift must return an integer result!", &SI);
444 Assert1(SI.getType() == SI.getOperand(0)->getType(),
445 "Shift return type must be same as first operand!", &SI);
446 Assert1(SI.getOperand(1)->getType() == Type::UByteTy,
447 "Second operand to shift must be ubyte type!", &SI);
448 visitInstruction(SI);
451 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
453 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
454 std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true);
455 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
456 Assert2(PointerType::get(ElTy) == GEP.getType(),
457 "GEP is not of right type for indices!", &GEP, ElTy);
458 visitInstruction(GEP);
461 void Verifier::visitLoadInst(LoadInst &LI) {
463 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
464 Assert2(ElTy == LI.getType(),
465 "Load result type does not match pointer operand type!", &LI, ElTy);
466 visitInstruction(LI);
469 void Verifier::visitStoreInst(StoreInst &SI) {
471 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
472 Assert2(ElTy == SI.getOperand(0)->getType(),
473 "Stored value type does not match pointer operand type!", &SI, ElTy);
474 visitInstruction(SI);
478 /// verifyInstruction - Verify that an instruction is well formed.
480 void Verifier::visitInstruction(Instruction &I) {
481 BasicBlock *BB = I.getParent();
482 Assert1(BB, "Instruction not embedded in basic block!", &I);
484 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
485 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
487 Assert1(*UI != (User*)&I ||
488 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
489 "Only PHI nodes may reference their own value!", &I);
492 // Check that void typed values don't have names
493 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
494 "Instruction has a name, but provides a void value!", &I);
496 // Check that the return value of the instruction is either void or a legal
498 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
499 "Instruction returns a non-scalar type!", &I);
501 // Check that all uses of the instruction, if they are instructions
502 // themselves, actually have parent basic blocks. If the use is not an
503 // instruction, it is an error!
504 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
506 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
508 Instruction *Used = cast<Instruction>(*UI);
509 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
510 " embeded in a basic block!", &I, Used);
513 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
514 // Check to make sure that the "address of" an intrinsic function is never
516 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
517 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
518 "Cannot take the address of an intrinsic!", &I);
519 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
520 Assert1(OpBB->getParent() == BB->getParent(),
521 "Referring to a basic block in another function!", &I);
522 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
523 Assert1(OpArg->getParent() == BB->getParent(),
524 "Referring to an argument in another function!", &I);
525 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
526 BasicBlock *OpBlock = Op->getParent();
528 // Check that a definition dominates all of its uses.
529 if (!isa<PHINode>(I)) {
530 // Invoke results are only usable in the normal destination, not in the
531 // exceptional destination.
532 if (InvokeInst *II = dyn_cast<InvokeInst>(Op))
533 OpBlock = II->getNormalDest();
535 // Definition must dominate use unless use is unreachable!
536 Assert2(DS->dominates(OpBlock, BB) ||
537 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
538 "Instruction does not dominate all uses!", Op, &I);
540 // PHI nodes are more difficult than other nodes because they actually
541 // "use" the value in the predecessor basic blocks they correspond to.
542 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
543 Assert2(DS->dominates(OpBlock, PredBB) ||
544 !DS->dominates(&BB->getParent()->getEntryBlock(), PredBB),
545 "Instruction does not dominate all uses!", Op, &I);
551 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
553 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
554 Function *IF = CI.getCalledFunction();
555 const FunctionType *FT = IF->getFunctionType();
556 Assert1(IF->isExternal(), "Intrinsic functions should never be defined!", IF);
557 unsigned NumArgs = 0;
559 // FIXME: this should check the return type of each intrinsic as well, also
562 case Intrinsic::vastart:
563 Assert1(CI.getParent()->getParent()->getFunctionType()->isVarArg(),
564 "llvm.va_start intrinsic may only occur in function with variable"
568 case Intrinsic::vaend: NumArgs = 1; break;
569 case Intrinsic::vacopy: NumArgs = 1; break;
571 case Intrinsic::returnaddress:
572 case Intrinsic::frameaddress:
573 Assert1(isa<PointerType>(FT->getReturnType()),
574 "llvm.(frame|return)address must return pointers", IF);
575 Assert1(FT->getNumParams() == 1 && isa<ConstantInt>(CI.getOperand(1)),
576 "llvm.(frame|return)address require a single constant integer argument",
581 case Intrinsic::setjmp: NumArgs = 1; break;
582 case Intrinsic::longjmp: NumArgs = 2; break;
583 case Intrinsic::sigsetjmp: NumArgs = 2; break;
584 case Intrinsic::siglongjmp: NumArgs = 2; break;
586 case Intrinsic::dbg_stoppoint: NumArgs = 4; break;
587 case Intrinsic::dbg_region_start:NumArgs = 1; break;
588 case Intrinsic::dbg_region_end: NumArgs = 1; break;
589 case Intrinsic::dbg_func_start: NumArgs = 1; break;
590 case Intrinsic::dbg_declare: NumArgs = 1; break;
592 case Intrinsic::memcpy: NumArgs = 4; break;
593 case Intrinsic::memmove: NumArgs = 4; break;
594 case Intrinsic::memset: NumArgs = 4; break;
596 case Intrinsic::alpha_ctlz: NumArgs = 1; break;
597 case Intrinsic::alpha_cttz: NumArgs = 1; break;
598 case Intrinsic::alpha_ctpop: NumArgs = 1; break;
599 case Intrinsic::alpha_umulh: NumArgs = 2; break;
600 case Intrinsic::alpha_vecop: NumArgs = 4; break;
601 case Intrinsic::alpha_pup: NumArgs = 3; break;
602 case Intrinsic::alpha_bytezap: NumArgs = 2; break;
603 case Intrinsic::alpha_bytemanip: NumArgs = 3; break;
604 case Intrinsic::alpha_dfpbop: NumArgs = 3; break;
605 case Intrinsic::alpha_dfpuop: NumArgs = 2; break;
606 case Intrinsic::alpha_unordered: NumArgs = 2; break;
607 case Intrinsic::alpha_uqtodfp: NumArgs = 2; break;
608 case Intrinsic::alpha_uqtosfp: NumArgs = 2; break;
609 case Intrinsic::alpha_dfptosq: NumArgs = 2; break;
610 case Intrinsic::alpha_sfptosq: NumArgs = 2; break;
612 case Intrinsic::not_intrinsic:
613 assert(0 && "Invalid intrinsic!"); NumArgs = 0; break;
616 Assert1(FT->getNumParams() == NumArgs || (FT->getNumParams() < NumArgs &&
618 "Illegal # arguments for intrinsic function!", IF);
622 //===----------------------------------------------------------------------===//
623 // Implement the public interfaces to this file...
624 //===----------------------------------------------------------------------===//
626 FunctionPass *llvm::createVerifierPass() {
627 return new Verifier();
631 // verifyFunction - Create
632 bool llvm::verifyFunction(const Function &f) {
633 Function &F = const_cast<Function&>(f);
634 assert(!F.isExternal() && "Cannot verify external functions");
636 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
637 Verifier *V = new Verifier();
643 /// verifyModule - Check a module for errors, printing messages on stderr.
644 /// Return true if the module is corrupt.
646 bool llvm::verifyModule(const Module &M) {
648 Verifier *V = new Verifier();