Lines Matching refs:len
224 #define zmemzero(dest, len) _fmemset(dest, 0, len)
228 #define zmemzero(dest, len) (void) memset(dest, 0, len)
231 extern void zmemcpy OF((Bytef* dest, const Bytef* source, uInt len));
232 extern int zmemcmp OF((const Bytef* s1, const Bytef* s2, uInt len));
233 extern void zmemzero OF((Bytef* dest, uInt len));
263 typedef uLong (*check_func) OF((uLong check, const Bytef *buf, uInt len));
336 ush len; /* length of bit string */
343 #define Len dl.len
615 { uch len = (length); \
618 s->l_buf[s->last_lit++] = len; \
620 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
1094 unsigned len = s->pending;
1096 if (len > strm->avail_out) len = strm->avail_out;
1097 if (len == 0)
1101 zmemcpy(strm->next_out, s->pending_out, len);
1102 strm->next_out += len;
1104 s->pending_out += len;
1105 strm->total_out += len;
1106 strm->avail_out -= len;
1107 s->pending -= len;
1389 unsigned len = strm->avail_in;
1391 if (len > size) len = size;
1392 if (len == 0)
1395 strm->avail_in -= len;
1398 strm->adler = adler32(strm->adler, strm->next_in, len);
1400 zmemcpy(buf, strm->next_in, len);
1401 strm->next_in += len;
1402 strm->total_in += len;
1404 return ((int)len);
1461 register int len; /* length of current match */
1552 len = (MAX_MATCH - 1) - (int)(strend-scan);
1589 len = MAX_MATCH - (int)(strend - scan);
1594 if (len > best_len) {
1596 best_len = len;
1597 if (len >= nice_match) break;
1624 register int len; /* length of current match */
1668 len = MAX_MATCH - (int)(strend - scan);
1670 if (len < MIN_MATCH)
1674 return (len <= s->lookahead ? len : s->lookahead);
2374 local void copy_block OF((deflate_state *s, charf *buf, unsigned len,
2433 { int len = length; \
2434 if (s->bi_valid > (int)Buf_size - len) {\
2439 s->bi_valid += len - Buf_size; \
2442 s->bi_valid += len; \
2650 * OUT assertions: the field len is set to the optimal bit length, the
2749 * the given tree and the field len is set for all tree elements.
2781 int len = tree[n].Len;
2782 if (len == 0) continue;
2784 tree[n].Code = bi_reverse(next_code[len]++, len);
2788 n, (isgraph(n) ? n : ' '), len, tree[n].Code,
2789 next_code[len]-1));
2798 * OUT assertions: the fields len and code are set to the optimal bit length
2890 /* The field len is now set, we can generate the bit codes */
3439 * Reverse the first len bits of a code, using straightforward code (a faster
3441 * IN assertion: 1 <= len <= 15
3444 bi_reverse(code, len)
3446 int len; /* its bit length */
3452 } while (--len > 0);
3501 copy_block(s, buf, len, header)
3504 unsigned len; /* its length */
3511 put_short(s, (ush)len);
3512 put_short(s, (ush)~len);
3518 s->bits_sent += (ulg)len<<3;
3521 Assert(s->pending + len < s->pending_buf_size, "pending_buf overrun");
3522 zmemcpy(&s->pending_buf[s->pending], buf, len); /* PPP */
3523 s->pending += len; /* PPP */
5281 uInt len;
5390 c->len = t->base;
5412 c->len += (uInt)b & inflate_mask[j];
5417 "inflate: length %u\n", c->len));
5463 while (c->len)
5469 c->len--;
5874 zmemcpy(dest, source, len)
5877 uInt len;
5879 if (len == 0)
5883 } while (--len != 0);
5887 zmemcmp(s1, s2, len)
5890 uInt len;
5894 for (j = 0; j < len; j++) {
5902 zmemzero(dest, len)
5904 uInt len;
5906 if (len == 0)
5910 } while (--len != 0);
6084 adler32(adler, buf, len)
6087 uInt len;
6096 while (len > 0) {
6097 k = len < NMAX ? len : NMAX;
6098 len -= k;