Lines Matching defs:bit
17 * At a granularity of 4KiB storage represented per bit,
24 * by encoding runlengths of bit polarity.
27 * But then we have to store the value of the first bit.
28 * The first bit of information thus shall encode if the first runlength
33 * even when encoding the runlength as fixed size 32bit/64bit integers.
56 * * various bit based with different code word length.
69 * __little endian__ bitstream, least significant bit first (left most)
73 * 10 levels can be described in 8bit, with minimal overhead
77 * last level (+1 data bit, so it makes 64bit total). The only worse code when
78 * encoding bit polarity runlength is 1 plain bits => 2 code bits.
182 /* code from here down is independend of actually used bit code */
186 * This encodes arbitrary bit length, not whole bytes: we have a bit-stream,
194 /* the current bit within *b, nomalized: 0..7 */
195 unsigned int bit;
198 /* initialize cursor to point to first bit of stream */
202 cur->bit = 0;
209 bits += cur->bit;
211 cur->bit = bits & 7;
256 if ((bs->cur.b + ((bs->cur.bit + bits -1) >> 3)) - bs->buf >= bs->buf_len)
263 *b++ |= (val & 0xff) << bs->cur.bit;
265 for (tmp = 8 - bs->cur.bit; tmp < bits; tmp += 8)
289 if (bs->cur.b + ((bs->cur.bit + bs->pad_bits + bits -1) >> 3) - bs->buf >= bs->buf_len)
291 - bs->cur.bit - bs->pad_bits;
300 n = (bs->cur.bit + bits + 7) >> 3;
301 /* n may be at most 9, if cur.bit + bits > 64 */
305 val = le64_to_cpu(val) << (8 - bs->cur.bit);
309 val |= bs->cur.b[0] >> bs->cur.bit;