Lines Matching refs:Latency
1206 // Critical path through the DAG in expected latency.
1255 // The expected latency of the critical path in this scheduled zone.
1258 // The latency of dependence chains leading into this zone.
1271 // MOps * getMicroOpFactor and Latency * getLatencyFactor.
1280 // Is the scheduled region resource limited vs. latency limited.
1284 // Remember the greatest operand latency as an upper bound on the number of
1341 /// Get the number of latency cycles "covered" by the scheduled
1517 unsigned Latency = I->getLatency();
1519 Top.MaxObservedLatency = std::max(Latency, Top.MaxObservedLatency);
1521 if (SU->TopReadyCycle < PredReadyCycle + Latency)
1522 SU->TopReadyCycle = PredReadyCycle + Latency;
1538 unsigned Latency = I->getLatency();
1540 Bot.MaxObservedLatency = std::max(Latency, Bot.MaxObservedLatency);
1542 if (SU->BotReadyCycle < SuccReadyCycle + Latency)
1543 SU->BotReadyCycle = SuccReadyCycle + Latency;
1585 // Find the unscheduled node in ReadySUs with the highest latency.
1639 // based on the the total latency and resources inside and outside this
1642 // Compute remaining latency. We need this both to determine whether the
1643 // overall schedule has become latency-limited and whether the instructions
1644 // outside this zone are resource or latency limited.
1646 // The "dependent" latency is updated incrementally during scheduling as the
1651 // The "independent" latency is the max ready queue depth:
1654 // RemainingLatency is the greater of independent and dependent latency.
1686 dbgs() << " Latency limited both directions.\n");
1734 // Bypass getHazardType calls in case of long latency.
1983 << (IsResourceLimited ? " - Resource" : " - Latency")
2174 // Avoid serializing long latency dependence chains.
2238 unsigned Latency = 0;
2258 Latency = Cand.SU->getDepth();
2261 Latency = Cand.SU->getHeight();
2264 Latency = Cand.SU->getHeight();
2267 Latency = Cand.SU->getDepth();
2280 if (Latency)
2281 dbgs() << " " << Latency << " cycles ";
