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

diff --git a/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp b/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
index 1666f4358ad46c03688442c6c5ff08586cc3f63e..9a5e18982d47266eb57f52fddcbfa3987566b0bb 100644 (file)
--- a/lib/CodeGen/SelectionDAG/ScheduleDAG.cpp
+++ b/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;