2042       int EarlyStart = INT_MIN;  in schedulePipeline()  local
2048       Schedule.computeStart(SU, &EarlyStart, &LateStart, &SchedEnd, &SchedStart,  in schedulePipeline()
2057         dbgs() << format("\tes: %8x ls: %8x me: %8x ms: %8x\n", EarlyStart,  in schedulePipeline()
2061       if (EarlyStart > LateStart || SchedEnd < EarlyStart ||  in schedulePipeline()
2064       else if (EarlyStart != INT_MIN && LateStart == INT_MAX) {  in schedulePipeline()
2065         SchedEnd = std::min(SchedEnd, EarlyStart + (int)II - 1);  in schedulePipeline()
2066         scheduleFound = Schedule.insert(SU, EarlyStart, SchedEnd, II);  in schedulePipeline()
2067       } else if (EarlyStart == INT_MIN && LateStart != INT_MAX) {  in schedulePipeline()
2070       } else if (EarlyStart != INT_MIN && LateStart != INT_MAX) {  in schedulePipeline()
2072             std::min(SchedEnd, std::min(LateStart, EarlyStart + (int)II - 1));  in schedulePipeline()
2077           scheduleFound = Schedule.insert(SU, SchedEnd, EarlyStart, II);  in schedulePipeline()
2079           scheduleFound = Schedule.insert(SU, EarlyStart, SchedEnd, II);  in schedulePipeline()
2492             int EarlyStart = cycle + Dep.getLatency() -  in computeStart()  local
2494             *MaxEarlyStart = std::max(*MaxEarlyStart, EarlyStart);  in computeStart()
2524             int EarlyStart = cycle + Dep.getLatency() -  in computeStart()  local
2526             *MaxEarlyStart = std::max(*MaxEarlyStart, EarlyStart);  in computeStart()