Lines Matching defs:ReadyCycle
889 // This sets the scheduled node's ReadyCycle to CurrCycle. When updateQueues
890 // runs, it can then use the accurate ReadyCycle time to determine whether
2342 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);
2343 if (ReadyCycle > CurrCycle)
2344 return ReadyCycle - CurrCycle;
2553 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle, bool InPQueue,
2558 // ReadyCycle was been bumped up to the CurrCycle when this node was
2560 // scheduling, so may now be greater than ReadyCycle.
2561 if (ReadyCycle > CurrCycle)
2562 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall);
2565 if (ReadyCycle < MinReadyCycle)
2566 MinReadyCycle = ReadyCycle;
2571 bool HazardDetected = (!IsBuffered && ReadyCycle > CurrCycle) ||
2698 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);
2699 LLVM_DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n");
2704 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue");
2707 if (ReadyCycle > NextCycle) {
2708 NextCycle = ReadyCycle;
2709 LLVM_DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n");
2717 if (SU->isUnbuffered && ReadyCycle > NextCycle)
2718 NextCycle = ReadyCycle;
2852 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle;
2854 if (ReadyCycle < MinReadyCycle)
2855 MinReadyCycle = ReadyCycle;
2860 releaseNode(SU, ReadyCycle, true, I);
2996 /// DLat = max (N.depth - (CurrCycle - N.ReadyCycle) for N in Zone