Lines Matching defs:next_use
823 int RegisterAllocator::FindAvailableRegisterPair(size_t* next_use, size_t starting_at) const {
832 if ((reg == kNoRegister) || (next_use[i] >= next_use[reg]
833 && next_use[high_register] >= next_use[existing_high_register])) {
835 if (next_use[i] == kMaxLifetimePosition
836 && next_use[high_register] == kMaxLifetimePosition) {
839 } else if (next_use[reg] <= starting_at || next_use[existing_high_register] <= starting_at) {
848 int RegisterAllocator::FindAvailableRegister(size_t* next_use) const {
853 if (reg == kNoRegister || next_use[i] > next_use[reg]) {
855 if (next_use[i] == kMaxLifetimePosition) break;
863 size_t* next_use) {
869 if (first_register_use > next_use[active->GetRegister()]) continue;
917 size_t* next_use = registers_array_;
919 next_use[i] = kMaxLifetimePosition;
928 next_use[active->GetRegister()] = current->GetStart();
932 next_use[active->GetRegister()] = use;
955 next_use[inactive->GetRegister()] =
956 std::min(next_intersection, next_use[inactive->GetRegister()]);
960 next_use[inactive->GetRegister()] = std::min(use, next_use[inactive->GetRegister()]);
972 DCHECK_LT(first_use, next_use[reg]);
974 reg = FindAvailableRegisterPair(next_use, first_register_use);
976 should_spill = (first_use >= next_use[reg])
977 || (first_use >= next_use[GetHighForLowRegister(reg)]);
980 reg = FindAvailableRegister(next_use);
981 should_spill = (first_use >= next_use[reg]);
992 next_use)) {
