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/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"
26 Statistic<> NumPromoted("mem2reg", "Number of alloca's promoted");
28 struct PromotePass : public FunctionPass {
29 // runOnFunction - To run this pass, first we calculate the alloca
30 // instructions that are safe for promotion, then we promote each one.
32 virtual bool runOnFunction(Function &F);
34 // getAnalysisUsage - We need dominance frontiers
36 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
37 AU.addRequired<DominatorTree>();
38 AU.addRequired<DominanceFrontier>();
39 AU.addRequired<TargetData>();
41 // This is a cluster of orthogonal Transforms
42 AU.addPreserved<UnifyFunctionExitNodes>();
43 AU.addPreservedID(LowerSelectID);
44 AU.addPreservedID(LowerSwitchID);
45 AU.addPreservedID(LowerInvokePassID);
46 AU.addPreservedID(LowerAllocationsID);
50 RegisterOpt<PromotePass> X("mem2reg", "Promote Memory to Register");
51 } // end of anonymous namespace
53 bool PromotePass::runOnFunction(Function &F) {
54 std::vector<AllocaInst*> Allocas;
55 const TargetData &TD = getAnalysis<TargetData>();
57 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
61 DominatorTree &DT = getAnalysis<DominatorTree>();
62 DominanceFrontier &DF = getAnalysis<DominanceFrontier>();
67 // Find allocas that are safe to promote, by looking at all instructions in
69 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
70 if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) // Is it an alloca?
71 if (isAllocaPromotable(AI, TD))
72 Allocas.push_back(AI);
74 if (Allocas.empty()) break;
76 PromoteMemToReg(Allocas, DT, DF, TD);
77 NumPromoted += Allocas.size();
84 // Publically exposed interface to pass...
85 const PassInfo *llvm::PromoteMemoryToRegisterID = X.getPassInfo();
86 // createPromoteMemoryToRegister - Provide an entry point to create this pass.
88 FunctionPass *llvm::createPromoteMemoryToRegisterPass() {
89 return new PromotePass();