Searched refs:TopCand (Results 1 – 5 of 5) sorted by relevance
230 if (!TopCand.isValid() || TopCand.SU->isScheduled || in pickNodeBidirectional()231 TopCand.Policy != TopPolicy) { in pickNodeBidirectional()232 TopCand.reset(CandPolicy()); in pickNodeBidirectional()236 LLVM_DEBUG(traceCandidate(TopCand)); in pickNodeBidirectional()242 assert(TCand.SU == TopCand.SU && in pickNodeBidirectional()252 TopCand.Reason = NoCand; in pickNodeBidirectional()253 GenericScheduler::tryCandidate(Cand, TopCand, nullptr); in pickNodeBidirectional()254 if (TopCand.Reason != NoCand) { in pickNodeBidirectional()255 Cand.setBest(TopCand); in pickNodeBidirectional()277 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()
916 SchedCandidate TopCand; in pickNodeBidrectional() local918 pickNodeFromQueue(Top, DAG->getTopRPTracker(), TopCand); in pickNodeBidrectional()924 return TopCand.SU; in pickNodeBidrectional()936 return TopCand.SU; in pickNodeBidrectional()938 if (TopCand.SCost > BotCand.SCost) { in pickNodeBidrectional()941 return TopCand.SU; in pickNodeBidrectional()960 SchedCandidate TopCand; in pickNode() local962 pickNodeFromQueue(Top, DAG->getTopRPTracker(), TopCand); in pickNode()965 SU = TopCand.SU; in pickNode()
2926 TopCand.SU = nullptr; in initialize()3362 if (!TopCand.isValid() || TopCand.SU->isScheduled || in pickNodeBidirectional()3364 TopCand.reset(CandPolicy()); in pickNodeBidirectional()3382 assert(TopCand.isValid()); in pickNodeBidirectional()3384 TopCand.Reason = NoCand; in pickNodeBidirectional()3386 Cand.setBest(TopCand); in pickNodeBidirectional()3408 TopCand.reset(NoPolicy); in pickNode()3411 tracePick(TopCand); in pickNode()3412 SU = TopCand.SU; in pickNode()3625 tracePick(TopCand); in pickNode()[all …]
985 TopCand.SU = nullptr; in releaseTopNode()1008 SchedCandidate TopCand; variable