Lines Matching refs:len
155 local void copy_block OF((deflate_state *s, charf *buf, unsigned len,
214 { int len = length;\
215 if (s->bi_valid > (int)Buf_size - len) {\
220 s->bi_valid += len - Buf_size;\
223 s->bi_valid += len;\
483 * OUT assertions: the field len is set to the optimal bit length, the
571 * the given tree and the field len is set for all tree elements.
599 int len = tree[n].Len;
600 if (len == 0) continue;
602 tree[n].Code = bi_reverse(next_code[len]++, len);
605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
613 * OUT assertions: the fields len and code are set to the optimal bit length
697 /* The field len is now set, we can generate the bit codes */
1150 * Reverse the first len bits of a code, using straightforward code (a faster
1152 * IN assertion: 1 <= len <= 15
1154 local unsigned bi_reverse(code, len)
1156 int len; /* its bit length */
1162 } while (--len > 0);
1205 local void copy_block(s, buf, len, header)
1208 unsigned len; /* its length */
1214 put_short(s, (ush)len);
1215 put_short(s, (ush)~len);
1221 s->bits_sent += (ulg)len<<3;
1223 while (len--) {