Searched refs:MAX_MATCH (Results 1 - 15 of 15) sorted by relevance
/illumos-gate/usr/src/boot/lib/libz/ |
H A D | trees.h | 102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
|
H A D | deflate.c | 1170 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; 1174 register Bytef *strend = s->window + s->strstart + MAX_MATCH; 1179 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. 1182 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); 1207 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) 1219 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is 1237 len = (MAX_MATCH - 1) - (int)(strend-scan); 1238 scan = strend - (MAX_MATCH-1); 1268 len = MAX_MATCH - (int)(strend - scan); 1269 scan = strend - MAX_MATCH; [all...] |
H A D | deflate.h | 120 * wSize-MAX_MATCH bytes, but this ensures that IO is always 281 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 291 #define WIN_INIT MAX_MATCH
|
H A D | trees.c | 104 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 356 "const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {\n"); 357 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { 359 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); 1025 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
|
H A D | zutil.h | 76 #define MAX_MATCH 258 macro
|
/illumos-gate/usr/src/boot/lib/libz/contrib/asm686/ |
H A D | match.S | 28 #define MAX_MATCH (258) define 30 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1) 31 #define MAX_MATCH_8 ((MAX_MATCH + 7) & ~7) 285 /* Calculate the length of the match. If it is longer than MAX_MATCH, */ 291 cmpl $MAX_MATCH, %eax 329 movl $MAX_MATCH, bestlen(%esp)
|
/illumos-gate/usr/src/boot/lib/libz/contrib/gcc_gvmat64/ |
H A D | gvmat64.S | 93 #define MAX_MATCH 258 define 95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 488 //;;; Calculate the length of the match. If it is longer than MAX_MATCH, 493 cmp eax, MAX_MATCH 538 mov r11d,MAX_MATCH
|
/illumos-gate/usr/src/uts/common/zmod/ |
H A D | deflate.c | 118 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 1055 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; 1059 register Bytef *strend = s->window + s->strstart + MAX_MATCH; 1064 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. 1067 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); 1092 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) 1104 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is 1122 len = (MAX_MATCH - 1) - (int)(strend-scan); 1123 scan = strend - (MAX_MATCH-1); 1153 len = MAX_MATCH [all...] |
H A D | deflate.h | 117 * wSize-MAX_MATCH bytes, but this ensures that IO is always 271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
|
H A D | trees.c | 108 uch _length_code[MAX_MATCH-MIN_MATCH+1]; 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)); 1037 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
|
H A D | zutil.h | 87 #define MAX_MATCH 258 macro
|
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/ |
H A D | zlib.c | 83 #define MAX_MATCH 258 macro 238 * wSize-MAX_MATCH bytes, but this ensures that IO is always 397 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 486 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 960 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; 964 register Bytef *strend = s->window + s->strstart + MAX_MATCH; 969 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. 972 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); 987 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) 999 * at strstart+257. If MAX_MATCH [all...] |
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/ |
H A D | zlib.c | 134 #define MAX_MATCH 258 macro 387 * matches are limited to a distance of wSize-MAX_MATCH bytes, 571 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 746 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 1478 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; 1482 register Bytef *strend = s->window + s->strstart + MAX_MATCH; 1488 * The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 1492 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); 1515 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) 1532 * strstart+257. If MAX_MATCH [all...] |
/illumos-gate/usr/src/cmd/expr/ |
H A D | expr.c | 67 #define MAX_MATCH 20 macro
|
/illumos-gate/usr/src/cmd/sendmail/src/ |
H A D | map.c | 6783 # define MAX_MATCH 32 macro 6952 int *fields = (int *) xalloc(sizeof(int) * (MAX_MATCH + 1)); 6960 if (substrings >= MAX_MATCH) 6962 syserr("too many substrings, %d max", MAX_MATCH); 6971 MAX_MATCH + 1, substrings) == -1) 7020 regmatch_t pmatch[MAX_MATCH]; 7033 name, MAX_MATCH, pmatch, 0); 7050 int fields[MAX_MATCH + 1]; 7063 if (parse_fields(av[1], fields, MAX_MATCH + 1, 7087 if (*ip >= MAX_MATCH || [all...] |
Completed in 119 milliseconds