1 //===-- Verifier.cpp - Implement the Module Verifier -----------------------==//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the function verifier interface, that can be used for some
11 // sanity checking of input to the system.
13 // Note that this does not provide full `Java style' security and verifications,
14 // instead it just tries to ensure that code is well-formed.
16 // * Both of a binary operator's parameters are of the same type
17 // * Verify that the indices of mem access instructions match other operands
18 // * Verify that arithmetic and other things are only performed on first-class
19 // types. Verify that shifts & logicals only happen on integrals f.e.
20 // * All of the constants in a switch statement are of the correct type
21 // * The code is in valid SSA form
22 // * It should be illegal to put a label into any other type (like a structure)
23 // or to return one. [except constant arrays!]
24 // * Only phi nodes can be self referential: 'add i32 %0, %0 ; <int>:0' is bad
25 // * PHI nodes must have an entry for each predecessor, with no extras.
26 // * PHI nodes must be the first thing in a basic block, all grouped together
27 // * PHI nodes must have at least one entry
28 // * All basic blocks should only end with terminator insts, not contain them
29 // * The entry node to a function must not have predecessors
30 // * All Instructions must be embedded into a basic block
31 // * Functions cannot take a void-typed parameter
32 // * Verify that a function's argument list agrees with it's declared type.
33 // * It is illegal to specify a name for a void value.
34 // * It is illegal to have a internal global value with no initializer
35 // * It is illegal to have a ret instruction that returns a value that does not
36 // agree with the function return value type.
37 // * Function call argument types match the function prototype
38 // * A landing pad is defined by a landingpad instruction, and can be jumped to
39 // only by the unwind edge of an invoke instruction.
40 // * A landingpad instruction must be the first non-PHI instruction in the
42 // * All landingpad instructions must use the same personality function with
44 // * All other things that are tested by asserts spread about the code...
46 //===----------------------------------------------------------------------===//
48 #include "llvm/IR/Verifier.h"
49 #include "llvm/ADT/STLExtras.h"
50 #include "llvm/ADT/SetVector.h"
51 #include "llvm/ADT/SmallPtrSet.h"
52 #include "llvm/ADT/SmallVector.h"
53 #include "llvm/ADT/StringExtras.h"
54 #include "llvm/IR/CFG.h"
55 #include "llvm/IR/CallSite.h"
56 #include "llvm/IR/CallingConv.h"
57 #include "llvm/IR/ConstantRange.h"
58 #include "llvm/IR/Constants.h"
59 #include "llvm/IR/DataLayout.h"
60 #include "llvm/IR/DebugInfo.h"
61 #include "llvm/IR/DerivedTypes.h"
62 #include "llvm/IR/Dominators.h"
63 #include "llvm/IR/InlineAsm.h"
64 #include "llvm/IR/InstIterator.h"
65 #include "llvm/IR/InstVisitor.h"
66 #include "llvm/IR/IntrinsicInst.h"
67 #include "llvm/IR/LLVMContext.h"
68 #include "llvm/IR/Metadata.h"
69 #include "llvm/IR/Module.h"
70 #include "llvm/IR/PassManager.h"
71 #include "llvm/Pass.h"
72 #include "llvm/Support/CommandLine.h"
73 #include "llvm/Support/Debug.h"
74 #include "llvm/Support/ErrorHandling.h"
75 #include "llvm/Support/raw_ostream.h"
80 static cl::opt<bool> VerifyDebugInfo("verify-debug-info", cl::init(false));
83 struct VerifierSupport {
87 /// \brief Track the brokenness of the module while recursively visiting.
90 explicit VerifierSupport(raw_ostream &OS)
91 : OS(OS), M(nullptr), Broken(false) {}
93 void WriteValue(const Value *V) {
96 if (isa<Instruction>(V)) {
99 V->printAsOperand(OS, true, M);
104 void WriteType(Type *T) {
110 void WriteComdat(const Comdat *C) {
116 // CheckFailed - A check failed, so print out the condition and the message
117 // that failed. This provides a nice place to put a breakpoint if you want
118 // to see why something is not correct.
119 void CheckFailed(const Twine &Message, const Value *V1 = nullptr,
120 const Value *V2 = nullptr, const Value *V3 = nullptr,
121 const Value *V4 = nullptr) {
122 OS << Message.str() << "\n";
130 void CheckFailed(const Twine &Message, const Value *V1, Type *T2,
131 const Value *V3 = nullptr) {
132 OS << Message.str() << "\n";
139 void CheckFailed(const Twine &Message, Type *T1, Type *T2 = nullptr,
140 Type *T3 = nullptr) {
141 OS << Message.str() << "\n";
148 void CheckFailed(const Twine &Message, const Comdat *C) {
149 OS << Message.str() << "\n";
154 class Verifier : public InstVisitor<Verifier>, VerifierSupport {
155 friend class InstVisitor<Verifier>;
157 LLVMContext *Context;
158 const DataLayout *DL;
161 /// \brief When verifying a basic block, keep track of all of the
162 /// instructions we have seen so far.
164 /// This allows us to do efficient dominance checks for the case when an
165 /// instruction has an operand that is an instruction in the same block.
166 SmallPtrSet<Instruction *, 16> InstsInThisBlock;
168 /// \brief Keep track of the metadata nodes that have been checked already.
169 SmallPtrSet<MDNode *, 32> MDNodes;
171 /// \brief The personality function referenced by the LandingPadInsts.
172 /// All LandingPadInsts within the same function must use the same
173 /// personality function.
174 const Value *PersonalityFn;
177 explicit Verifier(raw_ostream &OS = dbgs())
178 : VerifierSupport(OS), Context(nullptr), DL(nullptr),
179 PersonalityFn(nullptr) {}
181 bool verify(const Function &F) {
183 Context = &M->getContext();
185 // First ensure the function is well-enough formed to compute dominance
188 OS << "Function '" << F.getName()
189 << "' does not contain an entry block!\n";
192 for (Function::const_iterator I = F.begin(), E = F.end(); I != E; ++I) {
193 if (I->empty() || !I->back().isTerminator()) {
194 OS << "Basic Block in function '" << F.getName()
195 << "' does not have terminator!\n";
196 I->printAsOperand(OS, true);
202 // Now directly compute a dominance tree. We don't rely on the pass
203 // manager to provide this as it isolates us from a potentially
204 // out-of-date dominator tree and makes it significantly more complex to
205 // run this code outside of a pass manager.
206 // FIXME: It's really gross that we have to cast away constness here.
207 DT.recalculate(const_cast<Function &>(F));
210 // FIXME: We strip const here because the inst visitor strips const.
211 visit(const_cast<Function &>(F));
212 InstsInThisBlock.clear();
213 PersonalityFn = nullptr;
218 bool verify(const Module &M) {
220 Context = &M.getContext();
223 // Scan through, checking all of the external function's linkage now...
224 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I) {
225 visitGlobalValue(*I);
227 // Check to make sure function prototypes are okay.
228 if (I->isDeclaration())
232 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
234 visitGlobalVariable(*I);
236 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
238 visitGlobalAlias(*I);
240 for (Module::const_named_metadata_iterator I = M.named_metadata_begin(),
241 E = M.named_metadata_end();
243 visitNamedMDNode(*I);
245 for (const StringMapEntry<Comdat> &SMEC : M.getComdatSymbolTable())
246 visitComdat(SMEC.getValue());
249 visitModuleIdents(M);
255 // Verification methods...
256 void visitGlobalValue(const GlobalValue &GV);
257 void visitGlobalVariable(const GlobalVariable &GV);
258 void visitGlobalAlias(const GlobalAlias &GA);
259 void visitAliaseeSubExpr(const GlobalAlias &A, const Constant &C);
260 void visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias *> &Visited,
261 const GlobalAlias &A, const Constant &C);
262 void visitNamedMDNode(const NamedMDNode &NMD);
263 void visitMDNode(MDNode &MD, Function *F);
264 void visitComdat(const Comdat &C);
265 void visitModuleIdents(const Module &M);
266 void visitModuleFlags(const Module &M);
267 void visitModuleFlag(const MDNode *Op,
268 DenseMap<const MDString *, const MDNode *> &SeenIDs,
269 SmallVectorImpl<const MDNode *> &Requirements);
270 void visitFunction(const Function &F);
271 void visitBasicBlock(BasicBlock &BB);
272 void visitRangeMetadata(Instruction& I, MDNode* Range, Type* Ty);
275 // InstVisitor overrides...
276 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 void verifyMustTailCall(CallInst &CI);
326 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
327 unsigned ArgNo, std::string &Suffix);
328 bool VerifyIntrinsicType(Type *Ty, 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, bool isFunction,
335 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
336 bool isReturnValue, const Value *V);
337 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
340 void VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy);
341 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
343 class DebugInfoVerifier : public VerifierSupport {
345 explicit DebugInfoVerifier(raw_ostream &OS = dbgs()) : VerifierSupport(OS) {}
347 bool verify(const Module &M) {
354 void verifyDebugInfo();
355 void processInstructions(DebugInfoFinder &Finder);
356 void processCallInst(DebugInfoFinder &Finder, const CallInst &CI);
358 } // End anonymous namespace
360 // Assert - We know that cond should be true, if not print an error message.
361 #define Assert(C, M) \
362 do { if (!(C)) { CheckFailed(M); return; } } while (0)
363 #define Assert1(C, M, V1) \
364 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
365 #define Assert2(C, M, V1, V2) \
366 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
367 #define Assert3(C, M, V1, V2, V3) \
368 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
369 #define Assert4(C, M, V1, V2, V3, V4) \
370 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
372 void Verifier::visit(Instruction &I) {
373 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
374 Assert1(I.getOperand(i) != nullptr, "Operand is null", &I);
375 InstVisitor<Verifier>::visit(I);
379 void Verifier::visitGlobalValue(const GlobalValue &GV) {
380 Assert1(!GV.isDeclaration() || GV.hasExternalLinkage() ||
381 GV.hasExternalWeakLinkage(),
382 "Global is external, but doesn't have external or weak linkage!",
385 Assert1(GV.getAlignment() <= Value::MaximumAlignment,
386 "huge alignment values are unsupported", &GV);
387 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
388 "Only global variables can have appending linkage!", &GV);
390 if (GV.hasAppendingLinkage()) {
391 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
392 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
393 "Only global arrays can have appending linkage!", GVar);
397 void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
398 if (GV.hasInitializer()) {
399 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
400 "Global variable initializer type does not match global "
401 "variable type!", &GV);
403 // If the global has common linkage, it must have a zero initializer and
404 // cannot be constant.
405 if (GV.hasCommonLinkage()) {
406 Assert1(GV.getInitializer()->isNullValue(),
407 "'common' global must have a zero initializer!", &GV);
408 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
410 Assert1(!GV.hasComdat(), "'common' global may not be in a Comdat!", &GV);
413 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
414 "invalid linkage type for global declaration", &GV);
417 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
418 GV.getName() == "llvm.global_dtors")) {
419 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
420 "invalid linkage for intrinsic global variable", &GV);
421 // Don't worry about emitting an error for it not being an array,
422 // visitGlobalValue will complain on appending non-array.
423 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType()->getElementType())) {
424 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
425 PointerType *FuncPtrTy =
426 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
427 // FIXME: Reject the 2-field form in LLVM 4.0.
428 Assert1(STy && (STy->getNumElements() == 2 ||
429 STy->getNumElements() == 3) &&
430 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
431 STy->getTypeAtIndex(1) == FuncPtrTy,
432 "wrong type for intrinsic global variable", &GV);
433 if (STy->getNumElements() == 3) {
434 Type *ETy = STy->getTypeAtIndex(2);
435 Assert1(ETy->isPointerTy() &&
436 cast<PointerType>(ETy)->getElementType()->isIntegerTy(8),
437 "wrong type for intrinsic global variable", &GV);
442 if (GV.hasName() && (GV.getName() == "llvm.used" ||
443 GV.getName() == "llvm.compiler.used")) {
444 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
445 "invalid linkage for intrinsic global variable", &GV);
446 Type *GVType = GV.getType()->getElementType();
447 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
448 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
449 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
450 if (GV.hasInitializer()) {
451 const Constant *Init = GV.getInitializer();
452 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
453 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
455 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
456 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
458 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
459 "invalid llvm.used member", V);
460 Assert1(V->hasName(), "members of llvm.used must be named", V);
466 Assert1(!GV.hasDLLImportStorageClass() ||
467 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
468 GV.hasAvailableExternallyLinkage(),
469 "Global is marked as dllimport, but not external", &GV);
471 if (!GV.hasInitializer()) {
472 visitGlobalValue(GV);
476 // Walk any aggregate initializers looking for bitcasts between address spaces
477 SmallPtrSet<const Value *, 4> Visited;
478 SmallVector<const Value *, 4> WorkStack;
479 WorkStack.push_back(cast<Value>(GV.getInitializer()));
481 while (!WorkStack.empty()) {
482 const Value *V = WorkStack.pop_back_val();
483 if (!Visited.insert(V).second)
486 if (const User *U = dyn_cast<User>(V)) {
487 for (unsigned I = 0, N = U->getNumOperands(); I != N; ++I)
488 WorkStack.push_back(U->getOperand(I));
491 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
492 VerifyConstantExprBitcastType(CE);
498 visitGlobalValue(GV);
501 void Verifier::visitAliaseeSubExpr(const GlobalAlias &GA, const Constant &C) {
502 SmallPtrSet<const GlobalAlias*, 4> Visited;
504 visitAliaseeSubExpr(Visited, GA, C);
507 void Verifier::visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias*> &Visited,
508 const GlobalAlias &GA, const Constant &C) {
509 if (const auto *GV = dyn_cast<GlobalValue>(&C)) {
510 Assert1(!GV->isDeclaration(), "Alias must point to a definition", &GA);
512 if (const auto *GA2 = dyn_cast<GlobalAlias>(GV)) {
513 Assert1(Visited.insert(GA2).second, "Aliases cannot form a cycle", &GA);
515 Assert1(!GA2->mayBeOverridden(), "Alias cannot point to a weak alias",
518 // Only continue verifying subexpressions of GlobalAliases.
519 // Do not recurse into global initializers.
524 if (const auto *CE = dyn_cast<ConstantExpr>(&C))
525 VerifyConstantExprBitcastType(CE);
527 for (const Use &U : C.operands()) {
529 if (const auto *GA2 = dyn_cast<GlobalAlias>(V))
530 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
531 else if (const auto *C2 = dyn_cast<Constant>(V))
532 visitAliaseeSubExpr(Visited, GA, *C2);
536 void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
537 Assert1(!GA.getName().empty(),
538 "Alias name cannot be empty!", &GA);
539 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
540 "Alias should have private, internal, linkonce, weak, linkonce_odr, "
541 "weak_odr, or external linkage!",
543 const Constant *Aliasee = GA.getAliasee();
544 Assert1(Aliasee, "Aliasee cannot be NULL!", &GA);
545 Assert1(GA.getType() == Aliasee->getType(),
546 "Alias and aliasee types should match!", &GA);
548 Assert1(isa<GlobalValue>(Aliasee) || isa<ConstantExpr>(Aliasee),
549 "Aliasee should be either GlobalValue or ConstantExpr", &GA);
551 visitAliaseeSubExpr(GA, *Aliasee);
553 visitGlobalValue(GA);
556 void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
557 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
558 MDNode *MD = NMD.getOperand(i);
562 Assert1(!MD->isFunctionLocal(),
563 "Named metadata operand cannot be function local!", MD);
564 visitMDNode(*MD, nullptr);
568 void Verifier::visitMDNode(MDNode &MD, Function *F) {
569 // Only visit each node once. Metadata can be mutually recursive, so this
570 // avoids infinite recursion here, as well as being an optimization.
571 if (!MDNodes.insert(&MD).second)
574 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
575 Value *Op = MD.getOperand(i);
578 if (isa<Constant>(Op) || isa<MDString>(Op))
580 if (MDNode *N = dyn_cast<MDNode>(Op)) {
581 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
582 "Global metadata operand cannot be function local!", &MD, N);
586 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
588 // If this was an instruction, bb, or argument, verify that it is in the
589 // function that we expect.
590 Function *ActualF = nullptr;
591 if (Instruction *I = dyn_cast<Instruction>(Op))
592 ActualF = I->getParent()->getParent();
593 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
594 ActualF = BB->getParent();
595 else if (Argument *A = dyn_cast<Argument>(Op))
596 ActualF = A->getParent();
597 assert(ActualF && "Unimplemented function local metadata case!");
599 Assert2(ActualF == F, "function-local metadata used in wrong function",
604 void Verifier::visitComdat(const Comdat &C) {
605 // All Comdat::SelectionKind values other than Comdat::Any require a
606 // GlobalValue with the same name as the Comdat.
607 const GlobalValue *GV = M->getNamedValue(C.getName());
608 if (C.getSelectionKind() != Comdat::Any)
610 "comdat selection kind requires a global value with the same name",
612 // The Module is invalid if the GlobalValue has private linkage. Entities
613 // with private linkage don't have entries in the symbol table.
615 Assert1(!GV->hasPrivateLinkage(), "comdat global value has private linkage",
619 void Verifier::visitModuleIdents(const Module &M) {
620 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
624 // llvm.ident takes a list of metadata entry. Each entry has only one string.
625 // Scan each llvm.ident entry and make sure that this requirement is met.
626 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
627 const MDNode *N = Idents->getOperand(i);
628 Assert1(N->getNumOperands() == 1,
629 "incorrect number of operands in llvm.ident metadata", N);
630 Assert1(isa<MDString>(N->getOperand(0)),
631 ("invalid value for llvm.ident metadata entry operand"
632 "(the operand should be a string)"),
637 void Verifier::visitModuleFlags(const Module &M) {
638 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
641 // Scan each flag, and track the flags and requirements.
642 DenseMap<const MDString*, const MDNode*> SeenIDs;
643 SmallVector<const MDNode*, 16> Requirements;
644 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
645 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
648 // Validate that the requirements in the module are valid.
649 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
650 const MDNode *Requirement = Requirements[I];
651 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
652 const Value *ReqValue = Requirement->getOperand(1);
654 const MDNode *Op = SeenIDs.lookup(Flag);
656 CheckFailed("invalid requirement on flag, flag is not present in module",
661 if (Op->getOperand(2) != ReqValue) {
662 CheckFailed(("invalid requirement on flag, "
663 "flag does not have the required value"),
671 Verifier::visitModuleFlag(const MDNode *Op,
672 DenseMap<const MDString *, const MDNode *> &SeenIDs,
673 SmallVectorImpl<const MDNode *> &Requirements) {
674 // Each module flag should have three arguments, the merge behavior (a
675 // constant int), the flag ID (an MDString), and the value.
676 Assert1(Op->getNumOperands() == 3,
677 "incorrect number of operands in module flag", Op);
678 Module::ModFlagBehavior MFB;
679 if (!Module::isValidModFlagBehavior(Op->getOperand(0), MFB)) {
681 dyn_cast<ConstantInt>(Op->getOperand(0)),
682 "invalid behavior operand in module flag (expected constant integer)",
685 "invalid behavior operand in module flag (unexpected constant)",
688 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
690 "invalid ID operand in module flag (expected metadata string)",
693 // Sanity check the values for behaviors with additional requirements.
696 case Module::Warning:
697 case Module::Override:
698 // These behavior types accept any value.
701 case Module::Require: {
702 // The value should itself be an MDNode with two operands, a flag ID (an
703 // MDString), and a value.
704 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
705 Assert1(Value && Value->getNumOperands() == 2,
706 "invalid value for 'require' module flag (expected metadata pair)",
708 Assert1(isa<MDString>(Value->getOperand(0)),
709 ("invalid value for 'require' module flag "
710 "(first value operand should be a string)"),
711 Value->getOperand(0));
713 // Append it to the list of requirements, to check once all module flags are
715 Requirements.push_back(Value);
720 case Module::AppendUnique: {
721 // These behavior types require the operand be an MDNode.
722 Assert1(isa<MDNode>(Op->getOperand(2)),
723 "invalid value for 'append'-type module flag "
724 "(expected a metadata node)", Op->getOperand(2));
729 // Unless this is a "requires" flag, check the ID is unique.
730 if (MFB != Module::Require) {
731 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
733 "module flag identifiers must be unique (or of 'require' type)",
738 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
739 bool isFunction, const Value *V) {
741 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
742 if (Attrs.getSlotIndex(I) == Idx) {
747 assert(Slot != ~0U && "Attribute set inconsistency!");
749 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
751 if (I->isStringAttribute())
754 if (I->getKindAsEnum() == Attribute::NoReturn ||
755 I->getKindAsEnum() == Attribute::NoUnwind ||
756 I->getKindAsEnum() == Attribute::NoInline ||
757 I->getKindAsEnum() == Attribute::AlwaysInline ||
758 I->getKindAsEnum() == Attribute::OptimizeForSize ||
759 I->getKindAsEnum() == Attribute::StackProtect ||
760 I->getKindAsEnum() == Attribute::StackProtectReq ||
761 I->getKindAsEnum() == Attribute::StackProtectStrong ||
762 I->getKindAsEnum() == Attribute::NoRedZone ||
763 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
764 I->getKindAsEnum() == Attribute::Naked ||
765 I->getKindAsEnum() == Attribute::InlineHint ||
766 I->getKindAsEnum() == Attribute::StackAlignment ||
767 I->getKindAsEnum() == Attribute::UWTable ||
768 I->getKindAsEnum() == Attribute::NonLazyBind ||
769 I->getKindAsEnum() == Attribute::ReturnsTwice ||
770 I->getKindAsEnum() == Attribute::SanitizeAddress ||
771 I->getKindAsEnum() == Attribute::SanitizeThread ||
772 I->getKindAsEnum() == Attribute::SanitizeMemory ||
773 I->getKindAsEnum() == Attribute::MinSize ||
774 I->getKindAsEnum() == Attribute::NoDuplicate ||
775 I->getKindAsEnum() == Attribute::Builtin ||
776 I->getKindAsEnum() == Attribute::NoBuiltin ||
777 I->getKindAsEnum() == Attribute::Cold ||
778 I->getKindAsEnum() == Attribute::OptimizeNone ||
779 I->getKindAsEnum() == Attribute::JumpTable) {
781 CheckFailed("Attribute '" + I->getAsString() +
782 "' only applies to functions!", V);
785 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
786 I->getKindAsEnum() == Attribute::ReadNone) {
788 CheckFailed("Attribute '" + I->getAsString() +
789 "' does not apply to function returns");
792 } else if (isFunction) {
793 CheckFailed("Attribute '" + I->getAsString() +
794 "' does not apply to functions!", V);
800 // VerifyParameterAttrs - Check the given attributes for an argument or return
801 // value of the specified type. The value V is printed in error messages.
802 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
803 bool isReturnValue, const Value *V) {
804 if (!Attrs.hasAttributes(Idx))
807 VerifyAttributeTypes(Attrs, Idx, false, V);
810 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
811 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
812 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
813 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
814 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
815 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
816 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
817 "'returned' do not apply to return values!", V);
819 // Check for mutually incompatible attributes. Only inreg is compatible with
821 unsigned AttrCount = 0;
822 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
823 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
824 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
825 Attrs.hasAttribute(Idx, Attribute::InReg);
826 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
827 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
828 "and 'sret' are incompatible!", V);
830 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
831 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
832 "'inalloca and readonly' are incompatible!", V);
834 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
835 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
836 "'sret and returned' are incompatible!", V);
838 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
839 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
840 "'zeroext and signext' are incompatible!", V);
842 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
843 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
844 "'readnone and readonly' are incompatible!", V);
846 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
847 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
848 "'noinline and alwaysinline' are incompatible!", V);
850 Assert1(!AttrBuilder(Attrs, Idx).
851 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
852 "Wrong types for attribute: " +
853 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
855 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
856 if (!PTy->getElementType()->isSized()) {
857 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
858 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
859 "Attributes 'byval' and 'inalloca' do not support unsized types!",
863 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
864 "Attribute 'byval' only applies to parameters with pointer type!",
869 // VerifyFunctionAttrs - Check parameter attributes against a function type.
870 // The value V is printed in error messages.
871 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
876 bool SawNest = false;
877 bool SawReturned = false;
878 bool SawSRet = false;
880 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
881 unsigned Idx = Attrs.getSlotIndex(i);
885 Ty = FT->getReturnType();
886 else if (Idx-1 < FT->getNumParams())
887 Ty = FT->getParamType(Idx-1);
889 break; // VarArgs attributes, verified elsewhere.
891 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
896 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
897 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
901 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
902 Assert1(!SawReturned, "More than one parameter has attribute returned!",
904 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
905 "argument and return types for 'returned' attribute", V);
909 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
910 Assert1(!SawSRet, "Cannot have multiple 'sret' parameters!", V);
911 Assert1(Idx == 1 || Idx == 2,
912 "Attribute 'sret' is not on first or second parameter!", V);
916 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
917 Assert1(Idx == FT->getNumParams(),
918 "inalloca isn't on the last parameter!", V);
922 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
925 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
927 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
928 Attribute::ReadNone) &&
929 Attrs.hasAttribute(AttributeSet::FunctionIndex,
930 Attribute::ReadOnly)),
931 "Attributes 'readnone and readonly' are incompatible!", V);
933 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
934 Attribute::NoInline) &&
935 Attrs.hasAttribute(AttributeSet::FunctionIndex,
936 Attribute::AlwaysInline)),
937 "Attributes 'noinline and alwaysinline' are incompatible!", V);
939 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
940 Attribute::OptimizeNone)) {
941 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
942 Attribute::NoInline),
943 "Attribute 'optnone' requires 'noinline'!", V);
945 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
946 Attribute::OptimizeForSize),
947 "Attributes 'optsize and optnone' are incompatible!", V);
949 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
951 "Attributes 'minsize and optnone' are incompatible!", V);
954 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
955 Attribute::JumpTable)) {
956 const GlobalValue *GV = cast<GlobalValue>(V);
957 Assert1(GV->hasUnnamedAddr(),
958 "Attribute 'jumptable' requires 'unnamed_addr'", V);
963 void Verifier::VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy) {
964 // Get the size of the types in bits, we'll need this later
965 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
966 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
968 // BitCast implies a no-op cast of type only. No bits change.
969 // However, you can't cast pointers to anything but pointers.
970 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
971 "Bitcast requires both operands to be pointer or neither", V);
972 Assert1(SrcBitSize == DestBitSize,
973 "Bitcast requires types of same width", V);
975 // Disallow aggregates.
976 Assert1(!SrcTy->isAggregateType(),
977 "Bitcast operand must not be aggregate", V);
978 Assert1(!DestTy->isAggregateType(),
979 "Bitcast type must not be aggregate", V);
981 // Without datalayout, assume all address spaces are the same size.
982 // Don't check if both types are not pointers.
983 // Skip casts between scalars and vectors.
985 !SrcTy->isPtrOrPtrVectorTy() ||
986 !DestTy->isPtrOrPtrVectorTy() ||
987 SrcTy->isVectorTy() != DestTy->isVectorTy()) {
991 unsigned SrcAS = SrcTy->getPointerAddressSpace();
992 unsigned DstAS = DestTy->getPointerAddressSpace();
994 Assert1(SrcAS == DstAS,
995 "Bitcasts between pointers of different address spaces is not legal."
996 "Use AddrSpaceCast instead.", V);
999 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
1000 if (CE->getOpcode() == Instruction::BitCast) {
1001 Type *SrcTy = CE->getOperand(0)->getType();
1002 Type *DstTy = CE->getType();
1003 VerifyBitcastType(CE, DstTy, SrcTy);
1007 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1008 if (Attrs.getNumSlots() == 0)
1011 unsigned LastSlot = Attrs.getNumSlots() - 1;
1012 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1013 if (LastIndex <= Params
1014 || (LastIndex == AttributeSet::FunctionIndex
1015 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1021 // visitFunction - Verify that a function is ok.
1023 void Verifier::visitFunction(const Function &F) {
1024 // Check function arguments.
1025 FunctionType *FT = F.getFunctionType();
1026 unsigned NumArgs = F.arg_size();
1028 Assert1(Context == &F.getContext(),
1029 "Function context does not match Module context!", &F);
1031 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1032 Assert2(FT->getNumParams() == NumArgs,
1033 "# formal arguments must match # of arguments for function type!",
1035 Assert1(F.getReturnType()->isFirstClassType() ||
1036 F.getReturnType()->isVoidTy() ||
1037 F.getReturnType()->isStructTy(),
1038 "Functions cannot return aggregate values!", &F);
1040 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1041 "Invalid struct return type!", &F);
1043 AttributeSet Attrs = F.getAttributes();
1045 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1046 "Attribute after last parameter!", &F);
1048 // Check function attributes.
1049 VerifyFunctionAttrs(FT, Attrs, &F);
1051 // On function declarations/definitions, we do not support the builtin
1052 // attribute. We do not check this in VerifyFunctionAttrs since that is
1053 // checking for Attributes that can/can not ever be on functions.
1054 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1055 Attribute::Builtin),
1056 "Attribute 'builtin' can only be applied to a callsite.", &F);
1058 // Check that this function meets the restrictions on this calling convention.
1059 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
1060 // restrictions can be lifted.
1061 switch (F.getCallingConv()) {
1063 case CallingConv::C:
1065 case CallingConv::Fast:
1066 case CallingConv::Cold:
1067 case CallingConv::Intel_OCL_BI:
1068 case CallingConv::PTX_Kernel:
1069 case CallingConv::PTX_Device:
1070 Assert1(!F.isVarArg(), "Calling convention does not support varargs or "
1071 "perfect forwarding!", &F);
1075 bool isLLVMdotName = F.getName().size() >= 5 &&
1076 F.getName().substr(0, 5) == "llvm.";
1078 // Check that the argument values match the function type for this function...
1080 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1082 Assert2(I->getType() == FT->getParamType(i),
1083 "Argument value does not match function argument type!",
1084 I, FT->getParamType(i));
1085 Assert1(I->getType()->isFirstClassType(),
1086 "Function arguments must have first-class types!", I);
1088 Assert2(!I->getType()->isMetadataTy(),
1089 "Function takes metadata but isn't an intrinsic", I, &F);
1092 if (F.isMaterializable()) {
1093 // Function has a body somewhere we can't see.
1094 } else if (F.isDeclaration()) {
1095 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1096 "invalid linkage type for function declaration", &F);
1098 // Verify that this function (which has a body) is not named "llvm.*". It
1099 // is not legal to define intrinsics.
1100 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1102 // Check the entry node
1103 const BasicBlock *Entry = &F.getEntryBlock();
1104 Assert1(pred_begin(Entry) == pred_end(Entry),
1105 "Entry block to function must not have predecessors!", Entry);
1107 // The address of the entry block cannot be taken, unless it is dead.
1108 if (Entry->hasAddressTaken()) {
1109 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1110 "blockaddress may not be used with the entry block!", Entry);
1114 // If this function is actually an intrinsic, verify that it is only used in
1115 // direct call/invokes, never having its "address taken".
1116 if (F.getIntrinsicID()) {
1118 if (F.hasAddressTaken(&U))
1119 Assert1(0, "Invalid user of intrinsic instruction!", U);
1122 Assert1(!F.hasDLLImportStorageClass() ||
1123 (F.isDeclaration() && F.hasExternalLinkage()) ||
1124 F.hasAvailableExternallyLinkage(),
1125 "Function is marked as dllimport, but not external.", &F);
1128 // verifyBasicBlock - Verify that a basic block is well formed...
1130 void Verifier::visitBasicBlock(BasicBlock &BB) {
1131 InstsInThisBlock.clear();
1133 // Ensure that basic blocks have terminators!
1134 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1136 // Check constraints that this basic block imposes on all of the PHI nodes in
1138 if (isa<PHINode>(BB.front())) {
1139 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1140 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1141 std::sort(Preds.begin(), Preds.end());
1143 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1144 // Ensure that PHI nodes have at least one entry!
1145 Assert1(PN->getNumIncomingValues() != 0,
1146 "PHI nodes must have at least one entry. If the block is dead, "
1147 "the PHI should be removed!", PN);
1148 Assert1(PN->getNumIncomingValues() == Preds.size(),
1149 "PHINode should have one entry for each predecessor of its "
1150 "parent basic block!", PN);
1152 // Get and sort all incoming values in the PHI node...
1154 Values.reserve(PN->getNumIncomingValues());
1155 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1156 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1157 PN->getIncomingValue(i)));
1158 std::sort(Values.begin(), Values.end());
1160 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1161 // Check to make sure that if there is more than one entry for a
1162 // particular basic block in this PHI node, that the incoming values are
1165 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1166 Values[i].second == Values[i-1].second,
1167 "PHI node has multiple entries for the same basic block with "
1168 "different incoming values!", PN, Values[i].first,
1169 Values[i].second, Values[i-1].second);
1171 // Check to make sure that the predecessors and PHI node entries are
1173 Assert3(Values[i].first == Preds[i],
1174 "PHI node entries do not match predecessors!", PN,
1175 Values[i].first, Preds[i]);
1180 // Check that all instructions have their parent pointers set up correctly.
1183 Assert(I.getParent() == &BB, "Instruction has bogus parent pointer!");
1187 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1188 // Ensure that terminators only exist at the end of the basic block.
1189 Assert1(&I == I.getParent()->getTerminator(),
1190 "Terminator found in the middle of a basic block!", I.getParent());
1191 visitInstruction(I);
1194 void Verifier::visitBranchInst(BranchInst &BI) {
1195 if (BI.isConditional()) {
1196 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1197 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1199 visitTerminatorInst(BI);
1202 void Verifier::visitReturnInst(ReturnInst &RI) {
1203 Function *F = RI.getParent()->getParent();
1204 unsigned N = RI.getNumOperands();
1205 if (F->getReturnType()->isVoidTy())
1207 "Found return instr that returns non-void in Function of void "
1208 "return type!", &RI, F->getReturnType());
1210 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1211 "Function return type does not match operand "
1212 "type of return inst!", &RI, F->getReturnType());
1214 // Check to make sure that the return value has necessary properties for
1216 visitTerminatorInst(RI);
1219 void Verifier::visitSwitchInst(SwitchInst &SI) {
1220 // Check to make sure that all of the constants in the switch instruction
1221 // have the same type as the switched-on value.
1222 Type *SwitchTy = SI.getCondition()->getType();
1223 SmallPtrSet<ConstantInt*, 32> Constants;
1224 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1225 Assert1(i.getCaseValue()->getType() == SwitchTy,
1226 "Switch constants must all be same type as switch value!", &SI);
1227 Assert2(Constants.insert(i.getCaseValue()).second,
1228 "Duplicate integer as switch case", &SI, i.getCaseValue());
1231 visitTerminatorInst(SI);
1234 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1235 Assert1(BI.getAddress()->getType()->isPointerTy(),
1236 "Indirectbr operand must have pointer type!", &BI);
1237 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1238 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1239 "Indirectbr destinations must all have pointer type!", &BI);
1241 visitTerminatorInst(BI);
1244 void Verifier::visitSelectInst(SelectInst &SI) {
1245 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1247 "Invalid operands for select instruction!", &SI);
1249 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1250 "Select values must have same type as select instruction!", &SI);
1251 visitInstruction(SI);
1254 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1255 /// a pass, if any exist, it's an error.
1257 void Verifier::visitUserOp1(Instruction &I) {
1258 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1261 void Verifier::visitTruncInst(TruncInst &I) {
1262 // Get the source and destination types
1263 Type *SrcTy = I.getOperand(0)->getType();
1264 Type *DestTy = I.getType();
1266 // Get the size of the types in bits, we'll need this later
1267 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1268 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1270 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1271 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1272 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1273 "trunc source and destination must both be a vector or neither", &I);
1274 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1276 visitInstruction(I);
1279 void Verifier::visitZExtInst(ZExtInst &I) {
1280 // Get the source and destination types
1281 Type *SrcTy = I.getOperand(0)->getType();
1282 Type *DestTy = I.getType();
1284 // Get the size of the types in bits, we'll need this later
1285 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1286 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1287 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1288 "zext source and destination must both be a vector or neither", &I);
1289 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1290 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1292 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1294 visitInstruction(I);
1297 void Verifier::visitSExtInst(SExtInst &I) {
1298 // Get the source and destination types
1299 Type *SrcTy = I.getOperand(0)->getType();
1300 Type *DestTy = I.getType();
1302 // Get the size of the types in bits, we'll need this later
1303 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1304 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1306 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1307 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1308 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1309 "sext source and destination must both be a vector or neither", &I);
1310 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1312 visitInstruction(I);
1315 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1316 // Get the source and destination types
1317 Type *SrcTy = I.getOperand(0)->getType();
1318 Type *DestTy = I.getType();
1319 // Get the size of the types in bits, we'll need this later
1320 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1321 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1323 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1324 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1325 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1326 "fptrunc source and destination must both be a vector or neither",&I);
1327 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1329 visitInstruction(I);
1332 void Verifier::visitFPExtInst(FPExtInst &I) {
1333 // Get the source and destination types
1334 Type *SrcTy = I.getOperand(0)->getType();
1335 Type *DestTy = I.getType();
1337 // Get the size of the types in bits, we'll need this later
1338 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1339 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1341 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1342 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1343 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1344 "fpext source and destination must both be a vector or neither", &I);
1345 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1347 visitInstruction(I);
1350 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1351 // Get the source and destination types
1352 Type *SrcTy = I.getOperand(0)->getType();
1353 Type *DestTy = I.getType();
1355 bool SrcVec = SrcTy->isVectorTy();
1356 bool DstVec = DestTy->isVectorTy();
1358 Assert1(SrcVec == DstVec,
1359 "UIToFP source and dest must both be vector or scalar", &I);
1360 Assert1(SrcTy->isIntOrIntVectorTy(),
1361 "UIToFP source must be integer or integer vector", &I);
1362 Assert1(DestTy->isFPOrFPVectorTy(),
1363 "UIToFP result must be FP or FP vector", &I);
1365 if (SrcVec && DstVec)
1366 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1367 cast<VectorType>(DestTy)->getNumElements(),
1368 "UIToFP source and dest vector length mismatch", &I);
1370 visitInstruction(I);
1373 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1374 // Get the source and destination types
1375 Type *SrcTy = I.getOperand(0)->getType();
1376 Type *DestTy = I.getType();
1378 bool SrcVec = SrcTy->isVectorTy();
1379 bool DstVec = DestTy->isVectorTy();
1381 Assert1(SrcVec == DstVec,
1382 "SIToFP source and dest must both be vector or scalar", &I);
1383 Assert1(SrcTy->isIntOrIntVectorTy(),
1384 "SIToFP source must be integer or integer vector", &I);
1385 Assert1(DestTy->isFPOrFPVectorTy(),
1386 "SIToFP result must be FP or FP vector", &I);
1388 if (SrcVec && DstVec)
1389 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1390 cast<VectorType>(DestTy)->getNumElements(),
1391 "SIToFP source and dest vector length mismatch", &I);
1393 visitInstruction(I);
1396 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1397 // Get the source and destination types
1398 Type *SrcTy = I.getOperand(0)->getType();
1399 Type *DestTy = I.getType();
1401 bool SrcVec = SrcTy->isVectorTy();
1402 bool DstVec = DestTy->isVectorTy();
1404 Assert1(SrcVec == DstVec,
1405 "FPToUI source and dest must both be vector or scalar", &I);
1406 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1408 Assert1(DestTy->isIntOrIntVectorTy(),
1409 "FPToUI result must be integer or integer vector", &I);
1411 if (SrcVec && DstVec)
1412 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1413 cast<VectorType>(DestTy)->getNumElements(),
1414 "FPToUI source and dest vector length mismatch", &I);
1416 visitInstruction(I);
1419 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1420 // Get the source and destination types
1421 Type *SrcTy = I.getOperand(0)->getType();
1422 Type *DestTy = I.getType();
1424 bool SrcVec = SrcTy->isVectorTy();
1425 bool DstVec = DestTy->isVectorTy();
1427 Assert1(SrcVec == DstVec,
1428 "FPToSI source and dest must both be vector or scalar", &I);
1429 Assert1(SrcTy->isFPOrFPVectorTy(),
1430 "FPToSI source must be FP or FP vector", &I);
1431 Assert1(DestTy->isIntOrIntVectorTy(),
1432 "FPToSI result must be integer or integer vector", &I);
1434 if (SrcVec && DstVec)
1435 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1436 cast<VectorType>(DestTy)->getNumElements(),
1437 "FPToSI source and dest vector length mismatch", &I);
1439 visitInstruction(I);
1442 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1443 // Get the source and destination types
1444 Type *SrcTy = I.getOperand(0)->getType();
1445 Type *DestTy = I.getType();
1447 Assert1(SrcTy->getScalarType()->isPointerTy(),
1448 "PtrToInt source must be pointer", &I);
1449 Assert1(DestTy->getScalarType()->isIntegerTy(),
1450 "PtrToInt result must be integral", &I);
1451 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1452 "PtrToInt type mismatch", &I);
1454 if (SrcTy->isVectorTy()) {
1455 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1456 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1457 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1458 "PtrToInt Vector width mismatch", &I);
1461 visitInstruction(I);
1464 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1465 // Get the source and destination types
1466 Type *SrcTy = I.getOperand(0)->getType();
1467 Type *DestTy = I.getType();
1469 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1470 "IntToPtr source must be an integral", &I);
1471 Assert1(DestTy->getScalarType()->isPointerTy(),
1472 "IntToPtr result must be a pointer",&I);
1473 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1474 "IntToPtr type mismatch", &I);
1475 if (SrcTy->isVectorTy()) {
1476 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1477 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1478 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1479 "IntToPtr Vector width mismatch", &I);
1481 visitInstruction(I);
1484 void Verifier::visitBitCastInst(BitCastInst &I) {
1485 Type *SrcTy = I.getOperand(0)->getType();
1486 Type *DestTy = I.getType();
1487 VerifyBitcastType(&I, DestTy, SrcTy);
1488 visitInstruction(I);
1491 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1492 Type *SrcTy = I.getOperand(0)->getType();
1493 Type *DestTy = I.getType();
1495 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1496 "AddrSpaceCast source must be a pointer", &I);
1497 Assert1(DestTy->isPtrOrPtrVectorTy(),
1498 "AddrSpaceCast result must be a pointer", &I);
1499 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1500 "AddrSpaceCast must be between different address spaces", &I);
1501 if (SrcTy->isVectorTy())
1502 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1503 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1504 visitInstruction(I);
1507 /// visitPHINode - Ensure that a PHI node is well formed.
1509 void Verifier::visitPHINode(PHINode &PN) {
1510 // Ensure that the PHI nodes are all grouped together at the top of the block.
1511 // This can be tested by checking whether the instruction before this is
1512 // either nonexistent (because this is begin()) or is a PHI node. If not,
1513 // then there is some other instruction before a PHI.
1514 Assert2(&PN == &PN.getParent()->front() ||
1515 isa<PHINode>(--BasicBlock::iterator(&PN)),
1516 "PHI nodes not grouped at top of basic block!",
1517 &PN, PN.getParent());
1519 // Check that all of the values of the PHI node have the same type as the
1520 // result, and that the incoming blocks are really basic blocks.
1521 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1522 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1523 "PHI node operands are not the same type as the result!", &PN);
1526 // All other PHI node constraints are checked in the visitBasicBlock method.
1528 visitInstruction(PN);
1531 void Verifier::VerifyCallSite(CallSite CS) {
1532 Instruction *I = CS.getInstruction();
1534 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1535 "Called function must be a pointer!", I);
1536 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1538 Assert1(FPTy->getElementType()->isFunctionTy(),
1539 "Called function is not pointer to function type!", I);
1540 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1542 // Verify that the correct number of arguments are being passed
1543 if (FTy->isVarArg())
1544 Assert1(CS.arg_size() >= FTy->getNumParams(),
1545 "Called function requires more parameters than were provided!",I);
1547 Assert1(CS.arg_size() == FTy->getNumParams(),
1548 "Incorrect number of arguments passed to called function!", I);
1550 // Verify that all arguments to the call match the function type.
1551 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1552 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1553 "Call parameter type does not match function signature!",
1554 CS.getArgument(i), FTy->getParamType(i), I);
1556 AttributeSet Attrs = CS.getAttributes();
1558 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1559 "Attribute after last parameter!", I);
1561 // Verify call attributes.
1562 VerifyFunctionAttrs(FTy, Attrs, I);
1564 // Conservatively check the inalloca argument.
1565 // We have a bug if we can find that there is an underlying alloca without
1567 if (CS.hasInAllocaArgument()) {
1568 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
1569 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
1570 Assert2(AI->isUsedWithInAlloca(),
1571 "inalloca argument for call has mismatched alloca", AI, I);
1574 if (FTy->isVarArg()) {
1575 // FIXME? is 'nest' even legal here?
1576 bool SawNest = false;
1577 bool SawReturned = false;
1579 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1580 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1582 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1586 // Check attributes on the varargs part.
1587 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1588 Type *Ty = CS.getArgument(Idx-1)->getType();
1589 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1591 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1592 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1596 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1597 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1599 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1600 "Incompatible argument and return types for 'returned' "
1605 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1606 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1608 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1609 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1614 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1615 if (CS.getCalledFunction() == nullptr ||
1616 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1617 for (FunctionType::param_iterator PI = FTy->param_begin(),
1618 PE = FTy->param_end(); PI != PE; ++PI)
1619 Assert1(!(*PI)->isMetadataTy(),
1620 "Function has metadata parameter but isn't an intrinsic", I);
1623 visitInstruction(*I);
1626 /// Two types are "congruent" if they are identical, or if they are both pointer
1627 /// types with different pointee types and the same address space.
1628 static bool isTypeCongruent(Type *L, Type *R) {
1631 PointerType *PL = dyn_cast<PointerType>(L);
1632 PointerType *PR = dyn_cast<PointerType>(R);
1635 return PL->getAddressSpace() == PR->getAddressSpace();
1638 static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
1639 static const Attribute::AttrKind ABIAttrs[] = {
1640 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
1641 Attribute::InReg, Attribute::Returned};
1643 for (auto AK : ABIAttrs) {
1644 if (Attrs.hasAttribute(I + 1, AK))
1645 Copy.addAttribute(AK);
1647 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
1648 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
1652 void Verifier::verifyMustTailCall(CallInst &CI) {
1653 Assert1(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI);
1655 // - The caller and callee prototypes must match. Pointer types of
1656 // parameters or return types may differ in pointee type, but not
1658 Function *F = CI.getParent()->getParent();
1659 auto GetFnTy = [](Value *V) {
1660 return cast<FunctionType>(
1661 cast<PointerType>(V->getType())->getElementType());
1663 FunctionType *CallerTy = GetFnTy(F);
1664 FunctionType *CalleeTy = GetFnTy(CI.getCalledValue());
1665 Assert1(CallerTy->getNumParams() == CalleeTy->getNumParams(),
1666 "cannot guarantee tail call due to mismatched parameter counts", &CI);
1667 Assert1(CallerTy->isVarArg() == CalleeTy->isVarArg(),
1668 "cannot guarantee tail call due to mismatched varargs", &CI);
1669 Assert1(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),
1670 "cannot guarantee tail call due to mismatched return types", &CI);
1671 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1673 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),
1674 "cannot guarantee tail call due to mismatched parameter types", &CI);
1677 // - The calling conventions of the caller and callee must match.
1678 Assert1(F->getCallingConv() == CI.getCallingConv(),
1679 "cannot guarantee tail call due to mismatched calling conv", &CI);
1681 // - All ABI-impacting function attributes, such as sret, byval, inreg,
1682 // returned, and inalloca, must match.
1683 AttributeSet CallerAttrs = F->getAttributes();
1684 AttributeSet CalleeAttrs = CI.getAttributes();
1685 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1686 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
1687 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
1688 Assert2(CallerABIAttrs == CalleeABIAttrs,
1689 "cannot guarantee tail call due to mismatched ABI impacting "
1690 "function attributes", &CI, CI.getOperand(I));
1693 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
1694 // or a pointer bitcast followed by a ret instruction.
1695 // - The ret instruction must return the (possibly bitcasted) value
1696 // produced by the call or void.
1697 Value *RetVal = &CI;
1698 Instruction *Next = CI.getNextNode();
1700 // Handle the optional bitcast.
1701 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
1702 Assert1(BI->getOperand(0) == RetVal,
1703 "bitcast following musttail call must use the call", BI);
1705 Next = BI->getNextNode();
1708 // Check the return.
1709 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
1710 Assert1(Ret, "musttail call must be precede a ret with an optional bitcast",
1712 Assert1(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,
1713 "musttail call result must be returned", Ret);
1716 void Verifier::visitCallInst(CallInst &CI) {
1717 VerifyCallSite(&CI);
1719 if (CI.isMustTailCall())
1720 verifyMustTailCall(CI);
1722 if (Function *F = CI.getCalledFunction())
1723 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1724 visitIntrinsicFunctionCall(ID, CI);
1727 void Verifier::visitInvokeInst(InvokeInst &II) {
1728 VerifyCallSite(&II);
1730 // Verify that there is a landingpad instruction as the first non-PHI
1731 // instruction of the 'unwind' destination.
1732 Assert1(II.getUnwindDest()->isLandingPad(),
1733 "The unwind destination does not have a landingpad instruction!",&II);
1735 visitTerminatorInst(II);
1738 /// visitBinaryOperator - Check that both arguments to the binary operator are
1739 /// of the same type!
1741 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1742 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1743 "Both operands to a binary operator are not of the same type!", &B);
1745 switch (B.getOpcode()) {
1746 // Check that integer arithmetic operators are only used with
1747 // integral operands.
1748 case Instruction::Add:
1749 case Instruction::Sub:
1750 case Instruction::Mul:
1751 case Instruction::SDiv:
1752 case Instruction::UDiv:
1753 case Instruction::SRem:
1754 case Instruction::URem:
1755 Assert1(B.getType()->isIntOrIntVectorTy(),
1756 "Integer arithmetic operators only work with integral types!", &B);
1757 Assert1(B.getType() == B.getOperand(0)->getType(),
1758 "Integer arithmetic operators must have same type "
1759 "for operands and result!", &B);
1761 // Check that floating-point arithmetic operators are only used with
1762 // floating-point operands.
1763 case Instruction::FAdd:
1764 case Instruction::FSub:
1765 case Instruction::FMul:
1766 case Instruction::FDiv:
1767 case Instruction::FRem:
1768 Assert1(B.getType()->isFPOrFPVectorTy(),
1769 "Floating-point arithmetic operators only work with "
1770 "floating-point types!", &B);
1771 Assert1(B.getType() == B.getOperand(0)->getType(),
1772 "Floating-point arithmetic operators must have same type "
1773 "for operands and result!", &B);
1775 // Check that logical operators are only used with integral operands.
1776 case Instruction::And:
1777 case Instruction::Or:
1778 case Instruction::Xor:
1779 Assert1(B.getType()->isIntOrIntVectorTy(),
1780 "Logical operators only work with integral types!", &B);
1781 Assert1(B.getType() == B.getOperand(0)->getType(),
1782 "Logical operators must have same type for operands and result!",
1785 case Instruction::Shl:
1786 case Instruction::LShr:
1787 case Instruction::AShr:
1788 Assert1(B.getType()->isIntOrIntVectorTy(),
1789 "Shifts only work with integral types!", &B);
1790 Assert1(B.getType() == B.getOperand(0)->getType(),
1791 "Shift return type must be same as operands!", &B);
1794 llvm_unreachable("Unknown BinaryOperator opcode!");
1797 visitInstruction(B);
1800 void Verifier::visitICmpInst(ICmpInst &IC) {
1801 // Check that the operands are the same type
1802 Type *Op0Ty = IC.getOperand(0)->getType();
1803 Type *Op1Ty = IC.getOperand(1)->getType();
1804 Assert1(Op0Ty == Op1Ty,
1805 "Both operands to ICmp instruction are not of the same type!", &IC);
1806 // Check that the operands are the right type
1807 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1808 "Invalid operand types for ICmp instruction", &IC);
1809 // Check that the predicate is valid.
1810 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1811 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1812 "Invalid predicate in ICmp instruction!", &IC);
1814 visitInstruction(IC);
1817 void Verifier::visitFCmpInst(FCmpInst &FC) {
1818 // Check that the operands are the same type
1819 Type *Op0Ty = FC.getOperand(0)->getType();
1820 Type *Op1Ty = FC.getOperand(1)->getType();
1821 Assert1(Op0Ty == Op1Ty,
1822 "Both operands to FCmp instruction are not of the same type!", &FC);
1823 // Check that the operands are the right type
1824 Assert1(Op0Ty->isFPOrFPVectorTy(),
1825 "Invalid operand types for FCmp instruction", &FC);
1826 // Check that the predicate is valid.
1827 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1828 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1829 "Invalid predicate in FCmp instruction!", &FC);
1831 visitInstruction(FC);
1834 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1835 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1837 "Invalid extractelement operands!", &EI);
1838 visitInstruction(EI);
1841 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1842 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1845 "Invalid insertelement operands!", &IE);
1846 visitInstruction(IE);
1849 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1850 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1852 "Invalid shufflevector operands!", &SV);
1853 visitInstruction(SV);
1856 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1857 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1859 Assert1(isa<PointerType>(TargetTy),
1860 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1861 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1862 "GEP into unsized type!", &GEP);
1863 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1864 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1867 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1869 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1870 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1872 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1873 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1874 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1876 if (GEP.getPointerOperandType()->isVectorTy()) {
1877 // Additional checks for vector GEPs.
1878 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1879 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1880 "Vector GEP result width doesn't match operand's", &GEP);
1881 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1882 Type *IndexTy = Idxs[i]->getType();
1883 Assert1(IndexTy->isVectorTy(),
1884 "Vector GEP must have vector indices!", &GEP);
1885 unsigned IndexWidth = IndexTy->getVectorNumElements();
1886 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1889 visitInstruction(GEP);
1892 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1893 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1896 void Verifier::visitRangeMetadata(Instruction& I,
1897 MDNode* Range, Type* Ty) {
1899 Range == I.getMetadata(LLVMContext::MD_range) &&
1900 "precondition violation");
1902 unsigned NumOperands = Range->getNumOperands();
1903 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1904 unsigned NumRanges = NumOperands / 2;
1905 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1907 ConstantRange LastRange(1); // Dummy initial value
1908 for (unsigned i = 0; i < NumRanges; ++i) {
1909 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1910 Assert1(Low, "The lower limit must be an integer!", Low);
1911 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1912 Assert1(High, "The upper limit must be an integer!", High);
1913 Assert1(High->getType() == Low->getType() &&
1914 High->getType() == Ty, "Range types must match instruction type!",
1917 APInt HighV = High->getValue();
1918 APInt LowV = Low->getValue();
1919 ConstantRange CurRange(LowV, HighV);
1920 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1921 "Range must not be empty!", Range);
1923 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1924 "Intervals are overlapping", Range);
1925 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1927 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1930 LastRange = ConstantRange(LowV, HighV);
1932 if (NumRanges > 2) {
1934 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1936 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1937 ConstantRange FirstRange(FirstLow, FirstHigh);
1938 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1939 "Intervals are overlapping", Range);
1940 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1945 void Verifier::visitLoadInst(LoadInst &LI) {
1946 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1947 Assert1(PTy, "Load operand must be a pointer.", &LI);
1948 Type *ElTy = PTy->getElementType();
1949 Assert2(ElTy == LI.getType(),
1950 "Load result type does not match pointer operand type!", &LI, ElTy);
1951 Assert1(LI.getAlignment() <= Value::MaximumAlignment,
1952 "huge alignment values are unsupported", &LI);
1953 if (LI.isAtomic()) {
1954 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1955 "Load cannot have Release ordering", &LI);
1956 Assert1(LI.getAlignment() != 0,
1957 "Atomic load must specify explicit alignment", &LI);
1958 if (!ElTy->isPointerTy()) {
1959 Assert2(ElTy->isIntegerTy(),
1960 "atomic load operand must have integer type!",
1962 unsigned Size = ElTy->getPrimitiveSizeInBits();
1963 Assert2(Size >= 8 && !(Size & (Size - 1)),
1964 "atomic load operand must be power-of-two byte-sized integer",
1968 Assert1(LI.getSynchScope() == CrossThread,
1969 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1972 visitInstruction(LI);
1975 void Verifier::visitStoreInst(StoreInst &SI) {
1976 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1977 Assert1(PTy, "Store operand must be a pointer.", &SI);
1978 Type *ElTy = PTy->getElementType();
1979 Assert2(ElTy == SI.getOperand(0)->getType(),
1980 "Stored value type does not match pointer operand type!",
1982 Assert1(SI.getAlignment() <= Value::MaximumAlignment,
1983 "huge alignment values are unsupported", &SI);
1984 if (SI.isAtomic()) {
1985 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1986 "Store cannot have Acquire ordering", &SI);
1987 Assert1(SI.getAlignment() != 0,
1988 "Atomic store must specify explicit alignment", &SI);
1989 if (!ElTy->isPointerTy()) {
1990 Assert2(ElTy->isIntegerTy(),
1991 "atomic store operand must have integer type!",
1993 unsigned Size = ElTy->getPrimitiveSizeInBits();
1994 Assert2(Size >= 8 && !(Size & (Size - 1)),
1995 "atomic store operand must be power-of-two byte-sized integer",
1999 Assert1(SI.getSynchScope() == CrossThread,
2000 "Non-atomic store cannot have SynchronizationScope specified", &SI);
2002 visitInstruction(SI);
2005 void Verifier::visitAllocaInst(AllocaInst &AI) {
2006 SmallPtrSet<const Type*, 4> Visited;
2007 PointerType *PTy = AI.getType();
2008 Assert1(PTy->getAddressSpace() == 0,
2009 "Allocation instruction pointer not in the generic address space!",
2011 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
2013 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
2014 "Alloca array size must have integer type", &AI);
2015 Assert1(AI.getAlignment() <= Value::MaximumAlignment,
2016 "huge alignment values are unsupported", &AI);
2018 visitInstruction(AI);
2021 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
2023 // FIXME: more conditions???
2024 Assert1(CXI.getSuccessOrdering() != NotAtomic,
2025 "cmpxchg instructions must be atomic.", &CXI);
2026 Assert1(CXI.getFailureOrdering() != NotAtomic,
2027 "cmpxchg instructions must be atomic.", &CXI);
2028 Assert1(CXI.getSuccessOrdering() != Unordered,
2029 "cmpxchg instructions cannot be unordered.", &CXI);
2030 Assert1(CXI.getFailureOrdering() != Unordered,
2031 "cmpxchg instructions cannot be unordered.", &CXI);
2032 Assert1(CXI.getSuccessOrdering() >= CXI.getFailureOrdering(),
2033 "cmpxchg instructions be at least as constrained on success as fail",
2035 Assert1(CXI.getFailureOrdering() != Release &&
2036 CXI.getFailureOrdering() != AcquireRelease,
2037 "cmpxchg failure ordering cannot include release semantics", &CXI);
2039 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
2040 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
2041 Type *ElTy = PTy->getElementType();
2042 Assert2(ElTy->isIntegerTy(),
2043 "cmpxchg operand must have integer type!",
2045 unsigned Size = ElTy->getPrimitiveSizeInBits();
2046 Assert2(Size >= 8 && !(Size & (Size - 1)),
2047 "cmpxchg operand must be power-of-two byte-sized integer",
2049 Assert2(ElTy == CXI.getOperand(1)->getType(),
2050 "Expected value type does not match pointer operand type!",
2052 Assert2(ElTy == CXI.getOperand(2)->getType(),
2053 "Stored value type does not match pointer operand type!",
2055 visitInstruction(CXI);
2058 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
2059 Assert1(RMWI.getOrdering() != NotAtomic,
2060 "atomicrmw instructions must be atomic.", &RMWI);
2061 Assert1(RMWI.getOrdering() != Unordered,
2062 "atomicrmw instructions cannot be unordered.", &RMWI);
2063 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
2064 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
2065 Type *ElTy = PTy->getElementType();
2066 Assert2(ElTy->isIntegerTy(),
2067 "atomicrmw operand must have integer type!",
2069 unsigned Size = ElTy->getPrimitiveSizeInBits();
2070 Assert2(Size >= 8 && !(Size & (Size - 1)),
2071 "atomicrmw operand must be power-of-two byte-sized integer",
2073 Assert2(ElTy == RMWI.getOperand(1)->getType(),
2074 "Argument value type does not match pointer operand type!",
2076 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
2077 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
2078 "Invalid binary operation!", &RMWI);
2079 visitInstruction(RMWI);
2082 void Verifier::visitFenceInst(FenceInst &FI) {
2083 const AtomicOrdering Ordering = FI.getOrdering();
2084 Assert1(Ordering == Acquire || Ordering == Release ||
2085 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
2086 "fence instructions may only have "
2087 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
2088 visitInstruction(FI);
2091 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
2092 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
2093 EVI.getIndices()) ==
2095 "Invalid ExtractValueInst operands!", &EVI);
2097 visitInstruction(EVI);
2100 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
2101 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
2102 IVI.getIndices()) ==
2103 IVI.getOperand(1)->getType(),
2104 "Invalid InsertValueInst operands!", &IVI);
2106 visitInstruction(IVI);
2109 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
2110 BasicBlock *BB = LPI.getParent();
2112 // The landingpad instruction is ill-formed if it doesn't have any clauses and
2114 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
2115 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
2117 // The landingpad instruction defines its parent as a landing pad block. The
2118 // landing pad block may be branched to only by the unwind edge of an invoke.
2119 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
2120 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
2121 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
2122 "Block containing LandingPadInst must be jumped to "
2123 "only by the unwind edge of an invoke.", &LPI);
2126 // The landingpad instruction must be the first non-PHI instruction in the
2128 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
2129 "LandingPadInst not the first non-PHI instruction in the block.",
2132 // The personality functions for all landingpad instructions within the same
2133 // function should match.
2135 Assert1(LPI.getPersonalityFn() == PersonalityFn,
2136 "Personality function doesn't match others in function", &LPI);
2137 PersonalityFn = LPI.getPersonalityFn();
2139 // All operands must be constants.
2140 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
2142 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
2143 Constant *Clause = LPI.getClause(i);
2144 if (LPI.isCatch(i)) {
2145 Assert1(isa<PointerType>(Clause->getType()),
2146 "Catch operand does not have pointer type!", &LPI);
2148 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
2149 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
2150 "Filter operand is not an array of constants!", &LPI);
2154 visitInstruction(LPI);
2157 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
2158 Instruction *Op = cast<Instruction>(I.getOperand(i));
2159 // If the we have an invalid invoke, don't try to compute the dominance.
2160 // We already reject it in the invoke specific checks and the dominance
2161 // computation doesn't handle multiple edges.
2162 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2163 if (II->getNormalDest() == II->getUnwindDest())
2167 const Use &U = I.getOperandUse(i);
2168 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
2169 "Instruction does not dominate all uses!", Op, &I);
2172 /// verifyInstruction - Verify that an instruction is well formed.
2174 void Verifier::visitInstruction(Instruction &I) {
2175 BasicBlock *BB = I.getParent();
2176 Assert1(BB, "Instruction not embedded in basic block!", &I);
2178 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2179 for (User *U : I.users()) {
2180 Assert1(U != (User*)&I || !DT.isReachableFromEntry(BB),
2181 "Only PHI nodes may reference their own value!", &I);
2185 // Check that void typed values don't have names
2186 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2187 "Instruction has a name, but provides a void value!", &I);
2189 // Check that the return value of the instruction is either void or a legal
2191 Assert1(I.getType()->isVoidTy() ||
2192 I.getType()->isFirstClassType(),
2193 "Instruction returns a non-scalar type!", &I);
2195 // Check that the instruction doesn't produce metadata. Calls are already
2196 // checked against the callee type.
2197 Assert1(!I.getType()->isMetadataTy() ||
2198 isa<CallInst>(I) || isa<InvokeInst>(I),
2199 "Invalid use of metadata!", &I);
2201 // Check that all uses of the instruction, if they are instructions
2202 // themselves, actually have parent basic blocks. If the use is not an
2203 // instruction, it is an error!
2204 for (Use &U : I.uses()) {
2205 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
2206 Assert2(Used->getParent() != nullptr, "Instruction referencing"
2207 " instruction not embedded in a basic block!", &I, Used);
2209 CheckFailed("Use of instruction is not an instruction!", U);
2214 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2215 Assert1(I.getOperand(i) != nullptr, "Instruction has null operand!", &I);
2217 // Check to make sure that only first-class-values are operands to
2219 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2220 Assert1(0, "Instruction operands must be first-class values!", &I);
2223 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2224 // Check to make sure that the "address of" an intrinsic function is never
2226 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 :
2227 isa<InvokeInst>(I) ? e-3 : 0),
2228 "Cannot take the address of an intrinsic!", &I);
2229 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2230 F->getIntrinsicID() == Intrinsic::donothing ||
2231 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void ||
2232 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64,
2233 "Cannot invoke an intrinsinc other than"
2234 " donothing or patchpoint", &I);
2235 Assert1(F->getParent() == M, "Referencing function in another module!",
2237 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2238 Assert1(OpBB->getParent() == BB->getParent(),
2239 "Referring to a basic block in another function!", &I);
2240 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2241 Assert1(OpArg->getParent() == BB->getParent(),
2242 "Referring to an argument in another function!", &I);
2243 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2244 Assert1(GV->getParent() == M, "Referencing global in another module!",
2246 } else if (isa<Instruction>(I.getOperand(i))) {
2247 verifyDominatesUse(I, i);
2248 } else if (isa<InlineAsm>(I.getOperand(i))) {
2249 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2250 (i + 3 == e && isa<InvokeInst>(I)),
2251 "Cannot take the address of an inline asm!", &I);
2252 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2253 if (CE->getType()->isPtrOrPtrVectorTy()) {
2254 // If we have a ConstantExpr pointer, we need to see if it came from an
2255 // illegal bitcast (inttoptr <constant int> )
2256 SmallVector<const ConstantExpr *, 4> Stack;
2257 SmallPtrSet<const ConstantExpr *, 4> Visited;
2258 Stack.push_back(CE);
2260 while (!Stack.empty()) {
2261 const ConstantExpr *V = Stack.pop_back_val();
2262 if (!Visited.insert(V).second)
2265 VerifyConstantExprBitcastType(V);
2267 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2268 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2269 Stack.push_back(Op);
2276 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2277 Assert1(I.getType()->isFPOrFPVectorTy(),
2278 "fpmath requires a floating point result!", &I);
2279 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2280 Value *Op0 = MD->getOperand(0);
2281 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
2282 APFloat Accuracy = CFP0->getValueAPF();
2283 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2284 "fpmath accuracy not a positive number!", &I);
2286 Assert1(false, "invalid fpmath accuracy!", &I);
2290 if (MDNode *Range = I.getMetadata(LLVMContext::MD_range)) {
2291 Assert1(isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),
2292 "Ranges are only for loads, calls and invokes!", &I);
2293 visitRangeMetadata(I, Range, I.getType());
2296 if (I.getMetadata(LLVMContext::MD_nonnull)) {
2297 Assert1(I.getType()->isPointerTy(),
2298 "nonnull applies only to pointer types", &I);
2299 Assert1(isa<LoadInst>(I),
2300 "nonnull applies only to load instructions, use attributes"
2301 " for calls or invokes", &I);
2304 InstsInThisBlock.insert(&I);
2307 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2308 /// intrinsic argument or return value) matches the type constraints specified
2309 /// by the .td file (e.g. an "any integer" argument really is an integer).
2311 /// This return true on error but does not print a message.
2312 bool Verifier::VerifyIntrinsicType(Type *Ty,
2313 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2314 SmallVectorImpl<Type*> &ArgTys) {
2315 using namespace Intrinsic;
2317 // If we ran out of descriptors, there are too many arguments.
2318 if (Infos.empty()) return true;
2319 IITDescriptor D = Infos.front();
2320 Infos = Infos.slice(1);
2323 case IITDescriptor::Void: return !Ty->isVoidTy();
2324 case IITDescriptor::VarArg: return true;
2325 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2326 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2327 case IITDescriptor::Half: return !Ty->isHalfTy();
2328 case IITDescriptor::Float: return !Ty->isFloatTy();
2329 case IITDescriptor::Double: return !Ty->isDoubleTy();
2330 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2331 case IITDescriptor::Vector: {
2332 VectorType *VT = dyn_cast<VectorType>(Ty);
2333 return !VT || VT->getNumElements() != D.Vector_Width ||
2334 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2336 case IITDescriptor::Pointer: {
2337 PointerType *PT = dyn_cast<PointerType>(Ty);
2338 return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2339 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2342 case IITDescriptor::Struct: {
2343 StructType *ST = dyn_cast<StructType>(Ty);
2344 if (!ST || ST->getNumElements() != D.Struct_NumElements)
2347 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2348 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2353 case IITDescriptor::Argument:
2354 // Two cases here - If this is the second occurrence of an argument, verify
2355 // that the later instance matches the previous instance.
2356 if (D.getArgumentNumber() < ArgTys.size())
2357 return Ty != ArgTys[D.getArgumentNumber()];
2359 // Otherwise, if this is the first instance of an argument, record it and
2360 // verify the "Any" kind.
2361 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2362 ArgTys.push_back(Ty);
2364 switch (D.getArgumentKind()) {
2365 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2366 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2367 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2368 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2370 llvm_unreachable("all argument kinds not covered");
2372 case IITDescriptor::ExtendArgument: {
2373 // This may only be used when referring to a previous vector argument.
2374 if (D.getArgumentNumber() >= ArgTys.size())
2377 Type *NewTy = ArgTys[D.getArgumentNumber()];
2378 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2379 NewTy = VectorType::getExtendedElementVectorType(VTy);
2380 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2381 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2387 case IITDescriptor::TruncArgument: {
2388 // This may only be used when referring to a previous vector argument.
2389 if (D.getArgumentNumber() >= ArgTys.size())
2392 Type *NewTy = ArgTys[D.getArgumentNumber()];
2393 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2394 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2395 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2396 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
2402 case IITDescriptor::HalfVecArgument:
2403 // This may only be used when referring to a previous vector argument.
2404 return D.getArgumentNumber() >= ArgTys.size() ||
2405 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2406 VectorType::getHalfElementsVectorType(
2407 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2409 llvm_unreachable("unhandled");
2412 /// \brief Verify if the intrinsic has variable arguments.
2413 /// This method is intended to be called after all the fixed arguments have been
2416 /// This method returns true on error and does not print an error message.
2418 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2419 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2420 using namespace Intrinsic;
2422 // If there are no descriptors left, then it can't be a vararg.
2424 return isVarArg ? true : false;
2426 // There should be only one descriptor remaining at this point.
2427 if (Infos.size() != 1)
2430 // Check and verify the descriptor.
2431 IITDescriptor D = Infos.front();
2432 Infos = Infos.slice(1);
2433 if (D.Kind == IITDescriptor::VarArg)
2434 return isVarArg ? false : true;
2439 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2441 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2442 Function *IF = CI.getCalledFunction();
2443 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2446 // Verify that the intrinsic prototype lines up with what the .td files
2448 FunctionType *IFTy = IF->getFunctionType();
2449 bool IsVarArg = IFTy->isVarArg();
2451 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2452 getIntrinsicInfoTableEntries(ID, Table);
2453 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2455 SmallVector<Type *, 4> ArgTys;
2456 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2457 "Intrinsic has incorrect return type!", IF);
2458 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2459 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2460 "Intrinsic has incorrect argument type!", IF);
2462 // Verify if the intrinsic call matches the vararg property.
2464 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2465 "Intrinsic was not defined with variable arguments!", IF);
2467 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2468 "Callsite was not defined with variable arguments!", IF);
2470 // All descriptors should be absorbed by now.
2471 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2473 // Now that we have the intrinsic ID and the actual argument types (and we
2474 // know they are legal for the intrinsic!) get the intrinsic name through the
2475 // usual means. This allows us to verify the mangling of argument types into
2477 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
2478 Assert1(ExpectedName == IF->getName(),
2479 "Intrinsic name not mangled correctly for type arguments! "
2480 "Should be: " + ExpectedName, IF);
2482 // If the intrinsic takes MDNode arguments, verify that they are either global
2483 // or are local to *this* function.
2484 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2485 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
2486 visitMDNode(*MD, CI.getParent()->getParent());
2491 case Intrinsic::ctlz: // llvm.ctlz
2492 case Intrinsic::cttz: // llvm.cttz
2493 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2494 "is_zero_undef argument of bit counting intrinsics must be a "
2495 "constant int", &CI);
2497 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2498 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2499 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2500 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
2501 Assert1(MD->getNumOperands() == 1,
2502 "invalid llvm.dbg.declare intrinsic call 2", &CI);
2504 case Intrinsic::memcpy:
2505 case Intrinsic::memmove:
2506 case Intrinsic::memset:
2507 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2508 "alignment argument of memory intrinsics must be a constant int",
2510 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2511 "isvolatile argument of memory intrinsics must be a constant int",
2514 case Intrinsic::gcroot:
2515 case Intrinsic::gcwrite:
2516 case Intrinsic::gcread:
2517 if (ID == Intrinsic::gcroot) {
2519 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2520 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2521 Assert1(isa<Constant>(CI.getArgOperand(1)),
2522 "llvm.gcroot parameter #2 must be a constant.", &CI);
2523 if (!AI->getType()->getElementType()->isPointerTy()) {
2524 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2525 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2526 "or argument #2 must be a non-null constant.", &CI);
2530 Assert1(CI.getParent()->getParent()->hasGC(),
2531 "Enclosing function does not use GC.", &CI);
2533 case Intrinsic::init_trampoline:
2534 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2535 "llvm.init_trampoline parameter #2 must resolve to a function.",
2538 case Intrinsic::prefetch:
2539 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2540 isa<ConstantInt>(CI.getArgOperand(2)) &&
2541 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2542 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2543 "invalid arguments to llvm.prefetch",
2546 case Intrinsic::stackprotector:
2547 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2548 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2551 case Intrinsic::lifetime_start:
2552 case Intrinsic::lifetime_end:
2553 case Intrinsic::invariant_start:
2554 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2555 "size argument of memory use markers must be a constant integer",
2558 case Intrinsic::invariant_end:
2559 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2560 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2565 void DebugInfoVerifier::verifyDebugInfo() {
2566 if (!VerifyDebugInfo)
2569 DebugInfoFinder Finder;
2570 Finder.processModule(*M);
2571 processInstructions(Finder);
2573 // Verify Debug Info.
2575 // NOTE: The loud braces are necessary for MSVC compatibility.
2576 for (DICompileUnit CU : Finder.compile_units()) {
2577 Assert1(CU.Verify(), "DICompileUnit does not Verify!", CU);
2579 for (DISubprogram S : Finder.subprograms()) {
2580 Assert1(S.Verify(), "DISubprogram does not Verify!", S);
2582 for (DIGlobalVariable GV : Finder.global_variables()) {
2583 Assert1(GV.Verify(), "DIGlobalVariable does not Verify!", GV);
2585 for (DIType T : Finder.types()) {
2586 Assert1(T.Verify(), "DIType does not Verify!", T);
2588 for (DIScope S : Finder.scopes()) {
2589 Assert1(S.Verify(), "DIScope does not Verify!", S);
2593 void DebugInfoVerifier::processInstructions(DebugInfoFinder &Finder) {
2594 for (const Function &F : *M)
2595 for (auto I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2596 if (MDNode *MD = I->getMetadata(LLVMContext::MD_dbg))
2597 Finder.processLocation(*M, DILocation(MD));
2598 if (const CallInst *CI = dyn_cast<CallInst>(&*I))
2599 processCallInst(Finder, *CI);
2603 void DebugInfoVerifier::processCallInst(DebugInfoFinder &Finder,
2604 const CallInst &CI) {
2605 if (Function *F = CI.getCalledFunction())
2606 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2608 case Intrinsic::dbg_declare:
2609 Finder.processDeclare(*M, cast<DbgDeclareInst>(&CI));
2611 case Intrinsic::dbg_value:
2612 Finder.processValue(*M, cast<DbgValueInst>(&CI));
2619 //===----------------------------------------------------------------------===//
2620 // Implement the public interfaces to this file...
2621 //===----------------------------------------------------------------------===//
2623 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
2624 Function &F = const_cast<Function &>(f);
2625 assert(!F.isDeclaration() && "Cannot verify external functions");
2627 raw_null_ostream NullStr;
2628 Verifier V(OS ? *OS : NullStr);
2630 // Note that this function's return value is inverted from what you would
2631 // expect of a function called "verify".
2632 return !V.verify(F);
2635 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
2636 raw_null_ostream NullStr;
2637 Verifier V(OS ? *OS : NullStr);
2639 bool Broken = false;
2640 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
2641 if (!I->isDeclaration() && !I->isMaterializable())
2642 Broken |= !V.verify(*I);
2644 // Note that this function's return value is inverted from what you would
2645 // expect of a function called "verify".
2646 DebugInfoVerifier DIV(OS ? *OS : NullStr);
2647 return !V.verify(M) || !DIV.verify(M) || Broken;
2651 struct VerifierLegacyPass : public FunctionPass {
2657 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
2658 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2660 explicit VerifierLegacyPass(bool FatalErrors)
2661 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2662 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2665 bool runOnFunction(Function &F) override {
2666 if (!V.verify(F) && FatalErrors)
2667 report_fatal_error("Broken function found, compilation aborted!");
2672 bool doFinalization(Module &M) override {
2673 if (!V.verify(M) && FatalErrors)
2674 report_fatal_error("Broken module found, compilation aborted!");
2679 void getAnalysisUsage(AnalysisUsage &AU) const override {
2680 AU.setPreservesAll();
2683 struct DebugInfoVerifierLegacyPass : public ModulePass {
2686 DebugInfoVerifier V;
2689 DebugInfoVerifierLegacyPass() : ModulePass(ID), FatalErrors(true) {
2690 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2692 explicit DebugInfoVerifierLegacyPass(bool FatalErrors)
2693 : ModulePass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2694 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2697 bool runOnModule(Module &M) override {
2698 if (!V.verify(M) && FatalErrors)
2699 report_fatal_error("Broken debug info found, compilation aborted!");
2704 void getAnalysisUsage(AnalysisUsage &AU) const override {
2705 AU.setPreservesAll();
2710 char VerifierLegacyPass::ID = 0;
2711 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
2713 char DebugInfoVerifierLegacyPass::ID = 0;
2714 INITIALIZE_PASS(DebugInfoVerifierLegacyPass, "verify-di", "Debug Info Verifier",
2717 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
2718 return new VerifierLegacyPass(FatalErrors);
2721 ModulePass *llvm::createDebugInfoVerifierPass(bool FatalErrors) {
2722 return new DebugInfoVerifierLegacyPass(FatalErrors);
2725 PreservedAnalyses VerifierPass::run(Module *M) {
2726 if (verifyModule(*M, &dbgs()) && FatalErrors)
2727 report_fatal_error("Broken module found, compilation aborted!");
2729 return PreservedAnalyses::all();
2732 PreservedAnalyses VerifierPass::run(Function *F) {
2733 if (verifyFunction(*F, &dbgs()) && FatalErrors)
2734 report_fatal_error("Broken function found, compilation aborted!");
2736 return PreservedAnalyses::all();