Searched refs:ReadyCycle (Results 1 – 5 of 5) sorted by relevance
285 unsigned ReadyCycle) { in releaseNode() argument286 if (ReadyCycle < MinReadyCycle) in releaseNode()287 MinReadyCycle = ReadyCycle; in releaseNode()291 if (ReadyCycle > CurrCycle || checkHazard(SU)) in releaseNode()364 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local366 if (ReadyCycle < MinReadyCycle) in releasePending()367 MinReadyCycle = ReadyCycle; in releasePending()369 if (ReadyCycle > CurrCycle) in releasePending()
178 void releaseNode(SUnit *SU, unsigned ReadyCycle);
1662 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles() local1663 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()1664 return ReadyCycle - CurrCycle; in getLatencyStallCycles()1775 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) { in releaseNode() argument1782 if (ReadyCycle > CurrCycle) in releaseNode()1783 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall); in releaseNode()1786 if (ReadyCycle < MinReadyCycle) in releaseNode()1787 MinReadyCycle = ReadyCycle; in releaseNode()1792 if ((!IsBuffered && ReadyCycle > CurrCycle) || checkHazard(SU)) in releaseNode()1916 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode() local[all …]
711 void releaseNode(SUnit *SU, unsigned ReadyCycle);721 unsigned countResource(unsigned PIdx, unsigned Cycles, unsigned ReadyCycle);
583 unsigned ReadyCycle = PendingQueue[i]->getHeight(); in ReleasePending() local584 if (ReadyCycle < MinAvailableCycle) in ReleasePending()585 MinAvailableCycle = ReadyCycle; in ReleasePending()633 unsigned ReadyCycle = SU->getHeight(); in AdvancePastStalls() local639 AdvanceToCycle(ReadyCycle); in AdvancePastStalls()