Lines Matching defs:bit_left
52 int bit_left;
73 s->bit_left = BUF_BITS;
82 return (s->buf_ptr - s->buf) * 8 + BUF_BITS - s->bit_left;
91 av_assert2(s->bit_left == BUF_BITS);
102 return s->buf_ptr - s->buf + ((BUF_BITS - s->bit_left + (round_up ? 7 : 0)) >> 3);
127 return (s->buf_end - s->buf_ptr) * 8 - BUF_BITS + s->bit_left;
137 return s->buf_end - s->buf_ptr - ((BUF_BITS - s->bit_left + (round_up ? 7 : 0)) >> 3);
146 if (s->bit_left < BUF_BITS)
147 s->bit_buf <<= s->bit_left;
149 while (s->bit_left < BUF_BITS) {
158 s->bit_left += 8;
160 s->bit_left = BUF_BITS;
166 while (s->bit_left < BUF_BITS) {
170 s->bit_left += 8;
172 s->bit_left = BUF_BITS;
200 int bit_left;
203 bit_left = s->bit_left;
207 bit_buf |= value << (BUF_BITS - bit_left);
208 if (n >= bit_left) {
216 bit_buf = value >> bit_left;
217 bit_left += BUF_BITS;
219 bit_left -= n;
221 if (n < bit_left) {
223 bit_left -= n;
225 bit_buf <<= bit_left;
226 bit_buf |= value >> (n - bit_left);
234 bit_left += BUF_BITS - n;
240 s->bit_left = bit_left;
256 int bit_left;
261 bit_left = s->bit_left;
263 bit_buf |= value << (BUF_BITS - bit_left);
264 if (n >= bit_left) {
272 bit_buf = value >> bit_left;
273 bit_left += BUF_BITS;
275 bit_left -= n;
278 s->bit_left = bit_left;
294 int bit_left;
302 bit_left = s->bit_left;
305 bit_buf |= (BitBuf)value << (BUF_BITS - bit_left);
313 bit_buf = (uint64_t)value >> bit_left;
315 bit_buf = (uint64_t)bit_buf << bit_left;
316 bit_buf |= (BitBuf)value >> (BUF_BITS - bit_left);
328 s->bit_left = bit_left;
382 av_assert2(s->bit_left == BUF_BITS);
394 unsigned bits = BUF_BITS - s->bit_left + n;
396 s->bit_left = BUF_BITS - (bits & (BUF_BITS - 1));
415 put_bits(s, s->bit_left & 7, 0);