SchedBoundary::~SchedBoundary() { delete HazardRec; }
+/// Given a Count of resource usage and a Latency value, return true if a
+/// SchedBoundary becomes resource limited.
+static bool checkResourceLimit(unsigned LFactor, unsigned Count,
+ unsigned Latency) {
+ return (int)(Count - (Latency * LFactor)) > (int)LFactor;
+}
+
void SchedBoundary::reset() {
// A new HazardRec is created for each DAG and owned by SchedBoundary.
// Destroying and reconstructing it is very expensive though. So keep
}
}
CheckPending = true;
- unsigned LFactor = SchedModel->getLatencyFactor();
IsResourceLimited =
- (int)(getCriticalCount() - (getScheduledLatency() * LFactor))
- > (int)LFactor;
+ checkResourceLimit(SchedModel->getLatencyFactor(), getCriticalCount(),
+ getScheduledLatency());
DEBUG(dbgs() << "Cycle: " << CurrCycle << ' ' << Available.getName() << '\n');
}
<< " BotLatency SU(" << SU->NodeNum << ") " << BotLatency << "c\n");
}
// If we stall for any reason, bump the cycle.
- if (NextCycle > CurrCycle) {
+ if (NextCycle > CurrCycle)
bumpCycle(NextCycle);
- } else {
+ else
// After updating ZoneCritResIdx and ExpectedLatency, check if we're
// resource limited. If a stall occurred, bumpCycle does this.
- unsigned LFactor = SchedModel->getLatencyFactor();
IsResourceLimited =
- (int)(getCriticalCount() - (getScheduledLatency() * LFactor))
- > (int)LFactor;
- }
+ checkResourceLimit(SchedModel->getLatencyFactor(), getCriticalCount(),
+ getScheduledLatency());
+
// Update CurrMOps after calling bumpCycle to handle stalls, since bumpCycle
// resets CurrMOps. Loop to handle instructions with more MOps than issue in
// one cycle. Since we commonly reach the max MOps here, opportunistically
OtherZone ? OtherZone->getOtherResourceCount(OtherCritIdx) : 0;
bool OtherResLimited = false;
- if (SchedModel->hasInstrSchedModel()) {
- unsigned LFactor = SchedModel->getLatencyFactor();
- OtherResLimited = (int)(OtherCount - (RemLatency * LFactor)) > (int)LFactor;
- }
+ if (SchedModel->hasInstrSchedModel())
+ OtherResLimited = checkResourceLimit(SchedModel->getLatencyFactor(),
+ OtherCount, RemLatency);
+
// Schedule aggressively for latency in PostRA mode. We don't check for
// acyclic latency during PostRA, and highly out-of-order processors will
// skip PostRA scheduling.