Home
last modified time | relevance | path

Searched refs:codes_count (Results 1 – 3 of 3) sorted by relevance

/third_party/ffmpeg/libavcodec/
Dmotionpixels.c46 int codes_count, current_codes_count; member
142 if (mp->current_codes_count >= mp->codes_count) { in mp_get_code()
153 if (mp->codes_count == 1) { in mp_read_codes_table()
160 for (i = 0; i < mp->codes_count; ++i) in mp_read_codes_table()
165 if (mp->current_codes_count < mp->codes_count) { in mp_read_codes_table()
311 mp->codes_count = get_bits(&gb, 4); in mp_decode_frame()
312 if (mp->codes_count == 0) in mp_decode_frame()
328 if (mp->codes_count > 1) { in mp_decode_frame()
331 ret = ff_init_vlc_from_lengths(&mp->vlc, mp->max_codes_bits, mp->codes_count, in mp_decode_frame()
332 … &mp->codes[mp->codes_count - 1].size, -(int)sizeof(HuffCode), in mp_decode_frame()
[all …]
Dmagicyuvenc.c247 static void calculate_codes(HuffEntry *he, uint16_t codes_count[33]) in calculate_codes()
250 uint16_t curr = codes_count[i]; // # of leafs of length i in calculate_codes()
251 codes_count[i] = nb_codes / 2; // # of non-leaf nodes on level i in calculate_codes()
252 nb_codes = codes_count[i] + curr; // # of nodes on level i in calculate_codes()
256 he[i].code = codes_count[he[i].len]; in calculate_codes()
257 codes_count[he[i].len]++; in calculate_codes()
Dutvideodec.c54 uint16_t codes_count[33] = { 0 }; in build_huff() local
68 codes_count[bits[i]]++; in build_huff()
70 if (codes_count[0] == nb_elems) in build_huff()
79 codes_count[i] += codes_count[i + 1]; in build_huff()
82 he[--codes_count[bits[i]]] = (HuffEntry) { bits[i], i }; in build_huff()
85 return ff_init_vlc_from_lengths(vlc, VLC_BITS, codes_count[0], in build_huff()