Lines Matching refs:match_length
611 s->match_length = s->prev_length = MIN_MATCH-1;
694 s->match_length = s->prev_length = MIN_MATCH-1;
1851 * At this point we have always match_length < MIN_MATCH
1858 s->match_length = longest_match (s, hash_head);
1861 if (s->match_length >= MIN_MATCH) {
1862 check_match(s, s->strstart, s->match_start, s->match_length);
1865 s->match_length - MIN_MATCH, bflush);
1867 s->lookahead -= s->match_length;
1873 if (s->match_length <= s->max_insert_length &&
1875 s->match_length--; /* string at strstart already in table */
1882 } while (--s->match_length != 0);
1887 s->strstart += s->match_length;
1888 s->match_length = 0;
1953 s->prev_length = s->match_length, s->prev_match = s->match_start;
1954 s->match_length = MIN_MATCH-1;
1962 s->match_length = longest_match (s, hash_head);
1965 if (s->match_length <= 5 && (s->strategy == Z_FILTERED
1967 || (s->match_length == MIN_MATCH &&
1975 s->match_length = MIN_MATCH-1;
1981 if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
2003 s->match_length = MIN_MATCH-1;
2072 s->match_length = 0;
2084 s->match_length = MAX_MATCH - (uInt)(strend - scan);
2085 if (s->match_length > s->lookahead)
2086 s->match_length = s->lookahead;
2093 if (s->match_length >= MIN_MATCH) {
2094 check_match(s, s->strstart, s->strstart - 1, s->match_length);
2096 _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);
2098 s->lookahead -= s->match_length;
2099 s->strstart += s->match_length;
2100 s->match_length = 0;
2140 s->match_length = 0;