2908   Top.init(DAG, SchedModel, &Rem);  in initialize()
2916   if (!Top.HazardRec) {  in initialize()
2917     Top.HazardRec =  in initialize()
3326   if (SUnit *SU = Top.pickOnlyChoice()) {  in pickNodeBidirectional()
3334   setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top);  in pickNodeBidirectional()
3338   setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot);  in pickNodeBidirectional()
3365     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);  in pickNodeBidirectional()
3373       pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand);  in pickNodeBidirectional()
3398     assert(Top.Available.empty() && Top.Pending.empty() &&  in pickNode()
3405       SU = Top.pickOnlyChoice();  in pickNode()
3409         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);  in pickNode()
3432     Top.removeReady(SU);  in pickNode()
3474     SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3475     Top.bumpNode(SU);  in schedNode()
3518   Top.init(DAG, SchedModel, &Rem);  in initialize()
3524   if (!Top.HazardRec) {  in initialize()
3525     Top.HazardRec =  in initialize()
3559   if (tryLess(Top.getLatencyStallCycles(TryCand.SU),  in tryCandidate()
3560               Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall))  in tryCandidate()
3579   if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) {  in tryCandidate()
3593   ReadyQueue &Q = Top.Available;  in pickNodeFromQueue()
3609     assert(Top.Available.empty() && Top.Pending.empty() && "ReadyQ garbage");  in pickNode()
3614     SU = Top.pickOnlyChoice();  in pickNode()
3622       setPolicy(TopCand.Policy, /*IsPostRA=*/true, Top, nullptr);  in pickNode()
3631   Top.removeReady(SU);  in pickNode()
3641   SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3642   Top.bumpNode(SU);  in schedNode()