Lines Matching defs:max
183 const base::uc32 from = std::max(kStarts[i], range.from());
847 return ToNode(min(), max(), is_greedy(), body(), compiler, on_success);
1366 base::uc32 max = ranges->at(0).to();
1369 if (next_range.from() <= max + 1) return false;
1370 max = next_range.to();
1441 int new_to = std::max(to_replace.to(), to);
1449 int new_to = std::max(list->at(end_pos - 1).to(), to);
1472 base::uc32 max = character_ranges->at(0).to();
1476 if (current.from() <= max + 1) {
1479 max = current.to();
1588 RegExpNode* RegExpQuantifier::ToNode(int min, int max, bool is_greedy,
1604 // The parser has already eliminated the case where max is 0. In the case
1610 // from step 2.1. If the min and max are small we can unroll a little in
1614 if (max == 0) return on_success; // This can happen due to recursion.
1627 RegExpExpansionLimiter limiter(compiler, min + ((max != min) ? 1 : 0));
1629 int new_max = (max == kInfinity) ? max : max - min;
1643 if (max <= kMaxUnrolledMaxMatches && min == 0) {
1644 DCHECK_LT(0, max); // Due to the 'if' above.
1645 RegExpExpansionLimiter limiter(compiler, max);
1647 // Unroll the optional matches up to max.
1649 for (int i = 0; i < max; i++) {
1670 bool has_max = max < RegExpTree::kInfinity;
1699 Guard* body_guard = zone->New<Guard>(reg_ctr, Guard::LT, max);