Lines Matching refs:ReadyCycle
1735 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles() local
1736 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()
1737 return ReadyCycle - CurrCycle; in getLatencyStallCycles()
1848 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) { in releaseNode() argument
1855 if (ReadyCycle > CurrCycle) in releaseNode()
1856 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall); in releaseNode()
1859 if (ReadyCycle < MinReadyCycle) in releaseNode()
1860 MinReadyCycle = ReadyCycle; in releaseNode()
1865 if ((!IsBuffered && ReadyCycle > CurrCycle) || checkHazard(SU)) in releaseNode()
1989 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode() local
1990 DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n"); in bumpNode()
1995 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue"); in bumpNode()
1998 if (ReadyCycle > NextCycle) { in bumpNode()
1999 NextCycle = ReadyCycle; in bumpNode()
2000 DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n"); in bumpNode()
2008 if (SU->isUnbuffered && ReadyCycle > NextCycle) in bumpNode()
2009 NextCycle = ReadyCycle; in bumpNode()
2111 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local
2113 if (ReadyCycle < MinReadyCycle) in releasePending()
2114 MinReadyCycle = ReadyCycle; in releasePending()
2116 if (!IsBuffered && ReadyCycle > CurrCycle) in releasePending()