diff options
| -rw-r--r-- | lib/CodeGen/SelectionDAG/LatencyPriorityQueue.cpp | 2 | ||||
| -rw-r--r-- | lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/lib/CodeGen/SelectionDAG/LatencyPriorityQueue.cpp b/lib/CodeGen/SelectionDAG/LatencyPriorityQueue.cpp index 6c8edf1..ae73f20 100644 --- a/lib/CodeGen/SelectionDAG/LatencyPriorityQueue.cpp +++ b/lib/CodeGen/SelectionDAG/LatencyPriorityQueue.cpp @@ -150,7 +150,7 @@ void LatencyPriorityQueue::ScheduledNode(SUnit *SU) { /// scheduled will make this node available, so it is better than some other /// node of the same priority that will not make a node available. void LatencyPriorityQueue::AdjustPriorityOfUnscheduledPreds(SUnit *SU) { - if (SU->isPending) return; // All preds scheduled. + if (SU->isAvailable) return; // All preds scheduled. SUnit *OnlyAvailablePred = getSingleUnscheduledPred(SU); if (OnlyAvailablePred == 0 || !OnlyAvailablePred->isAvailable) return; diff --git a/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp b/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp index fb01375..f22812f 100644 --- a/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp +++ b/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp @@ -164,7 +164,7 @@ void ScheduleDAGList::ListScheduleTopDown() { // It is available if it has no predecessors. if (SUnits[i].Preds.empty()) { AvailableQueue->push(&SUnits[i]); - SUnits[i].isAvailable = SUnits[i].isPending = true; + SUnits[i].isAvailable = true; } } |