Lines Matching refs:CurCycle
157 unsigned CurCycle = 0; member in __anon70bf5c530111::ScheduleDAGRRList
353 CurCycle = 0; in Schedule()
625 if (NextCycle <= CurCycle) in AdvanceToCycle()
632 CurCycle = NextCycle; in AdvanceToCycle()
635 for (; CurCycle != NextCycle; ++CurCycle) { in AdvanceToCycle()
683 AdvanceToCycle(CurCycle + Stalls); in AdvancePastStalls()
731 LLVM_DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: "); in ScheduleNodeBottomUp()
735 if (CurCycle < SU->getHeight()) in ScheduleNodeBottomUp()
744 SU->setHeightToAtLeast(CurCycle); in ScheduleNodeBottomUp()
757 AdvanceToCycle(CurCycle + 1); in ScheduleNodeBottomUp()
807 AdvanceToCycle(CurCycle + 1); in ScheduleNodeBottomUp()
947 CurCycle = OldSU->getHeight(); in BacktrackBottomUp()
949 AvailableQueue->setCurCycle(CurCycle); in BacktrackBottomUp()
1611 AdvanceToCycle(std::max(CurCycle + 1, MinAvailableCycle)); in ListScheduleBottomUp()
1628 bool isReady(SUnit* SU, unsigned CurCycle) const { return true; } in isReady()
1686 bool isReady(SUnit *SU, unsigned CurCycle) const;
1703 bool isReady(SUnit *SU, unsigned CurCycle) const;
2636 bool hybrid_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const { in isReady()
2641 if (SU->getHeight() > (CurCycle + ReadyDelay)) return false; in isReady()
2683 bool ilp_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const { in isReady()
2684 if (SU->getHeight() > CurCycle) return false; in isReady()