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 // The Module is invalid if the GlobalValue has private linkage. Entities
797 // with private linkage don't have entries in the symbol table.
798 if (const GlobalValue *GV = M->getNamedValue(C.getName()))
799 Assert1(!GV->hasPrivateLinkage(), "comdat global value has private linkage",
803 void Verifier::visitModuleIdents(const Module &M) {
804 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
808 // llvm.ident takes a list of metadata entry. Each entry has only one string.
809 // Scan each llvm.ident entry and make sure that this requirement is met.
810 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
811 const MDNode *N = Idents->getOperand(i);
812 Assert1(N->getNumOperands() == 1,
813 "incorrect number of operands in llvm.ident metadata", N);
814 Assert1(dyn_cast_or_null<MDString>(N->getOperand(0)),
815 ("invalid value for llvm.ident metadata entry operand"
816 "(the operand should be a string)"),
821 void Verifier::visitModuleFlags(const Module &M) {
822 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
825 // Scan each flag, and track the flags and requirements.
826 DenseMap<const MDString*, const MDNode*> SeenIDs;
827 SmallVector<const MDNode*, 16> Requirements;
828 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
829 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
832 // Validate that the requirements in the module are valid.
833 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
834 const MDNode *Requirement = Requirements[I];
835 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
836 const Metadata *ReqValue = Requirement->getOperand(1);
838 const MDNode *Op = SeenIDs.lookup(Flag);
840 CheckFailed("invalid requirement on flag, flag is not present in module",
845 if (Op->getOperand(2) != ReqValue) {
846 CheckFailed(("invalid requirement on flag, "
847 "flag does not have the required value"),
855 Verifier::visitModuleFlag(const MDNode *Op,
856 DenseMap<const MDString *, const MDNode *> &SeenIDs,
857 SmallVectorImpl<const MDNode *> &Requirements) {
858 // Each module flag should have three arguments, the merge behavior (a
859 // constant int), the flag ID (an MDString), and the value.
860 Assert1(Op->getNumOperands() == 3,
861 "incorrect number of operands in module flag", Op);
862 Module::ModFlagBehavior MFB;
863 if (!Module::isValidModFlagBehavior(Op->getOperand(0), MFB)) {
865 mdconst::dyn_extract_or_null<ConstantInt>(Op->getOperand(0)),
866 "invalid behavior operand in module flag (expected constant integer)",
869 "invalid behavior operand in module flag (unexpected constant)",
872 MDString *ID = dyn_cast_or_null<MDString>(Op->getOperand(1));
874 "invalid ID operand in module flag (expected metadata string)",
877 // Sanity check the values for behaviors with additional requirements.
880 case Module::Warning:
881 case Module::Override:
882 // These behavior types accept any value.
885 case Module::Require: {
886 // The value should itself be an MDNode with two operands, a flag ID (an
887 // MDString), and a value.
888 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
889 Assert1(Value && Value->getNumOperands() == 2,
890 "invalid value for 'require' module flag (expected metadata pair)",
892 Assert1(isa<MDString>(Value->getOperand(0)),
893 ("invalid value for 'require' module flag "
894 "(first value operand should be a string)"),
895 Value->getOperand(0));
897 // Append it to the list of requirements, to check once all module flags are
899 Requirements.push_back(Value);
904 case Module::AppendUnique: {
905 // These behavior types require the operand be an MDNode.
906 Assert1(isa<MDNode>(Op->getOperand(2)),
907 "invalid value for 'append'-type module flag "
908 "(expected a metadata node)", Op->getOperand(2));
913 // Unless this is a "requires" flag, check the ID is unique.
914 if (MFB != Module::Require) {
915 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
917 "module flag identifiers must be unique (or of 'require' type)",
922 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
923 bool isFunction, const Value *V) {
925 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
926 if (Attrs.getSlotIndex(I) == Idx) {
931 assert(Slot != ~0U && "Attribute set inconsistency!");
933 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
935 if (I->isStringAttribute())
938 if (I->getKindAsEnum() == Attribute::NoReturn ||
939 I->getKindAsEnum() == Attribute::NoUnwind ||
940 I->getKindAsEnum() == Attribute::NoInline ||
941 I->getKindAsEnum() == Attribute::AlwaysInline ||
942 I->getKindAsEnum() == Attribute::OptimizeForSize ||
943 I->getKindAsEnum() == Attribute::StackProtect ||
944 I->getKindAsEnum() == Attribute::StackProtectReq ||
945 I->getKindAsEnum() == Attribute::StackProtectStrong ||
946 I->getKindAsEnum() == Attribute::NoRedZone ||
947 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
948 I->getKindAsEnum() == Attribute::Naked ||
949 I->getKindAsEnum() == Attribute::InlineHint ||
950 I->getKindAsEnum() == Attribute::StackAlignment ||
951 I->getKindAsEnum() == Attribute::UWTable ||
952 I->getKindAsEnum() == Attribute::NonLazyBind ||
953 I->getKindAsEnum() == Attribute::ReturnsTwice ||
954 I->getKindAsEnum() == Attribute::SanitizeAddress ||
955 I->getKindAsEnum() == Attribute::SanitizeThread ||
956 I->getKindAsEnum() == Attribute::SanitizeMemory ||
957 I->getKindAsEnum() == Attribute::MinSize ||
958 I->getKindAsEnum() == Attribute::NoDuplicate ||
959 I->getKindAsEnum() == Attribute::Builtin ||
960 I->getKindAsEnum() == Attribute::NoBuiltin ||
961 I->getKindAsEnum() == Attribute::Cold ||
962 I->getKindAsEnum() == Attribute::OptimizeNone ||
963 I->getKindAsEnum() == Attribute::JumpTable) {
965 CheckFailed("Attribute '" + I->getAsString() +
966 "' only applies to functions!", V);
969 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
970 I->getKindAsEnum() == Attribute::ReadNone) {
972 CheckFailed("Attribute '" + I->getAsString() +
973 "' does not apply to function returns");
976 } else if (isFunction) {
977 CheckFailed("Attribute '" + I->getAsString() +
978 "' does not apply to functions!", V);
984 // VerifyParameterAttrs - Check the given attributes for an argument or return
985 // value of the specified type. The value V is printed in error messages.
986 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
987 bool isReturnValue, const Value *V) {
988 if (!Attrs.hasAttributes(Idx))
991 VerifyAttributeTypes(Attrs, Idx, false, V);
994 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
995 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
996 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
997 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
998 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
999 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
1000 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
1001 "'returned' do not apply to return values!", V);
1003 // Check for mutually incompatible attributes. Only inreg is compatible with
1005 unsigned AttrCount = 0;
1006 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
1007 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
1008 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
1009 Attrs.hasAttribute(Idx, Attribute::InReg);
1010 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
1011 Assert1(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
1012 "and 'sret' are incompatible!", V);
1014 Assert1(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
1015 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
1016 "'inalloca and readonly' are incompatible!", V);
1018 Assert1(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
1019 Attrs.hasAttribute(Idx, Attribute::Returned)), "Attributes "
1020 "'sret and returned' are incompatible!", V);
1022 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
1023 Attrs.hasAttribute(Idx, Attribute::SExt)), "Attributes "
1024 "'zeroext and signext' are incompatible!", V);
1026 Assert1(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
1027 Attrs.hasAttribute(Idx, Attribute::ReadOnly)), "Attributes "
1028 "'readnone and readonly' are incompatible!", V);
1030 Assert1(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
1031 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)), "Attributes "
1032 "'noinline and alwaysinline' are incompatible!", V);
1034 Assert1(!AttrBuilder(Attrs, Idx).
1035 hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
1036 "Wrong types for attribute: " +
1037 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx), V);
1039 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
1040 if (!PTy->getElementType()->isSized()) {
1041 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
1042 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
1043 "Attributes 'byval' and 'inalloca' do not support unsized types!",
1047 Assert1(!Attrs.hasAttribute(Idx, Attribute::ByVal),
1048 "Attribute 'byval' only applies to parameters with pointer type!",
1053 // VerifyFunctionAttrs - Check parameter attributes against a function type.
1054 // The value V is printed in error messages.
1055 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
1057 if (Attrs.isEmpty())
1060 bool SawNest = false;
1061 bool SawReturned = false;
1062 bool SawSRet = false;
1064 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
1065 unsigned Idx = Attrs.getSlotIndex(i);
1069 Ty = FT->getReturnType();
1070 else if (Idx-1 < FT->getNumParams())
1071 Ty = FT->getParamType(Idx-1);
1073 break; // VarArgs attributes, verified elsewhere.
1075 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
1080 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1081 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
1085 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1086 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1088 Assert1(Ty->canLosslesslyBitCastTo(FT->getReturnType()), "Incompatible "
1089 "argument and return types for 'returned' attribute", V);
1093 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
1094 Assert1(!SawSRet, "Cannot have multiple 'sret' parameters!", V);
1095 Assert1(Idx == 1 || Idx == 2,
1096 "Attribute 'sret' is not on first or second parameter!", V);
1100 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
1101 Assert1(Idx == FT->getNumParams(),
1102 "inalloca isn't on the last parameter!", V);
1106 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
1109 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
1111 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1112 Attribute::ReadNone) &&
1113 Attrs.hasAttribute(AttributeSet::FunctionIndex,
1114 Attribute::ReadOnly)),
1115 "Attributes 'readnone and readonly' are incompatible!", V);
1117 Assert1(!(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1118 Attribute::NoInline) &&
1119 Attrs.hasAttribute(AttributeSet::FunctionIndex,
1120 Attribute::AlwaysInline)),
1121 "Attributes 'noinline and alwaysinline' are incompatible!", V);
1123 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1124 Attribute::OptimizeNone)) {
1125 Assert1(Attrs.hasAttribute(AttributeSet::FunctionIndex,
1126 Attribute::NoInline),
1127 "Attribute 'optnone' requires 'noinline'!", V);
1129 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1130 Attribute::OptimizeForSize),
1131 "Attributes 'optsize and optnone' are incompatible!", V);
1133 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1134 Attribute::MinSize),
1135 "Attributes 'minsize and optnone' are incompatible!", V);
1138 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1139 Attribute::JumpTable)) {
1140 const GlobalValue *GV = cast<GlobalValue>(V);
1141 Assert1(GV->hasUnnamedAddr(),
1142 "Attribute 'jumptable' requires 'unnamed_addr'", V);
1147 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
1148 if (CE->getOpcode() != Instruction::BitCast)
1151 Assert1(CastInst::castIsValid(Instruction::BitCast, CE->getOperand(0),
1153 "Invalid bitcast", CE);
1156 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1157 if (Attrs.getNumSlots() == 0)
1160 unsigned LastSlot = Attrs.getNumSlots() - 1;
1161 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1162 if (LastIndex <= Params
1163 || (LastIndex == AttributeSet::FunctionIndex
1164 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1170 /// \brief Verify that statepoint intrinsic is well formed.
1171 void Verifier::VerifyStatepoint(ImmutableCallSite CS) {
1172 assert(CS.getCalledFunction() &&
1173 CS.getCalledFunction()->getIntrinsicID() ==
1174 Intrinsic::experimental_gc_statepoint);
1176 const Instruction &CI = *CS.getInstruction();
1178 Assert1(!CS.doesNotAccessMemory() &&
1179 !CS.onlyReadsMemory(),
1180 "gc.statepoint must read and write memory to preserve "
1181 "reordering restrictions required by safepoint semantics", &CI);
1183 const Value *Target = CS.getArgument(0);
1184 const PointerType *PT = dyn_cast<PointerType>(Target->getType());
1185 Assert2(PT && PT->getElementType()->isFunctionTy(),
1186 "gc.statepoint callee must be of function pointer type",
1188 FunctionType *TargetFuncType = cast<FunctionType>(PT->getElementType());
1190 const Value *NumCallArgsV = CS.getArgument(1);
1191 Assert1(isa<ConstantInt>(NumCallArgsV),
1192 "gc.statepoint number of arguments to underlying call "
1193 "must be constant integer", &CI);
1194 const int NumCallArgs = cast<ConstantInt>(NumCallArgsV)->getZExtValue();
1195 Assert1(NumCallArgs >= 0,
1196 "gc.statepoint number of arguments to underlying call "
1197 "must be positive", &CI);
1198 const int NumParams = (int)TargetFuncType->getNumParams();
1199 if (TargetFuncType->isVarArg()) {
1200 Assert1(NumCallArgs >= NumParams,
1201 "gc.statepoint mismatch in number of vararg call args", &CI);
1203 // TODO: Remove this limitation
1204 Assert1(TargetFuncType->getReturnType()->isVoidTy(),
1205 "gc.statepoint doesn't support wrapping non-void "
1206 "vararg functions yet", &CI);
1208 Assert1(NumCallArgs == NumParams,
1209 "gc.statepoint mismatch in number of call args", &CI);
1211 const Value *Unused = CS.getArgument(2);
1212 Assert1(isa<ConstantInt>(Unused) &&
1213 cast<ConstantInt>(Unused)->isNullValue(),
1214 "gc.statepoint parameter #3 must be zero", &CI);
1216 // Verify that the types of the call parameter arguments match
1217 // the type of the wrapped callee.
1218 for (int i = 0; i < NumParams; i++) {
1219 Type *ParamType = TargetFuncType->getParamType(i);
1220 Type *ArgType = CS.getArgument(3+i)->getType();
1221 Assert1(ArgType == ParamType,
1222 "gc.statepoint call argument does not match wrapped "
1223 "function type", &CI);
1225 const int EndCallArgsInx = 2+NumCallArgs;
1226 const Value *NumDeoptArgsV = CS.getArgument(EndCallArgsInx+1);
1227 Assert1(isa<ConstantInt>(NumDeoptArgsV),
1228 "gc.statepoint number of deoptimization arguments "
1229 "must be constant integer", &CI);
1230 const int NumDeoptArgs = cast<ConstantInt>(NumDeoptArgsV)->getZExtValue();
1231 Assert1(NumDeoptArgs >= 0,
1232 "gc.statepoint number of deoptimization arguments "
1233 "must be positive", &CI);
1235 Assert1(4 + NumCallArgs + NumDeoptArgs <= (int)CS.arg_size(),
1236 "gc.statepoint too few arguments according to length fields", &CI);
1238 // Check that the only uses of this gc.statepoint are gc.result or
1239 // gc.relocate calls which are tied to this statepoint and thus part
1240 // of the same statepoint sequence
1241 for (const User *U : CI.users()) {
1242 const CallInst *Call = dyn_cast<const CallInst>(U);
1243 Assert2(Call, "illegal use of statepoint token", &CI, U);
1244 if (!Call) continue;
1245 Assert2(isGCRelocate(Call) || isGCResult(Call),
1246 "gc.result or gc.relocate are the only value uses"
1247 "of a gc.statepoint", &CI, U);
1248 if (isGCResult(Call)) {
1249 Assert2(Call->getArgOperand(0) == &CI,
1250 "gc.result connected to wrong gc.statepoint",
1252 } else if (isGCRelocate(Call)) {
1253 Assert2(Call->getArgOperand(0) == &CI,
1254 "gc.relocate connected to wrong gc.statepoint",
1259 // Note: It is legal for a single derived pointer to be listed multiple
1260 // times. It's non-optimal, but it is legal. It can also happen after
1261 // insertion if we strip a bitcast away.
1262 // Note: It is really tempting to check that each base is relocated and
1263 // that a derived pointer is never reused as a base pointer. This turns
1264 // out to be problematic since optimizations run after safepoint insertion
1265 // can recognize equality properties that the insertion logic doesn't know
1266 // about. See example statepoint.ll in the verifier subdirectory
1269 // visitFunction - Verify that a function is ok.
1271 void Verifier::visitFunction(const Function &F) {
1272 // Check function arguments.
1273 FunctionType *FT = F.getFunctionType();
1274 unsigned NumArgs = F.arg_size();
1276 Assert1(Context == &F.getContext(),
1277 "Function context does not match Module context!", &F);
1279 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1280 Assert2(FT->getNumParams() == NumArgs,
1281 "# formal arguments must match # of arguments for function type!",
1283 Assert1(F.getReturnType()->isFirstClassType() ||
1284 F.getReturnType()->isVoidTy() ||
1285 F.getReturnType()->isStructTy(),
1286 "Functions cannot return aggregate values!", &F);
1288 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1289 "Invalid struct return type!", &F);
1291 AttributeSet Attrs = F.getAttributes();
1293 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
1294 "Attribute after last parameter!", &F);
1296 // Check function attributes.
1297 VerifyFunctionAttrs(FT, Attrs, &F);
1299 // On function declarations/definitions, we do not support the builtin
1300 // attribute. We do not check this in VerifyFunctionAttrs since that is
1301 // checking for Attributes that can/can not ever be on functions.
1302 Assert1(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1303 Attribute::Builtin),
1304 "Attribute 'builtin' can only be applied to a callsite.", &F);
1306 // Check that this function meets the restrictions on this calling convention.
1307 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
1308 // restrictions can be lifted.
1309 switch (F.getCallingConv()) {
1311 case CallingConv::C:
1313 case CallingConv::Fast:
1314 case CallingConv::Cold:
1315 case CallingConv::Intel_OCL_BI:
1316 case CallingConv::PTX_Kernel:
1317 case CallingConv::PTX_Device:
1318 Assert1(!F.isVarArg(), "Calling convention does not support varargs or "
1319 "perfect forwarding!", &F);
1323 bool isLLVMdotName = F.getName().size() >= 5 &&
1324 F.getName().substr(0, 5) == "llvm.";
1326 // Check that the argument values match the function type for this function...
1328 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1330 Assert2(I->getType() == FT->getParamType(i),
1331 "Argument value does not match function argument type!",
1332 I, FT->getParamType(i));
1333 Assert1(I->getType()->isFirstClassType(),
1334 "Function arguments must have first-class types!", I);
1336 Assert2(!I->getType()->isMetadataTy(),
1337 "Function takes metadata but isn't an intrinsic", I, &F);
1340 if (F.isMaterializable()) {
1341 // Function has a body somewhere we can't see.
1342 } else if (F.isDeclaration()) {
1343 Assert1(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1344 "invalid linkage type for function declaration", &F);
1346 // Verify that this function (which has a body) is not named "llvm.*". It
1347 // is not legal to define intrinsics.
1348 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1350 // Check the entry node
1351 const BasicBlock *Entry = &F.getEntryBlock();
1352 Assert1(pred_empty(Entry),
1353 "Entry block to function must not have predecessors!", Entry);
1355 // The address of the entry block cannot be taken, unless it is dead.
1356 if (Entry->hasAddressTaken()) {
1357 Assert1(!BlockAddress::lookup(Entry)->isConstantUsed(),
1358 "blockaddress may not be used with the entry block!", Entry);
1362 // If this function is actually an intrinsic, verify that it is only used in
1363 // direct call/invokes, never having its "address taken".
1364 if (F.getIntrinsicID()) {
1366 if (F.hasAddressTaken(&U))
1367 Assert1(0, "Invalid user of intrinsic instruction!", U);
1370 Assert1(!F.hasDLLImportStorageClass() ||
1371 (F.isDeclaration() && F.hasExternalLinkage()) ||
1372 F.hasAvailableExternallyLinkage(),
1373 "Function is marked as dllimport, but not external.", &F);
1376 // verifyBasicBlock - Verify that a basic block is well formed...
1378 void Verifier::visitBasicBlock(BasicBlock &BB) {
1379 InstsInThisBlock.clear();
1381 // Ensure that basic blocks have terminators!
1382 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1384 // Check constraints that this basic block imposes on all of the PHI nodes in
1386 if (isa<PHINode>(BB.front())) {
1387 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1388 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1389 std::sort(Preds.begin(), Preds.end());
1391 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1392 // Ensure that PHI nodes have at least one entry!
1393 Assert1(PN->getNumIncomingValues() != 0,
1394 "PHI nodes must have at least one entry. If the block is dead, "
1395 "the PHI should be removed!", PN);
1396 Assert1(PN->getNumIncomingValues() == Preds.size(),
1397 "PHINode should have one entry for each predecessor of its "
1398 "parent basic block!", PN);
1400 // Get and sort all incoming values in the PHI node...
1402 Values.reserve(PN->getNumIncomingValues());
1403 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1404 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1405 PN->getIncomingValue(i)));
1406 std::sort(Values.begin(), Values.end());
1408 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1409 // Check to make sure that if there is more than one entry for a
1410 // particular basic block in this PHI node, that the incoming values are
1413 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
1414 Values[i].second == Values[i-1].second,
1415 "PHI node has multiple entries for the same basic block with "
1416 "different incoming values!", PN, Values[i].first,
1417 Values[i].second, Values[i-1].second);
1419 // Check to make sure that the predecessors and PHI node entries are
1421 Assert3(Values[i].first == Preds[i],
1422 "PHI node entries do not match predecessors!", PN,
1423 Values[i].first, Preds[i]);
1428 // Check that all instructions have their parent pointers set up correctly.
1431 Assert(I.getParent() == &BB, "Instruction has bogus parent pointer!");
1435 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1436 // Ensure that terminators only exist at the end of the basic block.
1437 Assert1(&I == I.getParent()->getTerminator(),
1438 "Terminator found in the middle of a basic block!", I.getParent());
1439 visitInstruction(I);
1442 void Verifier::visitBranchInst(BranchInst &BI) {
1443 if (BI.isConditional()) {
1444 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
1445 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1447 visitTerminatorInst(BI);
1450 void Verifier::visitReturnInst(ReturnInst &RI) {
1451 Function *F = RI.getParent()->getParent();
1452 unsigned N = RI.getNumOperands();
1453 if (F->getReturnType()->isVoidTy())
1455 "Found return instr that returns non-void in Function of void "
1456 "return type!", &RI, F->getReturnType());
1458 Assert2(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1459 "Function return type does not match operand "
1460 "type of return inst!", &RI, F->getReturnType());
1462 // Check to make sure that the return value has necessary properties for
1464 visitTerminatorInst(RI);
1467 void Verifier::visitSwitchInst(SwitchInst &SI) {
1468 // Check to make sure that all of the constants in the switch instruction
1469 // have the same type as the switched-on value.
1470 Type *SwitchTy = SI.getCondition()->getType();
1471 SmallPtrSet<ConstantInt*, 32> Constants;
1472 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1473 Assert1(i.getCaseValue()->getType() == SwitchTy,
1474 "Switch constants must all be same type as switch value!", &SI);
1475 Assert2(Constants.insert(i.getCaseValue()).second,
1476 "Duplicate integer as switch case", &SI, i.getCaseValue());
1479 visitTerminatorInst(SI);
1482 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1483 Assert1(BI.getAddress()->getType()->isPointerTy(),
1484 "Indirectbr operand must have pointer type!", &BI);
1485 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1486 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
1487 "Indirectbr destinations must all have pointer type!", &BI);
1489 visitTerminatorInst(BI);
1492 void Verifier::visitSelectInst(SelectInst &SI) {
1493 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1495 "Invalid operands for select instruction!", &SI);
1497 Assert1(SI.getTrueValue()->getType() == SI.getType(),
1498 "Select values must have same type as select instruction!", &SI);
1499 visitInstruction(SI);
1502 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1503 /// a pass, if any exist, it's an error.
1505 void Verifier::visitUserOp1(Instruction &I) {
1506 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
1509 void Verifier::visitTruncInst(TruncInst &I) {
1510 // Get the source and destination types
1511 Type *SrcTy = I.getOperand(0)->getType();
1512 Type *DestTy = I.getType();
1514 // Get the size of the types in bits, we'll need this later
1515 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1516 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1518 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1519 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1520 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1521 "trunc source and destination must both be a vector or neither", &I);
1522 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
1524 visitInstruction(I);
1527 void Verifier::visitZExtInst(ZExtInst &I) {
1528 // Get the source and destination types
1529 Type *SrcTy = I.getOperand(0)->getType();
1530 Type *DestTy = I.getType();
1532 // Get the size of the types in bits, we'll need this later
1533 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1534 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1535 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1536 "zext source and destination must both be a vector or neither", &I);
1537 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1538 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1540 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
1542 visitInstruction(I);
1545 void Verifier::visitSExtInst(SExtInst &I) {
1546 // Get the source and destination types
1547 Type *SrcTy = I.getOperand(0)->getType();
1548 Type *DestTy = I.getType();
1550 // Get the size of the types in bits, we'll need this later
1551 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1552 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1554 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1555 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1556 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1557 "sext source and destination must both be a vector or neither", &I);
1558 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
1560 visitInstruction(I);
1563 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1564 // Get the source and destination types
1565 Type *SrcTy = I.getOperand(0)->getType();
1566 Type *DestTy = I.getType();
1567 // Get the size of the types in bits, we'll need this later
1568 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1569 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1571 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
1572 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
1573 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1574 "fptrunc source and destination must both be a vector or neither",&I);
1575 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
1577 visitInstruction(I);
1580 void Verifier::visitFPExtInst(FPExtInst &I) {
1581 // Get the source and destination types
1582 Type *SrcTy = I.getOperand(0)->getType();
1583 Type *DestTy = I.getType();
1585 // Get the size of the types in bits, we'll need this later
1586 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1587 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1589 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
1590 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
1591 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1592 "fpext source and destination must both be a vector or neither", &I);
1593 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
1595 visitInstruction(I);
1598 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1599 // Get the source and destination types
1600 Type *SrcTy = I.getOperand(0)->getType();
1601 Type *DestTy = I.getType();
1603 bool SrcVec = SrcTy->isVectorTy();
1604 bool DstVec = DestTy->isVectorTy();
1606 Assert1(SrcVec == DstVec,
1607 "UIToFP source and dest must both be vector or scalar", &I);
1608 Assert1(SrcTy->isIntOrIntVectorTy(),
1609 "UIToFP source must be integer or integer vector", &I);
1610 Assert1(DestTy->isFPOrFPVectorTy(),
1611 "UIToFP result must be FP or FP vector", &I);
1613 if (SrcVec && DstVec)
1614 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1615 cast<VectorType>(DestTy)->getNumElements(),
1616 "UIToFP source and dest vector length mismatch", &I);
1618 visitInstruction(I);
1621 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1622 // Get the source and destination types
1623 Type *SrcTy = I.getOperand(0)->getType();
1624 Type *DestTy = I.getType();
1626 bool SrcVec = SrcTy->isVectorTy();
1627 bool DstVec = DestTy->isVectorTy();
1629 Assert1(SrcVec == DstVec,
1630 "SIToFP source and dest must both be vector or scalar", &I);
1631 Assert1(SrcTy->isIntOrIntVectorTy(),
1632 "SIToFP source must be integer or integer vector", &I);
1633 Assert1(DestTy->isFPOrFPVectorTy(),
1634 "SIToFP result must be FP or FP vector", &I);
1636 if (SrcVec && DstVec)
1637 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1638 cast<VectorType>(DestTy)->getNumElements(),
1639 "SIToFP source and dest vector length mismatch", &I);
1641 visitInstruction(I);
1644 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1645 // Get the source and destination types
1646 Type *SrcTy = I.getOperand(0)->getType();
1647 Type *DestTy = I.getType();
1649 bool SrcVec = SrcTy->isVectorTy();
1650 bool DstVec = DestTy->isVectorTy();
1652 Assert1(SrcVec == DstVec,
1653 "FPToUI source and dest must both be vector or scalar", &I);
1654 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1656 Assert1(DestTy->isIntOrIntVectorTy(),
1657 "FPToUI result must be integer or integer vector", &I);
1659 if (SrcVec && DstVec)
1660 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1661 cast<VectorType>(DestTy)->getNumElements(),
1662 "FPToUI source and dest vector length mismatch", &I);
1664 visitInstruction(I);
1667 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1668 // Get the source and destination types
1669 Type *SrcTy = I.getOperand(0)->getType();
1670 Type *DestTy = I.getType();
1672 bool SrcVec = SrcTy->isVectorTy();
1673 bool DstVec = DestTy->isVectorTy();
1675 Assert1(SrcVec == DstVec,
1676 "FPToSI source and dest must both be vector or scalar", &I);
1677 Assert1(SrcTy->isFPOrFPVectorTy(),
1678 "FPToSI source must be FP or FP vector", &I);
1679 Assert1(DestTy->isIntOrIntVectorTy(),
1680 "FPToSI result must be integer or integer vector", &I);
1682 if (SrcVec && DstVec)
1683 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1684 cast<VectorType>(DestTy)->getNumElements(),
1685 "FPToSI source and dest vector length mismatch", &I);
1687 visitInstruction(I);
1690 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1691 // Get the source and destination types
1692 Type *SrcTy = I.getOperand(0)->getType();
1693 Type *DestTy = I.getType();
1695 Assert1(SrcTy->getScalarType()->isPointerTy(),
1696 "PtrToInt source must be pointer", &I);
1697 Assert1(DestTy->getScalarType()->isIntegerTy(),
1698 "PtrToInt result must be integral", &I);
1699 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1700 "PtrToInt type mismatch", &I);
1702 if (SrcTy->isVectorTy()) {
1703 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1704 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1705 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1706 "PtrToInt Vector width mismatch", &I);
1709 visitInstruction(I);
1712 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1713 // Get the source and destination types
1714 Type *SrcTy = I.getOperand(0)->getType();
1715 Type *DestTy = I.getType();
1717 Assert1(SrcTy->getScalarType()->isIntegerTy(),
1718 "IntToPtr source must be an integral", &I);
1719 Assert1(DestTy->getScalarType()->isPointerTy(),
1720 "IntToPtr result must be a pointer",&I);
1721 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1722 "IntToPtr type mismatch", &I);
1723 if (SrcTy->isVectorTy()) {
1724 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
1725 VectorType *VDest = dyn_cast<VectorType>(DestTy);
1726 Assert1(VSrc->getNumElements() == VDest->getNumElements(),
1727 "IntToPtr Vector width mismatch", &I);
1729 visitInstruction(I);
1732 void Verifier::visitBitCastInst(BitCastInst &I) {
1734 CastInst::castIsValid(Instruction::BitCast, I.getOperand(0), I.getType()),
1735 "Invalid bitcast", &I);
1736 visitInstruction(I);
1739 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
1740 Type *SrcTy = I.getOperand(0)->getType();
1741 Type *DestTy = I.getType();
1743 Assert1(SrcTy->isPtrOrPtrVectorTy(),
1744 "AddrSpaceCast source must be a pointer", &I);
1745 Assert1(DestTy->isPtrOrPtrVectorTy(),
1746 "AddrSpaceCast result must be a pointer", &I);
1747 Assert1(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
1748 "AddrSpaceCast must be between different address spaces", &I);
1749 if (SrcTy->isVectorTy())
1750 Assert1(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
1751 "AddrSpaceCast vector pointer number of elements mismatch", &I);
1752 visitInstruction(I);
1755 /// visitPHINode - Ensure that a PHI node is well formed.
1757 void Verifier::visitPHINode(PHINode &PN) {
1758 // Ensure that the PHI nodes are all grouped together at the top of the block.
1759 // This can be tested by checking whether the instruction before this is
1760 // either nonexistent (because this is begin()) or is a PHI node. If not,
1761 // then there is some other instruction before a PHI.
1762 Assert2(&PN == &PN.getParent()->front() ||
1763 isa<PHINode>(--BasicBlock::iterator(&PN)),
1764 "PHI nodes not grouped at top of basic block!",
1765 &PN, PN.getParent());
1767 // Check that all of the values of the PHI node have the same type as the
1768 // result, and that the incoming blocks are really basic blocks.
1769 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1770 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1771 "PHI node operands are not the same type as the result!", &PN);
1774 // All other PHI node constraints are checked in the visitBasicBlock method.
1776 visitInstruction(PN);
1779 void Verifier::VerifyCallSite(CallSite CS) {
1780 Instruction *I = CS.getInstruction();
1782 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1783 "Called function must be a pointer!", I);
1784 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1786 Assert1(FPTy->getElementType()->isFunctionTy(),
1787 "Called function is not pointer to function type!", I);
1788 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1790 // Verify that the correct number of arguments are being passed
1791 if (FTy->isVarArg())
1792 Assert1(CS.arg_size() >= FTy->getNumParams(),
1793 "Called function requires more parameters than were provided!",I);
1795 Assert1(CS.arg_size() == FTy->getNumParams(),
1796 "Incorrect number of arguments passed to called function!", I);
1798 // Verify that all arguments to the call match the function type.
1799 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1800 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1801 "Call parameter type does not match function signature!",
1802 CS.getArgument(i), FTy->getParamType(i), I);
1804 AttributeSet Attrs = CS.getAttributes();
1806 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1807 "Attribute after last parameter!", I);
1809 // Verify call attributes.
1810 VerifyFunctionAttrs(FTy, Attrs, I);
1812 // Conservatively check the inalloca argument.
1813 // We have a bug if we can find that there is an underlying alloca without
1815 if (CS.hasInAllocaArgument()) {
1816 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
1817 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
1818 Assert2(AI->isUsedWithInAlloca(),
1819 "inalloca argument for call has mismatched alloca", AI, I);
1822 if (FTy->isVarArg()) {
1823 // FIXME? is 'nest' even legal here?
1824 bool SawNest = false;
1825 bool SawReturned = false;
1827 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
1828 if (Attrs.hasAttribute(Idx, Attribute::Nest))
1830 if (Attrs.hasAttribute(Idx, Attribute::Returned))
1834 // Check attributes on the varargs part.
1835 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1836 Type *Ty = CS.getArgument(Idx-1)->getType();
1837 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
1839 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1840 Assert1(!SawNest, "More than one parameter has attribute nest!", I);
1844 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1845 Assert1(!SawReturned, "More than one parameter has attribute returned!",
1847 Assert1(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
1848 "Incompatible argument and return types for 'returned' "
1853 Assert1(!Attrs.hasAttribute(Idx, Attribute::StructRet),
1854 "Attribute 'sret' cannot be used for vararg call arguments!", I);
1856 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
1857 Assert1(Idx == CS.arg_size(), "inalloca isn't on the last argument!",
1862 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1863 if (CS.getCalledFunction() == nullptr ||
1864 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1865 for (FunctionType::param_iterator PI = FTy->param_begin(),
1866 PE = FTy->param_end(); PI != PE; ++PI)
1867 Assert1(!(*PI)->isMetadataTy(),
1868 "Function has metadata parameter but isn't an intrinsic", I);
1871 visitInstruction(*I);
1874 /// Two types are "congruent" if they are identical, or if they are both pointer
1875 /// types with different pointee types and the same address space.
1876 static bool isTypeCongruent(Type *L, Type *R) {
1879 PointerType *PL = dyn_cast<PointerType>(L);
1880 PointerType *PR = dyn_cast<PointerType>(R);
1883 return PL->getAddressSpace() == PR->getAddressSpace();
1886 static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
1887 static const Attribute::AttrKind ABIAttrs[] = {
1888 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
1889 Attribute::InReg, Attribute::Returned};
1891 for (auto AK : ABIAttrs) {
1892 if (Attrs.hasAttribute(I + 1, AK))
1893 Copy.addAttribute(AK);
1895 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
1896 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
1900 void Verifier::verifyMustTailCall(CallInst &CI) {
1901 Assert1(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI);
1903 // - The caller and callee prototypes must match. Pointer types of
1904 // parameters or return types may differ in pointee type, but not
1906 Function *F = CI.getParent()->getParent();
1907 auto GetFnTy = [](Value *V) {
1908 return cast<FunctionType>(
1909 cast<PointerType>(V->getType())->getElementType());
1911 FunctionType *CallerTy = GetFnTy(F);
1912 FunctionType *CalleeTy = GetFnTy(CI.getCalledValue());
1913 Assert1(CallerTy->getNumParams() == CalleeTy->getNumParams(),
1914 "cannot guarantee tail call due to mismatched parameter counts", &CI);
1915 Assert1(CallerTy->isVarArg() == CalleeTy->isVarArg(),
1916 "cannot guarantee tail call due to mismatched varargs", &CI);
1917 Assert1(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),
1918 "cannot guarantee tail call due to mismatched return types", &CI);
1919 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1921 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),
1922 "cannot guarantee tail call due to mismatched parameter types", &CI);
1925 // - The calling conventions of the caller and callee must match.
1926 Assert1(F->getCallingConv() == CI.getCallingConv(),
1927 "cannot guarantee tail call due to mismatched calling conv", &CI);
1929 // - All ABI-impacting function attributes, such as sret, byval, inreg,
1930 // returned, and inalloca, must match.
1931 AttributeSet CallerAttrs = F->getAttributes();
1932 AttributeSet CalleeAttrs = CI.getAttributes();
1933 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
1934 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
1935 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
1936 Assert2(CallerABIAttrs == CalleeABIAttrs,
1937 "cannot guarantee tail call due to mismatched ABI impacting "
1938 "function attributes", &CI, CI.getOperand(I));
1941 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
1942 // or a pointer bitcast followed by a ret instruction.
1943 // - The ret instruction must return the (possibly bitcasted) value
1944 // produced by the call or void.
1945 Value *RetVal = &CI;
1946 Instruction *Next = CI.getNextNode();
1948 // Handle the optional bitcast.
1949 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
1950 Assert1(BI->getOperand(0) == RetVal,
1951 "bitcast following musttail call must use the call", BI);
1953 Next = BI->getNextNode();
1956 // Check the return.
1957 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
1958 Assert1(Ret, "musttail call must be precede a ret with an optional bitcast",
1960 Assert1(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,
1961 "musttail call result must be returned", Ret);
1964 void Verifier::visitCallInst(CallInst &CI) {
1965 VerifyCallSite(&CI);
1967 if (CI.isMustTailCall())
1968 verifyMustTailCall(CI);
1970 if (Function *F = CI.getCalledFunction())
1971 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1972 visitIntrinsicFunctionCall(ID, CI);
1975 void Verifier::visitInvokeInst(InvokeInst &II) {
1976 VerifyCallSite(&II);
1978 // Verify that there is a landingpad instruction as the first non-PHI
1979 // instruction of the 'unwind' destination.
1980 Assert1(II.getUnwindDest()->isLandingPad(),
1981 "The unwind destination does not have a landingpad instruction!",&II);
1983 if (Function *F = II.getCalledFunction())
1984 // TODO: Ideally we should use visitIntrinsicFunction here. But it uses
1985 // CallInst as an input parameter. It not woth updating this whole
1986 // function only to support statepoint verification.
1987 if (F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint)
1988 VerifyStatepoint(ImmutableCallSite(&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 F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2491 "Cannot invoke an intrinsinc other than"
2492 " donothing or patchpoint", &I);
2493 Assert1(F->getParent() == M, "Referencing function in another module!",
2495 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2496 Assert1(OpBB->getParent() == BB->getParent(),
2497 "Referring to a basic block in another function!", &I);
2498 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2499 Assert1(OpArg->getParent() == BB->getParent(),
2500 "Referring to an argument in another function!", &I);
2501 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2502 Assert1(GV->getParent() == M, "Referencing global in another module!",
2504 } else if (isa<Instruction>(I.getOperand(i))) {
2505 verifyDominatesUse(I, i);
2506 } else if (isa<InlineAsm>(I.getOperand(i))) {
2507 Assert1((i + 1 == e && isa<CallInst>(I)) ||
2508 (i + 3 == e && isa<InvokeInst>(I)),
2509 "Cannot take the address of an inline asm!", &I);
2510 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2511 if (CE->getType()->isPtrOrPtrVectorTy()) {
2512 // If we have a ConstantExpr pointer, we need to see if it came from an
2513 // illegal bitcast (inttoptr <constant int> )
2514 SmallVector<const ConstantExpr *, 4> Stack;
2515 SmallPtrSet<const ConstantExpr *, 4> Visited;
2516 Stack.push_back(CE);
2518 while (!Stack.empty()) {
2519 const ConstantExpr *V = Stack.pop_back_val();
2520 if (!Visited.insert(V).second)
2523 VerifyConstantExprBitcastType(V);
2525 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2526 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2527 Stack.push_back(Op);
2534 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2535 Assert1(I.getType()->isFPOrFPVectorTy(),
2536 "fpmath requires a floating point result!", &I);
2537 Assert1(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2538 if (ConstantFP *CFP0 =
2539 mdconst::dyn_extract_or_null<ConstantFP>(MD->getOperand(0))) {
2540 APFloat Accuracy = CFP0->getValueAPF();
2541 Assert1(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2542 "fpmath accuracy not a positive number!", &I);
2544 Assert1(false, "invalid fpmath accuracy!", &I);
2548 if (MDNode *Range = I.getMetadata(LLVMContext::MD_range)) {
2549 Assert1(isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),
2550 "Ranges are only for loads, calls and invokes!", &I);
2551 visitRangeMetadata(I, Range, I.getType());
2554 if (I.getMetadata(LLVMContext::MD_nonnull)) {
2555 Assert1(I.getType()->isPointerTy(),
2556 "nonnull applies only to pointer types", &I);
2557 Assert1(isa<LoadInst>(I),
2558 "nonnull applies only to load instructions, use attributes"
2559 " for calls or invokes", &I);
2562 InstsInThisBlock.insert(&I);
2565 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2566 /// intrinsic argument or return value) matches the type constraints specified
2567 /// by the .td file (e.g. an "any integer" argument really is an integer).
2569 /// This return true on error but does not print a message.
2570 bool Verifier::VerifyIntrinsicType(Type *Ty,
2571 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2572 SmallVectorImpl<Type*> &ArgTys) {
2573 using namespace Intrinsic;
2575 // If we ran out of descriptors, there are too many arguments.
2576 if (Infos.empty()) return true;
2577 IITDescriptor D = Infos.front();
2578 Infos = Infos.slice(1);
2581 case IITDescriptor::Void: return !Ty->isVoidTy();
2582 case IITDescriptor::VarArg: return true;
2583 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2584 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2585 case IITDescriptor::Half: return !Ty->isHalfTy();
2586 case IITDescriptor::Float: return !Ty->isFloatTy();
2587 case IITDescriptor::Double: return !Ty->isDoubleTy();
2588 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2589 case IITDescriptor::Vector: {
2590 VectorType *VT = dyn_cast<VectorType>(Ty);
2591 return !VT || VT->getNumElements() != D.Vector_Width ||
2592 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2594 case IITDescriptor::Pointer: {
2595 PointerType *PT = dyn_cast<PointerType>(Ty);
2596 return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2597 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2600 case IITDescriptor::Struct: {
2601 StructType *ST = dyn_cast<StructType>(Ty);
2602 if (!ST || ST->getNumElements() != D.Struct_NumElements)
2605 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2606 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2611 case IITDescriptor::Argument:
2612 // Two cases here - If this is the second occurrence of an argument, verify
2613 // that the later instance matches the previous instance.
2614 if (D.getArgumentNumber() < ArgTys.size())
2615 return Ty != ArgTys[D.getArgumentNumber()];
2617 // Otherwise, if this is the first instance of an argument, record it and
2618 // verify the "Any" kind.
2619 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2620 ArgTys.push_back(Ty);
2622 switch (D.getArgumentKind()) {
2623 case IITDescriptor::AK_Any: return false; // Success
2624 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2625 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2626 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2627 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2629 llvm_unreachable("all argument kinds not covered");
2631 case IITDescriptor::ExtendArgument: {
2632 // This may only be used when referring to a previous vector argument.
2633 if (D.getArgumentNumber() >= ArgTys.size())
2636 Type *NewTy = ArgTys[D.getArgumentNumber()];
2637 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2638 NewTy = VectorType::getExtendedElementVectorType(VTy);
2639 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2640 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2646 case IITDescriptor::TruncArgument: {
2647 // This may only be used when referring to a previous vector argument.
2648 if (D.getArgumentNumber() >= ArgTys.size())
2651 Type *NewTy = ArgTys[D.getArgumentNumber()];
2652 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2653 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2654 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2655 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
2661 case IITDescriptor::HalfVecArgument:
2662 // This may only be used when referring to a previous vector argument.
2663 return D.getArgumentNumber() >= ArgTys.size() ||
2664 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
2665 VectorType::getHalfElementsVectorType(
2666 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
2667 case IITDescriptor::SameVecWidthArgument: {
2668 if (D.getArgumentNumber() >= ArgTys.size())
2670 VectorType * ReferenceType =
2671 dyn_cast<VectorType>(ArgTys[D.getArgumentNumber()]);
2672 VectorType *ThisArgType = dyn_cast<VectorType>(Ty);
2673 if (!ThisArgType || !ReferenceType ||
2674 (ReferenceType->getVectorNumElements() !=
2675 ThisArgType->getVectorNumElements()))
2677 return VerifyIntrinsicType(ThisArgType->getVectorElementType(),
2680 case IITDescriptor::PtrToArgument: {
2681 if (D.getArgumentNumber() >= ArgTys.size())
2683 Type * ReferenceType = ArgTys[D.getArgumentNumber()];
2684 PointerType *ThisArgType = dyn_cast<PointerType>(Ty);
2685 return (!ThisArgType || ThisArgType->getElementType() != ReferenceType);
2687 case IITDescriptor::VecOfPtrsToElt: {
2688 if (D.getArgumentNumber() >= ArgTys.size())
2690 VectorType * ReferenceType =
2691 dyn_cast<VectorType> (ArgTys[D.getArgumentNumber()]);
2692 VectorType *ThisArgVecTy = dyn_cast<VectorType>(Ty);
2693 if (!ThisArgVecTy || !ReferenceType ||
2694 (ReferenceType->getVectorNumElements() !=
2695 ThisArgVecTy->getVectorNumElements()))
2697 PointerType *ThisArgEltTy =
2698 dyn_cast<PointerType>(ThisArgVecTy->getVectorElementType());
2701 return (!(ThisArgEltTy->getElementType() ==
2702 ReferenceType->getVectorElementType()));
2705 llvm_unreachable("unhandled");
2708 /// \brief Verify if the intrinsic has variable arguments.
2709 /// This method is intended to be called after all the fixed arguments have been
2712 /// This method returns true on error and does not print an error message.
2714 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
2715 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
2716 using namespace Intrinsic;
2718 // If there are no descriptors left, then it can't be a vararg.
2720 return isVarArg ? true : false;
2722 // There should be only one descriptor remaining at this point.
2723 if (Infos.size() != 1)
2726 // Check and verify the descriptor.
2727 IITDescriptor D = Infos.front();
2728 Infos = Infos.slice(1);
2729 if (D.Kind == IITDescriptor::VarArg)
2730 return isVarArg ? false : true;
2735 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
2737 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
2738 Function *IF = CI.getCalledFunction();
2739 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
2742 // Verify that the intrinsic prototype lines up with what the .td files
2744 FunctionType *IFTy = IF->getFunctionType();
2745 bool IsVarArg = IFTy->isVarArg();
2747 SmallVector<Intrinsic::IITDescriptor, 8> Table;
2748 getIntrinsicInfoTableEntries(ID, Table);
2749 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
2751 SmallVector<Type *, 4> ArgTys;
2752 Assert1(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
2753 "Intrinsic has incorrect return type!", IF);
2754 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
2755 Assert1(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
2756 "Intrinsic has incorrect argument type!", IF);
2758 // Verify if the intrinsic call matches the vararg property.
2760 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2761 "Intrinsic was not defined with variable arguments!", IF);
2763 Assert1(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
2764 "Callsite was not defined with variable arguments!", IF);
2766 // All descriptors should be absorbed by now.
2767 Assert1(TableRef.empty(), "Intrinsic has too few arguments!", IF);
2769 // Now that we have the intrinsic ID and the actual argument types (and we
2770 // know they are legal for the intrinsic!) get the intrinsic name through the
2771 // usual means. This allows us to verify the mangling of argument types into
2773 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
2774 Assert1(ExpectedName == IF->getName(),
2775 "Intrinsic name not mangled correctly for type arguments! "
2776 "Should be: " + ExpectedName, IF);
2778 // If the intrinsic takes MDNode arguments, verify that they are either global
2779 // or are local to *this* function.
2780 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
2781 if (auto *MD = dyn_cast<MetadataAsValue>(CI.getArgOperand(i)))
2782 visitMetadataAsValue(*MD, CI.getParent()->getParent());
2787 case Intrinsic::ctlz: // llvm.ctlz
2788 case Intrinsic::cttz: // llvm.cttz
2789 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2790 "is_zero_undef argument of bit counting intrinsics must be a "
2791 "constant int", &CI);
2793 case Intrinsic::dbg_declare: { // llvm.dbg.declare
2794 Assert1(CI.getArgOperand(0) && isa<MetadataAsValue>(CI.getArgOperand(0)),
2795 "invalid llvm.dbg.declare intrinsic call 1", &CI);
2797 case Intrinsic::memcpy:
2798 case Intrinsic::memmove:
2799 case Intrinsic::memset:
2800 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
2801 "alignment argument of memory intrinsics must be a constant int",
2803 Assert1(isa<ConstantInt>(CI.getArgOperand(4)),
2804 "isvolatile argument of memory intrinsics must be a constant int",
2807 case Intrinsic::gcroot:
2808 case Intrinsic::gcwrite:
2809 case Intrinsic::gcread:
2810 if (ID == Intrinsic::gcroot) {
2812 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
2813 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
2814 Assert1(isa<Constant>(CI.getArgOperand(1)),
2815 "llvm.gcroot parameter #2 must be a constant.", &CI);
2816 if (!AI->getType()->getElementType()->isPointerTy()) {
2817 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
2818 "llvm.gcroot parameter #1 must either be a pointer alloca, "
2819 "or argument #2 must be a non-null constant.", &CI);
2823 Assert1(CI.getParent()->getParent()->hasGC(),
2824 "Enclosing function does not use GC.", &CI);
2826 case Intrinsic::init_trampoline:
2827 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
2828 "llvm.init_trampoline parameter #2 must resolve to a function.",
2831 case Intrinsic::prefetch:
2832 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
2833 isa<ConstantInt>(CI.getArgOperand(2)) &&
2834 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
2835 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
2836 "invalid arguments to llvm.prefetch",
2839 case Intrinsic::stackprotector:
2840 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
2841 "llvm.stackprotector parameter #2 must resolve to an alloca.",
2844 case Intrinsic::lifetime_start:
2845 case Intrinsic::lifetime_end:
2846 case Intrinsic::invariant_start:
2847 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2848 "size argument of memory use markers must be a constant integer",
2851 case Intrinsic::invariant_end:
2852 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
2853 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
2856 case Intrinsic::frameallocate: {
2857 BasicBlock *BB = CI.getParent();
2858 Assert1(BB == &BB->getParent()->front(),
2859 "llvm.frameallocate used outside of entry block", &CI);
2860 Assert1(!SawFrameAllocate,
2861 "multiple calls to llvm.frameallocate in one function", &CI);
2862 SawFrameAllocate = true;
2863 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
2864 "llvm.frameallocate argument must be constant integer size", &CI);
2867 case Intrinsic::framerecover: {
2868 Value *FnArg = CI.getArgOperand(0)->stripPointerCasts();
2869 Function *Fn = dyn_cast<Function>(FnArg);
2870 Assert1(Fn && !Fn->isDeclaration(), "llvm.framerecover first "
2871 "argument must be function defined in this module", &CI);
2875 case Intrinsic::experimental_gc_statepoint:
2876 Assert1(!CI.isInlineAsm(),
2877 "gc.statepoint support for inline assembly unimplemented", &CI);
2879 VerifyStatepoint(ImmutableCallSite(&CI));
2881 case Intrinsic::experimental_gc_result_int:
2882 case Intrinsic::experimental_gc_result_float:
2883 case Intrinsic::experimental_gc_result_ptr:
2884 case Intrinsic::experimental_gc_result: {
2885 // Are we tied to a statepoint properly?
2886 CallSite StatepointCS(CI.getArgOperand(0));
2887 const Function *StatepointFn =
2888 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : nullptr;
2889 Assert2(StatepointFn && StatepointFn->isDeclaration() &&
2890 StatepointFn->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2891 "gc.result operand #1 must be from a statepoint",
2892 &CI, CI.getArgOperand(0));
2894 // Assert that result type matches wrapped callee.
2895 const Value *Target = StatepointCS.getArgument(0);
2896 const PointerType *PT = cast<PointerType>(Target->getType());
2897 const FunctionType *TargetFuncType =
2898 cast<FunctionType>(PT->getElementType());
2899 Assert1(CI.getType() == TargetFuncType->getReturnType(),
2900 "gc.result result type does not match wrapped callee",
2904 case Intrinsic::experimental_gc_relocate: {
2905 Assert1(CI.getNumArgOperands() == 3, "wrong number of arguments", &CI);
2907 // Check that this relocate is correctly tied to the statepoint
2909 // This is case for relocate on the unwinding path of an invoke statepoint
2910 if (ExtractValueInst *ExtractValue =
2911 dyn_cast<ExtractValueInst>(CI.getArgOperand(0))) {
2912 Assert1(isa<LandingPadInst>(ExtractValue->getAggregateOperand()),
2913 "gc relocate on unwind path incorrectly linked to the statepoint",
2916 const BasicBlock *invokeBB =
2917 ExtractValue->getParent()->getUniquePredecessor();
2919 // Landingpad relocates should have only one predecessor with invoke
2920 // statepoint terminator
2922 "safepoints should have unique landingpads",
2923 ExtractValue->getParent());
2924 Assert1(invokeBB->getTerminator(),
2925 "safepoint block should be well formed",
2927 Assert1(isStatepoint(invokeBB->getTerminator()),
2928 "gc relocate should be linked to a statepoint",
2932 // In all other cases relocate should be tied to the statepoint directly.
2933 // This covers relocates on a normal return path of invoke statepoint and
2934 // relocates of a call statepoint
2935 auto Token = CI.getArgOperand(0);
2936 Assert2(isa<Instruction>(Token) && isStatepoint(cast<Instruction>(Token)),
2937 "gc relocate is incorrectly tied to the statepoint",
2941 // Verify rest of the relocate arguments
2943 GCRelocateOperands ops(&CI);
2944 ImmutableCallSite StatepointCS(ops.statepoint());
2946 // Both the base and derived must be piped through the safepoint
2947 Value* Base = CI.getArgOperand(1);
2948 Assert1(isa<ConstantInt>(Base),
2949 "gc.relocate operand #2 must be integer offset", &CI);
2951 Value* Derived = CI.getArgOperand(2);
2952 Assert1(isa<ConstantInt>(Derived),
2953 "gc.relocate operand #3 must be integer offset", &CI);
2955 const int BaseIndex = cast<ConstantInt>(Base)->getZExtValue();
2956 const int DerivedIndex = cast<ConstantInt>(Derived)->getZExtValue();
2958 Assert1(0 <= BaseIndex &&
2959 BaseIndex < (int)StatepointCS.arg_size(),
2960 "gc.relocate: statepoint base index out of bounds", &CI);
2961 Assert1(0 <= DerivedIndex &&
2962 DerivedIndex < (int)StatepointCS.arg_size(),
2963 "gc.relocate: statepoint derived index out of bounds", &CI);
2965 // Check that BaseIndex and DerivedIndex fall within the 'gc parameters'
2966 // section of the statepoint's argument
2967 const int NumCallArgs =
2968 cast<ConstantInt>(StatepointCS.getArgument(1))->getZExtValue();
2969 const int NumDeoptArgs =
2970 cast<ConstantInt>(StatepointCS.getArgument(NumCallArgs + 3))->getZExtValue();
2971 const int GCParamArgsStart = NumCallArgs + NumDeoptArgs + 4;
2972 const int GCParamArgsEnd = StatepointCS.arg_size();
2973 Assert1(GCParamArgsStart <= BaseIndex &&
2974 BaseIndex < GCParamArgsEnd,
2975 "gc.relocate: statepoint base index doesn't fall within the "
2976 "'gc parameters' section of the statepoint call", &CI);
2977 Assert1(GCParamArgsStart <= DerivedIndex &&
2978 DerivedIndex < GCParamArgsEnd,
2979 "gc.relocate: statepoint derived index doesn't fall within the "
2980 "'gc parameters' section of the statepoint call", &CI);
2983 // Assert that the result type matches the type of the relocated pointer
2984 GCRelocateOperands Operands(&CI);
2985 Assert1(Operands.derivedPtr()->getType() == CI.getType(),
2986 "gc.relocate: relocating a pointer shouldn't change its type",
2993 void DebugInfoVerifier::verifyDebugInfo() {
2994 if (!VerifyDebugInfo)
2997 DebugInfoFinder Finder;
2998 Finder.processModule(*M);
2999 processInstructions(Finder);
3001 // Verify Debug Info.
3003 // NOTE: The loud braces are necessary for MSVC compatibility.
3004 for (DICompileUnit CU : Finder.compile_units()) {
3005 Assert1(CU.Verify(), "DICompileUnit does not Verify!", CU);
3007 for (DISubprogram S : Finder.subprograms()) {
3008 Assert1(S.Verify(), "DISubprogram does not Verify!", S);
3010 for (DIGlobalVariable GV : Finder.global_variables()) {
3011 Assert1(GV.Verify(), "DIGlobalVariable does not Verify!", GV);
3013 for (DIType T : Finder.types()) {
3014 Assert1(T.Verify(), "DIType does not Verify!", T);
3016 for (DIScope S : Finder.scopes()) {
3017 Assert1(S.Verify(), "DIScope does not Verify!", S);
3021 void DebugInfoVerifier::processInstructions(DebugInfoFinder &Finder) {
3022 for (const Function &F : *M)
3023 for (auto I = inst_begin(&F), E = inst_end(&F); I != E; ++I) {
3024 if (MDNode *MD = I->getMetadata(LLVMContext::MD_dbg))
3025 Finder.processLocation(*M, DILocation(MD));
3026 if (const CallInst *CI = dyn_cast<CallInst>(&*I))
3027 processCallInst(Finder, *CI);
3031 void DebugInfoVerifier::processCallInst(DebugInfoFinder &Finder,
3032 const CallInst &CI) {
3033 if (Function *F = CI.getCalledFunction())
3034 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
3036 case Intrinsic::dbg_declare: {
3037 auto *DDI = cast<DbgDeclareInst>(&CI);
3038 Finder.processDeclare(*M, DDI);
3039 if (auto E = DDI->getExpression())
3040 Assert1(DIExpression(E).Verify(), "DIExpression does not Verify!", E);
3043 case Intrinsic::dbg_value: {
3044 auto *DVI = cast<DbgValueInst>(&CI);
3045 Finder.processValue(*M, DVI);
3046 if (auto E = DVI->getExpression())
3047 Assert1(DIExpression(E).Verify(), "DIExpression does not Verify!", E);
3055 //===----------------------------------------------------------------------===//
3056 // Implement the public interfaces to this file...
3057 //===----------------------------------------------------------------------===//
3059 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
3060 Function &F = const_cast<Function &>(f);
3061 assert(!F.isDeclaration() && "Cannot verify external functions");
3063 raw_null_ostream NullStr;
3064 Verifier V(OS ? *OS : NullStr);
3066 // Note that this function's return value is inverted from what you would
3067 // expect of a function called "verify".
3068 return !V.verify(F);
3071 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
3072 raw_null_ostream NullStr;
3073 Verifier V(OS ? *OS : NullStr);
3075 bool Broken = false;
3076 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
3077 if (!I->isDeclaration() && !I->isMaterializable())
3078 Broken |= !V.verify(*I);
3080 // Note that this function's return value is inverted from what you would
3081 // expect of a function called "verify".
3082 DebugInfoVerifier DIV(OS ? *OS : NullStr);
3083 return !V.verify(M) || !DIV.verify(M) || Broken;
3087 struct VerifierLegacyPass : public FunctionPass {
3093 VerifierLegacyPass() : FunctionPass(ID), FatalErrors(true) {
3094 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3096 explicit VerifierLegacyPass(bool FatalErrors)
3097 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
3098 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3101 bool runOnFunction(Function &F) override {
3102 if (!V.verify(F) && FatalErrors)
3103 report_fatal_error("Broken function found, compilation aborted!");
3108 bool doFinalization(Module &M) override {
3109 if (!V.verify(M) && FatalErrors)
3110 report_fatal_error("Broken module found, compilation aborted!");
3115 void getAnalysisUsage(AnalysisUsage &AU) const override {
3116 AU.setPreservesAll();
3119 struct DebugInfoVerifierLegacyPass : public ModulePass {
3122 DebugInfoVerifier V;
3125 DebugInfoVerifierLegacyPass() : ModulePass(ID), FatalErrors(true) {
3126 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3128 explicit DebugInfoVerifierLegacyPass(bool FatalErrors)
3129 : ModulePass(ID), V(dbgs()), FatalErrors(FatalErrors) {
3130 initializeDebugInfoVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3133 bool runOnModule(Module &M) override {
3134 if (!V.verify(M) && FatalErrors)
3135 report_fatal_error("Broken debug info found, compilation aborted!");
3140 void getAnalysisUsage(AnalysisUsage &AU) const override {
3141 AU.setPreservesAll();
3146 char VerifierLegacyPass::ID = 0;
3147 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
3149 char DebugInfoVerifierLegacyPass::ID = 0;
3150 INITIALIZE_PASS(DebugInfoVerifierLegacyPass, "verify-di", "Debug Info Verifier",
3153 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
3154 return new VerifierLegacyPass(FatalErrors);
3157 ModulePass *llvm::createDebugInfoVerifierPass(bool FatalErrors) {
3158 return new DebugInfoVerifierLegacyPass(FatalErrors);
3161 PreservedAnalyses VerifierPass::run(Module &M) {
3162 if (verifyModule(M, &dbgs()) && FatalErrors)
3163 report_fatal_error("Broken module found, compilation aborted!");
3165 return PreservedAnalyses::all();
3168 PreservedAnalyses VerifierPass::run(Function &F) {
3169 if (verifyFunction(F, &dbgs()) && FatalErrors)
3170 report_fatal_error("Broken function found, compilation aborted!");
3172 return PreservedAnalyses::all();