Lines Matching refs:ReadyCycle
2078 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles() local
2079 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()
2080 return ReadyCycle - CurrCycle; in getLatencyStallCycles()
2259 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle, bool InPQueue, in releaseNode() argument
2267 if (ReadyCycle > CurrCycle) in releaseNode()
2268 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall); in releaseNode()
2271 if (ReadyCycle < MinReadyCycle) in releaseNode()
2272 MinReadyCycle = ReadyCycle; in releaseNode()
2277 bool HazardDetected = (!IsBuffered && ReadyCycle > CurrCycle) || in releaseNode()
2398 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode() local
2399 LLVM_DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n"); in bumpNode()
2404 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue"); in bumpNode()
2407 if (ReadyCycle > NextCycle) { in bumpNode()
2408 NextCycle = ReadyCycle; in bumpNode()
2409 LLVM_DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n"); in bumpNode()
2417 if (SU->isUnbuffered && ReadyCycle > NextCycle) in bumpNode()
2418 NextCycle = ReadyCycle; in bumpNode()
2532 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local
2534 if (ReadyCycle < MinReadyCycle) in releasePending()
2535 MinReadyCycle = ReadyCycle; in releasePending()
2540 releaseNode(SU, ReadyCycle, true, I); in releasePending()