Searched refs:CurrCycle (Results 1 – 4 of 4) sorted by relevance
379 if (ReadyCycle > CurrCycle || checkHazard(SU)) in releaseNode()393 unsigned NextCycle = std::max(CurrCycle + 1, MinReadyCycle); in bumpCycle()397 CurrCycle = NextCycle; in bumpCycle()400 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()410 << CurrCycle << '\n'); in bumpCycle()434 LLVM_DEBUG(dbgs() << "*** Max instrs at cycle " << CurrCycle << '\n'); in bumpNode()438 << CurrCycle << '\n'); in bumpNode()457 if (ReadyCycle > CurrCycle) in releasePending()989 << (IsTopNode ? Top.CurrCycle : Bot.CurrCycle) << " (" in pickNode()1002 SU->TopReadyCycle = Top.CurrCycle; in schedNode()[all …]
1995 CurrCycle = 0; in reset()2078 if (ReadyCycle > CurrCycle) in getLatencyStallCycles()2079 return ReadyCycle - CurrCycle; in getLatencyStallCycles()2194 if (NRCycle > CurrCycle) { in checkHazard()2266 if (ReadyCycle > CurrCycle) in releaseNode()2311 CurrCycle = NextCycle; in bumpCycle()2314 for (; CurrCycle != NextCycle; ++CurrCycle) { in bumpCycle()2367 if (NextAvailable > CurrCycle) { in countResource()2400 unsigned NextCycle = CurrCycle; in bumpNode()2486 if (NextCycle > CurrCycle) in bumpNode()[all …]
137 unsigned CurrCycle = 0; member158 CurrCycle = 0; in init()200 if (CurrCycle >= CriticalPathLength) in isLatencyBound()203 return CriticalPathLength - CurrCycle <= PathLength; in isLatencyBound()
637 unsigned CurrCycle; variable710 unsigned getCurrCycle() const { return CurrCycle; } in getCurrCycle()722 return std::max(ExpectedLatency, CurrCycle); in getScheduledLatency()745 return std::max(CurrCycle * SchedModel->getLatencyFactor(), in getExecutedCount()