Lines Matching refs:ReadyCycle
722 // This sets the scheduled node's ReadyCycle to CurrCycle. When updateQueues
723 // runs, it can then use the accurate ReadyCycle time to determine whether
1735 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);
1736 if (ReadyCycle > CurrCycle)
1737 return ReadyCycle - CurrCycle;
1848 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) {
1852 // ReadyCycle was been bumped up to the CurrCycle when this node was
1854 // scheduling, so may now be greater than ReadyCycle.
1855 if (ReadyCycle > CurrCycle)
1856 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall);
1859 if (ReadyCycle < MinReadyCycle)
1860 MinReadyCycle = ReadyCycle;
1865 if ((!IsBuffered && ReadyCycle > CurrCycle) || checkHazard(SU))
1989 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);
1990 DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n");
1995 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue");
1998 if (ReadyCycle > NextCycle) {
1999 NextCycle = ReadyCycle;
2000 DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n");
2008 if (SU->isUnbuffered && ReadyCycle > NextCycle)
2009 NextCycle = ReadyCycle;
2111 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle;
2113 if (ReadyCycle < MinReadyCycle)
2114 MinReadyCycle = ReadyCycle;
2116 if (!IsBuffered && ReadyCycle > CurrCycle)
2236 // DLat = max (N.depth - (CurrCycle - N.ReadyCycle) for N in Zone
