Searched refs:NextCycle (Results 1 – 5 of 5) sorted by relevance
46 void advanceToCycle(unsigned NextCycle);268 void GCNILPScheduler::advanceToCycle(unsigned NextCycle) { in advanceToCycle() argument269 if (NextCycle <= CurCycle) in advanceToCycle()271 CurCycle = NextCycle; in advanceToCycle()
2298 void SchedBoundary::bumpCycle(unsigned NextCycle) { in bumpCycle() argument2302 if (MinReadyCycle > NextCycle) in bumpCycle()2303 NextCycle = MinReadyCycle; in bumpCycle()2306 unsigned DecMOps = SchedModel->getIssueWidth() * (NextCycle - CurrCycle); in bumpCycle()2310 if ((NextCycle - CurrCycle) > DependentLatency) in bumpCycle()2313 DependentLatency -= (NextCycle - CurrCycle); in bumpCycle()2317 CurrCycle = NextCycle; in bumpCycle()2320 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()2350 unsigned Cycles, unsigned NextCycle) { in countResource() argument2406 unsigned NextCycle = CurrCycle; in bumpNode() local[all …]
393 unsigned NextCycle = std::max(CurrCycle + 1, MinReadyCycle); in bumpCycle() local397 CurrCycle = NextCycle; in bumpCycle()400 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()
255 void AdvanceToCycle(unsigned NextCycle);632 void ScheduleDAGRRList::AdvanceToCycle(unsigned NextCycle) { in AdvanceToCycle() argument633 if (NextCycle <= CurCycle) in AdvanceToCycle()637 AvailableQueue->setCurCycle(NextCycle); in AdvanceToCycle()640 CurCycle = NextCycle; in AdvanceToCycle()643 for (; CurCycle != NextCycle; ++CurCycle) { in AdvanceToCycle()
812 void bumpCycle(unsigned NextCycle);