Home
last modified time | relevance | path

Searched refs:min_match (Results 1 – 4 of 4) sorted by relevance

/external/v8/src/regexp/
Dregexp-ast.h203 virtual int min_match() = 0;
228 int min_match() override { return min_match_; } in min_match() function
252 int min_match() override { return min_match_; } in min_match() function
280 int min_match() override { return 0; } in min_match() function
299 int min_match() override { return 1; } in min_match() function
338 int min_match() override { return data_.length(); } in min_match() function
357 int min_match() override { return length_; } in min_match() function
379 min_match_(min * body->min_match()), in RegExpQuantifier()
395 int min_match() override { return min_match_; } in min_match() function
427 int min_match() override { return body_->min_match(); } in min_match() function
[all …]
Dregexp-ast.cc302 min_match_ = first_alternative->min_match(); in RegExpDisjunction()
306 min_match_ = Min(min_match_, alternative->min_match()); in RegExpDisjunction()
328 int node_min_match = node->min_match(); in RegExpAlternative()
Djsregexp.cc5524 bool body_can_be_empty = (body->min_match() == 0); in ToNode()
5586 LoopChoiceNode(body->min_match() == 0, compiler->read_backward(), zone); in ToNode()
6758 if (data->tree->min_match() > 0) { in Compile()
/external/v8/test/cctest/
Dtest-regexp.cc142 int min_match; member
156 int min_match = result.tree->min_match(); in CheckMinMaxMatch() local
158 MinMaxPair pair = { min_match, max_match }; in CheckMinMaxMatch()
167 CHECK_EQ(min, min_max.min_match); \