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

1 2

  /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/external/gpl3/binutils/dist/zlib/
trees.h 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
deflate.c 127 /* 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)]), \
307 if (s->lookahead + s->insert >= MIN_MATCH) {
311 #if MIN_MATCH != 3
312 Call UPDATE_HASH() MIN_MATCH-3 more times
315 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
322 if (s->lookahead + s->insert < MIN_MATCH)
    [all...]
deflate.h 153 * step. It must be such that after MIN_MATCH steps, the oldest
155 * hash_shift * MIN_MATCH >= hash_bits
290 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
292 * See deflate.c for comments about the MIN_MATCH+1.
trees.c 104 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");
415 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
417 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
919 /* Here, lc is the match length - MIN_MATCH */
1107 /* Here, lc is the match length - MIN_MATCH */
1110 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
zutil.h 84 #define MIN_MATCH 3
  /src/external/gpl3/binutils.old/dist/zlib/
trees.h 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
deflate.c 149 /* 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)]), \
317 s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
457 while (s->lookahead >= MIN_MATCH) {
459 n = s->lookahead - (MIN_MATCH-1);
461 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1])
    [all...]
deflate.h 149 * step. It must be such that after MIN_MATCH steps, the oldest
151 * hash_shift * MIN_MATCH >= hash_bits
279 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
281 * See deflate.c for comments about the MIN_MATCH+1.
  /src/external/cddl/osnet/dist/uts/common/zmod/
deflate.c 118 #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) return Z_OK
    [all...]
deflate.h 143 * 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.
trees.c 108 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...]
zutil.h 88 #define MIN_MATCH 3
  /src/external/gpl3/binutils/dist/zlib/contrib/asm686/
match.S 29 #define MIN_MATCH (3)
30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
  /src/external/gpl3/binutils.old/dist/zlib/contrib/asm686/
match.S 29 #define MIN_MATCH (3)
30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
  /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)
  /src/external/gpl3/binutils/dist/zlib/contrib/amd64/
amd64-match.S 40 #define MIN_MATCH (3)
41 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
  /src/external/gpl3/binutils/dist/zlib/contrib/gcc_gvmat64/
gvmat64.S 94 #define MIN_MATCH 3
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
  /src/external/gpl3/binutils.old/dist/zlib/contrib/amd64/
amd64-match.S 40 #define MIN_MATCH (3)
41 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
  /src/external/gpl3/binutils.old/dist/zlib/contrib/gcc_gvmat64/
gvmat64.S 94 #define MIN_MATCH 3
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)

Completed in 41 milliseconds

1 2