tools/opt/PrintSCC.cpp

   1 //===- PrintSCC.cpp - Enumerate SCCs in some key graphs -------------------===//
   2 //
   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.
   7 //
   8 //===----------------------------------------------------------------------===//
   9 //
  10 // This file provides passes to print out SCCs in a CFG or a CallGraph.
  11 // Normally, you would not use these passes; instead, you would use the
  12 // scc_iterator directly to enumerate SCCs and process them in some way.  These
  13 // passes serve three purposes:
  14 //
  15 // (1) As a reference for how to use the scc_iterator.
  16 // (2) To print out the SCCs for a CFG or a CallGraph:
  17 //       analyze -cfgscc            to print the SCCs in each CFG of a module.
  18 //       analyze -cfgscc -stats     to print the #SCCs and the maximum SCC size.
  19 //       analyze -cfgscc -debug > /dev/null to watch the algorithm in action.
  20 //
  21 //     and similarly:
  22 //       analyze -callscc [-stats] [-debug] to print SCCs in the CallGraph
  23 //
  24 // (3) To test the scc_iterator.
  25 //
  26 //===----------------------------------------------------------------------===//
  27
  28 #include "llvm/Pass.h"
  29 #include "llvm/Module.h"
  30 #include "llvm/Analysis/CallGraph.h"
  31 #include "llvm/Support/CFG.h"
  32 #include "llvm/ADT/SCCIterator.h"
  33 #include <iostream>
  34 using namespace llvm;
  35
  36 namespace {
  37   struct CFGSCC : public FunctionPass {
  38     static char ID;  // Pass identification, replacement for typeid
  39     CFGSCC() : FunctionPass((intptr_t)&ID) {}
  40     bool runOnFunction(Function& func);
  41
  42     void print(std::ostream &O, const Module* = 0) const { }
  43
  44     virtual void getAnalysisUsage(AnalysisUsage &AU) const {
  45       AU.setPreservesAll();
  46     }
  47   };
  48
  49   struct CallGraphSCC : public ModulePass {
  50     static char ID;  // Pass identification, replacement for typeid
  51     CallGraphSCC() : ModulePass((intptr_t)&ID) {}
  52
  53     // run - Print out SCCs in the call graph for the specified module.
  54     bool runOnModule(Module &M);
  55
  56     void print(std::ostream &O, const Module* = 0) const { }
  57
  58     // getAnalysisUsage - This pass requires the CallGraph.
  59     virtual void getAnalysisUsage(AnalysisUsage &AU) const {
  60       AU.setPreservesAll();
  61       AU.addRequired<CallGraph>();
  62     }
  63   };
  64
  65   char CFGSCC::ID = 0;
  66   RegisterPass<CFGSCC>
  67   Y("cfgscc", "Print SCCs of each function CFG");
  68
  69   char CallGraphSCC::ID = 0;
  70   RegisterPass<CallGraphSCC>
  71   Z("callscc", "Print SCCs of the Call Graph");
  72 }
  73
  74 bool CFGSCC::runOnFunction(Function &F) {
  75   unsigned sccNum = 0;
  76   std::cout << "SCCs for Function " << F.getName() << " in PostOrder:";
  77   for (scc_iterator<Function*> SCCI = scc_begin(&F),
  78          E = scc_end(&F); SCCI != E; ++SCCI) {
  79     std::vector<BasicBlock*> &nextSCC = *SCCI;
  80     std::cout << "\nSCC #" << ++sccNum << " : ";
  81     for (std::vector<BasicBlock*>::const_iterator I = nextSCC.begin(),
  82            E = nextSCC.end(); I != E; ++I)
  83       std::cout << (*I)->getName() << ", ";
  84     if (nextSCC.size() == 1 && SCCI.hasLoop())
  85       std::cout << " (Has self-loop).";
  86   }
  87   std::cout << "\n";
  88
  89   return true;
  90 }
  91
  92
  93 // run - Print out SCCs in the call graph for the specified module.
  94 bool CallGraphSCC::runOnModule(Module &M) {
  95   CallGraphNode* rootNode = getAnalysis<CallGraph>().getRoot();
  96   unsigned sccNum = 0;
  97   std::cout << "SCCs for the program in PostOrder:";
  98   for (scc_iterator<CallGraphNode*> SCCI = scc_begin(rootNode),
  99          E = scc_end(rootNode); SCCI != E; ++SCCI) {
 100     const std::vector<CallGraphNode*> &nextSCC = *SCCI;
 101     std::cout << "\nSCC #" << ++sccNum << " : ";
 102     for (std::vector<CallGraphNode*>::const_iterator I = nextSCC.begin(),
 103            E = nextSCC.end(); I != E; ++I)
 104       std::cout << ((*I)->getFunction() ? (*I)->getFunction()->getName()
 105                     : std::string("Indirect CallGraph node")) << ", ";
 106     if (nextSCC.size() == 1 && SCCI.hasLoop())
 107       std::cout << " (Has self-loop).";
 108   }
 109   std::cout << "\n";
 110
 111   return true;
 112 }