MAX_MATCH
if (s->lookahead <= MAX_MATCH) {
if (s->lookahead <= MAX_MATCH && flush == Z_NO_FLUSH) {
strend = s->window + s->strstart + MAX_MATCH;
s->match_length = MAX_MATCH - (int)(strend - scan);
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;
#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
#define WIN_INIT MAX_MATCH
(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
uch _length_code[MAX_MATCH-MIN_MATCH+1];
for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
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;
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)
if (s->lookahead <= MAX_MATCH) {
if (s->lookahead <= MAX_MATCH && flush == Z_NO_FLUSH) {
strend = s->window + s->strstart + MAX_MATCH;
s->match_length = MAX_MATCH - (int)(strend - scan);
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;
#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
#define WIN_INIT MAX_MATCH
(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
uch _length_code[MAX_MATCH-MIN_MATCH+1];
for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
if (s->lookahead <= MAX_MATCH) {
if (s->lookahead <= MAX_MATCH && flush == Z_NO_FLUSH) {
strend = s->window + s->strstart + MAX_MATCH;
s->match_length = MAX_MATCH - (int)(strend - scan);
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;
#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
#define WIN_INIT MAX_MATCH
(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
uch _length_code[MAX_MATCH-MIN_MATCH+1];
for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {