Change live interval representation. Machine instructions now have two

slots each. As a concequence they get numbered as 0, 2, 4 and so
on. The first slot is used for operand uses and the second for
defs. Here's an example:

0: A = ...
2: B = ...
4: C = A + B ;; last use of A

The live intervals should look like:

A = [1, 5)
B = [3, x)
C = [5, y)


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@11141 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Alkis Evlogimenos
2004-02-05 22:55:25 +00:00
parent 3e0b870def
commit 0b8cb2bc47

View File

@ -94,7 +94,7 @@ bool LiveIntervals::runOnMachineFunction(MachineFunction &fn) {
mi != miEnd; ++mi) { mi != miEnd; ++mi) {
inserted = mi2iMap_.insert(std::make_pair(*mi, miIndex)).second; inserted = mi2iMap_.insert(std::make_pair(*mi, miIndex)).second;
assert(inserted && "multiple MachineInstr -> index mappings"); assert(inserted && "multiple MachineInstr -> index mappings");
++miIndex; miIndex += 2;
} }
} }
@ -150,8 +150,6 @@ void LiveIntervals::handleVirtualRegisterDef(MachineBasicBlock* mbb,
{ {
DEBUG(std::cerr << "\t\tregister: ";printRegName(reg); std::cerr << '\n'); DEBUG(std::cerr << "\t\tregister: ";printRegName(reg); std::cerr << '\n');
unsigned instrIndex = getInstructionIndex(*mi);
LiveVariables::VarInfo& vi = lv_->getVarInfo(reg); LiveVariables::VarInfo& vi = lv_->getVarInfo(reg);
Interval* interval = 0; Interval* interval = 0;
@ -180,6 +178,10 @@ void LiveIntervals::handleVirtualRegisterDef(MachineBasicBlock* mbb,
interval = &*r2iit->second; interval = &*r2iit->second;
} }
// we consider defs to happen at the second time slot of the
// instruction
unsigned instrIndex = getInstructionIndex(*mi) + 1;
bool killedInDefiningBasicBlock = false; bool killedInDefiningBasicBlock = false;
for (int i = 0, e = vi.Kills.size(); i != e; ++i) { for (int i = 0, e = vi.Kills.size(); i != e; ++i) {
MachineBasicBlock* killerBlock = vi.Kills[i].first; MachineBasicBlock* killerBlock = vi.Kills[i].first;
@ -187,7 +189,9 @@ void LiveIntervals::handleVirtualRegisterDef(MachineBasicBlock* mbb,
unsigned start = (mbb == killerBlock ? unsigned start = (mbb == killerBlock ?
instrIndex : instrIndex :
getInstructionIndex(killerBlock->front())); getInstructionIndex(killerBlock->front()));
unsigned end = getInstructionIndex(killerInstr) + 1; unsigned end = (killerInstr == *mi ?
instrIndex + 1 : // dead
getInstructionIndex(killerInstr) + 1); // killed
// we do not want to add invalid ranges. these can happen when // we do not want to add invalid ranges. these can happen when
// a variable has its latest use and is redefined later on in // a variable has its latest use and is redefined later on in
// the same basic block (common with variables introduced by // the same basic block (common with variables introduced by
@ -213,14 +217,17 @@ void LiveIntervals::handlePhysicalRegisterDef(MachineBasicBlock* mbb,
DEBUG(std::cerr << "\t\tregister: "; printRegName(reg)); DEBUG(std::cerr << "\t\tregister: "; printRegName(reg));
MachineBasicBlock::iterator e = mbb->end(); MachineBasicBlock::iterator e = mbb->end();
unsigned start = getInstructionIndex(*mi); // we consider defs to happen at the second time slot of the
unsigned end = start + 1; // instruction
unsigned start, end;
start = end = getInstructionIndex(*mi) + 1;
// a variable can be dead by the instruction defining it // a variable can be dead by the instruction defining it
for (KillIter ki = lv_->dead_begin(*mi), ke = lv_->dead_end(*mi); for (KillIter ki = lv_->dead_begin(*mi), ke = lv_->dead_end(*mi);
ki != ke; ++ki) { ki != ke; ++ki) {
if (reg == ki->second) { if (reg == ki->second) {
DEBUG(std::cerr << " dead\n"); DEBUG(std::cerr << " dead\n");
++end;
goto exit; goto exit;
} }
} }
@ -228,7 +235,7 @@ void LiveIntervals::handlePhysicalRegisterDef(MachineBasicBlock* mbb,
// a variable can only be killed by subsequent instructions // a variable can only be killed by subsequent instructions
do { do {
++mi; ++mi;
++end; end += 2;
for (KillIter ki = lv_->killed_begin(*mi), ke = lv_->killed_end(*mi); for (KillIter ki = lv_->killed_begin(*mi), ke = lv_->killed_end(*mi);
ki != ke; ++ki) { ki != ke; ++ki) {
if (reg == ki->second) { if (reg == ki->second) {
@ -437,15 +444,17 @@ LiveIntervals::Interval::Interval(unsigned r)
} }
// This example is provided becaues liveAt() is non-obvious: // An example for liveAt():
// //
// this = [1,2), liveAt(1) will return false. The idea is that the // this = [1,2), liveAt(0) will return false. The instruction defining
// variable is defined in 1 and not live after definition. So it was // this spans slots [0,1]. Since it is a definition we say that it is
// dead to begin with (defined but never used). // live in the second slot onwards. By ending the lifetime of this
// interval at 2 it means that it is not used at all. liveAt(1)
// returns true which means that this clobbers a register at
// instruction at 0.
// //
// this = [1,3), liveAt(2) will return false. The variable is used at // this = [1,4), liveAt(0) will return false and liveAt(2) will return
// 2 but 2 is the last use so the variable's allocated register is // true. The variable is defined at instruction 0 and last used at 2.
// available for reuse.
bool LiveIntervals::Interval::liveAt(unsigned index) const bool LiveIntervals::Interval::liveAt(unsigned index) const
{ {
Range dummy(index, index+1); Range dummy(index, index+1);
@ -456,20 +465,20 @@ bool LiveIntervals::Interval::liveAt(unsigned index) const
return false; return false;
--r; --r;
return index >= r->first && index < (r->second - 1); return index >= r->first && index < r->second;
} }
// This example is provided because overlaps() is non-obvious: // An example for overlaps():
// //
// 0: A = ... // 0: A = ...
// 1: B = ... // 2: B = ...
// 2: C = A + B ;; last use of A // 4: C = A + B ;; last use of A
// //
// The live intervals should look like: // The live intervals should look like:
// //
// A = [0, 3) // A = [1, 5)
// B = [1, x) // B = [3, x)
// C = [2, y) // C = [5, y)
// //
// A->overlaps(C) should return false since we want to be able to join // A->overlaps(C) should return false since we want to be able to join
// A and C. // A and C.
@ -499,7 +508,7 @@ bool LiveIntervals::Interval::overlaps(const Interval& other) const
} }
assert(i->first < j->first); assert(i->first < j->first);
if ((i->second - 1) > j->first) { if (i->second > j->first) {
return true; return true;
} }
else { else {