Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1 | //===-- Verifier.cpp - Implement the Module Verifier -------------*- C++ -*-==// |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 2 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 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. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 7 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 9 | // |
Chris Lattner | a5c3dec | 2002-03-29 19:06:18 +0000 | [diff] [blame] | 10 | // This file defines the function verifier interface, that can be used for some |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 11 | // sanity checking of input to the system. |
| 12 | // |
Misha Brukman | 5b63631 | 2004-06-24 21:47:35 +0000 | [diff] [blame] | 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. |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 15 | // |
Misha Brukman | 5b63631 | 2004-06-24 21:47:35 +0000 | [diff] [blame] | 16 | // * Both of a binary operator's parameters are of the same type |
Chris Lattner | a00409e | 2002-04-24 19:12:21 +0000 | [diff] [blame] | 17 | // * Verify that the indices of mem access instructions match other operands |
Misha Brukman | 5b63631 | 2004-06-24 21:47:35 +0000 | [diff] [blame] | 18 | // * Verify that arithmetic and other things are only performed on first-class |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 19 | // types. Verify that shifts & logicals only happen on integrals f.e. |
Misha Brukman | 5b63631 | 2004-06-24 21:47:35 +0000 | [diff] [blame] | 20 | // * All of the constants in a switch statement are of the correct type |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 21 | // * The code is in valid SSA form |
Misha Brukman | 5b63631 | 2004-06-24 21:47:35 +0000 | [diff] [blame] | 22 | // * It should be illegal to put a label into any other type (like a structure) |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 23 | // or to return one. [except constant arrays!] |
Chris Lattner | fdec246 | 2002-03-14 16:53:48 +0000 | [diff] [blame] | 24 | // * Only phi nodes can be self referential: 'add int %0, %0 ; <int>:0' is bad |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 25 | // * PHI nodes must have an entry for each predecessor, with no extras. |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 26 | // * PHI nodes must be the first thing in a basic block, all grouped together |
Chris Lattner | f6ffcb6 | 2002-10-06 21:00:31 +0000 | [diff] [blame] | 27 | // * PHI nodes must have at least one entry |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 28 | // * All basic blocks should only end with terminator insts, not contain them |
Chris Lattner | a5c3dec | 2002-03-29 19:06:18 +0000 | [diff] [blame] | 29 | // * The entry node to a function must not have predecessors |
Misha Brukman | 6b63452 | 2003-10-10 17:54:14 +0000 | [diff] [blame] | 30 | // * All Instructions must be embedded into a basic block |
Misha Brukman | 5b63631 | 2004-06-24 21:47:35 +0000 | [diff] [blame] | 31 | // * Functions cannot take a void-typed parameter |
Chris Lattner | ea24924 | 2002-04-13 22:48:46 +0000 | [diff] [blame] | 32 | // * Verify that a function's argument list agrees with it's declared type. |
Chris Lattner | acd3cae | 2002-03-15 20:25:09 +0000 | [diff] [blame] | 33 | // * It is illegal to specify a name for a void value. |
Misha Brukman | 6b63452 | 2003-10-10 17:54:14 +0000 | [diff] [blame] | 34 | // * It is illegal to have a internal global value with no initializer |
Chris Lattner | 23f0ce6 | 2002-04-12 18:20:49 +0000 | [diff] [blame] | 35 | // * It is illegal to have a ret instruction that returns a value that does not |
| 36 | // agree with the function return value type. |
Chris Lattner | 56732fb | 2002-05-08 19:49:50 +0000 | [diff] [blame] | 37 | // * Function call argument types match the function prototype |
Chris Lattner | a00409e | 2002-04-24 19:12:21 +0000 | [diff] [blame] | 38 | // * All other things that are tested by asserts spread about the code... |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 39 | // |
| 40 | //===----------------------------------------------------------------------===// |
| 41 | |
| 42 | #include "llvm/Analysis/Verifier.h" |
Brian Gaeke | 9cebe2d | 2003-11-16 23:07:42 +0000 | [diff] [blame] | 43 | #include "llvm/Assembly/Writer.h" |
Chris Lattner | 37c121a | 2005-05-08 22:27:09 +0000 | [diff] [blame] | 44 | #include "llvm/CallingConv.h" |
Chris Lattner | cf89908 | 2004-02-14 02:47:17 +0000 | [diff] [blame] | 45 | #include "llvm/Constants.h" |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 46 | #include "llvm/Pass.h" |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 47 | #include "llvm/Module.h" |
Chris Lattner | 2eff859 | 2004-03-14 03:16:15 +0000 | [diff] [blame] | 48 | #include "llvm/ModuleProvider.h" |
Chris Lattner | ea24924 | 2002-04-13 22:48:46 +0000 | [diff] [blame] | 49 | #include "llvm/DerivedTypes.h" |
Chris Lattner | 3188b73 | 2006-01-26 00:08:45 +0000 | [diff] [blame] | 50 | #include "llvm/InlineAsm.h" |
Chris Lattner | cf89908 | 2004-02-14 02:47:17 +0000 | [diff] [blame] | 51 | #include "llvm/Instructions.h" |
Chris Lattner | dd035d1 | 2003-05-08 03:47:33 +0000 | [diff] [blame] | 52 | #include "llvm/Intrinsics.h" |
Chris Lattner | cf89908 | 2004-02-14 02:47:17 +0000 | [diff] [blame] | 53 | #include "llvm/PassManager.h" |
| 54 | #include "llvm/SymbolTable.h" |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 55 | #include "llvm/Analysis/Dominators.h" |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 56 | #include "llvm/Support/CFG.h" |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 57 | #include "llvm/Support/InstVisitor.h" |
Bill Wendling | 8f48766 | 2006-11-28 02:09:03 +0000 | [diff] [blame] | 58 | #include "llvm/Support/Streams.h" |
Chris Lattner | 536a9d5 | 2006-03-31 04:46:47 +0000 | [diff] [blame] | 59 | #include "llvm/ADT/StringExtras.h" |
Reid Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 60 | #include "llvm/ADT/STLExtras.h" |
Chris Lattner | a4f0b3a | 2006-08-27 12:54:02 +0000 | [diff] [blame] | 61 | #include "llvm/Support/Compiler.h" |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 62 | #include <algorithm> |
Bill Wendling | 1a097e3 | 2006-12-07 23:41:45 +0000 | [diff] [blame] | 63 | #include <sstream> |
Jeff Cohen | 4c5701d | 2006-03-31 07:22:05 +0000 | [diff] [blame] | 64 | #include <cstdarg> |
Chris Lattner | 31f8499 | 2003-11-21 20:23:48 +0000 | [diff] [blame] | 65 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 66 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 67 | namespace { // Anonymous namespace for class |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 68 | |
Chris Lattner | f190d38 | 2006-06-28 21:38:54 +0000 | [diff] [blame] | 69 | struct VISIBILITY_HIDDEN |
| 70 | Verifier : public FunctionPass, InstVisitor<Verifier> { |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 71 | bool Broken; // Is this module found to be broken? |
| 72 | bool RealPass; // Are we not being run by a PassManager? |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 73 | VerifierFailureAction action; |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 74 | // What to do if verification fails. |
Misha Brukman | ab5c600 | 2004-03-02 00:22:19 +0000 | [diff] [blame] | 75 | Module *Mod; // Module we are verifying right now |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 76 | ETForest *EF; // ET-Forest, caution can be null! |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 77 | std::stringstream msgs; // A stringstream to collect messages |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 78 | |
Chris Lattner | a7b1c7e | 2004-09-29 20:07:45 +0000 | [diff] [blame] | 79 | /// InstInThisBlock - when verifying a basic block, keep track of all of the |
| 80 | /// instructions we have seen so far. This allows us to do efficient |
| 81 | /// dominance checks for the case when an instruction has an operand that is |
| 82 | /// an instruction in the same block. |
| 83 | std::set<Instruction*> InstsInThisBlock; |
| 84 | |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 85 | Verifier() |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 86 | : Broken(false), RealPass(true), action(AbortProcessAction), |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 87 | EF(0), msgs( std::ios::app | std::ios::out ) {} |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 88 | Verifier( VerifierFailureAction ctn ) |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 89 | : Broken(false), RealPass(true), action(ctn), EF(0), |
Jeff Cohen | 5fb6ed4 | 2005-01-22 17:36:17 +0000 | [diff] [blame] | 90 | msgs( std::ios::app | std::ios::out ) {} |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 91 | Verifier(bool AB ) |
| 92 | : Broken(false), RealPass(true), |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 93 | action( AB ? AbortProcessAction : PrintMessageAction), EF(0), |
Jeff Cohen | 5fb6ed4 | 2005-01-22 17:36:17 +0000 | [diff] [blame] | 94 | msgs( std::ios::app | std::ios::out ) {} |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 95 | Verifier(ETForest &ef) |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 96 | : Broken(false), RealPass(false), action(PrintMessageAction), |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 97 | EF(&ef), msgs( std::ios::app | std::ios::out ) {} |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 98 | |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 99 | |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 100 | bool doInitialization(Module &M) { |
Brian Gaeke | 9cebe2d | 2003-11-16 23:07:42 +0000 | [diff] [blame] | 101 | Mod = &M; |
Reid Spencer | 78d033e | 2007-01-06 07:24:44 +0000 | [diff] [blame] | 102 | verifyTypeSymbolTable(M.getTypeSymbolTable()); |
| 103 | verifyValueSymbolTable(M.getValueSymbolTable()); |
Chris Lattner | 3e1f144 | 2002-09-19 16:12:19 +0000 | [diff] [blame] | 104 | |
| 105 | // If this is a real pass, in a pass manager, we must abort before |
| 106 | // returning back to the pass manager, or else the pass manager may try to |
| 107 | // run other passes on the broken module. |
Chris Lattner | 3e1f144 | 2002-09-19 16:12:19 +0000 | [diff] [blame] | 108 | if (RealPass) |
Reid Spencer | 7107c3b | 2006-07-26 16:18:00 +0000 | [diff] [blame] | 109 | return abortIfBroken(); |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 110 | return false; |
| 111 | } |
| 112 | |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 113 | bool runOnFunction(Function &F) { |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 114 | // Get dominator information if we are being run by PassManager |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 115 | if (RealPass) EF = &getAnalysis<ETForest>(); |
Chris Lattner | 41af719 | 2006-12-13 04:30:37 +0000 | [diff] [blame] | 116 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 117 | visit(F); |
Chris Lattner | a7b1c7e | 2004-09-29 20:07:45 +0000 | [diff] [blame] | 118 | InstsInThisBlock.clear(); |
Chris Lattner | 3e1f144 | 2002-09-19 16:12:19 +0000 | [diff] [blame] | 119 | |
| 120 | // If this is a real pass, in a pass manager, we must abort before |
| 121 | // returning back to the pass manager, or else the pass manager may try to |
| 122 | // run other passes on the broken module. |
Chris Lattner | 3e1f144 | 2002-09-19 16:12:19 +0000 | [diff] [blame] | 123 | if (RealPass) |
Reid Spencer | 7107c3b | 2006-07-26 16:18:00 +0000 | [diff] [blame] | 124 | return abortIfBroken(); |
Chris Lattner | 3e1f144 | 2002-09-19 16:12:19 +0000 | [diff] [blame] | 125 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 126 | return false; |
| 127 | } |
| 128 | |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 129 | bool doFinalization(Module &M) { |
Chris Lattner | 794caa1 | 2002-04-28 16:04:26 +0000 | [diff] [blame] | 130 | // Scan through, checking all of the external function's linkage now... |
Chris Lattner | 7c277b3 | 2004-06-03 06:38:43 +0000 | [diff] [blame] | 131 | for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) { |
Chris Lattner | 5399741 | 2003-04-16 20:42:40 +0000 | [diff] [blame] | 132 | visitGlobalValue(*I); |
Chris Lattner | 794caa1 | 2002-04-28 16:04:26 +0000 | [diff] [blame] | 133 | |
Chris Lattner | 7c277b3 | 2004-06-03 06:38:43 +0000 | [diff] [blame] | 134 | // Check to make sure function prototypes are okay. |
| 135 | if (I->isExternal()) visitFunction(*I); |
| 136 | } |
| 137 | |
Reid Spencer | 0b11820 | 2006-01-16 21:12:35 +0000 | [diff] [blame] | 138 | for (Module::global_iterator I = M.global_begin(), E = M.global_end(); |
| 139 | I != E; ++I) |
Chris Lattner | 56998b2 | 2004-12-15 20:23:49 +0000 | [diff] [blame] | 140 | visitGlobalVariable(*I); |
Chris Lattner | 61b91bc | 2002-10-06 22:47:32 +0000 | [diff] [blame] | 141 | |
Chris Lattner | 3e1f144 | 2002-09-19 16:12:19 +0000 | [diff] [blame] | 142 | // If the module is broken, abort at this time. |
Reid Spencer | 7107c3b | 2006-07-26 16:18:00 +0000 | [diff] [blame] | 143 | return abortIfBroken(); |
Chris Lattner | a00409e | 2002-04-24 19:12:21 +0000 | [diff] [blame] | 144 | } |
| 145 | |
Chris Lattner | 97e52e4 | 2002-04-28 21:27:06 +0000 | [diff] [blame] | 146 | virtual void getAnalysisUsage(AnalysisUsage &AU) const { |
| 147 | AU.setPreservesAll(); |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 148 | if (RealPass) |
Robert Bocchino | c152f9c | 2006-01-17 20:07:22 +0000 | [diff] [blame] | 149 | AU.addRequired<ETForest>(); |
Chris Lattner | 97e52e4 | 2002-04-28 21:27:06 +0000 | [diff] [blame] | 150 | } |
| 151 | |
Misha Brukman | ab5c600 | 2004-03-02 00:22:19 +0000 | [diff] [blame] | 152 | /// abortIfBroken - If the module is broken and we are supposed to abort on |
| 153 | /// this condition, do so. |
| 154 | /// |
Reid Spencer | 7107c3b | 2006-07-26 16:18:00 +0000 | [diff] [blame] | 155 | bool abortIfBroken() { |
Chris Lattner | 05ac92c | 2006-07-06 18:02:27 +0000 | [diff] [blame] | 156 | if (Broken) { |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 157 | msgs << "Broken module found, "; |
Chris Lattner | 05ac92c | 2006-07-06 18:02:27 +0000 | [diff] [blame] | 158 | switch (action) { |
John Criswell | 4a9c904 | 2004-05-04 21:46:05 +0000 | [diff] [blame] | 159 | case AbortProcessAction: |
| 160 | msgs << "compilation aborted!\n"; |
Bill Wendling | e815619 | 2006-12-07 01:30:32 +0000 | [diff] [blame] | 161 | cerr << msgs.str(); |
John Criswell | 4a9c904 | 2004-05-04 21:46:05 +0000 | [diff] [blame] | 162 | abort(); |
John Criswell | 4a9c904 | 2004-05-04 21:46:05 +0000 | [diff] [blame] | 163 | case PrintMessageAction: |
| 164 | msgs << "verification continues.\n"; |
Bill Wendling | e815619 | 2006-12-07 01:30:32 +0000 | [diff] [blame] | 165 | cerr << msgs.str(); |
Reid Spencer | 7107c3b | 2006-07-26 16:18:00 +0000 | [diff] [blame] | 166 | return false; |
John Criswell | 4a9c904 | 2004-05-04 21:46:05 +0000 | [diff] [blame] | 167 | case ReturnStatusAction: |
Reid Spencer | 7107c3b | 2006-07-26 16:18:00 +0000 | [diff] [blame] | 168 | msgs << "compilation terminated.\n"; |
| 169 | return Broken; |
John Criswell | 4a9c904 | 2004-05-04 21:46:05 +0000 | [diff] [blame] | 170 | } |
Chris Lattner | 3e1f144 | 2002-09-19 16:12:19 +0000 | [diff] [blame] | 171 | } |
Reid Spencer | 7107c3b | 2006-07-26 16:18:00 +0000 | [diff] [blame] | 172 | return false; |
Chris Lattner | 3e1f144 | 2002-09-19 16:12:19 +0000 | [diff] [blame] | 173 | } |
| 174 | |
Chris Lattner | 5399741 | 2003-04-16 20:42:40 +0000 | [diff] [blame] | 175 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 176 | // Verification methods... |
Reid Spencer | 78d033e | 2007-01-06 07:24:44 +0000 | [diff] [blame] | 177 | void verifyTypeSymbolTable(TypeSymbolTable &ST); |
| 178 | void verifyValueSymbolTable(SymbolTable &ST); |
Chris Lattner | 5399741 | 2003-04-16 20:42:40 +0000 | [diff] [blame] | 179 | void visitGlobalValue(GlobalValue &GV); |
Chris Lattner | 56998b2 | 2004-12-15 20:23:49 +0000 | [diff] [blame] | 180 | void visitGlobalVariable(GlobalVariable &GV); |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 181 | void visitFunction(Function &F); |
| 182 | void visitBasicBlock(BasicBlock &BB); |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 183 | void visitTruncInst(TruncInst &I); |
| 184 | void visitZExtInst(ZExtInst &I); |
| 185 | void visitSExtInst(SExtInst &I); |
| 186 | void visitFPTruncInst(FPTruncInst &I); |
| 187 | void visitFPExtInst(FPExtInst &I); |
| 188 | void visitFPToUIInst(FPToUIInst &I); |
| 189 | void visitFPToSIInst(FPToSIInst &I); |
| 190 | void visitUIToFPInst(UIToFPInst &I); |
| 191 | void visitSIToFPInst(SIToFPInst &I); |
| 192 | void visitIntToPtrInst(IntToPtrInst &I); |
| 193 | void visitPtrToIntInst(PtrToIntInst &I); |
| 194 | void visitBitCastInst(BitCastInst &I); |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 195 | void visitPHINode(PHINode &PN); |
| 196 | void visitBinaryOperator(BinaryOperator &B); |
Reid Spencer | 45fb3f3 | 2006-11-20 01:22:35 +0000 | [diff] [blame] | 197 | void visitICmpInst(ICmpInst &IC); |
| 198 | void visitFCmpInst(FCmpInst &FC); |
Chris Lattner | 1a143ae | 2002-09-09 20:26:04 +0000 | [diff] [blame] | 199 | void visitShiftInst(ShiftInst &SI); |
Robert Bocchino | b52ee7f | 2006-01-10 19:05:34 +0000 | [diff] [blame] | 200 | void visitExtractElementInst(ExtractElementInst &EI); |
Robert Bocchino | c152f9c | 2006-01-17 20:07:22 +0000 | [diff] [blame] | 201 | void visitInsertElementInst(InsertElementInst &EI); |
Chris Lattner | 00f1023 | 2006-04-08 01:18:18 +0000 | [diff] [blame] | 202 | void visitShuffleVectorInst(ShuffleVectorInst &EI); |
Chris Lattner | 4d45bd0 | 2003-10-18 05:57:43 +0000 | [diff] [blame] | 203 | void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); } |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 204 | void visitCallInst(CallInst &CI); |
| 205 | void visitGetElementPtrInst(GetElementPtrInst &GEP); |
| 206 | void visitLoadInst(LoadInst &LI); |
| 207 | void visitStoreInst(StoreInst &SI); |
| 208 | void visitInstruction(Instruction &I); |
| 209 | void visitTerminatorInst(TerminatorInst &I); |
| 210 | void visitReturnInst(ReturnInst &RI); |
Chris Lattner | 0f9e9d0 | 2004-05-21 16:47:21 +0000 | [diff] [blame] | 211 | void visitSwitchInst(SwitchInst &SI); |
Chris Lattner | 230c1a7 | 2004-03-12 05:54:31 +0000 | [diff] [blame] | 212 | void visitSelectInst(SelectInst &SI); |
Chris Lattner | 627079d | 2002-11-21 16:54:22 +0000 | [diff] [blame] | 213 | void visitUserOp1(Instruction &I); |
| 214 | void visitUserOp2(Instruction &I) { visitUserOp1(I); } |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 215 | void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI); |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 216 | |
Chris Lattner | 536a9d5 | 2006-03-31 04:46:47 +0000 | [diff] [blame] | 217 | void VerifyIntrinsicPrototype(Function *F, ...); |
Chris Lattner | 15e8752 | 2003-11-21 17:35:51 +0000 | [diff] [blame] | 218 | |
| 219 | void WriteValue(const Value *V) { |
| 220 | if (!V) return; |
Chris Lattner | 31f8499 | 2003-11-21 20:23:48 +0000 | [diff] [blame] | 221 | if (isa<Instruction>(V)) { |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 222 | msgs << *V; |
Chris Lattner | 31f8499 | 2003-11-21 20:23:48 +0000 | [diff] [blame] | 223 | } else { |
Chris Lattner | 3749c9c | 2006-12-06 06:16:21 +0000 | [diff] [blame] | 224 | WriteAsOperand(msgs, V, true, Mod); |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 225 | msgs << "\n"; |
Chris Lattner | 15e8752 | 2003-11-21 17:35:51 +0000 | [diff] [blame] | 226 | } |
| 227 | } |
| 228 | |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 229 | void WriteType(const Type* T ) { |
| 230 | if ( !T ) return; |
| 231 | WriteTypeSymbolic(msgs, T, Mod ); |
| 232 | } |
| 233 | |
Chris Lattner | 15e8752 | 2003-11-21 17:35:51 +0000 | [diff] [blame] | 234 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 235 | // CheckFailed - A check failed, so print out the condition and the message |
| 236 | // that failed. This provides a nice place to put a breakpoint if you want |
| 237 | // to see why something is not correct. |
Chris Lattner | 15e8752 | 2003-11-21 17:35:51 +0000 | [diff] [blame] | 238 | void CheckFailed(const std::string &Message, |
| 239 | const Value *V1 = 0, const Value *V2 = 0, |
| 240 | const Value *V3 = 0, const Value *V4 = 0) { |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 241 | msgs << Message << "\n"; |
Chris Lattner | 15e8752 | 2003-11-21 17:35:51 +0000 | [diff] [blame] | 242 | WriteValue(V1); |
| 243 | WriteValue(V2); |
| 244 | WriteValue(V3); |
| 245 | WriteValue(V4); |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 246 | Broken = true; |
| 247 | } |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 248 | |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 249 | void CheckFailed( const std::string& Message, const Value* V1, |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 250 | const Type* T2, const Value* V3 = 0 ) { |
| 251 | msgs << Message << "\n"; |
| 252 | WriteValue(V1); |
| 253 | WriteType(T2); |
| 254 | WriteValue(V3); |
Reid Spencer | 5dff158 | 2004-05-27 21:58:13 +0000 | [diff] [blame] | 255 | Broken = true; |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 256 | } |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 257 | }; |
Chris Lattner | e20a5dd | 2002-07-23 18:08:17 +0000 | [diff] [blame] | 258 | |
Chris Lattner | 7f8897f | 2006-08-27 22:42:52 +0000 | [diff] [blame] | 259 | RegisterPass<Verifier> X("verify", "Module Verifier"); |
Chris Lattner | 31f8499 | 2003-11-21 20:23:48 +0000 | [diff] [blame] | 260 | } // End anonymous namespace |
| 261 | |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 262 | |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 263 | // Assert - We know that cond should be true, if not print an error message. |
| 264 | #define Assert(C, M) \ |
Chris Lattner | 39dd024 | 2002-04-28 16:06:24 +0000 | [diff] [blame] | 265 | do { if (!(C)) { CheckFailed(M); return; } } while (0) |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 266 | #define Assert1(C, M, V1) \ |
Chris Lattner | 39dd024 | 2002-04-28 16:06:24 +0000 | [diff] [blame] | 267 | do { if (!(C)) { CheckFailed(M, V1); return; } } while (0) |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 268 | #define Assert2(C, M, V1, V2) \ |
Chris Lattner | 39dd024 | 2002-04-28 16:06:24 +0000 | [diff] [blame] | 269 | do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0) |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 270 | #define Assert3(C, M, V1, V2, V3) \ |
| 271 | do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0) |
| 272 | #define Assert4(C, M, V1, V2, V3, V4) \ |
| 273 | do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0) |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 274 | |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 275 | |
Chris Lattner | 5399741 | 2003-04-16 20:42:40 +0000 | [diff] [blame] | 276 | void Verifier::visitGlobalValue(GlobalValue &GV) { |
Anton Korobeynikov | b74ed07 | 2006-09-14 18:23:27 +0000 | [diff] [blame] | 277 | Assert1(!GV.isExternal() || |
| 278 | GV.hasExternalLinkage() || |
| 279 | GV.hasDLLImportLinkage() || |
| 280 | GV.hasExternalWeakLinkage(), |
| 281 | "Global is external, but doesn't have external or dllimport or weak linkage!", |
| 282 | &GV); |
| 283 | |
| 284 | Assert1(!GV.hasDLLImportLinkage() || GV.isExternal(), |
| 285 | "Global is marked as dllimport, but not external", &GV); |
| 286 | |
Chris Lattner | 5399741 | 2003-04-16 20:42:40 +0000 | [diff] [blame] | 287 | Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV), |
| 288 | "Only global variables can have appending linkage!", &GV); |
| 289 | |
| 290 | if (GV.hasAppendingLinkage()) { |
| 291 | GlobalVariable &GVar = cast<GlobalVariable>(GV); |
| 292 | Assert1(isa<ArrayType>(GVar.getType()->getElementType()), |
| 293 | "Only global arrays can have appending linkage!", &GV); |
| 294 | } |
| 295 | } |
| 296 | |
Chris Lattner | 56998b2 | 2004-12-15 20:23:49 +0000 | [diff] [blame] | 297 | void Verifier::visitGlobalVariable(GlobalVariable &GV) { |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 298 | if (GV.hasInitializer()) |
Chris Lattner | 56998b2 | 2004-12-15 20:23:49 +0000 | [diff] [blame] | 299 | Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(), |
| 300 | "Global variable initializer type does not match global " |
| 301 | "variable type!", &GV); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 302 | |
Chris Lattner | 56998b2 | 2004-12-15 20:23:49 +0000 | [diff] [blame] | 303 | visitGlobalValue(GV); |
| 304 | } |
| 305 | |
Reid Spencer | 78d033e | 2007-01-06 07:24:44 +0000 | [diff] [blame] | 306 | void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) { |
| 307 | } |
Chris Lattner | 56998b2 | 2004-12-15 20:23:49 +0000 | [diff] [blame] | 308 | |
Chris Lattner | ea24924 | 2002-04-13 22:48:46 +0000 | [diff] [blame] | 309 | // verifySymbolTable - Verify that a function or module symbol table is ok |
Chris Lattner | acd3cae | 2002-03-15 20:25:09 +0000 | [diff] [blame] | 310 | // |
Reid Spencer | 78d033e | 2007-01-06 07:24:44 +0000 | [diff] [blame] | 311 | void Verifier::verifyValueSymbolTable(SymbolTable &ST) { |
Chris Lattner | acd3cae | 2002-03-15 20:25:09 +0000 | [diff] [blame] | 312 | |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 313 | // Loop over all of the values in all type planes in the symbol table. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 314 | for (SymbolTable::plane_const_iterator PI = ST.plane_begin(), |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 315 | PE = ST.plane_end(); PI != PE; ++PI) |
| 316 | for (SymbolTable::value_const_iterator VI = PI->second.begin(), |
| 317 | VE = PI->second.end(); VI != VE; ++VI) { |
| 318 | Value *V = VI->second; |
Chris Lattner | acd3cae | 2002-03-15 20:25:09 +0000 | [diff] [blame] | 319 | // Check that there are no void typed values in the symbol table. Values |
| 320 | // with a void type cannot be put into symbol tables because they cannot |
| 321 | // have names! |
| 322 | Assert1(V->getType() != Type::VoidTy, |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 323 | "Values with void type are not allowed to have names!", V); |
Chris Lattner | acd3cae | 2002-03-15 20:25:09 +0000 | [diff] [blame] | 324 | } |
Chris Lattner | acd3cae | 2002-03-15 20:25:09 +0000 | [diff] [blame] | 325 | } |
| 326 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 327 | // visitFunction - Verify that a function is ok. |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 328 | // |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 329 | void Verifier::visitFunction(Function &F) { |
Chris Lattner | 37c121a | 2005-05-08 22:27:09 +0000 | [diff] [blame] | 330 | // Check function arguments. |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 331 | const FunctionType *FT = F.getFunctionType(); |
| 332 | unsigned NumArgs = F.getArgumentList().size(); |
Chris Lattner | ea24924 | 2002-04-13 22:48:46 +0000 | [diff] [blame] | 333 | |
Chris Lattner | 69da5cf | 2002-10-13 20:57:00 +0000 | [diff] [blame] | 334 | Assert2(FT->getNumParams() == NumArgs, |
Chris Lattner | ea24924 | 2002-04-13 22:48:46 +0000 | [diff] [blame] | 335 | "# formal arguments must match # of arguments for function type!", |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 336 | &F, FT); |
Chris Lattner | c282f5a | 2003-11-21 22:32:23 +0000 | [diff] [blame] | 337 | Assert1(F.getReturnType()->isFirstClassType() || |
| 338 | F.getReturnType() == Type::VoidTy, |
| 339 | "Functions cannot return aggregate values!", &F); |
Chris Lattner | ea24924 | 2002-04-13 22:48:46 +0000 | [diff] [blame] | 340 | |
Chris Lattner | 80105dd | 2006-05-19 21:25:17 +0000 | [diff] [blame] | 341 | // Check that this function meets the restrictions on this calling convention. |
| 342 | switch (F.getCallingConv()) { |
| 343 | default: |
| 344 | break; |
| 345 | case CallingConv::C: |
| 346 | break; |
| 347 | case CallingConv::CSRet: |
| 348 | Assert1(FT->getReturnType() == Type::VoidTy && |
| 349 | FT->getNumParams() > 0 && isa<PointerType>(FT->getParamType(0)), |
| 350 | "Invalid struct-return function!", &F); |
| 351 | break; |
| 352 | case CallingConv::Fast: |
| 353 | case CallingConv::Cold: |
Anton Korobeynikov | bcb9770 | 2006-09-17 20:25:45 +0000 | [diff] [blame] | 354 | case CallingConv::X86_FastCall: |
Chris Lattner | 80105dd | 2006-05-19 21:25:17 +0000 | [diff] [blame] | 355 | Assert1(!F.isVarArg(), |
| 356 | "Varargs functions must have C calling conventions!", &F); |
| 357 | break; |
| 358 | } |
| 359 | |
Chris Lattner | ea24924 | 2002-04-13 22:48:46 +0000 | [diff] [blame] | 360 | // Check that the argument values match the function type for this function... |
Chris Lattner | 69da5cf | 2002-10-13 20:57:00 +0000 | [diff] [blame] | 361 | unsigned i = 0; |
Chris Lattner | e3cbe03 | 2006-12-16 02:25:35 +0000 | [diff] [blame] | 362 | for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); |
| 363 | I != E; ++I, ++i) { |
Chris Lattner | 69da5cf | 2002-10-13 20:57:00 +0000 | [diff] [blame] | 364 | Assert2(I->getType() == FT->getParamType(i), |
| 365 | "Argument value does not match function argument type!", |
| 366 | I, FT->getParamType(i)); |
Chris Lattner | 7c277b3 | 2004-06-03 06:38:43 +0000 | [diff] [blame] | 367 | // Make sure no aggregates are passed by value. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 368 | Assert1(I->getType()->isFirstClassType(), |
Chris Lattner | 7c277b3 | 2004-06-03 06:38:43 +0000 | [diff] [blame] | 369 | "Functions cannot take aggregates as arguments by value!", I); |
| 370 | } |
Chris Lattner | ea24924 | 2002-04-13 22:48:46 +0000 | [diff] [blame] | 371 | |
Chris Lattner | 69da5cf | 2002-10-13 20:57:00 +0000 | [diff] [blame] | 372 | if (!F.isExternal()) { |
Chris Lattner | 4d17caa | 2006-12-13 04:45:46 +0000 | [diff] [blame] | 373 | // Verify that this function (which has a body) is not named "llvm.*". It |
| 374 | // is not legal to define intrinsics. |
| 375 | if (F.getName().size() >= 5) |
| 376 | Assert1(F.getName().substr(0, 5) != "llvm.", |
| 377 | "llvm intrinsics cannot be defined!", &F); |
| 378 | |
Reid Spencer | 78d033e | 2007-01-06 07:24:44 +0000 | [diff] [blame] | 379 | verifyValueSymbolTable(F.getValueSymbolTable()); |
Chris Lattner | 69da5cf | 2002-10-13 20:57:00 +0000 | [diff] [blame] | 380 | |
| 381 | // Check the entry node |
Chris Lattner | 02a3be0 | 2003-09-20 14:39:18 +0000 | [diff] [blame] | 382 | BasicBlock *Entry = &F.getEntryBlock(); |
Chris Lattner | 69da5cf | 2002-10-13 20:57:00 +0000 | [diff] [blame] | 383 | Assert1(pred_begin(Entry) == pred_end(Entry), |
| 384 | "Entry block to function must not have predecessors!", Entry); |
| 385 | } |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 386 | } |
| 387 | |
| 388 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 389 | // verifyBasicBlock - Verify that a basic block is well formed... |
| 390 | // |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 391 | void Verifier::visitBasicBlock(BasicBlock &BB) { |
Chris Lattner | a7b1c7e | 2004-09-29 20:07:45 +0000 | [diff] [blame] | 392 | InstsInThisBlock.clear(); |
| 393 | |
Alkis Evlogimenos | 4f4cf99 | 2004-12-04 02:30:42 +0000 | [diff] [blame] | 394 | // Ensure that basic blocks have terminators! |
| 395 | Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB); |
| 396 | |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 397 | // Check constraints that this basic block imposes on all of the PHI nodes in |
| 398 | // it. |
| 399 | if (isa<PHINode>(BB.front())) { |
| 400 | std::vector<BasicBlock*> Preds(pred_begin(&BB), pred_end(&BB)); |
| 401 | std::sort(Preds.begin(), Preds.end()); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 402 | PHINode *PN; |
Chris Lattner | c70a509 | 2004-06-05 17:44:48 +0000 | [diff] [blame] | 403 | for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) { |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 404 | |
| 405 | // Ensure that PHI nodes have at least one entry! |
| 406 | Assert1(PN->getNumIncomingValues() != 0, |
| 407 | "PHI nodes must have at least one entry. If the block is dead, " |
| 408 | "the PHI should be removed!", PN); |
Brian Gaeke | 2fea9ad | 2004-05-17 21:15:18 +0000 | [diff] [blame] | 409 | Assert1(PN->getNumIncomingValues() == Preds.size(), |
| 410 | "PHINode should have one entry for each predecessor of its " |
| 411 | "parent basic block!", PN); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 412 | |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 413 | // Get and sort all incoming values in the PHI node... |
| 414 | std::vector<std::pair<BasicBlock*, Value*> > Values; |
| 415 | Values.reserve(PN->getNumIncomingValues()); |
| 416 | for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) |
| 417 | Values.push_back(std::make_pair(PN->getIncomingBlock(i), |
| 418 | PN->getIncomingValue(i))); |
| 419 | std::sort(Values.begin(), Values.end()); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 420 | |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 421 | for (unsigned i = 0, e = Values.size(); i != e; ++i) { |
| 422 | // Check to make sure that if there is more than one entry for a |
| 423 | // particular basic block in this PHI node, that the incoming values are |
| 424 | // all identical. |
| 425 | // |
| 426 | Assert4(i == 0 || Values[i].first != Values[i-1].first || |
| 427 | Values[i].second == Values[i-1].second, |
| 428 | "PHI node has multiple entries for the same basic block with " |
| 429 | "different incoming values!", PN, Values[i].first, |
| 430 | Values[i].second, Values[i-1].second); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 431 | |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 432 | // Check to make sure that the predecessors and PHI node entries are |
| 433 | // matched up. |
| 434 | Assert3(Values[i].first == Preds[i], |
| 435 | "PHI node entries do not match predecessors!", PN, |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 436 | Values[i].first, Preds[i]); |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 437 | } |
| 438 | } |
| 439 | } |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 440 | } |
Chris Lattner | acd3cae | 2002-03-15 20:25:09 +0000 | [diff] [blame] | 441 | |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 442 | void Verifier::visitTerminatorInst(TerminatorInst &I) { |
| 443 | // Ensure that terminators only exist at the end of the basic block. |
| 444 | Assert1(&I == I.getParent()->getTerminator(), |
| 445 | "Terminator found in the middle of a basic block!", I.getParent()); |
Chris Lattner | 3535c9b | 2002-07-18 00:13:42 +0000 | [diff] [blame] | 446 | visitInstruction(I); |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 447 | } |
| 448 | |
| 449 | void Verifier::visitReturnInst(ReturnInst &RI) { |
| 450 | Function *F = RI.getParent()->getParent(); |
| 451 | if (RI.getNumOperands() == 0) |
Alkis Evlogimenos | 8b42b43 | 2004-12-04 01:25:06 +0000 | [diff] [blame] | 452 | Assert2(F->getReturnType() == Type::VoidTy, |
| 453 | "Found return instr that returns void in Function of non-void " |
| 454 | "return type!", &RI, F->getReturnType()); |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 455 | else |
| 456 | Assert2(F->getReturnType() == RI.getOperand(0)->getType(), |
| 457 | "Function return type does not match operand " |
| 458 | "type of return inst!", &RI, F->getReturnType()); |
| 459 | |
Misha Brukman | 5560c9d | 2003-08-18 14:43:39 +0000 | [diff] [blame] | 460 | // Check to make sure that the return value has necessary properties for |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 461 | // terminators... |
| 462 | visitTerminatorInst(RI); |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 463 | } |
| 464 | |
Chris Lattner | 0f9e9d0 | 2004-05-21 16:47:21 +0000 | [diff] [blame] | 465 | void Verifier::visitSwitchInst(SwitchInst &SI) { |
| 466 | // Check to make sure that all of the constants in the switch instruction |
| 467 | // have the same type as the switched-on value. |
| 468 | const Type *SwitchTy = SI.getCondition()->getType(); |
| 469 | for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i) |
| 470 | Assert1(SI.getCaseValue(i)->getType() == SwitchTy, |
| 471 | "Switch constants must all be same type as switch value!", &SI); |
| 472 | |
| 473 | visitTerminatorInst(SI); |
| 474 | } |
| 475 | |
Chris Lattner | 230c1a7 | 2004-03-12 05:54:31 +0000 | [diff] [blame] | 476 | void Verifier::visitSelectInst(SelectInst &SI) { |
Reid Spencer | 4fe16d6 | 2007-01-11 18:21:29 +0000 | [diff] [blame^] | 477 | Assert1(SI.getCondition()->getType() == Type::Int1Ty, |
Chris Lattner | 230c1a7 | 2004-03-12 05:54:31 +0000 | [diff] [blame] | 478 | "Select condition type must be bool!", &SI); |
| 479 | Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(), |
| 480 | "Select values must have identical types!", &SI); |
| 481 | Assert1(SI.getTrueValue()->getType() == SI.getType(), |
| 482 | "Select values must have same type as select instruction!", &SI); |
Chris Lattner | 0030e6c | 2004-09-29 21:19:28 +0000 | [diff] [blame] | 483 | visitInstruction(SI); |
Chris Lattner | 230c1a7 | 2004-03-12 05:54:31 +0000 | [diff] [blame] | 484 | } |
| 485 | |
| 486 | |
Misha Brukman | ab5c600 | 2004-03-02 00:22:19 +0000 | [diff] [blame] | 487 | /// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of |
| 488 | /// a pass, if any exist, it's an error. |
| 489 | /// |
Chris Lattner | 627079d | 2002-11-21 16:54:22 +0000 | [diff] [blame] | 490 | void Verifier::visitUserOp1(Instruction &I) { |
Chris Lattner | 536a9d5 | 2006-03-31 04:46:47 +0000 | [diff] [blame] | 491 | Assert1(0, "User-defined operators should not live outside of a pass!", &I); |
Chris Lattner | 627079d | 2002-11-21 16:54:22 +0000 | [diff] [blame] | 492 | } |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 493 | |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 494 | void Verifier::visitTruncInst(TruncInst &I) { |
| 495 | // Get the source and destination types |
| 496 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 497 | const Type *DestTy = I.getType(); |
| 498 | |
| 499 | // Get the size of the types in bits, we'll need this later |
| 500 | unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits(); |
| 501 | unsigned DestBitSize = DestTy->getPrimitiveSizeInBits(); |
| 502 | |
| 503 | Assert1(SrcTy->isIntegral(), "Trunc only operates on integer", &I); |
| 504 | Assert1(DestTy->isIntegral(),"Trunc only produces integral", &I); |
| 505 | Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I); |
| 506 | |
| 507 | visitInstruction(I); |
| 508 | } |
| 509 | |
| 510 | void Verifier::visitZExtInst(ZExtInst &I) { |
| 511 | // Get the source and destination types |
| 512 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 513 | const Type *DestTy = I.getType(); |
| 514 | |
| 515 | // Get the size of the types in bits, we'll need this later |
| 516 | unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits(); |
| 517 | unsigned DestBitSize = DestTy->getPrimitiveSizeInBits(); |
| 518 | |
| 519 | Assert1(SrcTy->isIntegral(),"ZExt only operates on integral", &I); |
| 520 | Assert1(DestTy->isInteger(),"ZExt only produces an integer", &I); |
| 521 | Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I); |
| 522 | |
| 523 | visitInstruction(I); |
| 524 | } |
| 525 | |
| 526 | void Verifier::visitSExtInst(SExtInst &I) { |
| 527 | // Get the source and destination types |
| 528 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 529 | const Type *DestTy = I.getType(); |
| 530 | |
| 531 | // Get the size of the types in bits, we'll need this later |
| 532 | unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits(); |
| 533 | unsigned DestBitSize = DestTy->getPrimitiveSizeInBits(); |
| 534 | |
| 535 | Assert1(SrcTy->isIntegral(),"SExt only operates on integral", &I); |
| 536 | Assert1(DestTy->isInteger(),"SExt only produces an integer", &I); |
| 537 | Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I); |
| 538 | |
| 539 | visitInstruction(I); |
| 540 | } |
| 541 | |
| 542 | void Verifier::visitFPTruncInst(FPTruncInst &I) { |
| 543 | // Get the source and destination types |
| 544 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 545 | const Type *DestTy = I.getType(); |
| 546 | // Get the size of the types in bits, we'll need this later |
| 547 | unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits(); |
| 548 | unsigned DestBitSize = DestTy->getPrimitiveSizeInBits(); |
| 549 | |
| 550 | Assert1(SrcTy->isFloatingPoint(),"FPTrunc only operates on FP", &I); |
| 551 | Assert1(DestTy->isFloatingPoint(),"FPTrunc only produces an FP", &I); |
| 552 | Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I); |
| 553 | |
| 554 | visitInstruction(I); |
| 555 | } |
| 556 | |
| 557 | void Verifier::visitFPExtInst(FPExtInst &I) { |
| 558 | // Get the source and destination types |
| 559 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 560 | const Type *DestTy = I.getType(); |
| 561 | |
| 562 | // Get the size of the types in bits, we'll need this later |
| 563 | unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits(); |
| 564 | unsigned DestBitSize = DestTy->getPrimitiveSizeInBits(); |
| 565 | |
| 566 | Assert1(SrcTy->isFloatingPoint(),"FPExt only operates on FP", &I); |
| 567 | Assert1(DestTy->isFloatingPoint(),"FPExt only produces an FP", &I); |
| 568 | Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I); |
| 569 | |
| 570 | visitInstruction(I); |
| 571 | } |
| 572 | |
| 573 | void Verifier::visitUIToFPInst(UIToFPInst &I) { |
| 574 | // Get the source and destination types |
| 575 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 576 | const Type *DestTy = I.getType(); |
| 577 | |
| 578 | Assert1(SrcTy->isIntegral(),"UInt2FP source must be integral", &I); |
| 579 | Assert1(DestTy->isFloatingPoint(),"UInt2FP result must be FP", &I); |
| 580 | |
| 581 | visitInstruction(I); |
| 582 | } |
| 583 | |
| 584 | void Verifier::visitSIToFPInst(SIToFPInst &I) { |
| 585 | // Get the source and destination types |
| 586 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 587 | const Type *DestTy = I.getType(); |
| 588 | |
| 589 | Assert1(SrcTy->isIntegral(),"SInt2FP source must be integral", &I); |
| 590 | Assert1(DestTy->isFloatingPoint(),"SInt2FP result must be FP", &I); |
| 591 | |
| 592 | visitInstruction(I); |
| 593 | } |
| 594 | |
| 595 | void Verifier::visitFPToUIInst(FPToUIInst &I) { |
| 596 | // Get the source and destination types |
| 597 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 598 | const Type *DestTy = I.getType(); |
| 599 | |
| 600 | Assert1(SrcTy->isFloatingPoint(),"FP2UInt source must be FP", &I); |
| 601 | Assert1(DestTy->isIntegral(),"FP2UInt result must be integral", &I); |
| 602 | |
| 603 | visitInstruction(I); |
| 604 | } |
| 605 | |
| 606 | void Verifier::visitFPToSIInst(FPToSIInst &I) { |
| 607 | // Get the source and destination types |
| 608 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 609 | const Type *DestTy = I.getType(); |
| 610 | |
| 611 | Assert1(SrcTy->isFloatingPoint(),"FPToSI source must be FP", &I); |
| 612 | Assert1(DestTy->isIntegral(),"FP2ToI result must be integral", &I); |
| 613 | |
| 614 | visitInstruction(I); |
| 615 | } |
| 616 | |
| 617 | void Verifier::visitPtrToIntInst(PtrToIntInst &I) { |
| 618 | // Get the source and destination types |
| 619 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 620 | const Type *DestTy = I.getType(); |
| 621 | |
| 622 | Assert1(isa<PointerType>(SrcTy), "PtrToInt source must be pointer", &I); |
| 623 | Assert1(DestTy->isIntegral(), "PtrToInt result must be integral", &I); |
| 624 | |
| 625 | visitInstruction(I); |
| 626 | } |
| 627 | |
| 628 | void Verifier::visitIntToPtrInst(IntToPtrInst &I) { |
| 629 | // Get the source and destination types |
| 630 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 631 | const Type *DestTy = I.getType(); |
| 632 | |
| 633 | Assert1(SrcTy->isIntegral(), "IntToPtr source must be an integral", &I); |
| 634 | Assert1(isa<PointerType>(DestTy), "IntToPtr result must be a pointer",&I); |
| 635 | |
| 636 | visitInstruction(I); |
| 637 | } |
| 638 | |
| 639 | void Verifier::visitBitCastInst(BitCastInst &I) { |
| 640 | // Get the source and destination types |
| 641 | const Type *SrcTy = I.getOperand(0)->getType(); |
| 642 | const Type *DestTy = I.getType(); |
| 643 | |
| 644 | // Get the size of the types in bits, we'll need this later |
| 645 | unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits(); |
| 646 | unsigned DestBitSize = DestTy->getPrimitiveSizeInBits(); |
| 647 | |
| 648 | // BitCast implies a no-op cast of type only. No bits change. |
| 649 | // However, you can't cast pointers to anything but pointers. |
| 650 | Assert1(isa<PointerType>(DestTy) == isa<PointerType>(DestTy), |
| 651 | "Bitcast requires both operands to be pointer or neither", &I); |
| 652 | Assert1(SrcBitSize == DestBitSize, "Bitcast requies types of same width", &I); |
| 653 | |
| 654 | visitInstruction(I); |
| 655 | } |
| 656 | |
Misha Brukman | ab5c600 | 2004-03-02 00:22:19 +0000 | [diff] [blame] | 657 | /// visitPHINode - Ensure that a PHI node is well formed. |
| 658 | /// |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 659 | void Verifier::visitPHINode(PHINode &PN) { |
| 660 | // Ensure that the PHI nodes are all grouped together at the top of the block. |
| 661 | // This can be tested by checking whether the instruction before this is |
Misha Brukman | 6b63452 | 2003-10-10 17:54:14 +0000 | [diff] [blame] | 662 | // either nonexistent (because this is begin()) or is a PHI node. If not, |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 663 | // then there is some other instruction before a PHI. |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 664 | Assert2(&PN.getParent()->front() == &PN || isa<PHINode>(PN.getPrev()), |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 665 | "PHI nodes not grouped at top of basic block!", |
| 666 | &PN, PN.getParent()); |
| 667 | |
Chris Lattner | 579de71 | 2003-11-12 07:13:37 +0000 | [diff] [blame] | 668 | // Check that all of the operands of the PHI node have the same type as the |
| 669 | // result. |
| 670 | for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) |
| 671 | Assert1(PN.getType() == PN.getIncomingValue(i)->getType(), |
| 672 | "PHI node operands are not the same type as the result!", &PN); |
| 673 | |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 674 | // All other PHI node constraints are checked in the visitBasicBlock method. |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 675 | |
| 676 | visitInstruction(PN); |
| 677 | } |
| 678 | |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 679 | void Verifier::visitCallInst(CallInst &CI) { |
| 680 | Assert1(isa<PointerType>(CI.getOperand(0)->getType()), |
| 681 | "Called function must be a pointer!", &CI); |
| 682 | const PointerType *FPTy = cast<PointerType>(CI.getOperand(0)->getType()); |
Chris Lattner | efdd0a2 | 2002-04-18 22:11:52 +0000 | [diff] [blame] | 683 | Assert1(isa<FunctionType>(FPTy->getElementType()), |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 684 | "Called function is not pointer to function type!", &CI); |
Chris Lattner | 56732fb | 2002-05-08 19:49:50 +0000 | [diff] [blame] | 685 | |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 686 | const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType()); |
Chris Lattner | 56732fb | 2002-05-08 19:49:50 +0000 | [diff] [blame] | 687 | |
| 688 | // Verify that the correct number of arguments are being passed |
| 689 | if (FTy->isVarArg()) |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 690 | Assert1(CI.getNumOperands()-1 >= FTy->getNumParams(), |
| 691 | "Called function requires more parameters than were provided!",&CI); |
Chris Lattner | 56732fb | 2002-05-08 19:49:50 +0000 | [diff] [blame] | 692 | else |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 693 | Assert1(CI.getNumOperands()-1 == FTy->getNumParams(), |
| 694 | "Incorrect number of arguments passed to called function!", &CI); |
Chris Lattner | 56732fb | 2002-05-08 19:49:50 +0000 | [diff] [blame] | 695 | |
| 696 | // Verify that all arguments to the call match the function type... |
| 697 | for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i) |
Chris Lattner | 2a11653 | 2004-02-24 22:06:07 +0000 | [diff] [blame] | 698 | Assert3(CI.getOperand(i+1)->getType() == FTy->getParamType(i), |
Chris Lattner | 56732fb | 2002-05-08 19:49:50 +0000 | [diff] [blame] | 699 | "Call parameter type does not match function signature!", |
Chris Lattner | 2a11653 | 2004-02-24 22:06:07 +0000 | [diff] [blame] | 700 | CI.getOperand(i+1), FTy->getParamType(i), &CI); |
Chris Lattner | 3535c9b | 2002-07-18 00:13:42 +0000 | [diff] [blame] | 701 | |
Chris Lattner | dd035d1 | 2003-05-08 03:47:33 +0000 | [diff] [blame] | 702 | if (Function *F = CI.getCalledFunction()) |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 703 | if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) |
Chris Lattner | dd035d1 | 2003-05-08 03:47:33 +0000 | [diff] [blame] | 704 | visitIntrinsicFunctionCall(ID, CI); |
| 705 | |
Chris Lattner | 3535c9b | 2002-07-18 00:13:42 +0000 | [diff] [blame] | 706 | visitInstruction(CI); |
Chris Lattner | efdd0a2 | 2002-04-18 22:11:52 +0000 | [diff] [blame] | 707 | } |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 708 | |
Misha Brukman | ab5c600 | 2004-03-02 00:22:19 +0000 | [diff] [blame] | 709 | /// visitBinaryOperator - Check that both arguments to the binary operator are |
| 710 | /// of the same type! |
| 711 | /// |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 712 | void Verifier::visitBinaryOperator(BinaryOperator &B) { |
Chris Lattner | 1a143ae | 2002-09-09 20:26:04 +0000 | [diff] [blame] | 713 | Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(), |
| 714 | "Both operands to a binary operator are not of the same type!", &B); |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 715 | |
Chris Lattner | 1a143ae | 2002-09-09 20:26:04 +0000 | [diff] [blame] | 716 | // Check that logical operators are only used with integral operands. |
| 717 | if (B.getOpcode() == Instruction::And || B.getOpcode() == Instruction::Or || |
| 718 | B.getOpcode() == Instruction::Xor) { |
Chris Lattner | b9d4100 | 2005-12-21 18:22:19 +0000 | [diff] [blame] | 719 | Assert1(B.getType()->isIntegral() || |
| 720 | (isa<PackedType>(B.getType()) && |
| 721 | cast<PackedType>(B.getType())->getElementType()->isIntegral()), |
Chris Lattner | 1a143ae | 2002-09-09 20:26:04 +0000 | [diff] [blame] | 722 | "Logical operators only work with integral types!", &B); |
| 723 | Assert1(B.getType() == B.getOperand(0)->getType(), |
| 724 | "Logical operators must have same type for operands and result!", |
| 725 | &B); |
Chris Lattner | 1a143ae | 2002-09-09 20:26:04 +0000 | [diff] [blame] | 726 | } else { |
| 727 | // Arithmetic operators only work on integer or fp values |
| 728 | Assert1(B.getType() == B.getOperand(0)->getType(), |
| 729 | "Arithmetic operators must have same type for operands and result!", |
| 730 | &B); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 731 | Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint() || |
Brian Gaeke | 715c90b | 2004-08-20 06:00:58 +0000 | [diff] [blame] | 732 | isa<PackedType>(B.getType()), |
| 733 | "Arithmetic operators must have integer, fp, or packed type!", &B); |
Chris Lattner | 1a143ae | 2002-09-09 20:26:04 +0000 | [diff] [blame] | 734 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 735 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 736 | visitInstruction(B); |
| 737 | } |
| 738 | |
Reid Spencer | 45fb3f3 | 2006-11-20 01:22:35 +0000 | [diff] [blame] | 739 | void Verifier::visitICmpInst(ICmpInst& IC) { |
| 740 | // Check that the operands are the same type |
| 741 | const Type* Op0Ty = IC.getOperand(0)->getType(); |
| 742 | const Type* Op1Ty = IC.getOperand(1)->getType(); |
| 743 | Assert1(Op0Ty == Op1Ty, |
| 744 | "Both operands to ICmp instruction are not of the same type!", &IC); |
| 745 | // Check that the operands are the right type |
Reid Spencer | affaf07 | 2007-01-04 05:22:18 +0000 | [diff] [blame] | 746 | Assert1(Op0Ty->isIntegral() || Op0Ty->getTypeID() == Type::PointerTyID, |
Reid Spencer | 45fb3f3 | 2006-11-20 01:22:35 +0000 | [diff] [blame] | 747 | "Invalid operand types for ICmp instruction", &IC); |
| 748 | visitInstruction(IC); |
| 749 | } |
| 750 | |
| 751 | void Verifier::visitFCmpInst(FCmpInst& FC) { |
| 752 | // Check that the operands are the same type |
| 753 | const Type* Op0Ty = FC.getOperand(0)->getType(); |
| 754 | const Type* Op1Ty = FC.getOperand(1)->getType(); |
| 755 | Assert1(Op0Ty == Op1Ty, |
| 756 | "Both operands to FCmp instruction are not of the same type!", &FC); |
| 757 | // Check that the operands are the right type |
Reid Spencer | affaf07 | 2007-01-04 05:22:18 +0000 | [diff] [blame] | 758 | Assert1(Op0Ty->isFloatingPoint(), |
Reid Spencer | 45fb3f3 | 2006-11-20 01:22:35 +0000 | [diff] [blame] | 759 | "Invalid operand types for FCmp instruction", &FC); |
| 760 | visitInstruction(FC); |
| 761 | } |
| 762 | |
Chris Lattner | 1a143ae | 2002-09-09 20:26:04 +0000 | [diff] [blame] | 763 | void Verifier::visitShiftInst(ShiftInst &SI) { |
| 764 | Assert1(SI.getType()->isInteger(), |
| 765 | "Shift must return an integer result!", &SI); |
| 766 | Assert1(SI.getType() == SI.getOperand(0)->getType(), |
| 767 | "Shift return type must be same as first operand!", &SI); |
Reid Spencer | 79e21d3 | 2006-12-31 05:26:44 +0000 | [diff] [blame] | 768 | Assert1(SI.getOperand(1)->getType() == Type::Int8Ty, |
Chris Lattner | 1a143ae | 2002-09-09 20:26:04 +0000 | [diff] [blame] | 769 | "Second operand to shift must be ubyte type!", &SI); |
| 770 | visitInstruction(SI); |
| 771 | } |
| 772 | |
Robert Bocchino | b52ee7f | 2006-01-10 19:05:34 +0000 | [diff] [blame] | 773 | void Verifier::visitExtractElementInst(ExtractElementInst &EI) { |
Chris Lattner | 1cbe05b | 2006-04-08 04:07:52 +0000 | [diff] [blame] | 774 | Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0), |
| 775 | EI.getOperand(1)), |
| 776 | "Invalid extractelement operands!", &EI); |
Robert Bocchino | b52ee7f | 2006-01-10 19:05:34 +0000 | [diff] [blame] | 777 | visitInstruction(EI); |
| 778 | } |
| 779 | |
Robert Bocchino | c152f9c | 2006-01-17 20:07:22 +0000 | [diff] [blame] | 780 | void Verifier::visitInsertElementInst(InsertElementInst &IE) { |
Chris Lattner | 1cbe05b | 2006-04-08 04:07:52 +0000 | [diff] [blame] | 781 | Assert1(InsertElementInst::isValidOperands(IE.getOperand(0), |
| 782 | IE.getOperand(1), |
| 783 | IE.getOperand(2)), |
| 784 | "Invalid insertelement operands!", &IE); |
Robert Bocchino | c152f9c | 2006-01-17 20:07:22 +0000 | [diff] [blame] | 785 | visitInstruction(IE); |
| 786 | } |
| 787 | |
Chris Lattner | 00f1023 | 2006-04-08 01:18:18 +0000 | [diff] [blame] | 788 | void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) { |
| 789 | Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1), |
| 790 | SV.getOperand(2)), |
| 791 | "Invalid shufflevector operands!", &SV); |
| 792 | Assert1(SV.getType() == SV.getOperand(0)->getType(), |
| 793 | "Result of shufflevector must match first operand type!", &SV); |
| 794 | |
| 795 | // Check to see if Mask is valid. |
| 796 | if (const ConstantPacked *MV = dyn_cast<ConstantPacked>(SV.getOperand(2))) { |
| 797 | for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) { |
Reid Spencer | b83eb64 | 2006-10-20 07:07:24 +0000 | [diff] [blame] | 798 | Assert1(isa<ConstantInt>(MV->getOperand(i)) || |
Chris Lattner | 00f1023 | 2006-04-08 01:18:18 +0000 | [diff] [blame] | 799 | isa<UndefValue>(MV->getOperand(i)), |
| 800 | "Invalid shufflevector shuffle mask!", &SV); |
| 801 | } |
| 802 | } else { |
| 803 | Assert1(isa<UndefValue>(SV.getOperand(2)) || |
| 804 | isa<ConstantAggregateZero>(SV.getOperand(2)), |
| 805 | "Invalid shufflevector shuffle mask!", &SV); |
| 806 | } |
| 807 | |
| 808 | visitInstruction(SV); |
| 809 | } |
| 810 | |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 811 | void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) { |
Chris Lattner | cc63f1c | 2002-08-22 23:37:20 +0000 | [diff] [blame] | 812 | const Type *ElTy = |
| 813 | GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(), |
| 814 | std::vector<Value*>(GEP.idx_begin(), GEP.idx_end()), true); |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 815 | Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP); |
| 816 | Assert2(PointerType::get(ElTy) == GEP.getType(), |
| 817 | "GEP is not of right type for indices!", &GEP, ElTy); |
Chris Lattner | a00409e | 2002-04-24 19:12:21 +0000 | [diff] [blame] | 818 | visitInstruction(GEP); |
| 819 | } |
| 820 | |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 821 | void Verifier::visitLoadInst(LoadInst &LI) { |
Chris Lattner | 24ea74e | 2002-08-22 22:49:05 +0000 | [diff] [blame] | 822 | const Type *ElTy = |
| 823 | cast<PointerType>(LI.getOperand(0)->getType())->getElementType(); |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 824 | Assert2(ElTy == LI.getType(), |
Chris Lattner | 7334f2e | 2003-11-21 17:06:29 +0000 | [diff] [blame] | 825 | "Load result type does not match pointer operand type!", &LI, ElTy); |
Chris Lattner | a00409e | 2002-04-24 19:12:21 +0000 | [diff] [blame] | 826 | visitInstruction(LI); |
| 827 | } |
| 828 | |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 829 | void Verifier::visitStoreInst(StoreInst &SI) { |
Chris Lattner | 24ea74e | 2002-08-22 22:49:05 +0000 | [diff] [blame] | 830 | const Type *ElTy = |
| 831 | cast<PointerType>(SI.getOperand(1)->getType())->getElementType(); |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 832 | Assert2(ElTy == SI.getOperand(0)->getType(), |
Chris Lattner | 7334f2e | 2003-11-21 17:06:29 +0000 | [diff] [blame] | 833 | "Stored value type does not match pointer operand type!", &SI, ElTy); |
Chris Lattner | a00409e | 2002-04-24 19:12:21 +0000 | [diff] [blame] | 834 | visitInstruction(SI); |
| 835 | } |
| 836 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 837 | |
Misha Brukman | ab5c600 | 2004-03-02 00:22:19 +0000 | [diff] [blame] | 838 | /// verifyInstruction - Verify that an instruction is well formed. |
| 839 | /// |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 840 | void Verifier::visitInstruction(Instruction &I) { |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 841 | BasicBlock *BB = I.getParent(); |
Chris Lattner | 1a143ae | 2002-09-09 20:26:04 +0000 | [diff] [blame] | 842 | Assert1(BB, "Instruction not embedded in basic block!", &I); |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 843 | |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 844 | if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential |
| 845 | for (Value::use_iterator UI = I.use_begin(), UE = I.use_end(); |
| 846 | UI != UE; ++UI) |
Chris Lattner | 0809253 | 2004-02-27 17:28:25 +0000 | [diff] [blame] | 847 | Assert1(*UI != (User*)&I || |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 848 | !EF->dominates(&BB->getParent()->getEntryBlock(), BB), |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 849 | "Only PHI nodes may reference their own value!", &I); |
| 850 | } |
| 851 | |
| 852 | // Check that void typed values don't have names |
| 853 | Assert1(I.getType() != Type::VoidTy || !I.hasName(), |
| 854 | "Instruction has a name, but provides a void value!", &I); |
| 855 | |
Chris Lattner | 944cfaf | 2004-03-29 00:29:36 +0000 | [diff] [blame] | 856 | // Check that the return value of the instruction is either void or a legal |
| 857 | // value type. |
| 858 | Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(), |
| 859 | "Instruction returns a non-scalar type!", &I); |
| 860 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 861 | // Check that all uses of the instruction, if they are instructions |
| 862 | // themselves, actually have parent basic blocks. If the use is not an |
| 863 | // instruction, it is an error! |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 864 | for (User::use_iterator UI = I.use_begin(), UE = I.use_end(); |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 865 | UI != UE; ++UI) { |
| 866 | Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!", |
| 867 | *UI); |
Chris Lattner | efdd0a2 | 2002-04-18 22:11:52 +0000 | [diff] [blame] | 868 | Instruction *Used = cast<Instruction>(*UI); |
| 869 | Assert2(Used->getParent() != 0, "Instruction referencing instruction not" |
Chris Lattner | 24e845f | 2002-06-25 15:56:27 +0000 | [diff] [blame] | 870 | " embeded in a basic block!", &I, Used); |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 871 | } |
| 872 | |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 873 | for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { |
Chris Lattner | aab1820 | 2005-02-24 16:58:29 +0000 | [diff] [blame] | 874 | Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I); |
Chris Lattner | f4ea921 | 2006-07-11 20:29:49 +0000 | [diff] [blame] | 875 | |
| 876 | // Check to make sure that only first-class-values are operands to |
| 877 | // instructions. |
| 878 | Assert1(I.getOperand(i)->getType()->isFirstClassType(), |
| 879 | "Instruction operands must be first-class values!", &I); |
| 880 | |
Chris Lattner | 59c3569 | 2004-03-14 03:23:54 +0000 | [diff] [blame] | 881 | if (Function *F = dyn_cast<Function>(I.getOperand(i))) { |
Chris Lattner | f4ea921 | 2006-07-11 20:29:49 +0000 | [diff] [blame] | 882 | // Check to make sure that the "address of" an intrinsic function is never |
| 883 | // taken. |
Chris Lattner | dd035d1 | 2003-05-08 03:47:33 +0000 | [diff] [blame] | 884 | Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)), |
| 885 | "Cannot take the address of an intrinsic!", &I); |
Chris Lattner | 59c3569 | 2004-03-14 03:23:54 +0000 | [diff] [blame] | 886 | } else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) { |
| 887 | Assert1(OpBB->getParent() == BB->getParent(), |
| 888 | "Referring to a basic block in another function!", &I); |
| 889 | } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) { |
| 890 | Assert1(OpArg->getParent() == BB->getParent(), |
| 891 | "Referring to an argument in another function!", &I); |
| 892 | } else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) { |
Chris Lattner | 30768ac | 2004-01-14 04:25:59 +0000 | [diff] [blame] | 893 | BasicBlock *OpBlock = Op->getParent(); |
Chris Lattner | 30768ac | 2004-01-14 04:25:59 +0000 | [diff] [blame] | 894 | |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 895 | // Check that a definition dominates all of its uses. |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 896 | if (!isa<PHINode>(I)) { |
Chris Lattner | c9b0702 | 2004-01-14 05:42:52 +0000 | [diff] [blame] | 897 | // Invoke results are only usable in the normal destination, not in the |
| 898 | // exceptional destination. |
Chris Lattner | e3cbe03 | 2006-12-16 02:25:35 +0000 | [diff] [blame] | 899 | if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) { |
Chris Lattner | c9b0702 | 2004-01-14 05:42:52 +0000 | [diff] [blame] | 900 | OpBlock = II->getNormalDest(); |
Chris Lattner | e3cbe03 | 2006-12-16 02:25:35 +0000 | [diff] [blame] | 901 | |
Chris Lattner | 62d75e7 | 2006-12-20 21:20:13 +0000 | [diff] [blame] | 902 | Assert2(OpBlock != II->getUnwindDest(), |
| 903 | "No uses of invoke possible due to dominance structure!", |
| 904 | Op, II); |
| 905 | |
Chris Lattner | e3cbe03 | 2006-12-16 02:25:35 +0000 | [diff] [blame] | 906 | // If the normal successor of an invoke instruction has multiple |
| 907 | // predecessors, then the normal edge from the invoke is critical, so |
| 908 | // the invoke value can only be live if the destination block |
| 909 | // dominates all of it's predecessors (other than the invoke) or if |
| 910 | // the invoke value is only used by a phi in the successor. |
| 911 | if (!OpBlock->getSinglePredecessor() && |
| 912 | EF->dominates(&BB->getParent()->getEntryBlock(), BB)) { |
| 913 | // The first case we allow is if the use is a PHI operand in the |
| 914 | // normal block, and if that PHI operand corresponds to the invoke's |
| 915 | // block. |
| 916 | bool Bad = true; |
| 917 | if (PHINode *PN = dyn_cast<PHINode>(&I)) |
| 918 | if (PN->getParent() == OpBlock && |
| 919 | PN->getIncomingBlock(i/2) == Op->getParent()) |
| 920 | Bad = false; |
| 921 | |
| 922 | // If it is used by something non-phi, then the other case is that |
| 923 | // 'OpBlock' dominates all of its predecessors other than the |
| 924 | // invoke. In this case, the invoke value can still be used. |
Chris Lattner | 19591b3 | 2006-12-20 19:50:15 +0000 | [diff] [blame] | 925 | if (Bad) { |
| 926 | Bad = false; |
Chris Lattner | e3cbe03 | 2006-12-16 02:25:35 +0000 | [diff] [blame] | 927 | for (pred_iterator PI = pred_begin(OpBlock), |
| 928 | E = pred_end(OpBlock); PI != E; ++PI) { |
| 929 | if (*PI != II->getParent() && !EF->dominates(OpBlock, *PI)) { |
| 930 | Bad = true; |
| 931 | break; |
| 932 | } |
| 933 | } |
| 934 | } |
Chris Lattner | 62d75e7 | 2006-12-20 21:20:13 +0000 | [diff] [blame] | 935 | Assert2(!Bad, |
| 936 | "Invoke value defined on critical edge but not dead!", &I, |
| 937 | Op); |
Chris Lattner | e3cbe03 | 2006-12-16 02:25:35 +0000 | [diff] [blame] | 938 | } |
| 939 | } else if (OpBlock == BB) { |
Chris Lattner | e1f0cf1 | 2004-04-16 05:51:47 +0000 | [diff] [blame] | 940 | // If they are in the same basic block, make sure that the definition |
| 941 | // comes before the use. |
Chris Lattner | a7b1c7e | 2004-09-29 20:07:45 +0000 | [diff] [blame] | 942 | Assert2(InstsInThisBlock.count(Op) || |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 943 | !EF->dominates(&BB->getParent()->getEntryBlock(), BB), |
Chris Lattner | e1f0cf1 | 2004-04-16 05:51:47 +0000 | [diff] [blame] | 944 | "Instruction does not dominate all uses!", Op, &I); |
| 945 | } |
Chris Lattner | c9b0702 | 2004-01-14 05:42:52 +0000 | [diff] [blame] | 946 | |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 947 | // Definition must dominate use unless use is unreachable! |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 948 | Assert2(EF->dominates(OpBlock, BB) || |
| 949 | !EF->dominates(&BB->getParent()->getEntryBlock(), BB), |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 950 | "Instruction does not dominate all uses!", Op, &I); |
| 951 | } else { |
| 952 | // PHI nodes are more difficult than other nodes because they actually |
| 953 | // "use" the value in the predecessor basic blocks they correspond to. |
| 954 | BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1)); |
Chris Lattner | 0b2192c | 2006-01-12 06:17:59 +0000 | [diff] [blame] | 955 | Assert2(EF->dominates(OpBlock, PredBB) || |
| 956 | !EF->dominates(&BB->getParent()->getEntryBlock(), PredBB), |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 957 | "Instruction does not dominate all uses!", Op, &I); |
| 958 | } |
Chris Lattner | 3188b73 | 2006-01-26 00:08:45 +0000 | [diff] [blame] | 959 | } else if (isa<InlineAsm>(I.getOperand(i))) { |
| 960 | Assert1(i == 0 && isa<CallInst>(I), |
| 961 | "Cannot take the address of an inline asm!", &I); |
Chris Lattner | bede31f | 2003-10-05 17:44:18 +0000 | [diff] [blame] | 962 | } |
| 963 | } |
Chris Lattner | a7b1c7e | 2004-09-29 20:07:45 +0000 | [diff] [blame] | 964 | InstsInThisBlock.insert(&I); |
Chris Lattner | dd035d1 | 2003-05-08 03:47:33 +0000 | [diff] [blame] | 965 | } |
| 966 | |
| 967 | /// visitIntrinsicFunction - Allow intrinsics to be verified in different ways. |
Misha Brukman | ab5c600 | 2004-03-02 00:22:19 +0000 | [diff] [blame] | 968 | /// |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 969 | void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) { |
Chris Lattner | dd035d1 | 2003-05-08 03:47:33 +0000 | [diff] [blame] | 970 | Function *IF = CI.getCalledFunction(); |
Chris Lattner | dd035d1 | 2003-05-08 03:47:33 +0000 | [diff] [blame] | 971 | Assert1(IF->isExternal(), "Intrinsic functions should never be defined!", IF); |
Chris Lattner | 3b816b7 | 2006-03-09 22:06:04 +0000 | [diff] [blame] | 972 | |
| 973 | #define GET_INTRINSIC_VERIFIER |
| 974 | #include "llvm/Intrinsics.gen" |
| 975 | #undef GET_INTRINSIC_VERIFIER |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 976 | } |
| 977 | |
Chris Lattner | 536a9d5 | 2006-03-31 04:46:47 +0000 | [diff] [blame] | 978 | /// VerifyIntrinsicPrototype - TableGen emits calls to this function into |
| 979 | /// Intrinsics.gen. This implements a little state machine that verifies the |
| 980 | /// prototype of intrinsics. |
| 981 | void Verifier::VerifyIntrinsicPrototype(Function *F, ...) { |
| 982 | va_list VA; |
| 983 | va_start(VA, F); |
| 984 | |
| 985 | const FunctionType *FTy = F->getFunctionType(); |
| 986 | |
| 987 | // Note that "arg#0" is the return type. |
| 988 | for (unsigned ArgNo = 0; 1; ++ArgNo) { |
| 989 | int TypeID = va_arg(VA, int); |
| 990 | |
| 991 | if (TypeID == -1) { |
| 992 | if (ArgNo != FTy->getNumParams()+1) |
| 993 | CheckFailed("Intrinsic prototype has too many arguments!", F); |
| 994 | break; |
| 995 | } |
| 996 | |
| 997 | if (ArgNo == FTy->getNumParams()+1) { |
| 998 | CheckFailed("Intrinsic prototype has too few arguments!", F); |
| 999 | break; |
| 1000 | } |
| 1001 | |
| 1002 | const Type *Ty; |
| 1003 | if (ArgNo == 0) |
| 1004 | Ty = FTy->getReturnType(); |
| 1005 | else |
| 1006 | Ty = FTy->getParamType(ArgNo-1); |
| 1007 | |
| 1008 | if (Ty->getTypeID() != TypeID) { |
| 1009 | if (ArgNo == 0) |
| 1010 | CheckFailed("Intrinsic prototype has incorrect result type!", F); |
| 1011 | else |
| 1012 | CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is wrong!",F); |
| 1013 | break; |
| 1014 | } |
| 1015 | |
| 1016 | // If this is a packed argument, verify the number and type of elements. |
| 1017 | if (TypeID == Type::PackedTyID) { |
| 1018 | const PackedType *PTy = cast<PackedType>(Ty); |
| 1019 | if (va_arg(VA, int) != PTy->getElementType()->getTypeID()) { |
| 1020 | CheckFailed("Intrinsic prototype has incorrect vector element type!",F); |
| 1021 | break; |
| 1022 | } |
| 1023 | |
| 1024 | if ((unsigned)va_arg(VA, int) != PTy->getNumElements()) { |
| 1025 | CheckFailed("Intrinsic prototype has incorrect number of " |
| 1026 | "vector elements!",F); |
| 1027 | break; |
| 1028 | } |
| 1029 | } |
| 1030 | } |
| 1031 | |
| 1032 | va_end(VA); |
| 1033 | } |
| 1034 | |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 1035 | |
| 1036 | //===----------------------------------------------------------------------===// |
| 1037 | // Implement the public interfaces to this file... |
| 1038 | //===----------------------------------------------------------------------===// |
| 1039 | |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 1040 | FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) { |
| 1041 | return new Verifier(action); |
Chris Lattner | d231fc3 | 2002-04-18 20:37:37 +0000 | [diff] [blame] | 1042 | } |
| 1043 | |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 1044 | |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1045 | // verifyFunction - Create |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 1046 | bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) { |
Chris Lattner | 2eff859 | 2004-03-14 03:16:15 +0000 | [diff] [blame] | 1047 | Function &F = const_cast<Function&>(f); |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 1048 | assert(!F.isExternal() && "Cannot verify external functions"); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 1049 | |
Chris Lattner | 2eff859 | 2004-03-14 03:16:15 +0000 | [diff] [blame] | 1050 | FunctionPassManager FPM(new ExistingModuleProvider(F.getParent())); |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 1051 | Verifier *V = new Verifier(action); |
Chris Lattner | 2eff859 | 2004-03-14 03:16:15 +0000 | [diff] [blame] | 1052 | FPM.add(V); |
| 1053 | FPM.run(F); |
| 1054 | return V->Broken; |
Chris Lattner | 44d5bd9 | 2002-02-20 17:55:43 +0000 | [diff] [blame] | 1055 | } |
| 1056 | |
Misha Brukman | ab5c600 | 2004-03-02 00:22:19 +0000 | [diff] [blame] | 1057 | /// verifyModule - Check a module for errors, printing messages on stderr. |
| 1058 | /// Return true if the module is corrupt. |
| 1059 | /// |
Chris Lattner | 05ac92c | 2006-07-06 18:02:27 +0000 | [diff] [blame] | 1060 | bool llvm::verifyModule(const Module &M, VerifierFailureAction action, |
| 1061 | std::string *ErrorInfo) { |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 1062 | PassManager PM; |
Chris Lattner | fdc38c4 | 2004-04-02 15:45:08 +0000 | [diff] [blame] | 1063 | Verifier *V = new Verifier(action); |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 1064 | PM.add(V); |
| 1065 | PM.run((Module&)M); |
Chris Lattner | 05ac92c | 2006-07-06 18:02:27 +0000 | [diff] [blame] | 1066 | |
| 1067 | if (ErrorInfo && V->Broken) |
| 1068 | *ErrorInfo = V->msgs.str(); |
Chris Lattner | 9ce231f | 2002-08-02 17:37:08 +0000 | [diff] [blame] | 1069 | return V->Broken; |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1070 | } |
Reid Spencer | af90b0d | 2004-05-25 08:53:29 +0000 | [diff] [blame] | 1071 | |
| 1072 | // vim: sw=2 |