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 superblock_width;
144 int superblock_height;
145 int y_superblock_width;
146 int y_superblock_height;
147 int c_superblock_width;
148 int c_superblock_height;
149 int u_superblock_start;
150 int v_superblock_start;
151 unsigned char *superblock_coding;
153 int macroblock_count;
154 int macroblock_width;
155 int macroblock_height;
161 Vp3Fragment *all_fragments;
162 uint8_t *coeff_counts;
165 int fragment_start[3];
170 uint16_t coded_dc_scale_factor[64];
171 uint32_t coded_ac_scale_factor[64];
172 uint8_t base_matrix[384][64];
173 uint8_t qr_count[2][3];
174 uint8_t qr_size [2][3][64];
175 uint16_t qr_base[2][3][64];
177 /* this is a list of indexes into the all_fragments array indicating
178 * which of the fragments are coded */
179 int *coded_fragment_list;
180 int coded_fragment_list_index;
181 int pixel_addresses_initialized;
189 VLC superblock_run_length_vlc;
190 VLC fragment_run_length_vlc;
192 VLC motion_vector_vlc;
194 /* these arrays need to be on 16-byte boundaries since SSE2 operations
196 DECLARE_ALIGNED_16(int16_t, qmat[2][4][64]); //<qmat[is_inter][plane]
198 /* This table contains superblock_count * 16 entries. Each set of 16
199 * numbers corresponds to the fragment indexes 0..15 of the superblock.
200 * An entry will be -1 to indicate that no entry corresponds to that
202 int *superblock_fragments;
204 /* This table contains superblock_count * 4 entries. Each set of 4
205 * numbers corresponds to the macroblock indexes 0..3 of the superblock.
206 * An entry will be -1 to indicate that no entry corresponds to that
208 int *superblock_macroblocks;
210 /* This table contains macroblock_count * 6 entries. Each set of 6
211 * numbers corresponds to the fragment indexes 0..5 which comprise
212 * the macroblock (4 Y fragments and 2 C fragments). */
213 int *macroblock_fragments;
214 /* This is an array that indicates how a particular macroblock
216 unsigned char *macroblock_coding;
218 int first_coded_y_fragment;
219 int first_coded_c_fragment;
220 int last_coded_y_fragment;
221 int last_coded_c_fragment;
223 uint8_t edge_emu_buffer[9*2048]; //FIXME dynamic alloc
224 int8_t qscale_table[2048]; //FIXME dynamic alloc (width+15)/16
231 uint16_t huffman_table[80][32][2];
233 uint8_t filter_limit_values[64];
234 int bounding_values_array[256];
237 /************************************************************************
238 * VP3 specific functions
239 ************************************************************************/
242 * This function sets up all of the various blocks mappings:
243 * superblocks <-> fragments, macroblocks <-> fragments,
244 * superblocks <-> macroblocks
246 * Returns 0 is successful; returns 1 if *anything* went wrong.
248 static int init_block_mapping(Vp3DecodeContext *s)
251 signed int hilbert_walk_mb[4];
253 int current_fragment = 0;
254 int current_width = 0;
255 int current_height = 0;
258 int superblock_row_inc = 0;
260 int mapping_index = 0;
262 int current_macroblock;
265 signed char travel_width[16] = {
272 signed char travel_height[16] = {
279 signed char travel_width_mb[4] = {
283 signed char travel_height_mb[4] = {
287 hilbert_walk_mb[0] = 1;
288 hilbert_walk_mb[1] = s->macroblock_width;
289 hilbert_walk_mb[2] = 1;
290 hilbert_walk_mb[3] = -s->macroblock_width;
292 /* iterate through each superblock (all planes) and map the fragments */
293 for (i = 0; i < s->superblock_count; i++) {
294 /* time to re-assign the limits? */
297 /* start of Y superblocks */
298 right_edge = s->fragment_width;
299 bottom_edge = s->fragment_height;
302 superblock_row_inc = 3 * s->fragment_width -
303 (s->y_superblock_width * 4 - s->fragment_width);
305 /* the first operation for this variable is to advance by 1 */
306 current_fragment = -1;
308 } else if (i == s->u_superblock_start) {
310 /* start of U superblocks */
311 right_edge = s->fragment_width / 2;
312 bottom_edge = s->fragment_height / 2;
315 superblock_row_inc = 3 * (s->fragment_width / 2) -
316 (s->c_superblock_width * 4 - s->fragment_width / 2);
318 /* the first operation for this variable is to advance by 1 */
319 current_fragment = s->fragment_start[1] - 1;
321 } else if (i == s->v_superblock_start) {
323 /* start of V superblocks */
324 right_edge = s->fragment_width / 2;
325 bottom_edge = s->fragment_height / 2;
328 superblock_row_inc = 3 * (s->fragment_width / 2) -
329 (s->c_superblock_width * 4 - s->fragment_width / 2);
331 /* the first operation for this variable is to advance by 1 */
332 current_fragment = s->fragment_start[2] - 1;
336 if (current_width >= right_edge - 1) {
337 /* reset width and move to next superblock row */
341 /* fragment is now at the start of a new superblock row */
342 current_fragment += superblock_row_inc;
345 /* iterate through all 16 fragments in a superblock */
346 for (j = 0; j < 16; j++) {
347 current_fragment += travel_width[j] + right_edge * travel_height[j];
348 current_width += travel_width[j];
349 current_height += travel_height[j];
351 /* check if the fragment is in bounds */
352 if ((current_width < right_edge) &&
353 (current_height < bottom_edge)) {
354 s->superblock_fragments[mapping_index] = current_fragment;
356 s->superblock_fragments[mapping_index] = -1;
363 /* initialize the superblock <-> macroblock mapping; iterate through
364 * all of the Y plane superblocks to build this mapping */
365 right_edge = s->macroblock_width;
366 bottom_edge = s->macroblock_height;
369 superblock_row_inc = s->macroblock_width -
370 (s->y_superblock_width * 2 - s->macroblock_width);
371 hilbert = hilbert_walk_mb;
373 current_macroblock = -1;
374 for (i = 0; i < s->u_superblock_start; i++) {
376 if (current_width >= right_edge - 1) {
377 /* reset width and move to next superblock row */
381 /* macroblock is now at the start of a new superblock row */
382 current_macroblock += superblock_row_inc;
385 /* iterate through each potential macroblock in the superblock */
386 for (j = 0; j < 4; j++) {
387 current_macroblock += hilbert_walk_mb[j];
388 current_width += travel_width_mb[j];
389 current_height += travel_height_mb[j];
391 /* check if the macroblock is in bounds */
392 if ((current_width < right_edge) &&
393 (current_height < bottom_edge)) {
394 s->superblock_macroblocks[mapping_index] = current_macroblock;
396 s->superblock_macroblocks[mapping_index] = -1;
403 /* initialize the macroblock <-> fragment mapping */
404 current_fragment = 0;
405 current_macroblock = 0;
407 for (i = 0; i < s->fragment_height; i += 2) {
409 for (j = 0; j < s->fragment_width; j += 2) {
411 s->all_fragments[current_fragment].macroblock = current_macroblock;
412 s->macroblock_fragments[mapping_index++] = current_fragment;
414 if (j + 1 < s->fragment_width) {
415 s->all_fragments[current_fragment + 1].macroblock = current_macroblock;
416 s->macroblock_fragments[mapping_index++] = current_fragment + 1;
418 s->macroblock_fragments[mapping_index++] = -1;
420 if (i + 1 < s->fragment_height) {
421 s->all_fragments[current_fragment + s->fragment_width].macroblock =
423 s->macroblock_fragments[mapping_index++] =
424 current_fragment + s->fragment_width;
426 s->macroblock_fragments[mapping_index++] = -1;
428 if ((j + 1 < s->fragment_width) && (i + 1 < s->fragment_height)) {
429 s->all_fragments[current_fragment + s->fragment_width + 1].macroblock =
431 s->macroblock_fragments[mapping_index++] =
432 current_fragment + s->fragment_width + 1;
434 s->macroblock_fragments[mapping_index++] = -1;
437 c_fragment = s->fragment_start[1] +
438 (i * s->fragment_width / 4) + (j / 2);
439 s->all_fragments[c_fragment].macroblock = s->macroblock_count;
440 s->macroblock_fragments[mapping_index++] = c_fragment;
442 c_fragment = s->fragment_start[2] +
443 (i * s->fragment_width / 4) + (j / 2);
444 s->all_fragments[c_fragment].macroblock = s->macroblock_count;
445 s->macroblock_fragments[mapping_index++] = c_fragment;
447 if (j + 2 <= s->fragment_width)
448 current_fragment += 2;
451 current_macroblock++;
454 current_fragment += s->fragment_width;
457 return 0; /* successful path out */
461 * This function wipes out all of the fragment data.
463 static void init_frame(Vp3DecodeContext *s, GetBitContext *gb)
467 /* zero out all of the fragment information */
468 s->coded_fragment_list_index = 0;
469 for (i = 0; i < s->fragment_count; i++) {
470 s->coeff_counts[i] = 0;
471 s->all_fragments[i].motion_x = 127;
472 s->all_fragments[i].motion_y = 127;
473 s->all_fragments[i].next_coeff= NULL;
475 s->coeffs[i].coeff=0;
476 s->coeffs[i].next= NULL;
481 * This function sets up the dequantization tables used for a particular
484 static void init_dequantizer(Vp3DecodeContext *s)
486 int ac_scale_factor = s->coded_ac_scale_factor[s->quality_index];
487 int dc_scale_factor = s->coded_dc_scale_factor[s->quality_index];
488 int i, plane, inter, qri, bmi, bmj, qistart;
490 for(inter=0; inter<2; inter++){
491 for(plane=0; plane<3; plane++){
493 for(qri=0; qri<s->qr_count[inter][plane]; qri++){
494 sum+= s->qr_size[inter][plane][qri];
495 if(s->quality_index <= sum)
498 qistart= sum - s->qr_size[inter][plane][qri];
499 bmi= s->qr_base[inter][plane][qri ];
500 bmj= s->qr_base[inter][plane][qri+1];
502 int coeff= ( 2*(sum -s->quality_index)*s->base_matrix[bmi][i]
503 - 2*(qistart-s->quality_index)*s->base_matrix[bmj][i]
504 + s->qr_size[inter][plane][qri])
505 / (2*s->qr_size[inter][plane][qri]);
507 int qmin= 8<<(inter + !i);
508 int qscale= i ? ac_scale_factor : dc_scale_factor;
510 s->qmat[inter][plane][s->dsp.idct_permutation[i]]= av_clip((qscale * coeff)/100 * 4, qmin, 4096);
515 memset(s->qscale_table, (FFMAX(s->qmat[0][0][1], s->qmat[0][1][1])+8)/16, 512); //FIXME finetune
519 * This function initializes the loop filter boundary limits if the frame's
520 * quality index is different from the previous frame's.
522 static void init_loop_filter(Vp3DecodeContext *s)
524 int *bounding_values= s->bounding_values_array+127;
528 filter_limit = s->filter_limit_values[s->quality_index];
530 /* set up the bounding values */
531 memset(s->bounding_values_array, 0, 256 * sizeof(int));
532 for (x = 0; x < filter_limit; x++) {
533 bounding_values[-x - filter_limit] = -filter_limit + x;
534 bounding_values[-x] = -x;
535 bounding_values[x] = x;
536 bounding_values[x + filter_limit] = filter_limit - x;
541 * This function unpacks all of the superblock/macroblock/fragment coding
542 * information from the bitstream.
544 static int unpack_superblocks(Vp3DecodeContext *s, GetBitContext *gb)
547 int current_superblock = 0;
549 int decode_fully_flags = 0;
550 int decode_partial_blocks = 0;
551 int first_c_fragment_seen;
554 int current_fragment;
557 memset(s->superblock_coding, SB_FULLY_CODED, s->superblock_count);
561 /* unpack the list of partially-coded superblocks */
563 /* toggle the bit because as soon as the first run length is
564 * fetched the bit will be toggled again */
566 while (current_superblock < s->superblock_count) {
567 if (current_run-- == 0) {
569 current_run = get_vlc2(gb,
570 s->superblock_run_length_vlc.table, 6, 2);
571 if (current_run == 33)
572 current_run += get_bits(gb, 12);
574 /* if any of the superblocks are not partially coded, flag
575 * a boolean to decode the list of fully-coded superblocks */
577 decode_fully_flags = 1;
580 /* make a note of the fact that there are partially coded
582 decode_partial_blocks = 1;
585 s->superblock_coding[current_superblock++] = bit;
588 /* unpack the list of fully coded superblocks if any of the blocks were
589 * not marked as partially coded in the previous step */
590 if (decode_fully_flags) {
592 current_superblock = 0;
595 /* toggle the bit because as soon as the first run length is
596 * fetched the bit will be toggled again */
598 while (current_superblock < s->superblock_count) {
600 /* skip any superblocks already marked as partially coded */
601 if (s->superblock_coding[current_superblock] == SB_NOT_CODED) {
603 if (current_run-- == 0) {
605 current_run = get_vlc2(gb,
606 s->superblock_run_length_vlc.table, 6, 2);
607 if (current_run == 33)
608 current_run += get_bits(gb, 12);
610 s->superblock_coding[current_superblock] = 2*bit;
612 current_superblock++;
616 /* if there were partial blocks, initialize bitstream for
617 * unpacking fragment codings */
618 if (decode_partial_blocks) {
622 /* toggle the bit because as soon as the first run length is
623 * fetched the bit will be toggled again */
628 /* figure out which fragments are coded; iterate through each
629 * superblock (all planes) */
630 s->coded_fragment_list_index = 0;
631 s->next_coeff= s->coeffs + s->fragment_count;
632 s->first_coded_y_fragment = s->first_coded_c_fragment = 0;
633 s->last_coded_y_fragment = s->last_coded_c_fragment = -1;
634 first_c_fragment_seen = 0;
635 memset(s->macroblock_coding, MODE_COPY, s->macroblock_count);
636 for (i = 0; i < s->superblock_count; i++) {
638 /* iterate through all 16 fragments in a superblock */
639 for (j = 0; j < 16; j++) {
641 /* if the fragment is in bounds, check its coding status */
642 current_fragment = s->superblock_fragments[i * 16 + j];
643 if (current_fragment >= s->fragment_count) {
644 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_superblocks(): bad fragment number (%d >= %d)\n",
645 current_fragment, s->fragment_count);
648 if (current_fragment != -1) {
649 if (s->superblock_coding[i] == SB_NOT_CODED) {
651 /* copy all the fragments from the prior frame */
652 s->all_fragments[current_fragment].coding_method =
655 } else if (s->superblock_coding[i] == SB_PARTIALLY_CODED) {
657 /* fragment may or may not be coded; this is the case
658 * that cares about the fragment coding runs */
659 if (current_run-- == 0) {
661 current_run = get_vlc2(gb,
662 s->fragment_run_length_vlc.table, 5, 2);
666 /* default mode; actual mode will be decoded in
668 s->all_fragments[current_fragment].coding_method =
670 s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
671 s->coded_fragment_list[s->coded_fragment_list_index] =
673 if ((current_fragment >= s->fragment_start[1]) &&
674 (s->last_coded_y_fragment == -1) &&
675 (!first_c_fragment_seen)) {
676 s->first_coded_c_fragment = s->coded_fragment_list_index;
677 s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
678 first_c_fragment_seen = 1;
680 s->coded_fragment_list_index++;
681 s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
683 /* not coded; copy this fragment from the prior frame */
684 s->all_fragments[current_fragment].coding_method =
690 /* fragments are fully coded in this superblock; actual
691 * coding will be determined in next step */
692 s->all_fragments[current_fragment].coding_method =
694 s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
695 s->coded_fragment_list[s->coded_fragment_list_index] =
697 if ((current_fragment >= s->fragment_start[1]) &&
698 (s->last_coded_y_fragment == -1) &&
699 (!first_c_fragment_seen)) {
700 s->first_coded_c_fragment = s->coded_fragment_list_index;
701 s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
702 first_c_fragment_seen = 1;
704 s->coded_fragment_list_index++;
705 s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
711 if (!first_c_fragment_seen)
712 /* only Y fragments coded in this frame */
713 s->last_coded_y_fragment = s->coded_fragment_list_index - 1;
715 /* end the list of coded C fragments */
716 s->last_coded_c_fragment = s->coded_fragment_list_index - 1;
722 * This function unpacks all the coding mode data for individual macroblocks
723 * from the bitstream.
725 static int unpack_modes(Vp3DecodeContext *s, GetBitContext *gb)
729 int current_macroblock;
730 int current_fragment;
732 int custom_mode_alphabet[CODING_MODE_COUNT];
735 for (i = 0; i < s->fragment_count; i++)
736 s->all_fragments[i].coding_method = MODE_INTRA;
740 /* fetch the mode coding scheme for this frame */
741 scheme = get_bits(gb, 3);
743 /* is it a custom coding scheme? */
745 for (i = 0; i < 8; i++)
746 custom_mode_alphabet[get_bits(gb, 3)] = i;
749 /* iterate through all of the macroblocks that contain 1 or more
751 for (i = 0; i < s->u_superblock_start; i++) {
753 for (j = 0; j < 4; j++) {
754 current_macroblock = s->superblock_macroblocks[i * 4 + j];
755 if ((current_macroblock == -1) ||
756 (s->macroblock_coding[current_macroblock] == MODE_COPY))
758 if (current_macroblock >= s->macroblock_count) {
759 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_modes(): bad macroblock number (%d >= %d)\n",
760 current_macroblock, s->macroblock_count);
764 /* mode 7 means get 3 bits for each coding mode */
766 coding_mode = get_bits(gb, 3);
768 coding_mode = custom_mode_alphabet
769 [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
771 coding_mode = ModeAlphabet[scheme-1]
772 [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
774 s->macroblock_coding[current_macroblock] = coding_mode;
775 for (k = 0; k < 6; k++) {
777 s->macroblock_fragments[current_macroblock * 6 + k];
778 if (current_fragment == -1)
780 if (current_fragment >= s->fragment_count) {
781 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_modes(): bad fragment number (%d >= %d)\n",
782 current_fragment, s->fragment_count);
785 if (s->all_fragments[current_fragment].coding_method !=
787 s->all_fragments[current_fragment].coding_method =
798 * This function unpacks all the motion vectors for the individual
799 * macroblocks from the bitstream.
801 static int unpack_vectors(Vp3DecodeContext *s, GetBitContext *gb)
807 int last_motion_x = 0;
808 int last_motion_y = 0;
809 int prior_last_motion_x = 0;
810 int prior_last_motion_y = 0;
811 int current_macroblock;
812 int current_fragment;
817 memset(motion_x, 0, 6 * sizeof(int));
818 memset(motion_y, 0, 6 * sizeof(int));
820 /* coding mode 0 is the VLC scheme; 1 is the fixed code scheme */
821 coding_mode = get_bits1(gb);
823 /* iterate through all of the macroblocks that contain 1 or more
825 for (i = 0; i < s->u_superblock_start; i++) {
827 for (j = 0; j < 4; j++) {
828 current_macroblock = s->superblock_macroblocks[i * 4 + j];
829 if ((current_macroblock == -1) ||
830 (s->macroblock_coding[current_macroblock] == MODE_COPY))
832 if (current_macroblock >= s->macroblock_count) {
833 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_vectors(): bad macroblock number (%d >= %d)\n",
834 current_macroblock, s->macroblock_count);
838 current_fragment = s->macroblock_fragments[current_macroblock * 6];
839 if (current_fragment >= s->fragment_count) {
840 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_vectors(): bad fragment number (%d >= %d\n",
841 current_fragment, s->fragment_count);
844 switch (s->macroblock_coding[current_macroblock]) {
846 case MODE_INTER_PLUS_MV:
848 /* all 6 fragments use the same motion vector */
849 if (coding_mode == 0) {
850 motion_x[0] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
851 motion_y[0] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
853 motion_x[0] = fixed_motion_vector_table[get_bits(gb, 6)];
854 motion_y[0] = fixed_motion_vector_table[get_bits(gb, 6)];
857 for (k = 1; k < 6; k++) {
858 motion_x[k] = motion_x[0];
859 motion_y[k] = motion_y[0];
862 /* vector maintenance, only on MODE_INTER_PLUS_MV */
863 if (s->macroblock_coding[current_macroblock] ==
864 MODE_INTER_PLUS_MV) {
865 prior_last_motion_x = last_motion_x;
866 prior_last_motion_y = last_motion_y;
867 last_motion_x = motion_x[0];
868 last_motion_y = motion_y[0];
872 case MODE_INTER_FOURMV:
873 /* vector maintenance */
874 prior_last_motion_x = last_motion_x;
875 prior_last_motion_y = last_motion_y;
877 /* fetch 4 vectors from the bitstream, one for each
878 * Y fragment, then average for the C fragment vectors */
879 motion_x[4] = motion_y[4] = 0;
880 for (k = 0; k < 4; k++) {
881 for (l = 0; l < s->coded_fragment_list_index; l++)
882 if (s->coded_fragment_list[l] == s->macroblock_fragments[6*current_macroblock + k])
884 if (l < s->coded_fragment_list_index) {
885 if (coding_mode == 0) {
886 motion_x[k] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
887 motion_y[k] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
889 motion_x[k] = fixed_motion_vector_table[get_bits(gb, 6)];
890 motion_y[k] = fixed_motion_vector_table[get_bits(gb, 6)];
892 last_motion_x = motion_x[k];
893 last_motion_y = motion_y[k];
898 motion_x[4] += motion_x[k];
899 motion_y[4] += motion_y[k];
903 motion_x[4]= RSHIFT(motion_x[4], 2);
905 motion_y[4]= RSHIFT(motion_y[4], 2);
908 case MODE_INTER_LAST_MV:
909 /* all 6 fragments use the last motion vector */
910 motion_x[0] = last_motion_x;
911 motion_y[0] = last_motion_y;
912 for (k = 1; k < 6; k++) {
913 motion_x[k] = motion_x[0];
914 motion_y[k] = motion_y[0];
917 /* no vector maintenance (last vector remains the
921 case MODE_INTER_PRIOR_LAST:
922 /* all 6 fragments use the motion vector prior to the
923 * last motion vector */
924 motion_x[0] = prior_last_motion_x;
925 motion_y[0] = prior_last_motion_y;
926 for (k = 1; k < 6; k++) {
927 motion_x[k] = motion_x[0];
928 motion_y[k] = motion_y[0];
931 /* vector maintenance */
932 prior_last_motion_x = last_motion_x;
933 prior_last_motion_y = last_motion_y;
934 last_motion_x = motion_x[0];
935 last_motion_y = motion_y[0];
939 /* covers intra, inter without MV, golden without MV */
940 memset(motion_x, 0, 6 * sizeof(int));
941 memset(motion_y, 0, 6 * sizeof(int));
943 /* no vector maintenance */
947 /* assign the motion vectors to the correct fragments */
948 for (k = 0; k < 6; k++) {
950 s->macroblock_fragments[current_macroblock * 6 + k];
951 if (current_fragment == -1)
953 if (current_fragment >= s->fragment_count) {
954 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_vectors(): bad fragment number (%d >= %d)\n",
955 current_fragment, s->fragment_count);
958 s->all_fragments[current_fragment].motion_x = motion_x[k];
959 s->all_fragments[current_fragment].motion_y = motion_y[k];
968 * This function is called by unpack_dct_coeffs() to extract the VLCs from
969 * the bitstream. The VLCs encode tokens which are used to unpack DCT
970 * data. This function unpacks all the VLCs for either the Y plane or both
971 * C planes, and is called for DC coefficients or different AC coefficient
972 * levels (since different coefficient types require different VLC tables.
974 * This function returns a residual eob run. E.g, if a particular token gave
975 * instructions to EOB the next 5 fragments and there were only 2 fragments
976 * left in the current fragment range, 3 would be returned so that it could
977 * be passed into the next call to this same function.
979 static int unpack_vlcs(Vp3DecodeContext *s, GetBitContext *gb,
980 VLC *table, int coeff_index,
981 int first_fragment, int last_fragment,
988 Vp3Fragment *fragment;
989 uint8_t *perm= s->scantable.permutated;
992 if ((first_fragment >= s->fragment_count) ||
993 (last_fragment >= s->fragment_count)) {
995 av_log(s->avctx, AV_LOG_ERROR, " vp3:unpack_vlcs(): bad fragment number (%d -> %d ?)\n",
996 first_fragment, last_fragment);
1000 for (i = first_fragment; i <= last_fragment; i++) {
1001 int fragment_num = s->coded_fragment_list[i];
1003 if (s->coeff_counts[fragment_num] > coeff_index)
1005 fragment = &s->all_fragments[fragment_num];
1008 /* decode a VLC into a token */
1009 token = get_vlc2(gb, table->table, 5, 3);
1010 /* use the token to get a zero run, a coefficient, and an eob run */
1012 eob_run = eob_run_base[token];
1013 if (eob_run_get_bits[token])
1014 eob_run += get_bits(gb, eob_run_get_bits[token]);
1015 coeff = zero_run = 0;
1017 bits_to_get = coeff_get_bits[token];
1019 coeff = coeff_tables[token][0];
1021 coeff = coeff_tables[token][get_bits(gb, bits_to_get)];
1023 zero_run = zero_run_base[token];
1024 if (zero_run_get_bits[token])
1025 zero_run += get_bits(gb, zero_run_get_bits[token]);
1030 s->coeff_counts[fragment_num] += zero_run;
1031 if (s->coeff_counts[fragment_num] < 64){
1032 fragment->next_coeff->coeff= coeff;
1033 fragment->next_coeff->index= perm[s->coeff_counts[fragment_num]++]; //FIXME perm here already?
1034 fragment->next_coeff->next= s->next_coeff;
1035 s->next_coeff->next=NULL;
1036 fragment->next_coeff= s->next_coeff++;
1039 s->coeff_counts[fragment_num] |= 128;
1048 * This function unpacks all of the DCT coefficient data from the
1051 static int unpack_dct_coeffs(Vp3DecodeContext *s, GetBitContext *gb)
1058 int residual_eob_run = 0;
1060 /* fetch the DC table indexes */
1061 dc_y_table = get_bits(gb, 4);
1062 dc_c_table = get_bits(gb, 4);
1064 /* unpack the Y plane DC coefficients */
1065 residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_y_table], 0,
1066 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1068 /* unpack the C plane DC coefficients */
1069 residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_c_table], 0,
1070 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1072 /* fetch the AC table indexes */
1073 ac_y_table = get_bits(gb, 4);
1074 ac_c_table = get_bits(gb, 4);
1076 /* unpack the group 1 AC coefficients (coeffs 1-5) */
1077 for (i = 1; i <= 5; i++) {
1078 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_y_table], i,
1079 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1081 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_c_table], i,
1082 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1085 /* unpack the group 2 AC coefficients (coeffs 6-14) */
1086 for (i = 6; i <= 14; i++) {
1087 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_y_table], i,
1088 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1090 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_c_table], i,
1091 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1094 /* unpack the group 3 AC coefficients (coeffs 15-27) */
1095 for (i = 15; i <= 27; i++) {
1096 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_y_table], i,
1097 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1099 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_c_table], i,
1100 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1103 /* unpack the group 4 AC coefficients (coeffs 28-63) */
1104 for (i = 28; i <= 63; i++) {
1105 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_y_table], i,
1106 s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1108 residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_c_table], i,
1109 s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1116 * This function reverses the DC prediction for each coded fragment in
1117 * the frame. Much of this function is adapted directly from the original
1120 #define COMPATIBLE_FRAME(x) \
1121 (compatible_frame[s->all_fragments[x].coding_method] == current_frame_type)
1122 #define FRAME_CODED(x) (s->all_fragments[x].coding_method != MODE_COPY)
1123 #define DC_COEFF(u) (s->coeffs[u].index ? 0 : s->coeffs[u].coeff) //FIXME do somethin to simplify this
1125 static void reverse_dc_prediction(Vp3DecodeContext *s,
1128 int fragment_height)
1137 int i = first_fragment;
1141 /* DC values for the left, up-left, up, and up-right fragments */
1142 int vl, vul, vu, vur;
1144 /* indexes for the left, up-left, up, and up-right fragments */
1148 * The 6 fields mean:
1149 * 0: up-left multiplier
1151 * 2: up-right multiplier
1152 * 3: left multiplier
1154 int predictor_transform[16][4] = {
1156 { 0, 0, 0,128}, // PL
1157 { 0, 0,128, 0}, // PUR
1158 { 0, 0, 53, 75}, // PUR|PL
1159 { 0,128, 0, 0}, // PU
1160 { 0, 64, 0, 64}, // PU|PL
1161 { 0,128, 0, 0}, // PU|PUR
1162 { 0, 0, 53, 75}, // PU|PUR|PL
1163 {128, 0, 0, 0}, // PUL
1164 { 0, 0, 0,128}, // PUL|PL
1165 { 64, 0, 64, 0}, // PUL|PUR
1166 { 0, 0, 53, 75}, // PUL|PUR|PL
1167 { 0,128, 0, 0}, // PUL|PU
1168 {-104,116, 0,116}, // PUL|PU|PL
1169 { 24, 80, 24, 0}, // PUL|PU|PUR
1170 {-104,116, 0,116} // PUL|PU|PUR|PL
1173 /* This table shows which types of blocks can use other blocks for
1174 * prediction. For example, INTRA is the only mode in this table to
1175 * have a frame number of 0. That means INTRA blocks can only predict
1176 * from other INTRA blocks. There are 2 golden frame coding types;
1177 * blocks encoding in these modes can only predict from other blocks
1178 * that were encoded with these 1 of these 2 modes. */
1179 unsigned char compatible_frame[8] = {
1180 1, /* MODE_INTER_NO_MV */
1182 1, /* MODE_INTER_PLUS_MV */
1183 1, /* MODE_INTER_LAST_MV */
1184 1, /* MODE_INTER_PRIOR_MV */
1185 2, /* MODE_USING_GOLDEN */
1186 2, /* MODE_GOLDEN_MV */
1187 1 /* MODE_INTER_FOUR_MV */
1189 int current_frame_type;
1191 /* there is a last DC predictor for each of the 3 frame types */
1196 vul = vu = vur = vl = 0;
1197 last_dc[0] = last_dc[1] = last_dc[2] = 0;
1199 /* for each fragment row... */
1200 for (y = 0; y < fragment_height; y++) {
1202 /* for each fragment in a row... */
1203 for (x = 0; x < fragment_width; x++, i++) {
1205 /* reverse prediction if this block was coded */
1206 if (s->all_fragments[i].coding_method != MODE_COPY) {
1208 current_frame_type =
1209 compatible_frame[s->all_fragments[i].coding_method];
1215 if(FRAME_CODED(l) && COMPATIBLE_FRAME(l))
1219 u= i-fragment_width;
1221 if(FRAME_CODED(u) && COMPATIBLE_FRAME(u))
1224 ul= i-fragment_width-1;
1226 if(FRAME_CODED(ul) && COMPATIBLE_FRAME(ul))
1229 if(x + 1 < fragment_width){
1230 ur= i-fragment_width+1;
1232 if(FRAME_CODED(ur) && COMPATIBLE_FRAME(ur))
1237 if (transform == 0) {
1239 /* if there were no fragments to predict from, use last
1241 predicted_dc = last_dc[current_frame_type];
1244 /* apply the appropriate predictor transform */
1246 (predictor_transform[transform][0] * vul) +
1247 (predictor_transform[transform][1] * vu) +
1248 (predictor_transform[transform][2] * vur) +
1249 (predictor_transform[transform][3] * vl);
1251 predicted_dc /= 128;
1253 /* check for outranging on the [ul u l] and
1254 * [ul u ur l] predictors */
1255 if ((transform == 13) || (transform == 15)) {
1256 if (FFABS(predicted_dc - vu) > 128)
1258 else if (FFABS(predicted_dc - vl) > 128)
1260 else if (FFABS(predicted_dc - vul) > 128)
1265 /* at long last, apply the predictor */
1266 if(s->coeffs[i].index){
1267 *s->next_coeff= s->coeffs[i];
1268 s->coeffs[i].index=0;
1269 s->coeffs[i].coeff=0;
1270 s->coeffs[i].next= s->next_coeff++;
1272 s->coeffs[i].coeff += predicted_dc;
1274 last_dc[current_frame_type] = DC_COEFF(i);
1275 if(DC_COEFF(i) && !(s->coeff_counts[i]&127)){
1276 s->coeff_counts[i]= 129;
1277 // s->all_fragments[i].next_coeff= s->next_coeff;
1278 s->coeffs[i].next= s->next_coeff;
1279 (s->next_coeff++)->next=NULL;
1287 * Perform the final rendering for a particular slice of data.
1288 * The slice number ranges from 0..(macroblock_height - 1).
1290 static void render_slice(Vp3DecodeContext *s, int slice)
1293 int16_t *dequantizer;
1294 DECLARE_ALIGNED_16(DCTELEM, block[64]);
1295 int motion_x = 0xdeadbeef, motion_y = 0xdeadbeef;
1296 int motion_halfpel_index;
1297 uint8_t *motion_source;
1299 int current_macroblock_entry = slice * s->macroblock_width * 6;
1301 if (slice >= s->macroblock_height)
1304 for (plane = 0; plane < 3; plane++) {
1305 uint8_t *output_plane = s->current_frame.data [plane];
1306 uint8_t * last_plane = s-> last_frame.data [plane];
1307 uint8_t *golden_plane = s-> golden_frame.data [plane];
1308 int stride = s->current_frame.linesize[plane];
1309 int plane_width = s->width >> !!plane;
1310 int plane_height = s->height >> !!plane;
1311 int y = slice * FRAGMENT_PIXELS << !plane ;
1312 int slice_height = y + (FRAGMENT_PIXELS << !plane);
1313 int i = s->macroblock_fragments[current_macroblock_entry + plane + 3*!!plane];
1315 if (!s->flipped_image) stride = -stride;
1318 if(FFABS(stride) > 2048)
1319 return; //various tables are fixed size
1321 /* for each fragment row in the slice (both of them)... */
1322 for (; y < slice_height; y += 8) {
1324 /* for each fragment in a row... */
1325 for (x = 0; x < plane_width; x += 8, i++) {
1327 if ((i < 0) || (i >= s->fragment_count)) {
1328 av_log(s->avctx, AV_LOG_ERROR, " vp3:render_slice(): bad fragment number (%d)\n", i);
1332 /* transform if this block was coded */
1333 if ((s->all_fragments[i].coding_method != MODE_COPY) &&
1334 !((s->avctx->flags & CODEC_FLAG_GRAY) && plane)) {
1336 if ((s->all_fragments[i].coding_method == MODE_USING_GOLDEN) ||
1337 (s->all_fragments[i].coding_method == MODE_GOLDEN_MV))
1338 motion_source= golden_plane;
1340 motion_source= last_plane;
1342 motion_source += s->all_fragments[i].first_pixel;
1343 motion_halfpel_index = 0;
1345 /* sort out the motion vector if this fragment is coded
1346 * using a motion vector method */
1347 if ((s->all_fragments[i].coding_method > MODE_INTRA) &&
1348 (s->all_fragments[i].coding_method != MODE_USING_GOLDEN)) {
1350 motion_x = s->all_fragments[i].motion_x;
1351 motion_y = s->all_fragments[i].motion_y;
1353 motion_x= (motion_x>>1) | (motion_x&1);
1354 motion_y= (motion_y>>1) | (motion_y&1);
1357 src_x= (motion_x>>1) + x;
1358 src_y= (motion_y>>1) + y;
1359 if ((motion_x == 127) || (motion_y == 127))
1360 av_log(s->avctx, AV_LOG_ERROR, " help! got invalid motion vector! (%X, %X)\n", motion_x, motion_y);
1362 motion_halfpel_index = motion_x & 0x01;
1363 motion_source += (motion_x >> 1);
1365 motion_halfpel_index |= (motion_y & 0x01) << 1;
1366 motion_source += ((motion_y >> 1) * stride);
1368 if(src_x<0 || src_y<0 || src_x + 9 >= plane_width || src_y + 9 >= plane_height){
1369 uint8_t *temp= s->edge_emu_buffer;
1370 if(stride<0) temp -= 9*stride;
1371 else temp += 9*stride;
1373 ff_emulated_edge_mc(temp, motion_source, stride, 9, 9, src_x, src_y, plane_width, plane_height);
1374 motion_source= temp;
1379 /* first, take care of copying a block from either the
1380 * previous or the golden frame */
1381 if (s->all_fragments[i].coding_method != MODE_INTRA) {
1382 /* Note, it is possible to implement all MC cases with
1383 put_no_rnd_pixels_l2 which would look more like the
1384 VP3 source but this would be slower as
1385 put_no_rnd_pixels_tab is better optimzed */
1386 if(motion_halfpel_index != 3){
1387 s->dsp.put_no_rnd_pixels_tab[1][motion_halfpel_index](
1388 output_plane + s->all_fragments[i].first_pixel,
1389 motion_source, stride, 8);
1391 int d= (motion_x ^ motion_y)>>31; // d is 0 if motion_x and _y have the same sign, else -1
1392 s->dsp.put_no_rnd_pixels_l2[1](
1393 output_plane + s->all_fragments[i].first_pixel,
1395 motion_source + stride + 1 + d,
1398 dequantizer = s->qmat[1][plane];
1400 dequantizer = s->qmat[0][plane];
1403 /* dequantize the DCT coefficients */
1404 if(s->avctx->idct_algo==FF_IDCT_VP3){
1405 Coeff *coeff= s->coeffs + i;
1406 memset(block, 0, sizeof(block));
1408 block[coeff->index]= coeff->coeff * dequantizer[coeff->index];
1412 Coeff *coeff= s->coeffs + i;
1413 memset(block, 0, sizeof(block));
1415 block[coeff->index]= (coeff->coeff * dequantizer[coeff->index] + 2)>>2;
1420 /* invert DCT and place (or add) in final output */
1422 if (s->all_fragments[i].coding_method == MODE_INTRA) {
1423 if(s->avctx->idct_algo!=FF_IDCT_VP3)
1426 output_plane + s->all_fragments[i].first_pixel,
1431 output_plane + s->all_fragments[i].first_pixel,
1437 /* copy directly from the previous frame */
1438 s->dsp.put_pixels_tab[1][0](
1439 output_plane + s->all_fragments[i].first_pixel,
1440 last_plane + s->all_fragments[i].first_pixel,
1445 /* perform the left edge filter if:
1446 * - the fragment is not on the left column
1447 * - the fragment is coded in this frame
1448 * - the fragment is not coded in this frame but the left
1449 * fragment is coded in this frame (this is done instead
1450 * of a right edge filter when rendering the left fragment
1451 * since this fragment is not available yet) */
1453 ((s->all_fragments[i].coding_method != MODE_COPY) ||
1454 ((s->all_fragments[i].coding_method == MODE_COPY) &&
1455 (s->all_fragments[i - 1].coding_method != MODE_COPY)) )) {
1457 output_plane + s->all_fragments[i].first_pixel + 7*stride,
1458 -stride, s->bounding_values_array + 127);
1461 /* perform the top edge filter if:
1462 * - the fragment is not on the top row
1463 * - the fragment is coded in this frame
1464 * - the fragment is not coded in this frame but the above
1465 * fragment is coded in this frame (this is done instead
1466 * of a bottom edge filter when rendering the above
1467 * fragment since this fragment is not available yet) */
1469 ((s->all_fragments[i].coding_method != MODE_COPY) ||
1470 ((s->all_fragments[i].coding_method == MODE_COPY) &&
1471 (s->all_fragments[i - fragment_width].coding_method != MODE_COPY)) )) {
1473 output_plane + s->all_fragments[i].first_pixel - stride,
1474 -stride, s->bounding_values_array + 127);
1481 /* this looks like a good place for slice dispatch... */
1483 * if (slice == s->macroblock_height - 1)
1484 * dispatch (both last slice & 2nd-to-last slice);
1485 * else if (slice > 0)
1486 * dispatch (slice - 1);
1492 static void apply_loop_filter(Vp3DecodeContext *s)
1496 int *bounding_values= s->bounding_values_array+127;
1499 int bounding_values_array[256];
1502 /* find the right loop limit value */
1503 for (x = 63; x >= 0; x--) {
1504 if (vp31_ac_scale_factor[x] >= s->quality_index)
1507 filter_limit = vp31_filter_limit_values[s->quality_index];
1509 /* set up the bounding values */
1510 memset(bounding_values_array, 0, 256 * sizeof(int));
1511 for (x = 0; x < filter_limit; x++) {
1512 bounding_values[-x - filter_limit] = -filter_limit + x;
1513 bounding_values[-x] = -x;
1514 bounding_values[x] = x;
1515 bounding_values[x + filter_limit] = filter_limit - x;
1519 for (plane = 0; plane < 3; plane++) {
1520 int width = s->fragment_width >> !!plane;
1521 int height = s->fragment_height >> !!plane;
1522 int fragment = s->fragment_start [plane];
1523 int stride = s->current_frame.linesize[plane];
1524 uint8_t *plane_data = s->current_frame.data [plane];
1525 if (!s->flipped_image) stride = -stride;
1527 for (y = 0; y < height; y++) {
1529 for (x = 0; x < width; x++) {
1530 /* do not perform left edge filter for left columns frags */
1532 (s->all_fragments[fragment].coding_method != MODE_COPY)) {
1533 s->dsp.vp3_h_loop_filter(
1534 plane_data + s->all_fragments[fragment].first_pixel,
1535 stride, bounding_values);
1538 /* do not perform top edge filter for top row fragments */
1540 (s->all_fragments[fragment].coding_method != MODE_COPY)) {
1541 s->dsp.vp3_v_loop_filter(
1542 plane_data + s->all_fragments[fragment].first_pixel,
1543 stride, bounding_values);
1546 /* do not perform right edge filter for right column
1547 * fragments or if right fragment neighbor is also coded
1548 * in this frame (it will be filtered in next iteration) */
1549 if ((x < width - 1) &&
1550 (s->all_fragments[fragment].coding_method != MODE_COPY) &&
1551 (s->all_fragments[fragment + 1].coding_method == MODE_COPY)) {
1552 s->dsp.vp3_h_loop_filter(
1553 plane_data + s->all_fragments[fragment + 1].first_pixel,
1554 stride, bounding_values);
1557 /* do not perform bottom edge filter for bottom row
1558 * fragments or if bottom fragment neighbor is also coded
1559 * in this frame (it will be filtered in the next row) */
1560 if ((y < height - 1) &&
1561 (s->all_fragments[fragment].coding_method != MODE_COPY) &&
1562 (s->all_fragments[fragment + width].coding_method == MODE_COPY)) {
1563 s->dsp.vp3_v_loop_filter(
1564 plane_data + s->all_fragments[fragment + width].first_pixel,
1565 stride, bounding_values);
1575 * This function computes the first pixel addresses for each fragment.
1576 * This function needs to be invoked after the first frame is allocated
1577 * so that it has access to the plane strides.
1579 static void vp3_calculate_pixel_addresses(Vp3DecodeContext *s)
1581 #define Y_INITIAL(chroma_shift) s->flipped_image ? 1 : s->fragment_height >> chroma_shift
1582 #define Y_FINISHED(chroma_shift) s->flipped_image ? y <= s->fragment_height >> chroma_shift : y > 0
1585 const int y_inc = s->flipped_image ? 1 : -1;
1587 /* figure out the first pixel addresses for each of the fragments */
1590 for (y = Y_INITIAL(0); Y_FINISHED(0); y += y_inc) {
1591 for (x = 0; x < s->fragment_width; x++) {
1592 s->all_fragments[i++].first_pixel =
1593 s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
1594 s->golden_frame.linesize[0] +
1595 x * FRAGMENT_PIXELS;
1600 i = s->fragment_start[1];
1601 for (y = Y_INITIAL(1); Y_FINISHED(1); y += y_inc) {
1602 for (x = 0; x < s->fragment_width / 2; x++) {
1603 s->all_fragments[i++].first_pixel =
1604 s->golden_frame.linesize[1] * y * FRAGMENT_PIXELS -
1605 s->golden_frame.linesize[1] +
1606 x * FRAGMENT_PIXELS;
1611 i = s->fragment_start[2];
1612 for (y = Y_INITIAL(1); Y_FINISHED(1); y += y_inc) {
1613 for (x = 0; x < s->fragment_width / 2; x++) {
1614 s->all_fragments[i++].first_pixel =
1615 s->golden_frame.linesize[2] * y * FRAGMENT_PIXELS -
1616 s->golden_frame.linesize[2] +
1617 x * FRAGMENT_PIXELS;
1623 * This is the ffmpeg/libavcodec API init function.
1625 static av_cold int vp3_decode_init(AVCodecContext *avctx)
1627 Vp3DecodeContext *s = avctx->priv_data;
1628 int i, inter, plane;
1631 int y_superblock_count;
1632 int c_superblock_count;
1634 if (avctx->codec_tag == MKTAG('V','P','3','0'))
1640 s->width = (avctx->width + 15) & 0xFFFFFFF0;
1641 s->height = (avctx->height + 15) & 0xFFFFFFF0;
1642 avctx->pix_fmt = PIX_FMT_YUV420P;
1643 if(avctx->idct_algo==FF_IDCT_AUTO)
1644 avctx->idct_algo=FF_IDCT_VP3;
1645 dsputil_init(&s->dsp, avctx);
1647 ff_init_scantable(s->dsp.idct_permutation, &s->scantable, ff_zigzag_direct);
1649 /* initialize to an impossible value which will force a recalculation
1650 * in the first frame decode */
1651 s->quality_index = -1;
1653 s->y_superblock_width = (s->width + 31) / 32;
1654 s->y_superblock_height = (s->height + 31) / 32;
1655 y_superblock_count = s->y_superblock_width * s->y_superblock_height;
1657 /* work out the dimensions for the C planes */
1658 c_width = s->width / 2;
1659 c_height = s->height / 2;
1660 s->c_superblock_width = (c_width + 31) / 32;
1661 s->c_superblock_height = (c_height + 31) / 32;
1662 c_superblock_count = s->c_superblock_width * s->c_superblock_height;
1664 s->superblock_count = y_superblock_count + (c_superblock_count * 2);
1665 s->u_superblock_start = y_superblock_count;
1666 s->v_superblock_start = s->u_superblock_start + c_superblock_count;
1667 s->superblock_coding = av_malloc(s->superblock_count);
1669 s->macroblock_width = (s->width + 15) / 16;
1670 s->macroblock_height = (s->height + 15) / 16;
1671 s->macroblock_count = s->macroblock_width * s->macroblock_height;
1673 s->fragment_width = s->width / FRAGMENT_PIXELS;
1674 s->fragment_height = s->height / FRAGMENT_PIXELS;
1676 /* fragment count covers all 8x8 blocks for all 3 planes */
1677 s->fragment_count = s->fragment_width * s->fragment_height * 3 / 2;
1678 s->fragment_start[1] = s->fragment_width * s->fragment_height;
1679 s->fragment_start[2] = s->fragment_width * s->fragment_height * 5 / 4;
1681 s->all_fragments = av_malloc(s->fragment_count * sizeof(Vp3Fragment));
1682 s->coeff_counts = av_malloc(s->fragment_count * sizeof(*s->coeff_counts));
1683 s->coeffs = av_malloc(s->fragment_count * sizeof(Coeff) * 65);
1684 s->coded_fragment_list = av_malloc(s->fragment_count * sizeof(int));
1685 s->pixel_addresses_initialized = 0;
1687 if (!s->theora_tables)
1689 for (i = 0; i < 64; i++) {
1690 s->coded_dc_scale_factor[i] = vp31_dc_scale_factor[i];
1691 s->coded_ac_scale_factor[i] = vp31_ac_scale_factor[i];
1692 s->base_matrix[0][i] = vp31_intra_y_dequant[i];
1693 s->base_matrix[1][i] = vp31_intra_c_dequant[i];
1694 s->base_matrix[2][i] = vp31_inter_dequant[i];
1695 s->filter_limit_values[i] = vp31_filter_limit_values[i];
1698 for(inter=0; inter<2; inter++){
1699 for(plane=0; plane<3; plane++){
1700 s->qr_count[inter][plane]= 1;
1701 s->qr_size [inter][plane][0]= 63;
1702 s->qr_base [inter][plane][0]=
1703 s->qr_base [inter][plane][1]= 2*inter + (!!plane)*!inter;
1707 /* init VLC tables */
1708 for (i = 0; i < 16; i++) {
1711 init_vlc(&s->dc_vlc[i], 5, 32,
1712 &dc_bias[i][0][1], 4, 2,
1713 &dc_bias[i][0][0], 4, 2, 0);
1715 /* group 1 AC histograms */
1716 init_vlc(&s->ac_vlc_1[i], 5, 32,
1717 &ac_bias_0[i][0][1], 4, 2,
1718 &ac_bias_0[i][0][0], 4, 2, 0);
1720 /* group 2 AC histograms */
1721 init_vlc(&s->ac_vlc_2[i], 5, 32,
1722 &ac_bias_1[i][0][1], 4, 2,
1723 &ac_bias_1[i][0][0], 4, 2, 0);
1725 /* group 3 AC histograms */
1726 init_vlc(&s->ac_vlc_3[i], 5, 32,
1727 &ac_bias_2[i][0][1], 4, 2,
1728 &ac_bias_2[i][0][0], 4, 2, 0);
1730 /* group 4 AC histograms */
1731 init_vlc(&s->ac_vlc_4[i], 5, 32,
1732 &ac_bias_3[i][0][1], 4, 2,
1733 &ac_bias_3[i][0][0], 4, 2, 0);
1736 for (i = 0; i < 16; i++) {
1739 init_vlc(&s->dc_vlc[i], 5, 32,
1740 &s->huffman_table[i][0][1], 4, 2,
1741 &s->huffman_table[i][0][0], 4, 2, 0);
1743 /* group 1 AC histograms */
1744 init_vlc(&s->ac_vlc_1[i], 5, 32,
1745 &s->huffman_table[i+16][0][1], 4, 2,
1746 &s->huffman_table[i+16][0][0], 4, 2, 0);
1748 /* group 2 AC histograms */
1749 init_vlc(&s->ac_vlc_2[i], 5, 32,
1750 &s->huffman_table[i+16*2][0][1], 4, 2,
1751 &s->huffman_table[i+16*2][0][0], 4, 2, 0);
1753 /* group 3 AC histograms */
1754 init_vlc(&s->ac_vlc_3[i], 5, 32,
1755 &s->huffman_table[i+16*3][0][1], 4, 2,
1756 &s->huffman_table[i+16*3][0][0], 4, 2, 0);
1758 /* group 4 AC histograms */
1759 init_vlc(&s->ac_vlc_4[i], 5, 32,
1760 &s->huffman_table[i+16*4][0][1], 4, 2,
1761 &s->huffman_table[i+16*4][0][0], 4, 2, 0);
1765 init_vlc(&s->superblock_run_length_vlc, 6, 34,
1766 &superblock_run_length_vlc_table[0][1], 4, 2,
1767 &superblock_run_length_vlc_table[0][0], 4, 2, 0);
1769 init_vlc(&s->fragment_run_length_vlc, 5, 30,
1770 &fragment_run_length_vlc_table[0][1], 4, 2,
1771 &fragment_run_length_vlc_table[0][0], 4, 2, 0);
1773 init_vlc(&s->mode_code_vlc, 3, 8,
1774 &mode_code_vlc_table[0][1], 2, 1,
1775 &mode_code_vlc_table[0][0], 2, 1, 0);
1777 init_vlc(&s->motion_vector_vlc, 6, 63,
1778 &motion_vector_vlc_table[0][1], 2, 1,
1779 &motion_vector_vlc_table[0][0], 2, 1, 0);
1781 /* work out the block mapping tables */
1782 s->superblock_fragments = av_malloc(s->superblock_count * 16 * sizeof(int));
1783 s->superblock_macroblocks = av_malloc(s->superblock_count * 4 * sizeof(int));
1784 s->macroblock_fragments = av_malloc(s->macroblock_count * 6 * sizeof(int));
1785 s->macroblock_coding = av_malloc(s->macroblock_count + 1);
1786 init_block_mapping(s);
1788 for (i = 0; i < 3; i++) {
1789 s->current_frame.data[i] = NULL;
1790 s->last_frame.data[i] = NULL;
1791 s->golden_frame.data[i] = NULL;
1798 * This is the ffmpeg/libavcodec API frame decode function.
1800 static int vp3_decode_frame(AVCodecContext *avctx,
1801 void *data, int *data_size,
1802 const uint8_t *buf, int buf_size)
1804 Vp3DecodeContext *s = avctx->priv_data;
1806 static int counter = 0;
1809 init_get_bits(&gb, buf, buf_size * 8);
1811 if (s->theora && get_bits1(&gb))
1813 av_log(avctx, AV_LOG_ERROR, "Header packet passed to frame decoder, skipping\n");
1817 s->keyframe = !get_bits1(&gb);
1820 s->last_quality_index = s->quality_index;
1824 s->qis[s->nqis++]= get_bits(&gb, 6);
1825 } while(s->theora >= 0x030200 && s->nqis<3 && get_bits1(&gb));
1827 s->quality_index= s->qis[0];
1829 if (s->avctx->debug & FF_DEBUG_PICT_INFO)
1830 av_log(s->avctx, AV_LOG_INFO, " VP3 %sframe #%d: Q index = %d\n",
1831 s->keyframe?"key":"", counter, s->quality_index);
1834 if (s->quality_index != s->last_quality_index) {
1835 init_dequantizer(s);
1836 init_loop_filter(s);
1839 if (avctx->skip_frame >= AVDISCARD_NONKEY && !s->keyframe)
1845 skip_bits(&gb, 4); /* width code */
1846 skip_bits(&gb, 4); /* height code */
1849 s->version = get_bits(&gb, 5);
1851 av_log(s->avctx, AV_LOG_DEBUG, "VP version: %d\n", s->version);
1854 if (s->version || s->theora)
1857 av_log(s->avctx, AV_LOG_ERROR, "Warning, unsupported keyframe coding type?!\n");
1858 skip_bits(&gb, 2); /* reserved? */
1861 if (s->last_frame.data[0] == s->golden_frame.data[0]) {
1862 if (s->golden_frame.data[0])
1863 avctx->release_buffer(avctx, &s->golden_frame);
1864 s->last_frame= s->golden_frame; /* ensure that we catch any access to this released frame */
1866 if (s->golden_frame.data[0])
1867 avctx->release_buffer(avctx, &s->golden_frame);
1868 if (s->last_frame.data[0])
1869 avctx->release_buffer(avctx, &s->last_frame);
1872 s->golden_frame.reference = 3;
1873 if(avctx->get_buffer(avctx, &s->golden_frame) < 0) {
1874 av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
1878 /* golden frame is also the current frame */
1879 s->current_frame= s->golden_frame;
1881 /* time to figure out pixel addresses? */
1882 if (!s->pixel_addresses_initialized)
1884 vp3_calculate_pixel_addresses(s);
1885 s->pixel_addresses_initialized = 1;
1888 /* allocate a new current frame */
1889 s->current_frame.reference = 3;
1890 if (!s->pixel_addresses_initialized) {
1891 av_log(s->avctx, AV_LOG_ERROR, "vp3: first frame not a keyframe\n");
1894 if(avctx->get_buffer(avctx, &s->current_frame) < 0) {
1895 av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
1900 s->current_frame.qscale_table= s->qscale_table; //FIXME allocate individual tables per AVFrame
1901 s->current_frame.qstride= 0;
1905 if (unpack_superblocks(s, &gb)){
1906 av_log(s->avctx, AV_LOG_ERROR, "error in unpack_superblocks\n");
1909 if (unpack_modes(s, &gb)){
1910 av_log(s->avctx, AV_LOG_ERROR, "error in unpack_modes\n");
1913 if (unpack_vectors(s, &gb)){
1914 av_log(s->avctx, AV_LOG_ERROR, "error in unpack_vectors\n");
1917 if (unpack_dct_coeffs(s, &gb)){
1918 av_log(s->avctx, AV_LOG_ERROR, "error in unpack_dct_coeffs\n");
1922 reverse_dc_prediction(s, 0, s->fragment_width, s->fragment_height);
1923 if ((avctx->flags & CODEC_FLAG_GRAY) == 0) {
1924 reverse_dc_prediction(s, s->fragment_start[1],
1925 s->fragment_width / 2, s->fragment_height / 2);
1926 reverse_dc_prediction(s, s->fragment_start[2],
1927 s->fragment_width / 2, s->fragment_height / 2);
1930 for (i = 0; i < s->macroblock_height; i++)
1933 apply_loop_filter(s);
1935 *data_size=sizeof(AVFrame);
1936 *(AVFrame*)data= s->current_frame;
1938 /* release the last frame, if it is allocated and if it is not the
1940 if ((s->last_frame.data[0]) &&
1941 (s->last_frame.data[0] != s->golden_frame.data[0]))
1942 avctx->release_buffer(avctx, &s->last_frame);
1944 /* shuffle frames (last = current) */
1945 s->last_frame= s->current_frame;
1946 s->current_frame.data[0]= NULL; /* ensure that we catch any access to this released frame */
1952 * This is the ffmpeg/libavcodec API module cleanup function.
1954 static av_cold int vp3_decode_end(AVCodecContext *avctx)
1956 Vp3DecodeContext *s = avctx->priv_data;
1959 av_free(s->superblock_coding);
1960 av_free(s->all_fragments);
1961 av_free(s->coeff_counts);
1963 av_free(s->coded_fragment_list);
1964 av_free(s->superblock_fragments);
1965 av_free(s->superblock_macroblocks);
1966 av_free(s->macroblock_fragments);
1967 av_free(s->macroblock_coding);
1969 for (i = 0; i < 16; i++) {
1970 free_vlc(&s->dc_vlc[i]);
1971 free_vlc(&s->ac_vlc_1[i]);
1972 free_vlc(&s->ac_vlc_2[i]);
1973 free_vlc(&s->ac_vlc_3[i]);
1974 free_vlc(&s->ac_vlc_4[i]);
1977 free_vlc(&s->superblock_run_length_vlc);
1978 free_vlc(&s->fragment_run_length_vlc);
1979 free_vlc(&s->mode_code_vlc);
1980 free_vlc(&s->motion_vector_vlc);
1982 /* release all frames */
1983 if (s->golden_frame.data[0] && s->golden_frame.data[0] != s->last_frame.data[0])
1984 avctx->release_buffer(avctx, &s->golden_frame);
1985 if (s->last_frame.data[0])
1986 avctx->release_buffer(avctx, &s->last_frame);
1987 /* no need to release the current_frame since it will always be pointing
1988 * to the same frame as either the golden or last frame */
1993 static int read_huffman_tree(AVCodecContext *avctx, GetBitContext *gb)
1995 Vp3DecodeContext *s = avctx->priv_data;
1997 if (get_bits1(gb)) {
1999 if (s->entries >= 32) { /* overflow */
2000 av_log(avctx, AV_LOG_ERROR, "huffman tree overflow\n");
2003 token = get_bits(gb, 5);
2004 //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);
2005 s->huffman_table[s->hti][token][0] = s->hbits;
2006 s->huffman_table[s->hti][token][1] = s->huff_code_size;
2010 if (s->huff_code_size >= 32) {/* overflow */
2011 av_log(avctx, AV_LOG_ERROR, "huffman tree overflow\n");
2014 s->huff_code_size++;
2016 read_huffman_tree(avctx, gb);
2018 read_huffman_tree(avctx, gb);
2020 s->huff_code_size--;
2025 #ifdef CONFIG_THEORA_DECODER
2026 static int theora_decode_header(AVCodecContext *avctx, GetBitContext *gb)
2028 Vp3DecodeContext *s = avctx->priv_data;
2029 int visible_width, visible_height;
2031 s->theora = get_bits_long(gb, 24);
2032 av_log(avctx, AV_LOG_DEBUG, "Theora bitstream version %X\n", s->theora);
2034 /* 3.2.0 aka alpha3 has the same frame orientation as original vp3 */
2035 /* but previous versions have the image flipped relative to vp3 */
2036 if (s->theora < 0x030200)
2038 s->flipped_image = 1;
2039 av_log(avctx, AV_LOG_DEBUG, "Old (<alpha3) Theora bitstream, flipped image\n");
2042 visible_width = s->width = get_bits(gb, 16) << 4;
2043 visible_height = s->height = get_bits(gb, 16) << 4;
2045 if(avcodec_check_dimensions(avctx, s->width, s->height)){
2046 av_log(avctx, AV_LOG_ERROR, "Invalid dimensions (%dx%d)\n", s->width, s->height);
2047 s->width= s->height= 0;
2051 if (s->theora >= 0x030400)
2053 skip_bits(gb, 32); /* total number of superblocks in a frame */
2054 // fixme, the next field is 36bits long
2055 skip_bits(gb, 32); /* total number of blocks in a frame */
2056 skip_bits(gb, 4); /* total number of blocks in a frame */
2057 skip_bits(gb, 32); /* total number of macroblocks in a frame */
2060 if (s->theora >= 0x030200) {
2061 visible_width = get_bits_long(gb, 24);
2062 visible_height = get_bits_long(gb, 24);
2064 skip_bits(gb, 8); /* offset x */
2065 skip_bits(gb, 8); /* offset y */
2068 skip_bits(gb, 32); /* fps numerator */
2069 skip_bits(gb, 32); /* fps denumerator */
2070 skip_bits(gb, 24); /* aspect numerator */
2071 skip_bits(gb, 24); /* aspect denumerator */
2073 if (s->theora < 0x030200)
2074 skip_bits(gb, 5); /* keyframe frequency force */
2075 skip_bits(gb, 8); /* colorspace */
2076 if (s->theora >= 0x030400)
2077 skip_bits(gb, 2); /* pixel format: 420,res,422,444 */
2078 skip_bits(gb, 24); /* bitrate */
2080 skip_bits(gb, 6); /* quality hint */
2082 if (s->theora >= 0x030200)
2084 skip_bits(gb, 5); /* keyframe frequency force */
2086 if (s->theora < 0x030400)
2087 skip_bits(gb, 5); /* spare bits */
2090 // align_get_bits(gb);
2092 if ( visible_width <= s->width && visible_width > s->width-16
2093 && visible_height <= s->height && visible_height > s->height-16)
2094 avcodec_set_dimensions(avctx, visible_width, visible_height);
2096 avcodec_set_dimensions(avctx, s->width, s->height);
2101 static int theora_decode_tables(AVCodecContext *avctx, GetBitContext *gb)
2103 Vp3DecodeContext *s = avctx->priv_data;
2104 int i, n, matrices, inter, plane;
2106 if (s->theora >= 0x030200) {
2107 n = get_bits(gb, 3);
2108 /* loop filter limit values table */
2109 for (i = 0; i < 64; i++)
2110 s->filter_limit_values[i] = get_bits(gb, n);
2113 if (s->theora >= 0x030200)
2114 n = get_bits(gb, 4) + 1;
2117 /* quality threshold table */
2118 for (i = 0; i < 64; i++)
2119 s->coded_ac_scale_factor[i] = get_bits(gb, n);
2121 if (s->theora >= 0x030200)
2122 n = get_bits(gb, 4) + 1;
2125 /* dc scale factor table */
2126 for (i = 0; i < 64; i++)
2127 s->coded_dc_scale_factor[i] = get_bits(gb, n);
2129 if (s->theora >= 0x030200)
2130 matrices = get_bits(gb, 9) + 1;
2135 av_log(avctx, AV_LOG_ERROR, "invalid number of base matrixes\n");
2139 for(n=0; n<matrices; n++){
2140 for (i = 0; i < 64; i++)
2141 s->base_matrix[n][i]= get_bits(gb, 8);
2144 for (inter = 0; inter <= 1; inter++) {
2145 for (plane = 0; plane <= 2; plane++) {
2147 if (inter || plane > 0)
2148 newqr = get_bits1(gb);
2151 if(inter && get_bits1(gb)){
2155 qtj= (3*inter + plane - 1) / 3;
2156 plj= (plane + 2) % 3;
2158 s->qr_count[inter][plane]= s->qr_count[qtj][plj];
2159 memcpy(s->qr_size[inter][plane], s->qr_size[qtj][plj], sizeof(s->qr_size[0][0]));
2160 memcpy(s->qr_base[inter][plane], s->qr_base[qtj][plj], sizeof(s->qr_base[0][0]));
2166 i= get_bits(gb, av_log2(matrices-1)+1);
2168 av_log(avctx, AV_LOG_ERROR, "invalid base matrix index\n");
2171 s->qr_base[inter][plane][qri]= i;
2174 i = get_bits(gb, av_log2(63-qi)+1) + 1;
2175 s->qr_size[inter][plane][qri++]= i;
2180 av_log(avctx, AV_LOG_ERROR, "invalid qi %d > 63\n", qi);
2183 s->qr_count[inter][plane]= qri;
2188 /* Huffman tables */
2189 for (s->hti = 0; s->hti < 80; s->hti++) {
2191 s->huff_code_size = 1;
2192 if (!get_bits1(gb)) {
2194 read_huffman_tree(avctx, gb);
2196 read_huffman_tree(avctx, gb);
2200 s->theora_tables = 1;
2205 static int theora_decode_init(AVCodecContext *avctx)
2207 Vp3DecodeContext *s = avctx->priv_data;
2210 uint8_t *header_start[3];
2216 if (!avctx->extradata_size)
2218 av_log(avctx, AV_LOG_ERROR, "Missing extradata!\n");
2222 if (ff_split_xiph_headers(avctx->extradata, avctx->extradata_size,
2223 42, header_start, header_len) < 0) {
2224 av_log(avctx, AV_LOG_ERROR, "Corrupt extradata\n");
2229 init_get_bits(&gb, header_start[i], header_len[i]);
2231 ptype = get_bits(&gb, 8);
2233 if (!(ptype & 0x80))
2235 av_log(avctx, AV_LOG_ERROR, "Invalid extradata!\n");
2239 // FIXME: Check for this as well.
2240 skip_bits(&gb, 6*8); /* "theora" */
2245 theora_decode_header(avctx, &gb);
2248 // FIXME: is this needed? it breaks sometimes
2249 // theora_decode_comments(avctx, gb);
2252 theora_decode_tables(avctx, &gb);
2255 av_log(avctx, AV_LOG_ERROR, "Unknown Theora config packet: %d\n", ptype&~0x80);
2258 if(ptype != 0x81 && 8*header_len[i] != get_bits_count(&gb))
2259 av_log(avctx, AV_LOG_WARNING, "%d bits left in packet %X\n", 8*header_len[i] - get_bits_count(&gb), ptype);
2260 if (s->theora < 0x030200)
2264 vp3_decode_init(avctx);
2268 AVCodec theora_decoder = {
2272 sizeof(Vp3DecodeContext),
2279 .long_name = NULL_IF_CONFIG_SMALL("Theora"),
2283 AVCodec vp3_decoder = {
2287 sizeof(Vp3DecodeContext),
2294 .long_name = NULL_IF_CONFIG_SMALL("On2 VP3"),