2 * Copyright (C) 2003-2004 the ffmpeg project
4 * This file is part of FFmpeg.
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.
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.
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
23 * On2 VP3 Video Decoder
25 * VP3 Video Decoder by Mike Melanson (mike at multimedia.cx)
26 * For more information about the VP3 coding process, visit:
27 * http://wiki.multimedia.cx/index.php?title=On2_VP3
29 * Theora decoder by Alex Beregszaszi
39 #include "bitstream.h"
44 #define FRAGMENT_PIXELS 8
46 typedef struct Coeff {
52 //FIXME split things out into their own arrays
53 typedef struct Vp3Fragment {
55 /* address of first pixel taking into account which plane the fragment
56 * lives on as well as the plane stride */
58 /* this is the macroblock that the fragment belongs to */
60 uint8_t coding_method;
65 #define SB_NOT_CODED 0
66 #define SB_PARTIALLY_CODED 1
67 #define SB_FULLY_CODED 2
69 #define MODE_INTER_NO_MV 0
71 #define MODE_INTER_PLUS_MV 2
72 #define MODE_INTER_LAST_MV 3
73 #define MODE_INTER_PRIOR_LAST 4
74 #define MODE_USING_GOLDEN 5
75 #define MODE_GOLDEN_MV 6
76 #define MODE_INTER_FOURMV 7
77 #define CODING_MODE_COUNT 8
79 /* special internal mode */
82 /* There are 6 preset schemes, plus a free-form scheme */
83 static const int ModeAlphabet[6][CODING_MODE_COUNT] =
85 /* scheme 1: Last motion vector dominates */
86 { MODE_INTER_LAST_MV, MODE_INTER_PRIOR_LAST,
87 MODE_INTER_PLUS_MV, MODE_INTER_NO_MV,
88 MODE_INTRA, MODE_USING_GOLDEN,
89 MODE_GOLDEN_MV, MODE_INTER_FOURMV },
92 { MODE_INTER_LAST_MV, MODE_INTER_PRIOR_LAST,
93 MODE_INTER_NO_MV, MODE_INTER_PLUS_MV,
94 MODE_INTRA, MODE_USING_GOLDEN,
95 MODE_GOLDEN_MV, MODE_INTER_FOURMV },
98 { MODE_INTER_LAST_MV, MODE_INTER_PLUS_MV,
99 MODE_INTER_PRIOR_LAST, MODE_INTER_NO_MV,
100 MODE_INTRA, MODE_USING_GOLDEN,
101 MODE_GOLDEN_MV, MODE_INTER_FOURMV },
104 { MODE_INTER_LAST_MV, MODE_INTER_PLUS_MV,
105 MODE_INTER_NO_MV, MODE_INTER_PRIOR_LAST,
106 MODE_INTRA, MODE_USING_GOLDEN,
107 MODE_GOLDEN_MV, MODE_INTER_FOURMV },
109 /* scheme 5: No motion vector dominates */
110 { MODE_INTER_NO_MV, MODE_INTER_LAST_MV,
111 MODE_INTER_PRIOR_LAST, MODE_INTER_PLUS_MV,
112 MODE_INTRA, MODE_USING_GOLDEN,
113 MODE_GOLDEN_MV, MODE_INTER_FOURMV },
116 { MODE_INTER_NO_MV, MODE_USING_GOLDEN,
117 MODE_INTER_LAST_MV, MODE_INTER_PRIOR_LAST,
118 MODE_INTER_PLUS_MV, MODE_INTRA,
119 MODE_GOLDEN_MV, MODE_INTER_FOURMV },
123 #define MIN_DEQUANT_VAL 2
125 typedef struct Vp3DecodeContext {
126 AVCodecContext *avctx;
127 int theora, theora_tables;
130 AVFrame golden_frame;
132 AVFrame current_frame;
140 int last_quality_index;
142 int superblock_count;
143 int y_superblock_width;
144 int y_superblock_height;
145 int c_superblock_width;
146 int c_superblock_height;
147 int u_superblock_start;
148 int v_superblock_start;
149 unsigned char *superblock_coding;
151 int macroblock_count;
152 int macroblock_width;
153 int macroblock_height;
159 Vp3Fragment *all_fragments;
160 uint8_t *coeff_counts;
163 int fragment_start[3];
168 uint16_t coded_dc_scale_factor[64];
169 uint32_t coded_ac_scale_factor[64];
170 uint8_t base_matrix[384][64];
171 uint8_t qr_count[2][3];
172 uint8_t qr_size [2][3][64];
173 uint16_t qr_base[2][3][64];
175 /* this is a list of indexes into the all_fragments array indicating
176 * which of the fragments are coded */
177 int *coded_fragment_list;
178 int coded_fragment_list_index;
179 int pixel_addresses_initialized;
187 VLC superblock_run_length_vlc;
188 VLC fragment_run_length_vlc;
190 VLC motion_vector_vlc;
192 /* these arrays need to be on 16-byte boundaries since SSE2 operations
194 DECLARE_ALIGNED_16(int16_t, qmat[2][4][64]); //<qmat[is_inter][plane]
196 /* This table contains superblock_count * 16 entries. Each set of 16
197 * numbers corresponds to the fragment indexes 0..15 of the superblock.
198 * An entry will be -1 to indicate that no entry corresponds to that
200 int *superblock_fragments;
202 /* This table contains superblock_count * 4 entries. Each set of 4
203 * numbers corresponds to the macroblock indexes 0..3 of the superblock.
204 * An entry will be -1 to indicate that no entry corresponds to that
206 int *superblock_macroblocks;
208 /* This table contains macroblock_count * 6 entries. Each set of 6
209 * numbers corresponds to the fragment indexes 0..5 which comprise
210 * the macroblock (4 Y fragments and 2 C fragments). */
211 int *macroblock_fragments;
212 /* This is an array that indicates how a particular macroblock
214 unsigned char *macroblock_coding;
216 int first_coded_y_fragment;
217 int first_coded_c_fragment;
218 int last_coded_y_fragment;
219 int last_coded_c_fragment;
221 uint8_t edge_emu_buffer[9*2048]; //FIXME dynamic alloc
222 int8_t qscale_table[2048]; //FIXME dynamic alloc (width+15)/16
229 uint16_t huffman_table[80][32][2];
231 uint8_t filter_limit_values[64];
232 int bounding_values_array[256];
235 /************************************************************************
236 * VP3 specific functions
237 ************************************************************************/
240 * This function sets up all of the various blocks mappings:
241 * superblocks <-> fragments, macroblocks <-> fragments,
242 * superblocks <-> macroblocks
244 * Returns 0 is successful; returns 1 if *anything* went wrong.
246 static int init_block_mapping(Vp3DecodeContext *s)
249 signed int hilbert_walk_mb[4];
251 int current_fragment = 0;
252 int current_width = 0;
253 int current_height = 0;
256 int superblock_row_inc = 0;
258 int mapping_index = 0;
260 int current_macroblock;
263 signed char travel_width[16] = {
270 signed char travel_height[16] = {
277 signed char travel_width_mb[4] = {
281 signed char travel_height_mb[4] = {
285 hilbert_walk_mb[0] = 1;
286 hilbert_walk_mb[1] = s->macroblock_width;
287 hilbert_walk_mb[2] = 1;
288 hilbert_walk_mb[3] = -s->macroblock_width;
290 /* iterate through each superblock (all planes) and map the fragments */
291 for (i = 0; i < s->superblock_count; i++) {
292 /* time to re-assign the limits? */
295 /* start of Y superblocks */
296 right_edge = s->fragment_width;
297 bottom_edge = s->fragment_height;
300 superblock_row_inc = 3 * s->fragment_width -
301 (s->y_superblock_width * 4 - s->fragment_width);
303 /* the first operation for this variable is to advance by 1 */
304 current_fragment = -1;
306 } else if (i == s->u_superblock_start) {
308 /* start of U superblocks */
309 right_edge = s->fragment_width / 2;
310 bottom_edge = s->fragment_height / 2;
313 superblock_row_inc = 3 * (s->fragment_width / 2) -
314 (s->c_superblock_width * 4 - s->fragment_width / 2);
316 /* the first operation for this variable is to advance by 1 */
317 current_fragment = s->fragment_start[1] - 1;
319 } else if (i == s->v_superblock_start) {
321 /* start of V superblocks */
322 right_edge = s->fragment_width / 2;
323 bottom_edge = s->fragment_height / 2;
326 superblock_row_inc = 3 * (s->fragment_width / 2) -
327 (s->c_superblock_width * 4 - s->fragment_width / 2);
329 /* the first operation for this variable is to advance by 1 */
330 current_fragment = s->fragment_start[2] - 1;
334 if (current_width >= right_edge - 1) {
335 /* reset width and move to next superblock row */
339 /* fragment is now at the start of a new superblock row */
340 current_fragment += superblock_row_inc;
343 /* iterate through all 16 fragments in a superblock */
344 for (j = 0; j < 16; j++) {
345 current_fragment += travel_width[j] + right_edge * travel_height[j];
346 current_width += travel_width[j];
347 current_height += travel_height[j];
349 /* check if the fragment is in bounds */
350 if ((current_width < right_edge) &&
351 (current_height < bottom_edge)) {
352 s->superblock_fragments[mapping_index] = current_fragment;
354 s->superblock_fragments[mapping_index] = -1;
361 /* initialize the superblock <-> macroblock mapping; iterate through
362 * all of the Y plane superblocks to build this mapping */
363 right_edge = s->macroblock_width;
364 bottom_edge = s->macroblock_height;
367 superblock_row_inc = s->macroblock_width -
368 (s->y_superblock_width * 2 - s->macroblock_width);
369 hilbert = hilbert_walk_mb;
371 current_macroblock = -1;
372 for (i = 0; i < s->u_superblock_start; i++) {
374 if (current_width >= right_edge - 1) {
375 /* reset width and move to next superblock row */
379 /* macroblock is now at the start of a new superblock row */
380 current_macroblock += superblock_row_inc;
383 /* iterate through each potential macroblock in the superblock */
384 for (j = 0; j < 4; j++) {
385 current_macroblock += hilbert_walk_mb[j];
386 current_width += travel_width_mb[j];
387 current_height += travel_height_mb[j];
389 /* check if the macroblock is in bounds */
390 if ((current_width < right_edge) &&
391 (current_height < bottom_edge)) {
392 s->superblock_macroblocks[mapping_index] = current_macroblock;
394 s->superblock_macroblocks[mapping_index] = -1;
401 /* initialize the macroblock <-> fragment mapping */
402 current_fragment = 0;
403 current_macroblock = 0;
405 for (i = 0; i < s->fragment_height; i += 2) {
407 for (j = 0; j < s->fragment_width; j += 2) {
409 s->all_fragments[current_fragment].macroblock = current_macroblock;
410 s->macroblock_fragments[mapping_index++] = current_fragment;
412 if (j + 1 < s->fragment_width) {
413 s->all_fragments[current_fragment + 1].macroblock = current_macroblock;
414 s->macroblock_fragments[mapping_index++] = current_fragment + 1;
416 s->macroblock_fragments[mapping_index++] = -1;
418 if (i + 1 < s->fragment_height) {
419 s->all_fragments[current_fragment + s->fragment_width].macroblock =
421 s->macroblock_fragments[mapping_index++] =
422 current_fragment + s->fragment_width;
424 s->macroblock_fragments[mapping_index++] = -1;
426 if ((j + 1 < s->fragment_width) && (i + 1 < s->fragment_height)) {
427 s->all_fragments[current_fragment + s->fragment_width + 1].macroblock =
429 s->macroblock_fragments[mapping_index++] =
430 current_fragment + s->fragment_width + 1;
432 s->macroblock_fragments[mapping_index++] = -1;
435 c_fragment = s->fragment_start[1] +
436 (i * s->fragment_width / 4) + (j / 2);
437 s->all_fragments[c_fragment].macroblock = s->macroblock_count;
438 s->macroblock_fragments[mapping_index++] = c_fragment;
440 c_fragment = s->fragment_start[2] +
441 (i * s->fragment_width / 4) + (j / 2);
442 s->all_fragments[c_fragment].macroblock = s->macroblock_count;
443 s->macroblock_fragments[mapping_index++] = c_fragment;
445 if (j + 2 <= s->fragment_width)
446 current_fragment += 2;
449 current_macroblock++;
452 current_fragment += s->fragment_width;
455 return 0; /* successful path out */
459 * This function wipes out all of the fragment data.
461 static void init_frame(Vp3DecodeContext *s, GetBitContext *gb)
465 /* zero out all of the fragment information */
466 s->coded_fragment_list_index = 0;
467 for (i = 0; i < s->fragment_count; i++) {
468 s->coeff_counts[i] = 0;
469 s->all_fragments[i].motion_x = 127;
470 s->all_fragments[i].motion_y = 127;
471 s->all_fragments[i].next_coeff= NULL;
473 s->coeffs[i].coeff=0;
474 s->coeffs[i].next= NULL;
479 * This function sets up the dequantization tables used for a particular
482 static void init_dequantizer(Vp3DecodeContext *s)
484 int ac_scale_factor = s->coded_ac_scale_factor[s->quality_index];
485 int dc_scale_factor = s->coded_dc_scale_factor[s->quality_index];
486 int i, plane, inter, qri, bmi, bmj, qistart;
488 for(inter=0; inter<2; inter++){
489 for(plane=0; plane<3; plane++){
491 for(qri=0; qri<s->qr_count[inter][plane]; qri++){
492 sum+= s->qr_size[inter][plane][qri];
493 if(s->quality_index <= sum)
496 qistart= sum - s->qr_size[inter][plane][qri];
497 bmi= s->qr_base[inter][plane][qri ];
498 bmj= s->qr_base[inter][plane][qri+1];
500 int coeff= ( 2*(sum -s->quality_index)*s->base_matrix[bmi][i]
501 - 2*(qistart-s->quality_index)*s->base_matrix[bmj][i]
502 + s->qr_size[inter][plane][qri])
503 / (2*s->qr_size[inter][plane][qri]);
505 int qmin= 8<<(inter + !i);
506 int qscale= i ? ac_scale_factor : dc_scale_factor;
508 s->qmat[inter][plane][s->dsp.idct_permutation[i]]= av_clip((qscale * coeff)/100 * 4, qmin, 4096);
513 memset(s->qscale_table, (FFMAX(s->qmat[0][0][1], s->qmat[0][1][1])+8)/16, 512); //FIXME finetune
517 * This function initializes the loop filter boundary limits if the frame's
518 * quality index is different from the previous frame's.
520 static void init_loop_filter(Vp3DecodeContext *s)
522 int *bounding_values= s->bounding_values_array+127;
526 filter_limit = s->filter_limit_values[s->quality_index];
528 /* set up the bounding values */
529 memset(s->bounding_values_array, 0, 256 * sizeof(int));
530 for (x = 0; x < filter_limit; x++) {
531 bounding_values[-x - filter_limit] = -filter_limit + x;
532 bounding_values[-x] = -x;
533 bounding_values[x] = x;
534 bounding_values[x + filter_limit] = filter_limit - x;
539 * This function unpacks all of the superblock/macroblock/fragment coding
540 * information from the bitstream.
542 static int unpack_superblocks(Vp3DecodeContext *s, GetBitContext *gb)
545 int current_superblock = 0;
547 int decode_fully_flags = 0;
548 int decode_partial_blocks = 0;
549 int first_c_fragment_seen;
552 int current_fragment;
555 memset(s->superblock_coding, SB_FULLY_CODED, s->superblock_count);
559 /* unpack the list of partially-coded superblocks */
561 /* toggle the bit because as soon as the first run length is
562 * fetched the bit will be toggled again */
564 while (current_superblock < s->superblock_count) {
565 if (current_run-- == 0) {
567 current_run = get_vlc2(gb,
568 s->superblock_run_length_vlc.table, 6, 2);
569 if (current_run == 33)
570 current_run += get_bits(gb, 12);
572 /* if any of the superblocks are not partially coded, flag
573 * a boolean to decode the list of fully-coded superblocks */
575 decode_fully_flags = 1;
578 /* make a note of the fact that there are partially coded
580 decode_partial_blocks = 1;
583 s->superblock_coding[current_superblock++] = bit;
586 /* unpack the list of fully coded superblocks if any of the blocks were
587 * not marked as partially coded in the previous step */
588 if (decode_fully_flags) {
590 current_superblock = 0;
593 /* toggle the bit because as soon as the first run length is
594 * fetched the bit will be toggled again */
596 while (current_superblock < s->superblock_count) {
598 /* skip any superblocks already marked as partially coded */
599 if (s->superblock_coding[current_superblock] == SB_NOT_CODED) {
601 if (current_run-- == 0) {
603 current_run = get_vlc2(gb,
604 s->superblock_run_length_vlc.table, 6, 2);
605 if (current_run == 33)
606 current_run += get_bits(gb, 12);
608 s->superblock_coding[current_superblock] = 2*bit;
610 current_superblock++;
614 /* if there were partial blocks, initialize bitstream for
615 * unpacking fragment codings */
616 if (decode_partial_blocks) {
620 /* toggle the bit because as soon as the first run length is
621 * fetched the bit will be toggled again */
626 /* figure out which fragments are coded; iterate through each
627 * superblock (all planes) */
628 s->coded_fragment_list_index = 0;
629 s->next_coeff= s->coeffs + s->fragment_count;
630 s->first_coded_y_fragment = s->first_coded_c_fragment = 0;
631 s->last_coded_y_fragment = s->last_coded_c_fragment = -1;
632 first_c_fragment_seen = 0;
633 memset(s->macroblock_coding, MODE_COPY, s->macroblock_count);
634 for (i = 0; i < s->superblock_count; i++) {
636 /* iterate through all 16 fragments in a superblock */
637 for (j = 0; j < 16; j++) {
639 /* if the fragment is in bounds, check its coding status */
640 current_fragment = s->superblock_fragments[i * 16 + j];
641 if (current_fragment >= s->fragment_count) {
642 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_superblocks(): bad fragment number (%d >= %d)\n",
643 current_fragment, s->fragment_count);
646 if (current_fragment != -1) {
647 if (s->superblock_coding[i] == SB_NOT_CODED) {
649 /* copy all the fragments from the prior frame */
650 s->all_fragments[current_fragment].coding_method =
653 } else if (s->superblock_coding[i] == SB_PARTIALLY_CODED) {
655 /* fragment may or may not be coded; this is the case
656 * that cares about the fragment coding runs */
657 if (current_run-- == 0) {
659 current_run = get_vlc2(gb,
660 s->fragment_run_length_vlc.table, 5, 2);
664 /* default mode; actual mode will be decoded in
666 s->all_fragments[current_fragment].coding_method =
668 s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
669 s->coded_fragment_list[s->coded_fragment_list_index] =
671 if ((current_fragment >= s->fragment_start[1]) &&
672 (s->last_coded_y_fragment == -1) &&
673 (!first_c_fragment_seen)) {
674 s->first_coded_c_fragment = s->coded_fragment_list_index;
675 s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
676 first_c_fragment_seen = 1;
678 s->coded_fragment_list_index++;
679 s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
681 /* not coded; copy this fragment from the prior frame */
682 s->all_fragments[current_fragment].coding_method =
688 /* fragments are fully coded in this superblock; actual
689 * coding will be determined in next step */
690 s->all_fragments[current_fragment].coding_method =
692 s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
693 s->coded_fragment_list[s->coded_fragment_list_index] =
695 if ((current_fragment >= s->fragment_start[1]) &&
696 (s->last_coded_y_fragment == -1) &&
697 (!first_c_fragment_seen)) {
698 s->first_coded_c_fragment = s->coded_fragment_list_index;
699 s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
700 first_c_fragment_seen = 1;
702 s->coded_fragment_list_index++;
703 s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
709 if (!first_c_fragment_seen)
710 /* only Y fragments coded in this frame */
711 s->last_coded_y_fragment = s->coded_fragment_list_index - 1;
713 /* end the list of coded C fragments */
714 s->last_coded_c_fragment = s->coded_fragment_list_index - 1;
720 * This function unpacks all the coding mode data for individual macroblocks
721 * from the bitstream.
723 static int unpack_modes(Vp3DecodeContext *s, GetBitContext *gb)
727 int current_macroblock;
728 int current_fragment;
730 int custom_mode_alphabet[CODING_MODE_COUNT];
733 for (i = 0; i < s->fragment_count; i++)
734 s->all_fragments[i].coding_method = MODE_INTRA;
738 /* fetch the mode coding scheme for this frame */
739 scheme = get_bits(gb, 3);
741 /* is it a custom coding scheme? */
743 for (i = 0; i < 8; i++)
744 custom_mode_alphabet[get_bits(gb, 3)] = i;
747 /* iterate through all of the macroblocks that contain 1 or more
749 for (i = 0; i < s->u_superblock_start; i++) {
751 for (j = 0; j < 4; j++) {
752 current_macroblock = s->superblock_macroblocks[i * 4 + j];
753 if ((current_macroblock == -1) ||
754 (s->macroblock_coding[current_macroblock] == MODE_COPY))
756 if (current_macroblock >= s->macroblock_count) {
757 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_modes(): bad macroblock number (%d >= %d)\n",
758 current_macroblock, s->macroblock_count);
762 /* mode 7 means get 3 bits for each coding mode */
764 coding_mode = get_bits(gb, 3);
766 coding_mode = custom_mode_alphabet
767 [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
769 coding_mode = ModeAlphabet[scheme-1]
770 [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
772 s->macroblock_coding[current_macroblock] = coding_mode;
773 for (k = 0; k < 6; k++) {
775 s->macroblock_fragments[current_macroblock * 6 + k];
776 if (current_fragment == -1)
778 if (current_fragment >= s->fragment_count) {
779 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_modes(): bad fragment number (%d >= %d)\n",
780 current_fragment, s->fragment_count);
783 if (s->all_fragments[current_fragment].coding_method !=
785 s->all_fragments[current_fragment].coding_method =
796 * This function unpacks all the motion vectors for the individual
797 * macroblocks from the bitstream.
799 static int unpack_vectors(Vp3DecodeContext *s, GetBitContext *gb)
805 int last_motion_x = 0;
806 int last_motion_y = 0;
807 int prior_last_motion_x = 0;
808 int prior_last_motion_y = 0;
809 int current_macroblock;
810 int current_fragment;
815 memset(motion_x, 0, 6 * sizeof(int));
816 memset(motion_y, 0, 6 * sizeof(int));
818 /* coding mode 0 is the VLC scheme; 1 is the fixed code scheme */
819 coding_mode = get_bits1(gb);
821 /* iterate through all of the macroblocks that contain 1 or more
823 for (i = 0; i < s->u_superblock_start; i++) {
825 for (j = 0; j < 4; j++) {
826 current_macroblock = s->superblock_macroblocks[i * 4 + j];
827 if ((current_macroblock == -1) ||
828 (s->macroblock_coding[current_macroblock] == MODE_COPY))
830 if (current_macroblock >= s->macroblock_count) {
831 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_vectors(): bad macroblock number (%d >= %d)\n",
832 current_macroblock, s->macroblock_count);
836 current_fragment = s->macroblock_fragments[current_macroblock * 6];
837 if (current_fragment >= s->fragment_count) {
838 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_vectors(): bad fragment number (%d >= %d\n",
839 current_fragment, s->fragment_count);
842 switch (s->macroblock_coding[current_macroblock]) {
844 case MODE_INTER_PLUS_MV:
846 /* all 6 fragments use the same motion vector */
847 if (coding_mode == 0) {
848 motion_x[0] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
849 motion_y[0] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
851 motion_x[0] = fixed_motion_vector_table[get_bits(gb, 6)];
852 motion_y[0] = fixed_motion_vector_table[get_bits(gb, 6)];
855 for (k = 1; k < 6; k++) {
856 motion_x[k] = motion_x[0];
857 motion_y[k] = motion_y[0];
860 /* vector maintenance, only on MODE_INTER_PLUS_MV */
861 if (s->macroblock_coding[current_macroblock] ==
862 MODE_INTER_PLUS_MV) {
863 prior_last_motion_x = last_motion_x;
864 prior_last_motion_y = last_motion_y;
865 last_motion_x = motion_x[0];
866 last_motion_y = motion_y[0];
870 case MODE_INTER_FOURMV:
871 /* vector maintenance */
872 prior_last_motion_x = last_motion_x;
873 prior_last_motion_y = last_motion_y;
875 /* fetch 4 vectors from the bitstream, one for each
876 * Y fragment, then average for the C fragment vectors */
877 motion_x[4] = motion_y[4] = 0;
878 for (k = 0; k < 4; k++) {
879 for (l = 0; l < s->coded_fragment_list_index; l++)
880 if (s->coded_fragment_list[l] == s->macroblock_fragments[6*current_macroblock + k])
882 if (l < s->coded_fragment_list_index) {
883 if (coding_mode == 0) {
884 motion_x[k] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
885 motion_y[k] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
887 motion_x[k] = fixed_motion_vector_table[get_bits(gb, 6)];
888 motion_y[k] = fixed_motion_vector_table[get_bits(gb, 6)];
890 last_motion_x = motion_x[k];
891 last_motion_y = motion_y[k];
896 motion_x[4] += motion_x[k];
897 motion_y[4] += motion_y[k];
901 motion_x[4]= RSHIFT(motion_x[4], 2);
903 motion_y[4]= RSHIFT(motion_y[4], 2);
906 case MODE_INTER_LAST_MV:
907 /* all 6 fragments use the last motion vector */
908 motion_x[0] = last_motion_x;
909 motion_y[0] = last_motion_y;
910 for (k = 1; k < 6; k++) {
911 motion_x[k] = motion_x[0];
912 motion_y[k] = motion_y[0];
915 /* no vector maintenance (last vector remains the
919 case MODE_INTER_PRIOR_LAST:
920 /* all 6 fragments use the motion vector prior to the
921 * last motion vector */
922 motion_x[0] = prior_last_motion_x;
923 motion_y[0] = prior_last_motion_y;
924 for (k = 1; k < 6; k++) {
925 motion_x[k] = motion_x[0];
926 motion_y[k] = motion_y[0];
929 /* vector maintenance */
930 prior_last_motion_x = last_motion_x;
931 prior_last_motion_y = last_motion_y;
932 last_motion_x = motion_x[0];
933 last_motion_y = motion_y[0];
937 /* covers intra, inter without MV, golden without MV */
938 memset(motion_x, 0, 6 * sizeof(int));
939 memset(motion_y, 0, 6 * sizeof(int));
941 /* no vector maintenance */
945 /* assign the motion vectors to the correct fragments */
946 for (k = 0; k < 6; k++) {
948 s->macroblock_fragments[current_macroblock * 6 + k];
949 if (current_fragment == -1)
951 if (current_fragment >= s->fragment_count) {
952 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_vectors(): bad fragment number (%d >= %d)\n",
953 current_fragment, s->fragment_count);
956 s->all_fragments[current_fragment].motion_x = motion_x[k];
957 s->all_fragments[current_fragment].motion_y = motion_y[k];
966 * This function is called by unpack_dct_coeffs() to extract the VLCs from
967 * the bitstream. The VLCs encode tokens which are used to unpack DCT
968 * data. This function unpacks all the VLCs for either the Y plane or both
969 * C planes, and is called for DC coefficients or different AC coefficient
970 * levels (since different coefficient types require different VLC tables.
972 * This function returns a residual eob run. E.g, if a particular token gave
973 * instructions to EOB the next 5 fragments and there were only 2 fragments
974 * left in the current fragment range, 3 would be returned so that it could
975 * be passed into the next call to this same function.
977 static int unpack_vlcs(Vp3DecodeContext *s, GetBitContext *gb,
978 VLC *table, int coeff_index,
979 int first_fragment, int last_fragment,
986 Vp3Fragment *fragment;
987 uint8_t *perm= s->scantable.permutated;
990 if ((first_fragment >= s->fragment_count) ||
991 (last_fragment >= s->fragment_count)) {
993 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_vlcs(): bad fragment number (%d -> %d ?)\n",
994 first_fragment, last_fragment);
998 for (i = first_fragment; i <= last_fragment; i++) {
999 int fragment_num = s->coded_fragment_list[i];
1001 if (s->coeff_counts[fragment_num] > coeff_index)
1003 fragment = &s->all_fragments[fragment_num];
1006 /* decode a VLC into a token */
1007 token = get_vlc2(gb, table->table, 5, 3);
1008 /* use the token to get a zero run, a coefficient, and an eob run */
1010 eob_run = eob_run_base[token];
1011 if (eob_run_get_bits[token])
1012 eob_run += get_bits(gb, eob_run_get_bits[token]);
1013 coeff = zero_run = 0;
1015 bits_to_get = coeff_get_bits[token];
1017 coeff = coeff_tables[token][0];
1019 coeff = coeff_tables[token][get_bits(gb, bits_to_get)];
1021 zero_run = zero_run_base[token];
1022 if (zero_run_get_bits[token])
1023 zero_run += get_bits(gb, zero_run_get_bits[token]);
1028 s->coeff_counts[fragment_num] += zero_run;
1029 if (s->coeff_counts[fragment_num] < 64){
1030 fragment->next_coeff->coeff= coeff;
1031 fragment->next_coeff->index= perm[s->coeff_counts[fragment_num]++]; //FIXME perm here already?
1032 fragment->next_coeff->next= s->next_coeff;
1033 s->next_coeff->next=NULL;
1034 fragment->next_coeff= s->next_coeff++;
1037 s->coeff_counts[fragment_num] |= 128;
1046 * This function unpacks all of the DCT coefficient data from the
1049 static int unpack_dct_coeffs(Vp3DecodeContext *s, GetBitContext *gb)
1056 int residual_eob_run = 0;
1058 /* fetch the DC table indexes */
1059 dc_y_table = get_bits(gb, 4);
1060 dc_c_table = get_bits(gb, 4);
1062 /* unpack the Y plane DC coefficients */
1063 residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_y_table], 0,
1064 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1066 /* unpack the C plane DC coefficients */
1067 residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_c_table], 0,
1068 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1070 /* fetch the AC table indexes */
1071 ac_y_table = get_bits(gb, 4);
1072 ac_c_table = get_bits(gb, 4);
1074 /* unpack the group 1 AC coefficients (coeffs 1-5) */
1075 for (i = 1; i <= 5; i++) {
1076 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_y_table], i,
1077 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1079 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_c_table], i,
1080 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1083 /* unpack the group 2 AC coefficients (coeffs 6-14) */
1084 for (i = 6; i <= 14; i++) {
1085 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_y_table], i,
1086 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1088 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_c_table], i,
1089 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1092 /* unpack the group 3 AC coefficients (coeffs 15-27) */
1093 for (i = 15; i <= 27; i++) {
1094 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_y_table], i,
1095 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1097 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_c_table], i,
1098 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1101 /* unpack the group 4 AC coefficients (coeffs 28-63) */
1102 for (i = 28; i <= 63; i++) {
1103 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_y_table], i,
1104 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1106 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_c_table], i,
1107 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1114 * This function reverses the DC prediction for each coded fragment in
1115 * the frame. Much of this function is adapted directly from the original
1118 #define COMPATIBLE_FRAME(x) \
1119 (compatible_frame[s->all_fragments[x].coding_method] == current_frame_type)
1120 #define FRAME_CODED(x) (s->all_fragments[x].coding_method != MODE_COPY)
1121 #define DC_COEFF(u) (s->coeffs[u].index ? 0 : s->coeffs[u].coeff) //FIXME do somethin to simplify this
1123 static void reverse_dc_prediction(Vp3DecodeContext *s,
1126 int fragment_height)
1135 int i = first_fragment;
1139 /* DC values for the left, up-left, up, and up-right fragments */
1140 int vl, vul, vu, vur;
1142 /* indexes for the left, up-left, up, and up-right fragments */
1146 * The 6 fields mean:
1147 * 0: up-left multiplier
1149 * 2: up-right multiplier
1150 * 3: left multiplier
1152 int predictor_transform[16][4] = {
1154 { 0, 0, 0,128}, // PL
1155 { 0, 0,128, 0}, // PUR
1156 { 0, 0, 53, 75}, // PUR|PL
1157 { 0,128, 0, 0}, // PU
1158 { 0, 64, 0, 64}, // PU|PL
1159 { 0,128, 0, 0}, // PU|PUR
1160 { 0, 0, 53, 75}, // PU|PUR|PL
1161 {128, 0, 0, 0}, // PUL
1162 { 0, 0, 0,128}, // PUL|PL
1163 { 64, 0, 64, 0}, // PUL|PUR
1164 { 0, 0, 53, 75}, // PUL|PUR|PL
1165 { 0,128, 0, 0}, // PUL|PU
1166 {-104,116, 0,116}, // PUL|PU|PL
1167 { 24, 80, 24, 0}, // PUL|PU|PUR
1168 {-104,116, 0,116} // PUL|PU|PUR|PL
1171 /* This table shows which types of blocks can use other blocks for
1172 * prediction. For example, INTRA is the only mode in this table to
1173 * have a frame number of 0. That means INTRA blocks can only predict
1174 * from other INTRA blocks. There are 2 golden frame coding types;
1175 * blocks encoding in these modes can only predict from other blocks
1176 * that were encoded with these 1 of these 2 modes. */
1177 unsigned char compatible_frame[8] = {
1178 1, /* MODE_INTER_NO_MV */
1180 1, /* MODE_INTER_PLUS_MV */
1181 1, /* MODE_INTER_LAST_MV */
1182 1, /* MODE_INTER_PRIOR_MV */
1183 2, /* MODE_USING_GOLDEN */
1184 2, /* MODE_GOLDEN_MV */
1185 1 /* MODE_INTER_FOUR_MV */
1187 int current_frame_type;
1189 /* there is a last DC predictor for each of the 3 frame types */
1194 vul = vu = vur = vl = 0;
1195 last_dc[0] = last_dc[1] = last_dc[2] = 0;
1197 /* for each fragment row... */
1198 for (y = 0; y < fragment_height; y++) {
1200 /* for each fragment in a row... */
1201 for (x = 0; x < fragment_width; x++, i++) {
1203 /* reverse prediction if this block was coded */
1204 if (s->all_fragments[i].coding_method != MODE_COPY) {
1206 current_frame_type =
1207 compatible_frame[s->all_fragments[i].coding_method];
1213 if(FRAME_CODED(l) && COMPATIBLE_FRAME(l))
1217 u= i-fragment_width;
1219 if(FRAME_CODED(u) && COMPATIBLE_FRAME(u))
1222 ul= i-fragment_width-1;
1224 if(FRAME_CODED(ul) && COMPATIBLE_FRAME(ul))
1227 if(x + 1 < fragment_width){
1228 ur= i-fragment_width+1;
1230 if(FRAME_CODED(ur) && COMPATIBLE_FRAME(ur))
1235 if (transform == 0) {
1237 /* if there were no fragments to predict from, use last
1239 predicted_dc = last_dc[current_frame_type];
1242 /* apply the appropriate predictor transform */
1244 (predictor_transform[transform][0] * vul) +
1245 (predictor_transform[transform][1] * vu) +
1246 (predictor_transform[transform][2] * vur) +
1247 (predictor_transform[transform][3] * vl);
1249 predicted_dc /= 128;
1251 /* check for outranging on the [ul u l] and
1252 * [ul u ur l] predictors */
1253 if ((transform == 13) || (transform == 15)) {
1254 if (FFABS(predicted_dc - vu) > 128)
1256 else if (FFABS(predicted_dc - vl) > 128)
1258 else if (FFABS(predicted_dc - vul) > 128)
1263 /* at long last, apply the predictor */
1264 if(s->coeffs[i].index){
1265 *s->next_coeff= s->coeffs[i];
1266 s->coeffs[i].index=0;
1267 s->coeffs[i].coeff=0;
1268 s->coeffs[i].next= s->next_coeff++;
1270 s->coeffs[i].coeff += predicted_dc;
1272 last_dc[current_frame_type] = DC_COEFF(i);
1273 if(DC_COEFF(i) && !(s->coeff_counts[i]&127)){
1274 s->coeff_counts[i]= 129;
1275 // s->all_fragments[i].next_coeff= s->next_coeff;
1276 s->coeffs[i].next= s->next_coeff;
1277 (s->next_coeff++)->next=NULL;
1285 * Perform the final rendering for a particular slice of data.
1286 * The slice number ranges from 0..(macroblock_height - 1).
1288 static void render_slice(Vp3DecodeContext *s, int slice)
1291 int16_t *dequantizer;
1292 DECLARE_ALIGNED_16(DCTELEM, block[64]);
1293 int motion_x = 0xdeadbeef, motion_y = 0xdeadbeef;
1294 int motion_halfpel_index;
1295 uint8_t *motion_source;
1297 int current_macroblock_entry = slice * s->macroblock_width * 6;
1299 if (slice >= s->macroblock_height)
1302 for (plane = 0; plane < 3; plane++) {
1303 uint8_t *output_plane = s->current_frame.data [plane];
1304 uint8_t * last_plane = s-> last_frame.data [plane];
1305 uint8_t *golden_plane = s-> golden_frame.data [plane];
1306 int stride = s->current_frame.linesize[plane];
1307 int plane_width = s->width >> !!plane;
1308 int plane_height = s->height >> !!plane;
1309 int y = slice * FRAGMENT_PIXELS << !plane ;
1310 int slice_height = y + (FRAGMENT_PIXELS << !plane);
1311 int i = s->macroblock_fragments[current_macroblock_entry + plane + 3*!!plane];
1313 if (!s->flipped_image) stride = -stride;
1316 if(FFABS(stride) > 2048)
1317 return; //various tables are fixed size
1319 /* for each fragment row in the slice (both of them)... */
1320 for (; y < slice_height; y += 8) {
1322 /* for each fragment in a row... */
1323 for (x = 0; x < plane_width; x += 8, i++) {
1325 if ((i < 0) || (i >= s->fragment_count)) {
1326 av_log(s->avctx, AV_LOG_ERROR, " vp3:render_slice(): bad fragment number (%d)\n", i);
1330 /* transform if this block was coded */
1331 if ((s->all_fragments[i].coding_method != MODE_COPY) &&
1332 !((s->avctx->flags & CODEC_FLAG_GRAY) && plane)) {
1334 if ((s->all_fragments[i].coding_method == MODE_USING_GOLDEN) ||
1335 (s->all_fragments[i].coding_method == MODE_GOLDEN_MV))
1336 motion_source= golden_plane;
1338 motion_source= last_plane;
1340 motion_source += s->all_fragments[i].first_pixel;
1341 motion_halfpel_index = 0;
1343 /* sort out the motion vector if this fragment is coded
1344 * using a motion vector method */
1345 if ((s->all_fragments[i].coding_method > MODE_INTRA) &&
1346 (s->all_fragments[i].coding_method != MODE_USING_GOLDEN)) {
1348 motion_x = s->all_fragments[i].motion_x;
1349 motion_y = s->all_fragments[i].motion_y;
1351 motion_x= (motion_x>>1) | (motion_x&1);
1352 motion_y= (motion_y>>1) | (motion_y&1);
1355 src_x= (motion_x>>1) + x;
1356 src_y= (motion_y>>1) + y;
1357 if ((motion_x == 127) || (motion_y == 127))
1358 av_log(s->avctx, AV_LOG_ERROR, " help! got invalid motion vector! (%X, %X)\n", motion_x, motion_y);
1360 motion_halfpel_index = motion_x & 0x01;
1361 motion_source += (motion_x >> 1);
1363 motion_halfpel_index |= (motion_y & 0x01) << 1;
1364 motion_source += ((motion_y >> 1) * stride);
1366 if(src_x<0 || src_y<0 || src_x + 9 >= plane_width || src_y + 9 >= plane_height){
1367 uint8_t *temp= s->edge_emu_buffer;
1368 if(stride<0) temp -= 9*stride;
1369 else temp += 9*stride;
1371 ff_emulated_edge_mc(temp, motion_source, stride, 9, 9, src_x, src_y, plane_width, plane_height);
1372 motion_source= temp;
1377 /* first, take care of copying a block from either the
1378 * previous or the golden frame */
1379 if (s->all_fragments[i].coding_method != MODE_INTRA) {
1380 /* Note, it is possible to implement all MC cases with
1381 put_no_rnd_pixels_l2 which would look more like the
1382 VP3 source but this would be slower as
1383 put_no_rnd_pixels_tab is better optimzed */
1384 if(motion_halfpel_index != 3){
1385 s->dsp.put_no_rnd_pixels_tab[1][motion_halfpel_index](
1386 output_plane + s->all_fragments[i].first_pixel,
1387 motion_source, stride, 8);
1389 int d= (motion_x ^ motion_y)>>31; // d is 0 if motion_x and _y have the same sign, else -1
1390 s->dsp.put_no_rnd_pixels_l2[1](
1391 output_plane + s->all_fragments[i].first_pixel,
1393 motion_source + stride + 1 + d,
1396 dequantizer = s->qmat[1][plane];
1398 dequantizer = s->qmat[0][plane];
1401 /* dequantize the DCT coefficients */
1402 if(s->avctx->idct_algo==FF_IDCT_VP3){
1403 Coeff *coeff= s->coeffs + i;
1404 memset(block, 0, sizeof(block));
1406 block[coeff->index]= coeff->coeff * dequantizer[coeff->index];
1410 Coeff *coeff= s->coeffs + i;
1411 memset(block, 0, sizeof(block));
1413 block[coeff->index]= (coeff->coeff * dequantizer[coeff->index] + 2)>>2;
1418 /* invert DCT and place (or add) in final output */
1420 if (s->all_fragments[i].coding_method == MODE_INTRA) {
1421 if(s->avctx->idct_algo!=FF_IDCT_VP3)
1424 output_plane + s->all_fragments[i].first_pixel,
1429 output_plane + s->all_fragments[i].first_pixel,
1435 /* copy directly from the previous frame */
1436 s->dsp.put_pixels_tab[1][0](
1437 output_plane + s->all_fragments[i].first_pixel,
1438 last_plane + s->all_fragments[i].first_pixel,
1443 /* perform the left edge filter if:
1444 * - the fragment is not on the left column
1445 * - the fragment is coded in this frame
1446 * - the fragment is not coded in this frame but the left
1447 * fragment is coded in this frame (this is done instead
1448 * of a right edge filter when rendering the left fragment
1449 * since this fragment is not available yet) */
1451 ((s->all_fragments[i].coding_method != MODE_COPY) ||
1452 ((s->all_fragments[i].coding_method == MODE_COPY) &&
1453 (s->all_fragments[i - 1].coding_method != MODE_COPY)) )) {
1455 output_plane + s->all_fragments[i].first_pixel + 7*stride,
1456 -stride, s->bounding_values_array + 127);
1459 /* perform the top edge filter if:
1460 * - the fragment is not on the top row
1461 * - the fragment is coded in this frame
1462 * - the fragment is not coded in this frame but the above
1463 * fragment is coded in this frame (this is done instead
1464 * of a bottom edge filter when rendering the above
1465 * fragment since this fragment is not available yet) */
1467 ((s->all_fragments[i].coding_method != MODE_COPY) ||
1468 ((s->all_fragments[i].coding_method == MODE_COPY) &&
1469 (s->all_fragments[i - fragment_width].coding_method != MODE_COPY)) )) {
1471 output_plane + s->all_fragments[i].first_pixel - stride,
1472 -stride, s->bounding_values_array + 127);
1479 /* this looks like a good place for slice dispatch... */
1481 * if (slice == s->macroblock_height - 1)
1482 * dispatch (both last slice & 2nd-to-last slice);
1483 * else if (slice > 0)
1484 * dispatch (slice - 1);
1490 static void apply_loop_filter(Vp3DecodeContext *s)
1494 int *bounding_values= s->bounding_values_array+127;
1497 int bounding_values_array[256];
1500 /* find the right loop limit value */
1501 for (x = 63; x >= 0; x--) {
1502 if (vp31_ac_scale_factor[x] >= s->quality_index)
1505 filter_limit = vp31_filter_limit_values[s->quality_index];
1507 /* set up the bounding values */
1508 memset(bounding_values_array, 0, 256 * sizeof(int));
1509 for (x = 0; x < filter_limit; x++) {
1510 bounding_values[-x - filter_limit] = -filter_limit + x;
1511 bounding_values[-x] = -x;
1512 bounding_values[x] = x;
1513 bounding_values[x + filter_limit] = filter_limit - x;
1517 for (plane = 0; plane < 3; plane++) {
1518 int width = s->fragment_width >> !!plane;
1519 int height = s->fragment_height >> !!plane;
1520 int fragment = s->fragment_start [plane];
1521 int stride = s->current_frame.linesize[plane];
1522 uint8_t *plane_data = s->current_frame.data [plane];
1523 if (!s->flipped_image) stride = -stride;
1525 for (y = 0; y < height; y++) {
1527 for (x = 0; x < width; x++) {
1528 /* do not perform left edge filter for left columns frags */
1530 (s->all_fragments[fragment].coding_method != MODE_COPY)) {
1531 s->dsp.vp3_h_loop_filter(
1532 plane_data + s->all_fragments[fragment].first_pixel,
1533 stride, bounding_values);
1536 /* do not perform top edge filter for top row fragments */
1538 (s->all_fragments[fragment].coding_method != MODE_COPY)) {
1539 s->dsp.vp3_v_loop_filter(
1540 plane_data + s->all_fragments[fragment].first_pixel,
1541 stride, bounding_values);
1544 /* do not perform right edge filter for right column
1545 * fragments or if right fragment neighbor is also coded
1546 * in this frame (it will be filtered in next iteration) */
1547 if ((x < width - 1) &&
1548 (s->all_fragments[fragment].coding_method != MODE_COPY) &&
1549 (s->all_fragments[fragment + 1].coding_method == MODE_COPY)) {
1550 s->dsp.vp3_h_loop_filter(
1551 plane_data + s->all_fragments[fragment + 1].first_pixel,
1552 stride, bounding_values);
1555 /* do not perform bottom edge filter for bottom row
1556 * fragments or if bottom fragment neighbor is also coded
1557 * in this frame (it will be filtered in the next row) */
1558 if ((y < height - 1) &&
1559 (s->all_fragments[fragment].coding_method != MODE_COPY) &&
1560 (s->all_fragments[fragment + width].coding_method == MODE_COPY)) {
1561 s->dsp.vp3_v_loop_filter(
1562 plane_data + s->all_fragments[fragment + width].first_pixel,
1563 stride, bounding_values);
1573 * This function computes the first pixel addresses for each fragment.
1574 * This function needs to be invoked after the first frame is allocated
1575 * so that it has access to the plane strides.
1577 static void vp3_calculate_pixel_addresses(Vp3DecodeContext *s)
1579 #define Y_INITIAL(chroma_shift) s->flipped_image ? 1 : s->fragment_height >> chroma_shift
1580 #define Y_FINISHED(chroma_shift) s->flipped_image ? y <= s->fragment_height >> chroma_shift : y > 0
1583 const int y_inc = s->flipped_image ? 1 : -1;
1585 /* figure out the first pixel addresses for each of the fragments */
1588 for (y = Y_INITIAL(0); Y_FINISHED(0); y += y_inc) {
1589 for (x = 0; x < s->fragment_width; x++) {
1590 s->all_fragments[i++].first_pixel =
1591 s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
1592 s->golden_frame.linesize[0] +
1593 x * FRAGMENT_PIXELS;
1598 i = s->fragment_start[1];
1599 for (y = Y_INITIAL(1); Y_FINISHED(1); y += y_inc) {
1600 for (x = 0; x < s->fragment_width / 2; x++) {
1601 s->all_fragments[i++].first_pixel =
1602 s->golden_frame.linesize[1] * y * FRAGMENT_PIXELS -
1603 s->golden_frame.linesize[1] +
1604 x * FRAGMENT_PIXELS;
1609 i = s->fragment_start[2];
1610 for (y = Y_INITIAL(1); Y_FINISHED(1); y += y_inc) {
1611 for (x = 0; x < s->fragment_width / 2; x++) {
1612 s->all_fragments[i++].first_pixel =
1613 s->golden_frame.linesize[2] * y * FRAGMENT_PIXELS -
1614 s->golden_frame.linesize[2] +
1615 x * FRAGMENT_PIXELS;
1621 * This is the ffmpeg/libavcodec API init function.
1623 static av_cold int vp3_decode_init(AVCodecContext *avctx)
1625 Vp3DecodeContext *s = avctx->priv_data;
1626 int i, inter, plane;
1629 int y_superblock_count;
1630 int c_superblock_count;
1632 if (avctx->codec_tag == MKTAG('V','P','3','0'))
1638 s->width = (avctx->width + 15) & 0xFFFFFFF0;
1639 s->height = (avctx->height + 15) & 0xFFFFFFF0;
1640 avctx->pix_fmt = PIX_FMT_YUV420P;
1641 if(avctx->idct_algo==FF_IDCT_AUTO)
1642 avctx->idct_algo=FF_IDCT_VP3;
1643 dsputil_init(&s->dsp, avctx);
1645 ff_init_scantable(s->dsp.idct_permutation, &s->scantable, ff_zigzag_direct);
1647 /* initialize to an impossible value which will force a recalculation
1648 * in the first frame decode */
1649 s->quality_index = -1;
1651 s->y_superblock_width = (s->width + 31) / 32;
1652 s->y_superblock_height = (s->height + 31) / 32;
1653 y_superblock_count = s->y_superblock_width * s->y_superblock_height;
1655 /* work out the dimensions for the C planes */
1656 c_width = s->width / 2;
1657 c_height = s->height / 2;
1658 s->c_superblock_width = (c_width + 31) / 32;
1659 s->c_superblock_height = (c_height + 31) / 32;
1660 c_superblock_count = s->c_superblock_width * s->c_superblock_height;
1662 s->superblock_count = y_superblock_count + (c_superblock_count * 2);
1663 s->u_superblock_start = y_superblock_count;
1664 s->v_superblock_start = s->u_superblock_start + c_superblock_count;
1665 s->superblock_coding = av_malloc(s->superblock_count);
1667 s->macroblock_width = (s->width + 15) / 16;
1668 s->macroblock_height = (s->height + 15) / 16;
1669 s->macroblock_count = s->macroblock_width * s->macroblock_height;
1671 s->fragment_width = s->width / FRAGMENT_PIXELS;
1672 s->fragment_height = s->height / FRAGMENT_PIXELS;
1674 /* fragment count covers all 8x8 blocks for all 3 planes */
1675 s->fragment_count = s->fragment_width * s->fragment_height * 3 / 2;
1676 s->fragment_start[1] = s->fragment_width * s->fragment_height;
1677 s->fragment_start[2] = s->fragment_width * s->fragment_height * 5 / 4;
1679 s->all_fragments = av_malloc(s->fragment_count * sizeof(Vp3Fragment));
1680 s->coeff_counts = av_malloc(s->fragment_count * sizeof(*s->coeff_counts));
1681 s->coeffs = av_malloc(s->fragment_count * sizeof(Coeff) * 65);
1682 s->coded_fragment_list = av_malloc(s->fragment_count * sizeof(int));
1683 s->pixel_addresses_initialized = 0;
1685 if (!s->theora_tables)
1687 for (i = 0; i < 64; i++) {
1688 s->coded_dc_scale_factor[i] = vp31_dc_scale_factor[i];
1689 s->coded_ac_scale_factor[i] = vp31_ac_scale_factor[i];
1690 s->base_matrix[0][i] = vp31_intra_y_dequant[i];
1691 s->base_matrix[1][i] = vp31_intra_c_dequant[i];
1692 s->base_matrix[2][i] = vp31_inter_dequant[i];
1693 s->filter_limit_values[i] = vp31_filter_limit_values[i];
1696 for(inter=0; inter<2; inter++){
1697 for(plane=0; plane<3; plane++){
1698 s->qr_count[inter][plane]= 1;
1699 s->qr_size [inter][plane][0]= 63;
1700 s->qr_base [inter][plane][0]=
1701 s->qr_base [inter][plane][1]= 2*inter + (!!plane)*!inter;
1705 /* init VLC tables */
1706 for (i = 0; i < 16; i++) {
1709 init_vlc(&s->dc_vlc[i], 5, 32,
1710 &dc_bias[i][0][1], 4, 2,
1711 &dc_bias[i][0][0], 4, 2, 0);
1713 /* group 1 AC histograms */
1714 init_vlc(&s->ac_vlc_1[i], 5, 32,
1715 &ac_bias_0[i][0][1], 4, 2,
1716 &ac_bias_0[i][0][0], 4, 2, 0);
1718 /* group 2 AC histograms */
1719 init_vlc(&s->ac_vlc_2[i], 5, 32,
1720 &ac_bias_1[i][0][1], 4, 2,
1721 &ac_bias_1[i][0][0], 4, 2, 0);
1723 /* group 3 AC histograms */
1724 init_vlc(&s->ac_vlc_3[i], 5, 32,
1725 &ac_bias_2[i][0][1], 4, 2,
1726 &ac_bias_2[i][0][0], 4, 2, 0);
1728 /* group 4 AC histograms */
1729 init_vlc(&s->ac_vlc_4[i], 5, 32,
1730 &ac_bias_3[i][0][1], 4, 2,
1731 &ac_bias_3[i][0][0], 4, 2, 0);
1734 for (i = 0; i < 16; i++) {
1737 init_vlc(&s->dc_vlc[i], 5, 32,
1738 &s->huffman_table[i][0][1], 4, 2,
1739 &s->huffman_table[i][0][0], 4, 2, 0);
1741 /* group 1 AC histograms */
1742 init_vlc(&s->ac_vlc_1[i], 5, 32,
1743 &s->huffman_table[i+16][0][1], 4, 2,
1744 &s->huffman_table[i+16][0][0], 4, 2, 0);
1746 /* group 2 AC histograms */
1747 init_vlc(&s->ac_vlc_2[i], 5, 32,
1748 &s->huffman_table[i+16*2][0][1], 4, 2,
1749 &s->huffman_table[i+16*2][0][0], 4, 2, 0);
1751 /* group 3 AC histograms */
1752 init_vlc(&s->ac_vlc_3[i], 5, 32,
1753 &s->huffman_table[i+16*3][0][1], 4, 2,
1754 &s->huffman_table[i+16*3][0][0], 4, 2, 0);
1756 /* group 4 AC histograms */
1757 init_vlc(&s->ac_vlc_4[i], 5, 32,
1758 &s->huffman_table[i+16*4][0][1], 4, 2,
1759 &s->huffman_table[i+16*4][0][0], 4, 2, 0);
1763 init_vlc(&s->superblock_run_length_vlc, 6, 34,
1764 &superblock_run_length_vlc_table[0][1], 4, 2,
1765 &superblock_run_length_vlc_table[0][0], 4, 2, 0);
1767 init_vlc(&s->fragment_run_length_vlc, 5, 30,
1768 &fragment_run_length_vlc_table[0][1], 4, 2,
1769 &fragment_run_length_vlc_table[0][0], 4, 2, 0);
1771 init_vlc(&s->mode_code_vlc, 3, 8,
1772 &mode_code_vlc_table[0][1], 2, 1,
1773 &mode_code_vlc_table[0][0], 2, 1, 0);
1775 init_vlc(&s->motion_vector_vlc, 6, 63,
1776 &motion_vector_vlc_table[0][1], 2, 1,
1777 &motion_vector_vlc_table[0][0], 2, 1, 0);
1779 /* work out the block mapping tables */
1780 s->superblock_fragments = av_malloc(s->superblock_count * 16 * sizeof(int));
1781 s->superblock_macroblocks = av_malloc(s->superblock_count * 4 * sizeof(int));
1782 s->macroblock_fragments = av_malloc(s->macroblock_count * 6 * sizeof(int));
1783 s->macroblock_coding = av_malloc(s->macroblock_count + 1);
1784 init_block_mapping(s);
1786 for (i = 0; i < 3; i++) {
1787 s->current_frame.data[i] = NULL;
1788 s->last_frame.data[i] = NULL;
1789 s->golden_frame.data[i] = NULL;
1796 * This is the ffmpeg/libavcodec API frame decode function.
1798 static int vp3_decode_frame(AVCodecContext *avctx,
1799 void *data, int *data_size,
1800 const uint8_t *buf, int buf_size)
1802 Vp3DecodeContext *s = avctx->priv_data;
1804 static int counter = 0;
1807 init_get_bits(&gb, buf, buf_size * 8);
1809 if (s->theora && get_bits1(&gb))
1811 av_log(avctx, AV_LOG_ERROR, "Header packet passed to frame decoder, skipping\n");
1815 s->keyframe = !get_bits1(&gb);
1818 s->last_quality_index = s->quality_index;
1822 s->qis[s->nqis++]= get_bits(&gb, 6);
1823 } while(s->theora >= 0x030200 && s->nqis<3 && get_bits1(&gb));
1825 s->quality_index= s->qis[0];
1827 if (s->avctx->debug & FF_DEBUG_PICT_INFO)
1828 av_log(s->avctx, AV_LOG_INFO, " VP3 %sframe #%d: Q index = %d\n",
1829 s->keyframe?"key":"", counter, s->quality_index);
1832 if (s->quality_index != s->last_quality_index) {
1833 init_dequantizer(s);
1834 init_loop_filter(s);
1837 if (avctx->skip_frame >= AVDISCARD_NONKEY && !s->keyframe)
1843 skip_bits(&gb, 4); /* width code */
1844 skip_bits(&gb, 4); /* height code */
1847 s->version = get_bits(&gb, 5);
1849 av_log(s->avctx, AV_LOG_DEBUG, "VP version: %d\n", s->version);
1852 if (s->version || s->theora)
1855 av_log(s->avctx, AV_LOG_ERROR, "Warning, unsupported keyframe coding type?!\n");
1856 skip_bits(&gb, 2); /* reserved? */
1859 if (s->last_frame.data[0] == s->golden_frame.data[0]) {
1860 if (s->golden_frame.data[0])
1861 avctx->release_buffer(avctx, &s->golden_frame);
1862 s->last_frame= s->golden_frame; /* ensure that we catch any access to this released frame */
1864 if (s->golden_frame.data[0])
1865 avctx->release_buffer(avctx, &s->golden_frame);
1866 if (s->last_frame.data[0])
1867 avctx->release_buffer(avctx, &s->last_frame);
1870 s->golden_frame.reference = 3;
1871 if(avctx->get_buffer(avctx, &s->golden_frame) < 0) {
1872 av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
1876 /* golden frame is also the current frame */
1877 s->current_frame= s->golden_frame;
1879 /* time to figure out pixel addresses? */
1880 if (!s->pixel_addresses_initialized)
1882 vp3_calculate_pixel_addresses(s);
1883 s->pixel_addresses_initialized = 1;
1886 /* allocate a new current frame */
1887 s->current_frame.reference = 3;
1888 if (!s->pixel_addresses_initialized) {
1889 av_log(s->avctx, AV_LOG_ERROR, "vp3: first frame not a keyframe\n");
1892 if(avctx->get_buffer(avctx, &s->current_frame) < 0) {
1893 av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
1898 s->current_frame.qscale_table= s->qscale_table; //FIXME allocate individual tables per AVFrame
1899 s->current_frame.qstride= 0;
1903 if (unpack_superblocks(s, &gb)){
1904 av_log(s->avctx, AV_LOG_ERROR, "error in unpack_superblocks\n");
1907 if (unpack_modes(s, &gb)){
1908 av_log(s->avctx, AV_LOG_ERROR, "error in unpack_modes\n");
1911 if (unpack_vectors(s, &gb)){
1912 av_log(s->avctx, AV_LOG_ERROR, "error in unpack_vectors\n");
1915 if (unpack_dct_coeffs(s, &gb)){
1916 av_log(s->avctx, AV_LOG_ERROR, "error in unpack_dct_coeffs\n");
1920 reverse_dc_prediction(s, 0, s->fragment_width, s->fragment_height);
1921 if ((avctx->flags & CODEC_FLAG_GRAY) == 0) {
1922 reverse_dc_prediction(s, s->fragment_start[1],
1923 s->fragment_width / 2, s->fragment_height / 2);
1924 reverse_dc_prediction(s, s->fragment_start[2],
1925 s->fragment_width / 2, s->fragment_height / 2);
1928 for (i = 0; i < s->macroblock_height; i++)
1931 apply_loop_filter(s);
1933 *data_size=sizeof(AVFrame);
1934 *(AVFrame*)data= s->current_frame;
1936 /* release the last frame, if it is allocated and if it is not the
1938 if ((s->last_frame.data[0]) &&
1939 (s->last_frame.data[0] != s->golden_frame.data[0]))
1940 avctx->release_buffer(avctx, &s->last_frame);
1942 /* shuffle frames (last = current) */
1943 s->last_frame= s->current_frame;
1944 s->current_frame.data[0]= NULL; /* ensure that we catch any access to this released frame */
1950 * This is the ffmpeg/libavcodec API module cleanup function.
1952 static av_cold int vp3_decode_end(AVCodecContext *avctx)
1954 Vp3DecodeContext *s = avctx->priv_data;
1957 av_free(s->superblock_coding);
1958 av_free(s->all_fragments);
1959 av_free(s->coeff_counts);
1961 av_free(s->coded_fragment_list);
1962 av_free(s->superblock_fragments);
1963 av_free(s->superblock_macroblocks);
1964 av_free(s->macroblock_fragments);
1965 av_free(s->macroblock_coding);
1967 for (i = 0; i < 16; i++) {
1968 free_vlc(&s->dc_vlc[i]);
1969 free_vlc(&s->ac_vlc_1[i]);
1970 free_vlc(&s->ac_vlc_2[i]);
1971 free_vlc(&s->ac_vlc_3[i]);
1972 free_vlc(&s->ac_vlc_4[i]);
1975 free_vlc(&s->superblock_run_length_vlc);
1976 free_vlc(&s->fragment_run_length_vlc);
1977 free_vlc(&s->mode_code_vlc);
1978 free_vlc(&s->motion_vector_vlc);
1980 /* release all frames */
1981 if (s->golden_frame.data[0] && s->golden_frame.data[0] != s->last_frame.data[0])
1982 avctx->release_buffer(avctx, &s->golden_frame);
1983 if (s->last_frame.data[0])
1984 avctx->release_buffer(avctx, &s->last_frame);
1985 /* no need to release the current_frame since it will always be pointing
1986 * to the same frame as either the golden or last frame */
1991 static int read_huffman_tree(AVCodecContext *avctx, GetBitContext *gb)
1993 Vp3DecodeContext *s = avctx->priv_data;
1995 if (get_bits1(gb)) {
1997 if (s->entries >= 32) { /* overflow */
1998 av_log(avctx, AV_LOG_ERROR, "huffman tree overflow\n");
2001 token = get_bits(gb, 5);
2002 //av_log(avctx, AV_LOG_DEBUG, "hti %d hbits %x token %d entry : %d size %d\n", s->hti, s->hbits, token, s->entries, s->huff_code_size);
2003 s->huffman_table[s->hti][token][0] = s->hbits;
2004 s->huffman_table[s->hti][token][1] = s->huff_code_size;
2008 if (s->huff_code_size >= 32) {/* overflow */
2009 av_log(avctx, AV_LOG_ERROR, "huffman tree overflow\n");
2012 s->huff_code_size++;
2014 read_huffman_tree(avctx, gb);
2016 read_huffman_tree(avctx, gb);
2018 s->huff_code_size--;
2023 #ifdef CONFIG_THEORA_DECODER
2024 static int theora_decode_header(AVCodecContext *avctx, GetBitContext *gb)
2026 Vp3DecodeContext *s = avctx->priv_data;
2027 int visible_width, visible_height;
2029 s->theora = get_bits_long(gb, 24);
2030 av_log(avctx, AV_LOG_DEBUG, "Theora bitstream version %X\n", s->theora);
2032 /* 3.2.0 aka alpha3 has the same frame orientation as original vp3 */
2033 /* but previous versions have the image flipped relative to vp3 */
2034 if (s->theora < 0x030200)
2036 s->flipped_image = 1;
2037 av_log(avctx, AV_LOG_DEBUG, "Old (<alpha3) Theora bitstream, flipped image\n");
2040 visible_width = s->width = get_bits(gb, 16) << 4;
2041 visible_height = s->height = get_bits(gb, 16) << 4;
2043 if(avcodec_check_dimensions(avctx, s->width, s->height)){
2044 av_log(avctx, AV_LOG_ERROR, "Invalid dimensions (%dx%d)\n", s->width, s->height);
2045 s->width= s->height= 0;
2049 if (s->theora >= 0x030400)
2051 skip_bits(gb, 32); /* total number of superblocks in a frame */
2052 // fixme, the next field is 36bits long
2053 skip_bits(gb, 32); /* total number of blocks in a frame */
2054 skip_bits(gb, 4); /* total number of blocks in a frame */
2055 skip_bits(gb, 32); /* total number of macroblocks in a frame */
2058 if (s->theora >= 0x030200) {
2059 visible_width = get_bits_long(gb, 24);
2060 visible_height = get_bits_long(gb, 24);
2062 skip_bits(gb, 8); /* offset x */
2063 skip_bits(gb, 8); /* offset y */
2066 skip_bits(gb, 32); /* fps numerator */
2067 skip_bits(gb, 32); /* fps denumerator */
2068 skip_bits(gb, 24); /* aspect numerator */
2069 skip_bits(gb, 24); /* aspect denumerator */
2071 if (s->theora < 0x030200)
2072 skip_bits(gb, 5); /* keyframe frequency force */
2073 skip_bits(gb, 8); /* colorspace */
2074 if (s->theora >= 0x030400)
2075 skip_bits(gb, 2); /* pixel format: 420,res,422,444 */
2076 skip_bits(gb, 24); /* bitrate */
2078 skip_bits(gb, 6); /* quality hint */
2080 if (s->theora >= 0x030200)
2082 skip_bits(gb, 5); /* keyframe frequency force */
2084 if (s->theora < 0x030400)
2085 skip_bits(gb, 5); /* spare bits */
2088 // align_get_bits(gb);
2090 if ( visible_width <= s->width && visible_width > s->width-16
2091 && visible_height <= s->height && visible_height > s->height-16)
2092 avcodec_set_dimensions(avctx, visible_width, visible_height);
2094 avcodec_set_dimensions(avctx, s->width, s->height);
2099 static int theora_decode_tables(AVCodecContext *avctx, GetBitContext *gb)
2101 Vp3DecodeContext *s = avctx->priv_data;
2102 int i, n, matrices, inter, plane;
2104 if (s->theora >= 0x030200) {
2105 n = get_bits(gb, 3);
2106 /* loop filter limit values table */
2107 for (i = 0; i < 64; i++)
2108 s->filter_limit_values[i] = get_bits(gb, n);
2111 if (s->theora >= 0x030200)
2112 n = get_bits(gb, 4) + 1;
2115 /* quality threshold table */
2116 for (i = 0; i < 64; i++)
2117 s->coded_ac_scale_factor[i] = get_bits(gb, n);
2119 if (s->theora >= 0x030200)
2120 n = get_bits(gb, 4) + 1;
2123 /* dc scale factor table */
2124 for (i = 0; i < 64; i++)
2125 s->coded_dc_scale_factor[i] = get_bits(gb, n);
2127 if (s->theora >= 0x030200)
2128 matrices = get_bits(gb, 9) + 1;
2133 av_log(avctx, AV_LOG_ERROR, "invalid number of base matrixes\n");
2137 for(n=0; n<matrices; n++){
2138 for (i = 0; i < 64; i++)
2139 s->base_matrix[n][i]= get_bits(gb, 8);
2142 for (inter = 0; inter <= 1; inter++) {
2143 for (plane = 0; plane <= 2; plane++) {
2145 if (inter || plane > 0)
2146 newqr = get_bits1(gb);
2149 if(inter && get_bits1(gb)){
2153 qtj= (3*inter + plane - 1) / 3;
2154 plj= (plane + 2) % 3;
2156 s->qr_count[inter][plane]= s->qr_count[qtj][plj];
2157 memcpy(s->qr_size[inter][plane], s->qr_size[qtj][plj], sizeof(s->qr_size[0][0]));
2158 memcpy(s->qr_base[inter][plane], s->qr_base[qtj][plj], sizeof(s->qr_base[0][0]));
2164 i= get_bits(gb, av_log2(matrices-1)+1);
2166 av_log(avctx, AV_LOG_ERROR, "invalid base matrix index\n");
2169 s->qr_base[inter][plane][qri]= i;
2172 i = get_bits(gb, av_log2(63-qi)+1) + 1;
2173 s->qr_size[inter][plane][qri++]= i;
2178 av_log(avctx, AV_LOG_ERROR, "invalid qi %d > 63\n", qi);
2181 s->qr_count[inter][plane]= qri;
2186 /* Huffman tables */
2187 for (s->hti = 0; s->hti < 80; s->hti++) {
2189 s->huff_code_size = 1;
2190 if (!get_bits1(gb)) {
2192 read_huffman_tree(avctx, gb);
2194 read_huffman_tree(avctx, gb);
2198 s->theora_tables = 1;
2203 static int theora_decode_init(AVCodecContext *avctx)
2205 Vp3DecodeContext *s = avctx->priv_data;
2208 uint8_t *header_start[3];
2214 if (!avctx->extradata_size)
2216 av_log(avctx, AV_LOG_ERROR, "Missing extradata!\n");
2220 if (ff_split_xiph_headers(avctx->extradata, avctx->extradata_size,
2221 42, header_start, header_len) < 0) {
2222 av_log(avctx, AV_LOG_ERROR, "Corrupt extradata\n");
2227 init_get_bits(&gb, header_start[i], header_len[i]);
2229 ptype = get_bits(&gb, 8);
2231 if (!(ptype & 0x80))
2233 av_log(avctx, AV_LOG_ERROR, "Invalid extradata!\n");
2237 // FIXME: Check for this as well.
2238 skip_bits(&gb, 6*8); /* "theora" */
2243 theora_decode_header(avctx, &gb);
2246 // FIXME: is this needed? it breaks sometimes
2247 // theora_decode_comments(avctx, gb);
2250 theora_decode_tables(avctx, &gb);
2253 av_log(avctx, AV_LOG_ERROR, "Unknown Theora config packet: %d\n", ptype&~0x80);
2256 if(ptype != 0x81 && 8*header_len[i] != get_bits_count(&gb))
2257 av_log(avctx, AV_LOG_WARNING, "%d bits left in packet %X\n", 8*header_len[i] - get_bits_count(&gb), ptype);
2258 if (s->theora < 0x030200)
2262 vp3_decode_init(avctx);
2266 AVCodec theora_decoder = {
2270 sizeof(Vp3DecodeContext),
2277 .long_name = NULL_IF_CONFIG_SMALL("Theora"),
2281 AVCodec vp3_decoder = {
2285 sizeof(Vp3DecodeContext),
2292 .long_name = NULL_IF_CONFIG_SMALL("On2 VP3"),