Searched refs:TopCand (Results 1 – 5 of 5) sorted by relevance
213 if (!TopCand.isValid() || TopCand.SU->isScheduled || in pickNodeBidirectional()214 TopCand.Policy != TopPolicy) { in pickNodeBidirectional()215 TopCand.reset(CandPolicy()); in pickNodeBidirectional()219 LLVM_DEBUG(traceCandidate(TopCand)); in pickNodeBidirectional()225 assert(TCand.SU == TopCand.SU && in pickNodeBidirectional()235 TopCand.Reason = NoCand; in pickNodeBidirectional()236 GenericScheduler::tryCandidate(Cand, TopCand, nullptr); in pickNodeBidirectional()237 if (TopCand.Reason != NoCand) { in pickNodeBidirectional()238 Cand.setBest(TopCand); in pickNodeBidirectional()260 TopCand.reset(NoPolicy); in pickNode()[all …]
244 SISchedCandidate TopCand; in pickNode() local259 tryCandidateTopDown(TopCand, TryCand); in pickNode()261 TopCand.setBest(TryCand); in pickNode()264 return TopCand.SU; in pickNode()
911 SchedCandidate TopCand; in pickNodeBidrectional() local913 DAG->getTopRPTracker(), TopCand); in pickNodeBidrectional()919 return TopCand.SU; in pickNodeBidrectional()931 return TopCand.SU; in pickNodeBidrectional()933 if (TopCand.SCost > BotCand.SCost) { in pickNodeBidrectional()936 return TopCand.SU; in pickNodeBidrectional()955 SchedCandidate TopCand; in pickNode() local957 pickNodeFromQueue(Top, DAG->getTopRPTracker(), TopCand); in pickNode()960 SU = TopCand.SU; in pickNode()
2927 TopCand.SU = nullptr; in initialize()3363 if (!TopCand.isValid() || TopCand.SU->isScheduled || in pickNodeBidirectional()3365 TopCand.reset(CandPolicy()); in pickNodeBidirectional()3383 assert(TopCand.isValid()); in pickNodeBidirectional()3385 TopCand.Reason = NoCand; in pickNodeBidirectional()3387 Cand.setBest(TopCand); in pickNodeBidirectional()3409 TopCand.reset(NoPolicy); in pickNode()3412 tracePick(TopCand); in pickNode()3413 SU = TopCand.SU; in pickNode()3626 tracePick(TopCand); in pickNode()[all …]
982 TopCand.SU = nullptr; in releaseTopNode()1005 SchedCandidate TopCand; variable