Lines Matching refs:EarlyStart
2132 int EarlyStart = INT_MIN; in schedulePipeline() local
2138 Schedule.computeStart(SU, &EarlyStart, &LateStart, &SchedEnd, &SchedStart, in schedulePipeline()
2146 dbgs() << "\tes: " << EarlyStart << " ls: " << LateStart in schedulePipeline()
2150 if (EarlyStart > LateStart || SchedEnd < EarlyStart || in schedulePipeline()
2153 else if (EarlyStart != INT_MIN && LateStart == INT_MAX) { in schedulePipeline()
2154 SchedEnd = std::min(SchedEnd, EarlyStart + (int)II - 1); in schedulePipeline()
2155 scheduleFound = Schedule.insert(SU, EarlyStart, SchedEnd, II); in schedulePipeline()
2156 } else if (EarlyStart == INT_MIN && LateStart != INT_MAX) { in schedulePipeline()
2159 } else if (EarlyStart != INT_MIN && LateStart != INT_MAX) { in schedulePipeline()
2161 std::min(SchedEnd, std::min(LateStart, EarlyStart + (int)II - 1)); in schedulePipeline()
2166 scheduleFound = Schedule.insert(SU, SchedEnd, EarlyStart, II); in schedulePipeline()
2168 scheduleFound = Schedule.insert(SU, EarlyStart, SchedEnd, II); in schedulePipeline()
3581 int EarlyStart = cycle + DAG->getLatency(SU, Dep) - in computeStart() local
3583 *MaxEarlyStart = std::max(*MaxEarlyStart, EarlyStart); in computeStart()
3613 int EarlyStart = cycle + DAG->getLatency(SU, Dep) - in computeStart() local
3615 *MaxEarlyStart = std::max(*MaxEarlyStart, EarlyStart); in computeStart()