Lines Matching refs:bitLeft

71     stream->bitLeft = 32;
73 stream->bitLeft = 16;
124 if (stream->bitLeft > Length)
128 stream->bitLeft -= Length;
134 stream->word <<= stream->bitLeft;
135 Length -= stream->bitLeft;
147 stream->bitLeft -= Length;
149 /* stream->bitLeft should be greater than zero at this point */
150 //if(stream->bitLeft<=0)
212 /* assume that stream->bitLeft is always zero when this function is called */
237 stream->bitLeft = 32;
240 stream->bitLeft = 16;
263 bitleft = stream->bitLeft;
291 stream->bitLeft = bitleft;
309 /* note we don't update byteCount, bitLeft and word */
331 restBits = (stream->bitLeft & 0x7); /* modulo 8 */
339 if (stream->bitLeft != (WORD_SIZE << 3))
367 restBits = (stream->bitLeft & 0x7); /* modulo 8 */
375 if (stream->bitLeft != (WORD_SIZE << 3))
458 bitused = (WORD_SIZE << 3) - bitstream1->bitLeft; /* this must be between 1-7 */
475 bitstream1->word = byteBS1 >> bitleft; /* bitstream->bitLeft remains the same */
478 status = BitstreamPutBits(bitstream1, (WORD_SIZE << 3) - bitstream2->bitLeft, bitstream2->word);
516 bitstream1->word = bitstream2->word; /* bitstream1->bitLeft is the same */
517 bitstream1->bitLeft = bitstream2->bitLeft;
555 bitstream1->bitLeft = (WORD_SIZE << 3);
564 /* bitstream2->word and bitstream->bitLeft are unchanged.
593 bitstream->bitLeft = (WORD_SIZE << 3) - bitCount; /* bitCount should be 0-31 */
603 bitstream->word = word >> (bitstream->bitLeft);
608 bitstream->bitLeft = (WORD_SIZE << 3);
636 bitused = (WORD_SIZE << 3) - bitstream1->bitLeft;
641 bitstream1->bitLeft = (WORD_SIZE << 3) - new_bit;
713 bitused = (WORD_SIZE << 3) - bitstream2->bitLeft;
728 bitused = (WORD_SIZE << 4) - (bitstream1->bitLeft + bitstream2->bitLeft);
736 bitstream1->bitLeft = (WORD_SIZE << 3) - bitused;
739 bitstream2->bitLeft = (WORD_SIZE << 3);
763 return stream->byteCount*8 + (WORD_SIZE << 3) - stream->bitLeft;
768 stream->bitLeft = (WORD_SIZE << 3);