We don't need to sort the added vector as unhandled intervals are

stored in a binary heap.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@16143 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Alkis Evlogimenos 2004-09-02 18:00:38 +00:00
parent b7a8f2cdaa
commit 82b4955f96

View File

@ -515,7 +515,6 @@ void RA::assignRegOrStackSlotAtInterval(LiveInterval* cur)
}
}
std::sort(added.begin(), added.end(), less_ptr<LiveInterval>());
// merge added with unhandled
for (unsigned i = 0, e = added.size(); i != e; ++i)
unhandled_.push(added[i]);