Searched refs:ReadyCycle (Results 1 – 5 of 5) sorted by relevance
289 unsigned ReadyCycle) { in releaseNode() argument290 if (ReadyCycle < MinReadyCycle) in releaseNode()291 MinReadyCycle = ReadyCycle; in releaseNode()295 if (ReadyCycle > CurrCycle || checkHazard(SU)) in releaseNode()368 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending() local370 if (ReadyCycle < MinReadyCycle) in releasePending()371 MinReadyCycle = ReadyCycle; in releasePending()373 if (ReadyCycle > CurrCycle) in releasePending()
178 void releaseNode(SUnit *SU, unsigned ReadyCycle);
1735 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles() local1736 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()1737 return ReadyCycle - CurrCycle; in getLatencyStallCycles()1848 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) { in releaseNode() argument1855 if (ReadyCycle > CurrCycle) in releaseNode()1856 MaxObservedStall = std::max(ReadyCycle - CurrCycle, MaxObservedStall); in releaseNode()1859 if (ReadyCycle < MinReadyCycle) in releaseNode()1860 MinReadyCycle = ReadyCycle; in releaseNode()1865 if ((!IsBuffered && ReadyCycle > CurrCycle) || checkHazard(SU)) in releaseNode()1989 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode() local[all …]
721 void releaseNode(SUnit *SU, unsigned ReadyCycle);731 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()