Home
last modified time | relevance | path

Searched refs:nb_entries (Results 1 - 9 of 9) sorted by relevance

/third_party/ffmpeg/libavfilter/
H A Dvf_palettegen.c51 int nb_entries; member
300 for (i = 0; i < node->nb_entries; i++) in load_color_refs()
454 for (i = 0; i < node->nb_entries; i++) { in color_inc()
462 e = av_dynarray2_add((void**)&node->entries, &node->nb_entries, in color_inc()
H A Dvf_paletteuse.c74 int nb_entries; member
359 for (i = 0; i < node->nb_entries; i++) { in color_get()
365 e = av_dynarray2_add((void**)&node->entries, &node->nb_entries, in color_get()
/third_party/ffmpeg/libavformat/
H A Dseek.c128 int ff_index_search_timestamp(const AVIndexEntry *entries, int nb_entries, in ff_index_search_timestamp() argument
135 b = nb_entries; in ff_index_search_timestamp()
145 while ((entries[m].flags & AVINDEX_DISCARD_FRAME) && m < b && m < nb_entries - 1) { in ff_index_search_timestamp()
162 while (m >= 0 && m < nb_entries && in ff_index_search_timestamp()
166 if (m == nb_entries) in ff_index_search_timestamp()
H A Ddemux.h130 int ff_index_search_timestamp(const AVIndexEntry *entries, int nb_entries,
H A Dcafdec.c283 unsigned int nb_entries = avio_rb32(pb); in read_info_chunk() local
284 for (i = 0; i < nb_entries && !avio_feof(pb); i++) { in read_info_chunk()
H A Dhlsenc.c147 int nb_entries; member
1168 if (hls->max_nb_segments && vs->nb_entries >= hls->max_nb_segments) { in hls_append_segment()
1182 vs->nb_entries++; in hls_append_segment()
1541 int64_t sequence = FFMAX(hls->start_sequence, vs->sequence - vs->nb_entries); in hls_window()
2448 if (vs->sequence - vs->nb_entries > hls->start_sequence && hls->init_time > 0) { in hls_write_packet()
2450 int64_t init_list_dur = hls->init_time * vs->nb_entries; in hls_write_packet()
2451 int64_t after_init_list_dur = (vs->sequence - hls->start_sequence - vs->nb_entries) * hls->time; in hls_write_packet()
H A Dasfdec_o.c861 uint32_t pkt_num, nb_entries; in asf_read_simple_index() local
883 nb_entries = avio_rl32(pb); in asf_read_simple_index()
884 for (i = 0; i < nb_entries; i++) { in asf_read_simple_index()
/third_party/rust/crates/bindgen/bindgen-tests/tests/headers/
H A Dlayout_large_align_field.h93 uint32_t nb_entries; /**< total size of the table. */ member
/third_party/ffmpeg/libavcodec/
H A Dvp3.c173 uint8_t nb_entries; member
2452 ret = ff_init_vlc_from_lengths(&s->coeff_vlc[i], 11, tab->nb_entries, in vp3_decode_init()
2853 if (huff->nb_entries >= 32) { /* overflow */ in read_huffman_tree()
2859 length, huff->nb_entries, token); in read_huffman_tree()
2860 huff->entries[huff->nb_entries++] = (HuffEntry){ length, token }; in read_huffman_tree()
2862 /* The following bound follows from the fact that nb_entries <= 32. */ in read_huffman_tree()
3096 s->huffman_table[i].nb_entries = 0; in theora_decode_tables()

Completed in 19 milliseconds