Lines Matching defs:from
97 // <pop backtrack location from stack and go to it>
104 // <pop backtrack location from stack and go to it>
159 // location from the stack and jump there.
368 for (int i = range.from(); i <= range.to(); i++)
667 result->data_.u_clear_captures.range_from = range.from();
877 // subtract the difference from the found character, then do the or
1101 // character is in the range between an even and an odd boundary (counting from
1127 // different from the end intervals.
1290 if (range.from() == 0) {
1294 range_boundaries->Add(range.from(), zone);
1296 // `+ 1` to convert from inclusive to exclusive `to`.
1297 // [from, to] == [from, to+1[.
1370 // all characters from this position onwards.
1676 while (ranges->at(first_range).from() > char_mask) {
1685 const base::uc32 first_from = range.from();
1699 const base::uc32 from = range.from();
1700 if (from > char_mask) continue;
1709 uint32_t new_common_bits = (from ^ to);
1713 uint32_t new_differing_bits = (from & common_bits) ^ bits;
1897 if (range_count != 0 && ranges->at(0).from() == 0 &&
1907 ranges->at(0).from() > String::kMaxOneByteCharCode) {
2021 // when it does, meaning the only possible quick checks from this point
2053 // from the top.
2311 // The passes are done from right to left, so for example to test for /bar/
2461 // pass from left to right. Instead we pass over the text node several times,
2567 // Finds the fixed match length of a sequence of nodes that goes from
2712 // Consider the range from last to ranges[i].
2714 if (ranges[i] <= new_range.from()) continue;
2717 if (last <= new_range.from() && new_range.to() < ranges[i]) {
2762 for (int i = interval.from(); i <= interval.to(); i++) {
2794 bool BoyerMooreLookahead::FindWorthwhileInterval(int* from, int* to) {
2802 FindBestInterval(max_number_of_chars, biggest_points, from, to);
2815 int old_biggest_points, int* from,
2857 *from = remembered_from;
2867 // max_lookahead (inclusive) measured from the current position. If the
3284 // If this is not the first choice then there could be slow checks from
3564 // Propagates information about the minimum size of successful matches from
3615 // The minimum possible match from a choice node is the minimum of its
3653 // (UINT8_MAX) since that won't prevent us from preloading a lot of
3739 // First propagate all information from the continuation node.
3867 if (static_cast<int>(range.from()) > max_char) continue;
3869 bm->SetInterval(offset, Interval(range.from(), to));