2003-02-22 23:57:48 +00:00
|
|
|
//===- Mem2Reg.cpp - The -mem2reg pass, a wrapper around the Utils lib ----===//
|
|
|
|
//
|
|
|
|
// This pass is a simple pass wrapper around the PromoteMemToReg function call
|
|
|
|
// exposed by the Utils library.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Transforms/Scalar.h"
|
|
|
|
#include "llvm/Transforms/Utils/PromoteMemToReg.h"
|
|
|
|
#include "llvm/Analysis/Dominators.h"
|
|
|
|
#include "llvm/iMemory.h"
|
|
|
|
#include "llvm/Function.h"
|
2003-03-03 17:25:18 +00:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2003-02-22 23:57:48 +00:00
|
|
|
#include "Support/Statistic.h"
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
Statistic<> NumPromoted("mem2reg", "Number of alloca's promoted");
|
|
|
|
|
|
|
|
struct PromotePass : public FunctionPass {
|
|
|
|
// runOnFunction - To run this pass, first we calculate the alloca
|
|
|
|
// instructions that are safe for promotion, then we promote each one.
|
|
|
|
//
|
|
|
|
virtual bool runOnFunction(Function &F);
|
|
|
|
|
|
|
|
// getAnalysisUsage - We need dominance frontiers
|
|
|
|
//
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
2003-10-05 21:20:13 +00:00
|
|
|
AU.addRequired<DominatorTree>();
|
2003-02-22 23:57:48 +00:00
|
|
|
AU.addRequired<DominanceFrontier>();
|
2003-03-03 17:25:18 +00:00
|
|
|
AU.addRequired<TargetData>();
|
2003-02-22 23:57:48 +00:00
|
|
|
AU.setPreservesCFG();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
RegisterOpt<PromotePass> X("mem2reg", "Promote Memory to Register");
|
|
|
|
} // end of anonymous namespace
|
|
|
|
|
|
|
|
bool PromotePass::runOnFunction(Function &F) {
|
|
|
|
std::vector<AllocaInst*> Allocas;
|
2003-03-03 17:25:18 +00:00
|
|
|
const TargetData &TD = getAnalysis<TargetData>();
|
2003-02-22 23:57:48 +00:00
|
|
|
|
2003-09-20 14:39:18 +00:00
|
|
|
BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
|
2003-02-22 23:57:48 +00:00
|
|
|
|
2003-06-25 14:58:56 +00:00
|
|
|
bool Changed = false;
|
2003-10-05 21:20:13 +00:00
|
|
|
|
|
|
|
DominatorTree &DT = getAnalysis<DominatorTree>();
|
|
|
|
DominanceFrontier &DF = getAnalysis<DominanceFrontier>();
|
2003-06-25 14:58:56 +00:00
|
|
|
|
|
|
|
while (1) {
|
|
|
|
Allocas.clear();
|
|
|
|
|
|
|
|
// Find allocas that are safe to promote, by looking at all instructions in
|
|
|
|
// the entry node
|
|
|
|
for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
|
|
|
|
if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) // Is it an alloca?
|
|
|
|
if (isAllocaPromotable(AI, TD))
|
|
|
|
Allocas.push_back(AI);
|
|
|
|
|
|
|
|
if (Allocas.empty()) break;
|
|
|
|
|
2003-10-05 21:20:13 +00:00
|
|
|
PromoteMemToReg(Allocas, DT, DF, TD);
|
2003-02-22 23:57:48 +00:00
|
|
|
NumPromoted += Allocas.size();
|
2003-06-25 14:58:56 +00:00
|
|
|
Changed = true;
|
2003-02-22 23:57:48 +00:00
|
|
|
}
|
2003-06-25 14:58:56 +00:00
|
|
|
|
|
|
|
return Changed;
|
2003-02-22 23:57:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// createPromoteMemoryToRegister - Provide an entry point to create this pass.
|
|
|
|
//
|
|
|
|
Pass *createPromoteMemoryToRegister() {
|
|
|
|
return new PromotePass();
|
|
|
|
}
|