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 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
119 visitGlobalValue(*I);
121 // If the module is broken, abort at this time.
126 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
127 AU.setPreservesAll();
129 AU.addRequired<DominatorSet>();
132 /// abortIfBroken - If the module is broken and we are supposed to abort on
133 /// this condition, do so.
135 void abortIfBroken() {
138 msgs << "Broken module found, ";
141 case AbortProcessAction:
142 msgs << "compilation aborted!\n";
143 std::cerr << msgs.str();
145 case ThrowExceptionAction:
146 msgs << "verification terminated.\n";
148 case PrintMessageAction:
149 msgs << "verification continues.\n";
150 std::cerr << msgs.str();
152 case ReturnStatusAction:
159 // Verification methods...
160 void verifySymbolTable(SymbolTable &ST);
161 void visitGlobalValue(GlobalValue &GV);
162 void visitFunction(Function &F);
163 void visitBasicBlock(BasicBlock &BB);
164 void visitPHINode(PHINode &PN);
165 void visitBinaryOperator(BinaryOperator &B);
166 void visitShiftInst(ShiftInst &SI);
167 void visitVANextInst(VANextInst &VAN) { visitInstruction(VAN); }
168 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
169 void visitCallInst(CallInst &CI);
170 void visitGetElementPtrInst(GetElementPtrInst &GEP);
171 void visitLoadInst(LoadInst &LI);
172 void visitStoreInst(StoreInst &SI);
173 void visitInstruction(Instruction &I);
174 void visitTerminatorInst(TerminatorInst &I);
175 void visitReturnInst(ReturnInst &RI);
176 void visitSwitchInst(SwitchInst &SI);
177 void visitSelectInst(SelectInst &SI);
178 void visitUserOp1(Instruction &I);
179 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
180 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
183 void WriteValue(const Value *V) {
185 if (isa<Instruction>(V)) {
187 } else if (const Type *Ty = dyn_cast<Type>(V)) {
188 WriteTypeSymbolic(msgs, Ty, Mod);
190 WriteAsOperand (msgs, V, true, true, Mod);
196 // CheckFailed - A check failed, so print out the condition and the message
197 // that failed. This provides a nice place to put a breakpoint if you want
198 // to see why something is not correct.
199 void CheckFailed(const std::string &Message,
200 const Value *V1 = 0, const Value *V2 = 0,
201 const Value *V3 = 0, const Value *V4 = 0) {
202 msgs << Message << "\n";
211 RegisterOpt<Verifier> X("verify", "Module Verifier");
212 } // End anonymous namespace
215 // Assert - We know that cond should be true, if not print an error message.
216 #define Assert(C, M) \
217 do { if (!(C)) { CheckFailed(M); return; } } while (0)
218 #define Assert1(C, M, V1) \
219 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
220 #define Assert2(C, M, V1, V2) \
221 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
222 #define Assert3(C, M, V1, V2, V3) \
223 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
224 #define Assert4(C, M, V1, V2, V3, V4) \
225 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
228 void Verifier::visitGlobalValue(GlobalValue &GV) {
229 Assert1(!GV.isExternal() || GV.hasExternalLinkage(),
230 "Global is external, but doesn't have external linkage!", &GV);
231 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
232 "Only global variables can have appending linkage!", &GV);
234 if (GV.hasAppendingLinkage()) {
235 GlobalVariable &GVar = cast<GlobalVariable>(GV);
236 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
237 "Only global arrays can have appending linkage!", &GV);
241 // verifySymbolTable - Verify that a function or module symbol table is ok
243 void Verifier::verifySymbolTable(SymbolTable &ST) {
244 // Loop over all of the types in the symbol table...
245 for (SymbolTable::iterator TI = ST.begin(), TE = ST.end(); TI != TE; ++TI)
246 for (SymbolTable::type_iterator I = TI->second.begin(),
247 E = TI->second.end(); I != E; ++I) {
248 Value *V = I->second;
250 // Check that there are no void typed values in the symbol table. Values
251 // with a void type cannot be put into symbol tables because they cannot
253 Assert1(V->getType() != Type::VoidTy,
254 "Values with void type are not allowed to have names!", V);
259 // visitFunction - Verify that a function is ok.
261 void Verifier::visitFunction(Function &F) {
262 // Check function arguments...
263 const FunctionType *FT = F.getFunctionType();
264 unsigned NumArgs = F.getArgumentList().size();
266 Assert2(FT->getNumParams() == NumArgs,
267 "# formal arguments must match # of arguments for function type!",
269 Assert1(F.getReturnType()->isFirstClassType() ||
270 F.getReturnType() == Type::VoidTy,
271 "Functions cannot return aggregate values!", &F);
273 // Check that the argument values match the function type for this function...
275 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I, ++i)
276 Assert2(I->getType() == FT->getParamType(i),
277 "Argument value does not match function argument type!",
278 I, FT->getParamType(i));
280 if (!F.isExternal()) {
281 verifySymbolTable(F.getSymbolTable());
283 // Check the entry node
284 BasicBlock *Entry = &F.getEntryBlock();
285 Assert1(pred_begin(Entry) == pred_end(Entry),
286 "Entry block to function must not have predecessors!", Entry);
291 // verifyBasicBlock - Verify that a basic block is well formed...
293 void Verifier::visitBasicBlock(BasicBlock &BB) {
294 // Check constraints that this basic block imposes on all of the PHI nodes in
296 if (isa<PHINode>(BB.front())) {
297 std::vector<BasicBlock*> Preds(pred_begin(&BB), pred_end(&BB));
298 std::sort(Preds.begin(), Preds.end());
300 for (BasicBlock::iterator I = BB.begin();
301 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
303 // Ensure that PHI nodes have at least one entry!
304 Assert1(PN->getNumIncomingValues() != 0,
305 "PHI nodes must have at least one entry. If the block is dead, "
306 "the PHI should be removed!", PN);
307 Assert1(PN->getNumIncomingValues() == Preds.size(),
308 "PHINode should have one entry for each predecessor of its "
309 "parent basic block!", PN);
311 // Get and sort all incoming values in the PHI node...
312 std::vector<std::pair<BasicBlock*, Value*> > Values;
313 Values.reserve(PN->getNumIncomingValues());
314 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
315 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
316 PN->getIncomingValue(i)));
317 std::sort(Values.begin(), Values.end());
319 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
320 // Check to make sure that if there is more than one entry for a
321 // particular basic block in this PHI node, that the incoming values are
324 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
325 Values[i].second == Values[i-1].second,
326 "PHI node has multiple entries for the same basic block with "
327 "different incoming values!", PN, Values[i].first,
328 Values[i].second, Values[i-1].second);
330 // Check to make sure that the predecessors and PHI node entries are
332 Assert3(Values[i].first == Preds[i],
333 "PHI node entries do not match predecessors!", PN,
334 Values[i].first, Preds[i]);
339 // Ensure that basic blocks have terminators!
340 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
343 void Verifier::visitTerminatorInst(TerminatorInst &I) {
344 // Ensure that terminators only exist at the end of the basic block.
345 Assert1(&I == I.getParent()->getTerminator(),
346 "Terminator found in the middle of a basic block!", I.getParent());
350 void Verifier::visitReturnInst(ReturnInst &RI) {
351 Function *F = RI.getParent()->getParent();
352 if (RI.getNumOperands() == 0)
353 Assert1(F->getReturnType() == Type::VoidTy,
354 "Function returns no value, but ret instruction found that does!",
357 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
358 "Function return type does not match operand "
359 "type of return inst!", &RI, F->getReturnType());
361 // Check to make sure that the return value has necessary properties for
363 visitTerminatorInst(RI);
366 void Verifier::visitSwitchInst(SwitchInst &SI) {
367 // Check to make sure that all of the constants in the switch instruction
368 // have the same type as the switched-on value.
369 const Type *SwitchTy = SI.getCondition()->getType();
370 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
371 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
372 "Switch constants must all be same type as switch value!", &SI);
374 visitTerminatorInst(SI);
377 void Verifier::visitSelectInst(SelectInst &SI) {
378 Assert1(SI.getCondition()->getType() == Type::BoolTy,
379 "Select condition type must be bool!", &SI);
380 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
381 "Select values must have identical types!", &SI);
382 Assert1(SI.getTrueValue()->getType() == SI.getType(),
383 "Select values must have same type as select instruction!", &SI);
387 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
388 /// a pass, if any exist, it's an error.
390 void Verifier::visitUserOp1(Instruction &I) {
391 Assert1(0, "User-defined operators should not live outside of a pass!",
395 /// visitPHINode - Ensure that a PHI node is well formed.
397 void Verifier::visitPHINode(PHINode &PN) {
398 // Ensure that the PHI nodes are all grouped together at the top of the block.
399 // This can be tested by checking whether the instruction before this is
400 // either nonexistent (because this is begin()) or is a PHI node. If not,
401 // then there is some other instruction before a PHI.
402 Assert2(&PN.getParent()->front() == &PN || isa<PHINode>(PN.getPrev()),
403 "PHI nodes not grouped at top of basic block!",
404 &PN, PN.getParent());
406 // Check that all of the operands of the PHI node have the same type as the
408 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
409 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
410 "PHI node operands are not the same type as the result!", &PN);
412 // All other PHI node constraints are checked in the visitBasicBlock method.
414 visitInstruction(PN);
417 void Verifier::visitCallInst(CallInst &CI) {
418 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
419 "Called function must be a pointer!", &CI);
420 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
421 Assert1(isa<FunctionType>(FPTy->getElementType()),
422 "Called function is not pointer to function type!", &CI);
424 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
426 // Verify that the correct number of arguments are being passed
428 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
429 "Called function requires more parameters than were provided!",&CI);
431 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
432 "Incorrect number of arguments passed to called function!", &CI);
434 // Verify that all arguments to the call match the function type...
435 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
436 Assert3(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
437 "Call parameter type does not match function signature!",
438 CI.getOperand(i+1), FTy->getParamType(i), &CI);
440 if (Function *F = CI.getCalledFunction())
441 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
442 visitIntrinsicFunctionCall(ID, CI);
444 visitInstruction(CI);
447 /// visitBinaryOperator - Check that both arguments to the binary operator are
448 /// of the same type!
450 void Verifier::visitBinaryOperator(BinaryOperator &B) {
451 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
452 "Both operands to a binary operator are not of the same type!", &B);
454 // Check that logical operators are only used with integral operands.
455 if (B.getOpcode() == Instruction::And || B.getOpcode() == Instruction::Or ||
456 B.getOpcode() == Instruction::Xor) {
457 Assert1(B.getType()->isIntegral(),
458 "Logical operators only work with integral types!", &B);
459 Assert1(B.getType() == B.getOperand(0)->getType(),
460 "Logical operators must have same type for operands and result!",
462 } else if (isa<SetCondInst>(B)) {
463 // Check that setcc instructions return bool
464 Assert1(B.getType() == Type::BoolTy,
465 "setcc instructions must return boolean values!", &B);
467 // Arithmetic operators only work on integer or fp values
468 Assert1(B.getType() == B.getOperand(0)->getType(),
469 "Arithmetic operators must have same type for operands and result!",
471 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint(),
472 "Arithmetic operators must have integer or fp type!", &B);
478 void Verifier::visitShiftInst(ShiftInst &SI) {
479 Assert1(SI.getType()->isInteger(),
480 "Shift must return an integer result!", &SI);
481 Assert1(SI.getType() == SI.getOperand(0)->getType(),
482 "Shift return type must be same as first operand!", &SI);
483 Assert1(SI.getOperand(1)->getType() == Type::UByteTy,
484 "Second operand to shift must be ubyte type!", &SI);
485 visitInstruction(SI);
488 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
490 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
491 std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true);
492 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
493 Assert2(PointerType::get(ElTy) == GEP.getType(),
494 "GEP is not of right type for indices!", &GEP, ElTy);
495 visitInstruction(GEP);
498 void Verifier::visitLoadInst(LoadInst &LI) {
500 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
501 Assert2(ElTy == LI.getType(),
502 "Load result type does not match pointer operand type!", &LI, ElTy);
503 visitInstruction(LI);
506 void Verifier::visitStoreInst(StoreInst &SI) {
508 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
509 Assert2(ElTy == SI.getOperand(0)->getType(),
510 "Stored value type does not match pointer operand type!", &SI, ElTy);
511 visitInstruction(SI);
515 /// verifyInstruction - Verify that an instruction is well formed.
517 void Verifier::visitInstruction(Instruction &I) {
518 BasicBlock *BB = I.getParent();
519 Assert1(BB, "Instruction not embedded in basic block!", &I);
521 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
522 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
524 Assert1(*UI != (User*)&I ||
525 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
526 "Only PHI nodes may reference their own value!", &I);
529 // Check that void typed values don't have names
530 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
531 "Instruction has a name, but provides a void value!", &I);
533 // Check that the return value of the instruction is either void or a legal
535 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
536 "Instruction returns a non-scalar type!", &I);
538 // Check that all uses of the instruction, if they are instructions
539 // themselves, actually have parent basic blocks. If the use is not an
540 // instruction, it is an error!
541 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
543 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
545 Instruction *Used = cast<Instruction>(*UI);
546 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
547 " embeded in a basic block!", &I, Used);
550 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
551 // Check to make sure that the "address of" an intrinsic function is never
553 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
554 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
555 "Cannot take the address of an intrinsic!", &I);
556 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
557 Assert1(OpBB->getParent() == BB->getParent(),
558 "Referring to a basic block in another function!", &I);
559 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
560 Assert1(OpArg->getParent() == BB->getParent(),
561 "Referring to an argument in another function!", &I);
562 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
563 BasicBlock *OpBlock = Op->getParent();
565 // Check that a definition dominates all of its uses.
566 if (!isa<PHINode>(I)) {
567 // Invoke results are only usable in the normal destination, not in the
568 // exceptional destination.
569 if (InvokeInst *II = dyn_cast<InvokeInst>(Op))
570 OpBlock = II->getNormalDest();
571 else if (OpBlock == BB) {
572 // If they are in the same basic block, make sure that the definition
573 // comes before the use.
574 Assert2(DS->dominates(Op, &I),
575 "Instruction does not dominate all uses!", Op, &I);
578 // Definition must dominate use unless use is unreachable!
579 Assert2(DS->dominates(OpBlock, BB) ||
580 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
581 "Instruction does not dominate all uses!", Op, &I);
583 // PHI nodes are more difficult than other nodes because they actually
584 // "use" the value in the predecessor basic blocks they correspond to.
585 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
586 Assert2(DS->dominates(OpBlock, PredBB) ||
587 !DS->dominates(&BB->getParent()->getEntryBlock(), PredBB),
588 "Instruction does not dominate all uses!", Op, &I);
594 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
596 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
597 Function *IF = CI.getCalledFunction();
598 const FunctionType *FT = IF->getFunctionType();
599 Assert1(IF->isExternal(), "Intrinsic functions should never be defined!", IF);
600 unsigned NumArgs = 0;
602 // FIXME: this should check the return type of each intrinsic as well, also
605 case Intrinsic::vastart:
606 Assert1(CI.getParent()->getParent()->getFunctionType()->isVarArg(),
607 "llvm.va_start intrinsic may only occur in function with variable"
611 case Intrinsic::vaend: NumArgs = 1; break;
612 case Intrinsic::vacopy: NumArgs = 1; break;
614 case Intrinsic::returnaddress:
615 case Intrinsic::frameaddress:
616 Assert1(isa<PointerType>(FT->getReturnType()),
617 "llvm.(frame|return)address must return pointers", IF);
618 Assert1(FT->getNumParams() == 1 && isa<ConstantInt>(CI.getOperand(1)),
619 "llvm.(frame|return)address require a single constant integer argument",
624 // Verify that read and write port have integral parameters of the correct
626 case Intrinsic::writeport:
627 Assert1(FT->getNumParams() == 2,
628 "Illegal # arguments for intrinsic function!", IF);
629 Assert1(FT->getParamType(0)->isIntegral(),
630 "First argument not unsigned int!", IF);
631 Assert1(FT->getParamType(1)->isUnsigned(),
632 "First argument not unsigned int!", IF);
636 case Intrinsic::writeio:
637 Assert1(FT->getNumParams() == 2,
638 "Illegal # arguments for intrinsic function!", IF);
639 Assert1(FT->getParamType(0)->isFirstClassType(),
640 "First argument not a first class type!", IF);
641 Assert1(FT->getParamType(1)->getPrimitiveID() == Type::PointerTyID,
642 "Second argument not a pointer!", IF);
646 case Intrinsic::readport:
647 Assert1(FT->getNumParams() == 1,
648 "Illegal # arguments for intrinsic function!", IF);
649 Assert1(FT->getReturnType()->isFirstClassType(),
650 "Return type is not a first class type!", IF);
651 Assert1(FT->getParamType(0)->isUnsigned(),
652 "First argument not unsigned int!", IF);
656 case Intrinsic:: readio: {
657 const Type * ParamType = FT->getParamType(0);
658 const Type * ReturnType = FT->getReturnType();
660 Assert1(FT->getNumParams() == 1,
661 "Illegal # arguments for intrinsic function!", IF);
662 Assert1(isa<PointerType>(ParamType),
663 "First argument not a pointer!", IF);
664 Assert1(((cast<PointerType>(ParamType)->getElementType()) == ReturnType),
665 "Pointer type doesn't match return type!", IF);
670 case Intrinsic::setjmp: NumArgs = 1; break;
671 case Intrinsic::longjmp: NumArgs = 2; break;
672 case Intrinsic::sigsetjmp: NumArgs = 2; break;
673 case Intrinsic::siglongjmp: NumArgs = 2; break;
675 case Intrinsic::dbg_stoppoint: NumArgs = 4; break;
676 case Intrinsic::dbg_region_start:NumArgs = 1; break;
677 case Intrinsic::dbg_region_end: NumArgs = 1; break;
678 case Intrinsic::dbg_func_start: NumArgs = 1; break;
679 case Intrinsic::dbg_declare: NumArgs = 1; break;
681 case Intrinsic::memcpy: NumArgs = 4; break;
682 case Intrinsic::memmove: NumArgs = 4; break;
683 case Intrinsic::memset: NumArgs = 4; break;
685 case Intrinsic::alpha_ctlz: NumArgs = 1; break;
686 case Intrinsic::alpha_cttz: NumArgs = 1; break;
687 case Intrinsic::alpha_ctpop: NumArgs = 1; break;
688 case Intrinsic::alpha_umulh: NumArgs = 2; break;
689 case Intrinsic::alpha_vecop: NumArgs = 4; break;
690 case Intrinsic::alpha_pup: NumArgs = 3; break;
691 case Intrinsic::alpha_bytezap: NumArgs = 2; break;
692 case Intrinsic::alpha_bytemanip: NumArgs = 3; break;
693 case Intrinsic::alpha_dfpbop: NumArgs = 3; break;
694 case Intrinsic::alpha_dfpuop: NumArgs = 2; break;
695 case Intrinsic::alpha_unordered: NumArgs = 2; break;
696 case Intrinsic::alpha_uqtodfp: NumArgs = 2; break;
697 case Intrinsic::alpha_uqtosfp: NumArgs = 2; break;
698 case Intrinsic::alpha_dfptosq: NumArgs = 2; break;
699 case Intrinsic::alpha_sfptosq: NumArgs = 2; break;
701 case Intrinsic::not_intrinsic:
702 assert(0 && "Invalid intrinsic!"); NumArgs = 0; break;
705 Assert1(FT->getNumParams() == NumArgs || (FT->getNumParams() < NumArgs &&
707 "Illegal # arguments for intrinsic function!", IF);
711 //===----------------------------------------------------------------------===//
712 // Implement the public interfaces to this file...
713 //===----------------------------------------------------------------------===//
715 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
716 return new Verifier(action);
720 // verifyFunction - Create
721 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
722 Function &F = const_cast<Function&>(f);
723 assert(!F.isExternal() && "Cannot verify external functions");
725 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
726 Verifier *V = new Verifier(action);
732 /// verifyModule - Check a module for errors, printing messages on stderr.
733 /// Return true if the module is corrupt.
735 bool llvm::verifyModule(const Module &M, VerifierFailureAction action) {
737 Verifier *V = new Verifier(action);