lib/libz/deflate.c

1404

Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;

lib/libz/deflate.c

1408

Bytef *strend = s->window + s->strstart + MAX_MATCH;

lib/libz/deflate.c

1416

Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");

lib/libz/deflate.c

1442

#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)

lib/libz/deflate.c

1473

len = (MAX_MATCH - 1) - (int)(strend - scan);

lib/libz/deflate.c

1474

scan = strend - (MAX_MATCH-1);

lib/libz/deflate.c

1505

len = MAX_MATCH - (int)(strend - scan);

lib/libz/deflate.c

1506

scan = strend - MAX_MATCH;

lib/libz/deflate.c

1537

Bytef *strend = s->window + s->strstart + MAX_MATCH;

lib/libz/deflate.c

1542

Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");

lib/libz/deflate.c

1576

len = MAX_MATCH - (int)(strend - scan);

lib/libz/deflate.c

2090

if (s->lookahead <= MAX_MATCH) {

lib/libz/deflate.c

2092

if (s->lookahead <= MAX_MATCH && flush == Z_NO_FLUSH) {

lib/libz/deflate.c

2104

strend = s->window + s->strstart + MAX_MATCH;

lib/libz/deflate.c

2111

s->match_length = MAX_MATCH - (uInt)(strend - scan);

lib/libz/deflate.h

294

#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)

lib/libz/deflate.h

304

#define WIN_INIT MAX_MATCH

lib/libz/trees.c

102

uch _length_code[MAX_MATCH-MIN_MATCH+1];

lib/libz/trees.c

1110

(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&

lib/libz/trees.c

414

for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {

lib/libz/trees.c

416

SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));

lib/libz/trees.h

102

const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {

sys/lib/libz/deflate.c

1404

Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;

sys/lib/libz/deflate.c

1408

Bytef *strend = s->window + s->strstart + MAX_MATCH;

sys/lib/libz/deflate.c

1416

Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");

sys/lib/libz/deflate.c

1442

#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)

sys/lib/libz/deflate.c

1473

len = (MAX_MATCH - 1) - (int)(strend - scan);

sys/lib/libz/deflate.c

1474

scan = strend - (MAX_MATCH-1);

sys/lib/libz/deflate.c

1505

len = MAX_MATCH - (int)(strend - scan);

sys/lib/libz/deflate.c

1506

scan = strend - MAX_MATCH;

sys/lib/libz/deflate.c

1537

Bytef *strend = s->window + s->strstart + MAX_MATCH;

sys/lib/libz/deflate.c

1542

Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");

sys/lib/libz/deflate.c

1576

len = MAX_MATCH - (int)(strend - scan);

sys/lib/libz/deflate.c

2092

if (s->lookahead <= MAX_MATCH) {

sys/lib/libz/deflate.c

2094

if (s->lookahead <= MAX_MATCH && flush == Z_NO_FLUSH) {

sys/lib/libz/deflate.c

2106

strend = s->window + s->strstart + MAX_MATCH;

sys/lib/libz/deflate.c

2113

s->match_length = MAX_MATCH - (uInt)(strend - scan);

sys/lib/libz/deflate.h

294

#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)

sys/lib/libz/deflate.h

304

#define WIN_INIT MAX_MATCH

sys/lib/libz/trees.c

102

uch _length_code[MAX_MATCH-MIN_MATCH+1];

sys/lib/libz/trees.c

1110

(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&

sys/lib/libz/trees.c

414

for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {

sys/lib/libz/trees.c

416

SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));

sys/lib/libz/trees.h

102

const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {