1 //===-- Verifier.cpp - Implement the Module Verifier -----------------------==//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the function verifier interface, that can be used for some
11 // sanity checking of input to the system.
13 // Note that this does not provide full `Java style' security and verifications,
14 // instead it just tries to ensure that code is well-formed.
16 // * Both of a binary operator's parameters are of the same type
17 // * Verify that the indices of mem access instructions match other operands
18 // * Verify that arithmetic and other things are only performed on first-class
19 // types. Verify that shifts & logicals only happen on integrals f.e.
20 // * All of the constants in a switch statement are of the correct type
21 // * The code is in valid SSA form
22 // * It should be illegal to put a label into any other type (like a structure)
23 // or to return one. [except constant arrays!]
24 // * Only phi nodes can be self referential: 'add i32 %0, %0 ; <int>:0' is bad
25 // * PHI nodes must have an entry for each predecessor, with no extras.
26 // * PHI nodes must be the first thing in a basic block, all grouped together
27 // * PHI nodes must have at least one entry
28 // * All basic blocks should only end with terminator insts, not contain them
29 // * The entry node to a function must not have predecessors
30 // * All Instructions must be embedded into a basic block
31 // * Functions cannot take a void-typed parameter
32 // * Verify that a function's argument list agrees with it's declared type.
33 // * It is illegal to specify a name for a void value.
34 // * It is illegal to have a internal global value with no initializer
35 // * It is illegal to have a ret instruction that returns a value that does not
36 // agree with the function return value type.
37 // * Function call argument types match the function prototype
38 // * A landing pad is defined by a landingpad instruction, and can be jumped to
39 // only by the unwind edge of an invoke instruction.
40 // * A landingpad instruction must be the first non-PHI instruction in the
42 // * All landingpad instructions must use the same personality function with
44 // * All other things that are tested by asserts spread about the code...
46 //===----------------------------------------------------------------------===//
48 #include "llvm/Analysis/Verifier.h"
49 #include "llvm/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/Analysis/Dominators.h"
55 #include "llvm/Assembly/Writer.h"
56 #include "llvm/IR/CallingConv.h"
57 #include "llvm/IR/Constants.h"
58 #include "llvm/IR/DerivedTypes.h"
59 #include "llvm/IR/InlineAsm.h"
60 #include "llvm/IR/IntrinsicInst.h"
61 #include "llvm/IR/LLVMContext.h"
62 #include "llvm/IR/Metadata.h"
63 #include "llvm/IR/Module.h"
64 #include "llvm/InstVisitor.h"
65 #include "llvm/Pass.h"
66 #include "llvm/PassManager.h"
67 #include "llvm/Support/CFG.h"
68 #include "llvm/Support/CallSite.h"
69 #include "llvm/Support/ConstantRange.h"
70 #include "llvm/Support/Debug.h"
71 #include "llvm/Support/ErrorHandling.h"
72 #include "llvm/Support/raw_ostream.h"
77 namespace { // Anonymous namespace for class
78 struct PreVerifier : public FunctionPass {
79 static char ID; // Pass ID, replacement for typeid
81 PreVerifier() : FunctionPass(ID) {
82 initializePreVerifierPass(*PassRegistry::getPassRegistry());
85 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
89 // Check that the prerequisites for successful DominatorTree construction
91 bool runOnFunction(Function &F) {
94 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
95 if (I->empty() || !I->back().isTerminator()) {
96 dbgs() << "Basic Block in function '" << F.getName()
97 << "' does not have terminator!\n";
98 WriteAsOperand(dbgs(), I, true);
105 report_fatal_error("Broken module, no Basic Block terminator!");
112 char PreVerifier::ID = 0;
113 INITIALIZE_PASS(PreVerifier, "preverify", "Preliminary module verification",
115 static char &PreVerifyID = PreVerifier::ID;
118 struct Verifier : public FunctionPass, public InstVisitor<Verifier> {
119 static char ID; // Pass ID, replacement for typeid
120 bool Broken; // Is this module found to be broken?
121 VerifierFailureAction action;
122 // What to do if verification fails.
123 Module *Mod; // Module we are verifying right now
124 LLVMContext *Context; // Context within which we are verifying
125 DominatorTree *DT; // Dominator Tree, caution can be null!
127 std::string Messages;
128 raw_string_ostream MessagesStr;
130 /// InstInThisBlock - when verifying a basic block, keep track of all of the
131 /// instructions we have seen so far. This allows us to do efficient
132 /// dominance checks for the case when an instruction has an operand that is
133 /// an instruction in the same block.
134 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
136 /// MDNodes - keep track of the metadata nodes that have been checked
138 SmallPtrSet<MDNode *, 32> MDNodes;
140 /// PersonalityFn - The personality function referenced by the
141 /// LandingPadInsts. All LandingPadInsts within the same function must use
142 /// the same personality function.
143 const Value *PersonalityFn;
146 : FunctionPass(ID), Broken(false),
147 action(AbortProcessAction), Mod(0), Context(0), DT(0),
148 MessagesStr(Messages), PersonalityFn(0) {
149 initializeVerifierPass(*PassRegistry::getPassRegistry());
151 explicit Verifier(VerifierFailureAction ctn)
152 : FunctionPass(ID), Broken(false), action(ctn), Mod(0),
153 Context(0), DT(0), MessagesStr(Messages), PersonalityFn(0) {
154 initializeVerifierPass(*PassRegistry::getPassRegistry());
157 bool doInitialization(Module &M) {
159 Context = &M.getContext();
161 // We must abort before returning back to the pass manager, or else the
162 // pass manager may try to run other passes on the broken module.
163 return abortIfBroken();
166 bool runOnFunction(Function &F) {
167 // Get dominator information if we are being run by PassManager
168 DT = &getAnalysis<DominatorTree>();
171 if (!Context) Context = &F.getContext();
174 InstsInThisBlock.clear();
177 // We must abort before returning back to the pass manager, or else the
178 // pass manager may try to run other passes on the broken module.
179 return abortIfBroken();
182 bool doFinalization(Module &M) {
183 // Scan through, checking all of the external function's linkage now...
184 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
185 visitGlobalValue(*I);
187 // Check to make sure function prototypes are okay.
188 if (I->isDeclaration()) visitFunction(*I);
191 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
193 visitGlobalVariable(*I);
195 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
197 visitGlobalAlias(*I);
199 for (Module::named_metadata_iterator I = M.named_metadata_begin(),
200 E = M.named_metadata_end(); I != E; ++I)
201 visitNamedMDNode(*I);
205 // If the module is broken, abort at this time.
206 return abortIfBroken();
209 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
210 AU.setPreservesAll();
211 AU.addRequiredID(PreVerifyID);
212 AU.addRequired<DominatorTree>();
215 /// abortIfBroken - If the module is broken and we are supposed to abort on
216 /// this condition, do so.
218 bool abortIfBroken() {
219 if (!Broken) return false;
220 MessagesStr << "Broken module found, ";
222 case AbortProcessAction:
223 MessagesStr << "compilation aborted!\n";
224 dbgs() << MessagesStr.str();
225 // Client should choose different reaction if abort is not desired
227 case PrintMessageAction:
228 MessagesStr << "verification continues.\n";
229 dbgs() << MessagesStr.str();
231 case ReturnStatusAction:
232 MessagesStr << "compilation terminated.\n";
235 llvm_unreachable("Invalid action");
239 // Verification methods...
240 void visitGlobalValue(GlobalValue &GV);
241 void visitGlobalVariable(GlobalVariable &GV);
242 void visitGlobalAlias(GlobalAlias &GA);
243 void visitNamedMDNode(NamedMDNode &NMD);
244 void visitMDNode(MDNode &MD, Function *F);
245 void visitModuleFlags(Module &M);
246 void visitModuleFlag(MDNode *Op, DenseMap<MDString*, MDNode*> &SeenIDs,
247 SmallVectorImpl<MDNode*> &Requirements);
248 void visitFunction(Function &F);
249 void visitBasicBlock(BasicBlock &BB);
250 using InstVisitor<Verifier>::visit;
252 void visit(Instruction &I);
254 void visitTruncInst(TruncInst &I);
255 void visitZExtInst(ZExtInst &I);
256 void visitSExtInst(SExtInst &I);
257 void visitFPTruncInst(FPTruncInst &I);
258 void visitFPExtInst(FPExtInst &I);
259 void visitFPToUIInst(FPToUIInst &I);
260 void visitFPToSIInst(FPToSIInst &I);
261 void visitUIToFPInst(UIToFPInst &I);
262 void visitSIToFPInst(SIToFPInst &I);
263 void visitIntToPtrInst(IntToPtrInst &I);
264 void visitPtrToIntInst(PtrToIntInst &I);
265 void visitBitCastInst(BitCastInst &I);
266 void visitPHINode(PHINode &PN);
267 void visitBinaryOperator(BinaryOperator &B);
268 void visitICmpInst(ICmpInst &IC);
269 void visitFCmpInst(FCmpInst &FC);
270 void visitExtractElementInst(ExtractElementInst &EI);
271 void visitInsertElementInst(InsertElementInst &EI);
272 void visitShuffleVectorInst(ShuffleVectorInst &EI);
273 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
274 void visitCallInst(CallInst &CI);
275 void visitInvokeInst(InvokeInst &II);
276 void visitGetElementPtrInst(GetElementPtrInst &GEP);
277 void visitLoadInst(LoadInst &LI);
278 void visitStoreInst(StoreInst &SI);
279 void verifyDominatesUse(Instruction &I, unsigned i);
280 void visitInstruction(Instruction &I);
281 void visitTerminatorInst(TerminatorInst &I);
282 void visitBranchInst(BranchInst &BI);
283 void visitReturnInst(ReturnInst &RI);
284 void visitSwitchInst(SwitchInst &SI);
285 void visitIndirectBrInst(IndirectBrInst &BI);
286 void visitSelectInst(SelectInst &SI);
287 void visitUserOp1(Instruction &I);
288 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
289 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
290 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
291 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
292 void visitFenceInst(FenceInst &FI);
293 void visitAllocaInst(AllocaInst &AI);
294 void visitExtractValueInst(ExtractValueInst &EVI);
295 void visitInsertValueInst(InsertValueInst &IVI);
296 void visitLandingPadInst(LandingPadInst &LPI);
298 void VerifyCallSite(CallSite CS);
299 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty,
300 int VT, unsigned ArgNo, std::string &Suffix);
301 bool VerifyIntrinsicType(Type *Ty,
302 ArrayRef<Intrinsic::IITDescriptor> &Infos,
303 SmallVectorImpl<Type*> &ArgTys);
304 void VerifyParameterAttrs(Attribute Attrs, Type *Ty,
305 bool isReturnValue, const Value *V);
306 void VerifyFunctionAttrs(FunctionType *FT, const AttributeSet &Attrs,
309 void WriteValue(const Value *V) {
311 if (isa<Instruction>(V)) {
312 MessagesStr << *V << '\n';
314 WriteAsOperand(MessagesStr, V, true, Mod);
319 void WriteType(Type *T) {
321 MessagesStr << ' ' << *T;
325 // CheckFailed - A check failed, so print out the condition and the message
326 // that failed. This provides a nice place to put a breakpoint if you want
327 // to see why something is not correct.
328 void CheckFailed(const Twine &Message,
329 const Value *V1 = 0, const Value *V2 = 0,
330 const Value *V3 = 0, const Value *V4 = 0) {
331 MessagesStr << Message.str() << "\n";
339 void CheckFailed(const Twine &Message, const Value *V1,
340 Type *T2, const Value *V3 = 0) {
341 MessagesStr << Message.str() << "\n";
348 void CheckFailed(const Twine &Message, Type *T1,
349 Type *T2 = 0, Type *T3 = 0) {
350 MessagesStr << Message.str() << "\n";
357 } // End anonymous namespace
359 char Verifier::ID = 0;
360 INITIALIZE_PASS_BEGIN(Verifier, "verify", "Module Verifier", false, false)
361 INITIALIZE_PASS_DEPENDENCY(PreVerifier)
362 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
363 INITIALIZE_PASS_END(Verifier, "verify", "Module Verifier", false, false)
365 // Assert - We know that cond should be true, if not print an error message.
366 #define Assert(C, M) \
367 do { if (!(C)) { CheckFailed(M); return; } } while (0)
368 #define Assert1(C, M, V1) \
369 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
370 #define Assert2(C, M, V1, V2) \
371 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
372 #define Assert3(C, M, V1, V2, V3) \
373 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
374 #define Assert4(C, M, V1, V2, V3, V4) \
375 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
377 void Verifier::visit(Instruction &I) {
378 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
379 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
380 InstVisitor<Verifier>::visit(I);
384 void Verifier::visitGlobalValue(GlobalValue &GV) {
385 Assert1(!GV.isDeclaration() ||
386 GV.isMaterializable() ||
387 GV.hasExternalLinkage() ||
388 GV.hasDLLImportLinkage() ||
389 GV.hasExternalWeakLinkage() ||
390 (isa<GlobalAlias>(GV) &&
391 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
392 "Global is external, but doesn't have external or dllimport or weak linkage!",
395 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
396 "Global is marked as dllimport, but not external", &GV);
398 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
399 "Only global variables can have appending linkage!", &GV);
401 if (GV.hasAppendingLinkage()) {
402 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
403 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
404 "Only global arrays can have appending linkage!", GVar);
407 Assert1(!GV.hasLinkOnceODRAutoHideLinkage() || GV.hasDefaultVisibility(),
408 "linkonce_odr_auto_hide can only have default visibility!",
412 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
413 if (GV.hasInitializer()) {
414 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
415 "Global variable initializer type does not match global "
416 "variable type!", &GV);
418 // If the global has common linkage, it must have a zero initializer and
419 // cannot be constant.
420 if (GV.hasCommonLinkage()) {
421 Assert1(GV.getInitializer()->isNullValue(),
422 "'common' global must have a zero initializer!", &GV);
423 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
427 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
428 GV.hasExternalWeakLinkage(),
429 "invalid linkage type for global declaration", &GV);
432 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
433 GV.getName() == "llvm.global_dtors")) {
434 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
435 "invalid linkage for intrinsic global variable", &GV);
436 // Don't worry about emitting an error for it not being an array,
437 // visitGlobalValue will complain on appending non-array.
438 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType())) {
439 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
440 PointerType *FuncPtrTy =
441 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
442 Assert1(STy && STy->getNumElements() == 2 &&
443 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
444 STy->getTypeAtIndex(1) == FuncPtrTy,
445 "wrong type for intrinsic global variable", &GV);
449 visitGlobalValue(GV);
452 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
453 Assert1(!GA.getName().empty(),
454 "Alias name cannot be empty!", &GA);
455 Assert1(GA.hasExternalLinkage() || GA.hasLocalLinkage() ||
457 "Alias should have external or external weak linkage!", &GA);
458 Assert1(GA.getAliasee(),
459 "Aliasee cannot be NULL!", &GA);
460 Assert1(GA.getType() == GA.getAliasee()->getType(),
461 "Alias and aliasee types should match!", &GA);
462 Assert1(!GA.hasUnnamedAddr(), "Alias cannot have unnamed_addr!", &GA);
464 if (!isa<GlobalValue>(GA.getAliasee())) {
465 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
467 (CE->getOpcode() == Instruction::BitCast ||
468 CE->getOpcode() == Instruction::GetElementPtr) &&
469 isa<GlobalValue>(CE->getOperand(0)),
470 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
474 const GlobalValue* Aliasee = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
476 "Aliasing chain should end with function or global variable", &GA);
478 visitGlobalValue(GA);
481 void Verifier::visitNamedMDNode(NamedMDNode &NMD) {
482 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
483 MDNode *MD = NMD.getOperand(i);
487 Assert1(!MD->isFunctionLocal(),
488 "Named metadata operand cannot be function local!", MD);
493 void Verifier::visitMDNode(MDNode &MD, Function *F) {
494 // Only visit each node once. Metadata can be mutually recursive, so this
495 // avoids infinite recursion here, as well as being an optimization.
496 if (!MDNodes.insert(&MD))
499 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
500 Value *Op = MD.getOperand(i);
503 if (isa<Constant>(Op) || isa<MDString>(Op))
505 if (MDNode *N = dyn_cast<MDNode>(Op)) {
506 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
507 "Global metadata operand cannot be function local!", &MD, N);
511 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
513 // If this was an instruction, bb, or argument, verify that it is in the
514 // function that we expect.
515 Function *ActualF = 0;
516 if (Instruction *I = dyn_cast<Instruction>(Op))
517 ActualF = I->getParent()->getParent();
518 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
519 ActualF = BB->getParent();
520 else if (Argument *A = dyn_cast<Argument>(Op))
521 ActualF = A->getParent();
522 assert(ActualF && "Unimplemented function local metadata case!");
524 Assert2(ActualF == F, "function-local metadata used in wrong function",
529 void Verifier::visitModuleFlags(Module &M) {
530 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
533 // Scan each flag, and track the flags and requirements.
534 DenseMap<MDString*, MDNode*> SeenIDs;
535 SmallVector<MDNode*, 16> Requirements;
536 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
537 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
540 // Validate that the requirements in the module are valid.
541 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
542 MDNode *Requirement = Requirements[I];
543 MDString *Flag = cast<MDString>(Requirement->getOperand(0));
544 Value *ReqValue = Requirement->getOperand(1);
546 MDNode *Op = SeenIDs.lookup(Flag);
548 CheckFailed("invalid requirement on flag, flag is not present in module",
553 if (Op->getOperand(2) != ReqValue) {
554 CheckFailed(("invalid requirement on flag, "
555 "flag does not have the required value"),
562 void Verifier::visitModuleFlag(MDNode *Op, DenseMap<MDString*, MDNode*>&SeenIDs,
563 SmallVectorImpl<MDNode*> &Requirements) {
564 // Each module flag should have three arguments, the merge behavior (a
565 // constant int), the flag ID (an MDString), and the value.
566 Assert1(Op->getNumOperands() == 3,
567 "incorrect number of operands in module flag", Op);
568 ConstantInt *Behavior = dyn_cast<ConstantInt>(Op->getOperand(0));
569 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
571 "invalid behavior operand in module flag (expected constant integer)",
573 unsigned BehaviorValue = Behavior->getZExtValue();
575 "invalid ID operand in module flag (expected metadata string)",
578 // Sanity check the values for behaviors with additional requirements.
579 switch (BehaviorValue) {
582 "invalid behavior operand in module flag (unexpected constant)",
587 case Module::Warning:
588 case Module::Override:
589 // These behavior types accept any value.
592 case Module::Require: {
593 // The value should itself be an MDNode with two operands, a flag ID (an
594 // MDString), and a value.
595 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
596 Assert1(Value && Value->getNumOperands() == 2,
597 "invalid value for 'require' module flag (expected metadata pair)",
599 Assert1(isa<MDString>(Value->getOperand(0)),
600 ("invalid value for 'require' module flag "
601 "(first value operand should be a string)"),
602 Value->getOperand(0));
604 // Append it to the list of requirements, to check once all module flags are
606 Requirements.push_back(Value);
611 case Module::AppendUnique: {
612 // These behavior types require the operand be an MDNode.
613 Assert1(isa<MDNode>(Op->getOperand(2)),
614 "invalid value for 'append'-type module flag "
615 "(expected a metadata node)", Op->getOperand(2));
620 // Unless this is a "requires" flag, check the ID is unique.
621 if (BehaviorValue != Module::Require) {
622 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
624 "module flag identifiers must be unique (or of 'require' type)",
629 // VerifyParameterAttrs - Check the given attributes for an argument or return
630 // value of the specified type. The value V is printed in error messages.
631 void Verifier::VerifyParameterAttrs(Attribute Attrs, Type *Ty,
632 bool isReturnValue, const Value *V) {
633 if (!Attrs.hasAttributes())
636 Assert1(!Attrs.hasAttribute(Attribute::NoReturn) &&
637 !Attrs.hasAttribute(Attribute::NoUnwind) &&
638 !Attrs.hasAttribute(Attribute::ReadNone) &&
639 !Attrs.hasAttribute(Attribute::ReadOnly) &&
640 !Attrs.hasAttribute(Attribute::NoInline) &&
641 !Attrs.hasAttribute(Attribute::AlwaysInline) &&
642 !Attrs.hasAttribute(Attribute::OptimizeForSize) &&
643 !Attrs.hasAttribute(Attribute::StackProtect) &&
644 !Attrs.hasAttribute(Attribute::StackProtectReq) &&
645 !Attrs.hasAttribute(Attribute::NoRedZone) &&
646 !Attrs.hasAttribute(Attribute::NoImplicitFloat) &&
647 !Attrs.hasAttribute(Attribute::Naked) &&
648 !Attrs.hasAttribute(Attribute::InlineHint) &&
649 !Attrs.hasAttribute(Attribute::StackAlignment) &&
650 !Attrs.hasAttribute(Attribute::UWTable) &&
651 !Attrs.hasAttribute(Attribute::NonLazyBind) &&
652 !Attrs.hasAttribute(Attribute::ReturnsTwice) &&
653 !Attrs.hasAttribute(Attribute::AddressSafety) &&
654 !Attrs.hasAttribute(Attribute::MinSize),
655 "Some attributes in '" + Attrs.getAsString() +
656 "' only apply to functions!", V);
659 Assert1(!Attrs.hasAttribute(Attribute::ByVal) &&
660 !Attrs.hasAttribute(Attribute::Nest) &&
661 !Attrs.hasAttribute(Attribute::StructRet) &&
662 !Attrs.hasAttribute(Attribute::NoCapture),
663 "Attribute 'byval', 'nest', 'sret', and 'nocapture' "
664 "do not apply to return values!", V);
666 // Check for mutually incompatible attributes.
667 Assert1(!((Attrs.hasAttribute(Attribute::ByVal) &&
668 Attrs.hasAttribute(Attribute::Nest)) ||
669 (Attrs.hasAttribute(Attribute::ByVal) &&
670 Attrs.hasAttribute(Attribute::StructRet)) ||
671 (Attrs.hasAttribute(Attribute::Nest) &&
672 Attrs.hasAttribute(Attribute::StructRet))), "Attributes "
673 "'byval, nest, and sret' are incompatible!", V);
675 Assert1(!((Attrs.hasAttribute(Attribute::ByVal) &&
676 Attrs.hasAttribute(Attribute::Nest)) ||
677 (Attrs.hasAttribute(Attribute::ByVal) &&
678 Attrs.hasAttribute(Attribute::InReg)) ||
679 (Attrs.hasAttribute(Attribute::Nest) &&
680 Attrs.hasAttribute(Attribute::InReg))), "Attributes "
681 "'byval, nest, and inreg' are incompatible!", V);
683 Assert1(!(Attrs.hasAttribute(Attribute::ZExt) &&
684 Attrs.hasAttribute(Attribute::SExt)), "Attributes "
685 "'zeroext and signext' are incompatible!", V);
687 Assert1(!(Attrs.hasAttribute(Attribute::ReadNone) &&
688 Attrs.hasAttribute(Attribute::ReadOnly)), "Attributes "
689 "'readnone and readonly' are incompatible!", V);
691 Assert1(!(Attrs.hasAttribute(Attribute::NoInline) &&
692 Attrs.hasAttribute(Attribute::AlwaysInline)), "Attributes "
693 "'noinline and alwaysinline' are incompatible!", V);
695 Assert1(!AttrBuilder(Attrs).
696 hasAttributes(Attribute::typeIncompatible(Ty)),
697 "Wrong types for attribute: " +
698 Attribute::typeIncompatible(Ty).getAsString(), V);
700 if (PointerType *PTy = dyn_cast<PointerType>(Ty))
701 Assert1(!Attrs.hasAttribute(Attribute::ByVal) ||
702 PTy->getElementType()->isSized(),
703 "Attribute 'byval' does not support unsized types!", V);
705 Assert1(!Attrs.hasAttribute(Attribute::ByVal),
706 "Attribute 'byval' only applies to parameters with pointer type!",
710 // VerifyFunctionAttrs - Check parameter attributes against a function type.
711 // The value V is printed in error messages.
712 void Verifier::VerifyFunctionAttrs(FunctionType *FT,
713 const AttributeSet &Attrs,
718 bool SawNest = false;
720 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
721 const AttributeWithIndex &Attr = Attrs.getSlot(i);
725 Ty = FT->getReturnType();
726 else if (Attr.Index-1 < FT->getNumParams())
727 Ty = FT->getParamType(Attr.Index-1);
729 break; // VarArgs attributes, verified elsewhere.
731 VerifyParameterAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
733 if (Attr.Attrs.hasAttribute(Attribute::Nest)) {
734 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
738 if (Attr.Attrs.hasAttribute(Attribute::StructRet))
739 Assert1(Attr.Index == 1, "Attribute sret is not on first parameter!", V);
742 Attribute FAttrs = Attrs.getFnAttributes();
743 AttrBuilder NotFn(FAttrs);
744 NotFn.removeFunctionOnlyAttrs();
745 Assert1(!NotFn.hasAttributes(), "Attribute '" +
746 Attribute::get(V->getContext(), NotFn).getAsString() +
747 "' do not apply to the function!", V);
749 // Check for mutually incompatible attributes.
750 Assert1(!((FAttrs.hasAttribute(Attribute::ByVal) &&
751 FAttrs.hasAttribute(Attribute::Nest)) ||
752 (FAttrs.hasAttribute(Attribute::ByVal) &&
753 FAttrs.hasAttribute(Attribute::StructRet)) ||
754 (FAttrs.hasAttribute(Attribute::Nest) &&
755 FAttrs.hasAttribute(Attribute::StructRet))), "Attributes "
756 "'byval, nest, and sret' are incompatible!", V);
758 Assert1(!((FAttrs.hasAttribute(Attribute::ByVal) &&
759 FAttrs.hasAttribute(Attribute::Nest)) ||
760 (FAttrs.hasAttribute(Attribute::ByVal) &&
761 FAttrs.hasAttribute(Attribute::InReg)) ||
762 (FAttrs.hasAttribute(Attribute::Nest) &&
763 FAttrs.hasAttribute(Attribute::InReg))), "Attributes "
764 "'byval, nest, and inreg' are incompatible!", V);
766 Assert1(!(FAttrs.hasAttribute(Attribute::ZExt) &&
767 FAttrs.hasAttribute(Attribute::SExt)), "Attributes "
768 "'zeroext and signext' are incompatible!", V);
770 Assert1(!(FAttrs.hasAttribute(Attribute::ReadNone) &&
771 FAttrs.hasAttribute(Attribute::ReadOnly)), "Attributes "
772 "'readnone and readonly' are incompatible!", V);
774 Assert1(!(FAttrs.hasAttribute(Attribute::NoInline) &&
775 FAttrs.hasAttribute(Attribute::AlwaysInline)), "Attributes "
776 "'noinline and alwaysinline' are incompatible!", V);
779 static bool VerifyAttributeCount(const AttributeSet &Attrs, unsigned Params) {
783 unsigned LastSlot = Attrs.getNumSlots() - 1;
784 unsigned LastIndex = Attrs.getSlot(LastSlot).Index;
785 if (LastIndex <= Params
786 || (LastIndex == (unsigned)~0
787 && (LastSlot == 0 || Attrs.getSlot(LastSlot - 1).Index <= Params)))
793 // visitFunction - Verify that a function is ok.
795 void Verifier::visitFunction(Function &F) {
796 // Check function arguments.
797 FunctionType *FT = F.getFunctionType();
798 unsigned NumArgs = F.arg_size();
800 Assert1(Context == &F.getContext(),
801 "Function context does not match Module context!", &F);
803 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
804 Assert2(FT->getNumParams() == NumArgs,
805 "# formal arguments must match # of arguments for function type!",
807 Assert1(F.getReturnType()->isFirstClassType() ||
808 F.getReturnType()->isVoidTy() ||
809 F.getReturnType()->isStructTy(),
810 "Functions cannot return aggregate values!", &F);
812 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
813 "Invalid struct return type!", &F);
815 const AttributeSet &Attrs = F.getAttributes();
817 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
818 "Attribute after last parameter!", &F);
820 // Check function attributes.
821 VerifyFunctionAttrs(FT, Attrs, &F);
823 // Check that this function meets the restrictions on this calling convention.
824 switch (F.getCallingConv()) {
829 case CallingConv::Fast:
830 case CallingConv::Cold:
831 case CallingConv::X86_FastCall:
832 case CallingConv::X86_ThisCall:
833 case CallingConv::Intel_OCL_BI:
834 case CallingConv::PTX_Kernel:
835 case CallingConv::PTX_Device:
836 Assert1(!F.isVarArg(),
837 "Varargs functions must have C calling conventions!", &F);
841 bool isLLVMdotName = F.getName().size() >= 5 &&
842 F.getName().substr(0, 5) == "llvm.";
844 // Check that the argument values match the function type for this function...
846 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
848 Assert2(I->getType() == FT->getParamType(i),
849 "Argument value does not match function argument type!",
850 I, FT->getParamType(i));
851 Assert1(I->getType()->isFirstClassType(),
852 "Function arguments must have first-class types!", I);
854 Assert2(!I->getType()->isMetadataTy(),
855 "Function takes metadata but isn't an intrinsic", I, &F);
858 if (F.isMaterializable()) {
859 // Function has a body somewhere we can't see.
860 } else if (F.isDeclaration()) {
861 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
862 F.hasExternalWeakLinkage(),
863 "invalid linkage type for function declaration", &F);
865 // Verify that this function (which has a body) is not named "llvm.*". It
866 // is not legal to define intrinsics.
867 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
869 // Check the entry node
870 BasicBlock *Entry = &F.getEntryBlock();
871 Assert1(pred_begin(Entry) == pred_end(Entry),
872 "Entry block to function must not have predecessors!", Entry);
874 // The address of the entry block cannot be taken, unless it is dead.
875 if (Entry->hasAddressTaken()) {
876 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
877 "blockaddress may not be used with the entry block!", Entry);
881 // If this function is actually an intrinsic, verify that it is only used in
882 // direct call/invokes, never having its "address taken".
883 if (F.getIntrinsicID()) {
885 if (F.hasAddressTaken(&U))
886 Assert1(0, "Invalid user of intrinsic instruction!", U);
890 // verifyBasicBlock - Verify that a basic block is well formed...
892 void Verifier::visitBasicBlock(BasicBlock &BB) {
893 InstsInThisBlock.clear();
895 // Ensure that basic blocks have terminators!
896 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
898 // Check constraints that this basic block imposes on all of the PHI nodes in
900 if (isa<PHINode>(BB.front())) {
901 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
902 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
903 std::sort(Preds.begin(), Preds.end());
905 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
906 // Ensure that PHI nodes have at least one entry!
907 Assert1(PN->getNumIncomingValues() != 0,
908 "PHI nodes must have at least one entry. If the block is dead, "
909 "the PHI should be removed!", PN);
910 Assert1(PN->getNumIncomingValues() == Preds.size(),
911 "PHINode should have one entry for each predecessor of its "
912 "parent basic block!", PN);
914 // Get and sort all incoming values in the PHI node...
916 Values.reserve(PN->getNumIncomingValues());
917 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
918 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
919 PN->getIncomingValue(i)));
920 std::sort(Values.begin(), Values.end());
922 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
923 // Check to make sure that if there is more than one entry for a
924 // particular basic block in this PHI node, that the incoming values are
927 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
928 Values[i].second == Values[i-1].second,
929 "PHI node has multiple entries for the same basic block with "
930 "different incoming values!", PN, Values[i].first,
931 Values[i].second, Values[i-1].second);
933 // Check to make sure that the predecessors and PHI node entries are
935 Assert3(Values[i].first == Preds[i],
936 "PHI node entries do not match predecessors!", PN,
937 Values[i].first, Preds[i]);
943 void Verifier::visitTerminatorInst(TerminatorInst &I) {
944 // Ensure that terminators only exist at the end of the basic block.
945 Assert1(&I == I.getParent()->getTerminator(),
946 "Terminator found in the middle of a basic block!", I.getParent());
950 void Verifier::visitBranchInst(BranchInst &BI) {
951 if (BI.isConditional()) {
952 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
953 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
955 visitTerminatorInst(BI);
958 void Verifier::visitReturnInst(ReturnInst &RI) {
959 Function *F = RI.getParent()->getParent();
960 unsigned N = RI.getNumOperands();
961 if (F->getReturnType()->isVoidTy())
963 "Found return instr that returns non-void in Function of void "
964 "return type!", &RI, F->getReturnType());
966 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
967 "Function return type does not match operand "
968 "type of return inst!", &RI, F->getReturnType());
970 // Check to make sure that the return value has necessary properties for
972 visitTerminatorInst(RI);
975 void Verifier::visitSwitchInst(SwitchInst &SI) {
976 // Check to make sure that all of the constants in the switch instruction
977 // have the same type as the switched-on value.
978 Type *SwitchTy = SI.getCondition()->getType();
979 IntegerType *IntTy = cast<IntegerType>(SwitchTy);
980 IntegersSubsetToBB Mapping;
981 std::map<IntegersSubset::Range, unsigned> RangeSetMap;
982 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
983 IntegersSubset CaseRanges = i.getCaseValueEx();
984 for (unsigned ri = 0, rie = CaseRanges.getNumItems(); ri < rie; ++ri) {
985 IntegersSubset::Range r = CaseRanges.getItem(ri);
986 Assert1(((const APInt&)r.getLow()).getBitWidth() == IntTy->getBitWidth(),
987 "Switch constants must all be same type as switch value!", &SI);
988 Assert1(((const APInt&)r.getHigh()).getBitWidth() == IntTy->getBitWidth(),
989 "Switch constants must all be same type as switch value!", &SI);
991 RangeSetMap[r] = i.getCaseIndex();
995 IntegersSubsetToBB::RangeIterator errItem;
996 if (!Mapping.verify(errItem)) {
997 unsigned CaseIndex = RangeSetMap[errItem->first];
998 SwitchInst::CaseIt i(&SI, CaseIndex);
999 Assert2(false, "Duplicate integer as switch case", &SI, i.getCaseValueEx());
1002 visitTerminatorInst(SI);
1005 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1006 Assert1(BI.getAddress()->getType()->isPointerTy(),
1007 "Indirectbr operand must have pointer type!", &BI);
1008 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1009 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1010 "Indirectbr destinations must all have pointer type!", &BI);
1012 visitTerminatorInst(BI);
1015 void Verifier::visitSelectInst(SelectInst &SI) {
1016 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1018 "Invalid operands for select instruction!", &SI);
1020 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1021 "Select values must have same type as select instruction!", &SI);
1022 visitInstruction(SI);
1025 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1026 /// a pass, if any exist, it's an error.
1028 void Verifier::visitUserOp1(Instruction &I) {
1029 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1032 void Verifier::visitTruncInst(TruncInst &I) {
1033 // Get the source and destination types
1034 Type *SrcTy = I.getOperand(0)->getType();
1035 Type *DestTy = I.getType();
1037 // Get the size of the types in bits, we'll need this later
1038 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1039 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1041 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1042 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1043 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1044 "trunc source and destination must both be a vector or neither", &I);
1045 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1047 visitInstruction(I);
1050 void Verifier::visitZExtInst(ZExtInst &I) {
1051 // Get the source and destination types
1052 Type *SrcTy = I.getOperand(0)->getType();
1053 Type *DestTy = I.getType();
1055 // Get the size of the types in bits, we'll need this later
1056 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1057 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1058 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1059 "zext source and destination must both be a vector or neither", &I);
1060 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1061 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1063 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1065 visitInstruction(I);
1068 void Verifier::visitSExtInst(SExtInst &I) {
1069 // Get the source and destination types
1070 Type *SrcTy = I.getOperand(0)->getType();
1071 Type *DestTy = I.getType();
1073 // Get the size of the types in bits, we'll need this later
1074 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1075 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1077 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1078 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1079 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1080 "sext source and destination must both be a vector or neither", &I);
1081 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1083 visitInstruction(I);
1086 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1087 // Get the source and destination types
1088 Type *SrcTy = I.getOperand(0)->getType();
1089 Type *DestTy = I.getType();
1090 // Get the size of the types in bits, we'll need this later
1091 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1092 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1094 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1095 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1096 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1097 "fptrunc source and destination must both be a vector or neither",&I);
1098 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1100 visitInstruction(I);
1103 void Verifier::visitFPExtInst(FPExtInst &I) {
1104 // Get the source and destination types
1105 Type *SrcTy = I.getOperand(0)->getType();
1106 Type *DestTy = I.getType();
1108 // Get the size of the types in bits, we'll need this later
1109 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1110 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1112 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1113 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1114 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1115 "fpext source and destination must both be a vector or neither", &I);
1116 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1118 visitInstruction(I);
1121 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1122 // Get the source and destination types
1123 Type *SrcTy = I.getOperand(0)->getType();
1124 Type *DestTy = I.getType();
1126 bool SrcVec = SrcTy->isVectorTy();
1127 bool DstVec = DestTy->isVectorTy();
1129 Assert1(SrcVec == DstVec,
1130 "UIToFP source and dest must both be vector or scalar", &I);
1131 Assert1(SrcTy->isIntOrIntVectorTy(),
1132 "UIToFP source must be integer or integer vector", &I);
1133 Assert1(DestTy->isFPOrFPVectorTy(),
1134 "UIToFP result must be FP or FP vector", &I);
1136 if (SrcVec && DstVec)
1137 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1138 cast<VectorType>(DestTy)->getNumElements(),
1139 "UIToFP source and dest vector length mismatch", &I);
1141 visitInstruction(I);
1144 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1145 // Get the source and destination types
1146 Type *SrcTy = I.getOperand(0)->getType();
1147 Type *DestTy = I.getType();
1149 bool SrcVec = SrcTy->isVectorTy();
1150 bool DstVec = DestTy->isVectorTy();
1152 Assert1(SrcVec == DstVec,
1153 "SIToFP source and dest must both be vector or scalar", &I);
1154 Assert1(SrcTy->isIntOrIntVectorTy(),
1155 "SIToFP source must be integer or integer vector", &I);
1156 Assert1(DestTy->isFPOrFPVectorTy(),
1157 "SIToFP result must be FP or FP vector", &I);
1159 if (SrcVec && DstVec)
1160 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1161 cast<VectorType>(DestTy)->getNumElements(),
1162 "SIToFP source and dest vector length mismatch", &I);
1164 visitInstruction(I);
1167 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1168 // Get the source and destination types
1169 Type *SrcTy = I.getOperand(0)->getType();
1170 Type *DestTy = I.getType();
1172 bool SrcVec = SrcTy->isVectorTy();
1173 bool DstVec = DestTy->isVectorTy();
1175 Assert1(SrcVec == DstVec,
1176 "FPToUI source and dest must both be vector or scalar", &I);
1177 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1179 Assert1(DestTy->isIntOrIntVectorTy(),
1180 "FPToUI result must be integer or integer vector", &I);
1182 if (SrcVec && DstVec)
1183 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1184 cast<VectorType>(DestTy)->getNumElements(),
1185 "FPToUI source and dest vector length mismatch", &I);
1187 visitInstruction(I);
1190 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1191 // Get the source and destination types
1192 Type *SrcTy = I.getOperand(0)->getType();
1193 Type *DestTy = I.getType();
1195 bool SrcVec = SrcTy->isVectorTy();
1196 bool DstVec = DestTy->isVectorTy();
1198 Assert1(SrcVec == DstVec,
1199 "FPToSI source and dest must both be vector or scalar", &I);
1200 Assert1(SrcTy->isFPOrFPVectorTy(),
1201 "FPToSI source must be FP or FP vector", &I);
1202 Assert1(DestTy->isIntOrIntVectorTy(),
1203 "FPToSI result must be integer or integer vector", &I);
1205 if (SrcVec && DstVec)
1206 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1207 cast<VectorType>(DestTy)->getNumElements(),
1208 "FPToSI source and dest vector length mismatch", &I);
1210 visitInstruction(I);
1213 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1214 // Get the source and destination types
1215 Type *SrcTy = I.getOperand(0)->getType();
1216 Type *DestTy = I.getType();
1218 Assert1(SrcTy->getScalarType()->isPointerTy(),
1219 "PtrToInt source must be pointer", &I);
1220 Assert1(DestTy->getScalarType()->isIntegerTy(),
1221 "PtrToInt result must be integral", &I);
1222 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1223 "PtrToInt type mismatch", &I);
1225 if (SrcTy->isVectorTy()) {
1226 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1227 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1228 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1229 "PtrToInt Vector width mismatch", &I);
1232 visitInstruction(I);
1235 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1236 // Get the source and destination types
1237 Type *SrcTy = I.getOperand(0)->getType();
1238 Type *DestTy = I.getType();
1240 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1241 "IntToPtr source must be an integral", &I);
1242 Assert1(DestTy->getScalarType()->isPointerTy(),
1243 "IntToPtr result must be a pointer",&I);
1244 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1245 "IntToPtr type mismatch", &I);
1246 if (SrcTy->isVectorTy()) {
1247 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1248 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1249 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1250 "IntToPtr Vector width mismatch", &I);
1252 visitInstruction(I);
1255 void Verifier::visitBitCastInst(BitCastInst &I) {
1256 // Get the source and destination types
1257 Type *SrcTy = I.getOperand(0)->getType();
1258 Type *DestTy = I.getType();
1260 // Get the size of the types in bits, we'll need this later
1261 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1262 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
1264 // BitCast implies a no-op cast of type only. No bits change.
1265 // However, you can't cast pointers to anything but pointers.
1266 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
1267 "Bitcast requires both operands to be pointer or neither", &I);
1268 Assert1(SrcBitSize == DestBitSize, "Bitcast requires types of same width",&I);
1270 // Disallow aggregates.
1271 Assert1(!SrcTy->isAggregateType(),
1272 "Bitcast operand must not be aggregate", &I);
1273 Assert1(!DestTy->isAggregateType(),
1274 "Bitcast type must not be aggregate", &I);
1276 visitInstruction(I);
1279 /// visitPHINode - Ensure that a PHI node is well formed.
1281 void Verifier::visitPHINode(PHINode &PN) {
1282 // Ensure that the PHI nodes are all grouped together at the top of the block.
1283 // This can be tested by checking whether the instruction before this is
1284 // either nonexistent (because this is begin()) or is a PHI node. If not,
1285 // then there is some other instruction before a PHI.
1286 Assert2(&PN == &PN.getParent()->front() ||
1287 isa<PHINode>(--BasicBlock::iterator(&PN)),
1288 "PHI nodes not grouped at top of basic block!",
1289 &PN, PN.getParent());
1291 // Check that all of the values of the PHI node have the same type as the
1292 // result, and that the incoming blocks are really basic blocks.
1293 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1294 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1295 "PHI node operands are not the same type as the result!", &PN);
1298 // All other PHI node constraints are checked in the visitBasicBlock method.
1300 visitInstruction(PN);
1303 void Verifier::VerifyCallSite(CallSite CS) {
1304 Instruction *I = CS.getInstruction();
1306 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1307 "Called function must be a pointer!", I);
1308 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1310 Assert1(FPTy->getElementType()->isFunctionTy(),
1311 "Called function is not pointer to function type!", I);
1312 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1314 // Verify that the correct number of arguments are being passed
1315 if (FTy->isVarArg())
1316 Assert1(CS.arg_size() >= FTy->getNumParams(),
1317 "Called function requires more parameters than were provided!",I);
1319 Assert1(CS.arg_size() == FTy->getNumParams(),
1320 "Incorrect number of arguments passed to called function!", I);
1322 // Verify that all arguments to the call match the function type.
1323 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1324 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1325 "Call parameter type does not match function signature!",
1326 CS.getArgument(i), FTy->getParamType(i), I);
1328 const AttributeSet &Attrs = CS.getAttributes();
1330 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1331 "Attribute after last parameter!", I);
1333 // Verify call attributes.
1334 VerifyFunctionAttrs(FTy, Attrs, I);
1336 if (FTy->isVarArg())
1337 // Check attributes on the varargs part.
1338 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1339 Attribute Attr = Attrs.getParamAttributes(Idx);
1341 VerifyParameterAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
1343 Assert1(!Attr.hasAttribute(Attribute::StructRet),
1344 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1347 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1348 if (CS.getCalledFunction() == 0 ||
1349 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1350 for (FunctionType::param_iterator PI = FTy->param_begin(),
1351 PE = FTy->param_end(); PI != PE; ++PI)
1352 Assert1(!(*PI)->isMetadataTy(),
1353 "Function has metadata parameter but isn't an intrinsic", I);
1356 visitInstruction(*I);
1359 void Verifier::visitCallInst(CallInst &CI) {
1360 VerifyCallSite(&CI);
1362 if (Function *F = CI.getCalledFunction())
1363 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1364 visitIntrinsicFunctionCall(ID, CI);
1367 void Verifier::visitInvokeInst(InvokeInst &II) {
1368 VerifyCallSite(&II);
1370 // Verify that there is a landingpad instruction as the first non-PHI
1371 // instruction of the 'unwind' destination.
1372 Assert1(II.getUnwindDest()->isLandingPad(),
1373 "The unwind destination does not have a landingpad instruction!",&II);
1375 visitTerminatorInst(II);
1378 /// visitBinaryOperator - Check that both arguments to the binary operator are
1379 /// of the same type!
1381 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1382 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1383 "Both operands to a binary operator are not of the same type!", &B);
1385 switch (B.getOpcode()) {
1386 // Check that integer arithmetic operators are only used with
1387 // integral operands.
1388 case Instruction::Add:
1389 case Instruction::Sub:
1390 case Instruction::Mul:
1391 case Instruction::SDiv:
1392 case Instruction::UDiv:
1393 case Instruction::SRem:
1394 case Instruction::URem:
1395 Assert1(B.getType()->isIntOrIntVectorTy(),
1396 "Integer arithmetic operators only work with integral types!", &B);
1397 Assert1(B.getType() == B.getOperand(0)->getType(),
1398 "Integer arithmetic operators must have same type "
1399 "for operands and result!", &B);
1401 // Check that floating-point arithmetic operators are only used with
1402 // floating-point operands.
1403 case Instruction::FAdd:
1404 case Instruction::FSub:
1405 case Instruction::FMul:
1406 case Instruction::FDiv:
1407 case Instruction::FRem:
1408 Assert1(B.getType()->isFPOrFPVectorTy(),
1409 "Floating-point arithmetic operators only work with "
1410 "floating-point types!", &B);
1411 Assert1(B.getType() == B.getOperand(0)->getType(),
1412 "Floating-point arithmetic operators must have same type "
1413 "for operands and result!", &B);
1415 // Check that logical operators are only used with integral operands.
1416 case Instruction::And:
1417 case Instruction::Or:
1418 case Instruction::Xor:
1419 Assert1(B.getType()->isIntOrIntVectorTy(),
1420 "Logical operators only work with integral types!", &B);
1421 Assert1(B.getType() == B.getOperand(0)->getType(),
1422 "Logical operators must have same type for operands and result!",
1425 case Instruction::Shl:
1426 case Instruction::LShr:
1427 case Instruction::AShr:
1428 Assert1(B.getType()->isIntOrIntVectorTy(),
1429 "Shifts only work with integral types!", &B);
1430 Assert1(B.getType() == B.getOperand(0)->getType(),
1431 "Shift return type must be same as operands!", &B);
1434 llvm_unreachable("Unknown BinaryOperator opcode!");
1437 visitInstruction(B);
1440 void Verifier::visitICmpInst(ICmpInst &IC) {
1441 // Check that the operands are the same type
1442 Type *Op0Ty = IC.getOperand(0)->getType();
1443 Type *Op1Ty = IC.getOperand(1)->getType();
1444 Assert1(Op0Ty == Op1Ty,
1445 "Both operands to ICmp instruction are not of the same type!", &IC);
1446 // Check that the operands are the right type
1447 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1448 "Invalid operand types for ICmp instruction", &IC);
1449 // Check that the predicate is valid.
1450 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1451 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1452 "Invalid predicate in ICmp instruction!", &IC);
1454 visitInstruction(IC);
1457 void Verifier::visitFCmpInst(FCmpInst &FC) {
1458 // Check that the operands are the same type
1459 Type *Op0Ty = FC.getOperand(0)->getType();
1460 Type *Op1Ty = FC.getOperand(1)->getType();
1461 Assert1(Op0Ty == Op1Ty,
1462 "Both operands to FCmp instruction are not of the same type!", &FC);
1463 // Check that the operands are the right type
1464 Assert1(Op0Ty->isFPOrFPVectorTy(),
1465 "Invalid operand types for FCmp instruction", &FC);
1466 // Check that the predicate is valid.
1467 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1468 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1469 "Invalid predicate in FCmp instruction!", &FC);
1471 visitInstruction(FC);
1474 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1475 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1477 "Invalid extractelement operands!", &EI);
1478 visitInstruction(EI);
1481 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1482 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1485 "Invalid insertelement operands!", &IE);
1486 visitInstruction(IE);
1489 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1490 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1492 "Invalid shufflevector operands!", &SV);
1493 visitInstruction(SV);
1496 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1497 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1499 Assert1(isa<PointerType>(TargetTy),
1500 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1501 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1502 "GEP into unsized type!", &GEP);
1503 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1504 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1507 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1509 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1510 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1512 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1513 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1514 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1516 if (GEP.getPointerOperandType()->isVectorTy()) {
1517 // Additional checks for vector GEPs.
1518 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1519 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1520 "Vector GEP result width doesn't match operand's", &GEP);
1521 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1522 Type *IndexTy = Idxs[i]->getType();
1523 Assert1(IndexTy->isVectorTy(),
1524 "Vector GEP must have vector indices!", &GEP);
1525 unsigned IndexWidth = IndexTy->getVectorNumElements();
1526 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1529 visitInstruction(GEP);
1532 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1533 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1536 void Verifier::visitLoadInst(LoadInst &LI) {
1537 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1538 Assert1(PTy, "Load operand must be a pointer.", &LI);
1539 Type *ElTy = PTy->getElementType();
1540 Assert2(ElTy == LI.getType(),
1541 "Load result type does not match pointer operand type!", &LI, ElTy);
1542 if (LI.isAtomic()) {
1543 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1544 "Load cannot have Release ordering", &LI);
1545 Assert1(LI.getAlignment() != 0,
1546 "Atomic load must specify explicit alignment", &LI);
1547 if (!ElTy->isPointerTy()) {
1548 Assert2(ElTy->isIntegerTy(),
1549 "atomic store operand must have integer type!",
1551 unsigned Size = ElTy->getPrimitiveSizeInBits();
1552 Assert2(Size >= 8 && !(Size & (Size - 1)),
1553 "atomic store operand must be power-of-two byte-sized integer",
1557 Assert1(LI.getSynchScope() == CrossThread,
1558 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1561 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1562 unsigned NumOperands = Range->getNumOperands();
1563 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1564 unsigned NumRanges = NumOperands / 2;
1565 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1567 ConstantRange LastRange(1); // Dummy initial value
1568 for (unsigned i = 0; i < NumRanges; ++i) {
1569 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1570 Assert1(Low, "The lower limit must be an integer!", Low);
1571 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1572 Assert1(High, "The upper limit must be an integer!", High);
1573 Assert1(High->getType() == Low->getType() &&
1574 High->getType() == ElTy, "Range types must match load type!",
1577 APInt HighV = High->getValue();
1578 APInt LowV = Low->getValue();
1579 ConstantRange CurRange(LowV, HighV);
1580 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1581 "Range must not be empty!", Range);
1583 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1584 "Intervals are overlapping", Range);
1585 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1587 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1590 LastRange = ConstantRange(LowV, HighV);
1592 if (NumRanges > 2) {
1594 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1596 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1597 ConstantRange FirstRange(FirstLow, FirstHigh);
1598 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1599 "Intervals are overlapping", Range);
1600 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1607 visitInstruction(LI);
1610 void Verifier::visitStoreInst(StoreInst &SI) {
1611 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1612 Assert1(PTy, "Store operand must be a pointer.", &SI);
1613 Type *ElTy = PTy->getElementType();
1614 Assert2(ElTy == SI.getOperand(0)->getType(),
1615 "Stored value type does not match pointer operand type!",
1617 if (SI.isAtomic()) {
1618 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1619 "Store cannot have Acquire ordering", &SI);
1620 Assert1(SI.getAlignment() != 0,
1621 "Atomic store must specify explicit alignment", &SI);
1622 if (!ElTy->isPointerTy()) {
1623 Assert2(ElTy->isIntegerTy(),
1624 "atomic store operand must have integer type!",
1626 unsigned Size = ElTy->getPrimitiveSizeInBits();
1627 Assert2(Size >= 8 && !(Size & (Size - 1)),
1628 "atomic store operand must be power-of-two byte-sized integer",
1632 Assert1(SI.getSynchScope() == CrossThread,
1633 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1635 visitInstruction(SI);
1638 void Verifier::visitAllocaInst(AllocaInst &AI) {
1639 PointerType *PTy = AI.getType();
1640 Assert1(PTy->getAddressSpace() == 0,
1641 "Allocation instruction pointer not in the generic address space!",
1643 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1645 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
1646 "Alloca array size must have integer type", &AI);
1647 visitInstruction(AI);
1650 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
1651 Assert1(CXI.getOrdering() != NotAtomic,
1652 "cmpxchg instructions must be atomic.", &CXI);
1653 Assert1(CXI.getOrdering() != Unordered,
1654 "cmpxchg instructions cannot be unordered.", &CXI);
1655 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
1656 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
1657 Type *ElTy = PTy->getElementType();
1658 Assert2(ElTy->isIntegerTy(),
1659 "cmpxchg operand must have integer type!",
1661 unsigned Size = ElTy->getPrimitiveSizeInBits();
1662 Assert2(Size >= 8 && !(Size & (Size - 1)),
1663 "cmpxchg operand must be power-of-two byte-sized integer",
1665 Assert2(ElTy == CXI.getOperand(1)->getType(),
1666 "Expected value type does not match pointer operand type!",
1668 Assert2(ElTy == CXI.getOperand(2)->getType(),
1669 "Stored value type does not match pointer operand type!",
1671 visitInstruction(CXI);
1674 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
1675 Assert1(RMWI.getOrdering() != NotAtomic,
1676 "atomicrmw instructions must be atomic.", &RMWI);
1677 Assert1(RMWI.getOrdering() != Unordered,
1678 "atomicrmw instructions cannot be unordered.", &RMWI);
1679 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
1680 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
1681 Type *ElTy = PTy->getElementType();
1682 Assert2(ElTy->isIntegerTy(),
1683 "atomicrmw operand must have integer type!",
1685 unsigned Size = ElTy->getPrimitiveSizeInBits();
1686 Assert2(Size >= 8 && !(Size & (Size - 1)),
1687 "atomicrmw operand must be power-of-two byte-sized integer",
1689 Assert2(ElTy == RMWI.getOperand(1)->getType(),
1690 "Argument value type does not match pointer operand type!",
1692 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
1693 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
1694 "Invalid binary operation!", &RMWI);
1695 visitInstruction(RMWI);
1698 void Verifier::visitFenceInst(FenceInst &FI) {
1699 const AtomicOrdering Ordering = FI.getOrdering();
1700 Assert1(Ordering == Acquire || Ordering == Release ||
1701 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
1702 "fence instructions may only have "
1703 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
1704 visitInstruction(FI);
1707 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1708 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1709 EVI.getIndices()) ==
1711 "Invalid ExtractValueInst operands!", &EVI);
1713 visitInstruction(EVI);
1716 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1717 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1718 IVI.getIndices()) ==
1719 IVI.getOperand(1)->getType(),
1720 "Invalid InsertValueInst operands!", &IVI);
1722 visitInstruction(IVI);
1725 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
1726 BasicBlock *BB = LPI.getParent();
1728 // The landingpad instruction is ill-formed if it doesn't have any clauses and
1730 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
1731 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
1733 // The landingpad instruction defines its parent as a landing pad block. The
1734 // landing pad block may be branched to only by the unwind edge of an invoke.
1735 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
1736 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
1737 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
1738 "Block containing LandingPadInst must be jumped to "
1739 "only by the unwind edge of an invoke.", &LPI);
1742 // The landingpad instruction must be the first non-PHI instruction in the
1744 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
1745 "LandingPadInst not the first non-PHI instruction in the block.",
1748 // The personality functions for all landingpad instructions within the same
1749 // function should match.
1751 Assert1(LPI.getPersonalityFn() == PersonalityFn,
1752 "Personality function doesn't match others in function", &LPI);
1753 PersonalityFn = LPI.getPersonalityFn();
1755 // All operands must be constants.
1756 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
1758 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
1759 Value *Clause = LPI.getClause(i);
1760 Assert1(isa<Constant>(Clause), "Clause is not constant!", &LPI);
1761 if (LPI.isCatch(i)) {
1762 Assert1(isa<PointerType>(Clause->getType()),
1763 "Catch operand does not have pointer type!", &LPI);
1765 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
1766 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
1767 "Filter operand is not an array of constants!", &LPI);
1771 visitInstruction(LPI);
1774 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
1775 Instruction *Op = cast<Instruction>(I.getOperand(i));
1776 // If the we have an invalid invoke, don't try to compute the dominance.
1777 // We already reject it in the invoke specific checks and the dominance
1778 // computation doesn't handle multiple edges.
1779 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1780 if (II->getNormalDest() == II->getUnwindDest())
1784 const Use &U = I.getOperandUse(i);
1785 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, U),
1786 "Instruction does not dominate all uses!", Op, &I);
1789 /// verifyInstruction - Verify that an instruction is well formed.
1791 void Verifier::visitInstruction(Instruction &I) {
1792 BasicBlock *BB = I.getParent();
1793 Assert1(BB, "Instruction not embedded in basic block!", &I);
1795 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1796 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1798 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
1799 "Only PHI nodes may reference their own value!", &I);
1802 // Check that void typed values don't have names
1803 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1804 "Instruction has a name, but provides a void value!", &I);
1806 // Check that the return value of the instruction is either void or a legal
1808 Assert1(I.getType()->isVoidTy() ||
1809 I.getType()->isFirstClassType(),
1810 "Instruction returns a non-scalar type!", &I);
1812 // Check that the instruction doesn't produce metadata. Calls are already
1813 // checked against the callee type.
1814 Assert1(!I.getType()->isMetadataTy() ||
1815 isa<CallInst>(I) || isa<InvokeInst>(I),
1816 "Invalid use of metadata!", &I);
1818 // Check that all uses of the instruction, if they are instructions
1819 // themselves, actually have parent basic blocks. If the use is not an
1820 // instruction, it is an error!
1821 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1823 if (Instruction *Used = dyn_cast<Instruction>(*UI))
1824 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1825 " embedded in a basic block!", &I, Used);
1827 CheckFailed("Use of instruction is not an instruction!", *UI);
1832 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1833 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1835 // Check to make sure that only first-class-values are operands to
1837 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1838 Assert1(0, "Instruction operands must be first-class values!", &I);
1841 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1842 // Check to make sure that the "address of" an intrinsic function is never
1844 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
1845 "Cannot take the address of an intrinsic!", &I);
1846 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
1847 F->getIntrinsicID() == Intrinsic::donothing,
1848 "Cannot invoke an intrinsinc other than donothing", &I);
1849 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1851 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1852 Assert1(OpBB->getParent() == BB->getParent(),
1853 "Referring to a basic block in another function!", &I);
1854 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1855 Assert1(OpArg->getParent() == BB->getParent(),
1856 "Referring to an argument in another function!", &I);
1857 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1858 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1860 } else if (isa<Instruction>(I.getOperand(i))) {
1861 verifyDominatesUse(I, i);
1862 } else if (isa<InlineAsm>(I.getOperand(i))) {
1863 Assert1((i + 1 == e && isa<CallInst>(I)) ||
1864 (i + 3 == e && isa<InvokeInst>(I)),
1865 "Cannot take the address of an inline asm!", &I);
1869 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
1870 Assert1(I.getType()->isFPOrFPVectorTy(),
1871 "fpmath requires a floating point result!", &I);
1872 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
1873 Value *Op0 = MD->getOperand(0);
1874 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
1875 APFloat Accuracy = CFP0->getValueAPF();
1876 Assert1(Accuracy.isNormal() && !Accuracy.isNegative(),
1877 "fpmath accuracy not a positive number!", &I);
1879 Assert1(false, "invalid fpmath accuracy!", &I);
1883 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
1884 Assert1(!MD || isa<LoadInst>(I), "Ranges are only for loads!", &I);
1886 InstsInThisBlock.insert(&I);
1889 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
1890 /// intrinsic argument or return value) matches the type constraints specified
1891 /// by the .td file (e.g. an "any integer" argument really is an integer).
1893 /// This return true on error but does not print a message.
1894 bool Verifier::VerifyIntrinsicType(Type *Ty,
1895 ArrayRef<Intrinsic::IITDescriptor> &Infos,
1896 SmallVectorImpl<Type*> &ArgTys) {
1897 using namespace Intrinsic;
1899 // If we ran out of descriptors, there are too many arguments.
1900 if (Infos.empty()) return true;
1901 IITDescriptor D = Infos.front();
1902 Infos = Infos.slice(1);
1905 case IITDescriptor::Void: return !Ty->isVoidTy();
1906 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
1907 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
1908 case IITDescriptor::Half: return !Ty->isHalfTy();
1909 case IITDescriptor::Float: return !Ty->isFloatTy();
1910 case IITDescriptor::Double: return !Ty->isDoubleTy();
1911 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
1912 case IITDescriptor::Vector: {
1913 VectorType *VT = dyn_cast<VectorType>(Ty);
1914 return VT == 0 || VT->getNumElements() != D.Vector_Width ||
1915 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
1917 case IITDescriptor::Pointer: {
1918 PointerType *PT = dyn_cast<PointerType>(Ty);
1919 return PT == 0 || PT->getAddressSpace() != D.Pointer_AddressSpace ||
1920 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
1923 case IITDescriptor::Struct: {
1924 StructType *ST = dyn_cast<StructType>(Ty);
1925 if (ST == 0 || ST->getNumElements() != D.Struct_NumElements)
1928 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
1929 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
1934 case IITDescriptor::Argument:
1935 // Two cases here - If this is the second occurrence of an argument, verify
1936 // that the later instance matches the previous instance.
1937 if (D.getArgumentNumber() < ArgTys.size())
1938 return Ty != ArgTys[D.getArgumentNumber()];
1940 // Otherwise, if this is the first instance of an argument, record it and
1941 // verify the "Any" kind.
1942 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
1943 ArgTys.push_back(Ty);
1945 switch (D.getArgumentKind()) {
1946 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
1947 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
1948 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
1949 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
1951 llvm_unreachable("all argument kinds not covered");
1953 case IITDescriptor::ExtendVecArgument:
1954 // This may only be used when referring to a previous vector argument.
1955 return D.getArgumentNumber() >= ArgTys.size() ||
1956 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
1957 VectorType::getExtendedElementVectorType(
1958 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
1960 case IITDescriptor::TruncVecArgument:
1961 // This may only be used when referring to a previous vector argument.
1962 return D.getArgumentNumber() >= ArgTys.size() ||
1963 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
1964 VectorType::getTruncatedElementVectorType(
1965 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
1967 llvm_unreachable("unhandled");
1970 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1972 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1973 Function *IF = CI.getCalledFunction();
1974 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1977 // Verify that the intrinsic prototype lines up with what the .td files
1979 FunctionType *IFTy = IF->getFunctionType();
1980 Assert1(!IFTy->isVarArg(), "Intrinsic prototypes are not varargs", IF);
1982 SmallVector<Intrinsic::IITDescriptor, 8> Table;
1983 getIntrinsicInfoTableEntries(ID, Table);
1984 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
1986 SmallVector<Type *, 4> ArgTys;
1987 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
1988 "Intrinsic has incorrect return type!", IF);
1989 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
1990 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
1991 "Intrinsic has incorrect argument type!", IF);
1992 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
1994 // Now that we have the intrinsic ID and the actual argument types (and we
1995 // know they are legal for the intrinsic!) get the intrinsic name through the
1996 // usual means. This allows us to verify the mangling of argument types into
1998 Assert1(Intrinsic::getName(ID, ArgTys) == IF->getName(),
1999 "Intrinsic name not mangled correctly for type arguments!", IF);
2001 // If the intrinsic takes MDNode arguments, verify that they are either global
2002 // or are local to *this* function.
2003 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2004 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
2005 visitMDNode(*MD, CI.getParent()->getParent());
2010 case Intrinsic::ctlz: // llvm.ctlz
2011 case Intrinsic::cttz: // llvm.cttz
2012 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2013 "is_zero_undef argument of bit counting intrinsics must be a "
2014 "constant int", &CI);
2016 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2017 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2018 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2019 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
2020 Assert1(MD->getNumOperands() == 1,
2021 "invalid llvm.dbg.declare intrinsic call 2", &CI);
2023 case Intrinsic::memcpy:
2024 case Intrinsic::memmove:
2025 case Intrinsic::memset:
2026 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2027 "alignment argument of memory intrinsics must be a constant int",
2029 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2030 "isvolatile argument of memory intrinsics must be a constant int",
2033 case Intrinsic::gcroot:
2034 case Intrinsic::gcwrite:
2035 case Intrinsic::gcread:
2036 if (ID == Intrinsic::gcroot) {
2038 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2039 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2040 Assert1(isa<Constant>(CI.getArgOperand(1)),
2041 "llvm.gcroot parameter #2 must be a constant.", &CI);
2042 if (!AI->getType()->getElementType()->isPointerTy()) {
2043 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2044 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2045 "or argument #2 must be a non-null constant.", &CI);
2049 Assert1(CI.getParent()->getParent()->hasGC(),
2050 "Enclosing function does not use GC.", &CI);
2052 case Intrinsic::init_trampoline:
2053 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2054 "llvm.init_trampoline parameter #2 must resolve to a function.",
2057 case Intrinsic::prefetch:
2058 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2059 isa<ConstantInt>(CI.getArgOperand(2)) &&
2060 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2061 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2062 "invalid arguments to llvm.prefetch",
2065 case Intrinsic::stackprotector:
2066 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2067 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2070 case Intrinsic::lifetime_start:
2071 case Intrinsic::lifetime_end:
2072 case Intrinsic::invariant_start:
2073 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2074 "size argument of memory use markers must be a constant integer",
2077 case Intrinsic::invariant_end:
2078 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2079 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2084 //===----------------------------------------------------------------------===//
2085 // Implement the public interfaces to this file...
2086 //===----------------------------------------------------------------------===//
2088 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
2089 return new Verifier(action);
2093 /// verifyFunction - Check a function for errors, printing messages on stderr.
2094 /// Return true if the function is corrupt.
2096 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
2097 Function &F = const_cast<Function&>(f);
2098 assert(!F.isDeclaration() && "Cannot verify external functions");
2100 FunctionPassManager FPM(F.getParent());
2101 Verifier *V = new Verifier(action);
2107 /// verifyModule - Check a module for errors, printing messages on stderr.
2108 /// Return true if the module is corrupt.
2110 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
2111 std::string *ErrorInfo) {
2113 Verifier *V = new Verifier(action);
2115 PM.run(const_cast<Module&>(M));
2117 if (ErrorInfo && V->Broken)
2118 *ErrorInfo = V->MessagesStr.str();