Lines Matching refs:code
94 uint32_t code;
120 return (sa->code >> 1) - (sb->code >> 1);
135 * Sorting by VLCcode.code is sufficient, though not necessary.
155 uint32_t code = codes[i].code;
157 ff_dlog(NULL, "i=%d n=%d code=0x%"PRIx32"\n", i, n, code);
160 int j = code >> (32 - table_nb_bits);
165 j = bitswap_32(code);
171 ff_dlog(NULL, "%4x: code=%d n=%d\n", j, i, n);
186 code_prefix = code >> (32 - table_nb_bits);
189 codes[i].code = code << table_nb_bits;
194 code = codes[k].code;
195 if (code >> (32 - table_nb_bits) != code_prefix)
198 codes[k].code = code << table_nb_bits;
257 'bits' : table which gives the size (in bits) of each vlc code.
259 'codes' : table which gives the bit pattern of of each vlc code.
300 GET_DATA(buf[j].code, codes, i, codes_wrap, codes_size); \
301 if (buf[j].code >= (1LL<<buf[j].bits)) { \
302 av_log(NULL, AV_LOG_ERROR, "Invalid code %"PRIx32" for %d in " \
303 "init_vlc\n", buf[j].code, i); \
309 buf[j].code = bitswap_32(buf[j].code); \
311 buf[j].code <<= 32 - buf[j].bits; \
334 uint64_t code;
341 j = code = 0;
353 buf[j++].code = code;
358 if (len > len_max || code & ((1U << (32 - len)) - 1)) {
362 code += 1U << (32 - len);
363 if (code > UINT32_MAX + 1ULL) {