Home
last modified time | relevance | path

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

12

/third_party/zlib/
H A Ddeflate.c127 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
151 * characters and the first MIN_MATCH bytes of str are valid (except for
152 * the last MIN_MATCH-1 bytes of the input file).
156 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
161 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
310 if (s->lookahead + s->insert >= MIN_MATCH) { in fill_window()
314 #if MIN_MATCH != 3 in fill_window()
315 Call UPDATE_HASH() MIN_MATCH-3 more times in fill_window()
318 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); in fill_window()
325 if (s->lookahead + s->insert < MIN_MATCH) in fill_window()
[all...]
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-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) */
430 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); in gen_trees_header()
431 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
433 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
944 /* Here, lc is the match length - MIN_MATCH */ in compress_block()
1133 /* Here, lc is the match length - MIN_MATCH */
1136 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/third_party/node/deps/zlib/
H A Ddeflate.c145 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
307 if (s->lookahead + s->insert > MIN_MATCH) { in fill_window()
313 if (s->lookahead + s->insert <= MIN_MATCH) in fill_window()
319 if (s->lookahead + s->insert >= MIN_MATCH) { in fill_window()
323 #if MIN_MATCH != 3 in fill_window()
324 Call UPDATE_HASH() MIN_MATCH-3 more times in fill_window()
327 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); in fill_window()
334 if (s->lookahead + s->insert < MIN_MATCH) in fill_window()
338 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, in fill_window()
477 s->hash_shift = ((s->hash_bits + MIN_MATCH in deflateInit2_()
[all...]
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-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) */
414 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); in gen_trees_header()
415 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
417 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
919 /* Here, lc is the match length - MIN_MATCH */ in compress_block()
1108 /* Here, lc is the match length - MIN_MATCH */
1111 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/third_party/node/deps/v8/third_party/zlib/
H A Ddeflate.c168 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
324 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
472 while (s->lookahead >= MIN_MATCH) {
474 n = s->lookahead - (MIN_MATCH-1);
480 s->lookahead = MIN_MATCH-1;
487 s->match_length = s->prev_length = MIN_MATCH-1;
1265 s->match_length = s->prev_length = MIN_MATCH-1;
1478 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1503 if (len < MIN_MATCH) retur
[all...]
H A 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()
138 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, in fill_window_sse()
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-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) */
354 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); in gen_trees_header()
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()
1018 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
1028 /* Here, lc is the match length - MIN_MATCH */
1031 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1062 /* Here, lc is the match length - MIN_MATCH */
[all...]
H A Dzutil.h88 #define MIN_MATCH 3 macro
/third_party/skia/third_party/externals/zlib/
H A Ddeflate.c168 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
319 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) retur
[all...]
H A 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()
138 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, in fill_window_sse()
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-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) */
354 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); in gen_trees_header()
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()
1017 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
1027 /* Here, lc is the match length - MIN_MATCH */
1030 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1061 /* Here, lc is the match length - MIN_MATCH */
[all...]
/third_party/libwebsockets/win32port/zlib/
H A Ddeflate.c146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
174 * input characters and the first MIN_MATCH bytes of str are valid
175 * (except for the last MIN_MATCH-1 bytes of the input file).
179 (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)]), \
274 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
367 if (length < MIN_MATCH) return Z_OK;
382 for (n = 0; n <= length - MIN_MATCH; n++) {
1085 s->match_length = s->prev_length = MIN_MATCH
[all...]
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Dtrees.c109 uch _length_code[MAX_MATCH-MIN_MATCH+1];
110 /* length code for each normalized match length (0 == MIN_MATCH) */
113 /* First normalized length for each code (0 = MIN_MATCH) */
361 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); in gen_trees_header()
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()
1029 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
1039 /* Here, lc is the match length - MIN_MATCH */
1042 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1073 /* Here, lc is the match length - MIN_MATCH */
[all...]
H A Dzutil.h71 #define MIN_MATCH 3 macro
/third_party/node/deps/zlib/contrib/optimizations/
H A Dinsert_string.h50 * characters and the first MIN_MATCH bytes of str are valid (except for
51 * the last MIN_MATCH-1 bytes of the input file).
62 UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH - 1)]); in insert_string()
/third_party/skia/third_party/externals/brotli/research/
H A 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()
/third_party/zlib/contrib/gcc_gvmat64/
H A Dgvmat64.S94 #define MIN_MATCH 3 define
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/third_party/node/deps/v8/third_party/zlib/contrib/optimizations/
H A Dinsert_string.h91 * characters and the first MIN_MATCH bytes of str are valid (except for
92 * the last MIN_MATCH-1 bytes of the input file).
97 UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH - 1)]); in insert_string_c()
/third_party/skia/third_party/externals/zlib/contrib/optimizations/
H A Dinsert_string.h91 * characters and the first MIN_MATCH bytes of str are valid (except for
92 * the last MIN_MATCH-1 bytes of the input file).
97 UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH - 1)]); in insert_string_c()
/third_party/skia/third_party/externals/freetype/src/gzip/
H A Dzutil.h64 #define MIN_MATCH 3 macro

Completed in 28 milliseconds

12