From a306a8a844dbfa6d3d379ed3c8f693cca753a2dd Mon Sep 17 00:00:00 2001 From: Andrew Trick Date: Thu, 24 May 2012 23:11:17 +0000 Subject: [PATCH] misched: Use the same scheduling heuristics with -misched-topdown/bottomup. (except the part about choosing direction) llvm-svn: 157437 --- llvm/lib/CodeGen/MachineScheduler.cpp | 18 ++++++++++++++++-- 1 file changed, 16 insertions(+), 2 deletions(-) diff --git a/llvm/lib/CodeGen/MachineScheduler.cpp b/llvm/lib/CodeGen/MachineScheduler.cpp index 78a5b8d..662b16f 100644 --- a/llvm/lib/CodeGen/MachineScheduler.cpp +++ b/llvm/lib/CodeGen/MachineScheduler.cpp @@ -1168,11 +1168,25 @@ SUnit *ConvergingScheduler::pickNode(bool &IsTopNode) { } SUnit *SU; if (ForceTopDown) { - SU = DAG->getSUnit(DAG->top()); + SU = Top.pickOnlyChoice(); + if (!SU) { + SchedCandidate TopCand; + CandResult TopResult = + pickNodeFromQueue(Top.Available, DAG->getTopRPTracker(), TopCand); + assert(TopResult != NoCand && "failed to find the first candidate"); + SU = TopCand.SU; + } IsTopNode = true; } else if (ForceBottomUp) { - SU = DAG->getSUnit(priorNonDebug(DAG->bottom(), DAG->top())); + SU = Bot.pickOnlyChoice(); + if (!SU) { + SchedCandidate BotCand; + CandResult BotResult = + pickNodeFromQueue(Bot.Available, DAG->getBotRPTracker(), BotCand); + assert(BotResult != NoCand && "failed to find the first candidate"); + SU = BotCand.SU; + } IsTopNode = false; } else { -- 2.7.4