Searched refs:NextCycle (Results 1 – 10 of 10) sorted by relevance
47 void advanceToCycle(unsigned NextCycle);269 void GCNILPScheduler::advanceToCycle(unsigned NextCycle) { in advanceToCycle() argument270 if (NextCycle <= CurCycle) in advanceToCycle()272 CurCycle = NextCycle; in advanceToCycle()
2053 void SchedBoundary::bumpCycle(unsigned NextCycle) { in bumpCycle() argument2057 if (MinReadyCycle > NextCycle) in bumpCycle()2058 NextCycle = MinReadyCycle; in bumpCycle()2061 unsigned DecMOps = SchedModel->getIssueWidth() * (NextCycle - CurrCycle); in bumpCycle()2065 if ((NextCycle - CurrCycle) > DependentLatency) in bumpCycle()2068 DependentLatency -= (NextCycle - CurrCycle); in bumpCycle()2072 CurrCycle = NextCycle; in bumpCycle()2075 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()2105 countResource(unsigned PIdx, unsigned Cycles, unsigned NextCycle) { in countResource() argument2157 unsigned NextCycle = CurrCycle; in bumpNode() local[all …]
1984 void SchedBoundary::bumpCycle(unsigned NextCycle) { in bumpCycle() argument1987 if (MinReadyCycle > NextCycle) in bumpCycle()1988 NextCycle = MinReadyCycle; in bumpCycle()1991 unsigned DecMOps = SchedModel->getIssueWidth() * (NextCycle - CurrCycle); in bumpCycle()1995 if ((NextCycle - CurrCycle) > DependentLatency) in bumpCycle()1998 DependentLatency -= (NextCycle - CurrCycle); in bumpCycle()2002 CurrCycle = NextCycle; in bumpCycle()2005 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()2035 countResource(unsigned PIdx, unsigned Cycles, unsigned NextCycle) { in countResource() argument2086 unsigned NextCycle = CurrCycle; in bumpNode() local[all …]
308 unsigned NextCycle = std::max(CurrCycle + 1, MinReadyCycle); in bumpCycle() local312 CurrCycle = NextCycle; in bumpCycle()315 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()
368 unsigned NextCycle = std::max(CurrCycle + 1, MinReadyCycle); in bumpCycle() local372 CurrCycle = NextCycle; in bumpCycle()375 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()
248 void AdvanceToCycle(unsigned NextCycle);624 void ScheduleDAGRRList::AdvanceToCycle(unsigned NextCycle) { in AdvanceToCycle() argument625 if (NextCycle <= CurCycle) in AdvanceToCycle()629 AvailableQueue->setCurCycle(NextCycle); in AdvanceToCycle()632 CurCycle = NextCycle; in AdvanceToCycle()635 for (; CurCycle != NextCycle; ++CurCycle) { in AdvanceToCycle()
221 void AdvanceToCycle(unsigned NextCycle);600 void ScheduleDAGRRList::AdvanceToCycle(unsigned NextCycle) { in AdvanceToCycle() argument601 if (NextCycle <= CurCycle) in AdvanceToCycle()605 AvailableQueue->setCurCycle(NextCycle); in AdvanceToCycle()608 CurCycle = NextCycle; in AdvanceToCycle()611 for (; CurCycle != NextCycle; ++CurCycle) { in AdvanceToCycle()
227 void AdvanceToCycle(unsigned NextCycle);478 void ScheduleDAGRRList::AdvanceToCycle(unsigned NextCycle) { in AdvanceToCycle() argument479 if (NextCycle <= CurCycle) in AdvanceToCycle()483 AvailableQueue->setCurCycle(NextCycle); in AdvanceToCycle()486 CurCycle = NextCycle; in AdvanceToCycle()489 for (; CurCycle != NextCycle; ++CurCycle) { in AdvanceToCycle()
735 void bumpCycle(unsigned NextCycle);
762 void bumpCycle(unsigned NextCycle);