Lines Matching defs:bits
106 unsigned char selectors[32768]; /* nSelectors = 15 bits */
114 /* Return the next nnn bits of input. All reads from the compressed input
118 unsigned int bits = 0;
138 bits = bd->inbufBits&((1 << bd->inbufBitCount)-1);
140 bits <<= bits_wanted;
143 /* Grab next 8 bits of input from buffer. */
149 bits |= (bd->inbufBits >> bd->inbufBitCount)&((1 << bits_wanted)-1);
151 return bits;
255 Optimization: grab 2 bits and unget
291 * symbol with a given number of bits can have. This
327 and then unget bits after determining how
328 many we need, and those extra bits could be
332 bits, so here we set all the trailing
333 to-be-ignored bits to 1 so they don't
369 /* Note: It is far cheaper to read maxLen bits and
370 back up than it is to read minLen bits and then an
393 /* Figure how many bits are in next symbol and
423 or 0/1 method (except all bits 0, which