Lines Matching refs:match_length
645 s->match_length = s->prev_length = MIN_MATCH-1;
727 s->match_length = s->prev_length = MIN_MATCH-1;
1895 * At this point we have always match_length < MIN_MATCH
1902 s->match_length = longest_match (s, hash_head);
1905 if (s->match_length >= MIN_MATCH) {
1906 check_match(s, s->strstart, s->match_start, s->match_length);
1909 s->match_length - MIN_MATCH, bflush);
1911 s->lookahead -= s->match_length;
1917 if (s->match_length <= s->max_insert_length &&
1919 s->match_length--; /* string at strstart already in table */
1926 } while (--s->match_length != 0);
1931 s->strstart += s->match_length;
1932 s->match_length = 0;
1999 s->prev_length = s->match_length, s->prev_match = s->match_start;
2000 s->match_length = MIN_MATCH-1;
2008 s->match_length = longest_match (s, hash_head);
2011 if (s->match_length <= 5 && (s->strategy == Z_FILTERED
2013 || (s->match_length == MIN_MATCH &&
2021 s->match_length = MIN_MATCH-1;
2027 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
2055 s->match_length = MIN_MATCH-1;
2123 s->match_length = 0;
2135 s->match_length = MAX_MATCH - (uInt)(strend - scan);
2136 if (s->match_length > s->lookahead)
2137 s->match_length = s->lookahead;
2144 if (s->match_length >= MIN_MATCH) {
2145 check_match(s, s->strstart, s->strstart - 1, s->match_length);
2147 _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);
2149 s->lookahead -= s->match_length;
2150 s->strstart += s->match_length;
2151 s->match_length = 0;
2190 s->match_length = 0;