Home
last modified time | relevance | path

Searched refs:MIN_MATCH (Results 1 – 25 of 46) sorted by relevance

12

/external/rust/crates/libz-sys/src/zlib-ng/
Ddeflate_fast.c42 if (s->lookahead >= MIN_MATCH) { in deflate_fast()
57 if (match_len >= MIN_MATCH) { in deflate_fast()
60 bflush = zng_tr_tally_dist(s, s->strstart - s->match_start, match_len - MIN_MATCH); in deflate_fast()
67 if (match_len <= s->max_insert_length && s->lookahead >= MIN_MATCH) { in deflate_fast()
75 #if MIN_MATCH != 3 in deflate_fast()
76 functable.insert_string(s, s->strstart + 2 - MIN_MATCH, MIN_MATCH - 2); in deflate_fast()
78 functable.quick_insert_string(s, s->strstart + 2 - MIN_MATCH); in deflate_fast()
94 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1; in deflate_fast()
Ddeflate_medium.c27 if (match.match_length < MIN_MATCH) { in emit_match()
39 …bflush += zng_tr_tally_dist(s, match.strstart - match.match_start, match.match_length - MIN_MATCH); in emit_match()
46 if (UNLIKELY(s->lookahead <= (unsigned int)(match.match_length + MIN_MATCH))) in insert_match()
50 if (LIKELY(match.match_length < MIN_MATCH)) { in insert_match()
70 if (match.match_length <= 16* s->max_insert_length && s->lookahead >= MIN_MATCH) { in insert_match()
88 if (match.strstart >= (MIN_MATCH - 2)) in insert_match()
89 #if MIN_MATCH != 3 in insert_match()
90 functable.insert_string(s, match.strstart + 2 - MIN_MATCH, MIN_MATCH - 2); in insert_match()
92 functable.quick_insert_string(s, match.strstart + 2 - MIN_MATCH); in insert_match()
200 if (s->lookahead >= MIN_MATCH) { in deflate_medium()
[all …]
Ddeflate_slow.c42 if (LIKELY(s->lookahead >= MIN_MATCH)) { in deflate_slow()
49 match_len = MIN_MATCH-1; in deflate_slow()
63 match_len = MIN_MATCH-1; in deflate_slow()
69 if (s->prev_length >= MIN_MATCH && match_len <= s->prev_length) { in deflate_slow()
70 unsigned int max_insert = s->strstart + s->lookahead - MIN_MATCH; in deflate_slow()
75 … bflush = zng_tr_tally_dist(s, s->strstart -1 - s->prev_match, s->prev_length - MIN_MATCH); in deflate_slow()
127 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1; in deflate_slow()
Ddeflate_quick.c86 if (LIKELY(s->lookahead >= MIN_MATCH)) { in deflate_quick()
93 if (match_len >= MIN_MATCH) { in deflate_quick()
99 zng_tr_emit_dist(s, static_ltree, static_dtree, match_len - MIN_MATCH, dist); in deflate_quick()
112 s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1; in deflate_quick()
Ddeflate.c460 while (s->lookahead >= MIN_MATCH) { in PREFIX()
462 n = s->lookahead - (MIN_MATCH-1); in PREFIX()
465 s->lookahead = MIN_MATCH-1; in PREFIX()
472 s->prev_length = MIN_MATCH-1; in PREFIX()
1189 s->prev_length = MIN_MATCH-1; in lm_init()
1203 if (length < MIN_MATCH || length > MAX_MATCH) { in check_match()
1280 if (s->lookahead + s->insert >= MIN_MATCH) { in fill_window()
1283 functable.quick_insert_string(s, str + 2 - MIN_MATCH); in fill_window()
1284 #if MIN_MATCH != 3 in fill_window()
1285 #error Call insert_string() MIN_MATCH-3 more times in fill_window()
[all …]
Dtrees_tbl.h105 const unsigned char Z_INTERNAL zng_length_code[MAX_MATCH-MIN_MATCH+1] = {
/external/llvm-project/clang/test/CoverageMapping/
Dloopmacro.c13 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \
26 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH)
33 #define MIN_MATCH 3 macro
/external/clang/test/CoverageMapping/
Dloopmacro.c13 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \
26 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH)
33 #define MIN_MATCH 3 macro
/external/rust/crates/libz-sys/src/zlib/
Ddeflate.c178 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
183 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
319 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
417 while (s->lookahead >= MIN_MATCH) {
419 n = s->lookahead - (MIN_MATCH-1);
421 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
429 s->lookahead = MIN_MATCH-1;
436 s->match_length = s->prev_length = MIN_MATCH-1;
1212 s->match_length = s->prev_length = MIN_MATCH-1;
1407 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
/external/python/cpython2/Modules/zlib/
Ddeflate.c178 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
183 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
319 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
417 while (s->lookahead >= MIN_MATCH) {
419 n = s->lookahead - (MIN_MATCH-1);
421 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
429 s->lookahead = MIN_MATCH-1;
436 s->match_length = s->prev_length = MIN_MATCH-1;
1212 s->match_length = s->prev_length = MIN_MATCH-1;
1407 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
/external/zlib/
Ddeflate.c319 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
467 while (s->lookahead >= MIN_MATCH) {
469 n = s->lookahead - (MIN_MATCH-1);
475 s->lookahead = MIN_MATCH-1;
482 s->match_length = s->prev_length = MIN_MATCH-1;
1257 s->match_length = s->prev_length = MIN_MATCH-1;
1470 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1495 if (len < MIN_MATCH) return MIN_MATCH - 1;
1614 if (s->lookahead + s->insert >= MIN_MATCH) {
1618 #if MIN_MATCH != 3
[all …]
Dfill_window_sse.c129 if (s->lookahead >= MIN_MATCH) { in fill_window_sse()
133 UPDATE_HASH(s, s->ins_h, str + 1 - (MIN_MATCH-1)); in fill_window_sse()
134 #if MIN_MATCH != 3 in fill_window_sse()
135 Call UPDATE_HASH() MIN_MATCH-3 more times in fill_window_sse()
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
/external/libwebsockets/win32port/zlib/
Ddeflate.c179 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
184 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
279 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
330 if (length < MIN_MATCH) return Z_OK;
345 for (n = 0; n <= length - MIN_MATCH; n++) {
1051 s->match_length = s->prev_length = MIN_MATCH-1;
1246 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1271 if (len < MIN_MATCH) return MIN_MATCH - 1;
1396 if (s->lookahead >= MIN_MATCH) {
1399 #if MIN_MATCH != 3
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
/external/rust/crates/libz-sys/src/zlib-ng/tools/
Dmaketrees.c26 static unsigned char length_code[MAX_MATCH-MIN_MATCH+1];
125 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
126 printf("%2u%s", length_code[i], SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
/external/zlib/patches/
D0006-fix-check_match.patch26 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
39 s->prev_length - MIN_MATCH, bflush);
D0001-simd.patch596 * characters and the first MIN_MATCH bytes of str are valid (except for
597 * the last MIN_MATCH-1 bytes of the input file).
603 + UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]);
606 - (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
612 - (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
662 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
673 n = s->lookahead - (MIN_MATCH-1);
675 - UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
758 if (s->lookahead >= MIN_MATCH) {
771 * always MIN_MATCH bytes ahead.
[all …]
/external/sqlite/android/
DOldPhoneNumberUtils.cpp25 static int MIN_MATCH = 7; variable
279 return phone_number_compare_loose_with_minmatch(a, b, MIN_MATCH); in phone_number_compare_loose()
/external/rust/crates/libz-sys/src/zlib/contrib/masmx86/
Dmatch686.asm107 MIN_MATCH equ 3 define
108 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)
113 MIN_MATCH equ 3 define
114 MIN_LOOKAHEAD equ (MAX_MATCH + MIN_MATCH + 1)
/external/brotli/research/
Ddeorummolae.cc14 #define MIN_MATCH 24 macro
262 effective_lcp >= MIN_MATCH) { in DM_generate()
280 if (best_cost == 0 || best_isle.lcp < MIN_MATCH) { in DM_generate()
/external/rust/crates/libz-sys/src/zlib/contrib/asm686/
Dmatch.S29 #define MIN_MATCH (3) macro
30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
/external/rust/crates/libz-sys/src/zlib/contrib/gcc_gvmat64/
Dgvmat64.S94 #define MIN_MATCH 3 macro
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)

12