Lines Matching defs:CurCycle

155   /// CurCycle - The current scheduler state corresponds to this cycle.
156   unsigned CurCycle = 0;
360   CurCycle = 0;
632   if (NextCycle <= CurCycle)
639     CurCycle = NextCycle;
642     for (; CurCycle != NextCycle; ++CurCycle) {
666   // Bump CurCycle to account for latency. We assume the latency of other
690   AdvanceToCycle(CurCycle + Stalls);
694 /// Does not update CurCycle.
739   LLVM_DEBUG(dbgs() << "\n*** Scheduling [" << CurCycle << "]: ");
743   if (CurCycle < SU->getHeight())
752   SU->setHeightToAtLeast(CurCycle);
762   // advance CurCycle before ReleasePredecessors to avoid useless pushes to
765     AdvanceToCycle(CurCycle + 1);
815       AdvanceToCycle(CurCycle + 1);
955     CurCycle = OldSU->getHeight();
957     AvailableQueue->setCurCycle(CurCycle);
1635       AdvanceToCycle(std::max(CurCycle + 1, MinAvailableCycle));
1652   bool isReady(SUnit* SU, unsigned CurCycle) const { return true; }
1710   bool isReady(SUnit *SU, unsigned CurCycle) const;
1727   bool isReady(SUnit *SU, unsigned CurCycle) const;
2672 bool hybrid_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2677   if (SU->getHeight() > (CurCycle + ReadyDelay)) return false;
2719 bool ilp_ls_rr_sort::isReady(SUnit *SU, unsigned CurCycle) const {
2720   if (SU->getHeight() > CurCycle) return false;