Cross Reference: /forgerock/web-agents-v4/zlib/deflate.c

Lines Matching refs:MIN_MATCH
146 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
177  *    input characters and the first MIN_MATCH bytes of str are valid
178  *    (except for the last MIN_MATCH-1 bytes of the input file).
182    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
187    (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
291     s->hash_shift =  ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
364     while (s->lookahead >= MIN_MATCH) {
366         n = s->lookahead - (MIN_MATCH-1);
368             UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
376         s->lookahead = MIN_MATCH-1;
383     s->match_length = s->prev_length = MIN_MATCH-1;
1124     s->match_length = s->prev_length = MIN_MATCH-1;
1319     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1344     if (len < MIN_MATCH) return MIN_MATCH - 1;
1471         if (s->lookahead + s->insert >= MIN_MATCH) {
1475 #if MIN_MATCH != 3
1476             Call UPDATE_HASH() MIN_MATCH-3 more times
1479                 UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
1486                 if (s->lookahead + s->insert < MIN_MATCH)
1490         /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
1638          * for the next match, plus MIN_MATCH bytes to insert the
1653         if (s->lookahead >= MIN_MATCH) {
1658          * At this point we have always match_length < MIN_MATCH
1668         if (s->match_length >= MIN_MATCH) {
1672                            s->match_length - MIN_MATCH, bflush);
1681                 s->lookahead >= MIN_MATCH) {
1687                      * always MIN_MATCH bytes ahead.
1698 #if MIN_MATCH != 3
1699                 Call UPDATE_HASH() MIN_MATCH-3 more times
1701                 /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
1714     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1741          * for the next match, plus MIN_MATCH bytes to insert the
1756         if (s->lookahead >= MIN_MATCH) {
1763         s->match_length = MIN_MATCH-1;
1776                 || (s->match_length == MIN_MATCH &&
1781                 /* If prev_match is also MIN_MATCH, match_start is garbage
1784                 s->match_length = MIN_MATCH-1;
1790         if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
1791             uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
1797                            s->prev_length - MIN_MATCH, bflush);
1812             s->match_length = MIN_MATCH-1;
1845     s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
1884         if (s->lookahead >= MIN_MATCH && s->strstart > 0) {
1902         /* Emit match if have run of MIN_MATCH or longer, else emit literal */
1903         if (s->match_length >= MIN_MATCH) {
1906             _tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);