2005-11-10 01:58:38 +00:00
|
|
|
//===- Reg2Mem.cpp - Convert registers to allocas -------------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-11-10 01:58:38 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file demotes all registers to memory references. It is intented to be
|
|
|
|
// the inverse of PromoteMemoryToRegister. By converting to loads, the only
|
|
|
|
// values live accross basic blocks are allocas and loads before phi nodes.
|
|
|
|
// It is intended that this should make CFG hacking much easier.
|
|
|
|
// To make later hacking easier, the entry block is split into two, such that
|
|
|
|
// all introduced allocas and nothing else are in the entry block.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-12-19 21:40:18 +00:00
|
|
|
#define DEBUG_TYPE "reg2mem"
|
2005-11-10 01:58:38 +00:00
|
|
|
#include "llvm/Transforms/Scalar.h"
|
|
|
|
#include "llvm/Transforms/Utils/Local.h"
|
|
|
|
#include "llvm/Pass.h"
|
|
|
|
#include "llvm/Function.h"
|
2009-07-03 19:42:02 +00:00
|
|
|
#include "llvm/LLVMContext.h"
|
2005-11-10 01:58:38 +00:00
|
|
|
#include "llvm/Module.h"
|
|
|
|
#include "llvm/BasicBlock.h"
|
|
|
|
#include "llvm/Instructions.h"
|
|
|
|
#include "llvm/ADT/Statistic.h"
|
2007-02-05 23:32:05 +00:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2007-10-21 23:05:16 +00:00
|
|
|
#include "llvm/Support/CFG.h"
|
2005-11-10 01:58:38 +00:00
|
|
|
#include <list>
|
|
|
|
using namespace llvm;
|
|
|
|
|
2007-10-21 23:05:16 +00:00
|
|
|
STATISTIC(NumRegsDemoted, "Number of registers demoted");
|
|
|
|
STATISTIC(NumPhisDemoted, "Number of phi-nodes demoted");
|
2006-12-19 21:40:18 +00:00
|
|
|
|
2005-11-10 01:58:38 +00:00
|
|
|
namespace {
|
2007-02-05 23:32:05 +00:00
|
|
|
struct VISIBILITY_HIDDEN RegToMem : public FunctionPass {
|
2007-05-06 13:37:16 +00:00
|
|
|
static char ID; // Pass identification, replacement for typeid
|
2008-09-04 17:05:41 +00:00
|
|
|
RegToMem() : FunctionPass(&ID) {}
|
2005-11-10 01:58:38 +00:00
|
|
|
|
2005-11-22 21:45:19 +00:00
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.addRequiredID(BreakCriticalEdgesID);
|
2005-11-25 16:04:54 +00:00
|
|
|
AU.addPreservedID(BreakCriticalEdgesID);
|
2005-11-22 21:45:19 +00:00
|
|
|
}
|
|
|
|
|
2005-11-10 01:58:38 +00:00
|
|
|
bool valueEscapes(Instruction* i) {
|
|
|
|
BasicBlock* bb = i->getParent();
|
2007-10-21 23:05:16 +00:00
|
|
|
for (Value::use_iterator ii = i->use_begin(), ie = i->use_end();
|
|
|
|
ii != ie; ++ii)
|
2005-11-10 19:39:09 +00:00
|
|
|
if (cast<Instruction>(*ii)->getParent() != bb ||
|
2007-04-16 18:10:23 +00:00
|
|
|
isa<PHINode>(*ii))
|
2005-11-10 01:58:38 +00:00
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool runOnFunction(Function &F) {
|
2007-01-30 20:08:39 +00:00
|
|
|
if (!F.isDeclaration()) {
|
2007-10-21 23:05:16 +00:00
|
|
|
// Insert all new allocas into entry block.
|
|
|
|
BasicBlock* BBEntry = &F.getEntryBlock();
|
|
|
|
assert(pred_begin(BBEntry) == pred_end(BBEntry) &&
|
|
|
|
"Entry block to function must not have predecessors!");
|
2005-11-10 01:58:38 +00:00
|
|
|
|
2007-10-21 23:05:16 +00:00
|
|
|
// Find first non-alloca instruction and create insertion point. This is
|
|
|
|
// safe if block is well-formed: it always have terminator, otherwise
|
|
|
|
// we'll get and assertion.
|
|
|
|
BasicBlock::iterator I = BBEntry->begin();
|
|
|
|
while (isa<AllocaInst>(I)) ++I;
|
|
|
|
|
|
|
|
CastInst *AllocaInsertionPoint =
|
2008-05-16 19:29:10 +00:00
|
|
|
CastInst::Create(Instruction::BitCast,
|
2009-07-31 20:28:14 +00:00
|
|
|
Constant::getNullValue(Type::Int32Ty), Type::Int32Ty,
|
2007-10-21 23:05:16 +00:00
|
|
|
"reg2mem alloca point", I);
|
|
|
|
|
|
|
|
// Find the escaped instructions. But don't create stack slots for
|
|
|
|
// allocas in entry block.
|
2005-11-10 01:58:38 +00:00
|
|
|
std::list<Instruction*> worklist;
|
|
|
|
for (Function::iterator ibb = F.begin(), ibe = F.end();
|
|
|
|
ibb != ibe; ++ibb)
|
|
|
|
for (BasicBlock::iterator iib = ibb->begin(), iie = ibb->end();
|
|
|
|
iib != iie; ++iib) {
|
2007-10-21 23:05:16 +00:00
|
|
|
if (!(isa<AllocaInst>(iib) && iib->getParent() == BBEntry) &&
|
|
|
|
valueEscapes(iib)) {
|
2005-11-10 01:58:38 +00:00
|
|
|
worklist.push_front(&*iib);
|
2007-10-21 23:05:16 +00:00
|
|
|
}
|
2005-11-10 01:58:38 +00:00
|
|
|
}
|
2007-10-21 23:05:16 +00:00
|
|
|
|
|
|
|
// Demote escaped instructions
|
|
|
|
NumRegsDemoted += worklist.size();
|
2005-11-10 01:58:38 +00:00
|
|
|
for (std::list<Instruction*>::iterator ilb = worklist.begin(),
|
|
|
|
ile = worklist.end(); ilb != ile; ++ilb)
|
2009-07-15 23:53:25 +00:00
|
|
|
DemoteRegToStack(**ilb, false, AllocaInsertionPoint);
|
2007-10-21 23:05:16 +00:00
|
|
|
|
|
|
|
worklist.clear();
|
|
|
|
|
|
|
|
// Find all phi's
|
|
|
|
for (Function::iterator ibb = F.begin(), ibe = F.end();
|
|
|
|
ibb != ibe; ++ibb)
|
|
|
|
for (BasicBlock::iterator iib = ibb->begin(), iie = ibb->end();
|
|
|
|
iib != iie; ++iib)
|
|
|
|
if (isa<PHINode>(iib))
|
|
|
|
worklist.push_front(&*iib);
|
|
|
|
|
|
|
|
// Demote phi nodes
|
|
|
|
NumPhisDemoted += worklist.size();
|
|
|
|
for (std::list<Instruction*>::iterator ilb = worklist.begin(),
|
|
|
|
ile = worklist.end(); ilb != ile; ++ilb)
|
2009-07-15 23:53:25 +00:00
|
|
|
DemotePHIToStack(cast<PHINode>(*ilb), AllocaInsertionPoint);
|
2007-10-21 23:05:16 +00:00
|
|
|
|
2005-11-10 01:58:38 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
2008-05-13 00:00:25 +00:00
|
|
|
|
|
|
|
char RegToMem::ID = 0;
|
|
|
|
static RegisterPass<RegToMem>
|
|
|
|
X("reg2mem", "Demote all values to stack slots");
|
2005-11-10 01:58:38 +00:00
|
|
|
|
|
|
|
// createDemoteRegisterToMemory - Provide an entry point to create this pass.
|
|
|
|
//
|
2008-05-13 02:05:11 +00:00
|
|
|
const PassInfo *const llvm::DemoteRegisterToMemoryID = &X;
|
2005-11-10 01:58:38 +00:00
|
|
|
FunctionPass *llvm::createDemoteRegisterToMemoryPass() {
|
|
|
|
return new RegToMem();
|
|
|
|
}
|