Lines Matching refs:CurCycle
129 /// CurCycle - The current scheduler state corresponds to this cycle.
130 unsigned CurCycle;
165 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
324 CurCycle = 0;
600 if (NextCycle <= CurCycle)
607 CurCycle = NextCycle;
610 for (; CurCycle != NextCycle; ++CurCycle) {
634 // Bump CurCycle to account for latency. We assume the latency of other
658 AdvanceToCycle(CurCycle + Stalls);
662 /// Does not update CurCycle.
706 DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: ");
710 if (CurCycle < SU->getHeight())
719 SU->setHeightToAtLeast(CurCycle);
729 // advance CurCycle before ReleasePredecessors to avoid useless pushes to
732 AdvanceToCycle(CurCycle + 1);
783 AdvanceToCycle(CurCycle + 1);
908 CurCycle = OldSU->getHeight();
910 AvailableQueue->setCurCycle(CurCycle);
1511 AdvanceToCycle(std::max(CurCycle + 1, MinAvailableCycle));
1534 bool isReady(SUnit* SU, unsigned CurCycle) const { return true; }
1596 bool isReady(SUnit *SU, unsigned CurCycle) const;
1615 bool isReady(SUnit *SU, unsigned CurCycle) const;
2525 bool hybrid_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2530 if (SU->getHeight() > (CurCycle + ReadyDelay)) return false;
2572 bool ilp_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2573 if (SU->getHeight() > CurCycle) return false;
