2473       int LateStart = INT_MAX;  in schedulePipeline()  local
2474       Schedule.computeStart(SU, &EarlyStart, &LateStart, II, this);  in schedulePipeline()
2482           dbgs() << format("\tes: %8x ls: %8x\n", EarlyStart, LateStart));  in schedulePipeline()
2484       if (EarlyStart > LateStart)  in schedulePipeline()
2486       else if (EarlyStart != INT_MIN && LateStart == INT_MAX)  in schedulePipeline()
2489       else if (EarlyStart == INT_MIN && LateStart != INT_MAX)  in schedulePipeline()
2491             Schedule.insert(SU, LateStart, LateStart - (int)II + 1, II);  in schedulePipeline()
2492       else if (EarlyStart != INT_MIN && LateStart != INT_MAX) {  in schedulePipeline()
2493         LateStart = std::min(LateStart, EarlyStart + (int)II - 1);  in schedulePipeline()
2502           scheduleFound = Schedule.insert(SU, LateStart, EarlyStart, II);  in schedulePipeline()
2504           scheduleFound = Schedule.insert(SU, EarlyStart, LateStart, II);  in schedulePipeline()
2940             int LateStart = cycle - Dep.getLatency() +  in computeStart()  local
2942             *MinLateStart = std::min(*MinLateStart, LateStart);  in computeStart()
2956             int LateStart = cycle - Dep.getLatency() +  in computeStart()  local
2958             *MinLateStart = std::min(*MinLateStart, LateStart);  in computeStart()