1984 void SchedBoundary::bumpCycle(unsigned NextCycle) {  in bumpCycle()  argument
1987     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()  argument
2086   unsigned NextCycle = CurrCycle;  in bumpNode()  local
2092     if (ReadyCycle > NextCycle) {  in bumpNode()
2093       NextCycle = ReadyCycle;  in bumpNode()
2102     if (SU->isUnbuffered && ReadyCycle > NextCycle)  in bumpNode()
2103       NextCycle = ReadyCycle;  in bumpNode()
2131         countResource(PI->ProcResourceIdx, PI->Cycles, NextCycle);  in bumpNode()
2132       if (RCycle > NextCycle)  in bumpNode()
2133         NextCycle = RCycle;  in bumpNode()
2147               std::max(getNextResourceCycle(PIdx, 0), NextCycle + PI->Cycles);  in bumpNode()
2150             ReservedCycles[PIdx] = NextCycle;  in bumpNode()
2169   if (NextCycle > CurrCycle) {  in bumpNode()
2170     bumpCycle(NextCycle);  in bumpNode()
2187     bumpCycle(++NextCycle);  in bumpNode()