Lines Matching refs:Top
257 Top.init(DAG, SchedModel); in initialize()
265 delete Top.HazardRec; in initialize()
267 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG); in initialize()
270 delete Top.ResourceModel; in initialize()
272 Top.ResourceModel = new VLIWResourceModel(STI, DAG->getSchedModel()); in initialize()
296 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode()
301 Top.releaseNode(SU, SU->TopReadyCycle); in releaseTopNode()
598 if (Top.isLatencyBound(SU)) { in SchedulingCost()
611 if (Top.ResourceModel->isResourceAvailable(SU, true)) { in SchedulingCost()
645 if (Top.isLatencyBound(SU)) in SchedulingCost()
693 Top.ResourceModel->isResourceAvailable(SU, true)) { in SchedulingCost()
709 Top.ResourceModel->isInPacket(PI.getSUnit())) { in SchedulingCost()
734 Top.ResourceModel->isInPacket(PI.getSUnit())) { in SchedulingCost()
887 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidrectional()
912 CandResult TopResult = pickNodeFromQueue(Top, in pickNodeBidrectional()
947 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
953 SU = Top.pickOnlyChoice(); in pickNode()
957 pickNodeFromQueue(Top, DAG->getTopRPTracker(), TopCand); in pickNode()
978 Top.removeReady(SU); in pickNode()
984 << (IsTopNode ? Top.CurrCycle : Bot.CurrCycle) << " (" in pickNode()
996 Top.bumpNode(SU); in schedNode()
997 SU->TopReadyCycle = Top.CurrCycle; in schedNode()