Lines Matching refs:ReadyCycle
1940 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles() local
1941 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()
1942 return ReadyCycle - CurrCycle; in getLatencyStallCycles()
2065 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) { in releaseNode() argument
2072 if (ReadyCycle > CurrCycle) in releaseNode()
2073 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall); in releaseNode()
2076 if (ReadyCycle < MinReadyCycle) in releaseNode()
2077 MinReadyCycle = ReadyCycle; in releaseNode()
2082 if ((!IsBuffered && ReadyCycle > CurrCycle) || checkHazard(SU) || in releaseNode()
2191 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode() local
2192 LLVM_DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n"); in bumpNode()
2197 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue"); in bumpNode()
2200 if (ReadyCycle > NextCycle) { in bumpNode()
2201 NextCycle = ReadyCycle; in bumpNode()
2202 LLVM_DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n"); in bumpNode()
2210 if (SU->isUnbuffered && ReadyCycle > NextCycle) in bumpNode()
2211 NextCycle = ReadyCycle; in bumpNode()
2324 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local
2326 if (ReadyCycle < MinReadyCycle) in releasePending()
2327 MinReadyCycle = ReadyCycle; in releasePending()
2329 if (!IsBuffered && ReadyCycle > CurrCycle) in releasePending()