Lines Matching refs:ReadyCycle
1829 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles() local
1830 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()
1831 return ReadyCycle - CurrCycle; in getLatencyStallCycles()
1942 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) { in releaseNode() argument
1949 if (ReadyCycle > CurrCycle) in releaseNode()
1950 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall); in releaseNode()
1953 if (ReadyCycle < MinReadyCycle) in releaseNode()
1954 MinReadyCycle = ReadyCycle; in releaseNode()
1959 if ((!IsBuffered && ReadyCycle > CurrCycle) || checkHazard(SU) || in releaseNode()
2083 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode() local
2084 DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n"); in bumpNode()
2089 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue"); in bumpNode()
2092 if (ReadyCycle > NextCycle) { in bumpNode()
2093 NextCycle = ReadyCycle; in bumpNode()
2094 DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n"); in bumpNode()
2102 if (SU->isUnbuffered && ReadyCycle > NextCycle) in bumpNode()
2103 NextCycle = ReadyCycle; in bumpNode()
2204 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local
2206 if (ReadyCycle < MinReadyCycle) in releasePending()
2207 MinReadyCycle = ReadyCycle; in releasePending()
2209 if (!IsBuffered && ReadyCycle > CurrCycle) in releasePending()