Lines Matching full:bits
24 #define HUFF_LOOKAHEAD 8 /* # of bits of lookahead */
39 /* Lookahead tables: indexed by the next HUFF_LOOKAHEAD bits of
41 * than HUFF_LOOKAHEAD bits long, we can obtain its length and
44 int look_nbits[1<<HUFF_LOOKAHEAD]; /* # bits, or 0 if too long */
55 * Fetching the next N bits from the input stream is a time-critical operation
57 * macros and out-of-line subroutines. Note that N (the number of bits
60 * We read source bytes into get_buffer and dole out bits as needed.
61 * If get_buffer already contains enough bits, they are fetched in-line
63 * bits, jpeg_fill_bit_buffer is called; it will attempt to fill get_buffer
64 * as full as possible (not just to the number of bits needed; this
68 * at least the requested number of bits --- dummy zeroes are inserted if
73 #define BIT_BUF_SIZE 32 /* size of buffer in bits */
76 /* If long is > 32 bits on your machine, and shifting/masking longs is
85 int bits_left; /* # of unused bits in it */
97 int bits_left; /* # of unused bits in it */
123 * Use CHECK_BIT_BUFFER to ensure there are N bits in get_buffer
128 * Ensure there are N bits in get_buffer; if suspend, take action.
130 * Fetch next N bits.
132 * Fetch next N bits without removing them from the buffer.
134 * Discard next N bits.
164 * We use a lookahead table to process codes of up to HUFF_LOOKAHEAD bits
166 * or fewer bits long. The few overlength codes are handled with a loop,
170 * 1. Near the end of the data segment, we may fail to get enough bits
173 * more than HUFF_LOOKAHEAD bits long.
