lib/Transforms/Utils/Mem2Reg.cpp

   1 //===- Mem2Reg.cpp - The -mem2reg pass, a wrapper around the Utils lib ----===//
   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 pass is a simple pass wrapper around the PromoteMemToReg function call
  11 // exposed by the Utils library.
  12 //
  13 //===----------------------------------------------------------------------===//
  14
  15 #include "llvm/Transforms/Scalar.h"
  16 #include "llvm/Transforms/Utils/PromoteMemToReg.h"
  17 #include "llvm/Transforms/Utils/UnifyFunctionExitNodes.h"
  18 #include "llvm/Analysis/Dominators.h"
  19 #include "llvm/Instructions.h"
  20 #include "llvm/Function.h"
  21 #include "llvm/Target/TargetData.h"
  22 #include "llvm/ADT/Statistic.h"
  23 #include "llvm/Support/Visibility.h"
  24 using namespace llvm;
  25
  26 namespace {
  27   Statistic<> NumPromoted("mem2reg", "Number of alloca's promoted");
  28
  29   struct VISIBILITY_HIDDEN PromotePass : public FunctionPass {
  30     // runOnFunction - To run this pass, first we calculate the alloca
  31     // instructions that are safe for promotion, then we promote each one.
  32     //
  33     virtual bool runOnFunction(Function &F);
  34
  35     // getAnalysisUsage - We need dominance frontiers
  36     //
  37     virtual void getAnalysisUsage(AnalysisUsage &AU) const {
  38       AU.addRequired<DominatorTree>();
  39       AU.addRequired<DominanceFrontier>();
  40       AU.addRequired<TargetData>();
  41       AU.setPreservesCFG();
  42       // This is a cluster of orthogonal Transforms
  43       AU.addPreserved<UnifyFunctionExitNodes>();
  44       AU.addPreservedID(LowerSelectID);
  45       AU.addPreservedID(LowerSwitchID);
  46       AU.addPreservedID(LowerInvokePassID);
  47       AU.addPreservedID(LowerAllocationsID);
  48     }
  49   };
  50
  51   RegisterOpt<PromotePass> X("mem2reg", "Promote Memory to Register");
  52 }  // end of anonymous namespace
  53
  54 bool PromotePass::runOnFunction(Function &F) {
  55   std::vector<AllocaInst*> Allocas;
  56   const TargetData &TD = getAnalysis<TargetData>();
  57
  58   BasicBlock &BB = F.getEntryBlock();  // Get the entry node for the function
  59
  60   bool Changed  = false;
  61
  62   DominatorTree     &DT = getAnalysis<DominatorTree>();
  63   DominanceFrontier &DF = getAnalysis<DominanceFrontier>();
  64
  65   while (1) {
  66     Allocas.clear();
  67
  68     // Find allocas that are safe to promote, by looking at all instructions in
  69     // the entry node
  70     for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
  71       if (AllocaInst *AI = dyn_cast<AllocaInst>(I))       // Is it an alloca?
  72         if (isAllocaPromotable(AI, TD))
  73           Allocas.push_back(AI);
  74
  75     if (Allocas.empty()) break;
  76
  77     PromoteMemToReg(Allocas, DT, DF, TD);
  78     NumPromoted += Allocas.size();
  79     Changed = true;
  80   }
  81
  82   return Changed;
  83 }
  84
  85 // Publically exposed interface to pass...
  86 const PassInfo *llvm::PromoteMemoryToRegisterID = X.getPassInfo();
  87 // createPromoteMemoryToRegister - Provide an entry point to create this pass.
  88 //
  89 FunctionPass *llvm::createPromoteMemoryToRegisterPass() {
  90   return new PromotePass();
  91 }