HomeSort by: relevance | last modified time | path
    Searched refs:MIN_MATCH (Results 1 - 7 of 7) sorted by relevancy

  /src/common/dist/zlib/
trees.h 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
deflate.c 129 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
153 * characters and the first MIN_MATCH bytes of str are valid (except for
154 * the last MIN_MATCH-1 bytes of the input file).
158 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
163 (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
309 if (s->lookahead + s->insert >= MIN_MATCH) {
313 #if MIN_MATCH != 3
314 Call UPDATE_HASH() MIN_MATCH-3 more times
317 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
324 if (s->lookahead + s->insert < MIN_MATCH)
    [all...]
deflate.h 155 * step. It must be such that after MIN_MATCH steps, the oldest
157 * hash_shift * MIN_MATCH >= hash_bits
292 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
294 * See deflate.c for comments about the MIN_MATCH+1.
trees.c 106 uch _length_code[MAX_MATCH-MIN_MATCH+1];
107 /* length code for each normalized match length (0 == MIN_MATCH) */
110 /* First normalized length for each code (0 = MIN_MATCH) */
416 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
417 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
419 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
921 /* Here, lc is the match length - MIN_MATCH */
1109 /* Here, lc is the match length - MIN_MATCH */
1112 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
zutil.h 98 #define MIN_MATCH 3
  /src/sys/net/
zlib.c 130 #define MIN_MATCH 3
416 * step. It must be such that after MIN_MATCH steps, the oldest
418 * hash_shift * MIN_MATCH >= hash_bits
544 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
546 * See deflate.c for comments about the MIN_MATCH+1.
717 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
719 * See deflate.c for comments about the MIN_MATCH+1.
749 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
777 * input characters and the first MIN_MATCH bytes of str are valid
778 * (except for the last MIN_MATCH-1 bytes of the input file)
    [all...]
  /src/common/dist/zlib/contrib/gcc_gvmat64/
gvmat64.S 94 #define MIN_MATCH 3
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)

Completed in 37 milliseconds