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);
542 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
543 Attributes MutI = Attrs & Attribute::MutuallyIncompatible[i];
544 Assert1(MutI.isEmptyOrSingleton(), "Attributes '" +
545 MutI.getAsString() + "' are incompatible!", V);
548 Attributes TypeI = Attrs & Attributes::typeIncompatible(Ty);
549 Assert1(!TypeI, "Wrong type for attribute " +
550 TypeI.getAsString(), V);
552 if (PointerType *PTy = dyn_cast<PointerType>(Ty))
553 Assert1(!Attrs.hasAttribute(Attributes::ByVal) ||
554 PTy->getElementType()->isSized(),
555 "Attribute 'byval' does not support unsized types!", V);
557 Assert1(!Attrs.hasAttribute(Attributes::ByVal),
558 "Attribute 'byval' only applies to parameters with pointer type!",
562 // VerifyFunctionAttrs - Check parameter attributes against a function type.
563 // The value V is printed in error messages.
564 void Verifier::VerifyFunctionAttrs(FunctionType *FT,
565 const AttrListPtr &Attrs,
570 bool SawNest = false;
572 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
573 const AttributeWithIndex &Attr = Attrs.getSlot(i);
577 Ty = FT->getReturnType();
578 else if (Attr.Index-1 < FT->getNumParams())
579 Ty = FT->getParamType(Attr.Index-1);
581 break; // VarArgs attributes, verified elsewhere.
583 VerifyParameterAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
585 if (Attr.Attrs.hasAttribute(Attributes::Nest)) {
586 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
590 if (Attr.Attrs.hasAttribute(Attributes::StructRet))
591 Assert1(Attr.Index == 1, "Attribute sret not on first parameter!", V);
594 Attributes FAttrs = Attrs.getFnAttributes();
595 Attributes::Builder NotFn(FAttrs);
596 NotFn.removeFunctionOnlyAttrs();
597 Assert1(!NotFn.hasAttributes(), "Attributes '" +
598 Attributes::get(NotFn).getAsString() +
599 "' do not apply to the function!", V);
602 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
603 Attributes MutI = FAttrs & Attribute::MutuallyIncompatible[i];
604 Assert1(MutI.isEmptyOrSingleton(), "Attributes " +
605 MutI.getAsString() + " are incompatible!", V);
609 static bool VerifyAttributeCount(const AttrListPtr &Attrs, unsigned Params) {
613 unsigned LastSlot = Attrs.getNumSlots() - 1;
614 unsigned LastIndex = Attrs.getSlot(LastSlot).Index;
615 if (LastIndex <= Params
616 || (LastIndex == (unsigned)~0
617 && (LastSlot == 0 || Attrs.getSlot(LastSlot - 1).Index <= Params)))
623 // visitFunction - Verify that a function is ok.
625 void Verifier::visitFunction(Function &F) {
626 // Check function arguments.
627 FunctionType *FT = F.getFunctionType();
628 unsigned NumArgs = F.arg_size();
630 Assert1(Context == &F.getContext(),
631 "Function context does not match Module context!", &F);
633 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
634 Assert2(FT->getNumParams() == NumArgs,
635 "# formal arguments must match # of arguments for function type!",
637 Assert1(F.getReturnType()->isFirstClassType() ||
638 F.getReturnType()->isVoidTy() ||
639 F.getReturnType()->isStructTy(),
640 "Functions cannot return aggregate values!", &F);
642 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
643 "Invalid struct return type!", &F);
645 const AttrListPtr &Attrs = F.getAttributes();
647 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
648 "Attributes after last parameter!", &F);
650 // Check function attributes.
651 VerifyFunctionAttrs(FT, Attrs, &F);
653 // Check that this function meets the restrictions on this calling convention.
654 switch (F.getCallingConv()) {
659 case CallingConv::Fast:
660 case CallingConv::Cold:
661 case CallingConv::X86_FastCall:
662 case CallingConv::X86_ThisCall:
663 case CallingConv::PTX_Kernel:
664 case CallingConv::PTX_Device:
665 Assert1(!F.isVarArg(),
666 "Varargs functions must have C calling conventions!", &F);
670 bool isLLVMdotName = F.getName().size() >= 5 &&
671 F.getName().substr(0, 5) == "llvm.";
673 // Check that the argument values match the function type for this function...
675 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
677 Assert2(I->getType() == FT->getParamType(i),
678 "Argument value does not match function argument type!",
679 I, FT->getParamType(i));
680 Assert1(I->getType()->isFirstClassType(),
681 "Function arguments must have first-class types!", I);
683 Assert2(!I->getType()->isMetadataTy(),
684 "Function takes metadata but isn't an intrinsic", I, &F);
687 if (F.isMaterializable()) {
688 // Function has a body somewhere we can't see.
689 } else if (F.isDeclaration()) {
690 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
691 F.hasExternalWeakLinkage(),
692 "invalid linkage type for function declaration", &F);
694 // Verify that this function (which has a body) is not named "llvm.*". It
695 // is not legal to define intrinsics.
696 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
698 // Check the entry node
699 BasicBlock *Entry = &F.getEntryBlock();
700 Assert1(pred_begin(Entry) == pred_end(Entry),
701 "Entry block to function must not have predecessors!", Entry);
703 // The address of the entry block cannot be taken, unless it is dead.
704 if (Entry->hasAddressTaken()) {
705 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
706 "blockaddress may not be used with the entry block!", Entry);
710 // If this function is actually an intrinsic, verify that it is only used in
711 // direct call/invokes, never having its "address taken".
712 if (F.getIntrinsicID()) {
714 if (F.hasAddressTaken(&U))
715 Assert1(0, "Invalid user of intrinsic instruction!", U);
719 // verifyBasicBlock - Verify that a basic block is well formed...
721 void Verifier::visitBasicBlock(BasicBlock &BB) {
722 InstsInThisBlock.clear();
724 // Ensure that basic blocks have terminators!
725 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
727 // Check constraints that this basic block imposes on all of the PHI nodes in
729 if (isa<PHINode>(BB.front())) {
730 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
731 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
732 std::sort(Preds.begin(), Preds.end());
734 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
735 // Ensure that PHI nodes have at least one entry!
736 Assert1(PN->getNumIncomingValues() != 0,
737 "PHI nodes must have at least one entry. If the block is dead, "
738 "the PHI should be removed!", PN);
739 Assert1(PN->getNumIncomingValues() == Preds.size(),
740 "PHINode should have one entry for each predecessor of its "
741 "parent basic block!", PN);
743 // Get and sort all incoming values in the PHI node...
745 Values.reserve(PN->getNumIncomingValues());
746 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
747 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
748 PN->getIncomingValue(i)));
749 std::sort(Values.begin(), Values.end());
751 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
752 // Check to make sure that if there is more than one entry for a
753 // particular basic block in this PHI node, that the incoming values are
756 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
757 Values[i].second == Values[i-1].second,
758 "PHI node has multiple entries for the same basic block with "
759 "different incoming values!", PN, Values[i].first,
760 Values[i].second, Values[i-1].second);
762 // Check to make sure that the predecessors and PHI node entries are
764 Assert3(Values[i].first == Preds[i],
765 "PHI node entries do not match predecessors!", PN,
766 Values[i].first, Preds[i]);
772 void Verifier::visitTerminatorInst(TerminatorInst &I) {
773 // Ensure that terminators only exist at the end of the basic block.
774 Assert1(&I == I.getParent()->getTerminator(),
775 "Terminator found in the middle of a basic block!", I.getParent());
779 void Verifier::visitBranchInst(BranchInst &BI) {
780 if (BI.isConditional()) {
781 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
782 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
784 visitTerminatorInst(BI);
787 void Verifier::visitReturnInst(ReturnInst &RI) {
788 Function *F = RI.getParent()->getParent();
789 unsigned N = RI.getNumOperands();
790 if (F->getReturnType()->isVoidTy())
792 "Found return instr that returns non-void in Function of void "
793 "return type!", &RI, F->getReturnType());
795 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
796 "Function return type does not match operand "
797 "type of return inst!", &RI, F->getReturnType());
799 // Check to make sure that the return value has necessary properties for
801 visitTerminatorInst(RI);
804 void Verifier::visitSwitchInst(SwitchInst &SI) {
805 // Check to make sure that all of the constants in the switch instruction
806 // have the same type as the switched-on value.
807 Type *SwitchTy = SI.getCondition()->getType();
808 IntegerType *IntTy = cast<IntegerType>(SwitchTy);
809 IntegersSubsetToBB Mapping;
810 std::map<IntegersSubset::Range, unsigned> RangeSetMap;
811 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
812 IntegersSubset CaseRanges = i.getCaseValueEx();
813 for (unsigned ri = 0, rie = CaseRanges.getNumItems(); ri < rie; ++ri) {
814 IntegersSubset::Range r = CaseRanges.getItem(ri);
815 Assert1(((const APInt&)r.getLow()).getBitWidth() == IntTy->getBitWidth(),
816 "Switch constants must all be same type as switch value!", &SI);
817 Assert1(((const APInt&)r.getHigh()).getBitWidth() == IntTy->getBitWidth(),
818 "Switch constants must all be same type as switch value!", &SI);
820 RangeSetMap[r] = i.getCaseIndex();
824 IntegersSubsetToBB::RangeIterator errItem;
825 if (!Mapping.verify(errItem)) {
826 unsigned CaseIndex = RangeSetMap[errItem->first];
827 SwitchInst::CaseIt i(&SI, CaseIndex);
828 Assert2(false, "Duplicate integer as switch case", &SI, i.getCaseValueEx());
831 visitTerminatorInst(SI);
834 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
835 Assert1(BI.getAddress()->getType()->isPointerTy(),
836 "Indirectbr operand must have pointer type!", &BI);
837 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
838 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
839 "Indirectbr destinations must all have pointer type!", &BI);
841 visitTerminatorInst(BI);
844 void Verifier::visitSelectInst(SelectInst &SI) {
845 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
847 "Invalid operands for select instruction!", &SI);
849 Assert1(SI.getTrueValue()->getType() == SI.getType(),
850 "Select values must have same type as select instruction!", &SI);
851 visitInstruction(SI);
854 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
855 /// a pass, if any exist, it's an error.
857 void Verifier::visitUserOp1(Instruction &I) {
858 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
861 void Verifier::visitTruncInst(TruncInst &I) {
862 // Get the source and destination types
863 Type *SrcTy = I.getOperand(0)->getType();
864 Type *DestTy = I.getType();
866 // Get the size of the types in bits, we'll need this later
867 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
868 unsigned DestBitSize = DestTy->getScalarSizeInBits();
870 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
871 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
872 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
873 "trunc source and destination must both be a vector or neither", &I);
874 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
879 void Verifier::visitZExtInst(ZExtInst &I) {
880 // Get the source and destination types
881 Type *SrcTy = I.getOperand(0)->getType();
882 Type *DestTy = I.getType();
884 // Get the size of the types in bits, we'll need this later
885 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
886 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
887 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
888 "zext source and destination must both be a vector or neither", &I);
889 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
890 unsigned DestBitSize = DestTy->getScalarSizeInBits();
892 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
897 void Verifier::visitSExtInst(SExtInst &I) {
898 // Get the source and destination types
899 Type *SrcTy = I.getOperand(0)->getType();
900 Type *DestTy = I.getType();
902 // Get the size of the types in bits, we'll need this later
903 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
904 unsigned DestBitSize = DestTy->getScalarSizeInBits();
906 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
907 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
908 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
909 "sext source and destination must both be a vector or neither", &I);
910 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
915 void Verifier::visitFPTruncInst(FPTruncInst &I) {
916 // Get the source and destination types
917 Type *SrcTy = I.getOperand(0)->getType();
918 Type *DestTy = I.getType();
919 // Get the size of the types in bits, we'll need this later
920 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
921 unsigned DestBitSize = DestTy->getScalarSizeInBits();
923 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
924 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
925 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
926 "fptrunc source and destination must both be a vector or neither",&I);
927 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
932 void Verifier::visitFPExtInst(FPExtInst &I) {
933 // Get the source and destination types
934 Type *SrcTy = I.getOperand(0)->getType();
935 Type *DestTy = I.getType();
937 // Get the size of the types in bits, we'll need this later
938 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
939 unsigned DestBitSize = DestTy->getScalarSizeInBits();
941 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
942 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
943 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
944 "fpext source and destination must both be a vector or neither", &I);
945 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
950 void Verifier::visitUIToFPInst(UIToFPInst &I) {
951 // Get the source and destination types
952 Type *SrcTy = I.getOperand(0)->getType();
953 Type *DestTy = I.getType();
955 bool SrcVec = SrcTy->isVectorTy();
956 bool DstVec = DestTy->isVectorTy();
958 Assert1(SrcVec == DstVec,
959 "UIToFP source and dest must both be vector or scalar", &I);
960 Assert1(SrcTy->isIntOrIntVectorTy(),
961 "UIToFP source must be integer or integer vector", &I);
962 Assert1(DestTy->isFPOrFPVectorTy(),
963 "UIToFP result must be FP or FP vector", &I);
965 if (SrcVec && DstVec)
966 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
967 cast<VectorType>(DestTy)->getNumElements(),
968 "UIToFP source and dest vector length mismatch", &I);
973 void Verifier::visitSIToFPInst(SIToFPInst &I) {
974 // Get the source and destination types
975 Type *SrcTy = I.getOperand(0)->getType();
976 Type *DestTy = I.getType();
978 bool SrcVec = SrcTy->isVectorTy();
979 bool DstVec = DestTy->isVectorTy();
981 Assert1(SrcVec == DstVec,
982 "SIToFP source and dest must both be vector or scalar", &I);
983 Assert1(SrcTy->isIntOrIntVectorTy(),
984 "SIToFP source must be integer or integer vector", &I);
985 Assert1(DestTy->isFPOrFPVectorTy(),
986 "SIToFP result must be FP or FP vector", &I);
988 if (SrcVec && DstVec)
989 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
990 cast<VectorType>(DestTy)->getNumElements(),
991 "SIToFP source and dest vector length mismatch", &I);
996 void Verifier::visitFPToUIInst(FPToUIInst &I) {
997 // Get the source and destination types
998 Type *SrcTy = I.getOperand(0)->getType();
999 Type *DestTy = I.getType();
1001 bool SrcVec = SrcTy->isVectorTy();
1002 bool DstVec = DestTy->isVectorTy();
1004 Assert1(SrcVec == DstVec,
1005 "FPToUI source and dest must both be vector or scalar", &I);
1006 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1008 Assert1(DestTy->isIntOrIntVectorTy(),
1009 "FPToUI result must be integer or integer vector", &I);
1011 if (SrcVec && DstVec)
1012 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1013 cast<VectorType>(DestTy)->getNumElements(),
1014 "FPToUI source and dest vector length mismatch", &I);
1016 visitInstruction(I);
1019 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1020 // Get the source and destination types
1021 Type *SrcTy = I.getOperand(0)->getType();
1022 Type *DestTy = I.getType();
1024 bool SrcVec = SrcTy->isVectorTy();
1025 bool DstVec = DestTy->isVectorTy();
1027 Assert1(SrcVec == DstVec,
1028 "FPToSI source and dest must both be vector or scalar", &I);
1029 Assert1(SrcTy->isFPOrFPVectorTy(),
1030 "FPToSI source must be FP or FP vector", &I);
1031 Assert1(DestTy->isIntOrIntVectorTy(),
1032 "FPToSI result must be integer or integer vector", &I);
1034 if (SrcVec && DstVec)
1035 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1036 cast<VectorType>(DestTy)->getNumElements(),
1037 "FPToSI source and dest vector length mismatch", &I);
1039 visitInstruction(I);
1042 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1043 // Get the source and destination types
1044 Type *SrcTy = I.getOperand(0)->getType();
1045 Type *DestTy = I.getType();
1047 Assert1(SrcTy->getScalarType()->isPointerTy(),
1048 "PtrToInt source must be pointer", &I);
1049 Assert1(DestTy->getScalarType()->isIntegerTy(),
1050 "PtrToInt result must be integral", &I);
1051 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1052 "PtrToInt type mismatch", &I);
1054 if (SrcTy->isVectorTy()) {
1055 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1056 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1057 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1058 "PtrToInt Vector width mismatch", &I);
1061 visitInstruction(I);
1064 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1065 // Get the source and destination types
1066 Type *SrcTy = I.getOperand(0)->getType();
1067 Type *DestTy = I.getType();
1069 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1070 "IntToPtr source must be an integral", &I);
1071 Assert1(DestTy->getScalarType()->isPointerTy(),
1072 "IntToPtr result must be a pointer",&I);
1073 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1074 "IntToPtr type mismatch", &I);
1075 if (SrcTy->isVectorTy()) {
1076 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1077 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1078 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1079 "IntToPtr Vector width mismatch", &I);
1081 visitInstruction(I);
1084 void Verifier::visitBitCastInst(BitCastInst &I) {
1085 // Get the source and destination types
1086 Type *SrcTy = I.getOperand(0)->getType();
1087 Type *DestTy = I.getType();
1089 // Get the size of the types in bits, we'll need this later
1090 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1091 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
1093 // BitCast implies a no-op cast of type only. No bits change.
1094 // However, you can't cast pointers to anything but pointers.
1095 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
1096 "Bitcast requires both operands to be pointer or neither", &I);
1097 Assert1(SrcBitSize == DestBitSize, "Bitcast requires types of same width",&I);
1099 // Disallow aggregates.
1100 Assert1(!SrcTy->isAggregateType(),
1101 "Bitcast operand must not be aggregate", &I);
1102 Assert1(!DestTy->isAggregateType(),
1103 "Bitcast type must not be aggregate", &I);
1105 visitInstruction(I);
1108 /// visitPHINode - Ensure that a PHI node is well formed.
1110 void Verifier::visitPHINode(PHINode &PN) {
1111 // Ensure that the PHI nodes are all grouped together at the top of the block.
1112 // This can be tested by checking whether the instruction before this is
1113 // either nonexistent (because this is begin()) or is a PHI node. If not,
1114 // then there is some other instruction before a PHI.
1115 Assert2(&PN == &PN.getParent()->front() ||
1116 isa<PHINode>(--BasicBlock::iterator(&PN)),
1117 "PHI nodes not grouped at top of basic block!",
1118 &PN, PN.getParent());
1120 // Check that all of the values of the PHI node have the same type as the
1121 // result, and that the incoming blocks are really basic blocks.
1122 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1123 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1124 "PHI node operands are not the same type as the result!", &PN);
1127 // All other PHI node constraints are checked in the visitBasicBlock method.
1129 visitInstruction(PN);
1132 void Verifier::VerifyCallSite(CallSite CS) {
1133 Instruction *I = CS.getInstruction();
1135 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1136 "Called function must be a pointer!", I);
1137 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1139 Assert1(FPTy->getElementType()->isFunctionTy(),
1140 "Called function is not pointer to function type!", I);
1141 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1143 // Verify that the correct number of arguments are being passed
1144 if (FTy->isVarArg())
1145 Assert1(CS.arg_size() >= FTy->getNumParams(),
1146 "Called function requires more parameters than were provided!",I);
1148 Assert1(CS.arg_size() == FTy->getNumParams(),
1149 "Incorrect number of arguments passed to called function!", I);
1151 // Verify that all arguments to the call match the function type.
1152 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1153 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1154 "Call parameter type does not match function signature!",
1155 CS.getArgument(i), FTy->getParamType(i), I);
1157 const AttrListPtr &Attrs = CS.getAttributes();
1159 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1160 "Attributes after last parameter!", I);
1162 // Verify call attributes.
1163 VerifyFunctionAttrs(FTy, Attrs, I);
1165 if (FTy->isVarArg())
1166 // Check attributes on the varargs part.
1167 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1168 Attributes Attr = Attrs.getParamAttributes(Idx);
1170 VerifyParameterAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
1172 Assert1(!Attr.hasIncompatibleWithVarArgsAttrs(),
1173 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1176 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1177 if (CS.getCalledFunction() == 0 ||
1178 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1179 for (FunctionType::param_iterator PI = FTy->param_begin(),
1180 PE = FTy->param_end(); PI != PE; ++PI)
1181 Assert1(!(*PI)->isMetadataTy(),
1182 "Function has metadata parameter but isn't an intrinsic", I);
1185 visitInstruction(*I);
1188 void Verifier::visitCallInst(CallInst &CI) {
1189 VerifyCallSite(&CI);
1191 if (Function *F = CI.getCalledFunction())
1192 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1193 visitIntrinsicFunctionCall(ID, CI);
1196 void Verifier::visitInvokeInst(InvokeInst &II) {
1197 VerifyCallSite(&II);
1199 // Verify that there is a landingpad instruction as the first non-PHI
1200 // instruction of the 'unwind' destination.
1201 Assert1(II.getUnwindDest()->isLandingPad(),
1202 "The unwind destination does not have a landingpad instruction!",&II);
1204 visitTerminatorInst(II);
1207 /// visitBinaryOperator - Check that both arguments to the binary operator are
1208 /// of the same type!
1210 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1211 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1212 "Both operands to a binary operator are not of the same type!", &B);
1214 switch (B.getOpcode()) {
1215 // Check that integer arithmetic operators are only used with
1216 // integral operands.
1217 case Instruction::Add:
1218 case Instruction::Sub:
1219 case Instruction::Mul:
1220 case Instruction::SDiv:
1221 case Instruction::UDiv:
1222 case Instruction::SRem:
1223 case Instruction::URem:
1224 Assert1(B.getType()->isIntOrIntVectorTy(),
1225 "Integer arithmetic operators only work with integral types!", &B);
1226 Assert1(B.getType() == B.getOperand(0)->getType(),
1227 "Integer arithmetic operators must have same type "
1228 "for operands and result!", &B);
1230 // Check that floating-point arithmetic operators are only used with
1231 // floating-point operands.
1232 case Instruction::FAdd:
1233 case Instruction::FSub:
1234 case Instruction::FMul:
1235 case Instruction::FDiv:
1236 case Instruction::FRem:
1237 Assert1(B.getType()->isFPOrFPVectorTy(),
1238 "Floating-point arithmetic operators only work with "
1239 "floating-point types!", &B);
1240 Assert1(B.getType() == B.getOperand(0)->getType(),
1241 "Floating-point arithmetic operators must have same type "
1242 "for operands and result!", &B);
1244 // Check that logical operators are only used with integral operands.
1245 case Instruction::And:
1246 case Instruction::Or:
1247 case Instruction::Xor:
1248 Assert1(B.getType()->isIntOrIntVectorTy(),
1249 "Logical operators only work with integral types!", &B);
1250 Assert1(B.getType() == B.getOperand(0)->getType(),
1251 "Logical operators must have same type for operands and result!",
1254 case Instruction::Shl:
1255 case Instruction::LShr:
1256 case Instruction::AShr:
1257 Assert1(B.getType()->isIntOrIntVectorTy(),
1258 "Shifts only work with integral types!", &B);
1259 Assert1(B.getType() == B.getOperand(0)->getType(),
1260 "Shift return type must be same as operands!", &B);
1263 llvm_unreachable("Unknown BinaryOperator opcode!");
1266 visitInstruction(B);
1269 void Verifier::visitICmpInst(ICmpInst &IC) {
1270 // Check that the operands are the same type
1271 Type *Op0Ty = IC.getOperand(0)->getType();
1272 Type *Op1Ty = IC.getOperand(1)->getType();
1273 Assert1(Op0Ty == Op1Ty,
1274 "Both operands to ICmp instruction are not of the same type!", &IC);
1275 // Check that the operands are the right type
1276 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1277 "Invalid operand types for ICmp instruction", &IC);
1278 // Check that the predicate is valid.
1279 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1280 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1281 "Invalid predicate in ICmp instruction!", &IC);
1283 visitInstruction(IC);
1286 void Verifier::visitFCmpInst(FCmpInst &FC) {
1287 // Check that the operands are the same type
1288 Type *Op0Ty = FC.getOperand(0)->getType();
1289 Type *Op1Ty = FC.getOperand(1)->getType();
1290 Assert1(Op0Ty == Op1Ty,
1291 "Both operands to FCmp instruction are not of the same type!", &FC);
1292 // Check that the operands are the right type
1293 Assert1(Op0Ty->isFPOrFPVectorTy(),
1294 "Invalid operand types for FCmp instruction", &FC);
1295 // Check that the predicate is valid.
1296 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1297 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1298 "Invalid predicate in FCmp instruction!", &FC);
1300 visitInstruction(FC);
1303 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1304 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1306 "Invalid extractelement operands!", &EI);
1307 visitInstruction(EI);
1310 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1311 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1314 "Invalid insertelement operands!", &IE);
1315 visitInstruction(IE);
1318 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1319 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1321 "Invalid shufflevector operands!", &SV);
1322 visitInstruction(SV);
1325 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1326 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1328 Assert1(isa<PointerType>(TargetTy),
1329 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1330 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1331 "GEP into unsized type!", &GEP);
1333 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1335 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1336 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1338 if (GEP.getPointerOperandType()->isPointerTy()) {
1339 // Validate GEPs with scalar indices.
1340 Assert2(GEP.getType()->isPointerTy() &&
1341 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1342 "GEP is not of right type for indices!", &GEP, ElTy);
1344 // Validate GEPs with a vector index.
1345 Assert1(Idxs.size() == 1, "Invalid number of indices!", &GEP);
1346 Value *Index = Idxs[0];
1347 Type *IndexTy = Index->getType();
1348 Assert1(IndexTy->isVectorTy(),
1349 "Vector GEP must have vector indices!", &GEP);
1350 Assert1(GEP.getType()->isVectorTy(),
1351 "Vector GEP must return a vector value", &GEP);
1352 Type *ElemPtr = cast<VectorType>(GEP.getType())->getElementType();
1353 Assert1(ElemPtr->isPointerTy(),
1354 "Vector GEP pointer operand is not a pointer!", &GEP);
1355 unsigned IndexWidth = cast<VectorType>(IndexTy)->getNumElements();
1356 unsigned GepWidth = cast<VectorType>(GEP.getType())->getNumElements();
1357 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1358 Assert1(ElTy == cast<PointerType>(ElemPtr)->getElementType(),
1359 "Vector GEP type does not match pointer type!", &GEP);
1361 visitInstruction(GEP);
1364 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1365 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1368 void Verifier::visitLoadInst(LoadInst &LI) {
1369 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1370 Assert1(PTy, "Load operand must be a pointer.", &LI);
1371 Type *ElTy = PTy->getElementType();
1372 Assert2(ElTy == LI.getType(),
1373 "Load result type does not match pointer operand type!", &LI, ElTy);
1374 if (LI.isAtomic()) {
1375 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1376 "Load cannot have Release ordering", &LI);
1377 Assert1(LI.getAlignment() != 0,
1378 "Atomic load must specify explicit alignment", &LI);
1379 if (!ElTy->isPointerTy()) {
1380 Assert2(ElTy->isIntegerTy(),
1381 "atomic store operand must have integer type!",
1383 unsigned Size = ElTy->getPrimitiveSizeInBits();
1384 Assert2(Size >= 8 && !(Size & (Size - 1)),
1385 "atomic store operand must be power-of-two byte-sized integer",
1389 Assert1(LI.getSynchScope() == CrossThread,
1390 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1393 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1394 unsigned NumOperands = Range->getNumOperands();
1395 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1396 unsigned NumRanges = NumOperands / 2;
1397 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1399 ConstantRange LastRange(1); // Dummy initial value
1400 for (unsigned i = 0; i < NumRanges; ++i) {
1401 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1402 Assert1(Low, "The lower limit must be an integer!", Low);
1403 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1404 Assert1(High, "The upper limit must be an integer!", High);
1405 Assert1(High->getType() == Low->getType() &&
1406 High->getType() == ElTy, "Range types must match load type!",
1409 APInt HighV = High->getValue();
1410 APInt LowV = Low->getValue();
1411 ConstantRange CurRange(LowV, HighV);
1412 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1413 "Range must not be empty!", Range);
1415 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1416 "Intervals are overlapping", Range);
1417 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1419 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1422 LastRange = ConstantRange(LowV, HighV);
1424 if (NumRanges > 2) {
1426 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1428 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1429 ConstantRange FirstRange(FirstLow, FirstHigh);
1430 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1431 "Intervals are overlapping", Range);
1432 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1439 visitInstruction(LI);
1442 void Verifier::visitStoreInst(StoreInst &SI) {
1443 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1444 Assert1(PTy, "Store operand must be a pointer.", &SI);
1445 Type *ElTy = PTy->getElementType();
1446 Assert2(ElTy == SI.getOperand(0)->getType(),
1447 "Stored value type does not match pointer operand type!",
1449 if (SI.isAtomic()) {
1450 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1451 "Store cannot have Acquire ordering", &SI);
1452 Assert1(SI.getAlignment() != 0,
1453 "Atomic store must specify explicit alignment", &SI);
1454 if (!ElTy->isPointerTy()) {
1455 Assert2(ElTy->isIntegerTy(),
1456 "atomic store operand must have integer type!",
1458 unsigned Size = ElTy->getPrimitiveSizeInBits();
1459 Assert2(Size >= 8 && !(Size & (Size - 1)),
1460 "atomic store operand must be power-of-two byte-sized integer",
1464 Assert1(SI.getSynchScope() == CrossThread,
1465 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1467 visitInstruction(SI);
1470 void Verifier::visitAllocaInst(AllocaInst &AI) {
1471 PointerType *PTy = AI.getType();
1472 Assert1(PTy->getAddressSpace() == 0,
1473 "Allocation instruction pointer not in the generic address space!",
1475 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1477 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
1478 "Alloca array size must have integer type", &AI);
1479 visitInstruction(AI);
1482 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
1483 Assert1(CXI.getOrdering() != NotAtomic,
1484 "cmpxchg instructions must be atomic.", &CXI);
1485 Assert1(CXI.getOrdering() != Unordered,
1486 "cmpxchg instructions cannot be unordered.", &CXI);
1487 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
1488 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
1489 Type *ElTy = PTy->getElementType();
1490 Assert2(ElTy->isIntegerTy(),
1491 "cmpxchg operand must have integer type!",
1493 unsigned Size = ElTy->getPrimitiveSizeInBits();
1494 Assert2(Size >= 8 && !(Size & (Size - 1)),
1495 "cmpxchg operand must be power-of-two byte-sized integer",
1497 Assert2(ElTy == CXI.getOperand(1)->getType(),
1498 "Expected value type does not match pointer operand type!",
1500 Assert2(ElTy == CXI.getOperand(2)->getType(),
1501 "Stored value type does not match pointer operand type!",
1503 visitInstruction(CXI);
1506 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
1507 Assert1(RMWI.getOrdering() != NotAtomic,
1508 "atomicrmw instructions must be atomic.", &RMWI);
1509 Assert1(RMWI.getOrdering() != Unordered,
1510 "atomicrmw instructions cannot be unordered.", &RMWI);
1511 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
1512 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
1513 Type *ElTy = PTy->getElementType();
1514 Assert2(ElTy->isIntegerTy(),
1515 "atomicrmw operand must have integer type!",
1517 unsigned Size = ElTy->getPrimitiveSizeInBits();
1518 Assert2(Size >= 8 && !(Size & (Size - 1)),
1519 "atomicrmw operand must be power-of-two byte-sized integer",
1521 Assert2(ElTy == RMWI.getOperand(1)->getType(),
1522 "Argument value type does not match pointer operand type!",
1524 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
1525 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
1526 "Invalid binary operation!", &RMWI);
1527 visitInstruction(RMWI);
1530 void Verifier::visitFenceInst(FenceInst &FI) {
1531 const AtomicOrdering Ordering = FI.getOrdering();
1532 Assert1(Ordering == Acquire || Ordering == Release ||
1533 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
1534 "fence instructions may only have "
1535 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
1536 visitInstruction(FI);
1539 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1540 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1541 EVI.getIndices()) ==
1543 "Invalid ExtractValueInst operands!", &EVI);
1545 visitInstruction(EVI);
1548 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1549 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1550 IVI.getIndices()) ==
1551 IVI.getOperand(1)->getType(),
1552 "Invalid InsertValueInst operands!", &IVI);
1554 visitInstruction(IVI);
1557 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
1558 BasicBlock *BB = LPI.getParent();
1560 // The landingpad instruction is ill-formed if it doesn't have any clauses and
1562 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
1563 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
1565 // The landingpad instruction defines its parent as a landing pad block. The
1566 // landing pad block may be branched to only by the unwind edge of an invoke.
1567 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
1568 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
1569 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
1570 "Block containing LandingPadInst must be jumped to "
1571 "only by the unwind edge of an invoke.", &LPI);
1574 // The landingpad instruction must be the first non-PHI instruction in the
1576 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
1577 "LandingPadInst not the first non-PHI instruction in the block.",
1580 // The personality functions for all landingpad instructions within the same
1581 // function should match.
1583 Assert1(LPI.getPersonalityFn() == PersonalityFn,
1584 "Personality function doesn't match others in function", &LPI);
1585 PersonalityFn = LPI.getPersonalityFn();
1587 // All operands must be constants.
1588 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
1590 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
1591 Value *Clause = LPI.getClause(i);
1592 Assert1(isa<Constant>(Clause), "Clause is not constant!", &LPI);
1593 if (LPI.isCatch(i)) {
1594 Assert1(isa<PointerType>(Clause->getType()),
1595 "Catch operand does not have pointer type!", &LPI);
1597 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
1598 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
1599 "Filter operand is not an array of constants!", &LPI);
1603 visitInstruction(LPI);
1606 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
1607 Instruction *Op = cast<Instruction>(I.getOperand(i));
1608 // If the we have an invalid invoke, don't try to compute the dominance.
1609 // We already reject it in the invoke specific checks and the dominance
1610 // computation doesn't handle multiple edges.
1611 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1612 if (II->getNormalDest() == II->getUnwindDest())
1616 const Use &U = I.getOperandUse(i);
1617 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, U),
1618 "Instruction does not dominate all uses!", Op, &I);
1621 /// verifyInstruction - Verify that an instruction is well formed.
1623 void Verifier::visitInstruction(Instruction &I) {
1624 BasicBlock *BB = I.getParent();
1625 Assert1(BB, "Instruction not embedded in basic block!", &I);
1627 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1628 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1630 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
1631 "Only PHI nodes may reference their own value!", &I);
1634 // Check that void typed values don't have names
1635 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1636 "Instruction has a name, but provides a void value!", &I);
1638 // Check that the return value of the instruction is either void or a legal
1640 Assert1(I.getType()->isVoidTy() ||
1641 I.getType()->isFirstClassType(),
1642 "Instruction returns a non-scalar type!", &I);
1644 // Check that the instruction doesn't produce metadata. Calls are already
1645 // checked against the callee type.
1646 Assert1(!I.getType()->isMetadataTy() ||
1647 isa<CallInst>(I) || isa<InvokeInst>(I),
1648 "Invalid use of metadata!", &I);
1650 // Check that all uses of the instruction, if they are instructions
1651 // themselves, actually have parent basic blocks. If the use is not an
1652 // instruction, it is an error!
1653 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1655 if (Instruction *Used = dyn_cast<Instruction>(*UI))
1656 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1657 " embedded in a basic block!", &I, Used);
1659 CheckFailed("Use of instruction is not an instruction!", *UI);
1664 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1665 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1667 // Check to make sure that only first-class-values are operands to
1669 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1670 Assert1(0, "Instruction operands must be first-class values!", &I);
1673 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1674 // Check to make sure that the "address of" an intrinsic function is never
1676 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
1677 "Cannot take the address of an intrinsic!", &I);
1678 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
1679 F->getIntrinsicID() == Intrinsic::donothing,
1680 "Cannot invoke an intrinsinc other than donothing", &I);
1681 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1683 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1684 Assert1(OpBB->getParent() == BB->getParent(),
1685 "Referring to a basic block in another function!", &I);
1686 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1687 Assert1(OpArg->getParent() == BB->getParent(),
1688 "Referring to an argument in another function!", &I);
1689 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1690 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1692 } else if (isa<Instruction>(I.getOperand(i))) {
1693 verifyDominatesUse(I, i);
1694 } else if (isa<InlineAsm>(I.getOperand(i))) {
1695 Assert1((i + 1 == e && isa<CallInst>(I)) ||
1696 (i + 3 == e && isa<InvokeInst>(I)),
1697 "Cannot take the address of an inline asm!", &I);
1701 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
1702 Assert1(I.getType()->isFPOrFPVectorTy(),
1703 "fpmath requires a floating point result!", &I);
1704 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
1705 Value *Op0 = MD->getOperand(0);
1706 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
1707 APFloat Accuracy = CFP0->getValueAPF();
1708 Assert1(Accuracy.isNormal() && !Accuracy.isNegative(),
1709 "fpmath accuracy not a positive number!", &I);
1711 Assert1(false, "invalid fpmath accuracy!", &I);
1715 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
1716 Assert1(!MD || isa<LoadInst>(I), "Ranges are only for loads!", &I);
1718 InstsInThisBlock.insert(&I);
1721 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
1722 /// intrinsic argument or return value) matches the type constraints specified
1723 /// by the .td file (e.g. an "any integer" argument really is an integer).
1725 /// This return true on error but does not print a message.
1726 bool Verifier::VerifyIntrinsicType(Type *Ty,
1727 ArrayRef<Intrinsic::IITDescriptor> &Infos,
1728 SmallVectorImpl<Type*> &ArgTys) {
1729 using namespace Intrinsic;
1731 // If we ran out of descriptors, there are too many arguments.
1732 if (Infos.empty()) return true;
1733 IITDescriptor D = Infos.front();
1734 Infos = Infos.slice(1);
1737 case IITDescriptor::Void: return !Ty->isVoidTy();
1738 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
1739 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
1740 case IITDescriptor::Float: return !Ty->isFloatTy();
1741 case IITDescriptor::Double: return !Ty->isDoubleTy();
1742 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
1743 case IITDescriptor::Vector: {
1744 VectorType *VT = dyn_cast<VectorType>(Ty);
1745 return VT == 0 || VT->getNumElements() != D.Vector_Width ||
1746 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
1748 case IITDescriptor::Pointer: {
1749 PointerType *PT = dyn_cast<PointerType>(Ty);
1750 return PT == 0 || PT->getAddressSpace() != D.Pointer_AddressSpace ||
1751 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
1754 case IITDescriptor::Struct: {
1755 StructType *ST = dyn_cast<StructType>(Ty);
1756 if (ST == 0 || ST->getNumElements() != D.Struct_NumElements)
1759 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
1760 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
1765 case IITDescriptor::Argument:
1766 // Two cases here - If this is the second occurrence of an argument, verify
1767 // that the later instance matches the previous instance.
1768 if (D.getArgumentNumber() < ArgTys.size())
1769 return Ty != ArgTys[D.getArgumentNumber()];
1771 // Otherwise, if this is the first instance of an argument, record it and
1772 // verify the "Any" kind.
1773 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
1774 ArgTys.push_back(Ty);
1776 switch (D.getArgumentKind()) {
1777 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
1778 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
1779 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
1780 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
1782 llvm_unreachable("all argument kinds not covered");
1784 case IITDescriptor::ExtendVecArgument:
1785 // This may only be used when referring to a previous vector argument.
1786 return D.getArgumentNumber() >= ArgTys.size() ||
1787 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
1788 VectorType::getExtendedElementVectorType(
1789 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
1791 case IITDescriptor::TruncVecArgument:
1792 // This may only be used when referring to a previous vector argument.
1793 return D.getArgumentNumber() >= ArgTys.size() ||
1794 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
1795 VectorType::getTruncatedElementVectorType(
1796 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
1798 llvm_unreachable("unhandled");
1801 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1803 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1804 Function *IF = CI.getCalledFunction();
1805 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1808 // Verify that the intrinsic prototype lines up with what the .td files
1810 FunctionType *IFTy = IF->getFunctionType();
1811 Assert1(!IFTy->isVarArg(), "Intrinsic prototypes are not varargs", IF);
1813 SmallVector<Intrinsic::IITDescriptor, 8> Table;
1814 getIntrinsicInfoTableEntries(ID, Table);
1815 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
1817 SmallVector<Type *, 4> ArgTys;
1818 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
1819 "Intrinsic has incorrect return type!", IF);
1820 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
1821 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
1822 "Intrinsic has incorrect argument type!", IF);
1823 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
1825 // Now that we have the intrinsic ID and the actual argument types (and we
1826 // know they are legal for the intrinsic!) get the intrinsic name through the
1827 // usual means. This allows us to verify the mangling of argument types into
1829 Assert1(Intrinsic::getName(ID, ArgTys) == IF->getName(),
1830 "Intrinsic name not mangled correctly for type arguments!", IF);
1832 // If the intrinsic takes MDNode arguments, verify that they are either global
1833 // or are local to *this* function.
1834 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
1835 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
1836 visitMDNode(*MD, CI.getParent()->getParent());
1841 case Intrinsic::ctlz: // llvm.ctlz
1842 case Intrinsic::cttz: // llvm.cttz
1843 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
1844 "is_zero_undef argument of bit counting intrinsics must be a "
1845 "constant int", &CI);
1847 case Intrinsic::dbg_declare: { // llvm.dbg.declare
1848 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
1849 "invalid llvm.dbg.declare intrinsic call 1", &CI);
1850 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
1851 Assert1(MD->getNumOperands() == 1,
1852 "invalid llvm.dbg.declare intrinsic call 2", &CI);
1854 case Intrinsic::memcpy:
1855 case Intrinsic::memmove:
1856 case Intrinsic::memset:
1857 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
1858 "alignment argument of memory intrinsics must be a constant int",
1860 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
1861 "isvolatile argument of memory intrinsics must be a constant int",
1864 case Intrinsic::gcroot:
1865 case Intrinsic::gcwrite:
1866 case Intrinsic::gcread:
1867 if (ID == Intrinsic::gcroot) {
1869 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
1870 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
1871 Assert1(isa<Constant>(CI.getArgOperand(1)),
1872 "llvm.gcroot parameter #2 must be a constant.", &CI);
1873 if (!AI->getType()->getElementType()->isPointerTy()) {
1874 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
1875 "llvm.gcroot parameter #1 must either be a pointer alloca, "
1876 "or argument #2 must be a non-null constant.", &CI);
1880 Assert1(CI.getParent()->getParent()->hasGC(),
1881 "Enclosing function does not use GC.", &CI);
1883 case Intrinsic::init_trampoline:
1884 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
1885 "llvm.init_trampoline parameter #2 must resolve to a function.",
1888 case Intrinsic::prefetch:
1889 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
1890 isa<ConstantInt>(CI.getArgOperand(2)) &&
1891 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
1892 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
1893 "invalid arguments to llvm.prefetch",
1896 case Intrinsic::stackprotector:
1897 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
1898 "llvm.stackprotector parameter #2 must resolve to an alloca.",
1901 case Intrinsic::lifetime_start:
1902 case Intrinsic::lifetime_end:
1903 case Intrinsic::invariant_start:
1904 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
1905 "size argument of memory use markers must be a constant integer",
1908 case Intrinsic::invariant_end:
1909 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
1910 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
1915 //===----------------------------------------------------------------------===//
1916 // Implement the public interfaces to this file...
1917 //===----------------------------------------------------------------------===//
1919 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1920 return new Verifier(action);
1924 /// verifyFunction - Check a function for errors, printing messages on stderr.
1925 /// Return true if the function is corrupt.
1927 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1928 Function &F = const_cast<Function&>(f);
1929 assert(!F.isDeclaration() && "Cannot verify external functions");
1931 FunctionPassManager FPM(F.getParent());
1932 Verifier *V = new Verifier(action);
1938 /// verifyModule - Check a module for errors, printing messages on stderr.
1939 /// Return true if the module is corrupt.
1941 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1942 std::string *ErrorInfo) {
1944 Verifier *V = new Verifier(action);
1946 PM.run(const_cast<Module&>(M));
1948 if (ErrorInfo && V->Broken)
1949 *ErrorInfo = V->MessagesStr.str();