1 //===-- RegAllocSimple.cpp - A simple generic register allocator ----------===//
3 // The LLVM Compiler Infrastructure
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.
8 //===----------------------------------------------------------------------===//
10 // This file implements a simple register allocator. *Very* simple: It immediate
11 // spills every value right after it is computed, and it reloads all used
12 // operands from the spill area to temporary registers before each instruction.
13 // It does not keep values in registers across instructions.
15 //===----------------------------------------------------------------------===//
17 #define DEBUG_TYPE "regalloc"
18 #include "llvm/CodeGen/Passes.h"
19 #include "llvm/CodeGen/MachineFunctionPass.h"
20 #include "llvm/CodeGen/MachineInstr.h"
21 #include "llvm/CodeGen/SSARegMap.h"
22 #include "llvm/CodeGen/MachineFrameInfo.h"
23 #include "llvm/Target/TargetInstrInfo.h"
24 #include "llvm/Target/TargetMachine.h"
25 #include "Support/Debug.h"
26 #include "Support/Statistic.h"
27 #include "Support/STLExtras.h"
32 Statistic<> NumStores("ra-simple", "Number of stores added");
33 Statistic<> NumLoads ("ra-simple", "Number of loads added");
35 class RegAllocSimple : public MachineFunctionPass {
37 const TargetMachine *TM;
38 const MRegisterInfo *RegInfo;
40 // StackSlotForVirtReg - Maps SSA Regs => frame index on the stack where
41 // these values are spilled
42 std::map<unsigned, int> StackSlotForVirtReg;
44 // RegsUsed - Keep track of what registers are currently in use. This is a
46 std::vector<bool> RegsUsed;
48 // RegClassIdx - Maps RegClass => which index we can take a register
49 // from. Since this is a simple register allocator, when we need a register
50 // of a certain class, we just take the next available one.
51 std::map<const TargetRegisterClass*, unsigned> RegClassIdx;
54 virtual const char *getPassName() const {
55 return "Simple Register Allocator";
58 /// runOnMachineFunction - Register allocate the whole function
59 bool runOnMachineFunction(MachineFunction &Fn);
61 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
62 AU.addRequiredID(PHIEliminationID); // Eliminate PHI nodes
63 MachineFunctionPass::getAnalysisUsage(AU);
66 /// AllocateBasicBlock - Register allocate the specified basic block.
67 void AllocateBasicBlock(MachineBasicBlock &MBB);
69 /// getStackSpaceFor - This returns the offset of the specified virtual
70 /// register on the stack, allocating space if necessary.
71 int getStackSpaceFor(unsigned VirtReg, const TargetRegisterClass *RC);
73 /// Given a virtual register, return a compatible physical register that is
76 /// Side effect: marks that register as being used until manually cleared
78 unsigned getFreeReg(unsigned virtualReg);
80 /// Moves value from memory into that register
81 unsigned reloadVirtReg(MachineBasicBlock &MBB,
82 MachineBasicBlock::iterator I, unsigned VirtReg);
84 /// Saves reg value on the stack (maps virtual register to stack value)
85 void spillVirtReg(MachineBasicBlock &MBB, MachineBasicBlock::iterator I,
86 unsigned VirtReg, unsigned PhysReg);
91 /// getStackSpaceFor - This allocates space for the specified virtual
92 /// register to be held on the stack.
93 int RegAllocSimple::getStackSpaceFor(unsigned VirtReg,
94 const TargetRegisterClass *RC) {
95 // Find the location VirtReg would belong...
96 std::map<unsigned, int>::iterator I =
97 StackSlotForVirtReg.lower_bound(VirtReg);
99 if (I != StackSlotForVirtReg.end() && I->first == VirtReg)
100 return I->second; // Already has space allocated?
102 // Allocate a new stack object for this spill location...
103 int FrameIdx = MF->getFrameInfo()->CreateStackObject(RC);
105 // Assign the slot...
106 StackSlotForVirtReg.insert(I, std::make_pair(VirtReg, FrameIdx));
111 unsigned RegAllocSimple::getFreeReg(unsigned virtualReg) {
112 const TargetRegisterClass* RC = MF->getSSARegMap()->getRegClass(virtualReg);
113 TargetRegisterClass::iterator RI = RC->allocation_order_begin(*MF);
114 TargetRegisterClass::iterator RE = RC->allocation_order_end(*MF);
117 unsigned regIdx = RegClassIdx[RC]++;
118 assert(RI+regIdx != RE && "Not enough registers!");
119 unsigned PhysReg = *(RI+regIdx);
121 if (!RegsUsed[PhysReg])
126 unsigned RegAllocSimple::reloadVirtReg(MachineBasicBlock &MBB,
127 MachineBasicBlock::iterator I,
129 const TargetRegisterClass* RC = MF->getSSARegMap()->getRegClass(VirtReg);
130 int FrameIdx = getStackSpaceFor(VirtReg, RC);
131 unsigned PhysReg = getFreeReg(VirtReg);
133 // Add move instruction(s)
135 RegInfo->loadRegFromStackSlot(MBB, I, PhysReg, FrameIdx, RC);
139 void RegAllocSimple::spillVirtReg(MachineBasicBlock &MBB,
140 MachineBasicBlock::iterator I,
141 unsigned VirtReg, unsigned PhysReg) {
142 const TargetRegisterClass* RC = MF->getSSARegMap()->getRegClass(VirtReg);
143 int FrameIdx = getStackSpaceFor(VirtReg, RC);
145 // Add move instruction(s)
147 RegInfo->storeRegToStackSlot(MBB, I, PhysReg, FrameIdx, RC);
151 void RegAllocSimple::AllocateBasicBlock(MachineBasicBlock &MBB) {
152 // loop over each instruction
153 for (MachineBasicBlock::iterator MI = MBB.begin(); MI != MBB.end(); ++MI) {
154 // Made to combat the incorrect allocation of r2 = add r1, r1
155 std::map<unsigned, unsigned> Virt2PhysRegMap;
157 RegsUsed.resize(RegInfo->getNumRegs());
159 // a preliminary pass that will invalidate any registers that
160 // are used by the instruction (including implicit uses)
161 unsigned Opcode = MI->getOpcode();
162 const TargetInstrDescriptor &Desc = TM->getInstrInfo().get(Opcode);
163 const unsigned *Regs = Desc.ImplicitUses;
165 RegsUsed[*Regs++] = true;
167 Regs = Desc.ImplicitDefs;
169 RegsUsed[*Regs++] = true;
171 // Loop over uses, move from memory into registers
172 for (int i = MI->getNumOperands() - 1; i >= 0; --i) {
173 MachineOperand &op = MI->getOperand(i);
175 if (op.isRegister() && MRegisterInfo::isVirtualRegister(op.getReg())) {
176 unsigned virtualReg = (unsigned) op.getReg();
177 DEBUG(std::cerr << "op: " << op << "\n");
178 DEBUG(std::cerr << "\t inst[" << i << "]: ";
179 MI->print(std::cerr, *TM));
181 // make sure the same virtual register maps to the same physical
182 // register in any given instruction
183 unsigned physReg = Virt2PhysRegMap[virtualReg];
186 if (!TM->getInstrInfo().isTwoAddrInstr(MI->getOpcode()) || i) {
187 physReg = getFreeReg(virtualReg);
189 // must be same register number as the first operand
190 // This maps a = b + c into b += c, and saves b into a's spot
191 assert(MI->getOperand(1).isRegister() &&
192 MI->getOperand(1).getReg() &&
193 MI->getOperand(1).isUse() &&
194 "Two address instruction invalid!");
196 physReg = MI->getOperand(1).getReg();
197 spillVirtReg(MBB, next(MI), virtualReg, physReg);
198 MI->getOperand(1).setDef();
199 MI->RemoveOperand(0);
200 break; // This is the last operand to process
202 spillVirtReg(MBB, next(MI), virtualReg, physReg);
204 physReg = reloadVirtReg(MBB, MI, virtualReg);
205 Virt2PhysRegMap[virtualReg] = physReg;
208 MI->SetMachineOperandReg(i, physReg);
209 DEBUG(std::cerr << "virt: " << virtualReg <<
210 ", phys: " << op.getReg() << "\n");
219 /// runOnMachineFunction - Register allocate the whole function
221 bool RegAllocSimple::runOnMachineFunction(MachineFunction &Fn) {
222 DEBUG(std::cerr << "Machine Function " << "\n");
224 TM = &MF->getTarget();
225 RegInfo = TM->getRegisterInfo();
227 // Loop over all of the basic blocks, eliminating virtual register references
228 for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();
230 AllocateBasicBlock(*MBB);
232 StackSlotForVirtReg.clear();
236 FunctionPass *llvm::createSimpleRegisterAllocator() {
237 return new RegAllocSimple();