summaryrefslogtreecommitdiff
path: root/libavcodec/vp6.c (plain)
blob: 645fc5c690e03d2f30f945433d4d1356236fa446
1/*
2 * Copyright (C) 2006 Aurelien Jacobs <aurel@gnuage.org>
3 *
4 * This file is part of FFmpeg.
5 *
6 * FFmpeg 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 * FFmpeg 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 FFmpeg; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21/**
22 * @file
23 * VP6 compatible video decoder
24 *
25 * The VP6F decoder accepts an optional 1 byte extradata. It is composed of:
26 * - upper 4 bits: difference between encoded width and visible width
27 * - lower 4 bits: difference between encoded height and visible height
28 */
29
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
43static int vp6_parse_coeff(VP56Context *s);
44static int vp6_parse_coeff_huffman(VP56Context *s);
45
46static int vp6_parse_header(VP56Context *s, const uint8_t *buf, int buf_size)
47{
48 VP56RangeCoder *c = &s->c;
49 int parse_filter_info = 0;
50 int coeff_offset = 0;
51 int vrt_shift = 0;
52 int sub_version;
53 int rows, cols;
54 int res = 0;
55 int ret;
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 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 ret = ff_vp56_init_range_decoder(c, buf+6, buf_size-6);
110 if (ret < 0)
111 goto fail;
112 vp56_rac_gets(c, 2);
113
114 parse_filter_info = s->filter_header;
115 if (sub_version < 8)
116 vrt_shift = 5;
117 s->sub_version = sub_version;
118 s->golden_frame = 0;
119 } else {
120 if (!s->sub_version || !s->avctx->coded_width || !s->avctx->coded_height)
121 return AVERROR_INVALIDDATA;
122
123 if (separated_coeff || !s->filter_header) {
124 coeff_offset = AV_RB16(buf+1) - 2;
125 buf += 2;
126 buf_size -= 2;
127 }
128 ret = ff_vp56_init_range_decoder(c, buf+1, buf_size-1);
129 if (ret < 0)
130 return ret;
131
132 s->golden_frame = vp56_rac_get(c);
133 if (s->filter_header) {
134 s->deblock_filtering = vp56_rac_get(c);
135 if (s->deblock_filtering)
136 vp56_rac_get(c);
137 if (s->sub_version > 7)
138 parse_filter_info = vp56_rac_get(c);
139 }
140 }
141
142 if (parse_filter_info) {
143 if (vp56_rac_get(c)) {
144 s->filter_mode = 2;
145 s->sample_variance_threshold = vp56_rac_gets(c, 5) << vrt_shift;
146 s->max_vector_length = 2 << vp56_rac_gets(c, 3);
147 } else if (vp56_rac_get(c)) {
148 s->filter_mode = 1;
149 } else {
150 s->filter_mode = 0;
151 }
152 if (s->sub_version > 7)
153 s->filter_selection = vp56_rac_gets(c, 4);
154 else
155 s->filter_selection = 16;
156 }
157
158 s->use_huffman = vp56_rac_get(c);
159
160 s->parse_coeff = vp6_parse_coeff;
161 if (coeff_offset) {
162 buf += coeff_offset;
163 buf_size -= coeff_offset;
164 if (buf_size < 0) {
165 ret = AVERROR_INVALIDDATA;
166 goto fail;
167 }
168 if (s->use_huffman) {
169 s->parse_coeff = vp6_parse_coeff_huffman;
170 init_get_bits(&s->gb, buf, buf_size<<3);
171 } else {
172 ret = ff_vp56_init_range_decoder(&s->cc, buf, buf_size);
173 if (ret < 0)
174 goto fail;
175 s->ccp = &s->cc;
176 }
177 } else {
178 s->ccp = &s->c;
179 }
180
181 return res;
182fail:
183 if (res == VP56_SIZE_CHANGE)
184 ff_set_dimensions(s->avctx, 0, 0);
185 return ret;
186}
187
188static void vp6_coeff_order_table_init(VP56Context *s)
189{
190 int i, pos, idx = 1;
191
192 s->modelp->coeff_index_to_pos[0] = 0;
193 for (i=0; i<16; i++)
194 for (pos=1; pos<64; pos++)
195 if (s->modelp->coeff_reorder[pos] == i)
196 s->modelp->coeff_index_to_pos[idx++] = pos;
197}
198
199static void vp6_default_models_init(VP56Context *s)
200{
201 VP56Model *model = s->modelp;
202
203 model->vector_dct[0] = 0xA2;
204 model->vector_dct[1] = 0xA4;
205 model->vector_sig[0] = 0x80;
206 model->vector_sig[1] = 0x80;
207
208 memcpy(model->mb_types_stats, ff_vp56_def_mb_types_stats, sizeof(model->mb_types_stats));
209 memcpy(model->vector_fdv, vp6_def_fdv_vector_model, sizeof(model->vector_fdv));
210 memcpy(model->vector_pdv, vp6_def_pdv_vector_model, sizeof(model->vector_pdv));
211 memcpy(model->coeff_runv, vp6_def_runv_coeff_model, sizeof(model->coeff_runv));
212 memcpy(model->coeff_reorder, vp6_def_coeff_reorder, sizeof(model->coeff_reorder));
213
214 vp6_coeff_order_table_init(s);
215}
216
217static void vp6_parse_vector_models(VP56Context *s)
218{
219 VP56RangeCoder *c = &s->c;
220 VP56Model *model = s->modelp;
221 int comp, node;
222
223 for (comp=0; comp<2; comp++) {
224 if (vp56_rac_get_prob_branchy(c, vp6_sig_dct_pct[comp][0]))
225 model->vector_dct[comp] = vp56_rac_gets_nn(c, 7);
226 if (vp56_rac_get_prob_branchy(c, vp6_sig_dct_pct[comp][1]))
227 model->vector_sig[comp] = vp56_rac_gets_nn(c, 7);
228 }
229
230 for (comp=0; comp<2; comp++)
231 for (node=0; node<7; node++)
232 if (vp56_rac_get_prob_branchy(c, vp6_pdv_pct[comp][node]))
233 model->vector_pdv[comp][node] = vp56_rac_gets_nn(c, 7);
234
235 for (comp=0; comp<2; comp++)
236 for (node=0; node<8; node++)
237 if (vp56_rac_get_prob_branchy(c, vp6_fdv_pct[comp][node]))
238 model->vector_fdv[comp][node] = vp56_rac_gets_nn(c, 7);
239}
240
241/* nodes must ascend by count, but with descending symbol order */
242static int vp6_huff_cmp(const void *va, const void *vb)
243{
244 const Node *a = va, *b = vb;
245 return (a->count - b->count)*16 + (b->sym - a->sym);
246}
247
248static int vp6_build_huff_tree(VP56Context *s, uint8_t coeff_model[],
249 const uint8_t *map, unsigned size, VLC *vlc)
250{
251 Node nodes[2*VP6_MAX_HUFF_SIZE], *tmp = &nodes[size];
252 int a, b, i;
253
254 /* first compute probabilities from model */
255 tmp[0].count = 256;
256 for (i=0; i<size-1; i++) {
257 a = tmp[i].count * coeff_model[i] >> 8;
258 b = tmp[i].count * (255 - coeff_model[i]) >> 8;
259 nodes[map[2*i ]].count = a + !a;
260 nodes[map[2*i+1]].count = b + !b;
261 }
262
263 ff_free_vlc(vlc);
264 /* then build the huffman tree according to probabilities */
265 return ff_huff_build_tree(s->avctx, vlc, size, FF_HUFFMAN_BITS,
266 nodes, vp6_huff_cmp,
267 FF_HUFFMAN_FLAG_HNODE_FIRST);
268}
269
270static int vp6_parse_coeff_models(VP56Context *s)
271{
272 VP56RangeCoder *c = &s->c;
273 VP56Model *model = s->modelp;
274 int def_prob[11];
275 int node, cg, ctx, pos;
276 int ct; /* code type */
277 int pt; /* plane type (0 for Y, 1 for U or V) */
278
279 memset(def_prob, 0x80, sizeof(def_prob));
280
281 for (pt=0; pt<2; pt++)
282 for (node=0; node<11; node++)
283 if (vp56_rac_get_prob_branchy(c, vp6_dccv_pct[pt][node])) {
284 def_prob[node] = vp56_rac_gets_nn(c, 7);
285 model->coeff_dccv[pt][node] = def_prob[node];
286 } else if (s->frames[VP56_FRAME_CURRENT]->key_frame) {
287 model->coeff_dccv[pt][node] = def_prob[node];
288 }
289
290 if (vp56_rac_get(c)) {
291 for (pos=1; pos<64; pos++)
292 if (vp56_rac_get_prob_branchy(c, vp6_coeff_reorder_pct[pos]))
293 model->coeff_reorder[pos] = vp56_rac_gets(c, 4);
294 vp6_coeff_order_table_init(s);
295 }
296
297 for (cg=0; cg<2; cg++)
298 for (node=0; node<14; node++)
299 if (vp56_rac_get_prob_branchy(c, vp6_runv_pct[cg][node]))
300 model->coeff_runv[cg][node] = vp56_rac_gets_nn(c, 7);
301
302 for (ct=0; ct<3; ct++)
303 for (pt=0; pt<2; pt++)
304 for (cg=0; cg<6; cg++)
305 for (node=0; node<11; node++)
306 if (vp56_rac_get_prob_branchy(c, vp6_ract_pct[ct][pt][cg][node])) {
307 def_prob[node] = vp56_rac_gets_nn(c, 7);
308 model->coeff_ract[pt][ct][cg][node] = def_prob[node];
309 } else if (s->frames[VP56_FRAME_CURRENT]->key_frame) {
310 model->coeff_ract[pt][ct][cg][node] = def_prob[node];
311 }
312
313 if (s->use_huffman) {
314 for (pt=0; pt<2; pt++) {
315 if (vp6_build_huff_tree(s, model->coeff_dccv[pt],
316 vp6_huff_coeff_map, 12, &s->dccv_vlc[pt]))
317 return -1;
318 if (vp6_build_huff_tree(s, model->coeff_runv[pt],
319 vp6_huff_run_map, 9, &s->runv_vlc[pt]))
320 return -1;
321 for (ct=0; ct<3; ct++)
322 for (cg = 0; cg < 6; cg++)
323 if (vp6_build_huff_tree(s, model->coeff_ract[pt][ct][cg],
324 vp6_huff_coeff_map, 12,
325 &s->ract_vlc[pt][ct][cg]))
326 return -1;
327 }
328 memset(s->nb_null, 0, sizeof(s->nb_null));
329 } else {
330 /* coeff_dcct is a linear combination of coeff_dccv */
331 for (pt=0; pt<2; pt++)
332 for (ctx=0; ctx<3; ctx++)
333 for (node=0; node<5; node++)
334 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);
335 }
336 return 0;
337}
338
339static void vp6_parse_vector_adjustment(VP56Context *s, VP56mv *vect)
340{
341 VP56RangeCoder *c = &s->c;
342 VP56Model *model = s->modelp;
343 int comp;
344
345 *vect = (VP56mv) {0,0};
346 if (s->vector_candidate_pos < 2)
347 *vect = s->vector_candidate[0];
348
349 for (comp=0; comp<2; comp++) {
350 int i, delta = 0;
351
352 if (vp56_rac_get_prob_branchy(c, model->vector_dct[comp])) {
353 static const uint8_t prob_order[] = {0, 1, 2, 7, 6, 5, 4};
354 for (i=0; i<sizeof(prob_order); i++) {
355 int j = prob_order[i];
356 delta |= vp56_rac_get_prob(c, model->vector_fdv[comp][j])<<j;
357 }
358 if (delta & 0xF0)
359 delta |= vp56_rac_get_prob(c, model->vector_fdv[comp][3])<<3;
360 else
361 delta |= 8;
362 } else {
363 delta = vp56_rac_get_tree(c, ff_vp56_pva_tree,
364 model->vector_pdv[comp]);
365 }
366
367 if (delta && vp56_rac_get_prob_branchy(c, model->vector_sig[comp]))
368 delta = -delta;
369
370 if (!comp)
371 vect->x += delta;
372 else
373 vect->y += delta;
374 }
375}
376
377/**
378 * Read number of consecutive blocks with null DC or AC.
379 * This value is < 74.
380 */
381static unsigned vp6_get_nb_null(VP56Context *s)
382{
383 unsigned val = get_bits(&s->gb, 2);
384 if (val == 2)
385 val += get_bits(&s->gb, 2);
386 else if (val == 3) {
387 val = get_bits1(&s->gb) << 2;
388 val = 6+val + get_bits(&s->gb, 2+val);
389 }
390 return val;
391}
392
393static int vp6_parse_coeff_huffman(VP56Context *s)
394{
395 VP56Model *model = s->modelp;
396 uint8_t *permute = s->idct_scantable;
397 VLC *vlc_coeff;
398 int coeff, sign, coeff_idx;
399 int b, cg, idx;
400 int pt = 0; /* plane type (0 for Y, 1 for U or V) */
401
402 for (b=0; b<6; b++) {
403 int ct = 0; /* code type */
404 if (b > 3) pt = 1;
405 vlc_coeff = &s->dccv_vlc[pt];
406
407 for (coeff_idx = 0;;) {
408 int run = 1;
409 if (coeff_idx<2 && s->nb_null[coeff_idx][pt]) {
410 s->nb_null[coeff_idx][pt]--;
411 if (coeff_idx)
412 break;
413 } else {
414 if (get_bits_left(&s->gb) <= 0)
415 return AVERROR_INVALIDDATA;
416 coeff = get_vlc2(&s->gb, vlc_coeff->table, FF_HUFFMAN_BITS, 3);
417 if (coeff == 0) {
418 if (coeff_idx) {
419 int pt = (coeff_idx >= 6);
420 run += get_vlc2(&s->gb, s->runv_vlc[pt].table, FF_HUFFMAN_BITS, 3);
421 if (run >= 9)
422 run += get_bits(&s->gb, 6);
423 } else
424 s->nb_null[0][pt] = vp6_get_nb_null(s);
425 ct = 0;
426 } else if (coeff == 11) { /* end of block */
427 if (coeff_idx == 1) /* first AC coeff ? */
428 s->nb_null[1][pt] = vp6_get_nb_null(s);
429 break;
430 } else {
431 int coeff2 = ff_vp56_coeff_bias[coeff];
432 if (coeff > 4)
433 coeff2 += get_bits(&s->gb, coeff <= 9 ? coeff - 4 : 11);
434 ct = 1 + (coeff2 > 1);
435 sign = get_bits1(&s->gb);
436 coeff2 = (coeff2 ^ -sign) + sign;
437 if (coeff_idx)
438 coeff2 *= s->dequant_ac;
439 idx = model->coeff_index_to_pos[coeff_idx];
440 s->block_coeff[b][permute[idx]] = coeff2;
441 }
442 }
443 coeff_idx+=run;
444 if (coeff_idx >= 64)
445 break;
446 cg = FFMIN(vp6_coeff_groups[coeff_idx], 3);
447 vlc_coeff = &s->ract_vlc[pt][ct][cg];
448 }
449 }
450 return 0;
451}
452
453static int vp6_parse_coeff(VP56Context *s)
454{
455 VP56RangeCoder *c = s->ccp;
456 VP56Model *model = s->modelp;
457 uint8_t *permute = s->idct_scantable;
458 uint8_t *model1, *model2, *model3;
459 int coeff, sign, coeff_idx;
460 int b, i, cg, idx, ctx;
461 int pt = 0; /* plane type (0 for Y, 1 for U or V) */
462
463 if (c->end <= c->buffer && c->bits >= 0) {
464 av_log(s->avctx, AV_LOG_ERROR, "End of AC stream reached in vp6_parse_coeff\n");
465 return AVERROR_INVALIDDATA;
466 }
467
468 for (b=0; b<6; b++) {
469 int ct = 1; /* code type */
470 int run = 1;
471
472 if (b > 3) pt = 1;
473
474 ctx = s->left_block[ff_vp56_b6to4[b]].not_null_dc
475 + s->above_blocks[s->above_block_idx[b]].not_null_dc;
476 model1 = model->coeff_dccv[pt];
477 model2 = model->coeff_dcct[pt][ctx];
478
479 coeff_idx = 0;
480 for (;;) {
481 if ((coeff_idx>1 && ct==0) || vp56_rac_get_prob_branchy(c, model2[0])) {
482 /* parse a coeff */
483 if (vp56_rac_get_prob_branchy(c, model2[2])) {
484 if (vp56_rac_get_prob_branchy(c, model2[3])) {
485 idx = vp56_rac_get_tree(c, ff_vp56_pc_tree, model1);
486 coeff = ff_vp56_coeff_bias[idx+5];
487 for (i=ff_vp56_coeff_bit_length[idx]; i>=0; i--)
488 coeff += vp56_rac_get_prob(c, ff_vp56_coeff_parse_table[idx][i]) << i;
489 } else {
490 if (vp56_rac_get_prob_branchy(c, model2[4]))
491 coeff = 3 + vp56_rac_get_prob(c, model1[5]);
492 else
493 coeff = 2;
494 }
495 ct = 2;
496 } else {
497 ct = 1;
498 coeff = 1;
499 }
500 sign = vp56_rac_get(c);
501 coeff = (coeff ^ -sign) + sign;
502 if (coeff_idx)
503 coeff *= s->dequant_ac;
504 idx = model->coeff_index_to_pos[coeff_idx];
505 s->block_coeff[b][permute[idx]] = coeff;
506 run = 1;
507 } else {
508 /* parse a run */
509 ct = 0;
510 if (coeff_idx > 0) {
511 if (!vp56_rac_get_prob_branchy(c, model2[1]))
512 break;
513
514 model3 = model->coeff_runv[coeff_idx >= 6];
515 run = vp56_rac_get_tree(c, vp6_pcr_tree, model3);
516 if (!run)
517 for (run=9, i=0; i<6; i++)
518 run += vp56_rac_get_prob(c, model3[i+8]) << i;
519 }
520 }
521 coeff_idx += run;
522 if (coeff_idx >= 64)
523 break;
524 cg = vp6_coeff_groups[coeff_idx];
525 model1 = model2 = model->coeff_ract[pt][ct][cg];
526 }
527
528 s->left_block[ff_vp56_b6to4[b]].not_null_dc =
529 s->above_blocks[s->above_block_idx[b]].not_null_dc = !!s->block_coeff[b][0];
530 }
531 return 0;
532}
533
534static int vp6_block_variance(uint8_t *src, ptrdiff_t stride)
535{
536 int sum = 0, square_sum = 0;
537 int y, x;
538
539 for (y=0; y<8; y+=2) {
540 for (x=0; x<8; x+=2) {
541 sum += src[x];
542 square_sum += src[x]*src[x];
543 }
544 src += 2*stride;
545 }
546 return (16*square_sum - sum*sum) >> 8;
547}
548
549static void vp6_filter_hv4(uint8_t *dst, uint8_t *src, ptrdiff_t stride,
550 int delta, const int16_t *weights)
551{
552 int x, y;
553
554 for (y=0; y<8; y++) {
555 for (x=0; x<8; x++) {
556 dst[x] = av_clip_uint8(( src[x-delta ] * weights[0]
557 + src[x ] * weights[1]
558 + src[x+delta ] * weights[2]
559 + src[x+2*delta] * weights[3] + 64) >> 7);
560 }
561 src += stride;
562 dst += stride;
563 }
564}
565
566static void vp6_filter_diag2(VP56Context *s, uint8_t *dst, uint8_t *src,
567 ptrdiff_t stride, int h_weight, int v_weight)
568{
569 uint8_t *tmp = s->edge_emu_buffer+16;
570 s->h264chroma.put_h264_chroma_pixels_tab[0](tmp, src, stride, 9, h_weight, 0);
571 s->h264chroma.put_h264_chroma_pixels_tab[0](dst, tmp, stride, 8, 0, v_weight);
572}
573
574static void vp6_filter(VP56Context *s, uint8_t *dst, uint8_t *src,
575 int offset1, int offset2, ptrdiff_t stride,
576 VP56mv mv, int mask, int select, int luma)
577{
578 int filter4 = 0;
579 int x8 = mv.x & mask;
580 int y8 = mv.y & mask;
581
582 if (luma) {
583 x8 *= 2;
584 y8 *= 2;
585 filter4 = s->filter_mode;
586 if (filter4 == 2) {
587 if (s->max_vector_length &&
588 (FFABS(mv.x) > s->max_vector_length ||
589 FFABS(mv.y) > s->max_vector_length)) {
590 filter4 = 0;
591 } else if (s->sample_variance_threshold
592 && (vp6_block_variance(src+offset1, stride)
593 < s->sample_variance_threshold)) {
594 filter4 = 0;
595 }
596 }
597 }
598
599 if ((y8 && (offset2-offset1)*s->flip<0) || (!y8 && offset1 > offset2)) {
600 offset1 = offset2;
601 }
602
603 if (filter4) {
604 if (!y8) { /* left or right combine */
605 vp6_filter_hv4(dst, src+offset1, stride, 1,
606 vp6_block_copy_filter[select][x8]);
607 } else if (!x8) { /* above or below combine */
608 vp6_filter_hv4(dst, src+offset1, stride, stride,
609 vp6_block_copy_filter[select][y8]);
610 } else {
611 s->vp56dsp.vp6_filter_diag4(dst, src+offset1+((mv.x^mv.y)>>31), stride,
612 vp6_block_copy_filter[select][x8],
613 vp6_block_copy_filter[select][y8]);
614 }
615 } else {
616 if (!x8 || !y8) {
617 s->h264chroma.put_h264_chroma_pixels_tab[0](dst, src + offset1, stride, 8, x8, y8);
618 } else {
619 vp6_filter_diag2(s, dst, src+offset1 + ((mv.x^mv.y)>>31), stride, x8, y8);
620 }
621 }
622}
623
624static av_cold void vp6_decode_init_context(VP56Context *s);
625
626static av_cold int vp6_decode_init(AVCodecContext *avctx)
627{
628 VP56Context *s = avctx->priv_data;
629 int ret;
630
631 if ((ret = ff_vp56_init(avctx, avctx->codec->id == AV_CODEC_ID_VP6,
632 avctx->codec->id == AV_CODEC_ID_VP6A)) < 0)
633 return ret;
634 ff_vp6dsp_init(&s->vp56dsp);
635
636 vp6_decode_init_context(s);
637
638 if (s->has_alpha) {
639 s->alpha_context = av_mallocz(sizeof(VP56Context));
640 ff_vp56_init_context(avctx, s->alpha_context,
641 s->flip == -1, s->has_alpha);
642 ff_vp6dsp_init(&s->alpha_context->vp56dsp);
643 vp6_decode_init_context(s->alpha_context);
644 }
645
646 return 0;
647}
648
649static av_cold void vp6_decode_init_context(VP56Context *s)
650{
651 s->deblock_filtering = 0;
652 s->vp56_coord_div = vp6_coord_div;
653 s->parse_vector_adjustment = vp6_parse_vector_adjustment;
654 s->filter = vp6_filter;
655 s->default_models_init = vp6_default_models_init;
656 s->parse_vector_models = vp6_parse_vector_models;
657 s->parse_coeff_models = vp6_parse_coeff_models;
658 s->parse_header = vp6_parse_header;
659}
660
661static av_cold void vp6_decode_free_context(VP56Context *s);
662
663static av_cold int vp6_decode_free(AVCodecContext *avctx)
664{
665 VP56Context *s = avctx->priv_data;
666
667 ff_vp56_free(avctx);
668 vp6_decode_free_context(s);
669
670 if (s->alpha_context) {
671 ff_vp56_free_context(s->alpha_context);
672 vp6_decode_free_context(s->alpha_context);
673 av_freep(&s->alpha_context);
674 }
675
676 return 0;
677}
678
679static av_cold void vp6_decode_free_context(VP56Context *s)
680{
681 int pt, ct, cg;
682
683 for (pt=0; pt<2; pt++) {
684 ff_free_vlc(&s->dccv_vlc[pt]);
685 ff_free_vlc(&s->runv_vlc[pt]);
686 for (ct=0; ct<3; ct++)
687 for (cg=0; cg<6; cg++)
688 ff_free_vlc(&s->ract_vlc[pt][ct][cg]);
689 }
690}
691
692AVCodec ff_vp6_decoder = {
693 .name = "vp6",
694 .long_name = NULL_IF_CONFIG_SMALL("On2 VP6"),
695 .type = AVMEDIA_TYPE_VIDEO,
696 .id = AV_CODEC_ID_VP6,
697 .priv_data_size = sizeof(VP56Context),
698 .init = vp6_decode_init,
699 .close = vp6_decode_free,
700 .decode = ff_vp56_decode_frame,
701 .capabilities = AV_CODEC_CAP_DR1,
702};
703
704/* flash version, not flipped upside-down */
705AVCodec ff_vp6f_decoder = {
706 .name = "vp6f",
707 .long_name = NULL_IF_CONFIG_SMALL("On2 VP6 (Flash version)"),
708 .type = AVMEDIA_TYPE_VIDEO,
709 .id = AV_CODEC_ID_VP6F,
710 .priv_data_size = sizeof(VP56Context),
711 .init = vp6_decode_init,
712 .close = vp6_decode_free,
713 .decode = ff_vp56_decode_frame,
714 .capabilities = AV_CODEC_CAP_DR1,
715};
716
717/* flash version, not flipped upside-down, with alpha channel */
718AVCodec ff_vp6a_decoder = {
719 .name = "vp6a",
720 .long_name = NULL_IF_CONFIG_SMALL("On2 VP6 (Flash version, with alpha channel)"),
721 .type = AVMEDIA_TYPE_VIDEO,
722 .id = AV_CODEC_ID_VP6A,
723 .priv_data_size = sizeof(VP56Context),
724 .init = vp6_decode_init,
725 .close = vp6_decode_free,
726 .decode = ff_vp56_decode_frame,
727 .capabilities = AV_CODEC_CAP_DR1 | AV_CODEC_CAP_SLICE_THREADS,
728};
729
generated by cgit at 2024-05-17 01:47:12 (GMT)