Searched refs:TopReadyCycle (Results 1 – 5 of 5) sorted by relevance
309 unsigned PredReadyCycle = PI.getSUnit()->TopReadyCycle; in releaseTopNode()314 if (SU->TopReadyCycle < PredReadyCycle + MinLatency) in releaseTopNode()315 SU->TopReadyCycle = PredReadyCycle + MinLatency; in releaseTopNode()319 Top.releaseNode(SU, SU->TopReadyCycle); in releaseTopNode()449 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending()999 SU->TopReadyCycle = Top.CurrCycle; in schedNode()
959 if (SuccSU->TopReadyCycle < SU->TopReadyCycle + SuccEdge->getLatency()) in releaseSucc()960 SuccSU->TopReadyCycle = SU->TopReadyCycle + SuccEdge->getLatency(); in releaseSucc()1249 const unsigned FirstCycle = getSUnit(&*(std::begin(*this)))->TopReadyCycle; in dumpScheduleTraceTopDown()1250 unsigned LastCycle = getSUnit(&*(std::prev(std::end(*this))))->TopReadyCycle; in dumpScheduleTraceTopDown()1259 if (SU->TopReadyCycle + PI->ReleaseAtCycle - 1 > LastCycle) in dumpScheduleTraceTopDown()1260 LastCycle = SU->TopReadyCycle + PI->ReleaseAtCycle - 1; in dumpScheduleTraceTopDown()1280 if (C == SU->TopReadyCycle) in dumpScheduleTraceTopDown()1305 for (; C < SU->TopReadyCycle + PI.AcquireAtCycle; ++C) { in dumpScheduleTraceTopDown()2615 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles()2991 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode()[all …]
1199 dbgs() << " [TopReadyCycle = " << SU.TopReadyCycle in dumpNode()
1269 Top.releaseNode(SU, SU->TopReadyCycle, false); in releaseTopNode()1367 Top.releaseNode(SU, SU->TopReadyCycle, false); in releaseTopNode()
280 unsigned TopReadyCycle = 0; ///< Cycle relative to start when node is ready. variable