Lines Matching refs:split
195 // Fixed interval is never split and never moves to unhandled_.
215 // Fixed interval is never split and never moves to unhandled_.
380 // Split just before first register use.
383 LiveInterval* split
386 AddSorted(&unhandled, split);
623 // An interval that starts an instruction (that is, it is not split), may
637 // TODO: Handle non-split intervals last in the work list.
659 // Thanks to SSA, a non-split interval starting in a hole of an
723 // covered by `current`, split `current` before the position where
725 LiveInterval* split = SplitBetween(current, current->GetStart(), free_until[reg]);
726 DCHECK(split != nullptr);
727 AddSorted(unhandled_, split);
842 // Split the first interval found that is either:
849 LiveInterval* split = Split(active, position);
850 if (split != active) {
854 AddSorted(unhandled_, split);
869 // case the low interval had to split both intervals, we may end up in a
871 // We must still proceed in order to split currently active and inactive
907 // Thanks to SSA, a non-split interval starting in a hole of an
966 // We split the first interval found, and put ourselves first in the
978 // register, we split this interval just before its first register use.
980 LiveInterval* split = SplitBetween(current, current->GetStart(), first_register_use - 1);
981 DCHECK(current != split);
982 AddSorted(unhandled_, split);
994 LiveInterval* split = Split(active, current->GetStart());
995 if (split != active) {
999 AddSorted(unhandled_, split);
1011 // Thanks to SSA, a non-split interval starting in a hole of an
1019 LiveInterval* split = Split(current, next_intersection);
1020 DCHECK_NE(split, current);
1021 AddSorted(unhandled_, split);
1023 // Split at the start of `current`, which will lead to splitting
1025 LiveInterval* split = Split(inactive, current->GetStart());
1027 DCHECK_NE(split, inactive);
1031 AddSorted(unhandled_, split);
