Lines Matching defs:bits
51 * stream of bits, optionally with interwoven literal bytes. Bits are assumed
52 * to be stored in little endian 16-bit coding units, with the bits ordered high
57 /* Bits that have been read from the input buffer. The bits are
62 /* Number of bits currently held in @bitbuf. */
83 * bits. Following this, bitstream_peek_bits() and/or bitstream_remove_bits()
84 * may be called on the bitstream to peek or remove up to @num_bits bits. Note
100 /* Return the next @num_bits bits from the bitstream, without removing them.
121 /* Remove and return @num_bits bits from the bitstream. There must be at least
128 u32 bits = bitstream_peek_bits(is, num_bits);
131 return bits;
134 /* Read and return the next @num_bits bits from the bitstream. */
205 * input data is exhausted, the Huffman symbol is decoded as if the missing bits
218 /* Index the decode table by the next table_bits bits of the input. */
223 * symbol and codeword length. The low 11 bits are the
224 * symbol, and the high 5 bits are the codeword length.