Lines Matching defs:Bits
15 * size of 32 bits). If I'm not mistaking, this should not be possible
22 * 12 bits per symbol (for 8 bit symbols), meaning a maximum of 384
74 UInt Bits;
102 * _Huffman_ReadBits() - Read bits from a bitstream.
106 UInt bits )
115 /* Extract bits */
117 for( count = 0; count < bits; ++ count )
136 * _Huffman_WriteBits() - Write bits to a bitstream.
140 UInt bits )
150 /* Append bits */
151 mask = 1 << (bits-1);
152 for( count = 0; count < bits; ++ count )
192 sym[k].Bits = 0;
225 UInt code, UInt bits, UInt first,
239 sym[first].Bits = bits;
272 _Huffman_MakeTree( sym, stream, (code<<1)+0, bits+1,
294 _Huffman_MakeTree( sym, stream, (code<<1)+1, bits+1,
310 huff_bitstream_t *stream, UInt code, UInt bits,
324 sym[*symnum].Bits = bits;
336 _Huffman_RecoverTree( sym, stream, (code<<1)+0, bits+1,
344 _Huffman_RecoverTree( sym, stream, (code<<1)+1, bits+1,
392 /* Was any code > 32 bits? (we do not handle that at present) */
395 if( sym[k].Bits > 32 )
423 sym[symbol].Bits );
455 UInt bits, delta_bits, new_bits, code;
466 sym[k].Bits = 0x7fffffff;
479 if( sym[k].Bits > sym[k+1].Bits )
495 bits = 0;
499 delta_bits = sym[m].Bits - bits;
503 code = code | (new_bits << (32-bits-delta_bits));
504 bits = sym[m].Bits;
506 if( code == (sym[m].Code << (32-sym[m].Bits)) )
