diff options
| author | Dan Gohman <gohman@apple.com> | 2009-01-16 21:37:14 +0000 |
|---|---|---|
| committer | Dan Gohman <gohman@apple.com> | 2009-01-16 21:37:14 +0000 |
| commit | 8554449e311e50f2e96db1081a17ccf7151ef7f6 (patch) | |
| tree | 0ac77b0f9cad33eca0f956603106c710545172db | |
| parent | febf71db2db61b8c7bac2ddffba8f1d5d1a95cb9 (diff) | |
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
| -rw-r--r-- | lib/CodeGen/PostRASchedulerList.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/CodeGen/PostRASchedulerList.cpp b/lib/CodeGen/PostRASchedulerList.cpp index b7bfe3fefd..12d9efa87b 100644 --- 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. |