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
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2012-06-02 10:20:22 +00:00
|
|
|
// This file demotes all registers to memory references. It is intended to be
|
2005-11-10 01:58:38 +00:00
|
|
|
// the inverse of PromoteMemoryToRegister. By converting to loads, the only
|
2011-04-15 05:18:47 +00:00
|
|
|
// values live across basic blocks are allocas and loads before phi nodes.
|
2005-11-10 01:58:38 +00:00
|
|
|
// 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"
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/BasicBlock.h"
|
2014-03-04 11:45:46 +00:00
|
|
|
#include "llvm/IR/CFG.h"
|
2013-01-02 11:36:10 +00:00
|
|
|
#include "llvm/IR/Function.h"
|
|
|
|
#include "llvm/IR/Instructions.h"
|
|
|
|
#include "llvm/IR/LLVMContext.h"
|
|
|
|
#include "llvm/IR/Module.h"
|
2012-12-03 16:50:05 +00:00
|
|
|
#include "llvm/Pass.h"
|
|
|
|
#include "llvm/Transforms/Utils/Local.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 {
|
2009-09-02 06:11:42 +00:00
|
|
|
struct RegToMem : public FunctionPass {
|
2007-05-06 13:37:16 +00:00
|
|
|
static char ID; // Pass identification, replacement for typeid
|
2010-10-19 17:21:58 +00:00
|
|
|
RegToMem() : FunctionPass(ID) {
|
|
|
|
initializeRegToMemPass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
2005-11-10 01:58:38 +00:00
|
|
|
|
2014-03-05 09:10:37 +00:00
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const override {
|
2005-11-22 21:45:19 +00:00
|
|
|
AU.addRequiredID(BreakCriticalEdgesID);
|
2005-11-25 16:04:54 +00:00
|
|
|
AU.addPreservedID(BreakCriticalEdgesID);
|
2005-11-22 21:45:19 +00:00
|
|
|
}
|
|
|
|
|
2014-03-09 03:16:01 +00:00
|
|
|
bool valueEscapes(const Instruction *Inst) const {
|
|
|
|
const BasicBlock *BB = Inst->getParent();
|
|
|
|
for (const User *U : Inst->users()) {
|
|
|
|
const Instruction *UI = cast<Instruction>(U);
|
|
|
|
if (UI->getParent() != BB || isa<PHINode>(UI))
|
2005-11-10 01:58:38 +00:00
|
|
|
return true;
|
2010-04-14 16:48:56 +00:00
|
|
|
}
|
2005-11-10 01:58:38 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2014-03-05 09:10:37 +00:00
|
|
|
bool runOnFunction(Function &F) override;
|
2005-11-10 01:58:38 +00:00
|
|
|
};
|
|
|
|
}
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2008-05-13 00:00:25 +00:00
|
|
|
char RegToMem::ID = 0;
|
2010-10-12 19:48:12 +00:00
|
|
|
INITIALIZE_PASS_BEGIN(RegToMem, "reg2mem", "Demote all values to stack slots",
|
|
|
|
false, false)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(BreakCriticalEdges)
|
|
|
|
INITIALIZE_PASS_END(RegToMem, "reg2mem", "Demote all values to stack slots",
|
2010-10-07 22:25:06 +00:00
|
|
|
false, false)
|
2009-09-02 06:15:37 +00:00
|
|
|
|
|
|
|
bool RegToMem::runOnFunction(Function &F) {
|
2012-07-24 10:51:42 +00:00
|
|
|
if (F.isDeclaration())
|
2009-09-02 06:15:37 +00:00
|
|
|
return false;
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2009-09-02 06:15:37 +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!");
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2009-09-02 06:15:37 +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;
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2009-09-02 06:15:37 +00:00
|
|
|
CastInst *AllocaInsertionPoint =
|
|
|
|
new BitCastInst(Constant::getNullValue(Type::getInt32Ty(F.getContext())),
|
|
|
|
Type::getInt32Ty(F.getContext()),
|
|
|
|
"reg2mem alloca point", I);
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2009-09-02 06:15:37 +00:00
|
|
|
// Find the escaped instructions. But don't create stack slots for
|
|
|
|
// allocas in entry block.
|
|
|
|
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) {
|
|
|
|
if (!(isa<AllocaInst>(iib) && iib->getParent() == BBEntry) &&
|
|
|
|
valueEscapes(iib)) {
|
|
|
|
WorkList.push_front(&*iib);
|
|
|
|
}
|
|
|
|
}
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2009-09-02 06:15:37 +00:00
|
|
|
// Demote escaped instructions
|
|
|
|
NumRegsDemoted += WorkList.size();
|
2012-07-24 10:51:42 +00:00
|
|
|
for (std::list<Instruction*>::iterator ilb = WorkList.begin(),
|
2009-09-02 06:15:37 +00:00
|
|
|
ile = WorkList.end(); ilb != ile; ++ilb)
|
|
|
|
DemoteRegToStack(**ilb, false, AllocaInsertionPoint);
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2009-09-02 06:15:37 +00:00
|
|
|
WorkList.clear();
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2009-09-02 06:15:37 +00:00
|
|
|
// 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);
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2009-09-02 06:15:37 +00:00
|
|
|
// Demote phi nodes
|
|
|
|
NumPhisDemoted += WorkList.size();
|
2012-07-24 10:51:42 +00:00
|
|
|
for (std::list<Instruction*>::iterator ilb = WorkList.begin(),
|
2009-09-02 06:15:37 +00:00
|
|
|
ile = WorkList.end(); ilb != ile; ++ilb)
|
|
|
|
DemotePHIToStack(cast<PHINode>(*ilb), AllocaInsertionPoint);
|
2012-07-24 10:51:42 +00:00
|
|
|
|
2009-09-02 06:15:37 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-11-10 01:58:38 +00:00
|
|
|
// createDemoteRegisterToMemory - Provide an entry point to create this pass.
|
2010-08-06 18:33:48 +00:00
|
|
|
char &llvm::DemoteRegisterToMemoryID = RegToMem::ID;
|
2005-11-10 01:58:38 +00:00
|
|
|
FunctionPass *llvm::createDemoteRegisterToMemoryPass() {
|
|
|
|
return new RegToMem();
|
|
|
|
}
|