MAX_MATCH 113 lib/zlib/deflate.c #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) MAX_MATCH 1046 lib/zlib/deflate.c register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1; MAX_MATCH 1050 lib/zlib/deflate.c register Bytef *strend = s->window + s->strstart + MAX_MATCH; MAX_MATCH 1058 lib/zlib/deflate.c Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); MAX_MATCH 1083 lib/zlib/deflate.c #if (defined(UNALIGNED_OK) && MAX_MATCH == 258) MAX_MATCH 1113 lib/zlib/deflate.c len = (MAX_MATCH - 1) - (int)(strend-scan); MAX_MATCH 1114 lib/zlib/deflate.c scan = strend - (MAX_MATCH-1); MAX_MATCH 1144 lib/zlib/deflate.c len = MAX_MATCH - (int)(strend - scan); MAX_MATCH 1145 lib/zlib/deflate.c scan = strend - MAX_MATCH; MAX_MATCH 1179 lib/zlib/deflate.c register Bytef *strend = s->window + s->strstart + MAX_MATCH; MAX_MATCH 1184 lib/zlib/deflate.c Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); MAX_MATCH 1217 lib/zlib/deflate.c len = MAX_MATCH - (int)(strend - scan); MAX_MATCH 1698 lib/zlib/deflate.c if (s->lookahead < MAX_MATCH) { MAX_MATCH 1700 lib/zlib/deflate.c if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) { MAX_MATCH 1709 lib/zlib/deflate.c max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH; MAX_MATCH 271 lib/zlib/deflate.h #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) MAX_MATCH 108 lib/zlib/trees.c uch _length_code[MAX_MATCH-MIN_MATCH+1]; MAX_MATCH 358 lib/zlib/trees.c for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { MAX_MATCH 360 lib/zlib/trees.c SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); MAX_MATCH 1037 lib/zlib/trees.c (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && MAX_MATCH 102 lib/zlib/trees.h const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {