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/CFG.h"
56 #include "llvm/IR/CallSite.h"
57 #include "llvm/IR/CallingConv.h"
58 #include "llvm/IR/Constants.h"
59 #include "llvm/IR/DataLayout.h"
60 #include "llvm/IR/DerivedTypes.h"
61 #include "llvm/IR/Dominators.h"
62 #include "llvm/IR/InlineAsm.h"
63 #include "llvm/IR/IntrinsicInst.h"
64 #include "llvm/IR/LLVMContext.h"
65 #include "llvm/IR/Metadata.h"
66 #include "llvm/IR/Module.h"
67 #include "llvm/IR/PassManager.h"
68 #include "llvm/InstVisitor.h"
69 #include "llvm/Pass.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 class Verifier : public InstVisitor<Verifier> {
84 friend class InstVisitor<Verifier>;
92 /// \brief When verifying a basic block, keep track of all of the
93 /// instructions we have seen so far.
95 /// This allows us to do efficient dominance checks for the case when an
96 /// instruction has an operand that is an instruction in the same block.
97 SmallPtrSet<Instruction *, 16> InstsInThisBlock;
99 /// \brief Keep track of the metadata nodes that have been checked already.
100 SmallPtrSet<MDNode *, 32> MDNodes;
102 /// \brief The personality function referenced by the LandingPadInsts.
103 /// All LandingPadInsts within the same function must use the same
104 /// personality function.
105 const Value *PersonalityFn;
107 /// \brief Finder keeps track of all debug info MDNodes in a Module.
108 DebugInfoFinder Finder;
110 /// \brief Track the brokenness of the module while recursively visiting.
114 explicit Verifier(raw_ostream &OS = dbgs())
115 : OS(OS), M(0), Context(0), DL(0), PersonalityFn(0), Broken(false) {}
117 bool verify(const Function &F) {
119 Context = &M->getContext();
121 // First ensure the function is well-enough formed to compute dominance
124 OS << "Function '" << F.getName()
125 << "' does not contain an entry block!\n";
128 for (Function::const_iterator I = F.begin(), E = F.end(); I != E; ++I) {
129 if (I->empty() || !I->back().isTerminator()) {
130 OS << "Basic Block in function '" << F.getName()
131 << "' does not have terminator!\n";
132 I->printAsOperand(OS, true);
138 // Now directly compute a dominance tree. We don't rely on the pass
139 // manager to provide this as it isolates us from a potentially
140 // out-of-date dominator tree and makes it significantly more complex to
141 // run this code outside of a pass manager.
142 // FIXME: It's really gross that we have to cast away constness here.
143 DT.recalculate(const_cast<Function &>(F));
147 // FIXME: We strip const here because the inst visitor strips const.
148 visit(const_cast<Function &>(F));
149 InstsInThisBlock.clear();
152 if (!DisableDebugInfoVerifier)
153 // Verify Debug Info.
159 bool verify(const Module &M) {
161 Context = &M.getContext();
165 // Scan through, checking all of the external function's linkage now...
166 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I) {
167 visitGlobalValue(*I);
169 // Check to make sure function prototypes are okay.
170 if (I->isDeclaration())
174 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
176 visitGlobalVariable(*I);
178 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
180 visitGlobalAlias(*I);
182 for (Module::const_named_metadata_iterator I = M.named_metadata_begin(),
183 E = M.named_metadata_end();
185 visitNamedMDNode(*I);
188 visitModuleIdents(M);
190 if (!DisableDebugInfoVerifier) {
192 Finder.processModule(M);
193 // Verify Debug Info.
201 // Verification methods...
202 void visitGlobalValue(const GlobalValue &GV);
203 void visitGlobalVariable(const GlobalVariable &GV);
204 void visitGlobalAlias(const GlobalAlias &GA);
205 void visitNamedMDNode(const NamedMDNode &NMD);
206 void visitMDNode(MDNode &MD, Function *F);
207 void visitModuleIdents(const Module &M);
208 void visitModuleFlags(const Module &M);
209 void visitModuleFlag(const MDNode *Op,
210 DenseMap<const MDString *, const MDNode *> &SeenIDs,
211 SmallVectorImpl<const MDNode *> &Requirements);
212 void visitFunction(const Function &F);
213 void visitBasicBlock(BasicBlock &BB);
215 // InstVisitor overrides...
216 using InstVisitor<Verifier>::visit;
217 void visit(Instruction &I);
219 void visitTruncInst(TruncInst &I);
220 void visitZExtInst(ZExtInst &I);
221 void visitSExtInst(SExtInst &I);
222 void visitFPTruncInst(FPTruncInst &I);
223 void visitFPExtInst(FPExtInst &I);
224 void visitFPToUIInst(FPToUIInst &I);
225 void visitFPToSIInst(FPToSIInst &I);
226 void visitUIToFPInst(UIToFPInst &I);
227 void visitSIToFPInst(SIToFPInst &I);
228 void visitIntToPtrInst(IntToPtrInst &I);
229 void visitPtrToIntInst(PtrToIntInst &I);
230 void visitBitCastInst(BitCastInst &I);
231 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
232 void visitPHINode(PHINode &PN);
233 void visitBinaryOperator(BinaryOperator &B);
234 void visitICmpInst(ICmpInst &IC);
235 void visitFCmpInst(FCmpInst &FC);
236 void visitExtractElementInst(ExtractElementInst &EI);
237 void visitInsertElementInst(InsertElementInst &EI);
238 void visitShuffleVectorInst(ShuffleVectorInst &EI);
239 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
240 void visitCallInst(CallInst &CI);
241 void visitInvokeInst(InvokeInst &II);
242 void visitGetElementPtrInst(GetElementPtrInst &GEP);
243 void visitLoadInst(LoadInst &LI);
244 void visitStoreInst(StoreInst &SI);
245 void verifyDominatesUse(Instruction &I, unsigned i);
246 void visitInstruction(Instruction &I);
247 void visitTerminatorInst(TerminatorInst &I);
248 void visitBranchInst(BranchInst &BI);
249 void visitReturnInst(ReturnInst &RI);
250 void visitSwitchInst(SwitchInst &SI);
251 void visitIndirectBrInst(IndirectBrInst &BI);
252 void visitSelectInst(SelectInst &SI);
253 void visitUserOp1(Instruction &I);
254 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
255 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
256 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
257 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
258 void visitFenceInst(FenceInst &FI);
259 void visitAllocaInst(AllocaInst &AI);
260 void visitExtractValueInst(ExtractValueInst &EVI);
261 void visitInsertValueInst(InsertValueInst &IVI);
262 void visitLandingPadInst(LandingPadInst &LPI);
264 void VerifyCallSite(CallSite CS);
265 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
266 unsigned ArgNo, std::string &Suffix);
267 bool VerifyIntrinsicType(Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
268 SmallVectorImpl<Type *> &ArgTys);
269 bool VerifyIntrinsicIsVarArg(bool isVarArg,
270 ArrayRef<Intrinsic::IITDescriptor> &Infos);
271 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
272 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
274 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
275 bool isReturnValue, const Value *V);
276 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
279 void VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy);
280 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
282 void verifyDebugInfo();
284 void WriteValue(const Value *V) {
287 if (isa<Instruction>(V)) {
290 V->printAsOperand(OS, true, M);
295 void WriteType(Type *T) {
301 // CheckFailed - A check failed, so print out the condition and the message
302 // that failed. This provides a nice place to put a breakpoint if you want
303 // to see why something is not correct.
304 void CheckFailed(const Twine &Message, const Value *V1 = 0,
305 const Value *V2 = 0, const Value *V3 = 0,
306 const Value *V4 = 0) {
307 OS << Message.str() << "\n";
315 void CheckFailed(const Twine &Message, const Value *V1, Type *T2,
316 const Value *V3 = 0) {
317 OS << Message.str() << "\n";
324 void CheckFailed(const Twine &Message, Type *T1, Type *T2 = 0, Type *T3 = 0) {
325 OS << Message.str() << "\n";
332 } // End anonymous namespace
334 // Assert - We know that cond should be true, if not print an error message.
335 #define Assert(C, M) \
336 do { if (!(C)) { CheckFailed(M); return; } } while (0)
337 #define Assert1(C, M, V1) \
338 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
339 #define Assert2(C, M, V1, V2) \
340 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
341 #define Assert3(C, M, V1, V2, V3) \
342 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
343 #define Assert4(C, M, V1, V2, V3, V4) \
344 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
346 void Verifier::visit(Instruction &I) {
347 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
348 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
349 InstVisitor<Verifier>::visit(I);
353 void Verifier::visitGlobalValue(const GlobalValue &GV) {
354 Assert1(!GV.isDeclaration() ||
355 GV.isMaterializable() ||
356 GV.hasExternalLinkage() ||
357 GV.hasExternalWeakLinkage() ||
358 (isa<GlobalAlias>(GV) &&
359 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
360 "Global is external, but doesn't have external or weak linkage!",
363 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
364 "Only global variables can have appending linkage!", &GV);
366 if (GV.hasAppendingLinkage()) {
367 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
368 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
369 "Only global arrays can have appending linkage!", GVar);
373 void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
374 if (GV.hasInitializer()) {
375 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
376 "Global variable initializer type does not match global "
377 "variable type!", &GV);
379 // If the global has common linkage, it must have a zero initializer and
380 // cannot be constant.
381 if (GV.hasCommonLinkage()) {
382 Assert1(GV.getInitializer()->isNullValue(),
383 "'common' global must have a zero initializer!", &GV);
384 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
388 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
389 "invalid linkage type for global declaration", &GV);
392 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
393 GV.getName() == "llvm.global_dtors")) {
394 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
395 "invalid linkage for intrinsic global variable", &GV);
396 // Don't worry about emitting an error for it not being an array,
397 // visitGlobalValue will complain on appending non-array.
398 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType())) {
399 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
400 PointerType *FuncPtrTy =
401 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
402 Assert1(STy && STy->getNumElements() == 2 &&
403 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
404 STy->getTypeAtIndex(1) == FuncPtrTy,
405 "wrong type for intrinsic global variable", &GV);
409 if (GV.hasName() && (GV.getName() == "llvm.used" ||
410 GV.getName() == "llvm.compiler.used")) {
411 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
412 "invalid linkage for intrinsic global variable", &GV);
413 Type *GVType = GV.getType()->getElementType();
414 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
415 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
416 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
417 if (GV.hasInitializer()) {
418 const Constant *Init = GV.getInitializer();
419 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
420 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
422 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
423 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
425 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
426 "invalid llvm.used member", V);
427 Assert1(V->hasName(), "members of llvm.used must be named", V);
433 Assert1(!GV.hasDLLImportStorageClass() ||
434 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
435 GV.hasAvailableExternallyLinkage(),
436 "Global is marked as dllimport, but not external", &GV);
438 if (!GV.hasInitializer()) {
439 visitGlobalValue(GV);
443 // Walk any aggregate initializers looking for bitcasts between address spaces
444 SmallPtrSet<const Value *, 4> Visited;
445 SmallVector<const Value *, 4> WorkStack;
446 WorkStack.push_back(cast<Value>(GV.getInitializer()));
448 while (!WorkStack.empty()) {
449 const Value *V = WorkStack.pop_back_val();
450 if (!Visited.insert(V))
453 if (const User *U = dyn_cast<User>(V)) {
454 for (unsigned I = 0, N = U->getNumOperands(); I != N; ++I)
455 WorkStack.push_back(U->getOperand(I));
458 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
459 VerifyConstantExprBitcastType(CE);
465 visitGlobalValue(GV);
468 void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
469 Assert1(!GA.getName().empty(),
470 "Alias name cannot be empty!", &GA);
471 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
472 "Alias should have external or external weak linkage!", &GA);
473 Assert1(GA.getAliasee(),
474 "Aliasee cannot be NULL!", &GA);
475 Assert1(GA.getType() == GA.getAliasee()->getType(),
476 "Alias and aliasee types should match!", &GA);
477 Assert1(!GA.hasUnnamedAddr(), "Alias cannot have unnamed_addr!", &GA);
478 Assert1(!GA.hasSection(), "Alias cannot have a section!", &GA);
479 Assert1(!GA.getAlignment(), "Alias connot have an alignment", &GA);
481 const Constant *Aliasee = GA.getAliasee();
483 if (!isa<GlobalValue>(Aliasee)) {
484 const ConstantExpr *CE = dyn_cast<ConstantExpr>(Aliasee);
486 (CE->getOpcode() == Instruction::BitCast ||
487 CE->getOpcode() == Instruction::AddrSpaceCast ||
488 CE->getOpcode() == Instruction::GetElementPtr) &&
489 isa<GlobalValue>(CE->getOperand(0)),
490 "Aliasee should be either GlobalValue, bitcast or "
491 "addrspacecast of GlobalValue",
494 if (CE->getOpcode() == Instruction::BitCast) {
495 unsigned SrcAS = CE->getOperand(0)->getType()->getPointerAddressSpace();
496 unsigned DstAS = CE->getType()->getPointerAddressSpace();
498 Assert1(SrcAS == DstAS,
499 "Alias bitcasts cannot be between different address spaces",
504 const GlobalValue* Resolved = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
506 "Aliasing chain should end with function or global variable", &GA);
508 visitGlobalValue(GA);
511 void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
512 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
513 MDNode *MD = NMD.getOperand(i);
517 Assert1(!MD->isFunctionLocal(),
518 "Named metadata operand cannot be function local!", MD);
523 void Verifier::visitMDNode(MDNode &MD, Function *F) {
524 // Only visit each node once. Metadata can be mutually recursive, so this
525 // avoids infinite recursion here, as well as being an optimization.
526 if (!MDNodes.insert(&MD))
529 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
530 Value *Op = MD.getOperand(i);
533 if (isa<Constant>(Op) || isa<MDString>(Op))
535 if (MDNode *N = dyn_cast<MDNode>(Op)) {
536 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
537 "Global metadata operand cannot be function local!", &MD, N);
541 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
543 // If this was an instruction, bb, or argument, verify that it is in the
544 // function that we expect.
545 Function *ActualF = 0;
546 if (Instruction *I = dyn_cast<Instruction>(Op))
547 ActualF = I->getParent()->getParent();
548 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
549 ActualF = BB->getParent();
550 else if (Argument *A = dyn_cast<Argument>(Op))
551 ActualF = A->getParent();
552 assert(ActualF && "Unimplemented function local metadata case!");
554 Assert2(ActualF == F, "function-local metadata used in wrong function",
559 void Verifier::visitModuleIdents(const Module &M) {
560 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
564 // llvm.ident takes a list of metadata entry. Each entry has only one string.
565 // Scan each llvm.ident entry and make sure that this requirement is met.
566 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
567 const MDNode *N = Idents->getOperand(i);
568 Assert1(N->getNumOperands() == 1,
569 "incorrect number of operands in llvm.ident metadata", N);
570 Assert1(isa<MDString>(N->getOperand(0)),
571 ("invalid value for llvm.ident metadata entry operand"
572 "(the operand should be a string)"),
577 void Verifier::visitModuleFlags(const Module &M) {
578 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
581 // Scan each flag, and track the flags and requirements.
582 DenseMap<const MDString*, const MDNode*> SeenIDs;
583 SmallVector<const MDNode*, 16> Requirements;
584 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
585 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
588 // Validate that the requirements in the module are valid.
589 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
590 const MDNode *Requirement = Requirements[I];
591 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
592 const Value *ReqValue = Requirement->getOperand(1);
594 const MDNode *Op = SeenIDs.lookup(Flag);
596 CheckFailed("invalid requirement on flag, flag is not present in module",
601 if (Op->getOperand(2) != ReqValue) {
602 CheckFailed(("invalid requirement on flag, "
603 "flag does not have the required value"),
611 Verifier::visitModuleFlag(const MDNode *Op,
612 DenseMap<const MDString *, const MDNode *> &SeenIDs,
613 SmallVectorImpl<const MDNode *> &Requirements) {
614 // Each module flag should have three arguments, the merge behavior (a
615 // constant int), the flag ID (an MDString), and the value.
616 Assert1(Op->getNumOperands() == 3,
617 "incorrect number of operands in module flag", Op);
618 ConstantInt *Behavior = dyn_cast<ConstantInt>(Op->getOperand(0));
619 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
621 "invalid behavior operand in module flag (expected constant integer)",
623 unsigned BehaviorValue = Behavior->getZExtValue();
625 "invalid ID operand in module flag (expected metadata string)",
628 // Sanity check the values for behaviors with additional requirements.
629 switch (BehaviorValue) {
632 "invalid behavior operand in module flag (unexpected constant)",
637 case Module::Warning:
638 case Module::Override:
639 // These behavior types accept any value.
642 case Module::Require: {
643 // The value should itself be an MDNode with two operands, a flag ID (an
644 // MDString), and a value.
645 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
646 Assert1(Value && Value->getNumOperands() == 2,
647 "invalid value for 'require' module flag (expected metadata pair)",
649 Assert1(isa<MDString>(Value->getOperand(0)),
650 ("invalid value for 'require' module flag "
651 "(first value operand should be a string)"),
652 Value->getOperand(0));
654 // Append it to the list of requirements, to check once all module flags are
656 Requirements.push_back(Value);
661 case Module::AppendUnique: {
662 // These behavior types require the operand be an MDNode.
663 Assert1(isa<MDNode>(Op->getOperand(2)),
664 "invalid value for 'append'-type module flag "
665 "(expected a metadata node)", Op->getOperand(2));
670 // Unless this is a "requires" flag, check the ID is unique.
671 if (BehaviorValue != Module::Require) {
672 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
674 "module flag identifiers must be unique (or of 'require' type)",
679 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
680 bool isFunction, const Value *V) {
682 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
683 if (Attrs.getSlotIndex(I) == Idx) {
688 assert(Slot != ~0U && "Attribute set inconsistency!");
690 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
692 if (I->isStringAttribute())
695 if (I->getKindAsEnum() == Attribute::NoReturn ||
696 I->getKindAsEnum() == Attribute::NoUnwind ||
697 I->getKindAsEnum() == Attribute::NoInline ||
698 I->getKindAsEnum() == Attribute::AlwaysInline ||
699 I->getKindAsEnum() == Attribute::OptimizeForSize ||
700 I->getKindAsEnum() == Attribute::StackProtect ||
701 I->getKindAsEnum() == Attribute::StackProtectReq ||
702 I->getKindAsEnum() == Attribute::StackProtectStrong ||
703 I->getKindAsEnum() == Attribute::NoRedZone ||
704 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
705 I->getKindAsEnum() == Attribute::Naked ||
706 I->getKindAsEnum() == Attribute::InlineHint ||
707 I->getKindAsEnum() == Attribute::StackAlignment ||
708 I->getKindAsEnum() == Attribute::UWTable ||
709 I->getKindAsEnum() == Attribute::NonLazyBind ||
710 I->getKindAsEnum() == Attribute::ReturnsTwice ||
711 I->getKindAsEnum() == Attribute::SanitizeAddress ||
712 I->getKindAsEnum() == Attribute::SanitizeThread ||
713 I->getKindAsEnum() == Attribute::SanitizeMemory ||
714 I->getKindAsEnum() == Attribute::MinSize ||
715 I->getKindAsEnum() == Attribute::NoDuplicate ||
716 I->getKindAsEnum() == Attribute::Builtin ||
717 I->getKindAsEnum() == Attribute::NoBuiltin ||
718 I->getKindAsEnum() == Attribute::Cold ||
719 I->getKindAsEnum() == Attribute::OptimizeNone) {
721 CheckFailed("Attribute '" + I->getAsString() +
722 "' only applies to functions!", V);
725 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
726 I->getKindAsEnum() == Attribute::ReadNone) {
728 CheckFailed("Attribute '" + I->getAsString() +
729 "' does not apply to function returns");
732 } else if (isFunction) {
733 CheckFailed("Attribute '" + I->getAsString() +
734 "' does not apply to functions!", V);
740 // VerifyParameterAttrs - Check the given attributes for an argument or return
741 // value of the specified type. The value V is printed in error messages.
742 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
743 bool isReturnValue, const Value *V) {
744 if (!Attrs.hasAttributes(Idx))
747 VerifyAttributeTypes(Attrs, Idx, false, V);
750 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
751 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
752 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
753 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
754 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
755 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
756 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
757 "'returned' do not apply to return values!", V);
759 // Check for mutually incompatible attributes. Only inreg is compatible with
761 unsigned AttrCount = 0;
762 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
763 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
764 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
765 Attrs.hasAttribute(Idx, Attribute::InReg);
766 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
767 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
768 "and 'sret' are incompatible!", V);
770 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
771 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
772 "'inalloca and readonly' are incompatible!", V);
774 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
775 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
776 "'sret and returned' are incompatible!", V);
778 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
779 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
780 "'zeroext and signext' are incompatible!", V);
782 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
783 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
784 "'readnone and readonly' are incompatible!", V);
786 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
787 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
788 "'noinline and alwaysinline' are incompatible!", V);
790 Assert1(!AttrBuilder(Attrs, Idx).
791 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
792 "Wrong types for attribute: " +
793 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
795 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
796 if (!PTy->getElementType()->isSized()) {
797 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
798 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
799 "Attributes 'byval' and 'inalloca' do not support unsized types!",
803 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
804 "Attribute 'byval' only applies to parameters with pointer type!",
809 // VerifyFunctionAttrs - Check parameter attributes against a function type.
810 // The value V is printed in error messages.
811 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
816 bool SawNest = false;
817 bool SawReturned = false;
819 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
820 unsigned Idx = Attrs.getSlotIndex(i);
824 Ty = FT->getReturnType();
825 else if (Idx-1 < FT->getNumParams())
826 Ty = FT->getParamType(Idx-1);
828 break; // VarArgs attributes, verified elsewhere.
830 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
835 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
836 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
840 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
841 Assert1(!SawReturned, "More than one parameter has attribute returned!",
843 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
844 "argument and return types for 'returned' attribute", V);
848 if (Attrs.hasAttribute(Idx, Attribute::StructRet))
849 Assert1(Idx == 1, "Attribute sret is not on first parameter!", V);
851 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
852 Assert1(Idx == FT->getNumParams(),
853 "inalloca isn't on the last parameter!", V);
857 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
860 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
862 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
863 Attribute::ReadNone) &&
864 Attrs.hasAttribute(AttributeSet::FunctionIndex,
865 Attribute::ReadOnly)),
866 "Attributes 'readnone and readonly' are incompatible!", V);
868 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
869 Attribute::NoInline) &&
870 Attrs.hasAttribute(AttributeSet::FunctionIndex,
871 Attribute::AlwaysInline)),
872 "Attributes 'noinline and alwaysinline' are incompatible!", V);
874 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
875 Attribute::OptimizeNone)) {
876 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
877 Attribute::NoInline),
878 "Attribute 'optnone' requires 'noinline'!", V);
880 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
881 Attribute::OptimizeForSize),
882 "Attributes 'optsize and optnone' are incompatible!", V);
884 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
886 "Attributes 'minsize and optnone' are incompatible!", V);
890 void Verifier::VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy) {
891 // Get the size of the types in bits, we'll need this later
892 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
893 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
895 // BitCast implies a no-op cast of type only. No bits change.
896 // However, you can't cast pointers to anything but pointers.
897 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
898 "Bitcast requires both operands to be pointer or neither", V);
899 Assert1(SrcBitSize == DestBitSize,
900 "Bitcast requires types of same width", V);
902 // Disallow aggregates.
903 Assert1(!SrcTy->isAggregateType(),
904 "Bitcast operand must not be aggregate", V);
905 Assert1(!DestTy->isAggregateType(),
906 "Bitcast type must not be aggregate", V);
908 // Without datalayout, assume all address spaces are the same size.
909 // Don't check if both types are not pointers.
910 // Skip casts between scalars and vectors.
912 !SrcTy->isPtrOrPtrVectorTy() ||
913 !DestTy->isPtrOrPtrVectorTy() ||
914 SrcTy->isVectorTy() != DestTy->isVectorTy()) {
918 unsigned SrcAS = SrcTy->getPointerAddressSpace();
919 unsigned DstAS = DestTy->getPointerAddressSpace();
921 Assert1(SrcAS == DstAS,
922 "Bitcasts between pointers of different address spaces is not legal."
923 "Use AddrSpaceCast instead.", V);
926 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
927 if (CE->getOpcode() == Instruction::BitCast) {
928 Type *SrcTy = CE->getOperand(0)->getType();
929 Type *DstTy = CE->getType();
930 VerifyBitcastType(CE, DstTy, SrcTy);
934 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
935 if (Attrs.getNumSlots() == 0)
938 unsigned LastSlot = Attrs.getNumSlots() - 1;
939 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
940 if (LastIndex <= Params
941 || (LastIndex == AttributeSet::FunctionIndex
942 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
948 // visitFunction - Verify that a function is ok.
950 void Verifier::visitFunction(const Function &F) {
951 // Check function arguments.
952 FunctionType *FT = F.getFunctionType();
953 unsigned NumArgs = F.arg_size();
955 Assert1(Context == &F.getContext(),
956 "Function context does not match Module context!", &F);
958 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
959 Assert2(FT->getNumParams() == NumArgs,
960 "# formal arguments must match # of arguments for function type!",
962 Assert1(F.getReturnType()->isFirstClassType() ||
963 F.getReturnType()->isVoidTy() ||
964 F.getReturnType()->isStructTy(),
965 "Functions cannot return aggregate values!", &F);
967 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
968 "Invalid struct return type!", &F);
970 AttributeSet Attrs = F.getAttributes();
972 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
973 "Attribute after last parameter!", &F);
975 // Check function attributes.
976 VerifyFunctionAttrs(FT, Attrs, &F);
978 // On function declarations/definitions, we do not support the builtin
979 // attribute. We do not check this in VerifyFunctionAttrs since that is
980 // checking for Attributes that can/can not ever be on functions.
981 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
983 "Attribute 'builtin' can only be applied to a callsite.", &F);
985 // Check that this function meets the restrictions on this calling convention.
986 switch (F.getCallingConv()) {
991 case CallingConv::Fast:
992 case CallingConv::Cold:
993 case CallingConv::X86_FastCall:
994 case CallingConv::X86_ThisCall:
995 case CallingConv::Intel_OCL_BI:
996 case CallingConv::PTX_Kernel:
997 case CallingConv::PTX_Device:
998 Assert1(!F.isVarArg(),
999 "Varargs functions must have C calling conventions!", &F);
1003 bool isLLVMdotName = F.getName().size() >= 5 &&
1004 F.getName().substr(0, 5) == "llvm.";
1006 // Check that the argument values match the function type for this function...
1008 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1010 Assert2(I->getType() == FT->getParamType(i),
1011 "Argument value does not match function argument type!",
1012 I, FT->getParamType(i));
1013 Assert1(I->getType()->isFirstClassType(),
1014 "Function arguments must have first-class types!", I);
1016 Assert2(!I->getType()->isMetadataTy(),
1017 "Function takes metadata but isn't an intrinsic", I, &F);
1020 if (F.isMaterializable()) {
1021 // Function has a body somewhere we can't see.
1022 } else if (F.isDeclaration()) {
1023 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1024 "invalid linkage type for function declaration", &F);
1026 // Verify that this function (which has a body) is not named "llvm.*". It
1027 // is not legal to define intrinsics.
1028 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1030 // Check the entry node
1031 const BasicBlock *Entry = &F.getEntryBlock();
1032 Assert1(pred_begin(Entry) == pred_end(Entry),
1033 "Entry block to function must not have predecessors!", Entry);
1035 // The address of the entry block cannot be taken, unless it is dead.
1036 if (Entry->hasAddressTaken()) {
1037 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1038 "blockaddress may not be used with the entry block!", Entry);
1042 // If this function is actually an intrinsic, verify that it is only used in
1043 // direct call/invokes, never having its "address taken".
1044 if (F.getIntrinsicID()) {
1046 if (F.hasAddressTaken(&U))
1047 Assert1(0, "Invalid user of intrinsic instruction!", U);
1050 Assert1(!F.hasDLLImportStorageClass() ||
1051 (F.isDeclaration() && F.hasExternalLinkage()) ||
1052 F.hasAvailableExternallyLinkage(),
1053 "Function is marked as dllimport, but not external.", &F);
1056 // verifyBasicBlock - Verify that a basic block is well formed...
1058 void Verifier::visitBasicBlock(BasicBlock &BB) {
1059 InstsInThisBlock.clear();
1061 // Ensure that basic blocks have terminators!
1062 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1064 // Check constraints that this basic block imposes on all of the PHI nodes in
1066 if (isa<PHINode>(BB.front())) {
1067 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1068 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1069 std::sort(Preds.begin(), Preds.end());
1071 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1072 // Ensure that PHI nodes have at least one entry!
1073 Assert1(PN->getNumIncomingValues() != 0,
1074 "PHI nodes must have at least one entry. If the block is dead, "
1075 "the PHI should be removed!", PN);
1076 Assert1(PN->getNumIncomingValues() == Preds.size(),
1077 "PHINode should have one entry for each predecessor of its "
1078 "parent basic block!", PN);
1080 // Get and sort all incoming values in the PHI node...
1082 Values.reserve(PN->getNumIncomingValues());
1083 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1084 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1085 PN->getIncomingValue(i)));
1086 std::sort(Values.begin(), Values.end());
1088 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1089 // Check to make sure that if there is more than one entry for a
1090 // particular basic block in this PHI node, that the incoming values are
1093 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1094 Values[i].second == Values[i-1].second,
1095 "PHI node has multiple entries for the same basic block with "
1096 "different incoming values!", PN, Values[i].first,
1097 Values[i].second, Values[i-1].second);
1099 // Check to make sure that the predecessors and PHI node entries are
1101 Assert3(Values[i].first == Preds[i],
1102 "PHI node entries do not match predecessors!", PN,
1103 Values[i].first, Preds[i]);
1109 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1110 // Ensure that terminators only exist at the end of the basic block.
1111 Assert1(&I == I.getParent()->getTerminator(),
1112 "Terminator found in the middle of a basic block!", I.getParent());
1113 visitInstruction(I);
1116 void Verifier::visitBranchInst(BranchInst &BI) {
1117 if (BI.isConditional()) {
1118 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1119 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1121 visitTerminatorInst(BI);
1124 void Verifier::visitReturnInst(ReturnInst &RI) {
1125 Function *F = RI.getParent()->getParent();
1126 unsigned N = RI.getNumOperands();
1127 if (F->getReturnType()->isVoidTy())
1129 "Found return instr that returns non-void in Function of void "
1130 "return type!", &RI, F->getReturnType());
1132 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1133 "Function return type does not match operand "
1134 "type of return inst!", &RI, F->getReturnType());
1136 // Check to make sure that the return value has necessary properties for
1138 visitTerminatorInst(RI);
1141 void Verifier::visitSwitchInst(SwitchInst &SI) {
1142 // Check to make sure that all of the constants in the switch instruction
1143 // have the same type as the switched-on value.
1144 Type *SwitchTy = SI.getCondition()->getType();
1145 SmallPtrSet<ConstantInt*, 32> Constants;
1146 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1147 Assert1(i.getCaseValue()->getType() == SwitchTy,
1148 "Switch constants must all be same type as switch value!", &SI);
1149 Assert2(Constants.insert(i.getCaseValue()),
1150 "Duplicate integer as switch case", &SI, i.getCaseValue());
1153 visitTerminatorInst(SI);
1156 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1157 Assert1(BI.getAddress()->getType()->isPointerTy(),
1158 "Indirectbr operand must have pointer type!", &BI);
1159 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1160 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1161 "Indirectbr destinations must all have pointer type!", &BI);
1163 visitTerminatorInst(BI);
1166 void Verifier::visitSelectInst(SelectInst &SI) {
1167 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1169 "Invalid operands for select instruction!", &SI);
1171 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1172 "Select values must have same type as select instruction!", &SI);
1173 visitInstruction(SI);
1176 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1177 /// a pass, if any exist, it's an error.
1179 void Verifier::visitUserOp1(Instruction &I) {
1180 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1183 void Verifier::visitTruncInst(TruncInst &I) {
1184 // Get the source and destination types
1185 Type *SrcTy = I.getOperand(0)->getType();
1186 Type *DestTy = I.getType();
1188 // Get the size of the types in bits, we'll need this later
1189 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1190 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1192 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1193 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1194 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1195 "trunc source and destination must both be a vector or neither", &I);
1196 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1198 visitInstruction(I);
1201 void Verifier::visitZExtInst(ZExtInst &I) {
1202 // Get the source and destination types
1203 Type *SrcTy = I.getOperand(0)->getType();
1204 Type *DestTy = I.getType();
1206 // Get the size of the types in bits, we'll need this later
1207 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1208 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1209 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1210 "zext source and destination must both be a vector or neither", &I);
1211 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1212 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1214 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1216 visitInstruction(I);
1219 void Verifier::visitSExtInst(SExtInst &I) {
1220 // Get the source and destination types
1221 Type *SrcTy = I.getOperand(0)->getType();
1222 Type *DestTy = I.getType();
1224 // Get the size of the types in bits, we'll need this later
1225 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1226 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1228 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1229 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1230 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1231 "sext source and destination must both be a vector or neither", &I);
1232 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1234 visitInstruction(I);
1237 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1238 // Get the source and destination types
1239 Type *SrcTy = I.getOperand(0)->getType();
1240 Type *DestTy = I.getType();
1241 // Get the size of the types in bits, we'll need this later
1242 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1243 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1245 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1246 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1247 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1248 "fptrunc source and destination must both be a vector or neither",&I);
1249 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1251 visitInstruction(I);
1254 void Verifier::visitFPExtInst(FPExtInst &I) {
1255 // Get the source and destination types
1256 Type *SrcTy = I.getOperand(0)->getType();
1257 Type *DestTy = I.getType();
1259 // Get the size of the types in bits, we'll need this later
1260 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1261 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1263 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1264 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1265 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1266 "fpext source and destination must both be a vector or neither", &I);
1267 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1269 visitInstruction(I);
1272 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1273 // Get the source and destination types
1274 Type *SrcTy = I.getOperand(0)->getType();
1275 Type *DestTy = I.getType();
1277 bool SrcVec = SrcTy->isVectorTy();
1278 bool DstVec = DestTy->isVectorTy();
1280 Assert1(SrcVec == DstVec,
1281 "UIToFP source and dest must both be vector or scalar", &I);
1282 Assert1(SrcTy->isIntOrIntVectorTy(),
1283 "UIToFP source must be integer or integer vector", &I);
1284 Assert1(DestTy->isFPOrFPVectorTy(),
1285 "UIToFP result must be FP or FP vector", &I);
1287 if (SrcVec && DstVec)
1288 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1289 cast<VectorType>(DestTy)->getNumElements(),
1290 "UIToFP source and dest vector length mismatch", &I);
1292 visitInstruction(I);
1295 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1296 // Get the source and destination types
1297 Type *SrcTy = I.getOperand(0)->getType();
1298 Type *DestTy = I.getType();
1300 bool SrcVec = SrcTy->isVectorTy();
1301 bool DstVec = DestTy->isVectorTy();
1303 Assert1(SrcVec == DstVec,
1304 "SIToFP source and dest must both be vector or scalar", &I);
1305 Assert1(SrcTy->isIntOrIntVectorTy(),
1306 "SIToFP source must be integer or integer vector", &I);
1307 Assert1(DestTy->isFPOrFPVectorTy(),
1308 "SIToFP result must be FP or FP vector", &I);
1310 if (SrcVec && DstVec)
1311 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1312 cast<VectorType>(DestTy)->getNumElements(),
1313 "SIToFP source and dest vector length mismatch", &I);
1315 visitInstruction(I);
1318 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1319 // Get the source and destination types
1320 Type *SrcTy = I.getOperand(0)->getType();
1321 Type *DestTy = I.getType();
1323 bool SrcVec = SrcTy->isVectorTy();
1324 bool DstVec = DestTy->isVectorTy();
1326 Assert1(SrcVec == DstVec,
1327 "FPToUI source and dest must both be vector or scalar", &I);
1328 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1330 Assert1(DestTy->isIntOrIntVectorTy(),
1331 "FPToUI result must be integer or integer vector", &I);
1333 if (SrcVec && DstVec)
1334 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1335 cast<VectorType>(DestTy)->getNumElements(),
1336 "FPToUI source and dest vector length mismatch", &I);
1338 visitInstruction(I);
1341 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1342 // Get the source and destination types
1343 Type *SrcTy = I.getOperand(0)->getType();
1344 Type *DestTy = I.getType();
1346 bool SrcVec = SrcTy->isVectorTy();
1347 bool DstVec = DestTy->isVectorTy();
1349 Assert1(SrcVec == DstVec,
1350 "FPToSI source and dest must both be vector or scalar", &I);
1351 Assert1(SrcTy->isFPOrFPVectorTy(),
1352 "FPToSI source must be FP or FP vector", &I);
1353 Assert1(DestTy->isIntOrIntVectorTy(),
1354 "FPToSI result must be integer or integer vector", &I);
1356 if (SrcVec && DstVec)
1357 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1358 cast<VectorType>(DestTy)->getNumElements(),
1359 "FPToSI source and dest vector length mismatch", &I);
1361 visitInstruction(I);
1364 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1365 // Get the source and destination types
1366 Type *SrcTy = I.getOperand(0)->getType();
1367 Type *DestTy = I.getType();
1369 Assert1(SrcTy->getScalarType()->isPointerTy(),
1370 "PtrToInt source must be pointer", &I);
1371 Assert1(DestTy->getScalarType()->isIntegerTy(),
1372 "PtrToInt result must be integral", &I);
1373 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1374 "PtrToInt type mismatch", &I);
1376 if (SrcTy->isVectorTy()) {
1377 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1378 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1379 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1380 "PtrToInt Vector width mismatch", &I);
1383 visitInstruction(I);
1386 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1387 // Get the source and destination types
1388 Type *SrcTy = I.getOperand(0)->getType();
1389 Type *DestTy = I.getType();
1391 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1392 "IntToPtr source must be an integral", &I);
1393 Assert1(DestTy->getScalarType()->isPointerTy(),
1394 "IntToPtr result must be a pointer",&I);
1395 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1396 "IntToPtr type mismatch", &I);
1397 if (SrcTy->isVectorTy()) {
1398 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1399 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1400 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1401 "IntToPtr Vector width mismatch", &I);
1403 visitInstruction(I);
1406 void Verifier::visitBitCastInst(BitCastInst &I) {
1407 Type *SrcTy = I.getOperand(0)->getType();
1408 Type *DestTy = I.getType();
1409 VerifyBitcastType(&I, DestTy, SrcTy);
1410 visitInstruction(I);
1413 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1414 Type *SrcTy = I.getOperand(0)->getType();
1415 Type *DestTy = I.getType();
1417 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1418 "AddrSpaceCast source must be a pointer", &I);
1419 Assert1(DestTy->isPtrOrPtrVectorTy(),
1420 "AddrSpaceCast result must be a pointer", &I);
1421 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1422 "AddrSpaceCast must be between different address spaces", &I);
1423 if (SrcTy->isVectorTy())
1424 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1425 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1426 visitInstruction(I);
1429 /// visitPHINode - Ensure that a PHI node is well formed.
1431 void Verifier::visitPHINode(PHINode &PN) {
1432 // Ensure that the PHI nodes are all grouped together at the top of the block.
1433 // This can be tested by checking whether the instruction before this is
1434 // either nonexistent (because this is begin()) or is a PHI node. If not,
1435 // then there is some other instruction before a PHI.
1436 Assert2(&PN == &PN.getParent()->front() ||
1437 isa<PHINode>(--BasicBlock::iterator(&PN)),
1438 "PHI nodes not grouped at top of basic block!",
1439 &PN, PN.getParent());
1441 // Check that all of the values of the PHI node have the same type as the
1442 // result, and that the incoming blocks are really basic blocks.
1443 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1444 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1445 "PHI node operands are not the same type as the result!", &PN);
1448 // All other PHI node constraints are checked in the visitBasicBlock method.
1450 visitInstruction(PN);
1453 void Verifier::VerifyCallSite(CallSite CS) {
1454 Instruction *I = CS.getInstruction();
1456 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1457 "Called function must be a pointer!", I);
1458 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1460 Assert1(FPTy->getElementType()->isFunctionTy(),
1461 "Called function is not pointer to function type!", I);
1462 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1464 // Verify that the correct number of arguments are being passed
1465 if (FTy->isVarArg())
1466 Assert1(CS.arg_size() >= FTy->getNumParams(),
1467 "Called function requires more parameters than were provided!",I);
1469 Assert1(CS.arg_size() == FTy->getNumParams(),
1470 "Incorrect number of arguments passed to called function!", I);
1472 // Verify that all arguments to the call match the function type.
1473 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1474 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1475 "Call parameter type does not match function signature!",
1476 CS.getArgument(i), FTy->getParamType(i), I);
1478 AttributeSet Attrs = CS.getAttributes();
1480 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1481 "Attribute after last parameter!", I);
1483 // Verify call attributes.
1484 VerifyFunctionAttrs(FTy, Attrs, I);
1486 if (FTy->isVarArg()) {
1487 // FIXME? is 'nest' even legal here?
1488 bool SawNest = false;
1489 bool SawReturned = false;
1491 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1492 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1494 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1498 // Check attributes on the varargs part.
1499 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1500 Type *Ty = CS.getArgument(Idx-1)->getType();
1501 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1503 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1504 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1508 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1509 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1511 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1512 "Incompatible argument and return types for 'returned' "
1517 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1518 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1520 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1521 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1526 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1527 if (CS.getCalledFunction() == 0 ||
1528 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1529 for (FunctionType::param_iterator PI = FTy->param_begin(),
1530 PE = FTy->param_end(); PI != PE; ++PI)
1531 Assert1(!(*PI)->isMetadataTy(),
1532 "Function has metadata parameter but isn't an intrinsic", I);
1535 visitInstruction(*I);
1538 void Verifier::visitCallInst(CallInst &CI) {
1539 VerifyCallSite(&CI);
1541 if (Function *F = CI.getCalledFunction())
1542 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1543 visitIntrinsicFunctionCall(ID, CI);
1546 void Verifier::visitInvokeInst(InvokeInst &II) {
1547 VerifyCallSite(&II);
1549 // Verify that there is a landingpad instruction as the first non-PHI
1550 // instruction of the 'unwind' destination.
1551 Assert1(II.getUnwindDest()->isLandingPad(),
1552 "The unwind destination does not have a landingpad instruction!",&II);
1554 visitTerminatorInst(II);
1557 /// visitBinaryOperator - Check that both arguments to the binary operator are
1558 /// of the same type!
1560 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1561 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1562 "Both operands to a binary operator are not of the same type!", &B);
1564 switch (B.getOpcode()) {
1565 // Check that integer arithmetic operators are only used with
1566 // integral operands.
1567 case Instruction::Add:
1568 case Instruction::Sub:
1569 case Instruction::Mul:
1570 case Instruction::SDiv:
1571 case Instruction::UDiv:
1572 case Instruction::SRem:
1573 case Instruction::URem:
1574 Assert1(B.getType()->isIntOrIntVectorTy(),
1575 "Integer arithmetic operators only work with integral types!", &B);
1576 Assert1(B.getType() == B.getOperand(0)->getType(),
1577 "Integer arithmetic operators must have same type "
1578 "for operands and result!", &B);
1580 // Check that floating-point arithmetic operators are only used with
1581 // floating-point operands.
1582 case Instruction::FAdd:
1583 case Instruction::FSub:
1584 case Instruction::FMul:
1585 case Instruction::FDiv:
1586 case Instruction::FRem:
1587 Assert1(B.getType()->isFPOrFPVectorTy(),
1588 "Floating-point arithmetic operators only work with "
1589 "floating-point types!", &B);
1590 Assert1(B.getType() == B.getOperand(0)->getType(),
1591 "Floating-point arithmetic operators must have same type "
1592 "for operands and result!", &B);
1594 // Check that logical operators are only used with integral operands.
1595 case Instruction::And:
1596 case Instruction::Or:
1597 case Instruction::Xor:
1598 Assert1(B.getType()->isIntOrIntVectorTy(),
1599 "Logical operators only work with integral types!", &B);
1600 Assert1(B.getType() == B.getOperand(0)->getType(),
1601 "Logical operators must have same type for operands and result!",
1604 case Instruction::Shl:
1605 case Instruction::LShr:
1606 case Instruction::AShr:
1607 Assert1(B.getType()->isIntOrIntVectorTy(),
1608 "Shifts only work with integral types!", &B);
1609 Assert1(B.getType() == B.getOperand(0)->getType(),
1610 "Shift return type must be same as operands!", &B);
1613 llvm_unreachable("Unknown BinaryOperator opcode!");
1616 visitInstruction(B);
1619 void Verifier::visitICmpInst(ICmpInst &IC) {
1620 // Check that the operands are the same type
1621 Type *Op0Ty = IC.getOperand(0)->getType();
1622 Type *Op1Ty = IC.getOperand(1)->getType();
1623 Assert1(Op0Ty == Op1Ty,
1624 "Both operands to ICmp instruction are not of the same type!", &IC);
1625 // Check that the operands are the right type
1626 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1627 "Invalid operand types for ICmp instruction", &IC);
1628 // Check that the predicate is valid.
1629 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1630 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1631 "Invalid predicate in ICmp instruction!", &IC);
1633 visitInstruction(IC);
1636 void Verifier::visitFCmpInst(FCmpInst &FC) {
1637 // Check that the operands are the same type
1638 Type *Op0Ty = FC.getOperand(0)->getType();
1639 Type *Op1Ty = FC.getOperand(1)->getType();
1640 Assert1(Op0Ty == Op1Ty,
1641 "Both operands to FCmp instruction are not of the same type!", &FC);
1642 // Check that the operands are the right type
1643 Assert1(Op0Ty->isFPOrFPVectorTy(),
1644 "Invalid operand types for FCmp instruction", &FC);
1645 // Check that the predicate is valid.
1646 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1647 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1648 "Invalid predicate in FCmp instruction!", &FC);
1650 visitInstruction(FC);
1653 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1654 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1656 "Invalid extractelement operands!", &EI);
1657 visitInstruction(EI);
1660 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1661 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1664 "Invalid insertelement operands!", &IE);
1665 visitInstruction(IE);
1668 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1669 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1671 "Invalid shufflevector operands!", &SV);
1672 visitInstruction(SV);
1675 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1676 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1678 Assert1(isa<PointerType>(TargetTy),
1679 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1680 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1681 "GEP into unsized type!", &GEP);
1682 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1683 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1686 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1688 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1689 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1691 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1692 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1693 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1695 if (GEP.getPointerOperandType()->isVectorTy()) {
1696 // Additional checks for vector GEPs.
1697 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1698 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1699 "Vector GEP result width doesn't match operand's", &GEP);
1700 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1701 Type *IndexTy = Idxs[i]->getType();
1702 Assert1(IndexTy->isVectorTy(),
1703 "Vector GEP must have vector indices!", &GEP);
1704 unsigned IndexWidth = IndexTy->getVectorNumElements();
1705 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1708 visitInstruction(GEP);
1711 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1712 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1715 void Verifier::visitLoadInst(LoadInst &LI) {
1716 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1717 Assert1(PTy, "Load operand must be a pointer.", &LI);
1718 Type *ElTy = PTy->getElementType();
1719 Assert2(ElTy == LI.getType(),
1720 "Load result type does not match pointer operand type!", &LI, ElTy);
1721 if (LI.isAtomic()) {
1722 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1723 "Load cannot have Release ordering", &LI);
1724 Assert1(LI.getAlignment() != 0,
1725 "Atomic load must specify explicit alignment", &LI);
1726 if (!ElTy->isPointerTy()) {
1727 Assert2(ElTy->isIntegerTy(),
1728 "atomic store operand must have integer type!",
1730 unsigned Size = ElTy->getPrimitiveSizeInBits();
1731 Assert2(Size >= 8 && !(Size & (Size - 1)),
1732 "atomic store operand must be power-of-two byte-sized integer",
1736 Assert1(LI.getSynchScope() == CrossThread,
1737 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1740 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1741 unsigned NumOperands = Range->getNumOperands();
1742 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1743 unsigned NumRanges = NumOperands / 2;
1744 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1746 ConstantRange LastRange(1); // Dummy initial value
1747 for (unsigned i = 0; i < NumRanges; ++i) {
1748 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1749 Assert1(Low, "The lower limit must be an integer!", Low);
1750 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1751 Assert1(High, "The upper limit must be an integer!", High);
1752 Assert1(High->getType() == Low->getType() &&
1753 High->getType() == ElTy, "Range types must match load type!",
1756 APInt HighV = High->getValue();
1757 APInt LowV = Low->getValue();
1758 ConstantRange CurRange(LowV, HighV);
1759 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1760 "Range must not be empty!", Range);
1762 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1763 "Intervals are overlapping", Range);
1764 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1766 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1769 LastRange = ConstantRange(LowV, HighV);
1771 if (NumRanges > 2) {
1773 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1775 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1776 ConstantRange FirstRange(FirstLow, FirstHigh);
1777 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1778 "Intervals are overlapping", Range);
1779 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1786 visitInstruction(LI);
1789 void Verifier::visitStoreInst(StoreInst &SI) {
1790 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1791 Assert1(PTy, "Store operand must be a pointer.", &SI);
1792 Type *ElTy = PTy->getElementType();
1793 Assert2(ElTy == SI.getOperand(0)->getType(),
1794 "Stored value type does not match pointer operand type!",
1796 if (SI.isAtomic()) {
1797 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1798 "Store cannot have Acquire ordering", &SI);
1799 Assert1(SI.getAlignment() != 0,
1800 "Atomic store must specify explicit alignment", &SI);
1801 if (!ElTy->isPointerTy()) {
1802 Assert2(ElTy->isIntegerTy(),
1803 "atomic store operand must have integer type!",
1805 unsigned Size = ElTy->getPrimitiveSizeInBits();
1806 Assert2(Size >= 8 && !(Size & (Size - 1)),
1807 "atomic store operand must be power-of-two byte-sized integer",
1811 Assert1(SI.getSynchScope() == CrossThread,
1812 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1814 visitInstruction(SI);
1817 void Verifier::visitAllocaInst(AllocaInst &AI) {
1818 SmallPtrSet<const Type*, 4> Visited;
1819 PointerType *PTy = AI.getType();
1820 Assert1(PTy->getAddressSpace() == 0,
1821 "Allocation instruction pointer not in the generic address space!",
1823 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
1825 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
1826 "Alloca array size must have integer type", &AI);
1828 visitInstruction(AI);
1831 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
1832 Assert1(CXI.getOrdering() != NotAtomic,
1833 "cmpxchg instructions must be atomic.", &CXI);
1834 Assert1(CXI.getOrdering() != Unordered,
1835 "cmpxchg instructions cannot be unordered.", &CXI);
1836 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
1837 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
1838 Type *ElTy = PTy->getElementType();
1839 Assert2(ElTy->isIntegerTy(),
1840 "cmpxchg operand must have integer type!",
1842 unsigned Size = ElTy->getPrimitiveSizeInBits();
1843 Assert2(Size >= 8 && !(Size & (Size - 1)),
1844 "cmpxchg operand must be power-of-two byte-sized integer",
1846 Assert2(ElTy == CXI.getOperand(1)->getType(),
1847 "Expected value type does not match pointer operand type!",
1849 Assert2(ElTy == CXI.getOperand(2)->getType(),
1850 "Stored value type does not match pointer operand type!",
1852 visitInstruction(CXI);
1855 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
1856 Assert1(RMWI.getOrdering() != NotAtomic,
1857 "atomicrmw instructions must be atomic.", &RMWI);
1858 Assert1(RMWI.getOrdering() != Unordered,
1859 "atomicrmw instructions cannot be unordered.", &RMWI);
1860 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
1861 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
1862 Type *ElTy = PTy->getElementType();
1863 Assert2(ElTy->isIntegerTy(),
1864 "atomicrmw operand must have integer type!",
1866 unsigned Size = ElTy->getPrimitiveSizeInBits();
1867 Assert2(Size >= 8 && !(Size & (Size - 1)),
1868 "atomicrmw operand must be power-of-two byte-sized integer",
1870 Assert2(ElTy == RMWI.getOperand(1)->getType(),
1871 "Argument value type does not match pointer operand type!",
1873 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
1874 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
1875 "Invalid binary operation!", &RMWI);
1876 visitInstruction(RMWI);
1879 void Verifier::visitFenceInst(FenceInst &FI) {
1880 const AtomicOrdering Ordering = FI.getOrdering();
1881 Assert1(Ordering == Acquire || Ordering == Release ||
1882 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
1883 "fence instructions may only have "
1884 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
1885 visitInstruction(FI);
1888 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1889 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1890 EVI.getIndices()) ==
1892 "Invalid ExtractValueInst operands!", &EVI);
1894 visitInstruction(EVI);
1897 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1898 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1899 IVI.getIndices()) ==
1900 IVI.getOperand(1)->getType(),
1901 "Invalid InsertValueInst operands!", &IVI);
1903 visitInstruction(IVI);
1906 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
1907 BasicBlock *BB = LPI.getParent();
1909 // The landingpad instruction is ill-formed if it doesn't have any clauses and
1911 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
1912 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
1914 // The landingpad instruction defines its parent as a landing pad block. The
1915 // landing pad block may be branched to only by the unwind edge of an invoke.
1916 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
1917 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
1918 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
1919 "Block containing LandingPadInst must be jumped to "
1920 "only by the unwind edge of an invoke.", &LPI);
1923 // The landingpad instruction must be the first non-PHI instruction in the
1925 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
1926 "LandingPadInst not the first non-PHI instruction in the block.",
1929 // The personality functions for all landingpad instructions within the same
1930 // function should match.
1932 Assert1(LPI.getPersonalityFn() == PersonalityFn,
1933 "Personality function doesn't match others in function", &LPI);
1934 PersonalityFn = LPI.getPersonalityFn();
1936 // All operands must be constants.
1937 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
1939 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
1940 Value *Clause = LPI.getClause(i);
1941 Assert1(isa<Constant>(Clause), "Clause is not constant!", &LPI);
1942 if (LPI.isCatch(i)) {
1943 Assert1(isa<PointerType>(Clause->getType()),
1944 "Catch operand does not have pointer type!", &LPI);
1946 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
1947 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
1948 "Filter operand is not an array of constants!", &LPI);
1952 visitInstruction(LPI);
1955 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
1956 Instruction *Op = cast<Instruction>(I.getOperand(i));
1957 // If the we have an invalid invoke, don't try to compute the dominance.
1958 // We already reject it in the invoke specific checks and the dominance
1959 // computation doesn't handle multiple edges.
1960 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1961 if (II->getNormalDest() == II->getUnwindDest())
1965 const Use &U = I.getOperandUse(i);
1966 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
1967 "Instruction does not dominate all uses!", Op, &I);
1970 /// verifyInstruction - Verify that an instruction is well formed.
1972 void Verifier::visitInstruction(Instruction &I) {
1973 BasicBlock *BB = I.getParent();
1974 Assert1(BB, "Instruction not embedded in basic block!", &I);
1976 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1977 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1979 Assert1(*UI != (User*)&I || !DT.isReachableFromEntry(BB),
1980 "Only PHI nodes may reference their own value!", &I);
1983 // Check that void typed values don't have names
1984 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1985 "Instruction has a name, but provides a void value!", &I);
1987 // Check that the return value of the instruction is either void or a legal
1989 Assert1(I.getType()->isVoidTy() ||
1990 I.getType()->isFirstClassType(),
1991 "Instruction returns a non-scalar type!", &I);
1993 // Check that the instruction doesn't produce metadata. Calls are already
1994 // checked against the callee type.
1995 Assert1(!I.getType()->isMetadataTy() ||
1996 isa<CallInst>(I) || isa<InvokeInst>(I),
1997 "Invalid use of metadata!", &I);
1999 // Check that all uses of the instruction, if they are instructions
2000 // themselves, actually have parent basic blocks. If the use is not an
2001 // instruction, it is an error!
2002 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
2004 if (Instruction *Used = dyn_cast<Instruction>(*UI))
2005 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
2006 " embedded in a basic block!", &I, Used);
2008 CheckFailed("Use of instruction is not an instruction!", *UI);
2013 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2014 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
2016 // Check to make sure that only first-class-values are operands to
2018 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2019 Assert1(0, "Instruction operands must be first-class values!", &I);
2022 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2023 // Check to make sure that the "address of" an intrinsic function is never
2025 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
2026 "Cannot take the address of an intrinsic!", &I);
2027 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2028 F->getIntrinsicID() == Intrinsic::donothing,
2029 "Cannot invoke an intrinsinc other than donothing", &I);
2030 Assert1(F->getParent() == M, "Referencing function in another module!",
2032 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2033 Assert1(OpBB->getParent() == BB->getParent(),
2034 "Referring to a basic block in another function!", &I);
2035 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2036 Assert1(OpArg->getParent() == BB->getParent(),
2037 "Referring to an argument in another function!", &I);
2038 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2039 Assert1(GV->getParent() == M, "Referencing global in another module!",
2041 } else if (isa<Instruction>(I.getOperand(i))) {
2042 verifyDominatesUse(I, i);
2043 } else if (isa<InlineAsm>(I.getOperand(i))) {
2044 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2045 (i + 3 == e && isa<InvokeInst>(I)),
2046 "Cannot take the address of an inline asm!", &I);
2047 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2048 if (CE->getType()->isPtrOrPtrVectorTy()) {
2049 // If we have a ConstantExpr pointer, we need to see if it came from an
2050 // illegal bitcast (inttoptr <constant int> )
2051 SmallVector<const ConstantExpr *, 4> Stack;
2052 SmallPtrSet<const ConstantExpr *, 4> Visited;
2053 Stack.push_back(CE);
2055 while (!Stack.empty()) {
2056 const ConstantExpr *V = Stack.pop_back_val();
2057 if (!Visited.insert(V))
2060 VerifyConstantExprBitcastType(V);
2062 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2063 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2064 Stack.push_back(Op);
2071 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2072 Assert1(I.getType()->isFPOrFPVectorTy(),
2073 "fpmath requires a floating point result!", &I);
2074 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2075 Value *Op0 = MD->getOperand(0);
2076 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
2077 APFloat Accuracy = CFP0->getValueAPF();
2078 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2079 "fpmath accuracy not a positive number!", &I);
2081 Assert1(false, "invalid fpmath accuracy!", &I);
2085 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
2086 Assert1(!MD || isa<LoadInst>(I), "Ranges are only for loads!", &I);
2088 if (!DisableDebugInfoVerifier) {
2089 MD = I.getMetadata(LLVMContext::MD_dbg);
2090 Finder.processLocation(*M, DILocation(MD));
2093 InstsInThisBlock.insert(&I);
2096 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2097 /// intrinsic argument or return value) matches the type constraints specified
2098 /// by the .td file (e.g. an "any integer" argument really is an integer).
2100 /// This return true on error but does not print a message.
2101 bool Verifier::VerifyIntrinsicType(Type *Ty,
2102 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2103 SmallVectorImpl<Type*> &ArgTys) {
2104 using namespace Intrinsic;
2106 // If we ran out of descriptors, there are too many arguments.
2107 if (Infos.empty()) return true;
2108 IITDescriptor D = Infos.front();
2109 Infos = Infos.slice(1);
2112 case IITDescriptor::Void: return !Ty->isVoidTy();
2113 case IITDescriptor::VarArg: return true;
2114 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2115 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2116 case IITDescriptor::Half: return !Ty->isHalfTy();
2117 case IITDescriptor::Float: return !Ty->isFloatTy();
2118 case IITDescriptor::Double: return !Ty->isDoubleTy();
2119 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2120 case IITDescriptor::Vector: {
2121 VectorType *VT = dyn_cast<VectorType>(Ty);
2122 return VT == 0 || VT->getNumElements() != D.Vector_Width ||
2123 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2125 case IITDescriptor::Pointer: {
2126 PointerType *PT = dyn_cast<PointerType>(Ty);
2127 return PT == 0 || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2128 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2131 case IITDescriptor::Struct: {
2132 StructType *ST = dyn_cast<StructType>(Ty);
2133 if (ST == 0 || ST->getNumElements() != D.Struct_NumElements)
2136 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2137 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2142 case IITDescriptor::Argument:
2143 // Two cases here - If this is the second occurrence of an argument, verify
2144 // that the later instance matches the previous instance.
2145 if (D.getArgumentNumber() < ArgTys.size())
2146 return Ty != ArgTys[D.getArgumentNumber()];
2148 // Otherwise, if this is the first instance of an argument, record it and
2149 // verify the "Any" kind.
2150 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2151 ArgTys.push_back(Ty);
2153 switch (D.getArgumentKind()) {
2154 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2155 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2156 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2157 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2159 llvm_unreachable("all argument kinds not covered");
2161 case IITDescriptor::ExtendVecArgument:
2162 // This may only be used when referring to a previous vector argument.
2163 return D.getArgumentNumber() >= ArgTys.size() ||
2164 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2165 VectorType::getExtendedElementVectorType(
2166 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2168 case IITDescriptor::TruncVecArgument:
2169 // This may only be used when referring to a previous vector argument.
2170 return D.getArgumentNumber() >= ArgTys.size() ||
2171 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2172 VectorType::getTruncatedElementVectorType(
2173 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2175 llvm_unreachable("unhandled");
2178 /// \brief Verify if the intrinsic has variable arguments.
2179 /// This method is intended to be called after all the fixed arguments have been
2182 /// This method returns true on error and does not print an error message.
2184 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2185 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2186 using namespace Intrinsic;
2188 // If there are no descriptors left, then it can't be a vararg.
2190 return isVarArg ? true : false;
2192 // There should be only one descriptor remaining at this point.
2193 if (Infos.size() != 1)
2196 // Check and verify the descriptor.
2197 IITDescriptor D = Infos.front();
2198 Infos = Infos.slice(1);
2199 if (D.Kind == IITDescriptor::VarArg)
2200 return isVarArg ? false : true;
2205 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2207 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2208 Function *IF = CI.getCalledFunction();
2209 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2212 // Verify that the intrinsic prototype lines up with what the .td files
2214 FunctionType *IFTy = IF->getFunctionType();
2215 bool IsVarArg = IFTy->isVarArg();
2217 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2218 getIntrinsicInfoTableEntries(ID, Table);
2219 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2221 SmallVector<Type *, 4> ArgTys;
2222 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2223 "Intrinsic has incorrect return type!", IF);
2224 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2225 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2226 "Intrinsic has incorrect argument type!", IF);
2228 // Verify if the intrinsic call matches the vararg property.
2230 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2231 "Intrinsic was not defined with variable arguments!", IF);
2233 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2234 "Callsite was not defined with variable arguments!", IF);
2236 // All descriptors should be absorbed by now.
2237 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2239 // Now that we have the intrinsic ID and the actual argument types (and we
2240 // know they are legal for the intrinsic!) get the intrinsic name through the
2241 // usual means. This allows us to verify the mangling of argument types into
2243 Assert1(Intrinsic::getName(ID, ArgTys) == IF->getName(),
2244 "Intrinsic name not mangled correctly for type arguments!", IF);
2246 // If the intrinsic takes MDNode arguments, verify that they are either global
2247 // or are local to *this* function.
2248 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2249 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
2250 visitMDNode(*MD, CI.getParent()->getParent());
2255 case Intrinsic::ctlz: // llvm.ctlz
2256 case Intrinsic::cttz: // llvm.cttz
2257 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2258 "is_zero_undef argument of bit counting intrinsics must be a "
2259 "constant int", &CI);
2261 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2262 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2263 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2264 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
2265 Assert1(MD->getNumOperands() == 1,
2266 "invalid llvm.dbg.declare intrinsic call 2", &CI);
2267 if (!DisableDebugInfoVerifier)
2268 Finder.processDeclare(*M, cast<DbgDeclareInst>(&CI));
2270 case Intrinsic::dbg_value: { //llvm.dbg.value
2271 if (!DisableDebugInfoVerifier) {
2272 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2273 "invalid llvm.dbg.value intrinsic call 1", &CI);
2274 Finder.processValue(*M, cast<DbgValueInst>(&CI));
2278 case Intrinsic::memcpy:
2279 case Intrinsic::memmove:
2280 case Intrinsic::memset:
2281 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2282 "alignment argument of memory intrinsics must be a constant int",
2284 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2285 "isvolatile argument of memory intrinsics must be a constant int",
2288 case Intrinsic::gcroot:
2289 case Intrinsic::gcwrite:
2290 case Intrinsic::gcread:
2291 if (ID == Intrinsic::gcroot) {
2293 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2294 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2295 Assert1(isa<Constant>(CI.getArgOperand(1)),
2296 "llvm.gcroot parameter #2 must be a constant.", &CI);
2297 if (!AI->getType()->getElementType()->isPointerTy()) {
2298 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2299 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2300 "or argument #2 must be a non-null constant.", &CI);
2304 Assert1(CI.getParent()->getParent()->hasGC(),
2305 "Enclosing function does not use GC.", &CI);
2307 case Intrinsic::init_trampoline:
2308 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2309 "llvm.init_trampoline parameter #2 must resolve to a function.",
2312 case Intrinsic::prefetch:
2313 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2314 isa<ConstantInt>(CI.getArgOperand(2)) &&
2315 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2316 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2317 "invalid arguments to llvm.prefetch",
2320 case Intrinsic::stackprotector:
2321 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2322 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2325 case Intrinsic::lifetime_start:
2326 case Intrinsic::lifetime_end:
2327 case Intrinsic::invariant_start:
2328 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2329 "size argument of memory use markers must be a constant integer",
2332 case Intrinsic::invariant_end:
2333 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2334 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2339 void Verifier::verifyDebugInfo() {
2340 // Verify Debug Info.
2341 if (!DisableDebugInfoVerifier) {
2342 for (DebugInfoFinder::iterator I = Finder.compile_unit_begin(),
2343 E = Finder.compile_unit_end(); I != E; ++I)
2344 Assert1(DICompileUnit(*I).Verify(), "DICompileUnit does not Verify!", *I);
2345 for (DebugInfoFinder::iterator I = Finder.subprogram_begin(),
2346 E = Finder.subprogram_end(); I != E; ++I)
2347 Assert1(DISubprogram(*I).Verify(), "DISubprogram does not Verify!", *I);
2348 for (DebugInfoFinder::iterator I = Finder.global_variable_begin(),
2349 E = Finder.global_variable_end(); I != E; ++I)
2350 Assert1(DIGlobalVariable(*I).Verify(),
2351 "DIGlobalVariable does not Verify!", *I);
2352 for (DebugInfoFinder::iterator I = Finder.type_begin(),
2353 E = Finder.type_end(); I != E; ++I)
2354 Assert1(DIType(*I).Verify(), "DIType does not Verify!", *I);
2355 for (DebugInfoFinder::iterator I = Finder.scope_begin(),
2356 E = Finder.scope_end(); I != E; ++I)
2357 Assert1(DIScope(*I).Verify(), "DIScope does not Verify!", *I);
2361 //===----------------------------------------------------------------------===//
2362 // Implement the public interfaces to this file...
2363 //===----------------------------------------------------------------------===//
2365 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
2366 Function &F = const_cast<Function &>(f);
2367 assert(!F.isDeclaration() && "Cannot verify external functions");
2369 raw_null_ostream NullStr;
2370 Verifier V(OS ? *OS : NullStr);
2372 // Note that this function's return value is inverted from what you would
2373 // expect of a function called "verify".
2374 return !V.verify(F);
2377 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
2378 raw_null_ostream NullStr;
2379 Verifier V(OS ? *OS : NullStr);
2381 bool Broken = false;
2382 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
2383 if (!I->isDeclaration())
2384 Broken |= !V.verify(*I);
2386 // Note that this function's return value is inverted from what you would
2387 // expect of a function called "verify".
2388 return !V.verify(M) || Broken;
2392 struct VerifierLegacyPass : public FunctionPass {
2398 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
2399 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2401 explicit VerifierLegacyPass(bool FatalErrors)
2402 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2403 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2406 bool runOnFunction(Function &F) {
2407 if (!V.verify(F) && FatalErrors)
2408 report_fatal_error("Broken function found, compilation aborted!");
2413 bool doFinalization(Module &M) {
2414 if (!V.verify(M) && FatalErrors)
2415 report_fatal_error("Broken module found, compilation aborted!");
2420 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
2421 AU.setPreservesAll();
2426 char VerifierLegacyPass::ID = 0;
2427 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
2429 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
2430 return new VerifierLegacyPass(FatalErrors);
2433 PreservedAnalyses VerifierPass::run(Module *M) {
2434 if (verifyModule(*M, &dbgs()) && FatalErrors)
2435 report_fatal_error("Broken module found, compilation aborted!");
2437 return PreservedAnalyses::all();
2440 PreservedAnalyses VerifierPass::run(Function *F) {
2441 if (verifyFunction(*F, &dbgs()) && FatalErrors)
2442 report_fatal_error("Broken function found, compilation aborted!");
2444 return PreservedAnalyses::all();