Lines Matching defs:len
159 * Reverse the first len bits of a code, using straightforward code (a faster
161 * IN assertion: 1 <= len <= 15
163 local unsigned bi_reverse(unsigned code, int len)
169 } while (--len > 0);
210 * the given tree and the field len is set for all tree elements.
236 int len = tree[n].Len;
237 if (len == 0) continue;
239 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
242 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
288 { int len = length;\
289 if (s->bi_valid > (int)Buf_size - len) {\
294 s->bi_valid += len - Buf_size;\
297 s->bi_valid += len;\
551 * OUT assertions: the field len is set to the optimal bit length, the
640 * OUT assertions: the fields len and code are set to the optimal bit length
722 /* The field len is now set, we can generate the bit codes */