Lines Matching refs:bit_left
42 bit_left
63 stream->bit_left = WORD_SIZE;
89 num_bits = WORD_SIZE - stream->bit_left; /* must be multiple of 8 !!*/
129 /* reset current_word and bit_left */
131 stream->bit_left = WORD_SIZE;
148 int bit_left = stream->bit_left;
159 if (nBits <= bit_left) /* more bits left in current_word */
162 stream->bit_left -= nBits;
163 if (stream->bit_left == 0) /* prepare for the next word */
171 stream->current_word = (current_word << bit_left) | (code >> (nBits - bit_left));
173 nBits -= bit_left;
175 stream->bit_left = 0;
179 stream->bit_left = WORD_SIZE - nBits;
204 //if(1 <= bit_left) /* more bits left in current_word */
205 /* we can assume that there always be positive bit_left in the current word */
207 stream->bit_left--;
208 if (stream->bit_left == 0) /* prepare for the next word */
232 int bit_left = bitstream->bit_left;
234 bit_left &= 0x7; /* modulo by 8 */
235 if (bit_left == 0) bit_left = 8;
236 /* bitstream->bit_left == 0 cannot happen here since it would have been Saved already */
238 status = BitstreamWriteBits(bitstream, bit_left, trailing_bits[bit_left]);
246 //if(bitstream->bit_left<(WORD_SIZE<<3)) /* in fact, no need to check */
257 if (stream->bit_left % 8)
