RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-02-01 13:11:39 +01:00
Code Issues Projects Releases Wiki Activity

Avoid moving iterators when the previous block was just visited.

Browse Source 
llvm-svn: 129081
This commit is contained in:
Jakob Stoklund Olesen 2011-04-07 17:27:50 +00:00
parent 1791098020
commit aace1636b6
1 changed files with 13 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
lib/CodeGen/InterferenceCache.cpp
View File

@ -99,13 +99,15 @@ void InterferenceCache::Entry::update(unsigned MBBNum) {
tie(Start, Stop) = Indexes->getMBBRange(MBBNum); tie(Start, Stop) = Indexes->getMBBRange(MBBNum);
// Use advanceTo only when possible. // Use advanceTo only when possible.
if (!PrevPos.isValid() || Start < PrevPos) if (PrevPos != Start) {
for (unsigned i = 0, e = Iters.size(); i != e; ++i) if (!PrevPos.isValid() || Start < PrevPos)
Iters[i].find(Start); for (unsigned i = 0, e = Iters.size(); i != e; ++i)
else Iters[i].find(Start);
for (unsigned i = 0, e = Iters.size(); i != e; ++i) else
Iters[i].advanceTo(Start); for (unsigned i = 0, e = Iters.size(); i != e; ++i)
PrevPos = Start; Iters[i].advanceTo(Start);
PrevPos = Start;
}
// Check for first interference. // Check for first interference.
for (unsigned i = 0, e = Iters.size(); i != e; ++i) { for (unsigned i = 0, e = Iters.size(); i != e; ++i) {
@ -129,11 +131,14 @@ void InterferenceCache::Entry::update(unsigned MBBNum) {
if (!I.valid() || I.start() >= Stop) if (!I.valid() || I.start() >= Stop)
continue; continue;
I.advanceTo(Stop); I.advanceTo(Stop);
if (!I.valid() || I.start() >= Stop) bool Backup = !I.valid() || I.start() >= Stop;
if (Backup)
--I; --I;
SlotIndex StopI = I.stop(); SlotIndex StopI = I.stop();
if (!BI->Last.isValid() || StopI > BI->Last) if (!BI->Last.isValid() || StopI > BI->Last)
BI->Last = StopI; BI->Last = StopI;
if (Backup)
++I;
} }
PrevPos = Stop; PrevPos = Stop;
} }