379     LiveInterval* inactive = inactive_.Get(i);  in TryAllocateFreeReg()  local
380     DCHECK(inactive->HasRegister());  in TryAllocateFreeReg()
381     size_t next_intersection = inactive->FirstIntersectionWith(current);  in TryAllocateFreeReg()
383       free_until[inactive->GetRegister()] = next_intersection;  in TryAllocateFreeReg()
464     LiveInterval* inactive = inactive_.Get(i);  in AllocateBlockedReg()  local
465     DCHECK(inactive->HasRegister());  in AllocateBlockedReg()
466     size_t next_intersection = inactive->FirstIntersectionWith(current);  in AllocateBlockedReg()
468       if (inactive->IsFixed()) {  in AllocateBlockedReg()
469         next_use[inactive->GetRegister()] =  in AllocateBlockedReg()
470             std::min(next_intersection, next_use[inactive->GetRegister()]);  in AllocateBlockedReg()
472         size_t use = inactive->FirstRegisterUseAfter(current->GetStart());  in AllocateBlockedReg()
474           next_use[inactive->GetRegister()] = std::min(use, next_use[inactive->GetRegister()]);  in AllocateBlockedReg()
515       LiveInterval* inactive = inactive_.Get(i);  in AllocateBlockedReg()  local
516       if (inactive->GetRegister() == reg) {  in AllocateBlockedReg()
517         size_t next_intersection = inactive->FirstIntersectionWith(current);  in AllocateBlockedReg()
519           if (inactive->IsFixed()) {  in AllocateBlockedReg()
523             LiveInterval* split = Split(inactive, current->GetStart());  in AllocateBlockedReg()
525             handled_.Add(inactive);  in AllocateBlockedReg()