Searched refs:next_use (Results 1 – 2 of 2) sorted by relevance
823 int RegisterAllocator::FindAvailableRegisterPair(size_t* next_use, size_t starting_at) const { in FindAvailableRegisterPair() argument832 if ((reg == kNoRegister) || (next_use[i] >= next_use[reg] in FindAvailableRegisterPair()833 && next_use[high_register] >= next_use[existing_high_register])) { in FindAvailableRegisterPair()835 if (next_use[i] == kMaxLifetimePosition in FindAvailableRegisterPair()836 && next_use[high_register] == kMaxLifetimePosition) { in FindAvailableRegisterPair()839 } else if (next_use[reg] <= starting_at || next_use[existing_high_register] <= starting_at) { in FindAvailableRegisterPair()848 int RegisterAllocator::FindAvailableRegister(size_t* next_use) const { in FindAvailableRegister()853 if (reg == kNoRegister || next_use[i] > next_use[reg]) { in FindAvailableRegister()855 if (next_use[i] == kMaxLifetimePosition) break; in FindAvailableRegister()863 size_t* next_use) { in TrySplitNonPairOrUnalignedPairIntervalAt() argument[all …]
143 int FindAvailableRegisterPair(size_t* next_use, size_t starting_at) const;144 int FindAvailableRegister(size_t* next_use) const;150 size_t* next_use);