Lines Matching +refs:val +refs:length
98 int length));
111 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
124 ush good_length; /* reduce lazy search above this match length */
125 ush max_lazy; /* do not perform lazy search above this match length */
126 ush nice_length; /* quit search above this match length */
176 * the previous length of the hash chain.
233 * output size for (length,distance) codes is <= 24 bits.
321 uInt length = dictLength;
334 if (length < MIN_MATCH) return Z_OK;
335 if (length > MAX_DIST(s)) {
336 length = MAX_DIST(s);
337 dictionary += dictLength - length; /* use the tail of the dictionary */
339 zmemcpy(s->window, dictionary, length);
340 s->strstart = length;
341 s->block_start = (long)length;
349 for (n = 0; n <= length - MIN_MATCH; n++) {
683 int val;
693 val = 1;
697 val = s->gzhead->name[s->gzindex++];
698 put_byte(s, val);
699 } while (val != 0);
703 if (val == 0) {
714 int val;
724 val = 1;
728 val = s->gzhead->comment[s->gzindex++];
729 put_byte(s, val);
730 } while (val != 0);
734 if (val == 0)
1016 * return its length. Matches shorter or equal to prev_length are discarded,
1021 * OUT assertion: the match length is not greater than s->lookahead.
1031 unsigned chain_length = s->max_chain_length;/* max hash chain length */
1034 register int len; /* length of current match */
1035 int best_len = s->prev_length; /* best match length so far */
1078 /* Skip to next match if the match length cannot increase
1079 * or if the match length is less than 2. Note that the checks below
1083 * However the length of the match is limited to the lookahead, so
1181 register int len; /* length of current match */
1195 /* Return failure if the match length is less than 2:
1232 local void check_match(s, start, match, length)
1235 int length;
1239 s->window + start, length) != EQUAL) {
1240 fprintf(stderr, " start %u, match %u, length %d\n",
1241 start, match, length);
1244 } while (--length != 0);
1248 fprintf(stderr,"\\[%d,%d]", start-match, length);
1249 do { putc(s->window[start++], stderr); } while (--length != 0);
1253 # define check_match(s, start, match, length)
1506 /* Insert new strings in the hash table only if the match length
1688 uInt run; /* length of run */
1689 uInt max; /* maximum length of run */