Lines Matching refs:CurCycle
155 /// CurCycle - The current scheduler state corresponds to this cycle.
156 unsigned CurCycle = 0;
358 CurCycle = 0;
630 if (NextCycle <= CurCycle)
637 CurCycle = NextCycle;
640 for (; CurCycle != NextCycle; ++CurCycle) {
664 // Bump CurCycle to account for latency. We assume the latency of other
688 AdvanceToCycle(CurCycle + Stalls);
692 /// Does not update CurCycle.
737 LLVM_DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: ");
741 if (CurCycle < SU->getHeight())
750 SU->setHeightToAtLeast(CurCycle);
760 // advance CurCycle before ReleasePredecessors to avoid useless pushes to
763 AdvanceToCycle(CurCycle + 1);
813 AdvanceToCycle(CurCycle + 1);
953 CurCycle = OldSU->getHeight();
955 AvailableQueue->setCurCycle(CurCycle);
1628 AdvanceToCycle(std::max(CurCycle + 1, MinAvailableCycle));
1645 bool isReady(SUnit* SU, unsigned CurCycle) const { return true; }
1703 bool isReady(SUnit *SU, unsigned CurCycle) const;
1720 bool isReady(SUnit *SU, unsigned CurCycle) const;
2653 bool hybrid_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2658 if (SU->getHeight() > (CurCycle + ReadyDelay)) return false;
2700 bool ilp_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2701 if (SU->getHeight() > CurCycle) return false;