Lines Matching defs:EarlyStart

2430       int EarlyStart = INT_MIN;
2432       Schedule.computeStart(SU, &EarlyStart, &LateStart, II, this);
2440           dbgs() << format("\tes: %8x ls: %8x\n", EarlyStart, LateStart));
2442       if (EarlyStart > LateStart)
2444       else if (EarlyStart != INT_MIN && LateStart == INT_MAX)
2446             Schedule.insert(SU, EarlyStart, EarlyStart + (int)II - 1, II);
2447       else if (EarlyStart == INT_MIN && LateStart != INT_MAX)
2450       else if (EarlyStart != INT_MIN && LateStart != INT_MAX) {
2451         LateStart = std::min(LateStart, EarlyStart + (int)II - 1);
2460           scheduleFound = Schedule.insert(SU, LateStart, EarlyStart, II);
2462           scheduleFound = Schedule.insert(SU, EarlyStart, LateStart, II);
2892           int EarlyStart = cycle + IE.getLatency() - IE.getDistance() * II;
2893           *MaxEarlyStart = std::max(*MaxEarlyStart, EarlyStart);