2909   Top.init(DAG, SchedModel, &Rem);  in initialize()
2917   if (!Top.HazardRec) {  in initialize()
2918     Top.HazardRec =  in initialize()
3327   if (SUnit *SU = Top.pickOnlyChoice()) {  in pickNodeBidirectional()
3335   setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top);  in pickNodeBidirectional()
3339   setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot);  in pickNodeBidirectional()
3366     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);  in pickNodeBidirectional()
3374       pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand);  in pickNodeBidirectional()
3399     assert(Top.Available.empty() && Top.Pending.empty() &&  in pickNode()
3406       SU = Top.pickOnlyChoice();  in pickNode()
3410         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);  in pickNode()
3433     Top.removeReady(SU);  in pickNode()
3475     SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3476     Top.bumpNode(SU);  in schedNode()
3519   Top.init(DAG, SchedModel, &Rem);  in initialize()
3525   if (!Top.HazardRec) {  in initialize()
3526     Top.HazardRec =  in initialize()
3560   if (tryLess(Top.getLatencyStallCycles(TryCand.SU),  in tryCandidate()
3561               Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall))  in tryCandidate()
3580   if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) {  in tryCandidate()
3594   ReadyQueue &Q = Top.Available;  in pickNodeFromQueue()
3610     assert(Top.Available.empty() && Top.Pending.empty() && "ReadyQ garbage");  in pickNode()
3615     SU = Top.pickOnlyChoice();  in pickNode()
3623       setPolicy(TopCand.Policy, /*IsPostRA=*/true, Top, nullptr);  in pickNode()
3632   Top.removeReady(SU);  in pickNode()
3642   SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3643   Top.bumpNode(SU);  in schedNode()