Lines Matching defs:bits
95 char selectors[32768]; // nSelectors=15 bits
108 // Return the next nnn bits of input. All reads from the compressed input
112 unsigned int bits = 0;
127 bits = bd->inbufBits&((1<<bd->inbufBitCount)-1);
129 bits <<= bits_wanted;
133 // Grab next 8 bits of input from buffer.
140 bits |= (bd->inbufBits>>bd->inbufBitCount) & ((1<<bits_wanted)-1);
142 return bits;
147 * 48 bits : Block signature, either pi (data block) or e (EOF block).
148 * 32 bits : bw->headerCRC
150 * 24 bits : origPtr (Burrows-wheeler unwind index, only 20 bits ever used)
151 * 16 bits : Mapping table index.
152 *[16 bits]: symToByte[symTotal] (Mapping table. For each bit set in mapping
153 * table index above, read another 16 bits of mapping table data.
154 * If correspondig bit is unset, all bits in that mapping table
156 * 3 bits : groupCount (how many huffman tables used to encode, anywhere
237 // Grab 2 bits instead of 1 (slightly smaller/faster). Stop if
266 * number of bits can have. It lets us know when to stop reading.
268 * To use these, keep reading bits until value <= limit[bitcount] or
269 * you've read over 20 bits (error). Then the decoded symbol
390 the basic or 0/1 method (except all bits 0, which would use no