Lines Matching defs:length
97 int length));
110 /* 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 */
170 * the previous length of the hash chain.
285 * for length/distance pairs over any compressed block is assured to be 31
288 * Analysis: The longest fixed codes are a length code of 8 bits plus 5
291 * possible fixed-codes length/distance pair is then 31 bits total.
296 * literal/length. As each symbol is consumed, the pointer to the next
318 * Therefore its average symbol length is assured to be less than 31. So
354 uInt length = dictLength;
367 if (length < MIN_MATCH) return Z_OK;
368 if (length > s->w_size) {
369 length = s->w_size;
370 dictionary += dictLength - length; /* use the tail of the dictionary */
372 zmemcpy(s->window, dictionary, length);
373 s->strstart = length;
374 s->block_start = (long)length;
382 for (n = 0; n <= length - MIN_MATCH; n++) {
551 /* compute wrapper length */
1098 * return its length. Matches shorter or equal to prev_length are discarded,
1103 * OUT assertion: the match length is not greater than s->lookahead.
1113 unsigned chain_length = s->max_chain_length;/* max hash chain length */
1116 register int len; /* length of current match */
1117 int best_len = s->prev_length; /* best match length so far */
1160 /* Skip to next match if the match length cannot increase
1161 * or if the match length is less than 2. Note that the checks below
1165 * However the length of the match is limited to the lookahead, so
1264 register int len; /* length of current match */
1278 /* Return failure if the match length is less than 2:
1317 local void check_match(s, start, match, length)
1320 int length;
1324 s->window + start, length) != EQUAL) {
1325 fprintf(stderr, " start %u, match %u, length %d\n",
1326 start, match, length);
1329 } while (--length != 0);
1333 fprintf(stderr,"\\[%d,%d]", start-match, length);
1334 do { putc(s->window[start++], stderr); } while (--length != 0);
1338 # define check_match(s, start, match, length)
1614 /* Insert new strings in the hash table only if the match length
1805 Bytef *scan, *strend; /* scan goes up to strend for length of run */