mirror of
https://github.com/RPCS3/llvm.git
synced 2024-11-30 07:00:57 +00:00
Recover most of the compile time regression due to recent live interval changes.
1. Eliminate the costly live interval "swapping". 2. Change ValueNumberInfo container from SmallVector to std::vector. The former performs slowly when the vector size is very large. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41536 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
51195af45f
commit
1a66f0a4f2
@ -99,14 +99,19 @@ namespace llvm {
|
|||||||
VNInfo() : def(~1U), reg(0) {}
|
VNInfo() : def(~1U), reg(0) {}
|
||||||
VNInfo(unsigned d, unsigned r) : def(d), reg(r) {}
|
VNInfo(unsigned d, unsigned r) : def(d), reg(r) {}
|
||||||
};
|
};
|
||||||
private:
|
|
||||||
SmallVector<VNInfo, 4> ValueNumberInfo;
|
|
||||||
public:
|
|
||||||
|
|
||||||
|
typedef std::vector<VNInfo> VNInfoList;
|
||||||
|
VNInfoList ValueNumberInfo;
|
||||||
|
|
||||||
|
public:
|
||||||
LiveInterval(unsigned Reg, float Weight)
|
LiveInterval(unsigned Reg, float Weight)
|
||||||
: reg(Reg), preference(0), weight(Weight) {
|
: reg(Reg), preference(0), weight(Weight) {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
~LiveInterval() {
|
||||||
|
ValueNumberInfo.clear();
|
||||||
|
}
|
||||||
|
|
||||||
typedef Ranges::iterator iterator;
|
typedef Ranges::iterator iterator;
|
||||||
iterator begin() { return ranges.begin(); }
|
iterator begin() { return ranges.begin(); }
|
||||||
iterator end() { return ranges.end(); }
|
iterator end() { return ranges.end(); }
|
||||||
@ -115,6 +120,13 @@ namespace llvm {
|
|||||||
const_iterator begin() const { return ranges.begin(); }
|
const_iterator begin() const { return ranges.begin(); }
|
||||||
const_iterator end() const { return ranges.end(); }
|
const_iterator end() const { return ranges.end(); }
|
||||||
|
|
||||||
|
typedef VNInfoList::iterator vni_iterator;
|
||||||
|
vni_iterator vni_begin() { return ValueNumberInfo.begin(); }
|
||||||
|
vni_iterator vni_end() { return ValueNumberInfo.end(); }
|
||||||
|
|
||||||
|
typedef VNInfoList::const_iterator const_vni_iterator;
|
||||||
|
const_vni_iterator vni_begin() const { return ValueNumberInfo.begin(); }
|
||||||
|
const_vni_iterator vni_end() const { return ValueNumberInfo.end(); }
|
||||||
|
|
||||||
/// advanceTo - Advance the specified iterator to point to the LiveRange
|
/// advanceTo - Advance the specified iterator to point to the LiveRange
|
||||||
/// containing the specified position, or end() if the position is past the
|
/// containing the specified position, or end() if the position is past the
|
||||||
@ -128,17 +140,37 @@ namespace llvm {
|
|||||||
return I;
|
return I;
|
||||||
}
|
}
|
||||||
|
|
||||||
void swap(LiveInterval& other) {
|
|
||||||
std::swap(reg, other.reg);
|
|
||||||
std::swap(weight, other.weight);
|
|
||||||
std::swap(ranges, other.ranges);
|
|
||||||
std::swap(ValueNumberInfo, other.ValueNumberInfo);
|
|
||||||
}
|
|
||||||
|
|
||||||
bool containsOneValue() const { return ValueNumberInfo.size() == 1; }
|
bool containsOneValue() const { return ValueNumberInfo.size() == 1; }
|
||||||
|
|
||||||
unsigned getNumValNums() const { return ValueNumberInfo.size(); }
|
unsigned getNumValNums() const { return ValueNumberInfo.size(); }
|
||||||
|
|
||||||
|
/// getValNumInfo - Returns a copy of the specified val#.
|
||||||
|
///
|
||||||
|
inline VNInfo& getValNumInfo(unsigned ValNo) {
|
||||||
|
return ValueNumberInfo[ValNo];
|
||||||
|
}
|
||||||
|
inline const VNInfo& getValNumInfo(unsigned ValNo) const {
|
||||||
|
return ValueNumberInfo[ValNo];
|
||||||
|
}
|
||||||
|
|
||||||
|
/// copyValNumInfo - Copy the value number info for one value number to
|
||||||
|
/// another.
|
||||||
|
void copyValNumInfo(unsigned DstValNo, unsigned SrcValNo) {
|
||||||
|
VNInfo &vnd = getValNumInfo(DstValNo);
|
||||||
|
const VNInfo &vns = getValNumInfo(SrcValNo);
|
||||||
|
vnd.def = vns.def;
|
||||||
|
vnd.reg = vns.reg;
|
||||||
|
vnd.kills = vns.kills;
|
||||||
|
}
|
||||||
|
void copyValNumInfo(unsigned DstValNo, const LiveInterval &SrcLI,
|
||||||
|
unsigned SrcValNo) {
|
||||||
|
VNInfo &vnd = getValNumInfo(DstValNo);
|
||||||
|
const VNInfo &vns = SrcLI.getValNumInfo(SrcValNo);
|
||||||
|
vnd.def = vns.def;
|
||||||
|
vnd.reg = vns.reg;
|
||||||
|
vnd.kills = vns.kills;
|
||||||
|
}
|
||||||
|
|
||||||
/// getNextValue - Create a new value number and return it. MIIdx specifies
|
/// getNextValue - Create a new value number and return it. MIIdx specifies
|
||||||
/// the instruction that defines the value number.
|
/// the instruction that defines the value number.
|
||||||
unsigned getNextValue(unsigned MIIdx, unsigned SrcReg) {
|
unsigned getNextValue(unsigned MIIdx, unsigned SrcReg) {
|
||||||
@ -149,44 +181,38 @@ namespace llvm {
|
|||||||
/// getDefForValNum - Return the machine instruction index that defines the
|
/// getDefForValNum - Return the machine instruction index that defines the
|
||||||
/// specified value number.
|
/// specified value number.
|
||||||
unsigned getDefForValNum(unsigned ValNo) const {
|
unsigned getDefForValNum(unsigned ValNo) const {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
return getValNumInfo(ValNo).def;
|
||||||
return ValueNumberInfo[ValNo].def;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// getSrcRegForValNum - If the machine instruction that defines the
|
/// getSrcRegForValNum - If the machine instruction that defines the
|
||||||
/// specified value number is a copy, returns the source register. Otherwise,
|
/// specified value number is a copy, returns the source register. Otherwise,
|
||||||
/// returns zero.
|
/// returns zero.
|
||||||
unsigned getSrcRegForValNum(unsigned ValNo) const {
|
unsigned getSrcRegForValNum(unsigned ValNo) const {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
return getValNumInfo(ValNo).reg;
|
||||||
return ValueNumberInfo[ValNo].reg;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// setDefForValNum - Set the machine instruction index that defines the
|
/// setDefForValNum - Set the machine instruction index that defines the
|
||||||
/// specified value number.
|
/// specified value number.
|
||||||
void setDefForValNum(unsigned ValNo, unsigned NewDef) {
|
void setDefForValNum(unsigned ValNo, unsigned NewDef) {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
getValNumInfo(ValNo).def = NewDef;
|
||||||
ValueNumberInfo[ValNo].def = NewDef;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// setSrcRegForValNum - Set the source register of the specified value
|
/// setSrcRegForValNum - Set the source register of the specified value
|
||||||
/// number.
|
/// number.
|
||||||
void setSrcRegForValNum(unsigned ValNo, unsigned NewReg) {
|
void setSrcRegForValNum(unsigned ValNo, unsigned NewReg) {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
getValNumInfo(ValNo).reg = NewReg;
|
||||||
ValueNumberInfo[ValNo].reg = NewReg;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// getKillsForValNum - Return the kill instruction indexes of the specified
|
/// getKillsForValNum - Return the kill instruction indexes of the specified
|
||||||
/// value number.
|
/// value number.
|
||||||
const SmallVector<unsigned, 4> &getKillsForValNum(unsigned ValNo) const {
|
const SmallVector<unsigned, 4> &getKillsForValNum(unsigned ValNo) const {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
return getValNumInfo(ValNo).kills;
|
||||||
return ValueNumberInfo[ValNo].kills;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// addKillForValNum - Add a kill instruction index to the specified value
|
/// addKillForValNum - Add a kill instruction index to the specified value
|
||||||
/// number.
|
/// number.
|
||||||
void addKillForValNum(unsigned ValNo, unsigned KillIdx) {
|
void addKillForValNum(unsigned ValNo, unsigned KillIdx) {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
SmallVector<unsigned, 4> &kills = getValNumInfo(ValNo).kills;
|
||||||
SmallVector<unsigned, 4> &kills = ValueNumberInfo[ValNo].kills;
|
|
||||||
if (kills.empty()) {
|
if (kills.empty()) {
|
||||||
kills.push_back(KillIdx);
|
kills.push_back(KillIdx);
|
||||||
} else {
|
} else {
|
||||||
@ -213,14 +239,13 @@ namespace llvm {
|
|||||||
/// the specified value number.
|
/// the specified value number.
|
||||||
void addKillsForValNum(unsigned ValNo,
|
void addKillsForValNum(unsigned ValNo,
|
||||||
const SmallVector<unsigned, 4> &kills) {
|
const SmallVector<unsigned, 4> &kills) {
|
||||||
addKills(ValueNumberInfo[ValNo], kills);
|
addKills(getValNumInfo(ValNo), kills);
|
||||||
}
|
}
|
||||||
|
|
||||||
/// isKillForValNum - Returns true if KillIdx is a kill of the specified
|
/// isKillForValNum - Returns true if KillIdx is a kill of the specified
|
||||||
/// val#.
|
/// val#.
|
||||||
bool isKillForValNum(unsigned ValNo, unsigned KillIdx) const {
|
bool isKillForValNum(unsigned ValNo, unsigned KillIdx) const {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
const SmallVector<unsigned, 4> &kills = getValNumInfo(ValNo).kills;
|
||||||
const SmallVector<unsigned, 4> &kills = ValueNumberInfo[ValNo].kills;
|
|
||||||
SmallVector<unsigned, 4>::const_iterator
|
SmallVector<unsigned, 4>::const_iterator
|
||||||
I = std::lower_bound(kills.begin(), kills.end(), KillIdx);
|
I = std::lower_bound(kills.begin(), kills.end(), KillIdx);
|
||||||
if (I == kills.end())
|
if (I == kills.end())
|
||||||
@ -244,15 +269,13 @@ namespace llvm {
|
|||||||
/// removeKillForValNum - Remove the specified kill from the list of kills
|
/// removeKillForValNum - Remove the specified kill from the list of kills
|
||||||
/// of the specified val#.
|
/// of the specified val#.
|
||||||
bool removeKillForValNum(unsigned ValNo, unsigned KillIdx) {
|
bool removeKillForValNum(unsigned ValNo, unsigned KillIdx) {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
return removeKill(getValNumInfo(ValNo), KillIdx);
|
||||||
return removeKill(ValueNumberInfo[ValNo], KillIdx);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// removeKillForValNum - Remove all the kills in specified range
|
/// removeKillForValNum - Remove all the kills in specified range
|
||||||
/// [Start, End] of the specified val#.
|
/// [Start, End] of the specified val#.
|
||||||
void removeKillForValNum(unsigned ValNo, unsigned Start, unsigned End) {
|
void removeKillForValNum(unsigned ValNo, unsigned Start, unsigned End) {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
SmallVector<unsigned, 4> &kills = getValNumInfo(ValNo).kills;
|
||||||
SmallVector<unsigned, 4> &kills = ValueNumberInfo[ValNo].kills;
|
|
||||||
SmallVector<unsigned, 4>::iterator
|
SmallVector<unsigned, 4>::iterator
|
||||||
I = std::lower_bound(kills.begin(), kills.end(), Start);
|
I = std::lower_bound(kills.begin(), kills.end(), Start);
|
||||||
SmallVector<unsigned, 4>::iterator
|
SmallVector<unsigned, 4>::iterator
|
||||||
@ -278,32 +301,9 @@ namespace llvm {
|
|||||||
bool replaceKillForValNum(unsigned ValNo, unsigned OldKill,
|
bool replaceKillForValNum(unsigned ValNo, unsigned OldKill,
|
||||||
unsigned NewKill) {
|
unsigned NewKill) {
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
assert(ValNo < ValueNumberInfo.size());
|
||||||
return replaceKill(ValueNumberInfo[ValNo], OldKill, NewKill);
|
return replaceKill(getValNumInfo(ValNo), OldKill, NewKill);
|
||||||
}
|
}
|
||||||
|
|
||||||
/// getValNumInfo - Returns a copy of the specified val#.
|
|
||||||
///
|
|
||||||
VNInfo getValNumInfo(unsigned ValNo) const {
|
|
||||||
assert(ValNo < ValueNumberInfo.size());
|
|
||||||
return ValueNumberInfo[ValNo];
|
|
||||||
}
|
|
||||||
|
|
||||||
/// setValNumInfo - Change the value number info for the specified
|
|
||||||
/// value number.
|
|
||||||
void setValNumInfo(unsigned ValNo, const VNInfo &I) {
|
|
||||||
ValueNumberInfo[ValNo] = I;
|
|
||||||
}
|
|
||||||
|
|
||||||
/// copyValNumInfo - Copy the value number info for one value number to
|
|
||||||
/// another.
|
|
||||||
void copyValNumInfo(unsigned DstValNo, unsigned SrcValNo) {
|
|
||||||
ValueNumberInfo[DstValNo] = ValueNumberInfo[SrcValNo];
|
|
||||||
}
|
|
||||||
void copyValNumInfo(unsigned DstValNo, const LiveInterval &SrcLI,
|
|
||||||
unsigned SrcValNo) {
|
|
||||||
ValueNumberInfo[DstValNo] = SrcLI.ValueNumberInfo[SrcValNo];
|
|
||||||
}
|
|
||||||
|
|
||||||
/// MergeValueNumberInto - This method is called when two value nubmers
|
/// MergeValueNumberInto - This method is called when two value nubmers
|
||||||
/// are found to be equivalent. This eliminates V1, replacing all
|
/// are found to be equivalent. This eliminates V1, replacing all
|
||||||
/// LiveRanges with the V1 value number with the V2 value number. This can
|
/// LiveRanges with the V1 value number with the V2 value number. This can
|
||||||
|
@ -105,7 +105,7 @@ namespace llvm {
|
|||||||
/// physreg, this method always canonicalizes DestInt to be it. The output
|
/// physreg, this method always canonicalizes DestInt to be it. The output
|
||||||
/// "SrcInt" will not have been modified, so we can use this information
|
/// "SrcInt" will not have been modified, so we can use this information
|
||||||
/// below to update aliases.
|
/// below to update aliases.
|
||||||
bool JoinIntervals(LiveInterval &LHS, LiveInterval &RHS);
|
bool JoinIntervals(LiveInterval &LHS, LiveInterval &RHS, bool &Swapped);
|
||||||
|
|
||||||
/// SimpleJoin - Attempt to join the specified interval into this one. The
|
/// SimpleJoin - Attempt to join the specified interval into this one. The
|
||||||
/// caller of this method must guarantee that the RHS only contains a single
|
/// caller of this method must guarantee that the RHS only contains a single
|
||||||
|
@ -288,25 +288,12 @@ LiveInterval::FindLiveRangeContaining(unsigned Idx) {
|
|||||||
void LiveInterval::join(LiveInterval &Other, int *LHSValNoAssignments,
|
void LiveInterval::join(LiveInterval &Other, int *LHSValNoAssignments,
|
||||||
int *RHSValNoAssignments,
|
int *RHSValNoAssignments,
|
||||||
SmallVector<VNInfo, 16> &NewValueNumberInfo) {
|
SmallVector<VNInfo, 16> &NewValueNumberInfo) {
|
||||||
|
|
||||||
// Try to do the least amount of work possible. In particular, if there are
|
|
||||||
// more liverange chunks in the other set than there are in the 'this' set,
|
|
||||||
// swap sets to merge the fewest chunks in possible.
|
|
||||||
//
|
|
||||||
// Also, if one range is a physreg and one is a vreg, we always merge from the
|
|
||||||
// vreg into the physreg, which leaves the vreg intervals pristine.
|
|
||||||
if ((Other.ranges.size() > ranges.size() &&
|
|
||||||
MRegisterInfo::isVirtualRegister(reg)) ||
|
|
||||||
MRegisterInfo::isPhysicalRegister(Other.reg)) {
|
|
||||||
swap(Other);
|
|
||||||
std::swap(LHSValNoAssignments, RHSValNoAssignments);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Determine if any of our live range values are mapped. This is uncommon, so
|
// Determine if any of our live range values are mapped. This is uncommon, so
|
||||||
// we want to avoid the interval scan if not.
|
// we want to avoid the interval scan if not.
|
||||||
bool MustMapCurValNos = false;
|
bool MustMapCurValNos = false;
|
||||||
for (unsigned i = 0, e = getNumValNums(); i != e; ++i) {
|
for (unsigned i = 0, e = getNumValNums(); i != e; ++i) {
|
||||||
if (ValueNumberInfo[i].def == ~1U) continue; // tombstone value #
|
if (getDefForValNum(i) == ~1U) continue; // tombstone value #
|
||||||
if (i != (unsigned)LHSValNoAssignments[i]) {
|
if (i != (unsigned)LHSValNoAssignments[i]) {
|
||||||
MustMapCurValNos = true;
|
MustMapCurValNos = true;
|
||||||
break;
|
break;
|
||||||
@ -345,7 +332,9 @@ void LiveInterval::join(LiveInterval &Other, int *LHSValNoAssignments,
|
|||||||
|
|
||||||
// Update val# info first. Increasing live ranges may invalidate some kills.
|
// Update val# info first. Increasing live ranges may invalidate some kills.
|
||||||
ValueNumberInfo.clear();
|
ValueNumberInfo.clear();
|
||||||
ValueNumberInfo.append(NewValueNumberInfo.begin(), NewValueNumberInfo.end());
|
for (SmallVector<VNInfo, 16>::iterator I = NewValueNumberInfo.begin(),
|
||||||
|
E = NewValueNumberInfo.end(); I != E; ++I)
|
||||||
|
ValueNumberInfo.push_back(*I);
|
||||||
|
|
||||||
// Okay, now insert the RHS live ranges into the LHS.
|
// Okay, now insert the RHS live ranges into the LHS.
|
||||||
iterator InsertPos = begin();
|
iterator InsertPos = begin();
|
||||||
@ -472,7 +461,7 @@ void LiveInterval::MergeValueNumberInto(unsigned V1, unsigned V2) {
|
|||||||
ValueNumberInfo.pop_back();
|
ValueNumberInfo.pop_back();
|
||||||
} while (ValueNumberInfo.back().def == ~1U);
|
} while (ValueNumberInfo.back().def == ~1U);
|
||||||
} else {
|
} else {
|
||||||
ValueNumberInfo[V1].def = ~1U;
|
setDefForValNum(V1, ~1U);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -511,22 +500,25 @@ void LiveInterval::print(std::ostream &OS, const MRegisterInfo *MRI) const {
|
|||||||
// Print value number info.
|
// Print value number info.
|
||||||
if (getNumValNums()) {
|
if (getNumValNums()) {
|
||||||
OS << " ";
|
OS << " ";
|
||||||
for (unsigned i = 0; i != getNumValNums(); ++i) {
|
unsigned vnum = 0;
|
||||||
if (i) OS << " ";
|
for (const_vni_iterator i = vni_begin(), e = vni_end(); i != e;
|
||||||
OS << i << "@";
|
++i, ++vnum) {
|
||||||
if (ValueNumberInfo[i].def == ~1U) {
|
const VNInfo &vni = *i;
|
||||||
|
if (vnum) OS << " ";
|
||||||
|
OS << vnum << "@";
|
||||||
|
if (vni.def == ~1U) {
|
||||||
OS << "x";
|
OS << "x";
|
||||||
} else {
|
} else {
|
||||||
if (ValueNumberInfo[i].def == ~0U)
|
if (vni.def == ~0U)
|
||||||
OS << "?";
|
OS << "?";
|
||||||
else
|
else
|
||||||
OS << ValueNumberInfo[i].def;
|
OS << vni.def;
|
||||||
unsigned e = ValueNumberInfo[i].kills.size();
|
unsigned ee = vni.kills.size();
|
||||||
if (e) {
|
if (ee) {
|
||||||
OS << "-(";
|
OS << "-(";
|
||||||
for (unsigned j = 0; j != e; ++j) {
|
for (unsigned j = 0; j != ee; ++j) {
|
||||||
OS << ValueNumberInfo[i].kills[j];
|
OS << vni.kills[j];
|
||||||
if (j != e-1)
|
if (j != ee-1)
|
||||||
OS << " ";
|
OS << " ";
|
||||||
}
|
}
|
||||||
OS << ")";
|
OS << ")";
|
||||||
|
@ -309,7 +309,8 @@ bool SimpleRegisterCoalescing::JoinCopy(MachineInstr *CopyMI,
|
|||||||
// Otherwise, if one of the intervals being joined is a physreg, this method
|
// Otherwise, if one of the intervals being joined is a physreg, this method
|
||||||
// always canonicalizes DstInt to be it. The output "SrcInt" will not have
|
// always canonicalizes DstInt to be it. The output "SrcInt" will not have
|
||||||
// been modified, so we can use this information below to update aliases.
|
// been modified, so we can use this information below to update aliases.
|
||||||
if (JoinIntervals(DstInt, SrcInt)) {
|
bool Swapped = false;
|
||||||
|
if (JoinIntervals(DstInt, SrcInt, Swapped)) {
|
||||||
if (isDead) {
|
if (isDead) {
|
||||||
// Result of the copy is dead. Propagate this property.
|
// Result of the copy is dead. Propagate this property.
|
||||||
if (SrcStart == 0) {
|
if (SrcStart == 0) {
|
||||||
@ -330,8 +331,8 @@ bool SimpleRegisterCoalescing::JoinCopy(MachineInstr *CopyMI,
|
|||||||
|
|
||||||
if (isShorten || isDead) {
|
if (isShorten || isDead) {
|
||||||
// Shorten the destination live interval.
|
// Shorten the destination live interval.
|
||||||
if (repSrcReg == DstInt.reg)
|
if (Swapped)
|
||||||
DstInt.removeRange(RemoveStart, RemoveEnd);
|
SrcInt.removeRange(RemoveStart, RemoveEnd);
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
// Coalescing failed.
|
// Coalescing failed.
|
||||||
@ -345,9 +346,12 @@ bool SimpleRegisterCoalescing::JoinCopy(MachineInstr *CopyMI,
|
|||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool Swapped = repSrcReg == DstInt.reg;
|
LiveInterval *ResSrcInt = &SrcInt;
|
||||||
if (Swapped)
|
LiveInterval *ResDstInt = &DstInt;
|
||||||
|
if (Swapped) {
|
||||||
std::swap(repSrcReg, repDstReg);
|
std::swap(repSrcReg, repDstReg);
|
||||||
|
std::swap(ResSrcInt, ResDstInt);
|
||||||
|
}
|
||||||
assert(MRegisterInfo::isVirtualRegister(repSrcReg) &&
|
assert(MRegisterInfo::isVirtualRegister(repSrcReg) &&
|
||||||
"LiveInterval::join didn't work right!");
|
"LiveInterval::join didn't work right!");
|
||||||
|
|
||||||
@ -356,15 +360,15 @@ bool SimpleRegisterCoalescing::JoinCopy(MachineInstr *CopyMI,
|
|||||||
// have clobbered values for this range.
|
// have clobbered values for this range.
|
||||||
if (MRegisterInfo::isPhysicalRegister(repDstReg)) {
|
if (MRegisterInfo::isPhysicalRegister(repDstReg)) {
|
||||||
// Unset unnecessary kills.
|
// Unset unnecessary kills.
|
||||||
if (!DstInt.containsOneValue()) {
|
if (!ResDstInt->containsOneValue()) {
|
||||||
for (LiveInterval::Ranges::const_iterator I = SrcInt.begin(),
|
for (LiveInterval::Ranges::const_iterator I = ResSrcInt->begin(),
|
||||||
E = SrcInt.end(); I != E; ++I)
|
E = ResSrcInt->end(); I != E; ++I)
|
||||||
unsetRegisterKills(I->start, I->end, repDstReg);
|
unsetRegisterKills(I->start, I->end, repDstReg);
|
||||||
}
|
}
|
||||||
|
|
||||||
// Update the liveintervals of sub-registers.
|
// Update the liveintervals of sub-registers.
|
||||||
for (const unsigned *AS = mri_->getSubRegisters(repDstReg); *AS; ++AS)
|
for (const unsigned *AS = mri_->getSubRegisters(repDstReg); *AS; ++AS)
|
||||||
li_->getInterval(*AS).MergeInClobberRanges(SrcInt);
|
li_->getInterval(*AS).MergeInClobberRanges(*ResSrcInt);
|
||||||
} else {
|
} else {
|
||||||
// Merge use info if the destination is a virtual register.
|
// Merge use info if the destination is a virtual register.
|
||||||
LiveVariables::VarInfo& dVI = lv_->getVarInfo(repDstReg);
|
LiveVariables::VarInfo& dVI = lv_->getVarInfo(repDstReg);
|
||||||
@ -372,7 +376,7 @@ bool SimpleRegisterCoalescing::JoinCopy(MachineInstr *CopyMI,
|
|||||||
dVI.NumUses += sVI.NumUses;
|
dVI.NumUses += sVI.NumUses;
|
||||||
}
|
}
|
||||||
|
|
||||||
DOUT << "\n\t\tJoined. Result = "; DstInt.print(DOUT, mri_);
|
DOUT << "\n\t\tJoined. Result = "; ResDstInt->print(DOUT, mri_);
|
||||||
DOUT << "\n";
|
DOUT << "\n";
|
||||||
|
|
||||||
// Remember these liveintervals have been joined.
|
// Remember these liveintervals have been joined.
|
||||||
@ -380,10 +384,6 @@ bool SimpleRegisterCoalescing::JoinCopy(MachineInstr *CopyMI,
|
|||||||
if (MRegisterInfo::isVirtualRegister(repDstReg))
|
if (MRegisterInfo::isVirtualRegister(repDstReg))
|
||||||
JoinedLIs.set(repDstReg - MRegisterInfo::FirstVirtualRegister);
|
JoinedLIs.set(repDstReg - MRegisterInfo::FirstVirtualRegister);
|
||||||
|
|
||||||
// If the intervals were swapped by Join, swap them back so that the register
|
|
||||||
// mapping (in the r2i map) is correct.
|
|
||||||
if (Swapped) SrcInt.swap(DstInt);
|
|
||||||
|
|
||||||
// repSrcReg is guarateed to be the register whose live interval that is
|
// repSrcReg is guarateed to be the register whose live interval that is
|
||||||
// being merged.
|
// being merged.
|
||||||
li_->removeInterval(repSrcReg);
|
li_->removeInterval(repSrcReg);
|
||||||
@ -586,7 +586,8 @@ bool SimpleRegisterCoalescing::SimpleJoin(LiveInterval &LHS, LiveInterval &RHS)
|
|||||||
/// physreg, this method always canonicalizes LHS to be it. The output
|
/// physreg, this method always canonicalizes LHS to be it. The output
|
||||||
/// "RHS" will not have been modified, so we can use this information
|
/// "RHS" will not have been modified, so we can use this information
|
||||||
/// below to update aliases.
|
/// below to update aliases.
|
||||||
bool SimpleRegisterCoalescing::JoinIntervals(LiveInterval &LHS, LiveInterval &RHS) {
|
bool SimpleRegisterCoalescing::JoinIntervals(LiveInterval &LHS,
|
||||||
|
LiveInterval &RHS, bool &Swapped) {
|
||||||
// Compute the final value assignment, assuming that the live ranges can be
|
// Compute the final value assignment, assuming that the live ranges can be
|
||||||
// coalesced.
|
// coalesced.
|
||||||
SmallVector<int, 16> LHSValNoAssignments;
|
SmallVector<int, 16> LHSValNoAssignments;
|
||||||
@ -815,8 +816,17 @@ bool SimpleRegisterCoalescing::JoinIntervals(LiveInterval &LHS, LiveInterval &RH
|
|||||||
|
|
||||||
// If we get here, we know that we can coalesce the live ranges. Ask the
|
// If we get here, we know that we can coalesce the live ranges. Ask the
|
||||||
// intervals to coalesce themselves now.
|
// intervals to coalesce themselves now.
|
||||||
LHS.join(RHS, &LHSValNoAssignments[0], &RHSValNoAssignments[0],
|
if ((RHS.ranges.size() > LHS.ranges.size() &&
|
||||||
ValueNumberInfo);
|
MRegisterInfo::isVirtualRegister(LHS.reg)) ||
|
||||||
|
MRegisterInfo::isPhysicalRegister(RHS.reg)) {
|
||||||
|
RHS.join(LHS, &RHSValNoAssignments[0], &LHSValNoAssignments[0],
|
||||||
|
ValueNumberInfo);
|
||||||
|
Swapped = true;
|
||||||
|
} else {
|
||||||
|
LHS.join(RHS, &LHSValNoAssignments[0], &RHSValNoAssignments[0],
|
||||||
|
ValueNumberInfo);
|
||||||
|
Swapped = false;
|
||||||
|
}
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user