Lines Matching refs:match_length
41844 s.match_length = longest_match(s, hash_head);
41847 if (s.match_length >= MIN_MATCH) {
41852 bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);
41854 s.lookahead -= s.match_length;
41859 if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {
41860 s.match_length--; /* string at strstart already in table */
41871 } while (--s.match_length !== 0);
41875 s.strstart += s.match_length;
41876 s.match_length = 0;
41967 s.prev_length = s.match_length;
41969 s.match_length = MIN_MATCH - 1;
41977 s.match_length = longest_match(s, hash_head);
41980 if (s.match_length <= 5 &&
41981 …(s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*…
41986 s.match_length = MIN_MATCH - 1;
41992 if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {
42018 s.match_length = MIN_MATCH - 1;
42115 s.match_length = 0;
42128 s.match_length = MAX_MATCH - (strend - scan);
42129 if (s.match_length > s.lookahead) {
42130 s.match_length = s.lookahead;
42137 if (s.match_length >= MIN_MATCH) {
42141 bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);
42143 s.lookahead -= s.match_length;
42144 s.strstart += s.match_length;
42145 s.match_length = 0;
42205 s.match_length = 0;
42292 s.match_length = s.prev_length = MIN_MATCH - 1;
42353 this.match_length = 0; /* length of best match */
43053 s.match_length = s.prev_length = MIN_MATCH - 1;