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

/freebsd-11-stable/sys/contrib/zlib/
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.c149 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
173 * characters and the first MIN_MATCH bytes of str are valid (except for
174 * the last MIN_MATCH-1 bytes of the input file).
178 (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
[all...]
H A Ddeflate.h149 * step. It must be such that after MIN_MATCH steps, the oldest
151 * hash_shift * MIN_MATCH >= hash_bits
284 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
286 * 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) */
354 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
1017 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
1026 /* Here, lc is the match length - MIN_MATCH */
1029 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1082 /* Here, lc is the match length - MIN_MATCH */
[all...]
H A Dzutil.h77 #define MIN_MATCH 3 macro
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Ddeflate.c118 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
120 * See deflate.c for comments about the MIN_MATCH+1.
157 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
185 * input characters and the first MIN_MATCH bytes of str are valid
186 * (except for the last MIN_MATCH-1 bytes of the input file).
190 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
195 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
291 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
340 if (length < MIN_MATCH) retur
[all...]
H A Ddeflate.h143 * step. It must be such that after MIN_MATCH steps, the oldest
145 * hash_shift * MIN_MATCH >= hash_bits
271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
273 * See deflate.c for comments about the MIN_MATCH+1.
H A Dtrees.c108 uch _length_code[MAX_MATCH-MIN_MATCH+1];
109 /* length code for each normalized match length (0 == MIN_MATCH) */
112 /* First normalized length for each code (0 = MIN_MATCH) */
357 fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
358 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
360 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
1025 unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
1034 /* Here, lc is the match length - MIN_MATCH */
1037 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1090 /* Here, lc is the match length - MIN_MATCH */
[all...]
H A Dzutil.h86 #define MIN_MATCH 3 macro
/freebsd-11-stable/sys/contrib/zlib/contrib/asm686/
H A Dmatch.S29 #define MIN_MATCH (3) define
30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
/freebsd-11-stable/sys/contrib/zlib/contrib/gcc_gvmat64/
H A Dgvmat64.S94 #define MIN_MATCH 3 define
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
/freebsd-11-stable/sys/libkern/
H A Dzlib.c132 #define MIN_MATCH 3 macro
400 * step. It must be such that after MIN_MATCH steps, the oldest
402 * hash_shift * MIN_MATCH >= hash_bits
528 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
530 * See deflate.c for comments about the MIN_MATCH+1.
658 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
660 * See deflate.c for comments about the MIN_MATCH+1.
690 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
716 * input characters and the first MIN_MATCH bytes of str are valid
717 * (except for the last MIN_MATCH
[all...]
/freebsd-11-stable/sys/sys/
H A Dzutil.h96 #define MIN_MATCH 3 macro

Completed in 179 milliseconds