Lines Matching refs:CurCycle
128 /// CurCycle - The current scheduler state corresponds to this cycle.
129 unsigned CurCycle;
158 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
305 CurCycle = 0;
580 if (NextCycle <= CurCycle)
587 CurCycle = NextCycle;
590 for (; CurCycle != NextCycle; ++CurCycle) {
614 // Bump CurCycle to account for latency. We assume the latency of other
638 AdvanceToCycle(CurCycle + Stalls);
642 /// Does not update CurCycle.
684 DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: ");
688 if (CurCycle < SU->getHeight())
697 SU->setHeightToAtLeast(CurCycle);
707 // advance CurCycle before ReleasePredecessors to avoid useless pushes to
710 AdvanceToCycle(CurCycle + 1);
759 AdvanceToCycle(CurCycle + 1);
885 CurCycle = OldSU->getHeight();
887 AvailableQueue->setCurCycle(CurCycle);
1476 AdvanceToCycle(std::max(CurCycle + 1, MinAvailableCycle));
1499 bool isReady(SUnit* SU, unsigned CurCycle) const { return true; }
1561 bool isReady(SUnit *SU, unsigned CurCycle) const;
1580 bool isReady(SUnit *SU, unsigned CurCycle) const;
2486 bool hybrid_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2491 if (SU->getHeight() > (CurCycle + ReadyDelay)) return false;
2533 bool ilp_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2534 if (SU->getHeight() > CurCycle) return false;
