Searched refs:MAX_MATCH (Results 1 - 14 of 14) sorted by relevance

/freebsd-10.0-release/lib/libz/
H A Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
H A Ddeflate.c1170 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 Ddeflate.h120 * 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 Dtrees.c104 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 Dzutil.h76 #define MAX_MATCH 258 macro
/freebsd-10.0-release/lib/libz/contrib/asm686/
H A Dmatch.S28 #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)
/freebsd-10.0-release/lib/libz/contrib/gcc_gvmat64/
H A Dgvmat64.S93 #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
/freebsd-10.0-release/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Ddeflate.c118 #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 Ddeflate.h117 * wSize-MAX_MATCH bytes, but this ensures that IO is always
271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
H A Dtrees.c108 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 Dzutil.h87 #define MAX_MATCH 258 macro
/freebsd-10.0-release/sys/net/
H A Dzutil.h97 #define MAX_MATCH 258 macro
H A Dzlib.c133 #define MAX_MATCH 258 macro
374 * wSize-MAX_MATCH bytes, but this ensures that IO is always
528 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
658 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
1302 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1306 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1311 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1314 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1334 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1346 * at strstart+257. If MAX_MATCH
[all...]
/freebsd-10.0-release/contrib/sendmail/src/
H A Dmap.c6781 # define MAX_MATCH 32 macro
6950 int *fields = (int *) xalloc(sizeof(int) * (MAX_MATCH + 1));
6958 if (substrings >= MAX_MATCH)
6960 syserr("too many substrings, %d max", MAX_MATCH);
6969 MAX_MATCH + 1, substrings) == -1)
7018 regmatch_t pmatch[MAX_MATCH];
7031 name, MAX_MATCH, pmatch, 0);
7048 int fields[MAX_MATCH + 1];
7061 if (parse_fields(av[1], fields, MAX_MATCH + 1,
7085 if (*ip >= MAX_MATCH ||
[all...]

Completed in 155 milliseconds