1 //===-- RegisterScavenging.h - Machine register scavenging ------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file declares the machine register scavenger class. It can provide
11 // information such as unused register at any point in a machine basic block.
12 // It also provides a mechanism to make registers availbale by evicting them
15 //===----------------------------------------------------------------------===//
17 #ifndef LLVM_CODEGEN_REGISTERSCAVENGING_H
18 #define LLVM_CODEGEN_REGISTERSCAVENGING_H
20 #include "llvm/ADT/BitVector.h"
21 #include "llvm/CodeGen/MachineBasicBlock.h"
22 #include "llvm/CodeGen/MachineRegisterInfo.h"
26 class MachineRegisterInfo;
27 class TargetRegisterInfo;
28 class TargetInstrInfo;
29 class TargetRegisterClass;
32 const TargetRegisterInfo *TRI;
33 const TargetInstrInfo *TII;
34 MachineRegisterInfo* MRI;
35 MachineBasicBlock *MBB;
36 MachineBasicBlock::iterator MBBI;
39 /// Tracking - True if RegScavenger is currently tracking the liveness of
43 /// Information on scavenged registers (held in a spill slot).
44 struct ScavengedInfo {
45 ScavengedInfo(int FI) : FrameIndex(FI), Reg(0), Restore(NULL) {}
47 /// A spill slot used for scavenging a register post register allocation.
50 /// If non-zero, the specific register is currently being
51 /// scavenged. That is, it is spilled to this scavenging stack slot.
54 /// The instruction that restores the scavenged register from stack.
55 const MachineInstr *Restore;
58 /// A vector of information on scavenged registers.
59 SmallVector<ScavengedInfo, 2> Scavenged;
61 /// CalleeSavedrRegs - A bitvector of callee saved registers for the target.
63 BitVector CalleeSavedRegs;
65 /// RegsAvailable - The current state of all the physical registers immediately
66 /// before MBBI. One bit per physical register. If bit is set that means it's
67 /// available, unset means the register is currently being used.
68 BitVector RegsAvailable;
70 // These BitVectors are only used internally to forward(). They are members
71 // to avoid frequent reallocations.
72 BitVector KillRegs, DefRegs;
76 : MBB(NULL), NumPhysRegs(0), Tracking(false) {}
78 /// enterBasicBlock - Start tracking liveness from the begin of the specific
80 void enterBasicBlock(MachineBasicBlock *mbb);
82 /// initRegState - allow resetting register state info for multiple
83 /// passes over/within the same function.
86 /// forward - Move the internal MBB iterator and update register states.
89 /// forward - Move the internal MBB iterator and update register states until
90 /// it has processed the specific iterator.
91 void forward(MachineBasicBlock::iterator I) {
92 if (!Tracking && MBB->begin() != I) forward();
93 while (MBBI != I) forward();
96 /// skipTo - Move the internal MBB iterator but do not update register states.
98 void skipTo(MachineBasicBlock::iterator I) { MBBI = I; }
100 /// getRegsUsed - return all registers currently in use in used.
101 void getRegsUsed(BitVector &used, bool includeReserved);
103 /// getRegsAvailable - Return all available registers in the register class
105 BitVector getRegsAvailable(const TargetRegisterClass *RC);
107 /// FindUnusedReg - Find a unused register of the specified register class.
108 /// Return 0 if none is found.
109 unsigned FindUnusedReg(const TargetRegisterClass *RegClass) const;
111 /// Add a scavenging frame index.
112 void addScavengingFrameIndex(int FI) {
113 Scavenged.push_back(ScavengedInfo(FI));
116 /// Query whether a frame index is a scavenging frame index.
117 bool isScavengingFrameIndex(int FI) const {
118 for (SmallVector<ScavengedInfo, 2>::const_iterator I = Scavenged.begin(),
119 IE = Scavenged.end(); I != IE; ++I)
120 if (I->FrameIndex == FI)
126 /// Get an array of scavenging frame indices.
127 void getScavengingFrameIndices(SmallVectorImpl<int> &A) const {
128 for (SmallVector<ScavengedInfo, 2>::const_iterator I = Scavenged.begin(),
129 IE = Scavenged.end(); I != IE; ++I)
130 A.push_back(I->FrameIndex);
133 /// scavengeRegister - Make a register of the specific register class
134 /// available and do the appropriate bookkeeping. SPAdj is the stack
135 /// adjustment due to call frame, it's passed along to eliminateFrameIndex().
136 /// Returns the scavenged register.
137 unsigned scavengeRegister(const TargetRegisterClass *RegClass,
138 MachineBasicBlock::iterator I, int SPAdj);
139 unsigned scavengeRegister(const TargetRegisterClass *RegClass, int SPAdj) {
140 return scavengeRegister(RegClass, MBBI, SPAdj);
143 /// setUsed - Tell the scavenger a register is used.
145 void setUsed(unsigned Reg);
147 /// isReserved - Returns true if a register is reserved. It is never "unused".
148 bool isReserved(unsigned Reg) const { return MRI->isReserved(Reg); }
150 /// isUsed - Test if a register is currently being used. When called by the
151 /// isAliasUsed function, we only check isReserved if this is the original
152 /// register, not an alias register.
154 bool isUsed(unsigned Reg, bool CheckReserved = true) const {
155 return !RegsAvailable.test(Reg) || (CheckReserved && isReserved(Reg));
158 /// isAliasUsed - Is Reg or an alias currently in use?
159 bool isAliasUsed(unsigned Reg) const;
161 /// setUsed / setUnused - Mark the state of one or a number of registers.
163 void setUsed(BitVector &Regs) {
164 RegsAvailable.reset(Regs);
166 void setUnused(BitVector &Regs) {
167 RegsAvailable |= Regs;
170 /// Add Reg and all its sub-registers to BV.
171 void addRegWithSubRegs(BitVector &BV, unsigned Reg);
173 /// findSurvivorReg - Return the candidate register that is unused for the
174 /// longest after StartMI. UseMI is set to the instruction where the search
177 /// No more than InstrLimit instructions are inspected.
178 unsigned findSurvivorReg(MachineBasicBlock::iterator StartMI,
179 BitVector &Candidates,
181 MachineBasicBlock::iterator &UseMI);
185 } // End llvm namespace