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/IR/CFG.h"
55 #include "llvm/IR/CallSite.h"
56 #include "llvm/IR/CallingConv.h"
57 #include "llvm/IR/ConstantRange.h"
58 #include "llvm/IR/Constants.h"
59 #include "llvm/IR/DataLayout.h"
60 #include "llvm/IR/DebugInfo.h"
61 #include "llvm/IR/DerivedTypes.h"
62 #include "llvm/IR/Dominators.h"
63 #include "llvm/IR/InlineAsm.h"
64 #include "llvm/IR/InstVisitor.h"
65 #include "llvm/IR/IntrinsicInst.h"
66 #include "llvm/IR/LLVMContext.h"
67 #include "llvm/IR/Metadata.h"
68 #include "llvm/IR/Module.h"
69 #include "llvm/IR/PassManager.h"
70 #include "llvm/Pass.h"
71 #include "llvm/Support/CommandLine.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> VerifyDebugInfo("verify-debug-info", cl::init(false));
82 class Verifier : public InstVisitor<Verifier> {
83 friend class InstVisitor<Verifier>;
91 /// \brief When verifying a basic block, keep track of all of the
92 /// instructions we have seen so far.
94 /// This allows us to do efficient dominance checks for the case when an
95 /// instruction has an operand that is an instruction in the same block.
96 SmallPtrSet<Instruction *, 16> InstsInThisBlock;
98 /// \brief Keep track of the metadata nodes that have been checked already.
99 SmallPtrSet<MDNode *, 32> MDNodes;
101 /// \brief The personality function referenced by the LandingPadInsts.
102 /// All LandingPadInsts within the same function must use the same
103 /// personality function.
104 const Value *PersonalityFn;
106 /// \brief Finder keeps track of all debug info MDNodes in a Module.
107 DebugInfoFinder Finder;
109 /// \brief Track the brokenness of the module while recursively visiting.
113 explicit Verifier(raw_ostream &OS = dbgs())
114 : OS(OS), M(0), Context(0), DL(0), PersonalityFn(0), Broken(false) {}
116 bool verify(const Function &F) {
118 Context = &M->getContext();
120 // First ensure the function is well-enough formed to compute dominance
123 OS << "Function '" << F.getName()
124 << "' does not contain an entry block!\n";
127 for (Function::const_iterator I = F.begin(), E = F.end(); I != E; ++I) {
128 if (I->empty() || !I->back().isTerminator()) {
129 OS << "Basic Block in function '" << F.getName()
130 << "' does not have terminator!\n";
131 I->printAsOperand(OS, true);
137 // Now directly compute a dominance tree. We don't rely on the pass
138 // manager to provide this as it isolates us from a potentially
139 // out-of-date dominator tree and makes it significantly more complex to
140 // run this code outside of a pass manager.
141 // FIXME: It's really gross that we have to cast away constness here.
142 DT.recalculate(const_cast<Function &>(F));
146 // FIXME: We strip const here because the inst visitor strips const.
147 visit(const_cast<Function &>(F));
148 InstsInThisBlock.clear();
152 // Verify Debug Info.
158 bool verify(const Module &M) {
160 Context = &M.getContext();
164 // Scan through, checking all of the external function's linkage now...
165 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I) {
166 visitGlobalValue(*I);
168 // Check to make sure function prototypes are okay.
169 if (I->isDeclaration())
173 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
175 visitGlobalVariable(*I);
177 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
179 visitGlobalAlias(*I);
181 for (Module::const_named_metadata_iterator I = M.named_metadata_begin(),
182 E = M.named_metadata_end();
184 visitNamedMDNode(*I);
187 visitModuleIdents(M);
189 if (VerifyDebugInfo) {
191 Finder.processModule(M);
192 // Verify Debug Info.
200 // Verification methods...
201 void visitGlobalValue(const GlobalValue &GV);
202 void visitGlobalVariable(const GlobalVariable &GV);
203 void visitGlobalAlias(const GlobalAlias &GA);
204 void visitNamedMDNode(const NamedMDNode &NMD);
205 void visitMDNode(MDNode &MD, Function *F);
206 void visitModuleIdents(const Module &M);
207 void visitModuleFlags(const Module &M);
208 void visitModuleFlag(const MDNode *Op,
209 DenseMap<const MDString *, const MDNode *> &SeenIDs,
210 SmallVectorImpl<const MDNode *> &Requirements);
211 void visitFunction(const Function &F);
212 void visitBasicBlock(BasicBlock &BB);
214 // InstVisitor overrides...
215 using InstVisitor<Verifier>::visit;
216 void visit(Instruction &I);
218 void visitTruncInst(TruncInst &I);
219 void visitZExtInst(ZExtInst &I);
220 void visitSExtInst(SExtInst &I);
221 void visitFPTruncInst(FPTruncInst &I);
222 void visitFPExtInst(FPExtInst &I);
223 void visitFPToUIInst(FPToUIInst &I);
224 void visitFPToSIInst(FPToSIInst &I);
225 void visitUIToFPInst(UIToFPInst &I);
226 void visitSIToFPInst(SIToFPInst &I);
227 void visitIntToPtrInst(IntToPtrInst &I);
228 void visitPtrToIntInst(PtrToIntInst &I);
229 void visitBitCastInst(BitCastInst &I);
230 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
231 void visitPHINode(PHINode &PN);
232 void visitBinaryOperator(BinaryOperator &B);
233 void visitICmpInst(ICmpInst &IC);
234 void visitFCmpInst(FCmpInst &FC);
235 void visitExtractElementInst(ExtractElementInst &EI);
236 void visitInsertElementInst(InsertElementInst &EI);
237 void visitShuffleVectorInst(ShuffleVectorInst &EI);
238 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
239 void visitCallInst(CallInst &CI);
240 void visitInvokeInst(InvokeInst &II);
241 void visitGetElementPtrInst(GetElementPtrInst &GEP);
242 void visitLoadInst(LoadInst &LI);
243 void visitStoreInst(StoreInst &SI);
244 void verifyDominatesUse(Instruction &I, unsigned i);
245 void visitInstruction(Instruction &I);
246 void visitTerminatorInst(TerminatorInst &I);
247 void visitBranchInst(BranchInst &BI);
248 void visitReturnInst(ReturnInst &RI);
249 void visitSwitchInst(SwitchInst &SI);
250 void visitIndirectBrInst(IndirectBrInst &BI);
251 void visitSelectInst(SelectInst &SI);
252 void visitUserOp1(Instruction &I);
253 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
254 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
255 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
256 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
257 void visitFenceInst(FenceInst &FI);
258 void visitAllocaInst(AllocaInst &AI);
259 void visitExtractValueInst(ExtractValueInst &EVI);
260 void visitInsertValueInst(InsertValueInst &IVI);
261 void visitLandingPadInst(LandingPadInst &LPI);
263 void VerifyCallSite(CallSite CS);
264 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
265 unsigned ArgNo, std::string &Suffix);
266 bool VerifyIntrinsicType(Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
267 SmallVectorImpl<Type *> &ArgTys);
268 bool VerifyIntrinsicIsVarArg(bool isVarArg,
269 ArrayRef<Intrinsic::IITDescriptor> &Infos);
270 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
271 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
273 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
274 bool isReturnValue, const Value *V);
275 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
278 void VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy);
279 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
281 void verifyDebugInfo();
283 void WriteValue(const Value *V) {
286 if (isa<Instruction>(V)) {
289 V->printAsOperand(OS, true, M);
294 void WriteType(Type *T) {
300 // CheckFailed - A check failed, so print out the condition and the message
301 // that failed. This provides a nice place to put a breakpoint if you want
302 // to see why something is not correct.
303 void CheckFailed(const Twine &Message, const Value *V1 = 0,
304 const Value *V2 = 0, const Value *V3 = 0,
305 const Value *V4 = 0) {
306 OS << Message.str() << "\n";
314 void CheckFailed(const Twine &Message, const Value *V1, Type *T2,
315 const Value *V3 = 0) {
316 OS << Message.str() << "\n";
323 void CheckFailed(const Twine &Message, Type *T1, Type *T2 = 0, Type *T3 = 0) {
324 OS << Message.str() << "\n";
331 } // End anonymous namespace
333 // Assert - We know that cond should be true, if not print an error message.
334 #define Assert(C, M) \
335 do { if (!(C)) { CheckFailed(M); return; } } while (0)
336 #define Assert1(C, M, V1) \
337 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
338 #define Assert2(C, M, V1, V2) \
339 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
340 #define Assert3(C, M, V1, V2, V3) \
341 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
342 #define Assert4(C, M, V1, V2, V3, V4) \
343 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
345 void Verifier::visit(Instruction &I) {
346 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
347 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
348 InstVisitor<Verifier>::visit(I);
352 void Verifier::visitGlobalValue(const GlobalValue &GV) {
353 Assert1(!GV.isDeclaration() ||
354 GV.isMaterializable() ||
355 GV.hasExternalLinkage() ||
356 GV.hasExternalWeakLinkage() ||
357 (isa<GlobalAlias>(GV) &&
358 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
359 "Global is external, but doesn't have external or weak linkage!",
362 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
363 "Only global variables can have appending linkage!", &GV);
365 if (GV.hasAppendingLinkage()) {
366 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
367 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
368 "Only global arrays can have appending linkage!", GVar);
372 void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
373 if (GV.hasInitializer()) {
374 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
375 "Global variable initializer type does not match global "
376 "variable type!", &GV);
378 // If the global has common linkage, it must have a zero initializer and
379 // cannot be constant.
380 if (GV.hasCommonLinkage()) {
381 Assert1(GV.getInitializer()->isNullValue(),
382 "'common' global must have a zero initializer!", &GV);
383 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
387 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
388 "invalid linkage type for global declaration", &GV);
391 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
392 GV.getName() == "llvm.global_dtors")) {
393 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
394 "invalid linkage for intrinsic global variable", &GV);
395 // Don't worry about emitting an error for it not being an array,
396 // visitGlobalValue will complain on appending non-array.
397 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType())) {
398 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
399 PointerType *FuncPtrTy =
400 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
401 Assert1(STy && STy->getNumElements() == 2 &&
402 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
403 STy->getTypeAtIndex(1) == FuncPtrTy,
404 "wrong type for intrinsic global variable", &GV);
408 if (GV.hasName() && (GV.getName() == "llvm.used" ||
409 GV.getName() == "llvm.compiler.used")) {
410 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
411 "invalid linkage for intrinsic global variable", &GV);
412 Type *GVType = GV.getType()->getElementType();
413 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
414 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
415 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
416 if (GV.hasInitializer()) {
417 const Constant *Init = GV.getInitializer();
418 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
419 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
421 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
422 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
424 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
425 "invalid llvm.used member", V);
426 Assert1(V->hasName(), "members of llvm.used must be named", V);
432 Assert1(!GV.hasDLLImportStorageClass() ||
433 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
434 GV.hasAvailableExternallyLinkage(),
435 "Global is marked as dllimport, but not external", &GV);
437 if (!GV.hasInitializer()) {
438 visitGlobalValue(GV);
442 // Walk any aggregate initializers looking for bitcasts between address spaces
443 SmallPtrSet<const Value *, 4> Visited;
444 SmallVector<const Value *, 4> WorkStack;
445 WorkStack.push_back(cast<Value>(GV.getInitializer()));
447 while (!WorkStack.empty()) {
448 const Value *V = WorkStack.pop_back_val();
449 if (!Visited.insert(V))
452 if (const User *U = dyn_cast<User>(V)) {
453 for (unsigned I = 0, N = U->getNumOperands(); I != N; ++I)
454 WorkStack.push_back(U->getOperand(I));
457 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
458 VerifyConstantExprBitcastType(CE);
464 visitGlobalValue(GV);
467 void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
468 Assert1(!GA.getName().empty(),
469 "Alias name cannot be empty!", &GA);
470 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
471 "Alias should have external or external weak linkage!", &GA);
472 Assert1(GA.getAliasee(),
473 "Aliasee cannot be NULL!", &GA);
474 Assert1(GA.getType() == GA.getAliasee()->getType(),
475 "Alias and aliasee types should match!", &GA);
476 Assert1(!GA.hasUnnamedAddr(), "Alias cannot have unnamed_addr!", &GA);
477 Assert1(!GA.hasSection(), "Alias cannot have a section!", &GA);
478 Assert1(!GA.getAlignment(), "Alias connot have an alignment", &GA);
480 const Constant *Aliasee = GA.getAliasee();
481 const GlobalValue *GV = dyn_cast<GlobalValue>(Aliasee);
484 const ConstantExpr *CE = dyn_cast<ConstantExpr>(Aliasee);
485 if (CE && (CE->getOpcode() == Instruction::BitCast ||
486 CE->getOpcode() == Instruction::AddrSpaceCast ||
487 CE->getOpcode() == Instruction::GetElementPtr))
488 GV = dyn_cast<GlobalValue>(CE->getOperand(0));
490 Assert1(GV, "Aliasee should be either GlobalValue, bitcast or "
491 "addrspacecast of GlobalValue",
494 if (CE->getOpcode() == Instruction::BitCast) {
495 unsigned SrcAS = GV->getType()->getPointerAddressSpace();
496 unsigned DstAS = CE->getType()->getPointerAddressSpace();
498 Assert1(SrcAS == DstAS,
499 "Alias bitcasts cannot be between different address spaces",
503 Assert1(!GV->isDeclaration(), "Alias must point to a definition", &GA);
504 if (const GlobalAlias *GAAliasee = dyn_cast<GlobalAlias>(GV)) {
505 Assert1(!GAAliasee->mayBeOverridden(), "Alias cannot point to a weak alias",
509 const GlobalValue *AG = GA.getAliasedGlobal();
510 Assert1(AG, "Aliasing chain should end with function or global variable",
513 visitGlobalValue(GA);
516 void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
517 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
518 MDNode *MD = NMD.getOperand(i);
522 Assert1(!MD->isFunctionLocal(),
523 "Named metadata operand cannot be function local!", MD);
528 void Verifier::visitMDNode(MDNode &MD, Function *F) {
529 // Only visit each node once. Metadata can be mutually recursive, so this
530 // avoids infinite recursion here, as well as being an optimization.
531 if (!MDNodes.insert(&MD))
534 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
535 Value *Op = MD.getOperand(i);
538 if (isa<Constant>(Op) || isa<MDString>(Op))
540 if (MDNode *N = dyn_cast<MDNode>(Op)) {
541 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
542 "Global metadata operand cannot be function local!", &MD, N);
546 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
548 // If this was an instruction, bb, or argument, verify that it is in the
549 // function that we expect.
550 Function *ActualF = 0;
551 if (Instruction *I = dyn_cast<Instruction>(Op))
552 ActualF = I->getParent()->getParent();
553 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
554 ActualF = BB->getParent();
555 else if (Argument *A = dyn_cast<Argument>(Op))
556 ActualF = A->getParent();
557 assert(ActualF && "Unimplemented function local metadata case!");
559 Assert2(ActualF == F, "function-local metadata used in wrong function",
564 void Verifier::visitModuleIdents(const Module &M) {
565 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
569 // llvm.ident takes a list of metadata entry. Each entry has only one string.
570 // Scan each llvm.ident entry and make sure that this requirement is met.
571 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
572 const MDNode *N = Idents->getOperand(i);
573 Assert1(N->getNumOperands() == 1,
574 "incorrect number of operands in llvm.ident metadata", N);
575 Assert1(isa<MDString>(N->getOperand(0)),
576 ("invalid value for llvm.ident metadata entry operand"
577 "(the operand should be a string)"),
582 void Verifier::visitModuleFlags(const Module &M) {
583 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
586 // Scan each flag, and track the flags and requirements.
587 DenseMap<const MDString*, const MDNode*> SeenIDs;
588 SmallVector<const MDNode*, 16> Requirements;
589 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
590 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
593 // Validate that the requirements in the module are valid.
594 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
595 const MDNode *Requirement = Requirements[I];
596 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
597 const Value *ReqValue = Requirement->getOperand(1);
599 const MDNode *Op = SeenIDs.lookup(Flag);
601 CheckFailed("invalid requirement on flag, flag is not present in module",
606 if (Op->getOperand(2) != ReqValue) {
607 CheckFailed(("invalid requirement on flag, "
608 "flag does not have the required value"),
616 Verifier::visitModuleFlag(const MDNode *Op,
617 DenseMap<const MDString *, const MDNode *> &SeenIDs,
618 SmallVectorImpl<const MDNode *> &Requirements) {
619 // Each module flag should have three arguments, the merge behavior (a
620 // constant int), the flag ID (an MDString), and the value.
621 Assert1(Op->getNumOperands() == 3,
622 "incorrect number of operands in module flag", Op);
623 ConstantInt *Behavior = dyn_cast<ConstantInt>(Op->getOperand(0));
624 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
626 "invalid behavior operand in module flag (expected constant integer)",
628 unsigned BehaviorValue = Behavior->getZExtValue();
630 "invalid ID operand in module flag (expected metadata string)",
633 // Sanity check the values for behaviors with additional requirements.
634 switch (BehaviorValue) {
637 "invalid behavior operand in module flag (unexpected constant)",
642 case Module::Warning:
643 case Module::Override:
644 // These behavior types accept any value.
647 case Module::Require: {
648 // The value should itself be an MDNode with two operands, a flag ID (an
649 // MDString), and a value.
650 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
651 Assert1(Value && Value->getNumOperands() == 2,
652 "invalid value for 'require' module flag (expected metadata pair)",
654 Assert1(isa<MDString>(Value->getOperand(0)),
655 ("invalid value for 'require' module flag "
656 "(first value operand should be a string)"),
657 Value->getOperand(0));
659 // Append it to the list of requirements, to check once all module flags are
661 Requirements.push_back(Value);
666 case Module::AppendUnique: {
667 // These behavior types require the operand be an MDNode.
668 Assert1(isa<MDNode>(Op->getOperand(2)),
669 "invalid value for 'append'-type module flag "
670 "(expected a metadata node)", Op->getOperand(2));
675 // Unless this is a "requires" flag, check the ID is unique.
676 if (BehaviorValue != Module::Require) {
677 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
679 "module flag identifiers must be unique (or of 'require' type)",
684 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
685 bool isFunction, const Value *V) {
687 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
688 if (Attrs.getSlotIndex(I) == Idx) {
693 assert(Slot != ~0U && "Attribute set inconsistency!");
695 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
697 if (I->isStringAttribute())
700 if (I->getKindAsEnum() == Attribute::NoReturn ||
701 I->getKindAsEnum() == Attribute::NoUnwind ||
702 I->getKindAsEnum() == Attribute::NoInline ||
703 I->getKindAsEnum() == Attribute::AlwaysInline ||
704 I->getKindAsEnum() == Attribute::OptimizeForSize ||
705 I->getKindAsEnum() == Attribute::StackProtect ||
706 I->getKindAsEnum() == Attribute::StackProtectReq ||
707 I->getKindAsEnum() == Attribute::StackProtectStrong ||
708 I->getKindAsEnum() == Attribute::NoRedZone ||
709 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
710 I->getKindAsEnum() == Attribute::Naked ||
711 I->getKindAsEnum() == Attribute::InlineHint ||
712 I->getKindAsEnum() == Attribute::StackAlignment ||
713 I->getKindAsEnum() == Attribute::UWTable ||
714 I->getKindAsEnum() == Attribute::NonLazyBind ||
715 I->getKindAsEnum() == Attribute::ReturnsTwice ||
716 I->getKindAsEnum() == Attribute::SanitizeAddress ||
717 I->getKindAsEnum() == Attribute::SanitizeThread ||
718 I->getKindAsEnum() == Attribute::SanitizeMemory ||
719 I->getKindAsEnum() == Attribute::MinSize ||
720 I->getKindAsEnum() == Attribute::NoDuplicate ||
721 I->getKindAsEnum() == Attribute::Builtin ||
722 I->getKindAsEnum() == Attribute::NoBuiltin ||
723 I->getKindAsEnum() == Attribute::Cold ||
724 I->getKindAsEnum() == Attribute::OptimizeNone) {
726 CheckFailed("Attribute '" + I->getAsString() +
727 "' only applies to functions!", V);
730 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
731 I->getKindAsEnum() == Attribute::ReadNone) {
733 CheckFailed("Attribute '" + I->getAsString() +
734 "' does not apply to function returns");
737 } else if (isFunction) {
738 CheckFailed("Attribute '" + I->getAsString() +
739 "' does not apply to functions!", V);
745 // VerifyParameterAttrs - Check the given attributes for an argument or return
746 // value of the specified type. The value V is printed in error messages.
747 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
748 bool isReturnValue, const Value *V) {
749 if (!Attrs.hasAttributes(Idx))
752 VerifyAttributeTypes(Attrs, Idx, false, V);
755 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
756 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
757 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
758 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
759 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
760 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
761 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
762 "'returned' do not apply to return values!", V);
764 // Check for mutually incompatible attributes. Only inreg is compatible with
766 unsigned AttrCount = 0;
767 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
768 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
769 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
770 Attrs.hasAttribute(Idx, Attribute::InReg);
771 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
772 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
773 "and 'sret' are incompatible!", V);
775 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
776 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
777 "'inalloca and readonly' are incompatible!", V);
779 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
780 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
781 "'sret and returned' are incompatible!", V);
783 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
784 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
785 "'zeroext and signext' are incompatible!", V);
787 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
788 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
789 "'readnone and readonly' are incompatible!", V);
791 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
792 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
793 "'noinline and alwaysinline' are incompatible!", V);
795 Assert1(!AttrBuilder(Attrs, Idx).
796 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
797 "Wrong types for attribute: " +
798 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
800 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
801 if (!PTy->getElementType()->isSized()) {
802 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
803 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
804 "Attributes 'byval' and 'inalloca' do not support unsized types!",
808 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
809 "Attribute 'byval' only applies to parameters with pointer type!",
814 // VerifyFunctionAttrs - Check parameter attributes against a function type.
815 // The value V is printed in error messages.
816 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
821 bool SawNest = false;
822 bool SawReturned = false;
824 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
825 unsigned Idx = Attrs.getSlotIndex(i);
829 Ty = FT->getReturnType();
830 else if (Idx-1 < FT->getNumParams())
831 Ty = FT->getParamType(Idx-1);
833 break; // VarArgs attributes, verified elsewhere.
835 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
840 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
841 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
845 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
846 Assert1(!SawReturned, "More than one parameter has attribute returned!",
848 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
849 "argument and return types for 'returned' attribute", V);
853 if (Attrs.hasAttribute(Idx, Attribute::StructRet))
854 Assert1(Idx == 1, "Attribute sret is not on first parameter!", V);
856 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
857 Assert1(Idx == FT->getNumParams(),
858 "inalloca isn't on the last parameter!", V);
862 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
865 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
867 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
868 Attribute::ReadNone) &&
869 Attrs.hasAttribute(AttributeSet::FunctionIndex,
870 Attribute::ReadOnly)),
871 "Attributes 'readnone and readonly' are incompatible!", V);
873 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
874 Attribute::NoInline) &&
875 Attrs.hasAttribute(AttributeSet::FunctionIndex,
876 Attribute::AlwaysInline)),
877 "Attributes 'noinline and alwaysinline' are incompatible!", V);
879 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
880 Attribute::OptimizeNone)) {
881 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
882 Attribute::NoInline),
883 "Attribute 'optnone' requires 'noinline'!", V);
885 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
886 Attribute::OptimizeForSize),
887 "Attributes 'optsize and optnone' are incompatible!", V);
889 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
891 "Attributes 'minsize and optnone' are incompatible!", V);
895 void Verifier::VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy) {
896 // Get the size of the types in bits, we'll need this later
897 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
898 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
900 // BitCast implies a no-op cast of type only. No bits change.
901 // However, you can't cast pointers to anything but pointers.
902 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
903 "Bitcast requires both operands to be pointer or neither", V);
904 Assert1(SrcBitSize == DestBitSize,
905 "Bitcast requires types of same width", V);
907 // Disallow aggregates.
908 Assert1(!SrcTy->isAggregateType(),
909 "Bitcast operand must not be aggregate", V);
910 Assert1(!DestTy->isAggregateType(),
911 "Bitcast type must not be aggregate", V);
913 // Without datalayout, assume all address spaces are the same size.
914 // Don't check if both types are not pointers.
915 // Skip casts between scalars and vectors.
917 !SrcTy->isPtrOrPtrVectorTy() ||
918 !DestTy->isPtrOrPtrVectorTy() ||
919 SrcTy->isVectorTy() != DestTy->isVectorTy()) {
923 unsigned SrcAS = SrcTy->getPointerAddressSpace();
924 unsigned DstAS = DestTy->getPointerAddressSpace();
926 Assert1(SrcAS == DstAS,
927 "Bitcasts between pointers of different address spaces is not legal."
928 "Use AddrSpaceCast instead.", V);
931 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
932 if (CE->getOpcode() == Instruction::BitCast) {
933 Type *SrcTy = CE->getOperand(0)->getType();
934 Type *DstTy = CE->getType();
935 VerifyBitcastType(CE, DstTy, SrcTy);
939 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
940 if (Attrs.getNumSlots() == 0)
943 unsigned LastSlot = Attrs.getNumSlots() - 1;
944 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
945 if (LastIndex <= Params
946 || (LastIndex == AttributeSet::FunctionIndex
947 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
953 // visitFunction - Verify that a function is ok.
955 void Verifier::visitFunction(const Function &F) {
956 // Check function arguments.
957 FunctionType *FT = F.getFunctionType();
958 unsigned NumArgs = F.arg_size();
960 Assert1(Context == &F.getContext(),
961 "Function context does not match Module context!", &F);
963 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
964 Assert2(FT->getNumParams() == NumArgs,
965 "# formal arguments must match # of arguments for function type!",
967 Assert1(F.getReturnType()->isFirstClassType() ||
968 F.getReturnType()->isVoidTy() ||
969 F.getReturnType()->isStructTy(),
970 "Functions cannot return aggregate values!", &F);
972 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
973 "Invalid struct return type!", &F);
975 AttributeSet Attrs = F.getAttributes();
977 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
978 "Attribute after last parameter!", &F);
980 // Check function attributes.
981 VerifyFunctionAttrs(FT, Attrs, &F);
983 // On function declarations/definitions, we do not support the builtin
984 // attribute. We do not check this in VerifyFunctionAttrs since that is
985 // checking for Attributes that can/can not ever be on functions.
986 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
988 "Attribute 'builtin' can only be applied to a callsite.", &F);
990 // Check that this function meets the restrictions on this calling convention.
991 switch (F.getCallingConv()) {
996 case CallingConv::Fast:
997 case CallingConv::Cold:
998 case CallingConv::X86_FastCall:
999 case CallingConv::X86_ThisCall:
1000 case CallingConv::Intel_OCL_BI:
1001 case CallingConv::PTX_Kernel:
1002 case CallingConv::PTX_Device:
1003 Assert1(!F.isVarArg(),
1004 "Varargs functions must have C calling conventions!", &F);
1008 bool isLLVMdotName = F.getName().size() >= 5 &&
1009 F.getName().substr(0, 5) == "llvm.";
1011 // Check that the argument values match the function type for this function...
1013 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1015 Assert2(I->getType() == FT->getParamType(i),
1016 "Argument value does not match function argument type!",
1017 I, FT->getParamType(i));
1018 Assert1(I->getType()->isFirstClassType(),
1019 "Function arguments must have first-class types!", I);
1021 Assert2(!I->getType()->isMetadataTy(),
1022 "Function takes metadata but isn't an intrinsic", I, &F);
1025 if (F.isMaterializable()) {
1026 // Function has a body somewhere we can't see.
1027 } else if (F.isDeclaration()) {
1028 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1029 "invalid linkage type for function declaration", &F);
1031 // Verify that this function (which has a body) is not named "llvm.*". It
1032 // is not legal to define intrinsics.
1033 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1035 // Check the entry node
1036 const BasicBlock *Entry = &F.getEntryBlock();
1037 Assert1(pred_begin(Entry) == pred_end(Entry),
1038 "Entry block to function must not have predecessors!", Entry);
1040 // The address of the entry block cannot be taken, unless it is dead.
1041 if (Entry->hasAddressTaken()) {
1042 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1043 "blockaddress may not be used with the entry block!", Entry);
1047 // If this function is actually an intrinsic, verify that it is only used in
1048 // direct call/invokes, never having its "address taken".
1049 if (F.getIntrinsicID()) {
1051 if (F.hasAddressTaken(&U))
1052 Assert1(0, "Invalid user of intrinsic instruction!", U);
1055 Assert1(!F.hasDLLImportStorageClass() ||
1056 (F.isDeclaration() && F.hasExternalLinkage()) ||
1057 F.hasAvailableExternallyLinkage(),
1058 "Function is marked as dllimport, but not external.", &F);
1061 // verifyBasicBlock - Verify that a basic block is well formed...
1063 void Verifier::visitBasicBlock(BasicBlock &BB) {
1064 InstsInThisBlock.clear();
1066 // Ensure that basic blocks have terminators!
1067 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1069 // Check constraints that this basic block imposes on all of the PHI nodes in
1071 if (isa<PHINode>(BB.front())) {
1072 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1073 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1074 std::sort(Preds.begin(), Preds.end());
1076 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1077 // Ensure that PHI nodes have at least one entry!
1078 Assert1(PN->getNumIncomingValues() != 0,
1079 "PHI nodes must have at least one entry. If the block is dead, "
1080 "the PHI should be removed!", PN);
1081 Assert1(PN->getNumIncomingValues() == Preds.size(),
1082 "PHINode should have one entry for each predecessor of its "
1083 "parent basic block!", PN);
1085 // Get and sort all incoming values in the PHI node...
1087 Values.reserve(PN->getNumIncomingValues());
1088 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1089 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1090 PN->getIncomingValue(i)));
1091 std::sort(Values.begin(), Values.end());
1093 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1094 // Check to make sure that if there is more than one entry for a
1095 // particular basic block in this PHI node, that the incoming values are
1098 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1099 Values[i].second == Values[i-1].second,
1100 "PHI node has multiple entries for the same basic block with "
1101 "different incoming values!", PN, Values[i].first,
1102 Values[i].second, Values[i-1].second);
1104 // Check to make sure that the predecessors and PHI node entries are
1106 Assert3(Values[i].first == Preds[i],
1107 "PHI node entries do not match predecessors!", PN,
1108 Values[i].first, Preds[i]);
1114 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1115 // Ensure that terminators only exist at the end of the basic block.
1116 Assert1(&I == I.getParent()->getTerminator(),
1117 "Terminator found in the middle of a basic block!", I.getParent());
1118 visitInstruction(I);
1121 void Verifier::visitBranchInst(BranchInst &BI) {
1122 if (BI.isConditional()) {
1123 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1124 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1126 visitTerminatorInst(BI);
1129 void Verifier::visitReturnInst(ReturnInst &RI) {
1130 Function *F = RI.getParent()->getParent();
1131 unsigned N = RI.getNumOperands();
1132 if (F->getReturnType()->isVoidTy())
1134 "Found return instr that returns non-void in Function of void "
1135 "return type!", &RI, F->getReturnType());
1137 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1138 "Function return type does not match operand "
1139 "type of return inst!", &RI, F->getReturnType());
1141 // Check to make sure that the return value has necessary properties for
1143 visitTerminatorInst(RI);
1146 void Verifier::visitSwitchInst(SwitchInst &SI) {
1147 // Check to make sure that all of the constants in the switch instruction
1148 // have the same type as the switched-on value.
1149 Type *SwitchTy = SI.getCondition()->getType();
1150 SmallPtrSet<ConstantInt*, 32> Constants;
1151 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1152 Assert1(i.getCaseValue()->getType() == SwitchTy,
1153 "Switch constants must all be same type as switch value!", &SI);
1154 Assert2(Constants.insert(i.getCaseValue()),
1155 "Duplicate integer as switch case", &SI, i.getCaseValue());
1158 visitTerminatorInst(SI);
1161 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1162 Assert1(BI.getAddress()->getType()->isPointerTy(),
1163 "Indirectbr operand must have pointer type!", &BI);
1164 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1165 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1166 "Indirectbr destinations must all have pointer type!", &BI);
1168 visitTerminatorInst(BI);
1171 void Verifier::visitSelectInst(SelectInst &SI) {
1172 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1174 "Invalid operands for select instruction!", &SI);
1176 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1177 "Select values must have same type as select instruction!", &SI);
1178 visitInstruction(SI);
1181 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1182 /// a pass, if any exist, it's an error.
1184 void Verifier::visitUserOp1(Instruction &I) {
1185 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1188 void Verifier::visitTruncInst(TruncInst &I) {
1189 // Get the source and destination types
1190 Type *SrcTy = I.getOperand(0)->getType();
1191 Type *DestTy = I.getType();
1193 // Get the size of the types in bits, we'll need this later
1194 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1195 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1197 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1198 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1199 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1200 "trunc source and destination must both be a vector or neither", &I);
1201 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1203 visitInstruction(I);
1206 void Verifier::visitZExtInst(ZExtInst &I) {
1207 // Get the source and destination types
1208 Type *SrcTy = I.getOperand(0)->getType();
1209 Type *DestTy = I.getType();
1211 // Get the size of the types in bits, we'll need this later
1212 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1213 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1214 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1215 "zext source and destination must both be a vector or neither", &I);
1216 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1217 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1219 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1221 visitInstruction(I);
1224 void Verifier::visitSExtInst(SExtInst &I) {
1225 // Get the source and destination types
1226 Type *SrcTy = I.getOperand(0)->getType();
1227 Type *DestTy = I.getType();
1229 // Get the size of the types in bits, we'll need this later
1230 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1231 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1233 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1234 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1235 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1236 "sext source and destination must both be a vector or neither", &I);
1237 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1239 visitInstruction(I);
1242 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1243 // Get the source and destination types
1244 Type *SrcTy = I.getOperand(0)->getType();
1245 Type *DestTy = I.getType();
1246 // Get the size of the types in bits, we'll need this later
1247 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1248 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1250 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1251 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1252 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1253 "fptrunc source and destination must both be a vector or neither",&I);
1254 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1256 visitInstruction(I);
1259 void Verifier::visitFPExtInst(FPExtInst &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->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1269 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1270 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1271 "fpext source and destination must both be a vector or neither", &I);
1272 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1274 visitInstruction(I);
1277 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1278 // Get the source and destination types
1279 Type *SrcTy = I.getOperand(0)->getType();
1280 Type *DestTy = I.getType();
1282 bool SrcVec = SrcTy->isVectorTy();
1283 bool DstVec = DestTy->isVectorTy();
1285 Assert1(SrcVec == DstVec,
1286 "UIToFP source and dest must both be vector or scalar", &I);
1287 Assert1(SrcTy->isIntOrIntVectorTy(),
1288 "UIToFP source must be integer or integer vector", &I);
1289 Assert1(DestTy->isFPOrFPVectorTy(),
1290 "UIToFP result must be FP or FP vector", &I);
1292 if (SrcVec && DstVec)
1293 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1294 cast<VectorType>(DestTy)->getNumElements(),
1295 "UIToFP source and dest vector length mismatch", &I);
1297 visitInstruction(I);
1300 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1301 // Get the source and destination types
1302 Type *SrcTy = I.getOperand(0)->getType();
1303 Type *DestTy = I.getType();
1305 bool SrcVec = SrcTy->isVectorTy();
1306 bool DstVec = DestTy->isVectorTy();
1308 Assert1(SrcVec == DstVec,
1309 "SIToFP source and dest must both be vector or scalar", &I);
1310 Assert1(SrcTy->isIntOrIntVectorTy(),
1311 "SIToFP source must be integer or integer vector", &I);
1312 Assert1(DestTy->isFPOrFPVectorTy(),
1313 "SIToFP result must be FP or FP vector", &I);
1315 if (SrcVec && DstVec)
1316 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1317 cast<VectorType>(DestTy)->getNumElements(),
1318 "SIToFP source and dest vector length mismatch", &I);
1320 visitInstruction(I);
1323 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1324 // Get the source and destination types
1325 Type *SrcTy = I.getOperand(0)->getType();
1326 Type *DestTy = I.getType();
1328 bool SrcVec = SrcTy->isVectorTy();
1329 bool DstVec = DestTy->isVectorTy();
1331 Assert1(SrcVec == DstVec,
1332 "FPToUI source and dest must both be vector or scalar", &I);
1333 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1335 Assert1(DestTy->isIntOrIntVectorTy(),
1336 "FPToUI result must be integer or integer vector", &I);
1338 if (SrcVec && DstVec)
1339 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1340 cast<VectorType>(DestTy)->getNumElements(),
1341 "FPToUI source and dest vector length mismatch", &I);
1343 visitInstruction(I);
1346 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1347 // Get the source and destination types
1348 Type *SrcTy = I.getOperand(0)->getType();
1349 Type *DestTy = I.getType();
1351 bool SrcVec = SrcTy->isVectorTy();
1352 bool DstVec = DestTy->isVectorTy();
1354 Assert1(SrcVec == DstVec,
1355 "FPToSI source and dest must both be vector or scalar", &I);
1356 Assert1(SrcTy->isFPOrFPVectorTy(),
1357 "FPToSI source must be FP or FP vector", &I);
1358 Assert1(DestTy->isIntOrIntVectorTy(),
1359 "FPToSI result must be integer or integer vector", &I);
1361 if (SrcVec && DstVec)
1362 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1363 cast<VectorType>(DestTy)->getNumElements(),
1364 "FPToSI source and dest vector length mismatch", &I);
1366 visitInstruction(I);
1369 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1370 // Get the source and destination types
1371 Type *SrcTy = I.getOperand(0)->getType();
1372 Type *DestTy = I.getType();
1374 Assert1(SrcTy->getScalarType()->isPointerTy(),
1375 "PtrToInt source must be pointer", &I);
1376 Assert1(DestTy->getScalarType()->isIntegerTy(),
1377 "PtrToInt result must be integral", &I);
1378 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1379 "PtrToInt type mismatch", &I);
1381 if (SrcTy->isVectorTy()) {
1382 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1383 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1384 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1385 "PtrToInt Vector width mismatch", &I);
1388 visitInstruction(I);
1391 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1392 // Get the source and destination types
1393 Type *SrcTy = I.getOperand(0)->getType();
1394 Type *DestTy = I.getType();
1396 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1397 "IntToPtr source must be an integral", &I);
1398 Assert1(DestTy->getScalarType()->isPointerTy(),
1399 "IntToPtr result must be a pointer",&I);
1400 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1401 "IntToPtr type mismatch", &I);
1402 if (SrcTy->isVectorTy()) {
1403 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1404 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1405 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1406 "IntToPtr Vector width mismatch", &I);
1408 visitInstruction(I);
1411 void Verifier::visitBitCastInst(BitCastInst &I) {
1412 Type *SrcTy = I.getOperand(0)->getType();
1413 Type *DestTy = I.getType();
1414 VerifyBitcastType(&I, DestTy, SrcTy);
1415 visitInstruction(I);
1418 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1419 Type *SrcTy = I.getOperand(0)->getType();
1420 Type *DestTy = I.getType();
1422 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1423 "AddrSpaceCast source must be a pointer", &I);
1424 Assert1(DestTy->isPtrOrPtrVectorTy(),
1425 "AddrSpaceCast result must be a pointer", &I);
1426 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1427 "AddrSpaceCast must be between different address spaces", &I);
1428 if (SrcTy->isVectorTy())
1429 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1430 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1431 visitInstruction(I);
1434 /// visitPHINode - Ensure that a PHI node is well formed.
1436 void Verifier::visitPHINode(PHINode &PN) {
1437 // Ensure that the PHI nodes are all grouped together at the top of the block.
1438 // This can be tested by checking whether the instruction before this is
1439 // either nonexistent (because this is begin()) or is a PHI node. If not,
1440 // then there is some other instruction before a PHI.
1441 Assert2(&PN == &PN.getParent()->front() ||
1442 isa<PHINode>(--BasicBlock::iterator(&PN)),
1443 "PHI nodes not grouped at top of basic block!",
1444 &PN, PN.getParent());
1446 // Check that all of the values of the PHI node have the same type as the
1447 // result, and that the incoming blocks are really basic blocks.
1448 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1449 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1450 "PHI node operands are not the same type as the result!", &PN);
1453 // All other PHI node constraints are checked in the visitBasicBlock method.
1455 visitInstruction(PN);
1458 void Verifier::VerifyCallSite(CallSite CS) {
1459 Instruction *I = CS.getInstruction();
1461 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1462 "Called function must be a pointer!", I);
1463 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1465 Assert1(FPTy->getElementType()->isFunctionTy(),
1466 "Called function is not pointer to function type!", I);
1467 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1469 // Verify that the correct number of arguments are being passed
1470 if (FTy->isVarArg())
1471 Assert1(CS.arg_size() >= FTy->getNumParams(),
1472 "Called function requires more parameters than were provided!",I);
1474 Assert1(CS.arg_size() == FTy->getNumParams(),
1475 "Incorrect number of arguments passed to called function!", I);
1477 // Verify that all arguments to the call match the function type.
1478 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1479 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1480 "Call parameter type does not match function signature!",
1481 CS.getArgument(i), FTy->getParamType(i), I);
1483 AttributeSet Attrs = CS.getAttributes();
1485 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1486 "Attribute after last parameter!", I);
1488 // Verify call attributes.
1489 VerifyFunctionAttrs(FTy, Attrs, I);
1491 if (FTy->isVarArg()) {
1492 // FIXME? is 'nest' even legal here?
1493 bool SawNest = false;
1494 bool SawReturned = false;
1496 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1497 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1499 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1503 // Check attributes on the varargs part.
1504 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1505 Type *Ty = CS.getArgument(Idx-1)->getType();
1506 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1508 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1509 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1513 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1514 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1516 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1517 "Incompatible argument and return types for 'returned' "
1522 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1523 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1525 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1526 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1531 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1532 if (CS.getCalledFunction() == 0 ||
1533 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1534 for (FunctionType::param_iterator PI = FTy->param_begin(),
1535 PE = FTy->param_end(); PI != PE; ++PI)
1536 Assert1(!(*PI)->isMetadataTy(),
1537 "Function has metadata parameter but isn't an intrinsic", I);
1540 visitInstruction(*I);
1543 void Verifier::visitCallInst(CallInst &CI) {
1544 VerifyCallSite(&CI);
1546 if (Function *F = CI.getCalledFunction())
1547 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1548 visitIntrinsicFunctionCall(ID, CI);
1551 void Verifier::visitInvokeInst(InvokeInst &II) {
1552 VerifyCallSite(&II);
1554 // Verify that there is a landingpad instruction as the first non-PHI
1555 // instruction of the 'unwind' destination.
1556 Assert1(II.getUnwindDest()->isLandingPad(),
1557 "The unwind destination does not have a landingpad instruction!",&II);
1559 visitTerminatorInst(II);
1562 /// visitBinaryOperator - Check that both arguments to the binary operator are
1563 /// of the same type!
1565 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1566 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1567 "Both operands to a binary operator are not of the same type!", &B);
1569 switch (B.getOpcode()) {
1570 // Check that integer arithmetic operators are only used with
1571 // integral operands.
1572 case Instruction::Add:
1573 case Instruction::Sub:
1574 case Instruction::Mul:
1575 case Instruction::SDiv:
1576 case Instruction::UDiv:
1577 case Instruction::SRem:
1578 case Instruction::URem:
1579 Assert1(B.getType()->isIntOrIntVectorTy(),
1580 "Integer arithmetic operators only work with integral types!", &B);
1581 Assert1(B.getType() == B.getOperand(0)->getType(),
1582 "Integer arithmetic operators must have same type "
1583 "for operands and result!", &B);
1585 // Check that floating-point arithmetic operators are only used with
1586 // floating-point operands.
1587 case Instruction::FAdd:
1588 case Instruction::FSub:
1589 case Instruction::FMul:
1590 case Instruction::FDiv:
1591 case Instruction::FRem:
1592 Assert1(B.getType()->isFPOrFPVectorTy(),
1593 "Floating-point arithmetic operators only work with "
1594 "floating-point types!", &B);
1595 Assert1(B.getType() == B.getOperand(0)->getType(),
1596 "Floating-point arithmetic operators must have same type "
1597 "for operands and result!", &B);
1599 // Check that logical operators are only used with integral operands.
1600 case Instruction::And:
1601 case Instruction::Or:
1602 case Instruction::Xor:
1603 Assert1(B.getType()->isIntOrIntVectorTy(),
1604 "Logical operators only work with integral types!", &B);
1605 Assert1(B.getType() == B.getOperand(0)->getType(),
1606 "Logical operators must have same type for operands and result!",
1609 case Instruction::Shl:
1610 case Instruction::LShr:
1611 case Instruction::AShr:
1612 Assert1(B.getType()->isIntOrIntVectorTy(),
1613 "Shifts only work with integral types!", &B);
1614 Assert1(B.getType() == B.getOperand(0)->getType(),
1615 "Shift return type must be same as operands!", &B);
1618 llvm_unreachable("Unknown BinaryOperator opcode!");
1621 visitInstruction(B);
1624 void Verifier::visitICmpInst(ICmpInst &IC) {
1625 // Check that the operands are the same type
1626 Type *Op0Ty = IC.getOperand(0)->getType();
1627 Type *Op1Ty = IC.getOperand(1)->getType();
1628 Assert1(Op0Ty == Op1Ty,
1629 "Both operands to ICmp instruction are not of the same type!", &IC);
1630 // Check that the operands are the right type
1631 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1632 "Invalid operand types for ICmp instruction", &IC);
1633 // Check that the predicate is valid.
1634 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1635 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1636 "Invalid predicate in ICmp instruction!", &IC);
1638 visitInstruction(IC);
1641 void Verifier::visitFCmpInst(FCmpInst &FC) {
1642 // Check that the operands are the same type
1643 Type *Op0Ty = FC.getOperand(0)->getType();
1644 Type *Op1Ty = FC.getOperand(1)->getType();
1645 Assert1(Op0Ty == Op1Ty,
1646 "Both operands to FCmp instruction are not of the same type!", &FC);
1647 // Check that the operands are the right type
1648 Assert1(Op0Ty->isFPOrFPVectorTy(),
1649 "Invalid operand types for FCmp instruction", &FC);
1650 // Check that the predicate is valid.
1651 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1652 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1653 "Invalid predicate in FCmp instruction!", &FC);
1655 visitInstruction(FC);
1658 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1659 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1661 "Invalid extractelement operands!", &EI);
1662 visitInstruction(EI);
1665 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1666 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1669 "Invalid insertelement operands!", &IE);
1670 visitInstruction(IE);
1673 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1674 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1676 "Invalid shufflevector operands!", &SV);
1677 visitInstruction(SV);
1680 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1681 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1683 Assert1(isa<PointerType>(TargetTy),
1684 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1685 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1686 "GEP into unsized type!", &GEP);
1687 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1688 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1691 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1693 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1694 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1696 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1697 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1698 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1700 if (GEP.getPointerOperandType()->isVectorTy()) {
1701 // Additional checks for vector GEPs.
1702 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1703 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1704 "Vector GEP result width doesn't match operand's", &GEP);
1705 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1706 Type *IndexTy = Idxs[i]->getType();
1707 Assert1(IndexTy->isVectorTy(),
1708 "Vector GEP must have vector indices!", &GEP);
1709 unsigned IndexWidth = IndexTy->getVectorNumElements();
1710 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1713 visitInstruction(GEP);
1716 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1717 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1720 void Verifier::visitLoadInst(LoadInst &LI) {
1721 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1722 Assert1(PTy, "Load operand must be a pointer.", &LI);
1723 Type *ElTy = PTy->getElementType();
1724 Assert2(ElTy == LI.getType(),
1725 "Load result type does not match pointer operand type!", &LI, ElTy);
1726 if (LI.isAtomic()) {
1727 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1728 "Load cannot have Release ordering", &LI);
1729 Assert1(LI.getAlignment() != 0,
1730 "Atomic load must specify explicit alignment", &LI);
1731 if (!ElTy->isPointerTy()) {
1732 Assert2(ElTy->isIntegerTy(),
1733 "atomic store operand must have integer type!",
1735 unsigned Size = ElTy->getPrimitiveSizeInBits();
1736 Assert2(Size >= 8 && !(Size & (Size - 1)),
1737 "atomic store operand must be power-of-two byte-sized integer",
1741 Assert1(LI.getSynchScope() == CrossThread,
1742 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1745 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1746 unsigned NumOperands = Range->getNumOperands();
1747 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1748 unsigned NumRanges = NumOperands / 2;
1749 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1751 ConstantRange LastRange(1); // Dummy initial value
1752 for (unsigned i = 0; i < NumRanges; ++i) {
1753 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1754 Assert1(Low, "The lower limit must be an integer!", Low);
1755 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1756 Assert1(High, "The upper limit must be an integer!", High);
1757 Assert1(High->getType() == Low->getType() &&
1758 High->getType() == ElTy, "Range types must match load type!",
1761 APInt HighV = High->getValue();
1762 APInt LowV = Low->getValue();
1763 ConstantRange CurRange(LowV, HighV);
1764 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1765 "Range must not be empty!", Range);
1767 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1768 "Intervals are overlapping", Range);
1769 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1771 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1774 LastRange = ConstantRange(LowV, HighV);
1776 if (NumRanges > 2) {
1778 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1780 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1781 ConstantRange FirstRange(FirstLow, FirstHigh);
1782 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1783 "Intervals are overlapping", Range);
1784 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1791 visitInstruction(LI);
1794 void Verifier::visitStoreInst(StoreInst &SI) {
1795 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1796 Assert1(PTy, "Store operand must be a pointer.", &SI);
1797 Type *ElTy = PTy->getElementType();
1798 Assert2(ElTy == SI.getOperand(0)->getType(),
1799 "Stored value type does not match pointer operand type!",
1801 if (SI.isAtomic()) {
1802 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1803 "Store cannot have Acquire ordering", &SI);
1804 Assert1(SI.getAlignment() != 0,
1805 "Atomic store must specify explicit alignment", &SI);
1806 if (!ElTy->isPointerTy()) {
1807 Assert2(ElTy->isIntegerTy(),
1808 "atomic store operand must have integer type!",
1810 unsigned Size = ElTy->getPrimitiveSizeInBits();
1811 Assert2(Size >= 8 && !(Size & (Size - 1)),
1812 "atomic store operand must be power-of-two byte-sized integer",
1816 Assert1(SI.getSynchScope() == CrossThread,
1817 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1819 visitInstruction(SI);
1822 void Verifier::visitAllocaInst(AllocaInst &AI) {
1823 SmallPtrSet<const Type*, 4> Visited;
1824 PointerType *PTy = AI.getType();
1825 Assert1(PTy->getAddressSpace() == 0,
1826 "Allocation instruction pointer not in the generic address space!",
1828 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
1830 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
1831 "Alloca array size must have integer type", &AI);
1833 visitInstruction(AI);
1836 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
1838 // FIXME: more conditions???
1839 Assert1(CXI.getSuccessOrdering() != NotAtomic,
1840 "cmpxchg instructions must be atomic.", &CXI);
1841 Assert1(CXI.getFailureOrdering() != NotAtomic,
1842 "cmpxchg instructions must be atomic.", &CXI);
1843 Assert1(CXI.getSuccessOrdering() != Unordered,
1844 "cmpxchg instructions cannot be unordered.", &CXI);
1845 Assert1(CXI.getFailureOrdering() != Unordered,
1846 "cmpxchg instructions cannot be unordered.", &CXI);
1847 Assert1(CXI.getSuccessOrdering() >= CXI.getFailureOrdering(),
1848 "cmpxchg instructions be at least as constrained on success as fail",
1850 Assert1(CXI.getFailureOrdering() != Release &&
1851 CXI.getFailureOrdering() != AcquireRelease,
1852 "cmpxchg failure ordering cannot include release semantics", &CXI);
1854 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
1855 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
1856 Type *ElTy = PTy->getElementType();
1857 Assert2(ElTy->isIntegerTy(),
1858 "cmpxchg operand must have integer type!",
1860 unsigned Size = ElTy->getPrimitiveSizeInBits();
1861 Assert2(Size >= 8 && !(Size & (Size - 1)),
1862 "cmpxchg operand must be power-of-two byte-sized integer",
1864 Assert2(ElTy == CXI.getOperand(1)->getType(),
1865 "Expected value type does not match pointer operand type!",
1867 Assert2(ElTy == CXI.getOperand(2)->getType(),
1868 "Stored value type does not match pointer operand type!",
1870 visitInstruction(CXI);
1873 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
1874 Assert1(RMWI.getOrdering() != NotAtomic,
1875 "atomicrmw instructions must be atomic.", &RMWI);
1876 Assert1(RMWI.getOrdering() != Unordered,
1877 "atomicrmw instructions cannot be unordered.", &RMWI);
1878 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
1879 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
1880 Type *ElTy = PTy->getElementType();
1881 Assert2(ElTy->isIntegerTy(),
1882 "atomicrmw operand must have integer type!",
1884 unsigned Size = ElTy->getPrimitiveSizeInBits();
1885 Assert2(Size >= 8 && !(Size & (Size - 1)),
1886 "atomicrmw operand must be power-of-two byte-sized integer",
1888 Assert2(ElTy == RMWI.getOperand(1)->getType(),
1889 "Argument value type does not match pointer operand type!",
1891 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
1892 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
1893 "Invalid binary operation!", &RMWI);
1894 visitInstruction(RMWI);
1897 void Verifier::visitFenceInst(FenceInst &FI) {
1898 const AtomicOrdering Ordering = FI.getOrdering();
1899 Assert1(Ordering == Acquire || Ordering == Release ||
1900 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
1901 "fence instructions may only have "
1902 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
1903 visitInstruction(FI);
1906 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1907 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1908 EVI.getIndices()) ==
1910 "Invalid ExtractValueInst operands!", &EVI);
1912 visitInstruction(EVI);
1915 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1916 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1917 IVI.getIndices()) ==
1918 IVI.getOperand(1)->getType(),
1919 "Invalid InsertValueInst operands!", &IVI);
1921 visitInstruction(IVI);
1924 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
1925 BasicBlock *BB = LPI.getParent();
1927 // The landingpad instruction is ill-formed if it doesn't have any clauses and
1929 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
1930 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
1932 // The landingpad instruction defines its parent as a landing pad block. The
1933 // landing pad block may be branched to only by the unwind edge of an invoke.
1934 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
1935 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
1936 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
1937 "Block containing LandingPadInst must be jumped to "
1938 "only by the unwind edge of an invoke.", &LPI);
1941 // The landingpad instruction must be the first non-PHI instruction in the
1943 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
1944 "LandingPadInst not the first non-PHI instruction in the block.",
1947 // The personality functions for all landingpad instructions within the same
1948 // function should match.
1950 Assert1(LPI.getPersonalityFn() == PersonalityFn,
1951 "Personality function doesn't match others in function", &LPI);
1952 PersonalityFn = LPI.getPersonalityFn();
1954 // All operands must be constants.
1955 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
1957 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
1958 Value *Clause = LPI.getClause(i);
1959 Assert1(isa<Constant>(Clause), "Clause is not constant!", &LPI);
1960 if (LPI.isCatch(i)) {
1961 Assert1(isa<PointerType>(Clause->getType()),
1962 "Catch operand does not have pointer type!", &LPI);
1964 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
1965 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
1966 "Filter operand is not an array of constants!", &LPI);
1970 visitInstruction(LPI);
1973 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
1974 Instruction *Op = cast<Instruction>(I.getOperand(i));
1975 // If the we have an invalid invoke, don't try to compute the dominance.
1976 // We already reject it in the invoke specific checks and the dominance
1977 // computation doesn't handle multiple edges.
1978 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1979 if (II->getNormalDest() == II->getUnwindDest())
1983 const Use &U = I.getOperandUse(i);
1984 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
1985 "Instruction does not dominate all uses!", Op, &I);
1988 /// verifyInstruction - Verify that an instruction is well formed.
1990 void Verifier::visitInstruction(Instruction &I) {
1991 BasicBlock *BB = I.getParent();
1992 Assert1(BB, "Instruction not embedded in basic block!", &I);
1994 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1995 for (User *U : I.users()) {
1996 Assert1(U != (User*)&I || !DT.isReachableFromEntry(BB),
1997 "Only PHI nodes may reference their own value!", &I);
2001 // Check that void typed values don't have names
2002 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2003 "Instruction has a name, but provides a void value!", &I);
2005 // Check that the return value of the instruction is either void or a legal
2007 Assert1(I.getType()->isVoidTy() ||
2008 I.getType()->isFirstClassType(),
2009 "Instruction returns a non-scalar type!", &I);
2011 // Check that the instruction doesn't produce metadata. Calls are already
2012 // checked against the callee type.
2013 Assert1(!I.getType()->isMetadataTy() ||
2014 isa<CallInst>(I) || isa<InvokeInst>(I),
2015 "Invalid use of metadata!", &I);
2017 // Check that all uses of the instruction, if they are instructions
2018 // themselves, actually have parent basic blocks. If the use is not an
2019 // instruction, it is an error!
2020 for (Use &U : I.uses()) {
2021 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
2022 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
2023 " embedded in a basic block!", &I, Used);
2025 CheckFailed("Use of instruction is not an instruction!", U);
2030 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2031 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
2033 // Check to make sure that only first-class-values are operands to
2035 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2036 Assert1(0, "Instruction operands must be first-class values!", &I);
2039 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2040 // Check to make sure that the "address of" an intrinsic function is never
2042 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
2043 "Cannot take the address of an intrinsic!", &I);
2044 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2045 F->getIntrinsicID() == Intrinsic::donothing,
2046 "Cannot invoke an intrinsinc other than donothing", &I);
2047 Assert1(F->getParent() == M, "Referencing function in another module!",
2049 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2050 Assert1(OpBB->getParent() == BB->getParent(),
2051 "Referring to a basic block in another function!", &I);
2052 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2053 Assert1(OpArg->getParent() == BB->getParent(),
2054 "Referring to an argument in another function!", &I);
2055 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2056 Assert1(GV->getParent() == M, "Referencing global in another module!",
2058 } else if (isa<Instruction>(I.getOperand(i))) {
2059 verifyDominatesUse(I, i);
2060 } else if (isa<InlineAsm>(I.getOperand(i))) {
2061 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2062 (i + 3 == e && isa<InvokeInst>(I)),
2063 "Cannot take the address of an inline asm!", &I);
2064 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2065 if (CE->getType()->isPtrOrPtrVectorTy()) {
2066 // If we have a ConstantExpr pointer, we need to see if it came from an
2067 // illegal bitcast (inttoptr <constant int> )
2068 SmallVector<const ConstantExpr *, 4> Stack;
2069 SmallPtrSet<const ConstantExpr *, 4> Visited;
2070 Stack.push_back(CE);
2072 while (!Stack.empty()) {
2073 const ConstantExpr *V = Stack.pop_back_val();
2074 if (!Visited.insert(V))
2077 VerifyConstantExprBitcastType(V);
2079 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2080 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2081 Stack.push_back(Op);
2088 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2089 Assert1(I.getType()->isFPOrFPVectorTy(),
2090 "fpmath requires a floating point result!", &I);
2091 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2092 Value *Op0 = MD->getOperand(0);
2093 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
2094 APFloat Accuracy = CFP0->getValueAPF();
2095 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2096 "fpmath accuracy not a positive number!", &I);
2098 Assert1(false, "invalid fpmath accuracy!", &I);
2102 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
2103 Assert1(!MD || isa<LoadInst>(I), "Ranges are only for loads!", &I);
2105 if (VerifyDebugInfo) {
2106 MD = I.getMetadata(LLVMContext::MD_dbg);
2107 Finder.processLocation(*M, DILocation(MD));
2110 InstsInThisBlock.insert(&I);
2113 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2114 /// intrinsic argument or return value) matches the type constraints specified
2115 /// by the .td file (e.g. an "any integer" argument really is an integer).
2117 /// This return true on error but does not print a message.
2118 bool Verifier::VerifyIntrinsicType(Type *Ty,
2119 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2120 SmallVectorImpl<Type*> &ArgTys) {
2121 using namespace Intrinsic;
2123 // If we ran out of descriptors, there are too many arguments.
2124 if (Infos.empty()) return true;
2125 IITDescriptor D = Infos.front();
2126 Infos = Infos.slice(1);
2129 case IITDescriptor::Void: return !Ty->isVoidTy();
2130 case IITDescriptor::VarArg: return true;
2131 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2132 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2133 case IITDescriptor::Half: return !Ty->isHalfTy();
2134 case IITDescriptor::Float: return !Ty->isFloatTy();
2135 case IITDescriptor::Double: return !Ty->isDoubleTy();
2136 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2137 case IITDescriptor::Vector: {
2138 VectorType *VT = dyn_cast<VectorType>(Ty);
2139 return VT == 0 || VT->getNumElements() != D.Vector_Width ||
2140 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2142 case IITDescriptor::Pointer: {
2143 PointerType *PT = dyn_cast<PointerType>(Ty);
2144 return PT == 0 || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2145 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2148 case IITDescriptor::Struct: {
2149 StructType *ST = dyn_cast<StructType>(Ty);
2150 if (ST == 0 || ST->getNumElements() != D.Struct_NumElements)
2153 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2154 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2159 case IITDescriptor::Argument:
2160 // Two cases here - If this is the second occurrence of an argument, verify
2161 // that the later instance matches the previous instance.
2162 if (D.getArgumentNumber() < ArgTys.size())
2163 return Ty != ArgTys[D.getArgumentNumber()];
2165 // Otherwise, if this is the first instance of an argument, record it and
2166 // verify the "Any" kind.
2167 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2168 ArgTys.push_back(Ty);
2170 switch (D.getArgumentKind()) {
2171 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2172 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2173 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2174 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2176 llvm_unreachable("all argument kinds not covered");
2178 case IITDescriptor::ExtendArgument: {
2179 // This may only be used when referring to a previous vector argument.
2180 if (D.getArgumentNumber() >= ArgTys.size())
2183 Type *NewTy = ArgTys[D.getArgumentNumber()];
2184 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2185 NewTy = VectorType::getExtendedElementVectorType(VTy);
2186 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2187 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2193 case IITDescriptor::TruncArgument: {
2194 // This may only be used when referring to a previous vector argument.
2195 if (D.getArgumentNumber() >= ArgTys.size())
2198 Type *NewTy = ArgTys[D.getArgumentNumber()];
2199 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2200 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2201 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2202 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
2208 case IITDescriptor::HalfVecArgument:
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::getHalfElementsVectorType(
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 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
2284 Assert1(ExpectedName == IF->getName(),
2285 "Intrinsic name not mangled correctly for type arguments! "
2286 "Should be: " + ExpectedName, IF);
2288 // If the intrinsic takes MDNode arguments, verify that they are either global
2289 // or are local to *this* function.
2290 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2291 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
2292 visitMDNode(*MD, CI.getParent()->getParent());
2297 case Intrinsic::ctlz: // llvm.ctlz
2298 case Intrinsic::cttz: // llvm.cttz
2299 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2300 "is_zero_undef argument of bit counting intrinsics must be a "
2301 "constant int", &CI);
2303 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2304 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2305 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2306 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
2307 Assert1(MD->getNumOperands() == 1,
2308 "invalid llvm.dbg.declare intrinsic call 2", &CI);
2309 if (VerifyDebugInfo)
2310 Finder.processDeclare(*M, cast<DbgDeclareInst>(&CI));
2312 case Intrinsic::dbg_value: { //llvm.dbg.value
2313 if (VerifyDebugInfo) {
2314 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2315 "invalid llvm.dbg.value intrinsic call 1", &CI);
2316 Finder.processValue(*M, cast<DbgValueInst>(&CI));
2320 case Intrinsic::memcpy:
2321 case Intrinsic::memmove:
2322 case Intrinsic::memset:
2323 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2324 "alignment argument of memory intrinsics must be a constant int",
2326 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2327 "isvolatile argument of memory intrinsics must be a constant int",
2330 case Intrinsic::gcroot:
2331 case Intrinsic::gcwrite:
2332 case Intrinsic::gcread:
2333 if (ID == Intrinsic::gcroot) {
2335 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2336 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2337 Assert1(isa<Constant>(CI.getArgOperand(1)),
2338 "llvm.gcroot parameter #2 must be a constant.", &CI);
2339 if (!AI->getType()->getElementType()->isPointerTy()) {
2340 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2341 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2342 "or argument #2 must be a non-null constant.", &CI);
2346 Assert1(CI.getParent()->getParent()->hasGC(),
2347 "Enclosing function does not use GC.", &CI);
2349 case Intrinsic::init_trampoline:
2350 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2351 "llvm.init_trampoline parameter #2 must resolve to a function.",
2354 case Intrinsic::prefetch:
2355 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2356 isa<ConstantInt>(CI.getArgOperand(2)) &&
2357 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2358 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2359 "invalid arguments to llvm.prefetch",
2362 case Intrinsic::stackprotector:
2363 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2364 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2367 case Intrinsic::lifetime_start:
2368 case Intrinsic::lifetime_end:
2369 case Intrinsic::invariant_start:
2370 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2371 "size argument of memory use markers must be a constant integer",
2374 case Intrinsic::invariant_end:
2375 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2376 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2381 void Verifier::verifyDebugInfo() {
2382 // Verify Debug Info.
2383 if (VerifyDebugInfo) {
2384 for (DICompileUnit CU : Finder.compile_units()) {
2385 Assert1(CU.Verify(), "DICompileUnit does not Verify!", CU);
2387 for (DISubprogram S : Finder.subprograms()) {
2388 Assert1(S.Verify(), "DISubprogram does not Verify!", S);
2390 for (DIGlobalVariable GV : Finder.global_variables()) {
2391 Assert1(GV.Verify(), "DIGlobalVariable does not Verify!", GV);
2393 for (DIType T : Finder.types()) {
2394 Assert1(T.Verify(), "DIType does not Verify!", T);
2396 for (DIScope S : Finder.scopes()) {
2397 Assert1(S.Verify(), "DIScope does not Verify!", S);
2402 //===----------------------------------------------------------------------===//
2403 // Implement the public interfaces to this file...
2404 //===----------------------------------------------------------------------===//
2406 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
2407 Function &F = const_cast<Function &>(f);
2408 assert(!F.isDeclaration() && "Cannot verify external functions");
2410 raw_null_ostream NullStr;
2411 Verifier V(OS ? *OS : NullStr);
2413 // Note that this function's return value is inverted from what you would
2414 // expect of a function called "verify".
2415 return !V.verify(F);
2418 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
2419 raw_null_ostream NullStr;
2420 Verifier V(OS ? *OS : NullStr);
2422 bool Broken = false;
2423 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
2424 if (!I->isDeclaration())
2425 Broken |= !V.verify(*I);
2427 // Note that this function's return value is inverted from what you would
2428 // expect of a function called "verify".
2429 return !V.verify(M) || Broken;
2433 struct VerifierLegacyPass : public FunctionPass {
2439 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
2440 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2442 explicit VerifierLegacyPass(bool FatalErrors)
2443 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2444 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2447 bool runOnFunction(Function &F) override {
2448 if (!V.verify(F) && FatalErrors)
2449 report_fatal_error("Broken function found, compilation aborted!");
2454 bool doFinalization(Module &M) override {
2455 if (!V.verify(M) && FatalErrors)
2456 report_fatal_error("Broken module found, compilation aborted!");
2461 void getAnalysisUsage(AnalysisUsage &AU) const override {
2462 AU.setPreservesAll();
2467 char VerifierLegacyPass::ID = 0;
2468 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
2470 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
2471 return new VerifierLegacyPass(FatalErrors);
2474 PreservedAnalyses VerifierPass::run(Module *M) {
2475 if (verifyModule(*M, &dbgs()) && FatalErrors)
2476 report_fatal_error("Broken module found, compilation aborted!");
2478 return PreservedAnalyses::all();
2481 PreservedAnalyses VerifierPass::run(Function *F) {
2482 if (verifyFunction(*F, &dbgs()) && FatalErrors)
2483 report_fatal_error("Broken function found, compilation aborted!");
2485 return PreservedAnalyses::all();