2032       int LateStart = INT_MAX;  in schedulePipeline()  local
2037       Schedule.computeStart(SU, &EarlyStart, &LateStart, &SchedEnd, &SchedStart,  in schedulePipeline()
2047                          LateStart, SchedEnd, SchedStart);  in schedulePipeline()
2050       if (EarlyStart > LateStart || SchedEnd < EarlyStart ||  in schedulePipeline()
2051           SchedStart > LateStart)  in schedulePipeline()
2053       else if (EarlyStart != INT_MIN && LateStart == INT_MAX) {  in schedulePipeline()
2056       } else if (EarlyStart == INT_MIN && LateStart != INT_MAX) {  in schedulePipeline()
2057         SchedStart = std::max(SchedStart, LateStart - (int)II + 1);  in schedulePipeline()
2058         scheduleFound = Schedule.insert(SU, LateStart, SchedStart, II);  in schedulePipeline()
2059       } else if (EarlyStart != INT_MIN && LateStart != INT_MAX) {  in schedulePipeline()
2061             std::min(SchedEnd, std::min(LateStart, EarlyStart + (int)II - 1));  in schedulePipeline()
2494             int LateStart = cycle - Dep.getLatency() +  in computeStart()  local
2496             *MinLateStart = std::min(*MinLateStart, LateStart);  in computeStart()
2510             int LateStart = cycle - Dep.getLatency() +  in computeStart()  local
2512             *MinLateStart = std::min(*MinLateStart, LateStart);  in computeStart()