2077   unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);  in getLatencyStallCycles()  local
2078   if (ReadyCycle > CurrCycle)  in getLatencyStallCycles()
2079     return ReadyCycle - CurrCycle;  in getLatencyStallCycles()
2258 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle, bool InPQueue,  in releaseNode()  argument
2266   if (ReadyCycle > CurrCycle)  in releaseNode()
2267     MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall);  in releaseNode()
2270   if (ReadyCycle < MinReadyCycle)  in releaseNode()
2271     MinReadyCycle = ReadyCycle;  in releaseNode()
2276   bool HazardDetected = (!IsBuffered && ReadyCycle > CurrCycle) ||  in releaseNode()
2397   unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);  in bumpNode()  local
2398   LLVM_DEBUG(dbgs() << "  Ready @" << ReadyCycle << "c\n");  in bumpNode()
2403     assert(ReadyCycle <= CurrCycle && "Broken PendingQueue");  in bumpNode()
2406     if (ReadyCycle > NextCycle) {  in bumpNode()
2407       NextCycle = ReadyCycle;  in bumpNode()
2408       LLVM_DEBUG(dbgs() << "  *** Stall until: " << ReadyCycle << "\n");  in bumpNode()
2416     if (SU->isUnbuffered && ReadyCycle > NextCycle)  in bumpNode()
2417       NextCycle = ReadyCycle;  in bumpNode()
2531     unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle;  in releasePending()  local
2533     if (ReadyCycle < MinReadyCycle)  in releasePending()
2534       MinReadyCycle = ReadyCycle;  in releasePending()
2539     releaseNode(SU, ReadyCycle, true, I);  in releasePending()