commit 26b91ebb63b29c94b3803b15ff1e6929f135caec
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 25785fe1d4d1d709b7510c728d9bc48237325197
parent d525df3c27d8631c5d46b063e4984d6404875f14

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


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@24231 91177308-0d34-0410-b5e6-96231b3b80d8

lib/CodeGen/SelectionDAG/ScheduleDAG.cpp

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