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()
2293 void SchedBoundary::bumpCycle(unsigned NextCycle) { in bumpCycle() argument2297 if (MinReadyCycle > NextCycle) in bumpCycle()2298 NextCycle = MinReadyCycle; in bumpCycle()2301 unsigned DecMOps = SchedModel->getIssueWidth() * (NextCycle - CurrCycle); in bumpCycle()2305 if ((NextCycle - CurrCycle) > DependentLatency) in bumpCycle()2308 DependentLatency -= (NextCycle - CurrCycle); in bumpCycle()2312 CurrCycle = NextCycle; in bumpCycle()2315 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()2345 unsigned Cycles, unsigned NextCycle) { in countResource() argument2401 unsigned NextCycle = CurrCycle; in bumpNode() local[all …]
368 unsigned NextCycle = std::max(CurrCycle + 1, MinReadyCycle); in bumpCycle() local372 CurrCycle = NextCycle; in bumpCycle()375 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()
255 void AdvanceToCycle(unsigned NextCycle);629 void ScheduleDAGRRList::AdvanceToCycle(unsigned NextCycle) { in AdvanceToCycle() argument630 if (NextCycle <= CurCycle) in AdvanceToCycle()634 AvailableQueue->setCurCycle(NextCycle); in AdvanceToCycle()637 CurCycle = NextCycle; in AdvanceToCycle()640 for (; CurCycle != NextCycle; ++CurCycle) { in AdvanceToCycle()
784 void bumpCycle(unsigned NextCycle);