Searched refs:NextCycle (Results 1 – 5 of 5) sorted by relevance
46 void advanceToCycle(unsigned NextCycle);266 void GCNILPScheduler::advanceToCycle(unsigned NextCycle) { in advanceToCycle() argument267 if (NextCycle <= CurCycle) in advanceToCycle()269 CurCycle = NextCycle; in advanceToCycle()
2587 void SchedBoundary::bumpCycle(unsigned NextCycle) { in bumpCycle() argument2591 if (MinReadyCycle > NextCycle) in bumpCycle()2592 NextCycle = MinReadyCycle; in bumpCycle()2595 unsigned DecMOps = SchedModel->getIssueWidth() * (NextCycle - CurrCycle); in bumpCycle()2599 if ((NextCycle - CurrCycle) > DependentLatency) in bumpCycle()2602 DependentLatency -= (NextCycle - CurrCycle); in bumpCycle()2606 CurrCycle = NextCycle; in bumpCycle()2609 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()2643 unsigned NextCycle, in countResource() argument2701 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()
254 void AdvanceToCycle(unsigned NextCycle);631 void ScheduleDAGRRList::AdvanceToCycle(unsigned NextCycle) { in AdvanceToCycle() argument632 if (NextCycle <= CurCycle) in AdvanceToCycle()636 AvailableQueue->setCurCycle(NextCycle); in AdvanceToCycle()639 CurCycle = NextCycle; in AdvanceToCycle()642 for (; CurCycle != NextCycle; ++CurCycle) { in AdvanceToCycle()
1040 void bumpCycle(unsigned NextCycle);