Lines Matching refs:Top
206 Top.init(DAG, SchedModel);
214 delete Top.HazardRec;
216 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG);
219 delete Top.ResourceModel;
221 Top.ResourceModel = new VLIWResourceModel(STI, DAG->getSchedModel());
237 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency);
242 Top.releaseNode(SU, SU->TopReadyCycle);
495 if (Top.ResourceModel->isResourceAvailable(SU))
534 /// Pick the best candidate from the top queue.
538 /// maintain the number of vreg uses remaining to be top-scheduled.
547 // BestSU remains NULL if no top candidates beat the best existing candidate.
584 /// Pick the best candidate node from either the top or bottom queue.
592 if (SUnit *SU = Top.pickOnlyChoice()) {
613 // Check if the top Q has a better candidate.
615 CandResult TopResult = pickNodeFromQueue(Top.Available,
644 if (DAG->top() == DAG->bottom()) {
645 assert(Top.Available.empty() && Top.Pending.empty() &&
651 SU = Top.pickOnlyChoice();
655 pickNodeFromQueue(Top.Available, DAG->getTopRPTracker(), TopCand);
676 Top.removeReady(SU);
680 DEBUG(dbgs() << "*** " << (IsTopNode ? "Top" : "Bottom")
682 << (IsTopNode ? Top.CurrCycle : Bot.CurrCycle) << '\n';
693 SU->TopReadyCycle = Top.CurrCycle;
694 Top.bumpNode(SU);
