Lines Matching refs:MAX_MATCH
113 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
1049 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1053 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1058 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1061 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1086 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1098 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1116 len = (MAX_MATCH - 1) - (int)(strend-scan);
1117 scan = strend - (MAX_MATCH-1);
1147 len = MAX_MATCH - (int)(strend - scan);
1148 scan = strend - MAX_MATCH;
1182 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1184 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1187 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1220 len = MAX_MATCH - (int)(strend - scan);
1457 * at the end of the input file. We need MAX_MATCH bytes
1516 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1564 * at the end of the input file. We need MAX_MATCH bytes
1695 * at the end of the input file. We need MAX_MATCH bytes
1698 if (s->lookahead < MAX_MATCH) {
1700 if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {
1709 max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH;
