Home
last modified time | relevance | path

Searched refs:BotCand (Results 1 – 2 of 2) sorted by relevance

/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp592 SchedCandidate BotCand; in pickNodeBidrectional() local
595 DAG->getBotRPTracker(), BotCand); in pickNodeBidrectional()
607 return BotCand.SU; in pickNodeBidrectional()
623 return BotCand.SU; in pickNodeBidrectional()
629 if (TopCand.SCost > BotCand.SCost) { in pickNodeBidrectional()
635 return BotCand.SU; in pickNodeBidrectional()
660 SchedCandidate BotCand; in pickNode() local
662 pickNodeFromQueue(Bot.Available, DAG->getBotRPTracker(), BotCand); in pickNode()
665 SU = BotCand.SU; in pickNode()
/external/llvm/lib/CodeGen/
DMachineScheduler.cpp2739 SchedCandidate BotCand(NoPolicy); in pickNodeBidirectional() local
2743 setPolicy(BotCand.Policy, /*IsPostRA=*/false, Bot, &Top); in pickNodeBidirectional()
2749 pickNodeFromQueue(Bot, DAG->getBotRPTracker(), BotCand); in pickNodeBidirectional()
2750 assert(BotCand.Reason != NoCand && "failed to find the first candidate"); in pickNodeBidirectional()
2759 if ((BotCand.Reason == RegExcess && !BotCand.isRepeat(RegExcess)) in pickNodeBidirectional()
2760 || (BotCand.Reason == RegCritical in pickNodeBidirectional()
2761 && !BotCand.isRepeat(RegCritical))) in pickNodeBidirectional()
2764 tracePick(BotCand, IsTopNode); in pickNodeBidirectional()
2765 return BotCand.SU; in pickNodeBidirectional()
2772 if (TopCand.Reason < BotCand.Reason) { in pickNodeBidirectional()
[all …]