Lines Matching refs:Top
256 Top.init(DAG, SchedModel); in initialize()
264 delete Top.HazardRec; in initialize()
266 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG); in initialize()
269 delete Top.ResourceModel; in initialize()
271 Top.ResourceModel = new VLIWResourceModel(STI, DAG->getSchedModel()); in initialize()
295 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode()
300 Top.releaseNode(SU, SU->TopReadyCycle); in releaseTopNode()
597 if (Top.isLatencyBound(SU)) { in SchedulingCost()
610 if (Top.ResourceModel->isResourceAvailable(SU, true)) { in SchedulingCost()
644 if (Top.isLatencyBound(SU)) in SchedulingCost()
692 Top.ResourceModel->isResourceAvailable(SU, true)) { in SchedulingCost()
708 Top.ResourceModel->isInPacket(PI.getSUnit())) { in SchedulingCost()
733 Top.ResourceModel->isInPacket(PI.getSUnit())) { in SchedulingCost()
886 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidrectional()
911 CandResult TopResult = pickNodeFromQueue(Top, in pickNodeBidrectional()
946 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
952 SU = Top.pickOnlyChoice(); in pickNode()
956 pickNodeFromQueue(Top, DAG->getTopRPTracker(), TopCand); in pickNode()
977 Top.removeReady(SU); in pickNode()
983 << (IsTopNode ? Top.CurrCycle : Bot.CurrCycle) << " (" in pickNode()
995 Top.bumpNode(SU); in schedNode()
996 SU->TopReadyCycle = Top.CurrCycle; in schedNode()