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);
273 // InstVisitor overrides...
274 using InstVisitor<Verifier>::visit;
275 void visit(Instruction &I);
277 void visitTruncInst(TruncInst &I);
278 void visitZExtInst(ZExtInst &I);
279 void visitSExtInst(SExtInst &I);
280 void visitFPTruncInst(FPTruncInst &I);
281 void visitFPExtInst(FPExtInst &I);
282 void visitFPToUIInst(FPToUIInst &I);
283 void visitFPToSIInst(FPToSIInst &I);
284 void visitUIToFPInst(UIToFPInst &I);
285 void visitSIToFPInst(SIToFPInst &I);
286 void visitIntToPtrInst(IntToPtrInst &I);
287 void visitPtrToIntInst(PtrToIntInst &I);
288 void visitBitCastInst(BitCastInst &I);
289 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
290 void visitPHINode(PHINode &PN);
291 void visitBinaryOperator(BinaryOperator &B);
292 void visitICmpInst(ICmpInst &IC);
293 void visitFCmpInst(FCmpInst &FC);
294 void visitExtractElementInst(ExtractElementInst &EI);
295 void visitInsertElementInst(InsertElementInst &EI);
296 void visitShuffleVectorInst(ShuffleVectorInst &EI);
297 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
298 void visitCallInst(CallInst &CI);
299 void visitInvokeInst(InvokeInst &II);
300 void visitGetElementPtrInst(GetElementPtrInst &GEP);
301 void visitLoadInst(LoadInst &LI);
302 void visitStoreInst(StoreInst &SI);
303 void verifyDominatesUse(Instruction &I, unsigned i);
304 void visitInstruction(Instruction &I);
305 void visitTerminatorInst(TerminatorInst &I);
306 void visitBranchInst(BranchInst &BI);
307 void visitReturnInst(ReturnInst &RI);
308 void visitSwitchInst(SwitchInst &SI);
309 void visitIndirectBrInst(IndirectBrInst &BI);
310 void visitSelectInst(SelectInst &SI);
311 void visitUserOp1(Instruction &I);
312 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
313 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
314 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
315 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
316 void visitFenceInst(FenceInst &FI);
317 void visitAllocaInst(AllocaInst &AI);
318 void visitExtractValueInst(ExtractValueInst &EVI);
319 void visitInsertValueInst(InsertValueInst &IVI);
320 void visitLandingPadInst(LandingPadInst &LPI);
322 void VerifyCallSite(CallSite CS);
323 void verifyMustTailCall(CallInst &CI);
324 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
325 unsigned ArgNo, std::string &Suffix);
326 bool VerifyIntrinsicType(Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
327 SmallVectorImpl<Type *> &ArgTys);
328 bool VerifyIntrinsicIsVarArg(bool isVarArg,
329 ArrayRef<Intrinsic::IITDescriptor> &Infos);
330 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
331 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
333 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
334 bool isReturnValue, const Value *V);
335 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
338 void VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy);
339 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
341 class DebugInfoVerifier : public VerifierSupport {
343 explicit DebugInfoVerifier(raw_ostream &OS = dbgs()) : VerifierSupport(OS) {}
345 bool verify(const Module &M) {
352 void verifyDebugInfo();
353 void processInstructions(DebugInfoFinder &Finder);
354 void processCallInst(DebugInfoFinder &Finder, const CallInst &CI);
356 } // End anonymous namespace
358 // Assert - We know that cond should be true, if not print an error message.
359 #define Assert(C, M) \
360 do { if (!(C)) { CheckFailed(M); return; } } while (0)
361 #define Assert1(C, M, V1) \
362 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
363 #define Assert2(C, M, V1, V2) \
364 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
365 #define Assert3(C, M, V1, V2, V3) \
366 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
367 #define Assert4(C, M, V1, V2, V3, V4) \
368 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
370 void Verifier::visit(Instruction &I) {
371 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
372 Assert1(I.getOperand(i) != nullptr, "Operand is null", &I);
373 InstVisitor<Verifier>::visit(I);
377 void Verifier::visitGlobalValue(const GlobalValue &GV) {
378 Assert1(!GV.isDeclaration() || GV.isMaterializable() ||
379 GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
380 "Global is external, but doesn't have external or weak linkage!",
383 Assert1(GV.getAlignment() <= Value::MaximumAlignment,
384 "huge alignment values are unsupported", &GV);
385 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
386 "Only global variables can have appending linkage!", &GV);
388 if (GV.hasAppendingLinkage()) {
389 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
390 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
391 "Only global arrays can have appending linkage!", GVar);
395 void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
396 if (GV.hasInitializer()) {
397 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
398 "Global variable initializer type does not match global "
399 "variable type!", &GV);
401 // If the global has common linkage, it must have a zero initializer and
402 // cannot be constant.
403 if (GV.hasCommonLinkage()) {
404 Assert1(GV.getInitializer()->isNullValue(),
405 "'common' global must have a zero initializer!", &GV);
406 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
408 Assert1(!GV.hasComdat(), "'common' global may not be in a Comdat!", &GV);
411 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
412 "invalid linkage type for global declaration", &GV);
415 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
416 GV.getName() == "llvm.global_dtors")) {
417 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
418 "invalid linkage for intrinsic global variable", &GV);
419 // Don't worry about emitting an error for it not being an array,
420 // visitGlobalValue will complain on appending non-array.
421 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType()->getElementType())) {
422 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
423 PointerType *FuncPtrTy =
424 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
425 // FIXME: Reject the 2-field form in LLVM 4.0.
426 Assert1(STy && (STy->getNumElements() == 2 ||
427 STy->getNumElements() == 3) &&
428 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
429 STy->getTypeAtIndex(1) == FuncPtrTy,
430 "wrong type for intrinsic global variable", &GV);
431 if (STy->getNumElements() == 3) {
432 Type *ETy = STy->getTypeAtIndex(2);
433 Assert1(ETy->isPointerTy() &&
434 cast<PointerType>(ETy)->getElementType()->isIntegerTy(8),
435 "wrong type for intrinsic global variable", &GV);
440 if (GV.hasName() && (GV.getName() == "llvm.used" ||
441 GV.getName() == "llvm.compiler.used")) {
442 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
443 "invalid linkage for intrinsic global variable", &GV);
444 Type *GVType = GV.getType()->getElementType();
445 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
446 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
447 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
448 if (GV.hasInitializer()) {
449 const Constant *Init = GV.getInitializer();
450 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
451 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
453 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
454 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
456 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
457 "invalid llvm.used member", V);
458 Assert1(V->hasName(), "members of llvm.used must be named", V);
464 Assert1(!GV.hasDLLImportStorageClass() ||
465 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
466 GV.hasAvailableExternallyLinkage(),
467 "Global is marked as dllimport, but not external", &GV);
469 if (!GV.hasInitializer()) {
470 visitGlobalValue(GV);
474 // Walk any aggregate initializers looking for bitcasts between address spaces
475 SmallPtrSet<const Value *, 4> Visited;
476 SmallVector<const Value *, 4> WorkStack;
477 WorkStack.push_back(cast<Value>(GV.getInitializer()));
479 while (!WorkStack.empty()) {
480 const Value *V = WorkStack.pop_back_val();
481 if (!Visited.insert(V))
484 if (const User *U = dyn_cast<User>(V)) {
485 for (unsigned I = 0, N = U->getNumOperands(); I != N; ++I)
486 WorkStack.push_back(U->getOperand(I));
489 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
490 VerifyConstantExprBitcastType(CE);
496 visitGlobalValue(GV);
499 void Verifier::visitAliaseeSubExpr(const GlobalAlias &GA, const Constant &C) {
500 SmallPtrSet<const GlobalAlias*, 4> Visited;
502 visitAliaseeSubExpr(Visited, GA, C);
505 void Verifier::visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias*> &Visited,
506 const GlobalAlias &GA, const Constant &C) {
507 if (const auto *GV = dyn_cast<GlobalValue>(&C)) {
508 Assert1(!GV->isDeclaration(), "Alias must point to a definition", &GA);
510 if (const auto *GA2 = dyn_cast<GlobalAlias>(GV)) {
511 Assert1(Visited.insert(GA2), "Aliases cannot form a cycle", &GA);
513 Assert1(!GA2->mayBeOverridden(), "Alias cannot point to a weak alias",
516 // Only continue verifying subexpressions of GlobalAliases.
517 // Do not recurse into global initializers.
522 if (const auto *CE = dyn_cast<ConstantExpr>(&C))
523 VerifyConstantExprBitcastType(CE);
525 for (const Use &U : C.operands()) {
527 if (const auto *GA2 = dyn_cast<GlobalAlias>(V))
528 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
529 else if (const auto *C2 = dyn_cast<Constant>(V))
530 visitAliaseeSubExpr(Visited, GA, *C2);
534 void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
535 Assert1(!GA.getName().empty(),
536 "Alias name cannot be empty!", &GA);
537 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
538 "Alias should have private, internal, linkonce, weak, linkonce_odr, "
539 "weak_odr, or external linkage!",
541 const Constant *Aliasee = GA.getAliasee();
542 Assert1(Aliasee, "Aliasee cannot be NULL!", &GA);
543 Assert1(GA.getType() == Aliasee->getType(),
544 "Alias and aliasee types should match!", &GA);
546 Assert1(isa<GlobalValue>(Aliasee) || isa<ConstantExpr>(Aliasee),
547 "Aliasee should be either GlobalValue or ConstantExpr", &GA);
549 visitAliaseeSubExpr(GA, *Aliasee);
551 visitGlobalValue(GA);
554 void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
555 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
556 MDNode *MD = NMD.getOperand(i);
560 Assert1(!MD->isFunctionLocal(),
561 "Named metadata operand cannot be function local!", MD);
562 visitMDNode(*MD, nullptr);
566 void Verifier::visitMDNode(MDNode &MD, Function *F) {
567 // Only visit each node once. Metadata can be mutually recursive, so this
568 // avoids infinite recursion here, as well as being an optimization.
569 if (!MDNodes.insert(&MD))
572 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
573 Value *Op = MD.getOperand(i);
576 if (isa<Constant>(Op) || isa<MDString>(Op))
578 if (MDNode *N = dyn_cast<MDNode>(Op)) {
579 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
580 "Global metadata operand cannot be function local!", &MD, N);
584 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
586 // If this was an instruction, bb, or argument, verify that it is in the
587 // function that we expect.
588 Function *ActualF = nullptr;
589 if (Instruction *I = dyn_cast<Instruction>(Op))
590 ActualF = I->getParent()->getParent();
591 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
592 ActualF = BB->getParent();
593 else if (Argument *A = dyn_cast<Argument>(Op))
594 ActualF = A->getParent();
595 assert(ActualF && "Unimplemented function local metadata case!");
597 Assert2(ActualF == F, "function-local metadata used in wrong function",
602 void Verifier::visitComdat(const Comdat &C) {
603 // All Comdat::SelectionKind values other than Comdat::Any require a
604 // GlobalValue with the same name as the Comdat.
605 const GlobalValue *GV = M->getNamedValue(C.getName());
606 if (C.getSelectionKind() != Comdat::Any)
608 "comdat selection kind requires a global value with the same name",
610 // The Module is invalid if the GlobalValue has private linkage. Entities
611 // with private linkage don't have entries in the symbol table.
613 Assert1(!GV->hasPrivateLinkage(), "comdat global value has private linkage",
617 void Verifier::visitModuleIdents(const Module &M) {
618 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
622 // llvm.ident takes a list of metadata entry. Each entry has only one string.
623 // Scan each llvm.ident entry and make sure that this requirement is met.
624 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
625 const MDNode *N = Idents->getOperand(i);
626 Assert1(N->getNumOperands() == 1,
627 "incorrect number of operands in llvm.ident metadata", N);
628 Assert1(isa<MDString>(N->getOperand(0)),
629 ("invalid value for llvm.ident metadata entry operand"
630 "(the operand should be a string)"),
635 void Verifier::visitModuleFlags(const Module &M) {
636 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
639 // Scan each flag, and track the flags and requirements.
640 DenseMap<const MDString*, const MDNode*> SeenIDs;
641 SmallVector<const MDNode*, 16> Requirements;
642 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
643 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
646 // Validate that the requirements in the module are valid.
647 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
648 const MDNode *Requirement = Requirements[I];
649 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
650 const Value *ReqValue = Requirement->getOperand(1);
652 const MDNode *Op = SeenIDs.lookup(Flag);
654 CheckFailed("invalid requirement on flag, flag is not present in module",
659 if (Op->getOperand(2) != ReqValue) {
660 CheckFailed(("invalid requirement on flag, "
661 "flag does not have the required value"),
669 Verifier::visitModuleFlag(const MDNode *Op,
670 DenseMap<const MDString *, const MDNode *> &SeenIDs,
671 SmallVectorImpl<const MDNode *> &Requirements) {
672 // Each module flag should have three arguments, the merge behavior (a
673 // constant int), the flag ID (an MDString), and the value.
674 Assert1(Op->getNumOperands() == 3,
675 "incorrect number of operands in module flag", Op);
676 ConstantInt *Behavior = dyn_cast<ConstantInt>(Op->getOperand(0));
677 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
679 "invalid behavior operand in module flag (expected constant integer)",
681 unsigned BehaviorValue = Behavior->getZExtValue();
683 "invalid ID operand in module flag (expected metadata string)",
686 // Sanity check the values for behaviors with additional requirements.
687 switch (BehaviorValue) {
690 "invalid behavior operand in module flag (unexpected constant)",
695 case Module::Warning:
696 case Module::Override:
697 // These behavior types accept any value.
700 case Module::Require: {
701 // The value should itself be an MDNode with two operands, a flag ID (an
702 // MDString), and a value.
703 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
704 Assert1(Value && Value->getNumOperands() == 2,
705 "invalid value for 'require' module flag (expected metadata pair)",
707 Assert1(isa<MDString>(Value->getOperand(0)),
708 ("invalid value for 'require' module flag "
709 "(first value operand should be a string)"),
710 Value->getOperand(0));
712 // Append it to the list of requirements, to check once all module flags are
714 Requirements.push_back(Value);
719 case Module::AppendUnique: {
720 // These behavior types require the operand be an MDNode.
721 Assert1(isa<MDNode>(Op->getOperand(2)),
722 "invalid value for 'append'-type module flag "
723 "(expected a metadata node)", Op->getOperand(2));
728 // Unless this is a "requires" flag, check the ID is unique.
729 if (BehaviorValue != Module::Require) {
730 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
732 "module flag identifiers must be unique (or of 'require' type)",
737 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
738 bool isFunction, const Value *V) {
740 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
741 if (Attrs.getSlotIndex(I) == Idx) {
746 assert(Slot != ~0U && "Attribute set inconsistency!");
748 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
750 if (I->isStringAttribute())
753 if (I->getKindAsEnum() == Attribute::NoReturn ||
754 I->getKindAsEnum() == Attribute::NoUnwind ||
755 I->getKindAsEnum() == Attribute::NoInline ||
756 I->getKindAsEnum() == Attribute::AlwaysInline ||
757 I->getKindAsEnum() == Attribute::OptimizeForSize ||
758 I->getKindAsEnum() == Attribute::StackProtect ||
759 I->getKindAsEnum() == Attribute::StackProtectReq ||
760 I->getKindAsEnum() == Attribute::StackProtectStrong ||
761 I->getKindAsEnum() == Attribute::NoRedZone ||
762 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
763 I->getKindAsEnum() == Attribute::Naked ||
764 I->getKindAsEnum() == Attribute::InlineHint ||
765 I->getKindAsEnum() == Attribute::StackAlignment ||
766 I->getKindAsEnum() == Attribute::UWTable ||
767 I->getKindAsEnum() == Attribute::NonLazyBind ||
768 I->getKindAsEnum() == Attribute::ReturnsTwice ||
769 I->getKindAsEnum() == Attribute::SanitizeAddress ||
770 I->getKindAsEnum() == Attribute::SanitizeThread ||
771 I->getKindAsEnum() == Attribute::SanitizeMemory ||
772 I->getKindAsEnum() == Attribute::MinSize ||
773 I->getKindAsEnum() == Attribute::NoDuplicate ||
774 I->getKindAsEnum() == Attribute::Builtin ||
775 I->getKindAsEnum() == Attribute::NoBuiltin ||
776 I->getKindAsEnum() == Attribute::Cold ||
777 I->getKindAsEnum() == Attribute::OptimizeNone ||
778 I->getKindAsEnum() == Attribute::JumpTable) {
780 CheckFailed("Attribute '" + I->getAsString() +
781 "' only applies to functions!", V);
784 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
785 I->getKindAsEnum() == Attribute::ReadNone) {
787 CheckFailed("Attribute '" + I->getAsString() +
788 "' does not apply to function returns");
791 } else if (isFunction) {
792 CheckFailed("Attribute '" + I->getAsString() +
793 "' does not apply to functions!", V);
799 // VerifyParameterAttrs - Check the given attributes for an argument or return
800 // value of the specified type. The value V is printed in error messages.
801 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
802 bool isReturnValue, const Value *V) {
803 if (!Attrs.hasAttributes(Idx))
806 VerifyAttributeTypes(Attrs, Idx, false, V);
809 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
810 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
811 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
812 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
813 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
814 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
815 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
816 "'returned' do not apply to return values!", V);
818 // Check for mutually incompatible attributes. Only inreg is compatible with
820 unsigned AttrCount = 0;
821 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
822 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
823 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
824 Attrs.hasAttribute(Idx, Attribute::InReg);
825 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
826 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
827 "and 'sret' are incompatible!", V);
829 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
830 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
831 "'inalloca and readonly' are incompatible!", V);
833 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
834 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
835 "'sret and returned' are incompatible!", V);
837 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
838 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
839 "'zeroext and signext' are incompatible!", V);
841 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
842 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
843 "'readnone and readonly' are incompatible!", V);
845 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
846 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
847 "'noinline and alwaysinline' are incompatible!", V);
849 Assert1(!AttrBuilder(Attrs, Idx).
850 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
851 "Wrong types for attribute: " +
852 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
854 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
855 if (!PTy->getElementType()->isSized()) {
856 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
857 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
858 "Attributes 'byval' and 'inalloca' do not support unsized types!",
862 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
863 "Attribute 'byval' only applies to parameters with pointer type!",
868 // VerifyFunctionAttrs - Check parameter attributes against a function type.
869 // The value V is printed in error messages.
870 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
875 bool SawNest = false;
876 bool SawReturned = false;
877 bool SawSRet = false;
879 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
880 unsigned Idx = Attrs.getSlotIndex(i);
884 Ty = FT->getReturnType();
885 else if (Idx-1 < FT->getNumParams())
886 Ty = FT->getParamType(Idx-1);
888 break; // VarArgs attributes, verified elsewhere.
890 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
895 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
896 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
900 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
901 Assert1(!SawReturned, "More than one parameter has attribute returned!",
903 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
904 "argument and return types for 'returned' attribute", V);
908 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
909 Assert1(!SawSRet, "Cannot have multiple 'sret' parameters!", V);
910 Assert1(Idx == 1 || Idx == 2,
911 "Attribute 'sret' is not on first or second parameter!", V);
915 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
916 Assert1(Idx == FT->getNumParams(),
917 "inalloca isn't on the last parameter!", V);
921 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
924 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
926 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
927 Attribute::ReadNone) &&
928 Attrs.hasAttribute(AttributeSet::FunctionIndex,
929 Attribute::ReadOnly)),
930 "Attributes 'readnone and readonly' are incompatible!", V);
932 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
933 Attribute::NoInline) &&
934 Attrs.hasAttribute(AttributeSet::FunctionIndex,
935 Attribute::AlwaysInline)),
936 "Attributes 'noinline and alwaysinline' are incompatible!", V);
938 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
939 Attribute::OptimizeNone)) {
940 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
941 Attribute::NoInline),
942 "Attribute 'optnone' requires 'noinline'!", V);
944 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
945 Attribute::OptimizeForSize),
946 "Attributes 'optsize and optnone' are incompatible!", V);
948 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
950 "Attributes 'minsize and optnone' are incompatible!", V);
953 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
954 Attribute::JumpTable)) {
955 const GlobalValue *GV = cast<GlobalValue>(V);
956 Assert1(GV->hasUnnamedAddr(),
957 "Attribute 'jumptable' requires 'unnamed_addr'", V);
962 void Verifier::VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy) {
963 // Get the size of the types in bits, we'll need this later
964 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
965 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
967 // BitCast implies a no-op cast of type only. No bits change.
968 // However, you can't cast pointers to anything but pointers.
969 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
970 "Bitcast requires both operands to be pointer or neither", V);
971 Assert1(SrcBitSize == DestBitSize,
972 "Bitcast requires types of same width", V);
974 // Disallow aggregates.
975 Assert1(!SrcTy->isAggregateType(),
976 "Bitcast operand must not be aggregate", V);
977 Assert1(!DestTy->isAggregateType(),
978 "Bitcast type must not be aggregate", V);
980 // Without datalayout, assume all address spaces are the same size.
981 // Don't check if both types are not pointers.
982 // Skip casts between scalars and vectors.
984 !SrcTy->isPtrOrPtrVectorTy() ||
985 !DestTy->isPtrOrPtrVectorTy() ||
986 SrcTy->isVectorTy() != DestTy->isVectorTy()) {
990 unsigned SrcAS = SrcTy->getPointerAddressSpace();
991 unsigned DstAS = DestTy->getPointerAddressSpace();
993 Assert1(SrcAS == DstAS,
994 "Bitcasts between pointers of different address spaces is not legal."
995 "Use AddrSpaceCast instead.", V);
998 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
999 if (CE->getOpcode() == Instruction::BitCast) {
1000 Type *SrcTy = CE->getOperand(0)->getType();
1001 Type *DstTy = CE->getType();
1002 VerifyBitcastType(CE, DstTy, SrcTy);
1006 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1007 if (Attrs.getNumSlots() == 0)
1010 unsigned LastSlot = Attrs.getNumSlots() - 1;
1011 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1012 if (LastIndex <= Params
1013 || (LastIndex == AttributeSet::FunctionIndex
1014 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1020 // visitFunction - Verify that a function is ok.
1022 void Verifier::visitFunction(const Function &F) {
1023 // Check function arguments.
1024 FunctionType *FT = F.getFunctionType();
1025 unsigned NumArgs = F.arg_size();
1027 Assert1(Context == &F.getContext(),
1028 "Function context does not match Module context!", &F);
1030 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1031 Assert2(FT->getNumParams() == NumArgs,
1032 "# formal arguments must match # of arguments for function type!",
1034 Assert1(F.getReturnType()->isFirstClassType() ||
1035 F.getReturnType()->isVoidTy() ||
1036 F.getReturnType()->isStructTy(),
1037 "Functions cannot return aggregate values!", &F);
1039 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1040 "Invalid struct return type!", &F);
1042 AttributeSet Attrs = F.getAttributes();
1044 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1045 "Attribute after last parameter!", &F);
1047 // Check function attributes.
1048 VerifyFunctionAttrs(FT, Attrs, &F);
1050 // On function declarations/definitions, we do not support the builtin
1051 // attribute. We do not check this in VerifyFunctionAttrs since that is
1052 // checking for Attributes that can/can not ever be on functions.
1053 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1054 Attribute::Builtin),
1055 "Attribute 'builtin' can only be applied to a callsite.", &F);
1057 // Check that this function meets the restrictions on this calling convention.
1058 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
1059 // restrictions can be lifted.
1060 switch (F.getCallingConv()) {
1062 case CallingConv::C:
1064 case CallingConv::Fast:
1065 case CallingConv::Cold:
1066 case CallingConv::Intel_OCL_BI:
1067 case CallingConv::PTX_Kernel:
1068 case CallingConv::PTX_Device:
1069 Assert1(!F.isVarArg(), "Calling convention does not support varargs or "
1070 "perfect forwarding!", &F);
1074 bool isLLVMdotName = F.getName().size() >= 5 &&
1075 F.getName().substr(0, 5) == "llvm.";
1077 // Check that the argument values match the function type for this function...
1079 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1081 Assert2(I->getType() == FT->getParamType(i),
1082 "Argument value does not match function argument type!",
1083 I, FT->getParamType(i));
1084 Assert1(I->getType()->isFirstClassType(),
1085 "Function arguments must have first-class types!", I);
1087 Assert2(!I->getType()->isMetadataTy(),
1088 "Function takes metadata but isn't an intrinsic", I, &F);
1091 if (F.isMaterializable()) {
1092 // Function has a body somewhere we can't see.
1093 } else if (F.isDeclaration()) {
1094 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1095 "invalid linkage type for function declaration", &F);
1097 // Verify that this function (which has a body) is not named "llvm.*". It
1098 // is not legal to define intrinsics.
1099 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1101 // Check the entry node
1102 const BasicBlock *Entry = &F.getEntryBlock();
1103 Assert1(pred_begin(Entry) == pred_end(Entry),
1104 "Entry block to function must not have predecessors!", Entry);
1106 // The address of the entry block cannot be taken, unless it is dead.
1107 if (Entry->hasAddressTaken()) {
1108 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1109 "blockaddress may not be used with the entry block!", Entry);
1113 // If this function is actually an intrinsic, verify that it is only used in
1114 // direct call/invokes, never having its "address taken".
1115 if (F.getIntrinsicID()) {
1117 if (F.hasAddressTaken(&U))
1118 Assert1(0, "Invalid user of intrinsic instruction!", U);
1121 Assert1(!F.hasDLLImportStorageClass() ||
1122 (F.isDeclaration() && F.hasExternalLinkage()) ||
1123 F.hasAvailableExternallyLinkage(),
1124 "Function is marked as dllimport, but not external.", &F);
1127 // verifyBasicBlock - Verify that a basic block is well formed...
1129 void Verifier::visitBasicBlock(BasicBlock &BB) {
1130 InstsInThisBlock.clear();
1132 // Ensure that basic blocks have terminators!
1133 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1135 // Check constraints that this basic block imposes on all of the PHI nodes in
1137 if (isa<PHINode>(BB.front())) {
1138 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1139 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1140 std::sort(Preds.begin(), Preds.end());
1142 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1143 // Ensure that PHI nodes have at least one entry!
1144 Assert1(PN->getNumIncomingValues() != 0,
1145 "PHI nodes must have at least one entry. If the block is dead, "
1146 "the PHI should be removed!", PN);
1147 Assert1(PN->getNumIncomingValues() == Preds.size(),
1148 "PHINode should have one entry for each predecessor of its "
1149 "parent basic block!", PN);
1151 // Get and sort all incoming values in the PHI node...
1153 Values.reserve(PN->getNumIncomingValues());
1154 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1155 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1156 PN->getIncomingValue(i)));
1157 std::sort(Values.begin(), Values.end());
1159 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1160 // Check to make sure that if there is more than one entry for a
1161 // particular basic block in this PHI node, that the incoming values are
1164 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1165 Values[i].second == Values[i-1].second,
1166 "PHI node has multiple entries for the same basic block with "
1167 "different incoming values!", PN, Values[i].first,
1168 Values[i].second, Values[i-1].second);
1170 // Check to make sure that the predecessors and PHI node entries are
1172 Assert3(Values[i].first == Preds[i],
1173 "PHI node entries do not match predecessors!", PN,
1174 Values[i].first, Preds[i]);
1180 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1181 // Ensure that terminators only exist at the end of the basic block.
1182 Assert1(&I == I.getParent()->getTerminator(),
1183 "Terminator found in the middle of a basic block!", I.getParent());
1184 visitInstruction(I);
1187 void Verifier::visitBranchInst(BranchInst &BI) {
1188 if (BI.isConditional()) {
1189 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1190 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1192 visitTerminatorInst(BI);
1195 void Verifier::visitReturnInst(ReturnInst &RI) {
1196 Function *F = RI.getParent()->getParent();
1197 unsigned N = RI.getNumOperands();
1198 if (F->getReturnType()->isVoidTy())
1200 "Found return instr that returns non-void in Function of void "
1201 "return type!", &RI, F->getReturnType());
1203 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1204 "Function return type does not match operand "
1205 "type of return inst!", &RI, F->getReturnType());
1207 // Check to make sure that the return value has necessary properties for
1209 visitTerminatorInst(RI);
1212 void Verifier::visitSwitchInst(SwitchInst &SI) {
1213 // Check to make sure that all of the constants in the switch instruction
1214 // have the same type as the switched-on value.
1215 Type *SwitchTy = SI.getCondition()->getType();
1216 SmallPtrSet<ConstantInt*, 32> Constants;
1217 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1218 Assert1(i.getCaseValue()->getType() == SwitchTy,
1219 "Switch constants must all be same type as switch value!", &SI);
1220 Assert2(Constants.insert(i.getCaseValue()),
1221 "Duplicate integer as switch case", &SI, i.getCaseValue());
1224 visitTerminatorInst(SI);
1227 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1228 Assert1(BI.getAddress()->getType()->isPointerTy(),
1229 "Indirectbr operand must have pointer type!", &BI);
1230 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1231 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1232 "Indirectbr destinations must all have pointer type!", &BI);
1234 visitTerminatorInst(BI);
1237 void Verifier::visitSelectInst(SelectInst &SI) {
1238 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1240 "Invalid operands for select instruction!", &SI);
1242 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1243 "Select values must have same type as select instruction!", &SI);
1244 visitInstruction(SI);
1247 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1248 /// a pass, if any exist, it's an error.
1250 void Verifier::visitUserOp1(Instruction &I) {
1251 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1254 void Verifier::visitTruncInst(TruncInst &I) {
1255 // Get the source and destination types
1256 Type *SrcTy = I.getOperand(0)->getType();
1257 Type *DestTy = I.getType();
1259 // Get the size of the types in bits, we'll need this later
1260 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1261 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1263 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1264 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1265 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1266 "trunc source and destination must both be a vector or neither", &I);
1267 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1269 visitInstruction(I);
1272 void Verifier::visitZExtInst(ZExtInst &I) {
1273 // Get the source and destination types
1274 Type *SrcTy = I.getOperand(0)->getType();
1275 Type *DestTy = I.getType();
1277 // Get the size of the types in bits, we'll need this later
1278 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1279 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1280 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1281 "zext source and destination must both be a vector or neither", &I);
1282 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1283 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1285 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1287 visitInstruction(I);
1290 void Verifier::visitSExtInst(SExtInst &I) {
1291 // Get the source and destination types
1292 Type *SrcTy = I.getOperand(0)->getType();
1293 Type *DestTy = I.getType();
1295 // Get the size of the types in bits, we'll need this later
1296 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1297 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1299 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1300 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1301 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1302 "sext source and destination must both be a vector or neither", &I);
1303 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1305 visitInstruction(I);
1308 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1309 // Get the source and destination types
1310 Type *SrcTy = I.getOperand(0)->getType();
1311 Type *DestTy = I.getType();
1312 // Get the size of the types in bits, we'll need this later
1313 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1314 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1316 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1317 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1318 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1319 "fptrunc source and destination must both be a vector or neither",&I);
1320 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1322 visitInstruction(I);
1325 void Verifier::visitFPExtInst(FPExtInst &I) {
1326 // Get the source and destination types
1327 Type *SrcTy = I.getOperand(0)->getType();
1328 Type *DestTy = I.getType();
1330 // Get the size of the types in bits, we'll need this later
1331 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1332 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1334 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1335 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1336 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1337 "fpext source and destination must both be a vector or neither", &I);
1338 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1340 visitInstruction(I);
1343 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1344 // Get the source and destination types
1345 Type *SrcTy = I.getOperand(0)->getType();
1346 Type *DestTy = I.getType();
1348 bool SrcVec = SrcTy->isVectorTy();
1349 bool DstVec = DestTy->isVectorTy();
1351 Assert1(SrcVec == DstVec,
1352 "UIToFP source and dest must both be vector or scalar", &I);
1353 Assert1(SrcTy->isIntOrIntVectorTy(),
1354 "UIToFP source must be integer or integer vector", &I);
1355 Assert1(DestTy->isFPOrFPVectorTy(),
1356 "UIToFP result must be FP or FP vector", &I);
1358 if (SrcVec && DstVec)
1359 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1360 cast<VectorType>(DestTy)->getNumElements(),
1361 "UIToFP source and dest vector length mismatch", &I);
1363 visitInstruction(I);
1366 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1367 // Get the source and destination types
1368 Type *SrcTy = I.getOperand(0)->getType();
1369 Type *DestTy = I.getType();
1371 bool SrcVec = SrcTy->isVectorTy();
1372 bool DstVec = DestTy->isVectorTy();
1374 Assert1(SrcVec == DstVec,
1375 "SIToFP source and dest must both be vector or scalar", &I);
1376 Assert1(SrcTy->isIntOrIntVectorTy(),
1377 "SIToFP source must be integer or integer vector", &I);
1378 Assert1(DestTy->isFPOrFPVectorTy(),
1379 "SIToFP result must be FP or FP vector", &I);
1381 if (SrcVec && DstVec)
1382 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1383 cast<VectorType>(DestTy)->getNumElements(),
1384 "SIToFP source and dest vector length mismatch", &I);
1386 visitInstruction(I);
1389 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1390 // Get the source and destination types
1391 Type *SrcTy = I.getOperand(0)->getType();
1392 Type *DestTy = I.getType();
1394 bool SrcVec = SrcTy->isVectorTy();
1395 bool DstVec = DestTy->isVectorTy();
1397 Assert1(SrcVec == DstVec,
1398 "FPToUI source and dest must both be vector or scalar", &I);
1399 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1401 Assert1(DestTy->isIntOrIntVectorTy(),
1402 "FPToUI result must be integer or integer vector", &I);
1404 if (SrcVec && DstVec)
1405 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1406 cast<VectorType>(DestTy)->getNumElements(),
1407 "FPToUI source and dest vector length mismatch", &I);
1409 visitInstruction(I);
1412 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1413 // Get the source and destination types
1414 Type *SrcTy = I.getOperand(0)->getType();
1415 Type *DestTy = I.getType();
1417 bool SrcVec = SrcTy->isVectorTy();
1418 bool DstVec = DestTy->isVectorTy();
1420 Assert1(SrcVec == DstVec,
1421 "FPToSI source and dest must both be vector or scalar", &I);
1422 Assert1(SrcTy->isFPOrFPVectorTy(),
1423 "FPToSI source must be FP or FP vector", &I);
1424 Assert1(DestTy->isIntOrIntVectorTy(),
1425 "FPToSI result must be integer or integer vector", &I);
1427 if (SrcVec && DstVec)
1428 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1429 cast<VectorType>(DestTy)->getNumElements(),
1430 "FPToSI source and dest vector length mismatch", &I);
1432 visitInstruction(I);
1435 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1436 // Get the source and destination types
1437 Type *SrcTy = I.getOperand(0)->getType();
1438 Type *DestTy = I.getType();
1440 Assert1(SrcTy->getScalarType()->isPointerTy(),
1441 "PtrToInt source must be pointer", &I);
1442 Assert1(DestTy->getScalarType()->isIntegerTy(),
1443 "PtrToInt result must be integral", &I);
1444 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1445 "PtrToInt type mismatch", &I);
1447 if (SrcTy->isVectorTy()) {
1448 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1449 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1450 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1451 "PtrToInt Vector width mismatch", &I);
1454 visitInstruction(I);
1457 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1458 // Get the source and destination types
1459 Type *SrcTy = I.getOperand(0)->getType();
1460 Type *DestTy = I.getType();
1462 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1463 "IntToPtr source must be an integral", &I);
1464 Assert1(DestTy->getScalarType()->isPointerTy(),
1465 "IntToPtr result must be a pointer",&I);
1466 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1467 "IntToPtr type mismatch", &I);
1468 if (SrcTy->isVectorTy()) {
1469 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1470 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1471 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1472 "IntToPtr Vector width mismatch", &I);
1474 visitInstruction(I);
1477 void Verifier::visitBitCastInst(BitCastInst &I) {
1478 Type *SrcTy = I.getOperand(0)->getType();
1479 Type *DestTy = I.getType();
1480 VerifyBitcastType(&I, DestTy, SrcTy);
1481 visitInstruction(I);
1484 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1485 Type *SrcTy = I.getOperand(0)->getType();
1486 Type *DestTy = I.getType();
1488 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1489 "AddrSpaceCast source must be a pointer", &I);
1490 Assert1(DestTy->isPtrOrPtrVectorTy(),
1491 "AddrSpaceCast result must be a pointer", &I);
1492 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1493 "AddrSpaceCast must be between different address spaces", &I);
1494 if (SrcTy->isVectorTy())
1495 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1496 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1497 visitInstruction(I);
1500 /// visitPHINode - Ensure that a PHI node is well formed.
1502 void Verifier::visitPHINode(PHINode &PN) {
1503 // Ensure that the PHI nodes are all grouped together at the top of the block.
1504 // This can be tested by checking whether the instruction before this is
1505 // either nonexistent (because this is begin()) or is a PHI node. If not,
1506 // then there is some other instruction before a PHI.
1507 Assert2(&PN == &PN.getParent()->front() ||
1508 isa<PHINode>(--BasicBlock::iterator(&PN)),
1509 "PHI nodes not grouped at top of basic block!",
1510 &PN, PN.getParent());
1512 // Check that all of the values of the PHI node have the same type as the
1513 // result, and that the incoming blocks are really basic blocks.
1514 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1515 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1516 "PHI node operands are not the same type as the result!", &PN);
1519 // All other PHI node constraints are checked in the visitBasicBlock method.
1521 visitInstruction(PN);
1524 void Verifier::VerifyCallSite(CallSite CS) {
1525 Instruction *I = CS.getInstruction();
1527 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1528 "Called function must be a pointer!", I);
1529 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1531 Assert1(FPTy->getElementType()->isFunctionTy(),
1532 "Called function is not pointer to function type!", I);
1533 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1535 // Verify that the correct number of arguments are being passed
1536 if (FTy->isVarArg())
1537 Assert1(CS.arg_size() >= FTy->getNumParams(),
1538 "Called function requires more parameters than were provided!",I);
1540 Assert1(CS.arg_size() == FTy->getNumParams(),
1541 "Incorrect number of arguments passed to called function!", I);
1543 // Verify that all arguments to the call match the function type.
1544 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1545 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1546 "Call parameter type does not match function signature!",
1547 CS.getArgument(i), FTy->getParamType(i), I);
1549 AttributeSet Attrs = CS.getAttributes();
1551 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1552 "Attribute after last parameter!", I);
1554 // Verify call attributes.
1555 VerifyFunctionAttrs(FTy, Attrs, I);
1557 // Conservatively check the inalloca argument.
1558 // We have a bug if we can find that there is an underlying alloca without
1560 if (CS.hasInAllocaArgument()) {
1561 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
1562 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
1563 Assert2(AI->isUsedWithInAlloca(),
1564 "inalloca argument for call has mismatched alloca", AI, I);
1567 if (FTy->isVarArg()) {
1568 // FIXME? is 'nest' even legal here?
1569 bool SawNest = false;
1570 bool SawReturned = false;
1572 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1573 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1575 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1579 // Check attributes on the varargs part.
1580 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1581 Type *Ty = CS.getArgument(Idx-1)->getType();
1582 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1584 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1585 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1589 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1590 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1592 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1593 "Incompatible argument and return types for 'returned' "
1598 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1599 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1601 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1602 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1607 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1608 if (CS.getCalledFunction() == nullptr ||
1609 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1610 for (FunctionType::param_iterator PI = FTy->param_begin(),
1611 PE = FTy->param_end(); PI != PE; ++PI)
1612 Assert1(!(*PI)->isMetadataTy(),
1613 "Function has metadata parameter but isn't an intrinsic", I);
1616 visitInstruction(*I);
1619 /// Two types are "congruent" if they are identical, or if they are both pointer
1620 /// types with different pointee types and the same address space.
1621 static bool isTypeCongruent(Type *L, Type *R) {
1624 PointerType *PL = dyn_cast<PointerType>(L);
1625 PointerType *PR = dyn_cast<PointerType>(R);
1628 return PL->getAddressSpace() == PR->getAddressSpace();
1631 static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
1632 static const Attribute::AttrKind ABIAttrs[] = {
1633 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
1634 Attribute::InReg, Attribute::Returned};
1636 for (auto AK : ABIAttrs) {
1637 if (Attrs.hasAttribute(I + 1, AK))
1638 Copy.addAttribute(AK);
1640 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
1641 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
1645 void Verifier::verifyMustTailCall(CallInst &CI) {
1646 Assert1(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI);
1648 // - The caller and callee prototypes must match. Pointer types of
1649 // parameters or return types may differ in pointee type, but not
1651 Function *F = CI.getParent()->getParent();
1652 auto GetFnTy = [](Value *V) {
1653 return cast<FunctionType>(
1654 cast<PointerType>(V->getType())->getElementType());
1656 FunctionType *CallerTy = GetFnTy(F);
1657 FunctionType *CalleeTy = GetFnTy(CI.getCalledValue());
1658 Assert1(CallerTy->getNumParams() == CalleeTy->getNumParams(),
1659 "cannot guarantee tail call due to mismatched parameter counts", &CI);
1660 Assert1(CallerTy->isVarArg() == CalleeTy->isVarArg(),
1661 "cannot guarantee tail call due to mismatched varargs", &CI);
1662 Assert1(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),
1663 "cannot guarantee tail call due to mismatched return types", &CI);
1664 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1666 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),
1667 "cannot guarantee tail call due to mismatched parameter types", &CI);
1670 // - The calling conventions of the caller and callee must match.
1671 Assert1(F->getCallingConv() == CI.getCallingConv(),
1672 "cannot guarantee tail call due to mismatched calling conv", &CI);
1674 // - All ABI-impacting function attributes, such as sret, byval, inreg,
1675 // returned, and inalloca, must match.
1676 AttributeSet CallerAttrs = F->getAttributes();
1677 AttributeSet CalleeAttrs = CI.getAttributes();
1678 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1679 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
1680 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
1681 Assert2(CallerABIAttrs == CalleeABIAttrs,
1682 "cannot guarantee tail call due to mismatched ABI impacting "
1683 "function attributes", &CI, CI.getOperand(I));
1686 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
1687 // or a pointer bitcast followed by a ret instruction.
1688 // - The ret instruction must return the (possibly bitcasted) value
1689 // produced by the call or void.
1690 Value *RetVal = &CI;
1691 Instruction *Next = CI.getNextNode();
1693 // Handle the optional bitcast.
1694 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
1695 Assert1(BI->getOperand(0) == RetVal,
1696 "bitcast following musttail call must use the call", BI);
1698 Next = BI->getNextNode();
1701 // Check the return.
1702 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
1703 Assert1(Ret, "musttail call must be precede a ret with an optional bitcast",
1705 Assert1(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,
1706 "musttail call result must be returned", Ret);
1709 void Verifier::visitCallInst(CallInst &CI) {
1710 VerifyCallSite(&CI);
1712 if (CI.isMustTailCall())
1713 verifyMustTailCall(CI);
1715 if (Function *F = CI.getCalledFunction())
1716 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1717 visitIntrinsicFunctionCall(ID, CI);
1720 void Verifier::visitInvokeInst(InvokeInst &II) {
1721 VerifyCallSite(&II);
1723 // Verify that there is a landingpad instruction as the first non-PHI
1724 // instruction of the 'unwind' destination.
1725 Assert1(II.getUnwindDest()->isLandingPad(),
1726 "The unwind destination does not have a landingpad instruction!",&II);
1728 visitTerminatorInst(II);
1731 /// visitBinaryOperator - Check that both arguments to the binary operator are
1732 /// of the same type!
1734 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1735 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1736 "Both operands to a binary operator are not of the same type!", &B);
1738 switch (B.getOpcode()) {
1739 // Check that integer arithmetic operators are only used with
1740 // integral operands.
1741 case Instruction::Add:
1742 case Instruction::Sub:
1743 case Instruction::Mul:
1744 case Instruction::SDiv:
1745 case Instruction::UDiv:
1746 case Instruction::SRem:
1747 case Instruction::URem:
1748 Assert1(B.getType()->isIntOrIntVectorTy(),
1749 "Integer arithmetic operators only work with integral types!", &B);
1750 Assert1(B.getType() == B.getOperand(0)->getType(),
1751 "Integer arithmetic operators must have same type "
1752 "for operands and result!", &B);
1754 // Check that floating-point arithmetic operators are only used with
1755 // floating-point operands.
1756 case Instruction::FAdd:
1757 case Instruction::FSub:
1758 case Instruction::FMul:
1759 case Instruction::FDiv:
1760 case Instruction::FRem:
1761 Assert1(B.getType()->isFPOrFPVectorTy(),
1762 "Floating-point arithmetic operators only work with "
1763 "floating-point types!", &B);
1764 Assert1(B.getType() == B.getOperand(0)->getType(),
1765 "Floating-point arithmetic operators must have same type "
1766 "for operands and result!", &B);
1768 // Check that logical operators are only used with integral operands.
1769 case Instruction::And:
1770 case Instruction::Or:
1771 case Instruction::Xor:
1772 Assert1(B.getType()->isIntOrIntVectorTy(),
1773 "Logical operators only work with integral types!", &B);
1774 Assert1(B.getType() == B.getOperand(0)->getType(),
1775 "Logical operators must have same type for operands and result!",
1778 case Instruction::Shl:
1779 case Instruction::LShr:
1780 case Instruction::AShr:
1781 Assert1(B.getType()->isIntOrIntVectorTy(),
1782 "Shifts only work with integral types!", &B);
1783 Assert1(B.getType() == B.getOperand(0)->getType(),
1784 "Shift return type must be same as operands!", &B);
1787 llvm_unreachable("Unknown BinaryOperator opcode!");
1790 visitInstruction(B);
1793 void Verifier::visitICmpInst(ICmpInst &IC) {
1794 // Check that the operands are the same type
1795 Type *Op0Ty = IC.getOperand(0)->getType();
1796 Type *Op1Ty = IC.getOperand(1)->getType();
1797 Assert1(Op0Ty == Op1Ty,
1798 "Both operands to ICmp instruction are not of the same type!", &IC);
1799 // Check that the operands are the right type
1800 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1801 "Invalid operand types for ICmp instruction", &IC);
1802 // Check that the predicate is valid.
1803 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1804 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1805 "Invalid predicate in ICmp instruction!", &IC);
1807 visitInstruction(IC);
1810 void Verifier::visitFCmpInst(FCmpInst &FC) {
1811 // Check that the operands are the same type
1812 Type *Op0Ty = FC.getOperand(0)->getType();
1813 Type *Op1Ty = FC.getOperand(1)->getType();
1814 Assert1(Op0Ty == Op1Ty,
1815 "Both operands to FCmp instruction are not of the same type!", &FC);
1816 // Check that the operands are the right type
1817 Assert1(Op0Ty->isFPOrFPVectorTy(),
1818 "Invalid operand types for FCmp instruction", &FC);
1819 // Check that the predicate is valid.
1820 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1821 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1822 "Invalid predicate in FCmp instruction!", &FC);
1824 visitInstruction(FC);
1827 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1828 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1830 "Invalid extractelement operands!", &EI);
1831 visitInstruction(EI);
1834 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1835 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1838 "Invalid insertelement operands!", &IE);
1839 visitInstruction(IE);
1842 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1843 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1845 "Invalid shufflevector operands!", &SV);
1846 visitInstruction(SV);
1849 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1850 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1852 Assert1(isa<PointerType>(TargetTy),
1853 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1854 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1855 "GEP into unsized type!", &GEP);
1856 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1857 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1860 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1862 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1863 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1865 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1866 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1867 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1869 if (GEP.getPointerOperandType()->isVectorTy()) {
1870 // Additional checks for vector GEPs.
1871 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1872 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1873 "Vector GEP result width doesn't match operand's", &GEP);
1874 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1875 Type *IndexTy = Idxs[i]->getType();
1876 Assert1(IndexTy->isVectorTy(),
1877 "Vector GEP must have vector indices!", &GEP);
1878 unsigned IndexWidth = IndexTy->getVectorNumElements();
1879 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1882 visitInstruction(GEP);
1885 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1886 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1889 void Verifier::visitLoadInst(LoadInst &LI) {
1890 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1891 Assert1(PTy, "Load operand must be a pointer.", &LI);
1892 Type *ElTy = PTy->getElementType();
1893 Assert2(ElTy == LI.getType(),
1894 "Load result type does not match pointer operand type!", &LI, ElTy);
1895 Assert1(LI.getAlignment() <= Value::MaximumAlignment,
1896 "huge alignment values are unsupported", &LI);
1897 if (LI.isAtomic()) {
1898 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1899 "Load cannot have Release ordering", &LI);
1900 Assert1(LI.getAlignment() != 0,
1901 "Atomic load must specify explicit alignment", &LI);
1902 if (!ElTy->isPointerTy()) {
1903 Assert2(ElTy->isIntegerTy(),
1904 "atomic load operand must have integer type!",
1906 unsigned Size = ElTy->getPrimitiveSizeInBits();
1907 Assert2(Size >= 8 && !(Size & (Size - 1)),
1908 "atomic load operand must be power-of-two byte-sized integer",
1912 Assert1(LI.getSynchScope() == CrossThread,
1913 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1916 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1917 unsigned NumOperands = Range->getNumOperands();
1918 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1919 unsigned NumRanges = NumOperands / 2;
1920 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1922 ConstantRange LastRange(1); // Dummy initial value
1923 for (unsigned i = 0; i < NumRanges; ++i) {
1924 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1925 Assert1(Low, "The lower limit must be an integer!", Low);
1926 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1927 Assert1(High, "The upper limit must be an integer!", High);
1928 Assert1(High->getType() == Low->getType() &&
1929 High->getType() == ElTy, "Range types must match load type!",
1932 APInt HighV = High->getValue();
1933 APInt LowV = Low->getValue();
1934 ConstantRange CurRange(LowV, HighV);
1935 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1936 "Range must not be empty!", Range);
1938 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1939 "Intervals are overlapping", Range);
1940 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1942 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1945 LastRange = ConstantRange(LowV, HighV);
1947 if (NumRanges > 2) {
1949 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1951 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1952 ConstantRange FirstRange(FirstLow, FirstHigh);
1953 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1954 "Intervals are overlapping", Range);
1955 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1962 visitInstruction(LI);
1965 void Verifier::visitStoreInst(StoreInst &SI) {
1966 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1967 Assert1(PTy, "Store operand must be a pointer.", &SI);
1968 Type *ElTy = PTy->getElementType();
1969 Assert2(ElTy == SI.getOperand(0)->getType(),
1970 "Stored value type does not match pointer operand type!",
1972 Assert1(SI.getAlignment() <= Value::MaximumAlignment,
1973 "huge alignment values are unsupported", &SI);
1974 if (SI.isAtomic()) {
1975 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1976 "Store cannot have Acquire ordering", &SI);
1977 Assert1(SI.getAlignment() != 0,
1978 "Atomic store must specify explicit alignment", &SI);
1979 if (!ElTy->isPointerTy()) {
1980 Assert2(ElTy->isIntegerTy(),
1981 "atomic store operand must have integer type!",
1983 unsigned Size = ElTy->getPrimitiveSizeInBits();
1984 Assert2(Size >= 8 && !(Size & (Size - 1)),
1985 "atomic store operand must be power-of-two byte-sized integer",
1989 Assert1(SI.getSynchScope() == CrossThread,
1990 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1992 visitInstruction(SI);
1995 void Verifier::visitAllocaInst(AllocaInst &AI) {
1996 SmallPtrSet<const Type*, 4> Visited;
1997 PointerType *PTy = AI.getType();
1998 Assert1(PTy->getAddressSpace() == 0,
1999 "Allocation instruction pointer not in the generic address space!",
2001 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
2003 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
2004 "Alloca array size must have integer type", &AI);
2005 Assert1(AI.getAlignment() <= Value::MaximumAlignment,
2006 "huge alignment values are unsupported", &AI);
2008 visitInstruction(AI);
2011 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
2013 // FIXME: more conditions???
2014 Assert1(CXI.getSuccessOrdering() != NotAtomic,
2015 "cmpxchg instructions must be atomic.", &CXI);
2016 Assert1(CXI.getFailureOrdering() != NotAtomic,
2017 "cmpxchg instructions must be atomic.", &CXI);
2018 Assert1(CXI.getSuccessOrdering() != Unordered,
2019 "cmpxchg instructions cannot be unordered.", &CXI);
2020 Assert1(CXI.getFailureOrdering() != Unordered,
2021 "cmpxchg instructions cannot be unordered.", &CXI);
2022 Assert1(CXI.getSuccessOrdering() >= CXI.getFailureOrdering(),
2023 "cmpxchg instructions be at least as constrained on success as fail",
2025 Assert1(CXI.getFailureOrdering() != Release &&
2026 CXI.getFailureOrdering() != AcquireRelease,
2027 "cmpxchg failure ordering cannot include release semantics", &CXI);
2029 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
2030 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
2031 Type *ElTy = PTy->getElementType();
2032 Assert2(ElTy->isIntegerTy(),
2033 "cmpxchg operand must have integer type!",
2035 unsigned Size = ElTy->getPrimitiveSizeInBits();
2036 Assert2(Size >= 8 && !(Size & (Size - 1)),
2037 "cmpxchg operand must be power-of-two byte-sized integer",
2039 Assert2(ElTy == CXI.getOperand(1)->getType(),
2040 "Expected value type does not match pointer operand type!",
2042 Assert2(ElTy == CXI.getOperand(2)->getType(),
2043 "Stored value type does not match pointer operand type!",
2045 visitInstruction(CXI);
2048 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
2049 Assert1(RMWI.getOrdering() != NotAtomic,
2050 "atomicrmw instructions must be atomic.", &RMWI);
2051 Assert1(RMWI.getOrdering() != Unordered,
2052 "atomicrmw instructions cannot be unordered.", &RMWI);
2053 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
2054 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
2055 Type *ElTy = PTy->getElementType();
2056 Assert2(ElTy->isIntegerTy(),
2057 "atomicrmw operand must have integer type!",
2059 unsigned Size = ElTy->getPrimitiveSizeInBits();
2060 Assert2(Size >= 8 && !(Size & (Size - 1)),
2061 "atomicrmw operand must be power-of-two byte-sized integer",
2063 Assert2(ElTy == RMWI.getOperand(1)->getType(),
2064 "Argument value type does not match pointer operand type!",
2066 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
2067 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
2068 "Invalid binary operation!", &RMWI);
2069 visitInstruction(RMWI);
2072 void Verifier::visitFenceInst(FenceInst &FI) {
2073 const AtomicOrdering Ordering = FI.getOrdering();
2074 Assert1(Ordering == Acquire || Ordering == Release ||
2075 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
2076 "fence instructions may only have "
2077 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
2078 visitInstruction(FI);
2081 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
2082 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
2083 EVI.getIndices()) ==
2085 "Invalid ExtractValueInst operands!", &EVI);
2087 visitInstruction(EVI);
2090 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
2091 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
2092 IVI.getIndices()) ==
2093 IVI.getOperand(1)->getType(),
2094 "Invalid InsertValueInst operands!", &IVI);
2096 visitInstruction(IVI);
2099 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
2100 BasicBlock *BB = LPI.getParent();
2102 // The landingpad instruction is ill-formed if it doesn't have any clauses and
2104 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
2105 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
2107 // The landingpad instruction defines its parent as a landing pad block. The
2108 // landing pad block may be branched to only by the unwind edge of an invoke.
2109 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
2110 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
2111 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
2112 "Block containing LandingPadInst must be jumped to "
2113 "only by the unwind edge of an invoke.", &LPI);
2116 // The landingpad instruction must be the first non-PHI instruction in the
2118 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
2119 "LandingPadInst not the first non-PHI instruction in the block.",
2122 // The personality functions for all landingpad instructions within the same
2123 // function should match.
2125 Assert1(LPI.getPersonalityFn() == PersonalityFn,
2126 "Personality function doesn't match others in function", &LPI);
2127 PersonalityFn = LPI.getPersonalityFn();
2129 // All operands must be constants.
2130 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
2132 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
2133 Constant *Clause = LPI.getClause(i);
2134 if (LPI.isCatch(i)) {
2135 Assert1(isa<PointerType>(Clause->getType()),
2136 "Catch operand does not have pointer type!", &LPI);
2138 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
2139 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
2140 "Filter operand is not an array of constants!", &LPI);
2144 visitInstruction(LPI);
2147 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
2148 Instruction *Op = cast<Instruction>(I.getOperand(i));
2149 // If the we have an invalid invoke, don't try to compute the dominance.
2150 // We already reject it in the invoke specific checks and the dominance
2151 // computation doesn't handle multiple edges.
2152 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2153 if (II->getNormalDest() == II->getUnwindDest())
2157 const Use &U = I.getOperandUse(i);
2158 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
2159 "Instruction does not dominate all uses!", Op, &I);
2162 /// verifyInstruction - Verify that an instruction is well formed.
2164 void Verifier::visitInstruction(Instruction &I) {
2165 BasicBlock *BB = I.getParent();
2166 Assert1(BB, "Instruction not embedded in basic block!", &I);
2168 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2169 for (User *U : I.users()) {
2170 Assert1(U != (User*)&I || !DT.isReachableFromEntry(BB),
2171 "Only PHI nodes may reference their own value!", &I);
2175 // Check that void typed values don't have names
2176 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2177 "Instruction has a name, but provides a void value!", &I);
2179 // Check that the return value of the instruction is either void or a legal
2181 Assert1(I.getType()->isVoidTy() ||
2182 I.getType()->isFirstClassType(),
2183 "Instruction returns a non-scalar type!", &I);
2185 // Check that the instruction doesn't produce metadata. Calls are already
2186 // checked against the callee type.
2187 Assert1(!I.getType()->isMetadataTy() ||
2188 isa<CallInst>(I) || isa<InvokeInst>(I),
2189 "Invalid use of metadata!", &I);
2191 // Check that all uses of the instruction, if they are instructions
2192 // themselves, actually have parent basic blocks. If the use is not an
2193 // instruction, it is an error!
2194 for (Use &U : I.uses()) {
2195 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
2196 Assert2(Used->getParent() != nullptr, "Instruction referencing"
2197 " instruction not embedded in a basic block!", &I, Used);
2199 CheckFailed("Use of instruction is not an instruction!", U);
2204 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2205 Assert1(I.getOperand(i) != nullptr, "Instruction has null operand!", &I);
2207 // Check to make sure that only first-class-values are operands to
2209 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2210 Assert1(0, "Instruction operands must be first-class values!", &I);
2213 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2214 // Check to make sure that the "address of" an intrinsic function is never
2216 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
2217 "Cannot take the address of an intrinsic!", &I);
2218 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2219 F->getIntrinsicID() == Intrinsic::donothing,
2220 "Cannot invoke an intrinsinc other than donothing", &I);
2221 Assert1(F->getParent() == M, "Referencing function in another module!",
2223 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2224 Assert1(OpBB->getParent() == BB->getParent(),
2225 "Referring to a basic block in another function!", &I);
2226 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2227 Assert1(OpArg->getParent() == BB->getParent(),
2228 "Referring to an argument in another function!", &I);
2229 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2230 Assert1(GV->getParent() == M, "Referencing global in another module!",
2232 } else if (isa<Instruction>(I.getOperand(i))) {
2233 verifyDominatesUse(I, i);
2234 } else if (isa<InlineAsm>(I.getOperand(i))) {
2235 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2236 (i + 3 == e && isa<InvokeInst>(I)),
2237 "Cannot take the address of an inline asm!", &I);
2238 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2239 if (CE->getType()->isPtrOrPtrVectorTy()) {
2240 // If we have a ConstantExpr pointer, we need to see if it came from an
2241 // illegal bitcast (inttoptr <constant int> )
2242 SmallVector<const ConstantExpr *, 4> Stack;
2243 SmallPtrSet<const ConstantExpr *, 4> Visited;
2244 Stack.push_back(CE);
2246 while (!Stack.empty()) {
2247 const ConstantExpr *V = Stack.pop_back_val();
2248 if (!Visited.insert(V))
2251 VerifyConstantExprBitcastType(V);
2253 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2254 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2255 Stack.push_back(Op);
2262 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2263 Assert1(I.getType()->isFPOrFPVectorTy(),
2264 "fpmath requires a floating point result!", &I);
2265 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2266 Value *Op0 = MD->getOperand(0);
2267 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
2268 APFloat Accuracy = CFP0->getValueAPF();
2269 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2270 "fpmath accuracy not a positive number!", &I);
2272 Assert1(false, "invalid fpmath accuracy!", &I);
2276 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
2277 Assert1(!MD || isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),
2278 "Ranges are only for loads, calls and invokes!", &I);
2280 InstsInThisBlock.insert(&I);
2283 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2284 /// intrinsic argument or return value) matches the type constraints specified
2285 /// by the .td file (e.g. an "any integer" argument really is an integer).
2287 /// This return true on error but does not print a message.
2288 bool Verifier::VerifyIntrinsicType(Type *Ty,
2289 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2290 SmallVectorImpl<Type*> &ArgTys) {
2291 using namespace Intrinsic;
2293 // If we ran out of descriptors, there are too many arguments.
2294 if (Infos.empty()) return true;
2295 IITDescriptor D = Infos.front();
2296 Infos = Infos.slice(1);
2299 case IITDescriptor::Void: return !Ty->isVoidTy();
2300 case IITDescriptor::VarArg: return true;
2301 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2302 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2303 case IITDescriptor::Half: return !Ty->isHalfTy();
2304 case IITDescriptor::Float: return !Ty->isFloatTy();
2305 case IITDescriptor::Double: return !Ty->isDoubleTy();
2306 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2307 case IITDescriptor::Vector: {
2308 VectorType *VT = dyn_cast<VectorType>(Ty);
2309 return !VT || VT->getNumElements() != D.Vector_Width ||
2310 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2312 case IITDescriptor::Pointer: {
2313 PointerType *PT = dyn_cast<PointerType>(Ty);
2314 return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2315 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2318 case IITDescriptor::Struct: {
2319 StructType *ST = dyn_cast<StructType>(Ty);
2320 if (!ST || ST->getNumElements() != D.Struct_NumElements)
2323 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2324 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2329 case IITDescriptor::Argument:
2330 // Two cases here - If this is the second occurrence of an argument, verify
2331 // that the later instance matches the previous instance.
2332 if (D.getArgumentNumber() < ArgTys.size())
2333 return Ty != ArgTys[D.getArgumentNumber()];
2335 // Otherwise, if this is the first instance of an argument, record it and
2336 // verify the "Any" kind.
2337 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2338 ArgTys.push_back(Ty);
2340 switch (D.getArgumentKind()) {
2341 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2342 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2343 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2344 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2346 llvm_unreachable("all argument kinds not covered");
2348 case IITDescriptor::ExtendArgument: {
2349 // This may only be used when referring to a previous vector argument.
2350 if (D.getArgumentNumber() >= ArgTys.size())
2353 Type *NewTy = ArgTys[D.getArgumentNumber()];
2354 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2355 NewTy = VectorType::getExtendedElementVectorType(VTy);
2356 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2357 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2363 case IITDescriptor::TruncArgument: {
2364 // This may only be used when referring to a previous vector argument.
2365 if (D.getArgumentNumber() >= ArgTys.size())
2368 Type *NewTy = ArgTys[D.getArgumentNumber()];
2369 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2370 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2371 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2372 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
2378 case IITDescriptor::HalfVecArgument:
2379 // This may only be used when referring to a previous vector argument.
2380 return D.getArgumentNumber() >= ArgTys.size() ||
2381 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2382 VectorType::getHalfElementsVectorType(
2383 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2385 llvm_unreachable("unhandled");
2388 /// \brief Verify if the intrinsic has variable arguments.
2389 /// This method is intended to be called after all the fixed arguments have been
2392 /// This method returns true on error and does not print an error message.
2394 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2395 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2396 using namespace Intrinsic;
2398 // If there are no descriptors left, then it can't be a vararg.
2400 return isVarArg ? true : false;
2402 // There should be only one descriptor remaining at this point.
2403 if (Infos.size() != 1)
2406 // Check and verify the descriptor.
2407 IITDescriptor D = Infos.front();
2408 Infos = Infos.slice(1);
2409 if (D.Kind == IITDescriptor::VarArg)
2410 return isVarArg ? false : true;
2415 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2417 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2418 Function *IF = CI.getCalledFunction();
2419 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2422 // Verify that the intrinsic prototype lines up with what the .td files
2424 FunctionType *IFTy = IF->getFunctionType();
2425 bool IsVarArg = IFTy->isVarArg();
2427 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2428 getIntrinsicInfoTableEntries(ID, Table);
2429 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2431 SmallVector<Type *, 4> ArgTys;
2432 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2433 "Intrinsic has incorrect return type!", IF);
2434 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2435 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2436 "Intrinsic has incorrect argument type!", IF);
2438 // Verify if the intrinsic call matches the vararg property.
2440 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2441 "Intrinsic was not defined with variable arguments!", IF);
2443 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2444 "Callsite was not defined with variable arguments!", IF);
2446 // All descriptors should be absorbed by now.
2447 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2449 // Now that we have the intrinsic ID and the actual argument types (and we
2450 // know they are legal for the intrinsic!) get the intrinsic name through the
2451 // usual means. This allows us to verify the mangling of argument types into
2453 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
2454 Assert1(ExpectedName == IF->getName(),
2455 "Intrinsic name not mangled correctly for type arguments! "
2456 "Should be: " + ExpectedName, IF);
2458 // If the intrinsic takes MDNode arguments, verify that they are either global
2459 // or are local to *this* function.
2460 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2461 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
2462 visitMDNode(*MD, CI.getParent()->getParent());
2467 case Intrinsic::ctlz: // llvm.ctlz
2468 case Intrinsic::cttz: // llvm.cttz
2469 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2470 "is_zero_undef argument of bit counting intrinsics must be a "
2471 "constant int", &CI);
2473 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2474 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2475 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2476 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
2477 Assert1(MD->getNumOperands() == 1,
2478 "invalid llvm.dbg.declare intrinsic call 2", &CI);
2480 case Intrinsic::memcpy:
2481 case Intrinsic::memmove:
2482 case Intrinsic::memset:
2483 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2484 "alignment argument of memory intrinsics must be a constant int",
2486 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2487 "isvolatile argument of memory intrinsics must be a constant int",
2490 case Intrinsic::gcroot:
2491 case Intrinsic::gcwrite:
2492 case Intrinsic::gcread:
2493 if (ID == Intrinsic::gcroot) {
2495 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2496 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2497 Assert1(isa<Constant>(CI.getArgOperand(1)),
2498 "llvm.gcroot parameter #2 must be a constant.", &CI);
2499 if (!AI->getType()->getElementType()->isPointerTy()) {
2500 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2501 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2502 "or argument #2 must be a non-null constant.", &CI);
2506 Assert1(CI.getParent()->getParent()->hasGC(),
2507 "Enclosing function does not use GC.", &CI);
2509 case Intrinsic::init_trampoline:
2510 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2511 "llvm.init_trampoline parameter #2 must resolve to a function.",
2514 case Intrinsic::prefetch:
2515 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2516 isa<ConstantInt>(CI.getArgOperand(2)) &&
2517 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2518 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2519 "invalid arguments to llvm.prefetch",
2522 case Intrinsic::stackprotector:
2523 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2524 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2527 case Intrinsic::lifetime_start:
2528 case Intrinsic::lifetime_end:
2529 case Intrinsic::invariant_start:
2530 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2531 "size argument of memory use markers must be a constant integer",
2534 case Intrinsic::invariant_end:
2535 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2536 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2541 void DebugInfoVerifier::verifyDebugInfo() {
2542 if (!VerifyDebugInfo)
2545 DebugInfoFinder Finder;
2546 Finder.processModule(*M);
2547 processInstructions(Finder);
2549 // Verify Debug Info.
2551 // NOTE: The loud braces are necessary for MSVC compatibility.
2552 for (DICompileUnit CU : Finder.compile_units()) {
2553 Assert1(CU.Verify(), "DICompileUnit does not Verify!", CU);
2555 for (DISubprogram S : Finder.subprograms()) {
2556 Assert1(S.Verify(), "DISubprogram does not Verify!", S);
2558 for (DIGlobalVariable GV : Finder.global_variables()) {
2559 Assert1(GV.Verify(), "DIGlobalVariable does not Verify!", GV);
2561 for (DIType T : Finder.types()) {
2562 Assert1(T.Verify(), "DIType does not Verify!", T);
2564 for (DIScope S : Finder.scopes()) {
2565 Assert1(S.Verify(), "DIScope does not Verify!", S);
2569 void DebugInfoVerifier::processInstructions(DebugInfoFinder &Finder) {
2570 for (const Function &F : *M)
2571 for (auto I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2572 if (MDNode *MD = I->getMetadata(LLVMContext::MD_dbg))
2573 Finder.processLocation(*M, DILocation(MD));
2574 if (const CallInst *CI = dyn_cast<CallInst>(&*I))
2575 processCallInst(Finder, *CI);
2579 void DebugInfoVerifier::processCallInst(DebugInfoFinder &Finder,
2580 const CallInst &CI) {
2581 if (Function *F = CI.getCalledFunction())
2582 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2584 case Intrinsic::dbg_declare:
2585 Finder.processDeclare(*M, cast<DbgDeclareInst>(&CI));
2587 case Intrinsic::dbg_value:
2588 Finder.processValue(*M, cast<DbgValueInst>(&CI));
2595 //===----------------------------------------------------------------------===//
2596 // Implement the public interfaces to this file...
2597 //===----------------------------------------------------------------------===//
2599 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
2600 Function &F = const_cast<Function &>(f);
2601 assert(!F.isDeclaration() && "Cannot verify external functions");
2603 raw_null_ostream NullStr;
2604 Verifier V(OS ? *OS : NullStr);
2606 // Note that this function's return value is inverted from what you would
2607 // expect of a function called "verify".
2608 return !V.verify(F);
2611 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
2612 raw_null_ostream NullStr;
2613 Verifier V(OS ? *OS : NullStr);
2615 bool Broken = false;
2616 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
2617 if (!I->isDeclaration())
2618 Broken |= !V.verify(*I);
2620 // Note that this function's return value is inverted from what you would
2621 // expect of a function called "verify".
2622 DebugInfoVerifier DIV(OS ? *OS : NullStr);
2623 return !V.verify(M) || !DIV.verify(M) || Broken;
2627 struct VerifierLegacyPass : public FunctionPass {
2633 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
2634 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2636 explicit VerifierLegacyPass(bool FatalErrors)
2637 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2638 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2641 bool runOnFunction(Function &F) override {
2642 if (!V.verify(F) && FatalErrors)
2643 report_fatal_error("Broken function found, compilation aborted!");
2648 bool doFinalization(Module &M) override {
2649 if (!V.verify(M) && FatalErrors)
2650 report_fatal_error("Broken module found, compilation aborted!");
2655 void getAnalysisUsage(AnalysisUsage &AU) const override {
2656 AU.setPreservesAll();
2659 struct DebugInfoVerifierLegacyPass : public ModulePass {
2662 DebugInfoVerifier V;
2665 DebugInfoVerifierLegacyPass() : ModulePass(ID), FatalErrors(true) {
2666 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2668 explicit DebugInfoVerifierLegacyPass(bool FatalErrors)
2669 : ModulePass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2670 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2673 bool runOnModule(Module &M) override {
2674 if (!V.verify(M) && FatalErrors)
2675 report_fatal_error("Broken debug info found, compilation aborted!");
2680 void getAnalysisUsage(AnalysisUsage &AU) const override {
2681 AU.setPreservesAll();
2686 char VerifierLegacyPass::ID = 0;
2687 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
2689 char DebugInfoVerifierLegacyPass::ID = 0;
2690 INITIALIZE_PASS(DebugInfoVerifierLegacyPass, "verify-di", "Debug Info Verifier",
2693 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
2694 return new VerifierLegacyPass(FatalErrors);
2697 ModulePass *llvm::createDebugInfoVerifierPass(bool FatalErrors) {
2698 return new DebugInfoVerifierLegacyPass(FatalErrors);
2701 PreservedAnalyses VerifierPass::run(Module *M) {
2702 if (verifyModule(*M, &dbgs()) && FatalErrors)
2703 report_fatal_error("Broken module found, compilation aborted!");
2705 return PreservedAnalyses::all();
2708 PreservedAnalyses VerifierPass::run(Function *F) {
2709 if (verifyFunction(*F, &dbgs()) && FatalErrors)
2710 report_fatal_error("Broken function found, compilation aborted!");
2712 return PreservedAnalyses::all();