commit 1d2f26adcc6b8cf88d268ad5896700ee1c96a897
author Jim Laskey <jlaskey@mac.com> Mon Nov 07 19:08:53 2005 +0000
committer Jim Laskey <jlaskey@mac.com> Mon Nov 07 19:08:53 2005 +0000
tree 63fc14b82b792f61090699d7a97ca45dc7d7df1e
parent 3c1c8c55c33644e1e1a6e04f6d74184ab2e03898

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

llvm-svn: 24231

llvm/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp

diff --git a/llvm/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp b/llvm/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
index 1666f43..9a5e189 100644
--- a/llvm/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
+++ b/llvm/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
@@ -908,9 +908,11 @@
     // 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;