2031       int EarlyStart = INT_MIN;  in schedulePipeline()  local
2037       Schedule.computeStart(SU, &EarlyStart, &LateStart, &SchedEnd, &SchedStart,  in schedulePipeline()
2046         dbgs() << format("\tes: %8x ls: %8x me: %8x ms: %8x\n", EarlyStart,  in schedulePipeline()
2050       if (EarlyStart > LateStart || SchedEnd < EarlyStart ||  in schedulePipeline()
2053       else if (EarlyStart != INT_MIN && LateStart == INT_MAX) {  in schedulePipeline()
2054         SchedEnd = std::min(SchedEnd, EarlyStart + (int)II - 1);  in schedulePipeline()
2055         scheduleFound = Schedule.insert(SU, EarlyStart, SchedEnd, II);  in schedulePipeline()
2056       } else if (EarlyStart == INT_MIN && LateStart != INT_MAX) {  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()
2066           scheduleFound = Schedule.insert(SU, SchedEnd, EarlyStart, II);  in schedulePipeline()
2068           scheduleFound = Schedule.insert(SU, EarlyStart, SchedEnd, II);  in schedulePipeline()
2486             int EarlyStart = cycle + Dep.getLatency() -  in computeStart()  local
2488             *MaxEarlyStart = std::max(*MaxEarlyStart, EarlyStart);  in computeStart()
2518             int EarlyStart = cycle + Dep.getLatency() -  in computeStart()  local
2520             *MaxEarlyStart = std::max(*MaxEarlyStart, EarlyStart);  in computeStart()