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

libavcodec/dnxhdenc.c:951:1: Array declaration
949. }
950. 
951. static void radix_sort(RCCMPEntry *data, int size)
     ^
952. {
953.     int buckets[RADIX_PASSES][NBUCKETS];

libavcodec/dnxhdenc.c:959:9: Call
957.     radix_sort_pass(data, tmp, size, buckets[1], 1);
958.     if (buckets[2][NBUCKETS - 1] || buckets[3][NBUCKETS - 1]) {
959.         radix_sort_pass(tmp, data, size, buckets[2], 2);
             ^
960.         radix_sort_pass(data, tmp, size, buckets[3], 3);
961.     }

libavcodec/dnxhdenc.c:945:19: <Offset trace>
943.     int i;
944.     for (i = 0; i < size; i++) {
945.         int v   = get_bucket(data[i].value, shift);
                       ^
946.         int pos = buckets[v]++;
947.         dst[pos] = data[i];

libavcodec/dnxhdenc.c:945:19: Call
  943.     int i;
  944.     for (i = 0; i < size; i++) {
  945.         int v   = get_bucket(data[i].value, shift);
                         ^
  946.         int pos = buckets[v]++;
  947.         dst[pos] = data[i];

libavcodec/dnxhdenc.c:911:1: Parameter `shift`
    909. #define NBUCKETS (1 << BUCKET_BITS)
    910. 
    911. static inline int get_bucket(int value, int shift)
         ^
    912. {
    913.     value >>= shift;

libavcodec/dnxhdenc.c:913:5: Assignment
    911. static inline int get_bucket(int value, int shift)
    912. {
    913.     value >>= shift;
             ^
    914.     value  &= NBUCKETS - 1;
    915.     return NBUCKETS - 1 - value;

libavcodec/dnxhdenc.c:914:5: Assignment
    912. {
    913.     value >>= shift;
    914.     value  &= NBUCKETS - 1;
             ^
    915.     return NBUCKETS - 1 - value;
    916. }

libavcodec/dnxhdenc.c:915:5: Assignment
    913.     value >>= shift;
    914.     value  &= NBUCKETS - 1;
    915.     return NBUCKETS - 1 - value;
             ^
    916. }
    917. 

libavcodec/dnxhdenc.c:945:9: Assignment
  943.     int i;
  944.     for (i = 0; i < size; i++) {
  945.         int v   = get_bucket(data[i].value, shift);
               ^
  946.         int pos = buckets[v]++;
  947.         dst[pos] = data[i];

libavcodec/dnxhdenc.c:939:1: <Length trace>
937. }
938. 
939. static void radix_sort_pass(RCCMPEntry *dst, const RCCMPEntry *data,
     ^
940.                             int size, int buckets[NBUCKETS], int pass)
941. {

libavcodec/dnxhdenc.c:939:1: Parameter `*buckets`
  937. }
  938. 
  939. static void radix_sort_pass(RCCMPEntry *dst, const RCCMPEntry *data,
       ^
  940.                             int size, int buckets[NBUCKETS], int pass)
  941. {

libavcodec/dnxhdenc.c:946:19: Array access: Offset: [2, 257] (⇐ 2 + [0, 255]) Size: 4 by call to `radix_sort_pass` 
  944.     for (i = 0; i < size; i++) {
  945.         int v   = get_bucket(data[i].value, shift);
  946.         int pos = buckets[v]++;
                         ^
  947.         dst[pos] = data[i];
  948.     }

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,\n                            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}']