Lines Matching full:max_match
1169 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1173 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1178 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1181 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1206 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1218 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1236 len = (MAX_MATCH - 1) - (int)(strend-scan);
1237 scan = strend - (MAX_MATCH-1);
1267 len = MAX_MATCH - (int)(strend - scan);
1268 scan = strend - MAX_MATCH;
1303 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1305 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1308 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1341 len = MAX_MATCH - (int)(strend - scan);
1499 * time through here. WIN_INIT is set to MAX_MATCH since the longest match
1500 * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
1636 * at the end of the input file. We need MAX_MATCH bytes
1685 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1739 * at the end of the input file. We need MAX_MATCH bytes
1870 * at the end of the input file. We need MAX_MATCH bytes
1873 if (s->lookahead <= MAX_MATCH) {
1875 if (s->lookahead <= MAX_MATCH && flush == Z_NO_FLUSH) {
1887 strend = s->window + s->strstart + MAX_MATCH;
1894 s->match_length = MAX_MATCH - (int)(strend - scan);
