vp3.c 82.7 KB
Newer Older
1
/*
2
 * Copyright (C) 2003-2004 the ffmpeg project
3
 *
4 5 6
 * This file is part of FFmpeg.
 *
 * FFmpeg is free software; you can redistribute it and/or
7 8
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
9
 * version 2.1 of the License, or (at your option) any later version.
10
 *
11
 * FFmpeg is distributed in the hope that it will be useful,
12 13 14 15 16
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
17
 * License along with FFmpeg; if not, write to the Free Software
18
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 20 21
 */

/**
22
 * @file libavcodec/vp3.c
23
 * On2 VP3 Video Decoder
24 25 26
 *
 * VP3 Video Decoder by Mike Melanson (mike at multimedia.cx)
 * For more information about the VP3 coding process, visit:
27
 *   http://wiki.multimedia.cx/index.php?title=On2_VP3
28 29
 *
 * Theora decoder by Alex Beregszaszi
30 31 32 33 34 35 36 37 38
 */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>

#include "avcodec.h"
#include "dsputil.h"
39
#include "get_bits.h"
40 41

#include "vp3data.h"
42
#include "xiph.h"
43 44 45

#define FRAGMENT_PIXELS 8

46 47 48 49 50 51 52
typedef struct Coeff {
    struct Coeff *next;
    DCTELEM coeff;
    uint8_t index;
} Coeff;

//FIXME split things out into their own arrays
53
typedef struct Vp3Fragment {
54
    Coeff *next_coeff;
55 56 57 58
    /* address of first pixel taking into account which plane the fragment
     * lives on as well as the plane stride */
    int first_pixel;
    /* this is the macroblock that the fragment belongs to */
59 60 61 62
    uint16_t macroblock;
    uint8_t coding_method;
    int8_t motion_x;
    int8_t motion_y;
63
    uint8_t qpi;
64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83
} Vp3Fragment;

#define SB_NOT_CODED        0
#define SB_PARTIALLY_CODED  1
#define SB_FULLY_CODED      2

#define MODE_INTER_NO_MV      0
#define MODE_INTRA            1
#define MODE_INTER_PLUS_MV    2
#define MODE_INTER_LAST_MV    3
#define MODE_INTER_PRIOR_LAST 4
#define MODE_USING_GOLDEN     5
#define MODE_GOLDEN_MV        6
#define MODE_INTER_FOURMV     7
#define CODING_MODE_COUNT     8

/* special internal mode */
#define MODE_COPY             8

/* There are 6 preset schemes, plus a free-form scheme */
84
static const int ModeAlphabet[6][CODING_MODE_COUNT] =
85 86
{
    /* scheme 1: Last motion vector dominates */
87
    {    MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
88
         MODE_INTER_PLUS_MV,    MODE_INTER_NO_MV,
89
         MODE_INTRA,            MODE_USING_GOLDEN,
90 91 92
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 2 */
93
    {    MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
94
         MODE_INTER_NO_MV,      MODE_INTER_PLUS_MV,
95
         MODE_INTRA,            MODE_USING_GOLDEN,
96 97 98
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 3 */
99
    {    MODE_INTER_LAST_MV,    MODE_INTER_PLUS_MV,
100
         MODE_INTER_PRIOR_LAST, MODE_INTER_NO_MV,
101
         MODE_INTRA,            MODE_USING_GOLDEN,
102 103 104
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 4 */
105
    {    MODE_INTER_LAST_MV,    MODE_INTER_PLUS_MV,
106
         MODE_INTER_NO_MV,      MODE_INTER_PRIOR_LAST,
107
         MODE_INTRA,            MODE_USING_GOLDEN,
108 109 110
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 5: No motion vector dominates */
111
    {    MODE_INTER_NO_MV,      MODE_INTER_LAST_MV,
112
         MODE_INTER_PRIOR_LAST, MODE_INTER_PLUS_MV,
113
         MODE_INTRA,            MODE_USING_GOLDEN,
114 115 116
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 6 */
117
    {    MODE_INTER_NO_MV,      MODE_USING_GOLDEN,
118
         MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
119
         MODE_INTER_PLUS_MV,    MODE_INTRA,
120 121 122 123 124 125 126 127
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

};

#define MIN_DEQUANT_VAL 2

typedef struct Vp3DecodeContext {
    AVCodecContext *avctx;
128
    int theora, theora_tables;
A
Alex Beregszaszi 已提交
129
    int version;
130 131 132 133 134 135
    int width, height;
    AVFrame golden_frame;
    AVFrame last_frame;
    AVFrame current_frame;
    int keyframe;
    DSPContext dsp;
136
    int flipped_image;
137

138 139 140
    int qps[3];
    int nqps;
    int last_qps[3];
141 142

    int superblock_count;
143 144 145 146
    int y_superblock_width;
    int y_superblock_height;
    int c_superblock_width;
    int c_superblock_height;
147 148 149 150 151 152 153 154 155 156 157 158 159
    int u_superblock_start;
    int v_superblock_start;
    unsigned char *superblock_coding;

    int macroblock_count;
    int macroblock_width;
    int macroblock_height;

    int fragment_count;
    int fragment_width;
    int fragment_height;

    Vp3Fragment *all_fragments;
160
    uint8_t *coeff_counts;
161 162
    Coeff *coeffs;
    Coeff *next_coeff;
M
Michael Niedermayer 已提交
163
    int fragment_start[3];
164

M
Michael Niedermayer 已提交
165
    ScanTable scantable;
166

167 168
    /* tables */
    uint16_t coded_dc_scale_factor[64];
169
    uint32_t coded_ac_scale_factor[64];
170 171 172 173
    uint8_t base_matrix[384][64];
    uint8_t qr_count[2][3];
    uint8_t qr_size [2][3][64];
    uint16_t qr_base[2][3][64];
174

175
    /* this is a list of indexes into the all_fragments array indicating
176 177 178
     * which of the fragments are coded */
    int *coded_fragment_list;
    int coded_fragment_list_index;
D
Diego Biurrun 已提交
179
    int pixel_addresses_initialized;
180 181 182 183 184 185 186

    VLC dc_vlc[16];
    VLC ac_vlc_1[16];
    VLC ac_vlc_2[16];
    VLC ac_vlc_3[16];
    VLC ac_vlc_4[16];

187 188 189 190 191
    VLC superblock_run_length_vlc;
    VLC fragment_run_length_vlc;
    VLC mode_code_vlc;
    VLC motion_vector_vlc;

192 193
    /* these arrays need to be on 16-byte boundaries since SSE2 operations
     * index into them */
194
    DECLARE_ALIGNED_16(int16_t, qmat[3][2][3][64]);     //<qmat[qpi][is_inter][plane]
195 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 199 200 201 202
     * An entry will be -1 to indicate that no entry corresponds to that
     * index. */
    int *superblock_fragments;

    /* This table contains superblock_count * 4 entries. Each set of 4
203
     * numbers corresponds to the macroblock indexes 0..3 of the superblock.
204 205 206 207 208
     * An entry will be -1 to indicate that no entry corresponds to that
     * index. */
    int *superblock_macroblocks;

    /* This table contains macroblock_count * 6 entries. Each set of 6
209
     * numbers corresponds to the fragment indexes 0..5 which comprise
210 211
     * the macroblock (4 Y fragments and 2 C fragments). */
    int *macroblock_fragments;
212
    /* This is an array that indicates how a particular macroblock
213
     * is coded. */
214
    unsigned char *macroblock_coding;
215

216 217 218 219 220
    int first_coded_y_fragment;
    int first_coded_c_fragment;
    int last_coded_y_fragment;
    int last_coded_c_fragment;

M
Michael Niedermayer 已提交
221
    uint8_t edge_emu_buffer[9*2048]; //FIXME dynamic alloc
M
Måns Rullgård 已提交
222
    int8_t qscale_table[2048]; //FIXME dynamic alloc (width+15)/16
223

224 225 226 227 228 229 230
    /* Huffman decode */
    int hti;
    unsigned int hbits;
    int entries;
    int huff_code_size;
    uint16_t huffman_table[80][32][2];

231
    uint8_t filter_limit_values[64];
D
David Conrad 已提交
232
    DECLARE_ALIGNED_8(int, bounding_values_array[256+2]);
233 234 235 236 237 238 239 240 241 242
} Vp3DecodeContext;

/************************************************************************
 * VP3 specific functions
 ************************************************************************/

/*
 * This function sets up all of the various blocks mappings:
 * superblocks <-> fragments, macroblocks <-> fragments,
 * superblocks <-> macroblocks
243 244
 *
 * Returns 0 is successful; returns 1 if *anything* went wrong.
245
 */
246
static int init_block_mapping(Vp3DecodeContext *s)
247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262
{
    int i, j;
    signed int hilbert_walk_mb[4];

    int current_fragment = 0;
    int current_width = 0;
    int current_height = 0;
    int right_edge = 0;
    int bottom_edge = 0;
    int superblock_row_inc = 0;
    int mapping_index = 0;

    int current_macroblock;
    int c_fragment;

    signed char travel_width[16] = {
263
         1,  1,  0, -1,
264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296
         0,  0,  1,  0,
         1,  0,  1,  0,
         0, -1,  0,  1
    };

    signed char travel_height[16] = {
         0,  0,  1,  0,
         1,  1,  0, -1,
         0,  1,  0, -1,
        -1,  0, -1,  0
    };

    signed char travel_width_mb[4] = {
         1,  0,  1,  0
    };

    signed char travel_height_mb[4] = {
         0,  1,  0, -1
    };

    hilbert_walk_mb[0] = 1;
    hilbert_walk_mb[1] = s->macroblock_width;
    hilbert_walk_mb[2] = 1;
    hilbert_walk_mb[3] = -s->macroblock_width;

    /* iterate through each superblock (all planes) and map the fragments */
    for (i = 0; i < s->superblock_count; i++) {
        /* time to re-assign the limits? */
        if (i == 0) {

            /* start of Y superblocks */
            right_edge = s->fragment_width;
            bottom_edge = s->fragment_height;
297
            current_width = -1;
298
            current_height = 0;
299
            superblock_row_inc = 3 * s->fragment_width -
300
                (s->y_superblock_width * 4 - s->fragment_width);
301 302 303 304 305 306 307 308 309

            /* the first operation for this variable is to advance by 1 */
            current_fragment = -1;

        } else if (i == s->u_superblock_start) {

            /* start of U superblocks */
            right_edge = s->fragment_width / 2;
            bottom_edge = s->fragment_height / 2;
310
            current_width = -1;
311
            current_height = 0;
312
            superblock_row_inc = 3 * (s->fragment_width / 2) -
313
                (s->c_superblock_width * 4 - s->fragment_width / 2);
314 315

            /* the first operation for this variable is to advance by 1 */
M
Michael Niedermayer 已提交
316
            current_fragment = s->fragment_start[1] - 1;
317 318 319 320 321 322

        } else if (i == s->v_superblock_start) {

            /* start of V superblocks */
            right_edge = s->fragment_width / 2;
            bottom_edge = s->fragment_height / 2;
323
            current_width = -1;
324
            current_height = 0;
325
            superblock_row_inc = 3 * (s->fragment_width / 2) -
326
                (s->c_superblock_width * 4 - s->fragment_width / 2);
327 328

            /* the first operation for this variable is to advance by 1 */
M
Michael Niedermayer 已提交
329
            current_fragment = s->fragment_start[2] - 1;
330 331 332

        }

333
        if (current_width >= right_edge - 1) {
334
            /* reset width and move to next superblock row */
335
            current_width = -1;
336 337 338 339 340 341 342 343
            current_height += 4;

            /* fragment is now at the start of a new superblock row */
            current_fragment += superblock_row_inc;
        }

        /* iterate through all 16 fragments in a superblock */
        for (j = 0; j < 16; j++) {
M
Michael Niedermayer 已提交
344
            current_fragment += travel_width[j] + right_edge * travel_height[j];
345
            current_width += travel_width[j];
346 347 348
            current_height += travel_height[j];

            /* check if the fragment is in bounds */
349
            if ((current_width < right_edge) &&
350 351 352 353 354 355 356 357 358 359 360 361 362 363
                (current_height < bottom_edge)) {
                s->superblock_fragments[mapping_index] = current_fragment;
            } else {
                s->superblock_fragments[mapping_index] = -1;
            }

            mapping_index++;
        }
    }

    /* initialize the superblock <-> macroblock mapping; iterate through
     * all of the Y plane superblocks to build this mapping */
    right_edge = s->macroblock_width;
    bottom_edge = s->macroblock_height;
364
    current_width = -1;
365
    current_height = 0;
366
    superblock_row_inc = s->macroblock_width -
M
Fix ;;  
Michael Niedermayer 已提交
367
        (s->y_superblock_width * 2 - s->macroblock_width);
368 369 370 371
    mapping_index = 0;
    current_macroblock = -1;
    for (i = 0; i < s->u_superblock_start; i++) {

372
        if (current_width >= right_edge - 1) {
373
            /* reset width and move to next superblock row */
374
            current_width = -1;
375 376 377 378 379 380 381 382 383
            current_height += 2;

            /* macroblock is now at the start of a new superblock row */
            current_macroblock += superblock_row_inc;
        }

        /* iterate through each potential macroblock in the superblock */
        for (j = 0; j < 4; j++) {
            current_macroblock += hilbert_walk_mb[j];
384
            current_width += travel_width_mb[j];
385 386 387
            current_height += travel_height_mb[j];

            /* check if the macroblock is in bounds */
388
            if ((current_width < right_edge) &&
389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416
                (current_height < bottom_edge)) {
                s->superblock_macroblocks[mapping_index] = current_macroblock;
            } else {
                s->superblock_macroblocks[mapping_index] = -1;
            }

            mapping_index++;
        }
    }

    /* initialize the macroblock <-> fragment mapping */
    current_fragment = 0;
    current_macroblock = 0;
    mapping_index = 0;
    for (i = 0; i < s->fragment_height; i += 2) {

        for (j = 0; j < s->fragment_width; j += 2) {

            s->all_fragments[current_fragment].macroblock = current_macroblock;
            s->macroblock_fragments[mapping_index++] = current_fragment;

            if (j + 1 < s->fragment_width) {
                s->all_fragments[current_fragment + 1].macroblock = current_macroblock;
                s->macroblock_fragments[mapping_index++] = current_fragment + 1;
            } else
                s->macroblock_fragments[mapping_index++] = -1;

            if (i + 1 < s->fragment_height) {
417
                s->all_fragments[current_fragment + s->fragment_width].macroblock =
418
                    current_macroblock;
419
                s->macroblock_fragments[mapping_index++] =
420 421 422 423 424
                    current_fragment + s->fragment_width;
            } else
                s->macroblock_fragments[mapping_index++] = -1;

            if ((j + 1 < s->fragment_width) && (i + 1 < s->fragment_height)) {
425
                s->all_fragments[current_fragment + s->fragment_width + 1].macroblock =
426
                    current_macroblock;
427
                s->macroblock_fragments[mapping_index++] =
428 429 430 431 432
                    current_fragment + s->fragment_width + 1;
            } else
                s->macroblock_fragments[mapping_index++] = -1;

            /* C planes */
M
Michael Niedermayer 已提交
433
            c_fragment = s->fragment_start[1] +
434
                (i * s->fragment_width / 4) + (j / 2);
435
            s->all_fragments[c_fragment].macroblock = s->macroblock_count;
436 437
            s->macroblock_fragments[mapping_index++] = c_fragment;

M
Michael Niedermayer 已提交
438
            c_fragment = s->fragment_start[2] +
439
                (i * s->fragment_width / 4) + (j / 2);
440
            s->all_fragments[c_fragment].macroblock = s->macroblock_count;
441 442 443 444
            s->macroblock_fragments[mapping_index++] = c_fragment;

            if (j + 2 <= s->fragment_width)
                current_fragment += 2;
445
            else
446 447 448 449 450 451
                current_fragment++;
            current_macroblock++;
        }

        current_fragment += s->fragment_width;
    }
452 453

    return 0;  /* successful path out */
454 455 456 457 458 459 460 461 462 463 464 465
}

/*
 * This function wipes out all of the fragment data.
 */
static void init_frame(Vp3DecodeContext *s, GetBitContext *gb)
{
    int i;

    /* zero out all of the fragment information */
    s->coded_fragment_list_index = 0;
    for (i = 0; i < s->fragment_count; i++) {
466
        s->coeff_counts[i] = 0;
467 468 469
        s->all_fragments[i].motion_x = 127;
        s->all_fragments[i].motion_y = 127;
        s->all_fragments[i].next_coeff= NULL;
470
        s->all_fragments[i].qpi = 0;
471 472 473
        s->coeffs[i].index=
        s->coeffs[i].coeff=0;
        s->coeffs[i].next= NULL;
474 475 476 477
    }
}

/*
478
 * This function sets up the dequantization tables used for a particular
479 480
 * frame.
 */
481
static void init_dequantizer(Vp3DecodeContext *s, int qpi)
482
{
483 484
    int ac_scale_factor = s->coded_ac_scale_factor[s->qps[qpi]];
    int dc_scale_factor = s->coded_dc_scale_factor[s->qps[qpi]];
485
    int i, plane, inter, qri, bmi, bmj, qistart;
486

487 488 489 490 491
    for(inter=0; inter<2; inter++){
        for(plane=0; plane<3; plane++){
            int sum=0;
            for(qri=0; qri<s->qr_count[inter][plane]; qri++){
                sum+= s->qr_size[inter][plane][qri];
492
                if(s->qps[qpi] <= sum)
493 494 495 496 497 498
                    break;
            }
            qistart= sum - s->qr_size[inter][plane][qri];
            bmi= s->qr_base[inter][plane][qri  ];
            bmj= s->qr_base[inter][plane][qri+1];
            for(i=0; i<64; i++){
499 500
                int coeff= (  2*(sum    -s->qps[qpi])*s->base_matrix[bmi][i]
                            - 2*(qistart-s->qps[qpi])*s->base_matrix[bmj][i]
501 502 503
                            + s->qr_size[inter][plane][qri])
                           / (2*s->qr_size[inter][plane][qri]);

M
Michael Niedermayer 已提交
504
                int qmin= 8<<(inter + !i);
505 506
                int qscale= i ? ac_scale_factor : dc_scale_factor;

507
                s->qmat[qpi][inter][plane][s->dsp.idct_permutation[i]]= av_clip((qscale * coeff)/100 * 4, qmin, 4096);
508
            }
509 510
            // all DC coefficients use the same quant so as not to interfere with DC prediction
            s->qmat[qpi][inter][plane][0] = s->qmat[0][inter][plane][0];
511
        }
512
    }
513

514
    memset(s->qscale_table, (FFMAX(s->qmat[0][0][0][1], s->qmat[0][0][1][1])+8)/16, 512); //FIXME finetune
515 516
}

517 518 519 520 521 522 523 524 525 526
/*
 * This function initializes the loop filter boundary limits if the frame's
 * quality index is different from the previous frame's.
 */
static void init_loop_filter(Vp3DecodeContext *s)
{
    int *bounding_values= s->bounding_values_array+127;
    int filter_limit;
    int x;

527
    filter_limit = s->filter_limit_values[s->qps[0]];
528 529 530 531 532 533 534 535 536

    /* set up the bounding values */
    memset(s->bounding_values_array, 0, 256 * sizeof(int));
    for (x = 0; x < filter_limit; x++) {
        bounding_values[-x - filter_limit] = -filter_limit + x;
        bounding_values[-x] = -x;
        bounding_values[x] = x;
        bounding_values[x + filter_limit] = filter_limit - x;
    }
D
David Conrad 已提交
537
    bounding_values[129] = bounding_values[130] = filter_limit * 0x02020202;
538 539
}

540
/*
541
 * This function unpacks all of the superblock/macroblock/fragment coding
542 543
 * information from the bitstream.
 */
544
static int unpack_superblocks(Vp3DecodeContext *s, GetBitContext *gb)
545 546 547 548 549 550
{
    int bit = 0;
    int current_superblock = 0;
    int current_run = 0;
    int decode_fully_flags = 0;
    int decode_partial_blocks = 0;
551
    int first_c_fragment_seen;
552 553 554 555 556 557 558 559 560 561

    int i, j;
    int current_fragment;

    if (s->keyframe) {
        memset(s->superblock_coding, SB_FULLY_CODED, s->superblock_count);

    } else {

        /* unpack the list of partially-coded superblocks */
562
        bit = get_bits1(gb);
563
        /* toggle the bit because as soon as the first run length is
564 565 566
         * fetched the bit will be toggled again */
        bit ^= 1;
        while (current_superblock < s->superblock_count) {
567
            if (current_run-- == 0) {
568
                bit ^= 1;
569
                current_run = get_vlc2(gb,
570 571
                    s->superblock_run_length_vlc.table, 6, 2);
                if (current_run == 33)
572
                    current_run += get_bits(gb, 12);
573 574 575

                /* if any of the superblocks are not partially coded, flag
                 * a boolean to decode the list of fully-coded superblocks */
576
                if (bit == 0) {
577
                    decode_fully_flags = 1;
578
                } else {
579

580 581 582 583
                    /* make a note of the fact that there are partially coded
                     * superblocks */
                    decode_partial_blocks = 1;
                }
584
            }
585
            s->superblock_coding[current_superblock++] = bit;
586 587 588 589 590 591 592 593
        }

        /* unpack the list of fully coded superblocks if any of the blocks were
         * not marked as partially coded in the previous step */
        if (decode_fully_flags) {

            current_superblock = 0;
            current_run = 0;
594
            bit = get_bits1(gb);
595
            /* toggle the bit because as soon as the first run length is
596 597 598 599 600 601 602
             * fetched the bit will be toggled again */
            bit ^= 1;
            while (current_superblock < s->superblock_count) {

                /* skip any superblocks already marked as partially coded */
                if (s->superblock_coding[current_superblock] == SB_NOT_CODED) {

603
                    if (current_run-- == 0) {
604
                        bit ^= 1;
605
                        current_run = get_vlc2(gb,
606 607
                            s->superblock_run_length_vlc.table, 6, 2);
                        if (current_run == 33)
608
                            current_run += get_bits(gb, 12);
609
                    }
610
                    s->superblock_coding[current_superblock] = 2*bit;
611 612 613 614 615 616 617 618 619 620
                }
                current_superblock++;
            }
        }

        /* if there were partial blocks, initialize bitstream for
         * unpacking fragment codings */
        if (decode_partial_blocks) {

            current_run = 0;
621
            bit = get_bits1(gb);
622
            /* toggle the bit because as soon as the first run length is
623 624 625 626 627 628 629 630
             * fetched the bit will be toggled again */
            bit ^= 1;
        }
    }

    /* figure out which fragments are coded; iterate through each
     * superblock (all planes) */
    s->coded_fragment_list_index = 0;
631
    s->next_coeff= s->coeffs + s->fragment_count;
632 633
    s->first_coded_y_fragment = s->first_coded_c_fragment = 0;
    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 637 638 639 640 641 642
    for (i = 0; i < s->superblock_count; i++) {

        /* iterate through all 16 fragments in a superblock */
        for (j = 0; j < 16; j++) {

            /* if the fragment is in bounds, check its coding status */
            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 646 647
                    current_fragment, s->fragment_count);
                return 1;
            }
648 649 650 651
            if (current_fragment != -1) {
                if (s->superblock_coding[i] == SB_NOT_CODED) {

                    /* copy all the fragments from the prior frame */
652
                    s->all_fragments[current_fragment].coding_method =
653 654 655 656 657 658
                        MODE_COPY;

                } else if (s->superblock_coding[i] == SB_PARTIALLY_CODED) {

                    /* fragment may or may not be coded; this is the case
                     * that cares about the fragment coding runs */
659
                    if (current_run-- == 0) {
660
                        bit ^= 1;
661
                        current_run = get_vlc2(gb,
662
                            s->fragment_run_length_vlc.table, 5, 2);
663 664 665
                    }

                    if (bit) {
666
                        /* default mode; actual mode will be decoded in
667
                         * the next phase */
668
                        s->all_fragments[current_fragment].coding_method =
669
                            MODE_INTER_NO_MV;
670
                        s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
671
                        s->coded_fragment_list[s->coded_fragment_list_index] =
672
                            current_fragment;
M
Michael Niedermayer 已提交
673
                        if ((current_fragment >= s->fragment_start[1]) &&
674 675
                            (s->last_coded_y_fragment == -1) &&
                            (!first_c_fragment_seen)) {
676 677
                            s->first_coded_c_fragment = s->coded_fragment_list_index;
                            s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
678
                            first_c_fragment_seen = 1;
679 680
                        }
                        s->coded_fragment_list_index++;
681
                        s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
682 683 684 685 686 687 688 689 690 691
                    } else {
                        /* not coded; copy this fragment from the prior frame */
                        s->all_fragments[current_fragment].coding_method =
                            MODE_COPY;
                    }

                } else {

                    /* fragments are fully coded in this superblock; actual
                     * coding will be determined in next step */
692
                    s->all_fragments[current_fragment].coding_method =
693
                        MODE_INTER_NO_MV;
694
                    s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
695
                    s->coded_fragment_list[s->coded_fragment_list_index] =
696
                        current_fragment;
M
Michael Niedermayer 已提交
697
                    if ((current_fragment >= s->fragment_start[1]) &&
698 699
                        (s->last_coded_y_fragment == -1) &&
                        (!first_c_fragment_seen)) {
700 701
                        s->first_coded_c_fragment = s->coded_fragment_list_index;
                        s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
702
                        first_c_fragment_seen = 1;
703 704
                    }
                    s->coded_fragment_list_index++;
705
                    s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
706 707 708 709
                }
            }
        }
    }
710

711 712
    if (!first_c_fragment_seen)
        /* only Y fragments coded in this frame */
713
        s->last_coded_y_fragment = s->coded_fragment_list_index - 1;
714
    else
715
        /* end the list of coded C fragments */
716
        s->last_coded_c_fragment = s->coded_fragment_list_index - 1;
717

718
    return 0;
719 720 721 722 723 724
}

/*
 * This function unpacks all the coding mode data for individual macroblocks
 * from the bitstream.
 */
725
static int unpack_modes(Vp3DecodeContext *s, GetBitContext *gb)
726 727 728 729 730 731
{
    int i, j, k;
    int scheme;
    int current_macroblock;
    int current_fragment;
    int coding_mode;
732
    int custom_mode_alphabet[CODING_MODE_COUNT];
733 734 735 736 737 738 739 740 741 742 743 744

    if (s->keyframe) {
        for (i = 0; i < s->fragment_count; i++)
            s->all_fragments[i].coding_method = MODE_INTRA;

    } else {

        /* fetch the mode coding scheme for this frame */
        scheme = get_bits(gb, 3);

        /* is it a custom coding scheme? */
        if (scheme == 0) {
745 746
            for (i = 0; i < 8; i++)
                custom_mode_alphabet[i] = MODE_INTER_NO_MV;
747
            for (i = 0; i < 8; i++)
748
                custom_mode_alphabet[get_bits(gb, 3)] = i;
749 750 751 752 753 754 755 756 757
        }

        /* iterate through all of the macroblocks that contain 1 or more
         * coded fragments */
        for (i = 0; i < s->u_superblock_start; i++) {

            for (j = 0; j < 4; j++) {
                current_macroblock = s->superblock_macroblocks[i * 4 + j];
                if ((current_macroblock == -1) ||
758
                    (s->macroblock_coding[current_macroblock] == MODE_COPY))
759
                    continue;
760
                if (current_macroblock >= s->macroblock_count) {
761
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_modes(): bad macroblock number (%d >= %d)\n",
762 763 764
                        current_macroblock, s->macroblock_count);
                    return 1;
                }
765 766 767 768

                /* mode 7 means get 3 bits for each coding mode */
                if (scheme == 7)
                    coding_mode = get_bits(gb, 3);
769 770 771
                else if(scheme == 0)
                    coding_mode = custom_mode_alphabet
                        [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
772
                else
773
                    coding_mode = ModeAlphabet[scheme-1]
774
                        [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
775

776
                s->macroblock_coding[current_macroblock] = coding_mode;
777
                for (k = 0; k < 6; k++) {
778
                    current_fragment =
779
                        s->macroblock_fragments[current_macroblock * 6 + k];
780 781 782
                    if (current_fragment == -1)
                        continue;
                    if (current_fragment >= s->fragment_count) {
783
                        av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_modes(): bad fragment number (%d >= %d)\n",
784 785 786
                            current_fragment, s->fragment_count);
                        return 1;
                    }
787
                    if (s->all_fragments[current_fragment].coding_method !=
788 789 790 791 792 793 794
                        MODE_COPY)
                        s->all_fragments[current_fragment].coding_method =
                            coding_mode;
                }
            }
        }
    }
795 796

    return 0;
797 798
}

799 800 801 802
/*
 * This function unpacks all the motion vectors for the individual
 * macroblocks from the bitstream.
 */
803
static int unpack_vectors(Vp3DecodeContext *s, GetBitContext *gb)
804
{
805
    int i, j, k, l;
806 807 808 809 810 811 812 813 814 815
    int coding_mode;
    int motion_x[6];
    int motion_y[6];
    int last_motion_x = 0;
    int last_motion_y = 0;
    int prior_last_motion_x = 0;
    int prior_last_motion_y = 0;
    int current_macroblock;
    int current_fragment;

D
David Conrad 已提交
816
    if (s->keyframe)
817
        return 0;
D
David Conrad 已提交
818

D
David Conrad 已提交
819 820
    memset(motion_x, 0, 6 * sizeof(int));
    memset(motion_y, 0, 6 * sizeof(int));
821

D
David Conrad 已提交
822 823
    /* coding mode 0 is the VLC scheme; 1 is the fixed code scheme */
    coding_mode = get_bits1(gb);
824

D
David Conrad 已提交
825 826 827
    /* iterate through all of the macroblocks that contain 1 or more
     * coded fragments */
    for (i = 0; i < s->u_superblock_start; i++) {
828

D
David Conrad 已提交
829 830 831 832 833 834 835 836 837 838
        for (j = 0; j < 4; j++) {
            current_macroblock = s->superblock_macroblocks[i * 4 + j];
            if ((current_macroblock == -1) ||
                (s->macroblock_coding[current_macroblock] == MODE_COPY))
                continue;
            if (current_macroblock >= s->macroblock_count) {
                av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad macroblock number (%d >= %d)\n",
                    current_macroblock, s->macroblock_count);
                return 1;
            }
839

D
David Conrad 已提交
840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856
            current_fragment = s->macroblock_fragments[current_macroblock * 6];
            if (current_fragment >= s->fragment_count) {
                av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad fragment number (%d >= %d\n",
                    current_fragment, s->fragment_count);
                return 1;
            }
            switch (s->macroblock_coding[current_macroblock]) {

            case MODE_INTER_PLUS_MV:
            case MODE_GOLDEN_MV:
                /* all 6 fragments use the same motion vector */
                if (coding_mode == 0) {
                    motion_x[0] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
                    motion_y[0] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
                } else {
                    motion_x[0] = fixed_motion_vector_table[get_bits(gb, 6)];
                    motion_y[0] = fixed_motion_vector_table[get_bits(gb, 6)];
857
                }
858

D
David Conrad 已提交
859 860 861 862
                for (k = 1; k < 6; k++) {
                    motion_x[k] = motion_x[0];
                    motion_y[k] = motion_y[0];
                }
863

D
David Conrad 已提交
864 865 866
                /* vector maintenance, only on MODE_INTER_PLUS_MV */
                if (s->macroblock_coding[current_macroblock] ==
                    MODE_INTER_PLUS_MV) {
867 868
                    prior_last_motion_x = last_motion_x;
                    prior_last_motion_y = last_motion_y;
D
David Conrad 已提交
869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889
                    last_motion_x = motion_x[0];
                    last_motion_y = motion_y[0];
                }
                break;

            case MODE_INTER_FOURMV:
                /* vector maintenance */
                prior_last_motion_x = last_motion_x;
                prior_last_motion_y = last_motion_y;

                /* fetch 4 vectors from the bitstream, one for each
                 * Y fragment, then average for the C fragment vectors */
                motion_x[4] = motion_y[4] = 0;
                for (k = 0; k < 4; k++) {
                    for (l = 0; l < s->coded_fragment_list_index; l++)
                        if (s->coded_fragment_list[l] == s->macroblock_fragments[6*current_macroblock + k])
                            break;
                    if (l < s->coded_fragment_list_index) {
                        if (coding_mode == 0) {
                            motion_x[k] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
                            motion_y[k] = motion_vector_table[get_vlc2(gb, s->motion_vector_vlc.table, 6, 2)];
890
                        } else {
D
David Conrad 已提交
891 892
                            motion_x[k] = fixed_motion_vector_table[get_bits(gb, 6)];
                            motion_y[k] = fixed_motion_vector_table[get_bits(gb, 6)];
893
                        }
D
David Conrad 已提交
894 895 896 897 898
                        last_motion_x = motion_x[k];
                        last_motion_y = motion_y[k];
                    } else {
                        motion_x[k] = 0;
                        motion_y[k] = 0;
899
                    }
D
David Conrad 已提交
900 901 902
                    motion_x[4] += motion_x[k];
                    motion_y[4] += motion_y[k];
                }
903

D
David Conrad 已提交
904 905 906 907 908 909 910 911 912 913 914 915 916 917
                motion_x[5]=
                motion_x[4]= RSHIFT(motion_x[4], 2);
                motion_y[5]=
                motion_y[4]= RSHIFT(motion_y[4], 2);
                break;

            case MODE_INTER_LAST_MV:
                /* all 6 fragments use the last motion vector */
                motion_x[0] = last_motion_x;
                motion_y[0] = last_motion_y;
                for (k = 1; k < 6; k++) {
                    motion_x[k] = motion_x[0];
                    motion_y[k] = motion_y[0];
                }
918

D
David Conrad 已提交
919 920 921 922 923 924 925 926 927 928 929 930 931
                /* no vector maintenance (last vector remains the
                 * last vector) */
                break;

            case MODE_INTER_PRIOR_LAST:
                /* all 6 fragments use the motion vector prior to the
                 * last motion vector */
                motion_x[0] = prior_last_motion_x;
                motion_y[0] = prior_last_motion_y;
                for (k = 1; k < 6; k++) {
                    motion_x[k] = motion_x[0];
                    motion_y[k] = motion_y[0];
                }
932

D
David Conrad 已提交
933 934 935 936 937 938
                /* vector maintenance */
                prior_last_motion_x = last_motion_x;
                prior_last_motion_y = last_motion_y;
                last_motion_x = motion_x[0];
                last_motion_y = motion_y[0];
                break;
939

D
David Conrad 已提交
940 941 942 943
            default:
                /* covers intra, inter without MV, golden without MV */
                memset(motion_x, 0, 6 * sizeof(int));
                memset(motion_y, 0, 6 * sizeof(int));
944

D
David Conrad 已提交
945 946 947
                /* no vector maintenance */
                break;
            }
948

D
David Conrad 已提交
949 950 951 952 953 954 955 956 957 958
            /* assign the motion vectors to the correct fragments */
            for (k = 0; k < 6; k++) {
                current_fragment =
                    s->macroblock_fragments[current_macroblock * 6 + k];
                if (current_fragment == -1)
                    continue;
                if (current_fragment >= s->fragment_count) {
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad fragment number (%d >= %d)\n",
                        current_fragment, s->fragment_count);
                    return 1;
959
                }
D
David Conrad 已提交
960 961
                s->all_fragments[current_fragment].motion_x = motion_x[k];
                s->all_fragments[current_fragment].motion_y = motion_y[k];
962 963
            }
        }
D
David Conrad 已提交
964
    }
965 966

    return 0;
967 968
}

969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009
static int unpack_block_qpis(Vp3DecodeContext *s, GetBitContext *gb)
{
    int qpi, i, j, bit, run_length, blocks_decoded, num_blocks_at_qpi;
    int num_blocks = s->coded_fragment_list_index;

    for (qpi = 0; qpi < s->nqps-1 && num_blocks > 0; qpi++) {
        i = blocks_decoded = num_blocks_at_qpi = 0;

        bit = get_bits1(gb);

        do {
            run_length = get_vlc2(gb, s->superblock_run_length_vlc.table, 6, 2) + 1;
            if (run_length == 34)
                run_length += get_bits(gb, 12);
            blocks_decoded += run_length;

            if (!bit)
                num_blocks_at_qpi += run_length;

            for (j = 0; j < run_length; i++) {
                if (i > s->coded_fragment_list_index)
                    return -1;

                if (s->all_fragments[s->coded_fragment_list[i]].qpi == qpi) {
                    s->all_fragments[s->coded_fragment_list[i]].qpi += bit;
                    j++;
                }
            }

            if (run_length == 4129)
                bit = get_bits1(gb);
            else
                bit ^= 1;
        } while (blocks_decoded < num_blocks);

        num_blocks -= num_blocks_at_qpi;
    }

    return 0;
}

1010
/*
1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028
 * This function is called by unpack_dct_coeffs() to extract the VLCs from
 * the bitstream. The VLCs encode tokens which are used to unpack DCT
 * data. This function unpacks all the VLCs for either the Y plane or both
 * C planes, and is called for DC coefficients or different AC coefficient
 * levels (since different coefficient types require different VLC tables.
 *
 * This function returns a residual eob run. E.g, if a particular token gave
 * instructions to EOB the next 5 fragments and there were only 2 fragments
 * left in the current fragment range, 3 would be returned so that it could
 * be passed into the next call to this same function.
 */
static int unpack_vlcs(Vp3DecodeContext *s, GetBitContext *gb,
                        VLC *table, int coeff_index,
                        int first_fragment, int last_fragment,
                        int eob_run)
{
    int i;
    int token;
1029 1030
    int zero_run = 0;
    DCTELEM coeff = 0;
1031
    Vp3Fragment *fragment;
M
Michael Niedermayer 已提交
1032
    uint8_t *perm= s->scantable.permutated;
1033
    int bits_to_get;
1034

1035
    if ((first_fragment >= s->fragment_count) ||
1036 1037
        (last_fragment >= s->fragment_count)) {

1038
        av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vlcs(): bad fragment number (%d -> %d ?)\n",
1039
            first_fragment, last_fragment);
1040
        return 0;
1041 1042
    }

1043
    for (i = first_fragment; i <= last_fragment; i++) {
1044
        int fragment_num = s->coded_fragment_list[i];
1045

1046
        if (s->coeff_counts[fragment_num] > coeff_index)
1047
            continue;
1048
        fragment = &s->all_fragments[fragment_num];
1049 1050 1051 1052 1053

        if (!eob_run) {
            /* decode a VLC into a token */
            token = get_vlc2(gb, table->table, 5, 3);
            /* use the token to get a zero run, a coefficient, and an eob run */
1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069
            if (token <= 6) {
                eob_run = eob_run_base[token];
                if (eob_run_get_bits[token])
                    eob_run += get_bits(gb, eob_run_get_bits[token]);
                coeff = zero_run = 0;
            } else {
                bits_to_get = coeff_get_bits[token];
                if (!bits_to_get)
                    coeff = coeff_tables[token][0];
                else
                    coeff = coeff_tables[token][get_bits(gb, bits_to_get)];

                zero_run = zero_run_base[token];
                if (zero_run_get_bits[token])
                    zero_run += get_bits(gb, zero_run_get_bits[token]);
            }
1070 1071 1072
        }

        if (!eob_run) {
1073 1074
            s->coeff_counts[fragment_num] += zero_run;
            if (s->coeff_counts[fragment_num] < 64){
1075
                fragment->next_coeff->coeff= coeff;
1076
                fragment->next_coeff->index= perm[s->coeff_counts[fragment_num]++]; //FIXME perm here already?
1077 1078 1079 1080
                fragment->next_coeff->next= s->next_coeff;
                s->next_coeff->next=NULL;
                fragment->next_coeff= s->next_coeff++;
            }
1081
        } else {
1082
            s->coeff_counts[fragment_num] |= 128;
1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093
            eob_run--;
        }
    }

    return eob_run;
}

/*
 * This function unpacks all of the DCT coefficient data from the
 * bitstream.
 */
1094
static int unpack_dct_coeffs(Vp3DecodeContext *s, GetBitContext *gb)
1095 1096 1097 1098 1099 1100 1101 1102
{
    int i;
    int dc_y_table;
    int dc_c_table;
    int ac_y_table;
    int ac_c_table;
    int residual_eob_run = 0;

1103
    /* fetch the DC table indexes */
1104 1105 1106 1107
    dc_y_table = get_bits(gb, 4);
    dc_c_table = get_bits(gb, 4);

    /* unpack the Y plane DC coefficients */
1108
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_y_table], 0,
1109
        s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1110 1111 1112

    /* unpack the C plane DC coefficients */
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_c_table], 0,
1113
        s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1114

1115
    /* fetch the AC table indexes */
1116 1117 1118
    ac_y_table = get_bits(gb, 4);
    ac_c_table = get_bits(gb, 4);

1119
    /* unpack the group 1 AC coefficients (coeffs 1-5) */
1120
    for (i = 1; i <= 5; i++) {
1121
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_y_table], i,
1122
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1123

1124
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_c_table], i,
1125
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1126 1127
    }

1128
    /* unpack the group 2 AC coefficients (coeffs 6-14) */
1129
    for (i = 6; i <= 14; i++) {
1130
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_y_table], i,
1131
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1132

1133
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_c_table], i,
1134
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1135 1136
    }

1137
    /* unpack the group 3 AC coefficients (coeffs 15-27) */
1138
    for (i = 15; i <= 27; i++) {
1139
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_y_table], i,
1140
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1141

1142
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_c_table], i,
1143
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1144 1145
    }

1146
    /* unpack the group 4 AC coefficients (coeffs 28-63) */
1147
    for (i = 28; i <= 63; i++) {
1148
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_y_table], i,
1149
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1150

1151
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_c_table], i,
1152
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1153
    }
1154 1155

    return 0;
1156 1157 1158 1159
}

/*
 * This function reverses the DC prediction for each coded fragment in
1160
 * the frame. Much of this function is adapted directly from the original
1161 1162 1163 1164 1165
 * VP3 source code.
 */
#define COMPATIBLE_FRAME(x) \
  (compatible_frame[s->all_fragments[x].coding_method] == current_frame_type)
#define FRAME_CODED(x) (s->all_fragments[x].coding_method != MODE_COPY)
1166
#define DC_COEFF(u) (s->coeffs[u].index ? 0 : s->coeffs[u].coeff) //FIXME do somethin to simplify this
1167 1168 1169 1170

static void reverse_dc_prediction(Vp3DecodeContext *s,
                                  int first_fragment,
                                  int fragment_width,
1171
                                  int fragment_height)
1172 1173 1174 1175 1176 1177 1178 1179 1180 1181
{

#define PUL 8
#define PU 4
#define PUR 2
#define PL 1

    int x, y;
    int i = first_fragment;

1182
    int predicted_dc;
1183 1184 1185 1186

    /* DC values for the left, up-left, up, and up-right fragments */
    int vl, vul, vu, vur;

1187
    /* indexes for the left, up-left, up, and up-right fragments */
1188 1189
    int l, ul, u, ur;

1190
    /*
1191 1192 1193 1194 1195 1196
     * The 6 fields mean:
     *   0: up-left multiplier
     *   1: up multiplier
     *   2: up-right multiplier
     *   3: left multiplier
     */
M
Michael Niedermayer 已提交
1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213
    int predictor_transform[16][4] = {
        {  0,  0,  0,  0},
        {  0,  0,  0,128},        // PL
        {  0,  0,128,  0},        // PUR
        {  0,  0, 53, 75},        // PUR|PL
        {  0,128,  0,  0},        // PU
        {  0, 64,  0, 64},        // PU|PL
        {  0,128,  0,  0},        // PU|PUR
        {  0,  0, 53, 75},        // PU|PUR|PL
        {128,  0,  0,  0},        // PUL
        {  0,  0,  0,128},        // PUL|PL
        { 64,  0, 64,  0},        // PUL|PUR
        {  0,  0, 53, 75},        // PUL|PUR|PL
        {  0,128,  0,  0},        // PUL|PU
       {-104,116,  0,116},        // PUL|PU|PL
        { 24, 80, 24,  0},        // PUL|PU|PUR
       {-104,116,  0,116}         // PUL|PU|PUR|PL
1214 1215 1216 1217 1218
    };

    /* This table shows which types of blocks can use other blocks for
     * prediction. For example, INTRA is the only mode in this table to
     * have a frame number of 0. That means INTRA blocks can only predict
1219
     * from other INTRA blocks. There are 2 golden frame coding types;
1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250
     * blocks encoding in these modes can only predict from other blocks
     * that were encoded with these 1 of these 2 modes. */
    unsigned char compatible_frame[8] = {
        1,    /* MODE_INTER_NO_MV */
        0,    /* MODE_INTRA */
        1,    /* MODE_INTER_PLUS_MV */
        1,    /* MODE_INTER_LAST_MV */
        1,    /* MODE_INTER_PRIOR_MV */
        2,    /* MODE_USING_GOLDEN */
        2,    /* MODE_GOLDEN_MV */
        1     /* MODE_INTER_FOUR_MV */
    };
    int current_frame_type;

    /* there is a last DC predictor for each of the 3 frame types */
    short last_dc[3];

    int transform = 0;

    vul = vu = vur = vl = 0;
    last_dc[0] = last_dc[1] = last_dc[2] = 0;

    /* for each fragment row... */
    for (y = 0; y < fragment_height; y++) {

        /* for each fragment in a row... */
        for (x = 0; x < fragment_width; x++, i++) {

            /* reverse prediction if this block was coded */
            if (s->all_fragments[i].coding_method != MODE_COPY) {

1251
                current_frame_type =
1252 1253
                    compatible_frame[s->all_fragments[i].coding_method];

M
Michael Niedermayer 已提交
1254 1255 1256
                transform= 0;
                if(x){
                    l= i-1;
1257
                    vl = DC_COEFF(l);
M
Michael Niedermayer 已提交
1258 1259
                    if(FRAME_CODED(l) && COMPATIBLE_FRAME(l))
                        transform |= PL;
M
Michael Niedermayer 已提交
1260 1261 1262
                }
                if(y){
                    u= i-fragment_width;
1263
                    vu = DC_COEFF(u);
M
Michael Niedermayer 已提交
1264 1265
                    if(FRAME_CODED(u) && COMPATIBLE_FRAME(u))
                        transform |= PU;
M
Michael Niedermayer 已提交
1266 1267 1268
                    if(x){
                        ul= i-fragment_width-1;
                        vul = DC_COEFF(ul);
M
Michael Niedermayer 已提交
1269 1270
                        if(FRAME_CODED(ul) && COMPATIBLE_FRAME(ul))
                            transform |= PUL;
M
Michael Niedermayer 已提交
1271 1272 1273 1274
                    }
                    if(x + 1 < fragment_width){
                        ur= i-fragment_width+1;
                        vur = DC_COEFF(ur);
M
Michael Niedermayer 已提交
1275 1276
                        if(FRAME_CODED(ur) && COMPATIBLE_FRAME(ur))
                            transform |= PUR;
M
Michael Niedermayer 已提交
1277
                    }
1278 1279 1280 1281 1282 1283
                }

                if (transform == 0) {

                    /* if there were no fragments to predict from, use last
                     * DC saved */
1284
                    predicted_dc = last_dc[current_frame_type];
1285 1286 1287 1288 1289 1290 1291 1292 1293
                } else {

                    /* apply the appropriate predictor transform */
                    predicted_dc =
                        (predictor_transform[transform][0] * vul) +
                        (predictor_transform[transform][1] * vu) +
                        (predictor_transform[transform][2] * vur) +
                        (predictor_transform[transform][3] * vl);

M
Michael Niedermayer 已提交
1294
                    predicted_dc /= 128;
1295 1296 1297 1298

                    /* check for outranging on the [ul u l] and
                     * [ul u ur l] predictors */
                    if ((transform == 13) || (transform == 15)) {
D
Diego Biurrun 已提交
1299
                        if (FFABS(predicted_dc - vu) > 128)
1300
                            predicted_dc = vu;
D
Diego Biurrun 已提交
1301
                        else if (FFABS(predicted_dc - vl) > 128)
1302
                            predicted_dc = vl;
D
Diego Biurrun 已提交
1303
                        else if (FFABS(predicted_dc - vul) > 128)
1304 1305 1306 1307
                            predicted_dc = vul;
                    }
                }

1308 1309 1310 1311 1312 1313 1314 1315
                /* at long last, apply the predictor */
                if(s->coeffs[i].index){
                    *s->next_coeff= s->coeffs[i];
                    s->coeffs[i].index=0;
                    s->coeffs[i].coeff=0;
                    s->coeffs[i].next= s->next_coeff++;
                }
                s->coeffs[i].coeff += predicted_dc;
1316
                /* save the DC */
1317
                last_dc[current_frame_type] = DC_COEFF(i);
1318 1319
                if(DC_COEFF(i) && !(s->coeff_counts[i]&127)){
                    s->coeff_counts[i]= 129;
1320 1321 1322 1323
//                    s->all_fragments[i].next_coeff= s->next_coeff;
                    s->coeffs[i].next= s->next_coeff;
                    (s->next_coeff++)->next=NULL;
                }
1324 1325 1326 1327 1328
            }
        }
    }
}

1329 1330 1331 1332 1333 1334
/*
 * Perform the final rendering for a particular slice of data.
 * The slice number ranges from 0..(macroblock_height - 1).
 */
static void render_slice(Vp3DecodeContext *s, int slice)
{
M
Michael Niedermayer 已提交
1335
    int x;
1336
    int16_t *dequantizer;
1337
    DECLARE_ALIGNED_16(DCTELEM, block[64]);
1338 1339 1340 1341 1342 1343 1344 1345 1346 1347
    int motion_x = 0xdeadbeef, motion_y = 0xdeadbeef;
    int motion_halfpel_index;
    uint8_t *motion_source;
    int plane;
    int current_macroblock_entry = slice * s->macroblock_width * 6;

    if (slice >= s->macroblock_height)
        return;

    for (plane = 0; plane < 3; plane++) {
M
Michael Niedermayer 已提交
1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358
        uint8_t *output_plane = s->current_frame.data    [plane];
        uint8_t *  last_plane = s->   last_frame.data    [plane];
        uint8_t *golden_plane = s-> golden_frame.data    [plane];
        int stride            = s->current_frame.linesize[plane];
        int plane_width       = s->width  >> !!plane;
        int plane_height      = s->height >> !!plane;
        int y =        slice *  FRAGMENT_PIXELS << !plane ;
        int slice_height = y + (FRAGMENT_PIXELS << !plane);
        int i = s->macroblock_fragments[current_macroblock_entry + plane + 3*!!plane];

        if (!s->flipped_image) stride = -stride;
1359

1360

D
Diego Biurrun 已提交
1361
        if(FFABS(stride) > 2048)
1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381
            return; //various tables are fixed size

        /* for each fragment row in the slice (both of them)... */
        for (; y < slice_height; y += 8) {

            /* for each fragment in a row... */
            for (x = 0; x < plane_width; x += 8, i++) {

                if ((i < 0) || (i >= s->fragment_count)) {
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:render_slice(): bad fragment number (%d)\n", i);
                    return;
                }

                /* transform if this block was coded */
                if ((s->all_fragments[i].coding_method != MODE_COPY) &&
                    !((s->avctx->flags & CODEC_FLAG_GRAY) && plane)) {

                    if ((s->all_fragments[i].coding_method == MODE_USING_GOLDEN) ||
                        (s->all_fragments[i].coding_method == MODE_GOLDEN_MV))
                        motion_source= golden_plane;
1382
                    else
1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419
                        motion_source= last_plane;

                    motion_source += s->all_fragments[i].first_pixel;
                    motion_halfpel_index = 0;

                    /* sort out the motion vector if this fragment is coded
                     * using a motion vector method */
                    if ((s->all_fragments[i].coding_method > MODE_INTRA) &&
                        (s->all_fragments[i].coding_method != MODE_USING_GOLDEN)) {
                        int src_x, src_y;
                        motion_x = s->all_fragments[i].motion_x;
                        motion_y = s->all_fragments[i].motion_y;
                        if(plane){
                            motion_x= (motion_x>>1) | (motion_x&1);
                            motion_y= (motion_y>>1) | (motion_y&1);
                        }

                        src_x= (motion_x>>1) + x;
                        src_y= (motion_y>>1) + y;
                        if ((motion_x == 127) || (motion_y == 127))
                            av_log(s->avctx, AV_LOG_ERROR, " help! got invalid motion vector! (%X, %X)\n", motion_x, motion_y);

                        motion_halfpel_index = motion_x & 0x01;
                        motion_source += (motion_x >> 1);

                        motion_halfpel_index |= (motion_y & 0x01) << 1;
                        motion_source += ((motion_y >> 1) * stride);

                        if(src_x<0 || src_y<0 || src_x + 9 >= plane_width || src_y + 9 >= plane_height){
                            uint8_t *temp= s->edge_emu_buffer;
                            if(stride<0) temp -= 9*stride;
                            else temp += 9*stride;

                            ff_emulated_edge_mc(temp, motion_source, stride, 9, 9, src_x, src_y, plane_width, plane_height);
                            motion_source= temp;
                        }
                    }
1420

1421 1422 1423 1424

                    /* first, take care of copying a block from either the
                     * previous or the golden frame */
                    if (s->all_fragments[i].coding_method != MODE_INTRA) {
1425 1426 1427
                        /* Note, it is possible to implement all MC cases with
                           put_no_rnd_pixels_l2 which would look more like the
                           VP3 source but this would be slower as
1428 1429 1430 1431 1432 1433 1434 1435 1436
                           put_no_rnd_pixels_tab is better optimzed */
                        if(motion_halfpel_index != 3){
                            s->dsp.put_no_rnd_pixels_tab[1][motion_halfpel_index](
                                output_plane + s->all_fragments[i].first_pixel,
                                motion_source, stride, 8);
                        }else{
                            int d= (motion_x ^ motion_y)>>31; // d is 0 if motion_x and _y have the same sign, else -1
                            s->dsp.put_no_rnd_pixels_l2[1](
                                output_plane + s->all_fragments[i].first_pixel,
1437 1438
                                motion_source - d,
                                motion_source + stride + 1 + d,
1439 1440
                                stride, 8);
                        }
1441
                        dequantizer = s->qmat[s->all_fragments[i].qpi][1][plane];
1442
                    }else{
1443
                        dequantizer = s->qmat[s->all_fragments[i].qpi][0][plane];
1444 1445 1446 1447 1448
                    }

                    /* dequantize the DCT coefficients */
                    if(s->avctx->idct_algo==FF_IDCT_VP3){
                        Coeff *coeff= s->coeffs + i;
L
Loren Merritt 已提交
1449
                        s->dsp.clear_block(block);
1450 1451 1452 1453 1454 1455
                        while(coeff->next){
                            block[coeff->index]= coeff->coeff * dequantizer[coeff->index];
                            coeff= coeff->next;
                        }
                    }else{
                        Coeff *coeff= s->coeffs + i;
L
Loren Merritt 已提交
1456
                        s->dsp.clear_block(block);
1457 1458 1459 1460 1461 1462 1463
                        while(coeff->next){
                            block[coeff->index]= (coeff->coeff * dequantizer[coeff->index] + 2)>>2;
                            coeff= coeff->next;
                        }
                    }

                    /* invert DCT and place (or add) in final output */
1464

1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486
                    if (s->all_fragments[i].coding_method == MODE_INTRA) {
                        if(s->avctx->idct_algo!=FF_IDCT_VP3)
                            block[0] += 128<<3;
                        s->dsp.idct_put(
                            output_plane + s->all_fragments[i].first_pixel,
                            stride,
                            block);
                    } else {
                        s->dsp.idct_add(
                            output_plane + s->all_fragments[i].first_pixel,
                            stride,
                            block);
                    }
                } else {

                    /* copy directly from the previous frame */
                    s->dsp.put_pixels_tab[1][0](
                        output_plane + s->all_fragments[i].first_pixel,
                        last_plane + s->all_fragments[i].first_pixel,
                        stride, 8);

                }
1487
#if 0
1488 1489 1490 1491 1492 1493 1494
                /* perform the left edge filter if:
                 *   - the fragment is not on the left column
                 *   - the fragment is coded in this frame
                 *   - the fragment is not coded in this frame but the left
                 *     fragment is coded in this frame (this is done instead
                 *     of a right edge filter when rendering the left fragment
                 *     since this fragment is not available yet) */
1495
                if ((x > 0) &&
1496 1497 1498
                    ((s->all_fragments[i].coding_method != MODE_COPY) ||
                     ((s->all_fragments[i].coding_method == MODE_COPY) &&
                      (s->all_fragments[i - 1].coding_method != MODE_COPY)) )) {
1499
                    horizontal_filter(
1500
                        output_plane + s->all_fragments[i].first_pixel + 7*stride,
M
Michael Niedermayer 已提交
1501
                        -stride, s->bounding_values_array + 127);
1502 1503
                }

1504 1505 1506 1507 1508 1509 1510
                /* perform the top edge filter if:
                 *   - the fragment is not on the top row
                 *   - the fragment is coded in this frame
                 *   - the fragment is not coded in this frame but the above
                 *     fragment is coded in this frame (this is done instead
                 *     of a bottom edge filter when rendering the above
                 *     fragment since this fragment is not available yet) */
1511
                if ((y > 0) &&
1512 1513 1514
                    ((s->all_fragments[i].coding_method != MODE_COPY) ||
                     ((s->all_fragments[i].coding_method == MODE_COPY) &&
                      (s->all_fragments[i - fragment_width].coding_method != MODE_COPY)) )) {
1515
                    vertical_filter(
1516
                        output_plane + s->all_fragments[i].first_pixel - stride,
M
Michael Niedermayer 已提交
1517
                        -stride, s->bounding_values_array + 127);
1518
                }
1519
#endif
1520 1521 1522 1523 1524 1525 1526
            }
        }
    }

     /* this looks like a good place for slice dispatch... */
     /* algorithm:
      *   if (slice == s->macroblock_height - 1)
1527 1528 1529
      *     dispatch (both last slice & 2nd-to-last slice);
      *   else if (slice > 0)
      *     dispatch (slice - 1);
1530 1531 1532 1533 1534
      */

    emms_c();
}

1535 1536
static void apply_loop_filter(Vp3DecodeContext *s)
{
M
Michael Niedermayer 已提交
1537 1538
    int plane;
    int x, y;
1539
    int *bounding_values= s->bounding_values_array+127;
1540

1541
#if 0
1542
    int bounding_values_array[256];
1543 1544 1545 1546 1547 1548 1549
    int filter_limit;

    /* find the right loop limit value */
    for (x = 63; x >= 0; x--) {
        if (vp31_ac_scale_factor[x] >= s->quality_index)
            break;
    }
1550
    filter_limit = vp31_filter_limit_values[s->quality_index];
1551 1552

    /* set up the bounding values */
1553
    memset(bounding_values_array, 0, 256 * sizeof(int));
1554 1555 1556 1557 1558 1559
    for (x = 0; x < filter_limit; x++) {
        bounding_values[-x - filter_limit] = -filter_limit + x;
        bounding_values[-x] = -x;
        bounding_values[x] = x;
        bounding_values[x + filter_limit] = filter_limit - x;
    }
1560
#endif
1561 1562

    for (plane = 0; plane < 3; plane++) {
M
Michael Niedermayer 已提交
1563 1564 1565 1566 1567
        int width           = s->fragment_width  >> !!plane;
        int height          = s->fragment_height >> !!plane;
        int fragment        = s->fragment_start        [plane];
        int stride          = s->current_frame.linesize[plane];
        uint8_t *plane_data = s->current_frame.data    [plane];
M
Michael Niedermayer 已提交
1568
        if (!s->flipped_image) stride = -stride;
1569 1570

        for (y = 0; y < height; y++) {
1571

1572 1573 1574 1575
            for (x = 0; x < width; x++) {
                /* do not perform left edge filter for left columns frags */
                if ((x > 0) &&
                    (s->all_fragments[fragment].coding_method != MODE_COPY)) {
D
David Conrad 已提交
1576
                    s->dsp.vp3_h_loop_filter(
M
Michael Niedermayer 已提交
1577
                        plane_data + s->all_fragments[fragment].first_pixel,
1578 1579 1580 1581 1582 1583
                        stride, bounding_values);
                }

                /* do not perform top edge filter for top row fragments */
                if ((y > 0) &&
                    (s->all_fragments[fragment].coding_method != MODE_COPY)) {
D
David Conrad 已提交
1584
                    s->dsp.vp3_v_loop_filter(
M
Michael Niedermayer 已提交
1585
                        plane_data + s->all_fragments[fragment].first_pixel,
1586 1587 1588 1589 1590 1591 1592 1593 1594
                        stride, bounding_values);
                }

                /* do not perform right edge filter for right column
                 * fragments or if right fragment neighbor is also coded
                 * in this frame (it will be filtered in next iteration) */
                if ((x < width - 1) &&
                    (s->all_fragments[fragment].coding_method != MODE_COPY) &&
                    (s->all_fragments[fragment + 1].coding_method == MODE_COPY)) {
D
David Conrad 已提交
1595
                    s->dsp.vp3_h_loop_filter(
M
Michael Niedermayer 已提交
1596
                        plane_data + s->all_fragments[fragment + 1].first_pixel,
1597 1598 1599 1600 1601 1602 1603 1604 1605
                        stride, bounding_values);
                }

                /* do not perform bottom edge filter for bottom row
                 * fragments or if bottom fragment neighbor is also coded
                 * in this frame (it will be filtered in the next row) */
                if ((y < height - 1) &&
                    (s->all_fragments[fragment].coding_method != MODE_COPY) &&
                    (s->all_fragments[fragment + width].coding_method == MODE_COPY)) {
D
David Conrad 已提交
1606
                    s->dsp.vp3_v_loop_filter(
M
Michael Niedermayer 已提交
1607
                        plane_data + s->all_fragments[fragment + width].first_pixel,
1608 1609 1610 1611 1612 1613 1614
                        stride, bounding_values);
                }

                fragment++;
            }
        }
    }
1615 1616
}

1617
/*
1618 1619 1620 1621
 * This function computes the first pixel addresses for each fragment.
 * This function needs to be invoked after the first frame is allocated
 * so that it has access to the plane strides.
 */
1622
static void vp3_calculate_pixel_addresses(Vp3DecodeContext *s)
1623
{
1624 1625
#define Y_INITIAL(chroma_shift)  s->flipped_image ? 1  : s->fragment_height >> chroma_shift
#define Y_FINISHED(chroma_shift) s->flipped_image ? y <= s->fragment_height >> chroma_shift : y > 0
1626 1627

    int i, x, y;
1628
    const int y_inc = s->flipped_image ? 1 : -1;
1629 1630 1631 1632

    /* figure out the first pixel addresses for each of the fragments */
    /* Y plane */
    i = 0;
1633
    for (y = Y_INITIAL(0); Y_FINISHED(0); y += y_inc) {
1634
        for (x = 0; x < s->fragment_width; x++) {
1635
            s->all_fragments[i++].first_pixel =
1636 1637 1638 1639 1640 1641 1642
                s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[0] +
                    x * FRAGMENT_PIXELS;
        }
    }

    /* U plane */
M
Michael Niedermayer 已提交
1643
    i = s->fragment_start[1];
1644
    for (y = Y_INITIAL(1); Y_FINISHED(1); y += y_inc) {
1645
        for (x = 0; x < s->fragment_width / 2; x++) {
1646
            s->all_fragments[i++].first_pixel =
1647 1648 1649 1650 1651 1652 1653
                s->golden_frame.linesize[1] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[1] +
                    x * FRAGMENT_PIXELS;
        }
    }

    /* V plane */
M
Michael Niedermayer 已提交
1654
    i = s->fragment_start[2];
1655
    for (y = Y_INITIAL(1); Y_FINISHED(1); y += y_inc) {
1656
        for (x = 0; x < s->fragment_width / 2; x++) {
1657
            s->all_fragments[i++].first_pixel =
1658 1659 1660 1661 1662 1663 1664
                s->golden_frame.linesize[2] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[2] +
                    x * FRAGMENT_PIXELS;
        }
    }
}

1665 1666 1667
/*
 * This is the ffmpeg/libavcodec API init function.
 */
1668
static av_cold int vp3_decode_init(AVCodecContext *avctx)
1669 1670
{
    Vp3DecodeContext *s = avctx->priv_data;
1671
    int i, inter, plane;
1672 1673 1674 1675
    int c_width;
    int c_height;
    int y_superblock_count;
    int c_superblock_count;
1676

A
Alex Beregszaszi 已提交
1677
    if (avctx->codec_tag == MKTAG('V','P','3','0'))
1678
        s->version = 0;
A
Alex Beregszaszi 已提交
1679
    else
1680
        s->version = 1;
A
Alex Beregszaszi 已提交
1681

1682
    s->avctx = avctx;
1683 1684
    s->width = FFALIGN(avctx->width, 16);
    s->height = FFALIGN(avctx->height, 16);
1685
    avctx->pix_fmt = PIX_FMT_YUV420P;
1686
    avctx->chroma_sample_location = AVCHROMA_LOC_CENTER;
1687 1688
    if(avctx->idct_algo==FF_IDCT_AUTO)
        avctx->idct_algo=FF_IDCT_VP3;
1689
    dsputil_init(&s->dsp, avctx);
1690

M
Michael Niedermayer 已提交
1691
    ff_init_scantable(s->dsp.idct_permutation, &s->scantable, ff_zigzag_direct);
1692 1693 1694

    /* initialize to an impossible value which will force a recalculation
     * in the first frame decode */
1695 1696
    for (i = 0; i < 3; i++)
        s->qps[i] = -1;
1697

1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711
    s->y_superblock_width = (s->width + 31) / 32;
    s->y_superblock_height = (s->height + 31) / 32;
    y_superblock_count = s->y_superblock_width * s->y_superblock_height;

    /* work out the dimensions for the C planes */
    c_width = s->width / 2;
    c_height = s->height / 2;
    s->c_superblock_width = (c_width + 31) / 32;
    s->c_superblock_height = (c_height + 31) / 32;
    c_superblock_count = s->c_superblock_width * s->c_superblock_height;

    s->superblock_count = y_superblock_count + (c_superblock_count * 2);
    s->u_superblock_start = y_superblock_count;
    s->v_superblock_start = s->u_superblock_start + c_superblock_count;
1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722
    s->superblock_coding = av_malloc(s->superblock_count);

    s->macroblock_width = (s->width + 15) / 16;
    s->macroblock_height = (s->height + 15) / 16;
    s->macroblock_count = s->macroblock_width * s->macroblock_height;

    s->fragment_width = s->width / FRAGMENT_PIXELS;
    s->fragment_height = s->height / FRAGMENT_PIXELS;

    /* fragment count covers all 8x8 blocks for all 3 planes */
    s->fragment_count = s->fragment_width * s->fragment_height * 3 / 2;
M
Michael Niedermayer 已提交
1723 1724
    s->fragment_start[1] = s->fragment_width * s->fragment_height;
    s->fragment_start[2] = s->fragment_width * s->fragment_height * 5 / 4;
1725 1726

    s->all_fragments = av_malloc(s->fragment_count * sizeof(Vp3Fragment));
1727
    s->coeff_counts = av_malloc(s->fragment_count * sizeof(*s->coeff_counts));
1728
    s->coeffs = av_malloc(s->fragment_count * sizeof(Coeff) * 65);
1729
    s->coded_fragment_list = av_malloc(s->fragment_count * sizeof(int));
D
Diego Biurrun 已提交
1730
    s->pixel_addresses_initialized = 0;
1731

1732 1733
    if (!s->theora_tables)
    {
M
cleanup  
Michael Niedermayer 已提交
1734
        for (i = 0; i < 64; i++) {
1735 1736
            s->coded_dc_scale_factor[i] = vp31_dc_scale_factor[i];
            s->coded_ac_scale_factor[i] = vp31_ac_scale_factor[i];
1737 1738 1739
            s->base_matrix[0][i] = vp31_intra_y_dequant[i];
            s->base_matrix[1][i] = vp31_intra_c_dequant[i];
            s->base_matrix[2][i] = vp31_inter_dequant[i];
1740
            s->filter_limit_values[i] = vp31_filter_limit_values[i];
M
cleanup  
Michael Niedermayer 已提交
1741
        }
1742

1743 1744 1745 1746 1747 1748 1749 1750 1751
        for(inter=0; inter<2; inter++){
            for(plane=0; plane<3; plane++){
                s->qr_count[inter][plane]= 1;
                s->qr_size [inter][plane][0]= 63;
                s->qr_base [inter][plane][0]=
                s->qr_base [inter][plane][1]= 2*inter + (!!plane)*!inter;
            }
        }

1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807
        /* init VLC tables */
        for (i = 0; i < 16; i++) {

            /* DC histograms */
            init_vlc(&s->dc_vlc[i], 5, 32,
                &dc_bias[i][0][1], 4, 2,
                &dc_bias[i][0][0], 4, 2, 0);

            /* group 1 AC histograms */
            init_vlc(&s->ac_vlc_1[i], 5, 32,
                &ac_bias_0[i][0][1], 4, 2,
                &ac_bias_0[i][0][0], 4, 2, 0);

            /* group 2 AC histograms */
            init_vlc(&s->ac_vlc_2[i], 5, 32,
                &ac_bias_1[i][0][1], 4, 2,
                &ac_bias_1[i][0][0], 4, 2, 0);

            /* group 3 AC histograms */
            init_vlc(&s->ac_vlc_3[i], 5, 32,
                &ac_bias_2[i][0][1], 4, 2,
                &ac_bias_2[i][0][0], 4, 2, 0);

            /* group 4 AC histograms */
            init_vlc(&s->ac_vlc_4[i], 5, 32,
                &ac_bias_3[i][0][1], 4, 2,
                &ac_bias_3[i][0][0], 4, 2, 0);
        }
    } else {
        for (i = 0; i < 16; i++) {

            /* DC histograms */
            init_vlc(&s->dc_vlc[i], 5, 32,
                &s->huffman_table[i][0][1], 4, 2,
                &s->huffman_table[i][0][0], 4, 2, 0);

            /* group 1 AC histograms */
            init_vlc(&s->ac_vlc_1[i], 5, 32,
                &s->huffman_table[i+16][0][1], 4, 2,
                &s->huffman_table[i+16][0][0], 4, 2, 0);

            /* group 2 AC histograms */
            init_vlc(&s->ac_vlc_2[i], 5, 32,
                &s->huffman_table[i+16*2][0][1], 4, 2,
                &s->huffman_table[i+16*2][0][0], 4, 2, 0);

            /* group 3 AC histograms */
            init_vlc(&s->ac_vlc_3[i], 5, 32,
                &s->huffman_table[i+16*3][0][1], 4, 2,
                &s->huffman_table[i+16*3][0][0], 4, 2, 0);

            /* group 4 AC histograms */
            init_vlc(&s->ac_vlc_4[i], 5, 32,
                &s->huffman_table[i+16*4][0][1], 4, 2,
                &s->huffman_table[i+16*4][0][0], 4, 2, 0);
        }
1808 1809
    }

1810 1811 1812 1813
    init_vlc(&s->superblock_run_length_vlc, 6, 34,
        &superblock_run_length_vlc_table[0][1], 4, 2,
        &superblock_run_length_vlc_table[0][0], 4, 2, 0);

1814
    init_vlc(&s->fragment_run_length_vlc, 5, 30,
1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825
        &fragment_run_length_vlc_table[0][1], 4, 2,
        &fragment_run_length_vlc_table[0][0], 4, 2, 0);

    init_vlc(&s->mode_code_vlc, 3, 8,
        &mode_code_vlc_table[0][1], 2, 1,
        &mode_code_vlc_table[0][0], 2, 1, 0);

    init_vlc(&s->motion_vector_vlc, 6, 63,
        &motion_vector_vlc_table[0][1], 2, 1,
        &motion_vector_vlc_table[0][0], 2, 1, 0);

1826 1827 1828 1829
    /* work out the block mapping tables */
    s->superblock_fragments = av_malloc(s->superblock_count * 16 * sizeof(int));
    s->superblock_macroblocks = av_malloc(s->superblock_count * 4 * sizeof(int));
    s->macroblock_fragments = av_malloc(s->macroblock_count * 6 * sizeof(int));
1830
    s->macroblock_coding = av_malloc(s->macroblock_count + 1);
1831 1832
    init_block_mapping(s);

1833 1834 1835 1836
    for (i = 0; i < 3; i++) {
        s->current_frame.data[i] = NULL;
        s->last_frame.data[i] = NULL;
        s->golden_frame.data[i] = NULL;
1837 1838
    }

1839 1840 1841 1842 1843 1844
    return 0;
}

/*
 * This is the ffmpeg/libavcodec API frame decode function.
 */
1845
static int vp3_decode_frame(AVCodecContext *avctx,
1846
                            void *data, int *data_size,
1847
                            AVPacket *avpkt)
1848
{
1849 1850
    const uint8_t *buf = avpkt->data;
    int buf_size = avpkt->size;
1851 1852 1853
    Vp3DecodeContext *s = avctx->priv_data;
    GetBitContext gb;
    static int counter = 0;
1854
    int i;
1855 1856

    init_get_bits(&gb, buf, buf_size * 8);
1857

1858 1859
    if (s->theora && get_bits1(&gb))
    {
1860 1861
        av_log(avctx, AV_LOG_ERROR, "Header packet passed to frame decoder, skipping\n");
        return -1;
1862
    }
A
Alex Beregszaszi 已提交
1863 1864 1865

    s->keyframe = !get_bits1(&gb);
    if (!s->theora)
1866
        skip_bits(&gb, 1);
1867 1868
    for (i = 0; i < 3; i++)
        s->last_qps[i] = s->qps[i];
1869

1870
    s->nqps=0;
1871
    do{
1872 1873 1874 1875
        s->qps[s->nqps++]= get_bits(&gb, 6);
    } while(s->theora >= 0x030200 && s->nqps<3 && get_bits1(&gb));
    for (i = s->nqps; i < 3; i++)
        s->qps[i] = -1;
1876

1877
    if (s->avctx->debug & FF_DEBUG_PICT_INFO)
1878
        av_log(s->avctx, AV_LOG_INFO, " VP3 %sframe #%d: Q index = %d\n",
1879
            s->keyframe?"key":"", counter, s->qps[0]);
1880 1881
    counter++;

1882
    if (s->qps[0] != s->last_qps[0])
1883
        init_loop_filter(s);
1884 1885 1886 1887 1888 1889

    for (i = 0; i < s->nqps; i++)
        // reinit all dequantizers if the first one changed, because
        // the DC of the first quantizer must be used for all matrices
        if (s->qps[i] != s->last_qps[i] || s->qps[0] != s->last_qps[0])
            init_dequantizer(s, i);
1890

1891 1892 1893
    if (avctx->skip_frame >= AVDISCARD_NONKEY && !s->keyframe)
        return buf_size;

1894
    if (s->keyframe) {
1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911
        if (!s->theora)
        {
            skip_bits(&gb, 4); /* width code */
            skip_bits(&gb, 4); /* height code */
            if (s->version)
            {
                s->version = get_bits(&gb, 5);
                if (counter == 1)
                    av_log(s->avctx, AV_LOG_DEBUG, "VP version: %d\n", s->version);
            }
        }
        if (s->version || s->theora)
        {
                if (get_bits1(&gb))
                    av_log(s->avctx, AV_LOG_ERROR, "Warning, unsupported keyframe coding type?!\n");
            skip_bits(&gb, 2); /* reserved? */
        }
A
Alex Beregszaszi 已提交
1912

1913 1914 1915
        if (s->last_frame.data[0] == s->golden_frame.data[0]) {
            if (s->golden_frame.data[0])
                avctx->release_buffer(avctx, &s->golden_frame);
1916
            s->last_frame= s->golden_frame; /* ensure that we catch any access to this released frame */
1917 1918 1919 1920 1921 1922
        } else {
            if (s->golden_frame.data[0])
                avctx->release_buffer(avctx, &s->golden_frame);
            if (s->last_frame.data[0])
                avctx->release_buffer(avctx, &s->last_frame);
        }
1923

1924
        s->golden_frame.reference = 3;
1925
        if(avctx->get_buffer(avctx, &s->golden_frame) < 0) {
1926
            av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
1927 1928 1929 1930
            return -1;
        }

        /* golden frame is also the current frame */
M
Michael Niedermayer 已提交
1931
        s->current_frame= s->golden_frame;
1932 1933

        /* time to figure out pixel addresses? */
D
Diego Biurrun 已提交
1934
        if (!s->pixel_addresses_initialized)
1935
        {
D
David Conrad 已提交
1936
            vp3_calculate_pixel_addresses(s);
D
Diego Biurrun 已提交
1937
            s->pixel_addresses_initialized = 1;
1938
        }
1939 1940
    } else {
        /* allocate a new current frame */
1941
        s->current_frame.reference = 3;
D
Diego Biurrun 已提交
1942
        if (!s->pixel_addresses_initialized) {
1943 1944 1945
            av_log(s->avctx, AV_LOG_ERROR, "vp3: first frame not a keyframe\n");
            return -1;
        }
1946
        if(avctx->get_buffer(avctx, &s->current_frame) < 0) {
1947
            av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
1948 1949 1950 1951
            return -1;
        }
    }

M
Michael Niedermayer 已提交
1952 1953 1954
    s->current_frame.qscale_table= s->qscale_table; //FIXME allocate individual tables per AVFrame
    s->current_frame.qstride= 0;

1955 1956
    init_frame(s, &gb);

M
Michael Niedermayer 已提交
1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968
    if (unpack_superblocks(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_superblocks\n");
        return -1;
    }
    if (unpack_modes(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_modes\n");
        return -1;
    }
    if (unpack_vectors(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_vectors\n");
        return -1;
    }
1969 1970 1971 1972
    if (unpack_block_qpis(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_block_qpis\n");
        return -1;
    }
M
Michael Niedermayer 已提交
1973 1974
    if (unpack_dct_coeffs(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_dct_coeffs\n");
1975 1976
        return -1;
    }
1977 1978

    reverse_dc_prediction(s, 0, s->fragment_width, s->fragment_height);
1979
    if ((avctx->flags & CODEC_FLAG_GRAY) == 0) {
M
Michael Niedermayer 已提交
1980
        reverse_dc_prediction(s, s->fragment_start[1],
1981
            s->fragment_width / 2, s->fragment_height / 2);
M
Michael Niedermayer 已提交
1982
        reverse_dc_prediction(s, s->fragment_start[2],
1983
            s->fragment_width / 2, s->fragment_height / 2);
1984 1985 1986 1987
    }

    for (i = 0; i < s->macroblock_height; i++)
        render_slice(s, i);
1988

1989
    apply_loop_filter(s);
1990

1991 1992 1993
    *data_size=sizeof(AVFrame);
    *(AVFrame*)data= s->current_frame;

1994 1995 1996 1997 1998
    /* release the last frame, if it is allocated and if it is not the
     * golden frame */
    if ((s->last_frame.data[0]) &&
        (s->last_frame.data[0] != s->golden_frame.data[0]))
        avctx->release_buffer(avctx, &s->last_frame);
1999

2000
    /* shuffle frames (last = current) */
M
Michael Niedermayer 已提交
2001
    s->last_frame= s->current_frame;
2002
    s->current_frame.data[0]= NULL; /* ensure that we catch any access to this released frame */
2003 2004 2005 2006 2007 2008 2009

    return buf_size;
}

/*
 * This is the ffmpeg/libavcodec API module cleanup function.
 */
2010
static av_cold int vp3_decode_end(AVCodecContext *avctx)
2011 2012
{
    Vp3DecodeContext *s = avctx->priv_data;
2013
    int i;
2014

2015
    av_free(s->superblock_coding);
2016
    av_free(s->all_fragments);
2017
    av_free(s->coeff_counts);
2018
    av_free(s->coeffs);
2019 2020 2021 2022
    av_free(s->coded_fragment_list);
    av_free(s->superblock_fragments);
    av_free(s->superblock_macroblocks);
    av_free(s->macroblock_fragments);
2023
    av_free(s->macroblock_coding);
2024

2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037
    for (i = 0; i < 16; i++) {
        free_vlc(&s->dc_vlc[i]);
        free_vlc(&s->ac_vlc_1[i]);
        free_vlc(&s->ac_vlc_2[i]);
        free_vlc(&s->ac_vlc_3[i]);
        free_vlc(&s->ac_vlc_4[i]);
    }

    free_vlc(&s->superblock_run_length_vlc);
    free_vlc(&s->fragment_run_length_vlc);
    free_vlc(&s->mode_code_vlc);
    free_vlc(&s->motion_vector_vlc);

2038
    /* release all frames */
2039
    if (s->golden_frame.data[0] && s->golden_frame.data[0] != s->last_frame.data[0])
2040 2041 2042 2043 2044
        avctx->release_buffer(avctx, &s->golden_frame);
    if (s->last_frame.data[0])
        avctx->release_buffer(avctx, &s->last_frame);
    /* no need to release the current_frame since it will always be pointing
     * to the same frame as either the golden or last frame */
2045 2046 2047 2048

    return 0;
}

2049 2050 2051 2052
static int read_huffman_tree(AVCodecContext *avctx, GetBitContext *gb)
{
    Vp3DecodeContext *s = avctx->priv_data;

2053
    if (get_bits1(gb)) {
2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071
        int token;
        if (s->entries >= 32) { /* overflow */
            av_log(avctx, AV_LOG_ERROR, "huffman tree overflow\n");
            return -1;
        }
        token = get_bits(gb, 5);
        //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);
        s->huffman_table[s->hti][token][0] = s->hbits;
        s->huffman_table[s->hti][token][1] = s->huff_code_size;
        s->entries++;
    }
    else {
        if (s->huff_code_size >= 32) {/* overflow */
            av_log(avctx, AV_LOG_ERROR, "huffman tree overflow\n");
            return -1;
        }
        s->huff_code_size++;
        s->hbits <<= 1;
2072 2073
        if (read_huffman_tree(avctx, gb))
            return -1;
2074
        s->hbits |= 1;
2075 2076
        if (read_huffman_tree(avctx, gb))
            return -1;
2077 2078 2079 2080 2081 2082
        s->hbits >>= 1;
        s->huff_code_size--;
    }
    return 0;
}

2083
#if CONFIG_THEORA_DECODER
2084
static int theora_decode_header(AVCodecContext *avctx, GetBitContext *gb)
2085 2086
{
    Vp3DecodeContext *s = avctx->priv_data;
2087
    int visible_width, visible_height;
2088

2089
    s->theora = get_bits_long(gb, 24);
2090
    av_log(avctx, AV_LOG_DEBUG, "Theora bitstream version %X\n", s->theora);
2091

M
Matthieu Castet 已提交
2092
    /* 3.2.0 aka alpha3 has the same frame orientation as original vp3 */
2093
    /* but previous versions have the image flipped relative to vp3 */
M
Matthieu Castet 已提交
2094
    if (s->theora < 0x030200)
2095
    {
2096
        s->flipped_image = 1;
2097 2098
        av_log(avctx, AV_LOG_DEBUG, "Old (<alpha3) Theora bitstream, flipped image\n");
    }
2099

2100 2101
    visible_width  = s->width  = get_bits(gb, 16) << 4;
    visible_height = s->height = get_bits(gb, 16) << 4;
2102

2103
    if(avcodec_check_dimensions(avctx, s->width, s->height)){
2104
        av_log(avctx, AV_LOG_ERROR, "Invalid dimensions (%dx%d)\n", s->width, s->height);
2105 2106 2107
        s->width= s->height= 0;
        return -1;
    }
2108 2109 2110

    if (s->theora >= 0x030400)
    {
2111
        skip_bits(gb, 32); /* total number of superblocks in a frame */
2112
        // fixme, the next field is 36bits long
2113 2114 2115
        skip_bits(gb, 32); /* total number of blocks in a frame */
        skip_bits(gb, 4); /* total number of blocks in a frame */
        skip_bits(gb, 32); /* total number of macroblocks in a frame */
2116
    }
2117

2118
    if (s->theora >= 0x030200) {
D
David Conrad 已提交
2119 2120
        visible_width  = get_bits_long(gb, 24);
        visible_height = get_bits_long(gb, 24);
2121

2122 2123 2124
        skip_bits(gb, 8); /* offset x */
        skip_bits(gb, 8); /* offset y */
    }
2125

2126 2127 2128 2129
    skip_bits(gb, 32); /* fps numerator */
    skip_bits(gb, 32); /* fps denumerator */
    skip_bits(gb, 24); /* aspect numerator */
    skip_bits(gb, 24); /* aspect denumerator */
2130

M
Matthieu Castet 已提交
2131
    if (s->theora < 0x030200)
2132 2133
        skip_bits(gb, 5); /* keyframe frequency force */
    skip_bits(gb, 8); /* colorspace */
2134
    if (s->theora >= 0x030400)
2135 2136
        skip_bits(gb, 2); /* pixel format: 420,res,422,444 */
    skip_bits(gb, 24); /* bitrate */
2137

2138
    skip_bits(gb, 6); /* quality hint */
2139

M
Matthieu Castet 已提交
2140
    if (s->theora >= 0x030200)
2141
    {
2142
        skip_bits(gb, 5); /* keyframe frequency force */
2143

2144
        if (s->theora < 0x030400)
2145
            skip_bits(gb, 5); /* spare bits */
2146
    }
2147

2148
//    align_get_bits(gb);
2149

2150 2151 2152 2153 2154
    if (   visible_width  <= s->width  && visible_width  > s->width-16
        && visible_height <= s->height && visible_height > s->height-16)
        avcodec_set_dimensions(avctx, visible_width, visible_height);
    else
        avcodec_set_dimensions(avctx, s->width, s->height);
2155 2156 2157 2158

    return 0;
}

2159
static int theora_decode_tables(AVCodecContext *avctx, GetBitContext *gb)
2160 2161
{
    Vp3DecodeContext *s = avctx->priv_data;
2162
    int i, n, matrices, inter, plane;
M
Matthieu Castet 已提交
2163 2164

    if (s->theora >= 0x030200) {
2165
        n = get_bits(gb, 3);
2166
        /* loop filter limit values table */
M
Matthieu Castet 已提交
2167
        for (i = 0; i < 64; i++)
2168
            s->filter_limit_values[i] = get_bits(gb, n);
M
Matthieu Castet 已提交
2169
    }
2170

M
Matthieu Castet 已提交
2171
    if (s->theora >= 0x030200)
2172
        n = get_bits(gb, 4) + 1;
M
Matthieu Castet 已提交
2173 2174
    else
        n = 16;
2175 2176
    /* quality threshold table */
    for (i = 0; i < 64; i++)
2177
        s->coded_ac_scale_factor[i] = get_bits(gb, n);
2178

M
Matthieu Castet 已提交
2179
    if (s->theora >= 0x030200)
2180
        n = get_bits(gb, 4) + 1;
M
Matthieu Castet 已提交
2181 2182
    else
        n = 16;
2183 2184
    /* dc scale factor table */
    for (i = 0; i < 64; i++)
2185
        s->coded_dc_scale_factor[i] = get_bits(gb, n);
2186

M
Matthieu Castet 已提交
2187
    if (s->theora >= 0x030200)
2188
        matrices = get_bits(gb, 9) + 1;
M
Matthieu Castet 已提交
2189
    else
2190
        matrices = 3;
2191

2192 2193 2194 2195
    if(matrices > 384){
        av_log(avctx, AV_LOG_ERROR, "invalid number of base matrixes\n");
        return -1;
    }
A
Alex Beregszaszi 已提交
2196

2197
    for(n=0; n<matrices; n++){
2198
        for (i = 0; i < 64; i++)
2199 2200
            s->base_matrix[n][i]= get_bits(gb, 8);
    }
2201

2202 2203 2204 2205
    for (inter = 0; inter <= 1; inter++) {
        for (plane = 0; plane <= 2; plane++) {
            int newqr= 1;
            if (inter || plane > 0)
2206
                newqr = get_bits1(gb);
2207
            if (!newqr) {
2208
                int qtj, plj;
2209
                if(inter && get_bits1(gb)){
2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220
                    qtj = 0;
                    plj = plane;
                }else{
                    qtj= (3*inter + plane - 1) / 3;
                    plj= (plane + 2) % 3;
                }
                s->qr_count[inter][plane]= s->qr_count[qtj][plj];
                memcpy(s->qr_size[inter][plane], s->qr_size[qtj][plj], sizeof(s->qr_size[0][0]));
                memcpy(s->qr_base[inter][plane], s->qr_base[qtj][plj], sizeof(s->qr_base[0][0]));
            } else {
                int qri= 0;
2221
                int qi = 0;
2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234

                for(;;){
                    i= get_bits(gb, av_log2(matrices-1)+1);
                    if(i>= matrices){
                        av_log(avctx, AV_LOG_ERROR, "invalid base matrix index\n");
                        return -1;
                    }
                    s->qr_base[inter][plane][qri]= i;
                    if(qi >= 63)
                        break;
                    i = get_bits(gb, av_log2(63-qi)+1) + 1;
                    s->qr_size[inter][plane][qri++]= i;
                    qi += i;
2235
                }
2236

2237
                if (qi > 63) {
2238
                    av_log(avctx, AV_LOG_ERROR, "invalid qi %d > 63\n", qi);
2239 2240
                    return -1;
                }
2241
                s->qr_count[inter][plane]= qri;
2242 2243 2244 2245
            }
        }
    }

2246
    /* Huffman tables */
2247 2248 2249
    for (s->hti = 0; s->hti < 80; s->hti++) {
        s->entries = 0;
        s->huff_code_size = 1;
2250
        if (!get_bits1(gb)) {
2251
            s->hbits = 0;
2252 2253
            if(read_huffman_tree(avctx, gb))
                return -1;
2254
            s->hbits = 1;
2255 2256
            if(read_huffman_tree(avctx, gb))
                return -1;
2257 2258
        }
    }
2259

2260
    s->theora_tables = 1;
2261

2262 2263 2264
    return 0;
}

2265
static av_cold int theora_decode_init(AVCodecContext *avctx)
2266 2267 2268 2269
{
    Vp3DecodeContext *s = avctx->priv_data;
    GetBitContext gb;
    int ptype;
2270 2271 2272
    uint8_t *header_start[3];
    int header_len[3];
    int i;
2273

2274 2275 2276
    s->theora = 1;

    if (!avctx->extradata_size)
2277 2278
    {
        av_log(avctx, AV_LOG_ERROR, "Missing extradata!\n");
2279
        return -1;
2280
    }
2281

2282 2283 2284 2285 2286
    if (ff_split_xiph_headers(avctx->extradata, avctx->extradata_size,
                              42, header_start, header_len) < 0) {
        av_log(avctx, AV_LOG_ERROR, "Corrupt extradata\n");
        return -1;
    }
2287

2288 2289
  for(i=0;i<3;i++) {
    init_get_bits(&gb, header_start[i], header_len[i]);
2290 2291

    ptype = get_bits(&gb, 8);
2292

2293 2294 2295
     if (!(ptype & 0x80))
     {
        av_log(avctx, AV_LOG_ERROR, "Invalid extradata!\n");
2296
//        return -1;
2297
     }
2298

2299
    // FIXME: Check for this as well.
2300
    skip_bits_long(&gb, 6*8); /* "theora" */
2301

2302 2303 2304
    switch(ptype)
    {
        case 0x80:
2305
            theora_decode_header(avctx, &gb);
2306 2307
                break;
        case 0x81:
2308
// FIXME: is this needed? it breaks sometimes
2309 2310 2311
//            theora_decode_comments(avctx, gb);
            break;
        case 0x82:
2312 2313
            if (theora_decode_tables(avctx, &gb))
                return -1;
2314 2315 2316 2317
            break;
        default:
            av_log(avctx, AV_LOG_ERROR, "Unknown Theora config packet: %d\n", ptype&~0x80);
            break;
2318
    }
2319 2320
    if(ptype != 0x81 && 8*header_len[i] != get_bits_count(&gb))
        av_log(avctx, AV_LOG_WARNING, "%d bits left in packet %X\n", 8*header_len[i] - get_bits_count(&gb), ptype);
2321 2322
    if (s->theora < 0x030200)
        break;
2323
  }
2324

M
Matthieu Castet 已提交
2325
    vp3_decode_init(avctx);
2326 2327 2328
    return 0;
}

2329 2330
AVCodec theora_decoder = {
    "theora",
2331
    CODEC_TYPE_VIDEO,
2332
    CODEC_ID_THEORA,
2333
    sizeof(Vp3DecodeContext),
2334
    theora_decode_init,
2335 2336 2337 2338
    NULL,
    vp3_decode_end,
    vp3_decode_frame,
    0,
2339
    NULL,
2340
    .long_name = NULL_IF_CONFIG_SMALL("Theora"),
2341
};
2342
#endif
2343

2344 2345
AVCodec vp3_decoder = {
    "vp3",
2346
    CODEC_TYPE_VIDEO,
2347
    CODEC_ID_VP3,
2348
    sizeof(Vp3DecodeContext),
2349
    vp3_decode_init,
2350 2351 2352 2353
    NULL,
    vp3_decode_end,
    vp3_decode_frame,
    0,
2354
    NULL,
2355
    .long_name = NULL_IF_CONFIG_SMALL("On2 VP3"),
2356
};