libavcodec/idcinvideo.c:166: error: Buffer Overrun L1
  Offset: [256, +oo] (⇐ [0, 255] + [256, +oo]) Size: 256 by call to `huff_build_tree`.

libavcodec/idcinvideo.c:163:10: Assignment
161.     /* build the 256 Huffman decode trees */
162.     histograms = (unsigned char *)s->avctx->extradata;
163.     for (i = 0; i < 256; i++) {
              ^
164.         for(j = 0; j < HUF_TOKENS; j++)
165.             s->huff_nodes[i][j].count = histograms[histogram_index++];

libavcodec/idcinvideo.c:166:9: Call
164.         for(j = 0; j < HUF_TOKENS; j++)
165.             s->huff_nodes[i][j].count = histograms[histogram_index++];
166.         huff_build_tree(s, i);
             ^
167.     }
168. 

libavcodec/idcinvideo.c:120:5: <Offset trace>
118.      int num_hnodes, i;
119. 
120.     num_hnodes = HUF_TOKENS;
         ^
121.     hnodes = s->huff_nodes[prev];
122.     for(i = 0; i < HUF_TOKENS * 2; i++)

libavcodec/idcinvideo.c:120:5: Assignment
  118.      int num_hnodes, i;
  119. 
  120.     num_hnodes = HUF_TOKENS;
           ^
  121.     hnodes = s->huff_nodes[prev];
  122.     for(i = 0; i < HUF_TOKENS * 2; i++)

libavcodec/idcinvideo.c:116:1: <Length trace>
114.  *    That is: huff_nodes[prev][num_huff_nodes[prev]] is the root node.
115.  */
116. static av_cold void huff_build_tree(IdcinContext *s, int prev) {
     ^
117.     hnode_t *node, *hnodes;
118.      int num_hnodes, i;

libavcodec/idcinvideo.c:116:1: Parameter `prev`
  114.  *    That is: huff_nodes[prev][num_huff_nodes[prev]] is the root node.
  115.  */
  116. static av_cold void huff_build_tree(IdcinContext *s, int prev) {
       ^
  117.     hnode_t *node, *hnodes;
  118.      int num_hnodes, i;

libavcodec/idcinvideo.c:121:5: Assignment
  119. 
  120.     num_hnodes = HUF_TOKENS;
  121.     hnodes = s->huff_nodes[prev];
           ^
  122.     for(i = 0; i < HUF_TOKENS * 2; i++)
  123.         hnodes[i].used = 0;

libavcodec/idcinvideo.c:126:9: Array access: Offset: [256, +oo] (⇐ [0, 255] + [256, +oo]) Size: 256 by call to `huff_build_tree` 
  124. 
  125.     while (1) {
  126.         node = &hnodes[num_hnodes];             /* next free node */
               ^
  127. 
  128.         /* pick two lowest counts */
