Move the loads after the calls so that the fix for
[llvm/stm8.git] / lib / CodeGen / VirtRegMap.cpp
blob7557979ec9bb852cd05a823467570de47dc23951
1 //===-- llvm/CodeGen/VirtRegMap.cpp - Virtual Register Map ----------------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file implements the VirtRegMap class.
12 // It also contains implementations of the Spiller interface, which, given a
13 // virtual register map and a machine function, eliminates all virtual
14 // references by replacing them with physical register references - adding spill
15 // code as necessary.
17 //===----------------------------------------------------------------------===//
19 #define DEBUG_TYPE "virtregmap"
20 #include "VirtRegMap.h"
21 #include "llvm/Function.h"
22 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
23 #include "llvm/CodeGen/MachineFrameInfo.h"
24 #include "llvm/CodeGen/MachineFunction.h"
25 #include "llvm/CodeGen/MachineInstrBuilder.h"
26 #include "llvm/CodeGen/MachineRegisterInfo.h"
27 #include "llvm/CodeGen/SlotIndexes.h"
28 #include "llvm/Target/TargetMachine.h"
29 #include "llvm/Target/TargetInstrInfo.h"
30 #include "llvm/Target/TargetRegisterInfo.h"
31 #include "llvm/Support/CommandLine.h"
32 #include "llvm/Support/Compiler.h"
33 #include "llvm/Support/Debug.h"
34 #include "llvm/Support/raw_ostream.h"
35 #include "llvm/ADT/BitVector.h"
36 #include "llvm/ADT/DenseMap.h"
37 #include "llvm/ADT/DepthFirstIterator.h"
38 #include "llvm/ADT/Statistic.h"
39 #include "llvm/ADT/STLExtras.h"
40 #include "llvm/ADT/SmallSet.h"
41 #include <algorithm>
42 using namespace llvm;
44 STATISTIC(NumSpills , "Number of register spills");
45 STATISTIC(NumIdCopies, "Number of identity moves eliminated after rewriting");
47 //===----------------------------------------------------------------------===//
48 // VirtRegMap implementation
49 //===----------------------------------------------------------------------===//
51 char VirtRegMap::ID = 0;
53 INITIALIZE_PASS(VirtRegMap, "virtregmap", "Virtual Register Map", false, false)
55 bool VirtRegMap::runOnMachineFunction(MachineFunction &mf) {
56 MRI = &mf.getRegInfo();
57 TII = mf.getTarget().getInstrInfo();
58 TRI = mf.getTarget().getRegisterInfo();
59 MF = &mf;
61 ReMatId = MAX_STACK_SLOT+1;
62 LowSpillSlot = HighSpillSlot = NO_STACK_SLOT;
64 Virt2PhysMap.clear();
65 Virt2StackSlotMap.clear();
66 Virt2ReMatIdMap.clear();
67 Virt2SplitMap.clear();
68 Virt2SplitKillMap.clear();
69 ReMatMap.clear();
70 ImplicitDefed.clear();
71 SpillSlotToUsesMap.clear();
72 MI2VirtMap.clear();
73 SpillPt2VirtMap.clear();
74 RestorePt2VirtMap.clear();
75 EmergencySpillMap.clear();
76 EmergencySpillSlots.clear();
78 SpillSlotToUsesMap.resize(8);
79 ImplicitDefed.resize(MF->getRegInfo().getNumVirtRegs());
81 allocatableRCRegs.clear();
82 for (TargetRegisterInfo::regclass_iterator I = TRI->regclass_begin(),
83 E = TRI->regclass_end(); I != E; ++I)
84 allocatableRCRegs.insert(std::make_pair(*I,
85 TRI->getAllocatableSet(mf, *I)));
87 grow();
89 return false;
92 void VirtRegMap::grow() {
93 unsigned NumRegs = MF->getRegInfo().getNumVirtRegs();
94 Virt2PhysMap.resize(NumRegs);
95 Virt2StackSlotMap.resize(NumRegs);
96 Virt2ReMatIdMap.resize(NumRegs);
97 Virt2SplitMap.resize(NumRegs);
98 Virt2SplitKillMap.resize(NumRegs);
99 ReMatMap.resize(NumRegs);
100 ImplicitDefed.resize(NumRegs);
103 unsigned VirtRegMap::createSpillSlot(const TargetRegisterClass *RC) {
104 int SS = MF->getFrameInfo()->CreateSpillStackObject(RC->getSize(),
105 RC->getAlignment());
106 if (LowSpillSlot == NO_STACK_SLOT)
107 LowSpillSlot = SS;
108 if (HighSpillSlot == NO_STACK_SLOT || SS > HighSpillSlot)
109 HighSpillSlot = SS;
110 assert(SS >= LowSpillSlot && "Unexpected low spill slot");
111 unsigned Idx = SS-LowSpillSlot;
112 while (Idx >= SpillSlotToUsesMap.size())
113 SpillSlotToUsesMap.resize(SpillSlotToUsesMap.size()*2);
114 return SS;
117 unsigned VirtRegMap::getRegAllocPref(unsigned virtReg) {
118 std::pair<unsigned, unsigned> Hint = MRI->getRegAllocationHint(virtReg);
119 unsigned physReg = Hint.second;
120 if (TargetRegisterInfo::isVirtualRegister(physReg) && hasPhys(physReg))
121 physReg = getPhys(physReg);
122 if (Hint.first == 0)
123 return (TargetRegisterInfo::isPhysicalRegister(physReg))
124 ? physReg : 0;
125 return TRI->ResolveRegAllocHint(Hint.first, physReg, *MF);
128 int VirtRegMap::assignVirt2StackSlot(unsigned virtReg) {
129 assert(TargetRegisterInfo::isVirtualRegister(virtReg));
130 assert(Virt2StackSlotMap[virtReg] == NO_STACK_SLOT &&
131 "attempt to assign stack slot to already spilled register");
132 const TargetRegisterClass* RC = MF->getRegInfo().getRegClass(virtReg);
133 ++NumSpills;
134 return Virt2StackSlotMap[virtReg] = createSpillSlot(RC);
137 void VirtRegMap::assignVirt2StackSlot(unsigned virtReg, int SS) {
138 assert(TargetRegisterInfo::isVirtualRegister(virtReg));
139 assert(Virt2StackSlotMap[virtReg] == NO_STACK_SLOT &&
140 "attempt to assign stack slot to already spilled register");
141 assert((SS >= 0 ||
142 (SS >= MF->getFrameInfo()->getObjectIndexBegin())) &&
143 "illegal fixed frame index");
144 Virt2StackSlotMap[virtReg] = SS;
147 int VirtRegMap::assignVirtReMatId(unsigned virtReg) {
148 assert(TargetRegisterInfo::isVirtualRegister(virtReg));
149 assert(Virt2ReMatIdMap[virtReg] == NO_STACK_SLOT &&
150 "attempt to assign re-mat id to already spilled register");
151 Virt2ReMatIdMap[virtReg] = ReMatId;
152 return ReMatId++;
155 void VirtRegMap::assignVirtReMatId(unsigned virtReg, int id) {
156 assert(TargetRegisterInfo::isVirtualRegister(virtReg));
157 assert(Virt2ReMatIdMap[virtReg] == NO_STACK_SLOT &&
158 "attempt to assign re-mat id to already spilled register");
159 Virt2ReMatIdMap[virtReg] = id;
162 int VirtRegMap::getEmergencySpillSlot(const TargetRegisterClass *RC) {
163 std::map<const TargetRegisterClass*, int>::iterator I =
164 EmergencySpillSlots.find(RC);
165 if (I != EmergencySpillSlots.end())
166 return I->second;
167 return EmergencySpillSlots[RC] = createSpillSlot(RC);
170 void VirtRegMap::addSpillSlotUse(int FI, MachineInstr *MI) {
171 if (!MF->getFrameInfo()->isFixedObjectIndex(FI)) {
172 // If FI < LowSpillSlot, this stack reference was produced by
173 // instruction selection and is not a spill
174 if (FI >= LowSpillSlot) {
175 assert(FI >= 0 && "Spill slot index should not be negative!");
176 assert((unsigned)FI-LowSpillSlot < SpillSlotToUsesMap.size()
177 && "Invalid spill slot");
178 SpillSlotToUsesMap[FI-LowSpillSlot].insert(MI);
183 void VirtRegMap::virtFolded(unsigned VirtReg, MachineInstr *OldMI,
184 MachineInstr *NewMI, ModRef MRInfo) {
185 // Move previous memory references folded to new instruction.
186 MI2VirtMapTy::iterator IP = MI2VirtMap.lower_bound(NewMI);
187 for (MI2VirtMapTy::iterator I = MI2VirtMap.lower_bound(OldMI),
188 E = MI2VirtMap.end(); I != E && I->first == OldMI; ) {
189 MI2VirtMap.insert(IP, std::make_pair(NewMI, I->second));
190 MI2VirtMap.erase(I++);
193 // add new memory reference
194 MI2VirtMap.insert(IP, std::make_pair(NewMI, std::make_pair(VirtReg, MRInfo)));
197 void VirtRegMap::virtFolded(unsigned VirtReg, MachineInstr *MI, ModRef MRInfo) {
198 MI2VirtMapTy::iterator IP = MI2VirtMap.lower_bound(MI);
199 MI2VirtMap.insert(IP, std::make_pair(MI, std::make_pair(VirtReg, MRInfo)));
202 void VirtRegMap::RemoveMachineInstrFromMaps(MachineInstr *MI) {
203 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
204 MachineOperand &MO = MI->getOperand(i);
205 if (!MO.isFI())
206 continue;
207 int FI = MO.getIndex();
208 if (MF->getFrameInfo()->isFixedObjectIndex(FI))
209 continue;
210 // This stack reference was produced by instruction selection and
211 // is not a spill
212 if (FI < LowSpillSlot)
213 continue;
214 assert((unsigned)FI-LowSpillSlot < SpillSlotToUsesMap.size()
215 && "Invalid spill slot");
216 SpillSlotToUsesMap[FI-LowSpillSlot].erase(MI);
218 MI2VirtMap.erase(MI);
219 SpillPt2VirtMap.erase(MI);
220 RestorePt2VirtMap.erase(MI);
221 EmergencySpillMap.erase(MI);
224 /// FindUnusedRegisters - Gather a list of allocatable registers that
225 /// have not been allocated to any virtual register.
226 bool VirtRegMap::FindUnusedRegisters(LiveIntervals* LIs) {
227 unsigned NumRegs = TRI->getNumRegs();
228 UnusedRegs.reset();
229 UnusedRegs.resize(NumRegs);
231 BitVector Used(NumRegs);
232 for (unsigned i = 0, e = MRI->getNumVirtRegs(); i != e; ++i) {
233 unsigned Reg = TargetRegisterInfo::index2VirtReg(i);
234 if (Virt2PhysMap[Reg] != (unsigned)VirtRegMap::NO_PHYS_REG)
235 Used.set(Virt2PhysMap[Reg]);
238 BitVector Allocatable = TRI->getAllocatableSet(*MF);
239 bool AnyUnused = false;
240 for (unsigned Reg = 1; Reg < NumRegs; ++Reg) {
241 if (Allocatable[Reg] && !Used[Reg] && !LIs->hasInterval(Reg)) {
242 bool ReallyUnused = true;
243 for (const unsigned *AS = TRI->getAliasSet(Reg); *AS; ++AS) {
244 if (Used[*AS] || LIs->hasInterval(*AS)) {
245 ReallyUnused = false;
246 break;
249 if (ReallyUnused) {
250 AnyUnused = true;
251 UnusedRegs.set(Reg);
256 return AnyUnused;
259 void VirtRegMap::rewrite(SlotIndexes *Indexes) {
260 DEBUG(dbgs() << "********** REWRITE VIRTUAL REGISTERS **********\n"
261 << "********** Function: "
262 << MF->getFunction()->getName() << '\n');
263 DEBUG(dump());
264 SmallVector<unsigned, 8> SuperDeads;
265 SmallVector<unsigned, 8> SuperDefs;
266 SmallVector<unsigned, 8> SuperKills;
268 for (MachineFunction::iterator MBBI = MF->begin(), MBBE = MF->end();
269 MBBI != MBBE; ++MBBI) {
270 DEBUG(MBBI->print(dbgs(), Indexes));
271 for (MachineBasicBlock::iterator MII = MBBI->begin(), MIE = MBBI->end();
272 MII != MIE;) {
273 MachineInstr *MI = MII;
274 ++MII;
276 for (MachineInstr::mop_iterator MOI = MI->operands_begin(),
277 MOE = MI->operands_end(); MOI != MOE; ++MOI) {
278 MachineOperand &MO = *MOI;
279 if (!MO.isReg() || !TargetRegisterInfo::isVirtualRegister(MO.getReg()))
280 continue;
281 unsigned VirtReg = MO.getReg();
282 unsigned PhysReg = getPhys(VirtReg);
283 assert(PhysReg != NO_PHYS_REG && "Instruction uses unmapped VirtReg");
285 // Preserve semantics of sub-register operands.
286 if (MO.getSubReg()) {
287 // A virtual register kill refers to the whole register, so we may
288 // have to add <imp-use,kill> operands for the super-register.
289 if (MO.isUse()) {
290 if (MO.isKill() && !MO.isUndef())
291 SuperKills.push_back(PhysReg);
292 } else if (MO.isDead())
293 SuperDeads.push_back(PhysReg);
294 else
295 SuperDefs.push_back(PhysReg);
297 // PhysReg operands cannot have subregister indexes.
298 PhysReg = TRI->getSubReg(PhysReg, MO.getSubReg());
299 assert(PhysReg && "Invalid SubReg for physical register");
300 MO.setSubReg(0);
302 // Rewrite. Note we could have used MachineOperand::substPhysReg(), but
303 // we need the inlining here.
304 MO.setReg(PhysReg);
307 // Add any missing super-register kills after rewriting the whole
308 // instruction.
309 while (!SuperKills.empty())
310 MI->addRegisterKilled(SuperKills.pop_back_val(), TRI, true);
312 while (!SuperDeads.empty())
313 MI->addRegisterDead(SuperDeads.pop_back_val(), TRI, true);
315 while (!SuperDefs.empty())
316 MI->addRegisterDefined(SuperDefs.pop_back_val(), TRI);
318 DEBUG(dbgs() << "> " << *MI);
320 // Finally, remove any identity copies.
321 if (MI->isIdentityCopy()) {
322 ++NumIdCopies;
323 if (MI->getNumOperands() == 2) {
324 DEBUG(dbgs() << "Deleting identity copy.\n");
325 RemoveMachineInstrFromMaps(MI);
326 if (Indexes)
327 Indexes->removeMachineInstrFromMaps(MI);
328 // It's safe to erase MI because MII has already been incremented.
329 MI->eraseFromParent();
330 } else {
331 // Transform identity copy to a KILL to deal with subregisters.
332 MI->setDesc(TII->get(TargetOpcode::KILL));
333 DEBUG(dbgs() << "Identity copy: " << *MI);
339 // Tell MRI about physical registers in use.
340 for (unsigned Reg = 1, RegE = TRI->getNumRegs(); Reg != RegE; ++Reg)
341 if (!MRI->reg_nodbg_empty(Reg))
342 MRI->setPhysRegUsed(Reg);
345 void VirtRegMap::print(raw_ostream &OS, const Module* M) const {
346 const TargetRegisterInfo* TRI = MF->getTarget().getRegisterInfo();
347 const MachineRegisterInfo &MRI = MF->getRegInfo();
349 OS << "********** REGISTER MAP **********\n";
350 for (unsigned i = 0, e = MRI.getNumVirtRegs(); i != e; ++i) {
351 unsigned Reg = TargetRegisterInfo::index2VirtReg(i);
352 if (Virt2PhysMap[Reg] != (unsigned)VirtRegMap::NO_PHYS_REG) {
353 OS << '[' << PrintReg(Reg, TRI) << " -> "
354 << PrintReg(Virt2PhysMap[Reg], TRI) << "] "
355 << MRI.getRegClass(Reg)->getName() << "\n";
359 for (unsigned i = 0, e = MRI.getNumVirtRegs(); i != e; ++i) {
360 unsigned Reg = TargetRegisterInfo::index2VirtReg(i);
361 if (Virt2StackSlotMap[Reg] != VirtRegMap::NO_STACK_SLOT) {
362 OS << '[' << PrintReg(Reg, TRI) << " -> fi#" << Virt2StackSlotMap[Reg]
363 << "] " << MRI.getRegClass(Reg)->getName() << "\n";
366 OS << '\n';
369 void VirtRegMap::dump() const {
370 print(dbgs());