Lines Matching defs:bit_left
42 bit_left
63 stream->bit_left = WORD_SIZE;
89 num_bits = WORD_SIZE - stream->bit_left; /* must be multiple of 8 !!*/
126 /* reset current_word and bit_left */
128 stream->bit_left = WORD_SIZE;
145 int bit_left = stream->bit_left;
156 if (nBits <= bit_left) /* more bits left in current_word */
159 stream->bit_left -= nBits;
160 if (stream->bit_left == 0) /* prepare for the next word */
168 stream->current_word = (current_word << bit_left) | (code >> (nBits - bit_left));
170 nBits -= bit_left;
172 stream->bit_left = 0;
176 stream->bit_left = WORD_SIZE - nBits;
201 //if(1 <= bit_left) /* more bits left in current_word */
202 /* we can assume that there always be positive bit_left in the current word */
204 stream->bit_left--;
205 if (stream->bit_left == 0) /* prepare for the next word */
229 int bit_left = bitstream->bit_left;
231 bit_left &= 0x7; /* modulo by 8 */
232 if (bit_left == 0) bit_left = 8;
233 /* bitstream->bit_left == 0 cannot happen here since it would have been Saved already */
235 status = BitstreamWriteBits(bitstream, bit_left, trailing_bits[bit_left]);
243 //if(bitstream->bit_left<(WORD_SIZE<<3)) /* in fact, no need to check */
254 if (stream->bit_left % 8)
