3236   TopCand.SU = nullptr;  in initialize()
3672   if (!TopCand.isValid() || TopCand.SU->isScheduled ||  in pickNodeBidirectional()
3673       TopCand.Policy != TopPolicy) {  in pickNodeBidirectional()
3674     TopCand.reset(CandPolicy());  in pickNodeBidirectional()
3675     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);  in pickNodeBidirectional()
3676     assert(TopCand.Reason != NoCand && "failed to find the first candidate");  in pickNodeBidirectional()
3678     LLVM_DEBUG(traceCandidate(TopCand));  in pickNodeBidirectional()
3684       assert(TCand.SU == TopCand.SU &&  in pickNodeBidirectional()
3692   assert(TopCand.isValid());  in pickNodeBidirectional()
3694   TopCand.Reason = NoCand;  in pickNodeBidirectional()
3695   if (tryCandidate(Cand, TopCand, nullptr)) {  in pickNodeBidirectional()
3696     Cand.setBest(TopCand);  in pickNodeBidirectional()
3718         TopCand.reset(NoPolicy);  in pickNode()
3719         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);  in pickNode()
3720         assert(TopCand.Reason != NoCand && "failed to find a candidate");  in pickNode()
3721         tracePick(TopCand);  in pickNode()
3722         SU = TopCand.SU;  in pickNode()
3929       SchedCandidate TopCand(NoPolicy);  in pickNode()  local
3932       setPolicy(TopCand.Policy, /*IsPostRA=*/true, Top, nullptr);  in pickNode()
3933       pickNodeFromQueue(TopCand);  in pickNode()
3934       assert(TopCand.Reason != NoCand && "failed to find a candidate");  in pickNode()
3935       tracePick(TopCand);  in pickNode()
3936       SU = TopCand.SU;  in pickNode()