Lines Matching refs:BITS
35 // ahead (actually, we cache BITS of them ahead. See below). There's two
41 // Example, for BITS=16: here is the content of value_ for both strategies:
45 // <- 8b -><- 8b -><- BITS bits -> || <- 8b+3b -><- 8b -><- 13 bits ->
58 // -> we're back to height active 'value_' bits (marked 'v') and BITS cached
64 // BITS can be any multiple of 8 from 8 to 56 (inclusive).
72 #define BITS 16
74 #define BITS 56
76 #define BITS 24
78 #define BITS 24
84 #define BITS 8
94 #if (BITS > 32)
97 #elif (BITS == 32)
100 #elif (BITS == 24)
103 #elif (BITS == 16)
113 #define MASK ((((bit_t)1) << (BITS)) - 1)
154 // Read 'BITS' bits at a time if possible.
159 br->buf_ += (BITS) >> 3;
161 #if (BITS > 32)
179 bits >>= 64 - BITS;
180 #elif (BITS >= 24)
190 bits >>= (32 - BITS);
191 #elif (BITS == 16)
194 #else // BITS == 8
199 if (BITS != 8 * sizeof(bit_t)) bits >>= (8 * sizeof(bit_t) - BITS);
204 br->value_ = bits | (br->value_ << (BITS));
206 br->bits_ += (BITS);
213 if (br->bits_ < 0) { // Make sure we have a least BITS bits in 'value_'
245 const bit_t idx = br->range_ >> (BITS);
262 (range_t)((uint32_t)(br->range_ >> (BITS)) * prob) << ((BITS) - 8);
264 if (br->range_ <= (((range_t)0x7e << (BITS)) | (MASK))) {