Lines Matching full:start_index
1807 // even_label is for ranges[i] to ranges[i + 1] where i - start_index is even.
1808 // odd_label is for ranges[i] to ranges[i + 1] where i - start_index is odd.
1812 int start_index,
1825 for (int i = start_index; i <= end_index; i++) {
1828 ASSERT(start_index == 0 || (ranges->at(start_index - 1) & ~kMask) <= base);
1843 for (int i = 0; i < (ranges->at(start_index) & kMask) && i < kSize; i++) {
1848 for (int i = start_index; i < end_index; i++) {
1870 int start_index,
1875 bool odd = (((cut_index - start_index) & 1) == 1);
1888 for (int j = cut_index; j > start_index; j--) {
1900 int start_index,
1908 int first = ranges->at(start_index);
1911 *new_start_index = start_index;
1912 *border = (ranges->at(start_index) & ~kMask) + kSize;
1928 int binary_chop_index = (end_index + start_index) / 2;
1934 end_index - start_index > (*new_start_index - start_index) * 2 &&
1951 ASSERT(*new_start_index > start_index);
1966 // start_index) then go to even_label, otherwise go to odd_label. We already
1972 int start_index,
1979 int first = ranges->at(start_index);
1986 if (start_index == end_index) {
1993 if (start_index + 1 == end_index) {
2001 if (end_index - start_index <= 6) {
2006 for (int i = start_index; i < end_index; i++) {
2012 if (cut == kNoCutIndex) cut = start_index;
2014 masm, ranges, start_index, end_index, cut, even_label, odd_label);
2015 ASSERT_GE(end_index - start_index, 2);
2018 start_index + 1,
2035 start_index,
2048 start_index + 1,
2063 start_index,
2074 above = (end_index & 1) != (start_index & 1) ? odd_label : even_label;
2078 ASSERT_LE(start_index, new_end_index);
2080 ASSERT_LT(start_index, new_start_index);
2099 start_index,
2108 bool flip = (new_start_index & 1) != (start_index & 1);
2225 0, // start_index.
