libavcodec/huffyuv.c:260: error: Buffer Overrun L2
  Offset: [2, 256] Size: 256 by call to `heap_sift`.

libavcodec/huffyuv.c:246:1: Array declaration
244. }
245. 
246. static void generate_len_table(uint8_t *dst, const uint64_t *stats)
     ^
247. {
248.     HeapElem h[256];

libavcodec/huffyuv.c:260:13: Call
258.         }
259.         for (i = size / 2 - 1; i >= 0; i--)
260.             heap_sift(h, i, size);
                 ^
261. 
262.         for (next = size; next < size * 2 - 1; next++) {

libavcodec/huffyuv.c:232:1: <Offset trace>
230. } HeapElem;
231. 
232. static void heap_sift(HeapElem *h, int root, int size)
     ^
233. {
234.     while (root * 2 + 1 < size) {

libavcodec/huffyuv.c:232:1: Parameter `size`
  230. } HeapElem;
  231. 
  232. static void heap_sift(HeapElem *h, int root, int size)
       ^
  233. {
  234.     while (root * 2 + 1 < size) {

libavcodec/huffyuv.c:232:1: <Length trace>
230. } HeapElem;
231. 
232. static void heap_sift(HeapElem *h, int root, int size)
     ^
233. {
234.     while (root * 2 + 1 < size) {

libavcodec/huffyuv.c:232:1: Parameter `*h`
  230. } HeapElem;
  231. 
  232. static void heap_sift(HeapElem *h, int root, int size)
       ^
  233. {
  234.     while (root * 2 + 1 < size) {

libavcodec/huffyuv.c:236:48: Array access: Offset: [2, 256] Size: 256 by call to `heap_sift` 
  234.     while (root * 2 + 1 < size) {
  235.         int child = root * 2 + 1;
  236.         if (child < size - 1 && h[child].val > h[child + 1].val)
                                                      ^
  237.             child++;
  238.         if (h[root].val > h[child].val) {
