Lines Matching defs:bits
48 /* Bit length codes must not exceed MAX_BL_BITS bits */
54 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
57 /* repeat a zero length 3-10 times (3 bits of repeat count) */
60 /* repeat a zero length 11-138 times (7 bits of repeat count) */
62 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
78 /* Number of bits used within bi_buf. (bi_buf might be implemented on
79 * more than 16 bits on some systems.)
100 * 5 bits.)
105 * 3 .. 258, the last 256 values correspond to the top 8 bits of
124 const intf *extra_bits; /* extra bits for each code or NULL */
187 * Send a value on a given number of bits.
188 * IN assertion: length <= 16 and value fits in length bits.
196 int length; /* number of bits */
202 /* If not enough room in bi_buf, use (valid) bits from bi_buf and
203 * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
204 * unused bits in value.
244 int bits; /* bit counter */
272 * in two different ways: code 284 + 5 bits or code 285, so we
296 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
506 int bits; /* bit length */
507 int xbits; /* extra bits */
511 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
520 bits = tree[tree[n].Dad].Len + 1;
521 if (bits > max_length) bits = max_length, overflow++;
522 tree[n].Len = (ush)bits;
527 s->bl_count[bits]++;
531 s->opt_len += (ulg)f * (bits + xbits);
541 bits = max_length-1;
542 while (s->bl_count[bits] == 0) bits--;
543 s->bl_count[bits]--; /* move one leaf down the tree */
544 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
557 for (bits = max_length; bits != 0; bits--) {
558 n = s->bl_count[bits];
562 if ((unsigned) tree[m].Len != (unsigned) bits) {
563 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
564 s->opt_len += ((long)bits - (long)tree[m].Len)
566 tree[m].Len = (ush)bits;
588 int bits; /* bit index */
594 for (bits = 1; bits <= MAX_BITS; bits++) {
595 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
607 /* Now reverse the bits */
659 /* node is 0 or 1 so it does not have extra bits */
819 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
887 * This takes 10 bits, of which 7 may remain in the bit buffer.
888 * The current inflate code requires 9 bits of lookahead. If the
890 * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
905 /* Of the 10 bits for the empty block, we have already sent
906 * (10 - bi_valid) bits. The lookahead for the last real code (before
1008 * and uLong implemented on 32 bits.
1063 int extra; /* number of extra bits to send */
1079 send_bits(s, lc, extra); /* send the extra length bits */
1089 send_bits(s, dist, extra); /* send the extra distance bits */
1119 * set bits 0..6, 14..25, and 28..31
1145 * Reverse the first len bits of a code, using straightforward code (a faster
1162 * Flush the bit buffer, keeping at most 7 bits in it.