Lines Matching defs:ReadyCycle

884     // This sets the scheduled node's ReadyCycle to CurrCycle. When updateQueues
885     // runs, it can then use the accurate ReadyCycle time to determine whether
2339   unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);
2340   if (ReadyCycle > CurrCycle)
2341     return ReadyCycle - CurrCycle;
2550 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle, bool InPQueue,
2555   // ReadyCycle was been bumped up to the CurrCycle when this node was
2557   // scheduling, so may now be greater than ReadyCycle.
2558   if (ReadyCycle > CurrCycle)
2559     MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall);
2562   if (ReadyCycle < MinReadyCycle)
2563     MinReadyCycle = ReadyCycle;
2568   bool HazardDetected = (!IsBuffered && ReadyCycle > CurrCycle) ||
2695   unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);
2696   LLVM_DEBUG(dbgs() << "  Ready @" << ReadyCycle << "c\n");
2701     assert(ReadyCycle <= CurrCycle && "Broken PendingQueue");
2704     if (ReadyCycle > NextCycle) {
2705       NextCycle = ReadyCycle;
2706       LLVM_DEBUG(dbgs() << "  *** Stall until: " << ReadyCycle << "\n");
2714     if (SU->isUnbuffered && ReadyCycle > NextCycle)
2715       NextCycle = ReadyCycle;
2849     unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle;
2851     if (ReadyCycle < MinReadyCycle)
2852       MinReadyCycle = ReadyCycle;
2857     releaseNode(SU, ReadyCycle, true, I);
2993 ///   DLat = max (N.depth - (CurrCycle - N.ReadyCycle) for N in Zone