2004-07-23 17:56:30 +00:00
|
|
|
//===-- LiveIntervalAnalysis.cpp - Live Interval Analysis -----------------===//
|
2003-11-20 03:32:25 +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.
|
2003-11-20 03:32:25 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the LiveInterval analysis pass which is used
|
|
|
|
// by the Linear Scan Register allocator. This pass linearizes the
|
|
|
|
// basic blocks of the function in DFS order and uses the
|
|
|
|
// LiveVariables pass to conservatively compute live intervals for
|
|
|
|
// each virtual and physical register.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2012-01-07 07:39:47 +00:00
|
|
|
#define DEBUG_TYPE "regalloc"
|
2005-09-21 04:19:09 +00:00
|
|
|
#include "llvm/CodeGen/LiveIntervalAnalysis.h"
|
2004-05-01 21:24:39 +00:00
|
|
|
#include "llvm/Value.h"
|
2008-07-25 00:02:30 +00:00
|
|
|
#include "llvm/Analysis/AliasAnalysis.h"
|
2003-11-20 03:32:25 +00:00
|
|
|
#include "llvm/CodeGen/LiveVariables.h"
|
2012-06-05 22:02:15 +00:00
|
|
|
#include "llvm/CodeGen/MachineDominators.h"
|
2003-11-20 03:32:25 +00:00
|
|
|
#include "llvm/CodeGen/MachineInstr.h"
|
2007-12-31 04:13:23 +00:00
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2003-11-20 03:32:25 +00:00
|
|
|
#include "llvm/CodeGen/Passes.h"
|
2008-02-10 18:45:23 +00:00
|
|
|
#include "llvm/Target/TargetRegisterInfo.h"
|
2003-11-20 03:32:25 +00:00
|
|
|
#include "llvm/Target/TargetInstrInfo.h"
|
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
|
|
|
#include "llvm/Support/Debug.h"
|
2009-07-11 13:10:19 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2012-02-13 20:44:42 +00:00
|
|
|
#include "llvm/ADT/DenseSet.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2012-06-05 22:02:15 +00:00
|
|
|
#include "LiveRangeCalc.h"
|
2004-09-03 18:19:51 +00:00
|
|
|
#include <algorithm>
|
2009-06-02 16:53:25 +00:00
|
|
|
#include <limits>
|
2006-12-02 02:22:01 +00:00
|
|
|
#include <cmath>
|
2003-11-20 03:32:25 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2012-06-05 22:02:15 +00:00
|
|
|
// Temporary option to enable regunit liveness.
|
|
|
|
static cl::opt<bool> LiveRegUnits("live-regunits", cl::Hidden);
|
|
|
|
|
2009-09-14 21:33:42 +00:00
|
|
|
STATISTIC(numIntervals , "Number of original intervals");
|
2006-12-19 22:41:21 +00:00
|
|
|
|
2007-05-03 01:11:54 +00:00
|
|
|
char LiveIntervals::ID = 0;
|
2010-10-12 19:48:12 +00:00
|
|
|
INITIALIZE_PASS_BEGIN(LiveIntervals, "liveintervals",
|
|
|
|
"Live Interval Analysis", false, false)
|
2012-02-10 04:10:36 +00:00
|
|
|
INITIALIZE_AG_DEPENDENCY(AliasAnalysis)
|
2010-10-12 19:48:12 +00:00
|
|
|
INITIALIZE_PASS_DEPENDENCY(LiveVariables)
|
2012-02-10 04:10:36 +00:00
|
|
|
INITIALIZE_PASS_DEPENDENCY(MachineDominatorTree)
|
2010-10-12 19:48:12 +00:00
|
|
|
INITIALIZE_PASS_DEPENDENCY(SlotIndexes)
|
|
|
|
INITIALIZE_PASS_END(LiveIntervals, "liveintervals",
|
2010-10-07 22:25:06 +00:00
|
|
|
"Live Interval Analysis", false, false)
|
2003-11-20 03:32:25 +00:00
|
|
|
|
2006-08-24 22:43:55 +00:00
|
|
|
void LiveIntervals::getAnalysisUsage(AnalysisUsage &AU) const {
|
2009-07-31 23:37:33 +00:00
|
|
|
AU.setPreservesCFG();
|
2008-07-25 00:02:30 +00:00
|
|
|
AU.addRequired<AliasAnalysis>();
|
|
|
|
AU.addPreserved<AliasAnalysis>();
|
2004-08-04 09:46:26 +00:00
|
|
|
AU.addRequired<LiveVariables>();
|
2010-08-17 21:00:37 +00:00
|
|
|
AU.addPreserved<LiveVariables>();
|
2012-02-13 20:44:42 +00:00
|
|
|
AU.addPreservedID(MachineLoopInfoID);
|
2012-06-05 22:02:15 +00:00
|
|
|
if (LiveRegUnits)
|
|
|
|
AU.addRequiredTransitiveID(MachineDominatorsID);
|
2008-01-04 20:54:55 +00:00
|
|
|
AU.addPreservedID(MachineDominatorsID);
|
2009-11-03 23:52:08 +00:00
|
|
|
AU.addPreserved<SlotIndexes>();
|
|
|
|
AU.addRequiredTransitive<SlotIndexes>();
|
2004-08-04 09:46:26 +00:00
|
|
|
MachineFunctionPass::getAnalysisUsage(AU);
|
2003-11-20 03:32:25 +00:00
|
|
|
}
|
|
|
|
|
2012-06-05 22:02:15 +00:00
|
|
|
LiveIntervals::LiveIntervals() : MachineFunctionPass(ID),
|
|
|
|
DomTree(0), LRCalc(0) {
|
|
|
|
initializeLiveIntervalsPass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
|
|
|
|
|
|
|
LiveIntervals::~LiveIntervals() {
|
|
|
|
delete LRCalc;
|
|
|
|
}
|
|
|
|
|
2006-08-24 22:43:55 +00:00
|
|
|
void LiveIntervals::releaseMemory() {
|
2008-08-13 21:49:13 +00:00
|
|
|
// Free the live intervals themselves.
|
2012-06-04 22:39:14 +00:00
|
|
|
for (DenseMap<unsigned, LiveInterval*>::iterator I = R2IMap.begin(),
|
|
|
|
E = R2IMap.end(); I != E; ++I)
|
2008-08-13 21:49:13 +00:00
|
|
|
delete I->second;
|
2010-08-12 20:01:23 +00:00
|
|
|
|
2012-06-04 22:39:14 +00:00
|
|
|
R2IMap.clear();
|
2012-02-08 17:33:45 +00:00
|
|
|
RegMaskSlots.clear();
|
|
|
|
RegMaskBits.clear();
|
2012-02-10 01:26:29 +00:00
|
|
|
RegMaskBlocks.clear();
|
2009-07-09 03:57:02 +00:00
|
|
|
|
2012-06-05 22:02:15 +00:00
|
|
|
for (unsigned i = 0, e = RegUnitIntervals.size(); i != e; ++i)
|
|
|
|
delete RegUnitIntervals[i];
|
|
|
|
RegUnitIntervals.clear();
|
|
|
|
|
2010-06-26 11:30:59 +00:00
|
|
|
// Release VNInfo memory regions, VNInfo objects don't need to be dtor'd.
|
|
|
|
VNInfoAllocator.Reset();
|
2006-05-11 07:29:24 +00:00
|
|
|
}
|
|
|
|
|
2008-05-28 20:54:50 +00:00
|
|
|
/// runOnMachineFunction - Register allocate the whole function
|
|
|
|
///
|
|
|
|
bool LiveIntervals::runOnMachineFunction(MachineFunction &fn) {
|
2012-06-04 22:39:14 +00:00
|
|
|
MF = &fn;
|
|
|
|
MRI = &MF->getRegInfo();
|
|
|
|
TM = &fn.getTarget();
|
|
|
|
TRI = TM->getRegisterInfo();
|
|
|
|
TII = TM->getInstrInfo();
|
|
|
|
AA = &getAnalysis<AliasAnalysis>();
|
|
|
|
LV = &getAnalysis<LiveVariables>();
|
|
|
|
Indexes = &getAnalysis<SlotIndexes>();
|
2012-06-05 22:02:15 +00:00
|
|
|
if (LiveRegUnits)
|
|
|
|
DomTree = &getAnalysis<MachineDominatorTree>();
|
|
|
|
if (LiveRegUnits && !LRCalc)
|
|
|
|
LRCalc = new LiveRangeCalc();
|
2012-06-04 22:39:14 +00:00
|
|
|
AllocatableRegs = TRI->getAllocatableSet(fn);
|
|
|
|
ReservedRegs = TRI->getReservedRegs(fn);
|
2003-11-20 03:32:25 +00:00
|
|
|
|
2004-08-04 09:46:26 +00:00
|
|
|
computeIntervals();
|
2003-11-20 03:32:25 +00:00
|
|
|
|
2004-08-04 09:46:26 +00:00
|
|
|
numIntervals += getNumIntervals();
|
2004-02-15 10:24:21 +00:00
|
|
|
|
2012-06-05 22:02:15 +00:00
|
|
|
if (LiveRegUnits) {
|
|
|
|
computeLiveInRegUnits();
|
|
|
|
}
|
|
|
|
|
2004-09-30 15:59:17 +00:00
|
|
|
DEBUG(dump());
|
2004-08-04 09:46:26 +00:00
|
|
|
return true;
|
2003-11-20 03:32:25 +00:00
|
|
|
}
|
|
|
|
|
2004-09-30 15:59:17 +00:00
|
|
|
/// print - Implement the dump method.
|
2009-08-23 06:03:38 +00:00
|
|
|
void LiveIntervals::print(raw_ostream &OS, const Module* ) const {
|
2009-08-23 03:41:05 +00:00
|
|
|
OS << "********** INTERVALS **********\n";
|
2012-02-14 23:46:21 +00:00
|
|
|
|
|
|
|
// Dump the physregs.
|
2012-06-04 22:39:14 +00:00
|
|
|
for (unsigned Reg = 1, RegE = TRI->getNumRegs(); Reg != RegE; ++Reg)
|
2012-06-05 22:51:54 +00:00
|
|
|
if (const LiveInterval *LI = R2IMap.lookup(Reg))
|
|
|
|
OS << PrintReg(Reg, TRI) << '\t' << *LI << '\n';
|
2012-02-14 23:46:21 +00:00
|
|
|
|
2012-06-05 22:02:15 +00:00
|
|
|
// Dump the regunits.
|
|
|
|
for (unsigned i = 0, e = RegUnitIntervals.size(); i != e; ++i)
|
|
|
|
if (LiveInterval *LI = RegUnitIntervals[i])
|
|
|
|
OS << PrintRegUnit(i, TRI) << " = " << *LI << '\n';
|
|
|
|
|
2012-02-14 23:46:21 +00:00
|
|
|
// Dump the virtregs.
|
2012-06-04 22:39:14 +00:00
|
|
|
for (unsigned Reg = 0, RegE = MRI->getNumVirtRegs(); Reg != RegE; ++Reg)
|
2012-02-14 23:46:21 +00:00
|
|
|
if (const LiveInterval *LI =
|
2012-06-05 22:51:54 +00:00
|
|
|
R2IMap.lookup(TargetRegisterInfo::index2VirtReg(Reg)))
|
|
|
|
OS << PrintReg(LI->reg) << '\t' << *LI << '\n';
|
2004-09-30 15:59:17 +00:00
|
|
|
|
2009-09-14 21:33:42 +00:00
|
|
|
printInstrs(OS);
|
|
|
|
}
|
|
|
|
|
|
|
|
void LiveIntervals::printInstrs(raw_ostream &OS) const {
|
2009-08-23 03:41:05 +00:00
|
|
|
OS << "********** MACHINEINSTRS **********\n";
|
2012-06-04 22:39:14 +00:00
|
|
|
MF->print(OS, Indexes);
|
2004-09-30 15:59:17 +00:00
|
|
|
}
|
|
|
|
|
2009-09-14 21:33:42 +00:00
|
|
|
void LiveIntervals::dumpInstrs() const {
|
2010-01-04 22:49:02 +00:00
|
|
|
printInstrs(dbgs());
|
2009-09-14 21:33:42 +00:00
|
|
|
}
|
|
|
|
|
2010-05-04 20:26:52 +00:00
|
|
|
static
|
2010-05-05 18:27:40 +00:00
|
|
|
bool MultipleDefsBySameMI(const MachineInstr &MI, unsigned MOIdx) {
|
2010-05-04 20:26:52 +00:00
|
|
|
unsigned Reg = MI.getOperand(MOIdx).getReg();
|
|
|
|
for (unsigned i = MOIdx+1, e = MI.getNumOperands(); i < e; ++i) {
|
|
|
|
const MachineOperand &MO = MI.getOperand(i);
|
|
|
|
if (!MO.isReg())
|
|
|
|
continue;
|
|
|
|
if (MO.getReg() == Reg && MO.isDef()) {
|
|
|
|
assert(MI.getOperand(MOIdx).getSubReg() != MO.getSubReg() &&
|
|
|
|
MI.getOperand(MOIdx).getSubReg() &&
|
2010-07-06 23:26:25 +00:00
|
|
|
(MO.getSubReg() || MO.isImplicit()));
|
2010-05-04 20:26:52 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-05-05 18:27:40 +00:00
|
|
|
/// isPartialRedef - Return true if the specified def at the specific index is
|
|
|
|
/// partially re-defining the specified live interval. A common case of this is
|
2010-08-12 20:01:23 +00:00
|
|
|
/// a definition of the sub-register.
|
2010-05-05 18:27:40 +00:00
|
|
|
bool LiveIntervals::isPartialRedef(SlotIndex MIIdx, MachineOperand &MO,
|
|
|
|
LiveInterval &interval) {
|
|
|
|
if (!MO.getSubReg() || MO.isEarlyClobber())
|
|
|
|
return false;
|
|
|
|
|
2011-11-13 20:45:27 +00:00
|
|
|
SlotIndex RedefIndex = MIIdx.getRegSlot();
|
2010-05-05 18:27:40 +00:00
|
|
|
const LiveRange *OldLR =
|
2011-11-13 20:45:27 +00:00
|
|
|
interval.getLiveRangeContaining(RedefIndex.getRegSlot(true));
|
2010-09-25 12:04:16 +00:00
|
|
|
MachineInstr *DefMI = getInstructionFromIndex(OldLR->valno->def);
|
|
|
|
if (DefMI != 0) {
|
2010-05-05 18:27:40 +00:00
|
|
|
return DefMI->findRegisterDefOperandIdx(interval.reg) != -1;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2006-08-22 18:19:46 +00:00
|
|
|
void LiveIntervals::handleVirtualRegisterDef(MachineBasicBlock *mbb,
|
2003-11-20 03:32:25 +00:00
|
|
|
MachineBasicBlock::iterator mi,
|
2009-11-03 23:52:08 +00:00
|
|
|
SlotIndex MIIdx,
|
2009-09-04 20:41:11 +00:00
|
|
|
MachineOperand& MO,
|
2008-07-10 07:35:43 +00:00
|
|
|
unsigned MOIdx,
|
2006-08-22 18:19:46 +00:00
|
|
|
LiveInterval &interval) {
|
2012-06-04 22:39:14 +00:00
|
|
|
DEBUG(dbgs() << "\t\tregister: " << PrintReg(interval.reg, TRI));
|
2008-04-03 16:39:43 +00:00
|
|
|
|
2004-08-04 09:46:56 +00:00
|
|
|
// Virtual registers may be defined multiple times (due to phi
|
|
|
|
// elimination and 2-addr elimination). Much of what we do only has to be
|
|
|
|
// done once for the vreg. We use an empty interval to detect the first
|
2004-08-04 09:46:26 +00:00
|
|
|
// time we see a vreg.
|
2012-06-04 22:39:14 +00:00
|
|
|
LiveVariables::VarInfo& vi = LV->getVarInfo(interval.reg);
|
2004-08-04 09:46:26 +00:00
|
|
|
if (interval.empty()) {
|
|
|
|
// Get the Idx of the defining instructions.
|
2011-11-13 22:05:42 +00:00
|
|
|
SlotIndex defIndex = MIIdx.getRegSlot(MO.isEarlyClobber());
|
2010-05-21 16:32:16 +00:00
|
|
|
|
2012-03-04 19:19:10 +00:00
|
|
|
// Make sure the first definition is not a partial redefinition.
|
|
|
|
assert(!MO.readsReg() && "First def cannot also read virtual register "
|
|
|
|
"missing <undef> flag?");
|
2010-05-21 16:32:16 +00:00
|
|
|
|
2012-02-04 05:20:49 +00:00
|
|
|
VNInfo *ValNo = interval.getNextValue(defIndex, VNInfoAllocator);
|
2007-08-29 20:45:00 +00:00
|
|
|
assert(ValNo->id == 0 && "First value in interval is not 0?");
|
2004-08-04 09:46:26 +00:00
|
|
|
|
|
|
|
// Loop over all of the blocks that the vreg is defined in. There are
|
|
|
|
// two cases we have to handle here. The most common case is a vreg
|
|
|
|
// whose lifetime is contained within a basic block. In this case there
|
|
|
|
// will be a single kill, in MBB, which comes after the definition.
|
|
|
|
if (vi.Kills.size() == 1 && vi.Kills[0]->getParent() == mbb) {
|
|
|
|
// FIXME: what about dead vars?
|
2009-11-03 23:52:08 +00:00
|
|
|
SlotIndex killIdx;
|
2004-08-04 09:46:26 +00:00
|
|
|
if (vi.Kills[0] != mi)
|
2011-11-13 20:45:27 +00:00
|
|
|
killIdx = getInstructionIndex(vi.Kills[0]).getRegSlot();
|
2004-08-04 09:46:26 +00:00
|
|
|
else
|
2011-11-13 20:45:27 +00:00
|
|
|
killIdx = defIndex.getDeadSlot();
|
2004-08-04 09:46:26 +00:00
|
|
|
|
|
|
|
// If the kill happens after the definition, we have an intra-block
|
|
|
|
// live range.
|
|
|
|
if (killIdx > defIndex) {
|
2009-05-26 18:27:15 +00:00
|
|
|
assert(vi.AliveBlocks.empty() &&
|
2004-08-04 09:46:26 +00:00
|
|
|
"Shouldn't be alive across any blocks!");
|
2007-08-29 20:45:00 +00:00
|
|
|
LiveRange LR(defIndex, killIdx, ValNo);
|
2004-08-04 09:46:26 +00:00
|
|
|
interval.addRange(LR);
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << " +" << LR << "\n");
|
2004-08-04 09:46:26 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2004-07-19 02:15:56 +00:00
|
|
|
|
2004-08-04 09:46:26 +00:00
|
|
|
// The other case we handle is when a virtual register lives to the end
|
|
|
|
// of the defining block, potentially live across some blocks, then is
|
|
|
|
// live into some number of blocks, but gets killed. Start by adding a
|
|
|
|
// range that goes from this definition to the end of the defining block.
|
2009-12-22 00:11:50 +00:00
|
|
|
LiveRange NewLR(defIndex, getMBBEndIdx(mbb), ValNo);
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << " +" << NewLR);
|
2004-08-04 09:46:26 +00:00
|
|
|
interval.addRange(NewLR);
|
|
|
|
|
2012-06-04 22:39:14 +00:00
|
|
|
bool PHIJoin = LV->isPHIJoin(interval.reg);
|
2010-02-23 22:43:58 +00:00
|
|
|
|
|
|
|
if (PHIJoin) {
|
|
|
|
// A phi join register is killed at the end of the MBB and revived as a new
|
|
|
|
// valno in the killing blocks.
|
|
|
|
assert(vi.AliveBlocks.empty() && "Phi join can't pass through blocks");
|
|
|
|
DEBUG(dbgs() << " phi-join");
|
|
|
|
ValNo->setHasPHIKill(true);
|
|
|
|
} else {
|
|
|
|
// Iterate over all of the blocks that the variable is completely
|
|
|
|
// live in, adding [insrtIndex(begin), instrIndex(end)+4) to the
|
|
|
|
// live interval.
|
|
|
|
for (SparseBitVector<>::iterator I = vi.AliveBlocks.begin(),
|
|
|
|
E = vi.AliveBlocks.end(); I != E; ++I) {
|
2012-06-04 22:39:14 +00:00
|
|
|
MachineBasicBlock *aliveBlock = MF->getBlockNumbered(*I);
|
2010-02-23 22:43:58 +00:00
|
|
|
LiveRange LR(getMBBStartIdx(aliveBlock), getMBBEndIdx(aliveBlock), ValNo);
|
|
|
|
interval.addRange(LR);
|
|
|
|
DEBUG(dbgs() << " +" << LR);
|
|
|
|
}
|
2004-08-04 09:46:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Finally, this virtual register is live from the start of any killing
|
|
|
|
// block to the 'use' slot of the killing instruction.
|
|
|
|
for (unsigned i = 0, e = vi.Kills.size(); i != e; ++i) {
|
|
|
|
MachineInstr *Kill = vi.Kills[i];
|
2010-02-23 22:43:58 +00:00
|
|
|
SlotIndex Start = getMBBStartIdx(Kill->getParent());
|
2011-11-13 20:45:27 +00:00
|
|
|
SlotIndex killIdx = getInstructionIndex(Kill).getRegSlot();
|
2010-02-23 22:43:58 +00:00
|
|
|
|
|
|
|
// Create interval with one of a NEW value number. Note that this value
|
|
|
|
// number isn't actually defined by an instruction, weird huh? :)
|
|
|
|
if (PHIJoin) {
|
2010-09-25 12:04:16 +00:00
|
|
|
assert(getInstructionFromIndex(Start) == 0 &&
|
|
|
|
"PHI def index points at actual instruction.");
|
2012-02-04 05:20:49 +00:00
|
|
|
ValNo = interval.getNextValue(Start, VNInfoAllocator);
|
2010-02-23 22:43:58 +00:00
|
|
|
ValNo->setIsPHIDef(true);
|
|
|
|
}
|
|
|
|
LiveRange LR(Start, killIdx, ValNo);
|
2004-08-04 09:46:26 +00:00
|
|
|
interval.addRange(LR);
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << " +" << LR);
|
2004-08-04 09:46:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
} else {
|
2010-05-05 18:27:40 +00:00
|
|
|
if (MultipleDefsBySameMI(*mi, MOIdx))
|
2010-05-20 03:30:09 +00:00
|
|
|
// Multiple defs of the same virtual register by the same instruction.
|
|
|
|
// e.g. %reg1031:5<def>, %reg1031:6<def> = VLD1q16 %reg1024<kill>, ...
|
2010-05-04 20:26:52 +00:00
|
|
|
// This is likely due to elimination of REG_SEQUENCE instructions. Return
|
|
|
|
// here since there is nothing to do.
|
|
|
|
return;
|
|
|
|
|
2004-08-04 09:46:26 +00:00
|
|
|
// If this is the second time we see a virtual register definition, it
|
|
|
|
// must be due to phi elimination or two addr elimination. If this is
|
2006-11-03 03:04:46 +00:00
|
|
|
// the result of two address elimination, then the vreg is one of the
|
|
|
|
// def-and-use register operand.
|
2010-05-05 18:27:40 +00:00
|
|
|
|
|
|
|
// It may also be partial redef like this:
|
2010-08-12 20:01:23 +00:00
|
|
|
// 80 %reg1041:6<def> = VSHRNv4i16 %reg1034<kill>, 12, pred:14, pred:%reg0
|
|
|
|
// 120 %reg1041:5<def> = VSHRNv4i16 %reg1039<kill>, 12, pred:14, pred:%reg0
|
2010-05-05 18:27:40 +00:00
|
|
|
bool PartReDef = isPartialRedef(MIIdx, MO, interval);
|
|
|
|
if (PartReDef || mi->isRegTiedToUseOperand(MOIdx)) {
|
2004-08-04 09:46:26 +00:00
|
|
|
// If this is a two-address definition, then we have already processed
|
|
|
|
// the live range. The only problem is that we didn't realize there
|
|
|
|
// are actually two values in the live interval. Because of this we
|
|
|
|
// need to take the LiveRegion that defines this register and split it
|
|
|
|
// into two values.
|
2011-11-13 22:05:42 +00:00
|
|
|
SlotIndex RedefIndex = MIIdx.getRegSlot(MO.isEarlyClobber());
|
2004-08-04 09:46:26 +00:00
|
|
|
|
2009-09-12 03:34:03 +00:00
|
|
|
const LiveRange *OldLR =
|
2011-11-13 20:45:27 +00:00
|
|
|
interval.getLiveRangeContaining(RedefIndex.getRegSlot(true));
|
2007-08-29 20:45:00 +00:00
|
|
|
VNInfo *OldValNo = OldLR->valno;
|
2011-11-13 20:45:27 +00:00
|
|
|
SlotIndex DefIndex = OldValNo->def.getRegSlot();
|
2007-08-11 00:59:19 +00:00
|
|
|
|
Allow a register to be redefined multiple times in a basic block.
LiveVariableAnalysis was a bit picky about a register only being redefined once,
but that really isn't necessary.
Here is an example of chained INSERT_SUBREGs that we can handle now:
68 %reg1040<def> = INSERT_SUBREG %reg1040, %reg1028<kill>, 14
register: %reg1040 +[70,134:0)
76 %reg1040<def> = INSERT_SUBREG %reg1040, %reg1029<kill>, 13
register: %reg1040 replace range with [70,78:1) RESULT: %reg1040,0.000000e+00 = [70,78:1)[78,134:0) 0@78-(134) 1@70-(78)
84 %reg1040<def> = INSERT_SUBREG %reg1040, %reg1030<kill>, 12
register: %reg1040 replace range with [78,86:2) RESULT: %reg1040,0.000000e+00 = [70,78:1)[78,86:2)[86,134:0) 0@86-(134) 1@70-(78) 2@78-(86)
92 %reg1040<def> = INSERT_SUBREG %reg1040, %reg1031<kill>, 11
register: %reg1040 replace range with [86,94:3) RESULT: %reg1040,0.000000e+00 = [70,78:1)[78,86:2)[86,94:3)[94,134:0) 0@94-(134) 1@70-(78) 2@78-(86) 3@86-(94)
rdar://problem/8096390
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@106152 91177308-0d34-0410-b5e6-96231b3b80d8
2010-06-16 21:29:40 +00:00
|
|
|
// Delete the previous value, which should be short and continuous,
|
2006-08-22 18:19:46 +00:00
|
|
|
// because the 2-addr copy must be in the same MBB as the redef.
|
2004-08-04 09:46:26 +00:00
|
|
|
interval.removeRange(DefIndex, RedefIndex);
|
2004-08-04 09:46:56 +00:00
|
|
|
|
2006-08-31 05:54:43 +00:00
|
|
|
// The new value number (#1) is defined by the instruction we claimed
|
|
|
|
// defined value #0.
|
2010-09-25 12:04:16 +00:00
|
|
|
VNInfo *ValNo = interval.createValueCopy(OldValNo, VNInfoAllocator);
|
2009-06-17 21:01:20 +00:00
|
|
|
|
2006-08-31 05:54:43 +00:00
|
|
|
// Value#0 is now defined by the 2-addr instruction.
|
2012-02-04 05:20:49 +00:00
|
|
|
OldValNo->def = RedefIndex;
|
2010-08-12 20:01:23 +00:00
|
|
|
|
2006-08-22 18:19:46 +00:00
|
|
|
// Add the new live interval which replaces the range for the input copy.
|
|
|
|
LiveRange LR(DefIndex, RedefIndex, ValNo);
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << " replace range with " << LR);
|
2004-08-04 09:46:26 +00:00
|
|
|
interval.addRange(LR);
|
|
|
|
|
|
|
|
// If this redefinition is dead, we need to add a dummy unit live
|
|
|
|
// range covering the def slot.
|
2008-06-25 23:39:39 +00:00
|
|
|
if (MO.isDead())
|
2011-11-13 20:45:27 +00:00
|
|
|
interval.addRange(LiveRange(RedefIndex, RedefIndex.getDeadSlot(),
|
2009-11-03 23:52:08 +00:00
|
|
|
OldValNo));
|
2004-08-04 09:46:26 +00:00
|
|
|
|
2012-06-05 22:51:54 +00:00
|
|
|
DEBUG(dbgs() << " RESULT: " << interval);
|
2012-06-04 22:39:14 +00:00
|
|
|
} else if (LV->isPHIJoin(interval.reg)) {
|
2004-08-04 09:46:26 +00:00
|
|
|
// In the case of PHI elimination, each variable definition is only
|
|
|
|
// live until the end of the block. We've already taken care of the
|
|
|
|
// rest of the live range.
|
2010-02-23 22:43:58 +00:00
|
|
|
|
2011-11-13 20:45:27 +00:00
|
|
|
SlotIndex defIndex = MIIdx.getRegSlot();
|
2009-03-23 08:01:15 +00:00
|
|
|
if (MO.isEarlyClobber())
|
2011-11-13 20:45:27 +00:00
|
|
|
defIndex = MIIdx.getRegSlot(true);
|
2009-09-14 21:33:42 +00:00
|
|
|
|
2012-02-04 05:20:49 +00:00
|
|
|
VNInfo *ValNo = interval.getNextValue(defIndex, VNInfoAllocator);
|
2010-08-12 20:01:23 +00:00
|
|
|
|
2009-12-22 00:11:50 +00:00
|
|
|
SlotIndex killIndex = getMBBEndIdx(mbb);
|
2007-08-29 20:45:00 +00:00
|
|
|
LiveRange LR(defIndex, killIndex, ValNo);
|
2004-08-04 09:46:26 +00:00
|
|
|
interval.addRange(LR);
|
2009-06-17 21:01:20 +00:00
|
|
|
ValNo->setHasPHIKill(true);
|
2010-02-23 22:43:58 +00:00
|
|
|
DEBUG(dbgs() << " phi-join +" << LR);
|
2010-05-05 18:27:40 +00:00
|
|
|
} else {
|
|
|
|
llvm_unreachable("Multiply defined register");
|
2003-12-18 08:48:48 +00:00
|
|
|
}
|
2004-08-04 09:46:26 +00:00
|
|
|
}
|
2003-11-20 03:32:25 +00:00
|
|
|
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << '\n');
|
2003-11-20 03:32:25 +00:00
|
|
|
}
|
|
|
|
|
2012-02-17 00:18:18 +00:00
|
|
|
static bool isRegLiveIntoSuccessor(const MachineBasicBlock *MBB, unsigned Reg) {
|
2012-02-14 18:51:53 +00:00
|
|
|
for (MachineBasicBlock::const_succ_iterator SI = MBB->succ_begin(),
|
|
|
|
SE = MBB->succ_end();
|
|
|
|
SI != SE; ++SI) {
|
|
|
|
const MachineBasicBlock* succ = *SI;
|
|
|
|
if (succ->isLiveIn(Reg))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2004-07-23 21:24:19 +00:00
|
|
|
void LiveIntervals::handlePhysicalRegisterDef(MachineBasicBlock *MBB,
|
2003-11-20 03:32:25 +00:00
|
|
|
MachineBasicBlock::iterator mi,
|
2009-11-03 23:52:08 +00:00
|
|
|
SlotIndex MIIdx,
|
2008-06-25 23:39:39 +00:00
|
|
|
MachineOperand& MO,
|
2012-02-04 05:20:49 +00:00
|
|
|
LiveInterval &interval) {
|
2012-06-04 22:39:14 +00:00
|
|
|
DEBUG(dbgs() << "\t\tregister: " << PrintReg(interval.reg, TRI));
|
2004-08-04 09:46:26 +00:00
|
|
|
|
2009-11-03 23:52:08 +00:00
|
|
|
SlotIndex baseIndex = MIIdx;
|
2011-11-13 22:05:42 +00:00
|
|
|
SlotIndex start = baseIndex.getRegSlot(MO.isEarlyClobber());
|
2009-11-03 23:52:08 +00:00
|
|
|
SlotIndex end = start;
|
2004-08-04 09:46:26 +00:00
|
|
|
|
|
|
|
// If it is not used after definition, it is considered dead at
|
|
|
|
// the instruction defining it. Hence its interval is:
|
|
|
|
// [defSlot(def), defSlot(def)+1)
|
2009-09-20 00:36:41 +00:00
|
|
|
// For earlyclobbers, the defSlot was pushed back one; the extra
|
|
|
|
// advance below compensates.
|
2008-06-25 23:39:39 +00:00
|
|
|
if (MO.isDead()) {
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << " dead");
|
2011-11-13 20:45:27 +00:00
|
|
|
end = start.getDeadSlot();
|
2005-08-23 22:51:41 +00:00
|
|
|
goto exit;
|
2004-08-04 09:46:26 +00:00
|
|
|
}
|
2003-11-20 03:32:25 +00:00
|
|
|
|
2004-08-04 09:46:26 +00:00
|
|
|
// If it is not dead on definition, it must be killed by a
|
|
|
|
// subsequent instruction. Hence its interval is:
|
|
|
|
// [defSlot(def), useSlot(kill)+1)
|
2009-11-03 23:52:08 +00:00
|
|
|
baseIndex = baseIndex.getNextIndex();
|
2005-09-02 00:20:32 +00:00
|
|
|
while (++mi != MBB->end()) {
|
2009-11-03 23:52:08 +00:00
|
|
|
|
2010-02-10 00:55:42 +00:00
|
|
|
if (mi->isDebugValue())
|
|
|
|
continue;
|
2009-11-03 23:52:08 +00:00
|
|
|
if (getInstructionFromIndex(baseIndex) == 0)
|
2012-06-04 22:39:14 +00:00
|
|
|
baseIndex = Indexes->getNextNonNullIndex(baseIndex);
|
2009-11-03 23:52:08 +00:00
|
|
|
|
2012-06-04 22:39:14 +00:00
|
|
|
if (mi->killsRegister(interval.reg, TRI)) {
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << " killed");
|
2011-11-13 20:45:27 +00:00
|
|
|
end = baseIndex.getRegSlot();
|
2005-08-23 22:51:41 +00:00
|
|
|
goto exit;
|
2009-04-27 20:42:46 +00:00
|
|
|
} else {
|
2012-06-04 22:39:14 +00:00
|
|
|
int DefIdx = mi->findRegisterDefOperandIdx(interval.reg,false,false,TRI);
|
2009-04-27 20:42:46 +00:00
|
|
|
if (DefIdx != -1) {
|
|
|
|
if (mi->isRegTiedToUseOperand(DefIdx)) {
|
|
|
|
// Two-address instruction.
|
2012-02-04 05:41:20 +00:00
|
|
|
end = baseIndex.getRegSlot(mi->getOperand(DefIdx).isEarlyClobber());
|
2009-04-27 20:42:46 +00:00
|
|
|
} else {
|
|
|
|
// Another instruction redefines the register before it is ever read.
|
2010-02-10 00:55:42 +00:00
|
|
|
// Then the register is essentially dead at the instruction that
|
|
|
|
// defines it. Hence its interval is:
|
2009-04-27 20:42:46 +00:00
|
|
|
// [defSlot(def), defSlot(def)+1)
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << " dead");
|
2011-11-13 20:45:27 +00:00
|
|
|
end = start.getDeadSlot();
|
2009-04-27 20:42:46 +00:00
|
|
|
}
|
|
|
|
goto exit;
|
|
|
|
}
|
2004-07-23 21:24:19 +00:00
|
|
|
}
|
2010-08-12 20:01:23 +00:00
|
|
|
|
2009-11-03 23:52:08 +00:00
|
|
|
baseIndex = baseIndex.getNextIndex();
|
2004-08-04 09:46:26 +00:00
|
|
|
}
|
2010-08-12 20:01:23 +00:00
|
|
|
|
2012-02-14 18:51:53 +00:00
|
|
|
// If we get here the register *should* be live out.
|
|
|
|
assert(!isAllocatable(interval.reg) && "Physregs shouldn't be live out!");
|
2004-01-31 23:13:30 +00:00
|
|
|
|
2012-02-14 18:51:53 +00:00
|
|
|
// FIXME: We need saner rules for reserved regs.
|
|
|
|
if (isReserved(interval.reg)) {
|
|
|
|
end = start.getDeadSlot();
|
|
|
|
} else {
|
|
|
|
// Unreserved, unallocable registers like EFLAGS can be live across basic
|
|
|
|
// block boundaries.
|
2012-02-17 00:18:18 +00:00
|
|
|
assert(isRegLiveIntoSuccessor(MBB, interval.reg) &&
|
|
|
|
"Unreserved reg not live-out?");
|
2012-02-14 18:51:53 +00:00
|
|
|
end = getMBBEndIdx(MBB);
|
|
|
|
}
|
2003-11-20 03:32:25 +00:00
|
|
|
exit:
|
2004-08-04 09:46:26 +00:00
|
|
|
assert(start < end && "did not find end of interval?");
|
Allow the live interval analysis pass to be a bit more aggressive about
numbering values in live ranges for physical registers.
The alpha backend currently generates code that looks like this:
vreg = preg
...
preg = vreg
use preg
...
preg = vreg
use preg
etc. Because vreg contains the value of preg coming in, each of the
copies back into preg contain that initial value as well.
In the case of the Alpha, this allows this testcase:
void "foo"(int %blah) {
store int 5, int *%MyVar
store int 12, int* %MyVar2
ret void
}
to compile to:
foo:
ldgp $29, 0($27)
ldiq $0,5
stl $0,MyVar
ldiq $0,12
stl $0,MyVar2
ret $31,($26),1
instead of:
foo:
ldgp $29, 0($27)
bis $29,$29,$0
ldiq $1,5
bis $0,$0,$29
stl $1,MyVar
ldiq $1,12
bis $0,$0,$29
stl $1,MyVar2
ret $31,($26),1
This does not seem to have any noticable effect on X86 code.
This fixes PR535.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20536 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-09 23:05:19 +00:00
|
|
|
|
2007-04-25 07:30:23 +00:00
|
|
|
// Already exists? Extend old live interval.
|
2010-10-11 21:45:03 +00:00
|
|
|
VNInfo *ValNo = interval.getVNInfoAt(start);
|
|
|
|
bool Extend = ValNo != 0;
|
|
|
|
if (!Extend)
|
2012-02-04 05:20:49 +00:00
|
|
|
ValNo = interval.getNextValue(start, VNInfoAllocator);
|
2007-08-29 20:45:00 +00:00
|
|
|
LiveRange LR(start, end, ValNo);
|
2004-08-04 09:46:26 +00:00
|
|
|
interval.addRange(LR);
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << " +" << LR << '\n');
|
2003-11-20 03:32:25 +00:00
|
|
|
}
|
|
|
|
|
2004-07-23 21:24:19 +00:00
|
|
|
void LiveIntervals::handleRegisterDef(MachineBasicBlock *MBB,
|
|
|
|
MachineBasicBlock::iterator MI,
|
2009-11-03 23:52:08 +00:00
|
|
|
SlotIndex MIIdx,
|
2008-07-10 07:35:43 +00:00
|
|
|
MachineOperand& MO,
|
|
|
|
unsigned MOIdx) {
|
2008-06-25 23:39:39 +00:00
|
|
|
if (TargetRegisterInfo::isVirtualRegister(MO.getReg()))
|
2008-07-10 07:35:43 +00:00
|
|
|
handleVirtualRegisterDef(MBB, MI, MIIdx, MO, MOIdx,
|
2008-06-25 23:39:39 +00:00
|
|
|
getOrCreateInterval(MO.getReg()));
|
2012-02-04 05:20:49 +00:00
|
|
|
else
|
2009-04-27 20:42:46 +00:00
|
|
|
handlePhysicalRegisterDef(MBB, MI, MIIdx, MO,
|
2012-02-04 05:20:49 +00:00
|
|
|
getOrCreateInterval(MO.getReg()));
|
2004-01-31 14:37:41 +00:00
|
|
|
}
|
|
|
|
|
2007-02-19 21:49:54 +00:00
|
|
|
void LiveIntervals::handleLiveInRegister(MachineBasicBlock *MBB,
|
2009-11-03 23:52:08 +00:00
|
|
|
SlotIndex MIIdx,
|
2012-02-10 03:19:36 +00:00
|
|
|
LiveInterval &interval) {
|
2012-02-14 18:51:53 +00:00
|
|
|
assert(TargetRegisterInfo::isPhysicalRegister(interval.reg) &&
|
|
|
|
"Only physical registers can be live in.");
|
|
|
|
assert((!isAllocatable(interval.reg) || MBB->getParent()->begin() ||
|
|
|
|
MBB->isLandingPad()) &&
|
|
|
|
"Allocatable live-ins only valid for entry blocks and landing pads.");
|
|
|
|
|
2012-06-04 22:39:14 +00:00
|
|
|
DEBUG(dbgs() << "\t\tlivein register: " << PrintReg(interval.reg, TRI));
|
2007-02-19 21:49:54 +00:00
|
|
|
|
|
|
|
// Look for kills, if it reaches a def before it's killed, then it shouldn't
|
|
|
|
// be considered a livein.
|
|
|
|
MachineBasicBlock::iterator mi = MBB->begin();
|
2010-03-16 21:51:27 +00:00
|
|
|
MachineBasicBlock::iterator E = MBB->end();
|
|
|
|
// Skip over DBG_VALUE at the start of the MBB.
|
|
|
|
if (mi != E && mi->isDebugValue()) {
|
|
|
|
while (++mi != E && mi->isDebugValue())
|
|
|
|
;
|
|
|
|
if (mi == E)
|
|
|
|
// MBB is empty except for DBG_VALUE's.
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-11-03 23:52:08 +00:00
|
|
|
SlotIndex baseIndex = MIIdx;
|
|
|
|
SlotIndex start = baseIndex;
|
|
|
|
if (getInstructionFromIndex(baseIndex) == 0)
|
2012-06-04 22:39:14 +00:00
|
|
|
baseIndex = Indexes->getNextNonNullIndex(baseIndex);
|
2009-11-03 23:52:08 +00:00
|
|
|
|
|
|
|
SlotIndex end = baseIndex;
|
2009-03-05 03:34:26 +00:00
|
|
|
bool SeenDefUse = false;
|
2007-02-19 21:49:54 +00:00
|
|
|
|
2010-02-10 00:55:42 +00:00
|
|
|
while (mi != E) {
|
2012-06-04 22:39:14 +00:00
|
|
|
if (mi->killsRegister(interval.reg, TRI)) {
|
2010-02-10 01:31:26 +00:00
|
|
|
DEBUG(dbgs() << " killed");
|
2011-11-13 20:45:27 +00:00
|
|
|
end = baseIndex.getRegSlot();
|
2010-02-10 01:31:26 +00:00
|
|
|
SeenDefUse = true;
|
|
|
|
break;
|
2012-06-04 22:39:14 +00:00
|
|
|
} else if (mi->modifiesRegister(interval.reg, TRI)) {
|
2010-02-10 01:31:26 +00:00
|
|
|
// Another instruction redefines the register before it is ever read.
|
|
|
|
// Then the register is essentially dead at the instruction that defines
|
|
|
|
// it. Hence its interval is:
|
|
|
|
// [defSlot(def), defSlot(def)+1)
|
|
|
|
DEBUG(dbgs() << " dead");
|
2011-11-13 20:45:27 +00:00
|
|
|
end = start.getDeadSlot();
|
2010-02-10 01:31:26 +00:00
|
|
|
SeenDefUse = true;
|
|
|
|
break;
|
2010-02-10 00:55:42 +00:00
|
|
|
}
|
2010-02-10 01:31:26 +00:00
|
|
|
|
2010-03-16 21:51:27 +00:00
|
|
|
while (++mi != E && mi->isDebugValue())
|
|
|
|
// Skip over DBG_VALUE.
|
|
|
|
;
|
|
|
|
if (mi != E)
|
2012-06-04 22:39:14 +00:00
|
|
|
baseIndex = Indexes->getNextNonNullIndex(baseIndex);
|
2007-02-19 21:49:54 +00:00
|
|
|
}
|
|
|
|
|
2007-06-27 01:16:36 +00:00
|
|
|
// Live-in register might not be used at all.
|
2009-03-05 03:34:26 +00:00
|
|
|
if (!SeenDefUse) {
|
2012-02-17 00:18:18 +00:00
|
|
|
if (isAllocatable(interval.reg) ||
|
|
|
|
!isRegLiveIntoSuccessor(MBB, interval.reg)) {
|
|
|
|
// Allocatable registers are never live through.
|
|
|
|
// Non-allocatable registers that aren't live into any successors also
|
|
|
|
// aren't live through.
|
2012-02-14 18:51:53 +00:00
|
|
|
DEBUG(dbgs() << " dead");
|
2012-02-15 01:31:10 +00:00
|
|
|
return;
|
2012-02-14 18:51:53 +00:00
|
|
|
} else {
|
2012-02-17 00:18:18 +00:00
|
|
|
// If we get here the register is non-allocatable and live into some
|
|
|
|
// successor. We'll conservatively assume it's live-through.
|
2012-02-14 18:51:53 +00:00
|
|
|
DEBUG(dbgs() << " live through");
|
|
|
|
end = getMBBEndIdx(MBB);
|
|
|
|
}
|
2007-04-25 07:30:23 +00:00
|
|
|
}
|
|
|
|
|
2010-09-25 12:04:16 +00:00
|
|
|
SlotIndex defIdx = getMBBStartIdx(MBB);
|
|
|
|
assert(getInstructionFromIndex(defIdx) == 0 &&
|
|
|
|
"PHI def index points at actual instruction.");
|
2012-02-04 05:20:49 +00:00
|
|
|
VNInfo *vni = interval.getNextValue(defIdx, VNInfoAllocator);
|
2009-06-18 22:01:47 +00:00
|
|
|
vni->setIsPHIDef(true);
|
|
|
|
LiveRange LR(start, end, vni);
|
2009-11-07 01:58:40 +00:00
|
|
|
|
2007-02-21 22:41:17 +00:00
|
|
|
interval.addRange(LR);
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << " +" << LR << '\n');
|
2007-02-19 21:49:54 +00:00
|
|
|
}
|
|
|
|
|
2003-11-20 03:32:25 +00:00
|
|
|
/// computeIntervals - computes the live intervals for virtual
|
2004-01-31 14:37:41 +00:00
|
|
|
/// registers. for some ordering of the machine instructions [1,N] a
|
2004-01-31 19:59:32 +00:00
|
|
|
/// live interval is an interval [i, j) where 1 <= i <= j < N for
|
2003-11-20 03:32:25 +00:00
|
|
|
/// which a variable is live
|
2010-08-12 20:01:23 +00:00
|
|
|
void LiveIntervals::computeIntervals() {
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << "********** COMPUTING LIVE INTERVALS **********\n"
|
2009-08-22 20:18:03 +00:00
|
|
|
<< "********** Function: "
|
2012-06-04 22:39:14 +00:00
|
|
|
<< ((Value*)MF->getFunction())->getName() << '\n');
|
2009-07-17 19:43:40 +00:00
|
|
|
|
2012-06-04 22:39:14 +00:00
|
|
|
RegMaskBlocks.resize(MF->getNumBlockIDs());
|
2012-02-10 01:26:29 +00:00
|
|
|
|
2009-07-17 19:43:40 +00:00
|
|
|
SmallVector<unsigned, 8> UndefUses;
|
2012-06-04 22:39:14 +00:00
|
|
|
for (MachineFunction::iterator MBBI = MF->begin(), E = MF->end();
|
2006-09-15 03:57:23 +00:00
|
|
|
MBBI != E; ++MBBI) {
|
|
|
|
MachineBasicBlock *MBB = MBBI;
|
2012-02-10 01:26:29 +00:00
|
|
|
RegMaskBlocks[MBB->getNumber()].first = RegMaskSlots.size();
|
|
|
|
|
2010-02-06 09:07:11 +00:00
|
|
|
if (MBB->empty())
|
|
|
|
continue;
|
|
|
|
|
2008-09-21 20:43:24 +00:00
|
|
|
// Track the index of the current machine instr.
|
2009-11-03 23:52:08 +00:00
|
|
|
SlotIndex MIIndex = getMBBStartIdx(MBB);
|
2010-05-03 21:38:11 +00:00
|
|
|
DEBUG(dbgs() << "BB#" << MBB->getNumber()
|
|
|
|
<< ":\t\t# derived from " << MBB->getName() << "\n");
|
2004-08-04 09:46:26 +00:00
|
|
|
|
2007-10-03 19:26:29 +00:00
|
|
|
// Create intervals for live-ins to this BB first.
|
2010-04-13 16:57:55 +00:00
|
|
|
for (MachineBasicBlock::livein_iterator LI = MBB->livein_begin(),
|
2007-10-03 19:26:29 +00:00
|
|
|
LE = MBB->livein_end(); LI != LE; ++LI) {
|
|
|
|
handleLiveInRegister(MBB, MIIndex, getOrCreateInterval(*LI));
|
2006-09-04 18:27:40 +00:00
|
|
|
}
|
2010-08-12 20:01:23 +00:00
|
|
|
|
2008-09-15 22:00:38 +00:00
|
|
|
// Skip over empty initial indices.
|
2009-11-03 23:52:08 +00:00
|
|
|
if (getInstructionFromIndex(MIIndex) == 0)
|
2012-06-04 22:39:14 +00:00
|
|
|
MIIndex = Indexes->getNextNonNullIndex(MIIndex);
|
2010-08-12 20:01:23 +00:00
|
|
|
|
2010-01-22 22:38:21 +00:00
|
|
|
for (MachineBasicBlock::iterator MI = MBB->begin(), miEnd = MBB->end();
|
|
|
|
MI != miEnd; ++MI) {
|
2010-01-04 22:49:02 +00:00
|
|
|
DEBUG(dbgs() << MIIndex << "\t" << *MI);
|
2010-02-09 19:54:29 +00:00
|
|
|
if (MI->isDebugValue())
|
2010-01-22 22:38:21 +00:00
|
|
|
continue;
|
2012-06-04 22:39:14 +00:00
|
|
|
assert(Indexes->getInstructionFromIndex(MIIndex) == MI &&
|
2012-02-08 17:33:45 +00:00
|
|
|
"Lost SlotIndex synchronization");
|
2004-08-04 09:46:26 +00:00
|
|
|
|
2006-11-10 08:43:01 +00:00
|
|
|
// Handle defs.
|
2006-09-15 03:57:23 +00:00
|
|
|
for (int i = MI->getNumOperands() - 1; i >= 0; --i) {
|
|
|
|
MachineOperand &MO = MI->getOperand(i);
|
2012-02-08 17:33:45 +00:00
|
|
|
|
|
|
|
// Collect register masks.
|
|
|
|
if (MO.isRegMask()) {
|
|
|
|
RegMaskSlots.push_back(MIIndex.getRegSlot());
|
|
|
|
RegMaskBits.push_back(MO.getRegMask());
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2009-07-17 19:43:40 +00:00
|
|
|
if (!MO.isReg() || !MO.getReg())
|
|
|
|
continue;
|
|
|
|
|
2004-08-04 09:46:26 +00:00
|
|
|
// handle register defs - build intervals
|
2009-07-17 19:43:40 +00:00
|
|
|
if (MO.isDef())
|
2008-07-10 07:35:43 +00:00
|
|
|
handleRegisterDef(MBB, MI, MIIndex, MO, i);
|
2009-07-17 19:43:40 +00:00
|
|
|
else if (MO.isUndef())
|
|
|
|
UndefUses.push_back(MO.getReg());
|
2004-08-04 09:46:26 +00:00
|
|
|
}
|
2010-08-12 20:01:23 +00:00
|
|
|
|
2009-11-03 23:52:08 +00:00
|
|
|
// Move to the next instr slot.
|
2012-06-04 22:39:14 +00:00
|
|
|
MIIndex = Indexes->getNextNonNullIndex(MIIndex);
|
2003-11-20 03:32:25 +00:00
|
|
|
}
|
2012-02-10 01:26:29 +00:00
|
|
|
|
|
|
|
// Compute the number of register mask instructions in this block.
|
|
|
|
std::pair<unsigned, unsigned> &RMB = RegMaskBlocks[MBB->getNumber()];
|
|
|
|
RMB.second = RegMaskSlots.size() - RMB.first;;
|
2004-08-04 09:46:26 +00:00
|
|
|
}
|
2009-07-17 19:43:40 +00:00
|
|
|
|
|
|
|
// Create empty intervals for registers defined by implicit_def's (except
|
|
|
|
// for those implicit_def that define values which are liveout of their
|
|
|
|
// blocks.
|
|
|
|
for (unsigned i = 0, e = UndefUses.size(); i != e; ++i) {
|
|
|
|
unsigned UndefReg = UndefUses[i];
|
|
|
|
(void)getOrCreateInterval(UndefReg);
|
|
|
|
}
|
2003-11-20 03:32:25 +00:00
|
|
|
}
|
2003-12-05 10:38:28 +00:00
|
|
|
|
2008-08-13 21:49:13 +00:00
|
|
|
LiveInterval* LiveIntervals::createInterval(unsigned reg) {
|
2009-02-08 11:04:35 +00:00
|
|
|
float Weight = TargetRegisterInfo::isPhysicalRegister(reg) ? HUGE_VALF : 0.0F;
|
2008-08-13 21:49:13 +00:00
|
|
|
return new LiveInterval(reg, Weight);
|
2004-04-09 18:07:57 +00:00
|
|
|
}
|
2007-11-12 06:35:08 +00:00
|
|
|
|
2012-06-05 22:02:15 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Register Unit Liveness
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// Fixed interference typically comes from ABI boundaries: Function arguments
|
|
|
|
// and return values are passed in fixed registers, and so are exception
|
|
|
|
// pointers entering landing pads. Certain instructions require values to be
|
|
|
|
// present in specific registers. That is also represented through fixed
|
|
|
|
// interference.
|
|
|
|
//
|
|
|
|
|
|
|
|
/// computeRegUnitInterval - Compute the live interval of a register unit, based
|
|
|
|
/// on the uses and defs of aliasing registers. The interval should be empty,
|
|
|
|
/// or contain only dead phi-defs from ABI blocks.
|
|
|
|
void LiveIntervals::computeRegUnitInterval(LiveInterval *LI) {
|
|
|
|
unsigned Unit = LI->reg;
|
|
|
|
|
|
|
|
assert(LRCalc && "LRCalc not initialized.");
|
|
|
|
LRCalc->reset(MF, getSlotIndexes(), DomTree, &getVNInfoAllocator());
|
|
|
|
|
|
|
|
// The physregs aliasing Unit are the roots and their super-registers.
|
|
|
|
// Create all values as dead defs before extending to uses. Note that roots
|
|
|
|
// may share super-registers. That's OK because createDeadDefs() is
|
|
|
|
// idempotent. It is very rare for a register unit to have multiple roots, so
|
|
|
|
// uniquing super-registers is probably not worthwhile.
|
|
|
|
for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
|
|
|
|
unsigned Root = *Roots;
|
|
|
|
if (!MRI->reg_empty(Root))
|
|
|
|
LRCalc->createDeadDefs(LI, Root);
|
|
|
|
for (MCSuperRegIterator Supers(Root, TRI); Supers.isValid(); ++Supers) {
|
|
|
|
if (!MRI->reg_empty(*Supers))
|
|
|
|
LRCalc->createDeadDefs(LI, *Supers);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now extend LI to reach all uses.
|
|
|
|
// Ignore uses of reserved registers. We only track defs of those.
|
|
|
|
for (MCRegUnitRootIterator Roots(Unit, TRI); Roots.isValid(); ++Roots) {
|
|
|
|
unsigned Root = *Roots;
|
|
|
|
if (!isReserved(Root) && !MRI->reg_empty(Root))
|
|
|
|
LRCalc->extendToUses(LI, Root);
|
|
|
|
for (MCSuperRegIterator Supers(Root, TRI); Supers.isValid(); ++Supers) {
|
|
|
|
unsigned Reg = *Supers;
|
|
|
|
if (!isReserved(Reg) && !MRI->reg_empty(Reg))
|
|
|
|
LRCalc->extendToUses(LI, Reg);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// computeLiveInRegUnits - Precompute the live ranges of any register units
|
|
|
|
/// that are live-in to an ABI block somewhere. Register values can appear
|
|
|
|
/// without a corresponding def when entering the entry block or a landing pad.
|
|
|
|
///
|
|
|
|
void LiveIntervals::computeLiveInRegUnits() {
|
|
|
|
RegUnitIntervals.resize(TRI->getNumRegUnits());
|
|
|
|
DEBUG(dbgs() << "Computing live-in reg-units in ABI blocks.\n");
|
|
|
|
|
|
|
|
// Keep track of the intervals allocated.
|
|
|
|
SmallVector<LiveInterval*, 8> NewIntvs;
|
|
|
|
|
|
|
|
// Check all basic blocks for live-ins.
|
|
|
|
for (MachineFunction::const_iterator MFI = MF->begin(), MFE = MF->end();
|
|
|
|
MFI != MFE; ++MFI) {
|
|
|
|
const MachineBasicBlock *MBB = MFI;
|
|
|
|
|
|
|
|
// We only care about ABI blocks: Entry + landing pads.
|
|
|
|
if ((MFI != MF->begin() && !MBB->isLandingPad()) || MBB->livein_empty())
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Create phi-defs at Begin for all live-in registers.
|
|
|
|
SlotIndex Begin = Indexes->getMBBStartIdx(MBB);
|
|
|
|
DEBUG(dbgs() << Begin << "\tBB#" << MBB->getNumber());
|
|
|
|
for (MachineBasicBlock::livein_iterator LII = MBB->livein_begin(),
|
|
|
|
LIE = MBB->livein_end(); LII != LIE; ++LII) {
|
|
|
|
for (MCRegUnitIterator Units(*LII, TRI); Units.isValid(); ++Units) {
|
|
|
|
unsigned Unit = *Units;
|
|
|
|
LiveInterval *Intv = RegUnitIntervals[Unit];
|
|
|
|
if (!Intv) {
|
|
|
|
Intv = RegUnitIntervals[Unit] = new LiveInterval(Unit, HUGE_VALF);
|
|
|
|
NewIntvs.push_back(Intv);
|
|
|
|
}
|
|
|
|
VNInfo *VNI = Intv->createDeadDef(Begin, getVNInfoAllocator());
|
2012-06-05 23:00:03 +00:00
|
|
|
(void)VNI;
|
2012-06-05 22:02:15 +00:00
|
|
|
DEBUG(dbgs() << ' ' << PrintRegUnit(Unit, TRI) << '#' << VNI->id);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
DEBUG(dbgs() << '\n');
|
|
|
|
}
|
|
|
|
DEBUG(dbgs() << "Created " << NewIntvs.size() << " new intervals.\n");
|
|
|
|
|
|
|
|
// Compute the 'normal' part of the intervals.
|
|
|
|
for (unsigned i = 0, e = NewIntvs.size(); i != e; ++i)
|
|
|
|
computeRegUnitInterval(NewIntvs[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-02-08 00:03:05 +00:00
|
|
|
/// shrinkToUses - After removing some uses of a register, shrink its live
|
|
|
|
/// range to just the remaining uses. This method does not compute reaching
|
|
|
|
/// defs for new uses, and it doesn't remove dead defs.
|
2011-03-17 20:37:07 +00:00
|
|
|
bool LiveIntervals::shrinkToUses(LiveInterval *li,
|
2011-03-07 23:29:10 +00:00
|
|
|
SmallVectorImpl<MachineInstr*> *dead) {
|
2011-02-08 00:03:05 +00:00
|
|
|
DEBUG(dbgs() << "Shrink: " << *li << '\n');
|
|
|
|
assert(TargetRegisterInfo::isVirtualRegister(li->reg)
|
2012-01-03 20:05:57 +00:00
|
|
|
&& "Can only shrink virtual registers");
|
2011-02-08 00:03:05 +00:00
|
|
|
// Find all the values used, including PHI kills.
|
|
|
|
SmallVector<std::pair<SlotIndex, VNInfo*>, 16> WorkList;
|
|
|
|
|
2011-09-15 15:24:16 +00:00
|
|
|
// Blocks that have already been added to WorkList as live-out.
|
|
|
|
SmallPtrSet<MachineBasicBlock*, 16> LiveOut;
|
|
|
|
|
2011-02-08 00:03:05 +00:00
|
|
|
// Visit all instructions reading li->reg.
|
2012-06-04 22:39:14 +00:00
|
|
|
for (MachineRegisterInfo::reg_iterator I = MRI->reg_begin(li->reg);
|
2011-02-08 00:03:05 +00:00
|
|
|
MachineInstr *UseMI = I.skipInstruction();) {
|
|
|
|
if (UseMI->isDebugValue() || !UseMI->readsVirtualRegister(li->reg))
|
|
|
|
continue;
|
2011-11-13 23:53:25 +00:00
|
|
|
SlotIndex Idx = getInstructionIndex(UseMI).getRegSlot();
|
2012-05-20 02:54:52 +00:00
|
|
|
LiveRangeQuery LRQ(*li, Idx);
|
|
|
|
VNInfo *VNI = LRQ.valueIn();
|
2011-03-18 03:06:04 +00:00
|
|
|
if (!VNI) {
|
|
|
|
// This shouldn't happen: readsVirtualRegister returns true, but there is
|
|
|
|
// no live value. It is likely caused by a target getting <undef> flags
|
|
|
|
// wrong.
|
|
|
|
DEBUG(dbgs() << Idx << '\t' << *UseMI
|
|
|
|
<< "Warning: Instr claims to read non-existent value in "
|
|
|
|
<< *li << '\n');
|
|
|
|
continue;
|
|
|
|
}
|
2011-11-14 18:45:38 +00:00
|
|
|
// Special case: An early-clobber tied operand reads and writes the
|
2012-05-20 02:54:52 +00:00
|
|
|
// register one slot early.
|
|
|
|
if (VNInfo *DefVNI = LRQ.valueDefined())
|
|
|
|
Idx = DefVNI->def;
|
|
|
|
|
2011-02-08 00:03:05 +00:00
|
|
|
WorkList.push_back(std::make_pair(Idx, VNI));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create a new live interval with only minimal live segments per def.
|
|
|
|
LiveInterval NewLI(li->reg, 0);
|
|
|
|
for (LiveInterval::vni_iterator I = li->vni_begin(), E = li->vni_end();
|
|
|
|
I != E; ++I) {
|
|
|
|
VNInfo *VNI = *I;
|
|
|
|
if (VNI->isUnused())
|
|
|
|
continue;
|
2011-11-13 22:42:13 +00:00
|
|
|
NewLI.addRange(LiveRange(VNI->def, VNI->def.getDeadSlot(), VNI));
|
2011-02-08 00:03:05 +00:00
|
|
|
}
|
|
|
|
|
2011-03-02 00:33:03 +00:00
|
|
|
// Keep track of the PHIs that are in use.
|
|
|
|
SmallPtrSet<VNInfo*, 8> UsedPHIs;
|
|
|
|
|
2011-02-08 00:03:05 +00:00
|
|
|
// Extend intervals to reach all uses in WorkList.
|
|
|
|
while (!WorkList.empty()) {
|
|
|
|
SlotIndex Idx = WorkList.back().first;
|
|
|
|
VNInfo *VNI = WorkList.back().second;
|
|
|
|
WorkList.pop_back();
|
2011-11-13 23:53:25 +00:00
|
|
|
const MachineBasicBlock *MBB = getMBBFromIndex(Idx.getPrevSlot());
|
2011-02-08 00:03:05 +00:00
|
|
|
SlotIndex BlockStart = getMBBStartIdx(MBB);
|
2011-03-02 00:33:03 +00:00
|
|
|
|
|
|
|
// Extend the live range for VNI to be live at Idx.
|
2011-11-13 23:53:25 +00:00
|
|
|
if (VNInfo *ExtVNI = NewLI.extendInBlock(BlockStart, Idx)) {
|
2011-03-02 01:43:30 +00:00
|
|
|
(void)ExtVNI;
|
2011-03-02 00:33:03 +00:00
|
|
|
assert(ExtVNI == VNI && "Unexpected existing value number");
|
|
|
|
// Is this a PHIDef we haven't seen before?
|
2011-03-03 00:20:51 +00:00
|
|
|
if (!VNI->isPHIDef() || VNI->def != BlockStart || !UsedPHIs.insert(VNI))
|
2011-03-02 00:33:03 +00:00
|
|
|
continue;
|
|
|
|
// The PHI is live, make sure the predecessors are live-out.
|
|
|
|
for (MachineBasicBlock::const_pred_iterator PI = MBB->pred_begin(),
|
|
|
|
PE = MBB->pred_end(); PI != PE; ++PI) {
|
2011-09-15 15:24:16 +00:00
|
|
|
if (!LiveOut.insert(*PI))
|
|
|
|
continue;
|
2011-11-13 23:53:25 +00:00
|
|
|
SlotIndex Stop = getMBBEndIdx(*PI);
|
2011-03-02 00:33:03 +00:00
|
|
|
// A predecessor is not required to have a live-out value for a PHI.
|
2011-11-13 23:53:25 +00:00
|
|
|
if (VNInfo *PVNI = li->getVNInfoBefore(Stop))
|
2011-03-02 00:33:03 +00:00
|
|
|
WorkList.push_back(std::make_pair(Stop, PVNI));
|
2011-02-08 00:03:05 +00:00
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// VNI is live-in to MBB.
|
|
|
|
DEBUG(dbgs() << " live-in at " << BlockStart << '\n');
|
2011-11-13 23:53:25 +00:00
|
|
|
NewLI.addRange(LiveRange(BlockStart, Idx, VNI));
|
2011-02-08 00:03:05 +00:00
|
|
|
|
|
|
|
// Make sure VNI is live-out from the predecessors.
|
|
|
|
for (MachineBasicBlock::const_pred_iterator PI = MBB->pred_begin(),
|
|
|
|
PE = MBB->pred_end(); PI != PE; ++PI) {
|
2011-09-15 15:24:16 +00:00
|
|
|
if (!LiveOut.insert(*PI))
|
|
|
|
continue;
|
2011-11-13 23:53:25 +00:00
|
|
|
SlotIndex Stop = getMBBEndIdx(*PI);
|
|
|
|
assert(li->getVNInfoBefore(Stop) == VNI &&
|
|
|
|
"Wrong value out of predecessor");
|
2011-02-08 00:03:05 +00:00
|
|
|
WorkList.push_back(std::make_pair(Stop, VNI));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Handle dead values.
|
2011-03-17 20:37:07 +00:00
|
|
|
bool CanSeparate = false;
|
2011-02-08 00:03:05 +00:00
|
|
|
for (LiveInterval::vni_iterator I = li->vni_begin(), E = li->vni_end();
|
|
|
|
I != E; ++I) {
|
|
|
|
VNInfo *VNI = *I;
|
|
|
|
if (VNI->isUnused())
|
|
|
|
continue;
|
|
|
|
LiveInterval::iterator LII = NewLI.FindLiveRangeContaining(VNI->def);
|
|
|
|
assert(LII != NewLI.end() && "Missing live range for PHI");
|
2011-11-13 22:42:13 +00:00
|
|
|
if (LII->end != VNI->def.getDeadSlot())
|
2011-02-08 00:03:05 +00:00
|
|
|
continue;
|
2011-03-02 00:33:01 +00:00
|
|
|
if (VNI->isPHIDef()) {
|
2011-02-08 00:03:05 +00:00
|
|
|
// This is a dead PHI. Remove it.
|
|
|
|
VNI->setIsUnused(true);
|
|
|
|
NewLI.removeRange(*LII);
|
2011-03-17 20:37:07 +00:00
|
|
|
DEBUG(dbgs() << "Dead PHI at " << VNI->def << " may separate interval\n");
|
|
|
|
CanSeparate = true;
|
2011-02-08 00:03:05 +00:00
|
|
|
} else {
|
|
|
|
// This is a dead def. Make sure the instruction knows.
|
|
|
|
MachineInstr *MI = getInstructionFromIndex(VNI->def);
|
|
|
|
assert(MI && "No instruction defining live value");
|
2012-06-04 22:39:14 +00:00
|
|
|
MI->addRegisterDead(li->reg, TRI);
|
2011-03-07 23:29:10 +00:00
|
|
|
if (dead && MI->allDefsAreDead()) {
|
2011-03-16 22:56:08 +00:00
|
|
|
DEBUG(dbgs() << "All defs dead: " << VNI->def << '\t' << *MI);
|
2011-03-07 23:29:10 +00:00
|
|
|
dead->push_back(MI);
|
|
|
|
}
|
2011-02-08 00:03:05 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Move the trimmed ranges back.
|
|
|
|
li->ranges.swap(NewLI.ranges);
|
2011-03-16 22:56:08 +00:00
|
|
|
DEBUG(dbgs() << "Shrunk: " << *li << '\n');
|
2011-03-17 20:37:07 +00:00
|
|
|
return CanSeparate;
|
2011-02-08 00:03:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-11-12 06:35:08 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Register allocator hooks.
|
|
|
|
//
|
|
|
|
|
2011-02-08 21:13:03 +00:00
|
|
|
void LiveIntervals::addKillFlags() {
|
|
|
|
for (iterator I = begin(), E = end(); I != E; ++I) {
|
|
|
|
unsigned Reg = I->first;
|
|
|
|
if (TargetRegisterInfo::isPhysicalRegister(Reg))
|
|
|
|
continue;
|
2012-06-04 22:39:14 +00:00
|
|
|
if (MRI->reg_nodbg_empty(Reg))
|
2011-02-08 21:13:03 +00:00
|
|
|
continue;
|
|
|
|
LiveInterval *LI = I->second;
|
|
|
|
|
|
|
|
// Every instruction that kills Reg corresponds to a live range end point.
|
|
|
|
for (LiveInterval::iterator RI = LI->begin(), RE = LI->end(); RI != RE;
|
|
|
|
++RI) {
|
2011-11-13 20:45:27 +00:00
|
|
|
// A block index indicates an MBB edge.
|
|
|
|
if (RI->end.isBlock())
|
2011-02-08 21:13:03 +00:00
|
|
|
continue;
|
|
|
|
MachineInstr *MI = getInstructionFromIndex(RI->end);
|
|
|
|
if (!MI)
|
|
|
|
continue;
|
|
|
|
MI->addRegisterKilled(Reg, NULL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-02-10 01:23:55 +00:00
|
|
|
MachineBasicBlock*
|
|
|
|
LiveIntervals::intervalIsInOneMBB(const LiveInterval &LI) const {
|
|
|
|
// A local live range must be fully contained inside the block, meaning it is
|
|
|
|
// defined and killed at instructions, not at block boundaries. It is not
|
|
|
|
// live in or or out of any block.
|
|
|
|
//
|
|
|
|
// It is technically possible to have a PHI-defined live range identical to a
|
|
|
|
// single block, but we are going to return false in that case.
|
|
|
|
|
|
|
|
SlotIndex Start = LI.beginIndex();
|
|
|
|
if (Start.isBlock())
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
SlotIndex Stop = LI.endIndex();
|
|
|
|
if (Stop.isBlock())
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
// getMBBFromIndex doesn't need to search the MBB table when both indexes
|
|
|
|
// belong to proper instructions.
|
2012-06-04 22:39:14 +00:00
|
|
|
MachineBasicBlock *MBB1 = Indexes->getMBBFromIndex(Start);
|
|
|
|
MachineBasicBlock *MBB2 = Indexes->getMBBFromIndex(Stop);
|
2012-02-10 01:23:55 +00:00
|
|
|
return MBB1 == MBB2 ? MBB1 : NULL;
|
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
|
|
|
}
|
|
|
|
|
2010-03-01 20:59:38 +00:00
|
|
|
float
|
|
|
|
LiveIntervals::getSpillWeight(bool isDef, bool isUse, unsigned loopDepth) {
|
|
|
|
// Limit the loop depth ridiculousness.
|
|
|
|
if (loopDepth > 200)
|
|
|
|
loopDepth = 200;
|
|
|
|
|
|
|
|
// The loop depth is used to roughly estimate the number of times the
|
|
|
|
// instruction is executed. Something like 10^d is simple, but will quickly
|
|
|
|
// overflow a float. This expression behaves like 10^d for small d, but is
|
|
|
|
// more tempered for large d. At d=200 we get 6.7e33 which leaves a bit of
|
|
|
|
// headroom before overflow.
|
2011-03-31 12:11:33 +00:00
|
|
|
// By the way, powf() might be unavailable here. For consistency,
|
|
|
|
// We may take pow(double,double).
|
|
|
|
float lc = std::pow(1 + (100.0 / (loopDepth + 10)), (double)loopDepth);
|
2010-03-01 20:59:38 +00:00
|
|
|
|
|
|
|
return (isDef + isUse) * lc;
|
|
|
|
}
|
|
|
|
|
2008-06-05 17:15:43 +00:00
|
|
|
LiveRange LiveIntervals::addLiveRangeToEndOfBlock(unsigned reg,
|
2009-07-09 03:57:02 +00:00
|
|
|
MachineInstr* startInst) {
|
2008-06-05 17:15:43 +00:00
|
|
|
LiveInterval& Interval = getOrCreateInterval(reg);
|
|
|
|
VNInfo* VN = Interval.getNextValue(
|
2011-11-13 20:45:27 +00:00
|
|
|
SlotIndex(getInstructionIndex(startInst).getRegSlot()),
|
2012-02-04 05:20:49 +00:00
|
|
|
getVNInfoAllocator());
|
2009-06-17 21:01:20 +00:00
|
|
|
VN->setHasPHIKill(true);
|
2009-09-04 20:41:11 +00:00
|
|
|
LiveRange LR(
|
2011-11-13 20:45:27 +00:00
|
|
|
SlotIndex(getInstructionIndex(startInst).getRegSlot()),
|
2009-12-22 00:11:50 +00:00
|
|
|
getMBBEndIdx(startInst->getParent()), VN);
|
2008-06-05 17:15:43 +00:00
|
|
|
Interval.addRange(LR);
|
2010-08-12 20:01:23 +00:00
|
|
|
|
2008-06-05 17:15:43 +00:00
|
|
|
return LR;
|
|
|
|
}
|
2012-02-08 17:33:45 +00:00
|
|
|
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Register mask functions
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
bool LiveIntervals::checkRegMaskInterference(LiveInterval &LI,
|
|
|
|
BitVector &UsableRegs) {
|
|
|
|
if (LI.empty())
|
|
|
|
return false;
|
2012-02-10 01:31:31 +00:00
|
|
|
LiveInterval::iterator LiveI = LI.begin(), LiveE = LI.end();
|
|
|
|
|
|
|
|
// Use a smaller arrays for local live ranges.
|
|
|
|
ArrayRef<SlotIndex> Slots;
|
|
|
|
ArrayRef<const uint32_t*> Bits;
|
|
|
|
if (MachineBasicBlock *MBB = intervalIsInOneMBB(LI)) {
|
|
|
|
Slots = getRegMaskSlotsInBlock(MBB->getNumber());
|
|
|
|
Bits = getRegMaskBitsInBlock(MBB->getNumber());
|
|
|
|
} else {
|
|
|
|
Slots = getRegMaskSlots();
|
|
|
|
Bits = getRegMaskBits();
|
|
|
|
}
|
2012-02-08 17:33:45 +00:00
|
|
|
|
|
|
|
// We are going to enumerate all the register mask slots contained in LI.
|
|
|
|
// Start with a binary search of RegMaskSlots to find a starting point.
|
|
|
|
ArrayRef<SlotIndex>::iterator SlotI =
|
|
|
|
std::lower_bound(Slots.begin(), Slots.end(), LiveI->start);
|
|
|
|
ArrayRef<SlotIndex>::iterator SlotE = Slots.end();
|
|
|
|
|
|
|
|
// No slots in range, LI begins after the last call.
|
|
|
|
if (SlotI == SlotE)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
bool Found = false;
|
|
|
|
for (;;) {
|
|
|
|
assert(*SlotI >= LiveI->start);
|
|
|
|
// Loop over all slots overlapping this segment.
|
|
|
|
while (*SlotI < LiveI->end) {
|
|
|
|
// *SlotI overlaps LI. Collect mask bits.
|
|
|
|
if (!Found) {
|
|
|
|
// This is the first overlap. Initialize UsableRegs to all ones.
|
|
|
|
UsableRegs.clear();
|
2012-06-04 22:39:14 +00:00
|
|
|
UsableRegs.resize(TRI->getNumRegs(), true);
|
2012-02-08 17:33:45 +00:00
|
|
|
Found = true;
|
|
|
|
}
|
|
|
|
// Remove usable registers clobbered by this mask.
|
2012-02-10 01:31:31 +00:00
|
|
|
UsableRegs.clearBitsNotInMask(Bits[SlotI-Slots.begin()]);
|
2012-02-08 17:33:45 +00:00
|
|
|
if (++SlotI == SlotE)
|
|
|
|
return Found;
|
|
|
|
}
|
|
|
|
// *SlotI is beyond the current LI segment.
|
|
|
|
LiveI = LI.advanceTo(LiveI, *SlotI);
|
|
|
|
if (LiveI == LiveE)
|
|
|
|
return Found;
|
|
|
|
// Advance SlotI until it overlaps.
|
|
|
|
while (*SlotI < LiveI->start)
|
|
|
|
if (++SlotI == SlotE)
|
|
|
|
return Found;
|
|
|
|
}
|
|
|
|
}
|
2012-02-17 18:44:18 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// IntervalUpdate class.
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2012-02-21 00:00:36 +00:00
|
|
|
// HMEditor is a toolkit used by handleMove to trim or extend live intervals.
|
2012-02-17 18:44:18 +00:00
|
|
|
class LiveIntervals::HMEditor {
|
|
|
|
private:
|
2012-02-17 23:43:40 +00:00
|
|
|
LiveIntervals& LIS;
|
|
|
|
const MachineRegisterInfo& MRI;
|
|
|
|
const TargetRegisterInfo& TRI;
|
|
|
|
SlotIndex NewIdx;
|
2012-02-17 18:44:18 +00:00
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
typedef std::pair<LiveInterval*, LiveRange*> IntRangePair;
|
|
|
|
typedef DenseSet<IntRangePair> RangeSet;
|
|
|
|
|
2012-02-19 07:13:05 +00:00
|
|
|
struct RegRanges {
|
|
|
|
LiveRange* Use;
|
|
|
|
LiveRange* EC;
|
|
|
|
LiveRange* Dead;
|
|
|
|
LiveRange* Def;
|
|
|
|
RegRanges() : Use(0), EC(0), Dead(0), Def(0) {}
|
|
|
|
};
|
|
|
|
typedef DenseMap<unsigned, RegRanges> BundleRanges;
|
|
|
|
|
2012-02-17 18:44:18 +00:00
|
|
|
public:
|
2012-02-17 23:43:40 +00:00
|
|
|
HMEditor(LiveIntervals& LIS, const MachineRegisterInfo& MRI,
|
|
|
|
const TargetRegisterInfo& TRI, SlotIndex NewIdx)
|
|
|
|
: LIS(LIS), MRI(MRI), TRI(TRI), NewIdx(NewIdx) {}
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
// Update intervals for all operands of MI from OldIdx to NewIdx.
|
|
|
|
// This assumes that MI used to be at OldIdx, and now resides at
|
|
|
|
// NewIdx.
|
2012-02-21 22:29:38 +00:00
|
|
|
void moveAllRangesFrom(MachineInstr* MI, SlotIndex OldIdx) {
|
2012-02-19 07:13:05 +00:00
|
|
|
assert(NewIdx != OldIdx && "No-op move? That's a bit strange.");
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
// Collect the operands.
|
|
|
|
RangeSet Entering, Internal, Exiting;
|
2012-02-19 03:09:55 +00:00
|
|
|
bool hasRegMaskOp = false;
|
|
|
|
collectRanges(MI, Entering, Internal, Exiting, hasRegMaskOp, OldIdx);
|
2012-02-19 03:00:30 +00:00
|
|
|
|
2012-03-21 04:12:16 +00:00
|
|
|
// To keep the LiveRanges valid within an interval, move the ranges closest
|
|
|
|
// to the destination first. This prevents ranges from overlapping, to that
|
|
|
|
// APIs like removeRange still work.
|
|
|
|
if (NewIdx < OldIdx) {
|
|
|
|
moveAllEnteringFrom(OldIdx, Entering);
|
|
|
|
moveAllInternalFrom(OldIdx, Internal);
|
|
|
|
moveAllExitingFrom(OldIdx, Exiting);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
moveAllExitingFrom(OldIdx, Exiting);
|
|
|
|
moveAllInternalFrom(OldIdx, Internal);
|
|
|
|
moveAllEnteringFrom(OldIdx, Entering);
|
|
|
|
}
|
2012-02-17 18:44:18 +00:00
|
|
|
|
2012-02-19 03:09:55 +00:00
|
|
|
if (hasRegMaskOp)
|
|
|
|
updateRegMaskSlots(OldIdx);
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
LIValidator validator;
|
2012-04-18 20:29:17 +00:00
|
|
|
validator = std::for_each(Entering.begin(), Entering.end(), validator);
|
|
|
|
validator = std::for_each(Internal.begin(), Internal.end(), validator);
|
|
|
|
validator = std::for_each(Exiting.begin(), Exiting.end(), validator);
|
2012-02-19 07:13:05 +00:00
|
|
|
assert(validator.rangesOk() && "moveAllOperandsFrom broke liveness.");
|
2012-02-19 03:00:30 +00:00
|
|
|
#endif
|
|
|
|
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
|
|
|
|
2012-02-21 22:29:38 +00:00
|
|
|
// Update intervals for all operands of MI to refer to BundleStart's
|
|
|
|
// SlotIndex.
|
|
|
|
void moveAllRangesInto(MachineInstr* MI, MachineInstr* BundleStart) {
|
2012-02-19 07:13:05 +00:00
|
|
|
if (MI == BundleStart)
|
|
|
|
return; // Bundling instr with itself - nothing to do.
|
|
|
|
|
2012-02-21 00:00:36 +00:00
|
|
|
SlotIndex OldIdx = LIS.getSlotIndexes()->getInstructionIndex(MI);
|
|
|
|
assert(LIS.getSlotIndexes()->getInstructionFromIndex(OldIdx) == MI &&
|
|
|
|
"SlotIndex <-> Instruction mapping broken for MI");
|
|
|
|
|
2012-02-21 22:29:38 +00:00
|
|
|
// Collect all ranges already in the bundle.
|
|
|
|
MachineBasicBlock::instr_iterator BII(BundleStart);
|
2012-02-19 07:13:05 +00:00
|
|
|
RangeSet Entering, Internal, Exiting;
|
|
|
|
bool hasRegMaskOp = false;
|
2012-02-21 22:29:38 +00:00
|
|
|
collectRanges(BII, Entering, Internal, Exiting, hasRegMaskOp, NewIdx);
|
|
|
|
assert(!hasRegMaskOp && "Can't have RegMask operand in bundle.");
|
|
|
|
for (++BII; &*BII == MI || BII->isInsideBundle(); ++BII) {
|
|
|
|
if (&*BII == MI)
|
|
|
|
continue;
|
|
|
|
collectRanges(BII, Entering, Internal, Exiting, hasRegMaskOp, NewIdx);
|
|
|
|
assert(!hasRegMaskOp && "Can't have RegMask operand in bundle.");
|
|
|
|
}
|
|
|
|
|
|
|
|
BundleRanges BR = createBundleRanges(Entering, Internal, Exiting);
|
|
|
|
|
2012-05-29 18:19:54 +00:00
|
|
|
Entering.clear();
|
|
|
|
Internal.clear();
|
|
|
|
Exiting.clear();
|
2012-02-19 07:13:05 +00:00
|
|
|
collectRanges(MI, Entering, Internal, Exiting, hasRegMaskOp, OldIdx);
|
2012-02-21 22:29:38 +00:00
|
|
|
assert(!hasRegMaskOp && "Can't have RegMask operand in bundle.");
|
|
|
|
|
|
|
|
DEBUG(dbgs() << "Entering: " << Entering.size() << "\n");
|
|
|
|
DEBUG(dbgs() << "Internal: " << Internal.size() << "\n");
|
|
|
|
DEBUG(dbgs() << "Exiting: " << Exiting.size() << "\n");
|
2012-02-19 07:13:05 +00:00
|
|
|
|
|
|
|
moveAllEnteringFromInto(OldIdx, Entering, BR);
|
|
|
|
moveAllInternalFromInto(OldIdx, Internal, BR);
|
|
|
|
moveAllExitingFromInto(OldIdx, Exiting, BR);
|
|
|
|
|
2012-02-21 22:29:38 +00:00
|
|
|
|
2012-02-19 07:13:05 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
LIValidator validator;
|
2012-04-18 20:29:17 +00:00
|
|
|
validator = std::for_each(Entering.begin(), Entering.end(), validator);
|
|
|
|
validator = std::for_each(Internal.begin(), Internal.end(), validator);
|
|
|
|
validator = std::for_each(Exiting.begin(), Exiting.end(), validator);
|
2012-02-19 07:13:05 +00:00
|
|
|
assert(validator.rangesOk() && "moveAllOperandsInto broke liveness.");
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
private:
|
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
class LIValidator {
|
|
|
|
private:
|
|
|
|
DenseSet<const LiveInterval*> Checked, Bogus;
|
|
|
|
public:
|
|
|
|
void operator()(const IntRangePair& P) {
|
|
|
|
const LiveInterval* LI = P.first;
|
|
|
|
if (Checked.count(LI))
|
|
|
|
return;
|
|
|
|
Checked.insert(LI);
|
|
|
|
if (LI->empty())
|
|
|
|
return;
|
|
|
|
SlotIndex LastEnd = LI->begin()->start;
|
|
|
|
for (LiveInterval::const_iterator LRI = LI->begin(), LRE = LI->end();
|
|
|
|
LRI != LRE; ++LRI) {
|
|
|
|
const LiveRange& LR = *LRI;
|
|
|
|
if (LastEnd > LR.start || LR.start >= LR.end)
|
|
|
|
Bogus.insert(LI);
|
|
|
|
LastEnd = LR.end;
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
bool rangesOk() const {
|
|
|
|
return Bogus.empty();
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
2012-02-19 03:00:30 +00:00
|
|
|
};
|
|
|
|
#endif
|
2012-02-17 18:44:18 +00:00
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
// Collect IntRangePairs for all operands of MI that may need fixing.
|
|
|
|
// Treat's MI's index as OldIdx (regardless of what it is in SlotIndexes'
|
|
|
|
// maps).
|
|
|
|
void collectRanges(MachineInstr* MI, RangeSet& Entering, RangeSet& Internal,
|
2012-02-19 03:09:55 +00:00
|
|
|
RangeSet& Exiting, bool& hasRegMaskOp, SlotIndex OldIdx) {
|
|
|
|
hasRegMaskOp = false;
|
2012-02-17 23:43:40 +00:00
|
|
|
for (MachineInstr::mop_iterator MOI = MI->operands_begin(),
|
|
|
|
MOE = MI->operands_end();
|
|
|
|
MOI != MOE; ++MOI) {
|
|
|
|
const MachineOperand& MO = *MOI;
|
2012-02-19 03:09:55 +00:00
|
|
|
|
|
|
|
if (MO.isRegMask()) {
|
|
|
|
hasRegMaskOp = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2012-02-17 23:43:40 +00:00
|
|
|
if (!MO.isReg() || MO.getReg() == 0)
|
2012-02-17 18:44:18 +00:00
|
|
|
continue;
|
|
|
|
|
2012-02-17 23:43:40 +00:00
|
|
|
unsigned Reg = MO.getReg();
|
2012-02-17 18:44:18 +00:00
|
|
|
|
|
|
|
// TODO: Currently we're skipping uses that are reserved or have no
|
|
|
|
// interval, but we're not updating their kills. This should be
|
|
|
|
// fixed.
|
2012-02-17 23:43:40 +00:00
|
|
|
if (!LIS.hasInterval(Reg) ||
|
|
|
|
(TargetRegisterInfo::isPhysicalRegister(Reg) && LIS.isReserved(Reg)))
|
2012-02-17 18:44:18 +00:00
|
|
|
continue;
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
LiveInterval* LI = &LIS.getInterval(Reg);
|
|
|
|
|
|
|
|
if (MO.readsReg()) {
|
|
|
|
LiveRange* LR = LI->getLiveRangeContaining(OldIdx);
|
|
|
|
if (LR != 0)
|
|
|
|
Entering.insert(std::make_pair(LI, LR));
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
2012-02-17 23:43:40 +00:00
|
|
|
if (MO.isDef()) {
|
2012-02-19 03:00:30 +00:00
|
|
|
if (MO.isEarlyClobber()) {
|
|
|
|
LiveRange* LR = LI->getLiveRangeContaining(OldIdx.getRegSlot(true));
|
|
|
|
assert(LR != 0 && "No EC range?");
|
|
|
|
if (LR->end > OldIdx.getDeadSlot())
|
|
|
|
Exiting.insert(std::make_pair(LI, LR));
|
|
|
|
else
|
2012-02-19 03:09:55 +00:00
|
|
|
Internal.insert(std::make_pair(LI, LR));
|
2012-02-19 03:00:30 +00:00
|
|
|
} else if (MO.isDead()) {
|
|
|
|
LiveRange* LR = LI->getLiveRangeContaining(OldIdx.getRegSlot());
|
|
|
|
assert(LR != 0 && "No dead-def range?");
|
|
|
|
Internal.insert(std::make_pair(LI, LR));
|
2012-02-17 18:44:18 +00:00
|
|
|
} else {
|
2012-02-19 03:00:30 +00:00
|
|
|
LiveRange* LR = LI->getLiveRangeContaining(OldIdx.getDeadSlot());
|
|
|
|
assert(LR && LR->end > OldIdx.getDeadSlot() &&
|
|
|
|
"Non-dead-def should have live range exiting.");
|
|
|
|
Exiting.insert(std::make_pair(LI, LR));
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-02-21 22:29:38 +00:00
|
|
|
// Collect IntRangePairs for all operands of MI that may need fixing.
|
|
|
|
void collectRangesInBundle(MachineInstr* MI, RangeSet& Entering,
|
|
|
|
RangeSet& Exiting, SlotIndex MIStartIdx,
|
|
|
|
SlotIndex MIEndIdx) {
|
|
|
|
for (MachineInstr::mop_iterator MOI = MI->operands_begin(),
|
|
|
|
MOE = MI->operands_end();
|
|
|
|
MOI != MOE; ++MOI) {
|
|
|
|
const MachineOperand& MO = *MOI;
|
|
|
|
assert(!MO.isRegMask() && "Can't have RegMasks in bundles.");
|
|
|
|
if (!MO.isReg() || MO.getReg() == 0)
|
|
|
|
continue;
|
2012-02-19 07:13:05 +00:00
|
|
|
|
2012-02-21 22:29:38 +00:00
|
|
|
unsigned Reg = MO.getReg();
|
|
|
|
|
|
|
|
// TODO: Currently we're skipping uses that are reserved or have no
|
|
|
|
// interval, but we're not updating their kills. This should be
|
|
|
|
// fixed.
|
|
|
|
if (!LIS.hasInterval(Reg) ||
|
|
|
|
(TargetRegisterInfo::isPhysicalRegister(Reg) && LIS.isReserved(Reg)))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
LiveInterval* LI = &LIS.getInterval(Reg);
|
|
|
|
|
|
|
|
if (MO.readsReg()) {
|
|
|
|
LiveRange* LR = LI->getLiveRangeContaining(MIStartIdx);
|
|
|
|
if (LR != 0)
|
|
|
|
Entering.insert(std::make_pair(LI, LR));
|
|
|
|
}
|
|
|
|
if (MO.isDef()) {
|
|
|
|
assert(!MO.isEarlyClobber() && "Early clobbers not allowed in bundles.");
|
|
|
|
assert(!MO.isDead() && "Dead-defs not allowed in bundles.");
|
|
|
|
LiveRange* LR = LI->getLiveRangeContaining(MIEndIdx.getDeadSlot());
|
|
|
|
assert(LR != 0 && "Internal ranges not allowed in bundles.");
|
|
|
|
Exiting.insert(std::make_pair(LI, LR));
|
|
|
|
}
|
2012-02-19 07:13:05 +00:00
|
|
|
}
|
2012-02-21 22:29:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
BundleRanges createBundleRanges(RangeSet& Entering, RangeSet& Internal, RangeSet& Exiting) {
|
|
|
|
BundleRanges BR;
|
2012-02-19 07:13:05 +00:00
|
|
|
|
|
|
|
for (RangeSet::iterator EI = Entering.begin(), EE = Entering.end();
|
2012-02-21 00:00:36 +00:00
|
|
|
EI != EE; ++EI) {
|
2012-02-19 07:13:05 +00:00
|
|
|
LiveInterval* LI = EI->first;
|
|
|
|
LiveRange* LR = EI->second;
|
|
|
|
BR[LI->reg].Use = LR;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (RangeSet::iterator II = Internal.begin(), IE = Internal.end();
|
2012-02-21 00:00:36 +00:00
|
|
|
II != IE; ++II) {
|
2012-02-19 07:13:05 +00:00
|
|
|
LiveInterval* LI = II->first;
|
|
|
|
LiveRange* LR = II->second;
|
|
|
|
if (LR->end.isDead()) {
|
|
|
|
BR[LI->reg].Dead = LR;
|
|
|
|
} else {
|
|
|
|
BR[LI->reg].EC = LR;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (RangeSet::iterator EI = Exiting.begin(), EE = Exiting.end();
|
2012-02-21 00:00:36 +00:00
|
|
|
EI != EE; ++EI) {
|
2012-02-19 07:13:05 +00:00
|
|
|
LiveInterval* LI = EI->first;
|
|
|
|
LiveRange* LR = EI->second;
|
|
|
|
BR[LI->reg].Def = LR;
|
|
|
|
}
|
|
|
|
|
|
|
|
return BR;
|
|
|
|
}
|
|
|
|
|
2012-02-17 23:43:40 +00:00
|
|
|
void moveKillFlags(unsigned reg, SlotIndex OldIdx, SlotIndex newKillIdx) {
|
|
|
|
MachineInstr* OldKillMI = LIS.getInstructionFromIndex(OldIdx);
|
|
|
|
if (!OldKillMI->killsRegister(reg))
|
2012-02-17 18:44:18 +00:00
|
|
|
return; // Bail out if we don't have kill flags on the old register.
|
2012-02-17 23:43:40 +00:00
|
|
|
MachineInstr* NewKillMI = LIS.getInstructionFromIndex(newKillIdx);
|
|
|
|
assert(OldKillMI->killsRegister(reg) && "Old 'kill' instr isn't a kill.");
|
|
|
|
assert(!NewKillMI->killsRegister(reg) && "New kill instr is already a kill.");
|
|
|
|
OldKillMI->clearRegisterKills(reg, &TRI);
|
|
|
|
NewKillMI->addRegisterKilled(reg, &TRI);
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
void updateRegMaskSlots(SlotIndex OldIdx) {
|
|
|
|
SmallVectorImpl<SlotIndex>::iterator RI =
|
|
|
|
std::lower_bound(LIS.RegMaskSlots.begin(), LIS.RegMaskSlots.end(),
|
|
|
|
OldIdx);
|
|
|
|
assert(*RI == OldIdx && "No RegMask at OldIdx.");
|
|
|
|
*RI = NewIdx;
|
|
|
|
assert(*prior(RI) < *RI && *RI < *next(RI) &&
|
|
|
|
"RegSlots out of order. Did you move one call across another?");
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
// Return the last use of reg between NewIdx and OldIdx.
|
|
|
|
SlotIndex findLastUseBefore(unsigned Reg, SlotIndex OldIdx) {
|
|
|
|
SlotIndex LastUse = NewIdx;
|
|
|
|
for (MachineRegisterInfo::use_nodbg_iterator
|
|
|
|
UI = MRI.use_nodbg_begin(Reg),
|
|
|
|
UE = MRI.use_nodbg_end();
|
2012-02-19 04:38:25 +00:00
|
|
|
UI != UE; UI.skipInstruction()) {
|
2012-02-19 03:00:30 +00:00
|
|
|
const MachineInstr* MI = &*UI;
|
|
|
|
SlotIndex InstSlot = LIS.getSlotIndexes()->getInstructionIndex(MI);
|
|
|
|
if (InstSlot > LastUse && InstSlot < OldIdx)
|
|
|
|
LastUse = InstSlot;
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
2012-02-19 03:00:30 +00:00
|
|
|
return LastUse;
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
void moveEnteringUpFrom(SlotIndex OldIdx, IntRangePair& P) {
|
|
|
|
LiveInterval* LI = P.first;
|
|
|
|
LiveRange* LR = P.second;
|
|
|
|
bool LiveThrough = LR->end > OldIdx.getRegSlot();
|
|
|
|
if (LiveThrough)
|
|
|
|
return;
|
|
|
|
SlotIndex LastUse = findLastUseBefore(LI->reg, OldIdx);
|
|
|
|
if (LastUse != NewIdx)
|
|
|
|
moveKillFlags(LI->reg, NewIdx, LastUse);
|
2012-02-19 07:13:05 +00:00
|
|
|
LR->end = LastUse.getRegSlot();
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
void moveEnteringDownFrom(SlotIndex OldIdx, IntRangePair& P) {
|
|
|
|
LiveInterval* LI = P.first;
|
|
|
|
LiveRange* LR = P.second;
|
2012-03-21 04:12:01 +00:00
|
|
|
// Extend the LiveRange if NewIdx is past the end.
|
2012-02-19 06:13:56 +00:00
|
|
|
if (NewIdx > LR->end) {
|
2012-03-21 04:12:01 +00:00
|
|
|
// Move kill flags if OldIdx was not originally the end
|
|
|
|
// (otherwise LR->end points to an invalid slot).
|
|
|
|
if (LR->end.getRegSlot() != OldIdx.getRegSlot()) {
|
|
|
|
assert(LR->end > OldIdx && "LiveRange does not cover original slot");
|
|
|
|
moveKillFlags(LI->reg, LR->end, NewIdx);
|
|
|
|
}
|
2012-02-19 06:13:56 +00:00
|
|
|
LR->end = NewIdx.getRegSlot();
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
void moveAllEnteringFrom(SlotIndex OldIdx, RangeSet& Entering) {
|
|
|
|
bool GoingUp = NewIdx < OldIdx;
|
|
|
|
|
|
|
|
if (GoingUp) {
|
|
|
|
for (RangeSet::iterator EI = Entering.begin(), EE = Entering.end();
|
|
|
|
EI != EE; ++EI)
|
|
|
|
moveEnteringUpFrom(OldIdx, *EI);
|
|
|
|
} else {
|
|
|
|
for (RangeSet::iterator EI = Entering.begin(), EE = Entering.end();
|
|
|
|
EI != EE; ++EI)
|
|
|
|
moveEnteringDownFrom(OldIdx, *EI);
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|
|
|
|
}
|
2012-02-17 21:29:41 +00:00
|
|
|
|
2012-02-19 03:00:30 +00:00
|
|
|
void moveInternalFrom(SlotIndex OldIdx, IntRangePair& P) {
|
|
|
|
LiveInterval* LI = P.first;
|
|
|
|
LiveRange* LR = P.second;
|
|
|
|
assert(OldIdx < LR->start && LR->start < OldIdx.getDeadSlot() &&
|
|
|
|
LR->end <= OldIdx.getDeadSlot() &&
|
|
|
|
"Range should be internal to OldIdx.");
|
|
|
|
LiveRange Tmp(*LR);
|
|
|
|
Tmp.start = NewIdx.getRegSlot(LR->start.isEarlyClobber());
|
|
|
|
Tmp.valno->def = Tmp.start;
|
|
|
|
Tmp.end = LR->end.isDead() ? NewIdx.getDeadSlot() : NewIdx.getRegSlot();
|
|
|
|
LI->removeRange(*LR);
|
|
|
|
LI->addRange(Tmp);
|
|
|
|
}
|
|
|
|
|
|
|
|
void moveAllInternalFrom(SlotIndex OldIdx, RangeSet& Internal) {
|
|
|
|
for (RangeSet::iterator II = Internal.begin(), IE = Internal.end();
|
|
|
|
II != IE; ++II)
|
|
|
|
moveInternalFrom(OldIdx, *II);
|
2012-02-17 21:29:41 +00:00
|
|
|
}
|
2012-02-19 03:00:30 +00:00
|
|
|
|
|
|
|
void moveExitingFrom(SlotIndex OldIdx, IntRangePair& P) {
|
|
|
|
LiveRange* LR = P.second;
|
|
|
|
assert(OldIdx < LR->start && LR->start < OldIdx.getDeadSlot() &&
|
|
|
|
"Range should start in OldIdx.");
|
|
|
|
assert(LR->end > OldIdx.getDeadSlot() && "Range should exit OldIdx.");
|
|
|
|
SlotIndex NewStart = NewIdx.getRegSlot(LR->start.isEarlyClobber());
|
|
|
|
LR->start = NewStart;
|
|
|
|
LR->valno->def = NewStart;
|
|
|
|
}
|
|
|
|
|
|
|
|
void moveAllExitingFrom(SlotIndex OldIdx, RangeSet& Exiting) {
|
|
|
|
for (RangeSet::iterator EI = Exiting.begin(), EE = Exiting.end();
|
|
|
|
EI != EE; ++EI)
|
|
|
|
moveExitingFrom(OldIdx, *EI);
|
|
|
|
}
|
|
|
|
|
2012-02-19 07:13:05 +00:00
|
|
|
void moveEnteringUpFromInto(SlotIndex OldIdx, IntRangePair& P,
|
|
|
|
BundleRanges& BR) {
|
|
|
|
LiveInterval* LI = P.first;
|
|
|
|
LiveRange* LR = P.second;
|
|
|
|
bool LiveThrough = LR->end > OldIdx.getRegSlot();
|
|
|
|
if (LiveThrough) {
|
|
|
|
assert((LR->start < NewIdx || BR[LI->reg].Def == LR) &&
|
|
|
|
"Def in bundle should be def range.");
|
|
|
|
assert((BR[LI->reg].Use == 0 || BR[LI->reg].Use == LR) &&
|
|
|
|
"If bundle has use for this reg it should be LR.");
|
|
|
|
BR[LI->reg].Use = LR;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
SlotIndex LastUse = findLastUseBefore(LI->reg, OldIdx);
|
2012-02-21 00:00:36 +00:00
|
|
|
moveKillFlags(LI->reg, OldIdx, LastUse);
|
2012-02-19 07:13:05 +00:00
|
|
|
|
|
|
|
if (LR->start < NewIdx) {
|
|
|
|
// Becoming a new entering range.
|
|
|
|
assert(BR[LI->reg].Dead == 0 && BR[LI->reg].Def == 0 &&
|
|
|
|
"Bundle shouldn't be re-defining reg mid-range.");
|
2012-02-19 12:25:07 +00:00
|
|
|
assert((BR[LI->reg].Use == 0 || BR[LI->reg].Use == LR) &&
|
2012-02-19 07:13:05 +00:00
|
|
|
"Bundle shouldn't have different use range for same reg.");
|
|
|
|
LR->end = LastUse.getRegSlot();
|
|
|
|
BR[LI->reg].Use = LR;
|
|
|
|
} else {
|
|
|
|
// Becoming a new Dead-def.
|
|
|
|
assert(LR->start == NewIdx.getRegSlot(LR->start.isEarlyClobber()) &&
|
|
|
|
"Live range starting at unexpected slot.");
|
|
|
|
assert(BR[LI->reg].Def == LR && "Reg should have def range.");
|
|
|
|
assert(BR[LI->reg].Dead == 0 &&
|
|
|
|
"Can't have def and dead def of same reg in a bundle.");
|
|
|
|
LR->end = LastUse.getDeadSlot();
|
|
|
|
BR[LI->reg].Dead = BR[LI->reg].Def;
|
|
|
|
BR[LI->reg].Def = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void moveEnteringDownFromInto(SlotIndex OldIdx, IntRangePair& P,
|
|
|
|
BundleRanges& BR) {
|
|
|
|
LiveInterval* LI = P.first;
|
|
|
|
LiveRange* LR = P.second;
|
|
|
|
if (NewIdx > LR->end) {
|
|
|
|
// Range extended to bundle. Add to bundle uses.
|
|
|
|
// Note: Currently adds kill flags to bundle start.
|
|
|
|
assert(BR[LI->reg].Use == 0 &&
|
|
|
|
"Bundle already has use range for reg.");
|
|
|
|
moveKillFlags(LI->reg, LR->end, NewIdx);
|
|
|
|
LR->end = NewIdx.getRegSlot();
|
|
|
|
BR[LI->reg].Use = LR;
|
|
|
|
} else {
|
|
|
|
assert(BR[LI->reg].Use != 0 &&
|
|
|
|
"Bundle should already have a use range for reg.");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void moveAllEnteringFromInto(SlotIndex OldIdx, RangeSet& Entering,
|
|
|
|
BundleRanges& BR) {
|
|
|
|
bool GoingUp = NewIdx < OldIdx;
|
|
|
|
|
|
|
|
if (GoingUp) {
|
|
|
|
for (RangeSet::iterator EI = Entering.begin(), EE = Entering.end();
|
|
|
|
EI != EE; ++EI)
|
|
|
|
moveEnteringUpFromInto(OldIdx, *EI, BR);
|
|
|
|
} else {
|
|
|
|
for (RangeSet::iterator EI = Entering.begin(), EE = Entering.end();
|
|
|
|
EI != EE; ++EI)
|
|
|
|
moveEnteringDownFromInto(OldIdx, *EI, BR);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void moveInternalFromInto(SlotIndex OldIdx, IntRangePair& P,
|
|
|
|
BundleRanges& BR) {
|
|
|
|
// TODO: Sane rules for moving ranges into bundles.
|
|
|
|
}
|
|
|
|
|
|
|
|
void moveAllInternalFromInto(SlotIndex OldIdx, RangeSet& Internal,
|
|
|
|
BundleRanges& BR) {
|
|
|
|
for (RangeSet::iterator II = Internal.begin(), IE = Internal.end();
|
|
|
|
II != IE; ++II)
|
|
|
|
moveInternalFromInto(OldIdx, *II, BR);
|
|
|
|
}
|
|
|
|
|
|
|
|
void moveExitingFromInto(SlotIndex OldIdx, IntRangePair& P,
|
|
|
|
BundleRanges& BR) {
|
|
|
|
LiveInterval* LI = P.first;
|
|
|
|
LiveRange* LR = P.second;
|
|
|
|
|
|
|
|
assert(LR->start.isRegister() &&
|
|
|
|
"Don't know how to merge exiting ECs into bundles yet.");
|
|
|
|
|
|
|
|
if (LR->end > NewIdx.getDeadSlot()) {
|
|
|
|
// This range is becoming an exiting range on the bundle.
|
|
|
|
// If there was an old dead-def of this reg, delete it.
|
|
|
|
if (BR[LI->reg].Dead != 0) {
|
|
|
|
LI->removeRange(*BR[LI->reg].Dead);
|
|
|
|
BR[LI->reg].Dead = 0;
|
|
|
|
}
|
|
|
|
assert(BR[LI->reg].Def == 0 &&
|
|
|
|
"Can't have two defs for the same variable exiting a bundle.");
|
|
|
|
LR->start = NewIdx.getRegSlot();
|
|
|
|
LR->valno->def = LR->start;
|
|
|
|
BR[LI->reg].Def = LR;
|
|
|
|
} else {
|
|
|
|
// This range is becoming internal to the bundle.
|
|
|
|
assert(LR->end == NewIdx.getRegSlot() &&
|
|
|
|
"Can't bundle def whose kill is before the bundle");
|
|
|
|
if (BR[LI->reg].Dead || BR[LI->reg].Def) {
|
|
|
|
// Already have a def for this. Just delete range.
|
|
|
|
LI->removeRange(*LR);
|
|
|
|
} else {
|
|
|
|
// Make range dead, record.
|
|
|
|
LR->end = NewIdx.getDeadSlot();
|
|
|
|
BR[LI->reg].Dead = LR;
|
|
|
|
assert(BR[LI->reg].Use == LR &&
|
|
|
|
"Range becoming dead should currently be use.");
|
|
|
|
}
|
|
|
|
// In both cases the range is no longer a use on the bundle.
|
|
|
|
BR[LI->reg].Use = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void moveAllExitingFromInto(SlotIndex OldIdx, RangeSet& Exiting,
|
|
|
|
BundleRanges& BR) {
|
|
|
|
for (RangeSet::iterator EI = Exiting.begin(), EE = Exiting.end();
|
|
|
|
EI != EE; ++EI)
|
|
|
|
moveExitingFromInto(OldIdx, *EI, BR);
|
|
|
|
}
|
|
|
|
|
2012-02-17 18:44:18 +00:00
|
|
|
};
|
|
|
|
|
2012-02-17 23:43:40 +00:00
|
|
|
void LiveIntervals::handleMove(MachineInstr* MI) {
|
2012-06-04 22:39:14 +00:00
|
|
|
SlotIndex OldIndex = Indexes->getInstructionIndex(MI);
|
|
|
|
Indexes->removeMachineInstrFromMaps(MI);
|
2012-02-17 23:43:40 +00:00
|
|
|
SlotIndex NewIndex = MI->isInsideBundle() ?
|
2012-06-04 22:39:14 +00:00
|
|
|
Indexes->getInstructionIndex(MI) :
|
|
|
|
Indexes->insertMachineInstrInMaps(MI);
|
2012-02-17 23:43:40 +00:00
|
|
|
assert(getMBBStartIdx(MI->getParent()) <= OldIndex &&
|
|
|
|
OldIndex < getMBBEndIdx(MI->getParent()) &&
|
2012-02-17 18:44:18 +00:00
|
|
|
"Cannot handle moves across basic block boundaries.");
|
2012-02-17 23:43:40 +00:00
|
|
|
assert(!MI->isBundled() && "Can't handle bundled instructions yet.");
|
2012-02-17 18:44:18 +00:00
|
|
|
|
2012-06-04 22:39:14 +00:00
|
|
|
HMEditor HME(*this, *MRI, *TRI, NewIndex);
|
2012-02-21 22:29:38 +00:00
|
|
|
HME.moveAllRangesFrom(MI, OldIndex);
|
|
|
|
}
|
|
|
|
|
|
|
|
void LiveIntervals::handleMoveIntoBundle(MachineInstr* MI, MachineInstr* BundleStart) {
|
2012-06-04 22:39:14 +00:00
|
|
|
SlotIndex NewIndex = Indexes->getInstructionIndex(BundleStart);
|
|
|
|
HMEditor HME(*this, *MRI, *TRI, NewIndex);
|
2012-02-21 22:29:38 +00:00
|
|
|
HME.moveAllRangesInto(MI, BundleStart);
|
2012-02-17 18:44:18 +00:00
|
|
|
}
|