Home | History | Annotate | Download | only in optimizing

Lines Matching refs:inactive

319     //     to inactive.
333 // (3) Remove currently inactive intervals that are dead at this position.
334 // Move inactive intervals that cover this position to active.
374 // For each inactive interval, set its register to be free until
379 LiveInterval* inactive = inactive_.Get(i);
380 DCHECK(inactive->HasRegister());
381 size_t next_intersection = inactive->FirstIntersectionWith(current);
383 free_until[inactive->GetRegister()] = next_intersection;
459 // For each inactive interval, find the next use of its register after the
464 LiveInterval* inactive = inactive_.Get(i);
465 DCHECK(inactive->HasRegister());
466 size_t next_intersection = inactive->FirstIntersectionWith(current);
468 if (inactive->IsFixed()) {
469 next_use[inactive->GetRegister()] =
470 std::min(next_intersection, next_use[inactive->GetRegister()]);
472 size_t use = inactive->FirstRegisterUseAfter(current->GetStart());
474 next_use[inactive->GetRegister()] = std::min(use, next_use[inactive->GetRegister()]);
515 LiveInterval* inactive = inactive_.Get(i);
516 if (inactive->GetRegister() == reg) {
517 size_t next_intersection = inactive->FirstIntersectionWith(current);
519 if (inactive->IsFixed()) {
523 LiveInterval* split = Split(inactive, current->GetStart());
525 handled_.Add(inactive);