mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-20 03:23:01 +02:00
Move a DenseMap's declaration outside of a loop, and just call
clear() on each iteration. This avoids allocating and deallocating all of DenseMap's memory on each iteration. llvm-svn: 52642
This commit is contained in:
parent
a989f4f916
commit
71a0e81d0b
@ -953,10 +953,11 @@ void ScheduleDAGRRList::ListScheduleBottomUp() {
|
||||
// While Available queue is not empty, grab the node with the highest
|
||||
// priority. If it is not ready put it back. Schedule the node.
|
||||
SmallVector<SUnit*, 4> NotReady;
|
||||
DenseMap<SUnit*, SmallVector<unsigned, 4> > LRegsMap;
|
||||
Sequence.reserve(SUnits.size());
|
||||
while (!AvailableQueue->empty()) {
|
||||
bool Delayed = false;
|
||||
DenseMap<SUnit*, SmallVector<unsigned, 4> > LRegsMap;
|
||||
LRegsMap.clear();
|
||||
SUnit *CurSU = AvailableQueue->pop();
|
||||
while (CurSU) {
|
||||
if (CurSU->CycleBound <= CurCycle) {
|
||||
|
Loading…
Reference in New Issue
Block a user