Searched refs:next_use (Results 1 – 2 of 2) sorted by relevance
746 int RegisterAllocatorLinearScan::FindAvailableRegisterPair(size_t* next_use, size_t starting_at) co… in FindAvailableRegisterPair() argument755 if ((reg == kNoRegister) || (next_use[i] >= next_use[reg] in FindAvailableRegisterPair()756 && next_use[high_register] >= next_use[existing_high_register])) { in FindAvailableRegisterPair()758 if (next_use[i] == kMaxLifetimePosition in FindAvailableRegisterPair()759 && next_use[high_register] == kMaxLifetimePosition) { in FindAvailableRegisterPair()762 } else if (next_use[reg] <= starting_at || next_use[existing_high_register] <= starting_at) { in FindAvailableRegisterPair()777 int RegisterAllocatorLinearScan::FindAvailableRegister(size_t* next_use, LiveInterval* current) con… in FindAvailableRegister() argument790 if (next_use[i] == kMaxLifetimePosition) { in FindAvailableRegister()795 if (reg == kNoRegister || next_use[reg] != kMaxLifetimePosition) { in FindAvailableRegister()814 if (next_use[i] > next_use[reg]) { in FindAvailableRegister()[all …]
97 int FindAvailableRegisterPair(size_t* next_use, size_t starting_at) const;98 int FindAvailableRegister(size_t* next_use, LiveInterval* current) const;105 size_t* next_use);