lib/Analysis/RegionInfo.cpp

   1 //===- RegionInfo.cpp - SESE region detection analysis --------------------===//
   2 //
   3 //                     The LLVM Compiler Infrastructure
   4 //
   5 // This file is distributed under the University of Illinois Open Source
   6 // License. See LICENSE.TXT for details.
   7 //
   8 //===----------------------------------------------------------------------===//
   9 // Detects single entry single exit regions in the control flow graph.
  10 //===----------------------------------------------------------------------===//
  11
  12 #include "llvm/Analysis/RegionInfo.h"
  13 #include "llvm/Analysis/RegionInfoImpl.h"
  14 #include "llvm/ADT/PostOrderIterator.h"
  15 #include "llvm/ADT/Statistic.h"
  16 #include "llvm/Analysis/LoopInfo.h"
  17 #include "llvm/Analysis/RegionIterator.h"
  18 #include "llvm/Support/CommandLine.h"
  19 #include "llvm/Support/Debug.h"
  20 #include "llvm/Support/ErrorHandling.h"
  21 #include <algorithm>
  22 #include <iterator>
  23 #include <set>
  24
  25 using namespace llvm;
  26
  27 #define DEBUG_TYPE "region"
  28
  29 namespace llvm {
  30 template class RegionBase<RegionTraits<Function>>;
  31 template class RegionNodeBase<RegionTraits<Function>>;
  32 template class RegionInfoBase<RegionTraits<Function>>;
  33 }
  34
  35 STATISTIC(numRegions,       "The # of regions");
  36 STATISTIC(numSimpleRegions, "The # of simple regions");
  37
  38 // Always verify if expensive checking is enabled.
  39
  40 static cl::opt<bool,true>
  41 VerifyRegionInfoX(
  42   "verify-region-info",
  43   cl::location(RegionInfoBase<RegionTraits<Function>>::VerifyRegionInfo),
  44   cl::desc("Verify region info (time consuming)"));
  45
  46
  47 static cl::opt<Region::PrintStyle, true> printStyleX("print-region-style",
  48   cl::location(RegionInfo::printStyle),
  49   cl::Hidden,
  50   cl::desc("style of printing regions"),
  51   cl::values(
  52     clEnumValN(Region::PrintNone, "none",  "print no details"),
  53     clEnumValN(Region::PrintBB, "bb",
  54                "print regions in detail with block_iterator"),
  55     clEnumValN(Region::PrintRN, "rn",
  56                "print regions in detail with element_iterator"),
  57     clEnumValEnd));
  58
  59
  60 //===----------------------------------------------------------------------===//
  61 // Region implementation
  62 //
  63
  64 Region::Region(BasicBlock *Entry, BasicBlock *Exit,
  65                RegionInfo* RI,
  66                DominatorTree *DT, Region *Parent) :
  67   RegionBase<RegionTraits<Function>>(Entry, Exit, RI, DT, Parent) {
  68
  69 }
  70
  71 Region::~Region() { }
  72
  73 //===----------------------------------------------------------------------===//
  74 // RegionInfo implementation
  75 //
  76
  77 RegionInfo::RegionInfo() :
  78   RegionInfoBase<RegionTraits<Function>>() {
  79
  80 }
  81
  82 RegionInfo::~RegionInfo() {
  83
  84 }
  85
  86 void RegionInfo::updateStatistics(Region *R) {
  87   ++numRegions;
  88
  89   // TODO: Slow. Should only be enabled if -stats is used.
  90   if (R->isSimple())
  91     ++numSimpleRegions;
  92 }
  93
  94 void RegionInfo::RegionInfo::recalculate(Function &F,
  95                                          DominatorTree *DT_,
  96                                          PostDominatorTree *PDT_,
  97                                          DominanceFrontier *DF_) {
  98   DT = DT_;
  99   PDT = PDT_;
 100   DF = DF_;
 101
 102   TopLevelRegion = new Region(&F.getEntryBlock(), nullptr,
 103                               this, DT, nullptr);
 104   updateStatistics(TopLevelRegion);
 105   calculate(F);
 106 }
 107
 108 //===----------------------------------------------------------------------===//
 109 // RegionInfoPass implementation
 110 //
 111
 112 RegionInfoPass::RegionInfoPass() : FunctionPass(ID) {
 113   initializeRegionInfoPassPass(*PassRegistry::getPassRegistry());
 114 }
 115
 116 RegionInfoPass::~RegionInfoPass() {
 117
 118 }
 119
 120 bool RegionInfoPass::runOnFunction(Function &F) {
 121   releaseMemory();
 122
 123   auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
 124   auto PDT = &getAnalysis<PostDominatorTree>();
 125   auto DF = &getAnalysis<DominanceFrontier>();
 126
 127   RI.recalculate(F, DT, PDT, DF);
 128   return false;
 129 }
 130
 131 void RegionInfoPass::releaseMemory() {
 132   RI.releaseMemory();
 133 }
 134
 135 void RegionInfoPass::verifyAnalysis() const {
 136     RI.verifyAnalysis();
 137 }
 138
 139 void RegionInfoPass::getAnalysisUsage(AnalysisUsage &AU) const {
 140   AU.setPreservesAll();
 141   AU.addRequiredTransitive<DominatorTreeWrapperPass>();
 142   AU.addRequired<PostDominatorTree>();
 143   AU.addRequired<DominanceFrontier>();
 144 }
 145
 146 void RegionInfoPass::print(raw_ostream &OS, const Module *) const {
 147   RI.print(OS);
 148 }
 149
 150 void RegionInfoPass::dump() const {
 151   RI.dump();
 152 }
 153
 154 char RegionInfoPass::ID = 0;
 155
 156 INITIALIZE_PASS_BEGIN(RegionInfoPass, "regions",
 157                 "Detect single entry single exit regions", true, true)
 158 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
 159 INITIALIZE_PASS_DEPENDENCY(PostDominatorTree)
 160 INITIALIZE_PASS_DEPENDENCY(DominanceFrontier)
 161 INITIALIZE_PASS_END(RegionInfoPass, "regions",
 162                 "Detect single entry single exit regions", true, true)
 163
 164 // Create methods available outside of this file, to use them
 165 // "include/llvm/LinkAllPasses.h". Otherwise the pass would be deleted by
 166 // the link time optimization.
 167
 168 namespace llvm {
 169   FunctionPass *createRegionInfoPass() {
 170     return new RegionInfoPass();
 171   }
 172 }
 173