libavcodec/golomb.h:332: error: Uninitialized Value
  The value read from re_size_plus8 was never initialized.

libavcodec/golomb.h:332:13: 
330.         int i;
331.         for (i = 0; i < limit && SHOW_UBITS(re, gb, 1) == 0 && BITS_AVAILABLE(re, gb); i++) {
332.             LAST_SKIP_BITS(re, gb, 1);
                 ^
333.             UPDATE_CACHE(re, gb);
334.         }

static inline int get_ur_golomb_jpegls(GetBitContext *gb, int k, int limit,
                                       int esc_len)
{
    unsigned int buf;
    int log;
    OPEN_READER(re, gb);
    UPDATE_CACHE(re, gb);
    buf = GET_CACHE(re, gb);
    log = av_log2(buf);
    if (log - k >= 32 - MIN_CACHE_BITS + (MIN_CACHE_BITS == 32) &&
        32 - log < limit) {
        buf >>= log - k;
        buf  += (30 - log) << k;
        LAST_SKIP_BITS(re, gb, 32 + k - log);
        CLOSE_READER(re, gb);
        return buf;
    } else {
        int i;
        for (i = 0; i < limit && SHOW_UBITS(re, gb, 1) == 0 && BITS_AVAILABLE(re, gb); i++) {
            LAST_SKIP_BITS(re, gb, 1);
            UPDATE_CACHE(re, gb);
        }
        SKIP_BITS(re, gb, 1);
        if (i < limit - 1) {
            if (k) {
                buf = SHOW_UBITS(re, gb, k);
                LAST_SKIP_BITS(re, gb, k);
            } else {
                buf = 0;
            }
            CLOSE_READER(re, gb);
            return buf + (i << k);
        } else if (i == limit - 1) {
            buf = SHOW_UBITS(re, gb, esc_len);
            LAST_SKIP_BITS(re, gb, esc_len);
            CLOSE_READER(re, gb);
            return buf + 1;
        } else
            return -1;
    }
}
['static inline int get_ur_golomb_jpegls(GetBitContext *gb, int k, int limit,\n                                       int esc_len)\n{\n    unsigned int buf;\n    int log;\n    OPEN_READER(re, gb);\n    UPDATE_CACHE(re, gb);\n    buf = GET_CACHE(re, gb);\n    log = av_log2(buf);\n    if (log - k >= 32 - MIN_CACHE_BITS + (MIN_CACHE_BITS == 32) &&\n        32 - log < limit) {\n        buf >>= log - k;\n        buf  += (30 - log) << k;\n        LAST_SKIP_BITS(re, gb, 32 + k - log);\n        CLOSE_READER(re, gb);\n        return buf;\n    } else {\n        int i;\n        for (i = 0; i < limit && SHOW_UBITS(re, gb, 1) == 0 && BITS_AVAILABLE(re, gb); i++) {\n            LAST_SKIP_BITS(re, gb, 1);\n            UPDATE_CACHE(re, gb);\n        }\n        SKIP_BITS(re, gb, 1);\n        if (i < limit - 1) {\n            if (k) {\n                buf = SHOW_UBITS(re, gb, k);\n                LAST_SKIP_BITS(re, gb, k);\n            } else {\n                buf = 0;\n            }\n            CLOSE_READER(re, gb);\n            return buf + (i << k);\n        } else if (i == limit - 1) {\n            buf = SHOW_UBITS(re, gb, esc_len);\n            LAST_SKIP_BITS(re, gb, esc_len);\n            CLOSE_READER(re, gb);\n            return buf + 1;\n        } else\n            return -1;\n    }\n}']