1 //===-- Verifier.cpp - Implement the Module Verifier -------------*- C++ -*-==//
3 // This file defines the method 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 // . There are no duplicated names in a symbol table... ie there !exist a val
10 // with the same name as something in the symbol table, but with a different
11 // address as what is in the symbol table...
12 // . Both of a binary operator's parameters are the same type
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 // . Right now 'add bool 0, 0' is valid. This isn't particularly good.
18 // . Only phi nodes can be self referential: 'add int 0, 0 ; <int>:0' is bad
19 // . PHI nodes must have an entry for each predecessor, with no extras.
20 // . All other things that are tested by asserts spread about the code...
21 // . All basic blocks should only end with terminator insts, not contain them
22 // . All methods must have >= 1 basic block
23 // . Verify that none of the Def getType()'s are null.
24 // . Method's cannot take a void typed parameter
25 // . Verify that a method's argument list agrees with it's declared type.
26 // . Verify that arrays and structures have fixed elements: No unsized arrays.
28 //===----------------------------------------------------------------------===//
30 #include "llvm/Analysis/Verifier.h"
31 #include "llvm/Method.h"
32 #include "llvm/Module.h"
33 #include "llvm/BasicBlock.h"
34 #include "llvm/Type.h"
36 // Error - Define a macro to do the common task of pushing a message onto the
37 // end of the error list and setting Bad to true.
39 #define Error(msg) do { ErrorMsgs.push_back(msg); Bad = true; } while (0)
41 #define t(x) (1 << (unsigned)Type::x)
43 #define SignedIntegralTypes (t(SByteTyID) | t(ShortTyID) | \
44 t(IntTyID) | t(LongTyID))
45 static long UnsignedIntegralTypes = t(UByteTyID) | t(UShortTyID) |
46 t(UIntTyID) | t(ULongTyID);
47 static const long FloatingPointTypes = t(FloatTyID) | t(DoubleTyID);
49 static const long IntegralTypes = SignedIntegralTypes | UnsignedIntegralTypes;
52 static long ValidTypes[Type::FirstDerivedTyID] = {
53 [(unsigned)Instruction::UnaryOps::Not] t(BoolTyID),
54 //[Instruction::UnaryOps::Add] = IntegralTypes,
55 // [Instruction::Sub] = IntegralTypes,
61 static bool verify(const BasicBlock *BB, vector<string> &ErrorMsgs) {
63 if (BB->getTerminator() == 0) Error("Basic Block does not have terminator!");
70 bool verify(const Method *M, vector<string> &ErrorMsgs) {
73 for (Method::const_iterator BBIt = M->begin();
74 BBIt != M->end(); ++BBIt)
75 Bad |= verify(*BBIt, ErrorMsgs);
80 bool verify(const Module *C, vector<string> &ErrorMsgs) {
82 assert(Type::FirstDerivedTyID-1 < sizeof(long)*8 &&
83 "Resize ValidTypes table to handle more than 32 primitive types!");
85 for (Module::const_iterator MI = C->begin(); MI != C->end(); ++MI)
86 Bad |= verify(*MI, ErrorMsgs);