203   if (!TopCand.isValid() || TopCand.SU->isScheduled ||  in pickNodeBidirectional()
204       TopCand.Policy != TopPolicy) {  in pickNodeBidirectional()
205     TopCand.reset(CandPolicy());  in pickNodeBidirectional()
206     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);  in pickNodeBidirectional()
207     assert(TopCand.Reason != NoCand && "failed to find the first candidate");  in pickNodeBidirectional()
209     LLVM_DEBUG(traceCandidate(TopCand));  in pickNodeBidirectional()
213   LLVM_DEBUG(dbgs() << "Top Cand: "; traceCandidate(TopCand);  in pickNodeBidirectional()
216   if (TopCand.Reason == BotCand.Reason) {  in pickNodeBidirectional()
218     GenericSchedulerBase::CandReason TopReason = TopCand.Reason;  in pickNodeBidirectional()
219     TopCand.Reason = NoCand;  in pickNodeBidirectional()
220     GenericScheduler::tryCandidate(Cand, TopCand, nullptr);  in pickNodeBidirectional()
221     if (TopCand.Reason != NoCand) {  in pickNodeBidirectional()
222       Cand.setBest(TopCand);  in pickNodeBidirectional()
224       TopCand.Reason = TopReason;  in pickNodeBidirectional()
227     if (TopCand.Reason == RegExcess && TopCand.RPDelta.Excess.getUnitInc() <= 0) {  in pickNodeBidirectional()
228       Cand = TopCand;  in pickNodeBidirectional()
231     } else if (TopCand.Reason == RegCritical && TopCand.RPDelta.CriticalMax.getUnitInc() <= 0) {  in pickNodeBidirectional()
232       Cand = TopCand;  in pickNodeBidirectional()
236       if (BotCand.Reason > TopCand.Reason) {  in pickNodeBidirectional()
237         Cand = TopCand;  in pickNodeBidirectional()
263         TopCand.reset(NoPolicy);  in pickNode()
264         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);  in pickNode()
265         assert(TopCand.Reason != NoCand && "failed to find a candidate");  in pickNode()
266         SU = TopCand.SU;  in pickNode()