2724   Top.init(DAG, SchedModel, &Rem);  in initialize()
2732   if (!Top.HazardRec) {  in initialize()
2733     Top.HazardRec =  in initialize()
3139   if (SUnit *SU = Top.pickOnlyChoice()) {  in pickNodeBidirectional()
3147   setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top);  in pickNodeBidirectional()
3151   setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot);  in pickNodeBidirectional()
3178     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);  in pickNodeBidirectional()
3186       pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand);  in pickNodeBidirectional()
3212     assert(Top.Available.empty() && Top.Pending.empty() &&  in pickNode()
3219       SU = Top.pickOnlyChoice();  in pickNode()
3223         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);  in pickNode()
3246     Top.removeReady(SU);  in pickNode()
3288     SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3289     Top.bumpNode(SU);  in schedNode()
3332   Top.init(DAG, SchedModel, &Rem);  in initialize()
3338   if (!Top.HazardRec) {  in initialize()
3339     Top.HazardRec =  in initialize()
3372   if (tryLess(Top.getLatencyStallCycles(TryCand.SU),  in tryCandidate()
3373               Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall))  in tryCandidate()
3392   if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) {  in tryCandidate()
3402   ReadyQueue &Q = Top.Available;  in pickNodeFromQueue()
3419     assert(Top.Available.empty() && Top.Pending.empty() && "ReadyQ garbage");  in pickNode()
3424     SU = Top.pickOnlyChoice();  in pickNode()
3432       setPolicy(TopCand.Policy, /*IsPostRA=*/true, Top, nullptr);  in pickNode()
3441   Top.removeReady(SU);  in pickNode()
3451   SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3452   Top.bumpNode(SU);  in schedNode()