1 //===- Mem2Reg.cpp - The -mem2reg pass, a wrapper around the Utils lib ----===//
3 // The LLVM Compiler Infrastructure
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.
8 //===----------------------------------------------------------------------===//
10 // This pass is a simple pass wrapper around the PromoteMemToReg function call
11 // exposed by the Utils library.
13 //===----------------------------------------------------------------------===//
15 #include "llvm/Transforms/Scalar.h"
16 #include "llvm/Transforms/Utils/PromoteMemToReg.h"
17 #include "llvm/Analysis/Dominators.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/Function.h"
20 #include "llvm/Target/TargetData.h"
21 #include "llvm/ADT/Statistic.h"
25 Statistic<> NumPromoted("mem2reg", "Number of alloca's promoted");
27 struct PromotePass : public FunctionPass {
28 // runOnFunction - To run this pass, first we calculate the alloca
29 // instructions that are safe for promotion, then we promote each one.
31 virtual bool runOnFunction(Function &F);
33 // getAnalysisUsage - We need dominance frontiers
35 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
36 AU.addRequired<DominatorTree>();
37 AU.addRequired<DominanceFrontier>();
38 AU.addRequired<TargetData>();
43 RegisterOpt<PromotePass> X("mem2reg", "Promote Memory to Register");
44 } // end of anonymous namespace
46 bool PromotePass::runOnFunction(Function &F) {
47 std::vector<AllocaInst*> Allocas;
48 const TargetData &TD = getAnalysis<TargetData>();
50 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
54 DominatorTree &DT = getAnalysis<DominatorTree>();
55 DominanceFrontier &DF = getAnalysis<DominanceFrontier>();
60 // Find allocas that are safe to promote, by looking at all instructions in
62 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
63 if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) // Is it an alloca?
64 if (isAllocaPromotable(AI, TD))
65 Allocas.push_back(AI);
67 if (Allocas.empty()) break;
69 PromoteMemToReg(Allocas, DT, DF, TD);
70 NumPromoted += Allocas.size();
77 // createPromoteMemoryToRegister - Provide an entry point to create this pass.
79 FunctionPass *llvm::createPromoteMemoryToRegister() {
80 return new PromotePass();