Lines Matching refs:CurCycle
156 unsigned CurCycle = 0; member in __anonfa9907a40111::ScheduleDAGRRList
360 CurCycle = 0; in Schedule()
632 if (NextCycle <= CurCycle) in AdvanceToCycle()
639 CurCycle = NextCycle; in AdvanceToCycle()
642 for (; CurCycle != NextCycle; ++CurCycle) { in AdvanceToCycle()
690 AdvanceToCycle(CurCycle + Stalls); in AdvancePastStalls()
739 LLVM_DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: "); in ScheduleNodeBottomUp()
743 if (CurCycle < SU->getHeight()) in ScheduleNodeBottomUp()
752 SU->setHeightToAtLeast(CurCycle); in ScheduleNodeBottomUp()
765 AdvanceToCycle(CurCycle + 1); in ScheduleNodeBottomUp()
815 AdvanceToCycle(CurCycle + 1); in ScheduleNodeBottomUp()
955 CurCycle = OldSU->getHeight(); in BacktrackBottomUp()
957 AvailableQueue->setCurCycle(CurCycle); in BacktrackBottomUp()
1635 AdvanceToCycle(std::max(CurCycle + 1, MinAvailableCycle)); in ListScheduleBottomUp()
1652 bool isReady(SUnit* SU, unsigned CurCycle) const { return true; } in isReady()
1710 bool isReady(SUnit *SU, unsigned CurCycle) const;
1727 bool isReady(SUnit *SU, unsigned CurCycle) const;
2672 bool hybrid_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const { in isReady()
2677 if (SU->getHeight() > (CurCycle + ReadyDelay)) return false; in isReady()
2719 bool ilp_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const { in isReady()
2720 if (SU->getHeight() > CurCycle) return false; in isReady()