2694   Top.init(DAG, SchedModel, &Rem);  in initialize()
2702   if (!Top.HazardRec) {  in initialize()
2703     Top.HazardRec =  in initialize()
3109   if (SUnit *SU = Top.pickOnlyChoice()) {  in pickNodeBidirectional()
3117   setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top);  in pickNodeBidirectional()
3121   setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot);  in pickNodeBidirectional()
3148     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);  in pickNodeBidirectional()
3156       pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand);  in pickNodeBidirectional()
3182     assert(Top.Available.empty() && Top.Pending.empty() &&  in pickNode()
3189       SU = Top.pickOnlyChoice();  in pickNode()
3193         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);  in pickNode()
3216     Top.removeReady(SU);  in pickNode()
3257     SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3258     Top.bumpNode(SU);  in schedNode()
3301   Top.init(DAG, SchedModel, &Rem);  in initialize()
3307   if (!Top.HazardRec) {  in initialize()
3308     Top.HazardRec =  in initialize()
3341   if (tryLess(Top.getLatencyStallCycles(TryCand.SU),  in tryCandidate()
3342               Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall))  in tryCandidate()
3361   if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) {  in tryCandidate()
3371   ReadyQueue &Q = Top.Available;  in pickNodeFromQueue()
3388     assert(Top.Available.empty() && Top.Pending.empty() && "ReadyQ garbage");  in pickNode()
3393     SU = Top.pickOnlyChoice();  in pickNode()
3401       setPolicy(TopCand.Policy, /*IsPostRA=*/true, Top, nullptr);  in pickNode()
3410   Top.removeReady(SU);  in pickNode()
3420   SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle());  in schedNode()
3421   Top.bumpNode(SU);  in schedNode()