mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 19:52:54 +01:00
Let's try ignoring resource utilization on the backward pass.
llvm-svn: 24231
This commit is contained in:
parent
fb806bb309
commit
0c65e09865
@ -908,9 +908,11 @@ void SimpleSched::ScheduleBackward() {
|
||||
// If independent of others (or first entry)
|
||||
if (Slot == NotFound) Slot = 0;
|
||||
|
||||
#if 0 // FIXME - measure later
|
||||
// Find a slot where the needed resources are available
|
||||
if (NI->StageBegin != NI->StageEnd)
|
||||
Slot = Tally.FindAndReserve(Slot, NI->StageBegin, NI->StageEnd);
|
||||
#endif
|
||||
|
||||
// Set node slot
|
||||
NI->Slot = Slot;
|
||||
|
Loading…
Reference in New Issue
Block a user