libavcodec/dnxhdenc.c:705: error: Buffer Overrun L2
  Offset: [3, 258] (⇐ 3 + [0, 255]) Size: 4 by call to `radix_sort_pass`.

libavcodec/dnxhdenc.c:696:1: Array declaration
694. }
695. 
696. static void radix_sort(RCCMPEntry *data, int size)
     ^
697. {
698.     int buckets[RADIX_PASSES][NBUCKETS];

libavcodec/dnxhdenc.c:705:9: Call
703.     if (buckets[2][NBUCKETS - 1] || buckets[3][NBUCKETS - 1]) {
704.         radix_sort_pass(tmp, data, size, buckets[2], 2);
705.         radix_sort_pass(data, tmp, size, buckets[3], 3);
             ^
706.     }
707.     av_free(tmp);

libavcodec/dnxhdenc.c:690:17: <Offset trace>
688.     int i;
689.     for (i = 0; i < size; i++) {
690.         int v = get_bucket(data[i].value, shift);
                     ^
691.         int pos = buckets[v]++;
692.         dst[pos] = data[i];

libavcodec/dnxhdenc.c:690:17: Call
  688.     int i;
  689.     for (i = 0; i < size; i++) {
  690.         int v = get_bucket(data[i].value, shift);
                       ^
  691.         int pos = buckets[v]++;
  692.         dst[pos] = data[i];

libavcodec/dnxhdenc.c:658:1: Parameter `shift`
    656. #define NBUCKETS (1 << BUCKET_BITS)
    657. 
    658. static inline int get_bucket(int value, int shift)
         ^
    659. {
    660.     value >>= shift;

libavcodec/dnxhdenc.c:660:5: Assignment
    658. static inline int get_bucket(int value, int shift)
    659. {
    660.     value >>= shift;
             ^
    661.     value &= NBUCKETS - 1;
    662.     return NBUCKETS - 1 - value;

libavcodec/dnxhdenc.c:661:5: Assignment
    659. {
    660.     value >>= shift;
    661.     value &= NBUCKETS - 1;
             ^
    662.     return NBUCKETS - 1 - value;
    663. }

libavcodec/dnxhdenc.c:662:5: Assignment
    660.     value >>= shift;
    661.     value &= NBUCKETS - 1;
    662.     return NBUCKETS - 1 - value;
             ^
    663. }
    664. 

libavcodec/dnxhdenc.c:690:9: Assignment
  688.     int i;
  689.     for (i = 0; i < size; i++) {
  690.         int v = get_bucket(data[i].value, shift);
               ^
  691.         int pos = buckets[v]++;
  692.         dst[pos] = data[i];

libavcodec/dnxhdenc.c:685:1: <Length trace>
683. }
684. 
685. static void radix_sort_pass(RCCMPEntry *dst, const RCCMPEntry *data, int size, int buckets[NBUCKETS], int pass)
     ^
686. {
687.     int shift = pass * BUCKET_BITS;

libavcodec/dnxhdenc.c:685:1: Parameter `*buckets`
  683. }
  684. 
  685. static void radix_sort_pass(RCCMPEntry *dst, const RCCMPEntry *data, int size, int buckets[NBUCKETS], int pass)
       ^
  686. {
  687.     int shift = pass * BUCKET_BITS;

libavcodec/dnxhdenc.c:691:19: Array access: Offset: [3, 258] (⇐ 3 + [0, 255]) Size: 4 by call to `radix_sort_pass` 
  689.     for (i = 0; i < size; i++) {
  690.         int v = get_bucket(data[i].value, shift);
  691.         int pos = buckets[v]++;
                         ^
  692.         dst[pos] = data[i];
  693.     }

static void radix_sort_pass(RCCMPEntry *dst, const RCCMPEntry *data, int size, int buckets[NBUCKETS], int pass)
{
    int shift = pass * BUCKET_BITS;
    int i;
    for (i = 0; i < size; i++) {
        int v = get_bucket(data[i].value, shift);
        int pos = buckets[v]++;
        dst[pos] = data[i];
    }
}
['static void radix_sort(RCCMPEntry *data, int size)\n{\n    int buckets[RADIX_PASSES][NBUCKETS];\n    RCCMPEntry *tmp = av_malloc(sizeof(*tmp) * size);\n    radix_count(data, size, buckets);\n    radix_sort_pass(tmp, data, size, buckets[0], 0);\n    radix_sort_pass(data, tmp, size, buckets[1], 1);\n    if (buckets[2][NBUCKETS - 1] || buckets[3][NBUCKETS - 1]) {\n        radix_sort_pass(tmp, data, size, buckets[2], 2);\n        radix_sort_pass(data, tmp, size, buckets[3], 3);\n    }\n    av_free(tmp);\n}', 'static void radix_sort_pass(RCCMPEntry *dst, const RCCMPEntry *data, int size, int buckets[NBUCKETS], int pass)\n{\n    int shift = pass * BUCKET_BITS;\n    int i;\n    for (i = 0; i < size; i++) {\n        int v = get_bucket(data[i].value, shift);\n        int pos = buckets[v]++;\n        dst[pos] = data[i];\n    }\n}', 'static inline int get_bucket(int value, int shift)\n{\n    value >>= shift;\n    value &= NBUCKETS - 1;\n    return NBUCKETS - 1 - value;\n}']