1 //===----------------------------------------------------------------------===//
2 // The LLVM analyze utility
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.
8 // analyze --help - Output information about command line switches
9 // analyze --quiet - Do not print analysis name before output
11 //===----------------------------------------------------------------------===//
13 #include "llvm/Module.h"
14 #include "llvm/iPHINode.h"
15 #include "llvm/Type.h"
16 #include "llvm/PassManager.h"
17 #include "llvm/Bytecode/Reader.h"
18 #include "llvm/Assembly/Parser.h"
19 #include "llvm/Assembly/PrintModulePass.h"
20 #include "llvm/Assembly/Writer.h"
21 #include "llvm/Analysis/Writer.h"
22 #include "llvm/Analysis/InstForest.h"
23 #include "llvm/Analysis/Dominators.h"
24 #include "llvm/Analysis/IntervalPartition.h"
25 #include "llvm/Analysis/Expressions.h"
26 #include "llvm/Analysis/InductionVariable.h"
27 #include "llvm/Analysis/CallGraph.h"
28 #include "llvm/Analysis/LoopInfo.h"
29 #include "llvm/Analysis/DataStructure.h"
30 #include "llvm/Analysis/FindUnsafePointerTypes.h"
31 #include "llvm/Analysis/FindUsedTypes.h"
32 #include "llvm/Support/InstIterator.h"
33 #include "Support/CommandLine.h"
38 //===----------------------------------------------------------------------===//
39 // printPass - Specify how to print out a pass. For most passes, the standard
40 // way of using operator<< works great, so we use it directly...
42 template<class PassType>
43 static void printPass(PassType &P, ostream &O, Module &M) {
47 template<class PassType>
48 static void printPass(PassType &P, ostream &O, Function &F) {
52 // Other classes require more information to print out information, so we
53 // specialize the template here for them...
56 static void printPass(LocalDataStructures &P, ostream &O, Module &M) {
60 static void printPass(BUDataStructures &P, ostream &O, Module &M) {
65 static void printPass(FindUsedTypes &FUT, ostream &O, Module &M) {
66 FUT.printTypes(O, &M);
70 static void printPass(FindUnsafePointerTypes &FUPT, ostream &O, Module &M) {
71 FUPT.printResults(&M, O);
76 template <class PassType, class PassName>
77 class PassPrinter; // Do not implement
79 template <class PassName>
80 class PassPrinter<Pass, PassName> : public Pass {
83 PassPrinter(AnalysisID id) : ID(id) {}
85 const char *getPassName() const { return "IP Pass Printer"; }
87 virtual bool run(Module &M) {
88 printPass(getAnalysis<PassName>(ID), std::cout, M);
92 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
97 template <class PassName>
98 class PassPrinter<FunctionPass, PassName> : public FunctionPass {
101 PassPrinter(AnalysisID id) : ID(id) {}
103 const char *getPassName() const { return "Function Pass Printer"; }
105 virtual bool runOnFunction(Function &F) {
106 std::cout << "Running on function '" << F.getName() << "'\n";
107 printPass(getAnalysis<PassName>(ID), std::cout, F);
111 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
113 AU.setPreservesAll();
119 template <class PassType, class PassName, AnalysisID &ID>
121 return new PassPrinter<PassType, PassName>(ID);
123 template <class PassType, class PassName>
125 return new PassPrinter<PassType, PassName>(PassName::ID);
129 Pass *createPrintFunctionPass() {
130 return new PrintFunctionPass("", &std::cout);
132 Pass *createPrintModulePass() {
133 return new PrintModulePass(&std::cout);
136 struct InstForestHelper : public FunctionPass {
137 const char *getPassName() const { return "InstForest Printer"; }
139 void doit(Function &F) {
140 std::cout << InstForest<char>(&F);
143 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
144 AU.setPreservesAll();
148 struct IndVars : public FunctionPass {
149 const char *getPassName() const { return "IndVars Printer"; }
151 void doit(Function &F) {
152 LoopInfo &LI = getAnalysis<LoopInfo>();
153 for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I)
154 if (PHINode *PN = dyn_cast<PHINode>(*I)) {
155 InductionVariable IV(PN, &LI);
156 if (IV.InductionType != InductionVariable::Unknown)
161 void getAnalysisUsage(AnalysisUsage &AU) const {
162 AU.addRequired(LoopInfo::ID);
163 AU.setPreservesAll();
167 struct Exprs : public FunctionPass {
168 const char *getPassName() const { return "Expression Printer"; }
170 static void doit(Function &F) {
171 std::cout << "Classified expressions for: " << F.getName() << "\n";
172 for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I) {
175 if ((*I)->getType() == Type::VoidTy) continue;
176 analysis::ExprType R = analysis::ClassifyExpression(*I);
177 if (R.Var == *I) continue; // Doesn't tell us anything
179 std::cout << "\t\tExpr =";
181 case analysis::ExprType::ScaledLinear:
182 WriteAsOperand(std::cout << "(", (Value*)R.Scale) << " ) *";
184 case analysis::ExprType::Linear:
185 WriteAsOperand(std::cout << "(", R.Var) << " )";
186 if (R.Offset == 0) break;
187 else std::cout << " +";
189 case analysis::ExprType::Constant:
190 if (R.Offset) WriteAsOperand(std::cout, (Value*)R.Offset);
191 else std::cout << " 0";
197 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
198 AU.setPreservesAll();
203 template<class TraitClass>
204 struct PrinterPass : public TraitClass {
207 virtual bool runOnFunction(Function &F) {
208 std::cout << "Running on function '" << F.getName() << "'\n";
216 template<class PassClass>
218 return new PassClass();
225 print, intervals, exprs, instforest, loops, indvars,
228 printmodule, callgraph, datastructure, budatastructure,
229 printusedtypes, unsafepointertypes,
231 domset, idom, domtree, domfrontier,
232 postdomset, postidom, postdomtree, postdomfrontier,
235 static cl::opt<std::string>
236 InputFilename(cl::Positional, cl::desc("<input file>"), cl::init("-"),
237 cl::value_desc("filename"));
239 static cl::opt<bool> Quiet("q", cl::desc("Don't print analysis pass names"));
240 static cl::alias QuietA("quiet", cl::desc("Alias for -q"),
241 cl::aliasopt(Quiet));
243 static cl::list<enum Ans>
244 AnalysesList(cl::desc("Analyses available:"),
246 clEnumVal(print , "Print each function"),
247 clEnumVal(intervals , "Print Interval Partitions"),
248 clEnumVal(exprs , "Classify Expressions"),
249 clEnumVal(instforest , "Print Instruction Forest"),
250 clEnumVal(loops , "Print natural loops"),
251 clEnumVal(indvars , "Print Induction Variables"),
253 clEnumVal(printmodule , "Print entire module"),
254 clEnumVal(callgraph , "Print Call Graph"),
255 clEnumVal(datastructure , "Print data structure information"),
256 clEnumVal(budatastructure, "Print bottom-up data structure information"),
257 clEnumVal(printusedtypes , "Print types used by module"),
258 clEnumVal(unsafepointertypes, "Print unsafe pointer types"),
260 clEnumVal(domset , "Print Dominator Sets"),
261 clEnumVal(idom , "Print Immediate Dominators"),
262 clEnumVal(domtree , "Print Dominator Tree"),
263 clEnumVal(domfrontier , "Print Dominance Frontier"),
265 clEnumVal(postdomset , "Print Postdominator Sets"),
266 clEnumVal(postidom , "Print Immediate Postdominators"),
267 clEnumVal(postdomtree , "Print Post Dominator Tree"),
268 clEnumVal(postdomfrontier, "Print Postdominance Frontier"),
274 Pass *(*PassConstructor)();
277 { print , createPrintFunctionPass },
278 { intervals , New<FunctionPass, IntervalPartition> },
279 { loops , New<FunctionPass, LoopInfo> },
280 { instforest , Create<PrinterPass<InstForestHelper> > },
281 { indvars , Create<PrinterPass<IndVars> > },
282 { exprs , Create<PrinterPass<Exprs> > },
285 { printmodule , createPrintModulePass },
286 { printusedtypes , New<Pass, FindUsedTypes> },
287 { callgraph , New<Pass, CallGraph> },
288 { datastructure , New<Pass, LocalDataStructures> },
289 { budatastructure , New<Pass, BUDataStructures> },
290 { unsafepointertypes, New<Pass, FindUnsafePointerTypes> },
292 // Dominator analyses
293 { domset , New<FunctionPass, DominatorSet> },
294 { idom , New<FunctionPass, ImmediateDominators> },
295 { domtree , New<FunctionPass, DominatorTree> },
296 { domfrontier , New<FunctionPass, DominanceFrontier> },
298 { postdomset , New<FunctionPass, DominatorSet, DominatorSet::PostDomID> },
299 { postidom , New<FunctionPass, ImmediateDominators, ImmediateDominators::PostDomID> },
300 { postdomtree , New<FunctionPass, DominatorTree, DominatorTree::PostDomID> },
301 { postdomfrontier , New<FunctionPass, DominanceFrontier, DominanceFrontier::PostDomID> },
304 int main(int argc, char **argv) {
305 cl::ParseCommandLineOptions(argc, argv, " llvm analysis printer tool\n");
309 CurMod = ParseBytecodeFile(InputFilename);
310 if (!CurMod && !(CurMod = ParseAssemblyFile(InputFilename))){
311 std::cerr << "Input file didn't read correctly.\n";
314 } catch (const ParseException &E) {
315 std::cerr << E.getMessage() << "\n";
319 // Create a PassManager to hold and optimize the collection of passes we are
322 PassManager Analyses;
324 // Loop over all of the analyses looking for analyses to run...
325 for (unsigned i = 0; i < AnalysesList.size(); ++i) {
326 enum Ans AnalysisPass = AnalysesList[i];
328 for (unsigned j = 0; j < sizeof(AnTable)/sizeof(AnTable[0]); ++j) {
329 if (AnTable[j].AnID == AnalysisPass) {
330 Analyses.add(AnTable[j].PassConstructor());
331 break; // get an error later
336 Analyses.run(*CurMod);