Lines Matching defs:bits
50 /* Bit length codes must not exceed MAX_BL_BITS bits */
56 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
59 /* repeat a zero length 3-10 times (3 bits of repeat count) */
62 /* repeat a zero length 11-138 times (7 bits of repeat count) */
64 static const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
67 static const int extra_dbits[D_CODES] /* extra bits for each distance code */
70 static const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
92 * 5 bits.)
97 * 3 .. 258, the last 256 values correspond to the top 8 bits of
112 const int *extra_bits; /* extra bits for each code or NULL */
175 int bits; /* bit counter */
194 * in two different ways: code 284 + 5 bits or code 285, so we
218 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
366 int bits; /* bit length */
367 int xbits; /* extra bits */
371 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
380 bits = tree[tree[n].Dad].Len + 1;
381 if (bits > max_length) bits = max_length, overflow++;
382 tree[n].Len = (ush)bits;
387 s->bl_count[bits]++;
391 s->opt_len += (ulg)f * (bits + xbits);
401 bits = max_length-1;
402 while (s->bl_count[bits] == 0) bits--;
403 s->bl_count[bits]--; /* move one leaf down the tree */
404 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
417 for (bits = max_length; bits != 0; bits--) {
418 n = s->bl_count[bits];
422 if (tree[m].Len != (unsigned) bits) {
423 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
424 s->opt_len += ((long)bits - (long)tree[m].Len)
426 tree[m].Len = (ush)bits;
449 int bits; /* bit index */
455 for (bits = 1; bits <= MAX_BITS; bits++) {
456 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
468 /* Now reverse the bits */
521 /* node is 0 or 1 so it does not have extra bits */
683 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
766 * This takes 10 bits, of which 7 may remain in the bit buffer.
767 * The current inflate code requires 9 bits of lookahead. If the
769 * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
783 /* Of the 10 bits for the empty block, we have already sent
784 * (10 - bi_valid) bits. The lookahead for the last real code (before
974 int extra; /* number of extra bits to send */
989 send_bits(s, lc, extra); /* send the extra length bits */
999 send_bits(s, dist, extra); /* send the extra distance bits */