Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 1 | //===- 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 Lattner | fb743a9 | 2003-03-03 17:25:18 +0000 | [diff] [blame] | 13 | #include "llvm/Target/TargetData.h" |
Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 14 | #include "Support/Statistic.h" |
| 15 | |
| 16 | namespace { |
| 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 { |
Chris Lattner | 43f820d | 2003-10-05 21:20:13 +0000 | [diff] [blame] | 28 | AU.addRequired<DominatorTree>(); |
Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 29 | AU.addRequired<DominanceFrontier>(); |
Chris Lattner | fb743a9 | 2003-03-03 17:25:18 +0000 | [diff] [blame] | 30 | AU.addRequired<TargetData>(); |
Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 31 | AU.setPreservesCFG(); |
| 32 | } |
| 33 | }; |
| 34 | |
| 35 | RegisterOpt<PromotePass> X("mem2reg", "Promote Memory to Register"); |
| 36 | } // end of anonymous namespace |
| 37 | |
| 38 | bool PromotePass::runOnFunction(Function &F) { |
| 39 | std::vector<AllocaInst*> Allocas; |
Chris Lattner | fb743a9 | 2003-03-03 17:25:18 +0000 | [diff] [blame] | 40 | const TargetData &TD = getAnalysis<TargetData>(); |
Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 41 | |
Chris Lattner | 02a3be0 | 2003-09-20 14:39:18 +0000 | [diff] [blame] | 42 | BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function |
Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 43 | |
Chris Lattner | 83c39d2 | 2003-06-25 14:58:56 +0000 | [diff] [blame] | 44 | bool Changed = false; |
Chris Lattner | 43f820d | 2003-10-05 21:20:13 +0000 | [diff] [blame] | 45 | |
| 46 | DominatorTree &DT = getAnalysis<DominatorTree>(); |
| 47 | DominanceFrontier &DF = getAnalysis<DominanceFrontier>(); |
Chris Lattner | 83c39d2 | 2003-06-25 14:58:56 +0000 | [diff] [blame] | 48 | |
| 49 | while (1) { |
| 50 | Allocas.clear(); |
Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 51 | |
Chris Lattner | 83c39d2 | 2003-06-25 14:58:56 +0000 | [diff] [blame] | 52 | // Find allocas that are safe to promote, by looking at all instructions in |
| 53 | // the entry node |
| 54 | for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I) |
| 55 | if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) // Is it an alloca? |
| 56 | if (isAllocaPromotable(AI, TD)) |
| 57 | Allocas.push_back(AI); |
| 58 | |
| 59 | if (Allocas.empty()) break; |
| 60 | |
Chris Lattner | 43f820d | 2003-10-05 21:20:13 +0000 | [diff] [blame] | 61 | PromoteMemToReg(Allocas, DT, DF, TD); |
Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 62 | NumPromoted += Allocas.size(); |
Chris Lattner | 83c39d2 | 2003-06-25 14:58:56 +0000 | [diff] [blame] | 63 | Changed = true; |
Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 64 | } |
Chris Lattner | 83c39d2 | 2003-06-25 14:58:56 +0000 | [diff] [blame] | 65 | |
| 66 | return Changed; |
Chris Lattner | d99bf49 | 2003-02-22 23:57:48 +0000 | [diff] [blame] | 67 | } |
| 68 | |
| 69 | // createPromoteMemoryToRegister - Provide an entry point to create this pass. |
| 70 | // |
| 71 | Pass *createPromoteMemoryToRegister() { |
| 72 | return new PromotePass(); |
| 73 | } |