Searched refs:next_use (Results 1 – 2 of 2) sorted by relevance
844 int RegisterAllocatorLinearScan::FindAvailableRegisterPair(size_t* next_use, size_t starting_at) co… in FindAvailableRegisterPair() argument853 if ((reg == kNoRegister) || (next_use[i] >= next_use[reg] in FindAvailableRegisterPair()854 && next_use[high_register] >= next_use[existing_high_register])) { in FindAvailableRegisterPair()856 if (next_use[i] == kMaxLifetimePosition in FindAvailableRegisterPair()857 && next_use[high_register] == kMaxLifetimePosition) { in FindAvailableRegisterPair()860 } else if (next_use[reg] <= starting_at || next_use[existing_high_register] <= starting_at) { in FindAvailableRegisterPair()877 int RegisterAllocatorLinearScan::FindAvailableRegister(size_t* next_use, LiveInterval* current) con… in FindAvailableRegister() argument890 if (next_use[i] == kMaxLifetimePosition) { in FindAvailableRegister()895 if (reg == kNoRegister || next_use[reg] != kMaxLifetimePosition) { in FindAvailableRegister()914 if (next_use[i] > next_use[reg]) { in FindAvailableRegister()[all …]
96 int FindAvailableRegisterPair(size_t* next_use, size_t starting_at) const;97 int FindAvailableRegister(size_t* next_use, LiveInterval* current) const;127 size_t* next_use);