Let's try ignoring resource utilization on the backward pass.

llvm-svn: 24231
2005-11-07 19:08:53 +00:00 · 2005-11-07 19:08:53 +00:00 · 1d2f26adcc
parent 3c1c8c55c3
commit 1d2f26adcc
1 changed files with 2 additions and 0 deletions
--- a/llvm/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
+++ b/llvm/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
@ -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;