Lines Matching refs:MAX_MATCH
1170 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1174 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1179 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1182 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1207 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1219 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1237 len = (MAX_MATCH - 1) - (int)(strend-scan);
1238 scan = strend - (MAX_MATCH-1);
1268 len = MAX_MATCH - (int)(strend - scan);
1269 scan = strend - MAX_MATCH;
1304 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1306 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1309 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1342 len = MAX_MATCH - (int)(strend - scan);
1500 * time through here. WIN_INIT is set to MAX_MATCH since the longest match
1501 * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
1637 * at the end of the input file. We need MAX_MATCH bytes
1686 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1740 * at the end of the input file. We need MAX_MATCH bytes
1871 * at the end of the input file. We need MAX_MATCH bytes
1874 if (s->lookahead <= MAX_MATCH) {
1876 if (s->lookahead <= MAX_MATCH && flush == Z_NO_FLUSH) {
1888 strend = s->window + s->strstart + MAX_MATCH;
1895 s->match_length = MAX_MATCH - (int)(strend - scan);
