1 //===-- llvm/CodeGen/LiveVariables.h - Live Variable Analysis ---*- 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 implements the LiveVariables analysis pass. For each machine
11 // instruction in the function, this pass calculates the set of registers that
12 // are immediately dead after the instruction (i.e., the instruction calculates
13 // the value, but it is never used) and the set of registers that are used by
14 // the instruction, but are never used after the instruction (i.e., they are
17 // This class computes live variables using a sparse implementation based on
18 // the machine code SSA form. This class computes live variable information for
19 // each virtual and _register allocatable_ physical register in a function. It
20 // uses the dominance properties of SSA form to efficiently compute live
21 // variables for virtual registers, and assumes that physical registers are only
22 // live within a single basic block (allowing it to do a single local analysis
23 // to resolve physical register lifetimes in each basic block). If a physical
24 // register is not register allocatable, it is not tracked. This is useful for
25 // things like the stack pointer and condition codes.
27 //===----------------------------------------------------------------------===//
29 #ifndef LLVM_CODEGEN_LIVEVARIABLES_H
30 #define LLVM_CODEGEN_LIVEVARIABLES_H
32 #include "llvm/ADT/BitVector.h"
33 #include "llvm/ADT/DenseMap.h"
34 #include "llvm/ADT/IndexedMap.h"
35 #include "llvm/ADT/SmallSet.h"
36 #include "llvm/ADT/SmallVector.h"
37 #include "llvm/ADT/SparseBitVector.h"
38 #include "llvm/CodeGen/MachineBasicBlock.h"
39 #include "llvm/CodeGen/MachineFunctionPass.h"
40 #include "llvm/CodeGen/MachineInstr.h"
41 #include "llvm/Target/TargetRegisterInfo.h"
45 class MachineRegisterInfo;
46 class TargetRegisterInfo;
48 class LiveVariables : public MachineFunctionPass {
50 static char ID; // Pass identification, replacement for typeid
51 LiveVariables() : MachineFunctionPass(ID) {
52 initializeLiveVariablesPass(*PassRegistry::getPassRegistry());
55 /// VarInfo - This represents the regions where a virtual register is live in
56 /// the program. We represent this with three different pieces of
57 /// information: the set of blocks in which the instruction is live
58 /// throughout, the set of blocks in which the instruction is actually used,
59 /// and the set of non-phi instructions that are the last users of the value.
61 /// In the common case where a value is defined and killed in the same block,
62 /// There is one killing instruction, and AliveBlocks is empty.
64 /// Otherwise, the value is live out of the block. If the value is live
65 /// throughout any blocks, these blocks are listed in AliveBlocks. Blocks
66 /// where the liveness range ends are not included in AliveBlocks, instead
67 /// being captured by the Kills set. In these blocks, the value is live into
68 /// the block (unless the value is defined and killed in the same block) and
69 /// lives until the specified instruction. Note that there cannot ever be a
70 /// value whose Kills set contains two instructions from the same basic block.
72 /// PHI nodes complicate things a bit. If a PHI node is the last user of a
73 /// value in one of its predecessor blocks, it is not listed in the kills set,
74 /// but does include the predecessor block in the AliveBlocks set (unless that
75 /// block also defines the value). This leads to the (perfectly sensical)
76 /// situation where a value is defined in a block, and the last use is a phi
77 /// node in the successor. In this case, AliveBlocks is empty (the value is
78 /// not live across any blocks) and Kills is empty (phi nodes are not
79 /// included). This is sensical because the value must be live to the end of
80 /// the block, but is not live in any successor blocks.
82 /// AliveBlocks - Set of blocks in which this value is alive completely
83 /// through. This is a bit set which uses the basic block number as an
86 SparseBitVector<> AliveBlocks;
88 /// Kills - List of MachineInstruction's which are the last use of this
89 /// virtual register (kill it) in their basic block.
91 std::vector<MachineInstr*> Kills;
93 /// removeKill - Delete a kill corresponding to the specified
94 /// machine instruction. Returns true if there was a kill
95 /// corresponding to this instruction, false otherwise.
96 bool removeKill(MachineInstr *MI) {
97 std::vector<MachineInstr*>::iterator
98 I = std::find(Kills.begin(), Kills.end(), MI);
105 /// findKill - Find a kill instruction in MBB. Return NULL if none is found.
106 MachineInstr *findKill(const MachineBasicBlock *MBB) const;
108 /// isLiveIn - Is Reg live in to MBB? This means that Reg is live through
109 /// MBB, or it is killed in MBB. If Reg is only used by PHI instructions in
110 /// MBB, it is not considered live in.
111 bool isLiveIn(const MachineBasicBlock &MBB,
113 MachineRegisterInfo &MRI);
119 /// VirtRegInfo - This list is a mapping from virtual register number to
120 /// variable information.
122 IndexedMap<VarInfo, VirtReg2IndexFunctor> VirtRegInfo;
124 /// PHIJoins - list of virtual registers that are PHI joins. These registers
125 /// may have multiple definitions, and they require special handling when
126 /// building live intervals.
127 SparseBitVector<> PHIJoins;
129 private: // Intermediate data structures
132 MachineRegisterInfo* MRI;
134 const TargetRegisterInfo *TRI;
136 // PhysRegInfo - Keep track of which instruction was the last def of a
137 // physical register. This is a purely local property, because all physical
138 // register references are presumed dead across basic blocks.
139 MachineInstr **PhysRegDef;
141 // PhysRegInfo - Keep track of which instruction was the last use of a
142 // physical register. This is a purely local property, because all physical
143 // register references are presumed dead across basic blocks.
144 MachineInstr **PhysRegUse;
146 SmallVector<unsigned, 4> *PHIVarInfo;
148 // DistanceMap - Keep track the distance of a MI from the start of the
149 // current basic block.
150 DenseMap<MachineInstr*, unsigned> DistanceMap;
152 /// HandlePhysRegKill - Add kills of Reg and its sub-registers to the
153 /// uses. Pay special attention to the sub-register uses which may come below
154 /// the last use of the whole register.
155 bool HandlePhysRegKill(unsigned Reg, MachineInstr *MI);
157 /// HandleRegMask - Call HandlePhysRegKill for all registers clobbered by Mask.
158 void HandleRegMask(const MachineOperand&);
160 void HandlePhysRegUse(unsigned Reg, MachineInstr *MI);
161 void HandlePhysRegDef(unsigned Reg, MachineInstr *MI,
162 SmallVector<unsigned, 4> &Defs);
163 void UpdatePhysRegDefs(MachineInstr *MI, SmallVector<unsigned, 4> &Defs);
165 /// FindLastRefOrPartRef - Return the last reference or partial reference of
166 /// the specified register.
167 MachineInstr *FindLastRefOrPartRef(unsigned Reg);
169 /// FindLastPartialDef - Return the last partial def of the specified
170 /// register. Also returns the sub-registers that're defined by the
172 MachineInstr *FindLastPartialDef(unsigned Reg,
173 SmallSet<unsigned,4> &PartDefRegs);
175 /// analyzePHINodes - Gather information about the PHI nodes in here. In
176 /// particular, we want to map the variable information of a virtual
177 /// register which is used in a PHI node. We map that to the BB the vreg
179 void analyzePHINodes(const MachineFunction& Fn);
182 virtual bool runOnMachineFunction(MachineFunction &MF);
184 /// RegisterDefIsDead - Return true if the specified instruction defines the
185 /// specified register, but that definition is dead.
186 bool RegisterDefIsDead(MachineInstr *MI, unsigned Reg) const;
188 //===--------------------------------------------------------------------===//
189 // API to update live variable information
191 /// replaceKillInstruction - Update register kill info by replacing a kill
192 /// instruction with a new one.
193 void replaceKillInstruction(unsigned Reg, MachineInstr *OldMI,
194 MachineInstr *NewMI);
196 /// addVirtualRegisterKilled - Add information about the fact that the
197 /// specified register is killed after being used by the specified
198 /// instruction. If AddIfNotFound is true, add a implicit operand if it's
200 void addVirtualRegisterKilled(unsigned IncomingReg, MachineInstr *MI,
201 bool AddIfNotFound = false) {
202 if (MI->addRegisterKilled(IncomingReg, TRI, AddIfNotFound))
203 getVarInfo(IncomingReg).Kills.push_back(MI);
206 /// removeVirtualRegisterKilled - Remove the specified kill of the virtual
207 /// register from the live variable information. Returns true if the
208 /// variable was marked as killed by the specified instruction,
210 bool removeVirtualRegisterKilled(unsigned reg, MachineInstr *MI) {
211 if (!getVarInfo(reg).removeKill(MI))
214 bool Removed = false;
215 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
216 MachineOperand &MO = MI->getOperand(i);
217 if (MO.isReg() && MO.isKill() && MO.getReg() == reg) {
224 assert(Removed && "Register is not used by this instruction!");
229 /// removeVirtualRegistersKilled - Remove all killed info for the specified
231 void removeVirtualRegistersKilled(MachineInstr *MI);
233 /// addVirtualRegisterDead - Add information about the fact that the specified
234 /// register is dead after being used by the specified instruction. If
235 /// AddIfNotFound is true, add a implicit operand if it's not found.
236 void addVirtualRegisterDead(unsigned IncomingReg, MachineInstr *MI,
237 bool AddIfNotFound = false) {
238 if (MI->addRegisterDead(IncomingReg, TRI, AddIfNotFound))
239 getVarInfo(IncomingReg).Kills.push_back(MI);
242 /// removeVirtualRegisterDead - Remove the specified kill of the virtual
243 /// register from the live variable information. Returns true if the
244 /// variable was marked dead at the specified instruction, false
246 bool removeVirtualRegisterDead(unsigned reg, MachineInstr *MI) {
247 if (!getVarInfo(reg).removeKill(MI))
250 bool Removed = false;
251 for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
252 MachineOperand &MO = MI->getOperand(i);
253 if (MO.isReg() && MO.isDef() && MO.getReg() == reg) {
259 assert(Removed && "Register is not defined by this instruction!");
264 void getAnalysisUsage(AnalysisUsage &AU) const;
266 virtual void releaseMemory() {
270 /// getVarInfo - Return the VarInfo structure for the specified VIRTUAL
272 VarInfo &getVarInfo(unsigned RegIdx);
274 void MarkVirtRegAliveInBlock(VarInfo& VRInfo, MachineBasicBlock* DefBlock,
275 MachineBasicBlock *BB);
276 void MarkVirtRegAliveInBlock(VarInfo& VRInfo, MachineBasicBlock* DefBlock,
277 MachineBasicBlock *BB,
278 std::vector<MachineBasicBlock*> &WorkList);
279 void HandleVirtRegDef(unsigned reg, MachineInstr *MI);
280 void HandleVirtRegUse(unsigned reg, MachineBasicBlock *MBB,
283 bool isLiveIn(unsigned Reg, const MachineBasicBlock &MBB) {
284 return getVarInfo(Reg).isLiveIn(MBB, Reg, *MRI);
287 /// isLiveOut - Determine if Reg is live out from MBB, when not considering
288 /// PHI nodes. This means that Reg is either killed by a successor block or
289 /// passed through one.
290 bool isLiveOut(unsigned Reg, const MachineBasicBlock &MBB);
292 /// addNewBlock - Add a new basic block BB between DomBB and SuccBB. All
293 /// variables that are live out of DomBB and live into SuccBB will be marked
294 /// as passing live through BB. This method assumes that the machine code is
295 /// still in SSA form.
296 void addNewBlock(MachineBasicBlock *BB,
297 MachineBasicBlock *DomBB,
298 MachineBasicBlock *SuccBB);
300 /// isPHIJoin - Return true if Reg is a phi join register.
301 bool isPHIJoin(unsigned Reg) { return PHIJoins.test(Reg); }
303 /// setPHIJoin - Mark Reg as a phi join register.
304 void setPHIJoin(unsigned Reg) { PHIJoins.set(Reg); }
307 } // End llvm namespace