Home
last modified time | relevance | path

Searched refs:MIN_MATCH (Results 1 – 25 of 28) 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/pdfium/third_party/zlib_v128/
Ddeflate.c182 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
187 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
290 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH); in deflateInit2_()
363 while (s->lookahead >= MIN_MATCH) { in deflateSetDictionary()
365 n = s->lookahead - (MIN_MATCH-1); in deflateSetDictionary()
367 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); in deflateSetDictionary()
375 s->lookahead = MIN_MATCH-1; in deflateSetDictionary()
382 s->match_length = s->prev_length = MIN_MATCH-1; in deflateSetDictionary()
1123 s->match_length = s->prev_length = MIN_MATCH-1; in lm_init()
1318 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1; in longest_match()
[all …]
Dtrees.h103 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h77 #define MIN_MATCH 3 macro
/external/python/cpython2/Modules/zlib/
Ddeflate.c182 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
187 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
291 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
364 while (s->lookahead >= MIN_MATCH) {
366 n = s->lookahead - (MIN_MATCH-1);
368 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
376 s->lookahead = MIN_MATCH-1;
383 s->match_length = s->prev_length = MIN_MATCH-1;
1124 s->match_length = s->prev_length = MIN_MATCH-1;
1319 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];
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h75 #define MIN_MATCH 3 macro
/external/zlib/src/
Ddeflate.c182 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
187 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
291 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
364 while (s->lookahead >= MIN_MATCH) {
366 n = s->lookahead - (MIN_MATCH-1);
368 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
376 s->lookahead = MIN_MATCH-1;
383 s->match_length = s->prev_length = MIN_MATCH-1;
1124 s->match_length = s->prev_length = MIN_MATCH-1;
1319 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];
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h75 #define MIN_MATCH 3 macro
/external/syslinux/com32/lib/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++) {
1039 s->match_length = s->prev_length = MIN_MATCH-1;
1234 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1259 if (len < MIN_MATCH) return MIN_MATCH - 1;
1384 if (s->lookahead >= MIN_MATCH) {
1387 #if MIN_MATCH != 3
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
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)
Dzutil.h71 #define MIN_MATCH 3 macro
/external/sqlite/android/
DOldPhoneNumberUtils.cpp25 static int MIN_MATCH = 7; variable
246 if (matched < MIN_MATCH) { in phone_number_compare_loose()
260 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) { in phone_number_compare_loose()
/external/zlib/src/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/zlib/src/contrib/asm686/
Dmatch.S29 #define MIN_MATCH (3) macro
30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
/external/zlib/src/contrib/gcc_gvmat64/
Dgvmat64.S94 #define MIN_MATCH 3 macro
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/external/zlib/src/contrib/amd64/
Damd64-match.S40 #define MIN_MATCH (3) macro
41 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
/external/freetype/src/gzip/
Dzutil.h64 #define MIN_MATCH 3 macro
/external/zlib/src/contrib/masmx64/
Dgvmat64.asm121 MIN_MATCH equ 3 define
122 MIN_LOOKAHEAD equ (MAX_MATCH+MIN_MATCH+1)

12