Lines Matching defs:length
92 int length));
105 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
118 ush good_length; /* reduce lazy search above this match length */
119 ush max_lazy; /* do not perform lazy search above this match length */
120 ush nice_length; /* quit search above this match length */
161 * the previous length of the hash chain.
218 * output size for (length,distance) codes is <= 24 bits.
296 uInt length = dictLength;
306 if (length < MIN_MATCH) return Z_OK;
307 if (length > MAX_DIST(s)) {
308 length = MAX_DIST(s);
310 dictionary += dictLength - length; /* use the tail of the dictionary */
313 zmemcpy(s->window, dictionary, length);
314 s->strstart = length;
315 s->block_start = (long)length;
323 for (n = 0; n <= length - MIN_MATCH; n++) {
713 * return its length. Matches shorter or equal to prev_length are discarded,
718 * OUT assertion: the match length is not greater than s->lookahead.
729 unsigned chain_length = s->max_chain_length;/* max hash chain length */
732 register int len; /* length of current match */
733 int best_len = s->prev_length; /* best match length so far */
776 /* Skip to next match if the match length cannot increase
777 * or if the match length is less than 2:
873 register int len; /* length of current match */
887 /* Return failure if the match length is less than 2:
926 local void check_match(s, start, match, length)
929 int length;
933 s->window + start, length) != EQUAL) {
934 fprintf(stderr, " start %u, match %u, length %d\n",
935 start, match, length);
938 } while (--length != 0);
942 fprintf(stderr,"\\[%d,%d]", start-match, length);
943 do { putc(s->window[start++], stderr); } while (--length != 0);
947 # define check_match(s, start, match, length)
1187 /* Insert new strings in the hash table only if the match length