Lines Matching full:start_index
1822 // even_label is for ranges[i] to ranges[i + 1] where i - start_index is even.
1823 // odd_label is for ranges[i] to ranges[i + 1] where i - start_index is odd.
1827 int start_index,
1840 for (int i = start_index; i <= end_index; i++) {
1843 DCHECK(start_index == 0 || (ranges->at(start_index - 1) & ~kMask) <= base);
1858 for (int i = 0; i < (ranges->at(start_index) & kMask) && i < kSize; i++) {
1863 for (int i = start_index; i < end_index; i++) {
1885 int start_index,
1890 bool odd = (((cut_index - start_index) & 1) == 1);
1903 for (int j = cut_index; j > start_index; j--) {
1915 int start_index,
1923 int first = ranges->at(start_index);
1926 *new_start_index = start_index;
1927 *border = (ranges->at(start_index) & ~kMask) + kSize;
1943 int binary_chop_index = (end_index + start_index) / 2;
1949 end_index - start_index > (*new_start_index - start_index) * 2 &&
1965 DCHECK(*new_start_index > start_index);
1980 // start_index) then go to even_label, otherwise go to odd_label. We already
1985 int start_index, int end_index, uc32 min_char,
1991 int first = ranges->at(start_index);
1998 if (start_index == end_index) {
2005 if (start_index + 1 == end_index) {
2013 if (end_index - start_index <= 6) {
2018 for (int i = start_index; i < end_index; i++) {
2024 if (cut == kNoCutIndex) cut = start_index;
2026 masm, ranges, start_index, end_index, cut, even_label, odd_label);
2027 DCHECK_GE(end_index - start_index, 2);
2030 start_index + 1,
2047 start_index,
2060 start_index + 1,
2075 start_index,
2086 above = (end_index & 1) != (start_index & 1) ? odd_label : even_label;
2090 DCHECK_LE(start_index, new_end_index);
2092 DCHECK_LT(start_index, new_start_index);
2111 start_index,
2120 bool flip = (new_start_index & 1) != (start_index & 1);
2222 0, // start_index.
