Lines Matching refs:len
159 local void copy_block OF((deflate_state *s, charf *buf, unsigned len,
218 { int len = length;\
219 if (s->bi_valid > (int)Buf_size - len) {\
224 s->bi_valid += len - Buf_size;\
227 s->bi_valid += len;\
485 * OUT assertions: the field len is set to the optimal bit length, the
573 * the given tree and the field len is set for all tree elements.
601 int len = tree[n].Len;
602 if (len == 0) continue;
604 tree[n].Code = bi_reverse(next_code[len]++, len);
607 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
615 * OUT assertions: the fields len and code are set to the optimal bit length
699 /* The field len is now set, we can generate the bit codes */
1142 * Reverse the first len bits of a code, using straightforward code (a faster
1144 * IN assertion: 1 <= len <= 15
1146 local unsigned bi_reverse(code, len)
1148 int len; /* its bit length */
1154 } while (--len > 0);
1197 local void copy_block(s, buf, len, header)
1200 unsigned len; /* its length */
1207 put_short(s, (ush)len);
1208 put_short(s, (ush)~len);
1214 s->bits_sent += (ulg)len<<3;
1216 while (len--) {