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/IR/Verifier.h"
49 #include "llvm/ADT/STLExtras.h"
50 #include "llvm/ADT/SetVector.h"
51 #include "llvm/ADT/SmallPtrSet.h"
52 #include "llvm/ADT/SmallVector.h"
53 #include "llvm/ADT/StringExtras.h"
54 #include "llvm/DebugInfo.h"
55 #include "llvm/IR/CallingConv.h"
56 #include "llvm/IR/Constants.h"
57 #include "llvm/IR/DataLayout.h"
58 #include "llvm/IR/DerivedTypes.h"
59 #include "llvm/IR/Dominators.h"
60 #include "llvm/IR/InlineAsm.h"
61 #include "llvm/IR/IntrinsicInst.h"
62 #include "llvm/IR/LLVMContext.h"
63 #include "llvm/IR/Metadata.h"
64 #include "llvm/IR/Module.h"
65 #include "llvm/InstVisitor.h"
66 #include "llvm/Pass.h"
67 #include "llvm/PassManager.h"
68 #include "llvm/Support/CFG.h"
69 #include "llvm/Support/CallSite.h"
70 #include "llvm/Support/CommandLine.h"
71 #include "llvm/Support/ConstantRange.h"
72 #include "llvm/Support/Debug.h"
73 #include "llvm/Support/ErrorHandling.h"
74 #include "llvm/Support/raw_ostream.h"
79 static cl::opt<bool> DisableDebugInfoVerifier("disable-debug-info-verifier",
83 struct Verifier : public FunctionPass, public InstVisitor<Verifier> {
86 // What to do if verification fails.
87 VerifierFailureAction Action;
96 raw_string_ostream MessagesStr;
98 /// \brief When verifying a basic block, keep track of all of the
99 /// instructions we have seen so far.
101 /// This allows us to do efficient dominance checks for the case when an
102 /// instruction has an operand that is an instruction in the same block.
103 SmallPtrSet<Instruction *, 16> InstsInThisBlock;
105 /// \brief Keep track of the metadata nodes that have been checked already.
106 SmallPtrSet<MDNode *, 32> MDNodes;
108 /// \brief The personality function referenced by the LandingPadInsts.
109 /// All LandingPadInsts within the same function must use the same
110 /// personality function.
111 const Value *PersonalityFn;
113 /// \brief Finder keeps track of all debug info MDNodes in a Module.
114 DebugInfoFinder Finder;
117 : FunctionPass(ID), Action(AbortProcessAction), M(0), Context(0), DL(0),
118 Broken(false), MessagesStr(Messages), PersonalityFn(0) {
119 initializeVerifierPass(*PassRegistry::getPassRegistry());
121 explicit Verifier(VerifierFailureAction Action)
122 : FunctionPass(ID), Action(Action), M(0), Context(0), DL(0),
123 Broken(false), MessagesStr(Messages), PersonalityFn(0) {
124 initializeVerifierPass(*PassRegistry::getPassRegistry());
127 bool doInitialization(Module &M) {
129 Context = &M.getContext();
131 DL = getAnalysisIfAvailable<DataLayout>();
133 // We must abort before returning back to the pass manager, or else the
134 // pass manager may try to run other passes on the broken module.
135 return abortIfBroken();
138 bool runOnFunction(Function &F) {
141 // First ensure the function is well-enough formed to compute dominance
143 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
144 if (I->empty() || !I->back().isTerminator()) {
145 dbgs() << "Basic Block in function '" << F.getName()
146 << "' does not have terminator!\n";
147 I->printAsOperand(dbgs(), true);
153 return abortIfBroken();
155 // Now directly compute a dominance tree. We don't rely on the pass
156 // manager to provide this as it isolates us from a potentially
157 // out-of-date dominator tree and makes it significantly more complex to
158 // run this code outside of a pass manager.
163 Context = &F.getContext();
167 InstsInThisBlock.clear();
170 if (!DisableDebugInfoVerifier)
171 // Verify Debug Info.
174 // We must abort before returning back to the pass manager, or else the
175 // pass manager may try to run other passes on the broken module.
176 return abortIfBroken();
179 bool doFinalization(Module &M) {
180 // Scan through, checking all of the external function's linkage now...
181 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
182 visitGlobalValue(*I);
184 // Check to make sure function prototypes are okay.
185 if (I->isDeclaration())
189 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
191 visitGlobalVariable(*I);
193 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end(); I != E;
195 visitGlobalAlias(*I);
197 for (Module::named_metadata_iterator I = M.named_metadata_begin(),
198 E = M.named_metadata_end();
200 visitNamedMDNode(*I);
203 visitModuleIdents(M);
205 if (!DisableDebugInfoVerifier) {
207 Finder.processModule(M);
208 // Verify Debug Info.
212 // If the module is broken, abort at this time.
213 return abortIfBroken();
216 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
217 AU.setPreservesAll();
220 /// abortIfBroken - If the module is broken and we are supposed to abort on
221 /// this condition, do so.
223 bool abortIfBroken() {
226 MessagesStr << "Broken module found, ";
228 case AbortProcessAction:
229 MessagesStr << "compilation aborted!\n";
230 dbgs() << MessagesStr.str();
231 // Client should choose different reaction if abort is not desired
233 case PrintMessageAction:
234 MessagesStr << "verification continues.\n";
235 dbgs() << MessagesStr.str();
237 case ReturnStatusAction:
238 MessagesStr << "compilation terminated.\n";
241 llvm_unreachable("Invalid action");
244 // Verification methods...
245 void visitGlobalValue(GlobalValue &GV);
246 void visitGlobalVariable(GlobalVariable &GV);
247 void visitGlobalAlias(GlobalAlias &GA);
248 void visitNamedMDNode(NamedMDNode &NMD);
249 void visitMDNode(MDNode &MD, Function *F);
250 void visitModuleIdents(Module &M);
251 void visitModuleFlags(Module &M);
252 void visitModuleFlag(MDNode *Op, DenseMap<MDString *, MDNode *> &SeenIDs,
253 SmallVectorImpl<MDNode *> &Requirements);
254 void visitFunction(Function &F);
255 void visitBasicBlock(BasicBlock &BB);
256 using InstVisitor<Verifier>::visit;
258 void visit(Instruction &I);
260 void visitTruncInst(TruncInst &I);
261 void visitZExtInst(ZExtInst &I);
262 void visitSExtInst(SExtInst &I);
263 void visitFPTruncInst(FPTruncInst &I);
264 void visitFPExtInst(FPExtInst &I);
265 void visitFPToUIInst(FPToUIInst &I);
266 void visitFPToSIInst(FPToSIInst &I);
267 void visitUIToFPInst(UIToFPInst &I);
268 void visitSIToFPInst(SIToFPInst &I);
269 void visitIntToPtrInst(IntToPtrInst &I);
270 void visitPtrToIntInst(PtrToIntInst &I);
271 void visitBitCastInst(BitCastInst &I);
272 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
273 void visitPHINode(PHINode &PN);
274 void visitBinaryOperator(BinaryOperator &B);
275 void visitICmpInst(ICmpInst &IC);
276 void visitFCmpInst(FCmpInst &FC);
277 void visitExtractElementInst(ExtractElementInst &EI);
278 void visitInsertElementInst(InsertElementInst &EI);
279 void visitShuffleVectorInst(ShuffleVectorInst &EI);
280 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
281 void visitCallInst(CallInst &CI);
282 void visitInvokeInst(InvokeInst &II);
283 void visitGetElementPtrInst(GetElementPtrInst &GEP);
284 void visitLoadInst(LoadInst &LI);
285 void visitStoreInst(StoreInst &SI);
286 void verifyDominatesUse(Instruction &I, unsigned i);
287 void visitInstruction(Instruction &I);
288 void visitTerminatorInst(TerminatorInst &I);
289 void visitBranchInst(BranchInst &BI);
290 void visitReturnInst(ReturnInst &RI);
291 void visitSwitchInst(SwitchInst &SI);
292 void visitIndirectBrInst(IndirectBrInst &BI);
293 void visitSelectInst(SelectInst &SI);
294 void visitUserOp1(Instruction &I);
295 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
296 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
297 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
298 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
299 void visitFenceInst(FenceInst &FI);
300 void visitAllocaInst(AllocaInst &AI);
301 void visitExtractValueInst(ExtractValueInst &EVI);
302 void visitInsertValueInst(InsertValueInst &IVI);
303 void visitLandingPadInst(LandingPadInst &LPI);
305 void VerifyCallSite(CallSite CS);
306 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
307 unsigned ArgNo, std::string &Suffix);
308 bool VerifyIntrinsicType(Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
309 SmallVectorImpl<Type *> &ArgTys);
310 bool VerifyIntrinsicIsVarArg(bool isVarArg,
311 ArrayRef<Intrinsic::IITDescriptor> &Infos);
312 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
313 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
315 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
316 bool isReturnValue, const Value *V);
317 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
320 void VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy);
321 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
323 void verifyDebugInfo();
325 void WriteValue(const Value *V) {
328 if (isa<Instruction>(V)) {
329 MessagesStr << *V << '\n';
331 V->printAsOperand(MessagesStr, true, M);
336 void WriteType(Type *T) {
339 MessagesStr << ' ' << *T;
342 // CheckFailed - A check failed, so print out the condition and the message
343 // that failed. This provides a nice place to put a breakpoint if you want
344 // to see why something is not correct.
345 void CheckFailed(const Twine &Message, const Value *V1 = 0,
346 const Value *V2 = 0, const Value *V3 = 0,
347 const Value *V4 = 0) {
348 MessagesStr << Message.str() << "\n";
356 void CheckFailed(const Twine &Message, const Value *V1, Type *T2,
357 const Value *V3 = 0) {
358 MessagesStr << Message.str() << "\n";
365 void CheckFailed(const Twine &Message, Type *T1, Type *T2 = 0, Type *T3 = 0) {
366 MessagesStr << Message.str() << "\n";
373 } // End anonymous namespace
375 char Verifier::ID = 0;
376 INITIALIZE_PASS(Verifier, "verify", "Module Verifier", false, false)
378 // Assert - We know that cond should be true, if not print an error message.
379 #define Assert(C, M) \
380 do { if (!(C)) { CheckFailed(M); return; } } while (0)
381 #define Assert1(C, M, V1) \
382 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
383 #define Assert2(C, M, V1, V2) \
384 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
385 #define Assert3(C, M, V1, V2, V3) \
386 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
387 #define Assert4(C, M, V1, V2, V3, V4) \
388 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
390 void Verifier::visit(Instruction &I) {
391 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
392 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
393 InstVisitor<Verifier>::visit(I);
397 void Verifier::visitGlobalValue(GlobalValue &GV) {
398 Assert1(!GV.isDeclaration() ||
399 GV.isMaterializable() ||
400 GV.hasExternalLinkage() ||
401 GV.hasExternalWeakLinkage() ||
402 (isa<GlobalAlias>(GV) &&
403 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
404 "Global is external, but doesn't have external or weak linkage!",
407 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
408 "Only global variables can have appending linkage!", &GV);
410 if (GV.hasAppendingLinkage()) {
411 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
412 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
413 "Only global arrays can have appending linkage!", GVar);
417 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
418 if (GV.hasInitializer()) {
419 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
420 "Global variable initializer type does not match global "
421 "variable type!", &GV);
423 // If the global has common linkage, it must have a zero initializer and
424 // cannot be constant.
425 if (GV.hasCommonLinkage()) {
426 Assert1(GV.getInitializer()->isNullValue(),
427 "'common' global must have a zero initializer!", &GV);
428 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
432 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
433 "invalid linkage type for global declaration", &GV);
436 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
437 GV.getName() == "llvm.global_dtors")) {
438 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
439 "invalid linkage for intrinsic global variable", &GV);
440 // Don't worry about emitting an error for it not being an array,
441 // visitGlobalValue will complain on appending non-array.
442 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType())) {
443 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
444 PointerType *FuncPtrTy =
445 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
446 Assert1(STy && STy->getNumElements() == 2 &&
447 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
448 STy->getTypeAtIndex(1) == FuncPtrTy,
449 "wrong type for intrinsic global variable", &GV);
453 if (GV.hasName() && (GV.getName() == "llvm.used" ||
454 GV.getName() == "llvm.compiler.used")) {
455 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
456 "invalid linkage for intrinsic global variable", &GV);
457 Type *GVType = GV.getType()->getElementType();
458 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
459 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
460 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
461 if (GV.hasInitializer()) {
462 Constant *Init = GV.getInitializer();
463 ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
464 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
466 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
467 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
469 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
470 "invalid llvm.used member", V);
471 Assert1(V->hasName(), "members of llvm.used must be named", V);
477 Assert1(!GV.hasDLLImportStorageClass() ||
478 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
479 GV.hasAvailableExternallyLinkage(),
480 "Global is marked as dllimport, but not external", &GV);
482 if (!GV.hasInitializer()) {
483 visitGlobalValue(GV);
487 // Walk any aggregate initializers looking for bitcasts between address spaces
488 SmallPtrSet<const Value *, 4> Visited;
489 SmallVector<const Value *, 4> WorkStack;
490 WorkStack.push_back(cast<Value>(GV.getInitializer()));
492 while (!WorkStack.empty()) {
493 const Value *V = WorkStack.pop_back_val();
494 if (!Visited.insert(V))
497 if (const User *U = dyn_cast<User>(V)) {
498 for (unsigned I = 0, N = U->getNumOperands(); I != N; ++I)
499 WorkStack.push_back(U->getOperand(I));
502 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
503 VerifyConstantExprBitcastType(CE);
509 visitGlobalValue(GV);
512 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
513 Assert1(!GA.getName().empty(),
514 "Alias name cannot be empty!", &GA);
515 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
516 "Alias should have external or external weak linkage!", &GA);
517 Assert1(GA.getAliasee(),
518 "Aliasee cannot be NULL!", &GA);
519 Assert1(GA.getType() == GA.getAliasee()->getType(),
520 "Alias and aliasee types should match!", &GA);
521 Assert1(!GA.hasUnnamedAddr(), "Alias cannot have unnamed_addr!", &GA);
523 Constant *Aliasee = GA.getAliasee();
525 if (!isa<GlobalValue>(Aliasee)) {
526 ConstantExpr *CE = dyn_cast<ConstantExpr>(Aliasee);
528 (CE->getOpcode() == Instruction::BitCast ||
529 CE->getOpcode() == Instruction::AddrSpaceCast ||
530 CE->getOpcode() == Instruction::GetElementPtr) &&
531 isa<GlobalValue>(CE->getOperand(0)),
532 "Aliasee should be either GlobalValue, bitcast or "
533 "addrspacecast of GlobalValue",
536 if (CE->getOpcode() == Instruction::BitCast) {
537 unsigned SrcAS = CE->getOperand(0)->getType()->getPointerAddressSpace();
538 unsigned DstAS = CE->getType()->getPointerAddressSpace();
540 Assert1(SrcAS == DstAS,
541 "Alias bitcasts cannot be between different address spaces",
546 const GlobalValue* Resolved = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
548 "Aliasing chain should end with function or global variable", &GA);
550 visitGlobalValue(GA);
553 void Verifier::visitNamedMDNode(NamedMDNode &NMD) {
554 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
555 MDNode *MD = NMD.getOperand(i);
559 Assert1(!MD->isFunctionLocal(),
560 "Named metadata operand cannot be function local!", MD);
565 void Verifier::visitMDNode(MDNode &MD, Function *F) {
566 // Only visit each node once. Metadata can be mutually recursive, so this
567 // avoids infinite recursion here, as well as being an optimization.
568 if (!MDNodes.insert(&MD))
571 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
572 Value *Op = MD.getOperand(i);
575 if (isa<Constant>(Op) || isa<MDString>(Op))
577 if (MDNode *N = dyn_cast<MDNode>(Op)) {
578 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
579 "Global metadata operand cannot be function local!", &MD, N);
583 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
585 // If this was an instruction, bb, or argument, verify that it is in the
586 // function that we expect.
587 Function *ActualF = 0;
588 if (Instruction *I = dyn_cast<Instruction>(Op))
589 ActualF = I->getParent()->getParent();
590 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
591 ActualF = BB->getParent();
592 else if (Argument *A = dyn_cast<Argument>(Op))
593 ActualF = A->getParent();
594 assert(ActualF && "Unimplemented function local metadata case!");
596 Assert2(ActualF == F, "function-local metadata used in wrong function",
601 void Verifier::visitModuleIdents(Module &M) {
602 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
606 // llvm.ident takes a list of metadata entry. Each entry has only one string.
607 // Scan each llvm.ident entry and make sure that this requirement is met.
608 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
609 const MDNode *N = Idents->getOperand(i);
610 Assert1(N->getNumOperands() == 1,
611 "incorrect number of operands in llvm.ident metadata", N);
612 Assert1(isa<MDString>(N->getOperand(0)),
613 ("invalid value for llvm.ident metadata entry operand"
614 "(the operand should be a string)"),
619 void Verifier::visitModuleFlags(Module &M) {
620 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
623 // Scan each flag, and track the flags and requirements.
624 DenseMap<MDString*, MDNode*> SeenIDs;
625 SmallVector<MDNode*, 16> Requirements;
626 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
627 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
630 // Validate that the requirements in the module are valid.
631 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
632 MDNode *Requirement = Requirements[I];
633 MDString *Flag = cast<MDString>(Requirement->getOperand(0));
634 Value *ReqValue = Requirement->getOperand(1);
636 MDNode *Op = SeenIDs.lookup(Flag);
638 CheckFailed("invalid requirement on flag, flag is not present in module",
643 if (Op->getOperand(2) != ReqValue) {
644 CheckFailed(("invalid requirement on flag, "
645 "flag does not have the required value"),
652 void Verifier::visitModuleFlag(MDNode *Op, DenseMap<MDString*, MDNode*>&SeenIDs,
653 SmallVectorImpl<MDNode*> &Requirements) {
654 // Each module flag should have three arguments, the merge behavior (a
655 // constant int), the flag ID (an MDString), and the value.
656 Assert1(Op->getNumOperands() == 3,
657 "incorrect number of operands in module flag", Op);
658 ConstantInt *Behavior = dyn_cast<ConstantInt>(Op->getOperand(0));
659 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
661 "invalid behavior operand in module flag (expected constant integer)",
663 unsigned BehaviorValue = Behavior->getZExtValue();
665 "invalid ID operand in module flag (expected metadata string)",
668 // Sanity check the values for behaviors with additional requirements.
669 switch (BehaviorValue) {
672 "invalid behavior operand in module flag (unexpected constant)",
677 case Module::Warning:
678 case Module::Override:
679 // These behavior types accept any value.
682 case Module::Require: {
683 // The value should itself be an MDNode with two operands, a flag ID (an
684 // MDString), and a value.
685 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
686 Assert1(Value && Value->getNumOperands() == 2,
687 "invalid value for 'require' module flag (expected metadata pair)",
689 Assert1(isa<MDString>(Value->getOperand(0)),
690 ("invalid value for 'require' module flag "
691 "(first value operand should be a string)"),
692 Value->getOperand(0));
694 // Append it to the list of requirements, to check once all module flags are
696 Requirements.push_back(Value);
701 case Module::AppendUnique: {
702 // These behavior types require the operand be an MDNode.
703 Assert1(isa<MDNode>(Op->getOperand(2)),
704 "invalid value for 'append'-type module flag "
705 "(expected a metadata node)", Op->getOperand(2));
710 // Unless this is a "requires" flag, check the ID is unique.
711 if (BehaviorValue != Module::Require) {
712 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
714 "module flag identifiers must be unique (or of 'require' type)",
719 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
720 bool isFunction, const Value *V) {
722 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
723 if (Attrs.getSlotIndex(I) == Idx) {
728 assert(Slot != ~0U && "Attribute set inconsistency!");
730 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
732 if (I->isStringAttribute())
735 if (I->getKindAsEnum() == Attribute::NoReturn ||
736 I->getKindAsEnum() == Attribute::NoUnwind ||
737 I->getKindAsEnum() == Attribute::NoInline ||
738 I->getKindAsEnum() == Attribute::AlwaysInline ||
739 I->getKindAsEnum() == Attribute::OptimizeForSize ||
740 I->getKindAsEnum() == Attribute::StackProtect ||
741 I->getKindAsEnum() == Attribute::StackProtectReq ||
742 I->getKindAsEnum() == Attribute::StackProtectStrong ||
743 I->getKindAsEnum() == Attribute::NoRedZone ||
744 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
745 I->getKindAsEnum() == Attribute::Naked ||
746 I->getKindAsEnum() == Attribute::InlineHint ||
747 I->getKindAsEnum() == Attribute::StackAlignment ||
748 I->getKindAsEnum() == Attribute::UWTable ||
749 I->getKindAsEnum() == Attribute::NonLazyBind ||
750 I->getKindAsEnum() == Attribute::ReturnsTwice ||
751 I->getKindAsEnum() == Attribute::SanitizeAddress ||
752 I->getKindAsEnum() == Attribute::SanitizeThread ||
753 I->getKindAsEnum() == Attribute::SanitizeMemory ||
754 I->getKindAsEnum() == Attribute::MinSize ||
755 I->getKindAsEnum() == Attribute::NoDuplicate ||
756 I->getKindAsEnum() == Attribute::Builtin ||
757 I->getKindAsEnum() == Attribute::NoBuiltin ||
758 I->getKindAsEnum() == Attribute::Cold ||
759 I->getKindAsEnum() == Attribute::OptimizeNone) {
761 CheckFailed("Attribute '" + I->getAsString() +
762 "' only applies to functions!", V);
765 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
766 I->getKindAsEnum() == Attribute::ReadNone) {
768 CheckFailed("Attribute '" + I->getAsString() +
769 "' does not apply to function returns");
772 } else if (isFunction) {
773 CheckFailed("Attribute '" + I->getAsString() +
774 "' does not apply to functions!", V);
780 // VerifyParameterAttrs - Check the given attributes for an argument or return
781 // value of the specified type. The value V is printed in error messages.
782 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
783 bool isReturnValue, const Value *V) {
784 if (!Attrs.hasAttributes(Idx))
787 VerifyAttributeTypes(Attrs, Idx, false, V);
790 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
791 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
792 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
793 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
794 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
795 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
796 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
797 "'returned' do not apply to return values!", V);
799 // Check for mutually incompatible attributes. Only inreg is compatible with
801 unsigned AttrCount = 0;
802 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
803 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
804 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
805 Attrs.hasAttribute(Idx, Attribute::InReg);
806 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
807 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
808 "and 'sret' are incompatible!", V);
810 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
811 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
812 "'inalloca and readonly' are incompatible!", V);
814 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
815 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
816 "'sret and returned' are incompatible!", V);
818 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
819 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
820 "'zeroext and signext' are incompatible!", V);
822 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
823 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
824 "'readnone and readonly' are incompatible!", V);
826 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
827 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
828 "'noinline and alwaysinline' are incompatible!", V);
830 Assert1(!AttrBuilder(Attrs, Idx).
831 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
832 "Wrong types for attribute: " +
833 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
835 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
836 if (!PTy->getElementType()->isSized()) {
837 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
838 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
839 "Attributes 'byval' and 'inalloca' do not support unsized types!",
843 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
844 "Attribute 'byval' only applies to parameters with pointer type!",
849 // VerifyFunctionAttrs - Check parameter attributes against a function type.
850 // The value V is printed in error messages.
851 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
856 bool SawNest = false;
857 bool SawReturned = false;
859 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
860 unsigned Idx = Attrs.getSlotIndex(i);
864 Ty = FT->getReturnType();
865 else if (Idx-1 < FT->getNumParams())
866 Ty = FT->getParamType(Idx-1);
868 break; // VarArgs attributes, verified elsewhere.
870 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
875 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
876 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
880 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
881 Assert1(!SawReturned, "More than one parameter has attribute returned!",
883 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
884 "argument and return types for 'returned' attribute", V);
888 if (Attrs.hasAttribute(Idx, Attribute::StructRet))
889 Assert1(Idx == 1, "Attribute sret is not on first parameter!", V);
891 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
892 Assert1(Idx == FT->getNumParams(),
893 "inalloca isn't on the last parameter!", V);
897 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
900 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
902 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
903 Attribute::ReadNone) &&
904 Attrs.hasAttribute(AttributeSet::FunctionIndex,
905 Attribute::ReadOnly)),
906 "Attributes 'readnone and readonly' are incompatible!", V);
908 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
909 Attribute::NoInline) &&
910 Attrs.hasAttribute(AttributeSet::FunctionIndex,
911 Attribute::AlwaysInline)),
912 "Attributes 'noinline and alwaysinline' are incompatible!", V);
914 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
915 Attribute::OptimizeNone)) {
916 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
917 Attribute::NoInline),
918 "Attribute 'optnone' requires 'noinline'!", V);
920 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
921 Attribute::OptimizeForSize),
922 "Attributes 'optsize and optnone' are incompatible!", V);
924 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
926 "Attributes 'minsize and optnone' are incompatible!", V);
930 void Verifier::VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy) {
931 // Get the size of the types in bits, we'll need this later
932 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
933 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
935 // BitCast implies a no-op cast of type only. No bits change.
936 // However, you can't cast pointers to anything but pointers.
937 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
938 "Bitcast requires both operands to be pointer or neither", V);
939 Assert1(SrcBitSize == DestBitSize,
940 "Bitcast requires types of same width", V);
942 // Disallow aggregates.
943 Assert1(!SrcTy->isAggregateType(),
944 "Bitcast operand must not be aggregate", V);
945 Assert1(!DestTy->isAggregateType(),
946 "Bitcast type must not be aggregate", V);
948 // Without datalayout, assume all address spaces are the same size.
949 // Don't check if both types are not pointers.
950 // Skip casts between scalars and vectors.
952 !SrcTy->isPtrOrPtrVectorTy() ||
953 !DestTy->isPtrOrPtrVectorTy() ||
954 SrcTy->isVectorTy() != DestTy->isVectorTy()) {
958 unsigned SrcAS = SrcTy->getPointerAddressSpace();
959 unsigned DstAS = DestTy->getPointerAddressSpace();
961 Assert1(SrcAS == DstAS,
962 "Bitcasts between pointers of different address spaces is not legal."
963 "Use AddrSpaceCast instead.", V);
966 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
967 if (CE->getOpcode() == Instruction::BitCast) {
968 Type *SrcTy = CE->getOperand(0)->getType();
969 Type *DstTy = CE->getType();
970 VerifyBitcastType(CE, DstTy, SrcTy);
974 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
975 if (Attrs.getNumSlots() == 0)
978 unsigned LastSlot = Attrs.getNumSlots() - 1;
979 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
980 if (LastIndex <= Params
981 || (LastIndex == AttributeSet::FunctionIndex
982 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
988 // visitFunction - Verify that a function is ok.
990 void Verifier::visitFunction(Function &F) {
991 // Check function arguments.
992 FunctionType *FT = F.getFunctionType();
993 unsigned NumArgs = F.arg_size();
995 Assert1(Context == &F.getContext(),
996 "Function context does not match Module context!", &F);
998 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
999 Assert2(FT->getNumParams() == NumArgs,
1000 "# formal arguments must match # of arguments for function type!",
1002 Assert1(F.getReturnType()->isFirstClassType() ||
1003 F.getReturnType()->isVoidTy() ||
1004 F.getReturnType()->isStructTy(),
1005 "Functions cannot return aggregate values!", &F);
1007 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1008 "Invalid struct return type!", &F);
1010 AttributeSet Attrs = F.getAttributes();
1012 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1013 "Attribute after last parameter!", &F);
1015 // Check function attributes.
1016 VerifyFunctionAttrs(FT, Attrs, &F);
1018 // On function declarations/definitions, we do not support the builtin
1019 // attribute. We do not check this in VerifyFunctionAttrs since that is
1020 // checking for Attributes that can/can not ever be on functions.
1021 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1022 Attribute::Builtin),
1023 "Attribute 'builtin' can only be applied to a callsite.", &F);
1025 // Check that this function meets the restrictions on this calling convention.
1026 switch (F.getCallingConv()) {
1029 case CallingConv::C:
1031 case CallingConv::Fast:
1032 case CallingConv::Cold:
1033 case CallingConv::X86_FastCall:
1034 case CallingConv::X86_ThisCall:
1035 case CallingConv::Intel_OCL_BI:
1036 case CallingConv::PTX_Kernel:
1037 case CallingConv::PTX_Device:
1038 Assert1(!F.isVarArg(),
1039 "Varargs functions must have C calling conventions!", &F);
1043 bool isLLVMdotName = F.getName().size() >= 5 &&
1044 F.getName().substr(0, 5) == "llvm.";
1046 // Check that the argument values match the function type for this function...
1048 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
1050 Assert2(I->getType() == FT->getParamType(i),
1051 "Argument value does not match function argument type!",
1052 I, FT->getParamType(i));
1053 Assert1(I->getType()->isFirstClassType(),
1054 "Function arguments must have first-class types!", I);
1056 Assert2(!I->getType()->isMetadataTy(),
1057 "Function takes metadata but isn't an intrinsic", I, &F);
1060 if (F.isMaterializable()) {
1061 // Function has a body somewhere we can't see.
1062 } else if (F.isDeclaration()) {
1063 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1064 "invalid linkage type for function declaration", &F);
1066 // Verify that this function (which has a body) is not named "llvm.*". It
1067 // is not legal to define intrinsics.
1068 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1070 // Check the entry node
1071 BasicBlock *Entry = &F.getEntryBlock();
1072 Assert1(pred_begin(Entry) == pred_end(Entry),
1073 "Entry block to function must not have predecessors!", Entry);
1075 // The address of the entry block cannot be taken, unless it is dead.
1076 if (Entry->hasAddressTaken()) {
1077 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
1078 "blockaddress may not be used with the entry block!", Entry);
1082 // If this function is actually an intrinsic, verify that it is only used in
1083 // direct call/invokes, never having its "address taken".
1084 if (F.getIntrinsicID()) {
1086 if (F.hasAddressTaken(&U))
1087 Assert1(0, "Invalid user of intrinsic instruction!", U);
1090 Assert1(!F.hasDLLImportStorageClass() ||
1091 (F.isDeclaration() && F.hasExternalLinkage()) ||
1092 F.hasAvailableExternallyLinkage(),
1093 "Function is marked as dllimport, but not external.", &F);
1096 // verifyBasicBlock - Verify that a basic block is well formed...
1098 void Verifier::visitBasicBlock(BasicBlock &BB) {
1099 InstsInThisBlock.clear();
1101 // Ensure that basic blocks have terminators!
1102 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1104 // Check constraints that this basic block imposes on all of the PHI nodes in
1106 if (isa<PHINode>(BB.front())) {
1107 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1108 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1109 std::sort(Preds.begin(), Preds.end());
1111 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1112 // Ensure that PHI nodes have at least one entry!
1113 Assert1(PN->getNumIncomingValues() != 0,
1114 "PHI nodes must have at least one entry. If the block is dead, "
1115 "the PHI should be removed!", PN);
1116 Assert1(PN->getNumIncomingValues() == Preds.size(),
1117 "PHINode should have one entry for each predecessor of its "
1118 "parent basic block!", PN);
1120 // Get and sort all incoming values in the PHI node...
1122 Values.reserve(PN->getNumIncomingValues());
1123 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1124 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1125 PN->getIncomingValue(i)));
1126 std::sort(Values.begin(), Values.end());
1128 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1129 // Check to make sure that if there is more than one entry for a
1130 // particular basic block in this PHI node, that the incoming values are
1133 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1134 Values[i].second == Values[i-1].second,
1135 "PHI node has multiple entries for the same basic block with "
1136 "different incoming values!", PN, Values[i].first,
1137 Values[i].second, Values[i-1].second);
1139 // Check to make sure that the predecessors and PHI node entries are
1141 Assert3(Values[i].first == Preds[i],
1142 "PHI node entries do not match predecessors!", PN,
1143 Values[i].first, Preds[i]);
1149 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1150 // Ensure that terminators only exist at the end of the basic block.
1151 Assert1(&I == I.getParent()->getTerminator(),
1152 "Terminator found in the middle of a basic block!", I.getParent());
1153 visitInstruction(I);
1156 void Verifier::visitBranchInst(BranchInst &BI) {
1157 if (BI.isConditional()) {
1158 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1159 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1161 visitTerminatorInst(BI);
1164 void Verifier::visitReturnInst(ReturnInst &RI) {
1165 Function *F = RI.getParent()->getParent();
1166 unsigned N = RI.getNumOperands();
1167 if (F->getReturnType()->isVoidTy())
1169 "Found return instr that returns non-void in Function of void "
1170 "return type!", &RI, F->getReturnType());
1172 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1173 "Function return type does not match operand "
1174 "type of return inst!", &RI, F->getReturnType());
1176 // Check to make sure that the return value has necessary properties for
1178 visitTerminatorInst(RI);
1181 void Verifier::visitSwitchInst(SwitchInst &SI) {
1182 // Check to make sure that all of the constants in the switch instruction
1183 // have the same type as the switched-on value.
1184 Type *SwitchTy = SI.getCondition()->getType();
1185 SmallPtrSet<ConstantInt*, 32> Constants;
1186 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1187 Assert1(i.getCaseValue()->getType() == SwitchTy,
1188 "Switch constants must all be same type as switch value!", &SI);
1189 Assert2(Constants.insert(i.getCaseValue()),
1190 "Duplicate integer as switch case", &SI, i.getCaseValue());
1193 visitTerminatorInst(SI);
1196 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1197 Assert1(BI.getAddress()->getType()->isPointerTy(),
1198 "Indirectbr operand must have pointer type!", &BI);
1199 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1200 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1201 "Indirectbr destinations must all have pointer type!", &BI);
1203 visitTerminatorInst(BI);
1206 void Verifier::visitSelectInst(SelectInst &SI) {
1207 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1209 "Invalid operands for select instruction!", &SI);
1211 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1212 "Select values must have same type as select instruction!", &SI);
1213 visitInstruction(SI);
1216 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1217 /// a pass, if any exist, it's an error.
1219 void Verifier::visitUserOp1(Instruction &I) {
1220 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1223 void Verifier::visitTruncInst(TruncInst &I) {
1224 // Get the source and destination types
1225 Type *SrcTy = I.getOperand(0)->getType();
1226 Type *DestTy = I.getType();
1228 // Get the size of the types in bits, we'll need this later
1229 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1230 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1232 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1233 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1234 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1235 "trunc source and destination must both be a vector or neither", &I);
1236 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1238 visitInstruction(I);
1241 void Verifier::visitZExtInst(ZExtInst &I) {
1242 // Get the source and destination types
1243 Type *SrcTy = I.getOperand(0)->getType();
1244 Type *DestTy = I.getType();
1246 // Get the size of the types in bits, we'll need this later
1247 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1248 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1249 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1250 "zext source and destination must both be a vector or neither", &I);
1251 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1252 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1254 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1256 visitInstruction(I);
1259 void Verifier::visitSExtInst(SExtInst &I) {
1260 // Get the source and destination types
1261 Type *SrcTy = I.getOperand(0)->getType();
1262 Type *DestTy = I.getType();
1264 // Get the size of the types in bits, we'll need this later
1265 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1266 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1268 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1269 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1270 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1271 "sext source and destination must both be a vector or neither", &I);
1272 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1274 visitInstruction(I);
1277 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1278 // Get the source and destination types
1279 Type *SrcTy = I.getOperand(0)->getType();
1280 Type *DestTy = I.getType();
1281 // Get the size of the types in bits, we'll need this later
1282 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1283 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1285 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1286 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1287 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1288 "fptrunc source and destination must both be a vector or neither",&I);
1289 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1291 visitInstruction(I);
1294 void Verifier::visitFPExtInst(FPExtInst &I) {
1295 // Get the source and destination types
1296 Type *SrcTy = I.getOperand(0)->getType();
1297 Type *DestTy = I.getType();
1299 // Get the size of the types in bits, we'll need this later
1300 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1301 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1303 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1304 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1305 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1306 "fpext source and destination must both be a vector or neither", &I);
1307 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1309 visitInstruction(I);
1312 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1313 // Get the source and destination types
1314 Type *SrcTy = I.getOperand(0)->getType();
1315 Type *DestTy = I.getType();
1317 bool SrcVec = SrcTy->isVectorTy();
1318 bool DstVec = DestTy->isVectorTy();
1320 Assert1(SrcVec == DstVec,
1321 "UIToFP source and dest must both be vector or scalar", &I);
1322 Assert1(SrcTy->isIntOrIntVectorTy(),
1323 "UIToFP source must be integer or integer vector", &I);
1324 Assert1(DestTy->isFPOrFPVectorTy(),
1325 "UIToFP result must be FP or FP vector", &I);
1327 if (SrcVec && DstVec)
1328 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1329 cast<VectorType>(DestTy)->getNumElements(),
1330 "UIToFP source and dest vector length mismatch", &I);
1332 visitInstruction(I);
1335 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1336 // Get the source and destination types
1337 Type *SrcTy = I.getOperand(0)->getType();
1338 Type *DestTy = I.getType();
1340 bool SrcVec = SrcTy->isVectorTy();
1341 bool DstVec = DestTy->isVectorTy();
1343 Assert1(SrcVec == DstVec,
1344 "SIToFP source and dest must both be vector or scalar", &I);
1345 Assert1(SrcTy->isIntOrIntVectorTy(),
1346 "SIToFP source must be integer or integer vector", &I);
1347 Assert1(DestTy->isFPOrFPVectorTy(),
1348 "SIToFP result must be FP or FP vector", &I);
1350 if (SrcVec && DstVec)
1351 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1352 cast<VectorType>(DestTy)->getNumElements(),
1353 "SIToFP source and dest vector length mismatch", &I);
1355 visitInstruction(I);
1358 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1359 // Get the source and destination types
1360 Type *SrcTy = I.getOperand(0)->getType();
1361 Type *DestTy = I.getType();
1363 bool SrcVec = SrcTy->isVectorTy();
1364 bool DstVec = DestTy->isVectorTy();
1366 Assert1(SrcVec == DstVec,
1367 "FPToUI source and dest must both be vector or scalar", &I);
1368 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1370 Assert1(DestTy->isIntOrIntVectorTy(),
1371 "FPToUI result must be integer or integer vector", &I);
1373 if (SrcVec && DstVec)
1374 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1375 cast<VectorType>(DestTy)->getNumElements(),
1376 "FPToUI source and dest vector length mismatch", &I);
1378 visitInstruction(I);
1381 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1382 // Get the source and destination types
1383 Type *SrcTy = I.getOperand(0)->getType();
1384 Type *DestTy = I.getType();
1386 bool SrcVec = SrcTy->isVectorTy();
1387 bool DstVec = DestTy->isVectorTy();
1389 Assert1(SrcVec == DstVec,
1390 "FPToSI source and dest must both be vector or scalar", &I);
1391 Assert1(SrcTy->isFPOrFPVectorTy(),
1392 "FPToSI source must be FP or FP vector", &I);
1393 Assert1(DestTy->isIntOrIntVectorTy(),
1394 "FPToSI result must be integer or integer vector", &I);
1396 if (SrcVec && DstVec)
1397 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1398 cast<VectorType>(DestTy)->getNumElements(),
1399 "FPToSI source and dest vector length mismatch", &I);
1401 visitInstruction(I);
1404 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1405 // Get the source and destination types
1406 Type *SrcTy = I.getOperand(0)->getType();
1407 Type *DestTy = I.getType();
1409 Assert1(SrcTy->getScalarType()->isPointerTy(),
1410 "PtrToInt source must be pointer", &I);
1411 Assert1(DestTy->getScalarType()->isIntegerTy(),
1412 "PtrToInt result must be integral", &I);
1413 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1414 "PtrToInt type mismatch", &I);
1416 if (SrcTy->isVectorTy()) {
1417 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1418 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1419 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1420 "PtrToInt Vector width mismatch", &I);
1423 visitInstruction(I);
1426 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1427 // Get the source and destination types
1428 Type *SrcTy = I.getOperand(0)->getType();
1429 Type *DestTy = I.getType();
1431 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1432 "IntToPtr source must be an integral", &I);
1433 Assert1(DestTy->getScalarType()->isPointerTy(),
1434 "IntToPtr result must be a pointer",&I);
1435 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1436 "IntToPtr type mismatch", &I);
1437 if (SrcTy->isVectorTy()) {
1438 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1439 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1440 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1441 "IntToPtr Vector width mismatch", &I);
1443 visitInstruction(I);
1446 void Verifier::visitBitCastInst(BitCastInst &I) {
1447 Type *SrcTy = I.getOperand(0)->getType();
1448 Type *DestTy = I.getType();
1449 VerifyBitcastType(&I, DestTy, SrcTy);
1450 visitInstruction(I);
1453 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1454 Type *SrcTy = I.getOperand(0)->getType();
1455 Type *DestTy = I.getType();
1457 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1458 "AddrSpaceCast source must be a pointer", &I);
1459 Assert1(DestTy->isPtrOrPtrVectorTy(),
1460 "AddrSpaceCast result must be a pointer", &I);
1461 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1462 "AddrSpaceCast must be between different address spaces", &I);
1463 if (SrcTy->isVectorTy())
1464 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1465 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1466 visitInstruction(I);
1469 /// visitPHINode - Ensure that a PHI node is well formed.
1471 void Verifier::visitPHINode(PHINode &PN) {
1472 // Ensure that the PHI nodes are all grouped together at the top of the block.
1473 // This can be tested by checking whether the instruction before this is
1474 // either nonexistent (because this is begin()) or is a PHI node. If not,
1475 // then there is some other instruction before a PHI.
1476 Assert2(&PN == &PN.getParent()->front() ||
1477 isa<PHINode>(--BasicBlock::iterator(&PN)),
1478 "PHI nodes not grouped at top of basic block!",
1479 &PN, PN.getParent());
1481 // Check that all of the values of the PHI node have the same type as the
1482 // result, and that the incoming blocks are really basic blocks.
1483 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1484 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1485 "PHI node operands are not the same type as the result!", &PN);
1488 // All other PHI node constraints are checked in the visitBasicBlock method.
1490 visitInstruction(PN);
1493 void Verifier::VerifyCallSite(CallSite CS) {
1494 Instruction *I = CS.getInstruction();
1496 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1497 "Called function must be a pointer!", I);
1498 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1500 Assert1(FPTy->getElementType()->isFunctionTy(),
1501 "Called function is not pointer to function type!", I);
1502 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1504 // Verify that the correct number of arguments are being passed
1505 if (FTy->isVarArg())
1506 Assert1(CS.arg_size() >= FTy->getNumParams(),
1507 "Called function requires more parameters than were provided!",I);
1509 Assert1(CS.arg_size() == FTy->getNumParams(),
1510 "Incorrect number of arguments passed to called function!", I);
1512 // Verify that all arguments to the call match the function type.
1513 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1514 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1515 "Call parameter type does not match function signature!",
1516 CS.getArgument(i), FTy->getParamType(i), I);
1518 AttributeSet Attrs = CS.getAttributes();
1520 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1521 "Attribute after last parameter!", I);
1523 // Verify call attributes.
1524 VerifyFunctionAttrs(FTy, Attrs, I);
1526 if (FTy->isVarArg()) {
1527 // FIXME? is 'nest' even legal here?
1528 bool SawNest = false;
1529 bool SawReturned = false;
1531 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1532 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1534 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1538 // Check attributes on the varargs part.
1539 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1540 Type *Ty = CS.getArgument(Idx-1)->getType();
1541 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1543 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1544 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1548 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1549 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1551 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1552 "Incompatible argument and return types for 'returned' "
1557 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1558 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1560 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1561 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1566 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1567 if (CS.getCalledFunction() == 0 ||
1568 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1569 for (FunctionType::param_iterator PI = FTy->param_begin(),
1570 PE = FTy->param_end(); PI != PE; ++PI)
1571 Assert1(!(*PI)->isMetadataTy(),
1572 "Function has metadata parameter but isn't an intrinsic", I);
1575 visitInstruction(*I);
1578 void Verifier::visitCallInst(CallInst &CI) {
1579 VerifyCallSite(&CI);
1581 if (Function *F = CI.getCalledFunction())
1582 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1583 visitIntrinsicFunctionCall(ID, CI);
1586 void Verifier::visitInvokeInst(InvokeInst &II) {
1587 VerifyCallSite(&II);
1589 // Verify that there is a landingpad instruction as the first non-PHI
1590 // instruction of the 'unwind' destination.
1591 Assert1(II.getUnwindDest()->isLandingPad(),
1592 "The unwind destination does not have a landingpad instruction!",&II);
1594 visitTerminatorInst(II);
1597 /// visitBinaryOperator - Check that both arguments to the binary operator are
1598 /// of the same type!
1600 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1601 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1602 "Both operands to a binary operator are not of the same type!", &B);
1604 switch (B.getOpcode()) {
1605 // Check that integer arithmetic operators are only used with
1606 // integral operands.
1607 case Instruction::Add:
1608 case Instruction::Sub:
1609 case Instruction::Mul:
1610 case Instruction::SDiv:
1611 case Instruction::UDiv:
1612 case Instruction::SRem:
1613 case Instruction::URem:
1614 Assert1(B.getType()->isIntOrIntVectorTy(),
1615 "Integer arithmetic operators only work with integral types!", &B);
1616 Assert1(B.getType() == B.getOperand(0)->getType(),
1617 "Integer arithmetic operators must have same type "
1618 "for operands and result!", &B);
1620 // Check that floating-point arithmetic operators are only used with
1621 // floating-point operands.
1622 case Instruction::FAdd:
1623 case Instruction::FSub:
1624 case Instruction::FMul:
1625 case Instruction::FDiv:
1626 case Instruction::FRem:
1627 Assert1(B.getType()->isFPOrFPVectorTy(),
1628 "Floating-point arithmetic operators only work with "
1629 "floating-point types!", &B);
1630 Assert1(B.getType() == B.getOperand(0)->getType(),
1631 "Floating-point arithmetic operators must have same type "
1632 "for operands and result!", &B);
1634 // Check that logical operators are only used with integral operands.
1635 case Instruction::And:
1636 case Instruction::Or:
1637 case Instruction::Xor:
1638 Assert1(B.getType()->isIntOrIntVectorTy(),
1639 "Logical operators only work with integral types!", &B);
1640 Assert1(B.getType() == B.getOperand(0)->getType(),
1641 "Logical operators must have same type for operands and result!",
1644 case Instruction::Shl:
1645 case Instruction::LShr:
1646 case Instruction::AShr:
1647 Assert1(B.getType()->isIntOrIntVectorTy(),
1648 "Shifts only work with integral types!", &B);
1649 Assert1(B.getType() == B.getOperand(0)->getType(),
1650 "Shift return type must be same as operands!", &B);
1653 llvm_unreachable("Unknown BinaryOperator opcode!");
1656 visitInstruction(B);
1659 void Verifier::visitICmpInst(ICmpInst &IC) {
1660 // Check that the operands are the same type
1661 Type *Op0Ty = IC.getOperand(0)->getType();
1662 Type *Op1Ty = IC.getOperand(1)->getType();
1663 Assert1(Op0Ty == Op1Ty,
1664 "Both operands to ICmp instruction are not of the same type!", &IC);
1665 // Check that the operands are the right type
1666 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1667 "Invalid operand types for ICmp instruction", &IC);
1668 // Check that the predicate is valid.
1669 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1670 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1671 "Invalid predicate in ICmp instruction!", &IC);
1673 visitInstruction(IC);
1676 void Verifier::visitFCmpInst(FCmpInst &FC) {
1677 // Check that the operands are the same type
1678 Type *Op0Ty = FC.getOperand(0)->getType();
1679 Type *Op1Ty = FC.getOperand(1)->getType();
1680 Assert1(Op0Ty == Op1Ty,
1681 "Both operands to FCmp instruction are not of the same type!", &FC);
1682 // Check that the operands are the right type
1683 Assert1(Op0Ty->isFPOrFPVectorTy(),
1684 "Invalid operand types for FCmp instruction", &FC);
1685 // Check that the predicate is valid.
1686 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1687 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1688 "Invalid predicate in FCmp instruction!", &FC);
1690 visitInstruction(FC);
1693 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1694 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1696 "Invalid extractelement operands!", &EI);
1697 visitInstruction(EI);
1700 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1701 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1704 "Invalid insertelement operands!", &IE);
1705 visitInstruction(IE);
1708 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1709 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1711 "Invalid shufflevector operands!", &SV);
1712 visitInstruction(SV);
1715 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1716 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1718 Assert1(isa<PointerType>(TargetTy),
1719 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1720 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1721 "GEP into unsized type!", &GEP);
1722 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1723 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1726 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1728 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1729 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1731 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1732 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1733 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1735 if (GEP.getPointerOperandType()->isVectorTy()) {
1736 // Additional checks for vector GEPs.
1737 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1738 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1739 "Vector GEP result width doesn't match operand's", &GEP);
1740 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1741 Type *IndexTy = Idxs[i]->getType();
1742 Assert1(IndexTy->isVectorTy(),
1743 "Vector GEP must have vector indices!", &GEP);
1744 unsigned IndexWidth = IndexTy->getVectorNumElements();
1745 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1748 visitInstruction(GEP);
1751 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1752 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1755 void Verifier::visitLoadInst(LoadInst &LI) {
1756 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1757 Assert1(PTy, "Load operand must be a pointer.", &LI);
1758 Type *ElTy = PTy->getElementType();
1759 Assert2(ElTy == LI.getType(),
1760 "Load result type does not match pointer operand type!", &LI, ElTy);
1761 if (LI.isAtomic()) {
1762 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1763 "Load cannot have Release ordering", &LI);
1764 Assert1(LI.getAlignment() != 0,
1765 "Atomic load must specify explicit alignment", &LI);
1766 if (!ElTy->isPointerTy()) {
1767 Assert2(ElTy->isIntegerTy(),
1768 "atomic store operand must have integer type!",
1770 unsigned Size = ElTy->getPrimitiveSizeInBits();
1771 Assert2(Size >= 8 && !(Size & (Size - 1)),
1772 "atomic store operand must be power-of-two byte-sized integer",
1776 Assert1(LI.getSynchScope() == CrossThread,
1777 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1780 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1781 unsigned NumOperands = Range->getNumOperands();
1782 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1783 unsigned NumRanges = NumOperands / 2;
1784 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1786 ConstantRange LastRange(1); // Dummy initial value
1787 for (unsigned i = 0; i < NumRanges; ++i) {
1788 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1789 Assert1(Low, "The lower limit must be an integer!", Low);
1790 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1791 Assert1(High, "The upper limit must be an integer!", High);
1792 Assert1(High->getType() == Low->getType() &&
1793 High->getType() == ElTy, "Range types must match load type!",
1796 APInt HighV = High->getValue();
1797 APInt LowV = Low->getValue();
1798 ConstantRange CurRange(LowV, HighV);
1799 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1800 "Range must not be empty!", Range);
1802 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1803 "Intervals are overlapping", Range);
1804 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1806 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1809 LastRange = ConstantRange(LowV, HighV);
1811 if (NumRanges > 2) {
1813 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1815 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1816 ConstantRange FirstRange(FirstLow, FirstHigh);
1817 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1818 "Intervals are overlapping", Range);
1819 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1826 visitInstruction(LI);
1829 void Verifier::visitStoreInst(StoreInst &SI) {
1830 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1831 Assert1(PTy, "Store operand must be a pointer.", &SI);
1832 Type *ElTy = PTy->getElementType();
1833 Assert2(ElTy == SI.getOperand(0)->getType(),
1834 "Stored value type does not match pointer operand type!",
1836 if (SI.isAtomic()) {
1837 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1838 "Store cannot have Acquire ordering", &SI);
1839 Assert1(SI.getAlignment() != 0,
1840 "Atomic store must specify explicit alignment", &SI);
1841 if (!ElTy->isPointerTy()) {
1842 Assert2(ElTy->isIntegerTy(),
1843 "atomic store operand must have integer type!",
1845 unsigned Size = ElTy->getPrimitiveSizeInBits();
1846 Assert2(Size >= 8 && !(Size & (Size - 1)),
1847 "atomic store operand must be power-of-two byte-sized integer",
1851 Assert1(SI.getSynchScope() == CrossThread,
1852 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1854 visitInstruction(SI);
1857 void Verifier::visitAllocaInst(AllocaInst &AI) {
1858 SmallPtrSet<const Type*, 4> Visited;
1859 PointerType *PTy = AI.getType();
1860 Assert1(PTy->getAddressSpace() == 0,
1861 "Allocation instruction pointer not in the generic address space!",
1863 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
1865 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
1866 "Alloca array size must have integer type", &AI);
1868 visitInstruction(AI);
1871 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
1872 Assert1(CXI.getOrdering() != NotAtomic,
1873 "cmpxchg instructions must be atomic.", &CXI);
1874 Assert1(CXI.getOrdering() != Unordered,
1875 "cmpxchg instructions cannot be unordered.", &CXI);
1876 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
1877 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
1878 Type *ElTy = PTy->getElementType();
1879 Assert2(ElTy->isIntegerTy(),
1880 "cmpxchg operand must have integer type!",
1882 unsigned Size = ElTy->getPrimitiveSizeInBits();
1883 Assert2(Size >= 8 && !(Size & (Size - 1)),
1884 "cmpxchg operand must be power-of-two byte-sized integer",
1886 Assert2(ElTy == CXI.getOperand(1)->getType(),
1887 "Expected value type does not match pointer operand type!",
1889 Assert2(ElTy == CXI.getOperand(2)->getType(),
1890 "Stored value type does not match pointer operand type!",
1892 visitInstruction(CXI);
1895 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
1896 Assert1(RMWI.getOrdering() != NotAtomic,
1897 "atomicrmw instructions must be atomic.", &RMWI);
1898 Assert1(RMWI.getOrdering() != Unordered,
1899 "atomicrmw instructions cannot be unordered.", &RMWI);
1900 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
1901 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
1902 Type *ElTy = PTy->getElementType();
1903 Assert2(ElTy->isIntegerTy(),
1904 "atomicrmw operand must have integer type!",
1906 unsigned Size = ElTy->getPrimitiveSizeInBits();
1907 Assert2(Size >= 8 && !(Size & (Size - 1)),
1908 "atomicrmw operand must be power-of-two byte-sized integer",
1910 Assert2(ElTy == RMWI.getOperand(1)->getType(),
1911 "Argument value type does not match pointer operand type!",
1913 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
1914 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
1915 "Invalid binary operation!", &RMWI);
1916 visitInstruction(RMWI);
1919 void Verifier::visitFenceInst(FenceInst &FI) {
1920 const AtomicOrdering Ordering = FI.getOrdering();
1921 Assert1(Ordering == Acquire || Ordering == Release ||
1922 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
1923 "fence instructions may only have "
1924 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
1925 visitInstruction(FI);
1928 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1929 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1930 EVI.getIndices()) ==
1932 "Invalid ExtractValueInst operands!", &EVI);
1934 visitInstruction(EVI);
1937 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1938 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1939 IVI.getIndices()) ==
1940 IVI.getOperand(1)->getType(),
1941 "Invalid InsertValueInst operands!", &IVI);
1943 visitInstruction(IVI);
1946 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
1947 BasicBlock *BB = LPI.getParent();
1949 // The landingpad instruction is ill-formed if it doesn't have any clauses and
1951 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
1952 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
1954 // The landingpad instruction defines its parent as a landing pad block. The
1955 // landing pad block may be branched to only by the unwind edge of an invoke.
1956 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
1957 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
1958 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
1959 "Block containing LandingPadInst must be jumped to "
1960 "only by the unwind edge of an invoke.", &LPI);
1963 // The landingpad instruction must be the first non-PHI instruction in the
1965 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
1966 "LandingPadInst not the first non-PHI instruction in the block.",
1969 // The personality functions for all landingpad instructions within the same
1970 // function should match.
1972 Assert1(LPI.getPersonalityFn() == PersonalityFn,
1973 "Personality function doesn't match others in function", &LPI);
1974 PersonalityFn = LPI.getPersonalityFn();
1976 // All operands must be constants.
1977 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
1979 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
1980 Value *Clause = LPI.getClause(i);
1981 Assert1(isa<Constant>(Clause), "Clause is not constant!", &LPI);
1982 if (LPI.isCatch(i)) {
1983 Assert1(isa<PointerType>(Clause->getType()),
1984 "Catch operand does not have pointer type!", &LPI);
1986 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
1987 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
1988 "Filter operand is not an array of constants!", &LPI);
1992 visitInstruction(LPI);
1995 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
1996 Instruction *Op = cast<Instruction>(I.getOperand(i));
1997 // If the we have an invalid invoke, don't try to compute the dominance.
1998 // We already reject it in the invoke specific checks and the dominance
1999 // computation doesn't handle multiple edges.
2000 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2001 if (II->getNormalDest() == II->getUnwindDest())
2005 const Use &U = I.getOperandUse(i);
2006 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
2007 "Instruction does not dominate all uses!", Op, &I);
2010 /// verifyInstruction - Verify that an instruction is well formed.
2012 void Verifier::visitInstruction(Instruction &I) {
2013 BasicBlock *BB = I.getParent();
2014 Assert1(BB, "Instruction not embedded in basic block!", &I);
2016 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2017 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
2019 Assert1(*UI != (User*)&I || !DT.isReachableFromEntry(BB),
2020 "Only PHI nodes may reference their own value!", &I);
2023 // Check that void typed values don't have names
2024 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2025 "Instruction has a name, but provides a void value!", &I);
2027 // Check that the return value of the instruction is either void or a legal
2029 Assert1(I.getType()->isVoidTy() ||
2030 I.getType()->isFirstClassType(),
2031 "Instruction returns a non-scalar type!", &I);
2033 // Check that the instruction doesn't produce metadata. Calls are already
2034 // checked against the callee type.
2035 Assert1(!I.getType()->isMetadataTy() ||
2036 isa<CallInst>(I) || isa<InvokeInst>(I),
2037 "Invalid use of metadata!", &I);
2039 // Check that all uses of the instruction, if they are instructions
2040 // themselves, actually have parent basic blocks. If the use is not an
2041 // instruction, it is an error!
2042 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
2044 if (Instruction *Used = dyn_cast<Instruction>(*UI))
2045 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
2046 " embedded in a basic block!", &I, Used);
2048 CheckFailed("Use of instruction is not an instruction!", *UI);
2053 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2054 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
2056 // Check to make sure that only first-class-values are operands to
2058 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2059 Assert1(0, "Instruction operands must be first-class values!", &I);
2062 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2063 // Check to make sure that the "address of" an intrinsic function is never
2065 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
2066 "Cannot take the address of an intrinsic!", &I);
2067 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2068 F->getIntrinsicID() == Intrinsic::donothing,
2069 "Cannot invoke an intrinsinc other than donothing", &I);
2070 Assert1(F->getParent() == M, "Referencing function in another module!",
2072 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2073 Assert1(OpBB->getParent() == BB->getParent(),
2074 "Referring to a basic block in another function!", &I);
2075 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2076 Assert1(OpArg->getParent() == BB->getParent(),
2077 "Referring to an argument in another function!", &I);
2078 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2079 Assert1(GV->getParent() == M, "Referencing global in another module!",
2081 } else if (isa<Instruction>(I.getOperand(i))) {
2082 verifyDominatesUse(I, i);
2083 } else if (isa<InlineAsm>(I.getOperand(i))) {
2084 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2085 (i + 3 == e && isa<InvokeInst>(I)),
2086 "Cannot take the address of an inline asm!", &I);
2087 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2088 if (CE->getType()->isPtrOrPtrVectorTy()) {
2089 // If we have a ConstantExpr pointer, we need to see if it came from an
2090 // illegal bitcast (inttoptr <constant int> )
2091 SmallVector<const ConstantExpr *, 4> Stack;
2092 SmallPtrSet<const ConstantExpr *, 4> Visited;
2093 Stack.push_back(CE);
2095 while (!Stack.empty()) {
2096 const ConstantExpr *V = Stack.pop_back_val();
2097 if (!Visited.insert(V))
2100 VerifyConstantExprBitcastType(V);
2102 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2103 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2104 Stack.push_back(Op);
2111 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2112 Assert1(I.getType()->isFPOrFPVectorTy(),
2113 "fpmath requires a floating point result!", &I);
2114 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2115 Value *Op0 = MD->getOperand(0);
2116 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
2117 APFloat Accuracy = CFP0->getValueAPF();
2118 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2119 "fpmath accuracy not a positive number!", &I);
2121 Assert1(false, "invalid fpmath accuracy!", &I);
2125 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
2126 Assert1(!MD || isa<LoadInst>(I), "Ranges are only for loads!", &I);
2128 if (!DisableDebugInfoVerifier) {
2129 MD = I.getMetadata(LLVMContext::MD_dbg);
2130 Finder.processLocation(*M, DILocation(MD));
2133 InstsInThisBlock.insert(&I);
2136 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2137 /// intrinsic argument or return value) matches the type constraints specified
2138 /// by the .td file (e.g. an "any integer" argument really is an integer).
2140 /// This return true on error but does not print a message.
2141 bool Verifier::VerifyIntrinsicType(Type *Ty,
2142 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2143 SmallVectorImpl<Type*> &ArgTys) {
2144 using namespace Intrinsic;
2146 // If we ran out of descriptors, there are too many arguments.
2147 if (Infos.empty()) return true;
2148 IITDescriptor D = Infos.front();
2149 Infos = Infos.slice(1);
2152 case IITDescriptor::Void: return !Ty->isVoidTy();
2153 case IITDescriptor::VarArg: return true;
2154 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2155 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2156 case IITDescriptor::Half: return !Ty->isHalfTy();
2157 case IITDescriptor::Float: return !Ty->isFloatTy();
2158 case IITDescriptor::Double: return !Ty->isDoubleTy();
2159 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2160 case IITDescriptor::Vector: {
2161 VectorType *VT = dyn_cast<VectorType>(Ty);
2162 return VT == 0 || VT->getNumElements() != D.Vector_Width ||
2163 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2165 case IITDescriptor::Pointer: {
2166 PointerType *PT = dyn_cast<PointerType>(Ty);
2167 return PT == 0 || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2168 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2171 case IITDescriptor::Struct: {
2172 StructType *ST = dyn_cast<StructType>(Ty);
2173 if (ST == 0 || ST->getNumElements() != D.Struct_NumElements)
2176 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2177 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2182 case IITDescriptor::Argument:
2183 // Two cases here - If this is the second occurrence of an argument, verify
2184 // that the later instance matches the previous instance.
2185 if (D.getArgumentNumber() < ArgTys.size())
2186 return Ty != ArgTys[D.getArgumentNumber()];
2188 // Otherwise, if this is the first instance of an argument, record it and
2189 // verify the "Any" kind.
2190 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2191 ArgTys.push_back(Ty);
2193 switch (D.getArgumentKind()) {
2194 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2195 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2196 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2197 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2199 llvm_unreachable("all argument kinds not covered");
2201 case IITDescriptor::ExtendVecArgument:
2202 // This may only be used when referring to a previous vector argument.
2203 return D.getArgumentNumber() >= ArgTys.size() ||
2204 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2205 VectorType::getExtendedElementVectorType(
2206 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2208 case IITDescriptor::TruncVecArgument:
2209 // This may only be used when referring to a previous vector argument.
2210 return D.getArgumentNumber() >= ArgTys.size() ||
2211 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2212 VectorType::getTruncatedElementVectorType(
2213 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2215 llvm_unreachable("unhandled");
2218 /// \brief Verify if the intrinsic has variable arguments.
2219 /// This method is intended to be called after all the fixed arguments have been
2222 /// This method returns true on error and does not print an error message.
2224 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2225 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2226 using namespace Intrinsic;
2228 // If there are no descriptors left, then it can't be a vararg.
2230 return isVarArg ? true : false;
2232 // There should be only one descriptor remaining at this point.
2233 if (Infos.size() != 1)
2236 // Check and verify the descriptor.
2237 IITDescriptor D = Infos.front();
2238 Infos = Infos.slice(1);
2239 if (D.Kind == IITDescriptor::VarArg)
2240 return isVarArg ? false : true;
2245 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2247 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2248 Function *IF = CI.getCalledFunction();
2249 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2252 // Verify that the intrinsic prototype lines up with what the .td files
2254 FunctionType *IFTy = IF->getFunctionType();
2255 bool IsVarArg = IFTy->isVarArg();
2257 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2258 getIntrinsicInfoTableEntries(ID, Table);
2259 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2261 SmallVector<Type *, 4> ArgTys;
2262 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2263 "Intrinsic has incorrect return type!", IF);
2264 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2265 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2266 "Intrinsic has incorrect argument type!", IF);
2268 // Verify if the intrinsic call matches the vararg property.
2270 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2271 "Intrinsic was not defined with variable arguments!", IF);
2273 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2274 "Callsite was not defined with variable arguments!", IF);
2276 // All descriptors should be absorbed by now.
2277 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2279 // Now that we have the intrinsic ID and the actual argument types (and we
2280 // know they are legal for the intrinsic!) get the intrinsic name through the
2281 // usual means. This allows us to verify the mangling of argument types into
2283 Assert1(Intrinsic::getName(ID, ArgTys) == IF->getName(),
2284 "Intrinsic name not mangled correctly for type arguments!", IF);
2286 // If the intrinsic takes MDNode arguments, verify that they are either global
2287 // or are local to *this* function.
2288 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2289 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
2290 visitMDNode(*MD, CI.getParent()->getParent());
2295 case Intrinsic::ctlz: // llvm.ctlz
2296 case Intrinsic::cttz: // llvm.cttz
2297 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2298 "is_zero_undef argument of bit counting intrinsics must be a "
2299 "constant int", &CI);
2301 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2302 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2303 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2304 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
2305 Assert1(MD->getNumOperands() == 1,
2306 "invalid llvm.dbg.declare intrinsic call 2", &CI);
2307 if (!DisableDebugInfoVerifier)
2308 Finder.processDeclare(*M, cast<DbgDeclareInst>(&CI));
2310 case Intrinsic::dbg_value: { //llvm.dbg.value
2311 if (!DisableDebugInfoVerifier) {
2312 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2313 "invalid llvm.dbg.value intrinsic call 1", &CI);
2314 Finder.processValue(*M, cast<DbgValueInst>(&CI));
2318 case Intrinsic::memcpy:
2319 case Intrinsic::memmove:
2320 case Intrinsic::memset:
2321 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2322 "alignment argument of memory intrinsics must be a constant int",
2324 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2325 "isvolatile argument of memory intrinsics must be a constant int",
2328 case Intrinsic::gcroot:
2329 case Intrinsic::gcwrite:
2330 case Intrinsic::gcread:
2331 if (ID == Intrinsic::gcroot) {
2333 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2334 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2335 Assert1(isa<Constant>(CI.getArgOperand(1)),
2336 "llvm.gcroot parameter #2 must be a constant.", &CI);
2337 if (!AI->getType()->getElementType()->isPointerTy()) {
2338 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2339 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2340 "or argument #2 must be a non-null constant.", &CI);
2344 Assert1(CI.getParent()->getParent()->hasGC(),
2345 "Enclosing function does not use GC.", &CI);
2347 case Intrinsic::init_trampoline:
2348 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2349 "llvm.init_trampoline parameter #2 must resolve to a function.",
2352 case Intrinsic::prefetch:
2353 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2354 isa<ConstantInt>(CI.getArgOperand(2)) &&
2355 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2356 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2357 "invalid arguments to llvm.prefetch",
2360 case Intrinsic::stackprotector:
2361 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2362 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2365 case Intrinsic::lifetime_start:
2366 case Intrinsic::lifetime_end:
2367 case Intrinsic::invariant_start:
2368 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2369 "size argument of memory use markers must be a constant integer",
2372 case Intrinsic::invariant_end:
2373 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2374 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2379 void Verifier::verifyDebugInfo() {
2380 // Verify Debug Info.
2381 if (!DisableDebugInfoVerifier) {
2382 for (DebugInfoFinder::iterator I = Finder.compile_unit_begin(),
2383 E = Finder.compile_unit_end(); I != E; ++I)
2384 Assert1(DICompileUnit(*I).Verify(), "DICompileUnit does not Verify!", *I);
2385 for (DebugInfoFinder::iterator I = Finder.subprogram_begin(),
2386 E = Finder.subprogram_end(); I != E; ++I)
2387 Assert1(DISubprogram(*I).Verify(), "DISubprogram does not Verify!", *I);
2388 for (DebugInfoFinder::iterator I = Finder.global_variable_begin(),
2389 E = Finder.global_variable_end(); I != E; ++I)
2390 Assert1(DIGlobalVariable(*I).Verify(),
2391 "DIGlobalVariable does not Verify!", *I);
2392 for (DebugInfoFinder::iterator I = Finder.type_begin(),
2393 E = Finder.type_end(); I != E; ++I)
2394 Assert1(DIType(*I).Verify(), "DIType does not Verify!", *I);
2395 for (DebugInfoFinder::iterator I = Finder.scope_begin(),
2396 E = Finder.scope_end(); I != E; ++I)
2397 Assert1(DIScope(*I).Verify(), "DIScope does not Verify!", *I);
2401 //===----------------------------------------------------------------------===//
2402 // Implement the public interfaces to this file...
2403 //===----------------------------------------------------------------------===//
2405 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
2406 return new Verifier(action);
2409 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
2410 Function &F = const_cast<Function &>(f);
2411 assert(!F.isDeclaration() && "Cannot verify external functions");
2413 FunctionPassManager FPM(F.getParent());
2414 Verifier *V = new Verifier(action);
2416 FPM.doInitialization();
2421 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
2422 std::string *ErrorInfo) {
2424 Verifier *V = new Verifier(action);
2426 PM.run(const_cast<Module &>(M));
2428 if (ErrorInfo && V->Broken)
2429 *ErrorInfo = V->MessagesStr.str();