2003-01-13 01:01:31 +00:00
|
|
|
//===-- llvm/CodeGen/LiveVariables.h - Live Variable Analysis ---*- C++ -*-===//
|
2005-04-21 20:39:54 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 19:59:42 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 20:39:54 +00:00
|
|
|
//
|
2003-10-20 20:19:47 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2005-04-21 20:39:54 +00:00
|
|
|
//
|
2008-01-31 00:44:33 +00:00
|
|
|
// This file implements the LiveVariables analysis pass. For each machine
|
2003-05-07 20:07:58 +00:00
|
|
|
// instruction in the function, this pass calculates the set of registers that
|
|
|
|
// are immediately dead after the instruction (i.e., the instruction calculates
|
|
|
|
// the value, but it is never used) and the set of registers that are used by
|
|
|
|
// the instruction, but are never used after the instruction (i.e., they are
|
|
|
|
// killed).
|
|
|
|
//
|
2008-01-29 12:06:33 +00:00
|
|
|
// This class computes live variables using a sparse implementation based on
|
2003-01-13 01:01:31 +00:00
|
|
|
// the machine code SSA form. This class computes live variable information for
|
2003-05-07 20:07:58 +00:00
|
|
|
// each virtual and _register allocatable_ physical register in a function. It
|
|
|
|
// uses the dominance properties of SSA form to efficiently compute live
|
|
|
|
// variables for virtual registers, and assumes that physical registers are only
|
|
|
|
// live within a single basic block (allowing it to do a single local analysis
|
|
|
|
// to resolve physical register lifetimes in each basic block). If a physical
|
|
|
|
// register is not register allocatable, it is not tracked. This is useful for
|
|
|
|
// things like the stack pointer and condition codes.
|
2005-04-21 20:39:54 +00:00
|
|
|
//
|
2003-01-13 01:01:31 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_CODEGEN_LIVEVARIABLES_H
|
|
|
|
#define LLVM_CODEGEN_LIVEVARIABLES_H
|
|
|
|
|
|
|
|
#include "llvm/CodeGen/MachineFunctionPass.h"
|
2007-02-15 05:59:24 +00:00
|
|
|
#include "llvm/ADT/BitVector.h"
|
2008-04-02 18:04:08 +00:00
|
|
|
#include "llvm/ADT/DenseMap.h"
|
2007-04-25 19:34:00 +00:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2003-01-13 01:01:31 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2008-04-02 18:04:08 +00:00
|
|
|
class MachineRegisterInfo;
|
2008-02-10 18:45:23 +00:00
|
|
|
class TargetRegisterInfo;
|
2003-01-13 01:01:31 +00:00
|
|
|
|
|
|
|
class LiveVariables : public MachineFunctionPass {
|
2003-05-12 14:23:04 +00:00
|
|
|
public:
|
2007-05-06 13:37:16 +00:00
|
|
|
static char ID; // Pass identification, replacement for typeid
|
2008-09-04 17:05:41 +00:00
|
|
|
LiveVariables() : MachineFunctionPass(&ID) {}
|
2007-05-01 21:15:47 +00:00
|
|
|
|
2006-01-04 07:29:33 +00:00
|
|
|
/// VarInfo - This represents the regions where a virtual register is live in
|
2006-10-03 07:20:20 +00:00
|
|
|
/// the program. We represent this with three different pieces of
|
2008-11-12 17:02:24 +00:00
|
|
|
/// information: the set of blocks in which the instruction is live
|
|
|
|
/// throughout, the set of blocks in which the instruction is actually used,
|
|
|
|
/// and the set of non-phi instructions that are the last users of the value.
|
2006-01-04 07:29:33 +00:00
|
|
|
///
|
2008-11-12 23:24:15 +00:00
|
|
|
/// In the common case where a value is defined and killed in the same block,
|
|
|
|
/// There is one killing instruction, and AliveBlocks is empty.
|
|
|
|
///
|
|
|
|
/// Otherwise, the value is live out of the block. If the value is live
|
|
|
|
/// throughout any blocks, these blocks are listed in AliveBlocks. Blocks
|
|
|
|
/// where the liveness range ends are not included in AliveBlocks, instead
|
|
|
|
/// being captured by the Kills set. In these blocks, the value is live into
|
|
|
|
/// the block (unless the value is defined and killed in the same block) and
|
|
|
|
/// lives until the specified instruction. Note that there cannot ever be a
|
|
|
|
/// value whose Kills set contains two instructions from the same basic block.
|
2006-01-04 07:29:33 +00:00
|
|
|
///
|
|
|
|
/// PHI nodes complicate things a bit. If a PHI node is the last user of a
|
|
|
|
/// value in one of its predecessor blocks, it is not listed in the kills set,
|
|
|
|
/// but does include the predecessor block in the AliveBlocks set (unless that
|
|
|
|
/// block also defines the value). This leads to the (perfectly sensical)
|
|
|
|
/// situation where a value is defined in a block, and the last use is a phi
|
2008-07-03 09:09:37 +00:00
|
|
|
/// node in the successor. In this case, AliveBlocks is empty (the value is
|
|
|
|
/// not live across any blocks) and Kills is empty (phi nodes are not
|
|
|
|
/// included). This is sensical because the value must be live to the end of
|
|
|
|
/// the block, but is not live in any successor blocks.
|
2003-01-13 01:01:31 +00:00
|
|
|
struct VarInfo {
|
2008-11-12 17:02:24 +00:00
|
|
|
/// AliveBlocks - Set of blocks in which this value is alive completely
|
2003-01-13 01:01:31 +00:00
|
|
|
/// through. This is a bit set which uses the basic block number as an
|
|
|
|
/// index.
|
|
|
|
///
|
2007-02-15 05:59:24 +00:00
|
|
|
BitVector AliveBlocks;
|
2003-01-13 01:01:31 +00:00
|
|
|
|
2008-11-12 17:02:24 +00:00
|
|
|
/// UsedBlocks - Set of blocks in which this value is actually used. This
|
2007-11-08 01:22:24 +00:00
|
|
|
/// is a bit set which uses the basic block number as an index.
|
|
|
|
BitVector UsedBlocks;
|
|
|
|
|
2007-04-17 20:22:11 +00:00
|
|
|
/// NumUses - Number of uses of this register across the entire function.
|
|
|
|
///
|
|
|
|
unsigned NumUses;
|
|
|
|
|
2004-07-19 07:04:55 +00:00
|
|
|
/// Kills - List of MachineInstruction's which are the last use of this
|
|
|
|
/// virtual register (kill it) in their basic block.
|
2003-01-13 01:01:31 +00:00
|
|
|
///
|
2004-07-19 07:04:55 +00:00
|
|
|
std::vector<MachineInstr*> Kills;
|
2003-01-13 01:01:31 +00:00
|
|
|
|
2008-07-03 09:09:37 +00:00
|
|
|
VarInfo() : NumUses(0) {}
|
2003-05-12 14:23:04 +00:00
|
|
|
|
2003-12-18 13:06:04 +00:00
|
|
|
/// removeKill - Delete a kill corresponding to the specified
|
|
|
|
/// machine instruction. Returns true if there was a kill
|
|
|
|
/// corresponding to this instruction, false otherwise.
|
|
|
|
bool removeKill(MachineInstr *MI) {
|
2008-03-13 02:42:55 +00:00
|
|
|
std::vector<MachineInstr*>::iterator
|
|
|
|
I = std::find(Kills.begin(), Kills.end(), MI);
|
|
|
|
if (I == Kills.end())
|
|
|
|
return false;
|
|
|
|
Kills.erase(I);
|
|
|
|
return true;
|
2003-05-12 14:23:04 +00:00
|
|
|
}
|
2006-01-04 05:39:51 +00:00
|
|
|
|
|
|
|
void dump() const;
|
2003-01-13 01:01:31 +00:00
|
|
|
};
|
|
|
|
|
2003-05-12 14:23:04 +00:00
|
|
|
private:
|
2003-01-13 01:01:31 +00:00
|
|
|
/// VirtRegInfo - This list is a mapping from virtual register number to
|
|
|
|
/// variable information. FirstVirtualRegister is subtracted from the virtual
|
|
|
|
/// register number before indexing into this list.
|
|
|
|
///
|
|
|
|
std::vector<VarInfo> VirtRegInfo;
|
|
|
|
|
2007-02-19 21:49:54 +00:00
|
|
|
/// ReservedRegisters - This vector keeps track of which registers
|
|
|
|
/// are reserved register which are not allocatable by the target machine.
|
|
|
|
/// We can not track liveness for values that are in this set.
|
2003-05-07 20:07:58 +00:00
|
|
|
///
|
2007-02-19 21:49:54 +00:00
|
|
|
BitVector ReservedRegisters;
|
2003-05-12 03:51:30 +00:00
|
|
|
|
2003-01-13 01:01:31 +00:00
|
|
|
private: // Intermediate data structures
|
2007-03-17 09:29:54 +00:00
|
|
|
MachineFunction *MF;
|
|
|
|
|
2008-04-02 18:04:08 +00:00
|
|
|
MachineRegisterInfo* MRI;
|
|
|
|
|
2008-03-05 00:59:57 +00:00
|
|
|
const TargetRegisterInfo *TRI;
|
2003-01-13 01:01:31 +00:00
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
// PhysRegInfo - Keep track of which instruction was the last def of a
|
2007-04-25 07:30:23 +00:00
|
|
|
// physical register. This is a purely local property, because all physical
|
2008-02-20 09:14:09 +00:00
|
|
|
// register references are presumed dead across basic blocks.
|
2008-04-16 09:46:40 +00:00
|
|
|
MachineInstr **PhysRegDef;
|
2007-04-25 07:30:23 +00:00
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
// PhysRegInfo - Keep track of which instruction was the last use of a
|
|
|
|
// physical register. This is a purely local property, because all physical
|
|
|
|
// register references are presumed dead across basic blocks.
|
|
|
|
MachineInstr **PhysRegUse;
|
2006-10-03 07:20:20 +00:00
|
|
|
|
2007-04-25 19:34:00 +00:00
|
|
|
SmallVector<unsigned, 4> *PHIVarInfo;
|
2006-11-15 20:51:59 +00:00
|
|
|
|
2008-04-02 18:04:08 +00:00
|
|
|
// DistanceMap - Keep track the distance of a MI from the start of the
|
|
|
|
// current basic block.
|
|
|
|
DenseMap<MachineInstr*, unsigned> DistanceMap;
|
|
|
|
|
2007-06-26 21:03:35 +00:00
|
|
|
/// HandlePhysRegKill - Add kills of Reg and its sub-registers to the
|
|
|
|
/// uses. Pay special attention to the sub-register uses which may come below
|
|
|
|
/// the last use of the whole register.
|
2009-01-20 21:25:12 +00:00
|
|
|
bool HandlePhysRegKill(unsigned Reg, MachineInstr *MI);
|
2008-04-16 09:46:40 +00:00
|
|
|
|
2004-01-11 09:18:45 +00:00
|
|
|
void HandlePhysRegUse(unsigned Reg, MachineInstr *MI);
|
|
|
|
void HandlePhysRegDef(unsigned Reg, MachineInstr *MI);
|
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
/// FindLastPartialDef - Return the last partial def of the specified register.
|
|
|
|
/// Also returns the sub-register that's defined.
|
|
|
|
MachineInstr *FindLastPartialDef(unsigned Reg, unsigned &PartDefReg);
|
|
|
|
|
2008-03-19 00:52:20 +00:00
|
|
|
/// hasRegisterUseBelow - Return true if the specified register is used after
|
|
|
|
/// the current instruction and before it's next definition.
|
2008-04-16 09:46:40 +00:00
|
|
|
bool hasRegisterUseBelow(unsigned Reg, MachineBasicBlock::iterator I,
|
2008-03-19 00:52:20 +00:00
|
|
|
MachineBasicBlock *MBB);
|
|
|
|
|
2006-10-03 07:20:20 +00:00
|
|
|
/// analyzePHINodes - Gather information about the PHI nodes in here. In
|
|
|
|
/// particular, we want to map the variable information of a virtual
|
|
|
|
/// register which is used in a PHI node. We map that to the BB the vreg
|
|
|
|
/// is coming from.
|
|
|
|
void analyzePHINodes(const MachineFunction& Fn);
|
2003-01-13 01:01:31 +00:00
|
|
|
public:
|
|
|
|
|
|
|
|
virtual bool runOnMachineFunction(MachineFunction &MF);
|
|
|
|
|
2005-08-23 22:43:24 +00:00
|
|
|
/// RegisterDefIsDead - Return true if the specified instruction defines the
|
|
|
|
/// specified register, but that definition is dead.
|
2005-08-24 00:09:02 +00:00
|
|
|
bool RegisterDefIsDead(MachineInstr *MI, unsigned Reg) const;
|
2006-11-15 20:51:59 +00:00
|
|
|
|
2003-05-12 03:51:30 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
// API to update live variable information
|
|
|
|
|
2008-07-03 00:07:19 +00:00
|
|
|
/// replaceKillInstruction - Update register kill info by replacing a kill
|
|
|
|
/// instruction with a new one.
|
|
|
|
void replaceKillInstruction(unsigned Reg, MachineInstr *OldMI,
|
|
|
|
MachineInstr *NewMI);
|
|
|
|
|
2003-05-12 03:51:30 +00:00
|
|
|
/// addVirtualRegisterKilled - Add information about the fact that the
|
|
|
|
/// specified register is killed after being used by the specified
|
2007-04-26 01:40:09 +00:00
|
|
|
/// instruction. If AddIfNotFound is true, add a implicit operand if it's
|
|
|
|
/// not found.
|
|
|
|
void addVirtualRegisterKilled(unsigned IncomingReg, MachineInstr *MI,
|
|
|
|
bool AddIfNotFound = false) {
|
2008-03-05 00:59:57 +00:00
|
|
|
if (MI->addRegisterKilled(IncomingReg, TRI, AddIfNotFound))
|
2007-04-26 01:40:09 +00:00
|
|
|
getVarInfo(IncomingReg).Kills.push_back(MI);
|
Live interval splitting:
When a live interval is being spilled, rather than creating short, non-spillable
intervals for every def / use, split the interval at BB boundaries. That is, for
every BB where the live interval is defined or used, create a new interval that
covers all the defs and uses in the BB.
This is designed to eliminate one common problem: multiple reloads of the same
value in a single basic block. Note, it does *not* decrease the number of spills
since no copies are inserted so the split intervals are *connected* through
spill and reloads (or rematerialization). The newly created intervals can be
spilled again, in that case, since it does not span multiple basic blocks, it's
spilled in the usual manner. However, it can reuse the same stack slot as the
previously split interval.
This is currently controlled by -split-intervals-at-bb.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@44198 91177308-0d34-0410-b5e6-96231b3b80d8
2007-11-17 00:40:40 +00:00
|
|
|
}
|
2003-05-12 03:51:30 +00:00
|
|
|
|
2008-07-03 09:09:37 +00:00
|
|
|
/// removeVirtualRegisterKilled - Remove the specified kill of the virtual
|
2003-12-18 13:06:04 +00:00
|
|
|
/// register from the live variable information. Returns true if the
|
|
|
|
/// variable was marked as killed by the specified instruction,
|
|
|
|
/// false otherwise.
|
2008-07-03 09:09:37 +00:00
|
|
|
bool removeVirtualRegisterKilled(unsigned reg, MachineInstr *MI) {
|
2003-12-18 13:06:04 +00:00
|
|
|
if (!getVarInfo(reg).removeKill(MI))
|
|
|
|
return false;
|
2005-08-23 23:40:41 +00:00
|
|
|
|
2006-11-15 20:51:59 +00:00
|
|
|
bool Removed = false;
|
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = MI->getOperand(i);
|
2008-10-03 15:45:36 +00:00
|
|
|
if (MO.isReg() && MO.isKill() && MO.getReg() == reg) {
|
2007-12-30 21:56:09 +00:00
|
|
|
MO.setIsKill(false);
|
2006-11-15 20:51:59 +00:00
|
|
|
Removed = true;
|
|
|
|
break;
|
2005-08-23 23:40:41 +00:00
|
|
|
}
|
2006-11-15 20:51:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
assert(Removed && "Register is not used by this instruction!");
|
2003-12-18 13:06:04 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2005-08-23 23:40:41 +00:00
|
|
|
/// removeVirtualRegistersKilled - Remove all killed info for the specified
|
|
|
|
/// instruction.
|
2006-09-03 00:05:09 +00:00
|
|
|
void removeVirtualRegistersKilled(MachineInstr *MI);
|
Live interval splitting:
When a live interval is being spilled, rather than creating short, non-spillable
intervals for every def / use, split the interval at BB boundaries. That is, for
every BB where the live interval is defined or used, create a new interval that
covers all the defs and uses in the BB.
This is designed to eliminate one common problem: multiple reloads of the same
value in a single basic block. Note, it does *not* decrease the number of spills
since no copies are inserted so the split intervals are *connected* through
spill and reloads (or rematerialization). The newly created intervals can be
spilled again, in that case, since it does not span multiple basic blocks, it's
spilled in the usual manner. However, it can reuse the same stack slot as the
previously split interval.
This is currently controlled by -split-intervals-at-bb.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@44198 91177308-0d34-0410-b5e6-96231b3b80d8
2007-11-17 00:40:40 +00:00
|
|
|
|
2003-05-12 03:51:30 +00:00
|
|
|
/// addVirtualRegisterDead - Add information about the fact that the specified
|
2007-04-26 01:40:09 +00:00
|
|
|
/// register is dead after being used by the specified instruction. If
|
|
|
|
/// AddIfNotFound is true, add a implicit operand if it's not found.
|
|
|
|
void addVirtualRegisterDead(unsigned IncomingReg, MachineInstr *MI,
|
|
|
|
bool AddIfNotFound = false) {
|
2008-03-05 00:59:57 +00:00
|
|
|
if (MI->addRegisterDead(IncomingReg, TRI, AddIfNotFound))
|
2008-07-03 09:09:37 +00:00
|
|
|
getVarInfo(IncomingReg).Kills.push_back(MI);
|
2003-01-13 01:01:31 +00:00
|
|
|
}
|
|
|
|
|
2008-07-03 09:09:37 +00:00
|
|
|
/// removeVirtualRegisterDead - Remove the specified kill of the virtual
|
2003-12-18 13:06:04 +00:00
|
|
|
/// register from the live variable information. Returns true if the
|
|
|
|
/// variable was marked dead at the specified instruction, false
|
|
|
|
/// otherwise.
|
2008-07-03 09:09:37 +00:00
|
|
|
bool removeVirtualRegisterDead(unsigned reg, MachineInstr *MI) {
|
2003-12-18 13:06:04 +00:00
|
|
|
if (!getVarInfo(reg).removeKill(MI))
|
|
|
|
return false;
|
|
|
|
|
2006-11-15 20:51:59 +00:00
|
|
|
bool Removed = false;
|
|
|
|
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
|
|
|
|
MachineOperand &MO = MI->getOperand(i);
|
2008-10-03 15:45:36 +00:00
|
|
|
if (MO.isReg() && MO.isDef() && MO.getReg() == reg) {
|
2007-12-30 21:56:09 +00:00
|
|
|
MO.setIsDead(false);
|
2006-11-15 20:51:59 +00:00
|
|
|
Removed = true;
|
|
|
|
break;
|
2005-08-23 23:40:41 +00:00
|
|
|
}
|
2006-11-15 20:51:59 +00:00
|
|
|
}
|
|
|
|
assert(Removed && "Register is not defined by this instruction!");
|
2003-12-18 13:06:04 +00:00
|
|
|
return true;
|
|
|
|
}
|
2008-08-04 23:54:43 +00:00
|
|
|
|
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const;
|
2003-01-13 01:01:31 +00:00
|
|
|
|
|
|
|
virtual void releaseMemory() {
|
|
|
|
VirtRegInfo.clear();
|
|
|
|
}
|
2003-05-12 14:23:04 +00:00
|
|
|
|
|
|
|
/// getVarInfo - Return the VarInfo structure for the specified VIRTUAL
|
|
|
|
/// register.
|
|
|
|
VarInfo &getVarInfo(unsigned RegIdx);
|
2003-01-13 01:01:31 +00:00
|
|
|
|
2008-01-15 22:58:11 +00:00
|
|
|
void MarkVirtRegAliveInBlock(VarInfo& VRInfo, MachineBasicBlock* DefBlock,
|
|
|
|
MachineBasicBlock *BB);
|
|
|
|
void MarkVirtRegAliveInBlock(VarInfo& VRInfo, MachineBasicBlock* DefBlock,
|
|
|
|
MachineBasicBlock *BB,
|
2007-05-08 19:00:00 +00:00
|
|
|
std::vector<MachineBasicBlock*> &WorkList);
|
2008-09-21 21:11:41 +00:00
|
|
|
void HandleVirtRegDef(unsigned reg, MachineInstr *MI);
|
2008-01-15 22:19:35 +00:00
|
|
|
void HandleVirtRegUse(unsigned reg, MachineBasicBlock *MBB,
|
2005-04-22 03:46:24 +00:00
|
|
|
MachineInstr *MI);
|
2003-01-13 01:01:31 +00:00
|
|
|
};
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2003-01-13 01:01:31 +00:00
|
|
|
#endif
|