Searched refs:MIN_MATCH (Results 1 - 5 of 5) sorted by last modified time

/barrelfish-2018-10-04/lib/zlib/
H A Dzutil.h81 #define MIN_MATCH 3 macro
H A Dtrees.h102 const uch _length_code[MAX_MATCH-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 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 Ddeflate.c113 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
115 * See deflate.c for comments about the MIN_MATCH+1.
152 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
180 * input characters and the first MIN_MATCH bytes of str are valid
181 * (except for the last MIN_MATCH-1 bytes of the input file).
185 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
190 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
285 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
334 if (length < MIN_MATCH) retur
[all...]

Completed in 50 milliseconds