Lines Matching refs:Top
202 Top.init(DAG, SchedModel);
209 delete Top.HazardRec;
211 Top.HazardRec = TM.getInstrInfo()->CreateTargetMIHazardRecognizer(Itin, DAG);
214 delete Top.ResourceModel;
216 Top.ResourceModel = new VLIWResourceModel(TM, DAG->getSchedModel());
232 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency);
237 Top.releaseNode(SU, SU->TopReadyCycle);
490 if (Top.ResourceModel->isResourceAvailable(SU))
529 /// Pick the best candidate from the top queue.
533 /// maintain the number of vreg uses remaining to be top-scheduled.
542 // BestSU remains NULL if no top candidates beat the best existing candidate.
579 /// Pick the best candidate node from either the top or bottom queue.
587 if (SUnit *SU = Top.pickOnlyChoice()) {
608 // Check if the top Q has a better candidate.
610 CandResult TopResult = pickNodeFromQueue(Top.Available,
639 if (DAG->top() == DAG->bottom()) {
640 assert(Top.Available.empty() && Top.Pending.empty() &&
646 SU = Top.pickOnlyChoice();
650 pickNodeFromQueue(Top.Available, DAG->getTopRPTracker(), TopCand);
671 Top.removeReady(SU);
675 DEBUG(dbgs() << "*** " << (IsTopNode ? "Top" : "Bottom")
677 << (IsTopNode ? Top.CurrCycle : Bot.CurrCycle) << '\n';
688 SU->TopReadyCycle = Top.CurrCycle;
689 Top.bumpNode(SU);
