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(true));
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) {}
95 void Write(const Value *V) {
98 if (isa<Instruction>(V)) {
101 V->printAsOperand(OS, true, M);
106 void Write(const Metadata *MD) {
113 template <class T> void Write(const MDTupleTypedArrayWrapper<T> &MD) {
117 void Write(const NamedMDNode *NMD) {
124 void Write(Type *T) {
130 void Write(const Comdat *C) {
136 template <typename T1, typename... Ts>
137 void WriteTs(const T1 &V1, const Ts &... Vs) {
142 template <typename... Ts> void WriteTs() {}
145 /// \brief A check failed, so printout out the condition and the message.
147 /// This provides a nice place to put a breakpoint if you want to see why
148 /// something is not correct.
149 void CheckFailed(const Twine &Message) {
150 OS << Message << '\n';
154 /// \brief A check failed (with values to print).
156 /// This calls the Message-only version so that the above is easier to set a
158 template <typename T1, typename... Ts>
159 void CheckFailed(const Twine &Message, const T1 &V1, const Ts &... Vs) {
160 CheckFailed(Message);
165 class Verifier : public InstVisitor<Verifier>, VerifierSupport {
166 friend class InstVisitor<Verifier>;
168 LLVMContext *Context;
171 /// \brief When verifying a basic block, keep track of all of the
172 /// instructions we have seen so far.
174 /// This allows us to do efficient dominance checks for the case when an
175 /// instruction has an operand that is an instruction in the same block.
176 SmallPtrSet<Instruction *, 16> InstsInThisBlock;
178 /// \brief Keep track of the metadata nodes that have been checked already.
179 SmallPtrSet<const Metadata *, 32> MDNodes;
181 /// \brief Track unresolved string-based type references.
182 SmallDenseMap<const MDString *, const MDNode *, 32> UnresolvedTypeRefs;
184 /// \brief The personality function referenced by the LandingPadInsts.
185 /// All LandingPadInsts within the same function must use the same
186 /// personality function.
187 const Value *PersonalityFn;
189 /// \brief Whether we've seen a call to @llvm.frameescape in this function
193 /// Stores the count of how many objects were passed to llvm.frameescape for a
194 /// given function and the largest index passed to llvm.framerecover.
195 DenseMap<Function *, std::pair<unsigned, unsigned>> FrameEscapeInfo;
198 explicit Verifier(raw_ostream &OS)
199 : VerifierSupport(OS), Context(nullptr), PersonalityFn(nullptr),
200 SawFrameEscape(false) {}
202 bool verify(const Function &F) {
204 Context = &M->getContext();
206 // First ensure the function is well-enough formed to compute dominance
209 OS << "Function '" << F.getName()
210 << "' does not contain an entry block!\n";
213 for (Function::const_iterator I = F.begin(), E = F.end(); I != E; ++I) {
214 if (I->empty() || !I->back().isTerminator()) {
215 OS << "Basic Block in function '" << F.getName()
216 << "' does not have terminator!\n";
217 I->printAsOperand(OS, true);
223 // Now directly compute a dominance tree. We don't rely on the pass
224 // manager to provide this as it isolates us from a potentially
225 // out-of-date dominator tree and makes it significantly more complex to
226 // run this code outside of a pass manager.
227 // FIXME: It's really gross that we have to cast away constness here.
228 DT.recalculate(const_cast<Function &>(F));
231 // FIXME: We strip const here because the inst visitor strips const.
232 visit(const_cast<Function &>(F));
233 InstsInThisBlock.clear();
234 PersonalityFn = nullptr;
235 SawFrameEscape = false;
240 bool verify(const Module &M) {
242 Context = &M.getContext();
245 // Scan through, checking all of the external function's linkage now...
246 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I) {
247 visitGlobalValue(*I);
249 // Check to make sure function prototypes are okay.
250 if (I->isDeclaration())
254 // Now that we've visited every function, verify that we never asked to
255 // recover a frame index that wasn't escaped.
256 verifyFrameRecoverIndices();
258 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
260 visitGlobalVariable(*I);
262 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
264 visitGlobalAlias(*I);
266 for (Module::const_named_metadata_iterator I = M.named_metadata_begin(),
267 E = M.named_metadata_end();
269 visitNamedMDNode(*I);
271 for (const StringMapEntry<Comdat> &SMEC : M.getComdatSymbolTable())
272 visitComdat(SMEC.getValue());
275 visitModuleIdents(M);
277 // Verify type referneces last.
284 // Verification methods...
285 void visitGlobalValue(const GlobalValue &GV);
286 void visitGlobalVariable(const GlobalVariable &GV);
287 void visitGlobalAlias(const GlobalAlias &GA);
288 void visitAliaseeSubExpr(const GlobalAlias &A, const Constant &C);
289 void visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias *> &Visited,
290 const GlobalAlias &A, const Constant &C);
291 void visitNamedMDNode(const NamedMDNode &NMD);
292 void visitMDNode(const MDNode &MD);
293 void visitMetadataAsValue(const MetadataAsValue &MD, Function *F);
294 void visitValueAsMetadata(const ValueAsMetadata &MD, Function *F);
295 void visitComdat(const Comdat &C);
296 void visitModuleIdents(const Module &M);
297 void visitModuleFlags(const Module &M);
298 void visitModuleFlag(const MDNode *Op,
299 DenseMap<const MDString *, const MDNode *> &SeenIDs,
300 SmallVectorImpl<const MDNode *> &Requirements);
301 void visitFunction(const Function &F);
302 void visitBasicBlock(BasicBlock &BB);
303 void visitRangeMetadata(Instruction& I, MDNode* Range, Type* Ty);
305 template <class Ty> bool isValidMetadataArray(const MDTuple &N);
306 #define HANDLE_SPECIALIZED_MDNODE_LEAF(CLASS) void visit##CLASS(const CLASS &N);
307 #include "llvm/IR/Metadata.def"
308 void visitMDScope(const MDScope &N);
309 void visitMDDerivedTypeBase(const MDDerivedTypeBase &N);
310 void visitMDVariable(const MDVariable &N);
311 void visitMDLexicalBlockBase(const MDLexicalBlockBase &N);
312 void visitMDTemplateParameter(const MDTemplateParameter &N);
314 void visitTemplateParams(const MDNode &N, const Metadata &RawParams);
316 /// \brief Check for a valid string-based type reference.
318 /// Checks if \c MD is a string-based type reference. If it is, keeps track
319 /// of it (and its user, \c N) for error messages later.
320 bool isValidUUID(const MDNode &N, const Metadata *MD);
322 /// \brief Check for a valid type reference.
324 /// Checks for subclasses of \a MDType, or \a isValidUUID().
325 bool isTypeRef(const MDNode &N, const Metadata *MD);
327 /// \brief Check for a valid scope reference.
329 /// Checks for subclasses of \a MDScope, or \a isValidUUID().
330 bool isScopeRef(const MDNode &N, const Metadata *MD);
332 /// \brief Check for a valid debug info reference.
334 /// Checks for subclasses of \a DebugNode, or \a isValidUUID().
335 bool isDIRef(const MDNode &N, const Metadata *MD);
337 // InstVisitor overrides...
338 using InstVisitor<Verifier>::visit;
339 void visit(Instruction &I);
341 void visitTruncInst(TruncInst &I);
342 void visitZExtInst(ZExtInst &I);
343 void visitSExtInst(SExtInst &I);
344 void visitFPTruncInst(FPTruncInst &I);
345 void visitFPExtInst(FPExtInst &I);
346 void visitFPToUIInst(FPToUIInst &I);
347 void visitFPToSIInst(FPToSIInst &I);
348 void visitUIToFPInst(UIToFPInst &I);
349 void visitSIToFPInst(SIToFPInst &I);
350 void visitIntToPtrInst(IntToPtrInst &I);
351 void visitPtrToIntInst(PtrToIntInst &I);
352 void visitBitCastInst(BitCastInst &I);
353 void visitAddrSpaceCastInst(AddrSpaceCastInst &I);
354 void visitPHINode(PHINode &PN);
355 void visitBinaryOperator(BinaryOperator &B);
356 void visitICmpInst(ICmpInst &IC);
357 void visitFCmpInst(FCmpInst &FC);
358 void visitExtractElementInst(ExtractElementInst &EI);
359 void visitInsertElementInst(InsertElementInst &EI);
360 void visitShuffleVectorInst(ShuffleVectorInst &EI);
361 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
362 void visitCallInst(CallInst &CI);
363 void visitInvokeInst(InvokeInst &II);
364 void visitGetElementPtrInst(GetElementPtrInst &GEP);
365 void visitLoadInst(LoadInst &LI);
366 void visitStoreInst(StoreInst &SI);
367 void verifyDominatesUse(Instruction &I, unsigned i);
368 void visitInstruction(Instruction &I);
369 void visitTerminatorInst(TerminatorInst &I);
370 void visitBranchInst(BranchInst &BI);
371 void visitReturnInst(ReturnInst &RI);
372 void visitSwitchInst(SwitchInst &SI);
373 void visitIndirectBrInst(IndirectBrInst &BI);
374 void visitSelectInst(SelectInst &SI);
375 void visitUserOp1(Instruction &I);
376 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
377 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
378 template <class DbgIntrinsicTy>
379 void visitDbgIntrinsic(StringRef Kind, DbgIntrinsicTy &DII);
380 void visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI);
381 void visitAtomicRMWInst(AtomicRMWInst &RMWI);
382 void visitFenceInst(FenceInst &FI);
383 void visitAllocaInst(AllocaInst &AI);
384 void visitExtractValueInst(ExtractValueInst &EVI);
385 void visitInsertValueInst(InsertValueInst &IVI);
386 void visitLandingPadInst(LandingPadInst &LPI);
388 void VerifyCallSite(CallSite CS);
389 void verifyMustTailCall(CallInst &CI);
390 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, Type *Ty, int VT,
391 unsigned ArgNo, std::string &Suffix);
392 bool VerifyIntrinsicType(Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
393 SmallVectorImpl<Type *> &ArgTys);
394 bool VerifyIntrinsicIsVarArg(bool isVarArg,
395 ArrayRef<Intrinsic::IITDescriptor> &Infos);
396 bool VerifyAttributeCount(AttributeSet Attrs, unsigned Params);
397 void VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx, bool isFunction,
399 void VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
400 bool isReturnValue, const Value *V);
401 void VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
404 void VerifyConstantExprBitcastType(const ConstantExpr *CE);
405 void VerifyStatepoint(ImmutableCallSite CS);
406 void verifyFrameRecoverIndices();
408 // Module-level debug info verification...
409 void verifyTypeRefs();
410 template <class MapTy>
411 void verifyBitPieceExpression(const DbgInfoIntrinsic &I,
412 const MapTy &TypeRefs);
413 void visitUnresolvedTypeRef(const MDString *S, const MDNode *N);
415 } // End anonymous namespace
417 // Assert - We know that cond should be true, if not print an error message.
418 #define Assert(C, ...) \
419 do { if (!(C)) { CheckFailed(__VA_ARGS__); return; } } while (0)
421 void Verifier::visit(Instruction &I) {
422 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
423 Assert(I.getOperand(i) != nullptr, "Operand is null", &I);
424 InstVisitor<Verifier>::visit(I);
428 void Verifier::visitGlobalValue(const GlobalValue &GV) {
429 Assert(!GV.isDeclaration() || GV.hasExternalLinkage() ||
430 GV.hasExternalWeakLinkage(),
431 "Global is external, but doesn't have external or weak linkage!", &GV);
433 Assert(GV.getAlignment() <= Value::MaximumAlignment,
434 "huge alignment values are unsupported", &GV);
435 Assert(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
436 "Only global variables can have appending linkage!", &GV);
438 if (GV.hasAppendingLinkage()) {
439 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
440 Assert(GVar && GVar->getType()->getElementType()->isArrayTy(),
441 "Only global arrays can have appending linkage!", GVar);
445 void Verifier::visitGlobalVariable(const GlobalVariable &GV) {
446 if (GV.hasInitializer()) {
447 Assert(GV.getInitializer()->getType() == GV.getType()->getElementType(),
448 "Global variable initializer type does not match global "
452 // If the global has common linkage, it must have a zero initializer and
453 // cannot be constant.
454 if (GV.hasCommonLinkage()) {
455 Assert(GV.getInitializer()->isNullValue(),
456 "'common' global must have a zero initializer!", &GV);
457 Assert(!GV.isConstant(), "'common' global may not be marked constant!",
459 Assert(!GV.hasComdat(), "'common' global may not be in a Comdat!", &GV);
462 Assert(GV.hasExternalLinkage() || GV.hasExternalWeakLinkage(),
463 "invalid linkage type for global declaration", &GV);
466 if (GV.hasName() && (GV.getName() == "llvm.global_ctors" ||
467 GV.getName() == "llvm.global_dtors")) {
468 Assert(!GV.hasInitializer() || GV.hasAppendingLinkage(),
469 "invalid linkage for intrinsic global variable", &GV);
470 // Don't worry about emitting an error for it not being an array,
471 // visitGlobalValue will complain on appending non-array.
472 if (ArrayType *ATy = dyn_cast<ArrayType>(GV.getType()->getElementType())) {
473 StructType *STy = dyn_cast<StructType>(ATy->getElementType());
474 PointerType *FuncPtrTy =
475 FunctionType::get(Type::getVoidTy(*Context), false)->getPointerTo();
476 // FIXME: Reject the 2-field form in LLVM 4.0.
478 (STy->getNumElements() == 2 || STy->getNumElements() == 3) &&
479 STy->getTypeAtIndex(0u)->isIntegerTy(32) &&
480 STy->getTypeAtIndex(1) == FuncPtrTy,
481 "wrong type for intrinsic global variable", &GV);
482 if (STy->getNumElements() == 3) {
483 Type *ETy = STy->getTypeAtIndex(2);
484 Assert(ETy->isPointerTy() &&
485 cast<PointerType>(ETy)->getElementType()->isIntegerTy(8),
486 "wrong type for intrinsic global variable", &GV);
491 if (GV.hasName() && (GV.getName() == "llvm.used" ||
492 GV.getName() == "llvm.compiler.used")) {
493 Assert(!GV.hasInitializer() || GV.hasAppendingLinkage(),
494 "invalid linkage for intrinsic global variable", &GV);
495 Type *GVType = GV.getType()->getElementType();
496 if (ArrayType *ATy = dyn_cast<ArrayType>(GVType)) {
497 PointerType *PTy = dyn_cast<PointerType>(ATy->getElementType());
498 Assert(PTy, "wrong type for intrinsic global variable", &GV);
499 if (GV.hasInitializer()) {
500 const Constant *Init = GV.getInitializer();
501 const ConstantArray *InitArray = dyn_cast<ConstantArray>(Init);
502 Assert(InitArray, "wrong initalizer for intrinsic global variable",
504 for (unsigned i = 0, e = InitArray->getNumOperands(); i != e; ++i) {
505 Value *V = Init->getOperand(i)->stripPointerCastsNoFollowAliases();
506 Assert(isa<GlobalVariable>(V) || isa<Function>(V) ||
508 "invalid llvm.used member", V);
509 Assert(V->hasName(), "members of llvm.used must be named", V);
515 Assert(!GV.hasDLLImportStorageClass() ||
516 (GV.isDeclaration() && GV.hasExternalLinkage()) ||
517 GV.hasAvailableExternallyLinkage(),
518 "Global is marked as dllimport, but not external", &GV);
520 if (!GV.hasInitializer()) {
521 visitGlobalValue(GV);
525 // Walk any aggregate initializers looking for bitcasts between address spaces
526 SmallPtrSet<const Value *, 4> Visited;
527 SmallVector<const Value *, 4> WorkStack;
528 WorkStack.push_back(cast<Value>(GV.getInitializer()));
530 while (!WorkStack.empty()) {
531 const Value *V = WorkStack.pop_back_val();
532 if (!Visited.insert(V).second)
535 if (const User *U = dyn_cast<User>(V)) {
536 WorkStack.append(U->op_begin(), U->op_end());
539 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
540 VerifyConstantExprBitcastType(CE);
546 visitGlobalValue(GV);
549 void Verifier::visitAliaseeSubExpr(const GlobalAlias &GA, const Constant &C) {
550 SmallPtrSet<const GlobalAlias*, 4> Visited;
552 visitAliaseeSubExpr(Visited, GA, C);
555 void Verifier::visitAliaseeSubExpr(SmallPtrSetImpl<const GlobalAlias*> &Visited,
556 const GlobalAlias &GA, const Constant &C) {
557 if (const auto *GV = dyn_cast<GlobalValue>(&C)) {
558 Assert(!GV->isDeclaration(), "Alias must point to a definition", &GA);
560 if (const auto *GA2 = dyn_cast<GlobalAlias>(GV)) {
561 Assert(Visited.insert(GA2).second, "Aliases cannot form a cycle", &GA);
563 Assert(!GA2->mayBeOverridden(), "Alias cannot point to a weak alias",
566 // Only continue verifying subexpressions of GlobalAliases.
567 // Do not recurse into global initializers.
572 if (const auto *CE = dyn_cast<ConstantExpr>(&C))
573 VerifyConstantExprBitcastType(CE);
575 for (const Use &U : C.operands()) {
577 if (const auto *GA2 = dyn_cast<GlobalAlias>(V))
578 visitAliaseeSubExpr(Visited, GA, *GA2->getAliasee());
579 else if (const auto *C2 = dyn_cast<Constant>(V))
580 visitAliaseeSubExpr(Visited, GA, *C2);
584 void Verifier::visitGlobalAlias(const GlobalAlias &GA) {
585 Assert(!GA.getName().empty(), "Alias name cannot be empty!", &GA);
586 Assert(GlobalAlias::isValidLinkage(GA.getLinkage()),
587 "Alias should have private, internal, linkonce, weak, linkonce_odr, "
588 "weak_odr, or external linkage!",
590 const Constant *Aliasee = GA.getAliasee();
591 Assert(Aliasee, "Aliasee cannot be NULL!", &GA);
592 Assert(GA.getType() == Aliasee->getType(),
593 "Alias and aliasee types should match!", &GA);
595 Assert(isa<GlobalValue>(Aliasee) || isa<ConstantExpr>(Aliasee),
596 "Aliasee should be either GlobalValue or ConstantExpr", &GA);
598 visitAliaseeSubExpr(GA, *Aliasee);
600 visitGlobalValue(GA);
603 void Verifier::visitNamedMDNode(const NamedMDNode &NMD) {
604 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
605 MDNode *MD = NMD.getOperand(i);
607 if (NMD.getName() == "llvm.dbg.cu") {
608 Assert(MD && isa<MDCompileUnit>(MD), "invalid compile unit", &NMD, MD);
618 void Verifier::visitMDNode(const MDNode &MD) {
619 // Only visit each node once. Metadata can be mutually recursive, so this
620 // avoids infinite recursion here, as well as being an optimization.
621 if (!MDNodes.insert(&MD).second)
624 switch (MD.getMetadataID()) {
626 llvm_unreachable("Invalid MDNode subclass");
627 case Metadata::MDTupleKind:
629 #define HANDLE_SPECIALIZED_MDNODE_LEAF(CLASS) \
630 case Metadata::CLASS##Kind: \
631 visit##CLASS(cast<CLASS>(MD)); \
633 #include "llvm/IR/Metadata.def"
636 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
637 Metadata *Op = MD.getOperand(i);
640 Assert(!isa<LocalAsMetadata>(Op), "Invalid operand for global metadata!",
642 if (auto *N = dyn_cast<MDNode>(Op)) {
646 if (auto *V = dyn_cast<ValueAsMetadata>(Op)) {
647 visitValueAsMetadata(*V, nullptr);
652 // Check these last, so we diagnose problems in operands first.
653 Assert(!MD.isTemporary(), "Expected no forward declarations!", &MD);
654 Assert(MD.isResolved(), "All nodes should be resolved!", &MD);
657 void Verifier::visitValueAsMetadata(const ValueAsMetadata &MD, Function *F) {
658 Assert(MD.getValue(), "Expected valid value", &MD);
659 Assert(!MD.getValue()->getType()->isMetadataTy(),
660 "Unexpected metadata round-trip through values", &MD, MD.getValue());
662 auto *L = dyn_cast<LocalAsMetadata>(&MD);
666 Assert(F, "function-local metadata used outside a function", L);
668 // If this was an instruction, bb, or argument, verify that it is in the
669 // function that we expect.
670 Function *ActualF = nullptr;
671 if (Instruction *I = dyn_cast<Instruction>(L->getValue())) {
672 Assert(I->getParent(), "function-local metadata not in basic block", L, I);
673 ActualF = I->getParent()->getParent();
674 } else if (BasicBlock *BB = dyn_cast<BasicBlock>(L->getValue()))
675 ActualF = BB->getParent();
676 else if (Argument *A = dyn_cast<Argument>(L->getValue()))
677 ActualF = A->getParent();
678 assert(ActualF && "Unimplemented function local metadata case!");
680 Assert(ActualF == F, "function-local metadata used in wrong function", L);
683 void Verifier::visitMetadataAsValue(const MetadataAsValue &MDV, Function *F) {
684 Metadata *MD = MDV.getMetadata();
685 if (auto *N = dyn_cast<MDNode>(MD)) {
690 // Only visit each node once. Metadata can be mutually recursive, so this
691 // avoids infinite recursion here, as well as being an optimization.
692 if (!MDNodes.insert(MD).second)
695 if (auto *V = dyn_cast<ValueAsMetadata>(MD))
696 visitValueAsMetadata(*V, F);
699 bool Verifier::isValidUUID(const MDNode &N, const Metadata *MD) {
700 auto *S = dyn_cast<MDString>(MD);
703 if (S->getString().empty())
706 // Keep track of names of types referenced via UUID so we can check that they
708 UnresolvedTypeRefs.insert(std::make_pair(S, &N));
712 /// \brief Check if a value can be a reference to a type.
713 bool Verifier::isTypeRef(const MDNode &N, const Metadata *MD) {
714 return !MD || isValidUUID(N, MD) || isa<MDType>(MD);
717 /// \brief Check if a value can be a ScopeRef.
718 bool Verifier::isScopeRef(const MDNode &N, const Metadata *MD) {
719 return !MD || isValidUUID(N, MD) || isa<MDScope>(MD);
722 /// \brief Check if a value can be a debug info ref.
723 bool Verifier::isDIRef(const MDNode &N, const Metadata *MD) {
724 return !MD || isValidUUID(N, MD) || isa<DebugNode>(MD);
728 bool isValidMetadataArrayImpl(const MDTuple &N, bool AllowNull) {
729 for (Metadata *MD : N.operands()) {
742 bool isValidMetadataArray(const MDTuple &N) {
743 return isValidMetadataArrayImpl<Ty>(N, /* AllowNull */ false);
747 bool isValidMetadataNullArray(const MDTuple &N) {
748 return isValidMetadataArrayImpl<Ty>(N, /* AllowNull */ true);
751 void Verifier::visitMDLocation(const MDLocation &N) {
752 Assert(N.getRawScope() && isa<MDLocalScope>(N.getRawScope()),
753 "location requires a valid scope", &N, N.getRawScope());
754 if (auto *IA = N.getRawInlinedAt())
755 Assert(isa<MDLocation>(IA), "inlined-at should be a location", &N, IA);
758 void Verifier::visitGenericDebugNode(const GenericDebugNode &N) {
759 Assert(N.getTag(), "invalid tag", &N);
762 void Verifier::visitMDScope(const MDScope &N) {
763 if (auto *F = N.getRawFile())
764 Assert(isa<MDFile>(F), "invalid file", &N, F);
767 void Verifier::visitMDSubrange(const MDSubrange &N) {
768 Assert(N.getTag() == dwarf::DW_TAG_subrange_type, "invalid tag", &N);
769 Assert(N.getCount() >= -1, "invalid subrange count", &N);
772 void Verifier::visitMDEnumerator(const MDEnumerator &N) {
773 Assert(N.getTag() == dwarf::DW_TAG_enumerator, "invalid tag", &N);
776 void Verifier::visitMDBasicType(const MDBasicType &N) {
777 Assert(N.getTag() == dwarf::DW_TAG_base_type ||
778 N.getTag() == dwarf::DW_TAG_unspecified_type,
782 void Verifier::visitMDDerivedTypeBase(const MDDerivedTypeBase &N) {
783 // Common scope checks.
786 Assert(isScopeRef(N, N.getScope()), "invalid scope", &N, N.getScope());
787 Assert(isTypeRef(N, N.getBaseType()), "invalid base type", &N,
790 // FIXME: Sink this into the subclass verifies.
791 if (!N.getFile() || N.getFile()->getFilename().empty()) {
792 // Check whether the filename is allowed to be empty.
793 uint16_t Tag = N.getTag();
795 Tag == dwarf::DW_TAG_const_type || Tag == dwarf::DW_TAG_volatile_type ||
796 Tag == dwarf::DW_TAG_pointer_type ||
797 Tag == dwarf::DW_TAG_ptr_to_member_type ||
798 Tag == dwarf::DW_TAG_reference_type ||
799 Tag == dwarf::DW_TAG_rvalue_reference_type ||
800 Tag == dwarf::DW_TAG_restrict_type ||
801 Tag == dwarf::DW_TAG_array_type ||
802 Tag == dwarf::DW_TAG_enumeration_type ||
803 Tag == dwarf::DW_TAG_subroutine_type ||
804 Tag == dwarf::DW_TAG_inheritance || Tag == dwarf::DW_TAG_friend ||
805 Tag == dwarf::DW_TAG_structure_type ||
806 Tag == dwarf::DW_TAG_member || Tag == dwarf::DW_TAG_typedef,
807 "derived/composite type requires a filename", &N, N.getFile());
811 void Verifier::visitMDDerivedType(const MDDerivedType &N) {
812 // Common derived type checks.
813 visitMDDerivedTypeBase(N);
815 Assert(N.getTag() == dwarf::DW_TAG_typedef ||
816 N.getTag() == dwarf::DW_TAG_pointer_type ||
817 N.getTag() == dwarf::DW_TAG_ptr_to_member_type ||
818 N.getTag() == dwarf::DW_TAG_reference_type ||
819 N.getTag() == dwarf::DW_TAG_rvalue_reference_type ||
820 N.getTag() == dwarf::DW_TAG_const_type ||
821 N.getTag() == dwarf::DW_TAG_volatile_type ||
822 N.getTag() == dwarf::DW_TAG_restrict_type ||
823 N.getTag() == dwarf::DW_TAG_member ||
824 N.getTag() == dwarf::DW_TAG_inheritance ||
825 N.getTag() == dwarf::DW_TAG_friend,
827 if (N.getTag() == dwarf::DW_TAG_ptr_to_member_type) {
828 Assert(isTypeRef(N, N.getExtraData()), "invalid pointer to member type", &N,
833 static bool hasConflictingReferenceFlags(unsigned Flags) {
834 return (Flags & DebugNode::FlagLValueReference) &&
835 (Flags & DebugNode::FlagRValueReference);
838 void Verifier::visitTemplateParams(const MDNode &N, const Metadata &RawParams) {
839 auto *Params = dyn_cast<MDTuple>(&RawParams);
840 Assert(Params, "invalid template params", &N, &RawParams);
841 for (Metadata *Op : Params->operands()) {
842 Assert(Op && isa<MDTemplateParameter>(Op), "invalid template parameter", &N,
847 void Verifier::visitMDCompositeType(const MDCompositeType &N) {
848 // Common derived type checks.
849 visitMDDerivedTypeBase(N);
851 Assert(N.getTag() == dwarf::DW_TAG_array_type ||
852 N.getTag() == dwarf::DW_TAG_structure_type ||
853 N.getTag() == dwarf::DW_TAG_union_type ||
854 N.getTag() == dwarf::DW_TAG_enumeration_type ||
855 N.getTag() == dwarf::DW_TAG_subroutine_type ||
856 N.getTag() == dwarf::DW_TAG_class_type,
859 Assert(!N.getRawElements() || isa<MDTuple>(N.getRawElements()),
860 "invalid composite elements", &N, N.getRawElements());
861 Assert(isTypeRef(N, N.getRawVTableHolder()), "invalid vtable holder", &N,
862 N.getRawVTableHolder());
863 Assert(!N.getRawElements() || isa<MDTuple>(N.getRawElements()),
864 "invalid composite elements", &N, N.getRawElements());
865 Assert(!hasConflictingReferenceFlags(N.getFlags()), "invalid reference flags",
867 if (auto *Params = N.getRawTemplateParams())
868 visitTemplateParams(N, *Params);
871 void Verifier::visitMDSubroutineType(const MDSubroutineType &N) {
872 Assert(N.getTag() == dwarf::DW_TAG_subroutine_type, "invalid tag", &N);
873 if (auto *Types = N.getRawTypeArray()) {
874 Assert(isa<MDTuple>(Types), "invalid composite elements", &N, Types);
875 for (Metadata *Ty : N.getTypeArray()->operands()) {
876 Assert(isTypeRef(N, Ty), "invalid subroutine type ref", &N, Types, Ty);
879 Assert(!hasConflictingReferenceFlags(N.getFlags()), "invalid reference flags",
883 void Verifier::visitMDFile(const MDFile &N) {
884 Assert(N.getTag() == dwarf::DW_TAG_file_type, "invalid tag", &N);
887 void Verifier::visitMDCompileUnit(const MDCompileUnit &N) {
888 Assert(N.getTag() == dwarf::DW_TAG_compile_unit, "invalid tag", &N);
890 // Don't bother verifying the compilation directory or producer string
891 // as those could be empty.
892 Assert(N.getRawFile() && isa<MDFile>(N.getRawFile()),
893 "invalid file", &N, N.getRawFile());
894 Assert(!N.getFile()->getFilename().empty(), "invalid filename", &N,
897 if (auto *Array = N.getRawEnumTypes()) {
898 Assert(isa<MDTuple>(Array), "invalid enum list", &N, Array);
899 for (Metadata *Op : N.getEnumTypes()->operands()) {
900 auto *Enum = dyn_cast_or_null<MDCompositeType>(Op);
901 Assert(Enum && Enum->getTag() == dwarf::DW_TAG_enumeration_type,
902 "invalid enum type", &N, N.getEnumTypes(), Op);
905 if (auto *Array = N.getRawRetainedTypes()) {
906 Assert(isa<MDTuple>(Array), "invalid retained type list", &N, Array);
907 for (Metadata *Op : N.getRetainedTypes()->operands()) {
908 Assert(Op && isa<MDType>(Op), "invalid retained type", &N, Op);
911 if (auto *Array = N.getRawSubprograms()) {
912 Assert(isa<MDTuple>(Array), "invalid subprogram list", &N, Array);
913 for (Metadata *Op : N.getSubprograms()->operands()) {
914 Assert(Op && isa<MDSubprogram>(Op), "invalid subprogram ref", &N, Op);
917 if (auto *Array = N.getRawGlobalVariables()) {
918 Assert(isa<MDTuple>(Array), "invalid global variable list", &N, Array);
919 for (Metadata *Op : N.getGlobalVariables()->operands()) {
920 Assert(Op && isa<MDGlobalVariable>(Op), "invalid global variable ref", &N,
924 if (auto *Array = N.getRawImportedEntities()) {
925 Assert(isa<MDTuple>(Array), "invalid imported entity list", &N, Array);
926 for (Metadata *Op : N.getImportedEntities()->operands()) {
927 Assert(Op && isa<MDImportedEntity>(Op), "invalid imported entity ref", &N,
933 void Verifier::visitMDSubprogram(const MDSubprogram &N) {
934 Assert(N.getTag() == dwarf::DW_TAG_subprogram, "invalid tag", &N);
935 Assert(isScopeRef(N, N.getRawScope()), "invalid scope", &N, N.getRawScope());
936 if (auto *T = N.getRawType())
937 Assert(isa<MDSubroutineType>(T), "invalid subroutine type", &N, T);
938 Assert(isTypeRef(N, N.getRawContainingType()), "invalid containing type", &N,
939 N.getRawContainingType());
940 if (auto *RawF = N.getRawFunction()) {
941 auto *FMD = dyn_cast<ConstantAsMetadata>(RawF);
942 auto *F = FMD ? FMD->getValue() : nullptr;
943 auto *FT = F ? dyn_cast<PointerType>(F->getType()) : nullptr;
944 Assert(F && FT && isa<FunctionType>(FT->getElementType()),
945 "invalid function", &N, F, FT);
947 if (auto *Params = N.getRawTemplateParams())
948 visitTemplateParams(N, *Params);
949 if (auto *S = N.getRawDeclaration()) {
950 Assert(isa<MDSubprogram>(S) && !cast<MDSubprogram>(S)->isDefinition(),
951 "invalid subprogram declaration", &N, S);
953 if (auto *RawVars = N.getRawVariables()) {
954 auto *Vars = dyn_cast<MDTuple>(RawVars);
955 Assert(Vars, "invalid variable list", &N, RawVars);
956 for (Metadata *Op : Vars->operands()) {
957 Assert(Op && isa<MDLocalVariable>(Op), "invalid local variable", &N, Vars,
961 Assert(!hasConflictingReferenceFlags(N.getFlags()), "invalid reference flags",
964 auto *F = N.getFunction();
968 // Check that all !dbg attachments lead to back to N (or, at least, another
969 // subprogram that describes the same function).
971 // FIXME: Check this incrementally while visiting !dbg attachments.
972 // FIXME: Only check when N is the canonical subprogram for F.
973 SmallPtrSet<const MDNode *, 32> Seen;
976 // Be careful about using MDLocation here since we might be dealing with
977 // broken code (this is the Verifier after all).
979 dyn_cast_or_null<MDLocation>(I.getDebugLoc().getAsMDNode());
982 if (!Seen.insert(DL).second)
985 MDLocalScope *Scope = DL->getInlinedAtScope();
986 if (Scope && !Seen.insert(Scope).second)
989 MDSubprogram *SP = Scope ? Scope->getSubprogram() : nullptr;
990 if (SP && !Seen.insert(SP).second)
993 // FIXME: Once N is canonical, check "SP == &N".
994 Assert(SP->describes(F),
995 "!dbg attachment points at wrong subprogram for function", &N, F,
1000 void Verifier::visitMDLexicalBlockBase(const MDLexicalBlockBase &N) {
1001 Assert(N.getTag() == dwarf::DW_TAG_lexical_block, "invalid tag", &N);
1002 Assert(N.getRawScope() && isa<MDLocalScope>(N.getRawScope()),
1003 "invalid local scope", &N, N.getRawScope());
1006 void Verifier::visitMDLexicalBlock(const MDLexicalBlock &N) {
1007 visitMDLexicalBlockBase(N);
1009 Assert(N.getLine() || !N.getColumn(),
1010 "cannot have column info without line info", &N);
1013 void Verifier::visitMDLexicalBlockFile(const MDLexicalBlockFile &N) {
1014 visitMDLexicalBlockBase(N);
1017 void Verifier::visitMDNamespace(const MDNamespace &N) {
1018 Assert(N.getTag() == dwarf::DW_TAG_namespace, "invalid tag", &N);
1019 if (auto *S = N.getRawScope())
1020 Assert(isa<MDScope>(S), "invalid scope ref", &N, S);
1023 void Verifier::visitMDTemplateParameter(const MDTemplateParameter &N) {
1024 Assert(isTypeRef(N, N.getType()), "invalid type ref", &N, N.getType());
1027 void Verifier::visitMDTemplateTypeParameter(const MDTemplateTypeParameter &N) {
1028 visitMDTemplateParameter(N);
1030 Assert(N.getTag() == dwarf::DW_TAG_template_type_parameter, "invalid tag",
1034 void Verifier::visitMDTemplateValueParameter(
1035 const MDTemplateValueParameter &N) {
1036 visitMDTemplateParameter(N);
1038 Assert(N.getTag() == dwarf::DW_TAG_template_value_parameter ||
1039 N.getTag() == dwarf::DW_TAG_GNU_template_template_param ||
1040 N.getTag() == dwarf::DW_TAG_GNU_template_parameter_pack,
1044 void Verifier::visitMDVariable(const MDVariable &N) {
1045 if (auto *S = N.getRawScope())
1046 Assert(isa<MDScope>(S), "invalid scope", &N, S);
1047 Assert(isTypeRef(N, N.getRawType()), "invalid type ref", &N, N.getRawType());
1048 if (auto *F = N.getRawFile())
1049 Assert(isa<MDFile>(F), "invalid file", &N, F);
1052 void Verifier::visitMDGlobalVariable(const MDGlobalVariable &N) {
1053 // Checks common to all variables.
1056 Assert(N.getTag() == dwarf::DW_TAG_variable, "invalid tag", &N);
1057 Assert(!N.getName().empty(), "missing global variable name", &N);
1058 if (auto *V = N.getRawVariable()) {
1059 Assert(isa<ConstantAsMetadata>(V) &&
1060 !isa<Function>(cast<ConstantAsMetadata>(V)->getValue()),
1061 "invalid global varaible ref", &N, V);
1063 if (auto *Member = N.getRawStaticDataMemberDeclaration()) {
1064 Assert(isa<MDDerivedType>(Member), "invalid static data member declaration",
1069 void Verifier::visitMDLocalVariable(const MDLocalVariable &N) {
1070 // Checks common to all variables.
1073 Assert(N.getTag() == dwarf::DW_TAG_auto_variable ||
1074 N.getTag() == dwarf::DW_TAG_arg_variable,
1076 Assert(N.getRawScope() && isa<MDLocalScope>(N.getRawScope()),
1077 "local variable requires a valid scope", &N, N.getRawScope());
1078 if (auto *IA = N.getRawInlinedAt())
1079 Assert(isa<MDLocation>(IA), "local variable requires a valid scope", &N,
1083 void Verifier::visitMDExpression(const MDExpression &N) {
1084 Assert(N.isValid(), "invalid expression", &N);
1087 void Verifier::visitMDObjCProperty(const MDObjCProperty &N) {
1088 Assert(N.getTag() == dwarf::DW_TAG_APPLE_property, "invalid tag", &N);
1089 if (auto *T = N.getRawType())
1090 Assert(isa<MDType>(T), "invalid type ref", &N, T);
1091 if (auto *F = N.getRawFile())
1092 Assert(isa<MDFile>(F), "invalid file", &N, F);
1095 void Verifier::visitMDImportedEntity(const MDImportedEntity &N) {
1096 Assert(N.getTag() == dwarf::DW_TAG_imported_module ||
1097 N.getTag() == dwarf::DW_TAG_imported_declaration,
1099 if (auto *S = N.getRawScope())
1100 Assert(isa<MDScope>(S), "invalid scope for imported entity", &N, S);
1101 Assert(isDIRef(N, N.getEntity()), "invalid imported entity", &N,
1105 void Verifier::visitComdat(const Comdat &C) {
1106 // The Module is invalid if the GlobalValue has private linkage. Entities
1107 // with private linkage don't have entries in the symbol table.
1108 if (const GlobalValue *GV = M->getNamedValue(C.getName()))
1109 Assert(!GV->hasPrivateLinkage(), "comdat global value has private linkage",
1113 void Verifier::visitModuleIdents(const Module &M) {
1114 const NamedMDNode *Idents = M.getNamedMetadata("llvm.ident");
1118 // llvm.ident takes a list of metadata entry. Each entry has only one string.
1119 // Scan each llvm.ident entry and make sure that this requirement is met.
1120 for (unsigned i = 0, e = Idents->getNumOperands(); i != e; ++i) {
1121 const MDNode *N = Idents->getOperand(i);
1122 Assert(N->getNumOperands() == 1,
1123 "incorrect number of operands in llvm.ident metadata", N);
1124 Assert(dyn_cast_or_null<MDString>(N->getOperand(0)),
1125 ("invalid value for llvm.ident metadata entry operand"
1126 "(the operand should be a string)"),
1131 void Verifier::visitModuleFlags(const Module &M) {
1132 const NamedMDNode *Flags = M.getModuleFlagsMetadata();
1135 // Scan each flag, and track the flags and requirements.
1136 DenseMap<const MDString*, const MDNode*> SeenIDs;
1137 SmallVector<const MDNode*, 16> Requirements;
1138 for (unsigned I = 0, E = Flags->getNumOperands(); I != E; ++I) {
1139 visitModuleFlag(Flags->getOperand(I), SeenIDs, Requirements);
1142 // Validate that the requirements in the module are valid.
1143 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
1144 const MDNode *Requirement = Requirements[I];
1145 const MDString *Flag = cast<MDString>(Requirement->getOperand(0));
1146 const Metadata *ReqValue = Requirement->getOperand(1);
1148 const MDNode *Op = SeenIDs.lookup(Flag);
1150 CheckFailed("invalid requirement on flag, flag is not present in module",
1155 if (Op->getOperand(2) != ReqValue) {
1156 CheckFailed(("invalid requirement on flag, "
1157 "flag does not have the required value"),
1165 Verifier::visitModuleFlag(const MDNode *Op,
1166 DenseMap<const MDString *, const MDNode *> &SeenIDs,
1167 SmallVectorImpl<const MDNode *> &Requirements) {
1168 // Each module flag should have three arguments, the merge behavior (a
1169 // constant int), the flag ID (an MDString), and the value.
1170 Assert(Op->getNumOperands() == 3,
1171 "incorrect number of operands in module flag", Op);
1172 Module::ModFlagBehavior MFB;
1173 if (!Module::isValidModFlagBehavior(Op->getOperand(0), MFB)) {
1175 mdconst::dyn_extract_or_null<ConstantInt>(Op->getOperand(0)),
1176 "invalid behavior operand in module flag (expected constant integer)",
1179 "invalid behavior operand in module flag (unexpected constant)",
1182 MDString *ID = dyn_cast_or_null<MDString>(Op->getOperand(1));
1183 Assert(ID, "invalid ID operand in module flag (expected metadata string)",
1186 // Sanity check the values for behaviors with additional requirements.
1189 case Module::Warning:
1190 case Module::Override:
1191 // These behavior types accept any value.
1194 case Module::Require: {
1195 // The value should itself be an MDNode with two operands, a flag ID (an
1196 // MDString), and a value.
1197 MDNode *Value = dyn_cast<MDNode>(Op->getOperand(2));
1198 Assert(Value && Value->getNumOperands() == 2,
1199 "invalid value for 'require' module flag (expected metadata pair)",
1201 Assert(isa<MDString>(Value->getOperand(0)),
1202 ("invalid value for 'require' module flag "
1203 "(first value operand should be a string)"),
1204 Value->getOperand(0));
1206 // Append it to the list of requirements, to check once all module flags are
1208 Requirements.push_back(Value);
1212 case Module::Append:
1213 case Module::AppendUnique: {
1214 // These behavior types require the operand be an MDNode.
1215 Assert(isa<MDNode>(Op->getOperand(2)),
1216 "invalid value for 'append'-type module flag "
1217 "(expected a metadata node)",
1223 // Unless this is a "requires" flag, check the ID is unique.
1224 if (MFB != Module::Require) {
1225 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
1227 "module flag identifiers must be unique (or of 'require' type)", ID);
1231 void Verifier::VerifyAttributeTypes(AttributeSet Attrs, unsigned Idx,
1232 bool isFunction, const Value *V) {
1233 unsigned Slot = ~0U;
1234 for (unsigned I = 0, E = Attrs.getNumSlots(); I != E; ++I)
1235 if (Attrs.getSlotIndex(I) == Idx) {
1240 assert(Slot != ~0U && "Attribute set inconsistency!");
1242 for (AttributeSet::iterator I = Attrs.begin(Slot), E = Attrs.end(Slot);
1244 if (I->isStringAttribute())
1247 if (I->getKindAsEnum() == Attribute::NoReturn ||
1248 I->getKindAsEnum() == Attribute::NoUnwind ||
1249 I->getKindAsEnum() == Attribute::NoInline ||
1250 I->getKindAsEnum() == Attribute::AlwaysInline ||
1251 I->getKindAsEnum() == Attribute::OptimizeForSize ||
1252 I->getKindAsEnum() == Attribute::StackProtect ||
1253 I->getKindAsEnum() == Attribute::StackProtectReq ||
1254 I->getKindAsEnum() == Attribute::StackProtectStrong ||
1255 I->getKindAsEnum() == Attribute::NoRedZone ||
1256 I->getKindAsEnum() == Attribute::NoImplicitFloat ||
1257 I->getKindAsEnum() == Attribute::Naked ||
1258 I->getKindAsEnum() == Attribute::InlineHint ||
1259 I->getKindAsEnum() == Attribute::StackAlignment ||
1260 I->getKindAsEnum() == Attribute::UWTable ||
1261 I->getKindAsEnum() == Attribute::NonLazyBind ||
1262 I->getKindAsEnum() == Attribute::ReturnsTwice ||
1263 I->getKindAsEnum() == Attribute::SanitizeAddress ||
1264 I->getKindAsEnum() == Attribute::SanitizeThread ||
1265 I->getKindAsEnum() == Attribute::SanitizeMemory ||
1266 I->getKindAsEnum() == Attribute::MinSize ||
1267 I->getKindAsEnum() == Attribute::NoDuplicate ||
1268 I->getKindAsEnum() == Attribute::Builtin ||
1269 I->getKindAsEnum() == Attribute::NoBuiltin ||
1270 I->getKindAsEnum() == Attribute::Cold ||
1271 I->getKindAsEnum() == Attribute::OptimizeNone ||
1272 I->getKindAsEnum() == Attribute::JumpTable) {
1274 CheckFailed("Attribute '" + I->getAsString() +
1275 "' only applies to functions!", V);
1278 } else if (I->getKindAsEnum() == Attribute::ReadOnly ||
1279 I->getKindAsEnum() == Attribute::ReadNone) {
1281 CheckFailed("Attribute '" + I->getAsString() +
1282 "' does not apply to function returns");
1285 } else if (isFunction) {
1286 CheckFailed("Attribute '" + I->getAsString() +
1287 "' does not apply to functions!", V);
1293 // VerifyParameterAttrs - Check the given attributes for an argument or return
1294 // value of the specified type. The value V is printed in error messages.
1295 void Verifier::VerifyParameterAttrs(AttributeSet Attrs, unsigned Idx, Type *Ty,
1296 bool isReturnValue, const Value *V) {
1297 if (!Attrs.hasAttributes(Idx))
1300 VerifyAttributeTypes(Attrs, Idx, false, V);
1303 Assert(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
1304 !Attrs.hasAttribute(Idx, Attribute::Nest) &&
1305 !Attrs.hasAttribute(Idx, Attribute::StructRet) &&
1306 !Attrs.hasAttribute(Idx, Attribute::NoCapture) &&
1307 !Attrs.hasAttribute(Idx, Attribute::Returned) &&
1308 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
1309 "Attributes 'byval', 'inalloca', 'nest', 'sret', 'nocapture', and "
1310 "'returned' do not apply to return values!",
1313 // Check for mutually incompatible attributes. Only inreg is compatible with
1315 unsigned AttrCount = 0;
1316 AttrCount += Attrs.hasAttribute(Idx, Attribute::ByVal);
1317 AttrCount += Attrs.hasAttribute(Idx, Attribute::InAlloca);
1318 AttrCount += Attrs.hasAttribute(Idx, Attribute::StructRet) ||
1319 Attrs.hasAttribute(Idx, Attribute::InReg);
1320 AttrCount += Attrs.hasAttribute(Idx, Attribute::Nest);
1321 Assert(AttrCount <= 1, "Attributes 'byval', 'inalloca', 'inreg', 'nest', "
1322 "and 'sret' are incompatible!",
1325 Assert(!(Attrs.hasAttribute(Idx, Attribute::InAlloca) &&
1326 Attrs.hasAttribute(Idx, Attribute::ReadOnly)),
1328 "'inalloca and readonly' are incompatible!",
1331 Assert(!(Attrs.hasAttribute(Idx, Attribute::StructRet) &&
1332 Attrs.hasAttribute(Idx, Attribute::Returned)),
1334 "'sret and returned' are incompatible!",
1337 Assert(!(Attrs.hasAttribute(Idx, Attribute::ZExt) &&
1338 Attrs.hasAttribute(Idx, Attribute::SExt)),
1340 "'zeroext and signext' are incompatible!",
1343 Assert(!(Attrs.hasAttribute(Idx, Attribute::ReadNone) &&
1344 Attrs.hasAttribute(Idx, Attribute::ReadOnly)),
1346 "'readnone and readonly' are incompatible!",
1349 Assert(!(Attrs.hasAttribute(Idx, Attribute::NoInline) &&
1350 Attrs.hasAttribute(Idx, Attribute::AlwaysInline)),
1352 "'noinline and alwaysinline' are incompatible!",
1355 Assert(!AttrBuilder(Attrs, Idx)
1356 .hasAttributes(AttributeFuncs::typeIncompatible(Ty, Idx), Idx),
1357 "Wrong types for attribute: " +
1358 AttributeFuncs::typeIncompatible(Ty, Idx).getAsString(Idx),
1361 if (PointerType *PTy = dyn_cast<PointerType>(Ty)) {
1362 SmallPtrSet<const Type*, 4> Visited;
1363 if (!PTy->getElementType()->isSized(&Visited)) {
1364 Assert(!Attrs.hasAttribute(Idx, Attribute::ByVal) &&
1365 !Attrs.hasAttribute(Idx, Attribute::InAlloca),
1366 "Attributes 'byval' and 'inalloca' do not support unsized types!",
1370 Assert(!Attrs.hasAttribute(Idx, Attribute::ByVal),
1371 "Attribute 'byval' only applies to parameters with pointer type!",
1376 // VerifyFunctionAttrs - Check parameter attributes against a function type.
1377 // The value V is printed in error messages.
1378 void Verifier::VerifyFunctionAttrs(FunctionType *FT, AttributeSet Attrs,
1380 if (Attrs.isEmpty())
1383 bool SawNest = false;
1384 bool SawReturned = false;
1385 bool SawSRet = false;
1387 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
1388 unsigned Idx = Attrs.getSlotIndex(i);
1392 Ty = FT->getReturnType();
1393 else if (Idx-1 < FT->getNumParams())
1394 Ty = FT->getParamType(Idx-1);
1396 break; // VarArgs attributes, verified elsewhere.
1398 VerifyParameterAttrs(Attrs, Idx, Ty, Idx == 0, V);
1403 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
1404 Assert(!SawNest, "More than one parameter has attribute nest!", V);
1408 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
1409 Assert(!SawReturned, "More than one parameter has attribute returned!",
1411 Assert(Ty->canLosslesslyBitCastTo(FT->getReturnType()),
1413 "argument and return types for 'returned' attribute",
1418 if (Attrs.hasAttribute(Idx, Attribute::StructRet)) {
1419 Assert(!SawSRet, "Cannot have multiple 'sret' parameters!", V);
1420 Assert(Idx == 1 || Idx == 2,
1421 "Attribute 'sret' is not on first or second parameter!", V);
1425 if (Attrs.hasAttribute(Idx, Attribute::InAlloca)) {
1426 Assert(Idx == FT->getNumParams(), "inalloca isn't on the last parameter!",
1431 if (!Attrs.hasAttributes(AttributeSet::FunctionIndex))
1434 VerifyAttributeTypes(Attrs, AttributeSet::FunctionIndex, true, V);
1437 !(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::ReadNone) &&
1438 Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::ReadOnly)),
1439 "Attributes 'readnone and readonly' are incompatible!", V);
1442 !(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::NoInline) &&
1443 Attrs.hasAttribute(AttributeSet::FunctionIndex,
1444 Attribute::AlwaysInline)),
1445 "Attributes 'noinline and alwaysinline' are incompatible!", V);
1447 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1448 Attribute::OptimizeNone)) {
1449 Assert(Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::NoInline),
1450 "Attribute 'optnone' requires 'noinline'!", V);
1452 Assert(!Attrs.hasAttribute(AttributeSet::FunctionIndex,
1453 Attribute::OptimizeForSize),
1454 "Attributes 'optsize and optnone' are incompatible!", V);
1456 Assert(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::MinSize),
1457 "Attributes 'minsize and optnone' are incompatible!", V);
1460 if (Attrs.hasAttribute(AttributeSet::FunctionIndex,
1461 Attribute::JumpTable)) {
1462 const GlobalValue *GV = cast<GlobalValue>(V);
1463 Assert(GV->hasUnnamedAddr(),
1464 "Attribute 'jumptable' requires 'unnamed_addr'", V);
1468 void Verifier::VerifyConstantExprBitcastType(const ConstantExpr *CE) {
1469 if (CE->getOpcode() != Instruction::BitCast)
1472 Assert(CastInst::castIsValid(Instruction::BitCast, CE->getOperand(0),
1474 "Invalid bitcast", CE);
1477 bool Verifier::VerifyAttributeCount(AttributeSet Attrs, unsigned Params) {
1478 if (Attrs.getNumSlots() == 0)
1481 unsigned LastSlot = Attrs.getNumSlots() - 1;
1482 unsigned LastIndex = Attrs.getSlotIndex(LastSlot);
1483 if (LastIndex <= Params
1484 || (LastIndex == AttributeSet::FunctionIndex
1485 && (LastSlot == 0 || Attrs.getSlotIndex(LastSlot - 1) <= Params)))
1491 /// \brief Verify that statepoint intrinsic is well formed.
1492 void Verifier::VerifyStatepoint(ImmutableCallSite CS) {
1493 assert(CS.getCalledFunction() &&
1494 CS.getCalledFunction()->getIntrinsicID() ==
1495 Intrinsic::experimental_gc_statepoint);
1497 const Instruction &CI = *CS.getInstruction();
1499 Assert(!CS.doesNotAccessMemory() && !CS.onlyReadsMemory(),
1500 "gc.statepoint must read and write memory to preserve "
1501 "reordering restrictions required by safepoint semantics",
1504 const Value *Target = CS.getArgument(0);
1505 const PointerType *PT = dyn_cast<PointerType>(Target->getType());
1506 Assert(PT && PT->getElementType()->isFunctionTy(),
1507 "gc.statepoint callee must be of function pointer type", &CI, Target);
1508 FunctionType *TargetFuncType = cast<FunctionType>(PT->getElementType());
1510 const Value *NumCallArgsV = CS.getArgument(1);
1511 Assert(isa<ConstantInt>(NumCallArgsV),
1512 "gc.statepoint number of arguments to underlying call "
1513 "must be constant integer",
1515 const int NumCallArgs = cast<ConstantInt>(NumCallArgsV)->getZExtValue();
1516 Assert(NumCallArgs >= 0,
1517 "gc.statepoint number of arguments to underlying call "
1520 const int NumParams = (int)TargetFuncType->getNumParams();
1521 if (TargetFuncType->isVarArg()) {
1522 Assert(NumCallArgs >= NumParams,
1523 "gc.statepoint mismatch in number of vararg call args", &CI);
1525 // TODO: Remove this limitation
1526 Assert(TargetFuncType->getReturnType()->isVoidTy(),
1527 "gc.statepoint doesn't support wrapping non-void "
1528 "vararg functions yet",
1531 Assert(NumCallArgs == NumParams,
1532 "gc.statepoint mismatch in number of call args", &CI);
1534 const Value *Unused = CS.getArgument(2);
1535 Assert(isa<ConstantInt>(Unused) && cast<ConstantInt>(Unused)->isNullValue(),
1536 "gc.statepoint parameter #3 must be zero", &CI);
1538 // Verify that the types of the call parameter arguments match
1539 // the type of the wrapped callee.
1540 for (int i = 0; i < NumParams; i++) {
1541 Type *ParamType = TargetFuncType->getParamType(i);
1542 Type *ArgType = CS.getArgument(3+i)->getType();
1543 Assert(ArgType == ParamType,
1544 "gc.statepoint call argument does not match wrapped "
1548 const int EndCallArgsInx = 2+NumCallArgs;
1549 const Value *NumDeoptArgsV = CS.getArgument(EndCallArgsInx+1);
1550 Assert(isa<ConstantInt>(NumDeoptArgsV),
1551 "gc.statepoint number of deoptimization arguments "
1552 "must be constant integer",
1554 const int NumDeoptArgs = cast<ConstantInt>(NumDeoptArgsV)->getZExtValue();
1555 Assert(NumDeoptArgs >= 0, "gc.statepoint number of deoptimization arguments "
1559 Assert(4 + NumCallArgs + NumDeoptArgs <= (int)CS.arg_size(),
1560 "gc.statepoint too few arguments according to length fields", &CI);
1562 // Check that the only uses of this gc.statepoint are gc.result or
1563 // gc.relocate calls which are tied to this statepoint and thus part
1564 // of the same statepoint sequence
1565 for (const User *U : CI.users()) {
1566 const CallInst *Call = dyn_cast<const CallInst>(U);
1567 Assert(Call, "illegal use of statepoint token", &CI, U);
1568 if (!Call) continue;
1569 Assert(isGCRelocate(Call) || isGCResult(Call),
1570 "gc.result or gc.relocate are the only value uses"
1571 "of a gc.statepoint",
1573 if (isGCResult(Call)) {
1574 Assert(Call->getArgOperand(0) == &CI,
1575 "gc.result connected to wrong gc.statepoint", &CI, Call);
1576 } else if (isGCRelocate(Call)) {
1577 Assert(Call->getArgOperand(0) == &CI,
1578 "gc.relocate connected to wrong gc.statepoint", &CI, Call);
1582 // Note: It is legal for a single derived pointer to be listed multiple
1583 // times. It's non-optimal, but it is legal. It can also happen after
1584 // insertion if we strip a bitcast away.
1585 // Note: It is really tempting to check that each base is relocated and
1586 // that a derived pointer is never reused as a base pointer. This turns
1587 // out to be problematic since optimizations run after safepoint insertion
1588 // can recognize equality properties that the insertion logic doesn't know
1589 // about. See example statepoint.ll in the verifier subdirectory
1592 void Verifier::verifyFrameRecoverIndices() {
1593 for (auto &Counts : FrameEscapeInfo) {
1594 Function *F = Counts.first;
1595 unsigned EscapedObjectCount = Counts.second.first;
1596 unsigned MaxRecoveredIndex = Counts.second.second;
1597 Assert(MaxRecoveredIndex <= EscapedObjectCount,
1598 "all indices passed to llvm.framerecover must be less than the "
1599 "number of arguments passed ot llvm.frameescape in the parent "
1605 // visitFunction - Verify that a function is ok.
1607 void Verifier::visitFunction(const Function &F) {
1608 // Check function arguments.
1609 FunctionType *FT = F.getFunctionType();
1610 unsigned NumArgs = F.arg_size();
1612 Assert(Context == &F.getContext(),
1613 "Function context does not match Module context!", &F);
1615 Assert(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
1616 Assert(FT->getNumParams() == NumArgs,
1617 "# formal arguments must match # of arguments for function type!", &F,
1619 Assert(F.getReturnType()->isFirstClassType() ||
1620 F.getReturnType()->isVoidTy() || F.getReturnType()->isStructTy(),
1621 "Functions cannot return aggregate values!", &F);
1623 Assert(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
1624 "Invalid struct return type!", &F);
1626 AttributeSet Attrs = F.getAttributes();
1628 Assert(VerifyAttributeCount(Attrs, FT->getNumParams()),
1629 "Attribute after last parameter!", &F);
1631 // Check function attributes.
1632 VerifyFunctionAttrs(FT, Attrs, &F);
1634 // On function declarations/definitions, we do not support the builtin
1635 // attribute. We do not check this in VerifyFunctionAttrs since that is
1636 // checking for Attributes that can/can not ever be on functions.
1637 Assert(!Attrs.hasAttribute(AttributeSet::FunctionIndex, Attribute::Builtin),
1638 "Attribute 'builtin' can only be applied to a callsite.", &F);
1640 // Check that this function meets the restrictions on this calling convention.
1641 // Sometimes varargs is used for perfectly forwarding thunks, so some of these
1642 // restrictions can be lifted.
1643 switch (F.getCallingConv()) {
1645 case CallingConv::C:
1647 case CallingConv::Fast:
1648 case CallingConv::Cold:
1649 case CallingConv::Intel_OCL_BI:
1650 case CallingConv::PTX_Kernel:
1651 case CallingConv::PTX_Device:
1652 Assert(!F.isVarArg(), "Calling convention does not support varargs or "
1653 "perfect forwarding!",
1658 bool isLLVMdotName = F.getName().size() >= 5 &&
1659 F.getName().substr(0, 5) == "llvm.";
1661 // Check that the argument values match the function type for this function...
1663 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E;
1665 Assert(I->getType() == FT->getParamType(i),
1666 "Argument value does not match function argument type!", I,
1667 FT->getParamType(i));
1668 Assert(I->getType()->isFirstClassType(),
1669 "Function arguments must have first-class types!", I);
1671 Assert(!I->getType()->isMetadataTy(),
1672 "Function takes metadata but isn't an intrinsic", I, &F);
1675 if (F.isMaterializable()) {
1676 // Function has a body somewhere we can't see.
1677 } else if (F.isDeclaration()) {
1678 Assert(F.hasExternalLinkage() || F.hasExternalWeakLinkage(),
1679 "invalid linkage type for function declaration", &F);
1681 // Verify that this function (which has a body) is not named "llvm.*". It
1682 // is not legal to define intrinsics.
1683 Assert(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
1685 // Check the entry node
1686 const BasicBlock *Entry = &F.getEntryBlock();
1687 Assert(pred_empty(Entry),
1688 "Entry block to function must not have predecessors!", Entry);
1690 // The address of the entry block cannot be taken, unless it is dead.
1691 if (Entry->hasAddressTaken()) {
1692 Assert(!BlockAddress::lookup(Entry)->isConstantUsed(),
1693 "blockaddress may not be used with the entry block!", Entry);
1697 // If this function is actually an intrinsic, verify that it is only used in
1698 // direct call/invokes, never having its "address taken".
1699 if (F.getIntrinsicID()) {
1701 if (F.hasAddressTaken(&U))
1702 Assert(0, "Invalid user of intrinsic instruction!", U);
1705 Assert(!F.hasDLLImportStorageClass() ||
1706 (F.isDeclaration() && F.hasExternalLinkage()) ||
1707 F.hasAvailableExternallyLinkage(),
1708 "Function is marked as dllimport, but not external.", &F);
1711 // verifyBasicBlock - Verify that a basic block is well formed...
1713 void Verifier::visitBasicBlock(BasicBlock &BB) {
1714 InstsInThisBlock.clear();
1716 // Ensure that basic blocks have terminators!
1717 Assert(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
1719 // Check constraints that this basic block imposes on all of the PHI nodes in
1721 if (isa<PHINode>(BB.front())) {
1722 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
1723 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
1724 std::sort(Preds.begin(), Preds.end());
1726 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
1727 // Ensure that PHI nodes have at least one entry!
1728 Assert(PN->getNumIncomingValues() != 0,
1729 "PHI nodes must have at least one entry. If the block is dead, "
1730 "the PHI should be removed!",
1732 Assert(PN->getNumIncomingValues() == Preds.size(),
1733 "PHINode should have one entry for each predecessor of its "
1734 "parent basic block!",
1737 // Get and sort all incoming values in the PHI node...
1739 Values.reserve(PN->getNumIncomingValues());
1740 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1741 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
1742 PN->getIncomingValue(i)));
1743 std::sort(Values.begin(), Values.end());
1745 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
1746 // Check to make sure that if there is more than one entry for a
1747 // particular basic block in this PHI node, that the incoming values are
1750 Assert(i == 0 || Values[i].first != Values[i - 1].first ||
1751 Values[i].second == Values[i - 1].second,
1752 "PHI node has multiple entries for the same basic block with "
1753 "different incoming values!",
1754 PN, Values[i].first, Values[i].second, Values[i - 1].second);
1756 // Check to make sure that the predecessors and PHI node entries are
1758 Assert(Values[i].first == Preds[i],
1759 "PHI node entries do not match predecessors!", PN,
1760 Values[i].first, Preds[i]);
1765 // Check that all instructions have their parent pointers set up correctly.
1768 Assert(I.getParent() == &BB, "Instruction has bogus parent pointer!");
1772 void Verifier::visitTerminatorInst(TerminatorInst &I) {
1773 // Ensure that terminators only exist at the end of the basic block.
1774 Assert(&I == I.getParent()->getTerminator(),
1775 "Terminator found in the middle of a basic block!", I.getParent());
1776 visitInstruction(I);
1779 void Verifier::visitBranchInst(BranchInst &BI) {
1780 if (BI.isConditional()) {
1781 Assert(BI.getCondition()->getType()->isIntegerTy(1),
1782 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
1784 visitTerminatorInst(BI);
1787 void Verifier::visitReturnInst(ReturnInst &RI) {
1788 Function *F = RI.getParent()->getParent();
1789 unsigned N = RI.getNumOperands();
1790 if (F->getReturnType()->isVoidTy())
1792 "Found return instr that returns non-void in Function of void "
1794 &RI, F->getReturnType());
1796 Assert(N == 1 && F->getReturnType() == RI.getOperand(0)->getType(),
1797 "Function return type does not match operand "
1798 "type of return inst!",
1799 &RI, F->getReturnType());
1801 // Check to make sure that the return value has necessary properties for
1803 visitTerminatorInst(RI);
1806 void Verifier::visitSwitchInst(SwitchInst &SI) {
1807 // Check to make sure that all of the constants in the switch instruction
1808 // have the same type as the switched-on value.
1809 Type *SwitchTy = SI.getCondition()->getType();
1810 SmallPtrSet<ConstantInt*, 32> Constants;
1811 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end(); i != e; ++i) {
1812 Assert(i.getCaseValue()->getType() == SwitchTy,
1813 "Switch constants must all be same type as switch value!", &SI);
1814 Assert(Constants.insert(i.getCaseValue()).second,
1815 "Duplicate integer as switch case", &SI, i.getCaseValue());
1818 visitTerminatorInst(SI);
1821 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
1822 Assert(BI.getAddress()->getType()->isPointerTy(),
1823 "Indirectbr operand must have pointer type!", &BI);
1824 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
1825 Assert(BI.getDestination(i)->getType()->isLabelTy(),
1826 "Indirectbr destinations must all have pointer type!", &BI);
1828 visitTerminatorInst(BI);
1831 void Verifier::visitSelectInst(SelectInst &SI) {
1832 Assert(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
1834 "Invalid operands for select instruction!", &SI);
1836 Assert(SI.getTrueValue()->getType() == SI.getType(),
1837 "Select values must have same type as select instruction!", &SI);
1838 visitInstruction(SI);
1841 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
1842 /// a pass, if any exist, it's an error.
1844 void Verifier::visitUserOp1(Instruction &I) {
1845 Assert(0, "User-defined operators should not live outside of a pass!", &I);
1848 void Verifier::visitTruncInst(TruncInst &I) {
1849 // Get the source and destination types
1850 Type *SrcTy = I.getOperand(0)->getType();
1851 Type *DestTy = I.getType();
1853 // Get the size of the types in bits, we'll need this later
1854 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1855 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1857 Assert(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
1858 Assert(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
1859 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1860 "trunc source and destination must both be a vector or neither", &I);
1861 Assert(SrcBitSize > DestBitSize, "DestTy too big for Trunc", &I);
1863 visitInstruction(I);
1866 void Verifier::visitZExtInst(ZExtInst &I) {
1867 // Get the source and destination types
1868 Type *SrcTy = I.getOperand(0)->getType();
1869 Type *DestTy = I.getType();
1871 // Get the size of the types in bits, we'll need this later
1872 Assert(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
1873 Assert(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
1874 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1875 "zext source and destination must both be a vector or neither", &I);
1876 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1877 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1879 Assert(SrcBitSize < DestBitSize, "Type too small for ZExt", &I);
1881 visitInstruction(I);
1884 void Verifier::visitSExtInst(SExtInst &I) {
1885 // Get the source and destination types
1886 Type *SrcTy = I.getOperand(0)->getType();
1887 Type *DestTy = I.getType();
1889 // Get the size of the types in bits, we'll need this later
1890 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1891 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1893 Assert(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
1894 Assert(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
1895 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1896 "sext source and destination must both be a vector or neither", &I);
1897 Assert(SrcBitSize < DestBitSize, "Type too small for SExt", &I);
1899 visitInstruction(I);
1902 void Verifier::visitFPTruncInst(FPTruncInst &I) {
1903 // Get the source and destination types
1904 Type *SrcTy = I.getOperand(0)->getType();
1905 Type *DestTy = I.getType();
1906 // Get the size of the types in bits, we'll need this later
1907 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1908 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1910 Assert(SrcTy->isFPOrFPVectorTy(), "FPTrunc only operates on FP", &I);
1911 Assert(DestTy->isFPOrFPVectorTy(), "FPTrunc only produces an FP", &I);
1912 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1913 "fptrunc source and destination must both be a vector or neither", &I);
1914 Assert(SrcBitSize > DestBitSize, "DestTy too big for FPTrunc", &I);
1916 visitInstruction(I);
1919 void Verifier::visitFPExtInst(FPExtInst &I) {
1920 // Get the source and destination types
1921 Type *SrcTy = I.getOperand(0)->getType();
1922 Type *DestTy = I.getType();
1924 // Get the size of the types in bits, we'll need this later
1925 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
1926 unsigned DestBitSize = DestTy->getScalarSizeInBits();
1928 Assert(SrcTy->isFPOrFPVectorTy(), "FPExt only operates on FP", &I);
1929 Assert(DestTy->isFPOrFPVectorTy(), "FPExt only produces an FP", &I);
1930 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(),
1931 "fpext source and destination must both be a vector or neither", &I);
1932 Assert(SrcBitSize < DestBitSize, "DestTy too small for FPExt", &I);
1934 visitInstruction(I);
1937 void Verifier::visitUIToFPInst(UIToFPInst &I) {
1938 // Get the source and destination types
1939 Type *SrcTy = I.getOperand(0)->getType();
1940 Type *DestTy = I.getType();
1942 bool SrcVec = SrcTy->isVectorTy();
1943 bool DstVec = DestTy->isVectorTy();
1945 Assert(SrcVec == DstVec,
1946 "UIToFP source and dest must both be vector or scalar", &I);
1947 Assert(SrcTy->isIntOrIntVectorTy(),
1948 "UIToFP source must be integer or integer vector", &I);
1949 Assert(DestTy->isFPOrFPVectorTy(), "UIToFP result must be FP or FP vector",
1952 if (SrcVec && DstVec)
1953 Assert(cast<VectorType>(SrcTy)->getNumElements() ==
1954 cast<VectorType>(DestTy)->getNumElements(),
1955 "UIToFP source and dest vector length mismatch", &I);
1957 visitInstruction(I);
1960 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1961 // Get the source and destination types
1962 Type *SrcTy = I.getOperand(0)->getType();
1963 Type *DestTy = I.getType();
1965 bool SrcVec = SrcTy->isVectorTy();
1966 bool DstVec = DestTy->isVectorTy();
1968 Assert(SrcVec == DstVec,
1969 "SIToFP source and dest must both be vector or scalar", &I);
1970 Assert(SrcTy->isIntOrIntVectorTy(),
1971 "SIToFP source must be integer or integer vector", &I);
1972 Assert(DestTy->isFPOrFPVectorTy(), "SIToFP result must be FP or FP vector",
1975 if (SrcVec && DstVec)
1976 Assert(cast<VectorType>(SrcTy)->getNumElements() ==
1977 cast<VectorType>(DestTy)->getNumElements(),
1978 "SIToFP source and dest vector length mismatch", &I);
1980 visitInstruction(I);
1983 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1984 // Get the source and destination types
1985 Type *SrcTy = I.getOperand(0)->getType();
1986 Type *DestTy = I.getType();
1988 bool SrcVec = SrcTy->isVectorTy();
1989 bool DstVec = DestTy->isVectorTy();
1991 Assert(SrcVec == DstVec,
1992 "FPToUI source and dest must both be vector or scalar", &I);
1993 Assert(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1995 Assert(DestTy->isIntOrIntVectorTy(),
1996 "FPToUI result must be integer or integer vector", &I);
1998 if (SrcVec && DstVec)
1999 Assert(cast<VectorType>(SrcTy)->getNumElements() ==
2000 cast<VectorType>(DestTy)->getNumElements(),
2001 "FPToUI source and dest vector length mismatch", &I);
2003 visitInstruction(I);
2006 void Verifier::visitFPToSIInst(FPToSIInst &I) {
2007 // Get the source and destination types
2008 Type *SrcTy = I.getOperand(0)->getType();
2009 Type *DestTy = I.getType();
2011 bool SrcVec = SrcTy->isVectorTy();
2012 bool DstVec = DestTy->isVectorTy();
2014 Assert(SrcVec == DstVec,
2015 "FPToSI source and dest must both be vector or scalar", &I);
2016 Assert(SrcTy->isFPOrFPVectorTy(), "FPToSI source must be FP or FP vector",
2018 Assert(DestTy->isIntOrIntVectorTy(),
2019 "FPToSI result must be integer or integer vector", &I);
2021 if (SrcVec && DstVec)
2022 Assert(cast<VectorType>(SrcTy)->getNumElements() ==
2023 cast<VectorType>(DestTy)->getNumElements(),
2024 "FPToSI source and dest vector length mismatch", &I);
2026 visitInstruction(I);
2029 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
2030 // Get the source and destination types
2031 Type *SrcTy = I.getOperand(0)->getType();
2032 Type *DestTy = I.getType();
2034 Assert(SrcTy->getScalarType()->isPointerTy(),
2035 "PtrToInt source must be pointer", &I);
2036 Assert(DestTy->getScalarType()->isIntegerTy(),
2037 "PtrToInt result must be integral", &I);
2038 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(), "PtrToInt type mismatch",
2041 if (SrcTy->isVectorTy()) {
2042 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
2043 VectorType *VDest = dyn_cast<VectorType>(DestTy);
2044 Assert(VSrc->getNumElements() == VDest->getNumElements(),
2045 "PtrToInt Vector width mismatch", &I);
2048 visitInstruction(I);
2051 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
2052 // Get the source and destination types
2053 Type *SrcTy = I.getOperand(0)->getType();
2054 Type *DestTy = I.getType();
2056 Assert(SrcTy->getScalarType()->isIntegerTy(),
2057 "IntToPtr source must be an integral", &I);
2058 Assert(DestTy->getScalarType()->isPointerTy(),
2059 "IntToPtr result must be a pointer", &I);
2060 Assert(SrcTy->isVectorTy() == DestTy->isVectorTy(), "IntToPtr type mismatch",
2062 if (SrcTy->isVectorTy()) {
2063 VectorType *VSrc = dyn_cast<VectorType>(SrcTy);
2064 VectorType *VDest = dyn_cast<VectorType>(DestTy);
2065 Assert(VSrc->getNumElements() == VDest->getNumElements(),
2066 "IntToPtr Vector width mismatch", &I);
2068 visitInstruction(I);
2071 void Verifier::visitBitCastInst(BitCastInst &I) {
2073 CastInst::castIsValid(Instruction::BitCast, I.getOperand(0), I.getType()),
2074 "Invalid bitcast", &I);
2075 visitInstruction(I);
2078 void Verifier::visitAddrSpaceCastInst(AddrSpaceCastInst &I) {
2079 Type *SrcTy = I.getOperand(0)->getType();
2080 Type *DestTy = I.getType();
2082 Assert(SrcTy->isPtrOrPtrVectorTy(), "AddrSpaceCast source must be a pointer",
2084 Assert(DestTy->isPtrOrPtrVectorTy(), "AddrSpaceCast result must be a pointer",
2086 Assert(SrcTy->getPointerAddressSpace() != DestTy->getPointerAddressSpace(),
2087 "AddrSpaceCast must be between different address spaces", &I);
2088 if (SrcTy->isVectorTy())
2089 Assert(SrcTy->getVectorNumElements() == DestTy->getVectorNumElements(),
2090 "AddrSpaceCast vector pointer number of elements mismatch", &I);
2091 visitInstruction(I);
2094 /// visitPHINode - Ensure that a PHI node is well formed.
2096 void Verifier::visitPHINode(PHINode &PN) {
2097 // Ensure that the PHI nodes are all grouped together at the top of the block.
2098 // This can be tested by checking whether the instruction before this is
2099 // either nonexistent (because this is begin()) or is a PHI node. If not,
2100 // then there is some other instruction before a PHI.
2101 Assert(&PN == &PN.getParent()->front() ||
2102 isa<PHINode>(--BasicBlock::iterator(&PN)),
2103 "PHI nodes not grouped at top of basic block!", &PN, PN.getParent());
2105 // Check that all of the values of the PHI node have the same type as the
2106 // result, and that the incoming blocks are really basic blocks.
2107 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
2108 Assert(PN.getType() == PN.getIncomingValue(i)->getType(),
2109 "PHI node operands are not the same type as the result!", &PN);
2112 // All other PHI node constraints are checked in the visitBasicBlock method.
2114 visitInstruction(PN);
2117 void Verifier::VerifyCallSite(CallSite CS) {
2118 Instruction *I = CS.getInstruction();
2120 Assert(CS.getCalledValue()->getType()->isPointerTy(),
2121 "Called function must be a pointer!", I);
2122 PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
2124 Assert(FPTy->getElementType()->isFunctionTy(),
2125 "Called function is not pointer to function type!", I);
2126 FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
2128 // Verify that the correct number of arguments are being passed
2129 if (FTy->isVarArg())
2130 Assert(CS.arg_size() >= FTy->getNumParams(),
2131 "Called function requires more parameters than were provided!", I);
2133 Assert(CS.arg_size() == FTy->getNumParams(),
2134 "Incorrect number of arguments passed to called function!", I);
2136 // Verify that all arguments to the call match the function type.
2137 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
2138 Assert(CS.getArgument(i)->getType() == FTy->getParamType(i),
2139 "Call parameter type does not match function signature!",
2140 CS.getArgument(i), FTy->getParamType(i), I);
2142 AttributeSet Attrs = CS.getAttributes();
2144 Assert(VerifyAttributeCount(Attrs, CS.arg_size()),
2145 "Attribute after last parameter!", I);
2147 // Verify call attributes.
2148 VerifyFunctionAttrs(FTy, Attrs, I);
2150 // Conservatively check the inalloca argument.
2151 // We have a bug if we can find that there is an underlying alloca without
2153 if (CS.hasInAllocaArgument()) {
2154 Value *InAllocaArg = CS.getArgument(FTy->getNumParams() - 1);
2155 if (auto AI = dyn_cast<AllocaInst>(InAllocaArg->stripInBoundsOffsets()))
2156 Assert(AI->isUsedWithInAlloca(),
2157 "inalloca argument for call has mismatched alloca", AI, I);
2160 if (FTy->isVarArg()) {
2161 // FIXME? is 'nest' even legal here?
2162 bool SawNest = false;
2163 bool SawReturned = false;
2165 for (unsigned Idx = 1; Idx < 1 + FTy->getNumParams(); ++Idx) {
2166 if (Attrs.hasAttribute(Idx, Attribute::Nest))
2168 if (Attrs.hasAttribute(Idx, Attribute::Returned))
2172 // Check attributes on the varargs part.
2173 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
2174 Type *Ty = CS.getArgument(Idx-1)->getType();
2175 VerifyParameterAttrs(Attrs, Idx, Ty, false, I);
2177 if (Attrs.hasAttribute(Idx, Attribute::Nest)) {
2178 Assert(!SawNest, "More than one parameter has attribute nest!", I);
2182 if (Attrs.hasAttribute(Idx, Attribute::Returned)) {
2183 Assert(!SawReturned, "More than one parameter has attribute returned!",
2185 Assert(Ty->canLosslesslyBitCastTo(FTy->getReturnType()),
2186 "Incompatible argument and return types for 'returned' "
2192 Assert(!Attrs.hasAttribute(Idx, Attribute::StructRet),
2193 "Attribute 'sret' cannot be used for vararg call arguments!", I);
2195 if (Attrs.hasAttribute(Idx, Attribute::InAlloca))
2196 Assert(Idx == CS.arg_size(), "inalloca isn't on the last argument!", I);
2200 // Verify that there's no metadata unless it's a direct call to an intrinsic.
2201 if (CS.getCalledFunction() == nullptr ||
2202 !CS.getCalledFunction()->getName().startswith("llvm.")) {
2203 for (FunctionType::param_iterator PI = FTy->param_begin(),
2204 PE = FTy->param_end(); PI != PE; ++PI)
2205 Assert(!(*PI)->isMetadataTy(),
2206 "Function has metadata parameter but isn't an intrinsic", I);
2209 visitInstruction(*I);
2212 /// Two types are "congruent" if they are identical, or if they are both pointer
2213 /// types with different pointee types and the same address space.
2214 static bool isTypeCongruent(Type *L, Type *R) {
2217 PointerType *PL = dyn_cast<PointerType>(L);
2218 PointerType *PR = dyn_cast<PointerType>(R);
2221 return PL->getAddressSpace() == PR->getAddressSpace();
2224 static AttrBuilder getParameterABIAttributes(int I, AttributeSet Attrs) {
2225 static const Attribute::AttrKind ABIAttrs[] = {
2226 Attribute::StructRet, Attribute::ByVal, Attribute::InAlloca,
2227 Attribute::InReg, Attribute::Returned};
2229 for (auto AK : ABIAttrs) {
2230 if (Attrs.hasAttribute(I + 1, AK))
2231 Copy.addAttribute(AK);
2233 if (Attrs.hasAttribute(I + 1, Attribute::Alignment))
2234 Copy.addAlignmentAttr(Attrs.getParamAlignment(I + 1));
2238 void Verifier::verifyMustTailCall(CallInst &CI) {
2239 Assert(!CI.isInlineAsm(), "cannot use musttail call with inline asm", &CI);
2241 // - The caller and callee prototypes must match. Pointer types of
2242 // parameters or return types may differ in pointee type, but not
2244 Function *F = CI.getParent()->getParent();
2245 auto GetFnTy = [](Value *V) {
2246 return cast<FunctionType>(
2247 cast<PointerType>(V->getType())->getElementType());
2249 FunctionType *CallerTy = GetFnTy(F);
2250 FunctionType *CalleeTy = GetFnTy(CI.getCalledValue());
2251 Assert(CallerTy->getNumParams() == CalleeTy->getNumParams(),
2252 "cannot guarantee tail call due to mismatched parameter counts", &CI);
2253 Assert(CallerTy->isVarArg() == CalleeTy->isVarArg(),
2254 "cannot guarantee tail call due to mismatched varargs", &CI);
2255 Assert(isTypeCongruent(CallerTy->getReturnType(), CalleeTy->getReturnType()),
2256 "cannot guarantee tail call due to mismatched return types", &CI);
2257 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
2259 isTypeCongruent(CallerTy->getParamType(I), CalleeTy->getParamType(I)),
2260 "cannot guarantee tail call due to mismatched parameter types", &CI);
2263 // - The calling conventions of the caller and callee must match.
2264 Assert(F->getCallingConv() == CI.getCallingConv(),
2265 "cannot guarantee tail call due to mismatched calling conv", &CI);
2267 // - All ABI-impacting function attributes, such as sret, byval, inreg,
2268 // returned, and inalloca, must match.
2269 AttributeSet CallerAttrs = F->getAttributes();
2270 AttributeSet CalleeAttrs = CI.getAttributes();
2271 for (int I = 0, E = CallerTy->getNumParams(); I != E; ++I) {
2272 AttrBuilder CallerABIAttrs = getParameterABIAttributes(I, CallerAttrs);
2273 AttrBuilder CalleeABIAttrs = getParameterABIAttributes(I, CalleeAttrs);
2274 Assert(CallerABIAttrs == CalleeABIAttrs,
2275 "cannot guarantee tail call due to mismatched ABI impacting "
2276 "function attributes",
2277 &CI, CI.getOperand(I));
2280 // - The call must immediately precede a :ref:`ret <i_ret>` instruction,
2281 // or a pointer bitcast followed by a ret instruction.
2282 // - The ret instruction must return the (possibly bitcasted) value
2283 // produced by the call or void.
2284 Value *RetVal = &CI;
2285 Instruction *Next = CI.getNextNode();
2287 // Handle the optional bitcast.
2288 if (BitCastInst *BI = dyn_cast_or_null<BitCastInst>(Next)) {
2289 Assert(BI->getOperand(0) == RetVal,
2290 "bitcast following musttail call must use the call", BI);
2292 Next = BI->getNextNode();
2295 // Check the return.
2296 ReturnInst *Ret = dyn_cast_or_null<ReturnInst>(Next);
2297 Assert(Ret, "musttail call must be precede a ret with an optional bitcast",
2299 Assert(!Ret->getReturnValue() || Ret->getReturnValue() == RetVal,
2300 "musttail call result must be returned", Ret);
2303 void Verifier::visitCallInst(CallInst &CI) {
2304 VerifyCallSite(&CI);
2306 if (CI.isMustTailCall())
2307 verifyMustTailCall(CI);
2309 if (Function *F = CI.getCalledFunction())
2310 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
2311 visitIntrinsicFunctionCall(ID, CI);
2314 void Verifier::visitInvokeInst(InvokeInst &II) {
2315 VerifyCallSite(&II);
2317 // Verify that there is a landingpad instruction as the first non-PHI
2318 // instruction of the 'unwind' destination.
2319 Assert(II.getUnwindDest()->isLandingPad(),
2320 "The unwind destination does not have a landingpad instruction!", &II);
2322 if (Function *F = II.getCalledFunction())
2323 // TODO: Ideally we should use visitIntrinsicFunction here. But it uses
2324 // CallInst as an input parameter. It not woth updating this whole
2325 // function only to support statepoint verification.
2326 if (F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint)
2327 VerifyStatepoint(ImmutableCallSite(&II));
2329 visitTerminatorInst(II);
2332 /// visitBinaryOperator - Check that both arguments to the binary operator are
2333 /// of the same type!
2335 void Verifier::visitBinaryOperator(BinaryOperator &B) {
2336 Assert(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
2337 "Both operands to a binary operator are not of the same type!", &B);
2339 switch (B.getOpcode()) {
2340 // Check that integer arithmetic operators are only used with
2341 // integral operands.
2342 case Instruction::Add:
2343 case Instruction::Sub:
2344 case Instruction::Mul:
2345 case Instruction::SDiv:
2346 case Instruction::UDiv:
2347 case Instruction::SRem:
2348 case Instruction::URem:
2349 Assert(B.getType()->isIntOrIntVectorTy(),
2350 "Integer arithmetic operators only work with integral types!", &B);
2351 Assert(B.getType() == B.getOperand(0)->getType(),
2352 "Integer arithmetic operators must have same type "
2353 "for operands and result!",
2356 // Check that floating-point arithmetic operators are only used with
2357 // floating-point operands.
2358 case Instruction::FAdd:
2359 case Instruction::FSub:
2360 case Instruction::FMul:
2361 case Instruction::FDiv:
2362 case Instruction::FRem:
2363 Assert(B.getType()->isFPOrFPVectorTy(),
2364 "Floating-point arithmetic operators only work with "
2365 "floating-point types!",
2367 Assert(B.getType() == B.getOperand(0)->getType(),
2368 "Floating-point arithmetic operators must have same type "
2369 "for operands and result!",
2372 // Check that logical operators are only used with integral operands.
2373 case Instruction::And:
2374 case Instruction::Or:
2375 case Instruction::Xor:
2376 Assert(B.getType()->isIntOrIntVectorTy(),
2377 "Logical operators only work with integral types!", &B);
2378 Assert(B.getType() == B.getOperand(0)->getType(),
2379 "Logical operators must have same type for operands and result!",
2382 case Instruction::Shl:
2383 case Instruction::LShr:
2384 case Instruction::AShr:
2385 Assert(B.getType()->isIntOrIntVectorTy(),
2386 "Shifts only work with integral types!", &B);
2387 Assert(B.getType() == B.getOperand(0)->getType(),
2388 "Shift return type must be same as operands!", &B);
2391 llvm_unreachable("Unknown BinaryOperator opcode!");
2394 visitInstruction(B);
2397 void Verifier::visitICmpInst(ICmpInst &IC) {
2398 // Check that the operands are the same type
2399 Type *Op0Ty = IC.getOperand(0)->getType();
2400 Type *Op1Ty = IC.getOperand(1)->getType();
2401 Assert(Op0Ty == Op1Ty,
2402 "Both operands to ICmp instruction are not of the same type!", &IC);
2403 // Check that the operands are the right type
2404 Assert(Op0Ty->isIntOrIntVectorTy() || Op0Ty->getScalarType()->isPointerTy(),
2405 "Invalid operand types for ICmp instruction", &IC);
2406 // Check that the predicate is valid.
2407 Assert(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
2408 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
2409 "Invalid predicate in ICmp instruction!", &IC);
2411 visitInstruction(IC);
2414 void Verifier::visitFCmpInst(FCmpInst &FC) {
2415 // Check that the operands are the same type
2416 Type *Op0Ty = FC.getOperand(0)->getType();
2417 Type *Op1Ty = FC.getOperand(1)->getType();
2418 Assert(Op0Ty == Op1Ty,
2419 "Both operands to FCmp instruction are not of the same type!", &FC);
2420 // Check that the operands are the right type
2421 Assert(Op0Ty->isFPOrFPVectorTy(),
2422 "Invalid operand types for FCmp instruction", &FC);
2423 // Check that the predicate is valid.
2424 Assert(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
2425 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
2426 "Invalid predicate in FCmp instruction!", &FC);
2428 visitInstruction(FC);
2431 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
2433 ExtractElementInst::isValidOperands(EI.getOperand(0), EI.getOperand(1)),
2434 "Invalid extractelement operands!", &EI);
2435 visitInstruction(EI);
2438 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
2439 Assert(InsertElementInst::isValidOperands(IE.getOperand(0), IE.getOperand(1),
2441 "Invalid insertelement operands!", &IE);
2442 visitInstruction(IE);
2445 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
2446 Assert(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
2448 "Invalid shufflevector operands!", &SV);
2449 visitInstruction(SV);
2452 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
2453 Type *TargetTy = GEP.getPointerOperandType()->getScalarType();
2455 Assert(isa<PointerType>(TargetTy),
2456 "GEP base pointer is not a vector or a vector of pointers", &GEP);
2457 Assert(cast<PointerType>(TargetTy)->getElementType()->isSized(),
2458 "GEP into unsized type!", &GEP);
2459 Assert(GEP.getPointerOperandType()->isVectorTy() ==
2460 GEP.getType()->isVectorTy(),
2461 "Vector GEP must return a vector value", &GEP);
2463 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
2465 GetElementPtrInst::getIndexedType(GEP.getSourceElementType(), Idxs);
2466 Assert(ElTy, "Invalid indices for GEP pointer type!", &GEP);
2468 Assert(GEP.getType()->getScalarType()->isPointerTy() &&
2469 cast<PointerType>(GEP.getType()->getScalarType())
2470 ->getElementType() == ElTy,
2471 "GEP is not of right type for indices!", &GEP, ElTy);
2473 if (GEP.getPointerOperandType()->isVectorTy()) {
2474 // Additional checks for vector GEPs.
2475 unsigned GepWidth = GEP.getPointerOperandType()->getVectorNumElements();
2476 Assert(GepWidth == GEP.getType()->getVectorNumElements(),
2477 "Vector GEP result width doesn't match operand's", &GEP);
2478 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
2479 Type *IndexTy = Idxs[i]->getType();
2480 Assert(IndexTy->isVectorTy(), "Vector GEP must have vector indices!",
2482 unsigned IndexWidth = IndexTy->getVectorNumElements();
2483 Assert(IndexWidth == GepWidth, "Invalid GEP index vector width", &GEP);
2486 visitInstruction(GEP);
2489 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
2490 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
2493 void Verifier::visitRangeMetadata(Instruction& I,
2494 MDNode* Range, Type* Ty) {
2496 Range == I.getMetadata(LLVMContext::MD_range) &&
2497 "precondition violation");
2499 unsigned NumOperands = Range->getNumOperands();
2500 Assert(NumOperands % 2 == 0, "Unfinished range!", Range);
2501 unsigned NumRanges = NumOperands / 2;
2502 Assert(NumRanges >= 1, "It should have at least one range!", Range);
2504 ConstantRange LastRange(1); // Dummy initial value
2505 for (unsigned i = 0; i < NumRanges; ++i) {
2507 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i));
2508 Assert(Low, "The lower limit must be an integer!", Low);
2510 mdconst::dyn_extract<ConstantInt>(Range->getOperand(2 * i + 1));
2511 Assert(High, "The upper limit must be an integer!", High);
2512 Assert(High->getType() == Low->getType() && High->getType() == Ty,
2513 "Range types must match instruction type!", &I);
2515 APInt HighV = High->getValue();
2516 APInt LowV = Low->getValue();
2517 ConstantRange CurRange(LowV, HighV);
2518 Assert(!CurRange.isEmptySet() && !CurRange.isFullSet(),
2519 "Range must not be empty!", Range);
2521 Assert(CurRange.intersectWith(LastRange).isEmptySet(),
2522 "Intervals are overlapping", Range);
2523 Assert(LowV.sgt(LastRange.getLower()), "Intervals are not in order",
2525 Assert(!isContiguous(CurRange, LastRange), "Intervals are contiguous",
2528 LastRange = ConstantRange(LowV, HighV);
2530 if (NumRanges > 2) {
2532 mdconst::dyn_extract<ConstantInt>(Range->getOperand(0))->getValue();
2534 mdconst::dyn_extract<ConstantInt>(Range->getOperand(1))->getValue();
2535 ConstantRange FirstRange(FirstLow, FirstHigh);
2536 Assert(FirstRange.intersectWith(LastRange).isEmptySet(),
2537 "Intervals are overlapping", Range);
2538 Assert(!isContiguous(FirstRange, LastRange), "Intervals are contiguous",
2543 void Verifier::visitLoadInst(LoadInst &LI) {
2544 PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
2545 Assert(PTy, "Load operand must be a pointer.", &LI);
2546 Type *ElTy = LI.getType();
2547 Assert(LI.getAlignment() <= Value::MaximumAlignment,
2548 "huge alignment values are unsupported", &LI);
2549 if (LI.isAtomic()) {
2550 Assert(LI.getOrdering() != Release && LI.getOrdering() != AcquireRelease,
2551 "Load cannot have Release ordering", &LI);
2552 Assert(LI.getAlignment() != 0,
2553 "Atomic load must specify explicit alignment", &LI);
2554 if (!ElTy->isPointerTy()) {
2555 Assert(ElTy->isIntegerTy(), "atomic load operand must have integer type!",
2557 unsigned Size = ElTy->getPrimitiveSizeInBits();
2558 Assert(Size >= 8 && !(Size & (Size - 1)),
2559 "atomic load operand must be power-of-two byte-sized integer", &LI,
2563 Assert(LI.getSynchScope() == CrossThread,
2564 "Non-atomic load cannot have SynchronizationScope specified", &LI);
2567 visitInstruction(LI);
2570 void Verifier::visitStoreInst(StoreInst &SI) {
2571 PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
2572 Assert(PTy, "Store operand must be a pointer.", &SI);
2573 Type *ElTy = PTy->getElementType();
2574 Assert(ElTy == SI.getOperand(0)->getType(),
2575 "Stored value type does not match pointer operand type!", &SI, ElTy);
2576 Assert(SI.getAlignment() <= Value::MaximumAlignment,
2577 "huge alignment values are unsupported", &SI);
2578 if (SI.isAtomic()) {
2579 Assert(SI.getOrdering() != Acquire && SI.getOrdering() != AcquireRelease,
2580 "Store cannot have Acquire ordering", &SI);
2581 Assert(SI.getAlignment() != 0,
2582 "Atomic store must specify explicit alignment", &SI);
2583 if (!ElTy->isPointerTy()) {
2584 Assert(ElTy->isIntegerTy(),
2585 "atomic store operand must have integer type!", &SI, ElTy);
2586 unsigned Size = ElTy->getPrimitiveSizeInBits();
2587 Assert(Size >= 8 && !(Size & (Size - 1)),
2588 "atomic store operand must be power-of-two byte-sized integer",
2592 Assert(SI.getSynchScope() == CrossThread,
2593 "Non-atomic store cannot have SynchronizationScope specified", &SI);
2595 visitInstruction(SI);
2598 void Verifier::visitAllocaInst(AllocaInst &AI) {
2599 SmallPtrSet<const Type*, 4> Visited;
2600 PointerType *PTy = AI.getType();
2601 Assert(PTy->getAddressSpace() == 0,
2602 "Allocation instruction pointer not in the generic address space!",
2604 Assert(PTy->getElementType()->isSized(&Visited),
2605 "Cannot allocate unsized type", &AI);
2606 Assert(AI.getArraySize()->getType()->isIntegerTy(),
2607 "Alloca array size must have integer type", &AI);
2608 Assert(AI.getAlignment() <= Value::MaximumAlignment,
2609 "huge alignment values are unsupported", &AI);
2611 visitInstruction(AI);
2614 void Verifier::visitAtomicCmpXchgInst(AtomicCmpXchgInst &CXI) {
2616 // FIXME: more conditions???
2617 Assert(CXI.getSuccessOrdering() != NotAtomic,
2618 "cmpxchg instructions must be atomic.", &CXI);
2619 Assert(CXI.getFailureOrdering() != NotAtomic,
2620 "cmpxchg instructions must be atomic.", &CXI);
2621 Assert(CXI.getSuccessOrdering() != Unordered,
2622 "cmpxchg instructions cannot be unordered.", &CXI);
2623 Assert(CXI.getFailureOrdering() != Unordered,
2624 "cmpxchg instructions cannot be unordered.", &CXI);
2625 Assert(CXI.getSuccessOrdering() >= CXI.getFailureOrdering(),
2626 "cmpxchg instructions be at least as constrained on success as fail",
2628 Assert(CXI.getFailureOrdering() != Release &&
2629 CXI.getFailureOrdering() != AcquireRelease,
2630 "cmpxchg failure ordering cannot include release semantics", &CXI);
2632 PointerType *PTy = dyn_cast<PointerType>(CXI.getOperand(0)->getType());
2633 Assert(PTy, "First cmpxchg operand must be a pointer.", &CXI);
2634 Type *ElTy = PTy->getElementType();
2635 Assert(ElTy->isIntegerTy(), "cmpxchg operand must have integer type!", &CXI,
2637 unsigned Size = ElTy->getPrimitiveSizeInBits();
2638 Assert(Size >= 8 && !(Size & (Size - 1)),
2639 "cmpxchg operand must be power-of-two byte-sized integer", &CXI, ElTy);
2640 Assert(ElTy == CXI.getOperand(1)->getType(),
2641 "Expected value type does not match pointer operand type!", &CXI,
2643 Assert(ElTy == CXI.getOperand(2)->getType(),
2644 "Stored value type does not match pointer operand type!", &CXI, ElTy);
2645 visitInstruction(CXI);
2648 void Verifier::visitAtomicRMWInst(AtomicRMWInst &RMWI) {
2649 Assert(RMWI.getOrdering() != NotAtomic,
2650 "atomicrmw instructions must be atomic.", &RMWI);
2651 Assert(RMWI.getOrdering() != Unordered,
2652 "atomicrmw instructions cannot be unordered.", &RMWI);
2653 PointerType *PTy = dyn_cast<PointerType>(RMWI.getOperand(0)->getType());
2654 Assert(PTy, "First atomicrmw operand must be a pointer.", &RMWI);
2655 Type *ElTy = PTy->getElementType();
2656 Assert(ElTy->isIntegerTy(), "atomicrmw operand must have integer type!",
2658 unsigned Size = ElTy->getPrimitiveSizeInBits();
2659 Assert(Size >= 8 && !(Size & (Size - 1)),
2660 "atomicrmw operand must be power-of-two byte-sized integer", &RMWI,
2662 Assert(ElTy == RMWI.getOperand(1)->getType(),
2663 "Argument value type does not match pointer operand type!", &RMWI,
2665 Assert(AtomicRMWInst::FIRST_BINOP <= RMWI.getOperation() &&
2666 RMWI.getOperation() <= AtomicRMWInst::LAST_BINOP,
2667 "Invalid binary operation!", &RMWI);
2668 visitInstruction(RMWI);
2671 void Verifier::visitFenceInst(FenceInst &FI) {
2672 const AtomicOrdering Ordering = FI.getOrdering();
2673 Assert(Ordering == Acquire || Ordering == Release ||
2674 Ordering == AcquireRelease || Ordering == SequentiallyConsistent,
2675 "fence instructions may only have "
2676 "acquire, release, acq_rel, or seq_cst ordering.",
2678 visitInstruction(FI);
2681 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
2682 Assert(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
2683 EVI.getIndices()) == EVI.getType(),
2684 "Invalid ExtractValueInst operands!", &EVI);
2686 visitInstruction(EVI);
2689 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
2690 Assert(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
2691 IVI.getIndices()) ==
2692 IVI.getOperand(1)->getType(),
2693 "Invalid InsertValueInst operands!", &IVI);
2695 visitInstruction(IVI);
2698 void Verifier::visitLandingPadInst(LandingPadInst &LPI) {
2699 BasicBlock *BB = LPI.getParent();
2701 // The landingpad instruction is ill-formed if it doesn't have any clauses and
2703 Assert(LPI.getNumClauses() > 0 || LPI.isCleanup(),
2704 "LandingPadInst needs at least one clause or to be a cleanup.", &LPI);
2706 // The landingpad instruction defines its parent as a landing pad block. The
2707 // landing pad block may be branched to only by the unwind edge of an invoke.
2708 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
2709 const InvokeInst *II = dyn_cast<InvokeInst>((*I)->getTerminator());
2710 Assert(II && II->getUnwindDest() == BB && II->getNormalDest() != BB,
2711 "Block containing LandingPadInst must be jumped to "
2712 "only by the unwind edge of an invoke.",
2716 // The landingpad instruction must be the first non-PHI instruction in the
2718 Assert(LPI.getParent()->getLandingPadInst() == &LPI,
2719 "LandingPadInst not the first non-PHI instruction in the block.",
2722 // The personality functions for all landingpad instructions within the same
2723 // function should match.
2725 Assert(LPI.getPersonalityFn() == PersonalityFn,
2726 "Personality function doesn't match others in function", &LPI);
2727 PersonalityFn = LPI.getPersonalityFn();
2729 // All operands must be constants.
2730 Assert(isa<Constant>(PersonalityFn), "Personality function is not constant!",
2732 for (unsigned i = 0, e = LPI.getNumClauses(); i < e; ++i) {
2733 Constant *Clause = LPI.getClause(i);
2734 if (LPI.isCatch(i)) {
2735 Assert(isa<PointerType>(Clause->getType()),
2736 "Catch operand does not have pointer type!", &LPI);
2738 Assert(LPI.isFilter(i), "Clause is neither catch nor filter!", &LPI);
2739 Assert(isa<ConstantArray>(Clause) || isa<ConstantAggregateZero>(Clause),
2740 "Filter operand is not an array of constants!", &LPI);
2744 visitInstruction(LPI);
2747 void Verifier::verifyDominatesUse(Instruction &I, unsigned i) {
2748 Instruction *Op = cast<Instruction>(I.getOperand(i));
2749 // If the we have an invalid invoke, don't try to compute the dominance.
2750 // We already reject it in the invoke specific checks and the dominance
2751 // computation doesn't handle multiple edges.
2752 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
2753 if (II->getNormalDest() == II->getUnwindDest())
2757 const Use &U = I.getOperandUse(i);
2758 Assert(InstsInThisBlock.count(Op) || DT.dominates(Op, U),
2759 "Instruction does not dominate all uses!", Op, &I);
2762 /// verifyInstruction - Verify that an instruction is well formed.
2764 void Verifier::visitInstruction(Instruction &I) {
2765 BasicBlock *BB = I.getParent();
2766 Assert(BB, "Instruction not embedded in basic block!", &I);
2768 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
2769 for (User *U : I.users()) {
2770 Assert(U != (User *)&I || !DT.isReachableFromEntry(BB),
2771 "Only PHI nodes may reference their own value!", &I);
2775 // Check that void typed values don't have names
2776 Assert(!I.getType()->isVoidTy() || !I.hasName(),
2777 "Instruction has a name, but provides a void value!", &I);
2779 // Check that the return value of the instruction is either void or a legal
2781 Assert(I.getType()->isVoidTy() || I.getType()->isFirstClassType(),
2782 "Instruction returns a non-scalar type!", &I);
2784 // Check that the instruction doesn't produce metadata. Calls are already
2785 // checked against the callee type.
2786 Assert(!I.getType()->isMetadataTy() || isa<CallInst>(I) || isa<InvokeInst>(I),
2787 "Invalid use of metadata!", &I);
2789 // Check that all uses of the instruction, if they are instructions
2790 // themselves, actually have parent basic blocks. If the use is not an
2791 // instruction, it is an error!
2792 for (Use &U : I.uses()) {
2793 if (Instruction *Used = dyn_cast<Instruction>(U.getUser()))
2794 Assert(Used->getParent() != nullptr,
2795 "Instruction referencing"
2796 " instruction not embedded in a basic block!",
2799 CheckFailed("Use of instruction is not an instruction!", U);
2804 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
2805 Assert(I.getOperand(i) != nullptr, "Instruction has null operand!", &I);
2807 // Check to make sure that only first-class-values are operands to
2809 if (!I.getOperand(i)->getType()->isFirstClassType()) {
2810 Assert(0, "Instruction operands must be first-class values!", &I);
2813 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
2814 // Check to make sure that the "address of" an intrinsic function is never
2817 !F->isIntrinsic() ||
2818 i == (isa<CallInst>(I) ? e - 1 : isa<InvokeInst>(I) ? e - 3 : 0),
2819 "Cannot take the address of an intrinsic!", &I);
2821 !F->isIntrinsic() || isa<CallInst>(I) ||
2822 F->getIntrinsicID() == Intrinsic::donothing ||
2823 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_void ||
2824 F->getIntrinsicID() == Intrinsic::experimental_patchpoint_i64 ||
2825 F->getIntrinsicID() == Intrinsic::experimental_gc_statepoint,
2826 "Cannot invoke an intrinsinc other than"
2827 " donothing or patchpoint",
2829 Assert(F->getParent() == M, "Referencing function in another module!",
2831 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
2832 Assert(OpBB->getParent() == BB->getParent(),
2833 "Referring to a basic block in another function!", &I);
2834 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
2835 Assert(OpArg->getParent() == BB->getParent(),
2836 "Referring to an argument in another function!", &I);
2837 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
2838 Assert(GV->getParent() == M, "Referencing global in another module!", &I);
2839 } else if (isa<Instruction>(I.getOperand(i))) {
2840 verifyDominatesUse(I, i);
2841 } else if (isa<InlineAsm>(I.getOperand(i))) {
2842 Assert((i + 1 == e && isa<CallInst>(I)) ||
2843 (i + 3 == e && isa<InvokeInst>(I)),
2844 "Cannot take the address of an inline asm!", &I);
2845 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i))) {
2846 if (CE->getType()->isPtrOrPtrVectorTy()) {
2847 // If we have a ConstantExpr pointer, we need to see if it came from an
2848 // illegal bitcast (inttoptr <constant int> )
2849 SmallVector<const ConstantExpr *, 4> Stack;
2850 SmallPtrSet<const ConstantExpr *, 4> Visited;
2851 Stack.push_back(CE);
2853 while (!Stack.empty()) {
2854 const ConstantExpr *V = Stack.pop_back_val();
2855 if (!Visited.insert(V).second)
2858 VerifyConstantExprBitcastType(V);
2860 for (unsigned I = 0, N = V->getNumOperands(); I != N; ++I) {
2861 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(V->getOperand(I)))
2862 Stack.push_back(Op);
2869 if (MDNode *MD = I.getMetadata(LLVMContext::MD_fpmath)) {
2870 Assert(I.getType()->isFPOrFPVectorTy(),
2871 "fpmath requires a floating point result!", &I);
2872 Assert(MD->getNumOperands() == 1, "fpmath takes one operand!", &I);
2873 if (ConstantFP *CFP0 =
2874 mdconst::dyn_extract_or_null<ConstantFP>(MD->getOperand(0))) {
2875 APFloat Accuracy = CFP0->getValueAPF();
2876 Assert(Accuracy.isFiniteNonZero() && !Accuracy.isNegative(),
2877 "fpmath accuracy not a positive number!", &I);
2879 Assert(false, "invalid fpmath accuracy!", &I);
2883 if (MDNode *Range = I.getMetadata(LLVMContext::MD_range)) {
2884 Assert(isa<LoadInst>(I) || isa<CallInst>(I) || isa<InvokeInst>(I),
2885 "Ranges are only for loads, calls and invokes!", &I);
2886 visitRangeMetadata(I, Range, I.getType());
2889 if (I.getMetadata(LLVMContext::MD_nonnull)) {
2890 Assert(I.getType()->isPointerTy(), "nonnull applies only to pointer types",
2892 Assert(isa<LoadInst>(I),
2893 "nonnull applies only to load instructions, use attributes"
2894 " for calls or invokes",
2898 if (MDNode *N = I.getDebugLoc().getAsMDNode()) {
2899 Assert(isa<MDLocation>(N), "invalid !dbg metadata attachment", &I, N);
2903 InstsInThisBlock.insert(&I);
2906 /// VerifyIntrinsicType - Verify that the specified type (which comes from an
2907 /// intrinsic argument or return value) matches the type constraints specified
2908 /// by the .td file (e.g. an "any integer" argument really is an integer).
2910 /// This return true on error but does not print a message.
2911 bool Verifier::VerifyIntrinsicType(Type *Ty,
2912 ArrayRef<Intrinsic::IITDescriptor> &Infos,
2913 SmallVectorImpl<Type*> &ArgTys) {
2914 using namespace Intrinsic;
2916 // If we ran out of descriptors, there are too many arguments.
2917 if (Infos.empty()) return true;
2918 IITDescriptor D = Infos.front();
2919 Infos = Infos.slice(1);
2922 case IITDescriptor::Void: return !Ty->isVoidTy();
2923 case IITDescriptor::VarArg: return true;
2924 case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
2925 case IITDescriptor::Metadata: return !Ty->isMetadataTy();
2926 case IITDescriptor::Half: return !Ty->isHalfTy();
2927 case IITDescriptor::Float: return !Ty->isFloatTy();
2928 case IITDescriptor::Double: return !Ty->isDoubleTy();
2929 case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
2930 case IITDescriptor::Vector: {
2931 VectorType *VT = dyn_cast<VectorType>(Ty);
2932 return !VT || VT->getNumElements() != D.Vector_Width ||
2933 VerifyIntrinsicType(VT->getElementType(), Infos, ArgTys);
2935 case IITDescriptor::Pointer: {
2936 PointerType *PT = dyn_cast<PointerType>(Ty);
2937 return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
2938 VerifyIntrinsicType(PT->getElementType(), Infos, ArgTys);
2941 case IITDescriptor::Struct: {
2942 StructType *ST = dyn_cast<StructType>(Ty);
2943 if (!ST || ST->getNumElements() != D.Struct_NumElements)
2946 for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
2947 if (VerifyIntrinsicType(ST->getElementType(i), Infos, ArgTys))
2952 case IITDescriptor::Argument:
2953 // Two cases here - If this is the second occurrence of an argument, verify
2954 // that the later instance matches the previous instance.
2955 if (D.getArgumentNumber() < ArgTys.size())
2956 return Ty != ArgTys[D.getArgumentNumber()];
2958 // Otherwise, if this is the first instance of an argument, record it and
2959 // verify the "Any" kind.
2960 assert(D.getArgumentNumber() == ArgTys.size() && "Table consistency error");
2961 ArgTys.push_back(Ty);
2963 switch (D.getArgumentKind()) {
2964 case IITDescriptor::AK_Any: return false; // Success
2965 case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
2966 case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
2967 case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
2968 case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
2970 llvm_unreachable("all argument kinds not covered");
2972 case IITDescriptor::ExtendArgument: {
2973 // This may only be used when referring to a previous vector argument.
2974 if (D.getArgumentNumber() >= ArgTys.size())
2977 Type *NewTy = ArgTys[D.getArgumentNumber()];
2978 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2979 NewTy = VectorType::getExtendedElementVectorType(VTy);
2980 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2981 NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
2987 case IITDescriptor::TruncArgument: {
2988 // This may only be used when referring to a previous vector argument.
2989 if (D.getArgumentNumber() >= ArgTys.size())
2992 Type *NewTy = ArgTys[D.getArgumentNumber()];
2993 if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
2994 NewTy = VectorType::getTruncatedElementVectorType(VTy);
2995 else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
2996 NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
3002 case IITDescriptor::HalfVecArgument:
3003 // This may only be used when referring to a previous vector argument.
3004 return D.getArgumentNumber() >= ArgTys.size() ||
3005 !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
3006 VectorType::getHalfElementsVectorType(
3007 cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
3008 case IITDescriptor::SameVecWidthArgument: {
3009 if (D.getArgumentNumber() >= ArgTys.size())
3011 VectorType * ReferenceType =
3012 dyn_cast<VectorType>(ArgTys[D.getArgumentNumber()]);
3013 VectorType *ThisArgType = dyn_cast<VectorType>(Ty);
3014 if (!ThisArgType || !ReferenceType ||
3015 (ReferenceType->getVectorNumElements() !=
3016 ThisArgType->getVectorNumElements()))
3018 return VerifyIntrinsicType(ThisArgType->getVectorElementType(),
3021 case IITDescriptor::PtrToArgument: {
3022 if (D.getArgumentNumber() >= ArgTys.size())
3024 Type * ReferenceType = ArgTys[D.getArgumentNumber()];
3025 PointerType *ThisArgType = dyn_cast<PointerType>(Ty);
3026 return (!ThisArgType || ThisArgType->getElementType() != ReferenceType);
3028 case IITDescriptor::VecOfPtrsToElt: {
3029 if (D.getArgumentNumber() >= ArgTys.size())
3031 VectorType * ReferenceType =
3032 dyn_cast<VectorType> (ArgTys[D.getArgumentNumber()]);
3033 VectorType *ThisArgVecTy = dyn_cast<VectorType>(Ty);
3034 if (!ThisArgVecTy || !ReferenceType ||
3035 (ReferenceType->getVectorNumElements() !=
3036 ThisArgVecTy->getVectorNumElements()))
3038 PointerType *ThisArgEltTy =
3039 dyn_cast<PointerType>(ThisArgVecTy->getVectorElementType());
3042 return (!(ThisArgEltTy->getElementType() ==
3043 ReferenceType->getVectorElementType()));
3046 llvm_unreachable("unhandled");
3049 /// \brief Verify if the intrinsic has variable arguments.
3050 /// This method is intended to be called after all the fixed arguments have been
3053 /// This method returns true on error and does not print an error message.
3055 Verifier::VerifyIntrinsicIsVarArg(bool isVarArg,
3056 ArrayRef<Intrinsic::IITDescriptor> &Infos) {
3057 using namespace Intrinsic;
3059 // If there are no descriptors left, then it can't be a vararg.
3063 // There should be only one descriptor remaining at this point.
3064 if (Infos.size() != 1)
3067 // Check and verify the descriptor.
3068 IITDescriptor D = Infos.front();
3069 Infos = Infos.slice(1);
3070 if (D.Kind == IITDescriptor::VarArg)
3076 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
3078 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
3079 Function *IF = CI.getCalledFunction();
3080 Assert(IF->isDeclaration(), "Intrinsic functions should never be defined!",
3083 // Verify that the intrinsic prototype lines up with what the .td files
3085 FunctionType *IFTy = IF->getFunctionType();
3086 bool IsVarArg = IFTy->isVarArg();
3088 SmallVector<Intrinsic::IITDescriptor, 8> Table;
3089 getIntrinsicInfoTableEntries(ID, Table);
3090 ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
3092 SmallVector<Type *, 4> ArgTys;
3093 Assert(!VerifyIntrinsicType(IFTy->getReturnType(), TableRef, ArgTys),
3094 "Intrinsic has incorrect return type!", IF);
3095 for (unsigned i = 0, e = IFTy->getNumParams(); i != e; ++i)
3096 Assert(!VerifyIntrinsicType(IFTy->getParamType(i), TableRef, ArgTys),
3097 "Intrinsic has incorrect argument type!", IF);
3099 // Verify if the intrinsic call matches the vararg property.
3101 Assert(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
3102 "Intrinsic was not defined with variable arguments!", IF);
3104 Assert(!VerifyIntrinsicIsVarArg(IsVarArg, TableRef),
3105 "Callsite was not defined with variable arguments!", IF);
3107 // All descriptors should be absorbed by now.
3108 Assert(TableRef.empty(), "Intrinsic has too few arguments!", IF);
3110 // Now that we have the intrinsic ID and the actual argument types (and we
3111 // know they are legal for the intrinsic!) get the intrinsic name through the
3112 // usual means. This allows us to verify the mangling of argument types into
3114 const std::string ExpectedName = Intrinsic::getName(ID, ArgTys);
3115 Assert(ExpectedName == IF->getName(),
3116 "Intrinsic name not mangled correctly for type arguments! "
3121 // If the intrinsic takes MDNode arguments, verify that they are either global
3122 // or are local to *this* function.
3123 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
3124 if (auto *MD = dyn_cast<MetadataAsValue>(CI.getArgOperand(i)))
3125 visitMetadataAsValue(*MD, CI.getParent()->getParent());
3130 case Intrinsic::ctlz: // llvm.ctlz
3131 case Intrinsic::cttz: // llvm.cttz
3132 Assert(isa<ConstantInt>(CI.getArgOperand(1)),
3133 "is_zero_undef argument of bit counting intrinsics must be a "
3137 case Intrinsic::dbg_declare: // llvm.dbg.declare
3138 Assert(isa<MetadataAsValue>(CI.getArgOperand(0)),
3139 "invalid llvm.dbg.declare intrinsic call 1", &CI);
3140 visitDbgIntrinsic("declare", cast<DbgDeclareInst>(CI));
3142 case Intrinsic::dbg_value: // llvm.dbg.value
3143 visitDbgIntrinsic("value", cast<DbgValueInst>(CI));
3145 case Intrinsic::memcpy:
3146 case Intrinsic::memmove:
3147 case Intrinsic::memset: {
3148 ConstantInt *AlignCI = dyn_cast<ConstantInt>(CI.getArgOperand(3));
3150 "alignment argument of memory intrinsics must be a constant int",
3152 const APInt &AlignVal = AlignCI->getValue();
3153 Assert(AlignCI->isZero() || AlignVal.isPowerOf2(),
3154 "alignment argument of memory intrinsics must be a power of 2", &CI);
3155 Assert(isa<ConstantInt>(CI.getArgOperand(4)),
3156 "isvolatile argument of memory intrinsics must be a constant int",
3160 case Intrinsic::gcroot:
3161 case Intrinsic::gcwrite:
3162 case Intrinsic::gcread:
3163 if (ID == Intrinsic::gcroot) {
3165 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
3166 Assert(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
3167 Assert(isa<Constant>(CI.getArgOperand(1)),
3168 "llvm.gcroot parameter #2 must be a constant.", &CI);
3169 if (!AI->getType()->getElementType()->isPointerTy()) {
3170 Assert(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
3171 "llvm.gcroot parameter #1 must either be a pointer alloca, "
3172 "or argument #2 must be a non-null constant.",
3177 Assert(CI.getParent()->getParent()->hasGC(),
3178 "Enclosing function does not use GC.", &CI);
3180 case Intrinsic::init_trampoline:
3181 Assert(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
3182 "llvm.init_trampoline parameter #2 must resolve to a function.",
3185 case Intrinsic::prefetch:
3186 Assert(isa<ConstantInt>(CI.getArgOperand(1)) &&
3187 isa<ConstantInt>(CI.getArgOperand(2)) &&
3188 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
3189 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
3190 "invalid arguments to llvm.prefetch", &CI);
3192 case Intrinsic::stackprotector:
3193 Assert(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
3194 "llvm.stackprotector parameter #2 must resolve to an alloca.", &CI);
3196 case Intrinsic::lifetime_start:
3197 case Intrinsic::lifetime_end:
3198 case Intrinsic::invariant_start:
3199 Assert(isa<ConstantInt>(CI.getArgOperand(0)),
3200 "size argument of memory use markers must be a constant integer",
3203 case Intrinsic::invariant_end:
3204 Assert(isa<ConstantInt>(CI.getArgOperand(1)),
3205 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
3208 case Intrinsic::frameescape: {
3209 BasicBlock *BB = CI.getParent();
3210 Assert(BB == &BB->getParent()->front(),
3211 "llvm.frameescape used outside of entry block", &CI);
3212 Assert(!SawFrameEscape,
3213 "multiple calls to llvm.frameescape in one function", &CI);
3214 for (Value *Arg : CI.arg_operands()) {
3215 if (isa<ConstantPointerNull>(Arg))
3216 continue; // Null values are allowed as placeholders.
3217 auto *AI = dyn_cast<AllocaInst>(Arg->stripPointerCasts());
3218 Assert(AI && AI->isStaticAlloca(),
3219 "llvm.frameescape only accepts static allocas", &CI);
3221 FrameEscapeInfo[BB->getParent()].first = CI.getNumArgOperands();
3222 SawFrameEscape = true;
3225 case Intrinsic::framerecover: {
3226 Value *FnArg = CI.getArgOperand(0)->stripPointerCasts();
3227 Function *Fn = dyn_cast<Function>(FnArg);
3228 Assert(Fn && !Fn->isDeclaration(),
3229 "llvm.framerecover first "
3230 "argument must be function defined in this module",
3232 auto *IdxArg = dyn_cast<ConstantInt>(CI.getArgOperand(2));
3233 Assert(IdxArg, "idx argument of llvm.framerecover must be a constant int",
3235 auto &Entry = FrameEscapeInfo[Fn];
3236 Entry.second = unsigned(
3237 std::max(uint64_t(Entry.second), IdxArg->getLimitedValue(~0U) + 1));
3241 case Intrinsic::experimental_gc_statepoint:
3242 Assert(!CI.isInlineAsm(),
3243 "gc.statepoint support for inline assembly unimplemented", &CI);
3244 Assert(CI.getParent()->getParent()->hasGC(),
3245 "Enclosing function does not use GC.", &CI);
3247 VerifyStatepoint(ImmutableCallSite(&CI));
3249 case Intrinsic::experimental_gc_result_int:
3250 case Intrinsic::experimental_gc_result_float:
3251 case Intrinsic::experimental_gc_result_ptr:
3252 case Intrinsic::experimental_gc_result: {
3253 Assert(CI.getParent()->getParent()->hasGC(),
3254 "Enclosing function does not use GC.", &CI);
3255 // Are we tied to a statepoint properly?
3256 CallSite StatepointCS(CI.getArgOperand(0));
3257 const Function *StatepointFn =
3258 StatepointCS.getInstruction() ? StatepointCS.getCalledFunction() : nullptr;
3259 Assert(StatepointFn && StatepointFn->isDeclaration() &&
3260 StatepointFn->getIntrinsicID() ==
3261 Intrinsic::experimental_gc_statepoint,
3262 "gc.result operand #1 must be from a statepoint", &CI,
3263 CI.getArgOperand(0));
3265 // Assert that result type matches wrapped callee.
3266 const Value *Target = StatepointCS.getArgument(0);
3267 const PointerType *PT = cast<PointerType>(Target->getType());
3268 const FunctionType *TargetFuncType =
3269 cast<FunctionType>(PT->getElementType());
3270 Assert(CI.getType() == TargetFuncType->getReturnType(),
3271 "gc.result result type does not match wrapped callee", &CI);
3274 case Intrinsic::experimental_gc_relocate: {
3275 Assert(CI.getNumArgOperands() == 3, "wrong number of arguments", &CI);
3277 // Check that this relocate is correctly tied to the statepoint
3279 // This is case for relocate on the unwinding path of an invoke statepoint
3280 if (ExtractValueInst *ExtractValue =
3281 dyn_cast<ExtractValueInst>(CI.getArgOperand(0))) {
3282 Assert(isa<LandingPadInst>(ExtractValue->getAggregateOperand()),
3283 "gc relocate on unwind path incorrectly linked to the statepoint",
3286 const BasicBlock *invokeBB =
3287 ExtractValue->getParent()->getUniquePredecessor();
3289 // Landingpad relocates should have only one predecessor with invoke
3290 // statepoint terminator
3291 Assert(invokeBB, "safepoints should have unique landingpads",
3292 ExtractValue->getParent());
3293 Assert(invokeBB->getTerminator(), "safepoint block should be well formed",
3295 Assert(isStatepoint(invokeBB->getTerminator()),
3296 "gc relocate should be linked to a statepoint", invokeBB);
3299 // In all other cases relocate should be tied to the statepoint directly.
3300 // This covers relocates on a normal return path of invoke statepoint and
3301 // relocates of a call statepoint
3302 auto Token = CI.getArgOperand(0);
3303 Assert(isa<Instruction>(Token) && isStatepoint(cast<Instruction>(Token)),
3304 "gc relocate is incorrectly tied to the statepoint", &CI, Token);
3307 // Verify rest of the relocate arguments
3309 GCRelocateOperands ops(&CI);
3310 ImmutableCallSite StatepointCS(ops.statepoint());
3312 // Both the base and derived must be piped through the safepoint
3313 Value* Base = CI.getArgOperand(1);
3314 Assert(isa<ConstantInt>(Base),
3315 "gc.relocate operand #2 must be integer offset", &CI);
3317 Value* Derived = CI.getArgOperand(2);
3318 Assert(isa<ConstantInt>(Derived),
3319 "gc.relocate operand #3 must be integer offset", &CI);
3321 const int BaseIndex = cast<ConstantInt>(Base)->getZExtValue();
3322 const int DerivedIndex = cast<ConstantInt>(Derived)->getZExtValue();
3324 Assert(0 <= BaseIndex && BaseIndex < (int)StatepointCS.arg_size(),
3325 "gc.relocate: statepoint base index out of bounds", &CI);
3326 Assert(0 <= DerivedIndex && DerivedIndex < (int)StatepointCS.arg_size(),
3327 "gc.relocate: statepoint derived index out of bounds", &CI);
3329 // Check that BaseIndex and DerivedIndex fall within the 'gc parameters'
3330 // section of the statepoint's argument
3331 Assert(StatepointCS.arg_size() > 0,
3332 "gc.statepoint: insufficient arguments");
3333 Assert(isa<ConstantInt>(StatepointCS.getArgument(1)),
3334 "gc.statement: number of call arguments must be constant integer");
3335 const unsigned NumCallArgs =
3336 cast<ConstantInt>(StatepointCS.getArgument(1))->getZExtValue();
3337 Assert(StatepointCS.arg_size() > NumCallArgs+3,
3338 "gc.statepoint: mismatch in number of call arguments");
3339 Assert(isa<ConstantInt>(StatepointCS.getArgument(NumCallArgs+3)),
3340 "gc.statepoint: number of deoptimization arguments must be "
3341 "a constant integer");
3342 const int NumDeoptArgs =
3343 cast<ConstantInt>(StatepointCS.getArgument(NumCallArgs + 3))->getZExtValue();
3344 const int GCParamArgsStart = NumCallArgs + NumDeoptArgs + 4;
3345 const int GCParamArgsEnd = StatepointCS.arg_size();
3346 Assert(GCParamArgsStart <= BaseIndex && BaseIndex < GCParamArgsEnd,
3347 "gc.relocate: statepoint base index doesn't fall within the "
3348 "'gc parameters' section of the statepoint call",
3350 Assert(GCParamArgsStart <= DerivedIndex && DerivedIndex < GCParamArgsEnd,
3351 "gc.relocate: statepoint derived index doesn't fall within the "
3352 "'gc parameters' section of the statepoint call",
3355 // Assert that the result type matches the type of the relocated pointer
3356 GCRelocateOperands Operands(&CI);
3357 Assert(Operands.derivedPtr()->getType() == CI.getType(),
3358 "gc.relocate: relocating a pointer shouldn't change its type", &CI);
3364 template <class DbgIntrinsicTy>
3365 void Verifier::visitDbgIntrinsic(StringRef Kind, DbgIntrinsicTy &DII) {
3366 auto *MD = cast<MetadataAsValue>(DII.getArgOperand(0))->getMetadata();
3367 Assert(isa<ValueAsMetadata>(MD) ||
3368 (isa<MDNode>(MD) && !cast<MDNode>(MD)->getNumOperands()),
3369 "invalid llvm.dbg." + Kind + " intrinsic address/value", &DII, MD);
3370 Assert(isa<MDLocalVariable>(DII.getRawVariable()),
3371 "invalid llvm.dbg." + Kind + " intrinsic variable", &DII,
3372 DII.getRawVariable());
3373 Assert(isa<MDExpression>(DII.getRawExpression()),
3374 "invalid llvm.dbg." + Kind + " intrinsic expression", &DII,
3375 DII.getRawExpression());
3377 // Ignore broken !dbg attachments; they're checked elsewhere.
3378 if (MDNode *N = DII.getDebugLoc().getAsMDNode())
3379 if (!isa<MDLocation>(N))
3382 // The inlined-at attachments for variables and !dbg attachments must agree.
3383 MDLocalVariable *Var = DII.getVariable();
3384 MDLocation *VarIA = Var->getInlinedAt();
3385 MDLocation *Loc = DII.getDebugLoc();
3386 MDLocation *LocIA = Loc ? Loc->getInlinedAt() : nullptr;
3387 BasicBlock *BB = DII.getParent();
3388 Assert(VarIA == LocIA, "mismatched variable and !dbg inlined-at", &DII, BB,
3389 BB ? BB->getParent() : nullptr, Var, VarIA, Loc, LocIA);
3392 template <class MapTy>
3393 static uint64_t getVariableSize(const MDLocalVariable &V, const MapTy &Map) {
3394 // Be careful of broken types (checked elsewhere).
3395 const Metadata *RawType = V.getRawType();
3397 // Try to get the size directly.
3398 if (auto *T = dyn_cast<MDType>(RawType))
3399 if (uint64_t Size = T->getSizeInBits())
3402 if (auto *DT = dyn_cast<MDDerivedType>(RawType)) {
3403 // Look at the base type.
3404 RawType = DT->getRawBaseType();
3408 if (auto *S = dyn_cast<MDString>(RawType)) {
3409 // Don't error on missing types (checked elsewhere).
3410 RawType = Map.lookup(S);
3414 // Missing type or size.
3422 template <class MapTy>
3423 void Verifier::verifyBitPieceExpression(const DbgInfoIntrinsic &I,
3424 const MapTy &TypeRefs) {
3427 if (auto *DVI = dyn_cast<DbgValueInst>(&I)) {
3428 V = dyn_cast_or_null<MDLocalVariable>(DVI->getRawVariable());
3429 E = dyn_cast_or_null<MDExpression>(DVI->getRawExpression());
3431 auto *DDI = cast<DbgDeclareInst>(&I);
3432 V = dyn_cast_or_null<MDLocalVariable>(DDI->getRawVariable());
3433 E = dyn_cast_or_null<MDExpression>(DDI->getRawExpression());
3436 // We don't know whether this intrinsic verified correctly.
3437 if (!V || !E || !E->isValid())
3440 // Nothing to do if this isn't a bit piece expression.
3441 if (!E->isBitPiece())
3444 // If there's no size, the type is broken, but that should be checked
3446 uint64_t VarSize = getVariableSize(*V, TypeRefs);
3450 unsigned PieceSize = E->getBitPieceSize();
3451 unsigned PieceOffset = E->getBitPieceOffset();
3452 Assert(PieceSize + PieceOffset <= VarSize,
3453 "piece is larger than or outside of variable", &I, V, E);
3454 Assert(PieceSize != VarSize, "piece covers entire variable", &I, V, E);
3457 void Verifier::visitUnresolvedTypeRef(const MDString *S, const MDNode *N) {
3458 // This is in its own function so we get an error for each bad type ref (not
3460 Assert(false, "unresolved type ref", S, N);
3463 void Verifier::verifyTypeRefs() {
3464 auto *CUs = M->getNamedMetadata("llvm.dbg.cu");
3468 // Visit all the compile units again to map the type references.
3469 SmallDenseMap<const MDString *, const MDType *, 32> TypeRefs;
3470 for (auto *CU : CUs->operands())
3471 if (auto Ts = cast<MDCompileUnit>(CU)->getRetainedTypes())
3472 for (MDType *Op : Ts)
3473 if (auto *T = dyn_cast<MDCompositeType>(Op))
3474 if (auto *S = T->getRawIdentifier()) {
3475 UnresolvedTypeRefs.erase(S);
3476 TypeRefs.insert(std::make_pair(S, T));
3479 // Verify debug info intrinsic bit piece expressions. This needs a second
3480 // pass through the intructions, since we haven't built TypeRefs yet when
3481 // verifying functions, and simply queuing the DbgInfoIntrinsics to evaluate
3482 // later/now would queue up some that could be later deleted.
3483 for (const Function &F : *M)
3484 for (const BasicBlock &BB : F)
3485 for (const Instruction &I : BB)
3486 if (auto *DII = dyn_cast<DbgInfoIntrinsic>(&I))
3487 verifyBitPieceExpression(*DII, TypeRefs);
3489 // Return early if all typerefs were resolved.
3490 if (UnresolvedTypeRefs.empty())
3493 // Sort the unresolved references by name so the output is deterministic.
3494 typedef std::pair<const MDString *, const MDNode *> TypeRef;
3495 SmallVector<TypeRef, 32> Unresolved(UnresolvedTypeRefs.begin(),
3496 UnresolvedTypeRefs.end());
3497 std::sort(Unresolved.begin(), Unresolved.end(),
3498 [](const TypeRef &LHS, const TypeRef &RHS) {
3499 return LHS.first->getString() < RHS.first->getString();
3502 // Visit the unresolved refs (printing out the errors).
3503 for (const TypeRef &TR : Unresolved)
3504 visitUnresolvedTypeRef(TR.first, TR.second);
3507 //===----------------------------------------------------------------------===//
3508 // Implement the public interfaces to this file...
3509 //===----------------------------------------------------------------------===//
3511 bool llvm::verifyFunction(const Function &f, raw_ostream *OS) {
3512 Function &F = const_cast<Function &>(f);
3513 assert(!F.isDeclaration() && "Cannot verify external functions");
3515 raw_null_ostream NullStr;
3516 Verifier V(OS ? *OS : NullStr);
3518 // Note that this function's return value is inverted from what you would
3519 // expect of a function called "verify".
3520 return !V.verify(F);
3523 bool llvm::verifyModule(const Module &M, raw_ostream *OS) {
3524 raw_null_ostream NullStr;
3525 Verifier V(OS ? *OS : NullStr);
3527 bool Broken = false;
3528 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
3529 if (!I->isDeclaration() && !I->isMaterializable())
3530 Broken |= !V.verify(*I);
3532 // Note that this function's return value is inverted from what you would
3533 // expect of a function called "verify".
3534 return !V.verify(M) || Broken;
3538 struct VerifierLegacyPass : public FunctionPass {
3544 VerifierLegacyPass() : FunctionPass(ID), V(dbgs()), FatalErrors(true) {
3545 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3547 explicit VerifierLegacyPass(bool FatalErrors)
3548 : FunctionPass(ID), V(dbgs()), FatalErrors(FatalErrors) {
3549 initializeVerifierLegacyPassPass(*PassRegistry::getPassRegistry());
3552 bool runOnFunction(Function &F) override {
3553 if (!V.verify(F) && FatalErrors)
3554 report_fatal_error("Broken function found, compilation aborted!");
3559 bool doFinalization(Module &M) override {
3560 if (!V.verify(M) && FatalErrors)
3561 report_fatal_error("Broken module found, compilation aborted!");
3566 void getAnalysisUsage(AnalysisUsage &AU) const override {
3567 AU.setPreservesAll();
3572 char VerifierLegacyPass::ID = 0;
3573 INITIALIZE_PASS(VerifierLegacyPass, "verify", "Module Verifier", false, false)
3575 FunctionPass *llvm::createVerifierPass(bool FatalErrors) {
3576 return new VerifierLegacyPass(FatalErrors);
3579 PreservedAnalyses VerifierPass::run(Module &M) {
3580 if (verifyModule(M, &dbgs()) && FatalErrors)
3581 report_fatal_error("Broken module found, compilation aborted!");
3583 return PreservedAnalyses::all();
3586 PreservedAnalyses VerifierPass::run(Function &F) {
3587 if (verifyFunction(F, &dbgs()) && FatalErrors)
3588 report_fatal_error("Broken function found, compilation aborted!");
3590 return PreservedAnalyses::all();