1896                              int* new_start_index,  in SplitSearchSpace()  argument
1905   *new_start_index = start_index;  in SplitSearchSpace()
1907   while (*new_start_index < end_index) {  in SplitSearchSpace()
1908     if (ranges->at(*new_start_index) > *border) break;  in SplitSearchSpace()
1909     (*new_start_index)++;  in SplitSearchSpace()
1928       end_index - start_index > (*new_start_index - start_index) * 2 &&  in SplitSearchSpace()
1929       last - first > kSize * 2 && binary_chop_index > *new_start_index &&  in SplitSearchSpace()
1936         *new_start_index = scan_forward_for_section_border;  in SplitSearchSpace()
1944   DCHECK(*new_start_index > start_index);  in SplitSearchSpace()
1945   *new_end_index = *new_start_index - 1;  in SplitSearchSpace()
1951     *new_start_index = end_index;  // Won't be used.  in SplitSearchSpace()
2051   int new_start_index = 0;  in GenerateBranches()  local
2058                    &new_start_index,  in GenerateBranches()
2072   DCHECK_LE(new_start_index, end_index);  in GenerateBranches()
2073   DCHECK_LT(start_index, new_start_index);  in GenerateBranches()
2075   DCHECK(new_end_index + 1 == new_start_index ||  in GenerateBranches()
2076          (new_end_index + 2 == new_start_index &&  in GenerateBranches()
2081   DCHECK(border < ranges->at(new_start_index) ||  in GenerateBranches()
2082          (border == ranges->at(new_start_index) &&  in GenerateBranches()
2083           new_start_index == end_index &&  in GenerateBranches()
2086   DCHECK(new_start_index == 0 || border >= ranges->at(new_start_index - 1));  in GenerateBranches()
2101     bool flip = (new_start_index & 1) != (start_index & 1);  in GenerateBranches()
2104                      new_start_index,  in GenerateBranches()