2926   TopCand.SU = nullptr;  in initialize()
3362   if (!TopCand.isValid() || TopCand.SU->isScheduled ||  in pickNodeBidirectional()
3363       TopCand.Policy != TopPolicy) {  in pickNodeBidirectional()
3364     TopCand.reset(CandPolicy());  in pickNodeBidirectional()
3365     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);  in pickNodeBidirectional()
3366     assert(TopCand.Reason != NoCand && "failed to find the first candidate");  in pickNodeBidirectional()
3368     LLVM_DEBUG(traceCandidate(TopCand));  in pickNodeBidirectional()
3374       assert(TCand.SU == TopCand.SU &&  in pickNodeBidirectional()
3382   assert(TopCand.isValid());  in pickNodeBidirectional()
3384   TopCand.Reason = NoCand;  in pickNodeBidirectional()
3385   if (tryCandidate(Cand, TopCand, nullptr)) {  in pickNodeBidirectional()
3386     Cand.setBest(TopCand);  in pickNodeBidirectional()
3408         TopCand.reset(NoPolicy);  in pickNode()
3409         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);  in pickNode()
3410         assert(TopCand.Reason != NoCand && "failed to find a candidate");  in pickNode()
3411         tracePick(TopCand);  in pickNode()
3412         SU = TopCand.SU;  in pickNode()
3619       SchedCandidate TopCand(NoPolicy);  in pickNode()  local
3622       setPolicy(TopCand.Policy, /*IsPostRA=*/true, Top, nullptr);  in pickNode()
3623       pickNodeFromQueue(TopCand);  in pickNode()
3624       assert(TopCand.Reason != NoCand && "failed to find a candidate");  in pickNode()
3625       tracePick(TopCand);  in pickNode()
3626       SU = TopCand.SU;  in pickNode()