Home
last modified time | relevance | path

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

/external/brotli/c/enc/
Dcompress_fragment_two_pass.c241 size_t table_bits, size_t min_match, in CreateCommands() argument
260 const size_t len_limit = BROTLI_MIN(size_t, block_size - min_match, in CreateCommands()
265 for (next_hash = Hash(++ip, shift, min_match); ; ) { in CreateCommands()
292 BROTLI_DCHECK(hash == Hash(ip, shift, min_match)); in CreateCommands()
297 next_hash = Hash(next_ip, shift, min_match); in CreateCommands()
299 if (IsMatch(ip, candidate, min_match)) { in CreateCommands()
310 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match))); in CreateCommands()
325 size_t matched = min_match + FindMatchLengthWithLimit( in CreateCommands()
326 candidate + min_match, ip + min_match, in CreateCommands()
327 (size_t)(ip_end - ip) - min_match); in CreateCommands()
[all …]
/external/v8/src/regexp/
Dregexp-ast.h208 virtual int min_match() = 0;
233 int min_match() override { return min_match_; } in min_match() function
257 int min_match() override { return min_match_; } in min_match() function
286 int min_match() override { return 0; } in min_match() function
329 int min_match() override { return 1; } in min_match() function
374 int min_match() override { return data_.length(); } in min_match() function
396 int min_match() override { return length_; } in min_match() function
418 min_match_(min * body->min_match()), in RegExpQuantifier()
434 int min_match() override { return min_match_; } in min_match() function
466 int min_match() override { return body_->min_match(); } in min_match() function
[all …]
Dregexp-ast.cc308 min_match_ = first_alternative->min_match(); in RegExpDisjunction()
312 min_match_ = Min(min_match_, alternative->min_match()); in RegExpDisjunction()
334 int node_min_match = node->min_match(); in RegExpAlternative()
Djsregexp.cc5466 bool body_can_be_empty = (body->min_match() == 0); in ToNode()
5528 LoopChoiceNode(body->min_match() == 0, compiler->read_backward(), zone); in ToNode()
6762 if (data->tree->min_match() > 0) { in Compile()