Lines Matching refs:match_length
6533 s.match_length = longest_match(s, hash_head);
6536 if (s.match_length >= MIN_MATCH) {
6541 bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);
6543 s.lookahead -= s.match_length;
6548 if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {
6549 s.match_length--; /* string at strstart already in table */
6560 } while (--s.match_length !== 0);
6564 s.strstart += s.match_length;
6565 s.match_length = 0;
6656 s.prev_length = s.match_length;
6658 s.match_length = MIN_MATCH - 1;
6666 s.match_length = longest_match(s, hash_head);
6669 if (s.match_length <= 5 &&
6670 …(s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*…
6675 s.match_length = MIN_MATCH - 1;
6681 if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {
6707 s.match_length = MIN_MATCH - 1;
6804 s.match_length = 0;
6817 s.match_length = MAX_MATCH - (strend - scan);
6818 if (s.match_length > s.lookahead) {
6819 s.match_length = s.lookahead;
6826 if (s.match_length >= MIN_MATCH) {
6830 bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);
6832 s.lookahead -= s.match_length;
6833 s.strstart += s.match_length;
6834 s.match_length = 0;
6894 s.match_length = 0;
6981 s.match_length = s.prev_length = MIN_MATCH - 1;
7042 this.match_length = 0; /* length of best match */
7742 s.match_length = s.prev_length = MIN_MATCH - 1;