Lines Matching refs:ReadyCycle
733 // This sets the scheduled node's ReadyCycle to CurrCycle. When updateQueues
734 // runs, it can then use the accurate ReadyCycle time to determine whether
1829 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);
1830 if (ReadyCycle > CurrCycle)
1831 return ReadyCycle - CurrCycle;
1942 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) {
1946 // ReadyCycle was been bumped up to the CurrCycle when this node was
1948 // scheduling, so may now be greater than ReadyCycle.
1949 if (ReadyCycle > CurrCycle)
1950 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall);
1953 if (ReadyCycle < MinReadyCycle)
1954 MinReadyCycle = ReadyCycle;
1959 if ((!IsBuffered && ReadyCycle > CurrCycle) || checkHazard(SU) ||
2083 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);
2084 DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n");
2089 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue");
2092 if (ReadyCycle > NextCycle) {
2093 NextCycle = ReadyCycle;
2094 DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n");
2102 if (SU->isUnbuffered && ReadyCycle > NextCycle)
2103 NextCycle = ReadyCycle;
2204 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle;
2206 if (ReadyCycle < MinReadyCycle)
2207 MinReadyCycle = ReadyCycle;
2209 if (!IsBuffered && ReadyCycle > CurrCycle)
2333 // DLat = max (N.depth - (CurrCycle - N.ReadyCycle) for N in Zone
