3218   Top.init(DAG, SchedModel, &Rem);  in initialize()
3226   if (!Top.HazardRec) {  in initialize()
3227     Top.HazardRec =  in initialize()
3636   if (SUnit *SU = Top.pickOnlyChoice()) {  in pickNodeBidirectional()
3644   setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top);  in pickNodeBidirectional()
3648   setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot);  in pickNodeBidirectional()
3675     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);  in pickNodeBidirectional()
3683       pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand);  in pickNodeBidirectional()
3708     assert(Top.Available.empty() && Top.Pending.empty() &&  in pickNode()
3715       SU = Top.pickOnlyChoice();  in pickNode()
3719         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);  in pickNode()
3742     Top.removeReady(SU);  in pickNode()
3784     SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3785     Top.bumpNode(SU);  in schedNode()
3828   Top.init(DAG, SchedModel, &Rem);  in initialize()
3834   if (!Top.HazardRec) {  in initialize()
3835     Top.HazardRec =  in initialize()
3869   if (tryLess(Top.getLatencyStallCycles(TryCand.SU),  in tryCandidate()
3870               Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall))  in tryCandidate()
3889   if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) {  in tryCandidate()
3903   ReadyQueue &Q = Top.Available;  in pickNodeFromQueue()
3919     assert(Top.Available.empty() && Top.Pending.empty() && "ReadyQ garbage");  in pickNode()
3924     SU = Top.pickOnlyChoice();  in pickNode()
3932       setPolicy(TopCand.Policy, /*IsPostRA=*/true, Top, nullptr);  in pickNode()
3941   Top.removeReady(SU);  in pickNode()
3951   SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3952   Top.bumpNode(SU);  in schedNode()