2293 void SchedBoundary::bumpCycle(unsigned NextCycle) {  in bumpCycle()  argument
2297     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()  argument
2401   unsigned NextCycle = CurrCycle;  in bumpNode()  local
2407     if (ReadyCycle > NextCycle) {  in bumpNode()
2408       NextCycle = ReadyCycle;  in bumpNode()
2417     if (SU->isUnbuffered && ReadyCycle > NextCycle)  in bumpNode()
2418       NextCycle = ReadyCycle;  in bumpNode()
2447         countResource(SC, PI->ProcResourceIdx, PI->Cycles, NextCycle);  in bumpNode()
2448       if (RCycle > NextCycle)  in bumpNode()
2449         NextCycle = RCycle;  in bumpNode()
2466                 std::max(ReservedUntil, NextCycle + PI->Cycles);  in bumpNode()
2468             ReservedCycles[InstanceIdx] = NextCycle;  in bumpNode()
2487   if (NextCycle > CurrCycle)  in bumpNode()
2488     bumpCycle(NextCycle);  in bumpNode()
2510     bumpCycle(++NextCycle);  in bumpNode()
2516     bumpCycle(++NextCycle);  in bumpNode()