Fix the check for an empty basic block to check for an empty SUnits

array instead, since this is what the scheduler actually cares about.
And remove a check that is unnecessary, since it can assume that
SUnits isn't empty.

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

diff --git a/lib/CodeGen/PostRASchedulerList.cpp b/lib/CodeGen/PostRASchedulerList.cpp
index b7bfe3fefd9d39beea97f2a3ee33e6cb8d0666a0..12d9efa87b4c0da46dd261845868845d3fadd5d1 100644 (file)
--- a/lib/CodeGen/PostRASchedulerList.cpp
+++ b/lib/CodeGen/PostRASchedulerList.cpp
@@ -264,7 +264,7 @@ static SDep *CriticalPathStep(SUnit *SU) {
 bool SchedulePostRATDList::BreakAntiDependencies() {
   // The code below assumes that there is at least one instruction,
   // so just duck out immediately if the block is empty.
-  if (BB->empty()) return false;
+  if (SUnits.empty()) return false;
 
   // Find the node at the bottom of the critical path.
   SUnit *Max = 0;
@@ -275,7 +275,7 @@ bool SchedulePostRATDList::BreakAntiDependencies() {
   }
 
   DOUT << "Critical path has total latency "
-       << (Max ? Max->getDepth() + Max->Latency : 0) << "\n";
+       << (Max->getDepth() + Max->Latency) << "\n";
 
   // Track progress along the critical path through the SUnit graph as we walk
   // the instructions.