blob: b731ab1a4f7c025505ed1915278352b8e82ec811 [file] [log] [blame]
Chris Lattner26f15902003-02-22 23:57:48 +00001//===- Mem2Reg.cpp - The -mem2reg pass, a wrapper around the Utils lib ----===//
2//
3// This pass is a simple pass wrapper around the PromoteMemToReg function call
4// exposed by the Utils library.
5//
6//===----------------------------------------------------------------------===//
7
8#include "llvm/Transforms/Scalar.h"
9#include "llvm/Transforms/Utils/PromoteMemToReg.h"
10#include "llvm/Analysis/Dominators.h"
11#include "llvm/iMemory.h"
12#include "llvm/Function.h"
Chris Lattnere27406e2003-03-03 17:25:18 +000013#include "llvm/Target/TargetData.h"
Chris Lattner26f15902003-02-22 23:57:48 +000014#include "Support/Statistic.h"
15
16namespace {
17 Statistic<> NumPromoted("mem2reg", "Number of alloca's promoted");
18
19 struct PromotePass : public FunctionPass {
20 // runOnFunction - To run this pass, first we calculate the alloca
21 // instructions that are safe for promotion, then we promote each one.
22 //
23 virtual bool runOnFunction(Function &F);
24
25 // getAnalysisUsage - We need dominance frontiers
26 //
27 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
28 AU.addRequired<DominanceFrontier>();
Chris Lattnere27406e2003-03-03 17:25:18 +000029 AU.addRequired<TargetData>();
Chris Lattner26f15902003-02-22 23:57:48 +000030 AU.setPreservesCFG();
31 }
32 };
33
34 RegisterOpt<PromotePass> X("mem2reg", "Promote Memory to Register");
35} // end of anonymous namespace
36
37bool PromotePass::runOnFunction(Function &F) {
38 std::vector<AllocaInst*> Allocas;
Chris Lattnere27406e2003-03-03 17:25:18 +000039 const TargetData &TD = getAnalysis<TargetData>();
Chris Lattner26f15902003-02-22 23:57:48 +000040
41 BasicBlock &BB = F.getEntryNode(); // Get the entry node for the function
42
Chris Lattnerb396afd2003-06-25 14:58:56 +000043 bool Changed = false;
44
45 while (1) {
46 Allocas.clear();
Chris Lattner26f15902003-02-22 23:57:48 +000047
Chris Lattnerb396afd2003-06-25 14:58:56 +000048 // Find allocas that are safe to promote, by looking at all instructions in
49 // the entry node
50 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
51 if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) // Is it an alloca?
52 if (isAllocaPromotable(AI, TD))
53 Allocas.push_back(AI);
54
55 if (Allocas.empty()) break;
56
Chris Lattnere27406e2003-03-03 17:25:18 +000057 PromoteMemToReg(Allocas, getAnalysis<DominanceFrontier>(), TD);
Chris Lattner26f15902003-02-22 23:57:48 +000058 NumPromoted += Allocas.size();
Chris Lattnerb396afd2003-06-25 14:58:56 +000059 Changed = true;
Chris Lattner26f15902003-02-22 23:57:48 +000060 }
Chris Lattnerb396afd2003-06-25 14:58:56 +000061
62 return Changed;
Chris Lattner26f15902003-02-22 23:57:48 +000063}
64
65// createPromoteMemoryToRegister - Provide an entry point to create this pass.
66//
67Pass *createPromoteMemoryToRegister() {
68 return new PromotePass();
69}