Lines Matching refs:ReadyCycle
2342 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles() local
2343 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()
2344 return ReadyCycle - CurrCycle; in getLatencyStallCycles()
2553 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle, bool InPQueue, in releaseNode() argument
2561 if (ReadyCycle > CurrCycle) in releaseNode()
2562 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall); in releaseNode()
2565 if (ReadyCycle < MinReadyCycle) in releaseNode()
2566 MinReadyCycle = ReadyCycle; in releaseNode()
2571 bool HazardDetected = (!IsBuffered && ReadyCycle > CurrCycle) || in releaseNode()
2698 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode() local
2699 LLVM_DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n"); in bumpNode()
2704 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue"); in bumpNode()
2707 if (ReadyCycle > NextCycle) { in bumpNode()
2708 NextCycle = ReadyCycle; in bumpNode()
2709 LLVM_DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n"); in bumpNode()
2717 if (SU->isUnbuffered && ReadyCycle > NextCycle) in bumpNode()
2718 NextCycle = ReadyCycle; in bumpNode()
2852 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local
2854 if (ReadyCycle < MinReadyCycle) in releasePending()
2855 MinReadyCycle = ReadyCycle; in releasePending()
2860 releaseNode(SU, ReadyCycle, true, I); in releasePending()