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/CallingConv.h"
45 #include "llvm/Constants.h"
46 #include "llvm/Pass.h"
47 #include "llvm/Module.h"
48 #include "llvm/ModuleProvider.h"
49 #include "llvm/ParameterAttributes.h"
50 #include "llvm/DerivedTypes.h"
51 #include "llvm/InlineAsm.h"
52 #include "llvm/Instructions.h"
53 #include "llvm/Intrinsics.h"
54 #include "llvm/PassManager.h"
55 #include "llvm/Analysis/Dominators.h"
56 #include "llvm/CodeGen/ValueTypes.h"
57 #include "llvm/Support/CFG.h"
58 #include "llvm/Support/InstVisitor.h"
59 #include "llvm/Support/Streams.h"
60 #include "llvm/ADT/SmallPtrSet.h"
61 #include "llvm/ADT/SmallVector.h"
62 #include "llvm/ADT/StringExtras.h"
63 #include "llvm/ADT/STLExtras.h"
64 #include "llvm/Support/Compiler.h"
70 namespace { // Anonymous namespace for class
72 struct VISIBILITY_HIDDEN
73 Verifier : public FunctionPass, InstVisitor<Verifier> {
74 static char ID; // Pass ID, replacement for typeid
75 bool Broken; // Is this module found to be broken?
76 bool RealPass; // Are we not being run by a PassManager?
77 VerifierFailureAction action;
78 // What to do if verification fails.
79 Module *Mod; // Module we are verifying right now
80 DominatorTree *DT; // Dominator Tree, caution can be null!
81 std::stringstream msgs; // A stringstream to collect messages
83 /// InstInThisBlock - when verifying a basic block, keep track of all of the
84 /// instructions we have seen so far. This allows us to do efficient
85 /// dominance checks for the case when an instruction has an operand that is
86 /// an instruction in the same block.
87 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
90 : FunctionPass((intptr_t)&ID),
91 Broken(false), RealPass(true), action(AbortProcessAction),
92 DT(0), msgs( std::ios::app | std::ios::out ) {}
93 Verifier( VerifierFailureAction ctn )
94 : FunctionPass((intptr_t)&ID),
95 Broken(false), RealPass(true), action(ctn), DT(0),
96 msgs( std::ios::app | std::ios::out ) {}
98 : FunctionPass((intptr_t)&ID),
99 Broken(false), RealPass(true),
100 action( AB ? AbortProcessAction : PrintMessageAction), DT(0),
101 msgs( std::ios::app | std::ios::out ) {}
102 Verifier(DominatorTree &dt)
103 : FunctionPass((intptr_t)&ID),
104 Broken(false), RealPass(false), action(PrintMessageAction),
105 DT(&dt), msgs( std::ios::app | std::ios::out ) {}
108 bool doInitialization(Module &M) {
110 verifyTypeSymbolTable(M.getTypeSymbolTable());
112 // If this is a real pass, in a pass manager, we must abort before
113 // returning back to the pass manager, or else the pass manager may try to
114 // run other passes on the broken module.
116 return abortIfBroken();
120 bool runOnFunction(Function &F) {
121 // Get dominator information if we are being run by PassManager
122 if (RealPass) DT = &getAnalysis<DominatorTree>();
127 InstsInThisBlock.clear();
129 // If this is a real pass, in a pass manager, we must abort before
130 // returning back to the pass manager, or else the pass manager may try to
131 // run other passes on the broken module.
133 return abortIfBroken();
138 bool doFinalization(Module &M) {
139 // Scan through, checking all of the external function's linkage now...
140 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
141 visitGlobalValue(*I);
143 // Check to make sure function prototypes are okay.
144 if (I->isDeclaration()) visitFunction(*I);
147 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
149 visitGlobalVariable(*I);
151 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
153 visitGlobalAlias(*I);
155 // If the module is broken, abort at this time.
156 return abortIfBroken();
159 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
160 AU.setPreservesAll();
162 AU.addRequired<DominatorTree>();
165 /// abortIfBroken - If the module is broken and we are supposed to abort on
166 /// this condition, do so.
168 bool abortIfBroken() {
170 msgs << "Broken module found, ";
172 case AbortProcessAction:
173 msgs << "compilation aborted!\n";
176 case PrintMessageAction:
177 msgs << "verification continues.\n";
180 case ReturnStatusAction:
181 msgs << "compilation terminated.\n";
189 // Verification methods...
190 void verifyTypeSymbolTable(TypeSymbolTable &ST);
191 void visitGlobalValue(GlobalValue &GV);
192 void visitGlobalVariable(GlobalVariable &GV);
193 void visitGlobalAlias(GlobalAlias &GA);
194 void visitFunction(Function &F);
195 void visitBasicBlock(BasicBlock &BB);
196 void visitTruncInst(TruncInst &I);
197 void visitZExtInst(ZExtInst &I);
198 void visitSExtInst(SExtInst &I);
199 void visitFPTruncInst(FPTruncInst &I);
200 void visitFPExtInst(FPExtInst &I);
201 void visitFPToUIInst(FPToUIInst &I);
202 void visitFPToSIInst(FPToSIInst &I);
203 void visitUIToFPInst(UIToFPInst &I);
204 void visitSIToFPInst(SIToFPInst &I);
205 void visitIntToPtrInst(IntToPtrInst &I);
206 void visitPtrToIntInst(PtrToIntInst &I);
207 void visitBitCastInst(BitCastInst &I);
208 void visitPHINode(PHINode &PN);
209 void visitBinaryOperator(BinaryOperator &B);
210 void visitICmpInst(ICmpInst &IC);
211 void visitFCmpInst(FCmpInst &FC);
212 void visitExtractElementInst(ExtractElementInst &EI);
213 void visitInsertElementInst(InsertElementInst &EI);
214 void visitShuffleVectorInst(ShuffleVectorInst &EI);
215 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
216 void visitCallInst(CallInst &CI);
217 void visitGetElementPtrInst(GetElementPtrInst &GEP);
218 void visitLoadInst(LoadInst &LI);
219 void visitStoreInst(StoreInst &SI);
220 void visitInstruction(Instruction &I);
221 void visitTerminatorInst(TerminatorInst &I);
222 void visitReturnInst(ReturnInst &RI);
223 void visitSwitchInst(SwitchInst &SI);
224 void visitSelectInst(SelectInst &SI);
225 void visitUserOp1(Instruction &I);
226 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
227 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
229 void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
230 unsigned Count, ...);
232 void WriteValue(const Value *V) {
234 if (isa<Instruction>(V)) {
237 WriteAsOperand(msgs, V, true, Mod);
242 void WriteType(const Type* T ) {
244 WriteTypeSymbolic(msgs, T, Mod );
248 // CheckFailed - A check failed, so print out the condition and the message
249 // that failed. This provides a nice place to put a breakpoint if you want
250 // to see why something is not correct.
251 void CheckFailed(const std::string &Message,
252 const Value *V1 = 0, const Value *V2 = 0,
253 const Value *V3 = 0, const Value *V4 = 0) {
254 msgs << Message << "\n";
262 void CheckFailed( const std::string& Message, const Value* V1,
263 const Type* T2, const Value* V3 = 0 ) {
264 msgs << Message << "\n";
272 char Verifier::ID = 0;
273 RegisterPass<Verifier> X("verify", "Module Verifier");
274 } // End anonymous namespace
277 // Assert - We know that cond should be true, if not print an error message.
278 #define Assert(C, M) \
279 do { if (!(C)) { CheckFailed(M); return; } } while (0)
280 #define Assert1(C, M, V1) \
281 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
282 #define Assert2(C, M, V1, V2) \
283 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
284 #define Assert3(C, M, V1, V2, V3) \
285 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
286 #define Assert4(C, M, V1, V2, V3, V4) \
287 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
290 void Verifier::visitGlobalValue(GlobalValue &GV) {
291 Assert1(!GV.isDeclaration() ||
292 GV.hasExternalLinkage() ||
293 GV.hasDLLImportLinkage() ||
294 GV.hasExternalWeakLinkage() ||
295 (isa<GlobalAlias>(GV) &&
296 (GV.hasInternalLinkage() || GV.hasWeakLinkage())),
297 "Global is external, but doesn't have external or dllimport or weak linkage!",
300 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
301 "Global is marked as dllimport, but not external", &GV);
303 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
304 "Only global variables can have appending linkage!", &GV);
306 if (GV.hasAppendingLinkage()) {
307 GlobalVariable &GVar = cast<GlobalVariable>(GV);
308 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
309 "Only global arrays can have appending linkage!", &GV);
313 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
314 if (GV.hasInitializer())
315 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
316 "Global variable initializer type does not match global "
317 "variable type!", &GV);
319 visitGlobalValue(GV);
322 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
323 Assert1(!GA.getName().empty(),
324 "Alias name cannot be empty!", &GA);
325 Assert1(GA.hasExternalLinkage() || GA.hasInternalLinkage() ||
327 "Alias should have external or external weak linkage!", &GA);
328 Assert1(GA.getType() == GA.getAliasee()->getType(),
329 "Alias and aliasee types should match!", &GA);
331 if (!isa<GlobalValue>(GA.getAliasee())) {
332 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
333 Assert1(CE && CE->getOpcode() == Instruction::BitCast &&
334 isa<GlobalValue>(CE->getOperand(0)),
335 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
339 visitGlobalValue(GA);
342 void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
345 // visitFunction - Verify that a function is ok.
347 void Verifier::visitFunction(Function &F) {
348 // Check function arguments.
349 const FunctionType *FT = F.getFunctionType();
350 unsigned NumArgs = F.arg_size();
352 Assert2(FT->getNumParams() == NumArgs,
353 "# formal arguments must match # of arguments for function type!",
355 Assert1(F.getReturnType()->isFirstClassType() ||
356 F.getReturnType() == Type::VoidTy,
357 "Functions cannot return aggregate values!", &F);
359 Assert1(!FT->isStructReturn() || FT->getReturnType() == Type::VoidTy,
360 "Invalid struct-return function!", &F);
362 const uint16_t ReturnIncompatible =
363 ParamAttr::ByVal | ParamAttr::InReg |
364 ParamAttr::Nest | ParamAttr::StructRet;
366 const uint16_t ParameterIncompatible =
367 ParamAttr::NoReturn | ParamAttr::NoUnwind;
369 const uint16_t MutuallyIncompatible =
370 ParamAttr::ByVal | ParamAttr::InReg |
371 ParamAttr::Nest | ParamAttr::StructRet;
373 const uint16_t MutuallyIncompatible2 =
374 ParamAttr::ZExt | ParamAttr::SExt;
376 const uint16_t IntegerTypeOnly =
377 ParamAttr::SExt | ParamAttr::ZExt;
379 const uint16_t PointerTypeOnly =
380 ParamAttr::ByVal | ParamAttr::Nest |
381 ParamAttr::NoAlias | ParamAttr::StructRet;
383 bool SawSRet = false;
385 if (const ParamAttrsList *Attrs = FT->getParamAttrs()) {
387 bool SawNest = false;
389 uint16_t RetI = Attrs->getParamAttrs(0) & ReturnIncompatible;
390 Assert1(!RetI, "Attribute " + Attrs->getParamAttrsText(RetI) +
391 "should not apply to functions!", &F);
392 uint16_t MutI = Attrs->getParamAttrs(0) & MutuallyIncompatible2;
393 Assert1(MutI != MutuallyIncompatible2, "Attributes" +
394 Attrs->getParamAttrsText(MutI) + "are incompatible!", &F);
396 for (FunctionType::param_iterator I = FT->param_begin(),
397 E = FT->param_end(); I != E; ++I, ++Idx) {
399 uint16_t Attr = Attrs->getParamAttrs(Idx);
401 uint16_t ParmI = Attr & ParameterIncompatible;
402 Assert1(!ParmI, "Attribute " + Attrs->getParamAttrsText(ParmI) +
403 "should only be applied to function!", &F);
405 uint16_t MutI = Attr & MutuallyIncompatible;
406 Assert1(!(MutI & (MutI - 1)), "Attributes " +
407 Attrs->getParamAttrsText(MutI) + "are incompatible!", &F);
409 uint16_t MutI2 = Attr & MutuallyIncompatible2;
410 Assert1(MutI2 != MutuallyIncompatible2, "Attributes" +
411 Attrs->getParamAttrsText(MutI2) + "are incompatible!", &F);
413 uint16_t IType = Attr & IntegerTypeOnly;
414 Assert1(!IType || FT->getParamType(Idx-1)->isInteger(),
415 "Attribute " + Attrs->getParamAttrsText(IType) +
416 "should only apply to Integer type!", &F);
418 uint16_t PType = Attr & PointerTypeOnly;
419 Assert1(!PType || isa<PointerType>(FT->getParamType(Idx-1)),
420 "Attribute " + Attrs->getParamAttrsText(PType) +
421 "should only apply to Pointer type!", &F);
423 if (Attrs->paramHasAttr(Idx, ParamAttr::ByVal)) {
424 const PointerType *Ty =
425 dyn_cast<PointerType>(FT->getParamType(Idx-1));
426 Assert1(!Ty || isa<StructType>(Ty->getElementType()),
427 "Attribute byval should only apply to pointer to structs!", &F);
430 if (Attrs->paramHasAttr(Idx, ParamAttr::Nest)) {
431 Assert1(!SawNest, "More than one parameter has attribute nest!", &F);
435 if (Attrs->paramHasAttr(Idx, ParamAttr::StructRet)) {
437 Assert1(Idx == 1, "Attribute sret not on first parameter!", &F);
442 Assert1(SawSRet == FT->isStructReturn(),
443 "StructReturn function with no sret attribute!", &F);
445 // Check that this function meets the restrictions on this calling convention.
446 switch (F.getCallingConv()) {
451 case CallingConv::Fast:
452 case CallingConv::Cold:
453 case CallingConv::X86_FastCall:
454 Assert1(!F.isVarArg(),
455 "Varargs functions must have C calling conventions!", &F);
459 // Check that the argument values match the function type for this function...
461 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
463 Assert2(I->getType() == FT->getParamType(i),
464 "Argument value does not match function argument type!",
465 I, FT->getParamType(i));
466 // Make sure no aggregates are passed by value.
467 Assert1(I->getType()->isFirstClassType(),
468 "Functions cannot take aggregates as arguments by value!", I);
471 if (!F.isDeclaration()) {
472 // Verify that this function (which has a body) is not named "llvm.*". It
473 // is not legal to define intrinsics.
474 if (F.getName().size() >= 5)
475 Assert1(F.getName().substr(0, 5) != "llvm.",
476 "llvm intrinsics cannot be defined!", &F);
478 // Check the entry node
479 BasicBlock *Entry = &F.getEntryBlock();
480 Assert1(pred_begin(Entry) == pred_end(Entry),
481 "Entry block to function must not have predecessors!", Entry);
486 // verifyBasicBlock - Verify that a basic block is well formed...
488 void Verifier::visitBasicBlock(BasicBlock &BB) {
489 InstsInThisBlock.clear();
491 // Ensure that basic blocks have terminators!
492 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
494 // Check constraints that this basic block imposes on all of the PHI nodes in
496 if (isa<PHINode>(BB.front())) {
497 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
498 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
499 std::sort(Preds.begin(), Preds.end());
501 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
503 // Ensure that PHI nodes have at least one entry!
504 Assert1(PN->getNumIncomingValues() != 0,
505 "PHI nodes must have at least one entry. If the block is dead, "
506 "the PHI should be removed!", PN);
507 Assert1(PN->getNumIncomingValues() == Preds.size(),
508 "PHINode should have one entry for each predecessor of its "
509 "parent basic block!", PN);
511 // Get and sort all incoming values in the PHI node...
513 Values.reserve(PN->getNumIncomingValues());
514 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
515 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
516 PN->getIncomingValue(i)));
517 std::sort(Values.begin(), Values.end());
519 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
520 // Check to make sure that if there is more than one entry for a
521 // particular basic block in this PHI node, that the incoming values are
524 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
525 Values[i].second == Values[i-1].second,
526 "PHI node has multiple entries for the same basic block with "
527 "different incoming values!", PN, Values[i].first,
528 Values[i].second, Values[i-1].second);
530 // Check to make sure that the predecessors and PHI node entries are
532 Assert3(Values[i].first == Preds[i],
533 "PHI node entries do not match predecessors!", PN,
534 Values[i].first, Preds[i]);
540 void Verifier::visitTerminatorInst(TerminatorInst &I) {
541 // Ensure that terminators only exist at the end of the basic block.
542 Assert1(&I == I.getParent()->getTerminator(),
543 "Terminator found in the middle of a basic block!", I.getParent());
547 void Verifier::visitReturnInst(ReturnInst &RI) {
548 Function *F = RI.getParent()->getParent();
549 if (RI.getNumOperands() == 0)
550 Assert2(F->getReturnType() == Type::VoidTy,
551 "Found return instr that returns void in Function of non-void "
552 "return type!", &RI, F->getReturnType());
554 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
555 "Function return type does not match operand "
556 "type of return inst!", &RI, F->getReturnType());
558 // Check to make sure that the return value has necessary properties for
560 visitTerminatorInst(RI);
563 void Verifier::visitSwitchInst(SwitchInst &SI) {
564 // Check to make sure that all of the constants in the switch instruction
565 // have the same type as the switched-on value.
566 const Type *SwitchTy = SI.getCondition()->getType();
567 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
568 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
569 "Switch constants must all be same type as switch value!", &SI);
571 visitTerminatorInst(SI);
574 void Verifier::visitSelectInst(SelectInst &SI) {
575 Assert1(SI.getCondition()->getType() == Type::Int1Ty,
576 "Select condition type must be bool!", &SI);
577 Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
578 "Select values must have identical types!", &SI);
579 Assert1(SI.getTrueValue()->getType() == SI.getType(),
580 "Select values must have same type as select instruction!", &SI);
581 visitInstruction(SI);
585 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
586 /// a pass, if any exist, it's an error.
588 void Verifier::visitUserOp1(Instruction &I) {
589 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
592 void Verifier::visitTruncInst(TruncInst &I) {
593 // Get the source and destination types
594 const Type *SrcTy = I.getOperand(0)->getType();
595 const Type *DestTy = I.getType();
597 // Get the size of the types in bits, we'll need this later
598 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
599 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
601 Assert1(SrcTy->isInteger(), "Trunc only operates on integer", &I);
602 Assert1(DestTy->isInteger(), "Trunc only produces integer", &I);
603 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
608 void Verifier::visitZExtInst(ZExtInst &I) {
609 // Get the source and destination types
610 const Type *SrcTy = I.getOperand(0)->getType();
611 const Type *DestTy = I.getType();
613 // Get the size of the types in bits, we'll need this later
614 Assert1(SrcTy->isInteger(), "ZExt only operates on integer", &I);
615 Assert1(DestTy->isInteger(), "ZExt only produces an integer", &I);
616 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
617 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
619 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
624 void Verifier::visitSExtInst(SExtInst &I) {
625 // Get the source and destination types
626 const Type *SrcTy = I.getOperand(0)->getType();
627 const Type *DestTy = I.getType();
629 // Get the size of the types in bits, we'll need this later
630 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
631 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
633 Assert1(SrcTy->isInteger(), "SExt only operates on integer", &I);
634 Assert1(DestTy->isInteger(), "SExt only produces an integer", &I);
635 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
640 void Verifier::visitFPTruncInst(FPTruncInst &I) {
641 // Get the source and destination types
642 const Type *SrcTy = I.getOperand(0)->getType();
643 const Type *DestTy = I.getType();
644 // Get the size of the types in bits, we'll need this later
645 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
646 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
648 Assert1(SrcTy->isFloatingPoint(),"FPTrunc only operates on FP", &I);
649 Assert1(DestTy->isFloatingPoint(),"FPTrunc only produces an FP", &I);
650 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
655 void Verifier::visitFPExtInst(FPExtInst &I) {
656 // Get the source and destination types
657 const Type *SrcTy = I.getOperand(0)->getType();
658 const Type *DestTy = I.getType();
660 // Get the size of the types in bits, we'll need this later
661 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
662 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
664 Assert1(SrcTy->isFloatingPoint(),"FPExt only operates on FP", &I);
665 Assert1(DestTy->isFloatingPoint(),"FPExt only produces an FP", &I);
666 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
671 void Verifier::visitUIToFPInst(UIToFPInst &I) {
672 // Get the source and destination types
673 const Type *SrcTy = I.getOperand(0)->getType();
674 const Type *DestTy = I.getType();
676 Assert1(SrcTy->isInteger(),"UInt2FP source must be integral", &I);
677 Assert1(DestTy->isFloatingPoint(),"UInt2FP result must be FP", &I);
682 void Verifier::visitSIToFPInst(SIToFPInst &I) {
683 // Get the source and destination types
684 const Type *SrcTy = I.getOperand(0)->getType();
685 const Type *DestTy = I.getType();
687 Assert1(SrcTy->isInteger(),"SInt2FP source must be integral", &I);
688 Assert1(DestTy->isFloatingPoint(),"SInt2FP result must be FP", &I);
693 void Verifier::visitFPToUIInst(FPToUIInst &I) {
694 // Get the source and destination types
695 const Type *SrcTy = I.getOperand(0)->getType();
696 const Type *DestTy = I.getType();
698 Assert1(SrcTy->isFloatingPoint(),"FP2UInt source must be FP", &I);
699 Assert1(DestTy->isInteger(),"FP2UInt result must be integral", &I);
704 void Verifier::visitFPToSIInst(FPToSIInst &I) {
705 // Get the source and destination types
706 const Type *SrcTy = I.getOperand(0)->getType();
707 const Type *DestTy = I.getType();
709 Assert1(SrcTy->isFloatingPoint(),"FPToSI source must be FP", &I);
710 Assert1(DestTy->isInteger(),"FP2ToI result must be integral", &I);
715 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
716 // Get the source and destination types
717 const Type *SrcTy = I.getOperand(0)->getType();
718 const Type *DestTy = I.getType();
720 Assert1(isa<PointerType>(SrcTy), "PtrToInt source must be pointer", &I);
721 Assert1(DestTy->isInteger(), "PtrToInt result must be integral", &I);
726 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
727 // Get the source and destination types
728 const Type *SrcTy = I.getOperand(0)->getType();
729 const Type *DestTy = I.getType();
731 Assert1(SrcTy->isInteger(), "IntToPtr source must be an integral", &I);
732 Assert1(isa<PointerType>(DestTy), "IntToPtr result must be a pointer",&I);
737 void Verifier::visitBitCastInst(BitCastInst &I) {
738 // Get the source and destination types
739 const Type *SrcTy = I.getOperand(0)->getType();
740 const Type *DestTy = I.getType();
742 // Get the size of the types in bits, we'll need this later
743 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
744 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
746 // BitCast implies a no-op cast of type only. No bits change.
747 // However, you can't cast pointers to anything but pointers.
748 Assert1(isa<PointerType>(DestTy) == isa<PointerType>(DestTy),
749 "Bitcast requires both operands to be pointer or neither", &I);
750 Assert1(SrcBitSize == DestBitSize, "Bitcast requies types of same width", &I);
755 /// visitPHINode - Ensure that a PHI node is well formed.
757 void Verifier::visitPHINode(PHINode &PN) {
758 // Ensure that the PHI nodes are all grouped together at the top of the block.
759 // This can be tested by checking whether the instruction before this is
760 // either nonexistent (because this is begin()) or is a PHI node. If not,
761 // then there is some other instruction before a PHI.
762 Assert2(&PN == &PN.getParent()->front() ||
763 isa<PHINode>(--BasicBlock::iterator(&PN)),
764 "PHI nodes not grouped at top of basic block!",
765 &PN, PN.getParent());
767 // Check that all of the operands of the PHI node have the same type as the
769 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
770 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
771 "PHI node operands are not the same type as the result!", &PN);
773 // All other PHI node constraints are checked in the visitBasicBlock method.
775 visitInstruction(PN);
778 void Verifier::visitCallInst(CallInst &CI) {
779 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
780 "Called function must be a pointer!", &CI);
781 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
782 Assert1(isa<FunctionType>(FPTy->getElementType()),
783 "Called function is not pointer to function type!", &CI);
785 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
787 // Verify that the correct number of arguments are being passed
789 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
790 "Called function requires more parameters than were provided!",&CI);
792 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
793 "Incorrect number of arguments passed to called function!", &CI);
795 // Verify that all arguments to the call match the function type...
796 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
797 Assert3(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
798 "Call parameter type does not match function signature!",
799 CI.getOperand(i+1), FTy->getParamType(i), &CI);
801 if (Function *F = CI.getCalledFunction())
802 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
803 visitIntrinsicFunctionCall(ID, CI);
805 visitInstruction(CI);
808 /// visitBinaryOperator - Check that both arguments to the binary operator are
809 /// of the same type!
811 void Verifier::visitBinaryOperator(BinaryOperator &B) {
812 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
813 "Both operands to a binary operator are not of the same type!", &B);
815 switch (B.getOpcode()) {
816 // Check that logical operators are only used with integral operands.
817 case Instruction::And:
818 case Instruction::Or:
819 case Instruction::Xor:
820 Assert1(B.getType()->isInteger() ||
821 (isa<VectorType>(B.getType()) &&
822 cast<VectorType>(B.getType())->getElementType()->isInteger()),
823 "Logical operators only work with integral types!", &B);
824 Assert1(B.getType() == B.getOperand(0)->getType(),
825 "Logical operators must have same type for operands and result!",
828 case Instruction::Shl:
829 case Instruction::LShr:
830 case Instruction::AShr:
831 Assert1(B.getType()->isInteger(),
832 "Shift must return an integer result!", &B);
833 Assert1(B.getType() == B.getOperand(0)->getType(),
834 "Shift return type must be same as operands!", &B);
837 // Arithmetic operators only work on integer or fp values
838 Assert1(B.getType() == B.getOperand(0)->getType(),
839 "Arithmetic operators must have same type for operands and result!",
841 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint() ||
842 isa<VectorType>(B.getType()),
843 "Arithmetic operators must have integer, fp, or vector type!", &B);
850 void Verifier::visitICmpInst(ICmpInst& IC) {
851 // Check that the operands are the same type
852 const Type* Op0Ty = IC.getOperand(0)->getType();
853 const Type* Op1Ty = IC.getOperand(1)->getType();
854 Assert1(Op0Ty == Op1Ty,
855 "Both operands to ICmp instruction are not of the same type!", &IC);
856 // Check that the operands are the right type
857 Assert1(Op0Ty->isInteger() || isa<PointerType>(Op0Ty),
858 "Invalid operand types for ICmp instruction", &IC);
859 visitInstruction(IC);
862 void Verifier::visitFCmpInst(FCmpInst& FC) {
863 // Check that the operands are the same type
864 const Type* Op0Ty = FC.getOperand(0)->getType();
865 const Type* Op1Ty = FC.getOperand(1)->getType();
866 Assert1(Op0Ty == Op1Ty,
867 "Both operands to FCmp instruction are not of the same type!", &FC);
868 // Check that the operands are the right type
869 Assert1(Op0Ty->isFloatingPoint(),
870 "Invalid operand types for FCmp instruction", &FC);
871 visitInstruction(FC);
874 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
875 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
877 "Invalid extractelement operands!", &EI);
878 visitInstruction(EI);
881 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
882 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
885 "Invalid insertelement operands!", &IE);
886 visitInstruction(IE);
889 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
890 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
892 "Invalid shufflevector operands!", &SV);
893 Assert1(SV.getType() == SV.getOperand(0)->getType(),
894 "Result of shufflevector must match first operand type!", &SV);
896 // Check to see if Mask is valid.
897 if (const ConstantVector *MV = dyn_cast<ConstantVector>(SV.getOperand(2))) {
898 for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
899 Assert1(isa<ConstantInt>(MV->getOperand(i)) ||
900 isa<UndefValue>(MV->getOperand(i)),
901 "Invalid shufflevector shuffle mask!", &SV);
904 Assert1(isa<UndefValue>(SV.getOperand(2)) ||
905 isa<ConstantAggregateZero>(SV.getOperand(2)),
906 "Invalid shufflevector shuffle mask!", &SV);
909 visitInstruction(SV);
912 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
913 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
915 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
916 Idxs.begin(), Idxs.end(), true);
917 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
918 Assert2(isa<PointerType>(GEP.getType()) &&
919 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
920 "GEP is not of right type for indices!", &GEP, ElTy);
921 visitInstruction(GEP);
924 void Verifier::visitLoadInst(LoadInst &LI) {
926 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
927 Assert2(ElTy == LI.getType(),
928 "Load result type does not match pointer operand type!", &LI, ElTy);
929 visitInstruction(LI);
932 void Verifier::visitStoreInst(StoreInst &SI) {
934 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
935 Assert2(ElTy == SI.getOperand(0)->getType(),
936 "Stored value type does not match pointer operand type!", &SI, ElTy);
937 visitInstruction(SI);
941 /// verifyInstruction - Verify that an instruction is well formed.
943 void Verifier::visitInstruction(Instruction &I) {
944 BasicBlock *BB = I.getParent();
945 Assert1(BB, "Instruction not embedded in basic block!", &I);
947 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
948 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
950 Assert1(*UI != (User*)&I ||
951 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
952 "Only PHI nodes may reference their own value!", &I);
955 // Check that void typed values don't have names
956 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
957 "Instruction has a name, but provides a void value!", &I);
959 // Check that the return value of the instruction is either void or a legal
961 Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
962 "Instruction returns a non-scalar type!", &I);
964 // Check that all uses of the instruction, if they are instructions
965 // themselves, actually have parent basic blocks. If the use is not an
966 // instruction, it is an error!
967 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
969 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
971 Instruction *Used = cast<Instruction>(*UI);
972 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
973 " embeded in a basic block!", &I, Used);
976 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
977 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
979 // Check to make sure that only first-class-values are operands to
981 Assert1(I.getOperand(i)->getType()->isFirstClassType(),
982 "Instruction operands must be first-class values!", &I);
984 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
985 // Check to make sure that the "address of" an intrinsic function is never
987 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
988 "Cannot take the address of an intrinsic!", &I);
989 Assert1(F->getParent() == Mod, "Referencing function in another module!",
991 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
992 Assert1(OpBB->getParent() == BB->getParent(),
993 "Referring to a basic block in another function!", &I);
994 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
995 Assert1(OpArg->getParent() == BB->getParent(),
996 "Referring to an argument in another function!", &I);
997 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
998 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1000 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
1001 BasicBlock *OpBlock = Op->getParent();
1003 // Check that a definition dominates all of its uses.
1004 if (!isa<PHINode>(I)) {
1005 // Invoke results are only usable in the normal destination, not in the
1006 // exceptional destination.
1007 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1008 OpBlock = II->getNormalDest();
1010 Assert2(OpBlock != II->getUnwindDest(),
1011 "No uses of invoke possible due to dominance structure!",
1014 // If the normal successor of an invoke instruction has multiple
1015 // predecessors, then the normal edge from the invoke is critical, so
1016 // the invoke value can only be live if the destination block
1017 // dominates all of it's predecessors (other than the invoke) or if
1018 // the invoke value is only used by a phi in the successor.
1019 if (!OpBlock->getSinglePredecessor() &&
1020 DT->dominates(&BB->getParent()->getEntryBlock(), BB)) {
1021 // The first case we allow is if the use is a PHI operand in the
1022 // normal block, and if that PHI operand corresponds to the invoke's
1025 if (PHINode *PN = dyn_cast<PHINode>(&I))
1026 if (PN->getParent() == OpBlock &&
1027 PN->getIncomingBlock(i/2) == Op->getParent())
1030 // If it is used by something non-phi, then the other case is that
1031 // 'OpBlock' dominates all of its predecessors other than the
1032 // invoke. In this case, the invoke value can still be used.
1035 for (pred_iterator PI = pred_begin(OpBlock),
1036 E = pred_end(OpBlock); PI != E; ++PI) {
1037 if (*PI != II->getParent() && !DT->dominates(OpBlock, *PI)) {
1044 "Invoke value defined on critical edge but not dead!", &I,
1047 } else if (OpBlock == BB) {
1048 // If they are in the same basic block, make sure that the definition
1049 // comes before the use.
1050 Assert2(InstsInThisBlock.count(Op) ||
1051 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1052 "Instruction does not dominate all uses!", Op, &I);
1055 // Definition must dominate use unless use is unreachable!
1056 Assert2(DT->dominates(OpBlock, BB) ||
1057 !DT->dominates(&BB->getParent()->getEntryBlock(), BB),
1058 "Instruction does not dominate all uses!", Op, &I);
1060 // PHI nodes are more difficult than other nodes because they actually
1061 // "use" the value in the predecessor basic blocks they correspond to.
1062 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
1063 Assert2(DT->dominates(OpBlock, PredBB) ||
1064 !DT->dominates(&BB->getParent()->getEntryBlock(), PredBB),
1065 "Instruction does not dominate all uses!", Op, &I);
1067 } else if (isa<InlineAsm>(I.getOperand(i))) {
1068 Assert1(i == 0 && isa<CallInst>(I),
1069 "Cannot take the address of an inline asm!", &I);
1072 InstsInThisBlock.insert(&I);
1075 static bool HasPtrPtrType(Value *Val) {
1076 if (const PointerType *PtrTy = dyn_cast<PointerType>(Val->getType()))
1077 return isa<PointerType>(PtrTy->getElementType());
1081 static Value *StripBitCasts(Value *Val) {
1082 if (BitCastInst *CI = dyn_cast<BitCastInst>(Val))
1083 return StripBitCasts(CI->getOperand(0));
1087 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1089 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1090 Function *IF = CI.getCalledFunction();
1091 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1094 #define GET_INTRINSIC_VERIFIER
1095 #include "llvm/Intrinsics.gen"
1096 #undef GET_INTRINSIC_VERIFIER
1101 case Intrinsic::gcroot:
1102 Assert1(HasPtrPtrType(CI.getOperand(1)),
1103 "llvm.gcroot parameter #1 must be a pointer to a pointer.", &CI);
1104 Assert1(isa<AllocaInst>(StripBitCasts(CI.getOperand(1))),
1105 "llvm.gcroot parameter #1 must be an alloca (or a bitcast).", &CI);
1106 Assert1(isa<Constant>(CI.getOperand(2)),
1107 "llvm.gcroot parameter #2 must be a constant or global.", &CI);
1109 case Intrinsic::gcwrite:
1110 Assert1(CI.getOperand(3)->getType()
1111 == PointerType::get(CI.getOperand(1)->getType()),
1112 "Call to llvm.gcwrite must be with type 'void (%ty*, %ty2*, %ty**)'.",
1115 case Intrinsic::gcread:
1116 Assert1(CI.getOperand(2)->getType() == PointerType::get(CI.getType()),
1117 "Call to llvm.gcread must be with type '%ty* (%ty2*, %ty**).'",
1123 /// VerifyIntrinsicPrototype - TableGen emits calls to this function into
1124 /// Intrinsics.gen. This implements a little state machine that verifies the
1125 /// prototype of intrinsics.
1126 void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID,
1128 unsigned Count, ...) {
1130 va_start(VA, Count);
1132 const FunctionType *FTy = F->getFunctionType();
1134 // For overloaded intrinsics, the Suffix of the function name must match the
1135 // types of the arguments. This variable keeps track of the expected
1136 // suffix, to be checked at the end.
1139 if (FTy->getNumParams() + FTy->isVarArg() != Count - 1) {
1140 CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
1144 // Note that "arg#0" is the return type.
1145 for (unsigned ArgNo = 0; ArgNo < Count; ++ArgNo) {
1146 MVT::ValueType VT = va_arg(VA, MVT::ValueType);
1148 if (VT == MVT::isVoid && ArgNo > 0) {
1149 if (!FTy->isVarArg())
1150 CheckFailed("Intrinsic prototype has no '...'!", F);
1156 Ty = FTy->getReturnType();
1158 Ty = FTy->getParamType(ArgNo-1);
1160 unsigned NumElts = 0;
1161 const Type *EltTy = Ty;
1162 if (const VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1163 EltTy = VTy->getElementType();
1164 NumElts = VTy->getNumElements();
1170 if (Ty != FTy->getReturnType()) {
1171 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
1172 "match return type.", F);
1176 if (Ty != FTy->getParamType(Match-1)) {
1177 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
1178 "match parameter %" + utostr(Match-1) + ".", F);
1182 } else if (VT == MVT::iAny) {
1183 if (!EltTy->isInteger()) {
1185 CheckFailed("Intrinsic result type is not "
1186 "an integer type.", F);
1188 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
1189 "an integer type.", F);
1192 unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
1195 Suffix += "v" + utostr(NumElts);
1196 Suffix += "i" + utostr(GotBits);;
1197 // Check some constraints on various intrinsics.
1199 default: break; // Not everything needs to be checked.
1200 case Intrinsic::bswap:
1201 if (GotBits < 16 || GotBits % 16 != 0)
1202 CheckFailed("Intrinsic requires even byte width argument", F);
1205 } else if (VT == MVT::fAny) {
1206 if (!EltTy->isFloatingPoint()) {
1208 CheckFailed("Intrinsic result type is not "
1209 "a floating-point type.", F);
1211 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
1212 "a floating-point type.", F);
1217 Suffix += "v" + utostr(NumElts);
1218 Suffix += MVT::getValueTypeString(MVT::getValueType(EltTy));
1219 } else if (VT == MVT::iPTR) {
1220 if (!isa<PointerType>(Ty)) {
1222 CheckFailed("Intrinsic result type is not a "
1223 "pointer and a pointer is required.", F);
1225 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not a "
1226 "pointer and a pointer is required.", F);
1229 } else if (MVT::isVector(VT)) {
1230 // If this is a vector argument, verify the number and type of elements.
1231 if (MVT::getVectorElementType(VT) != MVT::getValueType(EltTy)) {
1232 CheckFailed("Intrinsic prototype has incorrect vector element type!",
1236 if (MVT::getVectorNumElements(VT) != NumElts) {
1237 CheckFailed("Intrinsic prototype has incorrect number of "
1238 "vector elements!",F);
1241 } else if (MVT::getTypeForValueType(VT) != EltTy) {
1243 CheckFailed("Intrinsic prototype has incorrect result type!", F);
1245 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is wrong!",F);
1247 } else if (EltTy != Ty) {
1249 CheckFailed("Intrinsic result type is vector "
1250 "and a scalar is required.", F);
1252 CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is vector "
1253 "and a scalar is required.", F);
1259 // If we computed a Suffix then the intrinsic is overloaded and we need to
1260 // make sure that the name of the function is correct. We add the suffix to
1261 // the name of the intrinsic and compare against the given function name. If
1262 // they are not the same, the function name is invalid. This ensures that
1263 // overloading of intrinsics uses a sane and consistent naming convention.
1264 if (!Suffix.empty()) {
1265 std::string Name(Intrinsic::getName(ID));
1266 if (Name + Suffix != F->getName())
1267 CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
1268 F->getName().substr(Name.length()) + "'. It should be '" +
1274 //===----------------------------------------------------------------------===//
1275 // Implement the public interfaces to this file...
1276 //===----------------------------------------------------------------------===//
1278 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1279 return new Verifier(action);
1283 // verifyFunction - Create
1284 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1285 Function &F = const_cast<Function&>(f);
1286 assert(!F.isDeclaration() && "Cannot verify external functions");
1288 FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
1289 Verifier *V = new Verifier(action);
1295 /// verifyModule - Check a module for errors, printing messages on stderr.
1296 /// Return true if the module is corrupt.
1298 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1299 std::string *ErrorInfo) {
1301 Verifier *V = new Verifier(action);
1305 if (ErrorInfo && V->Broken)
1306 *ErrorInfo = V->msgs.str();