libavcodec/twinvq.c:1067: error: Buffer Overrun L2
  Offset: [0, 4] (⇐ [0, 3] + [0, 1]) Size: 4 by call to `construct_perm_table`.

libavcodec/twinvq.c:1066:10: Assignment
1064.     }
1065. 
1066.     for (i=0; i < 4; i++)
               ^
1067.         construct_perm_table(tctx, i);
1068. }

libavcodec/twinvq.c:1067:9: Call
1065. 
1066.     for (i=0; i < 4; i++)
1067.         construct_perm_table(tctx, i);
              ^
1068. }
1069. 

libavcodec/twinvq.c:978:1: Parameter `ftype`
  976. }
  977. 
  978. static av_cold void construct_perm_table(TwinContext *tctx,enum FrameType ftype)
       ^
  979. {
  980.     int block_size;

libavcodec/twinvq.c:995:5: Call
  993.                       tctx->length_change[ftype], ftype);
  994. 
  995.     transpose_perm(tctx->permut[ftype], tmp_perm, tctx->n_div[ftype],
           ^
  996.                    tctx->length[ftype], tctx->length_change[ftype]);
  997. 

libavcodec/twinvq.c:965:32: <Offset trace>
963.     int cont= 0;
964.     for (i=0; i < num_vect; i++)
965.         for (j=0; j < line_len[i >= length_div]; j++)
                                    ^
966.             out[cont++] = in[j*num_vect + i];
967. }

libavcodec/twinvq.c:965:32: Assignment
    963.     int cont= 0;
    964.     for (i=0; i < num_vect; i++)
    965.         for (j=0; j < line_len[i >= length_div]; j++)
                                        ^
    966.             out[cont++] = in[j*num_vect + i];
    967. }

libavcodec/twinvq.c:959:1: <Length trace>
957.  * aiqxbjr1cks2dlt3emu4fvn5gow6hp
958.  */
959. static void transpose_perm(int16_t *out, int16_t *in, int num_vect,
     ^
960.                            const uint8_t line_len[2], int length_div)
961. {

libavcodec/twinvq.c:959:1: Parameter `*line_len`
    957.  * aiqxbjr1cks2dlt3emu4fvn5gow6hp
    958.  */
    959. static void transpose_perm(int16_t *out, int16_t *in, int num_vect,
         ^
    960.                            const uint8_t line_len[2], int length_div)
    961. {

libavcodec/twinvq.c:965:23: Array access: Offset: [0, 4] (⇐ [0, 3] + [0, 1]) Size: 4 by call to `construct_perm_table` 
    963.     int cont= 0;
    964.     for (i=0; i < num_vect; i++)
    965.         for (j=0; j < line_len[i >= length_div]; j++)
                               ^
    966.             out[cont++] = in[j*num_vect + i];
    967. }
