2003-02-23 07:57:48 +08:00
|
|
|
//===- Mem2Reg.cpp - The -mem2reg pass, a wrapper around the Utils lib ----===//
|
2005-04-22 07:48:37 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 04:36:04 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-22 07:48:37 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2003-02-23 07:57:48 +08:00
|
|
|
//
|
|
|
|
// This pass is a simple pass wrapper around the PromoteMemToReg function call
|
|
|
|
// exposed by the Utils library.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-12-20 06:17:40 +08:00
|
|
|
#define DEBUG_TYPE "mem2reg"
|
2003-02-23 07:57:48 +08:00
|
|
|
#include "llvm/Transforms/Scalar.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2011-01-18 11:53:26 +08:00
|
|
|
#include "llvm/Analysis/Dominators.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/Function.h"
|
|
|
|
#include "llvm/IR/Instructions.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/Transforms/Utils/PromoteMemToReg.h"
|
|
|
|
#include "llvm/Transforms/Utils/UnifyFunctionExitNodes.h"
|
2004-01-09 14:02:20 +08:00
|
|
|
using namespace llvm;
|
2003-11-12 06:41:34 +08:00
|
|
|
|
2006-12-20 06:17:40 +08:00
|
|
|
STATISTIC(NumPromoted, "Number of alloca's promoted");
|
2003-02-23 07:57:48 +08:00
|
|
|
|
2006-12-20 06:17:40 +08:00
|
|
|
namespace {
|
2009-10-25 14:33:48 +08:00
|
|
|
struct PromotePass : public FunctionPass {
|
2007-05-06 21:37:16 +08:00
|
|
|
static char ID; // Pass identification, replacement for typeid
|
2010-10-20 01:21:58 +08:00
|
|
|
PromotePass() : FunctionPass(ID) {
|
|
|
|
initializePromotePassPass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
2007-05-02 05:15:47 +08:00
|
|
|
|
2003-02-23 07:57:48 +08:00
|
|
|
// 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);
|
|
|
|
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
2007-06-08 05:57:03 +08:00
|
|
|
AU.addRequired<DominatorTree>();
|
2003-02-23 07:57:48 +08:00
|
|
|
AU.setPreservesCFG();
|
2007-04-17 02:10:23 +08:00
|
|
|
// This is a cluster of orthogonal Transforms
|
2006-05-09 12:13:41 +08:00
|
|
|
AU.addPreserved<UnifyFunctionExitNodes>();
|
|
|
|
AU.addPreservedID(LowerSwitchID);
|
2006-05-18 05:05:27 +08:00
|
|
|
AU.addPreservedID(LowerInvokePassID);
|
2003-02-23 07:57:48 +08:00
|
|
|
}
|
|
|
|
};
|
|
|
|
} // end of anonymous namespace
|
|
|
|
|
2008-05-13 08:00:25 +08:00
|
|
|
char PromotePass::ID = 0;
|
2010-10-13 03:48:12 +08:00
|
|
|
INITIALIZE_PASS_BEGIN(PromotePass, "mem2reg", "Promote Memory to Register",
|
|
|
|
false, false)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(DominatorTree)
|
|
|
|
INITIALIZE_PASS_END(PromotePass, "mem2reg", "Promote Memory to Register",
|
2010-10-08 06:25:06 +08:00
|
|
|
false, false)
|
2008-05-13 08:00:25 +08:00
|
|
|
|
2003-02-23 07:57:48 +08:00
|
|
|
bool PromotePass::runOnFunction(Function &F) {
|
|
|
|
std::vector<AllocaInst*> Allocas;
|
|
|
|
|
2003-09-20 22:39:18 +08:00
|
|
|
BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
|
2003-02-23 07:57:48 +08:00
|
|
|
|
2003-06-25 22:58:56 +08:00
|
|
|
bool Changed = false;
|
2003-10-06 05:20:13 +08:00
|
|
|
|
2007-06-08 05:57:03 +08:00
|
|
|
DominatorTree &DT = getAnalysis<DominatorTree>();
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2003-06-25 22:58:56 +08: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?
|
2013-08-14 06:51:58 +08:00
|
|
|
if (isAllocaPromotable(AI))
|
2003-06-25 22:58:56 +08:00
|
|
|
Allocas.push_back(AI);
|
|
|
|
|
|
|
|
if (Allocas.empty()) break;
|
|
|
|
|
2013-08-14 06:51:58 +08:00
|
|
|
PromoteMemToReg(Allocas, DT);
|
2003-02-23 07:57:48 +08:00
|
|
|
NumPromoted += Allocas.size();
|
2003-06-25 22:58:56 +08:00
|
|
|
Changed = true;
|
2003-02-23 07:57:48 +08:00
|
|
|
}
|
2003-06-25 22:58:56 +08:00
|
|
|
|
|
|
|
return Changed;
|
2003-02-23 07:57:48 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// createPromoteMemoryToRegister - Provide an entry point to create this pass.
|
|
|
|
//
|
2005-03-28 10:01:12 +08:00
|
|
|
FunctionPass *llvm::createPromoteMemoryToRegisterPass() {
|
2003-02-23 07:57:48 +08:00
|
|
|
return new PromotePass();
|
|
|
|
}
|