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/IR/Statepoint.h"
72 #include "llvm/Pass.h"
73 #include "llvm/Support/CommandLine.h"
74 #include "llvm/Support/Debug.h"
75 #include "llvm/Support/ErrorHandling.h"
76 #include "llvm/Support/raw_ostream.h"
81 static cl::opt<bool> VerifyDebugInfo("verify-debug-info", cl::init(false));
84 struct VerifierSupport {
88 /// \brief Track the brokenness of the module while recursively visiting.
91 explicit VerifierSupport(raw_ostream &OS)
92 : OS(OS), M(nullptr), Broken(false) {}
94 void WriteValue(const Value *V) {
97 if (isa<Instruction>(V)) {
100 V->printAsOperand(OS, true, M);
105 void WriteMetadata(const Metadata *MD) {
108 MD->printAsOperand(OS, true, M);
112 void WriteType(Type *T) {
118 void WriteComdat(const Comdat *C) {
124 // CheckFailed - A check failed, so print out the condition and the message
125 // that failed. This provides a nice place to put a breakpoint if you want
126 // to see why something is not correct.
127 void CheckFailed(const Twine &Message, const Value *V1 = nullptr,
128 const Value *V2 = nullptr, const Value *V3 = nullptr,
129 const Value *V4 = nullptr) {
130 OS << Message.str() << "\n";
138 void CheckFailed(const Twine &Message, const Metadata *V1, const Metadata *V2,
139 const Metadata *V3 = nullptr, const Metadata *V4 = nullptr) {
140 OS << Message.str() << "\n";
148 void CheckFailed(const Twine &Message, const Metadata *V1,
149 const Value *V2 = nullptr) {
150 OS << Message.str() << "\n";
156 void CheckFailed(const Twine &Message, const Value *V1, Type *T2,
157 const Value *V3 = nullptr) {
158 OS << Message.str() << "\n";
165 void CheckFailed(const Twine &Message, Type *T1, Type *T2 = nullptr,
166 Type *T3 = nullptr) {
167 OS << Message.str() << "\n";
174 void CheckFailed(const Twine &Message, const Comdat *C) {
175 OS << Message.str() << "\n";
180 class Verifier : public InstVisitor<Verifier>, VerifierSupport {
181 friend class InstVisitor<Verifier>;
183 LLVMContext *Context;
186 /// \brief When verifying a basic block, keep track of all of the
187 /// instructions we have seen so far.
189 /// This allows us to do efficient dominance checks for the case when an
190 /// instruction has an operand that is an instruction in the same block.
191 SmallPtrSet<Instruction *, 16> InstsInThisBlock;
193 /// \brief Keep track of the metadata nodes that have been checked already.
194 SmallPtrSet<const Metadata *, 32> MDNodes;
196 /// \brief The personality function referenced by the LandingPadInsts.
197 /// All LandingPadInsts within the same function must use the same
198 /// personality function.
199 const Value *PersonalityFn;
201 /// \brief Whether we've seen a call to @llvm.frameallocate in this function
203 bool SawFrameAllocate;
206 explicit Verifier(raw_ostream &OS = dbgs())
207 : VerifierSupport(OS), Context(nullptr), PersonalityFn(nullptr),
208 SawFrameAllocate(false) {}
210 bool verify(const Function &F) {
212 Context = &M->getContext();
214 // First ensure the function is well-enough formed to compute dominance
217 OS << "Function '" << F.getName()
218 << "' does not contain an entry block!\n";
221 for (Function::const_iterator I = F.begin(), E = F.end(); I != E; ++I) {
222 if (I->empty() || !I->back().isTerminator()) {
223 OS << "Basic Block in function '" << F.getName()
224 << "' does not have terminator!\n";
225 I->printAsOperand(OS, true);
231 // Now directly compute a dominance tree. We don't rely on the pass
232 // manager to provide this as it isolates us from a potentially
233 // out-of-date dominator tree and makes it significantly more complex to
234 // run this code outside of a pass manager.
235 // FIXME: It's really gross that we have to cast away constness here.
236 DT.recalculate(const_cast<Function &>(F));
239 // FIXME: We strip const here because the inst visitor strips const.
240 visit(const_cast<Function &>(F));
241 InstsInThisBlock.clear();
242 PersonalityFn = nullptr;
243 SawFrameAllocate = false;
248 bool verify(const Module &M) {
250 Context = &M.getContext();
253 // Scan through, checking all of the external function's linkage now...
254 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I) {
255 visitGlobalValue(*I);
257 // Check to make sure function prototypes are okay.
258 if (I->isDeclaration())
262 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
264 visitGlobalVariable(*I);
266 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
268 visitGlobalAlias(*I);
270 for (Module::const_named_metadata_iterator I = M.named_metadata_begin(),
271 E = M.named_metadata_end();
273 visitNamedMDNode(*I);
275 for (const StringMapEntry<Comdat> &SMEC : M.getComdatSymbolTable())
276 visitComdat(SMEC.getValue());
279 visitModuleIdents(M);
285 // Verification methods...
286 void visitGlobalValue(const GlobalValue &GV);
287 void visitGlobalVariable(const GlobalVariable &GV);
288 void visitGlobalAlias(const GlobalAlias &GA);
289 void visitAliaseeSubExpr(const GlobalAlias &A, const Constant &C);
290 void visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias *> &Visited,
291 const GlobalAlias &A, const Constant &C);
292 void visitNamedMDNode(const NamedMDNode &NMD);
293 void visitMDNode(const MDNode &MD);
294 void visitMetadataAsValue(const MetadataAsValue &MD, Function *F);
295 void visitValueAsMetadata(const ValueAsMetadata &MD, Function *F);
296 void visitComdat(const Comdat &C);
297 void visitModuleIdents(const Module &M);
298 void visitModuleFlags(const Module &M);
299 void visitModuleFlag(const MDNode *Op,
300 DenseMap<const MDString *, const MDNode *> &SeenIDs,
301 SmallVectorImpl<const MDNode *> &Requirements);
302 void visitFunction(const Function &F);
303 void visitBasicBlock(BasicBlock &BB);
304 void visitRangeMetadata(Instruction& I, MDNode* Range, Type* Ty);
306 #define HANDLE_SPECIALIZED_MDNODE_LEAF(CLASS) void visit##CLASS(const CLASS &N);
307 #include "llvm/IR/Metadata.def"
309 // InstVisitor overrides...
310 using InstVisitor<Verifier>::visit;
311 void visit(Instruction &I);
313 void visitTruncInst(TruncInst &I);
314 void visitZExtInst(ZExtInst &I);
315 void visitSExtInst(SExtInst &I);
316 void visitFPTruncInst(FPTruncInst &I);
317 void visitFPExtInst(FPExtInst &I);
318 void visitFPToUIInst(FPToUIInst &I);
319 void visitFPToSIInst(FPToSIInst &I);
320 void visitUIToFPInst(UIToFPInst &I);
321 void visitSIToFPInst(SIToFPInst &I);
322 void visitIntToPtrInst(IntToPtrInst &I);
323 void visitPtrToIntInst(PtrToIntInst &I);
324 void visitBitCastInst(BitCastInst &I);
325 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
326 void visitPHINode(PHINode &PN);
327 void visitBinaryOperator(BinaryOperator &B);
328 void visitICmpInst(ICmpInst &IC);
329 void visitFCmpInst(FCmpInst &FC);
330 void visitExtractElementInst(ExtractElementInst &EI);
331 void visitInsertElementInst(InsertElementInst &EI);
332 void visitShuffleVectorInst(ShuffleVectorInst &EI);
333 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
334 void visitCallInst(CallInst &CI);
335 void visitInvokeInst(InvokeInst &II);
336 void visitGetElementPtrInst(GetElementPtrInst &GEP);
337 void visitLoadInst(LoadInst &LI);
338 void visitStoreInst(StoreInst &SI);
339 void verifyDominatesUse(Instruction &I, unsigned i);
340 void visitInstruction(Instruction &I);
341 void visitTerminatorInst(TerminatorInst &I);
342 void visitBranchInst(BranchInst &BI);
343 void visitReturnInst(ReturnInst &RI);
344 void visitSwitchInst(SwitchInst &SI);
345 void visitIndirectBrInst(IndirectBrInst &BI);
346 void visitSelectInst(SelectInst &SI);
347 void visitUserOp1(Instruction &I);
348 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
349 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
350 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
351 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
352 void visitFenceInst(FenceInst &FI);
353 void visitAllocaInst(AllocaInst &AI);
354 void visitExtractValueInst(ExtractValueInst &EVI);
355 void visitInsertValueInst(InsertValueInst &IVI);
356 void visitLandingPadInst(LandingPadInst &LPI);
358 void VerifyCallSite(CallSite CS);
359 void verifyMustTailCall(CallInst &CI);
360 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
361 unsigned ArgNo, std::string &Suffix);
362 bool VerifyIntrinsicType(Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
363 SmallVectorImpl<Type *> &ArgTys);
364 bool VerifyIntrinsicIsVarArg(bool isVarArg,
365 ArrayRef<Intrinsic::IITDescriptor> &Infos);
366 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
367 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
369 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
370 bool isReturnValue, const Value *V);
371 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
374 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
375 void VerifyStatepoint(ImmutableCallSite CS);
377 class DebugInfoVerifier : public VerifierSupport {
379 explicit DebugInfoVerifier(raw_ostream &OS = dbgs()) : VerifierSupport(OS) {}
381 bool verify(const Module &M) {
388 void verifyDebugInfo();
389 void processInstructions(DebugInfoFinder &Finder);
390 void processCallInst(DebugInfoFinder &Finder, const CallInst &CI);
392 } // End anonymous namespace
394 // Assert - We know that cond should be true, if not print an error message.
395 #define Assert(C, M) \
396 do { if (!(C)) { CheckFailed(M); return; } } while (0)
397 #define Assert1(C, M, V1) \
398 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
399 #define Assert2(C, M, V1, V2) \
400 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
401 #define Assert3(C, M, V1, V2, V3) \
402 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
403 #define Assert4(C, M, V1, V2, V3, V4) \
404 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
406 void Verifier::visit(Instruction &I) {
407 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
408 Assert1(I.getOperand(i) != nullptr, "Operand is null", &I);
409 InstVisitor<Verifier>::visit(I);
413 void Verifier::visitGlobalValue(const GlobalValue &GV) {
414 Assert1(!GV.isDeclaration() || GV.hasExternalLinkage() ||
415 GV.hasExternalWeakLinkage(),
416 "Global is external, but doesn't have external or weak linkage!",
419 Assert1(GV.getAlignment() <= Value::MaximumAlignment,
420 "huge alignment values are unsupported", &GV);
421 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
422 "Only global variables can have appending linkage!", &GV);
424 if (GV.hasAppendingLinkage()) {
425 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
426 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
427 "Only global arrays can have appending linkage!", GVar);
431 void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
432 if (GV.hasInitializer()) {
433 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
434 "Global variable initializer type does not match global "
435 "variable type!", &GV);
437 // If the global has common linkage, it must have a zero initializer and
438 // cannot be constant.
439 if (GV.hasCommonLinkage()) {
440 Assert1(GV.getInitializer()->isNullValue(),
441 "'common' global must have a zero initializer!", &GV);
442 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
444 Assert1(!GV.hasComdat(), "'common' global may not be in a Comdat!", &GV);
447 Assert1(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
448 "invalid linkage type for global declaration", &GV);
451 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
452 GV.getName() == "llvm.global_dtors")) {
453 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
454 "invalid linkage for intrinsic global variable", &GV);
455 // Don't worry about emitting an error for it not being an array,
456 // visitGlobalValue will complain on appending non-array.
457 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType()->getElementType())) {
458 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
459 PointerType *FuncPtrTy =
460 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
461 // FIXME: Reject the 2-field form in LLVM 4.0.
462 Assert1(STy && (STy->getNumElements() == 2 ||
463 STy->getNumElements() == 3) &&
464 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
465 STy->getTypeAtIndex(1) == FuncPtrTy,
466 "wrong type for intrinsic global variable", &GV);
467 if (STy->getNumElements() == 3) {
468 Type *ETy = STy->getTypeAtIndex(2);
469 Assert1(ETy->isPointerTy() &&
470 cast<PointerType>(ETy)->getElementType()->isIntegerTy(8),
471 "wrong type for intrinsic global variable", &GV);
476 if (GV.hasName() && (GV.getName() == "llvm.used" ||
477 GV.getName() == "llvm.compiler.used")) {
478 Assert1(!GV.hasInitializer() || GV.hasAppendingLinkage(),
479 "invalid linkage for intrinsic global variable", &GV);
480 Type *GVType = GV.getType()->getElementType();
481 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
482 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
483 Assert1(PTy, "wrong type for intrinsic global variable", &GV);
484 if (GV.hasInitializer()) {
485 const Constant *Init = GV.getInitializer();
486 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
487 Assert1(InitArray, "wrong initalizer for intrinsic global variable",
489 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
490 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
492 isa<GlobalVariable>(V) || isa<Function>(V) || isa<GlobalAlias>(V),
493 "invalid llvm.used member", V);
494 Assert1(V->hasName(), "members of llvm.used must be named", V);
500 Assert1(!GV.hasDLLImportStorageClass() ||
501 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
502 GV.hasAvailableExternallyLinkage(),
503 "Global is marked as dllimport, but not external", &GV);
505 if (!GV.hasInitializer()) {
506 visitGlobalValue(GV);
510 // Walk any aggregate initializers looking for bitcasts between address spaces
511 SmallPtrSet<const Value *, 4> Visited;
512 SmallVector<const Value *, 4> WorkStack;
513 WorkStack.push_back(cast<Value>(GV.getInitializer()));
515 while (!WorkStack.empty()) {
516 const Value *V = WorkStack.pop_back_val();
517 if (!Visited.insert(V).second)
520 if (const User *U = dyn_cast<User>(V)) {
521 WorkStack.append(U->op_begin(), U->op_end());
524 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
525 VerifyConstantExprBitcastType(CE);
531 visitGlobalValue(GV);
534 void Verifier::visitAliaseeSubExpr(const GlobalAlias &GA, const Constant &C) {
535 SmallPtrSet<const GlobalAlias*, 4> Visited;
537 visitAliaseeSubExpr(Visited, GA, C);
540 void Verifier::visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias*> &Visited,
541 const GlobalAlias &GA, const Constant &C) {
542 if (const auto *GV = dyn_cast<GlobalValue>(&C)) {
543 Assert1(!GV->isDeclaration(), "Alias must point to a definition", &GA);
545 if (const auto *GA2 = dyn_cast<GlobalAlias>(GV)) {
546 Assert1(Visited.insert(GA2).second, "Aliases cannot form a cycle", &GA);
548 Assert1(!GA2->mayBeOverridden(), "Alias cannot point to a weak alias",
551 // Only continue verifying subexpressions of GlobalAliases.
552 // Do not recurse into global initializers.
557 if (const auto *CE = dyn_cast<ConstantExpr>(&C))
558 VerifyConstantExprBitcastType(CE);
560 for (const Use &U : C.operands()) {
562 if (const auto *GA2 = dyn_cast<GlobalAlias>(V))
563 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
564 else if (const auto *C2 = dyn_cast<Constant>(V))
565 visitAliaseeSubExpr(Visited, GA, *C2);
569 void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
570 Assert1(!GA.getName().empty(),
571 "Alias name cannot be empty!", &GA);
572 Assert1(GlobalAlias::isValidLinkage(GA.getLinkage()),
573 "Alias should have private, internal, linkonce, weak, linkonce_odr, "
574 "weak_odr, or external linkage!",
576 const Constant *Aliasee = GA.getAliasee();
577 Assert1(Aliasee, "Aliasee cannot be NULL!", &GA);
578 Assert1(GA.getType() == Aliasee->getType(),
579 "Alias and aliasee types should match!", &GA);
581 Assert1(isa<GlobalValue>(Aliasee) || isa<ConstantExpr>(Aliasee),
582 "Aliasee should be either GlobalValue or ConstantExpr", &GA);
584 visitAliaseeSubExpr(GA, *Aliasee);
586 visitGlobalValue(GA);
589 void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
590 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
591 MDNode *MD = NMD.getOperand(i);
599 void Verifier::visitMDNode(const MDNode &MD) {
600 // Only visit each node once. Metadata can be mutually recursive, so this
601 // avoids infinite recursion here, as well as being an optimization.
602 if (!MDNodes.insert(&MD).second)
605 switch (MD.getMetadataID()) {
607 llvm_unreachable("Invalid MDNode subclass");
608 case Metadata::MDTupleKind:
610 #define HANDLE_SPECIALIZED_MDNODE_LEAF(CLASS) \
611 case Metadata::CLASS##Kind: \
612 visit##CLASS(cast<CLASS>(MD)); \
614 #include "llvm/IR/Metadata.def"
617 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
618 Metadata *Op = MD.getOperand(i);
621 Assert2(!isa<LocalAsMetadata>(Op), "Invalid operand for global metadata!",
623 if (auto *N = dyn_cast<MDNode>(Op)) {
627 if (auto *V = dyn_cast<ValueAsMetadata>(Op)) {
628 visitValueAsMetadata(*V, nullptr);
633 // Check these last, so we diagnose problems in operands first.
634 Assert1(!MD.isTemporary(), "Expected no forward declarations!", &MD);
635 Assert1(MD.isResolved(), "All nodes should be resolved!", &MD);
638 void Verifier::visitValueAsMetadata(const ValueAsMetadata &MD, Function *F) {
639 Assert1(MD.getValue(), "Expected valid value", &MD);
640 Assert2(!MD.getValue()->getType()->isMetadataTy(),
641 "Unexpected metadata round-trip through values", &MD, MD.getValue());
643 auto *L = dyn_cast<LocalAsMetadata>(&MD);
647 Assert1(F, "function-local metadata used outside a function", L);
649 // If this was an instruction, bb, or argument, verify that it is in the
650 // function that we expect.
651 Function *ActualF = nullptr;
652 if (Instruction *I = dyn_cast<Instruction>(L->getValue())) {
653 Assert2(I->getParent(), "function-local metadata not in basic block", L, I);
654 ActualF = I->getParent()->getParent();
655 } else if (BasicBlock *BB = dyn_cast<BasicBlock>(L->getValue()))
656 ActualF = BB->getParent();
657 else if (Argument *A = dyn_cast<Argument>(L->getValue()))
658 ActualF = A->getParent();
659 assert(ActualF && "Unimplemented function local metadata case!");
661 Assert1(ActualF == F, "function-local metadata used in wrong function", L);
664 void Verifier::visitMetadataAsValue(const MetadataAsValue &MDV, Function *F) {
665 Metadata *MD = MDV.getMetadata();
666 if (auto *N = dyn_cast<MDNode>(MD)) {
671 // Only visit each node once. Metadata can be mutually recursive, so this
672 // avoids infinite recursion here, as well as being an optimization.
673 if (!MDNodes.insert(MD).second)
676 if (auto *V = dyn_cast<ValueAsMetadata>(MD))
677 visitValueAsMetadata(*V, F);
680 void Verifier::visitMDLocation(const MDLocation &N) {
681 Assert1(N.getScope(), "location requires a valid scope", &N);
682 if (auto *IA = N.getInlinedAt())
683 Assert2(isa<MDLocation>(IA), "inlined-at should be a location", &N, IA);
686 void Verifier::visitGenericDebugNode(const GenericDebugNode &N) {
687 Assert1(N.getTag(), "invalid tag", &N);
690 void Verifier::visitMDSubrange(const MDSubrange &N) {
691 Assert1(N.getTag() == dwarf::DW_TAG_subrange_type, "invalid tag", &N);
694 void Verifier::visitMDEnumerator(const MDEnumerator &N) {
695 Assert1(N.getTag() == dwarf::DW_TAG_enumerator, "invalid tag", &N);
698 void Verifier::visitMDBasicType(const MDBasicType &N) {
699 Assert1(N.getTag() == dwarf::DW_TAG_base_type ||
700 N.getTag() == dwarf::DW_TAG_unspecified_type,
704 void Verifier::visitMDDerivedType(const MDDerivedType &N) {
705 Assert1(N.getTag() == dwarf::DW_TAG_typedef ||
706 N.getTag() == dwarf::DW_TAG_pointer_type ||
707 N.getTag() == dwarf::DW_TAG_ptr_to_member_type ||
708 N.getTag() == dwarf::DW_TAG_reference_type ||
709 N.getTag() == dwarf::DW_TAG_rvalue_reference_type ||
710 N.getTag() == dwarf::DW_TAG_const_type ||
711 N.getTag() == dwarf::DW_TAG_volatile_type ||
712 N.getTag() == dwarf::DW_TAG_restrict_type ||
713 N.getTag() == dwarf::DW_TAG_member ||
714 N.getTag() == dwarf::DW_TAG_inheritance ||
715 N.getTag() == dwarf::DW_TAG_friend,
719 void Verifier::visitMDCompositeType(const MDCompositeType &N) {
720 Assert1(N.getTag() == dwarf::DW_TAG_array_type ||
721 N.getTag() == dwarf::DW_TAG_structure_type ||
722 N.getTag() == dwarf::DW_TAG_union_type ||
723 N.getTag() == dwarf::DW_TAG_enumeration_type ||
724 N.getTag() == dwarf::DW_TAG_subroutine_type ||
725 N.getTag() == dwarf::DW_TAG_class_type,
729 void Verifier::visitMDSubroutineType(const MDSubroutineType &N) {
730 Assert1(N.getTag() == dwarf::DW_TAG_subroutine_type, "invalid tag", &N);
733 void Verifier::visitMDFile(const MDFile &N) {
734 Assert1(N.getTag() == dwarf::DW_TAG_file_type, "invalid tag", &N);
737 void Verifier::visitMDCompileUnit(const MDCompileUnit &N) {
738 Assert1(N.getTag() == dwarf::DW_TAG_compile_unit, "invalid tag", &N);
741 void Verifier::visitMDSubprogram(const MDSubprogram &N) {
742 Assert1(N.getTag() == dwarf::DW_TAG_subprogram, "invalid tag", &N);
745 void Verifier::visitMDLexicalBlock(const MDLexicalBlock &N) {
746 Assert1(N.getTag() == dwarf::DW_TAG_lexical_block, "invalid tag", &N);
749 void Verifier::visitMDLexicalBlockFile(const MDLexicalBlockFile &N) {
750 Assert1(N.getTag() == dwarf::DW_TAG_lexical_block, "invalid tag", &N);
753 void Verifier::visitMDNamespace(const MDNamespace &N) {
754 Assert1(N.getTag() == dwarf::DW_TAG_namespace, "invalid tag", &N);
757 void Verifier::visitMDTemplateTypeParameter(const MDTemplateTypeParameter &N) {
758 Assert1(N.getTag() == dwarf::DW_TAG_template_type_parameter, "invalid tag",
762 void Verifier::visitMDTemplateValueParameter(
763 const MDTemplateValueParameter &N) {
764 Assert1(N.getTag() == dwarf::DW_TAG_template_value_parameter ||
765 N.getTag() == dwarf::DW_TAG_GNU_template_template_param ||
766 N.getTag() == dwarf::DW_TAG_GNU_template_parameter_pack,
770 void Verifier::visitMDGlobalVariable(const MDGlobalVariable &N) {
771 Assert1(N.getTag() == dwarf::DW_TAG_variable, "invalid tag", &N);
774 void Verifier::visitMDLocalVariable(const MDLocalVariable &N) {
775 Assert1(N.getTag() == dwarf::DW_TAG_auto_variable ||
776 N.getTag() == dwarf::DW_TAG_arg_variable,
780 void Verifier::visitMDExpression(const MDExpression &N) {
781 Assert1(N.getTag() == dwarf::DW_TAG_expression, "invalid tag", &N);
782 Assert1(N.isValid(), "invalid expression", &N);
785 void Verifier::visitMDObjCProperty(const MDObjCProperty &N) {
786 Assert1(N.getTag() == dwarf::DW_TAG_APPLE_property, "invalid tag", &N);
789 void Verifier::visitMDImportedEntity(const MDImportedEntity &N) {
790 Assert1(N.getTag() == dwarf::DW_TAG_imported_module ||
791 N.getTag() == dwarf::DW_TAG_imported_declaration,
795 void Verifier::visitComdat(const Comdat &C) {
796 // All Comdat::SelectionKind values other than Comdat::Any require a
797 // GlobalValue with the same name as the Comdat.
798 const GlobalValue *GV = M->getNamedValue(C.getName());
799 if (C.getSelectionKind() != Comdat::Any)
801 "comdat selection kind requires a global value with the same name",
803 // The Module is invalid if the GlobalValue has private linkage. Entities
804 // with private linkage don't have entries in the symbol table.
806 Assert1(!GV->hasPrivateLinkage(), "comdat global value has private linkage",
810 void Verifier::visitModuleIdents(const Module &M) {
811 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
815 // llvm.ident takes a list of metadata entry. Each entry has only one string.
816 // Scan each llvm.ident entry and make sure that this requirement is met.
817 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
818 const MDNode *N = Idents->getOperand(i);
819 Assert1(N->getNumOperands() == 1,
820 "incorrect number of operands in llvm.ident metadata", N);
821 Assert1(dyn_cast_or_null<MDString>(N->getOperand(0)),
822 ("invalid value for llvm.ident metadata entry operand"
823 "(the operand should be a string)"),
828 void Verifier::visitModuleFlags(const Module &M) {
829 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
832 // Scan each flag, and track the flags and requirements.
833 DenseMap<const MDString*, const MDNode*> SeenIDs;
834 SmallVector<const MDNode*, 16> Requirements;
835 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
836 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
839 // Validate that the requirements in the module are valid.
840 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
841 const MDNode *Requirement = Requirements[I];
842 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
843 const Metadata *ReqValue = Requirement->getOperand(1);
845 const MDNode *Op = SeenIDs.lookup(Flag);
847 CheckFailed("invalid requirement on flag, flag is not present in module",
852 if (Op->getOperand(2) != ReqValue) {
853 CheckFailed(("invalid requirement on flag, "
854 "flag does not have the required value"),
862 Verifier::visitModuleFlag(const MDNode *Op,
863 DenseMap<const MDString *, const MDNode *> &SeenIDs,
864 SmallVectorImpl<const MDNode *> &Requirements) {
865 // Each module flag should have three arguments, the merge behavior (a
866 // constant int), the flag ID (an MDString), and the value.
867 Assert1(Op->getNumOperands() == 3,
868 "incorrect number of operands in module flag", Op);
869 Module::ModFlagBehavior MFB;
870 if (!Module::isValidModFlagBehavior(Op->getOperand(0), MFB)) {
872 mdconst::dyn_extract_or_null<ConstantInt>(Op->getOperand(0)),
873 "invalid behavior operand in module flag (expected constant integer)",
876 "invalid behavior operand in module flag (unexpected constant)",
879 MDString *ID = dyn_cast_or_null<MDString>(Op->getOperand(1));
881 "invalid ID operand in module flag (expected metadata string)",
884 // Sanity check the values for behaviors with additional requirements.
887 case Module::Warning:
888 case Module::Override:
889 // These behavior types accept any value.
892 case Module::Require: {
893 // The value should itself be an MDNode with two operands, a flag ID (an
894 // MDString), and a value.
895 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
896 Assert1(Value && Value->getNumOperands() == 2,
897 "invalid value for 'require' module flag (expected metadata pair)",
899 Assert1(isa<MDString>(Value->getOperand(0)),
900 ("invalid value for 'require' module flag "
901 "(first value operand should be a string)"),
902 Value->getOperand(0));
904 // Append it to the list of requirements, to check once all module flags are
906 Requirements.push_back(Value);
911 case Module::AppendUnique: {
912 // These behavior types require the operand be an MDNode.
913 Assert1(isa<MDNode>(Op->getOperand(2)),
914 "invalid value for 'append'-type module flag "
915 "(expected a metadata node)", Op->getOperand(2));
920 // Unless this is a "requires" flag, check the ID is unique.
921 if (MFB != Module::Require) {
922 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
924 "module flag identifiers must be unique (or of 'require' type)",
929 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
930 bool isFunction, const Value *V) {
932 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
933 if (Attrs.getSlotIndex(I) == Idx) {
938 assert(Slot != ~0U && "Attribute set inconsistency!");
940 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
942 if (I->isStringAttribute())
945 if (I->getKindAsEnum() == Attribute::NoReturn ||
946 I->getKindAsEnum() == Attribute::NoUnwind ||
947 I->getKindAsEnum() == Attribute::NoInline ||
948 I->getKindAsEnum() == Attribute::AlwaysInline ||
949 I->getKindAsEnum() == Attribute::OptimizeForSize ||
950 I->getKindAsEnum() == Attribute::StackProtect ||
951 I->getKindAsEnum() == Attribute::StackProtectReq ||
952 I->getKindAsEnum() == Attribute::StackProtectStrong ||
953 I->getKindAsEnum() == Attribute::NoRedZone ||
954 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
955 I->getKindAsEnum() == Attribute::Naked ||
956 I->getKindAsEnum() == Attribute::InlineHint ||
957 I->getKindAsEnum() == Attribute::StackAlignment ||
958 I->getKindAsEnum() == Attribute::UWTable ||
959 I->getKindAsEnum() == Attribute::NonLazyBind ||
960 I->getKindAsEnum() == Attribute::ReturnsTwice ||
961 I->getKindAsEnum() == Attribute::SanitizeAddress ||
962 I->getKindAsEnum() == Attribute::SanitizeThread ||
963 I->getKindAsEnum() == Attribute::SanitizeMemory ||
964 I->getKindAsEnum() == Attribute::MinSize ||
965 I->getKindAsEnum() == Attribute::NoDuplicate ||
966 I->getKindAsEnum() == Attribute::Builtin ||
967 I->getKindAsEnum() == Attribute::NoBuiltin ||
968 I->getKindAsEnum() == Attribute::Cold ||
969 I->getKindAsEnum() == Attribute::OptimizeNone ||
970 I->getKindAsEnum() == Attribute::JumpTable) {
972 CheckFailed("Attribute '" + I->getAsString() +
973 "' only applies to functions!", V);
976 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
977 I->getKindAsEnum() == Attribute::ReadNone) {
979 CheckFailed("Attribute '" + I->getAsString() +
980 "' does not apply to function returns");
983 } else if (isFunction) {
984 CheckFailed("Attribute '" + I->getAsString() +
985 "' does not apply to functions!", V);
991 // VerifyParameterAttrs - Check the given attributes for an argument or return
992 // value of the specified type. The value V is printed in error messages.
993 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
994 bool isReturnValue, const Value *V) {
995 if (!Attrs.hasAttributes(Idx))
998 VerifyAttributeTypes(Attrs, Idx, false, V);
1001 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
1002 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
1003 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
1004 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
1005 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
1006 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
1007 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
1008 "'returned' do not apply to return values!", V);
1010 // Check for mutually incompatible attributes. Only inreg is compatible with
1012 unsigned AttrCount = 0;
1013 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
1014 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
1015 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
1016 Attrs.hasAttribute(Idx, Attribute::InReg);
1017 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
1018 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
1019 "and 'sret' are incompatible!", V);
1021 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
1022 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
1023 "'inalloca and readonly' are incompatible!", V);
1025 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
1026 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
1027 "'sret and returned' are incompatible!", V);
1029 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
1030 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
1031 "'zeroext and signext' are incompatible!", V);
1033 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
1034 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
1035 "'readnone and readonly' are incompatible!", V);
1037 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
1038 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
1039 "'noinline and alwaysinline' are incompatible!", V);
1041 Assert1(!AttrBuilder(Attrs, Idx).
1042 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
1043 "Wrong types for attribute: " +
1044 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
1046 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
1047 if (!PTy->getElementType()->isSized()) {
1048 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
1049 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
1050 "Attributes 'byval' and 'inalloca' do not support unsized types!",
1054 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
1055 "Attribute 'byval' only applies to parameters with pointer type!",
1060 // VerifyFunctionAttrs - Check parameter attributes against a function type.
1061 // The value V is printed in error messages.
1062 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
1064 if (Attrs.isEmpty())
1067 bool SawNest = false;
1068 bool SawReturned = false;
1069 bool SawSRet = false;
1071 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
1072 unsigned Idx = Attrs.getSlotIndex(i);
1076 Ty = FT->getReturnType();
1077 else if (Idx-1 < FT->getNumParams())
1078 Ty = FT->getParamType(Idx-1);
1080 break; // VarArgs attributes, verified elsewhere.
1082 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
1087 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1088 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
1092 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1093 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1095 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
1096 "argument and return types for 'returned' attribute", V);
1100 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
1101 Assert1(!SawSRet, "Cannot have multiple 'sret' parameters!", V);
1102 Assert1(Idx == 1 || Idx == 2,
1103 "Attribute 'sret' is not on first or second parameter!", V);
1107 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
1108 Assert1(Idx == FT->getNumParams(),
1109 "inalloca isn't on the last parameter!", V);
1113 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
1116 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
1118 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1119 Attribute::ReadNone) &&
1120 Attrs.hasAttribute(AttributeSet::FunctionIndex,
1121 Attribute::ReadOnly)),
1122 "Attributes 'readnone and readonly' are incompatible!", V);
1124 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1125 Attribute::NoInline) &&
1126 Attrs.hasAttribute(AttributeSet::FunctionIndex,
1127 Attribute::AlwaysInline)),
1128 "Attributes 'noinline and alwaysinline' are incompatible!", V);
1130 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1131 Attribute::OptimizeNone)) {
1132 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1133 Attribute::NoInline),
1134 "Attribute 'optnone' requires 'noinline'!", V);
1136 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1137 Attribute::OptimizeForSize),
1138 "Attributes 'optsize and optnone' are incompatible!", V);
1140 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1141 Attribute::MinSize),
1142 "Attributes 'minsize and optnone' are incompatible!", V);
1145 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1146 Attribute::JumpTable)) {
1147 const GlobalValue *GV = cast<GlobalValue>(V);
1148 Assert1(GV->hasUnnamedAddr(),
1149 "Attribute 'jumptable' requires 'unnamed_addr'", V);
1154 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
1155 if (CE->getOpcode() != Instruction::BitCast)
1158 Assert1(CastInst::castIsValid(Instruction::BitCast, CE->getOperand(0),
1160 "Invalid bitcast", CE);
1163 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1164 if (Attrs.getNumSlots() == 0)
1167 unsigned LastSlot = Attrs.getNumSlots() - 1;
1168 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1169 if (LastIndex <= Params
1170 || (LastIndex == AttributeSet::FunctionIndex
1171 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1177 /// \brief Verify that statepoint intrinsic is well formed.
1178 void Verifier::VerifyStatepoint(ImmutableCallSite CS) {
1179 assert(CS.getCalledFunction() &&
1180 CS.getCalledFunction()->getIntrinsicID() ==
1181 Intrinsic::experimental_gc_statepoint);
1183 const Instruction &CI = *CS.getInstruction();
1185 Assert1(!CS.doesNotAccessMemory() &&
1186 !CS.onlyReadsMemory(),
1187 "gc.statepoint must read and write memory to preserve "
1188 "reordering restrictions required by safepoint semantics", &CI);
1190 const Value *Target = CS.getArgument(0);
1191 const PointerType *PT = dyn_cast<PointerType>(Target->getType());
1192 Assert2(PT && PT->getElementType()->isFunctionTy(),
1193 "gc.statepoint callee must be of function pointer type",
1195 FunctionType *TargetFuncType = cast<FunctionType>(PT->getElementType());
1197 const Value *NumCallArgsV = CS.getArgument(1);
1198 Assert1(isa<ConstantInt>(NumCallArgsV),
1199 "gc.statepoint number of arguments to underlying call "
1200 "must be constant integer", &CI);
1201 const int NumCallArgs = cast<ConstantInt>(NumCallArgsV)->getZExtValue();
1202 Assert1(NumCallArgs >= 0,
1203 "gc.statepoint number of arguments to underlying call "
1204 "must be positive", &CI);
1205 const int NumParams = (int)TargetFuncType->getNumParams();
1206 if (TargetFuncType->isVarArg()) {
1207 Assert1(NumCallArgs >= NumParams,
1208 "gc.statepoint mismatch in number of vararg call args", &CI);
1210 // TODO: Remove this limitation
1211 Assert1(TargetFuncType->getReturnType()->isVoidTy(),
1212 "gc.statepoint doesn't support wrapping non-void "
1213 "vararg functions yet", &CI);
1215 Assert1(NumCallArgs == NumParams,
1216 "gc.statepoint mismatch in number of call args", &CI);
1218 const Value *Unused = CS.getArgument(2);
1219 Assert1(isa<ConstantInt>(Unused) &&
1220 cast<ConstantInt>(Unused)->isNullValue(),
1221 "gc.statepoint parameter #3 must be zero", &CI);
1223 // Verify that the types of the call parameter arguments match
1224 // the type of the wrapped callee.
1225 for (int i = 0; i < NumParams; i++) {
1226 Type *ParamType = TargetFuncType->getParamType(i);
1227 Type *ArgType = CS.getArgument(3+i)->getType();
1228 Assert1(ArgType == ParamType,
1229 "gc.statepoint call argument does not match wrapped "
1230 "function type", &CI);
1232 const int EndCallArgsInx = 2+NumCallArgs;
1233 const Value *NumDeoptArgsV = CS.getArgument(EndCallArgsInx+1);
1234 Assert1(isa<ConstantInt>(NumDeoptArgsV),
1235 "gc.statepoint number of deoptimization arguments "
1236 "must be constant integer", &CI);
1237 const int NumDeoptArgs = cast<ConstantInt>(NumDeoptArgsV)->getZExtValue();
1238 Assert1(NumDeoptArgs >= 0,
1239 "gc.statepoint number of deoptimization arguments "
1240 "must be positive", &CI);
1242 Assert1(4 + NumCallArgs + NumDeoptArgs <= (int)CS.arg_size(),
1243 "gc.statepoint too few arguments according to length fields", &CI);
1245 // Check that the only uses of this gc.statepoint are gc.result or
1246 // gc.relocate calls which are tied to this statepoint and thus part
1247 // of the same statepoint sequence
1248 for (const User *U : CI.users()) {
1249 const CallInst *Call = dyn_cast<const CallInst>(U);
1250 Assert2(Call, "illegal use of statepoint token", &CI, U);
1251 if (!Call) continue;
1252 Assert2(isGCRelocate(Call) || isGCResult(Call),
1253 "gc.result or gc.relocate are the only value uses"
1254 "of a gc.statepoint", &CI, U);
1255 if (isGCResult(Call)) {
1256 Assert2(Call->getArgOperand(0) == &CI,
1257 "gc.result connected to wrong gc.statepoint",
1259 } else if (isGCRelocate(Call)) {
1260 Assert2(Call->getArgOperand(0) == &CI,
1261 "gc.relocate connected to wrong gc.statepoint",
1266 // Note: It is legal for a single derived pointer to be listed multiple
1267 // times. It's non-optimal, but it is legal. It can also happen after
1268 // insertion if we strip a bitcast away.
1269 // Note: It is really tempting to check that each base is relocated and
1270 // that a derived pointer is never reused as a base pointer. This turns
1271 // out to be problematic since optimizations run after safepoint insertion
1272 // can recognize equality properties that the insertion logic doesn't know
1273 // about. See example statepoint.ll in the verifier subdirectory
1276 // visitFunction - Verify that a function is ok.
1278 void Verifier::visitFunction(const Function &F) {
1279 // Check function arguments.
1280 FunctionType *FT = F.getFunctionType();
1281 unsigned NumArgs = F.arg_size();
1283 Assert1(Context == &F.getContext(),
1284 "Function context does not match Module context!", &F);
1286 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1287 Assert2(FT->getNumParams() == NumArgs,
1288 "# formal arguments must match # of arguments for function type!",
1290 Assert1(F.getReturnType()->isFirstClassType() ||
1291 F.getReturnType()->isVoidTy() ||
1292 F.getReturnType()->isStructTy(),
1293 "Functions cannot return aggregate values!", &F);
1295 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1296 "Invalid struct return type!", &F);
1298 AttributeSet Attrs = F.getAttributes();
1300 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1301 "Attribute after last parameter!", &F);
1303 // Check function attributes.
1304 VerifyFunctionAttrs(FT, Attrs, &F);
1306 // On function declarations/definitions, we do not support the builtin
1307 // attribute. We do not check this in VerifyFunctionAttrs since that is
1308 // checking for Attributes that can/can not ever be on functions.
1309 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1310 Attribute::Builtin),
1311 "Attribute 'builtin' can only be applied to a callsite.", &F);
1313 // Check that this function meets the restrictions on this calling convention.
1314 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
1315 // restrictions can be lifted.
1316 switch (F.getCallingConv()) {
1318 case CallingConv::C:
1320 case CallingConv::Fast:
1321 case CallingConv::Cold:
1322 case CallingConv::Intel_OCL_BI:
1323 case CallingConv::PTX_Kernel:
1324 case CallingConv::PTX_Device:
1325 Assert1(!F.isVarArg(), "Calling convention does not support varargs or "
1326 "perfect forwarding!", &F);
1330 bool isLLVMdotName = F.getName().size() >= 5 &&
1331 F.getName().substr(0, 5) == "llvm.";
1333 // Check that the argument values match the function type for this function...
1335 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1337 Assert2(I->getType() == FT->getParamType(i),
1338 "Argument value does not match function argument type!",
1339 I, FT->getParamType(i));
1340 Assert1(I->getType()->isFirstClassType(),
1341 "Function arguments must have first-class types!", I);
1343 Assert2(!I->getType()->isMetadataTy(),
1344 "Function takes metadata but isn't an intrinsic", I, &F);
1347 if (F.isMaterializable()) {
1348 // Function has a body somewhere we can't see.
1349 } else if (F.isDeclaration()) {
1350 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1351 "invalid linkage type for function declaration", &F);
1353 // Verify that this function (which has a body) is not named "llvm.*". It
1354 // is not legal to define intrinsics.
1355 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1357 // Check the entry node
1358 const BasicBlock *Entry = &F.getEntryBlock();
1359 Assert1(pred_empty(Entry),
1360 "Entry block to function must not have predecessors!", Entry);
1362 // The address of the entry block cannot be taken, unless it is dead.
1363 if (Entry->hasAddressTaken()) {
1364 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1365 "blockaddress may not be used with the entry block!", Entry);
1369 // If this function is actually an intrinsic, verify that it is only used in
1370 // direct call/invokes, never having its "address taken".
1371 if (F.getIntrinsicID()) {
1373 if (F.hasAddressTaken(&U))
1374 Assert1(0, "Invalid user of intrinsic instruction!", U);
1377 Assert1(!F.hasDLLImportStorageClass() ||
1378 (F.isDeclaration() && F.hasExternalLinkage()) ||
1379 F.hasAvailableExternallyLinkage(),
1380 "Function is marked as dllimport, but not external.", &F);
1383 // verifyBasicBlock - Verify that a basic block is well formed...
1385 void Verifier::visitBasicBlock(BasicBlock &BB) {
1386 InstsInThisBlock.clear();
1388 // Ensure that basic blocks have terminators!
1389 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1391 // Check constraints that this basic block imposes on all of the PHI nodes in
1393 if (isa<PHINode>(BB.front())) {
1394 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1395 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1396 std::sort(Preds.begin(), Preds.end());
1398 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1399 // Ensure that PHI nodes have at least one entry!
1400 Assert1(PN->getNumIncomingValues() != 0,
1401 "PHI nodes must have at least one entry. If the block is dead, "
1402 "the PHI should be removed!", PN);
1403 Assert1(PN->getNumIncomingValues() == Preds.size(),
1404 "PHINode should have one entry for each predecessor of its "
1405 "parent basic block!", PN);
1407 // Get and sort all incoming values in the PHI node...
1409 Values.reserve(PN->getNumIncomingValues());
1410 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1411 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1412 PN->getIncomingValue(i)));
1413 std::sort(Values.begin(), Values.end());
1415 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1416 // Check to make sure that if there is more than one entry for a
1417 // particular basic block in this PHI node, that the incoming values are
1420 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1421 Values[i].second == Values[i-1].second,
1422 "PHI node has multiple entries for the same basic block with "
1423 "different incoming values!", PN, Values[i].first,
1424 Values[i].second, Values[i-1].second);
1426 // Check to make sure that the predecessors and PHI node entries are
1428 Assert3(Values[i].first == Preds[i],
1429 "PHI node entries do not match predecessors!", PN,
1430 Values[i].first, Preds[i]);
1435 // Check that all instructions have their parent pointers set up correctly.
1438 Assert(I.getParent() == &BB, "Instruction has bogus parent pointer!");
1442 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1443 // Ensure that terminators only exist at the end of the basic block.
1444 Assert1(&I == I.getParent()->getTerminator(),
1445 "Terminator found in the middle of a basic block!", I.getParent());
1446 visitInstruction(I);
1449 void Verifier::visitBranchInst(BranchInst &BI) {
1450 if (BI.isConditional()) {
1451 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1452 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1454 visitTerminatorInst(BI);
1457 void Verifier::visitReturnInst(ReturnInst &RI) {
1458 Function *F = RI.getParent()->getParent();
1459 unsigned N = RI.getNumOperands();
1460 if (F->getReturnType()->isVoidTy())
1462 "Found return instr that returns non-void in Function of void "
1463 "return type!", &RI, F->getReturnType());
1465 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1466 "Function return type does not match operand "
1467 "type of return inst!", &RI, F->getReturnType());
1469 // Check to make sure that the return value has necessary properties for
1471 visitTerminatorInst(RI);
1474 void Verifier::visitSwitchInst(SwitchInst &SI) {
1475 // Check to make sure that all of the constants in the switch instruction
1476 // have the same type as the switched-on value.
1477 Type *SwitchTy = SI.getCondition()->getType();
1478 SmallPtrSet<ConstantInt*, 32> Constants;
1479 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1480 Assert1(i.getCaseValue()->getType() == SwitchTy,
1481 "Switch constants must all be same type as switch value!", &SI);
1482 Assert2(Constants.insert(i.getCaseValue()).second,
1483 "Duplicate integer as switch case", &SI, i.getCaseValue());
1486 visitTerminatorInst(SI);
1489 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1490 Assert1(BI.getAddress()->getType()->isPointerTy(),
1491 "Indirectbr operand must have pointer type!", &BI);
1492 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1493 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1494 "Indirectbr destinations must all have pointer type!", &BI);
1496 visitTerminatorInst(BI);
1499 void Verifier::visitSelectInst(SelectInst &SI) {
1500 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1502 "Invalid operands for select instruction!", &SI);
1504 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1505 "Select values must have same type as select instruction!", &SI);
1506 visitInstruction(SI);
1509 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1510 /// a pass, if any exist, it's an error.
1512 void Verifier::visitUserOp1(Instruction &I) {
1513 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1516 void Verifier::visitTruncInst(TruncInst &I) {
1517 // Get the source and destination types
1518 Type *SrcTy = I.getOperand(0)->getType();
1519 Type *DestTy = I.getType();
1521 // Get the size of the types in bits, we'll need this later
1522 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1523 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1525 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1526 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1527 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1528 "trunc source and destination must both be a vector or neither", &I);
1529 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1531 visitInstruction(I);
1534 void Verifier::visitZExtInst(ZExtInst &I) {
1535 // Get the source and destination types
1536 Type *SrcTy = I.getOperand(0)->getType();
1537 Type *DestTy = I.getType();
1539 // Get the size of the types in bits, we'll need this later
1540 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1541 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1542 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1543 "zext source and destination must both be a vector or neither", &I);
1544 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1545 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1547 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1549 visitInstruction(I);
1552 void Verifier::visitSExtInst(SExtInst &I) {
1553 // Get the source and destination types
1554 Type *SrcTy = I.getOperand(0)->getType();
1555 Type *DestTy = I.getType();
1557 // Get the size of the types in bits, we'll need this later
1558 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1559 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1561 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1562 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1563 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1564 "sext source and destination must both be a vector or neither", &I);
1565 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1567 visitInstruction(I);
1570 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1571 // Get the source and destination types
1572 Type *SrcTy = I.getOperand(0)->getType();
1573 Type *DestTy = I.getType();
1574 // Get the size of the types in bits, we'll need this later
1575 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1576 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1578 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1579 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1580 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1581 "fptrunc source and destination must both be a vector or neither",&I);
1582 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1584 visitInstruction(I);
1587 void Verifier::visitFPExtInst(FPExtInst &I) {
1588 // Get the source and destination types
1589 Type *SrcTy = I.getOperand(0)->getType();
1590 Type *DestTy = I.getType();
1592 // Get the size of the types in bits, we'll need this later
1593 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1594 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1596 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1597 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1598 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1599 "fpext source and destination must both be a vector or neither", &I);
1600 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1602 visitInstruction(I);
1605 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1606 // Get the source and destination types
1607 Type *SrcTy = I.getOperand(0)->getType();
1608 Type *DestTy = I.getType();
1610 bool SrcVec = SrcTy->isVectorTy();
1611 bool DstVec = DestTy->isVectorTy();
1613 Assert1(SrcVec == DstVec,
1614 "UIToFP source and dest must both be vector or scalar", &I);
1615 Assert1(SrcTy->isIntOrIntVectorTy(),
1616 "UIToFP source must be integer or integer vector", &I);
1617 Assert1(DestTy->isFPOrFPVectorTy(),
1618 "UIToFP result must be FP or FP vector", &I);
1620 if (SrcVec && DstVec)
1621 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1622 cast<VectorType>(DestTy)->getNumElements(),
1623 "UIToFP source and dest vector length mismatch", &I);
1625 visitInstruction(I);
1628 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1629 // Get the source and destination types
1630 Type *SrcTy = I.getOperand(0)->getType();
1631 Type *DestTy = I.getType();
1633 bool SrcVec = SrcTy->isVectorTy();
1634 bool DstVec = DestTy->isVectorTy();
1636 Assert1(SrcVec == DstVec,
1637 "SIToFP source and dest must both be vector or scalar", &I);
1638 Assert1(SrcTy->isIntOrIntVectorTy(),
1639 "SIToFP source must be integer or integer vector", &I);
1640 Assert1(DestTy->isFPOrFPVectorTy(),
1641 "SIToFP result must be FP or FP vector", &I);
1643 if (SrcVec && DstVec)
1644 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1645 cast<VectorType>(DestTy)->getNumElements(),
1646 "SIToFP source and dest vector length mismatch", &I);
1648 visitInstruction(I);
1651 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1652 // Get the source and destination types
1653 Type *SrcTy = I.getOperand(0)->getType();
1654 Type *DestTy = I.getType();
1656 bool SrcVec = SrcTy->isVectorTy();
1657 bool DstVec = DestTy->isVectorTy();
1659 Assert1(SrcVec == DstVec,
1660 "FPToUI source and dest must both be vector or scalar", &I);
1661 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1663 Assert1(DestTy->isIntOrIntVectorTy(),
1664 "FPToUI result must be integer or integer vector", &I);
1666 if (SrcVec && DstVec)
1667 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1668 cast<VectorType>(DestTy)->getNumElements(),
1669 "FPToUI source and dest vector length mismatch", &I);
1671 visitInstruction(I);
1674 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1675 // Get the source and destination types
1676 Type *SrcTy = I.getOperand(0)->getType();
1677 Type *DestTy = I.getType();
1679 bool SrcVec = SrcTy->isVectorTy();
1680 bool DstVec = DestTy->isVectorTy();
1682 Assert1(SrcVec == DstVec,
1683 "FPToSI source and dest must both be vector or scalar", &I);
1684 Assert1(SrcTy->isFPOrFPVectorTy(),
1685 "FPToSI source must be FP or FP vector", &I);
1686 Assert1(DestTy->isIntOrIntVectorTy(),
1687 "FPToSI result must be integer or integer vector", &I);
1689 if (SrcVec && DstVec)
1690 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1691 cast<VectorType>(DestTy)->getNumElements(),
1692 "FPToSI source and dest vector length mismatch", &I);
1694 visitInstruction(I);
1697 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1698 // Get the source and destination types
1699 Type *SrcTy = I.getOperand(0)->getType();
1700 Type *DestTy = I.getType();
1702 Assert1(SrcTy->getScalarType()->isPointerTy(),
1703 "PtrToInt source must be pointer", &I);
1704 Assert1(DestTy->getScalarType()->isIntegerTy(),
1705 "PtrToInt result must be integral", &I);
1706 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1707 "PtrToInt type mismatch", &I);
1709 if (SrcTy->isVectorTy()) {
1710 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1711 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1712 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1713 "PtrToInt Vector width mismatch", &I);
1716 visitInstruction(I);
1719 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1720 // Get the source and destination types
1721 Type *SrcTy = I.getOperand(0)->getType();
1722 Type *DestTy = I.getType();
1724 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1725 "IntToPtr source must be an integral", &I);
1726 Assert1(DestTy->getScalarType()->isPointerTy(),
1727 "IntToPtr result must be a pointer",&I);
1728 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1729 "IntToPtr type mismatch", &I);
1730 if (SrcTy->isVectorTy()) {
1731 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1732 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1733 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1734 "IntToPtr Vector width mismatch", &I);
1736 visitInstruction(I);
1739 void Verifier::visitBitCastInst(BitCastInst &I) {
1741 CastInst::castIsValid(Instruction::BitCast, I.getOperand(0), I.getType()),
1742 "Invalid bitcast", &I);
1743 visitInstruction(I);
1746 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1747 Type *SrcTy = I.getOperand(0)->getType();
1748 Type *DestTy = I.getType();
1750 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1751 "AddrSpaceCast source must be a pointer", &I);
1752 Assert1(DestTy->isPtrOrPtrVectorTy(),
1753 "AddrSpaceCast result must be a pointer", &I);
1754 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1755 "AddrSpaceCast must be between different address spaces", &I);
1756 if (SrcTy->isVectorTy())
1757 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1758 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1759 visitInstruction(I);
1762 /// visitPHINode - Ensure that a PHI node is well formed.
1764 void Verifier::visitPHINode(PHINode &PN) {
1765 // Ensure that the PHI nodes are all grouped together at the top of the block.
1766 // This can be tested by checking whether the instruction before this is
1767 // either nonexistent (because this is begin()) or is a PHI node. If not,
1768 // then there is some other instruction before a PHI.
1769 Assert2(&PN == &PN.getParent()->front() ||
1770 isa<PHINode>(--BasicBlock::iterator(&PN)),
1771 "PHI nodes not grouped at top of basic block!",
1772 &PN, PN.getParent());
1774 // Check that all of the values of the PHI node have the same type as the
1775 // result, and that the incoming blocks are really basic blocks.
1776 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1777 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1778 "PHI node operands are not the same type as the result!", &PN);
1781 // All other PHI node constraints are checked in the visitBasicBlock method.
1783 visitInstruction(PN);
1786 void Verifier::VerifyCallSite(CallSite CS) {
1787 Instruction *I = CS.getInstruction();
1789 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1790 "Called function must be a pointer!", I);
1791 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1793 Assert1(FPTy->getElementType()->isFunctionTy(),
1794 "Called function is not pointer to function type!", I);
1795 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1797 // Verify that the correct number of arguments are being passed
1798 if (FTy->isVarArg())
1799 Assert1(CS.arg_size() >= FTy->getNumParams(),
1800 "Called function requires more parameters than were provided!",I);
1802 Assert1(CS.arg_size() == FTy->getNumParams(),
1803 "Incorrect number of arguments passed to called function!", I);
1805 // Verify that all arguments to the call match the function type.
1806 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1807 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1808 "Call parameter type does not match function signature!",
1809 CS.getArgument(i), FTy->getParamType(i), I);
1811 AttributeSet Attrs = CS.getAttributes();
1813 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1814 "Attribute after last parameter!", I);
1816 // Verify call attributes.
1817 VerifyFunctionAttrs(FTy, Attrs, I);
1819 // Conservatively check the inalloca argument.
1820 // We have a bug if we can find that there is an underlying alloca without
1822 if (CS.hasInAllocaArgument()) {
1823 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
1824 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
1825 Assert2(AI->isUsedWithInAlloca(),
1826 "inalloca argument for call has mismatched alloca", AI, I);
1829 if (FTy->isVarArg()) {
1830 // FIXME? is 'nest' even legal here?
1831 bool SawNest = false;
1832 bool SawReturned = false;
1834 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1835 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1837 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1841 // Check attributes on the varargs part.
1842 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1843 Type *Ty = CS.getArgument(Idx-1)->getType();
1844 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1846 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1847 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1851 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1852 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1854 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1855 "Incompatible argument and return types for 'returned' "
1860 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1861 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1863 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1864 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1869 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1870 if (CS.getCalledFunction() == nullptr ||
1871 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1872 for (FunctionType::param_iterator PI = FTy->param_begin(),
1873 PE = FTy->param_end(); PI != PE; ++PI)
1874 Assert1(!(*PI)->isMetadataTy(),
1875 "Function has metadata parameter but isn't an intrinsic", I);
1878 visitInstruction(*I);
1881 /// Two types are "congruent" if they are identical, or if they are both pointer
1882 /// types with different pointee types and the same address space.
1883 static bool isTypeCongruent(Type *L, Type *R) {
1886 PointerType *PL = dyn_cast<PointerType>(L);
1887 PointerType *PR = dyn_cast<PointerType>(R);
1890 return PL->getAddressSpace() == PR->getAddressSpace();
1893 static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
1894 static const Attribute::AttrKind ABIAttrs[] = {
1895 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
1896 Attribute::InReg, Attribute::Returned};
1898 for (auto AK : ABIAttrs) {
1899 if (Attrs.hasAttribute(I + 1, AK))
1900 Copy.addAttribute(AK);
1902 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
1903 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
1907 void Verifier::verifyMustTailCall(CallInst &CI) {
1908 Assert1(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI);
1910 // - The caller and callee prototypes must match. Pointer types of
1911 // parameters or return types may differ in pointee type, but not
1913 Function *F = CI.getParent()->getParent();
1914 auto GetFnTy = [](Value *V) {
1915 return cast<FunctionType>(
1916 cast<PointerType>(V->getType())->getElementType());
1918 FunctionType *CallerTy = GetFnTy(F);
1919 FunctionType *CalleeTy = GetFnTy(CI.getCalledValue());
1920 Assert1(CallerTy->getNumParams() == CalleeTy->getNumParams(),
1921 "cannot guarantee tail call due to mismatched parameter counts", &CI);
1922 Assert1(CallerTy->isVarArg() == CalleeTy->isVarArg(),
1923 "cannot guarantee tail call due to mismatched varargs", &CI);
1924 Assert1(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),
1925 "cannot guarantee tail call due to mismatched return types", &CI);
1926 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1928 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),
1929 "cannot guarantee tail call due to mismatched parameter types", &CI);
1932 // - The calling conventions of the caller and callee must match.
1933 Assert1(F->getCallingConv() == CI.getCallingConv(),
1934 "cannot guarantee tail call due to mismatched calling conv", &CI);
1936 // - All ABI-impacting function attributes, such as sret, byval, inreg,
1937 // returned, and inalloca, must match.
1938 AttributeSet CallerAttrs = F->getAttributes();
1939 AttributeSet CalleeAttrs = CI.getAttributes();
1940 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1941 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
1942 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
1943 Assert2(CallerABIAttrs == CalleeABIAttrs,
1944 "cannot guarantee tail call due to mismatched ABI impacting "
1945 "function attributes", &CI, CI.getOperand(I));
1948 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
1949 // or a pointer bitcast followed by a ret instruction.
1950 // - The ret instruction must return the (possibly bitcasted) value
1951 // produced by the call or void.
1952 Value *RetVal = &CI;
1953 Instruction *Next = CI.getNextNode();
1955 // Handle the optional bitcast.
1956 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
1957 Assert1(BI->getOperand(0) == RetVal,
1958 "bitcast following musttail call must use the call", BI);
1960 Next = BI->getNextNode();
1963 // Check the return.
1964 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
1965 Assert1(Ret, "musttail call must be precede a ret with an optional bitcast",
1967 Assert1(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,
1968 "musttail call result must be returned", Ret);
1971 void Verifier::visitCallInst(CallInst &CI) {
1972 VerifyCallSite(&CI);
1974 if (CI.isMustTailCall())
1975 verifyMustTailCall(CI);
1977 if (Function *F = CI.getCalledFunction())
1978 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1979 visitIntrinsicFunctionCall(ID, CI);
1982 void Verifier::visitInvokeInst(InvokeInst &II) {
1983 VerifyCallSite(&II);
1985 // Verify that there is a landingpad instruction as the first non-PHI
1986 // instruction of the 'unwind' destination.
1987 Assert1(II.getUnwindDest()->isLandingPad(),
1988 "The unwind destination does not have a landingpad instruction!",&II);
1990 visitTerminatorInst(II);
1993 /// visitBinaryOperator - Check that both arguments to the binary operator are
1994 /// of the same type!
1996 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1997 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1998 "Both operands to a binary operator are not of the same type!", &B);
2000 switch (B.getOpcode()) {
2001 // Check that integer arithmetic operators are only used with
2002 // integral operands.
2003 case Instruction::Add:
2004 case Instruction::Sub:
2005 case Instruction::Mul:
2006 case Instruction::SDiv:
2007 case Instruction::UDiv:
2008 case Instruction::SRem:
2009 case Instruction::URem:
2010 Assert1(B.getType()->isIntOrIntVectorTy(),
2011 "Integer arithmetic operators only work with integral types!", &B);
2012 Assert1(B.getType() == B.getOperand(0)->getType(),
2013 "Integer arithmetic operators must have same type "
2014 "for operands and result!", &B);
2016 // Check that floating-point arithmetic operators are only used with
2017 // floating-point operands.
2018 case Instruction::FAdd:
2019 case Instruction::FSub:
2020 case Instruction::FMul:
2021 case Instruction::FDiv:
2022 case Instruction::FRem:
2023 Assert1(B.getType()->isFPOrFPVectorTy(),
2024 "Floating-point arithmetic operators only work with "
2025 "floating-point types!", &B);
2026 Assert1(B.getType() == B.getOperand(0)->getType(),
2027 "Floating-point arithmetic operators must have same type "
2028 "for operands and result!", &B);
2030 // Check that logical operators are only used with integral operands.
2031 case Instruction::And:
2032 case Instruction::Or:
2033 case Instruction::Xor:
2034 Assert1(B.getType()->isIntOrIntVectorTy(),
2035 "Logical operators only work with integral types!", &B);
2036 Assert1(B.getType() == B.getOperand(0)->getType(),
2037 "Logical operators must have same type for operands and result!",
2040 case Instruction::Shl:
2041 case Instruction::LShr:
2042 case Instruction::AShr:
2043 Assert1(B.getType()->isIntOrIntVectorTy(),
2044 "Shifts only work with integral types!", &B);
2045 Assert1(B.getType() == B.getOperand(0)->getType(),
2046 "Shift return type must be same as operands!", &B);
2049 llvm_unreachable("Unknown BinaryOperator opcode!");
2052 visitInstruction(B);
2055 void Verifier::visitICmpInst(ICmpInst &IC) {
2056 // Check that the operands are the same type
2057 Type *Op0Ty = IC.getOperand(0)->getType();
2058 Type *Op1Ty = IC.getOperand(1)->getType();
2059 Assert1(Op0Ty == Op1Ty,
2060 "Both operands to ICmp instruction are not of the same type!", &IC);
2061 // Check that the operands are the right type
2062 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
2063 "Invalid operand types for ICmp instruction", &IC);
2064 // Check that the predicate is valid.
2065 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
2066 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
2067 "Invalid predicate in ICmp instruction!", &IC);
2069 visitInstruction(IC);
2072 void Verifier::visitFCmpInst(FCmpInst &FC) {
2073 // Check that the operands are the same type
2074 Type *Op0Ty = FC.getOperand(0)->getType();
2075 Type *Op1Ty = FC.getOperand(1)->getType();
2076 Assert1(Op0Ty == Op1Ty,
2077 "Both operands to FCmp instruction are not of the same type!", &FC);
2078 // Check that the operands are the right type
2079 Assert1(Op0Ty->isFPOrFPVectorTy(),
2080 "Invalid operand types for FCmp instruction", &FC);
2081 // Check that the predicate is valid.
2082 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
2083 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
2084 "Invalid predicate in FCmp instruction!", &FC);
2086 visitInstruction(FC);
2089 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
2090 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
2092 "Invalid extractelement operands!", &EI);
2093 visitInstruction(EI);
2096 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
2097 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
2100 "Invalid insertelement operands!", &IE);
2101 visitInstruction(IE);
2104 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
2105 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
2107 "Invalid shufflevector operands!", &SV);
2108 visitInstruction(SV);
2111 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
2112 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
2114 Assert1(isa<PointerType>(TargetTy),
2115 "GEP base pointer is not a vector or a vector of pointers", &GEP);
2116 Assert1(cast<PointerType>(TargetTy)->getElementType()->isSized(),
2117 "GEP into unsized type!", &GEP);
2118 Assert1(GEP.getPointerOperandType()->isVectorTy() ==
2119 GEP.getType()->isVectorTy(), "Vector GEP must return a vector value",
2122 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
2124 GetElementPtrInst::getIndexedType(GEP.getPointerOperandType(), Idxs);
2125 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
2127 Assert2(GEP.getType()->getScalarType()->isPointerTy() &&
2128 cast<PointerType>(GEP.getType()->getScalarType())->getElementType()
2129 == ElTy, "GEP is not of right type for indices!", &GEP, ElTy);
2131 if (GEP.getPointerOperandType()->isVectorTy()) {
2132 // Additional checks for vector GEPs.
2133 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
2134 Assert1(GepWidth == GEP.getType()->getVectorNumElements(),
2135 "Vector GEP result width doesn't match operand's", &GEP);
2136 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
2137 Type *IndexTy = Idxs[i]->getType();
2138 Assert1(IndexTy->isVectorTy(),
2139 "Vector GEP must have vector indices!", &GEP);
2140 unsigned IndexWidth = IndexTy->getVectorNumElements();
2141 Assert1(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
2144 visitInstruction(GEP);
2147 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
2148 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
2151 void Verifier::visitRangeMetadata(Instruction& I,
2152 MDNode* Range, Type* Ty) {
2154 Range == I.getMetadata(LLVMContext::MD_range) &&
2155 "precondition violation");
2157 unsigned NumOperands = Range->getNumOperands();
2158 Assert1(NumOperands % 2 == 0, "Unfinished range!", Range);
2159 unsigned NumRanges = NumOperands / 2;
2160 Assert1(NumRanges >= 1, "It should have at least one range!", Range);
2162 ConstantRange LastRange(1); // Dummy initial value
2163 for (unsigned i = 0; i < NumRanges; ++i) {
2165 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i));
2166 Assert1(Low, "The lower limit must be an integer!", Low);
2168 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i + 1));
2169 Assert1(High, "The upper limit must be an integer!", High);
2170 Assert1(High->getType() == Low->getType() &&
2171 High->getType() == Ty, "Range types must match instruction type!",
2174 APInt HighV = High->getValue();
2175 APInt LowV = Low->getValue();
2176 ConstantRange CurRange(LowV, HighV);
2177 Assert1(!CurRange.isEmptySet() && !CurRange.isFullSet(),
2178 "Range must not be empty!", Range);
2180 Assert1(CurRange.intersectWith(LastRange).isEmptySet(),
2181 "Intervals are overlapping", Range);
2182 Assert1(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
2184 Assert1(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
2187 LastRange = ConstantRange(LowV, HighV);
2189 if (NumRanges > 2) {
2191 mdconst::dyn_extract<ConstantInt>(Range->getOperand(0))->getValue();
2193 mdconst::dyn_extract<ConstantInt>(Range->getOperand(1))->getValue();
2194 ConstantRange FirstRange(FirstLow, FirstHigh);
2195 Assert1(FirstRange.intersectWith(LastRange).isEmptySet(),
2196 "Intervals are overlapping", Range);
2197 Assert1(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
2202 void Verifier::visitLoadInst(LoadInst &LI) {
2203 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
2204 Assert1(PTy, "Load operand must be a pointer.", &LI);
2205 Type *ElTy = PTy->getElementType();
2206 Assert2(ElTy == LI.getType(),
2207 "Load result type does not match pointer operand type!", &LI, ElTy);
2208 Assert1(LI.getAlignment() <= Value::MaximumAlignment,
2209 "huge alignment values are unsupported", &LI);
2210 if (LI.isAtomic()) {
2211 Assert1(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
2212 "Load cannot have Release ordering", &LI);
2213 Assert1(LI.getAlignment() != 0,
2214 "Atomic load must specify explicit alignment", &LI);
2215 if (!ElTy->isPointerTy()) {
2216 Assert2(ElTy->isIntegerTy(),
2217 "atomic load operand must have integer type!",
2219 unsigned Size = ElTy->getPrimitiveSizeInBits();
2220 Assert2(Size >= 8 && !(Size & (Size - 1)),
2221 "atomic load operand must be power-of-two byte-sized integer",
2225 Assert1(LI.getSynchScope() == CrossThread,
2226 "Non-atomic load cannot have SynchronizationScope specified", &LI);
2229 visitInstruction(LI);
2232 void Verifier::visitStoreInst(StoreInst &SI) {
2233 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
2234 Assert1(PTy, "Store operand must be a pointer.", &SI);
2235 Type *ElTy = PTy->getElementType();
2236 Assert2(ElTy == SI.getOperand(0)->getType(),
2237 "Stored value type does not match pointer operand type!",
2239 Assert1(SI.getAlignment() <= Value::MaximumAlignment,
2240 "huge alignment values are unsupported", &SI);
2241 if (SI.isAtomic()) {
2242 Assert1(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
2243 "Store cannot have Acquire ordering", &SI);
2244 Assert1(SI.getAlignment() != 0,
2245 "Atomic store must specify explicit alignment", &SI);
2246 if (!ElTy->isPointerTy()) {
2247 Assert2(ElTy->isIntegerTy(),
2248 "atomic store operand must have integer type!",
2250 unsigned Size = ElTy->getPrimitiveSizeInBits();
2251 Assert2(Size >= 8 && !(Size & (Size - 1)),
2252 "atomic store operand must be power-of-two byte-sized integer",
2256 Assert1(SI.getSynchScope() == CrossThread,
2257 "Non-atomic store cannot have SynchronizationScope specified", &SI);
2259 visitInstruction(SI);
2262 void Verifier::visitAllocaInst(AllocaInst &AI) {
2263 SmallPtrSet<const Type*, 4> Visited;
2264 PointerType *PTy = AI.getType();
2265 Assert1(PTy->getAddressSpace() == 0,
2266 "Allocation instruction pointer not in the generic address space!",
2268 Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
2270 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
2271 "Alloca array size must have integer type", &AI);
2272 Assert1(AI.getAlignment() <= Value::MaximumAlignment,
2273 "huge alignment values are unsupported", &AI);
2275 visitInstruction(AI);
2278 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
2280 // FIXME: more conditions???
2281 Assert1(CXI.getSuccessOrdering() != NotAtomic,
2282 "cmpxchg instructions must be atomic.", &CXI);
2283 Assert1(CXI.getFailureOrdering() != NotAtomic,
2284 "cmpxchg instructions must be atomic.", &CXI);
2285 Assert1(CXI.getSuccessOrdering() != Unordered,
2286 "cmpxchg instructions cannot be unordered.", &CXI);
2287 Assert1(CXI.getFailureOrdering() != Unordered,
2288 "cmpxchg instructions cannot be unordered.", &CXI);
2289 Assert1(CXI.getSuccessOrdering() >= CXI.getFailureOrdering(),
2290 "cmpxchg instructions be at least as constrained on success as fail",
2292 Assert1(CXI.getFailureOrdering() != Release &&
2293 CXI.getFailureOrdering() != AcquireRelease,
2294 "cmpxchg failure ordering cannot include release semantics", &CXI);
2296 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
2297 Assert1(PTy, "First cmpxchg operand must be a pointer.", &CXI);
2298 Type *ElTy = PTy->getElementType();
2299 Assert2(ElTy->isIntegerTy(),
2300 "cmpxchg operand must have integer type!",
2302 unsigned Size = ElTy->getPrimitiveSizeInBits();
2303 Assert2(Size >= 8 && !(Size & (Size - 1)),
2304 "cmpxchg operand must be power-of-two byte-sized integer",
2306 Assert2(ElTy == CXI.getOperand(1)->getType(),
2307 "Expected value type does not match pointer operand type!",
2309 Assert2(ElTy == CXI.getOperand(2)->getType(),
2310 "Stored value type does not match pointer operand type!",
2312 visitInstruction(CXI);
2315 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
2316 Assert1(RMWI.getOrdering() != NotAtomic,
2317 "atomicrmw instructions must be atomic.", &RMWI);
2318 Assert1(RMWI.getOrdering() != Unordered,
2319 "atomicrmw instructions cannot be unordered.", &RMWI);
2320 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
2321 Assert1(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
2322 Type *ElTy = PTy->getElementType();
2323 Assert2(ElTy->isIntegerTy(),
2324 "atomicrmw operand must have integer type!",
2326 unsigned Size = ElTy->getPrimitiveSizeInBits();
2327 Assert2(Size >= 8 && !(Size & (Size - 1)),
2328 "atomicrmw operand must be power-of-two byte-sized integer",
2330 Assert2(ElTy == RMWI.getOperand(1)->getType(),
2331 "Argument value type does not match pointer operand type!",
2333 Assert1(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
2334 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
2335 "Invalid binary operation!", &RMWI);
2336 visitInstruction(RMWI);
2339 void Verifier::visitFenceInst(FenceInst &FI) {
2340 const AtomicOrdering Ordering = FI.getOrdering();
2341 Assert1(Ordering == Acquire || Ordering == Release ||
2342 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
2343 "fence instructions may only have "
2344 "acquire, release, acq_rel, or seq_cst ordering.", &FI);
2345 visitInstruction(FI);
2348 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
2349 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
2350 EVI.getIndices()) ==
2352 "Invalid ExtractValueInst operands!", &EVI);
2354 visitInstruction(EVI);
2357 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
2358 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
2359 IVI.getIndices()) ==
2360 IVI.getOperand(1)->getType(),
2361 "Invalid InsertValueInst operands!", &IVI);
2363 visitInstruction(IVI);
2366 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
2367 BasicBlock *BB = LPI.getParent();
2369 // The landingpad instruction is ill-formed if it doesn't have any clauses and
2371 Assert1(LPI.getNumClauses() > 0 || LPI.isCleanup(),
2372 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
2374 // The landingpad instruction defines its parent as a landing pad block. The
2375 // landing pad block may be branched to only by the unwind edge of an invoke.
2376 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
2377 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
2378 Assert1(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
2379 "Block containing LandingPadInst must be jumped to "
2380 "only by the unwind edge of an invoke.", &LPI);
2383 // The landingpad instruction must be the first non-PHI instruction in the
2385 Assert1(LPI.getParent()->getLandingPadInst() == &LPI,
2386 "LandingPadInst not the first non-PHI instruction in the block.",
2389 // The personality functions for all landingpad instructions within the same
2390 // function should match.
2392 Assert1(LPI.getPersonalityFn() == PersonalityFn,
2393 "Personality function doesn't match others in function", &LPI);
2394 PersonalityFn = LPI.getPersonalityFn();
2396 // All operands must be constants.
2397 Assert1(isa<Constant>(PersonalityFn), "Personality function is not constant!",
2399 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
2400 Constant *Clause = LPI.getClause(i);
2401 if (LPI.isCatch(i)) {
2402 Assert1(isa<PointerType>(Clause->getType()),
2403 "Catch operand does not have pointer type!", &LPI);
2405 Assert1(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
2406 Assert1(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
2407 "Filter operand is not an array of constants!", &LPI);
2411 visitInstruction(LPI);
2414 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
2415 Instruction *Op = cast<Instruction>(I.getOperand(i));
2416 // If the we have an invalid invoke, don't try to compute the dominance.
2417 // We already reject it in the invoke specific checks and the dominance
2418 // computation doesn't handle multiple edges.
2419 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2420 if (II->getNormalDest() == II->getUnwindDest())
2424 const Use &U = I.getOperandUse(i);
2425 Assert2(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
2426 "Instruction does not dominate all uses!", Op, &I);
2429 /// verifyInstruction - Verify that an instruction is well formed.
2431 void Verifier::visitInstruction(Instruction &I) {
2432 BasicBlock *BB = I.getParent();
2433 Assert1(BB, "Instruction not embedded in basic block!", &I);
2435 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2436 for (User *U : I.users()) {
2437 Assert1(U != (User*)&I || !DT.isReachableFromEntry(BB),
2438 "Only PHI nodes may reference their own value!", &I);
2442 // Check that void typed values don't have names
2443 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
2444 "Instruction has a name, but provides a void value!", &I);
2446 // Check that the return value of the instruction is either void or a legal
2448 Assert1(I.getType()->isVoidTy() ||
2449 I.getType()->isFirstClassType(),
2450 "Instruction returns a non-scalar type!", &I);
2452 // Check that the instruction doesn't produce metadata. Calls are already
2453 // checked against the callee type.
2454 Assert1(!I.getType()->isMetadataTy() ||
2455 isa<CallInst>(I) || isa<InvokeInst>(I),
2456 "Invalid use of metadata!", &I);
2458 // Check that all uses of the instruction, if they are instructions
2459 // themselves, actually have parent basic blocks. If the use is not an
2460 // instruction, it is an error!
2461 for (Use &U : I.uses()) {
2462 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
2463 Assert2(Used->getParent() != nullptr, "Instruction referencing"
2464 " instruction not embedded in a basic block!", &I, Used);
2466 CheckFailed("Use of instruction is not an instruction!", U);
2471 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2472 Assert1(I.getOperand(i) != nullptr, "Instruction has null operand!", &I);
2474 // Check to make sure that only first-class-values are operands to
2476 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2477 Assert1(0, "Instruction operands must be first-class values!", &I);
2480 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2481 // Check to make sure that the "address of" an intrinsic function is never
2483 Assert1(!F->isIntrinsic() || i == (isa<CallInst>(I) ? e-1 :
2484 isa<InvokeInst>(I) ? e-3 : 0),
2485 "Cannot take the address of an intrinsic!", &I);
2486 Assert1(!F->isIntrinsic() || isa<CallInst>(I) ||
2487 F->getIntrinsicID() == Intrinsic::donothing ||
2488 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void ||
2489 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64,
2490 "Cannot invoke an intrinsinc other than"
2491 " donothing or patchpoint", &I);
2492 Assert1(F->getParent() == M, "Referencing function in another module!",
2494 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2495 Assert1(OpBB->getParent() == BB->getParent(),
2496 "Referring to a basic block in another function!", &I);
2497 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2498 Assert1(OpArg->getParent() == BB->getParent(),
2499 "Referring to an argument in another function!", &I);
2500 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2501 Assert1(GV->getParent() == M, "Referencing global in another module!",
2503 } else if (isa<Instruction>(I.getOperand(i))) {
2504 verifyDominatesUse(I, i);
2505 } else if (isa<InlineAsm>(I.getOperand(i))) {
2506 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2507 (i + 3 == e && isa<InvokeInst>(I)),
2508 "Cannot take the address of an inline asm!", &I);
2509 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2510 if (CE->getType()->isPtrOrPtrVectorTy()) {
2511 // If we have a ConstantExpr pointer, we need to see if it came from an
2512 // illegal bitcast (inttoptr <constant int> )
2513 SmallVector<const ConstantExpr *, 4> Stack;
2514 SmallPtrSet<const ConstantExpr *, 4> Visited;
2515 Stack.push_back(CE);
2517 while (!Stack.empty()) {
2518 const ConstantExpr *V = Stack.pop_back_val();
2519 if (!Visited.insert(V).second)
2522 VerifyConstantExprBitcastType(V);
2524 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2525 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2526 Stack.push_back(Op);
2533 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2534 Assert1(I.getType()->isFPOrFPVectorTy(),
2535 "fpmath requires a floating point result!", &I);
2536 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2537 if (ConstantFP *CFP0 =
2538 mdconst::dyn_extract_or_null<ConstantFP>(MD->getOperand(0))) {
2539 APFloat Accuracy = CFP0->getValueAPF();
2540 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2541 "fpmath accuracy not a positive number!", &I);
2543 Assert1(false, "invalid fpmath accuracy!", &I);
2547 if (MDNode *Range = I.getMetadata(LLVMContext::MD_range)) {
2548 Assert1(isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),
2549 "Ranges are only for loads, calls and invokes!", &I);
2550 visitRangeMetadata(I, Range, I.getType());
2553 if (I.getMetadata(LLVMContext::MD_nonnull)) {
2554 Assert1(I.getType()->isPointerTy(),
2555 "nonnull applies only to pointer types", &I);
2556 Assert1(isa<LoadInst>(I),
2557 "nonnull applies only to load instructions, use attributes"
2558 " for calls or invokes", &I);
2561 InstsInThisBlock.insert(&I);
2564 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2565 /// intrinsic argument or return value) matches the type constraints specified
2566 /// by the .td file (e.g. an "any integer" argument really is an integer).
2568 /// This return true on error but does not print a message.
2569 bool Verifier::VerifyIntrinsicType(Type *Ty,
2570 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2571 SmallVectorImpl<Type*> &ArgTys) {
2572 using namespace Intrinsic;
2574 // If we ran out of descriptors, there are too many arguments.
2575 if (Infos.empty()) return true;
2576 IITDescriptor D = Infos.front();
2577 Infos = Infos.slice(1);
2580 case IITDescriptor::Void: return !Ty->isVoidTy();
2581 case IITDescriptor::VarArg: return true;
2582 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2583 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2584 case IITDescriptor::Half: return !Ty->isHalfTy();
2585 case IITDescriptor::Float: return !Ty->isFloatTy();
2586 case IITDescriptor::Double: return !Ty->isDoubleTy();
2587 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2588 case IITDescriptor::Vector: {
2589 VectorType *VT = dyn_cast<VectorType>(Ty);
2590 return !VT || VT->getNumElements() != D.Vector_Width ||
2591 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2593 case IITDescriptor::Pointer: {
2594 PointerType *PT = dyn_cast<PointerType>(Ty);
2595 return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2596 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2599 case IITDescriptor::Struct: {
2600 StructType *ST = dyn_cast<StructType>(Ty);
2601 if (!ST || ST->getNumElements() != D.Struct_NumElements)
2604 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2605 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2610 case IITDescriptor::Argument:
2611 // Two cases here - If this is the second occurrence of an argument, verify
2612 // that the later instance matches the previous instance.
2613 if (D.getArgumentNumber() < ArgTys.size())
2614 return Ty != ArgTys[D.getArgumentNumber()];
2616 // Otherwise, if this is the first instance of an argument, record it and
2617 // verify the "Any" kind.
2618 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2619 ArgTys.push_back(Ty);
2621 switch (D.getArgumentKind()) {
2622 case IITDescriptor::AK_Any: return false; // Success
2623 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2624 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2625 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2626 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2628 llvm_unreachable("all argument kinds not covered");
2630 case IITDescriptor::ExtendArgument: {
2631 // This may only be used when referring to a previous vector argument.
2632 if (D.getArgumentNumber() >= ArgTys.size())
2635 Type *NewTy = ArgTys[D.getArgumentNumber()];
2636 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2637 NewTy = VectorType::getExtendedElementVectorType(VTy);
2638 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2639 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2645 case IITDescriptor::TruncArgument: {
2646 // This may only be used when referring to a previous vector argument.
2647 if (D.getArgumentNumber() >= ArgTys.size())
2650 Type *NewTy = ArgTys[D.getArgumentNumber()];
2651 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2652 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2653 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2654 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
2660 case IITDescriptor::HalfVecArgument:
2661 // This may only be used when referring to a previous vector argument.
2662 return D.getArgumentNumber() >= ArgTys.size() ||
2663 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2664 VectorType::getHalfElementsVectorType(
2665 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2666 case IITDescriptor::SameVecWidthArgument: {
2667 if (D.getArgumentNumber() >= ArgTys.size())
2669 VectorType * ReferenceType =
2670 dyn_cast<VectorType>(ArgTys[D.getArgumentNumber()]);
2671 VectorType *ThisArgType = dyn_cast<VectorType>(Ty);
2672 if (!ThisArgType || !ReferenceType ||
2673 (ReferenceType->getVectorNumElements() !=
2674 ThisArgType->getVectorNumElements()))
2676 return VerifyIntrinsicType(ThisArgType->getVectorElementType(),
2679 case IITDescriptor::PtrToArgument: {
2680 if (D.getArgumentNumber() >= ArgTys.size())
2682 Type * ReferenceType = ArgTys[D.getArgumentNumber()];
2683 PointerType *ThisArgType = dyn_cast<PointerType>(Ty);
2684 return (!ThisArgType || ThisArgType->getElementType() != ReferenceType);
2686 case IITDescriptor::VecOfPtrsToElt: {
2687 if (D.getArgumentNumber() >= ArgTys.size())
2689 VectorType * ReferenceType =
2690 dyn_cast<VectorType> (ArgTys[D.getArgumentNumber()]);
2691 VectorType *ThisArgVecTy = dyn_cast<VectorType>(Ty);
2692 if (!ThisArgVecTy || !ReferenceType ||
2693 (ReferenceType->getVectorNumElements() !=
2694 ThisArgVecTy->getVectorNumElements()))
2696 PointerType *ThisArgEltTy =
2697 dyn_cast<PointerType>(ThisArgVecTy->getVectorElementType());
2700 return (!(ThisArgEltTy->getElementType() ==
2701 ReferenceType->getVectorElementType()));
2704 llvm_unreachable("unhandled");
2707 /// \brief Verify if the intrinsic has variable arguments.
2708 /// This method is intended to be called after all the fixed arguments have been
2711 /// This method returns true on error and does not print an error message.
2713 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2714 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2715 using namespace Intrinsic;
2717 // If there are no descriptors left, then it can't be a vararg.
2719 return isVarArg ? true : false;
2721 // There should be only one descriptor remaining at this point.
2722 if (Infos.size() != 1)
2725 // Check and verify the descriptor.
2726 IITDescriptor D = Infos.front();
2727 Infos = Infos.slice(1);
2728 if (D.Kind == IITDescriptor::VarArg)
2729 return isVarArg ? false : true;
2734 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2736 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2737 Function *IF = CI.getCalledFunction();
2738 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2741 // Verify that the intrinsic prototype lines up with what the .td files
2743 FunctionType *IFTy = IF->getFunctionType();
2744 bool IsVarArg = IFTy->isVarArg();
2746 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2747 getIntrinsicInfoTableEntries(ID, Table);
2748 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2750 SmallVector<Type *, 4> ArgTys;
2751 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2752 "Intrinsic has incorrect return type!", IF);
2753 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2754 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2755 "Intrinsic has incorrect argument type!", IF);
2757 // Verify if the intrinsic call matches the vararg property.
2759 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2760 "Intrinsic was not defined with variable arguments!", IF);
2762 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2763 "Callsite was not defined with variable arguments!", IF);
2765 // All descriptors should be absorbed by now.
2766 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2768 // Now that we have the intrinsic ID and the actual argument types (and we
2769 // know they are legal for the intrinsic!) get the intrinsic name through the
2770 // usual means. This allows us to verify the mangling of argument types into
2772 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
2773 Assert1(ExpectedName == IF->getName(),
2774 "Intrinsic name not mangled correctly for type arguments! "
2775 "Should be: " + ExpectedName, IF);
2777 // If the intrinsic takes MDNode arguments, verify that they are either global
2778 // or are local to *this* function.
2779 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2780 if (auto *MD = dyn_cast<MetadataAsValue>(CI.getArgOperand(i)))
2781 visitMetadataAsValue(*MD, CI.getParent()->getParent());
2786 case Intrinsic::ctlz: // llvm.ctlz
2787 case Intrinsic::cttz: // llvm.cttz
2788 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2789 "is_zero_undef argument of bit counting intrinsics must be a "
2790 "constant int", &CI);
2792 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2793 Assert1(CI.getArgOperand(0) && isa<MetadataAsValue>(CI.getArgOperand(0)),
2794 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2796 case Intrinsic::memcpy:
2797 case Intrinsic::memmove:
2798 case Intrinsic::memset:
2799 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2800 "alignment argument of memory intrinsics must be a constant int",
2802 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2803 "isvolatile argument of memory intrinsics must be a constant int",
2806 case Intrinsic::gcroot:
2807 case Intrinsic::gcwrite:
2808 case Intrinsic::gcread:
2809 if (ID == Intrinsic::gcroot) {
2811 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2812 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2813 Assert1(isa<Constant>(CI.getArgOperand(1)),
2814 "llvm.gcroot parameter #2 must be a constant.", &CI);
2815 if (!AI->getType()->getElementType()->isPointerTy()) {
2816 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2817 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2818 "or argument #2 must be a non-null constant.", &CI);
2822 Assert1(CI.getParent()->getParent()->hasGC(),
2823 "Enclosing function does not use GC.", &CI);
2825 case Intrinsic::init_trampoline:
2826 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2827 "llvm.init_trampoline parameter #2 must resolve to a function.",
2830 case Intrinsic::prefetch:
2831 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2832 isa<ConstantInt>(CI.getArgOperand(2)) &&
2833 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2834 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2835 "invalid arguments to llvm.prefetch",
2838 case Intrinsic::stackprotector:
2839 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2840 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2843 case Intrinsic::lifetime_start:
2844 case Intrinsic::lifetime_end:
2845 case Intrinsic::invariant_start:
2846 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2847 "size argument of memory use markers must be a constant integer",
2850 case Intrinsic::invariant_end:
2851 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2852 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2855 case Intrinsic::frameallocate: {
2856 BasicBlock *BB = CI.getParent();
2857 Assert1(BB == &BB->getParent()->front(),
2858 "llvm.frameallocate used outside of entry block", &CI);
2859 Assert1(!SawFrameAllocate,
2860 "multiple calls to llvm.frameallocate in one function", &CI);
2861 SawFrameAllocate = true;
2862 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2863 "llvm.frameallocate argument must be constant integer size", &CI);
2866 case Intrinsic::framerecover: {
2867 Value *FnArg = CI.getArgOperand(0)->stripPointerCasts();
2868 Function *Fn = dyn_cast<Function>(FnArg);
2869 Assert1(Fn && !Fn->isDeclaration(), "llvm.framerecover first "
2870 "argument must be function defined in this module", &CI);
2874 case Intrinsic::experimental_gc_statepoint:
2875 Assert1(!CI.isInlineAsm(),
2876 "gc.statepoint support for inline assembly unimplemented", &CI);
2878 VerifyStatepoint(ImmutableCallSite(&CI));
2880 case Intrinsic::experimental_gc_result_int:
2881 case Intrinsic::experimental_gc_result_float:
2882 case Intrinsic::experimental_gc_result_ptr:
2883 case Intrinsic::experimental_gc_result: {
2884 // Are we tied to a statepoint properly?
2885 CallSite StatepointCS(CI.getArgOperand(0));
2886 const Function *StatepointFn =
2887 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : nullptr;
2888 Assert2(StatepointFn && StatepointFn->isDeclaration() &&
2889 StatepointFn->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2890 "gc.result operand #1 must be from a statepoint",
2891 &CI, CI.getArgOperand(0));
2893 // Assert that result type matches wrapped callee.
2894 const Value *Target = StatepointCS.getArgument(0);
2895 const PointerType *PT = cast<PointerType>(Target->getType());
2896 const FunctionType *TargetFuncType =
2897 cast<FunctionType>(PT->getElementType());
2898 Assert1(CI.getType() == TargetFuncType->getReturnType(),
2899 "gc.result result type does not match wrapped callee",
2903 case Intrinsic::experimental_gc_relocate: {
2904 // Are we tied to a statepoint properly?
2905 CallSite StatepointCS(CI.getArgOperand(0));
2906 const Function *StatepointFn =
2907 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : nullptr;
2908 Assert2(StatepointFn && StatepointFn->isDeclaration() &&
2909 StatepointFn->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2910 "gc.relocate operand #1 must be from a statepoint",
2911 &CI, CI.getArgOperand(0));
2913 // Both the base and derived must be piped through the safepoint
2914 Value* Base = CI.getArgOperand(1);
2915 Assert1(isa<ConstantInt>(Base),
2916 "gc.relocate operand #2 must be integer offset", &CI);
2918 Value* Derived = CI.getArgOperand(2);
2919 Assert1(isa<ConstantInt>(Derived),
2920 "gc.relocate operand #3 must be integer offset", &CI);
2922 const int BaseIndex = cast<ConstantInt>(Base)->getZExtValue();
2923 const int DerivedIndex = cast<ConstantInt>(Derived)->getZExtValue();
2925 Assert1(0 <= BaseIndex &&
2926 BaseIndex < (int)StatepointCS.arg_size(),
2927 "gc.relocate: statepoint base index out of bounds", &CI);
2928 Assert1(0 <= DerivedIndex &&
2929 DerivedIndex < (int)StatepointCS.arg_size(),
2930 "gc.relocate: statepoint derived index out of bounds", &CI);
2932 // Check that BaseIndex and DerivedIndex fall within the 'gc parameters'
2933 // section of the statepoint's argument
2934 const int NumCallArgs =
2935 cast<ConstantInt>(StatepointCS.getArgument(1))->getZExtValue();
2936 const int NumDeoptArgs =
2937 cast<ConstantInt>(StatepointCS.getArgument(NumCallArgs + 3))->getZExtValue();
2938 const int GCParamArgsStart = NumCallArgs + NumDeoptArgs + 4;
2939 const int GCParamArgsEnd = StatepointCS.arg_size();
2940 Assert1(GCParamArgsStart <= BaseIndex &&
2941 BaseIndex < GCParamArgsEnd,
2942 "gc.relocate: statepoint base index doesn't fall within the "
2943 "'gc parameters' section of the statepoint call", &CI);
2944 Assert1(GCParamArgsStart <= DerivedIndex &&
2945 DerivedIndex < GCParamArgsEnd,
2946 "gc.relocate: statepoint derived index doesn't fall within the "
2947 "'gc parameters' section of the statepoint call", &CI);
2950 // Assert that the result type matches the type of the relocated pointer
2951 GCRelocateOperands Operands(&CI);
2952 Assert1(Operands.derivedPtr()->getType() == CI.getType(),
2953 "gc.relocate: relocating a pointer shouldn't change its type",
2960 void DebugInfoVerifier::verifyDebugInfo() {
2961 if (!VerifyDebugInfo)
2964 DebugInfoFinder Finder;
2965 Finder.processModule(*M);
2966 processInstructions(Finder);
2968 // Verify Debug Info.
2970 // NOTE: The loud braces are necessary for MSVC compatibility.
2971 for (DICompileUnit CU : Finder.compile_units()) {
2972 Assert1(CU.Verify(), "DICompileUnit does not Verify!", CU);
2974 for (DISubprogram S : Finder.subprograms()) {
2975 Assert1(S.Verify(), "DISubprogram does not Verify!", S);
2977 for (DIGlobalVariable GV : Finder.global_variables()) {
2978 Assert1(GV.Verify(), "DIGlobalVariable does not Verify!", GV);
2980 for (DIType T : Finder.types()) {
2981 Assert1(T.Verify(), "DIType does not Verify!", T);
2983 for (DIScope S : Finder.scopes()) {
2984 Assert1(S.Verify(), "DIScope does not Verify!", S);
2988 void DebugInfoVerifier::processInstructions(DebugInfoFinder &Finder) {
2989 for (const Function &F : *M)
2990 for (auto I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
2991 if (MDNode *MD = I->getMetadata(LLVMContext::MD_dbg))
2992 Finder.processLocation(*M, DILocation(MD));
2993 if (const CallInst *CI = dyn_cast<CallInst>(&*I))
2994 processCallInst(Finder, *CI);
2998 void DebugInfoVerifier::processCallInst(DebugInfoFinder &Finder,
2999 const CallInst &CI) {
3000 if (Function *F = CI.getCalledFunction())
3001 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
3003 case Intrinsic::dbg_declare: {
3004 auto *DDI = cast<DbgDeclareInst>(&CI);
3005 Finder.processDeclare(*M, DDI);
3006 if (auto E = DDI->getExpression())
3007 Assert1(DIExpression(E).Verify(), "DIExpression does not Verify!", E);
3010 case Intrinsic::dbg_value: {
3011 auto *DVI = cast<DbgValueInst>(&CI);
3012 Finder.processValue(*M, DVI);
3013 if (auto E = DVI->getExpression())
3014 Assert1(DIExpression(E).Verify(), "DIExpression does not Verify!", E);
3022 //===----------------------------------------------------------------------===//
3023 // Implement the public interfaces to this file...
3024 //===----------------------------------------------------------------------===//
3026 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
3027 Function &F = const_cast<Function &>(f);
3028 assert(!F.isDeclaration() && "Cannot verify external functions");
3030 raw_null_ostream NullStr;
3031 Verifier V(OS ? *OS : NullStr);
3033 // Note that this function's return value is inverted from what you would
3034 // expect of a function called "verify".
3035 return !V.verify(F);
3038 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
3039 raw_null_ostream NullStr;
3040 Verifier V(OS ? *OS : NullStr);
3042 bool Broken = false;
3043 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
3044 if (!I->isDeclaration() && !I->isMaterializable())
3045 Broken |= !V.verify(*I);
3047 // Note that this function's return value is inverted from what you would
3048 // expect of a function called "verify".
3049 DebugInfoVerifier DIV(OS ? *OS : NullStr);
3050 return !V.verify(M) || !DIV.verify(M) || Broken;
3054 struct VerifierLegacyPass : public FunctionPass {
3060 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
3061 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3063 explicit VerifierLegacyPass(bool FatalErrors)
3064 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
3065 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3068 bool runOnFunction(Function &F) override {
3069 if (!V.verify(F) && FatalErrors)
3070 report_fatal_error("Broken function found, compilation aborted!");
3075 bool doFinalization(Module &M) override {
3076 if (!V.verify(M) && FatalErrors)
3077 report_fatal_error("Broken module found, compilation aborted!");
3082 void getAnalysisUsage(AnalysisUsage &AU) const override {
3083 AU.setPreservesAll();
3086 struct DebugInfoVerifierLegacyPass : public ModulePass {
3089 DebugInfoVerifier V;
3092 DebugInfoVerifierLegacyPass() : ModulePass(ID), FatalErrors(true) {
3093 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3095 explicit DebugInfoVerifierLegacyPass(bool FatalErrors)
3096 : ModulePass(ID), V(dbgs()), FatalErrors(FatalErrors) {
3097 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3100 bool runOnModule(Module &M) override {
3101 if (!V.verify(M) && FatalErrors)
3102 report_fatal_error("Broken debug info found, compilation aborted!");
3107 void getAnalysisUsage(AnalysisUsage &AU) const override {
3108 AU.setPreservesAll();
3113 char VerifierLegacyPass::ID = 0;
3114 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
3116 char DebugInfoVerifierLegacyPass::ID = 0;
3117 INITIALIZE_PASS(DebugInfoVerifierLegacyPass, "verify-di", "Debug Info Verifier",
3120 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
3121 return new VerifierLegacyPass(FatalErrors);
3124 ModulePass *llvm::createDebugInfoVerifierPass(bool FatalErrors) {
3125 return new DebugInfoVerifierLegacyPass(FatalErrors);
3128 PreservedAnalyses VerifierPass::run(Module &M) {
3129 if (verifyModule(M, &dbgs()) && FatalErrors)
3130 report_fatal_error("Broken module found, compilation aborted!");
3132 return PreservedAnalyses::all();
3135 PreservedAnalyses VerifierPass::run(Function &F) {
3136 if (verifyFunction(F, &dbgs()) && FatalErrors)
3137 report_fatal_error("Broken function found, compilation aborted!");
3139 return PreservedAnalyses::all();