Go to the documentation of this file.
48 while (root * 2 + 1 <
size) {
49 int child = root * 2 + 1;
70 if (!
h || !up || !
len || !
map) {
75 for (
i = 0;
i<stats_size;
i++) {
86 for (
i =
size / 2 - 1;
i >= 0;
i--)
89 for (next =
size; next <
size * 2 - 1; next++) {
91 uint64_t min1v =
h[0].val;
106 if (dst[
map[
i]] >= 32)
break;
119 Node *nodes,
int node,
120 uint32_t pfx,
int pl,
int *
pos,
int no_zero_count)
125 if (
s !=
HNODE || (no_zero_count && !nodes[node].count)) {
150 &
pos, no_zero_count);
151 return ff_init_vlc_sparse(vlc, nb_bits,
pos, lens, 2, 2,
bits, 4, 4, xlat, 1, 1, 0);
166 for (
i = 0;
i < nb_codes;
i++) {
174 "Too high symbol frequencies. "
175 "Tree construction is not possible\n");
180 nodes[nb_codes*2-1].
count = 0;
181 for (
i = 0;
i < nb_codes * 2 - 1;
i += 2) {
185 for(j = cur_node; j >
i + 2; j--){
186 if(cur_count > nodes[j-1].count ||
187 (cur_count == nodes[j-1].count &&
190 nodes[j] = nodes[j - 1];
193 nodes[j].
count = cur_count;
Filter the word “frame” indicates either a video frame or a group of audio as stored in an AVFrame structure Format for each input and each output the list of supported formats For video that means pixel format For audio that means channel sample they are references to shared objects When the negotiation mechanism computes the intersection of the formats supported at each end of a all references to both lists are replaced with a reference to the intersection And when a single format is eventually chosen for a link amongst the remaining all references to the list are updated That means that if a filter requires that its input and output have the same format amongst a supported all it has to do is use a reference to the same list of formats query_formats can leave some formats unset and return AVERROR(EAGAIN) to cause the negotiation mechanism toagain later. That can be used by filters with complex requirements to use the format negotiated on one link to set the formats supported on another. Frame references ownership and permissions
static void stats(AVPacket *const *in, int n_in, unsigned *_max, unsigned *_sum)
#define FF_HUFFMAN_FLAG_ZERO_COUNT
static double val(void *priv, double ch)
static void heap_sift(HeapElem *h, int root, int size)
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
static int build_huff_tree(VLC *vlc, Node *nodes, int head, int flags, int nb_bits)
static av_always_inline int cmp(MpegEncContext *s, const int x, const int y, const int subx, const int suby, const int size, const int h, int ref_index, int src_index, me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags)
compares a block (either a full macroblock or a partition thereof) against a proposed motion-compensa...
int ff_huff_gen_len_table(uint8_t *dst, const uint64_t *stats, int stats_size, int skip0)
it s the only field you need to keep assuming you have a context There is some magic you don t need to care about around this just let it vf offset
#define i(width, name, range_min, range_max)
#define AV_QSORT(p, num, type, cmp)
Quicksort This sort is fast, and fully inplace but not stable and it is possible to construct input t...
int ff_init_vlc_sparse(VLC *vlc, int nb_bits, int nb_codes, const void *bits, int bits_wrap, int bits_size, const void *codes, int codes_wrap, int codes_size, const void *symbols, int symbols_wrap, int symbols_size, int flags)
#define av_malloc_array(a, b)
int ff_huff_build_tree(void *logctx, VLC *vlc, int nb_codes, int nb_bits, Node *nodes, HuffCmp cmp, int flags)
nodes size must be 2*nb_codes first nb_codes nodes.count must be set
#define FFSWAP(type, a, b)
int(* HuffCmp)(const void *va, const void *vb)
const VDPAUPixFmtMap * map
static void get_tree_codes(uint32_t *bits, int16_t *lens, uint8_t *xlat, Node *nodes, int node, uint32_t pfx, int pl, int *pos, int no_zero_count)
#define flags(name, subs,...)
#define FF_HUFFMAN_FLAG_HNODE_FIRST