1 //===-- Verifier.cpp - Implement the Module Verifier -------------*- C++ -*-==//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source 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 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 int %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 // . Function's 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/Assembly/Writer.h"
44 #include "llvm/Pass.h"
45 #include "llvm/Module.h"
46 #include "llvm/DerivedTypes.h"
47 #include "llvm/iPHINode.h"
48 #include "llvm/iTerminators.h"
49 #include "llvm/iOther.h"
50 #include "llvm/iOperators.h"
51 #include "llvm/iMemory.h"
52 #include "llvm/SymbolTable.h"
53 #include "llvm/PassManager.h"
54 #include "llvm/Intrinsics.h"
55 #include "llvm/Analysis/Dominators.h"
56 #include "llvm/Support/CFG.h"
57 #include "llvm/Support/InstVisitor.h"
58 #include "Support/STLExtras.h"
63 namespace { // Anonymous namespace for class
65 struct Verifier : public FunctionPass, InstVisitor<Verifier> {
66 bool Broken; // Is this module found to be broken?
67 bool RealPass; // Are we not being run by a PassManager?
68 bool AbortBroken; // If broken, should it or should it not abort?
69 Module *Mod; // Module we are verifying right now
70 DominatorSet *DS; // Dominator set, caution can be null!
72 Verifier() : Broken(false), RealPass(true), AbortBroken(true), DS(0) {}
73 Verifier(bool AB) : Broken(false), RealPass(true), AbortBroken(AB), DS(0) {}
74 Verifier(DominatorSet &ds)
75 : Broken(false), RealPass(false), AbortBroken(false), DS(&ds) {}
78 bool doInitialization(Module &M) {
80 verifySymbolTable(M.getSymbolTable());
82 // If this is a real pass, in a pass manager, we must abort before
83 // returning back to the pass manager, or else the pass manager may try to
84 // run other passes on the broken module.
91 bool runOnFunction(Function &F) {
92 // Get dominator information if we are being run by PassManager
93 if (RealPass) DS = &getAnalysis<DominatorSet>();
96 // If this is a real pass, in a pass manager, we must abort before
97 // returning back to the pass manager, or else the pass manager may try to
98 // run other passes on the broken module.
106 bool doFinalization(Module &M) {
107 // Scan through, checking all of the external function's linkage now...
108 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
109 visitGlobalValue(*I);
111 for (Module::giterator I = M.gbegin(), E = M.gend(); I != E; ++I)
112 if (I->isExternal() && I->hasInternalLinkage())
113 CheckFailed("Global Variable is external with internal linkage!", I);
115 // If the module is broken, abort at this time.
120 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
121 AU.setPreservesAll();
123 AU.addRequired<DominatorSet>();
126 // abortIfBroken - If the module is broken and we are supposed to abort on
127 // this condition, do so.
129 void abortIfBroken() const {
130 if (Broken && AbortBroken) {
131 std::cerr << "Broken module found, compilation aborted!\n";
137 // Verification methods...
138 void verifySymbolTable(SymbolTable &ST);
139 void visitGlobalValue(GlobalValue &GV);
140 void visitFunction(Function &F);
141 void visitBasicBlock(BasicBlock &BB);
142 void visitPHINode(PHINode &PN);
143 void visitBinaryOperator(BinaryOperator &B);
144 void visitShiftInst(ShiftInst &SI);
145 void visitVANextInst(VANextInst &VAN) { visitInstruction(VAN); }
146 void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
147 void visitCallInst(CallInst &CI);
148 void visitGetElementPtrInst(GetElementPtrInst &GEP);
149 void visitLoadInst(LoadInst &LI);
150 void visitStoreInst(StoreInst &SI);
151 void visitInstruction(Instruction &I);
152 void visitTerminatorInst(TerminatorInst &I);
153 void visitReturnInst(ReturnInst &RI);
154 void visitUserOp1(Instruction &I);
155 void visitUserOp2(Instruction &I) { visitUserOp1(I); }
156 void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
159 void WriteValue(const Value *V) {
161 if (isa<Instruction>(V))
164 WriteAsOperand (std::cerr, V, true, true, Mod);
170 // CheckFailed - A check failed, so print out the condition and the message
171 // that failed. This provides a nice place to put a breakpoint if you want
172 // to see why something is not correct.
174 void CheckFailed(const std::string &Message,
175 const Value *V1 = 0, const Value *V2 = 0,
176 const Value *V3 = 0, const Value *V4 = 0) {
177 std::cerr << Message << "\n";
186 RegisterOpt<Verifier> X("verify", "Module Verifier");
188 // Assert - We know that cond should be true, if not print an error message.
189 #define Assert(C, M) \
190 do { if (!(C)) { CheckFailed(M); return; } } while (0)
191 #define Assert1(C, M, V1) \
192 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
193 #define Assert2(C, M, V1, V2) \
194 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
195 #define Assert3(C, M, V1, V2, V3) \
196 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
197 #define Assert4(C, M, V1, V2, V3, V4) \
198 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
201 void Verifier::visitGlobalValue(GlobalValue &GV) {
202 Assert1(!GV.isExternal() || GV.hasExternalLinkage(),
203 "Global value has Internal Linkage!", &GV);
204 Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
205 "Only global variables can have appending linkage!", &GV);
207 if (GV.hasAppendingLinkage()) {
208 GlobalVariable &GVar = cast<GlobalVariable>(GV);
209 Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
210 "Only global arrays can have appending linkage!", &GV);
214 // verifySymbolTable - Verify that a function or module symbol table is ok
216 void Verifier::verifySymbolTable(SymbolTable &ST) {
217 // Loop over all of the types in the symbol table...
218 for (SymbolTable::iterator TI = ST.begin(), TE = ST.end(); TI != TE; ++TI)
219 for (SymbolTable::type_iterator I = TI->second.begin(),
220 E = TI->second.end(); I != E; ++I) {
221 Value *V = I->second;
223 // Check that there are no void typed values in the symbol table. Values
224 // with a void type cannot be put into symbol tables because they cannot
226 Assert1(V->getType() != Type::VoidTy,
227 "Values with void type are not allowed to have names!", V);
232 // visitFunction - Verify that a function is ok.
234 void Verifier::visitFunction(Function &F) {
235 // Check function arguments...
236 const FunctionType *FT = F.getFunctionType();
237 unsigned NumArgs = F.getArgumentList().size();
239 Assert2(FT->getNumParams() == NumArgs,
240 "# formal arguments must match # of arguments for function type!",
243 // Check that the argument values match the function type for this function...
245 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I, ++i)
246 Assert2(I->getType() == FT->getParamType(i),
247 "Argument value does not match function argument type!",
248 I, FT->getParamType(i));
250 if (!F.isExternal()) {
251 verifySymbolTable(F.getSymbolTable());
253 // Check the entry node
254 BasicBlock *Entry = &F.getEntryBlock();
255 Assert1(pred_begin(Entry) == pred_end(Entry),
256 "Entry block to function must not have predecessors!", Entry);
261 // verifyBasicBlock - Verify that a basic block is well formed...
263 void Verifier::visitBasicBlock(BasicBlock &BB) {
264 // Check constraints that this basic block imposes on all of the PHI nodes in
266 if (isa<PHINode>(BB.front())) {
267 std::vector<BasicBlock*> Preds(pred_begin(&BB), pred_end(&BB));
268 std::sort(Preds.begin(), Preds.end());
270 for (BasicBlock::iterator I = BB.begin();
271 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
273 // Ensure that PHI nodes have at least one entry!
274 Assert1(PN->getNumIncomingValues() != 0,
275 "PHI nodes must have at least one entry. If the block is dead, "
276 "the PHI should be removed!", PN);
277 Assert1(PN->getNumIncomingValues() >= Preds.size(),
278 "PHINode has more entries than the basic block has predecessors!",
280 Assert1(PN->getNumIncomingValues() <= Preds.size(),
281 "PHINode has less entries than the basic block has predecessors!",
284 // Get and sort all incoming values in the PHI node...
285 std::vector<std::pair<BasicBlock*, Value*> > Values;
286 Values.reserve(PN->getNumIncomingValues());
287 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
288 Values.push_back(std::make_pair(PN->getIncomingBlock(i),
289 PN->getIncomingValue(i)));
290 std::sort(Values.begin(), Values.end());
292 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
293 // Check to make sure that if there is more than one entry for a
294 // particular basic block in this PHI node, that the incoming values are
297 Assert4(i == 0 || Values[i].first != Values[i-1].first ||
298 Values[i].second == Values[i-1].second,
299 "PHI node has multiple entries for the same basic block with "
300 "different incoming values!", PN, Values[i].first,
301 Values[i].second, Values[i-1].second);
303 // Check to make sure that the predecessors and PHI node entries are
305 Assert3(Values[i].first == Preds[i],
306 "PHI node entries do not match predecessors!", PN,
307 Values[i].first, Preds[i]);
312 // Ensure that basic blocks have terminators!
313 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
316 void Verifier::visitTerminatorInst(TerminatorInst &I) {
317 // Ensure that terminators only exist at the end of the basic block.
318 Assert1(&I == I.getParent()->getTerminator(),
319 "Terminator found in the middle of a basic block!", I.getParent());
323 void Verifier::visitReturnInst(ReturnInst &RI) {
324 Function *F = RI.getParent()->getParent();
325 if (RI.getNumOperands() == 0)
326 Assert1(F->getReturnType() == Type::VoidTy,
327 "Function returns no value, but ret instruction found that does!",
330 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
331 "Function return type does not match operand "
332 "type of return inst!", &RI, F->getReturnType());
334 // Check to make sure that the return value has necessary properties for
336 visitTerminatorInst(RI);
339 // visitUserOp1 - User defined operators shouldn't live beyond the lifetime of a
340 // pass, if any exist, it's an error.
342 void Verifier::visitUserOp1(Instruction &I) {
343 Assert1(0, "User-defined operators should not live outside of a pass!",
347 // visitPHINode - Ensure that a PHI node is well formed.
348 void Verifier::visitPHINode(PHINode &PN) {
349 // Ensure that the PHI nodes are all grouped together at the top of the block.
350 // This can be tested by checking whether the instruction before this is
351 // either nonexistent (because this is begin()) or is a PHI node. If not,
352 // then there is some other instruction before a PHI.
353 Assert2(&PN.getParent()->front() == &PN || isa<PHINode>(PN.getPrev()),
354 "PHI nodes not grouped at top of basic block!",
355 &PN, PN.getParent());
357 // Check that all of the operands of the PHI node have the same type as the
359 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
360 Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
361 "PHI node operands are not the same type as the result!", &PN);
363 // All other PHI node constraints are checked in the visitBasicBlock method.
365 visitInstruction(PN);
368 void Verifier::visitCallInst(CallInst &CI) {
369 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
370 "Called function must be a pointer!", &CI);
371 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
372 Assert1(isa<FunctionType>(FPTy->getElementType()),
373 "Called function is not pointer to function type!", &CI);
375 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
377 // Verify that the correct number of arguments are being passed
379 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
380 "Called function requires more parameters than were provided!",&CI);
382 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
383 "Incorrect number of arguments passed to called function!", &CI);
385 // Verify that all arguments to the call match the function type...
386 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
387 Assert2(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
388 "Call parameter type does not match function signature!",
389 CI.getOperand(i+1), FTy->getParamType(i));
391 if (Function *F = CI.getCalledFunction())
392 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
393 visitIntrinsicFunctionCall(ID, CI);
395 visitInstruction(CI);
398 // visitBinaryOperator - Check that both arguments to the binary operator are
401 void Verifier::visitBinaryOperator(BinaryOperator &B) {
402 Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
403 "Both operands to a binary operator are not of the same type!", &B);
405 // Check that logical operators are only used with integral operands.
406 if (B.getOpcode() == Instruction::And || B.getOpcode() == Instruction::Or ||
407 B.getOpcode() == Instruction::Xor) {
408 Assert1(B.getType()->isIntegral(),
409 "Logical operators only work with integral types!", &B);
410 Assert1(B.getType() == B.getOperand(0)->getType(),
411 "Logical operators must have same type for operands and result!",
413 } else if (isa<SetCondInst>(B)) {
414 // Check that setcc instructions return bool
415 Assert1(B.getType() == Type::BoolTy,
416 "setcc instructions must return boolean values!", &B);
418 // Arithmetic operators only work on integer or fp values
419 Assert1(B.getType() == B.getOperand(0)->getType(),
420 "Arithmetic operators must have same type for operands and result!",
422 Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint(),
423 "Arithmetic operators must have integer or fp type!", &B);
429 void Verifier::visitShiftInst(ShiftInst &SI) {
430 Assert1(SI.getType()->isInteger(),
431 "Shift must return an integer result!", &SI);
432 Assert1(SI.getType() == SI.getOperand(0)->getType(),
433 "Shift return type must be same as first operand!", &SI);
434 Assert1(SI.getOperand(1)->getType() == Type::UByteTy,
435 "Second operand to shift must be ubyte type!", &SI);
436 visitInstruction(SI);
439 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
441 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
442 std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true);
443 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
444 Assert2(PointerType::get(ElTy) == GEP.getType(),
445 "GEP is not of right type for indices!", &GEP, ElTy);
446 visitInstruction(GEP);
449 void Verifier::visitLoadInst(LoadInst &LI) {
451 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
452 Assert2(ElTy == LI.getType(),
453 "Load result type does not match pointer operand type!", &LI, ElTy);
454 visitInstruction(LI);
457 void Verifier::visitStoreInst(StoreInst &SI) {
459 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
460 Assert2(ElTy == SI.getOperand(0)->getType(),
461 "Stored value type does not match pointer operand type!", &SI, ElTy);
462 visitInstruction(SI);
466 // verifyInstruction - Verify that an instruction is well formed.
468 void Verifier::visitInstruction(Instruction &I) {
469 BasicBlock *BB = I.getParent();
470 Assert1(BB, "Instruction not embedded in basic block!", &I);
472 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
473 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
475 Assert1(*UI != (User*)&I,
476 "Only PHI nodes may reference their own value!", &I);
479 // Check that void typed values don't have names
480 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
481 "Instruction has a name, but provides a void value!", &I);
483 // Check that all uses of the instruction, if they are instructions
484 // themselves, actually have parent basic blocks. If the use is not an
485 // instruction, it is an error!
487 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
489 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
491 Instruction *Used = cast<Instruction>(*UI);
492 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
493 " embeded in a basic block!", &I, Used);
496 for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
497 // Check to make sure that the "address of" an intrinsic function is never
499 if (Function *F = dyn_cast<Function>(I.getOperand(i)))
500 Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
501 "Cannot take the address of an intrinsic!", &I);
503 else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
504 // Check that a definition dominates all of its uses.
506 if (!isa<PHINode>(I)) {
507 // Definition must dominate use unless use is unreachable!
508 Assert2(DS->dominates(Op->getParent(), BB) ||
509 !DS->dominates(&BB->getParent()->getEntryBlock(), BB),
510 "Instruction does not dominate all uses!", Op, &I);
512 // PHI nodes are more difficult than other nodes because they actually
513 // "use" the value in the predecessor basic blocks they correspond to.
514 BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
515 Assert2(DS->dominates(Op->getParent(), PredBB) ||
516 !DS->dominates(&BB->getParent()->getEntryBlock(), PredBB),
517 "Instruction does not dominate all uses!", Op, &I);
523 /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
524 void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
525 Function *IF = CI.getCalledFunction();
526 const FunctionType *FT = IF->getFunctionType();
527 Assert1(IF->isExternal(), "Intrinsic functions should never be defined!", IF);
528 unsigned NumArgs = 0;
530 // FIXME: this should check the return type of each intrinsic as well, also
533 case Intrinsic::va_start:
534 Assert1(CI.getParent()->getParent()->getFunctionType()->isVarArg(),
535 "llvm.va_start intrinsic may only occur in function with variable"
539 case Intrinsic::va_end: NumArgs = 1; break;
540 case Intrinsic::va_copy: NumArgs = 1; break;
542 case Intrinsic::setjmp: NumArgs = 1; break;
543 case Intrinsic::longjmp: NumArgs = 2; break;
544 case Intrinsic::sigsetjmp: NumArgs = 2; break;
545 case Intrinsic::siglongjmp: NumArgs = 2; break;
547 case Intrinsic::alpha_ctlz: NumArgs = 1; break;
548 case Intrinsic::alpha_cttz: NumArgs = 1; break;
549 case Intrinsic::alpha_ctpop: NumArgs = 1; break;
550 case Intrinsic::alpha_umulh: NumArgs = 2; break;
551 case Intrinsic::alpha_vecop: NumArgs = 4; break;
552 case Intrinsic::alpha_pup: NumArgs = 3; break;
553 case Intrinsic::alpha_bytezap: NumArgs = 2; break;
554 case Intrinsic::alpha_bytemanip: NumArgs = 3; break;
555 case Intrinsic::alpha_dfpbop: NumArgs = 3; break;
556 case Intrinsic::alpha_dfpuop: NumArgs = 2; break;
557 case Intrinsic::alpha_unordered: NumArgs = 2; break;
558 case Intrinsic::alpha_uqtodfp: NumArgs = 2; break;
559 case Intrinsic::alpha_uqtosfp: NumArgs = 2; break;
560 case Intrinsic::alpha_dfptosq: NumArgs = 2; break;
561 case Intrinsic::alpha_sfptosq: NumArgs = 2; break;
563 case Intrinsic::not_intrinsic:
564 assert(0 && "Invalid intrinsic!"); NumArgs = 0; break;
567 Assert1(FT->getNumParams() == NumArgs || (FT->getNumParams() < NumArgs &&
569 "Illegal # arguments for intrinsic function!", IF);
572 } // End anonymous namespace
574 //===----------------------------------------------------------------------===//
575 // Implement the public interfaces to this file...
576 //===----------------------------------------------------------------------===//
578 FunctionPass *createVerifierPass() {
579 return new Verifier();
583 // verifyFunction - Create
584 bool verifyFunction(const Function &f) {
585 Function &F = (Function&)f;
586 assert(!F.isExternal() && "Cannot verify external functions");
589 DS.doInitialization(*F.getParent());
595 DS.doFinalization(*F.getParent());
600 // verifyModule - Check a module for errors, printing messages on stderr.
601 // Return true if the module is corrupt.
603 bool verifyModule(const Module &M) {
605 Verifier *V = new Verifier();
611 } // End llvm namespace