Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 1 | //===------------------------------------------------------------------------=== |
| 2 | // LLVM 'Analyze' UTILITY |
| 3 | // |
| 4 | // This utility is designed to print out the results of running various analysis |
| 5 | // passes on a program. This is useful for understanding a program, or for |
| 6 | // debugging an analysis pass. |
| 7 | // |
| 8 | // analyze --help - Output information about command line switches |
| 9 | // analyze --quiet - Do not print analysis name before output |
| 10 | // |
| 11 | //===------------------------------------------------------------------------=== |
| 12 | |
Chris Lattner | 1546bff | 2001-07-20 19:16:29 +0000 | [diff] [blame] | 13 | #include "llvm/Instruction.h" |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 14 | #include "llvm/Module.h" |
Chris Lattner | 1546bff | 2001-07-20 19:16:29 +0000 | [diff] [blame] | 15 | #include "llvm/Method.h" |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 16 | #include "llvm/Bytecode/Reader.h" |
| 17 | #include "llvm/Assembly/Parser.h" |
Chris Lattner | 57dbb3a | 2001-07-23 17:46:59 +0000 | [diff] [blame] | 18 | #include "llvm/Support/CommandLine.h" |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 19 | #include "llvm/Analysis/Writer.h" |
| 20 | |
Chris Lattner | b312259 | 2001-09-14 01:42:42 +0000 | [diff] [blame] | 21 | #include "llvm/Analysis/InstForest.h" |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 22 | #include "llvm/Analysis/Dominators.h" |
| 23 | #include "llvm/Analysis/IntervalPartition.h" |
Chris Lattner | 1546bff | 2001-07-20 19:16:29 +0000 | [diff] [blame] | 24 | #include "llvm/Analysis/Expressions.h" |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 25 | #include "llvm/Analysis/CallGraph.h" |
| 26 | #include <algorithm> |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 27 | |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 28 | static void PrintMethod(Method *M) { |
| 29 | cout << M; |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 30 | } |
| 31 | |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 32 | static void PrintIntervalPartition(Method *M) { |
| 33 | cout << cfg::IntervalPartition(M); |
| 34 | } |
| 35 | |
Chris Lattner | 1546bff | 2001-07-20 19:16:29 +0000 | [diff] [blame] | 36 | static void PrintClassifiedExprs(Method *M) { |
| 37 | cout << "Classified expressions for: " << M->getName() << endl; |
| 38 | Method::inst_iterator I = M->inst_begin(), E = M->inst_end(); |
| 39 | for (; I != E; ++I) { |
| 40 | cout << *I; |
| 41 | |
| 42 | if ((*I)->getType() == Type::VoidTy) continue; |
Chris Lattner | 85202d4 | 2001-07-21 19:08:44 +0000 | [diff] [blame] | 43 | analysis::ExprType R = analysis::ClassifyExpression(*I); |
Chris Lattner | 1546bff | 2001-07-20 19:16:29 +0000 | [diff] [blame] | 44 | if (R.Var == *I) continue; // Doesn't tell us anything |
| 45 | |
| 46 | cout << "\t\tExpr ="; |
Chris Lattner | 85202d4 | 2001-07-21 19:08:44 +0000 | [diff] [blame] | 47 | switch (R.ExprTy) { |
| 48 | case analysis::ExprType::ScaledLinear: |
Chris Lattner | da5cfa3 | 2001-07-25 22:48:37 +0000 | [diff] [blame] | 49 | WriteAsOperand(cout << "(", (Value*)R.Scale) << " ) *"; |
Chris Lattner | 1546bff | 2001-07-20 19:16:29 +0000 | [diff] [blame] | 50 | // fall through |
Chris Lattner | 85202d4 | 2001-07-21 19:08:44 +0000 | [diff] [blame] | 51 | case analysis::ExprType::Linear: |
Chris Lattner | da5cfa3 | 2001-07-25 22:48:37 +0000 | [diff] [blame] | 52 | WriteAsOperand(cout << "(", R.Var) << " )"; |
Chris Lattner | 1546bff | 2001-07-20 19:16:29 +0000 | [diff] [blame] | 53 | if (R.Offset == 0) break; |
| 54 | else cout << " +"; |
| 55 | // fall through |
Chris Lattner | 85202d4 | 2001-07-21 19:08:44 +0000 | [diff] [blame] | 56 | case analysis::ExprType::Constant: |
Chris Lattner | 1546bff | 2001-07-20 19:16:29 +0000 | [diff] [blame] | 57 | if (R.Offset) WriteAsOperand(cout, (Value*)R.Offset); else cout << " 0"; |
| 58 | break; |
| 59 | } |
| 60 | cout << endl << endl; |
| 61 | } |
| 62 | } |
| 63 | |
Chris Lattner | b312259 | 2001-09-14 01:42:42 +0000 | [diff] [blame] | 64 | static void PrintInstForest(Method *M) { |
| 65 | cout << analysis::InstForest<char>(M); |
| 66 | } |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 67 | static void PrintCallGraph(Module *M) { |
| 68 | cout << cfg::CallGraph(M); |
| 69 | } |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 70 | |
| 71 | static void PrintDominatorSets(Method *M) { |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 72 | cout << cfg::DominatorSet(M); |
| 73 | } |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 74 | static void PrintImmediateDominators(Method *M) { |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 75 | cout << cfg::ImmediateDominators(M); |
| 76 | } |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 77 | static void PrintDominatorTree(Method *M) { |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 78 | cout << cfg::DominatorTree(M); |
| 79 | } |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 80 | static void PrintDominanceFrontier(Method *M) { |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 81 | cout << cfg::DominanceFrontier(M); |
| 82 | } |
| 83 | |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 84 | static void PrintPostDominatorSets(Method *M) { |
| 85 | cout << cfg::DominatorSet(M, true); |
| 86 | } |
| 87 | static void PrintImmediatePostDoms(Method *M) { |
| 88 | cout << cfg::ImmediateDominators(cfg::DominatorSet(M, true)); |
| 89 | } |
| 90 | static void PrintPostDomTree(Method *M) { |
| 91 | cout << cfg::DominatorTree(cfg::DominatorSet(M, true)); |
| 92 | } |
| 93 | static void PrintPostDomFrontier(Method *M) { |
| 94 | cout << cfg::DominanceFrontier(cfg::DominatorSet(M, true)); |
| 95 | } |
| 96 | |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 97 | |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 98 | enum Ans { |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 99 | PassDone, // Unique Marker |
| 100 | print, intervals, exprclassify, instforest, callgraph, |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 101 | domset, idom, domtree, domfrontier, |
| 102 | postdomset, postidom, postdomtree, postdomfrontier, |
| 103 | }; |
| 104 | |
Chris Lattner | 1e78f36 | 2001-07-23 19:27:24 +0000 | [diff] [blame] | 105 | cl::String InputFilename ("", "Load <arg> file to analyze", cl::NoFlags, "-"); |
Chris Lattner | a8e1fd3 | 2001-07-23 20:22:30 +0000 | [diff] [blame] | 106 | cl::Flag Quiet ("q", "Don't print analysis pass names"); |
| 107 | cl::Alias QuietA ("quiet", "Alias for -q", cl::NoFlags, Quiet); |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 108 | cl::EnumList<enum Ans> AnalysesList(cl::NoFlags, |
| 109 | clEnumVal(print , "Print each Method"), |
| 110 | clEnumVal(intervals , "Print Interval Partitions"), |
| 111 | clEnumVal(exprclassify , "Classify Expressions"), |
Chris Lattner | b312259 | 2001-09-14 01:42:42 +0000 | [diff] [blame] | 112 | clEnumVal(instforest , "Print Instruction Forest"), |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 113 | clEnumVal(callgraph , "Print Call Graph"), |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 114 | |
| 115 | clEnumVal(domset , "Print Dominator Sets"), |
| 116 | clEnumVal(idom , "Print Immediate Dominators"), |
| 117 | clEnumVal(domtree , "Print Dominator Tree"), |
| 118 | clEnumVal(domfrontier , "Print Dominance Frontier"), |
| 119 | |
| 120 | clEnumVal(postdomset , "Print Postdominator Sets"), |
| 121 | clEnumVal(postidom , "Print Immediate Postdominators"), |
| 122 | clEnumVal(postdomtree , "Print Post Dominator Tree"), |
| 123 | clEnumVal(postdomfrontier, "Print Postdominance Frontier"), |
| 124 | 0); |
| 125 | |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 126 | struct { |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 127 | enum Ans AnID; |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 128 | void (*AnPtr)(Method *M); |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 129 | } MethAnTable[] = { |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 130 | { print , PrintMethod }, |
| 131 | { intervals , PrintIntervalPartition }, |
| 132 | { exprclassify , PrintClassifiedExprs }, |
Chris Lattner | b312259 | 2001-09-14 01:42:42 +0000 | [diff] [blame] | 133 | { instforest , PrintInstForest }, |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 134 | |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 135 | { domset , PrintDominatorSets }, |
| 136 | { idom , PrintImmediateDominators }, |
| 137 | { domtree , PrintDominatorTree }, |
| 138 | { domfrontier , PrintDominanceFrontier }, |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 139 | |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 140 | { postdomset , PrintPostDominatorSets }, |
| 141 | { postidom , PrintImmediatePostDoms }, |
| 142 | { postdomtree , PrintPostDomTree }, |
| 143 | { postdomfrontier, PrintPostDomFrontier }, |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 144 | }; |
| 145 | |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 146 | pair<enum Ans, void (*)(Module *)> ModAnTable[] = { |
| 147 | pair<enum Ans, void (*)(Module *)>(callgraph , PrintCallGraph), |
| 148 | }; |
| 149 | |
| 150 | |
| 151 | |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 152 | int main(int argc, char **argv) { |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 153 | cl::ParseCommandLineOptions(argc, argv, " llvm analysis printer tool\n"); |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 154 | |
Chris Lattner | 1e78f36 | 2001-07-23 19:27:24 +0000 | [diff] [blame] | 155 | Module *C = ParseBytecodeFile(InputFilename); |
| 156 | if (!C && !(C = ParseAssemblyFile(InputFilename))) { |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 157 | cerr << "Input file didn't read correctly.\n"; |
| 158 | return 1; |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 159 | } |
| 160 | |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 161 | // Loop over all of the analyses looking for module level analyses to run... |
| 162 | for (unsigned i = 0; i < AnalysesList.size(); ++i) { |
| 163 | enum Ans AnalysisPass = AnalysesList[i]; |
| 164 | |
| 165 | for (unsigned j = 0; j < sizeof(ModAnTable)/sizeof(ModAnTable[0]); ++j) { |
| 166 | if (ModAnTable[j].first == AnalysisPass) { |
| 167 | if (!Quiet) |
| 168 | cerr << "Running: " << AnalysesList.getArgDescription(AnalysisPass) |
| 169 | << " analysis on module!\n"; |
| 170 | ModAnTable[j].second(C); |
| 171 | AnalysesList[i] = PassDone; // Mark pass as complete so that we don't |
| 172 | break; // get an error later |
| 173 | } |
| 174 | } |
| 175 | } |
| 176 | |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 177 | // Loop over all of the methods in the module... |
Chris Lattner | c13aff6 | 2001-07-06 16:59:10 +0000 | [diff] [blame] | 178 | for (Module::iterator I = C->begin(), E = C->end(); I != E; ++I) { |
| 179 | Method *M = *I; |
Chris Lattner | 1546bff | 2001-07-20 19:16:29 +0000 | [diff] [blame] | 180 | if (M->isExternal()) continue; |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 181 | |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 182 | for (unsigned i = 0; i < AnalysesList.size(); ++i) { |
| 183 | enum Ans AnalysisPass = AnalysesList[i]; |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 184 | if (AnalysisPass == PassDone) continue; // Don't rerun module analyses |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 185 | |
| 186 | // Loop over all of the analyses to be run... |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 187 | unsigned j; |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 188 | for (j = 0; j < sizeof(MethAnTable)/sizeof(MethAnTable[0]); ++j) { |
| 189 | if (AnalysisPass == MethAnTable[j].AnID) { |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 190 | if (!Quiet) |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 191 | cerr << "Running: " << AnalysesList.getArgDescription(AnalysisPass) |
| 192 | << " analysis on '" << ((Value*)M)->getName() << "'!\n"; |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 193 | MethAnTable[j].AnPtr(M); |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 194 | break; |
| 195 | } |
| 196 | } |
Chris Lattner | c4199ec | 2001-09-28 00:07:36 +0000 | [diff] [blame] | 197 | if (j == sizeof(MethAnTable)/sizeof(MethAnTable[0])) |
Chris Lattner | 8f367bd | 2001-07-23 02:35:57 +0000 | [diff] [blame] | 198 | cerr << "Analysis tables inconsistent!\n"; |
Chris Lattner | f3dc2c9 | 2001-07-03 15:30:38 +0000 | [diff] [blame] | 199 | } |
| 200 | } |
| 201 | |
| 202 | delete C; |
| 203 | return 0; |
| 204 | } |