Lines Matching defs:bits
78 char selectors[32768]; // nSelectors=15 bits
91 // Return the next nnn bits of input. All reads from the compressed input
95 unsigned int bits = 0;
110 bits = bd->inbufBits&((1<<bd->inbufBitCount)-1);
112 bits <<= bits_wanted;
116 // Grab next 8 bits of input from buffer.
123 bits |= (bd->inbufBits>>bd->inbufBitCount) & ((1<<bits_wanted)-1);
125 return bits;
130 * 48 bits : Block signature, either pi (data block) or e (EOF block).
131 * 32 bits : bw->headerCRC
133 * 24 bits : origPtr (Burrows-wheeler unwind index, only 20 bits ever used)
134 * 16 bits : Mapping table index.
135 *[16 bits]: symToByte[symTotal] (Mapping table. For each bit set in mapping
136 * table index above, read another 16 bits of mapping table data.
137 * If correspondig bit is unset, all bits in that mapping table
139 * 3 bits : groupCount (how many huffman tables used to encode, anywhere
220 // Grab 2 bits instead of 1 (slightly smaller/faster). Stop if
249 * number of bits can have. It lets us know when to stop reading.
251 * To use these, keep reading bits until value <= limit[bitcount] or
252 * you've read over 20 bits (error). Then the decoded symbol
373 the basic or 0/1 method (except all bits 0, which would use no
