2927   TopCand.SU = nullptr;  in initialize()
3363   if (!TopCand.isValid() || TopCand.SU->isScheduled ||  in pickNodeBidirectional()
3364       TopCand.Policy != TopPolicy) {  in pickNodeBidirectional()
3365     TopCand.reset(CandPolicy());  in pickNodeBidirectional()
3366     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);  in pickNodeBidirectional()
3367     assert(TopCand.Reason != NoCand && "failed to find the first candidate");  in pickNodeBidirectional()
3369     LLVM_DEBUG(traceCandidate(TopCand));  in pickNodeBidirectional()
3375       assert(TCand.SU == TopCand.SU &&  in pickNodeBidirectional()
3383   assert(TopCand.isValid());  in pickNodeBidirectional()
3385   TopCand.Reason = NoCand;  in pickNodeBidirectional()
3386   if (tryCandidate(Cand, TopCand, nullptr)) {  in pickNodeBidirectional()
3387     Cand.setBest(TopCand);  in pickNodeBidirectional()
3409         TopCand.reset(NoPolicy);  in pickNode()
3410         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);  in pickNode()
3411         assert(TopCand.Reason != NoCand && "failed to find a candidate");  in pickNode()
3412         tracePick(TopCand);  in pickNode()
3413         SU = TopCand.SU;  in pickNode()
3620       SchedCandidate TopCand(NoPolicy);  in pickNode()  local
3623       setPolicy(TopCand.Policy, /*IsPostRA=*/true, Top, nullptr);  in pickNode()
3624       pickNodeFromQueue(TopCand);  in pickNode()
3625       assert(TopCand.Reason != NoCand && "failed to find a candidate");  in pickNode()
3626       tracePick(TopCand);  in pickNode()
3627       SU = TopCand.SU;  in pickNode()