RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-02-05 03:36:43 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Pull some code out of a hot recursive function because the common case doesn't

Browse Source 
need recursion.

llvm-svn: 30015
This commit is contained in:
Chris Lattner 2006-09-01 07:00:23 +00:00
parent 89a7eadf22
commit fc38415ddc
1 changed files with 19 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
lib/CodeGen/LiveIntervalAnalysis.cpp
View File

@ -857,7 +857,7 @@ static unsigned ComputeUltimateVN(unsigned VN,
// If the VN has already been computed, just return it. // If the VN has already been computed, just return it.
if (ThisValNoAssignments[VN] >= 0) if (ThisValNoAssignments[VN] >= 0)
return ThisValNoAssignments[VN]; return ThisValNoAssignments[VN];
assert(ThisValNoAssignments[VN] != -2 && "FIXME: Cyclic case, handle it!"); // assert(ThisValNoAssignments[VN] != -2 && "Cyclic case?");
// If this val is not a copy from the other val, then it must be a new value // If this val is not a copy from the other val, then it must be a new value
// number in the destination. // number in the destination.
@ -867,9 +867,13 @@ static unsigned ComputeUltimateVN(unsigned VN,
return ThisValNoAssignments[VN] = ValueNumberInfo.size()-1; return ThisValNoAssignments[VN] = ValueNumberInfo.size()-1;
} }
// Otherwise, this *is* a copy from the RHS. Mark this value number as // Otherwise, this *is* a copy from the RHS. If the other side has already
// currently being computed, then ask what the ultimate value # of the other // been computed, return it.
// value is. if (OtherValNoAssignments[OtherValNo] >= 0)
return ThisValNoAssignments[VN] = OtherValNoAssignments[OtherValNo];
// Mark this value number as currently being computed, then ask what the
// ultimate value # of the other value is.
ThisValNoAssignments[VN] = -2; ThisValNoAssignments[VN] = -2;
unsigned UltimateVN = unsigned UltimateVN =
ComputeUltimateVN(OtherValNo, ValueNumberInfo, ComputeUltimateVN(OtherValNo, ValueNumberInfo,
@ -989,13 +993,22 @@ bool LiveIntervals::JoinIntervals(LiveInterval &LHS, LiveInterval &RHS) {
} }
for (unsigned VN = 0, e = LHS.getNumValNums(); VN != e; ++VN) { for (unsigned VN = 0, e = LHS.getNumValNums(); VN != e; ++VN) {
if (LHS.getInstForValNum(VN) == ~2U) continue; if (LHSValNoAssignments[VN] >= 0 || LHS.getInstForValNum(VN) == ~2U)
continue;
ComputeUltimateVN(VN, ValueNumberInfo, ComputeUltimateVN(VN, ValueNumberInfo,
LHSValsDefinedFromRHS, RHSValsDefinedFromLHS, LHSValsDefinedFromRHS, RHSValsDefinedFromLHS,
LHSValNoAssignments, RHSValNoAssignments, LHS, RHS); LHSValNoAssignments, RHSValNoAssignments, LHS, RHS);
} }
for (unsigned VN = 0, e = RHS.getNumValNums(); VN != e; ++VN) { for (unsigned VN = 0, e = RHS.getNumValNums(); VN != e; ++VN) {
if (RHS.getInstForValNum(VN) == ~2U) continue; if (RHSValNoAssignments[VN] >= 0 || RHS.getInstForValNum(VN) == ~2U)
continue;
// If this value number isn't a copy from the LHS, it's a new number.
if (RHSValsDefinedFromLHS[VN] == -1) {
ValueNumberInfo.push_back(RHS.getValNumInfo(VN));
RHSValNoAssignments[VN] = ValueNumberInfo.size()-1;
continue;
}
ComputeUltimateVN(VN, ValueNumberInfo, ComputeUltimateVN(VN, ValueNumberInfo,
RHSValsDefinedFromLHS, LHSValsDefinedFromRHS, RHSValsDefinedFromLHS, LHSValsDefinedFromRHS,
RHSValNoAssignments, LHSValNoAssignments, RHS, LHS); RHSValNoAssignments, LHSValNoAssignments, RHS, LHS);