Home | History | Annotate | Download | only in net

Lines Matching defs:matches

389      * bytes. With this organization, matches are limited to a distance of
434     /* Length of the best match at previous step. Matches not greater than this
519     uInt matchesmatches in current block */
623  *      most input files: try all possible matches and select the longest.
627  *      string matches are performed only when the previous match ends. So it
628  *      is preferable to spend more time in matches to allow very fast string
642  *      The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
715 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
738 /* 1 */ {4,    4,  8,    4, deflate_fast}, /* maximum speed, no lazy matches */
742 /* 4 */ {4,    4, 16,   16, deflate_slow},  /* lazy matches */
1338  * return its length. Matches shorter or equal to prev_length are discarded,
1362      * we prevent matches with the string of window index 0.
1389     /* Do not look for matches beyond the end of the input. This is necessary
1755  * This function does not perform lazy evaluation of matches and inserts
1757  * matches. It is used only for the fast compression options.
1789             /* To simplify the code, we prevent matches with the string
1850  * evaluation for matches: a match is finally adopted only if there is
1887             /* To simplify the code, we prevent matches with the string
2519     s->last_lit = s->matches = 0;
3127         s->matches++;
3153         if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1;