1 //===-- Verifier.cpp - Implement the Module Verifier -------------*- C++ -*-==//
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 // * All other things that are tested by asserts spread about the code...
40 //===----------------------------------------------------------------------===//
42 #include "llvm/Analysis/Verifier.h"
43 #include "llvm/CallingConv.h"
44 #include "llvm/Constants.h"
45 #include "llvm/DerivedTypes.h"
46 #include "llvm/InlineAsm.h"
47 #include "llvm/IntrinsicInst.h"
48 #include "llvm/Metadata.h"
49 #include "llvm/Module.h"
50 #include "llvm/Pass.h"
51 #include "llvm/PassManager.h"
52 #include "llvm/TypeSymbolTable.h"
53 #include "llvm/Analysis/Dominators.h"
54 #include "llvm/Assembly/Writer.h"
55 #include "llvm/CodeGen/ValueTypes.h"
56 #include "llvm/Support/CallSite.h"
57 #include "llvm/Support/CFG.h"
58 #include "llvm/Support/Debug.h"
59 #include "llvm/Support/InstVisitor.h"
60 #include "llvm/ADT/SetVector.h"
61 #include "llvm/ADT/SmallPtrSet.h"
62 #include "llvm/ADT/SmallVector.h"
63 #include "llvm/ADT/StringExtras.h"
64 #include "llvm/ADT/STLExtras.h"
65 #include "llvm/Support/ErrorHandling.h"
66 #include "llvm/Support/raw_ostream.h"
71 namespace { // Anonymous namespace for class
72 struct PreVerifier : public FunctionPass {
73 static char ID; // Pass ID, replacement for typeid
75 PreVerifier() : FunctionPass(ID) {
76 initializePreVerifierPass(*PassRegistry::getPassRegistry());
79 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
83 // Check that the prerequisites for successful DominatorTree construction
85 bool runOnFunction(Function &F) {
88 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
89 if (I->empty() || !I->back().isTerminator()) {
90 dbgs() << "Basic Block in function '" << F.getName()
91 << "' does not have terminator!\n";
92 WriteAsOperand(dbgs(), I, true);
99 report_fatal_error("Broken module, no Basic Block terminator!");
106 char PreVerifier::ID = 0;
107 INITIALIZE_PASS(PreVerifier, "preverify", "Preliminary module verification",
109 static char &PreVerifyID = PreVerifier::ID;
112 class TypeSet : public AbstractTypeUser {
116 /// Insert a type into the set of types.
117 bool insert(const Type *Ty) {
118 if (!Types.insert(Ty))
120 if (Ty->isAbstract())
121 Ty->addAbstractTypeUser(this);
125 // Remove ourselves as abstract type listeners for any types that remain
126 // abstract when the TypeSet is destroyed.
128 for (SmallSetVector<const Type *, 16>::iterator I = Types.begin(),
129 E = Types.end(); I != E; ++I) {
131 if (Ty->isAbstract())
132 Ty->removeAbstractTypeUser(this);
136 // Abstract type user interface.
138 /// Remove types from the set when refined. Do not insert the type it was
139 /// refined to because that type hasn't been verified yet.
140 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
142 OldTy->removeAbstractTypeUser(this);
145 /// Stop listening for changes to a type which is no longer abstract.
146 void typeBecameConcrete(const DerivedType *AbsTy) {
147 AbsTy->removeAbstractTypeUser(this);
153 SmallSetVector<const Type *, 16> Types;
156 TypeSet(const TypeSet &);
157 TypeSet &operator=(const TypeSet &);
160 struct Verifier : public FunctionPass, public InstVisitor<Verifier> {
161 static char ID; // Pass ID, replacement for typeid
162 bool Broken; // Is this module found to be broken?
163 bool RealPass; // Are we not being run by a PassManager?
164 VerifierFailureAction action;
165 // What to do if verification fails.
166 Module *Mod; // Module we are verifying right now
167 LLVMContext *Context; // Context within which we are verifying
168 DominatorTree *DT; // Dominator Tree, caution can be null!
170 std::string Messages;
171 raw_string_ostream MessagesStr;
173 /// InstInThisBlock - when verifying a basic block, keep track of all of the
174 /// instructions we have seen so far. This allows us to do efficient
175 /// dominance checks for the case when an instruction has an operand that is
176 /// an instruction in the same block.
177 SmallPtrSet<Instruction*, 16> InstsInThisBlock;
179 /// Types - keep track of the types that have been checked already.
182 /// MDNodes - keep track of the metadata nodes that have been checked
184 SmallPtrSet<MDNode *, 32> MDNodes;
188 Broken(false), RealPass(true), action(AbortProcessAction),
189 Mod(0), Context(0), DT(0), MessagesStr(Messages) {
190 initializeVerifierPass(*PassRegistry::getPassRegistry());
192 explicit Verifier(VerifierFailureAction ctn)
194 Broken(false), RealPass(true), action(ctn), Mod(0), Context(0), DT(0),
195 MessagesStr(Messages) {
196 initializeVerifierPass(*PassRegistry::getPassRegistry());
199 bool doInitialization(Module &M) {
201 Context = &M.getContext();
202 verifyTypeSymbolTable(M.getTypeSymbolTable());
204 // If this is a real pass, in a pass manager, we must abort before
205 // returning back to the pass manager, or else the pass manager may try to
206 // run other passes on the broken module.
208 return abortIfBroken();
212 bool runOnFunction(Function &F) {
213 // Get dominator information if we are being run by PassManager
214 if (RealPass) DT = &getAnalysis<DominatorTree>();
217 if (!Context) Context = &F.getContext();
220 InstsInThisBlock.clear();
222 // If this is a real pass, in a pass manager, we must abort before
223 // returning back to the pass manager, or else the pass manager may try to
224 // run other passes on the broken module.
226 return abortIfBroken();
231 bool doFinalization(Module &M) {
232 // Scan through, checking all of the external function's linkage now...
233 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
234 visitGlobalValue(*I);
236 // Check to make sure function prototypes are okay.
237 if (I->isDeclaration()) visitFunction(*I);
240 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
242 visitGlobalVariable(*I);
244 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
246 visitGlobalAlias(*I);
248 for (Module::named_metadata_iterator I = M.named_metadata_begin(),
249 E = M.named_metadata_end(); I != E; ++I)
250 visitNamedMDNode(*I);
252 // If the module is broken, abort at this time.
253 return abortIfBroken();
256 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
257 AU.setPreservesAll();
258 AU.addRequiredID(PreVerifyID);
260 AU.addRequired<DominatorTree>();
263 /// abortIfBroken - If the module is broken and we are supposed to abort on
264 /// this condition, do so.
266 bool abortIfBroken() {
267 if (!Broken) return false;
268 MessagesStr << "Broken module found, ";
270 default: llvm_unreachable("Unknown action");
271 case AbortProcessAction:
272 MessagesStr << "compilation aborted!\n";
273 dbgs() << MessagesStr.str();
274 // Client should choose different reaction if abort is not desired
276 case PrintMessageAction:
277 MessagesStr << "verification continues.\n";
278 dbgs() << MessagesStr.str();
280 case ReturnStatusAction:
281 MessagesStr << "compilation terminated.\n";
287 // Verification methods...
288 void verifyTypeSymbolTable(TypeSymbolTable &ST);
289 void visitGlobalValue(GlobalValue &GV);
290 void visitGlobalVariable(GlobalVariable &GV);
291 void visitGlobalAlias(GlobalAlias &GA);
292 void visitNamedMDNode(NamedMDNode &NMD);
293 void visitMDNode(MDNode &MD, Function *F);
294 void visitFunction(Function &F);
295 void visitBasicBlock(BasicBlock &BB);
296 using InstVisitor<Verifier>::visit;
298 void visit(Instruction &I);
300 void visitTruncInst(TruncInst &I);
301 void visitZExtInst(ZExtInst &I);
302 void visitSExtInst(SExtInst &I);
303 void visitFPTruncInst(FPTruncInst &I);
304 void visitFPExtInst(FPExtInst &I);
305 void visitFPToUIInst(FPToUIInst &I);
306 void visitFPToSIInst(FPToSIInst &I);
307 void visitUIToFPInst(UIToFPInst &I);
308 void visitSIToFPInst(SIToFPInst &I);
309 void visitIntToPtrInst(IntToPtrInst &I);
310 void visitPtrToIntInst(PtrToIntInst &I);
311 void visitBitCastInst(BitCastInst &I);
312 void visitPHINode(PHINode &PN);
313 void visitBinaryOperator(BinaryOperator &B);
314 void visitICmpInst(ICmpInst &IC);
315 void visitFCmpInst(FCmpInst &FC);
316 void visitExtractElementInst(ExtractElementInst &EI);
317 void visitInsertElementInst(InsertElementInst &EI);
318 void visitShuffleVectorInst(ShuffleVectorInst &EI);
319 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
320 void visitCallInst(CallInst &CI);
321 void visitInvokeInst(InvokeInst &II);
322 void visitGetElementPtrInst(GetElementPtrInst &GEP);
323 void visitLoadInst(LoadInst &LI);
324 void visitStoreInst(StoreInst &SI);
325 void visitInstruction(Instruction &I);
326 void visitTerminatorInst(TerminatorInst &I);
327 void visitBranchInst(BranchInst &BI);
328 void visitReturnInst(ReturnInst &RI);
329 void visitSwitchInst(SwitchInst &SI);
330 void visitIndirectBrInst(IndirectBrInst &BI);
331 void visitSelectInst(SelectInst &SI);
332 void visitUserOp1(Instruction &I);
333 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
334 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
335 void visitAllocaInst(AllocaInst &AI);
336 void visitExtractValueInst(ExtractValueInst &EVI);
337 void visitInsertValueInst(InsertValueInst &IVI);
339 void VerifyCallSite(CallSite CS);
340 bool PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
341 int VT, unsigned ArgNo, std::string &Suffix);
342 void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
343 unsigned RetNum, unsigned ParamNum, ...);
344 void VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
345 bool isReturnValue, const Value *V);
346 void VerifyFunctionAttrs(const FunctionType *FT, const AttrListPtr &Attrs,
348 void VerifyType(const Type *Ty);
350 void WriteValue(const Value *V) {
352 if (isa<Instruction>(V)) {
353 MessagesStr << *V << '\n';
355 WriteAsOperand(MessagesStr, V, true, Mod);
360 void WriteType(const Type *T) {
363 WriteTypeSymbolic(MessagesStr, T, Mod);
367 // CheckFailed - A check failed, so print out the condition and the message
368 // that failed. This provides a nice place to put a breakpoint if you want
369 // to see why something is not correct.
370 void CheckFailed(const Twine &Message,
371 const Value *V1 = 0, const Value *V2 = 0,
372 const Value *V3 = 0, const Value *V4 = 0) {
373 MessagesStr << Message.str() << "\n";
381 void CheckFailed(const Twine &Message, const Value *V1,
382 const Type *T2, const Value *V3 = 0) {
383 MessagesStr << Message.str() << "\n";
390 void CheckFailed(const Twine &Message, const Type *T1,
391 const Type *T2 = 0, const Type *T3 = 0) {
392 MessagesStr << Message.str() << "\n";
399 } // End anonymous namespace
401 char Verifier::ID = 0;
402 INITIALIZE_PASS_BEGIN(Verifier, "verify", "Module Verifier", false, false)
403 INITIALIZE_PASS_DEPENDENCY(PreVerifier)
404 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
405 INITIALIZE_PASS_END(Verifier, "verify", "Module Verifier", false, false)
407 // Assert - We know that cond should be true, if not print an error message.
408 #define Assert(C, M) \
409 do { if (!(C)) { CheckFailed(M); return; } } while (0)
410 #define Assert1(C, M, V1) \
411 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
412 #define Assert2(C, M, V1, V2) \
413 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
414 #define Assert3(C, M, V1, V2, V3) \
415 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
416 #define Assert4(C, M, V1, V2, V3, V4) \
417 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
419 void Verifier::visit(Instruction &I) {
420 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
421 Assert1(I.getOperand(i) != 0, "Operand is null", &I);
422 InstVisitor<Verifier>::visit(I);
426 void Verifier::visitGlobalValue(GlobalValue &GV) {
427 Assert1(!GV.isDeclaration() ||
428 GV.isMaterializable() ||
429 GV.hasExternalLinkage() ||
430 GV.hasDLLImportLinkage() ||
431 GV.hasExternalWeakLinkage() ||
432 (isa<GlobalAlias>(GV) &&
433 (GV.hasLocalLinkage() || GV.hasWeakLinkage())),
434 "Global is external, but doesn't have external or dllimport or weak linkage!",
437 Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
438 "Global is marked as dllimport, but not external", &GV);
440 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
441 "Only global variables can have appending linkage!", &GV);
443 if (GV.hasAppendingLinkage()) {
444 GlobalVariable *GVar = dyn_cast<GlobalVariable>(&GV);
445 Assert1(GVar && GVar->getType()->getElementType()->isArrayTy(),
446 "Only global arrays can have appending linkage!", GVar);
449 Assert1(!GV.hasLinkerPrivateWeakDefAutoLinkage() || GV.hasDefaultVisibility(),
450 "linker_private_weak_def_auto can only have default visibility!",
454 void Verifier::visitGlobalVariable(GlobalVariable &GV) {
455 if (GV.hasInitializer()) {
456 Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
457 "Global variable initializer type does not match global "
458 "variable type!", &GV);
460 // If the global has common linkage, it must have a zero initializer and
461 // cannot be constant.
462 if (GV.hasCommonLinkage()) {
463 Assert1(GV.getInitializer()->isNullValue(),
464 "'common' global must have a zero initializer!", &GV);
465 Assert1(!GV.isConstant(), "'common' global may not be marked constant!",
469 Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
470 GV.hasExternalWeakLinkage(),
471 "invalid linkage type for global declaration", &GV);
472 Assert1(!GV.hasUnnamedAddr(), "only definitions can have unnamed_addr",
476 visitGlobalValue(GV);
479 void Verifier::visitGlobalAlias(GlobalAlias &GA) {
480 Assert1(!GA.getName().empty(),
481 "Alias name cannot be empty!", &GA);
482 Assert1(GA.hasExternalLinkage() || GA.hasLocalLinkage() ||
484 "Alias should have external or external weak linkage!", &GA);
485 Assert1(GA.getAliasee(),
486 "Aliasee cannot be NULL!", &GA);
487 Assert1(GA.getType() == GA.getAliasee()->getType(),
488 "Alias and aliasee types should match!", &GA);
489 Assert1(!GA.hasUnnamedAddr(), "Alias cannot have unnamed_addr!", &GA);
491 if (!isa<GlobalValue>(GA.getAliasee())) {
492 const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
494 (CE->getOpcode() == Instruction::BitCast ||
495 CE->getOpcode() == Instruction::GetElementPtr) &&
496 isa<GlobalValue>(CE->getOperand(0)),
497 "Aliasee should be either GlobalValue or bitcast of GlobalValue",
501 const GlobalValue* Aliasee = GA.resolveAliasedGlobal(/*stopOnWeak*/ false);
503 "Aliasing chain should end with function or global variable", &GA);
505 visitGlobalValue(GA);
508 void Verifier::visitNamedMDNode(NamedMDNode &NMD) {
509 for (unsigned i = 0, e = NMD.getNumOperands(); i != e; ++i) {
510 MDNode *MD = NMD.getOperand(i);
514 Assert1(!MD->isFunctionLocal(),
515 "Named metadata operand cannot be function local!", MD);
520 void Verifier::visitMDNode(MDNode &MD, Function *F) {
521 // Only visit each node once. Metadata can be mutually recursive, so this
522 // avoids infinite recursion here, as well as being an optimization.
523 if (!MDNodes.insert(&MD))
526 for (unsigned i = 0, e = MD.getNumOperands(); i != e; ++i) {
527 Value *Op = MD.getOperand(i);
530 if (isa<Constant>(Op) || isa<MDString>(Op))
532 if (MDNode *N = dyn_cast<MDNode>(Op)) {
533 Assert2(MD.isFunctionLocal() || !N->isFunctionLocal(),
534 "Global metadata operand cannot be function local!", &MD, N);
538 Assert2(MD.isFunctionLocal(), "Invalid operand for global metadata!", &MD, Op);
540 // If this was an instruction, bb, or argument, verify that it is in the
541 // function that we expect.
542 Function *ActualF = 0;
543 if (Instruction *I = dyn_cast<Instruction>(Op))
544 ActualF = I->getParent()->getParent();
545 else if (BasicBlock *BB = dyn_cast<BasicBlock>(Op))
546 ActualF = BB->getParent();
547 else if (Argument *A = dyn_cast<Argument>(Op))
548 ActualF = A->getParent();
549 assert(ActualF && "Unimplemented function local metadata case!");
551 Assert2(ActualF == F, "function-local metadata used in wrong function",
556 void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
557 for (TypeSymbolTable::iterator I = ST.begin(), E = ST.end(); I != E; ++I)
558 VerifyType(I->second);
561 // VerifyParameterAttrs - Check the given attributes for an argument or return
562 // value of the specified type. The value V is printed in error messages.
563 void Verifier::VerifyParameterAttrs(Attributes Attrs, const Type *Ty,
564 bool isReturnValue, const Value *V) {
565 if (Attrs == Attribute::None)
568 Attributes FnCheckAttr = Attrs & Attribute::FunctionOnly;
569 Assert1(!FnCheckAttr, "Attribute " + Attribute::getAsString(FnCheckAttr) +
570 " only applies to the function!", V);
573 Attributes RetI = Attrs & Attribute::ParameterOnly;
574 Assert1(!RetI, "Attribute " + Attribute::getAsString(RetI) +
575 " does not apply to return values!", V);
579 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
580 Attributes MutI = Attrs & Attribute::MutuallyIncompatible[i];
581 Assert1(!(MutI & (MutI - 1)), "Attributes " +
582 Attribute::getAsString(MutI) + " are incompatible!", V);
585 Attributes TypeI = Attrs & Attribute::typeIncompatible(Ty);
586 Assert1(!TypeI, "Wrong type for attribute " +
587 Attribute::getAsString(TypeI), V);
589 Attributes ByValI = Attrs & Attribute::ByVal;
590 if (const PointerType *PTy = dyn_cast<PointerType>(Ty)) {
591 Assert1(!ByValI || PTy->getElementType()->isSized(),
592 "Attribute " + Attribute::getAsString(ByValI) +
593 " does not support unsized types!", V);
596 "Attribute " + Attribute::getAsString(ByValI) +
597 " only applies to parameters with pointer type!", V);
601 // VerifyFunctionAttrs - Check parameter attributes against a function type.
602 // The value V is printed in error messages.
603 void Verifier::VerifyFunctionAttrs(const FunctionType *FT,
604 const AttrListPtr &Attrs,
609 bool SawNest = false;
611 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
612 const AttributeWithIndex &Attr = Attrs.getSlot(i);
616 Ty = FT->getReturnType();
617 else if (Attr.Index-1 < FT->getNumParams())
618 Ty = FT->getParamType(Attr.Index-1);
620 break; // VarArgs attributes, verified elsewhere.
622 VerifyParameterAttrs(Attr.Attrs, Ty, Attr.Index == 0, V);
624 if (Attr.Attrs & Attribute::Nest) {
625 Assert1(!SawNest, "More than one parameter has attribute nest!", V);
629 if (Attr.Attrs & Attribute::StructRet)
630 Assert1(Attr.Index == 1, "Attribute sret not on first parameter!", V);
633 Attributes FAttrs = Attrs.getFnAttributes();
634 Attributes NotFn = FAttrs & (~Attribute::FunctionOnly);
635 Assert1(!NotFn, "Attribute " + Attribute::getAsString(NotFn) +
636 " does not apply to the function!", V);
639 i < array_lengthof(Attribute::MutuallyIncompatible); ++i) {
640 Attributes MutI = FAttrs & Attribute::MutuallyIncompatible[i];
641 Assert1(!(MutI & (MutI - 1)), "Attributes " +
642 Attribute::getAsString(MutI) + " are incompatible!", V);
646 static bool VerifyAttributeCount(const AttrListPtr &Attrs, unsigned Params) {
650 unsigned LastSlot = Attrs.getNumSlots() - 1;
651 unsigned LastIndex = Attrs.getSlot(LastSlot).Index;
652 if (LastIndex <= Params
653 || (LastIndex == (unsigned)~0
654 && (LastSlot == 0 || Attrs.getSlot(LastSlot - 1).Index <= Params)))
660 // visitFunction - Verify that a function is ok.
662 void Verifier::visitFunction(Function &F) {
663 // Check function arguments.
664 const FunctionType *FT = F.getFunctionType();
665 unsigned NumArgs = F.arg_size();
667 Assert1(Context == &F.getContext(),
668 "Function context does not match Module context!", &F);
670 Assert1(!F.hasCommonLinkage(), "Functions may not have common linkage", &F);
671 Assert2(FT->getNumParams() == NumArgs,
672 "# formal arguments must match # of arguments for function type!",
674 Assert1(F.getReturnType()->isFirstClassType() ||
675 F.getReturnType()->isVoidTy() ||
676 F.getReturnType()->isStructTy(),
677 "Functions cannot return aggregate values!", &F);
679 Assert1(!F.hasStructRetAttr() || F.getReturnType()->isVoidTy(),
680 "Invalid struct return type!", &F);
682 const AttrListPtr &Attrs = F.getAttributes();
684 Assert1(VerifyAttributeCount(Attrs, FT->getNumParams()),
685 "Attributes after last parameter!", &F);
687 // Check function attributes.
688 VerifyFunctionAttrs(FT, Attrs, &F);
690 // Check that this function meets the restrictions on this calling convention.
691 switch (F.getCallingConv()) {
696 case CallingConv::Fast:
697 case CallingConv::Cold:
698 case CallingConv::X86_FastCall:
699 case CallingConv::X86_ThisCall:
700 case CallingConv::PTX_Kernel:
701 case CallingConv::PTX_Device:
702 Assert1(!F.isVarArg(),
703 "Varargs functions must have C calling conventions!", &F);
707 bool isLLVMdotName = F.getName().size() >= 5 &&
708 F.getName().substr(0, 5) == "llvm.";
710 // Check that the argument values match the function type for this function...
712 for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
714 Assert2(I->getType() == FT->getParamType(i),
715 "Argument value does not match function argument type!",
716 I, FT->getParamType(i));
717 Assert1(I->getType()->isFirstClassType(),
718 "Function arguments must have first-class types!", I);
720 Assert2(!I->getType()->isMetadataTy(),
721 "Function takes metadata but isn't an intrinsic", I, &F);
724 if (F.isMaterializable()) {
725 // Function has a body somewhere we can't see.
726 } else if (F.isDeclaration()) {
727 Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
728 F.hasExternalWeakLinkage(),
729 "invalid linkage type for function declaration", &F);
730 Assert1(!F.hasUnnamedAddr(), "only definitions can have unnamed_addr", &F);
732 // Verify that this function (which has a body) is not named "llvm.*". It
733 // is not legal to define intrinsics.
734 Assert1(!isLLVMdotName, "llvm intrinsics cannot be defined!", &F);
736 // Check the entry node
737 BasicBlock *Entry = &F.getEntryBlock();
738 Assert1(pred_begin(Entry) == pred_end(Entry),
739 "Entry block to function must not have predecessors!", Entry);
741 // The address of the entry block cannot be taken, unless it is dead.
742 if (Entry->hasAddressTaken()) {
743 Assert1(!BlockAddress::get(Entry)->isConstantUsed(),
744 "blockaddress may not be used with the entry block!", Entry);
748 // If this function is actually an intrinsic, verify that it is only used in
749 // direct call/invokes, never having its "address taken".
750 if (F.getIntrinsicID()) {
752 if (F.hasAddressTaken(&U))
753 Assert1(0, "Invalid user of intrinsic instruction!", U);
757 // verifyBasicBlock - Verify that a basic block is well formed...
759 void Verifier::visitBasicBlock(BasicBlock &BB) {
760 InstsInThisBlock.clear();
762 // Ensure that basic blocks have terminators!
763 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
765 // Check constraints that this basic block imposes on all of the PHI nodes in
767 if (isa<PHINode>(BB.front())) {
768 SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
769 SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
770 std::sort(Preds.begin(), Preds.end());
772 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
773 // Ensure that PHI nodes have at least one entry!
774 Assert1(PN->getNumIncomingValues() != 0,
775 "PHI nodes must have at least one entry. If the block is dead, "
776 "the PHI should be removed!", PN);
777 Assert1(PN->getNumIncomingValues() == Preds.size(),
778 "PHINode should have one entry for each predecessor of its "
779 "parent basic block!", PN);
781 // Get and sort all incoming values in the PHI node...
783 Values.reserve(PN->getNumIncomingValues());
784 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
785 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
786 PN->getIncomingValue(i)));
787 std::sort(Values.begin(), Values.end());
789 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
790 // Check to make sure that if there is more than one entry for a
791 // particular basic block in this PHI node, that the incoming values are
794 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
795 Values[i].second == Values[i-1].second,
796 "PHI node has multiple entries for the same basic block with "
797 "different incoming values!", PN, Values[i].first,
798 Values[i].second, Values[i-1].second);
800 // Check to make sure that the predecessors and PHI node entries are
802 Assert3(Values[i].first == Preds[i],
803 "PHI node entries do not match predecessors!", PN,
804 Values[i].first, Preds[i]);
810 void Verifier::visitTerminatorInst(TerminatorInst &I) {
811 // Ensure that terminators only exist at the end of the basic block.
812 Assert1(&I == I.getParent()->getTerminator(),
813 "Terminator found in the middle of a basic block!", I.getParent());
817 void Verifier::visitBranchInst(BranchInst &BI) {
818 if (BI.isConditional()) {
819 Assert2(BI.getCondition()->getType()->isIntegerTy(1),
820 "Branch condition is not 'i1' type!", &BI, BI.getCondition());
822 visitTerminatorInst(BI);
825 void Verifier::visitReturnInst(ReturnInst &RI) {
826 Function *F = RI.getParent()->getParent();
827 unsigned N = RI.getNumOperands();
828 if (F->getReturnType()->isVoidTy())
830 "Found return instr that returns non-void in Function of void "
831 "return type!", &RI, F->getReturnType());
832 else if (N == 1 && F->getReturnType() == RI.getOperand(0)->getType()) {
833 // Exactly one return value and it matches the return type. Good.
834 } else if (const StructType *STy = dyn_cast<StructType>(F->getReturnType())) {
835 // The return type is a struct; check for multiple return values.
836 Assert2(STy->getNumElements() == N,
837 "Incorrect number of return values in ret instruction!",
838 &RI, F->getReturnType());
839 for (unsigned i = 0; i != N; ++i)
840 Assert2(STy->getElementType(i) == RI.getOperand(i)->getType(),
841 "Function return type does not match operand "
842 "type of return inst!", &RI, F->getReturnType());
843 } else if (const ArrayType *ATy = dyn_cast<ArrayType>(F->getReturnType())) {
844 // The return type is an array; check for multiple return values.
845 Assert2(ATy->getNumElements() == N,
846 "Incorrect number of return values in ret instruction!",
847 &RI, F->getReturnType());
848 for (unsigned i = 0; i != N; ++i)
849 Assert2(ATy->getElementType() == RI.getOperand(i)->getType(),
850 "Function return type does not match operand "
851 "type of return inst!", &RI, F->getReturnType());
853 CheckFailed("Function return type does not match operand "
854 "type of return inst!", &RI, F->getReturnType());
857 // Check to make sure that the return value has necessary properties for
859 visitTerminatorInst(RI);
862 void Verifier::visitSwitchInst(SwitchInst &SI) {
863 // Check to make sure that all of the constants in the switch instruction
864 // have the same type as the switched-on value.
865 const Type *SwitchTy = SI.getCondition()->getType();
866 SmallPtrSet<ConstantInt*, 32> Constants;
867 for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i) {
868 Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
869 "Switch constants must all be same type as switch value!", &SI);
870 Assert2(Constants.insert(SI.getCaseValue(i)),
871 "Duplicate integer as switch case", &SI, SI.getCaseValue(i));
874 visitTerminatorInst(SI);
877 void Verifier::visitIndirectBrInst(IndirectBrInst &BI) {
878 Assert1(BI.getAddress()->getType()->isPointerTy(),
879 "Indirectbr operand must have pointer type!", &BI);
880 for (unsigned i = 0, e = BI.getNumDestinations(); i != e; ++i)
881 Assert1(BI.getDestination(i)->getType()->isLabelTy(),
882 "Indirectbr destinations must all have pointer type!", &BI);
884 visitTerminatorInst(BI);
887 void Verifier::visitSelectInst(SelectInst &SI) {
888 Assert1(!SelectInst::areInvalidOperands(SI.getOperand(0), SI.getOperand(1),
890 "Invalid operands for select instruction!", &SI);
892 Assert1(SI.getTrueValue()->getType() == SI.getType(),
893 "Select values must have same type as select instruction!", &SI);
894 visitInstruction(SI);
897 /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
898 /// a pass, if any exist, it's an error.
900 void Verifier::visitUserOp1(Instruction &I) {
901 Assert1(0, "User-defined operators should not live outside of a pass!", &I);
904 void Verifier::visitTruncInst(TruncInst &I) {
905 // Get the source and destination types
906 const Type *SrcTy = I.getOperand(0)->getType();
907 const Type *DestTy = I.getType();
909 // Get the size of the types in bits, we'll need this later
910 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
911 unsigned DestBitSize = DestTy->getScalarSizeInBits();
913 Assert1(SrcTy->isIntOrIntVectorTy(), "Trunc only operates on integer", &I);
914 Assert1(DestTy->isIntOrIntVectorTy(), "Trunc only produces integer", &I);
915 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
916 "trunc source and destination must both be a vector or neither", &I);
917 Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
922 void Verifier::visitZExtInst(ZExtInst &I) {
923 // Get the source and destination types
924 const Type *SrcTy = I.getOperand(0)->getType();
925 const Type *DestTy = I.getType();
927 // Get the size of the types in bits, we'll need this later
928 Assert1(SrcTy->isIntOrIntVectorTy(), "ZExt only operates on integer", &I);
929 Assert1(DestTy->isIntOrIntVectorTy(), "ZExt only produces an integer", &I);
930 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
931 "zext source and destination must both be a vector or neither", &I);
932 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
933 unsigned DestBitSize = DestTy->getScalarSizeInBits();
935 Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
940 void Verifier::visitSExtInst(SExtInst &I) {
941 // Get the source and destination types
942 const Type *SrcTy = I.getOperand(0)->getType();
943 const Type *DestTy = I.getType();
945 // Get the size of the types in bits, we'll need this later
946 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
947 unsigned DestBitSize = DestTy->getScalarSizeInBits();
949 Assert1(SrcTy->isIntOrIntVectorTy(), "SExt only operates on integer", &I);
950 Assert1(DestTy->isIntOrIntVectorTy(), "SExt only produces an integer", &I);
951 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
952 "sext source and destination must both be a vector or neither", &I);
953 Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
958 void Verifier::visitFPTruncInst(FPTruncInst &I) {
959 // Get the source and destination types
960 const Type *SrcTy = I.getOperand(0)->getType();
961 const Type *DestTy = I.getType();
962 // Get the size of the types in bits, we'll need this later
963 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
964 unsigned DestBitSize = DestTy->getScalarSizeInBits();
966 Assert1(SrcTy->isFPOrFPVectorTy(),"FPTrunc only operates on FP", &I);
967 Assert1(DestTy->isFPOrFPVectorTy(),"FPTrunc only produces an FP", &I);
968 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
969 "fptrunc source and destination must both be a vector or neither",&I);
970 Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
975 void Verifier::visitFPExtInst(FPExtInst &I) {
976 // Get the source and destination types
977 const Type *SrcTy = I.getOperand(0)->getType();
978 const Type *DestTy = I.getType();
980 // Get the size of the types in bits, we'll need this later
981 unsigned SrcBitSize = SrcTy->getScalarSizeInBits();
982 unsigned DestBitSize = DestTy->getScalarSizeInBits();
984 Assert1(SrcTy->isFPOrFPVectorTy(),"FPExt only operates on FP", &I);
985 Assert1(DestTy->isFPOrFPVectorTy(),"FPExt only produces an FP", &I);
986 Assert1(SrcTy->isVectorTy() == DestTy->isVectorTy(),
987 "fpext source and destination must both be a vector or neither", &I);
988 Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
993 void Verifier::visitUIToFPInst(UIToFPInst &I) {
994 // Get the source and destination types
995 const Type *SrcTy = I.getOperand(0)->getType();
996 const Type *DestTy = I.getType();
998 bool SrcVec = SrcTy->isVectorTy();
999 bool DstVec = DestTy->isVectorTy();
1001 Assert1(SrcVec == DstVec,
1002 "UIToFP source and dest must both be vector or scalar", &I);
1003 Assert1(SrcTy->isIntOrIntVectorTy(),
1004 "UIToFP source must be integer or integer vector", &I);
1005 Assert1(DestTy->isFPOrFPVectorTy(),
1006 "UIToFP result must be FP or FP vector", &I);
1008 if (SrcVec && DstVec)
1009 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1010 cast<VectorType>(DestTy)->getNumElements(),
1011 "UIToFP source and dest vector length mismatch", &I);
1013 visitInstruction(I);
1016 void Verifier::visitSIToFPInst(SIToFPInst &I) {
1017 // Get the source and destination types
1018 const Type *SrcTy = I.getOperand(0)->getType();
1019 const Type *DestTy = I.getType();
1021 bool SrcVec = SrcTy->isVectorTy();
1022 bool DstVec = DestTy->isVectorTy();
1024 Assert1(SrcVec == DstVec,
1025 "SIToFP source and dest must both be vector or scalar", &I);
1026 Assert1(SrcTy->isIntOrIntVectorTy(),
1027 "SIToFP source must be integer or integer vector", &I);
1028 Assert1(DestTy->isFPOrFPVectorTy(),
1029 "SIToFP result must be FP or FP vector", &I);
1031 if (SrcVec && DstVec)
1032 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1033 cast<VectorType>(DestTy)->getNumElements(),
1034 "SIToFP source and dest vector length mismatch", &I);
1036 visitInstruction(I);
1039 void Verifier::visitFPToUIInst(FPToUIInst &I) {
1040 // Get the source and destination types
1041 const Type *SrcTy = I.getOperand(0)->getType();
1042 const Type *DestTy = I.getType();
1044 bool SrcVec = SrcTy->isVectorTy();
1045 bool DstVec = DestTy->isVectorTy();
1047 Assert1(SrcVec == DstVec,
1048 "FPToUI source and dest must both be vector or scalar", &I);
1049 Assert1(SrcTy->isFPOrFPVectorTy(), "FPToUI source must be FP or FP vector",
1051 Assert1(DestTy->isIntOrIntVectorTy(),
1052 "FPToUI result must be integer or integer vector", &I);
1054 if (SrcVec && DstVec)
1055 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1056 cast<VectorType>(DestTy)->getNumElements(),
1057 "FPToUI source and dest vector length mismatch", &I);
1059 visitInstruction(I);
1062 void Verifier::visitFPToSIInst(FPToSIInst &I) {
1063 // Get the source and destination types
1064 const Type *SrcTy = I.getOperand(0)->getType();
1065 const Type *DestTy = I.getType();
1067 bool SrcVec = SrcTy->isVectorTy();
1068 bool DstVec = DestTy->isVectorTy();
1070 Assert1(SrcVec == DstVec,
1071 "FPToSI source and dest must both be vector or scalar", &I);
1072 Assert1(SrcTy->isFPOrFPVectorTy(),
1073 "FPToSI source must be FP or FP vector", &I);
1074 Assert1(DestTy->isIntOrIntVectorTy(),
1075 "FPToSI result must be integer or integer vector", &I);
1077 if (SrcVec && DstVec)
1078 Assert1(cast<VectorType>(SrcTy)->getNumElements() ==
1079 cast<VectorType>(DestTy)->getNumElements(),
1080 "FPToSI source and dest vector length mismatch", &I);
1082 visitInstruction(I);
1085 void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
1086 // Get the source and destination types
1087 const Type *SrcTy = I.getOperand(0)->getType();
1088 const Type *DestTy = I.getType();
1090 Assert1(SrcTy->isPointerTy(), "PtrToInt source must be pointer", &I);
1091 Assert1(DestTy->isIntegerTy(), "PtrToInt result must be integral", &I);
1093 visitInstruction(I);
1096 void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
1097 // Get the source and destination types
1098 const Type *SrcTy = I.getOperand(0)->getType();
1099 const Type *DestTy = I.getType();
1101 Assert1(SrcTy->isIntegerTy(), "IntToPtr source must be an integral", &I);
1102 Assert1(DestTy->isPointerTy(), "IntToPtr result must be a pointer",&I);
1104 visitInstruction(I);
1107 void Verifier::visitBitCastInst(BitCastInst &I) {
1108 // Get the source and destination types
1109 const Type *SrcTy = I.getOperand(0)->getType();
1110 const Type *DestTy = I.getType();
1112 // Get the size of the types in bits, we'll need this later
1113 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1114 unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
1116 // BitCast implies a no-op cast of type only. No bits change.
1117 // However, you can't cast pointers to anything but pointers.
1118 Assert1(DestTy->isPointerTy() == DestTy->isPointerTy(),
1119 "Bitcast requires both operands to be pointer or neither", &I);
1120 Assert1(SrcBitSize == DestBitSize, "Bitcast requires types of same width",&I);
1122 // Disallow aggregates.
1123 Assert1(!SrcTy->isAggregateType(),
1124 "Bitcast operand must not be aggregate", &I);
1125 Assert1(!DestTy->isAggregateType(),
1126 "Bitcast type must not be aggregate", &I);
1128 visitInstruction(I);
1131 /// visitPHINode - Ensure that a PHI node is well formed.
1133 void Verifier::visitPHINode(PHINode &PN) {
1134 // Ensure that the PHI nodes are all grouped together at the top of the block.
1135 // This can be tested by checking whether the instruction before this is
1136 // either nonexistent (because this is begin()) or is a PHI node. If not,
1137 // then there is some other instruction before a PHI.
1138 Assert2(&PN == &PN.getParent()->front() ||
1139 isa<PHINode>(--BasicBlock::iterator(&PN)),
1140 "PHI nodes not grouped at top of basic block!",
1141 &PN, PN.getParent());
1143 // Check that all of the values of the PHI node have the same type as the
1144 // result, and that the incoming blocks are really basic blocks.
1145 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
1146 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
1147 "PHI node operands are not the same type as the result!", &PN);
1148 Assert1(isa<BasicBlock>(PN.getOperand(
1149 PHINode::getOperandNumForIncomingBlock(i))),
1150 "PHI node incoming block is not a BasicBlock!", &PN);
1153 // All other PHI node constraints are checked in the visitBasicBlock method.
1155 visitInstruction(PN);
1158 void Verifier::VerifyCallSite(CallSite CS) {
1159 Instruction *I = CS.getInstruction();
1161 Assert1(CS.getCalledValue()->getType()->isPointerTy(),
1162 "Called function must be a pointer!", I);
1163 const PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
1165 Assert1(FPTy->getElementType()->isFunctionTy(),
1166 "Called function is not pointer to function type!", I);
1167 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
1169 // Verify that the correct number of arguments are being passed
1170 if (FTy->isVarArg())
1171 Assert1(CS.arg_size() >= FTy->getNumParams(),
1172 "Called function requires more parameters than were provided!",I);
1174 Assert1(CS.arg_size() == FTy->getNumParams(),
1175 "Incorrect number of arguments passed to called function!", I);
1177 // Verify that all arguments to the call match the function type.
1178 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
1179 Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
1180 "Call parameter type does not match function signature!",
1181 CS.getArgument(i), FTy->getParamType(i), I);
1183 const AttrListPtr &Attrs = CS.getAttributes();
1185 Assert1(VerifyAttributeCount(Attrs, CS.arg_size()),
1186 "Attributes after last parameter!", I);
1188 // Verify call attributes.
1189 VerifyFunctionAttrs(FTy, Attrs, I);
1191 if (FTy->isVarArg())
1192 // Check attributes on the varargs part.
1193 for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
1194 Attributes Attr = Attrs.getParamAttributes(Idx);
1196 VerifyParameterAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
1198 Attributes VArgI = Attr & Attribute::VarArgsIncompatible;
1199 Assert1(!VArgI, "Attribute " + Attribute::getAsString(VArgI) +
1200 " cannot be used for vararg call arguments!", I);
1203 // Verify that there's no metadata unless it's a direct call to an intrinsic.
1204 if (!CS.getCalledFunction() ||
1205 !CS.getCalledFunction()->getName().startswith("llvm.")) {
1206 for (FunctionType::param_iterator PI = FTy->param_begin(),
1207 PE = FTy->param_end(); PI != PE; ++PI)
1208 Assert1(!PI->get()->isMetadataTy(),
1209 "Function has metadata parameter but isn't an intrinsic", I);
1212 visitInstruction(*I);
1215 void Verifier::visitCallInst(CallInst &CI) {
1216 VerifyCallSite(&CI);
1218 if (Function *F = CI.getCalledFunction())
1219 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
1220 visitIntrinsicFunctionCall(ID, CI);
1223 void Verifier::visitInvokeInst(InvokeInst &II) {
1224 VerifyCallSite(&II);
1225 visitTerminatorInst(II);
1228 /// visitBinaryOperator - Check that both arguments to the binary operator are
1229 /// of the same type!
1231 void Verifier::visitBinaryOperator(BinaryOperator &B) {
1232 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
1233 "Both operands to a binary operator are not of the same type!", &B);
1235 switch (B.getOpcode()) {
1236 // Check that integer arithmetic operators are only used with
1237 // integral operands.
1238 case Instruction::Add:
1239 case Instruction::Sub:
1240 case Instruction::Mul:
1241 case Instruction::SDiv:
1242 case Instruction::UDiv:
1243 case Instruction::SRem:
1244 case Instruction::URem:
1245 Assert1(B.getType()->isIntOrIntVectorTy(),
1246 "Integer arithmetic operators only work with integral types!", &B);
1247 Assert1(B.getType() == B.getOperand(0)->getType(),
1248 "Integer arithmetic operators must have same type "
1249 "for operands and result!", &B);
1251 // Check that floating-point arithmetic operators are only used with
1252 // floating-point operands.
1253 case Instruction::FAdd:
1254 case Instruction::FSub:
1255 case Instruction::FMul:
1256 case Instruction::FDiv:
1257 case Instruction::FRem:
1258 Assert1(B.getType()->isFPOrFPVectorTy(),
1259 "Floating-point arithmetic operators only work with "
1260 "floating-point types!", &B);
1261 Assert1(B.getType() == B.getOperand(0)->getType(),
1262 "Floating-point arithmetic operators must have same type "
1263 "for operands and result!", &B);
1265 // Check that logical operators are only used with integral operands.
1266 case Instruction::And:
1267 case Instruction::Or:
1268 case Instruction::Xor:
1269 Assert1(B.getType()->isIntOrIntVectorTy(),
1270 "Logical operators only work with integral types!", &B);
1271 Assert1(B.getType() == B.getOperand(0)->getType(),
1272 "Logical operators must have same type for operands and result!",
1275 case Instruction::Shl:
1276 case Instruction::LShr:
1277 case Instruction::AShr:
1278 Assert1(B.getType()->isIntOrIntVectorTy(),
1279 "Shifts only work with integral types!", &B);
1280 Assert1(B.getType() == B.getOperand(0)->getType(),
1281 "Shift return type must be same as operands!", &B);
1284 llvm_unreachable("Unknown BinaryOperator opcode!");
1287 visitInstruction(B);
1290 void Verifier::visitICmpInst(ICmpInst &IC) {
1291 // Check that the operands are the same type
1292 const Type *Op0Ty = IC.getOperand(0)->getType();
1293 const Type *Op1Ty = IC.getOperand(1)->getType();
1294 Assert1(Op0Ty == Op1Ty,
1295 "Both operands to ICmp instruction are not of the same type!", &IC);
1296 // Check that the operands are the right type
1297 Assert1(Op0Ty->isIntOrIntVectorTy() || Op0Ty->isPointerTy(),
1298 "Invalid operand types for ICmp instruction", &IC);
1299 // Check that the predicate is valid.
1300 Assert1(IC.getPredicate() >= CmpInst::FIRST_ICMP_PREDICATE &&
1301 IC.getPredicate() <= CmpInst::LAST_ICMP_PREDICATE,
1302 "Invalid predicate in ICmp instruction!", &IC);
1304 visitInstruction(IC);
1307 void Verifier::visitFCmpInst(FCmpInst &FC) {
1308 // Check that the operands are the same type
1309 const Type *Op0Ty = FC.getOperand(0)->getType();
1310 const Type *Op1Ty = FC.getOperand(1)->getType();
1311 Assert1(Op0Ty == Op1Ty,
1312 "Both operands to FCmp instruction are not of the same type!", &FC);
1313 // Check that the operands are the right type
1314 Assert1(Op0Ty->isFPOrFPVectorTy(),
1315 "Invalid operand types for FCmp instruction", &FC);
1316 // Check that the predicate is valid.
1317 Assert1(FC.getPredicate() >= CmpInst::FIRST_FCMP_PREDICATE &&
1318 FC.getPredicate() <= CmpInst::LAST_FCMP_PREDICATE,
1319 "Invalid predicate in FCmp instruction!", &FC);
1321 visitInstruction(FC);
1324 void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
1325 Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
1327 "Invalid extractelement operands!", &EI);
1328 visitInstruction(EI);
1331 void Verifier::visitInsertElementInst(InsertElementInst &IE) {
1332 Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
1335 "Invalid insertelement operands!", &IE);
1336 visitInstruction(IE);
1339 void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
1340 Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
1342 "Invalid shufflevector operands!", &SV);
1343 visitInstruction(SV);
1346 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1347 SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
1349 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
1350 Idxs.begin(), Idxs.end());
1351 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
1352 Assert2(GEP.getType()->isPointerTy() &&
1353 cast<PointerType>(GEP.getType())->getElementType() == ElTy,
1354 "GEP is not of right type for indices!", &GEP, ElTy);
1355 visitInstruction(GEP);
1358 void Verifier::visitLoadInst(LoadInst &LI) {
1359 const PointerType *PTy = dyn_cast<PointerType>(LI.getOperand(0)->getType());
1360 Assert1(PTy, "Load operand must be a pointer.", &LI);
1361 const Type *ElTy = PTy->getElementType();
1362 Assert2(ElTy == LI.getType(),
1363 "Load result type does not match pointer operand type!", &LI, ElTy);
1364 visitInstruction(LI);
1367 void Verifier::visitStoreInst(StoreInst &SI) {
1368 const PointerType *PTy = dyn_cast<PointerType>(SI.getOperand(1)->getType());
1369 Assert1(PTy, "Store operand must be a pointer.", &SI);
1370 const Type *ElTy = PTy->getElementType();
1371 Assert2(ElTy == SI.getOperand(0)->getType(),
1372 "Stored value type does not match pointer operand type!",
1374 visitInstruction(SI);
1377 void Verifier::visitAllocaInst(AllocaInst &AI) {
1378 const PointerType *PTy = AI.getType();
1379 Assert1(PTy->getAddressSpace() == 0,
1380 "Allocation instruction pointer not in the generic address space!",
1382 Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type",
1384 Assert1(AI.getArraySize()->getType()->isIntegerTy(),
1385 "Alloca array size must have integer type", &AI);
1386 visitInstruction(AI);
1389 void Verifier::visitExtractValueInst(ExtractValueInst &EVI) {
1390 Assert1(ExtractValueInst::getIndexedType(EVI.getAggregateOperand()->getType(),
1391 EVI.idx_begin(), EVI.idx_end()) ==
1393 "Invalid ExtractValueInst operands!", &EVI);
1395 visitInstruction(EVI);
1398 void Verifier::visitInsertValueInst(InsertValueInst &IVI) {
1399 Assert1(ExtractValueInst::getIndexedType(IVI.getAggregateOperand()->getType(),
1400 IVI.idx_begin(), IVI.idx_end()) ==
1401 IVI.getOperand(1)->getType(),
1402 "Invalid InsertValueInst operands!", &IVI);
1404 visitInstruction(IVI);
1407 /// verifyInstruction - Verify that an instruction is well formed.
1409 void Verifier::visitInstruction(Instruction &I) {
1410 BasicBlock *BB = I.getParent();
1411 Assert1(BB, "Instruction not embedded in basic block!", &I);
1413 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
1414 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
1416 Assert1(*UI != (User*)&I || !DT->isReachableFromEntry(BB),
1417 "Only PHI nodes may reference their own value!", &I);
1420 // Check that void typed values don't have names
1421 Assert1(!I.getType()->isVoidTy() || !I.hasName(),
1422 "Instruction has a name, but provides a void value!", &I);
1424 // Check that the return value of the instruction is either void or a legal
1426 Assert1(I.getType()->isVoidTy() ||
1427 I.getType()->isFirstClassType(),
1428 "Instruction returns a non-scalar type!", &I);
1430 // Check that the instruction doesn't produce metadata. Calls are already
1431 // checked against the callee type.
1432 Assert1(!I.getType()->isMetadataTy() ||
1433 isa<CallInst>(I) || isa<InvokeInst>(I),
1434 "Invalid use of metadata!", &I);
1436 // Check that all uses of the instruction, if they are instructions
1437 // themselves, actually have parent basic blocks. If the use is not an
1438 // instruction, it is an error!
1439 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
1441 if (Instruction *Used = dyn_cast<Instruction>(*UI))
1442 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
1443 " embedded in a basic block!", &I, Used);
1445 CheckFailed("Use of instruction is not an instruction!", *UI);
1450 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
1451 Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
1453 // Check to make sure that only first-class-values are operands to
1455 if (!I.getOperand(i)->getType()->isFirstClassType()) {
1456 Assert1(0, "Instruction operands must be first-class values!", &I);
1459 if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
1460 // Check to make sure that the "address of" an intrinsic function is never
1462 Assert1(!F->isIntrinsic() || (i + 1 == e && isa<CallInst>(I)),
1463 "Cannot take the address of an intrinsic!", &I);
1464 Assert1(F->getParent() == Mod, "Referencing function in another module!",
1466 } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
1467 Assert1(OpBB->getParent() == BB->getParent(),
1468 "Referring to a basic block in another function!", &I);
1469 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
1470 Assert1(OpArg->getParent() == BB->getParent(),
1471 "Referring to an argument in another function!", &I);
1472 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
1473 Assert1(GV->getParent() == Mod, "Referencing global in another module!",
1475 } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
1476 BasicBlock *OpBlock = Op->getParent();
1478 // Check that a definition dominates all of its uses.
1479 if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
1480 // Invoke results are only usable in the normal destination, not in the
1481 // exceptional destination.
1482 BasicBlock *NormalDest = II->getNormalDest();
1484 Assert2(NormalDest != II->getUnwindDest(),
1485 "No uses of invoke possible due to dominance structure!",
1488 // PHI nodes differ from other nodes because they actually "use" the
1489 // value in the predecessor basic blocks they correspond to.
1490 BasicBlock *UseBlock = BB;
1491 if (isa<PHINode>(I))
1492 UseBlock = dyn_cast<BasicBlock>(I.getOperand(i+1));
1493 Assert2(UseBlock, "Invoke operand is PHI node with bad incoming-BB",
1496 if (isa<PHINode>(I) && UseBlock == OpBlock) {
1497 // Special case of a phi node in the normal destination or the unwind
1499 Assert2(BB == NormalDest || !DT->isReachableFromEntry(UseBlock),
1500 "Invoke result not available in the unwind destination!",
1503 Assert2(DT->dominates(NormalDest, UseBlock) ||
1504 !DT->isReachableFromEntry(UseBlock),
1505 "Invoke result does not dominate all uses!", Op, &I);
1507 // If the normal successor of an invoke instruction has multiple
1508 // predecessors, then the normal edge from the invoke is critical,
1509 // so the invoke value can only be live if the destination block
1510 // dominates all of it's predecessors (other than the invoke).
1511 if (!NormalDest->getSinglePredecessor() &&
1512 DT->isReachableFromEntry(UseBlock))
1513 // If it is used by something non-phi, then the other case is that
1514 // 'NormalDest' dominates all of its predecessors other than the
1515 // invoke. In this case, the invoke value can still be used.
1516 for (pred_iterator PI = pred_begin(NormalDest),
1517 E = pred_end(NormalDest); PI != E; ++PI)
1518 if (*PI != II->getParent() && !DT->dominates(NormalDest, *PI) &&
1519 DT->isReachableFromEntry(*PI)) {
1520 CheckFailed("Invoke result does not dominate all uses!", Op,&I);
1524 } else if (isa<PHINode>(I)) {
1525 // PHI nodes are more difficult than other nodes because they actually
1526 // "use" the value in the predecessor basic blocks they correspond to.
1527 BasicBlock *PredBB = dyn_cast<BasicBlock>(I.getOperand(i+1));
1528 Assert2(PredBB && (DT->dominates(OpBlock, PredBB) ||
1529 !DT->isReachableFromEntry(PredBB)),
1530 "Instruction does not dominate all uses!", Op, &I);
1532 if (OpBlock == BB) {
1533 // If they are in the same basic block, make sure that the definition
1534 // comes before the use.
1535 Assert2(InstsInThisBlock.count(Op) || !DT->isReachableFromEntry(BB),
1536 "Instruction does not dominate all uses!", Op, &I);
1539 // Definition must dominate use unless use is unreachable!
1540 Assert2(InstsInThisBlock.count(Op) || DT->dominates(Op, &I) ||
1541 !DT->isReachableFromEntry(BB),
1542 "Instruction does not dominate all uses!", Op, &I);
1544 } else if (isa<InlineAsm>(I.getOperand(i))) {
1545 Assert1((i + 1 == e && isa<CallInst>(I)) ||
1546 (i + 3 == e && isa<InvokeInst>(I)),
1547 "Cannot take the address of an inline asm!", &I);
1550 InstsInThisBlock.insert(&I);
1552 VerifyType(I.getType());
1555 /// VerifyType - Verify that a type is well formed.
1557 void Verifier::VerifyType(const Type *Ty) {
1558 if (!Types.insert(Ty)) return;
1560 Assert1(Context == &Ty->getContext(),
1561 "Type context does not match Module context!", Ty);
1563 switch (Ty->getTypeID()) {
1564 case Type::FunctionTyID: {
1565 const FunctionType *FTy = cast<FunctionType>(Ty);
1567 const Type *RetTy = FTy->getReturnType();
1568 Assert2(FunctionType::isValidReturnType(RetTy),
1569 "Function type with invalid return type", RetTy, FTy);
1572 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i) {
1573 const Type *ElTy = FTy->getParamType(i);
1574 Assert2(FunctionType::isValidArgumentType(ElTy),
1575 "Function type with invalid parameter type", ElTy, FTy);
1580 case Type::StructTyID: {
1581 const StructType *STy = cast<StructType>(Ty);
1582 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1583 const Type *ElTy = STy->getElementType(i);
1584 Assert2(StructType::isValidElementType(ElTy),
1585 "Structure type with invalid element type", ElTy, STy);
1590 case Type::ArrayTyID: {
1591 const ArrayType *ATy = cast<ArrayType>(Ty);
1592 Assert1(ArrayType::isValidElementType(ATy->getElementType()),
1593 "Array type with invalid element type", ATy);
1594 VerifyType(ATy->getElementType());
1597 case Type::PointerTyID: {
1598 const PointerType *PTy = cast<PointerType>(Ty);
1599 Assert1(PointerType::isValidElementType(PTy->getElementType()),
1600 "Pointer type with invalid element type", PTy);
1601 VerifyType(PTy->getElementType());
1604 case Type::VectorTyID: {
1605 const VectorType *VTy = cast<VectorType>(Ty);
1606 Assert1(VectorType::isValidElementType(VTy->getElementType()),
1607 "Vector type with invalid element type", VTy);
1608 VerifyType(VTy->getElementType());
1616 // Flags used by TableGen to mark intrinsic parameters with the
1617 // LLVMExtendedElementVectorType and LLVMTruncatedElementVectorType classes.
1618 static const unsigned ExtendedElementVectorType = 0x40000000;
1619 static const unsigned TruncatedElementVectorType = 0x20000000;
1621 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
1623 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
1624 Function *IF = CI.getCalledFunction();
1625 Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
1628 #define GET_INTRINSIC_VERIFIER
1629 #include "llvm/Intrinsics.gen"
1630 #undef GET_INTRINSIC_VERIFIER
1632 // If the intrinsic takes MDNode arguments, verify that they are either global
1633 // or are local to *this* function.
1634 for (unsigned i = 0, e = CI.getNumArgOperands(); i != e; ++i)
1635 if (MDNode *MD = dyn_cast<MDNode>(CI.getArgOperand(i)))
1636 visitMDNode(*MD, CI.getParent()->getParent());
1641 case Intrinsic::dbg_declare: { // llvm.dbg.declare
1642 Assert1(CI.getArgOperand(0) && isa<MDNode>(CI.getArgOperand(0)),
1643 "invalid llvm.dbg.declare intrinsic call 1", &CI);
1644 MDNode *MD = cast<MDNode>(CI.getArgOperand(0));
1645 Assert1(MD->getNumOperands() == 1,
1646 "invalid llvm.dbg.declare intrinsic call 2", &CI);
1648 case Intrinsic::memcpy:
1649 case Intrinsic::memmove:
1650 case Intrinsic::memset:
1651 Assert1(isa<ConstantInt>(CI.getArgOperand(3)),
1652 "alignment argument of memory intrinsics must be a constant int",
1655 case Intrinsic::gcroot:
1656 case Intrinsic::gcwrite:
1657 case Intrinsic::gcread:
1658 if (ID == Intrinsic::gcroot) {
1660 dyn_cast<AllocaInst>(CI.getArgOperand(0)->stripPointerCasts());
1661 Assert1(AI, "llvm.gcroot parameter #1 must be an alloca.", &CI);
1662 Assert1(isa<Constant>(CI.getArgOperand(1)),
1663 "llvm.gcroot parameter #2 must be a constant.", &CI);
1664 if (!AI->getType()->getElementType()->isPointerTy()) {
1665 Assert1(!isa<ConstantPointerNull>(CI.getArgOperand(1)),
1666 "llvm.gcroot parameter #1 must either be a pointer alloca, "
1667 "or argument #2 must be a non-null constant.", &CI);
1671 Assert1(CI.getParent()->getParent()->hasGC(),
1672 "Enclosing function does not use GC.", &CI);
1674 case Intrinsic::init_trampoline:
1675 Assert1(isa<Function>(CI.getArgOperand(1)->stripPointerCasts()),
1676 "llvm.init_trampoline parameter #2 must resolve to a function.",
1679 case Intrinsic::prefetch:
1680 Assert1(isa<ConstantInt>(CI.getArgOperand(1)) &&
1681 isa<ConstantInt>(CI.getArgOperand(2)) &&
1682 cast<ConstantInt>(CI.getArgOperand(1))->getZExtValue() < 2 &&
1683 cast<ConstantInt>(CI.getArgOperand(2))->getZExtValue() < 4,
1684 "invalid arguments to llvm.prefetch",
1687 case Intrinsic::stackprotector:
1688 Assert1(isa<AllocaInst>(CI.getArgOperand(1)->stripPointerCasts()),
1689 "llvm.stackprotector parameter #2 must resolve to an alloca.",
1692 case Intrinsic::lifetime_start:
1693 case Intrinsic::lifetime_end:
1694 case Intrinsic::invariant_start:
1695 Assert1(isa<ConstantInt>(CI.getArgOperand(0)),
1696 "size argument of memory use markers must be a constant integer",
1699 case Intrinsic::invariant_end:
1700 Assert1(isa<ConstantInt>(CI.getArgOperand(1)),
1701 "llvm.invariant.end parameter #2 must be a constant integer", &CI);
1706 /// Produce a string to identify an intrinsic parameter or return value.
1707 /// The ArgNo value numbers the return values from 0 to NumRets-1 and the
1708 /// parameters beginning with NumRets.
1710 static std::string IntrinsicParam(unsigned ArgNo, unsigned NumRets) {
1711 if (ArgNo >= NumRets)
1712 return "Intrinsic parameter #" + utostr(ArgNo - NumRets);
1714 return "Intrinsic result type";
1715 return "Intrinsic result type #" + utostr(ArgNo);
1718 bool Verifier::PerformTypeCheck(Intrinsic::ID ID, Function *F, const Type *Ty,
1719 int VT, unsigned ArgNo, std::string &Suffix) {
1720 const FunctionType *FTy = F->getFunctionType();
1722 unsigned NumElts = 0;
1723 const Type *EltTy = Ty;
1724 const VectorType *VTy = dyn_cast<VectorType>(Ty);
1726 EltTy = VTy->getElementType();
1727 NumElts = VTy->getNumElements();
1730 const Type *RetTy = FTy->getReturnType();
1731 const StructType *ST = dyn_cast<StructType>(RetTy);
1732 unsigned NumRetVals;
1733 if (RetTy->isVoidTy())
1736 NumRetVals = ST->getNumElements();
1743 // Check flags that indicate a type that is an integral vector type with
1744 // elements that are larger or smaller than the elements of the matched
1746 if ((Match & (ExtendedElementVectorType |
1747 TruncatedElementVectorType)) != 0) {
1748 const IntegerType *IEltTy = dyn_cast<IntegerType>(EltTy);
1749 if (!VTy || !IEltTy) {
1750 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not "
1751 "an integral vector type.", F);
1754 // Adjust the current Ty (in the opposite direction) rather than
1755 // the type being matched against.
1756 if ((Match & ExtendedElementVectorType) != 0) {
1757 if ((IEltTy->getBitWidth() & 1) != 0) {
1758 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " vector "
1759 "element bit-width is odd.", F);
1762 Ty = VectorType::getTruncatedElementVectorType(VTy);
1764 Ty = VectorType::getExtendedElementVectorType(VTy);
1765 Match &= ~(ExtendedElementVectorType | TruncatedElementVectorType);
1768 if (Match <= static_cast<int>(NumRetVals - 1)) {
1770 RetTy = ST->getElementType(Match);
1773 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " does not "
1774 "match return type.", F);
1778 if (Ty != FTy->getParamType(Match - NumRetVals)) {
1779 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " does not "
1780 "match parameter %" + utostr(Match - NumRetVals) + ".", F);
1784 } else if (VT == MVT::iAny) {
1785 if (!EltTy->isIntegerTy()) {
1786 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not "
1787 "an integer type.", F);
1791 unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
1795 Suffix += "v" + utostr(NumElts);
1797 Suffix += "i" + utostr(GotBits);
1799 // Check some constraints on various intrinsics.
1801 default: break; // Not everything needs to be checked.
1802 case Intrinsic::bswap:
1803 if (GotBits < 16 || GotBits % 16 != 0) {
1804 CheckFailed("Intrinsic requires even byte width argument", F);
1809 } else if (VT == MVT::fAny) {
1810 if (!EltTy->isFloatingPointTy()) {
1811 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not "
1812 "a floating-point type.", F);
1819 Suffix += "v" + utostr(NumElts);
1821 Suffix += EVT::getEVT(EltTy).getEVTString();
1822 } else if (VT == MVT::vAny) {
1824 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not a vector type.",
1828 Suffix += ".v" + utostr(NumElts) + EVT::getEVT(EltTy).getEVTString();
1829 } else if (VT == MVT::iPTR) {
1830 if (!Ty->isPointerTy()) {
1831 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not a "
1832 "pointer and a pointer is required.", F);
1835 } else if (VT == MVT::iPTRAny) {
1836 // Outside of TableGen, we don't distinguish iPTRAny (to any address space)
1837 // and iPTR. In the verifier, we can not distinguish which case we have so
1838 // allow either case to be legal.
1839 if (const PointerType* PTyp = dyn_cast<PointerType>(Ty)) {
1840 EVT PointeeVT = EVT::getEVT(PTyp->getElementType(), true);
1841 if (PointeeVT == MVT::Other) {
1842 CheckFailed("Intrinsic has pointer to complex type.");
1845 Suffix += ".p" + utostr(PTyp->getAddressSpace()) +
1846 PointeeVT.getEVTString();
1848 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is not a "
1849 "pointer and a pointer is required.", F);
1852 } else if (EVT((MVT::SimpleValueType)VT).isVector()) {
1853 EVT VVT = EVT((MVT::SimpleValueType)VT);
1855 // If this is a vector argument, verify the number and type of elements.
1856 if (VVT.getVectorElementType() != EVT::getEVT(EltTy)) {
1857 CheckFailed("Intrinsic prototype has incorrect vector element type!", F);
1861 if (VVT.getVectorNumElements() != NumElts) {
1862 CheckFailed("Intrinsic prototype has incorrect number of "
1863 "vector elements!", F);
1866 } else if (EVT((MVT::SimpleValueType)VT).getTypeForEVT(Ty->getContext()) !=
1868 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is wrong!", F);
1870 } else if (EltTy != Ty) {
1871 CheckFailed(IntrinsicParam(ArgNo, NumRetVals) + " is a vector "
1872 "and a scalar is required.", F);
1879 /// VerifyIntrinsicPrototype - TableGen emits calls to this function into
1880 /// Intrinsics.gen. This implements a little state machine that verifies the
1881 /// prototype of intrinsics.
1882 void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
1883 unsigned NumRetVals,
1884 unsigned NumParams, ...) {
1886 va_start(VA, NumParams);
1887 const FunctionType *FTy = F->getFunctionType();
1889 // For overloaded intrinsics, the Suffix of the function name must match the
1890 // types of the arguments. This variable keeps track of the expected
1891 // suffix, to be checked at the end.
1894 if (FTy->getNumParams() + FTy->isVarArg() != NumParams) {
1895 CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
1899 const Type *Ty = FTy->getReturnType();
1900 const StructType *ST = dyn_cast<StructType>(Ty);
1902 if (NumRetVals == 0 && !Ty->isVoidTy()) {
1903 CheckFailed("Intrinsic should return void", F);
1907 // Verify the return types.
1908 if (ST && ST->getNumElements() != NumRetVals) {
1909 CheckFailed("Intrinsic prototype has incorrect number of return types!", F);
1913 for (unsigned ArgNo = 0; ArgNo != NumRetVals; ++ArgNo) {
1914 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1916 if (ST) Ty = ST->getElementType(ArgNo);
1917 if (!PerformTypeCheck(ID, F, Ty, VT, ArgNo, Suffix))
1921 // Verify the parameter types.
1922 for (unsigned ArgNo = 0; ArgNo != NumParams; ++ArgNo) {
1923 int VT = va_arg(VA, int); // An MVT::SimpleValueType when non-negative.
1925 if (VT == MVT::isVoid && ArgNo > 0) {
1926 if (!FTy->isVarArg())
1927 CheckFailed("Intrinsic prototype has no '...'!", F);
1931 if (!PerformTypeCheck(ID, F, FTy->getParamType(ArgNo), VT,
1932 ArgNo + NumRetVals, Suffix))
1938 // For intrinsics without pointer arguments, if we computed a Suffix then the
1939 // intrinsic is overloaded and we need to make sure that the name of the
1940 // function is correct. We add the suffix to the name of the intrinsic and
1941 // compare against the given function name. If they are not the same, the
1942 // function name is invalid. This ensures that overloading of intrinsics
1943 // uses a sane and consistent naming convention. Note that intrinsics with
1944 // pointer argument may or may not be overloaded so we will check assuming it
1945 // has a suffix and not.
1946 if (!Suffix.empty()) {
1947 std::string Name(Intrinsic::getName(ID));
1948 if (Name + Suffix != F->getName()) {
1949 CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
1950 F->getName().substr(Name.length()) + "'. It should be '" +
1955 // Check parameter attributes.
1956 Assert1(F->getAttributes() == Intrinsic::getAttributes(ID),
1957 "Intrinsic has wrong parameter attributes!", F);
1961 //===----------------------------------------------------------------------===//
1962 // Implement the public interfaces to this file...
1963 //===----------------------------------------------------------------------===//
1965 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
1966 return new Verifier(action);
1970 /// verifyFunction - Check a function for errors, printing messages on stderr.
1971 /// Return true if the function is corrupt.
1973 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
1974 Function &F = const_cast<Function&>(f);
1975 assert(!F.isDeclaration() && "Cannot verify external functions");
1977 FunctionPassManager FPM(F.getParent());
1978 Verifier *V = new Verifier(action);
1984 /// verifyModule - Check a module for errors, printing messages on stderr.
1985 /// Return true if the module is corrupt.
1987 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
1988 std::string *ErrorInfo) {
1990 Verifier *V = new Verifier(action);
1992 PM.run(const_cast<Module&>(M));
1994 if (ErrorInfo && V->Broken)
1995 *ErrorInfo = V->MessagesStr.str();