MAX_MATCH
len = (MAX_MATCH - 1) - (int)(strend-scan);
scan = strend - (MAX_MATCH-1);
len = MAX_MATCH - (int)(strend - scan);
scan = strend - MAX_MATCH;
local uch length_code[MAX_MATCH-MIN_MATCH+1];
(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
register Bytef *strend = s->window + s->strstart + MAX_MATCH;
Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
int *fields = (int *) xalloc(sizeof(int) * (MAX_MATCH + 1));
if (substrings >= MAX_MATCH)
syserr("too many substrings, %d max", MAX_MATCH);
MAX_MATCH + 1, substrings) == -1)
regmatch_t pmatch[MAX_MATCH];
name, MAX_MATCH, pmatch, 0);
int fields[MAX_MATCH + 1];
if (parse_fields(av[1], fields, MAX_MATCH + 1,
if (*ip >= MAX_MATCH ||
register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
register Bytef *strend = s->window + s->strstart + MAX_MATCH;
Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
len = (MAX_MATCH - 1) - (int)(strend-scan);
scan = strend - (MAX_MATCH-1);
len = MAX_MATCH - (int)(strend - scan);
scan = strend - MAX_MATCH;
register Bytef *strend = s->window + s->strstart + MAX_MATCH;
Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
len = MAX_MATCH - (int)(strend - scan);
local uch _length_code[MAX_MATCH-MIN_MATCH+1];
(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)