Lines Matching refs:ReadyCycle
1662 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles() local
1663 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()
1664 return ReadyCycle - CurrCycle; in getLatencyStallCycles()
1775 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) { in releaseNode() argument
1782 if (ReadyCycle > CurrCycle) in releaseNode()
1783 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall); in releaseNode()
1786 if (ReadyCycle < MinReadyCycle) in releaseNode()
1787 MinReadyCycle = ReadyCycle; in releaseNode()
1792 if ((!IsBuffered && ReadyCycle > CurrCycle) || checkHazard(SU)) in releaseNode()
1916 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode() local
1917 DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n"); in bumpNode()
1922 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue"); in bumpNode()
1925 if (ReadyCycle > NextCycle) { in bumpNode()
1926 NextCycle = ReadyCycle; in bumpNode()
1927 DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n"); in bumpNode()
1935 if (SU->isUnbuffered && ReadyCycle > NextCycle) in bumpNode()
1936 NextCycle = ReadyCycle; in bumpNode()
2038 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local
2040 if (ReadyCycle < MinReadyCycle) in releasePending()
2041 MinReadyCycle = ReadyCycle; in releasePending()
2043 if (!IsBuffered && ReadyCycle > CurrCycle) in releasePending()