1 //===-- Verifier.cpp - Implement the Module Verifier -----------------------==//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file defines the function verifier interface, that can be used for some
11 // sanity checking of input to the system.
12 //
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.
15 //
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
41 // block.
42 // * All landingpad instructions must use the same personality function with
43 // the same function.
44 // * All other things that are tested by asserts spread about the code...
45 //
46 //===----------------------------------------------------------------------===//
48 #include "llvm/IR/Verifier.h"
49 #include "llvm/ADT/STLExtras.h"
50 #include "llvm/ADT/SetVector.h"
51 #include "llvm/ADT/SmallPtrSet.h"
52 #include "llvm/ADT/SmallVector.h"
53 #include "llvm/ADT/StringExtras.h"
54 #include "llvm/DebugInfo.h"
55 #include "llvm/IR/CallingConv.h"
56 #include "llvm/IR/Constants.h"
57 #include "llvm/IR/DataLayout.h"
58 #include "llvm/IR/DerivedTypes.h"
59 #include "llvm/IR/Dominators.h"
60 #include "llvm/IR/InlineAsm.h"
61 #include "llvm/IR/IntrinsicInst.h"
62 #include "llvm/IR/LLVMContext.h"
63 #include "llvm/IR/Metadata.h"
64 #include "llvm/IR/Module.h"
65 #include "llvm/InstVisitor.h"
66 #include "llvm/Pass.h"
67 #include "llvm/PassManager.h"
68 #include "llvm/Support/CFG.h"
69 #include "llvm/Support/CallSite.h"
70 #include "llvm/Support/CommandLine.h"
71 #include "llvm/Support/ConstantRange.h"
72 #include "llvm/Support/Debug.h"
73 #include "llvm/Support/ErrorHandling.h"
74 #include "llvm/Support/raw_ostream.h"
75 #include <algorithm>
76 #include <cstdarg>
77 using namespace llvm;
79 static cl::opt<bool> DisableDebugInfoVerifier("disable-debug-info-verifier",
80 cl::init(true));
82 namespace { // Anonymous namespace for class
83 struct PreVerifier : public FunctionPass {
84 static char ID; // Pass ID, replacement for typeid
86 PreVerifier() : FunctionPass(ID) {
87 initializePreVerifierPass(*PassRegistry::getPassRegistry());
88 }
90 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
91 AU.setPreservesAll();
92 }
94 // Check that the prerequisites for successful DominatorTree construction
95 // are satisfied.
96 bool runOnFunction(Function &F) {
97 bool Broken = false;
99 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
100 if (I->empty() || !I->back().isTerminator()) {
101 dbgs() << "Basic Block in function '" << F.getName()
102 << "' does not have terminator!\n";
103 I->printAsOperand(dbgs(), true);
104 dbgs() << "\n";
105 Broken = true;
106 }
107 }
109 if (Broken)
110 report_fatal_error("Broken module, no Basic Block terminator!");
112 return false;
113 }
114 };
115 }
117 char PreVerifier::ID = 0;
118 INITIALIZE_PASS(PreVerifier, "preverify", "Preliminary module verification",
119 false, false)
120 static char &PreVerifyID = PreVerifier::ID;
122 namespace {
123 struct Verifier : public FunctionPass, public InstVisitor<Verifier> {
124 static char ID; // Pass ID, replacement for typeid
125 bool Broken; // Is this module found to be broken?
126 VerifierFailureAction action;
127 // What to do if verification fails.
128 Module *Mod; // Module we are verifying right now
129 LLVMContext *Context; // Context within which we are verifying
130 DominatorTree *DT; // Dominator Tree, caution can be null!
131 const DataLayout *DL;
133 std::string Messages;
134 raw_string_ostream MessagesStr;
136 /// InstInThisBlock - when verifying a basic block, keep track of all of the
137 /// instructions we have seen so far. This allows us to do efficient
138 /// dominance checks for the case when an instruction has an operand that is
139 /// an instruction in the same block.
140 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
142 /// MDNodes - keep track of the metadata nodes that have been checked
143 /// already.
144 SmallPtrSet<MDNode *, 32> MDNodes;
146 /// PersonalityFn - The personality function referenced by the
147 /// LandingPadInsts. All LandingPadInsts within the same function must use
148 /// the same personality function.
149 const Value *PersonalityFn;
151 /// Finder keeps track of all debug info MDNodes in a Module.
152 DebugInfoFinder Finder;
154 Verifier()
155 : FunctionPass(ID), Broken(false),
156 action(AbortProcessAction), Mod(0), Context(0), DT(0), DL(0),
157 MessagesStr(Messages), PersonalityFn(0) {
158 initializeVerifierPass(*PassRegistry::getPassRegistry());
159 }
160 explicit Verifier(VerifierFailureAction ctn)
161 : FunctionPass(ID), Broken(false), action(ctn), Mod(0),
162 Context(0), DT(0), DL(0), MessagesStr(Messages), PersonalityFn(0) {
163 initializeVerifierPass(*PassRegistry::getPassRegistry());
164 }
166 bool doInitialization(Module &M) {
167 Mod = &M;
168 Context = &M.getContext();
170 DL = getAnalysisIfAvailable<DataLayout>();
172 // We must abort before returning back to the pass manager, or else the
173 // pass manager may try to run other passes on the broken module.
174 return abortIfBroken();
175 }
177 bool runOnFunction(Function &F) {
178 // Get dominator information if we are being run by PassManager
179 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
181 Mod = F.getParent();
182 if (!Context) Context = &F.getContext();
184 Finder.reset();
185 visit(F);
186 InstsInThisBlock.clear();
187 PersonalityFn = 0;
189 if (!DisableDebugInfoVerifier)
190 // Verify Debug Info.
191 verifyDebugInfo();
193 // We must abort before returning back to the pass manager, or else the
194 // pass manager may try to run other passes on the broken module.
195 return abortIfBroken();
196 }
198 bool doFinalization(Module &M) {
199 // Scan through, checking all of the external function's linkage now...
200 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
201 visitGlobalValue(*I);
203 // Check to make sure function prototypes are okay.
204 if (I->isDeclaration()) visitFunction(*I);
205 }
207 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
208 I != E; ++I)
209 visitGlobalVariable(*I);
211 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
212 I != E; ++I)
213 visitGlobalAlias(*I);
215 for (Module::named_metadata_iterator I = M.named_metadata_begin(),
216 E = M.named_metadata_end(); I != E; ++I)
217 visitNamedMDNode(*I);
219 visitModuleFlags(M);
220 visitModuleIdents(M);
222 if (!DisableDebugInfoVerifier) {
223 Finder.reset();
224 Finder.processModule(M);
225 // Verify Debug Info.
226 verifyDebugInfo();
227 }
229 // If the module is broken, abort at this time.
230 return abortIfBroken();
231 }
233 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
234 AU.setPreservesAll();
235 AU.addRequiredID(PreVerifyID);
236 AU.addRequired<DominatorTreeWrapperPass>();
237 }
239 /// abortIfBroken - If the module is broken and we are supposed to abort on
240 /// this condition, do so.
241 ///
242 bool abortIfBroken() {
243 if (!Broken) return false;
244 MessagesStr << "Broken module found, ";
245 switch (action) {
246 case AbortProcessAction:
247 MessagesStr << "compilation aborted!\n";
248 dbgs() << MessagesStr.str();
249 // Client should choose different reaction if abort is not desired
250 abort();
251 case PrintMessageAction:
252 MessagesStr << "verification continues.\n";
253 dbgs() << MessagesStr.str();
254 return false;
255 case ReturnStatusAction:
256 MessagesStr << "compilation terminated.\n";
257 return true;
258 }
259 llvm_unreachable("Invalid action");
260 }
263 // Verification methods...
264 void visitGlobalValue(GlobalValue &GV);
265 void visitGlobalVariable(GlobalVariable &GV);
266 void visitGlobalAlias(GlobalAlias &GA);
267 void visitNamedMDNode(NamedMDNode &NMD);
268 void visitMDNode(MDNode &MD, Function *F);
269 void visitModuleIdents(Module &M);
270 void visitModuleFlags(Module &M);
271 void visitModuleFlag(MDNode *Op, DenseMap<MDString*, MDNode*> &SeenIDs,
272 SmallVectorImpl<MDNode*> &Requirements);
273 void visitFunction(Function &F);
274 void visitBasicBlock(BasicBlock &BB);
275 using InstVisitor<Verifier>::visit;
277 void visit(Instruction &I);
279 void visitTruncInst(TruncInst &I);
280 void visitZExtInst(ZExtInst &I);
281 void visitSExtInst(SExtInst &I);
282 void visitFPTruncInst(FPTruncInst &I);
283 void visitFPExtInst(FPExtInst &I);
284 void visitFPToUIInst(FPToUIInst &I);
285 void visitFPToSIInst(FPToSIInst &I);
286 void visitUIToFPInst(UIToFPInst &I);
287 void visitSIToFPInst(SIToFPInst &I);
288 void visitIntToPtrInst(IntToPtrInst &I);
289 void visitPtrToIntInst(PtrToIntInst &I);
290 void visitBitCastInst(BitCastInst &I);
291 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
292 void visitPHINode(PHINode &PN);
293 void visitBinaryOperator(BinaryOperator &B);
294 void visitICmpInst(ICmpInst &IC);
295 void visitFCmpInst(FCmpInst &FC);
296 void visitExtractElementInst(ExtractElementInst &EI);
297 void visitInsertElementInst(InsertElementInst &EI);
298 void visitShuffleVectorInst(ShuffleVectorInst &EI);
299 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
300 void visitCallInst(CallInst &CI);
301 void visitInvokeInst(InvokeInst &II);
302 void visitGetElementPtrInst(GetElementPtrInst &GEP);
303 void visitLoadInst(LoadInst &LI);
304 void visitStoreInst(StoreInst &SI);
305 void verifyDominatesUse(Instruction &I, unsigned i);
306 void visitInstruction(Instruction &I);
307 void visitTerminatorInst(TerminatorInst &I);
308 void visitBranchInst(BranchInst &BI);
309 void visitReturnInst(ReturnInst &RI);
310 void visitSwitchInst(SwitchInst &SI);
311 void visitIndirectBrInst(IndirectBrInst &BI);
312 void visitSelectInst(SelectInst &SI);
313 void visitUserOp1(Instruction &I);
314 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
315 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
316 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
317 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
318 void visitFenceInst(FenceInst &FI);
319 void visitAllocaInst(AllocaInst &AI);
320 void visitExtractValueInst(ExtractValueInst &EVI);
321 void visitInsertValueInst(InsertValueInst &IVI);
322 void visitLandingPadInst(LandingPadInst &LPI);
324 void VerifyCallSite(CallSite CS);
325 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty,
326 int VT, unsigned ArgNo, std::string &Suffix);
327 bool VerifyIntrinsicType(Type *Ty,
328 ArrayRef<Intrinsic::IITDescriptor> &Infos,
329 SmallVectorImpl<Type*> &ArgTys);
330 bool VerifyIntrinsicIsVarArg(bool isVarArg,
331 ArrayRef<Intrinsic::IITDescriptor> &Infos);
332 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
333 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
334 bool isFunction, const Value *V);
335 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
336 bool isReturnValue, const Value *V);
337 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
338 const Value *V);
340 void VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy);
341 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
343 void verifyDebugInfo();
345 void WriteValue(const Value *V) {
346 if (!V) return;
347 if (isa<Instruction>(V)) {
348 MessagesStr << *V << '\n';
349 } else {
350 V->printAsOperand(MessagesStr, true, Mod);
351 MessagesStr << '\n';
352 }
353 }
355 void WriteType(Type *T) {
356 if (!T) return;
357 MessagesStr << ' ' << *T;
358 }
361 // CheckFailed - A check failed, so print out the condition and the message
362 // that failed. This provides a nice place to put a breakpoint if you want
363 // to see why something is not correct.
364 void CheckFailed(const Twine &Message,
365 const Value *V1 = 0, const Value *V2 = 0,
366 const Value *V3 = 0, const Value *V4 = 0) {
367 MessagesStr << Message.str() << "\n";
368 WriteValue(V1);
369 WriteValue(V2);
370 WriteValue(V3);
371 WriteValue(V4);
372 Broken = true;
373 }
375 void CheckFailed(const Twine &Message, const Value *V1,
376 Type *T2, const Value *V3 = 0) {
377 MessagesStr << Message.str() << "\n";
378 WriteValue(V1);
379 WriteType(T2);
380 WriteValue(V3);
381 Broken = true;
382 }
384 void CheckFailed(const Twine &Message, Type *T1,
385 Type *T2 = 0, Type *T3 = 0) {
386 MessagesStr << Message.str() << "\n";
387 WriteType(T1);
388 WriteType(T2);
389 WriteType(T3);
390 Broken = true;
391 }
392 };
393 } // End anonymous namespace
395 char Verifier::ID = 0;
396 INITIALIZE_PASS_BEGIN(Verifier, "verify", "Module Verifier", false, false)
397 INITIALIZE_PASS_DEPENDENCY(PreVerifier)
398 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
399 INITIALIZE_PASS_END(Verifier, "verify", "Module Verifier", false, false)
401 // Assert - We know that cond should be true, if not print an error message.
402 #define Assert(C, M) \
403 do { if (!(C)) { CheckFailed(M); return; } } while (0)
404 #define Assert1(C, M, V1) \
405 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
406 #define Assert2(C, M, V1, V2) \
407 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
408 #define Assert3(C, M, V1, V2, V3) \
409 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
410 #define Assert4(C, M, V1, V2, V3, V4) \
411 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
413 void Verifier::visit(Instruction &I) {
414 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
415 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
416 InstVisitor<Verifier>::visit(I);
417 }
420 void Verifier::visitGlobalValue(GlobalValue &GV) {
421 Assert1(!GV.isDeclaration() ||
422 GV.isMaterializable() ||
423 GV.hasExternalLinkage() ||
424 GV.hasExternalWeakLinkage() ||
425 (isa<GlobalAlias>(GV) &&
426 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
427 "Global is external, but doesn't have external or weak linkage!",
428 &GV);
430 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
431 "Only global variables can have appending linkage!", &GV);
433 if (GV.hasAppendingLinkage()) {
434 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
435 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
436 "Only global arrays can have appending linkage!", GVar);
437 }
438 }
440 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
441 if (GV.hasInitializer()) {
442 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
443 "Global variable initializer type does not match global "
444 "variable type!", &GV);
446 // If the global has common linkage, it must have a zero initializer and
447 // cannot be constant.
448 if (GV.hasCommonLinkage()) {
449 Assert1(GV.getInitializer()->isNullValue(),
450 "'common' global must have a zero initializer!", &GV);
451 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
452 &GV);
453 }
454 } else {
455 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
456 "invalid linkage type for global declaration", &GV);
457 }
459 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
460 GV.getName() == "llvm.global_dtors")) {
461 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
462 "invalid linkage for intrinsic global variable", &GV);
463 // Don't worry about emitting an error for it not being an array,
464 // visitGlobalValue will complain on appending non-array.
465 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType())) {
466 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
467 PointerType *FuncPtrTy =
468 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
469 Assert1(STy && STy->getNumElements() == 2 &&
470 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
471 STy->getTypeAtIndex(1) == FuncPtrTy,
472 "wrong type for intrinsic global variable", &GV);
473 }
474 }
476 if (GV.hasName() && (GV.getName() == "llvm.used" ||
477 GV.getName() == "llvm.compiler.used")) {
478 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
479 "invalid linkage for intrinsic global variable", &GV);
480 Type *GVType = GV.getType()->getElementType();
481 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
482 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
483 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
484 if (GV.hasInitializer()) {
485 Constant *Init = GV.getInitializer();
486 ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
487 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
488 Init);
489 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
490 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
491 Assert1(
492 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
493 "invalid llvm.used member", V);
494 Assert1(V->hasName(), "members of llvm.used must be named", V);
495 }
496 }
497 }
498 }
500 Assert1(!GV.hasDLLImportStorageClass() ||
501 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
502 GV.hasAvailableExternallyLinkage(),
503 "Global is marked as dllimport, but not external", &GV);
505 if (!GV.hasInitializer()) {
506 visitGlobalValue(GV);
507 return;
508 }
510 // Walk any aggregate initializers looking for bitcasts between address spaces
511 SmallPtrSet<const Value *, 4> Visited;
512 SmallVector<const Value *, 4> WorkStack;
513 WorkStack.push_back(cast<Value>(GV.getInitializer()));
515 while (!WorkStack.empty()) {
516 const Value *V = WorkStack.pop_back_val();
517 if (!Visited.insert(V))
518 continue;
520 if (const User *U = dyn_cast<User>(V)) {
521 for (unsigned I = 0, N = U->getNumOperands(); I != N; ++I)
522 WorkStack.push_back(U->getOperand(I));
523 }
525 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
526 VerifyConstantExprBitcastType(CE);
527 if (Broken)
528 return;
529 }
530 }
532 visitGlobalValue(GV);
533 }
535 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
536 Assert1(!GA.getName().empty(),
537 "Alias name cannot be empty!", &GA);
538 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
539 "Alias should have external or external weak linkage!", &GA);
540 Assert1(GA.getAliasee(),
541 "Aliasee cannot be NULL!", &GA);
542 Assert1(GA.getType() == GA.getAliasee()->getType(),
543 "Alias and aliasee types should match!", &GA);
544 Assert1(!GA.hasUnnamedAddr(), "Alias cannot have unnamed_addr!", &GA);
546 Constant *Aliasee = GA.getAliasee();
548 if (!isa<GlobalValue>(Aliasee)) {
549 ConstantExpr *CE = dyn_cast<ConstantExpr>(Aliasee);
550 Assert1(CE &&
551 (CE->getOpcode() == Instruction::BitCast ||
552 CE->getOpcode() == Instruction::AddrSpaceCast ||
553 CE->getOpcode() == Instruction::GetElementPtr) &&
554 isa<GlobalValue>(CE->getOperand(0)),
555 "Aliasee should be either GlobalValue, bitcast or "
556 "addrspacecast of GlobalValue",
557 &GA);
559 if (CE->getOpcode() == Instruction::BitCast) {
560 unsigned SrcAS = CE->getOperand(0)->getType()->getPointerAddressSpace();
561 unsigned DstAS = CE->getType()->getPointerAddressSpace();
563 Assert1(SrcAS == DstAS,
564 "Alias bitcasts cannot be between different address spaces",
565 &GA);
566 }
567 }
569 const GlobalValue* Resolved = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
570 Assert1(Resolved,
571 "Aliasing chain should end with function or global variable", &GA);
573 visitGlobalValue(GA);
574 }
576 void Verifier::visitNamedMDNode(NamedMDNode &NMD) {
577 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
578 MDNode *MD = NMD.getOperand(i);
579 if (!MD)
580 continue;
582 Assert1(!MD->isFunctionLocal(),
583 "Named metadata operand cannot be function local!", MD);
584 visitMDNode(*MD, 0);
585 }
586 }
588 void Verifier::visitMDNode(MDNode &MD, Function *F) {
589 // Only visit each node once. Metadata can be mutually recursive, so this
590 // avoids infinite recursion here, as well as being an optimization.
591 if (!MDNodes.insert(&MD))
592 return;
594 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
595 Value *Op = MD.getOperand(i);
596 if (!Op)
597 continue;
598 if (isa<Constant>(Op) || isa<MDString>(Op))
599 continue;
600 if (MDNode *N = dyn_cast<MDNode>(Op)) {
601 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
602 "Global metadata operand cannot be function local!", &MD, N);
603 visitMDNode(*N, F);
604 continue;
605 }
606 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
608 // If this was an instruction, bb, or argument, verify that it is in the
609 // function that we expect.
610 Function *ActualF = 0;
611 if (Instruction *I = dyn_cast<Instruction>(Op))
612 ActualF = I->getParent()->getParent();
613 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
614 ActualF = BB->getParent();
615 else if (Argument *A = dyn_cast<Argument>(Op))
616 ActualF = A->getParent();
617 assert(ActualF && "Unimplemented function local metadata case!");
619 Assert2(ActualF == F, "function-local metadata used in wrong function",
620 &MD, Op);
621 }
622 }
624 void Verifier::visitModuleIdents(Module &M) {
625 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
626 if (!Idents)
627 return;
629 // llvm.ident takes a list of metadata entry. Each entry has only one string.
630 // Scan each llvm.ident entry and make sure that this requirement is met.
631 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
632 const MDNode *N = Idents->getOperand(i);
633 Assert1(N->getNumOperands() == 1,
634 "incorrect number of operands in llvm.ident metadata", N);
635 Assert1(isa<MDString>(N->getOperand(0)),
636 ("invalid value for llvm.ident metadata entry operand"
637 "(the operand should be a string)"),
638 N->getOperand(0));
639 }
640 }
642 void Verifier::visitModuleFlags(Module &M) {
643 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
644 if (!Flags) return;
646 // Scan each flag, and track the flags and requirements.
647 DenseMap<MDString*, MDNode*> SeenIDs;
648 SmallVector<MDNode*, 16> Requirements;
649 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
650 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
651 }
653 // Validate that the requirements in the module are valid.
654 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
655 MDNode *Requirement = Requirements[I];
656 MDString *Flag = cast<MDString>(Requirement->getOperand(0));
657 Value *ReqValue = Requirement->getOperand(1);
659 MDNode *Op = SeenIDs.lookup(Flag);
660 if (!Op) {
661 CheckFailed("invalid requirement on flag, flag is not present in module",
662 Flag);
663 continue;
664 }
666 if (Op->getOperand(2) != ReqValue) {
667 CheckFailed(("invalid requirement on flag, "
668 "flag does not have the required value"),
669 Flag);
670 continue;
671 }
672 }
673 }
675 void Verifier::visitModuleFlag(MDNode *Op, DenseMap<MDString*, MDNode*>&SeenIDs,
676 SmallVectorImpl<MDNode*> &Requirements) {
677 // Each module flag should have three arguments, the merge behavior (a
678 // constant int), the flag ID (an MDString), and the value.
679 Assert1(Op->getNumOperands() == 3,
680 "incorrect number of operands in module flag", Op);
681 ConstantInt *Behavior = dyn_cast<ConstantInt>(Op->getOperand(0));
682 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
683 Assert1(Behavior,
684 "invalid behavior operand in module flag (expected constant integer)",
685 Op->getOperand(0));
686 unsigned BehaviorValue = Behavior->getZExtValue();
687 Assert1(ID,
688 "invalid ID operand in module flag (expected metadata string)",
689 Op->getOperand(1));
691 // Sanity check the values for behaviors with additional requirements.
692 switch (BehaviorValue) {
693 default:
694 Assert1(false,
695 "invalid behavior operand in module flag (unexpected constant)",
696 Op->getOperand(0));
697 break;
699 case Module::Error:
700 case Module::Warning:
701 case Module::Override:
702 // These behavior types accept any value.
703 break;
705 case Module::Require: {
706 // The value should itself be an MDNode with two operands, a flag ID (an
707 // MDString), and a value.
708 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
709 Assert1(Value && Value->getNumOperands() == 2,
710 "invalid value for 'require' module flag (expected metadata pair)",
711 Op->getOperand(2));
712 Assert1(isa<MDString>(Value->getOperand(0)),
713 ("invalid value for 'require' module flag "
714 "(first value operand should be a string)"),
715 Value->getOperand(0));
717 // Append it to the list of requirements, to check once all module flags are
718 // scanned.
719 Requirements.push_back(Value);
720 break;
721 }
723 case Module::Append:
724 case Module::AppendUnique: {
725 // These behavior types require the operand be an MDNode.
726 Assert1(isa<MDNode>(Op->getOperand(2)),
727 "invalid value for 'append'-type module flag "
728 "(expected a metadata node)", Op->getOperand(2));
729 break;
730 }
731 }
733 // Unless this is a "requires" flag, check the ID is unique.
734 if (BehaviorValue != Module::Require) {
735 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
736 Assert1(Inserted,
737 "module flag identifiers must be unique (or of 'require' type)",
738 ID);
739 }
740 }
742 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
743 bool isFunction, const Value *V) {
744 unsigned Slot = ~0U;
745 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
746 if (Attrs.getSlotIndex(I) == Idx) {
747 Slot = I;
748 break;
749 }
751 assert(Slot != ~0U && "Attribute set inconsistency!");
753 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
754 I != E; ++I) {
755 if (I->isStringAttribute())
756 continue;
758 if (I->getKindAsEnum() == Attribute::NoReturn ||
759 I->getKindAsEnum() == Attribute::NoUnwind ||
760 I->getKindAsEnum() == Attribute::NoInline ||
761 I->getKindAsEnum() == Attribute::AlwaysInline ||
762 I->getKindAsEnum() == Attribute::OptimizeForSize ||
763 I->getKindAsEnum() == Attribute::StackProtect ||
764 I->getKindAsEnum() == Attribute::StackProtectReq ||
765 I->getKindAsEnum() == Attribute::StackProtectStrong ||
766 I->getKindAsEnum() == Attribute::NoRedZone ||
767 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
768 I->getKindAsEnum() == Attribute::Naked ||
769 I->getKindAsEnum() == Attribute::InlineHint ||
770 I->getKindAsEnum() == Attribute::StackAlignment ||
771 I->getKindAsEnum() == Attribute::UWTable ||
772 I->getKindAsEnum() == Attribute::NonLazyBind ||
773 I->getKindAsEnum() == Attribute::ReturnsTwice ||
774 I->getKindAsEnum() == Attribute::SanitizeAddress ||
775 I->getKindAsEnum() == Attribute::SanitizeThread ||
776 I->getKindAsEnum() == Attribute::SanitizeMemory ||
777 I->getKindAsEnum() == Attribute::MinSize ||
778 I->getKindAsEnum() == Attribute::NoDuplicate ||
779 I->getKindAsEnum() == Attribute::Builtin ||
780 I->getKindAsEnum() == Attribute::NoBuiltin ||
781 I->getKindAsEnum() == Attribute::Cold ||
782 I->getKindAsEnum() == Attribute::OptimizeNone) {
783 if (!isFunction) {
784 CheckFailed("Attribute '" + I->getAsString() +
785 "' only applies to functions!", V);
786 return;
787 }
788 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
789 I->getKindAsEnum() == Attribute::ReadNone) {
790 if (Idx == 0) {
791 CheckFailed("Attribute '" + I->getAsString() +
792 "' does not apply to function returns");
793 return;
794 }
795 } else if (isFunction) {
796 CheckFailed("Attribute '" + I->getAsString() +
797 "' does not apply to functions!", V);
798 return;
799 }
800 }
801 }
803 // VerifyParameterAttrs - Check the given attributes for an argument or return
804 // value of the specified type. The value V is printed in error messages.
805 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
806 bool isReturnValue, const Value *V) {
807 if (!Attrs.hasAttributes(Idx))
808 return;
810 VerifyAttributeTypes(Attrs, Idx, false, V);
812 if (isReturnValue)
813 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
814 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
815 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
816 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
817 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
818 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
819 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
820 "'returned' do not apply to return values!", V);
822 // Check for mutually incompatible attributes. Only inreg is compatible with
823 // sret.
824 unsigned AttrCount = 0;
825 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
826 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
827 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
828 Attrs.hasAttribute(Idx, Attribute::InReg);
829 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
830 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
831 "and 'sret' are incompatible!", V);
833 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
834 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
835 "'inalloca and readonly' are incompatible!", V);
837 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
838 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
839 "'sret and returned' are incompatible!", V);
841 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
842 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
843 "'zeroext and signext' are incompatible!", V);
845 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
846 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
847 "'readnone and readonly' are incompatible!", V);
849 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
850 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
851 "'noinline and alwaysinline' are incompatible!", V);
853 Assert1(!AttrBuilder(Attrs, Idx).
854 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
855 "Wrong types for attribute: " +
856 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
858 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
859 if (!PTy->getElementType()->isSized()) {
860 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
861 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
862 "Attributes 'byval' and 'inalloca' do not support unsized types!",
863 V);
864 }
865 } else {
866 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
867 "Attribute 'byval' only applies to parameters with pointer type!",
868 V);
869 }
870 }
872 // VerifyFunctionAttrs - Check parameter attributes against a function type.
873 // The value V is printed in error messages.
874 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
875 const Value *V) {
876 if (Attrs.isEmpty())
877 return;
879 bool SawNest = false;
880 bool SawReturned = false;
882 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
883 unsigned Idx = Attrs.getSlotIndex(i);
885 Type *Ty;
886 if (Idx == 0)
887 Ty = FT->getReturnType();
888 else if (Idx-1 < FT->getNumParams())
889 Ty = FT->getParamType(Idx-1);
890 else
891 break; // VarArgs attributes, verified elsewhere.
893 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
895 if (Idx == 0)
896 continue;
898 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
899 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
900 SawNest = true;
901 }
903 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
904 Assert1(!SawReturned, "More than one parameter has attribute returned!",
905 V);
906 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
907 "argument and return types for 'returned' attribute", V);
908 SawReturned = true;
909 }
911 if (Attrs.hasAttribute(Idx, Attribute::StructRet))
912 Assert1(Idx == 1, "Attribute sret is not on first parameter!", V);
913 }
915 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
916 return;
918 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
920 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
921 Attribute::ReadNone) &&
922 Attrs.hasAttribute(AttributeSet::FunctionIndex,
923 Attribute::ReadOnly)),
924 "Attributes 'readnone and readonly' are incompatible!", V);
926 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
927 Attribute::NoInline) &&
928 Attrs.hasAttribute(AttributeSet::FunctionIndex,
929 Attribute::AlwaysInline)),
930 "Attributes 'noinline and alwaysinline' are incompatible!", V);
932 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
933 Attribute::OptimizeNone)) {
934 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
935 Attribute::NoInline),
936 "Attribute 'optnone' requires 'noinline'!", V);
938 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
939 Attribute::OptimizeForSize),
940 "Attributes 'optsize and optnone' are incompatible!", V);
942 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
943 Attribute::MinSize),
944 "Attributes 'minsize and optnone' are incompatible!", V);
945 }
946 }
948 void Verifier::VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy) {
949 // Get the size of the types in bits, we'll need this later
950 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
951 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
953 // BitCast implies a no-op cast of type only. No bits change.
954 // However, you can't cast pointers to anything but pointers.
955 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
956 "Bitcast requires both operands to be pointer or neither", V);
957 Assert1(SrcBitSize == DestBitSize,
958 "Bitcast requires types of same width", V);
960 // Disallow aggregates.
961 Assert1(!SrcTy->isAggregateType(),
962 "Bitcast operand must not be aggregate", V);
963 Assert1(!DestTy->isAggregateType(),
964 "Bitcast type must not be aggregate", V);
966 // Without datalayout, assume all address spaces are the same size.
967 // Don't check if both types are not pointers.
968 // Skip casts between scalars and vectors.
969 if (!DL ||
970 !SrcTy->isPtrOrPtrVectorTy() ||
971 !DestTy->isPtrOrPtrVectorTy() ||
972 SrcTy->isVectorTy() != DestTy->isVectorTy()) {
973 return;
974 }
976 unsigned SrcAS = SrcTy->getPointerAddressSpace();
977 unsigned DstAS = DestTy->getPointerAddressSpace();
979 Assert1(SrcAS == DstAS,
980 "Bitcasts between pointers of different address spaces is not legal."
981 "Use AddrSpaceCast instead.", V);
982 }
984 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
985 if (CE->getOpcode() == Instruction::BitCast) {
986 Type *SrcTy = CE->getOperand(0)->getType();
987 Type *DstTy = CE->getType();
988 VerifyBitcastType(CE, DstTy, SrcTy);
989 }
990 }
992 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
993 if (Attrs.getNumSlots() == 0)
994 return true;
996 unsigned LastSlot = Attrs.getNumSlots() - 1;
997 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
998 if (LastIndex <= Params
999 || (LastIndex == AttributeSet::FunctionIndex
1000 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1001 return true;
1003 return false;
1004 }
1006 // visitFunction - Verify that a function is ok.
1007 //
1008 void Verifier::visitFunction(Function &F) {
1009 // Check function arguments.
1010 FunctionType *FT = F.getFunctionType();
1011 unsigned NumArgs = F.arg_size();
1013 Assert1(Context == &F.getContext(),
1014 "Function context does not match Module context!", &F);
1016 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1017 Assert2(FT->getNumParams() == NumArgs,
1018 "# formal arguments must match # of arguments for function type!",
1019 &F, FT);
1020 Assert1(F.getReturnType()->isFirstClassType() ||
1021 F.getReturnType()->isVoidTy() ||
1022 F.getReturnType()->isStructTy(),
1023 "Functions cannot return aggregate values!", &F);
1025 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1026 "Invalid struct return type!", &F);
1028 AttributeSet Attrs = F.getAttributes();
1030 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1031 "Attribute after last parameter!", &F);
1033 // Check function attributes.
1034 VerifyFunctionAttrs(FT, Attrs, &F);
1036 // On function declarations/definitions, we do not support the builtin
1037 // attribute. We do not check this in VerifyFunctionAttrs since that is
1038 // checking for Attributes that can/can not ever be on functions.
1039 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1040 Attribute::Builtin),
1041 "Attribute 'builtin' can only be applied to a callsite.", &F);
1043 // Check that this function meets the restrictions on this calling convention.
1044 switch (F.getCallingConv()) {
1045 default:
1046 break;
1047 case CallingConv::C:
1048 break;
1049 case CallingConv::Fast:
1050 case CallingConv::Cold:
1051 case CallingConv::X86_FastCall:
1052 case CallingConv::X86_ThisCall:
1053 case CallingConv::Intel_OCL_BI:
1054 case CallingConv::PTX_Kernel:
1055 case CallingConv::PTX_Device:
1056 Assert1(!F.isVarArg(),
1057 "Varargs functions must have C calling conventions!", &F);
1058 break;
1059 }
1061 bool isLLVMdotName = F.getName().size() >= 5 &&
1062 F.getName().substr(0, 5) == "llvm.";
1064 // Check that the argument values match the function type for this function...
1065 unsigned i = 0;
1066 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
1067 I != E; ++I, ++i) {
1068 Assert2(I->getType() == FT->getParamType(i),
1069 "Argument value does not match function argument type!",
1070 I, FT->getParamType(i));
1071 Assert1(I->getType()->isFirstClassType(),
1072 "Function arguments must have first-class types!", I);
1073 if (!isLLVMdotName)
1074 Assert2(!I->getType()->isMetadataTy(),
1075 "Function takes metadata but isn't an intrinsic", I, &F);
1076 }
1078 if (F.isMaterializable()) {
1079 // Function has a body somewhere we can't see.
1080 } else if (F.isDeclaration()) {
1081 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1082 "invalid linkage type for function declaration", &F);
1083 } else {
1084 // Verify that this function (which has a body) is not named "llvm.*". It
1085 // is not legal to define intrinsics.
1086 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1088 // Check the entry node
1089 BasicBlock *Entry = &F.getEntryBlock();
1090 Assert1(pred_begin(Entry) == pred_end(Entry),
1091 "Entry block to function must not have predecessors!", Entry);
1093 // The address of the entry block cannot be taken, unless it is dead.
1094 if (Entry->hasAddressTaken()) {
1095 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
1096 "blockaddress may not be used with the entry block!", Entry);
1097 }
1098 }
1100 // If this function is actually an intrinsic, verify that it is only used in
1101 // direct call/invokes, never having its "address taken".
1102 if (F.getIntrinsicID()) {
1103 const User *U;
1104 if (F.hasAddressTaken(&U))
1105 Assert1(0, "Invalid user of intrinsic instruction!", U);
1106 }
1108 Assert1(!F.hasDLLImportStorageClass() ||
1109 (F.isDeclaration() && F.hasExternalLinkage()) ||
1110 F.hasAvailableExternallyLinkage(),
1111 "Function is marked as dllimport, but not external.", &F);
1112 }
1114 // verifyBasicBlock - Verify that a basic block is well formed...
1115 //
1116 void Verifier::visitBasicBlock(BasicBlock &BB) {
1117 InstsInThisBlock.clear();
1119 // Ensure that basic blocks have terminators!
1120 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1122 // Check constraints that this basic block imposes on all of the PHI nodes in
1123 // it.
1124 if (isa<PHINode>(BB.front())) {
1125 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1126 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1127 std::sort(Preds.begin(), Preds.end());
1128 PHINode *PN;
1129 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1130 // Ensure that PHI nodes have at least one entry!
1131 Assert1(PN->getNumIncomingValues() != 0,
1132 "PHI nodes must have at least one entry. If the block is dead, "
1133 "the PHI should be removed!", PN);
1134 Assert1(PN->getNumIncomingValues() == Preds.size(),
1135 "PHINode should have one entry for each predecessor of its "
1136 "parent basic block!", PN);
1138 // Get and sort all incoming values in the PHI node...
1139 Values.clear();
1140 Values.reserve(PN->getNumIncomingValues());
1141 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1142 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1143 PN->getIncomingValue(i)));
1144 std::sort(Values.begin(), Values.end());
1146 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1147 // Check to make sure that if there is more than one entry for a
1148 // particular basic block in this PHI node, that the incoming values are
1149 // all identical.
1150 //
1151 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1152 Values[i].second == Values[i-1].second,
1153 "PHI node has multiple entries for the same basic block with "
1154 "different incoming values!", PN, Values[i].first,
1155 Values[i].second, Values[i-1].second);
1157 // Check to make sure that the predecessors and PHI node entries are
1158 // matched up.
1159 Assert3(Values[i].first == Preds[i],
1160 "PHI node entries do not match predecessors!", PN,
1161 Values[i].first, Preds[i]);
1162 }
1163 }
1164 }
1165 }
1167 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1168 // Ensure that terminators only exist at the end of the basic block.
1169 Assert1(&I == I.getParent()->getTerminator(),
1170 "Terminator found in the middle of a basic block!", I.getParent());
1171 visitInstruction(I);
1172 }
1174 void Verifier::visitBranchInst(BranchInst &BI) {
1175 if (BI.isConditional()) {
1176 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1177 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1178 }
1179 visitTerminatorInst(BI);
1180 }
1182 void Verifier::visitReturnInst(ReturnInst &RI) {
1183 Function *F = RI.getParent()->getParent();
1184 unsigned N = RI.getNumOperands();
1185 if (F->getReturnType()->isVoidTy())
1186 Assert2(N == 0,
1187 "Found return instr that returns non-void in Function of void "
1188 "return type!", &RI, F->getReturnType());
1189 else
1190 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1191 "Function return type does not match operand "
1192 "type of return inst!", &RI, F->getReturnType());
1194 // Check to make sure that the return value has necessary properties for
1195 // terminators...
1196 visitTerminatorInst(RI);
1197 }
1199 void Verifier::visitSwitchInst(SwitchInst &SI) {
1200 // Check to make sure that all of the constants in the switch instruction
1201 // have the same type as the switched-on value.
1202 Type *SwitchTy = SI.getCondition()->getType();
1203 SmallPtrSet<ConstantInt*, 32> Constants;
1204 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1205 Assert1(i.getCaseValue()->getType() == SwitchTy,
1206 "Switch constants must all be same type as switch value!", &SI);
1207 Assert2(Constants.insert(i.getCaseValue()),
1208 "Duplicate integer as switch case", &SI, i.getCaseValue());
1209 }
1211 visitTerminatorInst(SI);
1212 }
1214 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1215 Assert1(BI.getAddress()->getType()->isPointerTy(),
1216 "Indirectbr operand must have pointer type!", &BI);
1217 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1218 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1219 "Indirectbr destinations must all have pointer type!", &BI);
1221 visitTerminatorInst(BI);
1222 }
1224 void Verifier::visitSelectInst(SelectInst &SI) {
1225 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1226 SI.getOperand(2)),
1227 "Invalid operands for select instruction!", &SI);
1229 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1230 "Select values must have same type as select instruction!", &SI);
1231 visitInstruction(SI);
1232 }
1234 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1235 /// a pass, if any exist, it's an error.
1236 ///
1237 void Verifier::visitUserOp1(Instruction &I) {
1238 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1239 }
1241 void Verifier::visitTruncInst(TruncInst &I) {
1242 // Get the source and destination types
1243 Type *SrcTy = I.getOperand(0)->getType();
1244 Type *DestTy = I.getType();
1246 // Get the size of the types in bits, we'll need this later
1247 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1248 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1250 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1251 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1252 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1253 "trunc source and destination must both be a vector or neither", &I);
1254 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1256 visitInstruction(I);
1257 }
1259 void Verifier::visitZExtInst(ZExtInst &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 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1266 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1267 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1268 "zext source and destination must both be a vector or neither", &I);
1269 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1270 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1272 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1274 visitInstruction(I);
1275 }
1277 void Verifier::visitSExtInst(SExtInst &I) {
1278 // Get the source and destination types
1279 Type *SrcTy = I.getOperand(0)->getType();
1280 Type *DestTy = I.getType();
1282 // Get the size of the types in bits, we'll need this later
1283 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1284 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1286 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1287 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1288 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1289 "sext source and destination must both be a vector or neither", &I);
1290 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1292 visitInstruction(I);
1293 }
1295 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1296 // Get the source and destination types
1297 Type *SrcTy = I.getOperand(0)->getType();
1298 Type *DestTy = I.getType();
1299 // Get the size of the types in bits, we'll need this later
1300 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1301 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1303 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1304 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1305 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1306 "fptrunc source and destination must both be a vector or neither",&I);
1307 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1309 visitInstruction(I);
1310 }
1312 void Verifier::visitFPExtInst(FPExtInst &I) {
1313 // Get the source and destination types
1314 Type *SrcTy = I.getOperand(0)->getType();
1315 Type *DestTy = I.getType();
1317 // Get the size of the types in bits, we'll need this later
1318 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1319 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1321 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1322 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1323 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1324 "fpext source and destination must both be a vector or neither", &I);
1325 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1327 visitInstruction(I);
1328 }
1330 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1331 // Get the source and destination types
1332 Type *SrcTy = I.getOperand(0)->getType();
1333 Type *DestTy = I.getType();
1335 bool SrcVec = SrcTy->isVectorTy();
1336 bool DstVec = DestTy->isVectorTy();
1338 Assert1(SrcVec == DstVec,
1339 "UIToFP source and dest must both be vector or scalar", &I);
1340 Assert1(SrcTy->isIntOrIntVectorTy(),
1341 "UIToFP source must be integer or integer vector", &I);
1342 Assert1(DestTy->isFPOrFPVectorTy(),
1343 "UIToFP result must be FP or FP vector", &I);
1345 if (SrcVec && DstVec)
1346 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1347 cast<VectorType>(DestTy)->getNumElements(),
1348 "UIToFP source and dest vector length mismatch", &I);
1350 visitInstruction(I);
1351 }
1353 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1354 // Get the source and destination types
1355 Type *SrcTy = I.getOperand(0)->getType();
1356 Type *DestTy = I.getType();
1358 bool SrcVec = SrcTy->isVectorTy();
1359 bool DstVec = DestTy->isVectorTy();
1361 Assert1(SrcVec == DstVec,
1362 "SIToFP source and dest must both be vector or scalar", &I);
1363 Assert1(SrcTy->isIntOrIntVectorTy(),
1364 "SIToFP source must be integer or integer vector", &I);
1365 Assert1(DestTy->isFPOrFPVectorTy(),
1366 "SIToFP result must be FP or FP vector", &I);
1368 if (SrcVec && DstVec)
1369 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1370 cast<VectorType>(DestTy)->getNumElements(),
1371 "SIToFP source and dest vector length mismatch", &I);
1373 visitInstruction(I);
1374 }
1376 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1377 // Get the source and destination types
1378 Type *SrcTy = I.getOperand(0)->getType();
1379 Type *DestTy = I.getType();
1381 bool SrcVec = SrcTy->isVectorTy();
1382 bool DstVec = DestTy->isVectorTy();
1384 Assert1(SrcVec == DstVec,
1385 "FPToUI source and dest must both be vector or scalar", &I);
1386 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1387 &I);
1388 Assert1(DestTy->isIntOrIntVectorTy(),
1389 "FPToUI result must be integer or integer vector", &I);
1391 if (SrcVec && DstVec)
1392 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1393 cast<VectorType>(DestTy)->getNumElements(),
1394 "FPToUI source and dest vector length mismatch", &I);
1396 visitInstruction(I);
1397 }
1399 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1400 // Get the source and destination types
1401 Type *SrcTy = I.getOperand(0)->getType();
1402 Type *DestTy = I.getType();
1404 bool SrcVec = SrcTy->isVectorTy();
1405 bool DstVec = DestTy->isVectorTy();
1407 Assert1(SrcVec == DstVec,
1408 "FPToSI source and dest must both be vector or scalar", &I);
1409 Assert1(SrcTy->isFPOrFPVectorTy(),
1410 "FPToSI source must be FP or FP vector", &I);
1411 Assert1(DestTy->isIntOrIntVectorTy(),
1412 "FPToSI result must be integer or integer vector", &I);
1414 if (SrcVec && DstVec)
1415 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1416 cast<VectorType>(DestTy)->getNumElements(),
1417 "FPToSI source and dest vector length mismatch", &I);
1419 visitInstruction(I);
1420 }
1422 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1423 // Get the source and destination types
1424 Type *SrcTy = I.getOperand(0)->getType();
1425 Type *DestTy = I.getType();
1427 Assert1(SrcTy->getScalarType()->isPointerTy(),
1428 "PtrToInt source must be pointer", &I);
1429 Assert1(DestTy->getScalarType()->isIntegerTy(),
1430 "PtrToInt result must be integral", &I);
1431 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1432 "PtrToInt type mismatch", &I);
1434 if (SrcTy->isVectorTy()) {
1435 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1436 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1437 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1438 "PtrToInt Vector width mismatch", &I);
1439 }
1441 visitInstruction(I);
1442 }
1444 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1445 // Get the source and destination types
1446 Type *SrcTy = I.getOperand(0)->getType();
1447 Type *DestTy = I.getType();
1449 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1450 "IntToPtr source must be an integral", &I);
1451 Assert1(DestTy->getScalarType()->isPointerTy(),
1452 "IntToPtr result must be a pointer",&I);
1453 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1454 "IntToPtr type mismatch", &I);
1455 if (SrcTy->isVectorTy()) {
1456 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1457 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1458 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1459 "IntToPtr Vector width mismatch", &I);
1460 }
1461 visitInstruction(I);
1462 }
1464 void Verifier::visitBitCastInst(BitCastInst &I) {
1465 Type *SrcTy = I.getOperand(0)->getType();
1466 Type *DestTy = I.getType();
1467 VerifyBitcastType(&I, DestTy, SrcTy);
1468 visitInstruction(I);
1469 }
1471 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1472 Type *SrcTy = I.getOperand(0)->getType();
1473 Type *DestTy = I.getType();
1475 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1476 "AddrSpaceCast source must be a pointer", &I);
1477 Assert1(DestTy->isPtrOrPtrVectorTy(),
1478 "AddrSpaceCast result must be a pointer", &I);
1479 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1480 "AddrSpaceCast must be between different address spaces", &I);
1481 if (SrcTy->isVectorTy())
1482 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1483 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1484 visitInstruction(I);
1485 }
1487 /// visitPHINode - Ensure that a PHI node is well formed.
1488 ///
1489 void Verifier::visitPHINode(PHINode &PN) {
1490 // Ensure that the PHI nodes are all grouped together at the top of the block.
1491 // This can be tested by checking whether the instruction before this is
1492 // either nonexistent (because this is begin()) or is a PHI node. If not,
1493 // then there is some other instruction before a PHI.
1494 Assert2(&PN == &PN.getParent()->front() ||
1495 isa<PHINode>(--BasicBlock::iterator(&PN)),
1496 "PHI nodes not grouped at top of basic block!",
1497 &PN, PN.getParent());
1499 // Check that all of the values of the PHI node have the same type as the
1500 // result, and that the incoming blocks are really basic blocks.
1501 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1502 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1503 "PHI node operands are not the same type as the result!", &PN);
1504 }
1506 // All other PHI node constraints are checked in the visitBasicBlock method.
1508 visitInstruction(PN);
1509 }
1511 void Verifier::VerifyCallSite(CallSite CS) {
1512 Instruction *I = CS.getInstruction();
1514 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1515 "Called function must be a pointer!", I);
1516 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1518 Assert1(FPTy->getElementType()->isFunctionTy(),
1519 "Called function is not pointer to function type!", I);
1520 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1522 // Verify that the correct number of arguments are being passed
1523 if (FTy->isVarArg())
1524 Assert1(CS.arg_size() >= FTy->getNumParams(),
1525 "Called function requires more parameters than were provided!",I);
1526 else
1527 Assert1(CS.arg_size() == FTy->getNumParams(),
1528 "Incorrect number of arguments passed to called function!", I);
1530 // Verify that all arguments to the call match the function type.
1531 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1532 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1533 "Call parameter type does not match function signature!",
1534 CS.getArgument(i), FTy->getParamType(i), I);
1536 AttributeSet Attrs = CS.getAttributes();
1538 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1539 "Attribute after last parameter!", I);
1541 // Verify call attributes.
1542 VerifyFunctionAttrs(FTy, Attrs, I);
1544 // Verify that values used for inalloca parameters are in fact allocas.
1545 for (unsigned i = 0, e = CS.arg_size(); i != e; ++i) {
1546 if (!Attrs.hasAttribute(1 + i, Attribute::InAlloca))
1547 continue;
1548 Value *Arg = CS.getArgument(i);
1549 Assert2(isa<AllocaInst>(Arg), "Inalloca argument is not an alloca!", I,
1550 Arg);
1551 }
1553 if (FTy->isVarArg()) {
1554 // FIXME? is 'nest' even legal here?
1555 bool SawNest = false;
1556 bool SawReturned = false;
1558 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1559 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1560 SawNest = true;
1561 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1562 SawReturned = true;
1563 }
1565 // Check attributes on the varargs part.
1566 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1567 Type *Ty = CS.getArgument(Idx-1)->getType();
1568 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1570 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1571 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1572 SawNest = true;
1573 }
1575 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1576 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1577 I);
1578 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1579 "Incompatible argument and return types for 'returned' "
1580 "attribute", I);
1581 SawReturned = true;
1582 }
1584 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1585 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1586 }
1587 }
1589 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1590 if (CS.getCalledFunction() == 0 ||
1591 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1592 for (FunctionType::param_iterator PI = FTy->param_begin(),
1593 PE = FTy->param_end(); PI != PE; ++PI)
1594 Assert1(!(*PI)->isMetadataTy(),
1595 "Function has metadata parameter but isn't an intrinsic", I);
1596 }
1598 visitInstruction(*I);
1599 }
1601 void Verifier::visitCallInst(CallInst &CI) {
1602 VerifyCallSite(&CI);
1604 if (Function *F = CI.getCalledFunction())
1605 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1606 visitIntrinsicFunctionCall(ID, CI);
1607 }
1609 void Verifier::visitInvokeInst(InvokeInst &II) {
1610 VerifyCallSite(&II);
1612 // Verify that there is a landingpad instruction as the first non-PHI
1613 // instruction of the 'unwind' destination.
1614 Assert1(II.getUnwindDest()->isLandingPad(),
1615 "The unwind destination does not have a landingpad instruction!",&II);
1617 visitTerminatorInst(II);
1618 }
1620 /// visitBinaryOperator - Check that both arguments to the binary operator are
1621 /// of the same type!
1622 ///
1623 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1624 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1625 "Both operands to a binary operator are not of the same type!", &B);
1627 switch (B.getOpcode()) {
1628 // Check that integer arithmetic operators are only used with
1629 // integral operands.
1630 case Instruction::Add:
1631 case Instruction::Sub:
1632 case Instruction::Mul:
1633 case Instruction::SDiv:
1634 case Instruction::UDiv:
1635 case Instruction::SRem:
1636 case Instruction::URem:
1637 Assert1(B.getType()->isIntOrIntVectorTy(),
1638 "Integer arithmetic operators only work with integral types!", &B);
1639 Assert1(B.getType() == B.getOperand(0)->getType(),
1640 "Integer arithmetic operators must have same type "
1641 "for operands and result!", &B);
1642 break;
1643 // Check that floating-point arithmetic operators are only used with
1644 // floating-point operands.
1645 case Instruction::FAdd:
1646 case Instruction::FSub:
1647 case Instruction::FMul:
1648 case Instruction::FDiv:
1649 case Instruction::FRem:
1650 Assert1(B.getType()->isFPOrFPVectorTy(),
1651 "Floating-point arithmetic operators only work with "
1652 "floating-point types!", &B);
1653 Assert1(B.getType() == B.getOperand(0)->getType(),
1654 "Floating-point arithmetic operators must have same type "
1655 "for operands and result!", &B);
1656 break;
1657 // Check that logical operators are only used with integral operands.
1658 case Instruction::And:
1659 case Instruction::Or:
1660 case Instruction::Xor:
1661 Assert1(B.getType()->isIntOrIntVectorTy(),
1662 "Logical operators only work with integral types!", &B);
1663 Assert1(B.getType() == B.getOperand(0)->getType(),
1664 "Logical operators must have same type for operands and result!",
1665 &B);
1666 break;
1667 case Instruction::Shl:
1668 case Instruction::LShr:
1669 case Instruction::AShr:
1670 Assert1(B.getType()->isIntOrIntVectorTy(),
1671 "Shifts only work with integral types!", &B);
1672 Assert1(B.getType() == B.getOperand(0)->getType(),
1673 "Shift return type must be same as operands!", &B);
1674 break;
1675 default:
1676 llvm_unreachable("Unknown BinaryOperator opcode!");
1677 }
1679 visitInstruction(B);
1680 }
1682 void Verifier::visitICmpInst(ICmpInst &IC) {
1683 // Check that the operands are the same type
1684 Type *Op0Ty = IC.getOperand(0)->getType();
1685 Type *Op1Ty = IC.getOperand(1)->getType();
1686 Assert1(Op0Ty == Op1Ty,
1687 "Both operands to ICmp instruction are not of the same type!", &IC);
1688 // Check that the operands are the right type
1689 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1690 "Invalid operand types for ICmp instruction", &IC);
1691 // Check that the predicate is valid.
1692 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1693 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1694 "Invalid predicate in ICmp instruction!", &IC);
1696 visitInstruction(IC);
1697 }
1699 void Verifier::visitFCmpInst(FCmpInst &FC) {
1700 // Check that the operands are the same type
1701 Type *Op0Ty = FC.getOperand(0)->getType();
1702 Type *Op1Ty = FC.getOperand(1)->getType();
1703 Assert1(Op0Ty == Op1Ty,
1704 "Both operands to FCmp instruction are not of the same type!", &FC);
1705 // Check that the operands are the right type
1706 Assert1(Op0Ty->isFPOrFPVectorTy(),
1707 "Invalid operand types for FCmp instruction", &FC);
1708 // Check that the predicate is valid.
1709 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1710 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1711 "Invalid predicate in FCmp instruction!", &FC);
1713 visitInstruction(FC);
1714 }
1716 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1717 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1718 EI.getOperand(1)),
1719 "Invalid extractelement operands!", &EI);
1720 visitInstruction(EI);
1721 }
1723 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1724 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1725 IE.getOperand(1),
1726 IE.getOperand(2)),
1727 "Invalid insertelement operands!", &IE);
1728 visitInstruction(IE);
1729 }
1731 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1732 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1733 SV.getOperand(2)),
1734 "Invalid shufflevector operands!", &SV);
1735 visitInstruction(SV);
1736 }
1738 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1739 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1741 Assert1(isa<PointerType>(TargetTy),
1742 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1743 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1744 "GEP into unsized type!", &GEP);
1745 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1746 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1747 &GEP);
1749 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1750 Type *ElTy =
1751 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1752 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1754 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1755 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1756 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1758 if (GEP.getPointerOperandType()->isVectorTy()) {
1759 // Additional checks for vector GEPs.
1760 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1761 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1762 "Vector GEP result width doesn't match operand's", &GEP);
1763 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1764 Type *IndexTy = Idxs[i]->getType();
1765 Assert1(IndexTy->isVectorTy(),
1766 "Vector GEP must have vector indices!", &GEP);
1767 unsigned IndexWidth = IndexTy->getVectorNumElements();
1768 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1769 }
1770 }
1771 visitInstruction(GEP);
1772 }
1774 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1775 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1776 }
1778 void Verifier::visitLoadInst(LoadInst &LI) {
1779 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1780 Assert1(PTy, "Load operand must be a pointer.", &LI);
1781 Type *ElTy = PTy->getElementType();
1782 Assert2(ElTy == LI.getType(),
1783 "Load result type does not match pointer operand type!", &LI, ElTy);
1784 if (LI.isAtomic()) {
1785 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1786 "Load cannot have Release ordering", &LI);
1787 Assert1(LI.getAlignment() != 0,
1788 "Atomic load must specify explicit alignment", &LI);
1789 if (!ElTy->isPointerTy()) {
1790 Assert2(ElTy->isIntegerTy(),
1791 "atomic store operand must have integer type!",
1792 &LI, ElTy);
1793 unsigned Size = ElTy->getPrimitiveSizeInBits();
1794 Assert2(Size >= 8 && !(Size & (Size - 1)),
1795 "atomic store operand must be power-of-two byte-sized integer",
1796 &LI, ElTy);
1797 }
1798 } else {
1799 Assert1(LI.getSynchScope() == CrossThread,
1800 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1801 }
1803 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1804 unsigned NumOperands = Range->getNumOperands();
1805 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1806 unsigned NumRanges = NumOperands / 2;
1807 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1809 ConstantRange LastRange(1); // Dummy initial value
1810 for (unsigned i = 0; i < NumRanges; ++i) {
1811 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1812 Assert1(Low, "The lower limit must be an integer!", Low);
1813 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1814 Assert1(High, "The upper limit must be an integer!", High);
1815 Assert1(High->getType() == Low->getType() &&
1816 High->getType() == ElTy, "Range types must match load type!",
1817 &LI);
1819 APInt HighV = High->getValue();
1820 APInt LowV = Low->getValue();
1821 ConstantRange CurRange(LowV, HighV);
1822 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1823 "Range must not be empty!", Range);
1824 if (i != 0) {
1825 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1826 "Intervals are overlapping", Range);
1827 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1828 Range);
1829 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1830 Range);
1831 }
1832 LastRange = ConstantRange(LowV, HighV);
1833 }
1834 if (NumRanges > 2) {
1835 APInt FirstLow =
1836 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1837 APInt FirstHigh =
1838 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1839 ConstantRange FirstRange(FirstLow, FirstHigh);
1840 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1841 "Intervals are overlapping", Range);
1842 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1843 Range);
1844 }
1847 }
1849 visitInstruction(LI);
1850 }
1852 void Verifier::visitStoreInst(StoreInst &SI) {
1853 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1854 Assert1(PTy, "Store operand must be a pointer.", &SI);
1855 Type *ElTy = PTy->getElementType();
1856 Assert2(ElTy == SI.getOperand(0)->getType(),
1857 "Stored value type does not match pointer operand type!",
1858 &SI, ElTy);
1859 if (SI.isAtomic()) {
1860 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1861 "Store cannot have Acquire ordering", &SI);
1862 Assert1(SI.getAlignment() != 0,
1863 "Atomic store must specify explicit alignment", &SI);
1864 if (!ElTy->isPointerTy()) {
1865 Assert2(ElTy->isIntegerTy(),
1866 "atomic store operand must have integer type!",
1867 &SI, ElTy);
1868 unsigned Size = ElTy->getPrimitiveSizeInBits();
1869 Assert2(Size >= 8 && !(Size & (Size - 1)),
1870 "atomic store operand must be power-of-two byte-sized integer",
1871 &SI, ElTy);
1872 }
1873 } else {
1874 Assert1(SI.getSynchScope() == CrossThread,
1875 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1876 }
1877 visitInstruction(SI);
1878 }
1880 void Verifier::visitAllocaInst(AllocaInst &AI) {
1881 SmallPtrSet<const Type*, 4> Visited;
1882 PointerType *PTy = AI.getType();
1883 Assert1(PTy->getAddressSpace() == 0,
1884 "Allocation instruction pointer not in the generic address space!",
1885 &AI);
1886 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
1887 &AI);
1888 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
1889 "Alloca array size must have integer type", &AI);
1891 // Verify that an alloca instruction is not used with inalloca more than once.
1892 unsigned InAllocaUses = 0;
1893 for (User::use_iterator UI = AI.use_begin(), UE = AI.use_end(); UI != UE;
1894 ++UI) {
1895 CallSite CS(*UI);
1896 if (!CS)
1897 continue;
1898 unsigned ArgNo = CS.getArgumentNo(UI);
1899 if (CS.isInAllocaArgument(ArgNo)) {
1900 InAllocaUses++;
1901 Assert1(InAllocaUses <= 1,
1902 "Allocas can be used at most once with inalloca!", &AI);
1903 }
1904 }
1906 visitInstruction(AI);
1907 }
1909 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
1910 Assert1(CXI.getOrdering() != NotAtomic,
1911 "cmpxchg instructions must be atomic.", &CXI);
1912 Assert1(CXI.getOrdering() != Unordered,
1913 "cmpxchg instructions cannot be unordered.", &CXI);
1914 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
1915 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
1916 Type *ElTy = PTy->getElementType();
1917 Assert2(ElTy->isIntegerTy(),
1918 "cmpxchg operand must have integer type!",
1919 &CXI, ElTy);
1920 unsigned Size = ElTy->getPrimitiveSizeInBits();
1921 Assert2(Size >= 8 && !(Size & (Size - 1)),
1922 "cmpxchg operand must be power-of-two byte-sized integer",
1923 &CXI, ElTy);
1924 Assert2(ElTy == CXI.getOperand(1)->getType(),
1925 "Expected value type does not match pointer operand type!",
1926 &CXI, ElTy);
1927 Assert2(ElTy == CXI.getOperand(2)->getType(),
1928 "Stored value type does not match pointer operand type!",
1929 &CXI, ElTy);
1930 visitInstruction(CXI);
1931 }
1933 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
1934 Assert1(RMWI.getOrdering() != NotAtomic,
1935 "atomicrmw instructions must be atomic.", &RMWI);
1936 Assert1(RMWI.getOrdering() != Unordered,
1937 "atomicrmw instructions cannot be unordered.", &RMWI);
1938 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
1939 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
1940 Type *ElTy = PTy->getElementType();
1941 Assert2(ElTy->isIntegerTy(),
1942 "atomicrmw operand must have integer type!",
1943 &RMWI, ElTy);
1944 unsigned Size = ElTy->getPrimitiveSizeInBits();
1945 Assert2(Size >= 8 && !(Size & (Size - 1)),
1946 "atomicrmw operand must be power-of-two byte-sized integer",
1947 &RMWI, ElTy);
1948 Assert2(ElTy == RMWI.getOperand(1)->getType(),
1949 "Argument value type does not match pointer operand type!",
1950 &RMWI, ElTy);
1951 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
1952 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
1953 "Invalid binary operation!", &RMWI);
1954 visitInstruction(RMWI);
1955 }
1957 void Verifier::visitFenceInst(FenceInst &FI) {
1958 const AtomicOrdering Ordering = FI.getOrdering();
1959 Assert1(Ordering == Acquire || Ordering == Release ||
1960 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
1961 "fence instructions may only have "
1962 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
1963 visitInstruction(FI);
1964 }
1966 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1967 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1968 EVI.getIndices()) ==
1969 EVI.getType(),
1970 "Invalid ExtractValueInst operands!", &EVI);
1972 visitInstruction(EVI);
1973 }
1975 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1976 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1977 IVI.getIndices()) ==
1978 IVI.getOperand(1)->getType(),
1979 "Invalid InsertValueInst operands!", &IVI);
1981 visitInstruction(IVI);
1982 }
1984 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
1985 BasicBlock *BB = LPI.getParent();
1987 // The landingpad instruction is ill-formed if it doesn't have any clauses and
1988 // isn't a cleanup.
1989 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
1990 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
1992 // The landingpad instruction defines its parent as a landing pad block. The
1993 // landing pad block may be branched to only by the unwind edge of an invoke.
1994 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
1995 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
1996 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
1997 "Block containing LandingPadInst must be jumped to "
1998 "only by the unwind edge of an invoke.", &LPI);
1999 }
2001 // The landingpad instruction must be the first non-PHI instruction in the
2002 // block.
2003 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
2004 "LandingPadInst not the first non-PHI instruction in the block.",
2005 &LPI);
2007 // The personality functions for all landingpad instructions within the same
2008 // function should match.
2009 if (PersonalityFn)
2010 Assert1(LPI.getPersonalityFn() == PersonalityFn,
2011 "Personality function doesn't match others in function", &LPI);
2012 PersonalityFn = LPI.getPersonalityFn();
2014 // All operands must be constants.
2015 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
2016 &LPI);
2017 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
2018 Value *Clause = LPI.getClause(i);
2019 Assert1(isa<Constant>(Clause), "Clause is not constant!", &LPI);
2020 if (LPI.isCatch(i)) {
2021 Assert1(isa<PointerType>(Clause->getType()),
2022 "Catch operand does not have pointer type!", &LPI);
2023 } else {
2024 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
2025 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
2026 "Filter operand is not an array of constants!", &LPI);
2027 }
2028 }
2030 visitInstruction(LPI);
2031 }
2033 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
2034 Instruction *Op = cast<Instruction>(I.getOperand(i));
2035 // If the we have an invalid invoke, don't try to compute the dominance.
2036 // We already reject it in the invoke specific checks and the dominance
2037 // computation doesn't handle multiple edges.
2038 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2039 if (II->getNormalDest() == II->getUnwindDest())
2040 return;
2041 }
2043 const Use &U = I.getOperandUse(i);
2044 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, U),
2045 "Instruction does not dominate all uses!", Op, &I);
2046 }
2048 /// verifyInstruction - Verify that an instruction is well formed.
2049 ///
2050 void Verifier::visitInstruction(Instruction &I) {
2051 BasicBlock *BB = I.getParent();
2052 Assert1(BB, "Instruction not embedded in basic block!", &I);
2054 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2055 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
2056 UI != UE; ++UI)
2057 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
2058 "Only PHI nodes may reference their own value!", &I);
2059 }
2061 // Check that void typed values don't have names
2062 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2063 "Instruction has a name, but provides a void value!", &I);
2065 // Check that the return value of the instruction is either void or a legal
2066 // value type.
2067 Assert1(I.getType()->isVoidTy() ||
2068 I.getType()->isFirstClassType(),
2069 "Instruction returns a non-scalar type!", &I);
2071 // Check that the instruction doesn't produce metadata. Calls are already
2072 // checked against the callee type.
2073 Assert1(!I.getType()->isMetadataTy() ||
2074 isa<CallInst>(I) || isa<InvokeInst>(I),
2075 "Invalid use of metadata!", &I);
2077 // Check that all uses of the instruction, if they are instructions
2078 // themselves, actually have parent basic blocks. If the use is not an
2079 // instruction, it is an error!
2080 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
2081 UI != UE; ++UI) {
2082 if (Instruction *Used = dyn_cast<Instruction>(*UI))
2083 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
2084 " embedded in a basic block!", &I, Used);
2085 else {
2086 CheckFailed("Use of instruction is not an instruction!", *UI);
2087 return;
2088 }
2089 }
2091 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2092 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
2094 // Check to make sure that only first-class-values are operands to
2095 // instructions.
2096 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2097 Assert1(0, "Instruction operands must be first-class values!", &I);
2098 }
2100 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2101 // Check to make sure that the "address of" an intrinsic function is never
2102 // taken.
2103 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
2104 "Cannot take the address of an intrinsic!", &I);
2105 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2106 F->getIntrinsicID() == Intrinsic::donothing,
2107 "Cannot invoke an intrinsinc other than donothing", &I);
2108 Assert1(F->getParent() == Mod, "Referencing function in another module!",
2109 &I);
2110 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2111 Assert1(OpBB->getParent() == BB->getParent(),
2112 "Referring to a basic block in another function!", &I);
2113 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2114 Assert1(OpArg->getParent() == BB->getParent(),
2115 "Referring to an argument in another function!", &I);
2116 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2117 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
2118 &I);
2119 } else if (isa<Instruction>(I.getOperand(i))) {
2120 verifyDominatesUse(I, i);
2121 } else if (isa<InlineAsm>(I.getOperand(i))) {
2122 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2123 (i + 3 == e && isa<InvokeInst>(I)),
2124 "Cannot take the address of an inline asm!", &I);
2125 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2126 if (CE->getType()->isPtrOrPtrVectorTy()) {
2127 // If we have a ConstantExpr pointer, we need to see if it came from an
2128 // illegal bitcast (inttoptr <constant int> )
2129 SmallVector<const ConstantExpr *, 4> Stack;
2130 SmallPtrSet<const ConstantExpr *, 4> Visited;
2131 Stack.push_back(CE);
2133 while (!Stack.empty()) {
2134 const ConstantExpr *V = Stack.pop_back_val();
2135 if (!Visited.insert(V))
2136 continue;
2138 VerifyConstantExprBitcastType(V);
2140 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2141 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2142 Stack.push_back(Op);
2143 }
2144 }
2145 }
2146 }
2147 }
2149 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2150 Assert1(I.getType()->isFPOrFPVectorTy(),
2151 "fpmath requires a floating point result!", &I);
2152 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2153 Value *Op0 = MD->getOperand(0);
2154 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
2155 APFloat Accuracy = CFP0->getValueAPF();
2156 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2157 "fpmath accuracy not a positive number!", &I);
2158 } else {
2159 Assert1(false, "invalid fpmath accuracy!", &I);
2160 }
2161 }
2163 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
2164 Assert1(!MD || isa<LoadInst>(I), "Ranges are only for loads!", &I);
2166 if (!DisableDebugInfoVerifier) {
2167 MD = I.getMetadata(LLVMContext::MD_dbg);
2168 Finder.processLocation(*Mod, DILocation(MD));
2169 }
2171 InstsInThisBlock.insert(&I);
2172 }
2174 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2175 /// intrinsic argument or return value) matches the type constraints specified
2176 /// by the .td file (e.g. an "any integer" argument really is an integer).
2177 ///
2178 /// This return true on error but does not print a message.
2179 bool Verifier::VerifyIntrinsicType(Type *Ty,
2180 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2181 SmallVectorImpl<Type*> &ArgTys) {
2182 using namespace Intrinsic;
2184 // If we ran out of descriptors, there are too many arguments.
2185 if (Infos.empty()) return true;
2186 IITDescriptor D = Infos.front();
2187 Infos = Infos.slice(1);
2189 switch (D.Kind) {
2190 case IITDescriptor::Void: return !Ty->isVoidTy();
2191 case IITDescriptor::VarArg: return true;
2192 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2193 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2194 case IITDescriptor::Half: return !Ty->isHalfTy();
2195 case IITDescriptor::Float: return !Ty->isFloatTy();
2196 case IITDescriptor::Double: return !Ty->isDoubleTy();
2197 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2198 case IITDescriptor::Vector: {
2199 VectorType *VT = dyn_cast<VectorType>(Ty);
2200 return VT == 0 || VT->getNumElements() != D.Vector_Width ||
2201 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2202 }
2203 case IITDescriptor::Pointer: {
2204 PointerType *PT = dyn_cast<PointerType>(Ty);
2205 return PT == 0 || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2206 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2207 }
2209 case IITDescriptor::Struct: {
2210 StructType *ST = dyn_cast<StructType>(Ty);
2211 if (ST == 0 || ST->getNumElements() != D.Struct_NumElements)
2212 return true;
2214 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2215 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2216 return true;
2217 return false;
2218 }
2220 case IITDescriptor::Argument:
2221 // Two cases here - If this is the second occurrence of an argument, verify
2222 // that the later instance matches the previous instance.
2223 if (D.getArgumentNumber() < ArgTys.size())
2224 return Ty != ArgTys[D.getArgumentNumber()];
2226 // Otherwise, if this is the first instance of an argument, record it and
2227 // verify the "Any" kind.
2228 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2229 ArgTys.push_back(Ty);
2231 switch (D.getArgumentKind()) {
2232 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2233 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2234 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2235 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2236 }
2237 llvm_unreachable("all argument kinds not covered");
2239 case IITDescriptor::ExtendVecArgument:
2240 // This may only be used when referring to a previous vector argument.
2241 return D.getArgumentNumber() >= ArgTys.size() ||
2242 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2243 VectorType::getExtendedElementVectorType(
2244 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2246 case IITDescriptor::TruncVecArgument:
2247 // This may only be used when referring to a previous vector argument.
2248 return D.getArgumentNumber() >= ArgTys.size() ||
2249 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2250 VectorType::getTruncatedElementVectorType(
2251 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2252 }
2253 llvm_unreachable("unhandled");
2254 }
2256 /// \brief Verify if the intrinsic has variable arguments.
2257 /// This method is intended to be called after all the fixed arguments have been
2258 /// verified first.
2259 ///
2260 /// This method returns true on error and does not print an error message.
2261 bool
2262 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2263 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2264 using namespace Intrinsic;
2266 // If there are no descriptors left, then it can't be a vararg.
2267 if (Infos.empty())
2268 return isVarArg ? true : false;
2270 // There should be only one descriptor remaining at this point.
2271 if (Infos.size() != 1)
2272 return true;
2274 // Check and verify the descriptor.
2275 IITDescriptor D = Infos.front();
2276 Infos = Infos.slice(1);
2277 if (D.Kind == IITDescriptor::VarArg)
2278 return isVarArg ? false : true;
2280 return true;
2281 }
2283 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2284 ///
2285 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2286 Function *IF = CI.getCalledFunction();
2287 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2288 IF);
2290 // Verify that the intrinsic prototype lines up with what the .td files
2291 // describe.
2292 FunctionType *IFTy = IF->getFunctionType();
2293 bool IsVarArg = IFTy->isVarArg();
2295 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2296 getIntrinsicInfoTableEntries(ID, Table);
2297 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2299 SmallVector<Type *, 4> ArgTys;
2300 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2301 "Intrinsic has incorrect return type!", IF);
2302 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2303 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2304 "Intrinsic has incorrect argument type!", IF);
2306 // Verify if the intrinsic call matches the vararg property.
2307 if (IsVarArg)
2308 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2309 "Intrinsic was not defined with variable arguments!", IF);
2310 else
2311 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2312 "Callsite was not defined with variable arguments!", IF);
2314 // All descriptors should be absorbed by now.
2315 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2317 // Now that we have the intrinsic ID and the actual argument types (and we
2318 // know they are legal for the intrinsic!) get the intrinsic name through the
2319 // usual means. This allows us to verify the mangling of argument types into
2320 // the name.
2321 Assert1(Intrinsic::getName(ID, ArgTys) == IF->getName(),
2322 "Intrinsic name not mangled correctly for type arguments!", IF);
2324 // If the intrinsic takes MDNode arguments, verify that they are either global
2325 // or are local to *this* function.
2326 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2327 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
2328 visitMDNode(*MD, CI.getParent()->getParent());
2330 switch (ID) {
2331 default:
2332 break;
2333 case Intrinsic::ctlz: // llvm.ctlz
2334 case Intrinsic::cttz: // llvm.cttz
2335 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2336 "is_zero_undef argument of bit counting intrinsics must be a "
2337 "constant int", &CI);
2338 break;
2339 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2340 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2341 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2342 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
2343 Assert1(MD->getNumOperands() == 1,
2344 "invalid llvm.dbg.declare intrinsic call 2", &CI);
2345 if (!DisableDebugInfoVerifier)
2346 Finder.processDeclare(*Mod, cast<DbgDeclareInst>(&CI));
2347 } break;
2348 case Intrinsic::dbg_value: { //llvm.dbg.value
2349 if (!DisableDebugInfoVerifier) {
2350 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2351 "invalid llvm.dbg.value intrinsic call 1", &CI);
2352 Finder.processValue(*Mod, cast<DbgValueInst>(&CI));
2353 }
2354 break;
2355 }
2356 case Intrinsic::memcpy:
2357 case Intrinsic::memmove:
2358 case Intrinsic::memset:
2359 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2360 "alignment argument of memory intrinsics must be a constant int",
2361 &CI);
2362 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2363 "isvolatile argument of memory intrinsics must be a constant int",
2364 &CI);
2365 break;
2366 case Intrinsic::gcroot:
2367 case Intrinsic::gcwrite:
2368 case Intrinsic::gcread:
2369 if (ID == Intrinsic::gcroot) {
2370 AllocaInst *AI =
2371 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2372 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2373 Assert1(isa<Constant>(CI.getArgOperand(1)),
2374 "llvm.gcroot parameter #2 must be a constant.", &CI);
2375 if (!AI->getType()->getElementType()->isPointerTy()) {
2376 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2377 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2378 "or argument #2 must be a non-null constant.", &CI);
2379 }
2380 }
2382 Assert1(CI.getParent()->getParent()->hasGC(),
2383 "Enclosing function does not use GC.", &CI);
2384 break;
2385 case Intrinsic::init_trampoline:
2386 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2387 "llvm.init_trampoline parameter #2 must resolve to a function.",
2388 &CI);
2389 break;
2390 case Intrinsic::prefetch:
2391 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2392 isa<ConstantInt>(CI.getArgOperand(2)) &&
2393 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2394 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2395 "invalid arguments to llvm.prefetch",
2396 &CI);
2397 break;
2398 case Intrinsic::stackprotector:
2399 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2400 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2401 &CI);
2402 break;
2403 case Intrinsic::lifetime_start:
2404 case Intrinsic::lifetime_end:
2405 case Intrinsic::invariant_start:
2406 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2407 "size argument of memory use markers must be a constant integer",
2408 &CI);
2409 break;
2410 case Intrinsic::invariant_end:
2411 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2412 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2413 break;
2414 }
2415 }
2417 void Verifier::verifyDebugInfo() {
2418 // Verify Debug Info.
2419 if (!DisableDebugInfoVerifier) {
2420 for (DebugInfoFinder::iterator I = Finder.compile_unit_begin(),
2421 E = Finder.compile_unit_end(); I != E; ++I)
2422 Assert1(DICompileUnit(*I).Verify(), "DICompileUnit does not Verify!", *I);
2423 for (DebugInfoFinder::iterator I = Finder.subprogram_begin(),
2424 E = Finder.subprogram_end(); I != E; ++I)
2425 Assert1(DISubprogram(*I).Verify(), "DISubprogram does not Verify!", *I);
2426 for (DebugInfoFinder::iterator I = Finder.global_variable_begin(),
2427 E = Finder.global_variable_end(); I != E; ++I)
2428 Assert1(DIGlobalVariable(*I).Verify(),
2429 "DIGlobalVariable does not Verify!", *I);
2430 for (DebugInfoFinder::iterator I = Finder.type_begin(),
2431 E = Finder.type_end(); I != E; ++I)
2432 Assert1(DIType(*I).Verify(), "DIType does not Verify!", *I);
2433 for (DebugInfoFinder::iterator I = Finder.scope_begin(),
2434 E = Finder.scope_end(); I != E; ++I)
2435 Assert1(DIScope(*I).Verify(), "DIScope does not Verify!", *I);
2436 }
2437 }
2439 //===----------------------------------------------------------------------===//
2440 // Implement the public interfaces to this file...
2441 //===----------------------------------------------------------------------===//
2443 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
2444 return new Verifier(action);
2445 }
2448 /// verifyFunction - Check a function for errors, printing messages on stderr.
2449 /// Return true if the function is corrupt.
2450 ///
2451 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
2452 Function &F = const_cast<Function&>(f);
2453 assert(!F.isDeclaration() && "Cannot verify external functions");
2455 FunctionPassManager FPM(F.getParent());
2456 Verifier *V = new Verifier(action);
2457 FPM.add(V);
2458 FPM.doInitialization();
2459 FPM.run(F);
2460 return V->Broken;
2461 }
2463 /// verifyModule - Check a module for errors, printing messages on stderr.
2464 /// Return true if the module is corrupt.
2465 ///
2466 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
2467 std::string *ErrorInfo) {
2468 PassManager PM;
2469 Verifier *V = new Verifier(action);
2470 PM.add(V);
2471 PM.run(const_cast<Module&>(M));
2473 if (ErrorInfo && V->Broken)
2474 *ErrorInfo = V->MessagesStr.str();
2475 return V->Broken;
2476 }