1857                              int* new_start_index,  in SplitSearchSpace()  argument
1866   *new_start_index = start_index;  in SplitSearchSpace()
1868   while (*new_start_index < end_index) {  in SplitSearchSpace()
1869     if (ranges->at(*new_start_index) > *border) break;  in SplitSearchSpace()
1870     (*new_start_index)++;  in SplitSearchSpace()
1889       end_index - start_index > (*new_start_index - start_index) * 2 &&  in SplitSearchSpace()
1890       last - first > kSize * 2 && binary_chop_index > *new_start_index &&  in SplitSearchSpace()
1897         *new_start_index = scan_forward_for_section_border;  in SplitSearchSpace()
1905   DCHECK(*new_start_index > start_index);  in SplitSearchSpace()
1906   *new_end_index = *new_start_index - 1;  in SplitSearchSpace()
1912     *new_start_index = end_index;  // Won't be used.  in SplitSearchSpace()
2009   int new_start_index = 0;  in GenerateBranches()  local
2016                    &new_start_index,  in GenerateBranches()
2030   DCHECK_LE(new_start_index, end_index);  in GenerateBranches()
2031   DCHECK_LT(start_index, new_start_index);  in GenerateBranches()
2033   DCHECK(new_end_index + 1 == new_start_index ||  in GenerateBranches()
2034          (new_end_index + 2 == new_start_index &&  in GenerateBranches()
2039   DCHECK(border < ranges->at(new_start_index) ||  in GenerateBranches()
2040          (border == ranges->at(new_start_index) &&  in GenerateBranches()
2041           new_start_index == end_index &&  in GenerateBranches()
2044   DCHECK(new_start_index == 0 || border >= ranges->at(new_start_index - 1));  in GenerateBranches()
2059     bool flip = (new_start_index & 1) != (start_index & 1);  in GenerateBranches()
2062                      new_start_index,  in GenerateBranches()