1 //===-- Verifier.cpp - Implement the Module Verifier -------------*- C++ -*-==//
3 // This file defines the function verifier interface, that can be used for some
4 // sanity checking of input to the system.
6 // Note that this does not provide full 'java style' security and verifications,
7 // instead it just tries to ensure that code is well formed.
9 // * Both of a binary operator's parameters are the same type
10 // * Verify that the indices of mem access instructions match other operands
11 // . Verify that arithmetic and other things are only performed on first class
12 // types. Verify that shifts & logicals only happen on integrals f.e.
13 // . All of the constants in a switch statement are of the correct type
14 // * The code is in valid SSA form
15 // . It should be illegal to put a label into any other type (like a structure)
16 // or to return one. [except constant arrays!]
17 // * Only phi nodes can be self referential: 'add int %0, %0 ; <int>:0' is bad
18 // * PHI nodes must have an entry for each predecessor, with no extras.
19 // * PHI nodes must be the first thing in a basic block, all grouped together
20 // * All basic blocks should only end with terminator insts, not contain them
21 // * The entry node to a function must not have predecessors
22 // * All Instructions must be embeded into a basic block
23 // . Function's cannot take a void typed parameter
24 // * Verify that a function's argument list agrees with it's declared type.
25 // . Verify that arrays and structures have fixed elements: No unsized arrays.
26 // * It is illegal to specify a name for a void value.
27 // * It is illegal to have a internal function that is just a declaration
28 // * It is illegal to have a ret instruction that returns a value that does not
29 // agree with the function return value type.
30 // * Function call argument types match the function prototype
31 // * All other things that are tested by asserts spread about the code...
33 //===----------------------------------------------------------------------===//
35 #include "llvm/Analysis/Verifier.h"
36 #include "llvm/Pass.h"
37 #include "llvm/Module.h"
38 #include "llvm/DerivedTypes.h"
39 #include "llvm/iPHINode.h"
40 #include "llvm/iTerminators.h"
41 #include "llvm/iOther.h"
42 #include "llvm/iMemory.h"
43 #include "llvm/SymbolTable.h"
44 #include "llvm/PassManager.h"
45 #include "llvm/Analysis/Dominators.h"
46 #include "llvm/Support/CFG.h"
47 #include "llvm/Support/InstVisitor.h"
48 #include "Support/STLExtras.h"
52 namespace { // Anonymous namespace for class
54 struct Verifier : public FunctionPass, InstVisitor<Verifier> {
55 bool Broken; // Is this module found to be broken?
56 bool RealPass; // Are we not being run by a PassManager?
57 bool AbortBroken; // If broken, should it or should it not abort?
59 DominatorSet *DS; // Dominator set, caution can be null!
61 Verifier() : Broken(false), RealPass(true), AbortBroken(true), DS(0) {}
62 Verifier(bool AB) : Broken(false), RealPass(true), AbortBroken(AB), DS(0) {}
63 Verifier(DominatorSet &ds)
64 : Broken(false), RealPass(false), AbortBroken(false), DS(&ds) {}
67 bool doInitialization(Module &M) {
68 verifySymbolTable(M.getSymbolTable());
72 bool runOnFunction(Function &F) {
73 // Get dominator information if we are being run by PassManager
74 if (RealPass) DS = &getAnalysis<DominatorSet>();
79 bool doFinalization(Module &M) {
80 // Scan through, checking all of the external function's linkage now...
81 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
82 if (I->isExternal() && I->hasInternalLinkage())
83 CheckFailed("Function Declaration has Internal Linkage!", I);
85 if (Broken && AbortBroken) {
86 std::cerr << "Broken module found, compilation aborted!\n";
92 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
95 AU.addRequired<DominatorSet>();
98 // Verification methods...
99 void verifySymbolTable(SymbolTable *ST);
100 void visitFunction(Function &F);
101 void visitBasicBlock(BasicBlock &BB);
102 void visitPHINode(PHINode &PN);
103 void visitBinaryOperator(BinaryOperator &B);
104 void visitCallInst(CallInst &CI);
105 void visitGetElementPtrInst(GetElementPtrInst &GEP);
106 void visitLoadInst(LoadInst &LI);
107 void visitStoreInst(StoreInst &SI);
108 void visitInstruction(Instruction &I);
109 void visitTerminatorInst(TerminatorInst &I);
110 void visitReturnInst(ReturnInst &RI);
112 // CheckFailed - A check failed, so print out the condition and the message
113 // that failed. This provides a nice place to put a breakpoint if you want
114 // to see why something is not correct.
116 inline void CheckFailed(const std::string &Message,
117 const Value *V1 = 0, const Value *V2 = 0,
118 const Value *V3 = 0, const Value *V4 = 0) {
119 std::cerr << Message << "\n";
120 if (V1) std::cerr << *V1 << "\n";
121 if (V2) std::cerr << *V2 << "\n";
122 if (V3) std::cerr << *V3 << "\n";
123 if (V4) std::cerr << *V4 << "\n";
128 RegisterPass<Verifier> X("verify", "Module Verifier");
131 // Assert - We know that cond should be true, if not print an error message.
132 #define Assert(C, M) \
133 do { if (!(C)) { CheckFailed(M); return; } } while (0)
134 #define Assert1(C, M, V1) \
135 do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
136 #define Assert2(C, M, V1, V2) \
137 do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
138 #define Assert3(C, M, V1, V2, V3) \
139 do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
140 #define Assert4(C, M, V1, V2, V3, V4) \
141 do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
144 // verifySymbolTable - Verify that a function or module symbol table is ok
146 void Verifier::verifySymbolTable(SymbolTable *ST) {
147 if (ST == 0) return; // No symbol table to process
149 // Loop over all of the types in the symbol table...
150 for (SymbolTable::iterator TI = ST->begin(), TE = ST->end(); TI != TE; ++TI)
151 for (SymbolTable::type_iterator I = TI->second.begin(),
152 E = TI->second.end(); I != E; ++I) {
153 Value *V = I->second;
155 // Check that there are no void typed values in the symbol table. Values
156 // with a void type cannot be put into symbol tables because they cannot
158 Assert1(V->getType() != Type::VoidTy,
159 "Values with void type are not allowed to have names!", V);
164 // visitFunction - Verify that a function is ok.
166 void Verifier::visitFunction(Function &F) {
167 if (F.isExternal()) return;
169 verifySymbolTable(F.getSymbolTable());
171 // Check function arguments...
172 const FunctionType *FT = F.getFunctionType();
173 unsigned NumArgs = F.getArgumentList().size();
175 Assert2(!FT->isVarArg(), "Cannot define varargs functions in LLVM!", &F, FT);
176 Assert2(FT->getParamTypes().size() == NumArgs,
177 "# formal arguments must match # of arguments for function type!",
180 // Check that the argument values match the function type for this function...
181 if (FT->getParamTypes().size() == NumArgs) {
183 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I, ++i)
184 Assert2(I->getType() == FT->getParamType(i),
185 "Argument value does not match function argument type!",
186 I, FT->getParamType(i));
189 // Check the entry node
190 BasicBlock *Entry = &F.getEntryNode();
191 Assert1(pred_begin(Entry) == pred_end(Entry),
192 "Entry block to function must not have predecessors!", Entry);
196 // verifyBasicBlock - Verify that a basic block is well formed...
198 void Verifier::visitBasicBlock(BasicBlock &BB) {
199 // Ensure that basic blocks have terminators!
200 Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
203 void Verifier::visitTerminatorInst(TerminatorInst &I) {
204 // Ensure that terminators only exist at the end of the basic block.
205 Assert1(&I == I.getParent()->getTerminator(),
206 "Terminator found in the middle of a basic block!", I.getParent());
210 void Verifier::visitReturnInst(ReturnInst &RI) {
211 Function *F = RI.getParent()->getParent();
212 if (RI.getNumOperands() == 0)
213 Assert1(F->getReturnType() == Type::VoidTy,
214 "Function returns no value, but ret instruction found that does!",
217 Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
218 "Function return type does not match operand "
219 "type of return inst!", &RI, F->getReturnType());
221 // Check to make sure that the return value has neccesary properties for
223 visitTerminatorInst(RI);
227 // visitPHINode - Ensure that a PHI node is well formed.
228 void Verifier::visitPHINode(PHINode &PN) {
229 // Ensure that the PHI nodes are all grouped together at the top of the block.
230 // This can be tested by checking whether the instruction before this is
231 // either nonexistant (because this is begin()) or is a PHI node. If not,
232 // then there is some other instruction before a PHI.
233 Assert2(PN.getPrev() == 0 || isa<PHINode>(PN.getPrev()),
234 "PHI nodes not grouped at top of basic block!",
235 &PN, PN.getParent());
237 std::vector<BasicBlock*> Preds(pred_begin(PN.getParent()),
238 pred_end(PN.getParent()));
239 // Loop over all of the incoming values, make sure that there are
240 // predecessors for each one...
242 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
243 // Make sure all of the incoming values are the right types...
244 Assert2(PN.getType() == PN.getIncomingValue(i)->getType(),
245 "PHI node argument type does not agree with PHI node type!",
246 &PN, PN.getIncomingValue(i));
248 BasicBlock *BB = PN.getIncomingBlock(i);
249 std::vector<BasicBlock*>::iterator PI =
250 find(Preds.begin(), Preds.end(), BB);
251 Assert2(PI != Preds.end(), "PHI node has entry for basic block that"
252 " is not a predecessor!", &PN, BB);
256 // There should be no entries left in the predecessor list...
257 for (std::vector<BasicBlock*>::iterator I = Preds.begin(),
258 E = Preds.end(); I != E; ++I)
259 Assert2(0, "PHI node does not have entry for a predecessor basic block!",
262 // Now we go through and check to make sure that if there is more than one
263 // entry for a particular basic block in this PHI node, that the incoming
264 // values are all identical.
266 std::vector<std::pair<BasicBlock*, Value*> > Values;
267 Values.reserve(PN.getNumIncomingValues());
268 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
269 Values.push_back(std::make_pair(PN.getIncomingBlock(i),
270 PN.getIncomingValue(i)));
272 // Sort the Values vector so that identical basic block entries are adjacent.
273 std::sort(Values.begin(), Values.end());
275 // Check for identical basic blocks with differing incoming values...
276 for (unsigned i = 1, e = PN.getNumIncomingValues(); i < e; ++i)
277 Assert4(Values[i].first != Values[i-1].first ||
278 Values[i].second == Values[i-1].second,
279 "PHI node has multiple entries for the same basic block with "
280 "different incoming values!", &PN, Values[i].first,
281 Values[i].second, Values[i-1].second);
283 visitInstruction(PN);
286 void Verifier::visitCallInst(CallInst &CI) {
287 Assert1(isa<PointerType>(CI.getOperand(0)->getType()),
288 "Called function must be a pointer!", &CI);
289 const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType());
290 Assert1(isa<FunctionType>(FPTy->getElementType()),
291 "Called function is not pointer to function type!", &CI);
293 const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
295 // Verify that the correct number of arguments are being passed
297 Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(),
298 "Called function requires more parameters than were provided!",&CI);
300 Assert1(CI.getNumOperands()-1 == FTy->getNumParams(),
301 "Incorrect number of arguments passed to called function!", &CI);
303 // Verify that all arguments to the call match the function type...
304 for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
305 Assert2(CI.getOperand(i+1)->getType() == FTy->getParamType(i),
306 "Call parameter type does not match function signature!",
307 CI.getOperand(i+1), FTy->getParamType(i));
309 visitInstruction(CI);
312 // visitBinaryOperator - Check that both arguments to the binary operator are
315 void Verifier::visitBinaryOperator(BinaryOperator &B) {
316 Assert2(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
317 "Both operands to a binary operator are not of the same type!",
318 B.getOperand(0), B.getOperand(1));
323 void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
325 GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
326 std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true);
327 Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
328 Assert2(PointerType::get(ElTy) == GEP.getType(),
329 "GEP is not of right type for indices!", &GEP, ElTy);
330 visitInstruction(GEP);
333 void Verifier::visitLoadInst(LoadInst &LI) {
335 cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
336 Assert2(ElTy == LI.getType(),
337 "Load is not of right type for indices!", &LI, ElTy);
338 visitInstruction(LI);
341 void Verifier::visitStoreInst(StoreInst &SI) {
343 cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
344 Assert2(ElTy == SI.getOperand(0)->getType(),
345 "Stored value is not of right type for indices!", &SI, ElTy);
346 visitInstruction(SI);
350 // verifyInstruction - Verify that an instruction is well formed.
352 void Verifier::visitInstruction(Instruction &I) {
353 Assert1(I.getParent(), "Instruction not embedded in basic block!", &I);
355 // Check that all uses of the instruction, if they are instructions
356 // themselves, actually have parent basic blocks. If the use is not an
357 // instruction, it is an error!
359 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
361 Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
363 Instruction *Used = cast<Instruction>(*UI);
364 Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
365 " embeded in a basic block!", &I, Used);
368 if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
369 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
371 Assert1(*UI != (User*)&I,
372 "Only PHI nodes may reference their own value!", &I);
375 // Check that void typed values don't have names
376 Assert1(I.getType() != Type::VoidTy || !I.hasName(),
377 "Instruction has a name, but provides a void value!", &I);
379 // Check that a definition dominates all of its uses.
381 for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
383 Instruction *Use = cast<Instruction>(*UI);
385 // PHI nodes are more difficult than other nodes because they actually
386 // "use" the value in the predecessor basic blocks they correspond to.
387 if (PHINode *PN = dyn_cast<PHINode>(Use)) {
388 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
389 if (&I == PN->getIncomingValue(i)) {
390 // Make sure that I dominates the end of pred(i)
391 BasicBlock *Pred = PN->getIncomingBlock(i);
393 Assert2(DS->dominates(I.getParent(), Pred),
394 "Instruction does not dominate all uses!",
399 Assert2(DS->dominates(&I, Use),
400 "Instruction does not dominate all uses!", &I, Use);
406 //===----------------------------------------------------------------------===//
407 // Implement the public interfaces to this file...
408 //===----------------------------------------------------------------------===//
410 Pass *createVerifierPass() {
411 return new Verifier();
415 // verifyFunction - Create
416 bool verifyFunction(const Function &f) {
417 Function &F = (Function&)f;
418 assert(!F.isExternal() && "Cannot verify external functions");
421 DS.doInitialization(*F.getParent());
427 DS.doFinalization(*F.getParent());
432 // verifyModule - Check a module for errors, printing messages on stderr.
433 // Return true if the module is corrupt.
435 bool verifyModule(const Module &M) {
437 Verifier *V = new Verifier();