blob: 745aa0b0596e5b03ee766978c34bedf636b140d6 [file] [log] [blame]
Chris Lattnerf3dc2c92001-07-03 15:30:38 +00001//===------------------------------------------------------------------------===
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 Lattner1546bff2001-07-20 19:16:29 +000013#include "llvm/Instruction.h"
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000014#include "llvm/Module.h"
Chris Lattner1546bff2001-07-20 19:16:29 +000015#include "llvm/Method.h"
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000016#include "llvm/Bytecode/Reader.h"
17#include "llvm/Assembly/Parser.h"
Chris Lattner57dbb3a2001-07-23 17:46:59 +000018#include "llvm/Support/CommandLine.h"
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000019#include "llvm/Analysis/Writer.h"
20
Chris Lattnerb3122592001-09-14 01:42:42 +000021#include "llvm/Analysis/InstForest.h"
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000022#include "llvm/Analysis/Dominators.h"
23#include "llvm/Analysis/IntervalPartition.h"
Chris Lattner1546bff2001-07-20 19:16:29 +000024#include "llvm/Analysis/Expressions.h"
Chris Lattnerc4199ec2001-09-28 00:07:36 +000025#include "llvm/Analysis/CallGraph.h"
Chris Lattner483c3ee2001-11-07 21:16:29 +000026#include "llvm/Analysis/FindUnsafePointerTypes.h"
Chris Lattner9f8ae2b2001-11-09 05:27:34 +000027#include "llvm/Analysis/FindUsedTypes.h"
Chris Lattnerc4199ec2001-09-28 00:07:36 +000028#include <algorithm>
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000029
Chris Lattnerc13aff62001-07-06 16:59:10 +000030static void PrintMethod(Method *M) {
31 cout << M;
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000032}
33
Chris Lattnerc13aff62001-07-06 16:59:10 +000034static void PrintIntervalPartition(Method *M) {
35 cout << cfg::IntervalPartition(M);
36}
37
Chris Lattner1546bff2001-07-20 19:16:29 +000038static void PrintClassifiedExprs(Method *M) {
39 cout << "Classified expressions for: " << M->getName() << endl;
40 Method::inst_iterator I = M->inst_begin(), E = M->inst_end();
41 for (; I != E; ++I) {
42 cout << *I;
43
44 if ((*I)->getType() == Type::VoidTy) continue;
Chris Lattner85202d42001-07-21 19:08:44 +000045 analysis::ExprType R = analysis::ClassifyExpression(*I);
Chris Lattner1546bff2001-07-20 19:16:29 +000046 if (R.Var == *I) continue; // Doesn't tell us anything
47
48 cout << "\t\tExpr =";
Chris Lattner85202d42001-07-21 19:08:44 +000049 switch (R.ExprTy) {
50 case analysis::ExprType::ScaledLinear:
Chris Lattnerda5cfa32001-07-25 22:48:37 +000051 WriteAsOperand(cout << "(", (Value*)R.Scale) << " ) *";
Chris Lattner1546bff2001-07-20 19:16:29 +000052 // fall through
Chris Lattner85202d42001-07-21 19:08:44 +000053 case analysis::ExprType::Linear:
Chris Lattnerda5cfa32001-07-25 22:48:37 +000054 WriteAsOperand(cout << "(", R.Var) << " )";
Chris Lattner1546bff2001-07-20 19:16:29 +000055 if (R.Offset == 0) break;
56 else cout << " +";
57 // fall through
Chris Lattner85202d42001-07-21 19:08:44 +000058 case analysis::ExprType::Constant:
Chris Lattner1546bff2001-07-20 19:16:29 +000059 if (R.Offset) WriteAsOperand(cout, (Value*)R.Offset); else cout << " 0";
60 break;
61 }
62 cout << endl << endl;
63 }
64}
65
Chris Lattnerb3122592001-09-14 01:42:42 +000066static void PrintInstForest(Method *M) {
67 cout << analysis::InstForest<char>(M);
68}
Chris Lattnerc4199ec2001-09-28 00:07:36 +000069static void PrintCallGraph(Module *M) {
70 cout << cfg::CallGraph(M);
71}
Chris Lattnerc13aff62001-07-06 16:59:10 +000072
Chris Lattner483c3ee2001-11-07 21:16:29 +000073static void PrintUnsafePtrTypes(Module *M) {
74 FindUnsafePointerTypes FUPT;
75 FUPT.run(M);
76 FUPT.printResults(M, cout);
77}
78
Chris Lattner9f8ae2b2001-11-09 05:27:34 +000079static void PrintUsedTypes(Module *M) {
80 FindUsedTypes FUT;
81 FUT.run(M);
82 FUT.printTypes(cout, M);
83}
84
Chris Lattnerc13aff62001-07-06 16:59:10 +000085static void PrintDominatorSets(Method *M) {
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000086 cout << cfg::DominatorSet(M);
87}
Chris Lattnerc13aff62001-07-06 16:59:10 +000088static void PrintImmediateDominators(Method *M) {
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000089 cout << cfg::ImmediateDominators(M);
90}
Chris Lattnerc13aff62001-07-06 16:59:10 +000091static void PrintDominatorTree(Method *M) {
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000092 cout << cfg::DominatorTree(M);
93}
Chris Lattnerc13aff62001-07-06 16:59:10 +000094static void PrintDominanceFrontier(Method *M) {
Chris Lattnerf3dc2c92001-07-03 15:30:38 +000095 cout << cfg::DominanceFrontier(M);
96}
97
Chris Lattnerc13aff62001-07-06 16:59:10 +000098static void PrintPostDominatorSets(Method *M) {
99 cout << cfg::DominatorSet(M, true);
100}
101static void PrintImmediatePostDoms(Method *M) {
102 cout << cfg::ImmediateDominators(cfg::DominatorSet(M, true));
103}
104static void PrintPostDomTree(Method *M) {
105 cout << cfg::DominatorTree(cfg::DominatorSet(M, true));
106}
107static void PrintPostDomFrontier(Method *M) {
108 cout << cfg::DominanceFrontier(cfg::DominatorSet(M, true));
109}
110
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000111
Chris Lattner8f367bd2001-07-23 02:35:57 +0000112enum Ans {
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000113 PassDone, // Unique Marker
Chris Lattner9f8ae2b2001-11-09 05:27:34 +0000114 print, intervals, exprclassify, instforest, callgraph,
115 printusedtypes, unsafepointertypes,
116
Chris Lattner8f367bd2001-07-23 02:35:57 +0000117 domset, idom, domtree, domfrontier,
118 postdomset, postidom, postdomtree, postdomfrontier,
119};
120
Chris Lattner1e78f362001-07-23 19:27:24 +0000121cl::String InputFilename ("", "Load <arg> file to analyze", cl::NoFlags, "-");
Chris Lattnera8e1fd32001-07-23 20:22:30 +0000122cl::Flag Quiet ("q", "Don't print analysis pass names");
123cl::Alias QuietA ("quiet", "Alias for -q", cl::NoFlags, Quiet);
Chris Lattner8f367bd2001-07-23 02:35:57 +0000124cl::EnumList<enum Ans> AnalysesList(cl::NoFlags,
125 clEnumVal(print , "Print each Method"),
126 clEnumVal(intervals , "Print Interval Partitions"),
127 clEnumVal(exprclassify , "Classify Expressions"),
Chris Lattnerb3122592001-09-14 01:42:42 +0000128 clEnumVal(instforest , "Print Instruction Forest"),
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000129 clEnumVal(callgraph , "Print Call Graph"),
Chris Lattner9f8ae2b2001-11-09 05:27:34 +0000130 clEnumVal(printusedtypes , "Print Types Used by Module"),
Chris Lattner483c3ee2001-11-07 21:16:29 +0000131 clEnumVal(unsafepointertypes, "Print Unsafe Pointer Types"),
Chris Lattner8f367bd2001-07-23 02:35:57 +0000132
133 clEnumVal(domset , "Print Dominator Sets"),
134 clEnumVal(idom , "Print Immediate Dominators"),
135 clEnumVal(domtree , "Print Dominator Tree"),
136 clEnumVal(domfrontier , "Print Dominance Frontier"),
137
138 clEnumVal(postdomset , "Print Postdominator Sets"),
139 clEnumVal(postidom , "Print Immediate Postdominators"),
140 clEnumVal(postdomtree , "Print Post Dominator Tree"),
141 clEnumVal(postdomfrontier, "Print Postdominance Frontier"),
1420);
143
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000144struct {
Chris Lattner8f367bd2001-07-23 02:35:57 +0000145 enum Ans AnID;
Chris Lattnerc13aff62001-07-06 16:59:10 +0000146 void (*AnPtr)(Method *M);
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000147} MethAnTable[] = {
Chris Lattner8f367bd2001-07-23 02:35:57 +0000148 { print , PrintMethod },
149 { intervals , PrintIntervalPartition },
150 { exprclassify , PrintClassifiedExprs },
Chris Lattnerb3122592001-09-14 01:42:42 +0000151 { instforest , PrintInstForest },
Chris Lattnerc13aff62001-07-06 16:59:10 +0000152
Chris Lattner8f367bd2001-07-23 02:35:57 +0000153 { domset , PrintDominatorSets },
154 { idom , PrintImmediateDominators },
155 { domtree , PrintDominatorTree },
156 { domfrontier , PrintDominanceFrontier },
Chris Lattnerc13aff62001-07-06 16:59:10 +0000157
Chris Lattner8f367bd2001-07-23 02:35:57 +0000158 { postdomset , PrintPostDominatorSets },
159 { postidom , PrintImmediatePostDoms },
160 { postdomtree , PrintPostDomTree },
161 { postdomfrontier, PrintPostDomFrontier },
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000162};
163
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000164pair<enum Ans, void (*)(Module *)> ModAnTable[] = {
Chris Lattner9f8ae2b2001-11-09 05:27:34 +0000165 pair<enum Ans, void (*)(Module *)>(callgraph , PrintCallGraph),
166 pair<enum Ans, void (*)(Module *)>(printusedtypes , PrintUsedTypes),
Chris Lattner483c3ee2001-11-07 21:16:29 +0000167 pair<enum Ans, void (*)(Module *)>(unsafepointertypes, PrintUnsafePtrTypes),
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000168};
169
170
171
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000172int main(int argc, char **argv) {
Chris Lattner8f367bd2001-07-23 02:35:57 +0000173 cl::ParseCommandLineOptions(argc, argv, " llvm analysis printer tool\n");
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000174
Chris Lattner1e78f362001-07-23 19:27:24 +0000175 Module *C = ParseBytecodeFile(InputFilename);
176 if (!C && !(C = ParseAssemblyFile(InputFilename))) {
Chris Lattnerc13aff62001-07-06 16:59:10 +0000177 cerr << "Input file didn't read correctly.\n";
178 return 1;
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000179 }
180
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000181 // Loop over all of the analyses looking for module level analyses to run...
182 for (unsigned i = 0; i < AnalysesList.size(); ++i) {
183 enum Ans AnalysisPass = AnalysesList[i];
184
185 for (unsigned j = 0; j < sizeof(ModAnTable)/sizeof(ModAnTable[0]); ++j) {
186 if (ModAnTable[j].first == AnalysisPass) {
187 if (!Quiet)
188 cerr << "Running: " << AnalysesList.getArgDescription(AnalysisPass)
189 << " analysis on module!\n";
190 ModAnTable[j].second(C);
191 AnalysesList[i] = PassDone; // Mark pass as complete so that we don't
192 break; // get an error later
193 }
194 }
195 }
196
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000197 // Loop over all of the methods in the module...
Chris Lattnerc13aff62001-07-06 16:59:10 +0000198 for (Module::iterator I = C->begin(), E = C->end(); I != E; ++I) {
199 Method *M = *I;
Chris Lattner1546bff2001-07-20 19:16:29 +0000200 if (M->isExternal()) continue;
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000201
Chris Lattner8f367bd2001-07-23 02:35:57 +0000202 for (unsigned i = 0; i < AnalysesList.size(); ++i) {
203 enum Ans AnalysisPass = AnalysesList[i];
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000204 if (AnalysisPass == PassDone) continue; // Don't rerun module analyses
Chris Lattner8f367bd2001-07-23 02:35:57 +0000205
206 // Loop over all of the analyses to be run...
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000207 unsigned j;
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000208 for (j = 0; j < sizeof(MethAnTable)/sizeof(MethAnTable[0]); ++j) {
209 if (AnalysisPass == MethAnTable[j].AnID) {
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000210 if (!Quiet)
Chris Lattner8f367bd2001-07-23 02:35:57 +0000211 cerr << "Running: " << AnalysesList.getArgDescription(AnalysisPass)
212 << " analysis on '" << ((Value*)M)->getName() << "'!\n";
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000213 MethAnTable[j].AnPtr(M);
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000214 break;
215 }
216 }
Chris Lattnerc4199ec2001-09-28 00:07:36 +0000217 if (j == sizeof(MethAnTable)/sizeof(MethAnTable[0]))
Chris Lattner8f367bd2001-07-23 02:35:57 +0000218 cerr << "Analysis tables inconsistent!\n";
Chris Lattnerf3dc2c92001-07-03 15:30:38 +0000219 }
220 }
221
222 delete C;
223 return 0;
224}