libavcodec/adpcm.c:407: error: Buffer Overrun L2
  Offset: [0, 2] Size: 2.

libavcodec/adpcm.c:288:28: <Length trace>
286.     TrellisPath paths[max_paths], *p;
287.     TrellisNode node_buf[2][frontier];
288.     TrellisNode *nodep_buf[2][frontier];
                                ^
289.     TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
290.     TrellisNode **nodes_next = nodep_buf[1];

libavcodec/adpcm.c:288:28: Array declaration
286.     TrellisPath paths[max_paths], *p;
287.     TrellisNode node_buf[2][frontier];
288.     TrellisNode *nodep_buf[2][frontier];
                                ^
289.     TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
290.     TrellisNode **nodes_next = nodep_buf[1];

libavcodec/adpcm.c:290:5: Assignment
288.     TrellisNode *nodep_buf[2][frontier];
289.     TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
290.     TrellisNode **nodes_next = nodep_buf[1];
         ^
291.     int pathn = 0, froze = -1, i, j, k;
292. 

libavcodec/adpcm.c:395:9: Assignment
393. 
394.         u = nodes;
395.         nodes = nodes_next;
             ^
396.         nodes_next = u;
397. 

libavcodec/adpcm.c:407:24: Array access: Offset: [0, 2] Size: 2
405.         // merge old paths to save memory
406.         if(i == froze + FREEZE_INTERVAL) {
407.             p = &paths[nodes[0]->path];
                            ^
408.             for(k=i; k>froze; k--) {
409.                 dst[k] = p->nibble;
