Lines Matching defs:start_index

1801 // even_label is for ranges[i] to ranges[i + 1] where i - start_index is even.
1802 // odd_label is for ranges[i] to ranges[i + 1] where i - start_index is odd.
1806 int start_index,
1819 for (int i = start_index; i <= end_index; i++) {
1822 DCHECK(start_index == 0 || (ranges->at(start_index - 1) & ~kMask) <= base);
1837 for (int i = 0; i < (ranges->at(start_index) & kMask) && i < kSize; i++) {
1842 for (int i = start_index; i < end_index; i++) {
1864 int start_index,
1869 bool odd = (((cut_index - start_index) & 1) == 1);
1882 for (int j = cut_index; j > start_index; j--) {
1894 int start_index,
1902 int first = ranges->at(start_index);
1905 *new_start_index = start_index;
1906 *border = (ranges->at(start_index) & ~kMask) + kSize;
1922 int binary_chop_index = (end_index + start_index) / 2;
1928 end_index - start_index > (*new_start_index - start_index) * 2 &&
1944 DCHECK(*new_start_index > start_index);
1959 // start_index) then go to even_label, otherwise go to odd_label. We already
1965 int start_index,
1972 int first = ranges->at(start_index);
1979 if (start_index == end_index) {
1986 if (start_index + 1 == end_index) {
1994 if (end_index - start_index <= 6) {
1999 for (int i = start_index; i < end_index; i++) {
2005 if (cut == kNoCutIndex) cut = start_index;
2007 masm, ranges, start_index, end_index, cut, even_label, odd_label);
2008 DCHECK_GE(end_index - start_index, 2);
2011 start_index + 1,
2028 start_index,
2041 start_index + 1,
2056 start_index,
2067 above = (end_index & 1) != (start_index & 1) ? odd_label : even_label;
2071 DCHECK_LE(start_index, new_end_index);
2073 DCHECK_LT(start_index, new_start_index);
2092 start_index,
2101 bool flip = (new_start_index & 1) != (start_index & 1);
2214 0, // start_index.