Libav
vp6.c
Go to the documentation of this file.
1 /*
2  * Copyright (C) 2006 Aurelien Jacobs <aurel@gnuage.org>
3  *
4  * This file is part of Libav.
5  *
6  * Libav is free software; you can redistribute it and/or
7  * modify it under the terms of the GNU Lesser General Public
8  * License as published by the Free Software Foundation; either
9  * version 2.1 of the License, or (at your option) any later version.
10  *
11  * Libav is distributed in the hope that it will be useful,
12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14  * Lesser General Public License for more details.
15  *
16  * You should have received a copy of the GNU Lesser General Public
17  * License along with Libav; if not, write to the Free Software
18  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19  */
20 
30 #include <stdlib.h>
31 
32 #include "avcodec.h"
33 #include "get_bits.h"
34 #include "huffman.h"
35 #include "internal.h"
36 
37 #include "vp56.h"
38 #include "vp56data.h"
39 #include "vp6data.h"
40 
41 #define VP6_MAX_HUFF_SIZE 12
42 
43 static void vp6_parse_coeff(VP56Context *s);
44 static void vp6_parse_coeff_huffman(VP56Context *s);
45 
46 static int vp6_parse_header(VP56Context *s, const uint8_t *buf, int buf_size,
47  int *golden_frame)
48 {
49  VP56RangeCoder *c = &s->c;
50  int parse_filter_info = 0;
51  int coeff_offset = 0;
52  int vrt_shift = 0;
53  int sub_version;
54  int rows, cols;
55  int res = 0;
56  int separated_coeff = buf[0] & 1;
57 
58  s->frames[VP56_FRAME_CURRENT]->key_frame = !(buf[0] & 0x80);
59  ff_vp56_init_dequant(s, (buf[0] >> 1) & 0x3F);
60 
61  if (s->frames[VP56_FRAME_CURRENT]->key_frame) {
62  sub_version = buf[1] >> 3;
63  if (sub_version > 8)
64  return AVERROR_INVALIDDATA;
65  s->filter_header = buf[1] & 0x06;
66  if (buf[1] & 1) {
67  avpriv_report_missing_feature(s->avctx, "Interlacing");
68  return AVERROR_PATCHWELCOME;
69  }
70  if (separated_coeff || !s->filter_header) {
71  coeff_offset = AV_RB16(buf+2) - 2;
72  buf += 2;
73  buf_size -= 2;
74  }
75 
76  rows = buf[2]; /* number of stored macroblock rows */
77  cols = buf[3]; /* number of stored macroblock cols */
78  /* buf[4] is number of displayed macroblock rows */
79  /* buf[5] is number of displayed macroblock cols */
80  if (!rows || !cols) {
81  av_log(s->avctx, AV_LOG_ERROR, "Invalid size %dx%d\n", cols << 4, rows << 4);
82  return AVERROR_INVALIDDATA;
83  }
84 
85  if (!s->macroblocks || /* first frame */
86  16*cols != s->avctx->coded_width ||
87  16*rows != s->avctx->coded_height) {
88  if (s->avctx->extradata_size == 0 &&
89  FFALIGN(s->avctx->width, 16) == 16 * cols &&
90  FFALIGN(s->avctx->height, 16) == 16 * rows) {
91  // We assume this is properly signalled container cropping,
92  // in an F4V file. Just set the coded_width/height, don't
93  // touch the cropped ones.
94  s->avctx->coded_width = 16 * cols;
95  s->avctx->coded_height = 16 * rows;
96  } else {
97  int ret = ff_set_dimensions(s->avctx, 16 * cols, 16 * rows);
98  if (ret < 0)
99  return ret;
100 
101  if (s->avctx->extradata_size == 1) {
102  s->avctx->width -= s->avctx->extradata[0] >> 4;
103  s->avctx->height -= s->avctx->extradata[0] & 0x0F;
104  }
105  }
106  res = VP56_SIZE_CHANGE;
107  }
108 
109  ff_vp56_init_range_decoder(c, buf+6, buf_size-6);
110  vp56_rac_gets(c, 2);
111 
112  parse_filter_info = s->filter_header;
113  if (sub_version < 8)
114  vrt_shift = 5;
115  s->sub_version = sub_version;
116  } else {
117  if (!s->sub_version || !s->avctx->coded_width || !s->avctx->coded_height)
118  return AVERROR_INVALIDDATA;
119 
120  if (separated_coeff || !s->filter_header) {
121  coeff_offset = AV_RB16(buf+1) - 2;
122  buf += 2;
123  buf_size -= 2;
124  }
125  ff_vp56_init_range_decoder(c, buf+1, buf_size-1);
126 
127  *golden_frame = vp56_rac_get(c);
128  if (s->filter_header) {
129  s->deblock_filtering = vp56_rac_get(c);
130  if (s->deblock_filtering)
131  vp56_rac_get(c);
132  if (s->sub_version > 7)
133  parse_filter_info = vp56_rac_get(c);
134  }
135  }
136 
137  if (parse_filter_info) {
138  if (vp56_rac_get(c)) {
139  s->filter_mode = 2;
140  s->sample_variance_threshold = vp56_rac_gets(c, 5) << vrt_shift;
141  s->max_vector_length = 2 << vp56_rac_gets(c, 3);
142  } else if (vp56_rac_get(c)) {
143  s->filter_mode = 1;
144  } else {
145  s->filter_mode = 0;
146  }
147  if (s->sub_version > 7)
148  s->filter_selection = vp56_rac_gets(c, 4);
149  else
150  s->filter_selection = 16;
151  }
152 
153  s->use_huffman = vp56_rac_get(c);
154 
155  s->parse_coeff = vp6_parse_coeff;
156  if (coeff_offset) {
157  buf += coeff_offset;
158  buf_size -= coeff_offset;
159  if (buf_size < 0) {
160  if (s->frames[VP56_FRAME_CURRENT]->key_frame)
161  ff_set_dimensions(s->avctx, 0, 0);
162  return AVERROR_INVALIDDATA;
163  }
164  if (s->use_huffman) {
165  s->parse_coeff = vp6_parse_coeff_huffman;
166  init_get_bits(&s->gb, buf, buf_size<<3);
167  } else {
168  ff_vp56_init_range_decoder(&s->cc, buf, buf_size);
169  s->ccp = &s->cc;
170  }
171  } else {
172  s->ccp = &s->c;
173  }
174 
175  return res;
176 }
177 
178 static void vp6_coeff_order_table_init(VP56Context *s)
179 {
180  int i, pos, idx = 1;
181 
182  s->modelp->coeff_index_to_pos[0] = 0;
183  for (i=0; i<16; i++)
184  for (pos=1; pos<64; pos++)
185  if (s->modelp->coeff_reorder[pos] == i)
186  s->modelp->coeff_index_to_pos[idx++] = pos;
187 }
188 
189 static void vp6_default_models_init(VP56Context *s)
190 {
191  VP56Model *model = s->modelp;
192 
193  model->vector_dct[0] = 0xA2;
194  model->vector_dct[1] = 0xA4;
195  model->vector_sig[0] = 0x80;
196  model->vector_sig[1] = 0x80;
197 
198  memcpy(model->mb_types_stats, ff_vp56_def_mb_types_stats, sizeof(model->mb_types_stats));
199  memcpy(model->vector_fdv, vp6_def_fdv_vector_model, sizeof(model->vector_fdv));
200  memcpy(model->vector_pdv, vp6_def_pdv_vector_model, sizeof(model->vector_pdv));
201  memcpy(model->coeff_runv, vp6_def_runv_coeff_model, sizeof(model->coeff_runv));
202  memcpy(model->coeff_reorder, vp6_def_coeff_reorder, sizeof(model->coeff_reorder));
203 
205 }
206 
207 static void vp6_parse_vector_models(VP56Context *s)
208 {
209  VP56RangeCoder *c = &s->c;
210  VP56Model *model = s->modelp;
211  int comp, node;
212 
213  for (comp=0; comp<2; comp++) {
214  if (vp56_rac_get_prob(c, vp6_sig_dct_pct[comp][0]))
215  model->vector_dct[comp] = vp56_rac_gets_nn(c, 7);
216  if (vp56_rac_get_prob(c, vp6_sig_dct_pct[comp][1]))
217  model->vector_sig[comp] = vp56_rac_gets_nn(c, 7);
218  }
219 
220  for (comp=0; comp<2; comp++)
221  for (node=0; node<7; node++)
222  if (vp56_rac_get_prob(c, vp6_pdv_pct[comp][node]))
223  model->vector_pdv[comp][node] = vp56_rac_gets_nn(c, 7);
224 
225  for (comp=0; comp<2; comp++)
226  for (node=0; node<8; node++)
227  if (vp56_rac_get_prob(c, vp6_fdv_pct[comp][node]))
228  model->vector_fdv[comp][node] = vp56_rac_gets_nn(c, 7);
229 }
230 
231 /* nodes must ascend by count, but with descending symbol order */
232 static int vp6_huff_cmp(const void *va, const void *vb)
233 {
234  const Node *a = va, *b = vb;
235  return (a->count - b->count)*16 + (b->sym - a->sym);
236 }
237 
238 static int vp6_build_huff_tree(VP56Context *s, uint8_t coeff_model[],
239  const uint8_t *map, unsigned size, VLC *vlc)
240 {
241  Node nodes[2*VP6_MAX_HUFF_SIZE], *tmp = &nodes[size];
242  int a, b, i;
243 
244  /* first compute probabilities from model */
245  tmp[0].count = 256;
246  for (i=0; i<size-1; i++) {
247  a = tmp[i].count * coeff_model[i] >> 8;
248  b = tmp[i].count * (255 - coeff_model[i]) >> 8;
249  nodes[map[2*i ]].count = a + !a;
250  nodes[map[2*i+1]].count = b + !b;
251  }
252 
253  ff_free_vlc(vlc);
254  /* then build the huffman tree according to probabilities */
255  return ff_huff_build_tree(s->avctx, vlc, size, nodes, vp6_huff_cmp,
257 }
258 
259 static int vp6_parse_coeff_models(VP56Context *s)
260 {
261  VP56RangeCoder *c = &s->c;
262  VP56Model *model = s->modelp;
263  int def_prob[11];
264  int node, cg, ctx, pos;
265  int ct; /* code type */
266  int pt; /* plane type (0 for Y, 1 for U or V) */
267 
268  memset(def_prob, 0x80, sizeof(def_prob));
269 
270  for (pt=0; pt<2; pt++)
271  for (node=0; node<11; node++)
272  if (vp56_rac_get_prob(c, vp6_dccv_pct[pt][node])) {
273  def_prob[node] = vp56_rac_gets_nn(c, 7);
274  model->coeff_dccv[pt][node] = def_prob[node];
275  } else if (s->frames[VP56_FRAME_CURRENT]->key_frame) {
276  model->coeff_dccv[pt][node] = def_prob[node];
277  }
278 
279  if (vp56_rac_get(c)) {
280  for (pos=1; pos<64; pos++)
282  model->coeff_reorder[pos] = vp56_rac_gets(c, 4);
284  }
285 
286  for (cg=0; cg<2; cg++)
287  for (node=0; node<14; node++)
288  if (vp56_rac_get_prob(c, vp6_runv_pct[cg][node]))
289  model->coeff_runv[cg][node] = vp56_rac_gets_nn(c, 7);
290 
291  for (ct=0; ct<3; ct++)
292  for (pt=0; pt<2; pt++)
293  for (cg=0; cg<6; cg++)
294  for (node=0; node<11; node++)
295  if (vp56_rac_get_prob(c, vp6_ract_pct[ct][pt][cg][node])) {
296  def_prob[node] = vp56_rac_gets_nn(c, 7);
297  model->coeff_ract[pt][ct][cg][node] = def_prob[node];
298  } else if (s->frames[VP56_FRAME_CURRENT]->key_frame) {
299  model->coeff_ract[pt][ct][cg][node] = def_prob[node];
300  }
301 
302  if (s->use_huffman) {
303  for (pt=0; pt<2; pt++) {
304  if (vp6_build_huff_tree(s, model->coeff_dccv[pt],
305  vp6_huff_coeff_map, 12, &s->dccv_vlc[pt]))
306  return -1;
307  if (vp6_build_huff_tree(s, model->coeff_runv[pt],
308  vp6_huff_run_map, 9, &s->runv_vlc[pt]))
309  return -1;
310  for (ct=0; ct<3; ct++)
311  for (cg = 0; cg < 6; cg++)
312  if (vp6_build_huff_tree(s, model->coeff_ract[pt][ct][cg],
313  vp6_huff_coeff_map, 12,
314  &s->ract_vlc[pt][ct][cg]))
315  return -1;
316  }
317  memset(s->nb_null, 0, sizeof(s->nb_null));
318  } else {
319  /* coeff_dcct is a linear combination of coeff_dccv */
320  for (pt=0; pt<2; pt++)
321  for (ctx=0; ctx<3; ctx++)
322  for (node=0; node<5; node++)
323  model->coeff_dcct[pt][ctx][node] = av_clip(((model->coeff_dccv[pt][node] * vp6_dccv_lc[ctx][node][0] + 128) >> 8) + vp6_dccv_lc[ctx][node][1], 1, 255);
324  }
325  return 0;
326 }
327 
328 static void vp6_parse_vector_adjustment(VP56Context *s, VP56mv *vect)
329 {
330  VP56RangeCoder *c = &s->c;
331  VP56Model *model = s->modelp;
332  int comp;
333 
334  *vect = (VP56mv) {0,0};
335  if (s->vector_candidate_pos < 2)
336  *vect = s->vector_candidate[0];
337 
338  for (comp=0; comp<2; comp++) {
339  int i, delta = 0;
340 
341  if (vp56_rac_get_prob(c, model->vector_dct[comp])) {
342  static const uint8_t prob_order[] = {0, 1, 2, 7, 6, 5, 4};
343  for (i=0; i<sizeof(prob_order); i++) {
344  int j = prob_order[i];
345  delta |= vp56_rac_get_prob(c, model->vector_fdv[comp][j])<<j;
346  }
347  if (delta & 0xF0)
348  delta |= vp56_rac_get_prob(c, model->vector_fdv[comp][3])<<3;
349  else
350  delta |= 8;
351  } else {
353  model->vector_pdv[comp]);
354  }
355 
356  if (delta && vp56_rac_get_prob(c, model->vector_sig[comp]))
357  delta = -delta;
358 
359  if (!comp)
360  vect->x += delta;
361  else
362  vect->y += delta;
363  }
364 }
365 
370 static unsigned vp6_get_nb_null(VP56Context *s)
371 {
372  unsigned val = get_bits(&s->gb, 2);
373  if (val == 2)
374  val += get_bits(&s->gb, 2);
375  else if (val == 3) {
376  val = get_bits1(&s->gb) << 2;
377  val = 6+val + get_bits(&s->gb, 2+val);
378  }
379  return val;
380 }
381 
382 static void vp6_parse_coeff_huffman(VP56Context *s)
383 {
384  VP56Model *model = s->modelp;
385  uint8_t *permute = s->idct_scantable;
386  VLC *vlc_coeff;
387  int coeff, sign, coeff_idx;
388  int b, cg, idx;
389  int pt = 0; /* plane type (0 for Y, 1 for U or V) */
390 
391  for (b=0; b<6; b++) {
392  int ct = 0; /* code type */
393  if (b > 3) pt = 1;
394  vlc_coeff = &s->dccv_vlc[pt];
395 
396  for (coeff_idx = 0;;) {
397  int run = 1;
398  if (coeff_idx<2 && s->nb_null[coeff_idx][pt]) {
399  s->nb_null[coeff_idx][pt]--;
400  if (coeff_idx)
401  break;
402  } else {
403  if (get_bits_left(&s->gb) <= 0)
404  return;
405  coeff = get_vlc2(&s->gb, vlc_coeff->table, 9, 3);
406  if (coeff == 0) {
407  if (coeff_idx) {
408  int pt = (coeff_idx >= 6);
409  run += get_vlc2(&s->gb, s->runv_vlc[pt].table, 9, 3);
410  if (run >= 9)
411  run += get_bits(&s->gb, 6);
412  } else
413  s->nb_null[0][pt] = vp6_get_nb_null(s);
414  ct = 0;
415  } else if (coeff == 11) { /* end of block */
416  if (coeff_idx == 1) /* first AC coeff ? */
417  s->nb_null[1][pt] = vp6_get_nb_null(s);
418  break;
419  } else {
420  int coeff2 = ff_vp56_coeff_bias[coeff];
421  if (coeff > 4)
422  coeff2 += get_bits(&s->gb, coeff <= 9 ? coeff - 4 : 11);
423  ct = 1 + (coeff2 > 1);
424  sign = get_bits1(&s->gb);
425  coeff2 = (coeff2 ^ -sign) + sign;
426  if (coeff_idx)
427  coeff2 *= s->dequant_ac;
428  idx = model->coeff_index_to_pos[coeff_idx];
429  s->block_coeff[b][permute[idx]] = coeff2;
430  }
431  }
432  coeff_idx+=run;
433  if (coeff_idx >= 64)
434  break;
435  cg = FFMIN(vp6_coeff_groups[coeff_idx], 3);
436  vlc_coeff = &s->ract_vlc[pt][ct][cg];
437  }
438  }
439 }
440 
441 static void vp6_parse_coeff(VP56Context *s)
442 {
443  VP56RangeCoder *c = s->ccp;
444  VP56Model *model = s->modelp;
445  uint8_t *permute = s->idct_scantable;
446  uint8_t *model1, *model2, *model3;
447  int coeff, sign, coeff_idx;
448  int b, i, cg, idx, ctx;
449  int pt = 0; /* plane type (0 for Y, 1 for U or V) */
450 
451  for (b=0; b<6; b++) {
452  int ct = 1; /* code type */
453  int run = 1;
454 
455  if (b > 3) pt = 1;
456 
457  ctx = s->left_block[ff_vp56_b6to4[b]].not_null_dc
458  + s->above_blocks[s->above_block_idx[b]].not_null_dc;
459  model1 = model->coeff_dccv[pt];
460  model2 = model->coeff_dcct[pt][ctx];
461 
462  coeff_idx = 0;
463  for (;;) {
464  if ((coeff_idx>1 && ct==0) || vp56_rac_get_prob(c, model2[0])) {
465  /* parse a coeff */
466  if (vp56_rac_get_prob(c, model2[2])) {
467  if (vp56_rac_get_prob(c, model2[3])) {
468  idx = vp56_rac_get_tree(c, ff_vp56_pc_tree, model1);
469  coeff = ff_vp56_coeff_bias[idx+5];
470  for (i=ff_vp56_coeff_bit_length[idx]; i>=0; i--)
471  coeff += vp56_rac_get_prob(c, ff_vp56_coeff_parse_table[idx][i]) << i;
472  } else {
473  if (vp56_rac_get_prob(c, model2[4]))
474  coeff = 3 + vp56_rac_get_prob(c, model1[5]);
475  else
476  coeff = 2;
477  }
478  ct = 2;
479  } else {
480  ct = 1;
481  coeff = 1;
482  }
483  sign = vp56_rac_get(c);
484  coeff = (coeff ^ -sign) + sign;
485  if (coeff_idx)
486  coeff *= s->dequant_ac;
487  idx = model->coeff_index_to_pos[coeff_idx];
488  s->block_coeff[b][permute[idx]] = coeff;
489  run = 1;
490  } else {
491  /* parse a run */
492  ct = 0;
493  if (coeff_idx > 0) {
494  if (!vp56_rac_get_prob(c, model2[1]))
495  break;
496 
497  model3 = model->coeff_runv[coeff_idx >= 6];
498  run = vp56_rac_get_tree(c, vp6_pcr_tree, model3);
499  if (!run)
500  for (run=9, i=0; i<6; i++)
501  run += vp56_rac_get_prob(c, model3[i+8]) << i;
502  }
503  }
504  coeff_idx += run;
505  if (coeff_idx >= 64)
506  break;
507  cg = vp6_coeff_groups[coeff_idx];
508  model1 = model2 = model->coeff_ract[pt][ct][cg];
509  }
510 
511  s->left_block[ff_vp56_b6to4[b]].not_null_dc =
512  s->above_blocks[s->above_block_idx[b]].not_null_dc = !!s->block_coeff[b][0];
513  }
514 }
515 
516 static int vp6_block_variance(uint8_t *src, int stride)
517 {
518  int sum = 0, square_sum = 0;
519  int y, x;
520 
521  for (y=0; y<8; y+=2) {
522  for (x=0; x<8; x+=2) {
523  sum += src[x];
524  square_sum += src[x]*src[x];
525  }
526  src += 2*stride;
527  }
528  return (16*square_sum - sum*sum) >> 8;
529 }
530 
531 static void vp6_filter_hv4(uint8_t *dst, uint8_t *src, int stride,
532  int delta, const int16_t *weights)
533 {
534  int x, y;
535 
536  for (y=0; y<8; y++) {
537  for (x=0; x<8; x++) {
538  dst[x] = av_clip_uint8(( src[x-delta ] * weights[0]
539  + src[x ] * weights[1]
540  + src[x+delta ] * weights[2]
541  + src[x+2*delta] * weights[3] + 64) >> 7);
542  }
543  src += stride;
544  dst += stride;
545  }
546 }
547 
548 static void vp6_filter_diag2(VP56Context *s, uint8_t *dst, uint8_t *src,
549  int stride, int h_weight, int v_weight)
550 {
551  uint8_t *tmp = s->edge_emu_buffer+16;
552  s->h264chroma.put_h264_chroma_pixels_tab[0](tmp, src, stride, 9, h_weight, 0);
553  s->h264chroma.put_h264_chroma_pixels_tab[0](dst, tmp, stride, 8, 0, v_weight);
554 }
555 
556 static void vp6_filter(VP56Context *s, uint8_t *dst, uint8_t *src,
557  int offset1, int offset2, int stride,
558  VP56mv mv, int mask, int select, int luma)
559 {
560  int filter4 = 0;
561  int x8 = mv.x & mask;
562  int y8 = mv.y & mask;
563 
564  if (luma) {
565  x8 *= 2;
566  y8 *= 2;
567  filter4 = s->filter_mode;
568  if (filter4 == 2) {
569  if (s->max_vector_length &&
570  (FFABS(mv.x) > s->max_vector_length ||
571  FFABS(mv.y) > s->max_vector_length)) {
572  filter4 = 0;
573  } else if (s->sample_variance_threshold
574  && (vp6_block_variance(src+offset1, stride)
575  < s->sample_variance_threshold)) {
576  filter4 = 0;
577  }
578  }
579  }
580 
581  if ((y8 && (offset2-offset1)*s->flip<0) || (!y8 && offset1 > offset2)) {
582  offset1 = offset2;
583  }
584 
585  if (filter4) {
586  if (!y8) { /* left or right combine */
587  vp6_filter_hv4(dst, src+offset1, stride, 1,
588  vp6_block_copy_filter[select][x8]);
589  } else if (!x8) { /* above or below combine */
590  vp6_filter_hv4(dst, src+offset1, stride, stride,
591  vp6_block_copy_filter[select][y8]);
592  } else {
593  s->vp56dsp.vp6_filter_diag4(dst, src+offset1+((mv.x^mv.y)>>31), stride,
594  vp6_block_copy_filter[select][x8],
595  vp6_block_copy_filter[select][y8]);
596  }
597  } else {
598  if (!x8 || !y8) {
599  s->h264chroma.put_h264_chroma_pixels_tab[0](dst, src + offset1, stride, 8, x8, y8);
600  } else {
601  vp6_filter_diag2(s, dst, src+offset1 + ((mv.x^mv.y)>>31), stride, x8, y8);
602  }
603  }
604 }
605 
607 {
608  VP56Context *s = avctx->priv_data;
609  int ret;
610 
611  if ((ret = ff_vp56_init(avctx, avctx->codec->id == AV_CODEC_ID_VP6,
612  avctx->codec->id == AV_CODEC_ID_VP6A)) < 0)
613  return ret;
614 
615  s->vp56_coord_div = vp6_coord_div;
616  s->parse_vector_adjustment = vp6_parse_vector_adjustment;
617  s->filter = vp6_filter;
618  s->default_models_init = vp6_default_models_init;
619  s->parse_vector_models = vp6_parse_vector_models;
620  s->parse_coeff_models = vp6_parse_coeff_models;
621  s->parse_header = vp6_parse_header;
622 
623  return 0;
624 }
625 
627 {
628  VP56Context *s = avctx->priv_data;
629  int pt, ct, cg;
630 
631  ff_vp56_free(avctx);
632 
633  for (pt=0; pt<2; pt++) {
634  ff_free_vlc(&s->dccv_vlc[pt]);
635  ff_free_vlc(&s->runv_vlc[pt]);
636  for (ct=0; ct<3; ct++)
637  for (cg=0; cg<6; cg++)
638  ff_free_vlc(&s->ract_vlc[pt][ct][cg]);
639  }
640  return 0;
641 }
642 
644  .name = "vp6",
645  .long_name = NULL_IF_CONFIG_SMALL("On2 VP6"),
646  .type = AVMEDIA_TYPE_VIDEO,
647  .id = AV_CODEC_ID_VP6,
648  .priv_data_size = sizeof(VP56Context),
652  .capabilities = CODEC_CAP_DR1,
653 };
654 
655 /* flash version, not flipped upside-down */
657  .name = "vp6f",
658  .long_name = NULL_IF_CONFIG_SMALL("On2 VP6 (Flash version)"),
659  .type = AVMEDIA_TYPE_VIDEO,
660  .id = AV_CODEC_ID_VP6F,
661  .priv_data_size = sizeof(VP56Context),
665  .capabilities = CODEC_CAP_DR1,
666 };
667 
668 /* flash version, not flipped upside-down, with alpha channel */
670  .name = "vp6a",
671  .long_name = NULL_IF_CONFIG_SMALL("On2 VP6 (Flash version, with alpha channel)"),
672  .type = AVMEDIA_TYPE_VIDEO,
673  .id = AV_CODEC_ID_VP6A,
674  .priv_data_size = sizeof(VP56Context),
678  .capabilities = CODEC_CAP_DR1,
679 };
av_cold int ff_vp56_free(AVCodecContext *avctx)
Definition: vp56.c:702
const struct AVCodec * codec
Definition: avcodec.h:1063
static void vp6_coeff_order_table_init(VP56Context *s)
Definition: vp6.c:178
uint8_t coeff_ract[2][3][6][11]
Definition: vp56.h:114
static const uint8_t vp6_ract_pct[3][2][6][11]
Definition: vp6data.h:95
static av_cold int vp6_decode_init(AVCodecContext *avctx)
Definition: vp6.c:606
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
Definition: error.h:54
#define FF_HUFFMAN_FLAG_HNODE_FIRST
Definition: huffman.h:38
static const uint8_t vp6_runv_pct[2][14]
Definition: vp6data.h:90
int size
static int vp6_build_huff_tree(VP56Context *s, uint8_t coeff_model[], const uint8_t *map, unsigned size, VLC *vlc)
Definition: vp6.c:238
uint8_t coeff_index_to_pos[64]
Definition: vp56.h:107
VP5 and VP6 compatible video decoder (common features)
static const int16_t vp6_block_copy_filter[17][8][4]
Definition: vp6data.h:151
static unsigned int get_bits(GetBitContext *s, int n)
Read 1-25 bits.
Definition: get_bits.h:240
static const uint8_t vp6_def_fdv_vector_model[2][8]
Definition: vp6data.h:33
int ff_set_dimensions(AVCodecContext *s, int width, int height)
Check that the provided frame dimensions are valid and set them on the codec context.
Definition: utils.c:144
const uint8_t ff_vp56_coeff_bias[]
Definition: vp56data.c:67
uint8_t coeff_dccv[2][11]
Definition: vp56.h:113
uint8_t mb_types_stats[3][10][2]
Definition: vp56.h:119
uint8_t vector_sig[2]
Definition: vp56.h:108
uint8_t vector_fdv[2][8]
Definition: vp56.h:112
#define VP56_SIZE_CHANGE
Definition: vp56.h:71
uint8_t run
Definition: svq3.c:142
static const uint8_t vp6_huff_coeff_map[]
Definition: vp6data.h:304
int stride
Definition: mace.c:144
av_cold int ff_vp56_init(AVCodecContext *avctx, int flip, int has_alpha)
Definition: vp56.c:653
AVCodec.
Definition: avcodec.h:2755
int ff_huff_build_tree(AVCodecContext *avctx, VLC *vlc, int nb_codes, Node *nodes, HuffCmp cmp, int flags)
nodes size must be 2*nb_codes first nb_codes nodes.count must be set
Definition: huffman.c:135
static void vp6_filter(VP56Context *s, uint8_t *dst, uint8_t *src, int offset1, int offset2, int stride, VP56mv mv, int mask, int select, int luma)
Definition: vp6.c:556
#define FFALIGN(x, a)
Definition: common.h:62
Definition: huffman.h:32
static const uint8_t vp6_def_runv_coeff_model[2][14]
Definition: vp6data.h:54
int16_t y
Definition: vp56.h:68
static int decode(MimicContext *ctx, int quality, int num_coeffs, int is_iframe)
Definition: mimic.c:269
uint8_t
#define av_cold
Definition: attributes.h:66
float delta
#define b
Definition: input.c:52
static const uint8_t vp6_def_coeff_reorder[]
Definition: vp6data.h:43
static int vp6_parse_coeff_models(VP56Context *s)
Definition: vp6.c:259
#define CODEC_CAP_DR1
Codec uses get_buffer() for allocating buffers and supports custom allocators.
Definition: avcodec.h:711
#define VP6_MAX_HUFF_SIZE
Definition: vp6.c:41
int pt
Definition: rtp.c:34
bitstream reader API header.
static const uint8_t vp6_dccv_pct[2][11]
Definition: vp6data.h:74
static av_always_inline int vp56_rac_get_tree(VP56RangeCoder *c, const VP56Tree *tree, const uint8_t *probs)
Definition: vp56.h:355
uint8_t coeff_reorder[64]
Definition: vp56.h:106
static int get_bits_left(GetBitContext *gb)
Definition: get_bits.h:555
enum AVCodecID id
Definition: avcodec.h:2769
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
Definition: log.h:123
static const uint16_t mask[17]
Definition: lzw.c:38
#define AV_RB16
Definition: intreadwrite.h:53
#define NULL_IF_CONFIG_SMALL(x)
Return NULL if CONFIG_SMALL is true, otherwise the argument without modification. ...
Definition: internal.h:142
static av_always_inline int vp56_rac_get(VP56RangeCoder *c)
Definition: vp56.h:279
void av_log(void *avcl, int level, const char *fmt,...)
Definition: log.c:148
const char * name
Name of the codec implementation.
Definition: avcodec.h:2762
void ff_vp56_init_dequant(VP56Context *s, int quantizer)
Definition: vp56.c:34
AVCodec ff_vp6_decoder
Definition: vp6.c:643
const uint8_t ff_vp56_b6to4[]
Definition: vp56data.c:29
Definition: get_bits.h:64
static int vp6_huff_cmp(const void *va, const void *vb)
Definition: vp6.c:232
static void vp6_parse_vector_models(VP56Context *s)
Definition: vp6.c:207
VP5 and VP6 compatible video decoder (common data)
static av_unused int vp56_rac_gets_nn(VP56RangeCoder *c, int bits)
Definition: vp56.h:342
static void vp6_filter_diag2(VP56Context *s, uint8_t *dst, uint8_t *src, int stride, int h_weight, int v_weight)
Definition: vp6.c:548
AVCodec ff_vp6f_decoder
Definition: vp6.c:656
#define FFMIN(a, b)
Definition: common.h:57
VP6 compatible video decoder.
static void vp6_default_models_init(VP56Context *s)
Definition: vp6.c:189
static const uint8_t vp6_huff_run_map[]
Definition: vp6data.h:308
static void vp6_parse_coeff_huffman(VP56Context *s)
Definition: vp6.c:382
int ff_vp56_decode_frame(AVCodecContext *avctx, void *data, int *got_frame, AVPacket *avpkt)
Definition: vp56.c:492
const uint8_t ff_vp56_coeff_bit_length[]
Definition: vp56data.c:68
#define FFABS(a)
Definition: common.h:52
static av_always_inline int get_vlc2(GetBitContext *s, VLC_TYPE(*table)[2], int bits, int max_depth)
Parse a vlc code.
Definition: get_bits.h:522
#define vp56_rac_get_prob
Definition: vp56.h:244
static const VP56Tree vp6_pcr_tree[]
Definition: vp6data.h:290
static void permute(int16_t dst[64], const int16_t src[64], int perm)
Definition: dct-test.c:201
static void vp6_filter_hv4(uint8_t *dst, uint8_t *src, int stride, int delta, const int16_t *weights)
Definition: vp6.c:531
uint8_t coeff_runv[2][14]
Definition: vp56.h:117
#define AVERROR_PATCHWELCOME
Not yet implemented in Libav, patches welcome.
Definition: error.h:57
static const int8_t mv[256][2]
Definition: 4xm.c:72
Libavcodec external API header.
static int vp6_parse_header(VP56Context *s, const uint8_t *buf, int buf_size, int *golden_frame)
Definition: vp6.c:46
static const uint8_t vp6_coeff_reorder_pct[]
Definition: vp6data.h:79
const VP56Tree ff_vp56_pc_tree[]
Definition: vp56data.c:59
main external API structure.
Definition: avcodec.h:1054
static void vp6_parse_coeff(VP56Context *s)
Definition: vp6.c:441
static void close(AVCodecParserContext *s)
Definition: h264_parser.c:489
static const uint8_t vp6_fdv_pct[2][8]
Definition: vp6data.h:69
static const uint8_t vp6_coord_div[]
Definition: vp6data.h:302
static unsigned vp6_get_nb_null(VP56Context *s)
Read number of consecutive blocks with null DC or AC.
Definition: vp6.c:370
static const uint8_t vp6_sig_dct_pct[2][2]
Definition: vp6data.h:59
const uint8_t ff_vp56_coeff_parse_table[6][11]
Definition: vp56data.c:31
uint8_t coeff_dcct[2][36][5]
Definition: vp56.h:116
static unsigned int get_bits1(GetBitContext *s)
Definition: get_bits.h:271
static av_cold int vp6_decode_free(AVCodecContext *avctx)
Definition: vp6.c:626
static int init_get_bits(GetBitContext *s, const uint8_t *buffer, int bit_size)
Initialize GetBitContext.
Definition: get_bits.h:375
huffman tree builder and VLC generator
int16_t sym
Definition: huffman.h:33
void avpriv_report_missing_feature(void *avc, const char *msg,...) av_printf_format(2
Log a generic warning message about a missing feature.
void ff_vp56_init_range_decoder(VP56RangeCoder *c, const uint8_t *buf, int buf_size)
Definition: vp56rac.c:40
Definition: vp56.h:66
static const int vp6_dccv_lc[3][5][2]
Definition: vp6data.h:134
const VP56Tree ff_vp56_pva_tree[]
Definition: vp56data.c:49
int16_t x
Definition: vp56.h:67
common internal api header.
static void vp6_parse_vector_adjustment(VP56Context *s, VP56mv *vect)
Definition: vp6.c:328
static av_cold int init(AVCodecParserContext *s)
Definition: h264_parser.c:498
void * priv_data
Definition: avcodec.h:1090
static const uint8_t vp6_coeff_groups[]
Definition: vp6data.h:140
static av_unused int vp56_rac_gets(VP56RangeCoder *c, int bits)
Definition: vp56.h:303
static const uint8_t vp6_def_pdv_vector_model[2][7]
Definition: vp6data.h:38
VLC_TYPE(* table)[2]
code, bits
Definition: get_bits.h:66
uint8_t vector_pdv[2][7]
Definition: vp56.h:111
uint32_t count
Definition: huffman.h:35
static void comp(unsigned char *dst, int dst_stride, unsigned char *src, int src_stride, int add)
Definition: eamad.c:77
const uint8_t ff_vp56_def_mb_types_stats[3][10][2]
Definition: vp56data.c:40
AVCodec ff_vp6a_decoder
Definition: vp6.c:669
void ff_free_vlc(VLC *vlc)
Definition: bitstream.c:333
static const uint8_t vp6_pdv_pct[2][7]
Definition: vp6data.h:64
uint8_t vector_dct[2]
Definition: vp56.h:109
static int vp6_block_variance(uint8_t *src, int stride)
Definition: vp6.c:516