libavcodec/mlpdec.c:245: error: Integer Overflow L2
  ([0, max(64, `bc->bits_left`)] - 1):unsigned32 by call to `bitstream_read_bit`.

libavcodec/mlpdec.c:237:1: Parameter `bc->bits_left`
235.  *  and plain LSBs. */
236. 
237. static inline int read_huff_channels(MLPDecodeContext *m, BitstreamContext *bc,
     ^
238.                                      unsigned int substr, unsigned int pos)
239. {

libavcodec/mlpdec.c:245:56: Call
243.     for (mat = 0; mat < s->num_primitive_matrices; mat++)
244.         if (s->lsb_bypass[mat])
245.             m->bypassed_lsbs[pos + s->blockpos][mat] = bitstream_read_bit(bc);
                                                            ^
246. 
247.     for (channel = s->min_channel; channel <= s->max_channel; channel++) {

libavcodec/bitstream.h:145:1: Parameter `bc->bits_left`
  143. 
  144. /* Return one bit from the buffer. */
  145. static inline unsigned bitstream_read_bit(BitstreamContext *bc)
       ^
  146. {
  147.     if (!bc->bits_left)

libavcodec/bitstream.h:150:12: Call
  148.         refill_64(bc);
  149. 
  150.     return get_val(bc, 1);
                  ^
  151. }
  152. 

libavcodec/bitstream.h:130:1: <LHS trace>
128. }
129. 
130. static inline uint64_t get_val(BitstreamContext *bc, unsigned n)
     ^
131. {
132. #ifdef BITSTREAM_READER_LE

libavcodec/bitstream.h:130:1: Parameter `bc->bits_left`
    128. }
    129. 
    130. static inline uint64_t get_val(BitstreamContext *bc, unsigned n)
         ^
    131. {
    132. #ifdef BITSTREAM_READER_LE

libavcodec/bitstream.h:130:1: <RHS trace>
128. }
129. 
130. static inline uint64_t get_val(BitstreamContext *bc, unsigned n)
     ^
131. {
132. #ifdef BITSTREAM_READER_LE

libavcodec/bitstream.h:130:1: Parameter `n`
    128. }
    129. 
    130. static inline uint64_t get_val(BitstreamContext *bc, unsigned n)
         ^
    131. {
    132. #ifdef BITSTREAM_READER_LE

libavcodec/bitstream.h:139:5: Binary operation: ([0, max(64, bc->bits_left)] - 1):unsigned32 by call to `bitstream_read_bit` 
    137.     bc->bits <<= n;
    138. #endif
    139.     bc->bits_left -= n;
             ^
    140. 
    141.     return ret;

static inline uint64_t get_val(BitstreamContext *bc, unsigned n)
{
#ifdef BITSTREAM_READER_LE
    uint64_t ret = bc->bits & ((UINT64_C(1) << n) - 1);
    bc->bits >>= n;
#else
    uint64_t ret = bc->bits >> (64 - n);
    bc->bits <<= n;
#endif
    bc->bits_left -= n;
    return ret;
}
['static inline int read_huff_channels(MLPDecodeContext *m, BitstreamContext *bc,\n                                     unsigned int substr, unsigned int pos)\n{\n    SubStream *s = &m->substream[substr];\n    unsigned int mat, channel;\n    for (mat = 0; mat < s->num_primitive_matrices; mat++)\n        if (s->lsb_bypass[mat])\n            m->bypassed_lsbs[pos + s->blockpos][mat] = bitstream_read_bit(bc);\n    for (channel = s->min_channel; channel <= s->max_channel; channel++) {\n        ChannelParams *cp = &s->channel_params[channel];\n        int codebook = cp->codebook;\n        int quant_step_size = s->quant_step_size[channel];\n        int lsb_bits = cp->huff_lsbs - quant_step_size;\n        int result = 0;\n        if (codebook > 0)\n            result = bitstream_read_vlc(bc, huff_vlc[codebook-1].table,\n                                        VLC_BITS,\n                                        (9 + VLC_BITS - 1) / VLC_BITS);\n        if (result < 0)\n            return AVERROR_INVALIDDATA;\n        if (lsb_bits > 0)\n            result = (result << lsb_bits) + bitstream_read(bc, lsb_bits);\n        result  += cp->sign_huff_offset;\n        result <<= quant_step_size;\n        m->sample_buffer[pos + s->blockpos][channel] = result;\n    }\n    return 0;\n}', 'static inline unsigned bitstream_read_bit(BitstreamContext *bc)\n{\n    if (!bc->bits_left)\n        refill_64(bc);\n    return get_val(bc, 1);\n}', 'static inline uint64_t get_val(BitstreamContext *bc, unsigned n)\n{\n#ifdef BITSTREAM_READER_LE\n    uint64_t ret = bc->bits & ((UINT64_C(1) << n) - 1);\n    bc->bits >>= n;\n#else\n    uint64_t ret = bc->bits >> (64 - n);\n    bc->bits <<= n;\n#endif\n    bc->bits_left -= n;\n    return ret;\n}']