2003-01-13 20:01:16 +00:00
|
|
|
//===-- LiveVariables.cpp - Live Variable Analysis for Machine Code -------===//
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2005-04-21 22:36:52 +00:00
|
|
|
//
|
2003-05-07 20:08:36 +00:00
|
|
|
// This file implements the LiveVariable analysis pass. For each machine
|
|
|
|
// 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).
|
|
|
|
//
|
|
|
|
// This class computes live variables using are sparse implementation based on
|
|
|
|
// the machine code SSA form. This class computes live variable information for
|
|
|
|
// 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.
|
|
|
|
//
|
2003-01-13 20:01:16 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/CodeGen/LiveVariables.h"
|
|
|
|
#include "llvm/CodeGen/MachineInstr.h"
|
2007-12-31 04:13:23 +00:00
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2008-08-04 23:54:43 +00:00
|
|
|
#include "llvm/CodeGen/Passes.h"
|
2008-02-10 18:45:23 +00:00
|
|
|
#include "llvm/Target/TargetRegisterInfo.h"
|
2003-01-14 22:00:31 +00:00
|
|
|
#include "llvm/Target/TargetInstrInfo.h"
|
2003-01-13 20:01:16 +00:00
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/DepthFirstIterator.h"
|
2007-06-27 05:23:00 +00:00
|
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
2008-06-27 07:05:59 +00:00
|
|
|
#include "llvm/ADT/SmallSet.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2004-10-25 18:44:14 +00:00
|
|
|
#include "llvm/Config/alloca.h"
|
2005-08-24 00:09:33 +00:00
|
|
|
#include <algorithm>
|
2004-01-30 22:08:53 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2007-05-03 01:11:54 +00:00
|
|
|
char LiveVariables::ID = 0;
|
2006-08-27 22:30:17 +00:00
|
|
|
static RegisterPass<LiveVariables> X("livevars", "Live Variable Analysis");
|
2003-01-13 20:01:16 +00:00
|
|
|
|
2008-08-04 23:54:43 +00:00
|
|
|
|
|
|
|
void LiveVariables::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.addRequiredID(UnreachableMachineBlockElimID);
|
|
|
|
AU.setPreservesAll();
|
2009-07-31 18:16:33 +00:00
|
|
|
MachineFunctionPass::getAnalysisUsage(AU);
|
2008-08-04 23:54:43 +00:00
|
|
|
}
|
|
|
|
|
2006-01-04 05:40:30 +00:00
|
|
|
void LiveVariables::VarInfo::dump() const {
|
2006-12-07 20:28:15 +00:00
|
|
|
cerr << " Alive in blocks: ";
|
2009-05-26 18:27:15 +00:00
|
|
|
for (SparseBitVector<>::iterator I = AliveBlocks.begin(),
|
|
|
|
E = AliveBlocks.end(); I != E; ++I)
|
|
|
|
cerr << *I << ", ";
|
2006-12-07 20:28:15 +00:00
|
|
|
cerr << "\n Killed by:";
|
2006-01-04 05:40:30 +00:00
|
|
|
if (Kills.empty())
|
2006-12-07 20:28:15 +00:00
|
|
|
cerr << " No instructions.\n";
|
2006-01-04 05:40:30 +00:00
|
|
|
else {
|
|
|
|
for (unsigned i = 0, e = Kills.size(); i != e; ++i)
|
2006-12-07 20:28:15 +00:00
|
|
|
cerr << "\n #" << i << ": " << *Kills[i];
|
|
|
|
cerr << "\n";
|
2006-01-04 05:40:30 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-02-20 06:10:21 +00:00
|
|
|
/// getVarInfo - Get (possibly creating) a VarInfo object for the given vreg.
|
2003-05-12 14:24:00 +00:00
|
|
|
LiveVariables::VarInfo &LiveVariables::getVarInfo(unsigned RegIdx) {
|
2008-02-10 18:45:23 +00:00
|
|
|
assert(TargetRegisterInfo::isVirtualRegister(RegIdx) &&
|
2003-05-12 14:24:00 +00:00
|
|
|
"getVarInfo: not a virtual register!");
|
2008-02-10 18:45:23 +00:00
|
|
|
RegIdx -= TargetRegisterInfo::FirstVirtualRegister;
|
2003-05-12 14:24:00 +00:00
|
|
|
if (RegIdx >= VirtRegInfo.size()) {
|
|
|
|
if (RegIdx >= 2*VirtRegInfo.size())
|
|
|
|
VirtRegInfo.resize(RegIdx*2);
|
|
|
|
else
|
|
|
|
VirtRegInfo.resize(2*VirtRegInfo.size());
|
|
|
|
}
|
2009-05-26 18:27:15 +00:00
|
|
|
return VirtRegInfo[RegIdx];
|
2003-05-12 14:24:00 +00:00
|
|
|
}
|
|
|
|
|
2008-01-15 22:58:11 +00:00
|
|
|
void LiveVariables::MarkVirtRegAliveInBlock(VarInfo& VRInfo,
|
|
|
|
MachineBasicBlock *DefBlock,
|
2007-05-08 19:00:00 +00:00
|
|
|
MachineBasicBlock *MBB,
|
|
|
|
std::vector<MachineBasicBlock*> &WorkList) {
|
2004-07-01 04:29:47 +00:00
|
|
|
unsigned BBNum = MBB->getNumber();
|
2008-01-15 22:02:46 +00:00
|
|
|
|
2003-01-13 20:01:16 +00:00
|
|
|
// Check to see if this basic block is one of the killing blocks. If so,
|
2008-02-20 06:10:21 +00:00
|
|
|
// remove it.
|
2003-01-13 20:01:16 +00:00
|
|
|
for (unsigned i = 0, e = VRInfo.Kills.size(); i != e; ++i)
|
2004-07-19 07:04:55 +00:00
|
|
|
if (VRInfo.Kills[i]->getParent() == MBB) {
|
2003-01-13 20:01:16 +00:00
|
|
|
VRInfo.Kills.erase(VRInfo.Kills.begin()+i); // Erase entry
|
|
|
|
break;
|
|
|
|
}
|
2008-01-15 22:02:46 +00:00
|
|
|
|
2008-01-15 22:58:11 +00:00
|
|
|
if (MBB == DefBlock) return; // Terminate recursion
|
2003-01-13 20:01:16 +00:00
|
|
|
|
2009-05-26 18:27:15 +00:00
|
|
|
if (VRInfo.AliveBlocks.test(BBNum))
|
2003-01-13 20:01:16 +00:00
|
|
|
return; // We already know the block is live
|
|
|
|
|
|
|
|
// Mark the variable known alive in this bb
|
2009-05-26 18:27:15 +00:00
|
|
|
VRInfo.AliveBlocks.set(BBNum);
|
2003-01-13 20:01:16 +00:00
|
|
|
|
2007-05-08 19:00:00 +00:00
|
|
|
for (MachineBasicBlock::const_pred_reverse_iterator PI = MBB->pred_rbegin(),
|
|
|
|
E = MBB->pred_rend(); PI != E; ++PI)
|
|
|
|
WorkList.push_back(*PI);
|
2003-01-13 20:01:16 +00:00
|
|
|
}
|
|
|
|
|
2008-02-20 07:36:31 +00:00
|
|
|
void LiveVariables::MarkVirtRegAliveInBlock(VarInfo &VRInfo,
|
2008-01-15 22:58:11 +00:00
|
|
|
MachineBasicBlock *DefBlock,
|
2007-05-08 19:00:00 +00:00
|
|
|
MachineBasicBlock *MBB) {
|
|
|
|
std::vector<MachineBasicBlock*> WorkList;
|
2008-01-15 22:58:11 +00:00
|
|
|
MarkVirtRegAliveInBlock(VRInfo, DefBlock, MBB, WorkList);
|
2008-02-20 07:36:31 +00:00
|
|
|
|
2007-05-08 19:00:00 +00:00
|
|
|
while (!WorkList.empty()) {
|
|
|
|
MachineBasicBlock *Pred = WorkList.back();
|
|
|
|
WorkList.pop_back();
|
2008-01-15 22:58:11 +00:00
|
|
|
MarkVirtRegAliveInBlock(VRInfo, DefBlock, Pred, WorkList);
|
2007-05-08 19:00:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-15 22:02:46 +00:00
|
|
|
void LiveVariables::HandleVirtRegUse(unsigned reg, MachineBasicBlock *MBB,
|
2004-06-24 21:31:16 +00:00
|
|
|
MachineInstr *MI) {
|
2008-04-02 18:04:08 +00:00
|
|
|
assert(MRI->getVRegDef(reg) && "Register use before def!");
|
2004-09-01 22:34:52 +00:00
|
|
|
|
2007-11-08 01:20:48 +00:00
|
|
|
unsigned BBNum = MBB->getNumber();
|
|
|
|
|
2008-01-15 22:02:46 +00:00
|
|
|
VarInfo& VRInfo = getVarInfo(reg);
|
2007-04-17 20:22:11 +00:00
|
|
|
VRInfo.NumUses++;
|
2007-03-17 09:29:54 +00:00
|
|
|
|
2008-02-20 06:10:21 +00:00
|
|
|
// Check to see if this basic block is already a kill block.
|
2004-07-19 07:04:55 +00:00
|
|
|
if (!VRInfo.Kills.empty() && VRInfo.Kills.back()->getParent() == MBB) {
|
2008-02-20 06:10:21 +00:00
|
|
|
// Yes, this register is killed in this basic block already. Increase the
|
2003-01-13 20:01:16 +00:00
|
|
|
// live range by updating the kill instruction.
|
2004-07-19 07:04:55 +00:00
|
|
|
VRInfo.Kills.back() = MI;
|
2003-01-13 20:01:16 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
for (unsigned i = 0, e = VRInfo.Kills.size(); i != e; ++i)
|
2004-07-19 07:04:55 +00:00
|
|
|
assert(VRInfo.Kills[i]->getParent() != MBB && "entry should be at end!");
|
2003-01-13 20:01:16 +00:00
|
|
|
#endif
|
|
|
|
|
2008-06-23 23:41:14 +00:00
|
|
|
// This situation can occur:
|
|
|
|
//
|
|
|
|
// ,------.
|
|
|
|
// | |
|
|
|
|
// | v
|
|
|
|
// | t2 = phi ... t1 ...
|
|
|
|
// | |
|
|
|
|
// | v
|
|
|
|
// | t1 = ...
|
|
|
|
// | ... = ... t1 ...
|
|
|
|
// | |
|
|
|
|
// `------'
|
|
|
|
//
|
|
|
|
// where there is a use in a PHI node that's a predecessor to the defining
|
|
|
|
// block. We don't want to mark all predecessors as having the value "alive"
|
|
|
|
// in this case.
|
|
|
|
if (MBB == MRI->getVRegDef(reg)->getParent()) return;
|
2003-01-13 20:01:16 +00:00
|
|
|
|
2008-02-20 06:10:21 +00:00
|
|
|
// Add a new kill entry for this basic block. If this virtual register is
|
|
|
|
// already marked as alive in this basic block, that means it is alive in at
|
|
|
|
// least one of the successor blocks, it's not a kill.
|
2009-05-26 18:27:15 +00:00
|
|
|
if (!VRInfo.AliveBlocks.test(BBNum))
|
2007-03-09 09:48:56 +00:00
|
|
|
VRInfo.Kills.push_back(MI);
|
2003-01-13 20:01:16 +00:00
|
|
|
|
2008-02-20 07:36:31 +00:00
|
|
|
// Update all dominating blocks to mark them as "known live".
|
2004-05-01 21:24:24 +00:00
|
|
|
for (MachineBasicBlock::const_pred_iterator PI = MBB->pred_begin(),
|
|
|
|
E = MBB->pred_end(); PI != E; ++PI)
|
2008-04-02 18:04:08 +00:00
|
|
|
MarkVirtRegAliveInBlock(VRInfo, MRI->getVRegDef(reg)->getParent(), *PI);
|
2003-01-13 20:01:16 +00:00
|
|
|
}
|
|
|
|
|
2008-09-21 21:11:41 +00:00
|
|
|
void LiveVariables::HandleVirtRegDef(unsigned Reg, MachineInstr *MI) {
|
|
|
|
VarInfo &VRInfo = getVarInfo(Reg);
|
|
|
|
|
2009-05-26 18:27:15 +00:00
|
|
|
if (VRInfo.AliveBlocks.empty())
|
2008-09-21 21:11:41 +00:00
|
|
|
// If vr is not alive in any block, then defaults to dead.
|
|
|
|
VRInfo.Kills.push_back(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 *LiveVariables::FindLastPartialDef(unsigned Reg,
|
|
|
|
unsigned &PartDefReg) {
|
|
|
|
unsigned LastDefReg = 0;
|
|
|
|
unsigned LastDefDist = 0;
|
|
|
|
MachineInstr *LastDef = NULL;
|
|
|
|
for (const unsigned *SubRegs = TRI->getSubRegisters(Reg);
|
|
|
|
unsigned SubReg = *SubRegs; ++SubRegs) {
|
|
|
|
MachineInstr *Def = PhysRegDef[SubReg];
|
|
|
|
if (!Def)
|
|
|
|
continue;
|
|
|
|
unsigned Dist = DistanceMap[Def];
|
|
|
|
if (Dist > LastDefDist) {
|
|
|
|
LastDefReg = SubReg;
|
|
|
|
LastDef = Def;
|
|
|
|
LastDefDist = Dist;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
PartDefReg = LastDefReg;
|
|
|
|
return LastDef;
|
|
|
|
}
|
|
|
|
|
2008-02-20 09:15:16 +00:00
|
|
|
/// HandlePhysRegUse - Turn previous partial def's into read/mod/writes. Add
|
|
|
|
/// implicit defs to a machine instruction if there was an earlier def of its
|
|
|
|
/// super-register.
|
2003-01-13 20:01:16 +00:00
|
|
|
void LiveVariables::HandlePhysRegUse(unsigned Reg, MachineInstr *MI) {
|
2008-04-16 09:46:40 +00:00
|
|
|
// If there was a previous use or a "full" def all is well.
|
|
|
|
if (!PhysRegDef[Reg] && !PhysRegUse[Reg]) {
|
|
|
|
// Otherwise, the last sub-register def implicitly defines this register.
|
|
|
|
// e.g.
|
|
|
|
// AH =
|
|
|
|
// AL = ... <imp-def EAX>, <imp-kill AH>
|
|
|
|
// = AH
|
|
|
|
// ...
|
|
|
|
// = EAX
|
|
|
|
// All of the sub-registers must have been defined before the use of Reg!
|
|
|
|
unsigned PartDefReg = 0;
|
|
|
|
MachineInstr *LastPartialDef = FindLastPartialDef(Reg, PartDefReg);
|
|
|
|
// If LastPartialDef is NULL, it must be using a livein register.
|
|
|
|
if (LastPartialDef) {
|
|
|
|
LastPartialDef->addOperand(MachineOperand::CreateReg(Reg, true/*IsDef*/,
|
|
|
|
true/*IsImp*/));
|
|
|
|
PhysRegDef[Reg] = LastPartialDef;
|
2008-08-14 23:41:38 +00:00
|
|
|
SmallSet<unsigned, 8> Processed;
|
2008-04-16 09:46:40 +00:00
|
|
|
for (const unsigned *SubRegs = TRI->getSubRegisters(Reg);
|
|
|
|
unsigned SubReg = *SubRegs; ++SubRegs) {
|
|
|
|
if (Processed.count(SubReg))
|
|
|
|
continue;
|
|
|
|
if (SubReg == PartDefReg || TRI->isSubRegister(PartDefReg, SubReg))
|
|
|
|
continue;
|
|
|
|
// This part of Reg was defined before the last partial def. It's killed
|
|
|
|
// here.
|
|
|
|
LastPartialDef->addOperand(MachineOperand::CreateReg(SubReg,
|
|
|
|
false/*IsDef*/,
|
|
|
|
true/*IsImp*/));
|
|
|
|
PhysRegDef[SubReg] = LastPartialDef;
|
|
|
|
for (const unsigned *SS = TRI->getSubRegisters(SubReg); *SS; ++SS)
|
|
|
|
Processed.insert(*SS);
|
|
|
|
}
|
|
|
|
}
|
2007-04-25 07:30:23 +00:00
|
|
|
}
|
2008-02-20 06:10:21 +00:00
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
// Remember this use.
|
|
|
|
PhysRegUse[Reg] = MI;
|
2008-03-05 00:59:57 +00:00
|
|
|
for (const unsigned *SubRegs = TRI->getSubRegisters(Reg);
|
2008-02-20 07:36:31 +00:00
|
|
|
unsigned SubReg = *SubRegs; ++SubRegs)
|
2008-04-16 09:46:40 +00:00
|
|
|
PhysRegUse[SubReg] = MI;
|
2007-06-26 21:03:35 +00:00
|
|
|
}
|
|
|
|
|
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.
|
|
|
|
bool LiveVariables::hasRegisterUseBelow(unsigned Reg,
|
|
|
|
MachineBasicBlock::iterator I,
|
|
|
|
MachineBasicBlock *MBB) {
|
|
|
|
if (I == MBB->end())
|
|
|
|
return false;
|
2008-04-02 18:04:08 +00:00
|
|
|
|
|
|
|
// First find out if there are any uses / defs below.
|
|
|
|
bool hasDistInfo = true;
|
|
|
|
unsigned CurDist = DistanceMap[I];
|
|
|
|
SmallVector<MachineInstr*, 4> Uses;
|
|
|
|
SmallVector<MachineInstr*, 4> Defs;
|
|
|
|
for (MachineRegisterInfo::reg_iterator RI = MRI->reg_begin(Reg),
|
|
|
|
RE = MRI->reg_end(); RI != RE; ++RI) {
|
|
|
|
MachineOperand &UDO = RI.getOperand();
|
|
|
|
MachineInstr *UDMI = &*RI;
|
|
|
|
if (UDMI->getParent() != MBB)
|
|
|
|
continue;
|
|
|
|
DenseMap<MachineInstr*, unsigned>::iterator DI = DistanceMap.find(UDMI);
|
|
|
|
bool isBelow = false;
|
|
|
|
if (DI == DistanceMap.end()) {
|
|
|
|
// Must be below if it hasn't been assigned a distance yet.
|
|
|
|
isBelow = true;
|
|
|
|
hasDistInfo = false;
|
|
|
|
} else if (DI->second > CurDist)
|
|
|
|
isBelow = true;
|
|
|
|
if (isBelow) {
|
|
|
|
if (UDO.isUse())
|
|
|
|
Uses.push_back(UDMI);
|
|
|
|
if (UDO.isDef())
|
|
|
|
Defs.push_back(UDMI);
|
2008-03-19 00:52:20 +00:00
|
|
|
}
|
|
|
|
}
|
2008-04-02 18:04:08 +00:00
|
|
|
|
|
|
|
if (Uses.empty())
|
|
|
|
// No uses below.
|
|
|
|
return false;
|
|
|
|
else if (!Uses.empty() && Defs.empty())
|
|
|
|
// There are uses below but no defs below.
|
|
|
|
return true;
|
|
|
|
// There are both uses and defs below. We need to know which comes first.
|
|
|
|
if (!hasDistInfo) {
|
|
|
|
// Complete DistanceMap for this MBB. This information is computed only
|
|
|
|
// once per MBB.
|
|
|
|
++I;
|
|
|
|
++CurDist;
|
|
|
|
for (MachineBasicBlock::iterator E = MBB->end(); I != E; ++I, ++CurDist)
|
|
|
|
DistanceMap.insert(std::make_pair(I, CurDist));
|
|
|
|
}
|
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
unsigned EarliestUse = DistanceMap[Uses[0]];
|
|
|
|
for (unsigned i = 1, e = Uses.size(); i != e; ++i) {
|
2008-04-02 18:04:08 +00:00
|
|
|
unsigned Dist = DistanceMap[Uses[i]];
|
|
|
|
if (Dist < EarliestUse)
|
|
|
|
EarliestUse = Dist;
|
|
|
|
}
|
|
|
|
for (unsigned i = 0, e = Defs.size(); i != e; ++i) {
|
|
|
|
unsigned Dist = DistanceMap[Defs[i]];
|
|
|
|
if (Dist < EarliestUse)
|
|
|
|
// The register is defined before its first use below.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
2008-03-19 00:52:20 +00:00
|
|
|
}
|
|
|
|
|
2009-01-20 21:25:12 +00:00
|
|
|
bool LiveVariables::HandlePhysRegKill(unsigned Reg, MachineInstr *MI) {
|
2008-04-16 09:46:40 +00:00
|
|
|
if (!PhysRegUse[Reg] && !PhysRegDef[Reg])
|
|
|
|
return false;
|
|
|
|
|
|
|
|
MachineInstr *LastRefOrPartRef = PhysRegUse[Reg]
|
|
|
|
? PhysRegUse[Reg] : PhysRegDef[Reg];
|
|
|
|
unsigned LastRefOrPartRefDist = DistanceMap[LastRefOrPartRef];
|
|
|
|
// The whole register is used.
|
|
|
|
// AL =
|
|
|
|
// AH =
|
|
|
|
//
|
|
|
|
// = AX
|
|
|
|
// = AL, AX<imp-use, kill>
|
|
|
|
// AX =
|
|
|
|
//
|
|
|
|
// Or whole register is defined, but not used at all.
|
|
|
|
// AX<dead> =
|
|
|
|
// ...
|
|
|
|
// AX =
|
|
|
|
//
|
|
|
|
// Or whole register is defined, but only partly used.
|
|
|
|
// AX<dead> = AL<imp-def>
|
|
|
|
// = AL<kill>
|
|
|
|
// AX =
|
2008-08-14 23:41:38 +00:00
|
|
|
SmallSet<unsigned, 8> PartUses;
|
2008-04-16 09:46:40 +00:00
|
|
|
for (const unsigned *SubRegs = TRI->getSubRegisters(Reg);
|
|
|
|
unsigned SubReg = *SubRegs; ++SubRegs) {
|
|
|
|
if (MachineInstr *Use = PhysRegUse[SubReg]) {
|
|
|
|
PartUses.insert(SubReg);
|
|
|
|
for (const unsigned *SS = TRI->getSubRegisters(SubReg); *SS; ++SS)
|
|
|
|
PartUses.insert(*SS);
|
|
|
|
unsigned Dist = DistanceMap[Use];
|
|
|
|
if (Dist > LastRefOrPartRefDist) {
|
|
|
|
LastRefOrPartRefDist = Dist;
|
|
|
|
LastRefOrPartRef = Use;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-01-20 21:25:12 +00:00
|
|
|
|
|
|
|
if (LastRefOrPartRef == PhysRegDef[Reg] && LastRefOrPartRef != MI)
|
|
|
|
// If the last reference is the last def, then it's not used at all.
|
|
|
|
// That is, unless we are currently processing the last reference itself.
|
2008-04-16 09:46:40 +00:00
|
|
|
LastRefOrPartRef->addRegisterDead(Reg, TRI, true);
|
|
|
|
|
2009-06-20 04:34:51 +00:00
|
|
|
// Partial uses. Mark register def dead and add implicit def of
|
|
|
|
// sub-registers which are used.
|
|
|
|
// EAX<dead> = op AL<imp-def>
|
|
|
|
// That is, EAX def is dead but AL def extends pass it.
|
|
|
|
// Enable this after live interval analysis is fixed to improve codegen!
|
2008-04-16 09:46:40 +00:00
|
|
|
else if (!PhysRegUse[Reg]) {
|
|
|
|
PhysRegDef[Reg]->addRegisterDead(Reg, TRI, true);
|
|
|
|
for (const unsigned *SubRegs = TRI->getSubRegisters(Reg);
|
|
|
|
unsigned SubReg = *SubRegs; ++SubRegs) {
|
|
|
|
if (PartUses.count(SubReg)) {
|
2009-07-06 21:34:05 +00:00
|
|
|
bool NeedDef = true;
|
|
|
|
if (PhysRegDef[Reg] == PhysRegDef[SubReg]) {
|
|
|
|
MachineOperand *MO = PhysRegDef[Reg]->findRegisterDefOperand(SubReg);
|
|
|
|
if (MO) {
|
|
|
|
NeedDef = false;
|
|
|
|
assert(!MO->isDead());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (NeedDef)
|
|
|
|
PhysRegDef[Reg]->addOperand(MachineOperand::CreateReg(SubReg,
|
|
|
|
true, true));
|
2008-04-16 09:46:40 +00:00
|
|
|
LastRefOrPartRef->addRegisterKilled(SubReg, TRI, true);
|
|
|
|
for (const unsigned *SS = TRI->getSubRegisters(SubReg); *SS; ++SS)
|
|
|
|
PartUses.erase(*SS);
|
|
|
|
}
|
|
|
|
}
|
2009-06-20 04:34:51 +00:00
|
|
|
}
|
2008-04-16 09:46:40 +00:00
|
|
|
else
|
|
|
|
LastRefOrPartRef->addRegisterKilled(Reg, TRI, true);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2003-01-13 20:01:16 +00:00
|
|
|
void LiveVariables::HandlePhysRegDef(unsigned Reg, MachineInstr *MI) {
|
2008-04-16 09:46:40 +00:00
|
|
|
// What parts of the register are previously defined?
|
2008-06-27 07:05:59 +00:00
|
|
|
SmallSet<unsigned, 32> Live;
|
2008-04-16 09:46:40 +00:00
|
|
|
if (PhysRegDef[Reg] || PhysRegUse[Reg]) {
|
|
|
|
Live.insert(Reg);
|
|
|
|
for (const unsigned *SS = TRI->getSubRegisters(Reg); *SS; ++SS)
|
|
|
|
Live.insert(*SS);
|
|
|
|
} else {
|
|
|
|
for (const unsigned *SubRegs = TRI->getSubRegisters(Reg);
|
|
|
|
unsigned SubReg = *SubRegs; ++SubRegs) {
|
|
|
|
// If a register isn't itself defined, but all parts that make up of it
|
|
|
|
// are defined, then consider it also defined.
|
|
|
|
// e.g.
|
|
|
|
// AL =
|
|
|
|
// AH =
|
|
|
|
// = AX
|
|
|
|
if (PhysRegDef[SubReg] || PhysRegUse[SubReg]) {
|
|
|
|
Live.insert(SubReg);
|
|
|
|
for (const unsigned *SS = TRI->getSubRegisters(SubReg); *SS; ++SS)
|
|
|
|
Live.insert(*SS);
|
2007-06-26 21:03:35 +00:00
|
|
|
}
|
2008-02-20 07:36:31 +00:00
|
|
|
}
|
2003-01-13 20:01:16 +00:00
|
|
|
}
|
2007-04-25 07:30:23 +00:00
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
// Start from the largest piece, find the last time any part of the register
|
|
|
|
// is referenced.
|
2009-01-20 21:25:12 +00:00
|
|
|
if (!HandlePhysRegKill(Reg, MI)) {
|
2008-04-16 09:46:40 +00:00
|
|
|
// Only some of the sub-registers are used.
|
|
|
|
for (const unsigned *SubRegs = TRI->getSubRegisters(Reg);
|
|
|
|
unsigned SubReg = *SubRegs; ++SubRegs) {
|
|
|
|
if (!Live.count(SubReg))
|
|
|
|
// Skip if this sub-register isn't defined.
|
|
|
|
continue;
|
2009-01-20 21:25:12 +00:00
|
|
|
if (HandlePhysRegKill(SubReg, MI)) {
|
2008-04-16 09:46:40 +00:00
|
|
|
Live.erase(SubReg);
|
|
|
|
for (const unsigned *SS = TRI->getSubRegisters(SubReg); *SS; ++SS)
|
|
|
|
Live.erase(*SS);
|
2008-02-20 07:36:31 +00:00
|
|
|
}
|
2004-01-13 06:24:30 +00:00
|
|
|
}
|
2008-04-16 09:46:40 +00:00
|
|
|
assert(Live.empty() && "Not all defined registers are killed / dead?");
|
2007-04-25 07:30:23 +00:00
|
|
|
}
|
|
|
|
|
2007-06-26 21:03:35 +00:00
|
|
|
if (MI) {
|
2008-04-16 09:46:40 +00:00
|
|
|
// Does this extend the live range of a super-register?
|
2008-08-14 23:41:38 +00:00
|
|
|
SmallSet<unsigned, 8> Processed;
|
2008-03-05 00:59:57 +00:00
|
|
|
for (const unsigned *SuperRegs = TRI->getSuperRegisters(Reg);
|
2007-04-25 07:30:23 +00:00
|
|
|
unsigned SuperReg = *SuperRegs; ++SuperRegs) {
|
2008-04-16 09:46:40 +00:00
|
|
|
if (Processed.count(SuperReg))
|
|
|
|
continue;
|
|
|
|
MachineInstr *LastRef = PhysRegUse[SuperReg]
|
|
|
|
? PhysRegUse[SuperReg] : PhysRegDef[SuperReg];
|
|
|
|
if (LastRef && LastRef != MI) {
|
2007-04-25 07:30:23 +00:00
|
|
|
// The larger register is previously defined. Now a smaller part is
|
2008-03-19 00:52:20 +00:00
|
|
|
// being re-defined. Treat it as read/mod/write if there are uses
|
|
|
|
// below.
|
2007-04-25 07:30:23 +00:00
|
|
|
// EAX =
|
|
|
|
// AX = EAX<imp-use,kill>, EAX<imp-def>
|
2008-03-19 00:52:20 +00:00
|
|
|
// ...
|
|
|
|
/// = EAX
|
2008-04-16 09:46:40 +00:00
|
|
|
if (hasRegisterUseBelow(SuperReg, MI, MI->getParent())) {
|
2008-03-19 00:52:20 +00:00
|
|
|
MI->addOperand(MachineOperand::CreateReg(SuperReg, false/*IsDef*/,
|
2008-04-16 09:46:40 +00:00
|
|
|
true/*IsImp*/,true/*IsKill*/));
|
2008-03-19 00:52:20 +00:00
|
|
|
MI->addOperand(MachineOperand::CreateReg(SuperReg, true/*IsDef*/,
|
|
|
|
true/*IsImp*/));
|
2008-04-16 09:46:40 +00:00
|
|
|
PhysRegDef[SuperReg] = MI;
|
|
|
|
PhysRegUse[SuperReg] = NULL;
|
|
|
|
Processed.insert(SuperReg);
|
|
|
|
for (const unsigned *SS = TRI->getSubRegisters(SuperReg); *SS; ++SS) {
|
|
|
|
PhysRegDef[*SS] = MI;
|
|
|
|
PhysRegUse[*SS] = NULL;
|
|
|
|
Processed.insert(*SS);
|
|
|
|
}
|
2008-03-19 00:52:20 +00:00
|
|
|
} else {
|
2008-04-16 09:46:40 +00:00
|
|
|
// Otherwise, the super register is killed.
|
2009-01-20 21:25:12 +00:00
|
|
|
if (HandlePhysRegKill(SuperReg, MI)) {
|
2008-04-16 09:46:40 +00:00
|
|
|
PhysRegDef[SuperReg] = NULL;
|
|
|
|
PhysRegUse[SuperReg] = NULL;
|
|
|
|
for (const unsigned *SS = TRI->getSubRegisters(SuperReg); *SS; ++SS) {
|
|
|
|
PhysRegDef[*SS] = NULL;
|
|
|
|
PhysRegUse[*SS] = NULL;
|
|
|
|
Processed.insert(*SS);
|
|
|
|
}
|
|
|
|
}
|
2008-03-19 00:52:20 +00:00
|
|
|
}
|
2007-04-25 07:30:23 +00:00
|
|
|
}
|
2007-06-26 21:03:35 +00:00
|
|
|
}
|
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
// Remember this def.
|
|
|
|
PhysRegDef[Reg] = MI;
|
|
|
|
PhysRegUse[Reg] = NULL;
|
2008-03-05 00:59:57 +00:00
|
|
|
for (const unsigned *SubRegs = TRI->getSubRegisters(Reg);
|
2007-06-26 21:03:35 +00:00
|
|
|
unsigned SubReg = *SubRegs; ++SubRegs) {
|
2008-04-16 09:46:40 +00:00
|
|
|
PhysRegDef[SubReg] = MI;
|
|
|
|
PhysRegUse[SubReg] = NULL;
|
2007-06-26 21:03:35 +00:00
|
|
|
}
|
2004-01-13 06:24:30 +00:00
|
|
|
}
|
2003-01-13 20:01:16 +00:00
|
|
|
}
|
|
|
|
|
2007-03-17 09:29:54 +00:00
|
|
|
bool LiveVariables::runOnMachineFunction(MachineFunction &mf) {
|
|
|
|
MF = &mf;
|
2008-04-02 18:04:08 +00:00
|
|
|
MRI = &mf.getRegInfo();
|
2008-03-05 00:59:57 +00:00
|
|
|
TRI = MF->getTarget().getRegisterInfo();
|
2004-02-09 01:35:21 +00:00
|
|
|
|
2008-03-05 00:59:57 +00:00
|
|
|
ReservedRegisters = TRI->getReservedRegs(mf);
|
2003-05-07 20:08:36 +00:00
|
|
|
|
2008-03-05 00:59:57 +00:00
|
|
|
unsigned NumRegs = TRI->getNumRegs();
|
2008-04-16 09:46:40 +00:00
|
|
|
PhysRegDef = new MachineInstr*[NumRegs];
|
|
|
|
PhysRegUse = new MachineInstr*[NumRegs];
|
2007-04-25 19:34:00 +00:00
|
|
|
PHIVarInfo = new SmallVector<unsigned, 4>[MF->getNumBlockIDs()];
|
2008-04-16 09:46:40 +00:00
|
|
|
std::fill(PhysRegDef, PhysRegDef + NumRegs, (MachineInstr*)0);
|
|
|
|
std::fill(PhysRegUse, PhysRegUse + NumRegs, (MachineInstr*)0);
|
2003-01-13 20:01:16 +00:00
|
|
|
|
2008-02-20 09:15:16 +00:00
|
|
|
/// Get some space for a respectable number of registers.
|
2003-01-13 20:01:16 +00:00
|
|
|
VirtRegInfo.resize(64);
|
2005-04-09 15:23:25 +00:00
|
|
|
|
2007-03-17 09:29:54 +00:00
|
|
|
analyzePHINodes(mf);
|
2006-10-03 07:20:20 +00:00
|
|
|
|
2003-01-13 20:01:16 +00:00
|
|
|
// Calculate live variable information in depth first order on the CFG of the
|
|
|
|
// function. This guarantees that we will see the definition of a virtual
|
|
|
|
// register before its uses due to dominance properties of SSA (except for PHI
|
|
|
|
// nodes, which are treated as a special case).
|
2007-03-17 09:29:54 +00:00
|
|
|
MachineBasicBlock *Entry = MF->begin();
|
2007-06-27 05:23:00 +00:00
|
|
|
SmallPtrSet<MachineBasicBlock*,16> Visited;
|
2008-02-20 09:15:16 +00:00
|
|
|
|
2007-06-27 05:23:00 +00:00
|
|
|
for (df_ext_iterator<MachineBasicBlock*, SmallPtrSet<MachineBasicBlock*,16> >
|
|
|
|
DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
|
|
|
|
DFI != E; ++DFI) {
|
2004-05-01 21:24:24 +00:00
|
|
|
MachineBasicBlock *MBB = *DFI;
|
2003-01-13 20:01:16 +00:00
|
|
|
|
2007-02-19 21:49:54 +00:00
|
|
|
// Mark live-in registers as live-in.
|
|
|
|
for (MachineBasicBlock::const_livein_iterator II = MBB->livein_begin(),
|
2007-02-13 01:30:55 +00:00
|
|
|
EE = MBB->livein_end(); II != EE; ++II) {
|
2008-02-10 18:45:23 +00:00
|
|
|
assert(TargetRegisterInfo::isPhysicalRegister(*II) &&
|
2007-02-13 01:30:55 +00:00
|
|
|
"Cannot have a live-in virtual register!");
|
|
|
|
HandlePhysRegDef(*II, 0);
|
|
|
|
}
|
|
|
|
|
2003-01-13 20:01:16 +00:00
|
|
|
// Loop over all of the instructions, processing them.
|
2008-04-02 18:04:08 +00:00
|
|
|
DistanceMap.clear();
|
|
|
|
unsigned Dist = 0;
|
2003-01-13 20:01:16 +00:00
|
|
|
for (MachineBasicBlock::iterator I = MBB->begin(), E = MBB->end();
|
2004-06-24 21:31:16 +00:00
|
|
|
I != E; ++I) {
|
2004-02-12 02:27:10 +00:00
|
|
|
MachineInstr *MI = I;
|
2008-04-02 18:04:08 +00:00
|
|
|
DistanceMap.insert(std::make_pair(MI, Dist++));
|
2003-01-13 20:01:16 +00:00
|
|
|
|
|
|
|
// Process all of the operands of the instruction...
|
|
|
|
unsigned NumOperandsToProcess = MI->getNumOperands();
|
|
|
|
|
|
|
|
// Unless it is a PHI node. In this case, ONLY process the DEF, not any
|
|
|
|
// of the uses. They will be handled in other basic blocks.
|
2005-04-21 22:36:52 +00:00
|
|
|
if (MI->getOpcode() == TargetInstrInfo::PHI)
|
2004-06-24 21:31:16 +00:00
|
|
|
NumOperandsToProcess = 1;
|
2003-01-13 20:01:16 +00:00
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
SmallVector<unsigned, 4> UseRegs;
|
|
|
|
SmallVector<unsigned, 4> DefRegs;
|
2003-01-13 20:01:16 +00:00
|
|
|
for (unsigned i = 0; i != NumOperandsToProcess; ++i) {
|
2008-02-20 06:10:21 +00:00
|
|
|
const MachineOperand &MO = MI->getOperand(i);
|
2009-01-20 21:25:12 +00:00
|
|
|
if (!MO.isReg() || MO.getReg() == 0)
|
|
|
|
continue;
|
|
|
|
unsigned MOReg = MO.getReg();
|
|
|
|
if (MO.isUse())
|
|
|
|
UseRegs.push_back(MOReg);
|
|
|
|
if (MO.isDef())
|
|
|
|
DefRegs.push_back(MOReg);
|
2003-01-13 20:01:16 +00:00
|
|
|
}
|
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
// Process all uses.
|
|
|
|
for (unsigned i = 0, e = UseRegs.size(); i != e; ++i) {
|
|
|
|
unsigned MOReg = UseRegs[i];
|
|
|
|
if (TargetRegisterInfo::isVirtualRegister(MOReg))
|
|
|
|
HandleVirtRegUse(MOReg, MBB, MI);
|
2008-09-21 21:11:41 +00:00
|
|
|
else if (!ReservedRegisters[MOReg])
|
2008-04-16 09:46:40 +00:00
|
|
|
HandlePhysRegUse(MOReg, MI);
|
|
|
|
}
|
2008-02-20 06:10:21 +00:00
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
// Process all defs.
|
|
|
|
for (unsigned i = 0, e = DefRegs.size(); i != e; ++i) {
|
|
|
|
unsigned MOReg = DefRegs[i];
|
2008-09-21 21:11:41 +00:00
|
|
|
if (TargetRegisterInfo::isVirtualRegister(MOReg))
|
|
|
|
HandleVirtRegDef(MOReg, MI);
|
|
|
|
else if (!ReservedRegisters[MOReg])
|
2008-04-16 09:46:40 +00:00
|
|
|
HandlePhysRegDef(MOReg, MI);
|
2003-01-13 20:01:16 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Handle any virtual assignments from PHI nodes which might be at the
|
|
|
|
// bottom of this basic block. We check all of our successor blocks to see
|
|
|
|
// if they have PHI nodes, and if so, we simulate an assignment at the end
|
|
|
|
// of the current block.
|
2007-04-25 19:34:00 +00:00
|
|
|
if (!PHIVarInfo[MBB->getNumber()].empty()) {
|
|
|
|
SmallVector<unsigned, 4>& VarInfoVec = PHIVarInfo[MBB->getNumber()];
|
2006-05-04 01:26:39 +00:00
|
|
|
|
2007-04-25 19:34:00 +00:00
|
|
|
for (SmallVector<unsigned, 4>::iterator I = VarInfoVec.begin(),
|
2008-02-20 07:36:31 +00:00
|
|
|
E = VarInfoVec.end(); I != E; ++I)
|
|
|
|
// Mark it alive only in the block we are representing.
|
2008-04-02 18:04:08 +00:00
|
|
|
MarkVirtRegAliveInBlock(getVarInfo(*I),MRI->getVRegDef(*I)->getParent(),
|
2008-01-15 22:58:11 +00:00
|
|
|
MBB);
|
2003-01-13 20:01:16 +00:00
|
|
|
}
|
2005-04-21 22:36:52 +00:00
|
|
|
|
2008-02-20 09:15:16 +00:00
|
|
|
// Finally, if the last instruction in the block is a return, make sure to
|
|
|
|
// mark it as using all of the live-out values in the function.
|
2008-01-07 07:27:27 +00:00
|
|
|
if (!MBB->empty() && MBB->back().getDesc().isReturn()) {
|
2005-04-09 15:23:25 +00:00
|
|
|
MachineInstr *Ret = &MBB->back();
|
2008-02-20 07:36:31 +00:00
|
|
|
|
2007-12-31 04:13:23 +00:00
|
|
|
for (MachineRegisterInfo::liveout_iterator
|
|
|
|
I = MF->getRegInfo().liveout_begin(),
|
|
|
|
E = MF->getRegInfo().liveout_end(); I != E; ++I) {
|
2008-02-10 18:45:23 +00:00
|
|
|
assert(TargetRegisterInfo::isPhysicalRegister(*I) &&
|
2008-06-25 22:14:43 +00:00
|
|
|
"Cannot have a live-out virtual register!");
|
2005-04-09 15:23:25 +00:00
|
|
|
HandlePhysRegUse(*I, Ret);
|
2008-02-20 07:36:31 +00:00
|
|
|
|
2006-11-15 20:51:59 +00:00
|
|
|
// Add live-out registers as implicit uses.
|
2008-03-05 00:59:57 +00:00
|
|
|
if (!Ret->readsRegister(*I))
|
2007-12-30 00:41:17 +00:00
|
|
|
Ret->addOperand(MachineOperand::CreateReg(*I, false, true));
|
2005-04-09 15:23:25 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
// Loop over PhysRegDef / PhysRegUse, killing any registers that are
|
|
|
|
// available at the end of the basic block.
|
2007-04-25 19:34:00 +00:00
|
|
|
for (unsigned i = 0; i != NumRegs; ++i)
|
2008-04-16 09:46:40 +00:00
|
|
|
if (PhysRegDef[i] || PhysRegUse[i])
|
2004-06-24 21:31:16 +00:00
|
|
|
HandlePhysRegDef(i, 0);
|
2007-04-25 07:30:23 +00:00
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
std::fill(PhysRegDef, PhysRegDef + NumRegs, (MachineInstr*)0);
|
|
|
|
std::fill(PhysRegUse, PhysRegUse + NumRegs, (MachineInstr*)0);
|
2003-01-13 20:01:16 +00:00
|
|
|
}
|
|
|
|
|
2006-11-15 20:51:59 +00:00
|
|
|
// Convert and transfer the dead / killed information we have gathered into
|
|
|
|
// VirtRegInfo onto MI's.
|
2007-03-09 06:02:17 +00:00
|
|
|
for (unsigned i = 0, e1 = VirtRegInfo.size(); i != e1; ++i)
|
2008-02-20 07:36:31 +00:00
|
|
|
for (unsigned j = 0, e2 = VirtRegInfo[i].Kills.size(); j != e2; ++j)
|
|
|
|
if (VirtRegInfo[i].Kills[j] ==
|
2008-04-02 18:04:08 +00:00
|
|
|
MRI->getVRegDef(i + TargetRegisterInfo::FirstVirtualRegister))
|
2008-02-20 07:36:31 +00:00
|
|
|
VirtRegInfo[i]
|
|
|
|
.Kills[j]->addRegisterDead(i +
|
|
|
|
TargetRegisterInfo::FirstVirtualRegister,
|
2008-03-05 00:59:57 +00:00
|
|
|
TRI);
|
2003-01-13 20:01:16 +00:00
|
|
|
else
|
2008-02-20 07:36:31 +00:00
|
|
|
VirtRegInfo[i]
|
|
|
|
.Kills[j]->addRegisterKilled(i +
|
|
|
|
TargetRegisterInfo::FirstVirtualRegister,
|
2008-03-05 00:59:57 +00:00
|
|
|
TRI);
|
2004-07-01 04:24:29 +00:00
|
|
|
|
2004-07-09 16:44:37 +00:00
|
|
|
// Check to make sure there are no unreachable blocks in the MC CFG for the
|
|
|
|
// function. If so, it is due to a bug in the instruction selector or some
|
|
|
|
// other part of the code generator if this happens.
|
|
|
|
#ifndef NDEBUG
|
2007-03-17 09:29:54 +00:00
|
|
|
for(MachineFunction::iterator i = MF->begin(), e = MF->end(); i != e; ++i)
|
2004-07-09 16:44:37 +00:00
|
|
|
assert(Visited.count(&*i) != 0 && "unreachable basic block found");
|
|
|
|
#endif
|
|
|
|
|
2008-04-16 09:46:40 +00:00
|
|
|
delete[] PhysRegDef;
|
|
|
|
delete[] PhysRegUse;
|
2007-04-25 19:34:00 +00:00
|
|
|
delete[] PHIVarInfo;
|
|
|
|
|
2003-01-13 20:01:16 +00:00
|
|
|
return false;
|
|
|
|
}
|
2004-02-19 18:28:02 +00:00
|
|
|
|
2008-07-03 00:07:19 +00:00
|
|
|
/// replaceKillInstruction - Update register kill info by replacing a kill
|
|
|
|
/// instruction with a new one.
|
|
|
|
void LiveVariables::replaceKillInstruction(unsigned Reg, MachineInstr *OldMI,
|
|
|
|
MachineInstr *NewMI) {
|
|
|
|
VarInfo &VI = getVarInfo(Reg);
|
2008-07-03 00:28:27 +00:00
|
|
|
std::replace(VI.Kills.begin(), VI.Kills.end(), OldMI, NewMI);
|
2008-07-03 00:07:19 +00:00
|
|
|
}
|
|
|
|
|
2006-09-03 00:05:09 +00:00
|
|
|
/// removeVirtualRegistersKilled - Remove all killed info for the specified
|
|
|
|
/// instruction.
|
|
|
|
void LiveVariables::removeVirtualRegistersKilled(MachineInstr *MI) {
|
2006-11-15 20:51:59 +00:00
|
|
|
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()) {
|
2007-12-30 21:56:09 +00:00
|
|
|
MO.setIsKill(false);
|
2006-11-15 20:51:59 +00:00
|
|
|
unsigned Reg = MO.getReg();
|
2008-02-10 18:45:23 +00:00
|
|
|
if (TargetRegisterInfo::isVirtualRegister(Reg)) {
|
2006-11-15 20:51:59 +00:00
|
|
|
bool removed = getVarInfo(Reg).removeKill(MI);
|
|
|
|
assert(removed && "kill not in register's VarInfo?");
|
2008-11-21 20:00:59 +00:00
|
|
|
removed = true;
|
2006-11-15 20:51:59 +00:00
|
|
|
}
|
2006-09-03 00:05:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-10-03 07:20:20 +00:00
|
|
|
/// analyzePHINodes - Gather information about the PHI nodes in here. In
|
2008-02-20 09:15:16 +00:00
|
|
|
/// 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.
|
2006-10-03 07:20:20 +00:00
|
|
|
///
|
|
|
|
void LiveVariables::analyzePHINodes(const MachineFunction& Fn) {
|
|
|
|
for (MachineFunction::const_iterator I = Fn.begin(), E = Fn.end();
|
|
|
|
I != E; ++I)
|
|
|
|
for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end();
|
|
|
|
BBI != BBE && BBI->getOpcode() == TargetInstrInfo::PHI; ++BBI)
|
|
|
|
for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2)
|
2008-02-20 06:10:21 +00:00
|
|
|
PHIVarInfo[BBI->getOperand(i + 1).getMBB()->getNumber()]
|
|
|
|
.push_back(BBI->getOperand(i).getReg());
|
2006-10-03 07:20:20 +00:00
|
|
|
}
|