libavcodec/eatgq.c:95: error: Integer Overflow L2
  ([0, +oo] - 6):unsigned32 by call to `bitstream_skip`.

libavcodec/eatgq.c:93:13: Call
91.         case 7: // 111b
92.         case 3: // 011b
93.             bitstream_skip(bc, 2);
                ^
94.             if (bitstream_peek(bc, 6) == 0x3F) {
95.                 bitstream_skip(bc, 6);

libavcodec/bitstream.h:247:9: Assignment
  245.         n -= bc->bits_left;
  246.         bc->bits      = 0;
  247.         bc->bits_left = 0;
               ^
  248. 
  249.         if (n >= 64) {

libavcodec/bitstream.h:255:9: Call
  253.             bc->ptr += skip;
  254.         }
  255.         refill_64(bc);
               ^
  256.         if (n)
  257.             skip_remaining(bc, n);

libavcodec/bitstream.h:45:1: Parameter `bc->bits_left`
    43. } BitstreamContext;
    44. 
    45. static inline void refill_64(BitstreamContext *bc)
        ^
    46. {
    47.     if (bc->ptr >= bc->buffer_end)

libavcodec/eatgq.c:94:17: Call
92.         case 3: // 011b
93.             bitstream_skip(bc, 2);
94.             if (bitstream_peek(bc, 6) == 0x3F) {
                    ^
95.                 bitstream_skip(bc, 6);
96.                 block[perm[i]] = bitstream_read_signed(bc, 8) * s->qtable[perm[i]];

libavcodec/bitstream.h:214:1: Parameter `n`
  212. /* Return n bits from the buffer, but do not change the buffer state.
  213.  * n has to be in the 0-32 range. */
  214. static inline unsigned bitstream_peek(BitstreamContext *bc, unsigned n)
       ^
  215. {
  216.     if (n > bc->bits_left)

libavcodec/eatgq.c:95:17: Call
93.             bitstream_skip(bc, 2);
94.             if (bitstream_peek(bc, 6) == 0x3F) {
95.                 bitstream_skip(bc, 6);
                    ^
96.                 block[perm[i]] = bitstream_read_signed(bc, 8) * s->qtable[perm[i]];
97.             } else {

libavcodec/bitstream.h:240:1: Parameter `n`
  238. 
  239. /* Skip n bits in the buffer. */
  240. static inline void bitstream_skip(BitstreamContext *bc, unsigned n)
       ^
  241. {
  242.     if (n < bc->bits_left)

libavcodec/bitstream.h:243:9: Call
  241. {
  242.     if (n < bc->bits_left)
  243.         skip_remaining(bc, n);
               ^
  244.     else {
  245.         n -= bc->bits_left;

libavcodec/bitstream.h:229:1: <LHS trace>
227. }
228. 
229. static inline void skip_remaining(BitstreamContext *bc, unsigned n)
     ^
230. {
231. #ifdef BITSTREAM_READER_LE

libavcodec/bitstream.h:229:1: Parameter `bc->bits_left`
    227. }
    228. 
    229. static inline void skip_remaining(BitstreamContext *bc, unsigned n)
         ^
    230. {
    231. #ifdef BITSTREAM_READER_LE

libavcodec/bitstream.h:229:1: <RHS trace>
227. }
228. 
229. static inline void skip_remaining(BitstreamContext *bc, unsigned n)
     ^
230. {
231. #ifdef BITSTREAM_READER_LE

libavcodec/bitstream.h:229:1: Parameter `n`
    227. }
    228. 
    229. static inline void skip_remaining(BitstreamContext *bc, unsigned n)
         ^
    230. {
    231. #ifdef BITSTREAM_READER_LE

libavcodec/bitstream.h:236:5: Binary operation: ([0, +oo] - 6):unsigned32 by call to `bitstream_skip` 
    234.     bc->bits <<= n;
    235. #endif
    236.     bc->bits_left -= n;
             ^
    237. }
    238. 

static inline void skip_remaining(BitstreamContext *bc, unsigned n)
{
#ifdef BITSTREAM_READER_LE
    bc->bits >>= n;
#else
    bc->bits <<= n;
#endif
    bc->bits_left -= n;
}
['static void tgq_decode_block(TgqContext *s, int16_t block[64], BitstreamContext *bc)\n{\n    uint8_t *perm = s->scantable.permutated;\n    int i, j, value;\n    block[0] = bitstream_read_signed(bc, 8) * s->qtable[0];\n    for (i = 1; i < 64;) {\n        switch (bitstream_peek(bc, 3)) {\n        case 4:\n            block[perm[i++]] = 0;\n        case 0:\n            block[perm[i++]] = 0;\n            bitstream_skip(bc, 3);\n            break;\n        case 5:\n        case 1:\n            bitstream_skip(bc, 2);\n            value = bitstream_read(bc, 6);\n            for (j = 0; j < value; j++)\n                block[perm[i++]] = 0;\n            break;\n        case 6:\n            bitstream_skip(bc, 3);\n            block[perm[i]] = -s->qtable[perm[i]];\n            i++;\n            break;\n        case 2:\n            bitstream_skip(bc, 3);\n            block[perm[i]] = s->qtable[perm[i]];\n            i++;\n            break;\n        case 7:\n        case 3:\n            bitstream_skip(bc, 2);\n            if (bitstream_peek(bc, 6) == 0x3F) {\n                bitstream_skip(bc, 6);\n                block[perm[i]] = bitstream_read_signed(bc, 8) * s->qtable[perm[i]];\n            } else {\n                block[perm[i]] = bitstream_read_signed(bc, 6) * s->qtable[perm[i]];\n            }\n            i++;\n            break;\n        }\n    }\n    block[0] += 128 << 4;\n}', 'static inline void bitstream_skip(BitstreamContext *bc, unsigned n)\n{\n    if (n < bc->bits_left)\n        skip_remaining(bc, n);\n    else {\n        n -= bc->bits_left;\n        bc->bits      = 0;\n        bc->bits_left = 0;\n        if (n >= 64) {\n            unsigned skip = n / 8;\n            n -= skip * 8;\n            bc->ptr += skip;\n        }\n        refill_64(bc);\n        if (n)\n            skip_remaining(bc, n);\n    }\n}', 'static inline void refill_64(BitstreamContext *bc)\n{\n    if (bc->ptr >= bc->buffer_end)\n        return;\n#ifdef BITSTREAM_READER_LE\n    bc->bits       = AV_RL64(bc->ptr);\n#else\n    bc->bits       = AV_RB64(bc->ptr);\n#endif\n    bc->ptr       += 8;\n    bc->bits_left  = 64;\n}', 'static inline unsigned bitstream_peek(BitstreamContext *bc, unsigned n)\n{\n    if (n > bc->bits_left)\n        refill_32(bc);\n    return show_val(bc, n);\n}', 'static inline void skip_remaining(BitstreamContext *bc, unsigned n)\n{\n#ifdef BITSTREAM_READER_LE\n    bc->bits >>= n;\n#else\n    bc->bits <<= n;\n#endif\n    bc->bits_left -= n;\n}']