Lines Matching refs:len
93 # define zmemzero(dest, len) memset(dest, 0, len)
121 typedef uLong (*check_func) OF((uLong check, Bytef *buf, uInt len));
191 ush len; /* length of bit string */
198 #define Len dl.len
712 unsigned len = state->pending;
714 if (len > strm->avail_out) len = strm->avail_out;
715 if (len == 0) return;
718 zmemcpy(strm->next_out, state->pending_out, len);
719 strm->next_out += len;
721 state->pending_out += len;
722 strm->total_out += len;
723 strm->avail_out -= len;
724 state->pending -= len;
881 unsigned len = strm->avail_in;
884 if (len > size) len = size;
885 if (len == 0) return 0;
887 strm->avail_in -= len;
890 state->adler = adler32(state->adler, strm->next_in, len);
892 zmemcpy(buf, strm->next_in, len);
893 strm->next_in += len;
894 strm->total_in += len;
896 return (int)len;
946 register int len; /* length of current match */
1017 len = (MAX_MATCH - 1) - (int)(strend-scan);
1048 len = MAX_MATCH - (int)(strend - scan);
1053 if (len > best_len) {
1055 best_len = len;
1056 if (len >= s->nice_match) break;
1586 local void copy_block OF((deflate_state *s, charf *buf, unsigned len,
1648 { int len = length;\
1649 if (s->bi_valid > (int)Buf_size - len) {\
1654 s->bi_valid += len - Buf_size;\
1657 s->bi_valid += len;\
1843 * OUT assertions: the field len is set to the optimal bit length, the
1931 * the given tree and the field len is set for all tree elements.
1959 int len = tree[n].Len;
1960 if (len == 0) continue;
1962 tree[n].Code = bi_reverse(next_code[len]++, len);
1965 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
1973 * OUT assertions: the fields len and code are set to the optimal bit length
2056 /* The field len is now set, we can generate the bit codes */
2517 * Reverse the first len bits of a code, using straightforward code (a faster
2519 * IN assertion: 1 <= len <= 15
2521 local unsigned bi_reverse(code, len)
2523 int len; /* its bit length */
2529 } while (--len > 0);
2572 local void copy_block(s, buf, len, header)
2575 unsigned len; /* its length */
2582 put_short(s, (ush)len);
2583 put_short(s, (ush)~len);
2589 s->bits_sent += (ulg)len<<3;
2591 while (len--) {
4100 uInt len;
4201 c->len = t->base;
4224 c->len += (uInt)b & inflate_mask[j];
4228 Tracevv((stderr, "inflate: length %u\n", c->len));
4270 while (c->len)
4276 c->len--;
4589 uLong adler32(adler, buf, len)
4592 uInt len;
4600 while (len > 0) {
4601 k = len < NMAX ? len : NMAX;
4602 len -= k;