blob: e964d2b466c3028025b5ce8a6509e3e3450087a2 [file] [log] [blame]
Andrew Lenharth4130a4f2005-11-10 01:58:38 +00001//===- Reg2Mem.cpp - Convert registers to allocas -------------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file demotes all registers to memory references. It is intented to be
11// the inverse of PromoteMemoryToRegister. By converting to loads, the only
12// values live accross basic blocks are allocas and loads before phi nodes.
13// It is intended that this should make CFG hacking much easier.
14// To make later hacking easier, the entry block is split into two, such that
15// all introduced allocas and nothing else are in the entry block.
16//
17//===----------------------------------------------------------------------===//
18
19#include "llvm/Transforms/Scalar.h"
20#include "llvm/Transforms/Utils/Local.h"
21#include "llvm/Pass.h"
22#include "llvm/Function.h"
23#include "llvm/Module.h"
24#include "llvm/BasicBlock.h"
25#include "llvm/Instructions.h"
26#include "llvm/ADT/Statistic.h"
27
28#include <list>
29
30using namespace llvm;
31
32namespace {
33 Statistic<> NumDemoted("reg2mem", "Number of registers demoted");
34
35 struct RegToMem : public FunctionPass {
36
Andrew Lenharth71b09bb2005-11-22 21:45:19 +000037 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
38 AU.addRequiredID(BreakCriticalEdgesID);
39 }
40
Andrew Lenharth4130a4f2005-11-10 01:58:38 +000041 bool valueEscapes(Instruction* i) {
42 BasicBlock* bb = i->getParent();
43 for(Value::use_iterator ii = i->use_begin(), ie = i->use_end();
44 ii != ie; ++ii)
Andrew Lenharthd9c13b12005-11-10 19:39:09 +000045 if (cast<Instruction>(*ii)->getParent() != bb ||
46 isa<PHINode>(*ii))
Andrew Lenharth4130a4f2005-11-10 01:58:38 +000047 return true;
48 return false;
49 }
50
51 virtual bool runOnFunction(Function &F) {
52 if (!F.isExternal()) {
53 //give us a clean block
Andrew Lenharth8e66c0c2005-11-10 17:35:34 +000054 BasicBlock* bbold = &F.getEntryBlock();
55 BasicBlock* bbnew = new BasicBlock("allocablock", &F, &F.getEntryBlock());
56 new BranchInst(bbold, bbnew);
Andrew Lenharth4130a4f2005-11-10 01:58:38 +000057
58 //find the instructions
59 std::list<Instruction*> worklist;
60 for (Function::iterator ibb = F.begin(), ibe = F.end();
61 ibb != ibe; ++ibb)
62 for (BasicBlock::iterator iib = ibb->begin(), iie = ibb->end();
63 iib != iie; ++iib) {
64 if(valueEscapes(iib))
65 worklist.push_front(&*iib);
66 }
67 //demote escaped instructions
68 NumDemoted += worklist.size();
69 for (std::list<Instruction*>::iterator ilb = worklist.begin(),
70 ile = worklist.end(); ilb != ile; ++ilb)
71 DemoteRegToStack(**ilb, false);
72 return true;
73 }
74 return false;
75 }
76 };
77
78 RegisterOpt<RegToMem> X("reg2mem", "Demote all values to stack slots");
79}
80
81// createDemoteRegisterToMemory - Provide an entry point to create this pass.
82//
83FunctionPass *llvm::createDemoteRegisterToMemoryPass() {
84 return new RegToMem();
85}