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

12

/external/chromium_org/third_party/zlib/
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.c147 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
175 * input characters and the first MIN_MATCH bytes of str are valid
176 * (except for the last MIN_MATCH-1 bytes of the input file).
180 (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);
334 if (length < MIN_MATCH) return Z_OK;
349 for (n = 0; n <= length - MIN_MATCH; n++) {
1063 s->match_length = s->prev_length = MIN_MATCH
[all...]
H A Ddeflate.h148 * step. It must be such that after MIN_MATCH steps, the oldest
150 * hash_shift * MIN_MATCH >= hash_bits
283 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
285 * See deflate.c for comments about the MIN_MATCH+1.
H A Dzutil.h86 #define MIN_MATCH 3 macro
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Dfx_zlib_deflate.c146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
177 * input characters and the first MIN_MATCH bytes of str are valid
178 * (except for the last MIN_MATCH-1 bytes of the input file).
182 (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);
363 while (s->lookahead >= MIN_MATCH) {
365 n = s->lookahead - (MIN_MATCH-1);
367 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH
[all...]
H A Ddeflate.h146 * step. It must be such that after MIN_MATCH steps, the oldest
148 * hash_shift * MIN_MATCH >= hash_bits
281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
283 * See deflate.c for comments about the MIN_MATCH+1.
H A Dfx_zlib_trees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
105 /* length code for each normalized match length (0 == MIN_MATCH) */
108 /* First normalized length for each code (0 = MIN_MATCH) */
356 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
1013 unsigned lc) /* match length-MIN_MATCH or unmatched char (if dist==0) */
1022 /* Here, lc is the match length - MIN_MATCH */
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1078 /* Here, lc is the match length - MIN_MATCH */
[all...]
H A Dzutil.h77 #define MIN_MATCH 3 macro
/external/qemu/distrib/zlib-1.2.8/
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.c146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
177 * input characters and the first MIN_MATCH bytes of str are valid
178 * (except for the last MIN_MATCH-1 bytes of the input file).
182 (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
[all...]
H A Ddeflate.h146 * step. It must be such that after MIN_MATCH steps, the oldest
148 * hash_shift * MIN_MATCH >= hash_bits
281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
283 * See deflate.c for comments about the MIN_MATCH+1.
H A Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
105 /* length code for each normalized match length (0 == MIN_MATCH) */
108 /* First normalized length for each code (0 = MIN_MATCH) */
356 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
1013 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
1022 /* Here, lc is the match length - MIN_MATCH */
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1078 /* Here, lc is the match length - MIN_MATCH */
[all...]
H A Dzutil.h75 #define MIN_MATCH 3 macro
/external/zlib/src/
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.c146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
177 * input characters and the first MIN_MATCH bytes of str are valid
178 * (except for the last MIN_MATCH-1 bytes of the input file).
182 (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
[all...]
H A Ddeflate.h146 * step. It must be such that after MIN_MATCH steps, the oldest
148 * hash_shift * MIN_MATCH >= hash_bits
281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
283 * See deflate.c for comments about the MIN_MATCH+1.
H A Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
105 /* length code for each normalized match length (0 == MIN_MATCH) */
108 /* First normalized length for each code (0 = MIN_MATCH) */
356 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
1013 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
1022 /* Here, lc is the match length - MIN_MATCH */
1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1078 /* Here, lc is the match length - MIN_MATCH */
[all...]
H A Dzutil.h75 #define MIN_MATCH 3 macro
/external/sqlite/android/
H A DOldPhoneNumberUtils.cpp25 static int MIN_MATCH = 7; member in namespace:android
189 * - requires MIN_MATCH (7) characters to match
246 if (matched < MIN_MATCH) {
250 // if the number of dialable chars in a and b match, but the matched chars < MIN_MATCH,
260 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) {
/external/zlib/src/contrib/asm686/
H A Dmatch.S29 #define MIN_MATCH (3) define
30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
/external/freetype/src/gzip/
H A Dzutil.h64 #define MIN_MATCH 3 macro
/external/zlib/src/contrib/amd64/
H A Damd64-match.S40 #define MIN_MATCH (3) define
41 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
/external/zlib/src/contrib/gcc_gvmat64/
H A Dgvmat64.S94 #define MIN_MATCH 3 define
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/external/zlib/
H A Dzutil.h75 #define MIN_MATCH 3 macro

Completed in 1697 milliseconds

12