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 Module::ModFlagBehavior MFB;
677 if (!Module::isValidModFlagBehavior(Op->getOperand(0), MFB)) {
679 dyn_cast<ConstantInt>(Op->getOperand(0)),
680 "invalid behavior operand in module flag (expected constant integer)",
683 "invalid behavior operand in module flag (unexpected constant)",
686 MDString *ID = dyn_cast<MDString>(Op->getOperand(1));
688 "invalid ID operand in module flag (expected metadata string)",
691 // Sanity check the values for behaviors with additional requirements.
694 case Module::Warning:
695 case Module::Override:
696 // These behavior types accept any value.
699 case Module::Require: {
700 // The value should itself be an MDNode with two operands, a flag ID (an
701 // MDString), and a value.
702 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
703 Assert1(Value && Value->getNumOperands() == 2,
704 "invalid value for 'require' module flag (expected metadata pair)",
706 Assert1(isa<MDString>(Value->getOperand(0)),
707 ("invalid value for 'require' module flag "
708 "(first value operand should be a string)"),
709 Value->getOperand(0));
711 // Append it to the list of requirements, to check once all module flags are
713 Requirements.push_back(Value);
718 case Module::AppendUnique: {
719 // These behavior types require the operand be an MDNode.
720 Assert1(isa<MDNode>(Op->getOperand(2)),
721 "invalid value for 'append'-type module flag "
722 "(expected a metadata node)", Op->getOperand(2));
727 // Unless this is a "requires" flag, check the ID is unique.
728 if (MFB != Module::Require) {
729 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
731 "module flag identifiers must be unique (or of 'require' type)",
736 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
737 bool isFunction, const Value *V) {
739 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
740 if (Attrs.getSlotIndex(I) == Idx) {
745 assert(Slot != ~0U && "Attribute set inconsistency!");
747 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
749 if (I->isStringAttribute())
752 if (I->getKindAsEnum() == Attribute::NoReturn ||
753 I->getKindAsEnum() == Attribute::NoUnwind ||
754 I->getKindAsEnum() == Attribute::NoInline ||
755 I->getKindAsEnum() == Attribute::AlwaysInline ||
756 I->getKindAsEnum() == Attribute::OptimizeForSize ||
757 I->getKindAsEnum() == Attribute::StackProtect ||
758 I->getKindAsEnum() == Attribute::StackProtectReq ||
759 I->getKindAsEnum() == Attribute::StackProtectStrong ||
760 I->getKindAsEnum() == Attribute::NoRedZone ||
761 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
762 I->getKindAsEnum() == Attribute::Naked ||
763 I->getKindAsEnum() == Attribute::InlineHint ||
764 I->getKindAsEnum() == Attribute::StackAlignment ||
765 I->getKindAsEnum() == Attribute::UWTable ||
766 I->getKindAsEnum() == Attribute::NonLazyBind ||
767 I->getKindAsEnum() == Attribute::ReturnsTwice ||
768 I->getKindAsEnum() == Attribute::SanitizeAddress ||
769 I->getKindAsEnum() == Attribute::SanitizeThread ||
770 I->getKindAsEnum() == Attribute::SanitizeMemory ||
771 I->getKindAsEnum() == Attribute::MinSize ||
772 I->getKindAsEnum() == Attribute::NoDuplicate ||
773 I->getKindAsEnum() == Attribute::Builtin ||
774 I->getKindAsEnum() == Attribute::NoBuiltin ||
775 I->getKindAsEnum() == Attribute::Cold ||
776 I->getKindAsEnum() == Attribute::OptimizeNone ||
777 I->getKindAsEnum() == Attribute::JumpTable) {
779 CheckFailed("Attribute '" + I->getAsString() +
780 "' only applies to functions!", V);
783 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
784 I->getKindAsEnum() == Attribute::ReadNone) {
786 CheckFailed("Attribute '" + I->getAsString() +
787 "' does not apply to function returns");
790 } else if (isFunction) {
791 CheckFailed("Attribute '" + I->getAsString() +
792 "' does not apply to functions!", V);
798 // VerifyParameterAttrs - Check the given attributes for an argument or return
799 // value of the specified type. The value V is printed in error messages.
800 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
801 bool isReturnValue, const Value *V) {
802 if (!Attrs.hasAttributes(Idx))
805 VerifyAttributeTypes(Attrs, Idx, false, V);
808 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
809 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
810 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
811 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
812 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
813 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
814 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
815 "'returned' do not apply to return values!", V);
817 // Check for mutually incompatible attributes. Only inreg is compatible with
819 unsigned AttrCount = 0;
820 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
821 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
822 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
823 Attrs.hasAttribute(Idx, Attribute::InReg);
824 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
825 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
826 "and 'sret' are incompatible!", V);
828 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
829 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
830 "'inalloca and readonly' are incompatible!", V);
832 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
833 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
834 "'sret and returned' are incompatible!", V);
836 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
837 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
838 "'zeroext and signext' are incompatible!", V);
840 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
841 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
842 "'readnone and readonly' are incompatible!", V);
844 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
845 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
846 "'noinline and alwaysinline' are incompatible!", V);
848 Assert1(!AttrBuilder(Attrs, Idx).
849 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
850 "Wrong types for attribute: " +
851 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
853 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
854 if (!PTy->getElementType()->isSized()) {
855 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
856 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
857 "Attributes 'byval' and 'inalloca' do not support unsized types!",
861 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
862 "Attribute 'byval' only applies to parameters with pointer type!",
867 // VerifyFunctionAttrs - Check parameter attributes against a function type.
868 // The value V is printed in error messages.
869 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
874 bool SawNest = false;
875 bool SawReturned = false;
876 bool SawSRet = false;
878 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
879 unsigned Idx = Attrs.getSlotIndex(i);
883 Ty = FT->getReturnType();
884 else if (Idx-1 < FT->getNumParams())
885 Ty = FT->getParamType(Idx-1);
887 break; // VarArgs attributes, verified elsewhere.
889 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
894 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
895 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
899 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
900 Assert1(!SawReturned, "More than one parameter has attribute returned!",
902 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
903 "argument and return types for 'returned' attribute", V);
907 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
908 Assert1(!SawSRet, "Cannot have multiple 'sret' parameters!", V);
909 Assert1(Idx == 1 || Idx == 2,
910 "Attribute 'sret' is not on first or second parameter!", V);
914 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
915 Assert1(Idx == FT->getNumParams(),
916 "inalloca isn't on the last parameter!", V);
920 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
923 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
925 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
926 Attribute::ReadNone) &&
927 Attrs.hasAttribute(AttributeSet::FunctionIndex,
928 Attribute::ReadOnly)),
929 "Attributes 'readnone and readonly' are incompatible!", V);
931 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
932 Attribute::NoInline) &&
933 Attrs.hasAttribute(AttributeSet::FunctionIndex,
934 Attribute::AlwaysInline)),
935 "Attributes 'noinline and alwaysinline' are incompatible!", V);
937 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
938 Attribute::OptimizeNone)) {
939 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
940 Attribute::NoInline),
941 "Attribute 'optnone' requires 'noinline'!", V);
943 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
944 Attribute::OptimizeForSize),
945 "Attributes 'optsize and optnone' are incompatible!", V);
947 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
949 "Attributes 'minsize and optnone' are incompatible!", V);
952 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
953 Attribute::JumpTable)) {
954 const GlobalValue *GV = cast<GlobalValue>(V);
955 Assert1(GV->hasUnnamedAddr(),
956 "Attribute 'jumptable' requires 'unnamed_addr'", V);
961 void Verifier::VerifyBitcastType(const Value *V, Type *DestTy, Type *SrcTy) {
962 // Get the size of the types in bits, we'll need this later
963 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
964 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
966 // BitCast implies a no-op cast of type only. No bits change.
967 // However, you can't cast pointers to anything but pointers.
968 Assert1(SrcTy->isPointerTy() == DestTy->isPointerTy(),
969 "Bitcast requires both operands to be pointer or neither", V);
970 Assert1(SrcBitSize == DestBitSize,
971 "Bitcast requires types of same width", V);
973 // Disallow aggregates.
974 Assert1(!SrcTy->isAggregateType(),
975 "Bitcast operand must not be aggregate", V);
976 Assert1(!DestTy->isAggregateType(),
977 "Bitcast type must not be aggregate", V);
979 // Without datalayout, assume all address spaces are the same size.
980 // Don't check if both types are not pointers.
981 // Skip casts between scalars and vectors.
983 !SrcTy->isPtrOrPtrVectorTy() ||
984 !DestTy->isPtrOrPtrVectorTy() ||
985 SrcTy->isVectorTy() != DestTy->isVectorTy()) {
989 unsigned SrcAS = SrcTy->getPointerAddressSpace();
990 unsigned DstAS = DestTy->getPointerAddressSpace();
992 Assert1(SrcAS == DstAS,
993 "Bitcasts between pointers of different address spaces is not legal."
994 "Use AddrSpaceCast instead.", V);
997 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
998 if (CE->getOpcode() == Instruction::BitCast) {
999 Type *SrcTy = CE->getOperand(0)->getType();
1000 Type *DstTy = CE->getType();
1001 VerifyBitcastType(CE, DstTy, SrcTy);
1005 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1006 if (Attrs.getNumSlots() == 0)
1009 unsigned LastSlot = Attrs.getNumSlots() - 1;
1010 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1011 if (LastIndex <= Params
1012 || (LastIndex == AttributeSet::FunctionIndex
1013 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1019 // visitFunction - Verify that a function is ok.
1021 void Verifier::visitFunction(const Function &F) {
1022 // Check function arguments.
1023 FunctionType *FT = F.getFunctionType();
1024 unsigned NumArgs = F.arg_size();
1026 Assert1(Context == &F.getContext(),
1027 "Function context does not match Module context!", &F);
1029 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1030 Assert2(FT->getNumParams() == NumArgs,
1031 "# formal arguments must match # of arguments for function type!",
1033 Assert1(F.getReturnType()->isFirstClassType() ||
1034 F.getReturnType()->isVoidTy() ||
1035 F.getReturnType()->isStructTy(),
1036 "Functions cannot return aggregate values!", &F);
1038 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1039 "Invalid struct return type!", &F);
1041 AttributeSet Attrs = F.getAttributes();
1043 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1044 "Attribute after last parameter!", &F);
1046 // Check function attributes.
1047 VerifyFunctionAttrs(FT, Attrs, &F);
1049 // On function declarations/definitions, we do not support the builtin
1050 // attribute. We do not check this in VerifyFunctionAttrs since that is
1051 // checking for Attributes that can/can not ever be on functions.
1052 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1053 Attribute::Builtin),
1054 "Attribute 'builtin' can only be applied to a callsite.", &F);
1056 // Check that this function meets the restrictions on this calling convention.
1057 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
1058 // restrictions can be lifted.
1059 switch (F.getCallingConv()) {
1061 case CallingConv::C:
1063 case CallingConv::Fast:
1064 case CallingConv::Cold:
1065 case CallingConv::Intel_OCL_BI:
1066 case CallingConv::PTX_Kernel:
1067 case CallingConv::PTX_Device:
1068 Assert1(!F.isVarArg(), "Calling convention does not support varargs or "
1069 "perfect forwarding!", &F);
1073 bool isLLVMdotName = F.getName().size() >= 5 &&
1074 F.getName().substr(0, 5) == "llvm.";
1076 // Check that the argument values match the function type for this function...
1078 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1080 Assert2(I->getType() == FT->getParamType(i),
1081 "Argument value does not match function argument type!",
1082 I, FT->getParamType(i));
1083 Assert1(I->getType()->isFirstClassType(),
1084 "Function arguments must have first-class types!", I);
1086 Assert2(!I->getType()->isMetadataTy(),
1087 "Function takes metadata but isn't an intrinsic", I, &F);
1090 if (F.isMaterializable()) {
1091 // Function has a body somewhere we can't see.
1092 } else if (F.isDeclaration()) {
1093 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1094 "invalid linkage type for function declaration", &F);
1096 // Verify that this function (which has a body) is not named "llvm.*". It
1097 // is not legal to define intrinsics.
1098 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1100 // Check the entry node
1101 const BasicBlock *Entry = &F.getEntryBlock();
1102 Assert1(pred_begin(Entry) == pred_end(Entry),
1103 "Entry block to function must not have predecessors!", Entry);
1105 // The address of the entry block cannot be taken, unless it is dead.
1106 if (Entry->hasAddressTaken()) {
1107 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1108 "blockaddress may not be used with the entry block!", Entry);
1112 // If this function is actually an intrinsic, verify that it is only used in
1113 // direct call/invokes, never having its "address taken".
1114 if (F.getIntrinsicID()) {
1116 if (F.hasAddressTaken(&U))
1117 Assert1(0, "Invalid user of intrinsic instruction!", U);
1120 Assert1(!F.hasDLLImportStorageClass() ||
1121 (F.isDeclaration() && F.hasExternalLinkage()) ||
1122 F.hasAvailableExternallyLinkage(),
1123 "Function is marked as dllimport, but not external.", &F);
1126 // verifyBasicBlock - Verify that a basic block is well formed...
1128 void Verifier::visitBasicBlock(BasicBlock &BB) {
1129 InstsInThisBlock.clear();
1131 // Ensure that basic blocks have terminators!
1132 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1134 // Check constraints that this basic block imposes on all of the PHI nodes in
1136 if (isa<PHINode>(BB.front())) {
1137 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1138 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1139 std::sort(Preds.begin(), Preds.end());
1141 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1142 // Ensure that PHI nodes have at least one entry!
1143 Assert1(PN->getNumIncomingValues() != 0,
1144 "PHI nodes must have at least one entry. If the block is dead, "
1145 "the PHI should be removed!", PN);
1146 Assert1(PN->getNumIncomingValues() == Preds.size(),
1147 "PHINode should have one entry for each predecessor of its "
1148 "parent basic block!", PN);
1150 // Get and sort all incoming values in the PHI node...
1152 Values.reserve(PN->getNumIncomingValues());
1153 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1154 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1155 PN->getIncomingValue(i)));
1156 std::sort(Values.begin(), Values.end());
1158 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1159 // Check to make sure that if there is more than one entry for a
1160 // particular basic block in this PHI node, that the incoming values are
1163 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1164 Values[i].second == Values[i-1].second,
1165 "PHI node has multiple entries for the same basic block with "
1166 "different incoming values!", PN, Values[i].first,
1167 Values[i].second, Values[i-1].second);
1169 // Check to make sure that the predecessors and PHI node entries are
1171 Assert3(Values[i].first == Preds[i],
1172 "PHI node entries do not match predecessors!", PN,
1173 Values[i].first, Preds[i]);
1179 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1180 // Ensure that terminators only exist at the end of the basic block.
1181 Assert1(&I == I.getParent()->getTerminator(),
1182 "Terminator found in the middle of a basic block!", I.getParent());
1183 visitInstruction(I);
1186 void Verifier::visitBranchInst(BranchInst &BI) {
1187 if (BI.isConditional()) {
1188 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1189 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1191 visitTerminatorInst(BI);
1194 void Verifier::visitReturnInst(ReturnInst &RI) {
1195 Function *F = RI.getParent()->getParent();
1196 unsigned N = RI.getNumOperands();
1197 if (F->getReturnType()->isVoidTy())
1199 "Found return instr that returns non-void in Function of void "
1200 "return type!", &RI, F->getReturnType());
1202 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1203 "Function return type does not match operand "
1204 "type of return inst!", &RI, F->getReturnType());
1206 // Check to make sure that the return value has necessary properties for
1208 visitTerminatorInst(RI);
1211 void Verifier::visitSwitchInst(SwitchInst &SI) {
1212 // Check to make sure that all of the constants in the switch instruction
1213 // have the same type as the switched-on value.
1214 Type *SwitchTy = SI.getCondition()->getType();
1215 SmallPtrSet<ConstantInt*, 32> Constants;
1216 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1217 Assert1(i.getCaseValue()->getType() == SwitchTy,
1218 "Switch constants must all be same type as switch value!", &SI);
1219 Assert2(Constants.insert(i.getCaseValue()),
1220 "Duplicate integer as switch case", &SI, i.getCaseValue());
1223 visitTerminatorInst(SI);
1226 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1227 Assert1(BI.getAddress()->getType()->isPointerTy(),
1228 "Indirectbr operand must have pointer type!", &BI);
1229 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1230 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1231 "Indirectbr destinations must all have pointer type!", &BI);
1233 visitTerminatorInst(BI);
1236 void Verifier::visitSelectInst(SelectInst &SI) {
1237 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1239 "Invalid operands for select instruction!", &SI);
1241 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1242 "Select values must have same type as select instruction!", &SI);
1243 visitInstruction(SI);
1246 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1247 /// a pass, if any exist, it's an error.
1249 void Verifier::visitUserOp1(Instruction &I) {
1250 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1253 void Verifier::visitTruncInst(TruncInst &I) {
1254 // Get the source and destination types
1255 Type *SrcTy = I.getOperand(0)->getType();
1256 Type *DestTy = I.getType();
1258 // Get the size of the types in bits, we'll need this later
1259 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1260 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1262 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1263 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1264 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1265 "trunc source and destination must both be a vector or neither", &I);
1266 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1268 visitInstruction(I);
1271 void Verifier::visitZExtInst(ZExtInst &I) {
1272 // Get the source and destination types
1273 Type *SrcTy = I.getOperand(0)->getType();
1274 Type *DestTy = I.getType();
1276 // Get the size of the types in bits, we'll need this later
1277 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1278 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1279 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1280 "zext source and destination must both be a vector or neither", &I);
1281 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1282 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1284 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1286 visitInstruction(I);
1289 void Verifier::visitSExtInst(SExtInst &I) {
1290 // Get the source and destination types
1291 Type *SrcTy = I.getOperand(0)->getType();
1292 Type *DestTy = I.getType();
1294 // Get the size of the types in bits, we'll need this later
1295 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1296 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1298 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1299 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1300 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1301 "sext source and destination must both be a vector or neither", &I);
1302 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1304 visitInstruction(I);
1307 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1308 // Get the source and destination types
1309 Type *SrcTy = I.getOperand(0)->getType();
1310 Type *DestTy = I.getType();
1311 // Get the size of the types in bits, we'll need this later
1312 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1313 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1315 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1316 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1317 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1318 "fptrunc source and destination must both be a vector or neither",&I);
1319 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1321 visitInstruction(I);
1324 void Verifier::visitFPExtInst(FPExtInst &I) {
1325 // Get the source and destination types
1326 Type *SrcTy = I.getOperand(0)->getType();
1327 Type *DestTy = I.getType();
1329 // Get the size of the types in bits, we'll need this later
1330 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1331 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1333 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1334 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1335 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1336 "fpext source and destination must both be a vector or neither", &I);
1337 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1339 visitInstruction(I);
1342 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1343 // Get the source and destination types
1344 Type *SrcTy = I.getOperand(0)->getType();
1345 Type *DestTy = I.getType();
1347 bool SrcVec = SrcTy->isVectorTy();
1348 bool DstVec = DestTy->isVectorTy();
1350 Assert1(SrcVec == DstVec,
1351 "UIToFP source and dest must both be vector or scalar", &I);
1352 Assert1(SrcTy->isIntOrIntVectorTy(),
1353 "UIToFP source must be integer or integer vector", &I);
1354 Assert1(DestTy->isFPOrFPVectorTy(),
1355 "UIToFP result must be FP or FP vector", &I);
1357 if (SrcVec && DstVec)
1358 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1359 cast<VectorType>(DestTy)->getNumElements(),
1360 "UIToFP source and dest vector length mismatch", &I);
1362 visitInstruction(I);
1365 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1366 // Get the source and destination types
1367 Type *SrcTy = I.getOperand(0)->getType();
1368 Type *DestTy = I.getType();
1370 bool SrcVec = SrcTy->isVectorTy();
1371 bool DstVec = DestTy->isVectorTy();
1373 Assert1(SrcVec == DstVec,
1374 "SIToFP source and dest must both be vector or scalar", &I);
1375 Assert1(SrcTy->isIntOrIntVectorTy(),
1376 "SIToFP source must be integer or integer vector", &I);
1377 Assert1(DestTy->isFPOrFPVectorTy(),
1378 "SIToFP result must be FP or FP vector", &I);
1380 if (SrcVec && DstVec)
1381 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1382 cast<VectorType>(DestTy)->getNumElements(),
1383 "SIToFP source and dest vector length mismatch", &I);
1385 visitInstruction(I);
1388 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1389 // Get the source and destination types
1390 Type *SrcTy = I.getOperand(0)->getType();
1391 Type *DestTy = I.getType();
1393 bool SrcVec = SrcTy->isVectorTy();
1394 bool DstVec = DestTy->isVectorTy();
1396 Assert1(SrcVec == DstVec,
1397 "FPToUI source and dest must both be vector or scalar", &I);
1398 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1400 Assert1(DestTy->isIntOrIntVectorTy(),
1401 "FPToUI result must be integer or integer vector", &I);
1403 if (SrcVec && DstVec)
1404 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1405 cast<VectorType>(DestTy)->getNumElements(),
1406 "FPToUI source and dest vector length mismatch", &I);
1408 visitInstruction(I);
1411 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1412 // Get the source and destination types
1413 Type *SrcTy = I.getOperand(0)->getType();
1414 Type *DestTy = I.getType();
1416 bool SrcVec = SrcTy->isVectorTy();
1417 bool DstVec = DestTy->isVectorTy();
1419 Assert1(SrcVec == DstVec,
1420 "FPToSI source and dest must both be vector or scalar", &I);
1421 Assert1(SrcTy->isFPOrFPVectorTy(),
1422 "FPToSI source must be FP or FP vector", &I);
1423 Assert1(DestTy->isIntOrIntVectorTy(),
1424 "FPToSI result must be integer or integer vector", &I);
1426 if (SrcVec && DstVec)
1427 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1428 cast<VectorType>(DestTy)->getNumElements(),
1429 "FPToSI source and dest vector length mismatch", &I);
1431 visitInstruction(I);
1434 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1435 // Get the source and destination types
1436 Type *SrcTy = I.getOperand(0)->getType();
1437 Type *DestTy = I.getType();
1439 Assert1(SrcTy->getScalarType()->isPointerTy(),
1440 "PtrToInt source must be pointer", &I);
1441 Assert1(DestTy->getScalarType()->isIntegerTy(),
1442 "PtrToInt result must be integral", &I);
1443 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1444 "PtrToInt type mismatch", &I);
1446 if (SrcTy->isVectorTy()) {
1447 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1448 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1449 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1450 "PtrToInt Vector width mismatch", &I);
1453 visitInstruction(I);
1456 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1457 // Get the source and destination types
1458 Type *SrcTy = I.getOperand(0)->getType();
1459 Type *DestTy = I.getType();
1461 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1462 "IntToPtr source must be an integral", &I);
1463 Assert1(DestTy->getScalarType()->isPointerTy(),
1464 "IntToPtr result must be a pointer",&I);
1465 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1466 "IntToPtr type mismatch", &I);
1467 if (SrcTy->isVectorTy()) {
1468 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1469 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1470 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1471 "IntToPtr Vector width mismatch", &I);
1473 visitInstruction(I);
1476 void Verifier::visitBitCastInst(BitCastInst &I) {
1477 Type *SrcTy = I.getOperand(0)->getType();
1478 Type *DestTy = I.getType();
1479 VerifyBitcastType(&I, DestTy, SrcTy);
1480 visitInstruction(I);
1483 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1484 Type *SrcTy = I.getOperand(0)->getType();
1485 Type *DestTy = I.getType();
1487 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1488 "AddrSpaceCast source must be a pointer", &I);
1489 Assert1(DestTy->isPtrOrPtrVectorTy(),
1490 "AddrSpaceCast result must be a pointer", &I);
1491 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1492 "AddrSpaceCast must be between different address spaces", &I);
1493 if (SrcTy->isVectorTy())
1494 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1495 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1496 visitInstruction(I);
1499 /// visitPHINode - Ensure that a PHI node is well formed.
1501 void Verifier::visitPHINode(PHINode &PN) {
1502 // Ensure that the PHI nodes are all grouped together at the top of the block.
1503 // This can be tested by checking whether the instruction before this is
1504 // either nonexistent (because this is begin()) or is a PHI node. If not,
1505 // then there is some other instruction before a PHI.
1506 Assert2(&PN == &PN.getParent()->front() ||
1507 isa<PHINode>(--BasicBlock::iterator(&PN)),
1508 "PHI nodes not grouped at top of basic block!",
1509 &PN, PN.getParent());
1511 // Check that all of the values of the PHI node have the same type as the
1512 // result, and that the incoming blocks are really basic blocks.
1513 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1514 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1515 "PHI node operands are not the same type as the result!", &PN);
1518 // All other PHI node constraints are checked in the visitBasicBlock method.
1520 visitInstruction(PN);
1523 void Verifier::VerifyCallSite(CallSite CS) {
1524 Instruction *I = CS.getInstruction();
1526 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1527 "Called function must be a pointer!", I);
1528 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1530 Assert1(FPTy->getElementType()->isFunctionTy(),
1531 "Called function is not pointer to function type!", I);
1532 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1534 // Verify that the correct number of arguments are being passed
1535 if (FTy->isVarArg())
1536 Assert1(CS.arg_size() >= FTy->getNumParams(),
1537 "Called function requires more parameters than were provided!",I);
1539 Assert1(CS.arg_size() == FTy->getNumParams(),
1540 "Incorrect number of arguments passed to called function!", I);
1542 // Verify that all arguments to the call match the function type.
1543 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1544 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1545 "Call parameter type does not match function signature!",
1546 CS.getArgument(i), FTy->getParamType(i), I);
1548 AttributeSet Attrs = CS.getAttributes();
1550 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1551 "Attribute after last parameter!", I);
1553 // Verify call attributes.
1554 VerifyFunctionAttrs(FTy, Attrs, I);
1556 // Conservatively check the inalloca argument.
1557 // We have a bug if we can find that there is an underlying alloca without
1559 if (CS.hasInAllocaArgument()) {
1560 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
1561 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
1562 Assert2(AI->isUsedWithInAlloca(),
1563 "inalloca argument for call has mismatched alloca", AI, I);
1566 if (FTy->isVarArg()) {
1567 // FIXME? is 'nest' even legal here?
1568 bool SawNest = false;
1569 bool SawReturned = false;
1571 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1572 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1574 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1578 // Check attributes on the varargs part.
1579 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1580 Type *Ty = CS.getArgument(Idx-1)->getType();
1581 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1583 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1584 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1588 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1589 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1591 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1592 "Incompatible argument and return types for 'returned' "
1597 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1598 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1600 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1601 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1606 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1607 if (CS.getCalledFunction() == nullptr ||
1608 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1609 for (FunctionType::param_iterator PI = FTy->param_begin(),
1610 PE = FTy->param_end(); PI != PE; ++PI)
1611 Assert1(!(*PI)->isMetadataTy(),
1612 "Function has metadata parameter but isn't an intrinsic", I);
1615 visitInstruction(*I);
1618 /// Two types are "congruent" if they are identical, or if they are both pointer
1619 /// types with different pointee types and the same address space.
1620 static bool isTypeCongruent(Type *L, Type *R) {
1623 PointerType *PL = dyn_cast<PointerType>(L);
1624 PointerType *PR = dyn_cast<PointerType>(R);
1627 return PL->getAddressSpace() == PR->getAddressSpace();
1630 static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
1631 static const Attribute::AttrKind ABIAttrs[] = {
1632 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
1633 Attribute::InReg, Attribute::Returned};
1635 for (auto AK : ABIAttrs) {
1636 if (Attrs.hasAttribute(I + 1, AK))
1637 Copy.addAttribute(AK);
1639 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
1640 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
1644 void Verifier::verifyMustTailCall(CallInst &CI) {
1645 Assert1(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI);
1647 // - The caller and callee prototypes must match. Pointer types of
1648 // parameters or return types may differ in pointee type, but not
1650 Function *F = CI.getParent()->getParent();
1651 auto GetFnTy = [](Value *V) {
1652 return cast<FunctionType>(
1653 cast<PointerType>(V->getType())->getElementType());
1655 FunctionType *CallerTy = GetFnTy(F);
1656 FunctionType *CalleeTy = GetFnTy(CI.getCalledValue());
1657 Assert1(CallerTy->getNumParams() == CalleeTy->getNumParams(),
1658 "cannot guarantee tail call due to mismatched parameter counts", &CI);
1659 Assert1(CallerTy->isVarArg() == CalleeTy->isVarArg(),
1660 "cannot guarantee tail call due to mismatched varargs", &CI);
1661 Assert1(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),
1662 "cannot guarantee tail call due to mismatched return types", &CI);
1663 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1665 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),
1666 "cannot guarantee tail call due to mismatched parameter types", &CI);
1669 // - The calling conventions of the caller and callee must match.
1670 Assert1(F->getCallingConv() == CI.getCallingConv(),
1671 "cannot guarantee tail call due to mismatched calling conv", &CI);
1673 // - All ABI-impacting function attributes, such as sret, byval, inreg,
1674 // returned, and inalloca, must match.
1675 AttributeSet CallerAttrs = F->getAttributes();
1676 AttributeSet CalleeAttrs = CI.getAttributes();
1677 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1678 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
1679 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
1680 Assert2(CallerABIAttrs == CalleeABIAttrs,
1681 "cannot guarantee tail call due to mismatched ABI impacting "
1682 "function attributes", &CI, CI.getOperand(I));
1685 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
1686 // or a pointer bitcast followed by a ret instruction.
1687 // - The ret instruction must return the (possibly bitcasted) value
1688 // produced by the call or void.
1689 Value *RetVal = &CI;
1690 Instruction *Next = CI.getNextNode();
1692 // Handle the optional bitcast.
1693 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
1694 Assert1(BI->getOperand(0) == RetVal,
1695 "bitcast following musttail call must use the call", BI);
1697 Next = BI->getNextNode();
1700 // Check the return.
1701 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
1702 Assert1(Ret, "musttail call must be precede a ret with an optional bitcast",
1704 Assert1(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,
1705 "musttail call result must be returned", Ret);
1708 void Verifier::visitCallInst(CallInst &CI) {
1709 VerifyCallSite(&CI);
1711 if (CI.isMustTailCall())
1712 verifyMustTailCall(CI);
1714 if (Function *F = CI.getCalledFunction())
1715 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1716 visitIntrinsicFunctionCall(ID, CI);
1719 void Verifier::visitInvokeInst(InvokeInst &II) {
1720 VerifyCallSite(&II);
1722 // Verify that there is a landingpad instruction as the first non-PHI
1723 // instruction of the 'unwind' destination.
1724 Assert1(II.getUnwindDest()->isLandingPad(),
1725 "The unwind destination does not have a landingpad instruction!",&II);
1727 visitTerminatorInst(II);
1730 /// visitBinaryOperator - Check that both arguments to the binary operator are
1731 /// of the same type!
1733 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1734 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1735 "Both operands to a binary operator are not of the same type!", &B);
1737 switch (B.getOpcode()) {
1738 // Check that integer arithmetic operators are only used with
1739 // integral operands.
1740 case Instruction::Add:
1741 case Instruction::Sub:
1742 case Instruction::Mul:
1743 case Instruction::SDiv:
1744 case Instruction::UDiv:
1745 case Instruction::SRem:
1746 case Instruction::URem:
1747 Assert1(B.getType()->isIntOrIntVectorTy(),
1748 "Integer arithmetic operators only work with integral types!", &B);
1749 Assert1(B.getType() == B.getOperand(0)->getType(),
1750 "Integer arithmetic operators must have same type "
1751 "for operands and result!", &B);
1753 // Check that floating-point arithmetic operators are only used with
1754 // floating-point operands.
1755 case Instruction::FAdd:
1756 case Instruction::FSub:
1757 case Instruction::FMul:
1758 case Instruction::FDiv:
1759 case Instruction::FRem:
1760 Assert1(B.getType()->isFPOrFPVectorTy(),
1761 "Floating-point arithmetic operators only work with "
1762 "floating-point types!", &B);
1763 Assert1(B.getType() == B.getOperand(0)->getType(),
1764 "Floating-point arithmetic operators must have same type "
1765 "for operands and result!", &B);
1767 // Check that logical operators are only used with integral operands.
1768 case Instruction::And:
1769 case Instruction::Or:
1770 case Instruction::Xor:
1771 Assert1(B.getType()->isIntOrIntVectorTy(),
1772 "Logical operators only work with integral types!", &B);
1773 Assert1(B.getType() == B.getOperand(0)->getType(),
1774 "Logical operators must have same type for operands and result!",
1777 case Instruction::Shl:
1778 case Instruction::LShr:
1779 case Instruction::AShr:
1780 Assert1(B.getType()->isIntOrIntVectorTy(),
1781 "Shifts only work with integral types!", &B);
1782 Assert1(B.getType() == B.getOperand(0)->getType(),
1783 "Shift return type must be same as operands!", &B);
1786 llvm_unreachable("Unknown BinaryOperator opcode!");
1789 visitInstruction(B);
1792 void Verifier::visitICmpInst(ICmpInst &IC) {
1793 // Check that the operands are the same type
1794 Type *Op0Ty = IC.getOperand(0)->getType();
1795 Type *Op1Ty = IC.getOperand(1)->getType();
1796 Assert1(Op0Ty == Op1Ty,
1797 "Both operands to ICmp instruction are not of the same type!", &IC);
1798 // Check that the operands are the right type
1799 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
1800 "Invalid operand types for ICmp instruction", &IC);
1801 // Check that the predicate is valid.
1802 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1803 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1804 "Invalid predicate in ICmp instruction!", &IC);
1806 visitInstruction(IC);
1809 void Verifier::visitFCmpInst(FCmpInst &FC) {
1810 // Check that the operands are the same type
1811 Type *Op0Ty = FC.getOperand(0)->getType();
1812 Type *Op1Ty = FC.getOperand(1)->getType();
1813 Assert1(Op0Ty == Op1Ty,
1814 "Both operands to FCmp instruction are not of the same type!", &FC);
1815 // Check that the operands are the right type
1816 Assert1(Op0Ty->isFPOrFPVectorTy(),
1817 "Invalid operand types for FCmp instruction", &FC);
1818 // Check that the predicate is valid.
1819 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1820 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1821 "Invalid predicate in FCmp instruction!", &FC);
1823 visitInstruction(FC);
1826 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1827 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1829 "Invalid extractelement operands!", &EI);
1830 visitInstruction(EI);
1833 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1834 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1837 "Invalid insertelement operands!", &IE);
1838 visitInstruction(IE);
1841 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1842 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1844 "Invalid shufflevector operands!", &SV);
1845 visitInstruction(SV);
1848 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1849 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
1851 Assert1(isa<PointerType>(TargetTy),
1852 "GEP base pointer is not a vector or a vector of pointers", &GEP);
1853 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
1854 "GEP into unsized type!", &GEP);
1855 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
1856 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
1859 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1861 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
1862 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1864 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
1865 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
1866 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
1868 if (GEP.getPointerOperandType()->isVectorTy()) {
1869 // Additional checks for vector GEPs.
1870 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
1871 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
1872 "Vector GEP result width doesn't match operand's", &GEP);
1873 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1874 Type *IndexTy = Idxs[i]->getType();
1875 Assert1(IndexTy->isVectorTy(),
1876 "Vector GEP must have vector indices!", &GEP);
1877 unsigned IndexWidth = IndexTy->getVectorNumElements();
1878 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
1881 visitInstruction(GEP);
1884 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
1885 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
1888 void Verifier::visitLoadInst(LoadInst &LI) {
1889 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1890 Assert1(PTy, "Load operand must be a pointer.", &LI);
1891 Type *ElTy = PTy->getElementType();
1892 Assert2(ElTy == LI.getType(),
1893 "Load result type does not match pointer operand type!", &LI, ElTy);
1894 Assert1(LI.getAlignment() <= Value::MaximumAlignment,
1895 "huge alignment values are unsupported", &LI);
1896 if (LI.isAtomic()) {
1897 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
1898 "Load cannot have Release ordering", &LI);
1899 Assert1(LI.getAlignment() != 0,
1900 "Atomic load must specify explicit alignment", &LI);
1901 if (!ElTy->isPointerTy()) {
1902 Assert2(ElTy->isIntegerTy(),
1903 "atomic load operand must have integer type!",
1905 unsigned Size = ElTy->getPrimitiveSizeInBits();
1906 Assert2(Size >= 8 && !(Size & (Size - 1)),
1907 "atomic load operand must be power-of-two byte-sized integer",
1911 Assert1(LI.getSynchScope() == CrossThread,
1912 "Non-atomic load cannot have SynchronizationScope specified", &LI);
1915 if (MDNode *Range = LI.getMetadata(LLVMContext::MD_range)) {
1916 unsigned NumOperands = Range->getNumOperands();
1917 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
1918 unsigned NumRanges = NumOperands / 2;
1919 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
1921 ConstantRange LastRange(1); // Dummy initial value
1922 for (unsigned i = 0; i < NumRanges; ++i) {
1923 ConstantInt *Low = dyn_cast<ConstantInt>(Range->getOperand(2*i));
1924 Assert1(Low, "The lower limit must be an integer!", Low);
1925 ConstantInt *High = dyn_cast<ConstantInt>(Range->getOperand(2*i + 1));
1926 Assert1(High, "The upper limit must be an integer!", High);
1927 Assert1(High->getType() == Low->getType() &&
1928 High->getType() == ElTy, "Range types must match load type!",
1931 APInt HighV = High->getValue();
1932 APInt LowV = Low->getValue();
1933 ConstantRange CurRange(LowV, HighV);
1934 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
1935 "Range must not be empty!", Range);
1937 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
1938 "Intervals are overlapping", Range);
1939 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
1941 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
1944 LastRange = ConstantRange(LowV, HighV);
1946 if (NumRanges > 2) {
1948 dyn_cast<ConstantInt>(Range->getOperand(0))->getValue();
1950 dyn_cast<ConstantInt>(Range->getOperand(1))->getValue();
1951 ConstantRange FirstRange(FirstLow, FirstHigh);
1952 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
1953 "Intervals are overlapping", Range);
1954 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
1961 visitInstruction(LI);
1964 void Verifier::visitStoreInst(StoreInst &SI) {
1965 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1966 Assert1(PTy, "Store operand must be a pointer.", &SI);
1967 Type *ElTy = PTy->getElementType();
1968 Assert2(ElTy == SI.getOperand(0)->getType(),
1969 "Stored value type does not match pointer operand type!",
1971 Assert1(SI.getAlignment() <= Value::MaximumAlignment,
1972 "huge alignment values are unsupported", &SI);
1973 if (SI.isAtomic()) {
1974 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
1975 "Store cannot have Acquire ordering", &SI);
1976 Assert1(SI.getAlignment() != 0,
1977 "Atomic store must specify explicit alignment", &SI);
1978 if (!ElTy->isPointerTy()) {
1979 Assert2(ElTy->isIntegerTy(),
1980 "atomic store operand must have integer type!",
1982 unsigned Size = ElTy->getPrimitiveSizeInBits();
1983 Assert2(Size >= 8 && !(Size & (Size - 1)),
1984 "atomic store operand must be power-of-two byte-sized integer",
1988 Assert1(SI.getSynchScope() == CrossThread,
1989 "Non-atomic store cannot have SynchronizationScope specified", &SI);
1991 visitInstruction(SI);
1994 void Verifier::visitAllocaInst(AllocaInst &AI) {
1995 SmallPtrSet<const Type*, 4> Visited;
1996 PointerType *PTy = AI.getType();
1997 Assert1(PTy->getAddressSpace() == 0,
1998 "Allocation instruction pointer not in the generic address space!",
2000 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
2002 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
2003 "Alloca array size must have integer type", &AI);
2004 Assert1(AI.getAlignment() <= Value::MaximumAlignment,
2005 "huge alignment values are unsupported", &AI);
2007 visitInstruction(AI);
2010 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
2012 // FIXME: more conditions???
2013 Assert1(CXI.getSuccessOrdering() != NotAtomic,
2014 "cmpxchg instructions must be atomic.", &CXI);
2015 Assert1(CXI.getFailureOrdering() != NotAtomic,
2016 "cmpxchg instructions must be atomic.", &CXI);
2017 Assert1(CXI.getSuccessOrdering() != Unordered,
2018 "cmpxchg instructions cannot be unordered.", &CXI);
2019 Assert1(CXI.getFailureOrdering() != Unordered,
2020 "cmpxchg instructions cannot be unordered.", &CXI);
2021 Assert1(CXI.getSuccessOrdering() >= CXI.getFailureOrdering(),
2022 "cmpxchg instructions be at least as constrained on success as fail",
2024 Assert1(CXI.getFailureOrdering() != Release &&
2025 CXI.getFailureOrdering() != AcquireRelease,
2026 "cmpxchg failure ordering cannot include release semantics", &CXI);
2028 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
2029 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
2030 Type *ElTy = PTy->getElementType();
2031 Assert2(ElTy->isIntegerTy(),
2032 "cmpxchg operand must have integer type!",
2034 unsigned Size = ElTy->getPrimitiveSizeInBits();
2035 Assert2(Size >= 8 && !(Size & (Size - 1)),
2036 "cmpxchg operand must be power-of-two byte-sized integer",
2038 Assert2(ElTy == CXI.getOperand(1)->getType(),
2039 "Expected value type does not match pointer operand type!",
2041 Assert2(ElTy == CXI.getOperand(2)->getType(),
2042 "Stored value type does not match pointer operand type!",
2044 visitInstruction(CXI);
2047 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
2048 Assert1(RMWI.getOrdering() != NotAtomic,
2049 "atomicrmw instructions must be atomic.", &RMWI);
2050 Assert1(RMWI.getOrdering() != Unordered,
2051 "atomicrmw instructions cannot be unordered.", &RMWI);
2052 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
2053 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
2054 Type *ElTy = PTy->getElementType();
2055 Assert2(ElTy->isIntegerTy(),
2056 "atomicrmw operand must have integer type!",
2058 unsigned Size = ElTy->getPrimitiveSizeInBits();
2059 Assert2(Size >= 8 && !(Size & (Size - 1)),
2060 "atomicrmw operand must be power-of-two byte-sized integer",
2062 Assert2(ElTy == RMWI.getOperand(1)->getType(),
2063 "Argument value type does not match pointer operand type!",
2065 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
2066 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
2067 "Invalid binary operation!", &RMWI);
2068 visitInstruction(RMWI);
2071 void Verifier::visitFenceInst(FenceInst &FI) {
2072 const AtomicOrdering Ordering = FI.getOrdering();
2073 Assert1(Ordering == Acquire || Ordering == Release ||
2074 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
2075 "fence instructions may only have "
2076 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
2077 visitInstruction(FI);
2080 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
2081 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
2082 EVI.getIndices()) ==
2084 "Invalid ExtractValueInst operands!", &EVI);
2086 visitInstruction(EVI);
2089 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
2090 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
2091 IVI.getIndices()) ==
2092 IVI.getOperand(1)->getType(),
2093 "Invalid InsertValueInst operands!", &IVI);
2095 visitInstruction(IVI);
2098 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
2099 BasicBlock *BB = LPI.getParent();
2101 // The landingpad instruction is ill-formed if it doesn't have any clauses and
2103 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
2104 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
2106 // The landingpad instruction defines its parent as a landing pad block. The
2107 // landing pad block may be branched to only by the unwind edge of an invoke.
2108 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
2109 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
2110 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
2111 "Block containing LandingPadInst must be jumped to "
2112 "only by the unwind edge of an invoke.", &LPI);
2115 // The landingpad instruction must be the first non-PHI instruction in the
2117 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
2118 "LandingPadInst not the first non-PHI instruction in the block.",
2121 // The personality functions for all landingpad instructions within the same
2122 // function should match.
2124 Assert1(LPI.getPersonalityFn() == PersonalityFn,
2125 "Personality function doesn't match others in function", &LPI);
2126 PersonalityFn = LPI.getPersonalityFn();
2128 // All operands must be constants.
2129 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
2131 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
2132 Constant *Clause = LPI.getClause(i);
2133 if (LPI.isCatch(i)) {
2134 Assert1(isa<PointerType>(Clause->getType()),
2135 "Catch operand does not have pointer type!", &LPI);
2137 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
2138 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
2139 "Filter operand is not an array of constants!", &LPI);
2143 visitInstruction(LPI);
2146 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
2147 Instruction *Op = cast<Instruction>(I.getOperand(i));
2148 // If the we have an invalid invoke, don't try to compute the dominance.
2149 // We already reject it in the invoke specific checks and the dominance
2150 // computation doesn't handle multiple edges.
2151 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2152 if (II->getNormalDest() == II->getUnwindDest())
2156 const Use &U = I.getOperandUse(i);
2157 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
2158 "Instruction does not dominate all uses!", Op, &I);
2161 /// verifyInstruction - Verify that an instruction is well formed.
2163 void Verifier::visitInstruction(Instruction &I) {
2164 BasicBlock *BB = I.getParent();
2165 Assert1(BB, "Instruction not embedded in basic block!", &I);
2167 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2168 for (User *U : I.users()) {
2169 Assert1(U != (User*)&I || !DT.isReachableFromEntry(BB),
2170 "Only PHI nodes may reference their own value!", &I);
2174 // Check that void typed values don't have names
2175 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2176 "Instruction has a name, but provides a void value!", &I);
2178 // Check that the return value of the instruction is either void or a legal
2180 Assert1(I.getType()->isVoidTy() ||
2181 I.getType()->isFirstClassType(),
2182 "Instruction returns a non-scalar type!", &I);
2184 // Check that the instruction doesn't produce metadata. Calls are already
2185 // checked against the callee type.
2186 Assert1(!I.getType()->isMetadataTy() ||
2187 isa<CallInst>(I) || isa<InvokeInst>(I),
2188 "Invalid use of metadata!", &I);
2190 // Check that all uses of the instruction, if they are instructions
2191 // themselves, actually have parent basic blocks. If the use is not an
2192 // instruction, it is an error!
2193 for (Use &U : I.uses()) {
2194 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
2195 Assert2(Used->getParent() != nullptr, "Instruction referencing"
2196 " instruction not embedded in a basic block!", &I, Used);
2198 CheckFailed("Use of instruction is not an instruction!", U);
2203 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2204 Assert1(I.getOperand(i) != nullptr, "Instruction has null operand!", &I);
2206 // Check to make sure that only first-class-values are operands to
2208 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2209 Assert1(0, "Instruction operands must be first-class values!", &I);
2212 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2213 // Check to make sure that the "address of" an intrinsic function is never
2215 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 : 0),
2216 "Cannot take the address of an intrinsic!", &I);
2217 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2218 F->getIntrinsicID() == Intrinsic::donothing,
2219 "Cannot invoke an intrinsinc other than donothing", &I);
2220 Assert1(F->getParent() == M, "Referencing function in another module!",
2222 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2223 Assert1(OpBB->getParent() == BB->getParent(),
2224 "Referring to a basic block in another function!", &I);
2225 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2226 Assert1(OpArg->getParent() == BB->getParent(),
2227 "Referring to an argument in another function!", &I);
2228 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2229 Assert1(GV->getParent() == M, "Referencing global in another module!",
2231 } else if (isa<Instruction>(I.getOperand(i))) {
2232 verifyDominatesUse(I, i);
2233 } else if (isa<InlineAsm>(I.getOperand(i))) {
2234 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2235 (i + 3 == e && isa<InvokeInst>(I)),
2236 "Cannot take the address of an inline asm!", &I);
2237 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2238 if (CE->getType()->isPtrOrPtrVectorTy()) {
2239 // If we have a ConstantExpr pointer, we need to see if it came from an
2240 // illegal bitcast (inttoptr <constant int> )
2241 SmallVector<const ConstantExpr *, 4> Stack;
2242 SmallPtrSet<const ConstantExpr *, 4> Visited;
2243 Stack.push_back(CE);
2245 while (!Stack.empty()) {
2246 const ConstantExpr *V = Stack.pop_back_val();
2247 if (!Visited.insert(V))
2250 VerifyConstantExprBitcastType(V);
2252 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2253 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2254 Stack.push_back(Op);
2261 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2262 Assert1(I.getType()->isFPOrFPVectorTy(),
2263 "fpmath requires a floating point result!", &I);
2264 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2265 Value *Op0 = MD->getOperand(0);
2266 if (ConstantFP *CFP0 = dyn_cast_or_null<ConstantFP>(Op0)) {
2267 APFloat Accuracy = CFP0->getValueAPF();
2268 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2269 "fpmath accuracy not a positive number!", &I);
2271 Assert1(false, "invalid fpmath accuracy!", &I);
2275 MDNode *MD = I.getMetadata(LLVMContext::MD_range);
2276 Assert1(!MD || isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),
2277 "Ranges are only for loads, calls and invokes!", &I);
2279 InstsInThisBlock.insert(&I);
2282 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2283 /// intrinsic argument or return value) matches the type constraints specified
2284 /// by the .td file (e.g. an "any integer" argument really is an integer).
2286 /// This return true on error but does not print a message.
2287 bool Verifier::VerifyIntrinsicType(Type *Ty,
2288 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2289 SmallVectorImpl<Type*> &ArgTys) {
2290 using namespace Intrinsic;
2292 // If we ran out of descriptors, there are too many arguments.
2293 if (Infos.empty()) return true;
2294 IITDescriptor D = Infos.front();
2295 Infos = Infos.slice(1);
2298 case IITDescriptor::Void: return !Ty->isVoidTy();
2299 case IITDescriptor::VarArg: return true;
2300 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2301 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2302 case IITDescriptor::Half: return !Ty->isHalfTy();
2303 case IITDescriptor::Float: return !Ty->isFloatTy();
2304 case IITDescriptor::Double: return !Ty->isDoubleTy();
2305 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2306 case IITDescriptor::Vector: {
2307 VectorType *VT = dyn_cast<VectorType>(Ty);
2308 return !VT || VT->getNumElements() != D.Vector_Width ||
2309 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2311 case IITDescriptor::Pointer: {
2312 PointerType *PT = dyn_cast<PointerType>(Ty);
2313 return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2314 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2317 case IITDescriptor::Struct: {
2318 StructType *ST = dyn_cast<StructType>(Ty);
2319 if (!ST || ST->getNumElements() != D.Struct_NumElements)
2322 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2323 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2328 case IITDescriptor::Argument:
2329 // Two cases here - If this is the second occurrence of an argument, verify
2330 // that the later instance matches the previous instance.
2331 if (D.getArgumentNumber() < ArgTys.size())
2332 return Ty != ArgTys[D.getArgumentNumber()];
2334 // Otherwise, if this is the first instance of an argument, record it and
2335 // verify the "Any" kind.
2336 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2337 ArgTys.push_back(Ty);
2339 switch (D.getArgumentKind()) {
2340 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2341 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2342 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2343 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2345 llvm_unreachable("all argument kinds not covered");
2347 case IITDescriptor::ExtendArgument: {
2348 // This may only be used when referring to a previous vector argument.
2349 if (D.getArgumentNumber() >= ArgTys.size())
2352 Type *NewTy = ArgTys[D.getArgumentNumber()];
2353 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2354 NewTy = VectorType::getExtendedElementVectorType(VTy);
2355 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2356 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2362 case IITDescriptor::TruncArgument: {
2363 // This may only be used when referring to a previous vector argument.
2364 if (D.getArgumentNumber() >= ArgTys.size())
2367 Type *NewTy = ArgTys[D.getArgumentNumber()];
2368 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2369 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2370 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2371 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
2377 case IITDescriptor::HalfVecArgument:
2378 // This may only be used when referring to a previous vector argument.
2379 return D.getArgumentNumber() >= ArgTys.size() ||
2380 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2381 VectorType::getHalfElementsVectorType(
2382 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2384 llvm_unreachable("unhandled");
2387 /// \brief Verify if the intrinsic has variable arguments.
2388 /// This method is intended to be called after all the fixed arguments have been
2391 /// This method returns true on error and does not print an error message.
2393 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2394 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2395 using namespace Intrinsic;
2397 // If there are no descriptors left, then it can't be a vararg.
2399 return isVarArg ? true : false;
2401 // There should be only one descriptor remaining at this point.
2402 if (Infos.size() != 1)
2405 // Check and verify the descriptor.
2406 IITDescriptor D = Infos.front();
2407 Infos = Infos.slice(1);
2408 if (D.Kind == IITDescriptor::VarArg)
2409 return isVarArg ? false : true;
2414 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2416 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2417 Function *IF = CI.getCalledFunction();
2418 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2421 // Verify that the intrinsic prototype lines up with what the .td files
2423 FunctionType *IFTy = IF->getFunctionType();
2424 bool IsVarArg = IFTy->isVarArg();
2426 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2427 getIntrinsicInfoTableEntries(ID, Table);
2428 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2430 SmallVector<Type *, 4> ArgTys;
2431 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2432 "Intrinsic has incorrect return type!", IF);
2433 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2434 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2435 "Intrinsic has incorrect argument type!", IF);
2437 // Verify if the intrinsic call matches the vararg property.
2439 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2440 "Intrinsic was not defined with variable arguments!", IF);
2442 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2443 "Callsite was not defined with variable arguments!", IF);
2445 // All descriptors should be absorbed by now.
2446 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2448 // Now that we have the intrinsic ID and the actual argument types (and we
2449 // know they are legal for the intrinsic!) get the intrinsic name through the
2450 // usual means. This allows us to verify the mangling of argument types into
2452 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
2453 Assert1(ExpectedName == IF->getName(),
2454 "Intrinsic name not mangled correctly for type arguments! "
2455 "Should be: " + ExpectedName, IF);
2457 // If the intrinsic takes MDNode arguments, verify that they are either global
2458 // or are local to *this* function.
2459 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2460 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
2461 visitMDNode(*MD, CI.getParent()->getParent());
2466 case Intrinsic::ctlz: // llvm.ctlz
2467 case Intrinsic::cttz: // llvm.cttz
2468 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2469 "is_zero_undef argument of bit counting intrinsics must be a "
2470 "constant int", &CI);
2472 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2473 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
2474 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2475 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
2476 Assert1(MD->getNumOperands() == 1,
2477 "invalid llvm.dbg.declare intrinsic call 2", &CI);
2479 case Intrinsic::memcpy:
2480 case Intrinsic::memmove:
2481 case Intrinsic::memset:
2482 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2483 "alignment argument of memory intrinsics must be a constant int",
2485 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2486 "isvolatile argument of memory intrinsics must be a constant int",
2489 case Intrinsic::gcroot:
2490 case Intrinsic::gcwrite:
2491 case Intrinsic::gcread:
2492 if (ID == Intrinsic::gcroot) {
2494 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2495 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2496 Assert1(isa<Constant>(CI.getArgOperand(1)),
2497 "llvm.gcroot parameter #2 must be a constant.", &CI);
2498 if (!AI->getType()->getElementType()->isPointerTy()) {
2499 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2500 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2501 "or argument #2 must be a non-null constant.", &CI);
2505 Assert1(CI.getParent()->getParent()->hasGC(),
2506 "Enclosing function does not use GC.", &CI);
2508 case Intrinsic::init_trampoline:
2509 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2510 "llvm.init_trampoline parameter #2 must resolve to a function.",
2513 case Intrinsic::prefetch:
2514 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2515 isa<ConstantInt>(CI.getArgOperand(2)) &&
2516 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2517 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2518 "invalid arguments to llvm.prefetch",
2521 case Intrinsic::stackprotector:
2522 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2523 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2526 case Intrinsic::lifetime_start:
2527 case Intrinsic::lifetime_end:
2528 case Intrinsic::invariant_start:
2529 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2530 "size argument of memory use markers must be a constant integer",
2533 case Intrinsic::invariant_end:
2534 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2535 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2540 void DebugInfoVerifier::verifyDebugInfo() {
2541 if (!VerifyDebugInfo)
2544 DebugInfoFinder Finder;
2545 Finder.processModule(*M);
2546 processInstructions(Finder);
2548 // Verify Debug Info.
2550 // NOTE: The loud braces are necessary for MSVC compatibility.
2551 for (DICompileUnit CU : Finder.compile_units()) {
2552 Assert1(CU.Verify(), "DICompileUnit does not Verify!", CU);
2554 for (DISubprogram S : Finder.subprograms()) {
2555 Assert1(S.Verify(), "DISubprogram does not Verify!", S);
2557 for (DIGlobalVariable GV : Finder.global_variables()) {
2558 Assert1(GV.Verify(), "DIGlobalVariable does not Verify!", GV);
2560 for (DIType T : Finder.types()) {
2561 Assert1(T.Verify(), "DIType does not Verify!", T);
2563 for (DIScope S : Finder.scopes()) {
2564 Assert1(S.Verify(), "DIScope does not Verify!", S);
2568 void DebugInfoVerifier::processInstructions(DebugInfoFinder &Finder) {
2569 for (const Function &F : *M)
2570 for (auto I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2571 if (MDNode *MD = I->getMetadata(LLVMContext::MD_dbg))
2572 Finder.processLocation(*M, DILocation(MD));
2573 if (const CallInst *CI = dyn_cast<CallInst>(&*I))
2574 processCallInst(Finder, *CI);
2578 void DebugInfoVerifier::processCallInst(DebugInfoFinder &Finder,
2579 const CallInst &CI) {
2580 if (Function *F = CI.getCalledFunction())
2581 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2583 case Intrinsic::dbg_declare:
2584 Finder.processDeclare(*M, cast<DbgDeclareInst>(&CI));
2586 case Intrinsic::dbg_value:
2587 Finder.processValue(*M, cast<DbgValueInst>(&CI));
2594 //===----------------------------------------------------------------------===//
2595 // Implement the public interfaces to this file...
2596 //===----------------------------------------------------------------------===//
2598 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
2599 Function &F = const_cast<Function &>(f);
2600 assert(!F.isDeclaration() && "Cannot verify external functions");
2602 raw_null_ostream NullStr;
2603 Verifier V(OS ? *OS : NullStr);
2605 // Note that this function's return value is inverted from what you would
2606 // expect of a function called "verify".
2607 return !V.verify(F);
2610 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
2611 raw_null_ostream NullStr;
2612 Verifier V(OS ? *OS : NullStr);
2614 bool Broken = false;
2615 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
2616 if (!I->isDeclaration())
2617 Broken |= !V.verify(*I);
2619 // Note that this function's return value is inverted from what you would
2620 // expect of a function called "verify".
2621 DebugInfoVerifier DIV(OS ? *OS : NullStr);
2622 return !V.verify(M) || !DIV.verify(M) || Broken;
2626 struct VerifierLegacyPass : public FunctionPass {
2632 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
2633 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2635 explicit VerifierLegacyPass(bool FatalErrors)
2636 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2637 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2640 bool runOnFunction(Function &F) override {
2641 if (!V.verify(F) && FatalErrors)
2642 report_fatal_error("Broken function found, compilation aborted!");
2647 bool doFinalization(Module &M) override {
2648 if (!V.verify(M) && FatalErrors)
2649 report_fatal_error("Broken module found, compilation aborted!");
2654 void getAnalysisUsage(AnalysisUsage &AU) const override {
2655 AU.setPreservesAll();
2658 struct DebugInfoVerifierLegacyPass : public ModulePass {
2661 DebugInfoVerifier V;
2664 DebugInfoVerifierLegacyPass() : ModulePass(ID), FatalErrors(true) {
2665 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2667 explicit DebugInfoVerifierLegacyPass(bool FatalErrors)
2668 : ModulePass(ID), V(dbgs()), FatalErrors(FatalErrors) {
2669 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
2672 bool runOnModule(Module &M) override {
2673 if (!V.verify(M) && FatalErrors)
2674 report_fatal_error("Broken debug info found, compilation aborted!");
2679 void getAnalysisUsage(AnalysisUsage &AU) const override {
2680 AU.setPreservesAll();
2685 char VerifierLegacyPass::ID = 0;
2686 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
2688 char DebugInfoVerifierLegacyPass::ID = 0;
2689 INITIALIZE_PASS(DebugInfoVerifierLegacyPass, "verify-di", "Debug Info Verifier",
2692 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
2693 return new VerifierLegacyPass(FatalErrors);
2696 ModulePass *llvm::createDebugInfoVerifierPass(bool FatalErrors) {
2697 return new DebugInfoVerifierLegacyPass(FatalErrors);
2700 PreservedAnalyses VerifierPass::run(Module *M) {
2701 if (verifyModule(*M, &dbgs()) && FatalErrors)
2702 report_fatal_error("Broken module found, compilation aborted!");
2704 return PreservedAnalyses::all();
2707 PreservedAnalyses VerifierPass::run(Function *F) {
2708 if (verifyFunction(*F, &dbgs()) && FatalErrors)
2709 report_fatal_error("Broken function found, compilation aborted!");
2711 return PreservedAnalyses::all();