Lines Matching refs:CurCycle
144 /// CurCycle - The current scheduler state corresponds to this cycle.
145 unsigned CurCycle;
170 NeedLatency(needlatency), AvailableQueue(availqueue), CurCycle(0),
328 CurCycle = 0;
479 if (NextCycle <= CurCycle)
486 CurCycle = NextCycle;
489 for (; CurCycle != NextCycle; ++CurCycle) {
516 // Bump CurCycle to account for latency. We assume the latency of other
540 AdvanceToCycle(CurCycle + Stalls);
544 /// Does not update CurCycle.
590 DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: ");
594 if (CurCycle < SU->getHeight())
603 SU->setHeightToAtLeast(CurCycle);
613 // advance CurCycle before ReleasePredecessors to avoid useless pushes to
616 AdvanceToCycle(CurCycle + 1);
651 AdvanceToCycle(CurCycle + 1);
751 CurCycle = OldSU->getHeight();
753 AvailableQueue->setCurCycle(CurCycle);
1295 AdvanceToCycle(std::max(CurCycle + 1, MinAvailableCycle));
1349 DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
1352 assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!");
1353 SU->setDepthToAtLeast(CurCycle);
1364 AvailableQueue->setCurCycle(CurCycle);
1386 ++CurCycle;
1387 AvailableQueue->setCurCycle(CurCycle);
1407 bool isReady(SUnit* SU, unsigned CurCycle) const { return true; }
1484 bool isReady(SUnit *SU, unsigned CurCycle) const;
1503 bool isReady(SUnit *SU, unsigned CurCycle) const;
2434 bool hybrid_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2439 if (SU->getHeight() > (CurCycle + ReadyDelay)) return false;
2483 bool ilp_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2484 if (SU->getHeight() > CurCycle) return false;
