Home
last modified time | relevance | path

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

12

/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/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]= {
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1029 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/external/v8/third_party/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]= {
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1030 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/external/zlib/
Ddeflate.c315 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
460 while (s->lookahead >= MIN_MATCH) {
462 n = s->lookahead - (MIN_MATCH-1);
468 s->lookahead = MIN_MATCH-1;
475 s->match_length = s->prev_length = MIN_MATCH-1;
1250 s->match_length = s->prev_length = MIN_MATCH-1;
1445 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1470 if (len < MIN_MATCH) return MIN_MATCH - 1;
1589 if (s->lookahead + s->insert >= MIN_MATCH) {
1593 #if MIN_MATCH != 3
[all …]
Dfill_window_sse.c126 if (s->lookahead >= MIN_MATCH) { in fill_window_sse()
130 UPDATE_HASH(s, s->ins_h, str + 1 - (MIN_MATCH-1)); in fill_window_sse()
131 #if MIN_MATCH != 3 in fill_window_sse()
132 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]= {
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1030 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/external/u-boot/lib/zlib/
Ddeflate.c180 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
185 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
280 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
331 if (length < MIN_MATCH) return Z_OK;
346 for (n = 0; n <= length - MIN_MATCH; n++) {
1038 s->match_length = s->prev_length = MIN_MATCH-1;
1233 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1258 if (len < MIN_MATCH) return MIN_MATCH - 1;
1383 if (s->lookahead >= MIN_MATCH) {
1386 #if MIN_MATCH != 3
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Dzutil.h81 #define MIN_MATCH 3 macro
Dtrees.c109 uch _length_code[MAX_MATCH-MIN_MATCH+1];
362 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
364 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1041 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Ddeflate.h278 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/external/v8/third_party/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/zlib/patches/
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/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/v8/third_party/zlib/contrib/optimizations/
Dinsert_string.h97 UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH - 1)]); in insert_string_c()
/external/zlib/contrib/optimizations/
Dinsert_string.h90 UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH - 1)]); in insert_string_c()
/external/freetype/src/gzip/
Dzutil.h64 #define MIN_MATCH 3 macro

12