Searched refs:ReadyCycle (Results 1 – 5 of 5) sorted by relevance
348 unsigned ReadyCycle) { in releaseNode() argument349 if (ReadyCycle < MinReadyCycle) in releaseNode()350 MinReadyCycle = ReadyCycle; in releaseNode()354 if (ReadyCycle > CurrCycle || checkHazard(SU)) in releaseNode()428 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local430 if (ReadyCycle < MinReadyCycle) in releasePending()431 MinReadyCycle = ReadyCycle; in releasePending()433 if (ReadyCycle > CurrCycle) in releasePending()
197 void releaseNode(SUnit *SU, unsigned ReadyCycle);
2079 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()2080 return ReadyCycle - CurrCycle; in getLatencyStallCycles()2267 if (ReadyCycle > CurrCycle) in releaseNode()2271 if (ReadyCycle < MinReadyCycle) in releaseNode()2272 MinReadyCycle = ReadyCycle; in releaseNode()2407 if (ReadyCycle > NextCycle) { in bumpNode()2408 NextCycle = ReadyCycle; in bumpNode()2418 NextCycle = ReadyCycle; in bumpNode()2534 if (ReadyCycle < MinReadyCycle) in releasePending()2535 MinReadyCycle = ReadyCycle; in releasePending()[all …]
781 void releaseNode(SUnit *SU, unsigned ReadyCycle, bool InPQueue,789 unsigned Cycles, unsigned ReadyCycle);
612 unsigned ReadyCycle = PendingQueue[i]->getHeight(); in ReleasePending() local613 if (ReadyCycle < MinAvailableCycle) in ReleasePending()614 MinAvailableCycle = ReadyCycle; in ReleasePending()662 unsigned ReadyCycle = SU->getHeight(); in AdvancePastStalls() local668 AdvanceToCycle(ReadyCycle); in AdvancePastStalls()