libavcodec/opus_silk.c:813: error: Uninitialized Value
  The value read from k was never initialized.

libavcodec/opus_silk.c:813:20: 
811.             /* repel away from lower bound */
812.             nlsf[0] = min_delta[0];
813.         } else if (k == order) {
                        ^
814.             /* repel away from higher bound */
815.             nlsf[order-1] = 32768 - min_delta[order];

static inline void silk_stabilize_lsf(int16_t nlsf[16], int order, const uint16_t min_delta[17])
{
    int pass, i;
    for (pass = 0; pass < 20; pass++) {
        int k, min_diff = 0;
        for (i = 0; i < order+1; i++) {
            int low  = i != 0     ? nlsf[i-1] : 0;
            int high = i != order ? nlsf[i]   : 32768;
            int diff = (high - low) - (min_delta[i]);
            if (diff < min_diff) {
                min_diff = diff;
                k = i;
                if (pass == 20)
                    break;
            }
        }
        if (min_diff == 0)
            return;
        if (k == 0) {
            nlsf[0] = min_delta[0];
        } else if (k == order) {
            nlsf[order-1] = 32768 - min_delta[order];
        } else {
            int min_center = 0, max_center = 32768, center_val;
            for (i = 0; i < k; i++)
                min_center += min_delta[i];
            min_center += min_delta[k] >> 1;
            for (i = order; i > k; i--)
                max_center -= min_delta[k];
            max_center -= min_delta[k] >> 1;
            center_val = nlsf[k - 1] + nlsf[k];
            center_val = (center_val >> 1) + (center_val & 1);
            center_val = FFMIN(max_center, FFMAX(min_center, center_val));
            nlsf[k - 1] = center_val - (min_delta[k] >> 1);
            nlsf[k]     = nlsf[k - 1] + min_delta[k];
        }
    }
    for (i = 1; i < order; i++) {
        int j, value = nlsf[i];
        for (j = i - 1; j >= 0 && nlsf[j] > value; j--)
            nlsf[j + 1] = nlsf[j];
        nlsf[j + 1] = value;
    }
    if (nlsf[0] < min_delta[0])
        nlsf[0] = min_delta[0];
    for (i = 1; i < order; i++)
        if (nlsf[i] < nlsf[i - 1] + min_delta[i])
            nlsf[i] = nlsf[i - 1] + min_delta[i];
    if (nlsf[order-1] > 32768 - min_delta[order])
        nlsf[order-1] = 32768 - min_delta[order];
    for (i = order-2; i >= 0; i--)
        if (nlsf[i] > nlsf[i + 1] - min_delta[i+1])
            nlsf[i] = nlsf[i + 1] - min_delta[i+1];
    return;
}
['static inline void silk_stabilize_lsf(int16_t nlsf[16], int order, const uint16_t min_delta[17])\n{\n    int pass, i;\n    for (pass = 0; pass < 20; pass++) {\n        int k, min_diff = 0;\n        for (i = 0; i < order+1; i++) {\n            int low  = i != 0     ? nlsf[i-1] : 0;\n            int high = i != order ? nlsf[i]   : 32768;\n            int diff = (high - low) - (min_delta[i]);\n            if (diff < min_diff) {\n                min_diff = diff;\n                k = i;\n                if (pass == 20)\n                    break;\n            }\n        }\n        if (min_diff == 0)\n            return;\n        if (k == 0) {\n            nlsf[0] = min_delta[0];\n        } else if (k == order) {\n            nlsf[order-1] = 32768 - min_delta[order];\n        } else {\n            int min_center = 0, max_center = 32768, center_val;\n            for (i = 0; i < k; i++)\n                min_center += min_delta[i];\n            min_center += min_delta[k] >> 1;\n            for (i = order; i > k; i--)\n                max_center -= min_delta[k];\n            max_center -= min_delta[k] >> 1;\n            center_val = nlsf[k - 1] + nlsf[k];\n            center_val = (center_val >> 1) + (center_val & 1);\n            center_val = FFMIN(max_center, FFMAX(min_center, center_val));\n            nlsf[k - 1] = center_val - (min_delta[k] >> 1);\n            nlsf[k]     = nlsf[k - 1] + min_delta[k];\n        }\n    }\n    for (i = 1; i < order; i++) {\n        int j, value = nlsf[i];\n        for (j = i - 1; j >= 0 && nlsf[j] > value; j--)\n            nlsf[j + 1] = nlsf[j];\n        nlsf[j + 1] = value;\n    }\n    if (nlsf[0] < min_delta[0])\n        nlsf[0] = min_delta[0];\n    for (i = 1; i < order; i++)\n        if (nlsf[i] < nlsf[i - 1] + min_delta[i])\n            nlsf[i] = nlsf[i - 1] + min_delta[i];\n    if (nlsf[order-1] > 32768 - min_delta[order])\n        nlsf[order-1] = 32768 - min_delta[order];\n    for (i = order-2; i >= 0; i--)\n        if (nlsf[i] > nlsf[i + 1] - min_delta[i+1])\n            nlsf[i] = nlsf[i + 1] - min_delta[i+1];\n    return;\n}']