Lines Matching refs:ReadyCycle
2301 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles() local
2302 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()
2303 return ReadyCycle - CurrCycle; in getLatencyStallCycles()
2512 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle, bool InPQueue, in releaseNode() argument
2520 if (ReadyCycle > CurrCycle) in releaseNode()
2521 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall); in releaseNode()
2524 if (ReadyCycle < MinReadyCycle) in releaseNode()
2525 MinReadyCycle = ReadyCycle; in releaseNode()
2530 bool HazardDetected = (!IsBuffered && ReadyCycle > CurrCycle) || in releaseNode()
2657 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode() local
2658 LLVM_DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n"); in bumpNode()
2663 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue"); in bumpNode()
2666 if (ReadyCycle > NextCycle) { in bumpNode()
2667 NextCycle = ReadyCycle; in bumpNode()
2668 LLVM_DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n"); in bumpNode()
2676 if (SU->isUnbuffered && ReadyCycle > NextCycle) in bumpNode()
2677 NextCycle = ReadyCycle; in bumpNode()
2811 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local
2813 if (ReadyCycle < MinReadyCycle) in releasePending()
2814 MinReadyCycle = ReadyCycle; in releasePending()
2819 releaseNode(SU, ReadyCycle, true, I); in releasePending()