1 //===-- Verifier.cpp - Implement the Module Verifier -----------------------==//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // 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 i32 %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 // * A landing pad is defined by a landingpad instruction, and can be jumped to
39 // only by the unwind edge of an invoke instruction.
40 // * A landingpad instruction must be the first non-PHI instruction in the
42 // * All landingpad instructions must use the same personality function with
44 // * All other things that are tested by asserts spread about the code...
46 //===----------------------------------------------------------------------===//
48 #include "llvm/Analysis/Verifier.h"
49 #include "llvm/CallingConv.h"
50 #include "llvm/Constants.h"
51 #include "llvm/DerivedTypes.h"
52 #include "llvm/InlineAsm.h"
53 #include "llvm/IntrinsicInst.h"
54 #include "llvm/LLVMContext.h"
55 #include "llvm/Metadata.h"
56 #include "llvm/Module.h"
57 #include "llvm/Pass.h"
58 #include "llvm/PassManager.h"
59 #include "llvm/Analysis/Dominators.h"
60 #include "llvm/Assembly/Writer.h"
61 #include "llvm/CodeGen/ValueTypes.h"
62 #include "llvm/Support/CallSite.h"
63 #include "llvm/Support/CFG.h"
64 #include "llvm/Support/Debug.h"
65 #include "llvm/Support/InstVisitor.h"
66 #include "llvm/ADT/SetVector.h"
67 #include "llvm/ADT/SmallPtrSet.h"
68 #include "llvm/ADT/SmallVector.h"
69 #include "llvm/ADT/StringExtras.h"
70 #include "llvm/ADT/STLExtras.h"
71 #include "llvm/Support/ConstantRange.h"
72 #include "llvm/Support/ErrorHandling.h"
73 #include "llvm/Support/raw_ostream.h"
78 namespace { // Anonymous namespace for class
79 struct PreVerifier : public FunctionPass {
80 static char ID; // Pass ID, replacement for typeid
82 PreVerifier() : FunctionPass(ID) {
83 initializePreVerifierPass(*PassRegistry::getPassRegistry());
86 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
90 // Check that the prerequisites for successful DominatorTree construction
92 bool runOnFunction(Function &F) {
95 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
96 if (I->empty() || !I->back().isTerminator()) {
97 dbgs() << "Basic Block in function '" << F.getName()
98 << "' does not have terminator!\n";
99 WriteAsOperand(dbgs(), I, true);
106 report_fatal_error("Broken module, no Basic Block terminator!");
113 char PreVerifier::ID = 0;
114 INITIALIZE_PASS(PreVerifier, "preverify", "Preliminary module verification",
116 static char &PreVerifyID = PreVerifier::ID;
119 struct Verifier : public FunctionPass, public InstVisitor<Verifier> {
120 static char ID; // Pass ID, replacement for typeid
121 bool Broken; // Is this module found to be broken?
122 VerifierFailureAction action;
123 // What to do if verification fails.
124 Module *Mod; // Module we are verifying right now
125 LLVMContext *Context; // Context within which we are verifying
126 DominatorTree *DT; // Dominator Tree, caution can be null!
128 std::string Messages;
129 raw_string_ostream MessagesStr;
131 /// InstInThisBlock - when verifying a basic block, keep track of all of the
132 /// instructions we have seen so far. This allows us to do efficient
133 /// dominance checks for the case when an instruction has an operand that is
134 /// an instruction in the same block.
135 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
137 /// MDNodes - keep track of the metadata nodes that have been checked
139 SmallPtrSet<MDNode *, 32> MDNodes;
141 /// PersonalityFn - The personality function referenced by the
142 /// LandingPadInsts. All LandingPadInsts within the same function must use
143 /// the same personality function.
144 const Value *PersonalityFn;
147 : FunctionPass(ID), Broken(false),
148 action(AbortProcessAction), Mod(0), Context(0), DT(0),
149 MessagesStr(Messages), PersonalityFn(0) {
150 initializeVerifierPass(*PassRegistry::getPassRegistry());
152 explicit Verifier(VerifierFailureAction ctn)
153 : FunctionPass(ID), Broken(false), action(ctn), Mod(0),
154 Context(0), DT(0), MessagesStr(Messages), PersonalityFn(0) {
155 initializeVerifierPass(*PassRegistry::getPassRegistry());
158 bool doInitialization(Module &M) {
160 Context = &M.getContext();
162 // We must abort before returning back to the pass manager, or else the
163 // pass manager may try to run other passes on the broken module.
164 return abortIfBroken();
167 bool runOnFunction(Function &F) {
168 // Get dominator information if we are being run by PassManager
169 DT = &getAnalysis<DominatorTree>();
172 if (!Context) Context = &F.getContext();
175 InstsInThisBlock.clear();
178 // We must abort before returning back to the pass manager, or else the
179 // pass manager may try to run other passes on the broken module.
180 return abortIfBroken();
183 bool doFinalization(Module &M) {
184 // Scan through, checking all of the external function's linkage now...
185 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
186 visitGlobalValue(*I);
188 // Check to make sure function prototypes are okay.
189 if (I->isDeclaration()) visitFunction(*I);
192 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
194 visitGlobalVariable(*I);
196 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
198 visitGlobalAlias(*I);
200 for (Module::named_metadata_iterator I = M.named_metadata_begin(),
201 E = M.named_metadata_end(); I != E; ++I)
202 visitNamedMDNode(*I);
204 // If the module is broken, abort at this time.
205 return abortIfBroken();
208 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
209 AU.setPreservesAll();
210 AU.addRequiredID(PreVerifyID);
211 AU.addRequired<DominatorTree>();
214 /// abortIfBroken - If the module is broken and we are supposed to abort on
215 /// this condition, do so.
217 bool abortIfBroken() {
218 if (!Broken) return false;
219 MessagesStr << "Broken module found, ";
221 case AbortProcessAction:
222 MessagesStr << "compilation aborted!\n";
223 dbgs() << MessagesStr.str();
224 // Client should choose different reaction if abort is not desired
226 case PrintMessageAction:
227 MessagesStr << "verification continues.\n";
228 dbgs() << MessagesStr.str();
230 case ReturnStatusAction:
231 MessagesStr << "compilation terminated.\n";
234 llvm_unreachable("Invalid action");
238 // Verification methods...
239 void visitGlobalValue(GlobalValue &GV);
240 void visitGlobalVariable(GlobalVariable &GV);
241 void visitGlobalAlias(GlobalAlias &GA);
242 void visitNamedMDNode(NamedMDNode &NMD);
243 void visitMDNode(MDNode &MD, Function *F);
244 void visitFunction(Function &F);
245 void visitBasicBlock(BasicBlock &BB);
246 using InstVisitor<Verifier>::visit;
248 void visit(Instruction &I);
250 void visitTruncInst(TruncInst &I);
251 void visitZExtInst(ZExtInst &I);
252 void visitSExtInst(SExtInst &I);
253 void visitFPTruncInst(FPTruncInst &I);
254 void visitFPExtInst(FPExtInst &I);
255 void visitFPToUIInst(FPToUIInst &I);
256 void visitFPToSIInst(FPToSIInst &I);
257 void visitUIToFPInst(UIToFPInst &I);
258 void visitSIToFPInst(SIToFPInst &I);
259 void visitIntToPtrInst(IntToPtrInst &I);
260 void visitPtrToIntInst(PtrToIntInst &I);
261 void visitBitCastInst(BitCastInst &I);
262 void visitPHINode(PHINode &PN);
263 void visitBinaryOperator(BinaryOperator &B);
264 void visitICmpInst(ICmpInst &IC);
265 void visitFCmpInst(FCmpInst &FC);
266 void visitExtractElementInst(ExtractElementInst &EI);
267 void visitInsertElementInst(InsertElementInst &EI);
268 void visitShuffleVectorInst(ShuffleVectorInst &EI);
269 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
270 void visitCallInst(CallInst &CI);
271 void visitInvokeInst(InvokeInst &II);
272 void visitGetElementPtrInst(GetElementPtrInst &GEP);
273 void visitLoadInst(LoadInst &LI);
274 void visitStoreInst(StoreInst &SI);
275 void verifyDominatesUse(Instruction &I, unsigned i);
276 void visitInstruction(Instruction &I);
277 void visitTerminatorInst(TerminatorInst &I);
278 void visitBranchInst(BranchInst &BI);
279 void visitReturnInst(ReturnInst &RI);
280 void visitSwitchInst(SwitchInst &SI);
281 void visitIndirectBrInst(IndirectBrInst &BI);
282 void visitSelectInst(SelectInst &SI);
283 void visitUserOp1(Instruction &I);
284 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
285 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
286 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
287 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
288 void visitFenceInst(FenceInst &FI);
289 void visitAllocaInst(AllocaInst &AI);
290 void visitExtractValueInst(ExtractValueInst &EVI);
291 void visitInsertValueInst(InsertValueInst &IVI);
292 void visitLandingPadInst(LandingPadInst &LPI);
294 void VerifyCallSite(CallSite CS);
295 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty,
296 int VT, unsigned ArgNo, std::string &Suffix);
297 bool VerifyIntrinsicType(Type *Ty,
298 ArrayRef<Intrinsic::IITDescriptor> &Infos,
299 SmallVectorImpl<Type*> &ArgTys);
300 void VerifyParameterAttrs(Attributes Attrs, Type *Ty,
301 bool isReturnValue, const Value *V);
302 void VerifyFunctionAttrs(FunctionType *FT, const AttrListPtr &Attrs,
305 void WriteValue(const Value *V) {
307 if (isa<Instruction>(V)) {
308 MessagesStr << *V << '\n';
310 WriteAsOperand(MessagesStr, V, true, Mod);
315 void WriteType(Type *T) {
317 MessagesStr << ' ' << *T;
321 // CheckFailed - A check failed, so print out the condition and the message
322 // that failed. This provides a nice place to put a breakpoint if you want
323 // to see why something is not correct.
324 void CheckFailed(const Twine &Message,
325 const Value *V1 = 0, const Value *V2 = 0,
326 const Value *V3 = 0, const Value *V4 = 0) {
327 MessagesStr << Message.str() << "\n";
335 void CheckFailed(const Twine &Message, const Value *V1,
336 Type *T2, const Value *V3 = 0) {
337 MessagesStr << Message.str() << "\n";
344 void CheckFailed(const Twine &Message, Type *T1,
345 Type *T2 = 0, Type *T3 = 0) {
346 MessagesStr << Message.str() << "\n";
353 } // End anonymous namespace
355 char Verifier::ID = 0;
356 INITIALIZE_PASS_BEGIN(Verifier, "verify", "Module Verifier", false, false)
357 INITIALIZE_PASS_DEPENDENCY(PreVerifier)
358 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
359 INITIALIZE_PASS_END(Verifier, "verify", "Module Verifier", false, false)
361 // Assert - We know that cond should be true, if not print an error message.
362 #define Assert(C, M) \
363 do { if (!(C)) { CheckFailed(M); return; } } while (0)
364 #define Assert1(C, M, V1) \
365 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
366 #define Assert2(C, M, V1, V2) \
367 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
368 #define Assert3(C, M, V1, V2, V3) \
369 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
370 #define Assert4(C, M, V1, V2, V3, V4) \
371 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
373 void Verifier::visit(Instruction &I) {
374 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
375 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
376 InstVisitor<Verifier>::visit(I);
380 void Verifier::visitGlobalValue(GlobalValue &GV) {
381 Assert1(!GV.isDeclaration() ||
382 GV.isMaterializable() ||
383 GV.hasExternalLinkage() ||
384 GV.hasDLLImportLinkage() ||
385 GV.hasExternalWeakLinkage() ||
386 (isa<GlobalAlias>(GV) &&
387 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
388 "Global is external, but doesn't have external or dllimport or weak linkage!",
391 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
392 "Global is marked as dllimport, but not external", &GV);
394 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
395 "Only global variables can have appending linkage!", &GV);
397 if (GV.hasAppendingLinkage()) {
398 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
399 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
400 "Only global arrays can have appending linkage!", GVar);
403 Assert1(!GV.hasLinkOnceODRAutoHideLinkage() || GV.hasDefaultVisibility(),
404 "linkonce_odr_auto_hide can only have default visibility!",
408 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
409 if (GV.hasInitializer()) {
410 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
411 "Global variable initializer type does not match global "
412 "variable type!", &GV);
414 // If the global has common linkage, it must have a zero initializer and
415 // cannot be constant.
416 if (GV.hasCommonLinkage()) {
417 Assert1(GV.getInitializer()->isNullValue(),
418 "'common' global must have a zero initializer!", &GV);
419 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
423 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
424 GV.hasExternalWeakLinkage(),
425 "invalid linkage type for global declaration", &GV);
428 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
429 GV.getName() == "llvm.global_dtors")) {
430 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
431 "invalid linkage for intrinsic global variable", &GV);
432 // Don't worry about emitting an error for it not being an array,
433 // visitGlobalValue will complain on appending non-array.
434 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType())) {
435 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
436 PointerType *FuncPtrTy =
437 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
438 Assert1(STy && STy->getNumElements() == 2 &&
439 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
440 STy->getTypeAtIndex(1) == FuncPtrTy,
441 "wrong type for intrinsic global variable", &GV);
445 visitGlobalValue(GV);
448 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
449 Assert1(!GA.getName().empty(),
450 "Alias name cannot be empty!", &GA);
451 Assert1(GA.hasExternalLinkage() || GA.hasLocalLinkage() ||
453 "Alias should have external or external weak linkage!", &GA);
454 Assert1(GA.getAliasee(),
455 "Aliasee cannot be NULL!", &GA);
456 Assert1(GA.getType() == GA.getAliasee()->getType(),
457 "Alias and aliasee types should match!", &GA);
458 Assert1(!GA.hasUnnamedAddr(), "Alias cannot have unnamed_addr!", &GA);
460 if (!isa<GlobalValue>(GA.getAliasee())) {
461 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
463 (CE->getOpcode() == Instruction::BitCast ||
464 CE->getOpcode() == Instruction::GetElementPtr) &&
465 isa<GlobalValue>(CE->getOperand(0)),
466 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
470 const GlobalValue* Aliasee = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
472 "Aliasing chain should end with function or global variable", &GA);
474 visitGlobalValue(GA);
477 void Verifier::visitNamedMDNode(NamedMDNode &NMD) {
478 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
479 MDNode *MD = NMD.getOperand(i);
483 Assert1(!MD->isFunctionLocal(),
484 "Named metadata operand cannot be function local!", MD);
489 void Verifier::visitMDNode(MDNode &MD, Function *F) {
490 // Only visit each node once. Metadata can be mutually recursive, so this
491 // avoids infinite recursion here, as well as being an optimization.
492 if (!MDNodes.insert(&MD))
495 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
496 Value *Op = MD.getOperand(i);
499 if (isa<Constant>(Op) || isa<MDString>(Op))
501 if (MDNode *N = dyn_cast<MDNode>(Op)) {
502 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
503 "Global metadata operand cannot be function local!", &MD, N);
507 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
509 // If this was an instruction, bb, or argument, verify that it is in the
510 // function that we expect.
511 Function *ActualF = 0;
512 if (Instruction *I = dyn_cast<Instruction>(Op))
513 ActualF = I->getParent()->getParent();
514 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
515 ActualF = BB->getParent();
516 else if (Argument *A = dyn_cast<Argument>(Op))
517 ActualF = A->getParent();
518 assert(ActualF && "Unimplemented function local metadata case!");
520 Assert2(ActualF == F, "function-local metadata used in wrong function",
525 // VerifyParameterAttrs - Check the given attributes for an argument or return
526 // value of the specified type. The value V is printed in error messages.
527 void Verifier::VerifyParameterAttrs(Attributes Attrs, Type *Ty,
528 bool isReturnValue, const Value *V) {
529 if (!Attrs.hasAttributes())
532 Assert1(!Attrs.hasFunctionOnlyAttrs(),
533 "Some attributes in '" + Attrs.getAsString() +
534 "' only apply to functions!", V);
537 Assert1(!Attrs.hasParameterOnlyAttrs(),
538 "Attributes 'byval', 'nest', 'sret', and 'nocapture' "
539 "do not apply to return values!", V);
541 // Check for mutually incompatible attributes.
542 Assert1(!((Attrs.hasAttribute(Attributes::ByVal) &&
543 Attrs.hasAttribute(Attributes::Nest)) ||
544 (Attrs.hasAttribute(Attributes::ByVal) &&
545 Attrs.hasAttribute(Attributes::StructRet)) ||
546 (Attrs.hasAttribute(Attributes::Nest) &&
547 Attrs.hasAttribute(Attributes::StructRet))), "Attributes "
548 "'byval, nest, and sret' are incompatible!", V);
550 Assert1(!((Attrs.hasAttribute(Attributes::ByVal) &&
551 Attrs.hasAttribute(Attributes::Nest)) ||
552 (Attrs.hasAttribute(Attributes::ByVal) &&
553 Attrs.hasAttribute(Attributes::InReg)) ||
554 (Attrs.hasAttribute(Attributes::Nest) &&
555 Attrs.hasAttribute(Attributes::InReg))), "Attributes "
556 "'byval, nest, and inreg' are incompatible!", V);
558 Assert1(!(Attrs.hasAttribute(Attributes::ZExt) &&
559 Attrs.hasAttribute(Attributes::SExt)), "Attributes "
560 "'zeroext and signext' are incompatible!", V);
562 Assert1(!(Attrs.hasAttribute(Attributes::ReadNone) &&
563 Attrs.hasAttribute(Attributes::ReadOnly)), "Attributes "
564 "'readnone and readonly' are incompatible!", V);
566 Assert1(!(Attrs.hasAttribute(Attributes::NoInline) &&
567 Attrs.hasAttribute(Attributes::AlwaysInline)), "Attributes "
568 "'noinline and alwaysinline' are incompatible!", V);
570 Attributes TypeI = Attrs & Attributes::typeIncompatible(Ty);
571 Assert1(!TypeI, "Wrong type for attribute " +
572 TypeI.getAsString(), V);
574 if (PointerType *PTy = dyn_cast<PointerType>(Ty))
575 Assert1(!Attrs.hasAttribute(Attributes::ByVal) ||
576 PTy->getElementType()->isSized(),
577 "Attribute 'byval' does not support unsized types!", V);
579 Assert1(!Attrs.hasAttribute(Attributes::ByVal),
580 "Attribute 'byval' only applies to parameters with pointer type!",
584 // VerifyFunctionAttrs - Check parameter attributes against a function type.
585 // The value V is printed in error messages.
586 void Verifier::VerifyFunctionAttrs(FunctionType *FT,
587 const AttrListPtr &Attrs,
592 bool SawNest = false;
594 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
595 const AttributeWithIndex &Attr = Attrs.getSlot(i);
599 Ty = FT->getReturnType();
600 else if (Attr.Index-1 < FT->getNumParams())
601 Ty = FT->getParamType(Attr.Index-1);
603 break; // VarArgs attributes, verified elsewhere.
605 VerifyParameterAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
607 if (Attr.Attrs.hasAttribute(Attributes::Nest)) {
608 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
612 if (Attr.Attrs.hasAttribute(Attributes::StructRet))
613 Assert1(Attr.Index == 1, "Attribute sret not on first parameter!", V);
616 Attributes FAttrs = Attrs.getFnAttributes();
617 Attributes::Builder NotFn(FAttrs);
618 NotFn.removeFunctionOnlyAttrs();
619 Assert1(!NotFn.hasAttributes(), "Attributes '" +
620 Attributes::get(NotFn).getAsString() +
621 "' do not apply to the function!", V);
623 // Check for mutually incompatible attributes.
624 Assert1(!((FAttrs.hasAttribute(Attributes::ByVal) &&
625 FAttrs.hasAttribute(Attributes::Nest)) ||
626 (FAttrs.hasAttribute(Attributes::ByVal) &&
627 FAttrs.hasAttribute(Attributes::StructRet)) ||
628 (FAttrs.hasAttribute(Attributes::Nest) &&
629 FAttrs.hasAttribute(Attributes::StructRet))), "Attributes "
630 "'byval, nest, and sret' are incompatible!", V);
632 Assert1(!((FAttrs.hasAttribute(Attributes::ByVal) &&
633 FAttrs.hasAttribute(Attributes::Nest)) ||
634 (FAttrs.hasAttribute(Attributes::ByVal) &&
635 FAttrs.hasAttribute(Attributes::InReg)) ||
636 (FAttrs.hasAttribute(Attributes::Nest) &&
637 FAttrs.hasAttribute(Attributes::InReg))), "Attributes "
638 "'byval, nest, and inreg' are incompatible!", V);
640 Assert1(!(FAttrs.hasAttribute(Attributes::ZExt) &&
641 FAttrs.hasAttribute(Attributes::SExt)), "Attributes "
642 "'zeroext and signext' are incompatible!", V);
644 Assert1(!(FAttrs.hasAttribute(Attributes::ReadNone) &&
645 FAttrs.hasAttribute(Attributes::ReadOnly)), "Attributes "
646 "'readnone and readonly' are incompatible!", V);
648 Assert1(!(FAttrs.hasAttribute(Attributes::NoInline) &&
649 FAttrs.hasAttribute(Attributes::AlwaysInline)), "Attributes "
650 "'noinline and alwaysinline' are incompatible!", V);
653 static bool VerifyAttributeCount(const AttrListPtr &Attrs, unsigned Params) {
657 unsigned LastSlot = Attrs.getNumSlots() - 1;
658 unsigned LastIndex = Attrs.getSlot(LastSlot).Index;
659 if (LastIndex <= Params
660 || (LastIndex == (unsigned)~0
661 && (LastSlot == 0 || Attrs.getSlot(LastSlot - 1).Index <= Params)))
667 // visitFunction - Verify that a function is ok.
669 void Verifier::visitFunction(Function &F) {
670 // Check function arguments.
671 FunctionType *FT = F.getFunctionType();
672 unsigned NumArgs = F.arg_size();
674 Assert1(Context == &F.getContext(),
675 "Function context does not match Module context!", &F);
677 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
678 Assert2(FT->getNumParams() == NumArgs,
679 "# formal arguments must match # of arguments for function type!",
681 Assert1(F.getReturnType()->isFirstClassType() ||
682 F.getReturnType()->isVoidTy() ||
683 F.getReturnType()->isStructTy(),
684 "Functions cannot return aggregate values!", &F);
686 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
687 "Invalid struct return type!", &F);
689 const AttrListPtr &Attrs = F.getAttributes();
691 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
692 "Attributes after last parameter!", &F);
694 // Check function attributes.
695 VerifyFunctionAttrs(FT, Attrs, &F);
697 // Check that this function meets the restrictions on this calling convention.
698 switch (F.getCallingConv()) {
703 case CallingConv::Fast:
704 case CallingConv::Cold:
705 case CallingConv::X86_FastCall:
706 case CallingConv::X86_ThisCall:
707 case CallingConv::PTX_Kernel:
708 case CallingConv::PTX_Device:
709 Assert1(!F.isVarArg(),
710 "Varargs functions must have C calling conventions!", &F);
714 bool isLLVMdotName = F.getName().size() >= 5 &&
715 F.getName().substr(0, 5) == "llvm.";
717 // Check that the argument values match the function type for this function...
719 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
721 Assert2(I->getType() == FT->getParamType(i),
722 "Argument value does not match function argument type!",
723 I, FT->getParamType(i));
724 Assert1(I->getType()->isFirstClassType(),
725 "Function arguments must have first-class types!", I);
727 Assert2(!I->getType()->isMetadataTy(),
728 "Function takes metadata but isn't an intrinsic", I, &F);
731 if (F.isMaterializable()) {
732 // Function has a body somewhere we can't see.
733 } else if (F.isDeclaration()) {
734 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
735 F.hasExternalWeakLinkage(),
736 "invalid linkage type for function declaration", &F);
738 // Verify that this function (which has a body) is not named "llvm.*". It
739 // is not legal to define intrinsics.
740 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
742 // Check the entry node
743 BasicBlock *Entry = &F.getEntryBlock();
744 Assert1(pred_begin(Entry) == pred_end(Entry),
745 "Entry block to function must not have predecessors!", Entry);
747 // The address of the entry block cannot be taken, unless it is dead.
748 if (Entry->hasAddressTaken()) {
749 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
750 "blockaddress may not be used with the entry block!", Entry);
754 // If this function is actually an intrinsic, verify that it is only used in
755 // direct call/invokes, never having its "address taken".
756 if (F.getIntrinsicID()) {
758 if (F.hasAddressTaken(&U))
759 Assert1(0, "Invalid user of intrinsic instruction!", U);
763 // verifyBasicBlock - Verify that a basic block is well formed...
765 void Verifier::visitBasicBlock(BasicBlock &BB) {
766 InstsInThisBlock.clear();
768 // Ensure that basic blocks have terminators!
769 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
771 // Check constraints that this basic block imposes on all of the PHI nodes in
773 if (isa<PHINode>(BB.front())) {
774 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
775 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
776 std::sort(Preds.begin(), Preds.end());
778 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
779 // Ensure that PHI nodes have at least one entry!
780 Assert1(PN->getNumIncomingValues() != 0,
781 "PHI nodes must have at least one entry. If the block is dead, "
782 "the PHI should be removed!", PN);
783 Assert1(PN->getNumIncomingValues() == Preds.size(),
784 "PHINode should have one entry for each predecessor of its "
785 "parent basic block!", PN);
787 // Get and sort all incoming values in the PHI node...
789 Values.reserve(PN->getNumIncomingValues());
790 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
791 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
792 PN->getIncomingValue(i)));
793 std::sort(Values.begin(), Values.end());
795 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
796 // Check to make sure that if there is more than one entry for a
797 // particular basic block in this PHI node, that the incoming values are
800 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
801 Values[i].second == Values[i-1].second,
802 "PHI node has multiple entries for the same basic block with "
803 "different incoming values!", PN, Values[i].first,
804 Values[i].second, Values[i-1].second);
806 // Check to make sure that the predecessors and PHI node entries are
808 Assert3(Values[i].first == Preds[i],
809 "PHI node entries do not match predecessors!", PN,
810 Values[i].first, Preds[i]);
816 void Verifier::visitTerminatorInst(TerminatorInst &I) {
817 // Ensure that terminators only exist at the end of the basic block.
818 Assert1(&I == I.getParent()->getTerminator(),
819 "Terminator found in the middle of a basic block!", I.getParent());
823 void Verifier::visitBranchInst(BranchInst &BI) {
824 if (BI.isConditional()) {
825 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
826 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
828 visitTerminatorInst(BI);
831 void Verifier::visitReturnInst(ReturnInst &RI) {
832 Function *F = RI.getParent()->getParent();
833 unsigned N = RI.getNumOperands();
834 if (F->getReturnType()->isVoidTy())
836 "Found return instr that returns non-void in Function of void "
837 "return type!", &RI, F->getReturnType());
839 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
840 "Function return type does not match operand "
841 "type of return inst!", &RI, F->getReturnType());
843 // Check to make sure that the return value has necessary properties for
845 visitTerminatorInst(RI);
848 void Verifier::visitSwitchInst(SwitchInst &SI) {
849 // Check to make sure that all of the constants in the switch instruction
850 // have the same type as the switched-on value.
851 Type *SwitchTy = SI.getCondition()->getType();
852 IntegerType *IntTy = cast<IntegerType>(SwitchTy);
853 IntegersSubsetToBB Mapping;
854 std::map<IntegersSubset::Range, unsigned> RangeSetMap;
855 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
856 IntegersSubset CaseRanges = i.getCaseValueEx();
857 for (unsigned ri = 0, rie = CaseRanges.getNumItems(); ri < rie; ++ri) {
858 IntegersSubset::Range r = CaseRanges.getItem(ri);
859 Assert1(((const APInt&)r.getLow()).getBitWidth() == IntTy->getBitWidth(),
860 "Switch constants must all be same type as switch value!", &SI);
861 Assert1(((const APInt&)r.getHigh()).getBitWidth() == IntTy->getBitWidth(),
862 "Switch constants must all be same type as switch value!", &SI);
864 RangeSetMap[r] = i.getCaseIndex();
868 IntegersSubsetToBB::RangeIterator errItem;
869 if (!Mapping.verify(errItem)) {
870 unsigned CaseIndex = RangeSetMap[errItem->first];
871 SwitchInst::CaseIt i(&SI, CaseIndex);
872 Assert2(false, "Duplicate integer as switch case", &SI, i.getCaseValueEx());
875 visitTerminatorInst(SI);
878 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
879 Assert1(BI.getAddress()->getType()->isPointerTy(),
880 "Indirectbr operand must have pointer type!", &BI);
881 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
882 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
883 "Indirectbr destinations must all have pointer type!", &BI);
885 visitTerminatorInst(BI);
888 void Verifier::visitSelectInst(SelectInst &SI) {
889 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
891 "Invalid operands for select instruction!", &SI);
893 Assert1(SI.getTrueValue()->getType() == SI.getType(),
894 "Select values must have same type as select instruction!", &SI);
895 visitInstruction(SI);
898 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
899 /// a pass, if any exist, it's an error.
901 void Verifier::visitUserOp1(Instruction &I) {
902 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
905 void Verifier::visitTruncInst(TruncInst &I) {
906 // Get the source and destination types
907 Type *SrcTy = I.getOperand(0)->getType();
908 Type *DestTy = I.getType();
910 // Get the size of the types in bits, we'll need this later
911 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
912 unsigned DestBitSize = DestTy->getScalarSizeInBits();
914 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
915 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
916 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
917 "trunc source and destination must both be a vector or neither", &I);
918 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
923 void Verifier::visitZExtInst(ZExtInst &I) {
924 // Get the source and destination types
925 Type *SrcTy = I.getOperand(0)->getType();
926 Type *DestTy = I.getType();
928 // Get the size of the types in bits, we'll need this later
929 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
930 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
931 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
932 "zext source and destination must both be a vector or neither", &I);
933 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
934 unsigned DestBitSize = DestTy->getScalarSizeInBits();
936 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
941 void Verifier::visitSExtInst(SExtInst &I) {
942 // Get the source and destination types
943 Type *SrcTy = I.getOperand(0)->getType();
944 Type *DestTy = I.getType();
946 // Get the size of the types in bits, we'll need this later
947 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
948 unsigned DestBitSize = DestTy->getScalarSizeInBits();
950 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
951 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
952 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
953 "sext source and destination must both be a vector or neither", &I);
954 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
959 void Verifier::visitFPTruncInst(FPTruncInst &I) {
960 // Get the source and destination types
961 Type *SrcTy = I.getOperand(0)->getType();
962 Type *DestTy = I.getType();
963 // Get the size of the types in bits, we'll need this later
964 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
965 unsigned DestBitSize = DestTy->getScalarSizeInBits();
967 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
968 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
969 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
970 "fptrunc source and destination must both be a vector or neither",&I);
971 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
976 void Verifier::visitFPExtInst(FPExtInst &I) {
977 // Get the source and destination types
978 Type *SrcTy = I.getOperand(0)->getType();
979 Type *DestTy = I.getType();
981 // Get the size of the types in bits, we'll need this later
982 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
983 unsigned DestBitSize = DestTy->getScalarSizeInBits();
985 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
986 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
987 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
988 "fpext source and destination must both be a vector or neither", &I);
989 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
994 void Verifier::visitUIToFPInst(UIToFPInst &I) {
995 // Get the source and destination types
996 Type *SrcTy = I.getOperand(0)->getType();
997 Type *DestTy = I.getType();
999 bool SrcVec = SrcTy->isVectorTy();
1000 bool DstVec = DestTy->isVectorTy();
1002 Assert1(SrcVec == DstVec,
1003 "UIToFP source and dest must both be vector or scalar", &I);
1004 Assert1(SrcTy->isIntOrIntVectorTy(),
1005 "UIToFP source must be integer or integer vector", &I);
1006 Assert1(DestTy->isFPOrFPVectorTy(),
1007 "UIToFP result must be FP or FP vector", &I);
1009 if (SrcVec && DstVec)
1010 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1011 cast<VectorType>(DestTy)->getNumElements(),
1012 "UIToFP source and dest vector length mismatch", &I);
1014 visitInstruction(I);
1017 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1018 // Get the source and destination types
1019 Type *SrcTy = I.getOperand(0)->getType();
1020 Type *DestTy = I.getType();
1022 bool SrcVec = SrcTy->isVectorTy();
1023 bool DstVec = DestTy->isVectorTy();
1025 Assert1(SrcVec == DstVec,
1026 "SIToFP source and dest must both be vector or scalar", &I);
1027 Assert1(SrcTy->isIntOrIntVectorTy(),
1028 "SIToFP source must be integer or integer vector", &I);
1029 Assert1(DestTy->isFPOrFPVectorTy(),
1030 "SIToFP result must be FP or FP vector", &I);
1032 if (SrcVec && DstVec)
1033 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1034 cast<VectorType>(DestTy)->getNumElements(),
1035 "SIToFP source and dest vector length mismatch", &I);
1037 visitInstruction(I);
1040 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1041 // Get the source and destination types
1042 Type *SrcTy = I.getOperand(0)->getType();
1043 Type *DestTy = I.getType();
1045 bool SrcVec = SrcTy->isVectorTy();
1046 bool DstVec = DestTy->isVectorTy();
1048 Assert1(SrcVec == DstVec,
1049 "FPToUI source and dest must both be vector or scalar", &I);
1050 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1052 Assert1(DestTy->isIntOrIntVectorTy(),
1053 "FPToUI result must be integer or integer vector", &I);
1055 if (SrcVec && DstVec)
1056 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1057 cast<VectorType>(DestTy)->getNumElements(),
1058 "FPToUI source and dest vector length mismatch", &I);
1060 visitInstruction(I);
1063 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1064 // Get the source and destination types
1065 Type *SrcTy = I.getOperand(0)->getType();
1066 Type *DestTy = I.getType();
1068 bool SrcVec = SrcTy->isVectorTy();
1069 bool DstVec = DestTy->isVectorTy();
1071 Assert1(SrcVec == DstVec,
1072 "FPToSI source and dest must both be vector or scalar", &I);
1073 Assert1(SrcTy->isFPOrFPVectorTy(),
1074 "FPToSI source must be FP or FP vector", &I);
1075 Assert1(DestTy->isIntOrIntVectorTy(),
1076 "FPToSI result must be integer or integer vector", &I);
1078 if (SrcVec && DstVec)
1079 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1080 cast<VectorType>(DestTy)->getNumElements(),
1081 "FPToSI source and dest vector length mismatch", &I);
1083 visitInstruction(I);
1086 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1087 // Get the source and destination types
1088 Type *SrcTy = I.getOperand(0)->getType();
1089 Type *DestTy = I.getType();
1091 Assert1(SrcTy->getScalarType()->isPointerTy(),
1092 "PtrToInt source must be pointer", &I);
1093 Assert1(DestTy->getScalarType()->isIntegerTy(),
1094 "PtrToInt result must be integral", &I);
1095 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1096 "PtrToInt type mismatch", &I);
1098 if (SrcTy->isVectorTy()) {
1099 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1100 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1101 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1102 "PtrToInt Vector width mismatch", &I);
1105 visitInstruction(I);
1108 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1109 // Get the source and destination types
1110 Type *SrcTy = I.getOperand(0)->getType();
1111 Type *DestTy = I.getType();
1113 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1114 "IntToPtr source must be an integral", &I);
1115 Assert1(DestTy->getScalarType()->isPointerTy(),
1116 "IntToPtr result must be a pointer",&I);
1117 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1118 "IntToPtr type mismatch", &I);
1119 if (SrcTy->isVectorTy()) {
1120 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1121 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1122 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1123 "IntToPtr Vector width mismatch", &I);
1125 visitInstruction(I);
1128 void Verifier::visitBitCastInst(BitCastInst &I) {
1129 // Get the source and destination types
1130 Type *SrcTy = I.getOperand(0)->getType();
1131 Type *DestTy = I.getType();
1133 // Get the size of the types in bits, we'll need this later
1134 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1135 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
1137 // BitCast implies a no-op cast of type only. No bits change.
1138 // However, you can't cast pointers to anything but pointers.
1139 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
1140 "Bitcast requires both operands to be pointer or neither", &I);
1141 Assert1(SrcBitSize == DestBitSize, "Bitcast requires types of same width",&I);
1143 // Disallow aggregates.
1144 Assert1(!SrcTy->isAggregateType(),
1145 "Bitcast operand must not be aggregate", &I);
1146 Assert1(!DestTy->isAggregateType(),
1147 "Bitcast type must not be aggregate", &I);
1149 visitInstruction(I);
1152 /// visitPHINode - Ensure that a PHI node is well formed.
1154 void Verifier::visitPHINode(PHINode &PN) {
1155 // Ensure that the PHI nodes are all grouped together at the top of the block.
1156 // This can be tested by checking whether the instruction before this is
1157 // either nonexistent (because this is begin()) or is a PHI node. If not,
1158 // then there is some other instruction before a PHI.
1159 Assert2(&PN == &PN.getParent()->front() ||
1160 isa<PHINode>(--BasicBlock::iterator(&PN)),
1161 "PHI nodes not grouped at top of basic block!",
1162 &PN, PN.getParent());
1164 // Check that all of the values of the PHI node have the same type as the
1165 // result, and that the incoming blocks are really basic blocks.
1166 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1167 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1168 "PHI node operands are not the same type as the result!", &PN);
1171 // All other PHI node constraints are checked in the visitBasicBlock method.
1173 visitInstruction(PN);
1176 void Verifier::VerifyCallSite(CallSite CS) {
1177 Instruction *I = CS.getInstruction();
1179 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1180 "Called function must be a pointer!", I);
1181 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1183 Assert1(FPTy->getElementType()->isFunctionTy(),
1184 "Called function is not pointer to function type!", I);
1185 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1187 // Verify that the correct number of arguments are being passed
1188 if (FTy->isVarArg())
1189 Assert1(CS.arg_size() >= FTy->getNumParams(),
1190 "Called function requires more parameters than were provided!",I);
1192 Assert1(CS.arg_size() == FTy->getNumParams(),
1193 "Incorrect number of arguments passed to called function!", I);
1195 // Verify that all arguments to the call match the function type.
1196 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1197 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1198 "Call parameter type does not match function signature!",
1199 CS.getArgument(i), FTy->getParamType(i), I);
1201 const AttrListPtr &Attrs = CS.getAttributes();
1203 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1204 "Attributes after last parameter!", I);
1206 // Verify call attributes.
1207 VerifyFunctionAttrs(FTy, Attrs, I);
1209 if (FTy->isVarArg())
1210 // Check attributes on the varargs part.
1211 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1212 Attributes Attr = Attrs.getParamAttributes(Idx);
1214 VerifyParameterAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
1216 Assert1(!Attr.hasIncompatibleWithVarArgsAttrs(),
1217 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1220 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1221 if (CS.getCalledFunction() == 0 ||
1222 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1223 for (FunctionType::param_iterator PI = FTy->param_begin(),
1224 PE = FTy->param_end(); PI != PE; ++PI)
1225 Assert1(!(*PI)->isMetadataTy(),
1226 "Function has metadata parameter but isn't an intrinsic", I);
1229 visitInstruction(*I);
1232 void Verifier::visitCallInst(CallInst &CI) {
1233 VerifyCallSite(&CI);
1235 if (Function *F = CI.getCalledFunction())
1236 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1237 visitIntrinsicFunctionCall(ID, CI);
1240 void Verifier::visitInvokeInst(InvokeInst &II) {
1241 VerifyCallSite(&II);
1243 // Verify that there is a landingpad instruction as the first non-PHI
1244 // instruction of the 'unwind' destination.
1245 Assert1(II.getUnwindDest()->isLandingPad(),
1246 "The unwind destination does not have a landingpad instruction!",&II);
1248 visitTerminatorInst(II);
1251 /// visitBinaryOperator - Check that both arguments to the binary operator are
1252 /// of the same type!
1254 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1255 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1256 "Both operands to a binary operator are not of the same type!", &B);
1258 switch (B.getOpcode()) {
1259 // Check that integer arithmetic operators are only used with
1260 // integral operands.
1261 case Instruction::Add:
1262 case Instruction::Sub:
1263 case Instruction::Mul:
1264 case Instruction::SDiv:
1265 case Instruction::UDiv:
1266 case Instruction::SRem:
1267 case Instruction::URem:
1268 Assert1(B.getType()->isIntOrIntVectorTy(),
1269 "Integer arithmetic operators only work with integral types!", &B);
1270 Assert1(B.getType() == B.getOperand(0)->getType(),
1271 "Integer arithmetic operators must have same type "
1272 "for operands and result!", &B);
1274 // Check that floating-point arithmetic operators are only used with
1275 // floating-point operands.
1276 case Instruction::FAdd:
1277 case Instruction::FSub:
1278 case Instruction::FMul:
1279 case Instruction::FDiv:
1280 case Instruction::FRem:
1281 Assert1(B.getType()->isFPOrFPVectorTy(),
1282 "Floating-point arithmetic operators only work with "
1283 "floating-point types!", &B);
1284 Assert1(B.getType() == B.getOperand(0)->getType(),
1285 "Floating-point arithmetic operators must have same type "
1286 "for operands and result!", &B);
1288 // Check that logical operators are only used with integral operands.
1289 case Instruction::And:
1290 case Instruction::Or:
1291 case Instruction::Xor:
1292 Assert1(B.getType()->isIntOrIntVectorTy(),
1293 "Logical operators only work with integral types!", &B);
1294 Assert1(B.getType() == B.getOperand(0)->getType(),
1295 "Logical operators must have same type for operands and result!",
1298 case Instruction::Shl:
1299 case Instruction::LShr:
1300 case Instruction::AShr:
1301 Assert1(B.getType()->isIntOrIntVectorTy(),
1302 "Shifts only work with integral types!", &B);
1303 Assert1(B.getType() == B.getOperand(0)->getType(),
1304 "Shift return type must be same as operands!", &B);
1307 llvm_unreachable("Unknown BinaryOperator opcode!");
1310 visitInstruction(B);
1313 void Verifier::visitICmpInst(ICmpInst &IC) {
1314 // Check that the operands are the same type
1315 Type *Op0Ty = IC.getOperand(0)->getType();
1316 Type *Op1Ty = IC.getOperand(1)->getType();
1317 Assert1(Op0Ty == Op1Ty,
1318 "Both operands to ICmp instruction are not of the same type!", &IC);
1319 // Check that the operands are the right type
1320 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1321 "Invalid operand types for ICmp instruction", &IC);
1322 // Check that the predicate is valid.
1323 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1324 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1325 "Invalid predicate in ICmp instruction!", &IC);
1327 visitInstruction(IC);
1330 void Verifier::visitFCmpInst(FCmpInst &FC) {
1331 // Check that the operands are the same type
1332 Type *Op0Ty = FC.getOperand(0)->getType();
1333 Type *Op1Ty = FC.getOperand(1)->getType();
1334 Assert1(Op0Ty == Op1Ty,
1335 "Both operands to FCmp instruction are not of the same type!", &FC);
1336 // Check that the operands are the right type
1337 Assert1(Op0Ty->isFPOrFPVectorTy(),
1338 "Invalid operand types for FCmp instruction", &FC);
1339 // Check that the predicate is valid.
1340 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1341 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1342 "Invalid predicate in FCmp instruction!", &FC);
1344 visitInstruction(FC);
1347 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1348 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1350 "Invalid extractelement operands!", &EI);
1351 visitInstruction(EI);
1354 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1355 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1358 "Invalid insertelement operands!", &IE);
1359 visitInstruction(IE);
1362 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1363 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1365 "Invalid shufflevector operands!", &SV);
1366 visitInstruction(SV);
1369 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1370 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1372 Assert1(isa<PointerType>(TargetTy),
1373 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1374 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1375 "GEP into unsized type!", &GEP);
1377 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1379 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1380 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1382 if (GEP.getPointerOperandType()->isPointerTy()) {
1383 // Validate GEPs with scalar indices.
1384 Assert2(GEP.getType()->isPointerTy() &&
1385 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1386 "GEP is not of right type for indices!", &GEP, ElTy);
1388 // Validate GEPs with a vector index.
1389 Assert1(Idxs.size() == 1, "Invalid number of indices!", &GEP);
1390 Value *Index = Idxs[0];
1391 Type *IndexTy = Index->getType();
1392 Assert1(IndexTy->isVectorTy(),
1393 "Vector GEP must have vector indices!", &GEP);
1394 Assert1(GEP.getType()->isVectorTy(),
1395 "Vector GEP must return a vector value", &GEP);
1396 Type *ElemPtr = cast<VectorType>(GEP.getType())->getElementType();
1397 Assert1(ElemPtr->isPointerTy(),
1398 "Vector GEP pointer operand is not a pointer!", &GEP);
1399 unsigned IndexWidth = cast<VectorType>(IndexTy)->getNumElements();
1400 unsigned GepWidth = cast<VectorType>(GEP.getType())->getNumElements();
1401 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1402 Assert1(ElTy == cast<PointerType>(ElemPtr)->getElementType(),
1403 "Vector GEP type does not match pointer type!", &GEP);
1405 visitInstruction(GEP);
1408 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1409 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1412 void Verifier::visitLoadInst(LoadInst &LI) {
1413 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1414 Assert1(PTy, "Load operand must be a pointer.", &LI);
1415 Type *ElTy = PTy->getElementType();
1416 Assert2(ElTy == LI.getType(),
1417 "Load result type does not match pointer operand type!", &LI, ElTy);
1418 if (LI.isAtomic()) {
1419 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1420 "Load cannot have Release ordering", &LI);
1421 Assert1(LI.getAlignment() != 0,
1422 "Atomic load must specify explicit alignment", &LI);
1423 if (!ElTy->isPointerTy()) {
1424 Assert2(ElTy->isIntegerTy(),
1425 "atomic store operand must have integer type!",
1427 unsigned Size = ElTy->getPrimitiveSizeInBits();
1428 Assert2(Size >= 8 && !(Size & (Size - 1)),
1429 "atomic store operand must be power-of-two byte-sized integer",
1433 Assert1(LI.getSynchScope() == CrossThread,
1434 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1437 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1438 unsigned NumOperands = Range->getNumOperands();
1439 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1440 unsigned NumRanges = NumOperands / 2;
1441 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1443 ConstantRange LastRange(1); // Dummy initial value
1444 for (unsigned i = 0; i < NumRanges; ++i) {
1445 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1446 Assert1(Low, "The lower limit must be an integer!", Low);
1447 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1448 Assert1(High, "The upper limit must be an integer!", High);
1449 Assert1(High->getType() == Low->getType() &&
1450 High->getType() == ElTy, "Range types must match load type!",
1453 APInt HighV = High->getValue();
1454 APInt LowV = Low->getValue();
1455 ConstantRange CurRange(LowV, HighV);
1456 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1457 "Range must not be empty!", Range);
1459 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1460 "Intervals are overlapping", Range);
1461 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1463 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1466 LastRange = ConstantRange(LowV, HighV);
1468 if (NumRanges > 2) {
1470 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1472 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1473 ConstantRange FirstRange(FirstLow, FirstHigh);
1474 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1475 "Intervals are overlapping", Range);
1476 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1483 visitInstruction(LI);
1486 void Verifier::visitStoreInst(StoreInst &SI) {
1487 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1488 Assert1(PTy, "Store operand must be a pointer.", &SI);
1489 Type *ElTy = PTy->getElementType();
1490 Assert2(ElTy == SI.getOperand(0)->getType(),
1491 "Stored value type does not match pointer operand type!",
1493 if (SI.isAtomic()) {
1494 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1495 "Store cannot have Acquire ordering", &SI);
1496 Assert1(SI.getAlignment() != 0,
1497 "Atomic store must specify explicit alignment", &SI);
1498 if (!ElTy->isPointerTy()) {
1499 Assert2(ElTy->isIntegerTy(),
1500 "atomic store operand must have integer type!",
1502 unsigned Size = ElTy->getPrimitiveSizeInBits();
1503 Assert2(Size >= 8 && !(Size & (Size - 1)),
1504 "atomic store operand must be power-of-two byte-sized integer",
1508 Assert1(SI.getSynchScope() == CrossThread,
1509 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1511 visitInstruction(SI);
1514 void Verifier::visitAllocaInst(AllocaInst &AI) {
1515 PointerType *PTy = AI.getType();
1516 Assert1(PTy->getAddressSpace() == 0,
1517 "Allocation instruction pointer not in the generic address space!",
1519 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1521 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
1522 "Alloca array size must have integer type", &AI);
1523 visitInstruction(AI);
1526 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
1527 Assert1(CXI.getOrdering() != NotAtomic,
1528 "cmpxchg instructions must be atomic.", &CXI);
1529 Assert1(CXI.getOrdering() != Unordered,
1530 "cmpxchg instructions cannot be unordered.", &CXI);
1531 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
1532 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
1533 Type *ElTy = PTy->getElementType();
1534 Assert2(ElTy->isIntegerTy(),
1535 "cmpxchg operand must have integer type!",
1537 unsigned Size = ElTy->getPrimitiveSizeInBits();
1538 Assert2(Size >= 8 && !(Size & (Size - 1)),
1539 "cmpxchg operand must be power-of-two byte-sized integer",
1541 Assert2(ElTy == CXI.getOperand(1)->getType(),
1542 "Expected value type does not match pointer operand type!",
1544 Assert2(ElTy == CXI.getOperand(2)->getType(),
1545 "Stored value type does not match pointer operand type!",
1547 visitInstruction(CXI);
1550 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
1551 Assert1(RMWI.getOrdering() != NotAtomic,
1552 "atomicrmw instructions must be atomic.", &RMWI);
1553 Assert1(RMWI.getOrdering() != Unordered,
1554 "atomicrmw instructions cannot be unordered.", &RMWI);
1555 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
1556 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
1557 Type *ElTy = PTy->getElementType();
1558 Assert2(ElTy->isIntegerTy(),
1559 "atomicrmw operand must have integer type!",
1561 unsigned Size = ElTy->getPrimitiveSizeInBits();
1562 Assert2(Size >= 8 && !(Size & (Size - 1)),
1563 "atomicrmw operand must be power-of-two byte-sized integer",
1565 Assert2(ElTy == RMWI.getOperand(1)->getType(),
1566 "Argument value type does not match pointer operand type!",
1568 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
1569 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
1570 "Invalid binary operation!", &RMWI);
1571 visitInstruction(RMWI);
1574 void Verifier::visitFenceInst(FenceInst &FI) {
1575 const AtomicOrdering Ordering = FI.getOrdering();
1576 Assert1(Ordering == Acquire || Ordering == Release ||
1577 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
1578 "fence instructions may only have "
1579 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
1580 visitInstruction(FI);
1583 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1584 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1585 EVI.getIndices()) ==
1587 "Invalid ExtractValueInst operands!", &EVI);
1589 visitInstruction(EVI);
1592 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1593 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1594 IVI.getIndices()) ==
1595 IVI.getOperand(1)->getType(),
1596 "Invalid InsertValueInst operands!", &IVI);
1598 visitInstruction(IVI);
1601 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
1602 BasicBlock *BB = LPI.getParent();
1604 // The landingpad instruction is ill-formed if it doesn't have any clauses and
1606 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
1607 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
1609 // The landingpad instruction defines its parent as a landing pad block. The
1610 // landing pad block may be branched to only by the unwind edge of an invoke.
1611 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
1612 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
1613 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
1614 "Block containing LandingPadInst must be jumped to "
1615 "only by the unwind edge of an invoke.", &LPI);
1618 // The landingpad instruction must be the first non-PHI instruction in the
1620 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
1621 "LandingPadInst not the first non-PHI instruction in the block.",
1624 // The personality functions for all landingpad instructions within the same
1625 // function should match.
1627 Assert1(LPI.getPersonalityFn() == PersonalityFn,
1628 "Personality function doesn't match others in function", &LPI);
1629 PersonalityFn = LPI.getPersonalityFn();
1631 // All operands must be constants.
1632 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
1634 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
1635 Value *Clause = LPI.getClause(i);
1636 Assert1(isa<Constant>(Clause), "Clause is not constant!", &LPI);
1637 if (LPI.isCatch(i)) {
1638 Assert1(isa<PointerType>(Clause->getType()),
1639 "Catch operand does not have pointer type!", &LPI);
1641 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
1642 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
1643 "Filter operand is not an array of constants!", &LPI);
1647 visitInstruction(LPI);
1650 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
1651 Instruction *Op = cast<Instruction>(I.getOperand(i));
1652 // If the we have an invalid invoke, don't try to compute the dominance.
1653 // We already reject it in the invoke specific checks and the dominance
1654 // computation doesn't handle multiple edges.
1655 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1656 if (II->getNormalDest() == II->getUnwindDest())
1660 const Use &U = I.getOperandUse(i);
1661 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, U),
1662 "Instruction does not dominate all uses!", Op, &I);
1665 /// verifyInstruction - Verify that an instruction is well formed.
1667 void Verifier::visitInstruction(Instruction &I) {
1668 BasicBlock *BB = I.getParent();
1669 Assert1(BB, "Instruction not embedded in basic block!", &I);
1671 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1672 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1674 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
1675 "Only PHI nodes may reference their own value!", &I);
1678 // Check that void typed values don't have names
1679 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1680 "Instruction has a name, but provides a void value!", &I);
1682 // Check that the return value of the instruction is either void or a legal
1684 Assert1(I.getType()->isVoidTy() ||
1685 I.getType()->isFirstClassType(),
1686 "Instruction returns a non-scalar type!", &I);
1688 // Check that the instruction doesn't produce metadata. Calls are already
1689 // checked against the callee type.
1690 Assert1(!I.getType()->isMetadataTy() ||
1691 isa<CallInst>(I) || isa<InvokeInst>(I),
1692 "Invalid use of metadata!", &I);
1694 // Check that all uses of the instruction, if they are instructions
1695 // themselves, actually have parent basic blocks. If the use is not an
1696 // instruction, it is an error!
1697 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1699 if (Instruction *Used = dyn_cast<Instruction>(*UI))
1700 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1701 " embedded in a basic block!", &I, Used);
1703 CheckFailed("Use of instruction is not an instruction!", *UI);
1708 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1709 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1711 // Check to make sure that only first-class-values are operands to
1713 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1714 Assert1(0, "Instruction operands must be first-class values!", &I);
1717 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1718 // Check to make sure that the "address of" an intrinsic function is never
1720 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
1721 "Cannot take the address of an intrinsic!", &I);
1722 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
1723 F->getIntrinsicID() == Intrinsic::donothing,
1724 "Cannot invoke an intrinsinc other than donothing", &I);
1725 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1727 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1728 Assert1(OpBB->getParent() == BB->getParent(),
1729 "Referring to a basic block in another function!", &I);
1730 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1731 Assert1(OpArg->getParent() == BB->getParent(),
1732 "Referring to an argument in another function!", &I);
1733 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1734 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1736 } else if (isa<Instruction>(I.getOperand(i))) {
1737 verifyDominatesUse(I, i);
1738 } else if (isa<InlineAsm>(I.getOperand(i))) {
1739 Assert1((i + 1 == e && isa<CallInst>(I)) ||
1740 (i + 3 == e && isa<InvokeInst>(I)),
1741 "Cannot take the address of an inline asm!", &I);
1745 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
1746 Assert1(I.getType()->isFPOrFPVectorTy(),
1747 "fpmath requires a floating point result!", &I);
1748 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
1749 Value *Op0 = MD->getOperand(0);
1750 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
1751 APFloat Accuracy = CFP0->getValueAPF();
1752 Assert1(Accuracy.isNormal() && !Accuracy.isNegative(),
1753 "fpmath accuracy not a positive number!", &I);
1755 Assert1(false, "invalid fpmath accuracy!", &I);
1759 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
1760 Assert1(!MD || isa<LoadInst>(I), "Ranges are only for loads!", &I);
1762 InstsInThisBlock.insert(&I);
1765 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
1766 /// intrinsic argument or return value) matches the type constraints specified
1767 /// by the .td file (e.g. an "any integer" argument really is an integer).
1769 /// This return true on error but does not print a message.
1770 bool Verifier::VerifyIntrinsicType(Type *Ty,
1771 ArrayRef<Intrinsic::IITDescriptor> &Infos,
1772 SmallVectorImpl<Type*> &ArgTys) {
1773 using namespace Intrinsic;
1775 // If we ran out of descriptors, there are too many arguments.
1776 if (Infos.empty()) return true;
1777 IITDescriptor D = Infos.front();
1778 Infos = Infos.slice(1);
1781 case IITDescriptor::Void: return !Ty->isVoidTy();
1782 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
1783 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
1784 case IITDescriptor::Float: return !Ty->isFloatTy();
1785 case IITDescriptor::Double: return !Ty->isDoubleTy();
1786 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
1787 case IITDescriptor::Vector: {
1788 VectorType *VT = dyn_cast<VectorType>(Ty);
1789 return VT == 0 || VT->getNumElements() != D.Vector_Width ||
1790 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
1792 case IITDescriptor::Pointer: {
1793 PointerType *PT = dyn_cast<PointerType>(Ty);
1794 return PT == 0 || PT->getAddressSpace() != D.Pointer_AddressSpace ||
1795 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
1798 case IITDescriptor::Struct: {
1799 StructType *ST = dyn_cast<StructType>(Ty);
1800 if (ST == 0 || ST->getNumElements() != D.Struct_NumElements)
1803 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
1804 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
1809 case IITDescriptor::Argument:
1810 // Two cases here - If this is the second occurrence of an argument, verify
1811 // that the later instance matches the previous instance.
1812 if (D.getArgumentNumber() < ArgTys.size())
1813 return Ty != ArgTys[D.getArgumentNumber()];
1815 // Otherwise, if this is the first instance of an argument, record it and
1816 // verify the "Any" kind.
1817 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
1818 ArgTys.push_back(Ty);
1820 switch (D.getArgumentKind()) {
1821 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
1822 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
1823 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
1824 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
1826 llvm_unreachable("all argument kinds not covered");
1828 case IITDescriptor::ExtendVecArgument:
1829 // This may only be used when referring to a previous vector argument.
1830 return D.getArgumentNumber() >= ArgTys.size() ||
1831 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
1832 VectorType::getExtendedElementVectorType(
1833 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
1835 case IITDescriptor::TruncVecArgument:
1836 // This may only be used when referring to a previous vector argument.
1837 return D.getArgumentNumber() >= ArgTys.size() ||
1838 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
1839 VectorType::getTruncatedElementVectorType(
1840 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
1842 llvm_unreachable("unhandled");
1845 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1847 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1848 Function *IF = CI.getCalledFunction();
1849 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1852 // Verify that the intrinsic prototype lines up with what the .td files
1854 FunctionType *IFTy = IF->getFunctionType();
1855 Assert1(!IFTy->isVarArg(), "Intrinsic prototypes are not varargs", IF);
1857 SmallVector<Intrinsic::IITDescriptor, 8> Table;
1858 getIntrinsicInfoTableEntries(ID, Table);
1859 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
1861 SmallVector<Type *, 4> ArgTys;
1862 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
1863 "Intrinsic has incorrect return type!", IF);
1864 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
1865 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
1866 "Intrinsic has incorrect argument type!", IF);
1867 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
1869 // Now that we have the intrinsic ID and the actual argument types (and we
1870 // know they are legal for the intrinsic!) get the intrinsic name through the
1871 // usual means. This allows us to verify the mangling of argument types into
1873 Assert1(Intrinsic::getName(ID, ArgTys) == IF->getName(),
1874 "Intrinsic name not mangled correctly for type arguments!", IF);
1876 // If the intrinsic takes MDNode arguments, verify that they are either global
1877 // or are local to *this* function.
1878 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
1879 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
1880 visitMDNode(*MD, CI.getParent()->getParent());
1885 case Intrinsic::ctlz: // llvm.ctlz
1886 case Intrinsic::cttz: // llvm.cttz
1887 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
1888 "is_zero_undef argument of bit counting intrinsics must be a "
1889 "constant int", &CI);
1891 case Intrinsic::dbg_declare: { // llvm.dbg.declare
1892 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
1893 "invalid llvm.dbg.declare intrinsic call 1", &CI);
1894 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
1895 Assert1(MD->getNumOperands() == 1,
1896 "invalid llvm.dbg.declare intrinsic call 2", &CI);
1898 case Intrinsic::memcpy:
1899 case Intrinsic::memmove:
1900 case Intrinsic::memset:
1901 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
1902 "alignment argument of memory intrinsics must be a constant int",
1904 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
1905 "isvolatile argument of memory intrinsics must be a constant int",
1908 case Intrinsic::gcroot:
1909 case Intrinsic::gcwrite:
1910 case Intrinsic::gcread:
1911 if (ID == Intrinsic::gcroot) {
1913 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
1914 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
1915 Assert1(isa<Constant>(CI.getArgOperand(1)),
1916 "llvm.gcroot parameter #2 must be a constant.", &CI);
1917 if (!AI->getType()->getElementType()->isPointerTy()) {
1918 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
1919 "llvm.gcroot parameter #1 must either be a pointer alloca, "
1920 "or argument #2 must be a non-null constant.", &CI);
1924 Assert1(CI.getParent()->getParent()->hasGC(),
1925 "Enclosing function does not use GC.", &CI);
1927 case Intrinsic::init_trampoline:
1928 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
1929 "llvm.init_trampoline parameter #2 must resolve to a function.",
1932 case Intrinsic::prefetch:
1933 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
1934 isa<ConstantInt>(CI.getArgOperand(2)) &&
1935 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
1936 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
1937 "invalid arguments to llvm.prefetch",
1940 case Intrinsic::stackprotector:
1941 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
1942 "llvm.stackprotector parameter #2 must resolve to an alloca.",
1945 case Intrinsic::lifetime_start:
1946 case Intrinsic::lifetime_end:
1947 case Intrinsic::invariant_start:
1948 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
1949 "size argument of memory use markers must be a constant integer",
1952 case Intrinsic::invariant_end:
1953 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
1954 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
1959 //===----------------------------------------------------------------------===//
1960 // Implement the public interfaces to this file...
1961 //===----------------------------------------------------------------------===//
1963 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1964 return new Verifier(action);
1968 /// verifyFunction - Check a function for errors, printing messages on stderr.
1969 /// Return true if the function is corrupt.
1971 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1972 Function &F = const_cast<Function&>(f);
1973 assert(!F.isDeclaration() && "Cannot verify external functions");
1975 FunctionPassManager FPM(F.getParent());
1976 Verifier *V = new Verifier(action);
1982 /// verifyModule - Check a module for errors, printing messages on stderr.
1983 /// Return true if the module is corrupt.
1985 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1986 std::string *ErrorInfo) {
1988 Verifier *V = new Verifier(action);
1990 PM.run(const_cast<Module&>(M));
1992 if (ErrorInfo && V->Broken)
1993 *ErrorInfo = V->MessagesStr.str();