vp3.c 83.1 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
/*
 * This function initializes the loop filter boundary limits if the frame's
 * quality index is different from the previous frame's.
520 521
 *
 * The filter_limit_values may not be larger than 127.
522 523 524 525 526 527
 */
static void init_loop_filter(Vp3DecodeContext *s)
{
    int *bounding_values= s->bounding_values_array+127;
    int filter_limit;
    int x;
528
    int value;
529

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

    /* set up the bounding values */
    memset(s->bounding_values_array, 0, 256 * sizeof(int));
    for (x = 0; x < filter_limit; x++) {
        bounding_values[-x] = -x;
        bounding_values[x] = x;
    }
538 539 540 541 542 543
    for (x = value = filter_limit; x < 128 && value; x++, value--) {
        bounding_values[ x] =  value;
        bounding_values[-x] = -value;
    }
    if (value)
        bounding_values[128] = value;
D
David Conrad 已提交
544
    bounding_values[129] = bounding_values[130] = filter_limit * 0x02020202;
545 546
}

547
/*
548
 * This function unpacks all of the superblock/macroblock/fragment coding
549 550
 * information from the bitstream.
 */
551
static int unpack_superblocks(Vp3DecodeContext *s, GetBitContext *gb)
552 553 554 555 556 557
{
    int bit = 0;
    int current_superblock = 0;
    int current_run = 0;
    int decode_fully_flags = 0;
    int decode_partial_blocks = 0;
558
    int first_c_fragment_seen;
559 560 561 562 563 564 565 566 567 568

    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 */
569
        bit = get_bits1(gb);
570
        /* toggle the bit because as soon as the first run length is
571 572 573
         * fetched the bit will be toggled again */
        bit ^= 1;
        while (current_superblock < s->superblock_count) {
574
            if (current_run-- == 0) {
575
                bit ^= 1;
576
                current_run = get_vlc2(gb,
577 578
                    s->superblock_run_length_vlc.table, 6, 2);
                if (current_run == 33)
579
                    current_run += get_bits(gb, 12);
580 581 582

                /* if any of the superblocks are not partially coded, flag
                 * a boolean to decode the list of fully-coded superblocks */
583
                if (bit == 0) {
584
                    decode_fully_flags = 1;
585
                } else {
586

587 588 589 590
                    /* make a note of the fact that there are partially coded
                     * superblocks */
                    decode_partial_blocks = 1;
                }
591
            }
592
            s->superblock_coding[current_superblock++] = bit;
593 594 595 596 597 598 599 600
        }

        /* 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;
601
            bit = get_bits1(gb);
602
            /* toggle the bit because as soon as the first run length is
603 604 605 606 607 608 609
             * 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) {

610
                    if (current_run-- == 0) {
611
                        bit ^= 1;
612
                        current_run = get_vlc2(gb,
613 614
                            s->superblock_run_length_vlc.table, 6, 2);
                        if (current_run == 33)
615
                            current_run += get_bits(gb, 12);
616
                    }
617
                    s->superblock_coding[current_superblock] = 2*bit;
618 619 620 621 622 623 624 625 626 627
                }
                current_superblock++;
            }
        }

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

            current_run = 0;
628
            bit = get_bits1(gb);
629
            /* toggle the bit because as soon as the first run length is
630 631 632 633 634 635 636 637
             * 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;
638
    s->next_coeff= s->coeffs + s->fragment_count;
639 640
    s->first_coded_y_fragment = s->first_coded_c_fragment = 0;
    s->last_coded_y_fragment = s->last_coded_c_fragment = -1;
641
    first_c_fragment_seen = 0;
642
    memset(s->macroblock_coding, MODE_COPY, s->macroblock_count);
643 644 645 646 647 648 649
    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];
650
            if (current_fragment >= s->fragment_count) {
651
                av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_superblocks(): bad fragment number (%d >= %d)\n",
652 653 654
                    current_fragment, s->fragment_count);
                return 1;
            }
655 656 657 658
            if (current_fragment != -1) {
                if (s->superblock_coding[i] == SB_NOT_CODED) {

                    /* copy all the fragments from the prior frame */
659
                    s->all_fragments[current_fragment].coding_method =
660 661 662 663 664 665
                        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 */
666
                    if (current_run-- == 0) {
667
                        bit ^= 1;
668
                        current_run = get_vlc2(gb,
669
                            s->fragment_run_length_vlc.table, 5, 2);
670 671 672
                    }

                    if (bit) {
673
                        /* default mode; actual mode will be decoded in
674
                         * the next phase */
675
                        s->all_fragments[current_fragment].coding_method =
676
                            MODE_INTER_NO_MV;
677
                        s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
678
                        s->coded_fragment_list[s->coded_fragment_list_index] =
679
                            current_fragment;
M
Michael Niedermayer 已提交
680
                        if ((current_fragment >= s->fragment_start[1]) &&
681 682
                            (s->last_coded_y_fragment == -1) &&
                            (!first_c_fragment_seen)) {
683 684
                            s->first_coded_c_fragment = s->coded_fragment_list_index;
                            s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
685
                            first_c_fragment_seen = 1;
686 687
                        }
                        s->coded_fragment_list_index++;
688
                        s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
689 690 691 692 693 694 695 696 697 698
                    } 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 */
699
                    s->all_fragments[current_fragment].coding_method =
700
                        MODE_INTER_NO_MV;
701
                    s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
702
                    s->coded_fragment_list[s->coded_fragment_list_index] =
703
                        current_fragment;
M
Michael Niedermayer 已提交
704
                    if ((current_fragment >= s->fragment_start[1]) &&
705 706
                        (s->last_coded_y_fragment == -1) &&
                        (!first_c_fragment_seen)) {
707 708
                        s->first_coded_c_fragment = s->coded_fragment_list_index;
                        s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
709
                        first_c_fragment_seen = 1;
710 711
                    }
                    s->coded_fragment_list_index++;
712
                    s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
713 714 715 716
                }
            }
        }
    }
717

718 719
    if (!first_c_fragment_seen)
        /* only Y fragments coded in this frame */
720
        s->last_coded_y_fragment = s->coded_fragment_list_index - 1;
721
    else
722
        /* end the list of coded C fragments */
723
        s->last_coded_c_fragment = s->coded_fragment_list_index - 1;
724

725
    return 0;
726 727 728 729 730 731
}

/*
 * This function unpacks all the coding mode data for individual macroblocks
 * from the bitstream.
 */
732
static int unpack_modes(Vp3DecodeContext *s, GetBitContext *gb)
733 734 735 736 737 738
{
    int i, j, k;
    int scheme;
    int current_macroblock;
    int current_fragment;
    int coding_mode;
739
    int custom_mode_alphabet[CODING_MODE_COUNT];
740 741 742 743 744 745 746 747 748 749 750 751

    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) {
752 753
            for (i = 0; i < 8; i++)
                custom_mode_alphabet[i] = MODE_INTER_NO_MV;
754
            for (i = 0; i < 8; i++)
755
                custom_mode_alphabet[get_bits(gb, 3)] = i;
756 757 758 759 760 761 762 763 764
        }

        /* 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) ||
765
                    (s->macroblock_coding[current_macroblock] == MODE_COPY))
766
                    continue;
767
                if (current_macroblock >= s->macroblock_count) {
768
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_modes(): bad macroblock number (%d >= %d)\n",
769 770 771
                        current_macroblock, s->macroblock_count);
                    return 1;
                }
772 773 774 775

                /* mode 7 means get 3 bits for each coding mode */
                if (scheme == 7)
                    coding_mode = get_bits(gb, 3);
776 777 778
                else if(scheme == 0)
                    coding_mode = custom_mode_alphabet
                        [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
779
                else
780
                    coding_mode = ModeAlphabet[scheme-1]
781
                        [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
782

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

    return 0;
804 805
}

806 807 808 809
/*
 * This function unpacks all the motion vectors for the individual
 * macroblocks from the bitstream.
 */
810
static int unpack_vectors(Vp3DecodeContext *s, GetBitContext *gb)
811
{
812
    int i, j, k, l;
813 814 815 816 817 818 819 820 821 822
    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 已提交
823
    if (s->keyframe)
824
        return 0;
D
David Conrad 已提交
825

D
David Conrad 已提交
826 827
    memset(motion_x, 0, 6 * sizeof(int));
    memset(motion_y, 0, 6 * sizeof(int));
828

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

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

D
David Conrad 已提交
836 837 838 839 840 841 842 843 844 845
        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;
            }
846

D
David Conrad 已提交
847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863
            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)];
864
                }
865

D
David Conrad 已提交
866 867 868 869
                for (k = 1; k < 6; k++) {
                    motion_x[k] = motion_x[0];
                    motion_y[k] = motion_y[0];
                }
870

D
David Conrad 已提交
871 872 873
                /* vector maintenance, only on MODE_INTER_PLUS_MV */
                if (s->macroblock_coding[current_macroblock] ==
                    MODE_INTER_PLUS_MV) {
874 875
                    prior_last_motion_x = last_motion_x;
                    prior_last_motion_y = last_motion_y;
D
David Conrad 已提交
876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896
                    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)];
897
                        } else {
D
David Conrad 已提交
898 899
                            motion_x[k] = fixed_motion_vector_table[get_bits(gb, 6)];
                            motion_y[k] = fixed_motion_vector_table[get_bits(gb, 6)];
900
                        }
D
David Conrad 已提交
901 902 903 904 905
                        last_motion_x = motion_x[k];
                        last_motion_y = motion_y[k];
                    } else {
                        motion_x[k] = 0;
                        motion_y[k] = 0;
906
                    }
D
David Conrad 已提交
907 908 909
                    motion_x[4] += motion_x[k];
                    motion_y[4] += motion_y[k];
                }
910

D
David Conrad 已提交
911 912 913 914 915 916 917 918 919 920 921 922 923 924
                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];
                }
925

D
David Conrad 已提交
926 927 928 929 930 931 932 933 934 935 936 937 938
                /* 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];
                }
939

D
David Conrad 已提交
940 941 942 943 944 945
                /* 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;
946

D
David Conrad 已提交
947 948 949 950
            default:
                /* covers intra, inter without MV, golden without MV */
                memset(motion_x, 0, 6 * sizeof(int));
                memset(motion_y, 0, 6 * sizeof(int));
951

D
David Conrad 已提交
952 953 954
                /* no vector maintenance */
                break;
            }
955

D
David Conrad 已提交
956 957 958 959 960 961 962 963 964 965
            /* 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;
966
                }
D
David Conrad 已提交
967 968
                s->all_fragments[current_fragment].motion_x = motion_x[k];
                s->all_fragments[current_fragment].motion_y = motion_y[k];
969 970
            }
        }
D
David Conrad 已提交
971
    }
972 973

    return 0;
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 1010 1011 1012 1013 1014 1015 1016
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;
}

1017
/*
1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035
 * 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;
1036 1037
    int zero_run = 0;
    DCTELEM coeff = 0;
1038
    Vp3Fragment *fragment;
M
Michael Niedermayer 已提交
1039
    uint8_t *perm= s->scantable.permutated;
1040
    int bits_to_get;
1041

1042
    if ((first_fragment >= s->fragment_count) ||
1043 1044
        (last_fragment >= s->fragment_count)) {

1045
        av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vlcs(): bad fragment number (%d -> %d ?)\n",
1046
            first_fragment, last_fragment);
1047
        return 0;
1048 1049
    }

1050
    for (i = first_fragment; i <= last_fragment; i++) {
1051
        int fragment_num = s->coded_fragment_list[i];
1052

1053
        if (s->coeff_counts[fragment_num] > coeff_index)
1054
            continue;
1055
        fragment = &s->all_fragments[fragment_num];
1056 1057 1058 1059 1060

        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 */
1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076
            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]);
            }
1077 1078 1079
        }

        if (!eob_run) {
1080 1081
            s->coeff_counts[fragment_num] += zero_run;
            if (s->coeff_counts[fragment_num] < 64){
1082
                fragment->next_coeff->coeff= coeff;
1083
                fragment->next_coeff->index= perm[s->coeff_counts[fragment_num]++]; //FIXME perm here already?
1084 1085 1086 1087
                fragment->next_coeff->next= s->next_coeff;
                s->next_coeff->next=NULL;
                fragment->next_coeff= s->next_coeff++;
            }
1088
        } else {
1089
            s->coeff_counts[fragment_num] |= 128;
1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100
            eob_run--;
        }
    }

    return eob_run;
}

/*
 * This function unpacks all of the DCT coefficient data from the
 * bitstream.
 */
1101
static int unpack_dct_coeffs(Vp3DecodeContext *s, GetBitContext *gb)
1102 1103 1104 1105 1106 1107 1108 1109
{
    int i;
    int dc_y_table;
    int dc_c_table;
    int ac_y_table;
    int ac_c_table;
    int residual_eob_run = 0;

1110
    /* fetch the DC table indexes */
1111 1112 1113 1114
    dc_y_table = get_bits(gb, 4);
    dc_c_table = get_bits(gb, 4);

    /* unpack the Y plane DC coefficients */
1115
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_y_table], 0,
1116
        s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1117 1118 1119

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

1122
    /* fetch the AC table indexes */
1123 1124 1125
    ac_y_table = get_bits(gb, 4);
    ac_c_table = get_bits(gb, 4);

1126
    /* unpack the group 1 AC coefficients (coeffs 1-5) */
1127
    for (i = 1; i <= 5; i++) {
1128
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_y_table], i,
1129
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1130

1131
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_c_table], i,
1132
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1133 1134
    }

1135
    /* unpack the group 2 AC coefficients (coeffs 6-14) */
1136
    for (i = 6; i <= 14; i++) {
1137
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_y_table], i,
1138
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1139

1140
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_c_table], i,
1141
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1142 1143
    }

1144
    /* unpack the group 3 AC coefficients (coeffs 15-27) */
1145
    for (i = 15; i <= 27; i++) {
1146
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_y_table], i,
1147
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1148

1149
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_c_table], i,
1150
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1151 1152
    }

1153
    /* unpack the group 4 AC coefficients (coeffs 28-63) */
1154
    for (i = 28; i <= 63; i++) {
1155
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_y_table], i,
1156
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1157

1158
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_c_table], i,
1159
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1160
    }
1161 1162

    return 0;
1163 1164 1165 1166
}

/*
 * This function reverses the DC prediction for each coded fragment in
1167
 * the frame. Much of this function is adapted directly from the original
1168 1169 1170 1171 1172
 * 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)
1173
#define DC_COEFF(u) (s->coeffs[u].index ? 0 : s->coeffs[u].coeff) //FIXME do somethin to simplify this
1174 1175 1176 1177

static void reverse_dc_prediction(Vp3DecodeContext *s,
                                  int first_fragment,
                                  int fragment_width,
1178
                                  int fragment_height)
1179 1180 1181 1182 1183 1184 1185 1186 1187 1188
{

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

    int x, y;
    int i = first_fragment;

1189
    int predicted_dc;
1190 1191 1192 1193

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

1194
    /* indexes for the left, up-left, up, and up-right fragments */
1195 1196
    int l, ul, u, ur;

1197
    /*
1198 1199 1200 1201 1202 1203
     * The 6 fields mean:
     *   0: up-left multiplier
     *   1: up multiplier
     *   2: up-right multiplier
     *   3: left multiplier
     */
M
Michael Niedermayer 已提交
1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220
    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
1221 1222 1223 1224 1225
    };

    /* 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
1226
     * from other INTRA blocks. There are 2 golden frame coding types;
1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257
     * 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) {

1258
                current_frame_type =
1259 1260
                    compatible_frame[s->all_fragments[i].coding_method];

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

                if (transform == 0) {

                    /* if there were no fragments to predict from, use last
                     * DC saved */
1291
                    predicted_dc = last_dc[current_frame_type];
1292 1293 1294 1295 1296 1297 1298 1299 1300
                } 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 已提交
1301
                    predicted_dc /= 128;
1302 1303 1304 1305

                    /* check for outranging on the [ul u l] and
                     * [ul u ur l] predictors */
                    if ((transform == 13) || (transform == 15)) {
D
Diego Biurrun 已提交
1306
                        if (FFABS(predicted_dc - vu) > 128)
1307
                            predicted_dc = vu;
D
Diego Biurrun 已提交
1308
                        else if (FFABS(predicted_dc - vl) > 128)
1309
                            predicted_dc = vl;
D
Diego Biurrun 已提交
1310
                        else if (FFABS(predicted_dc - vul) > 128)
1311 1312 1313 1314
                            predicted_dc = vul;
                    }
                }

1315 1316 1317 1318 1319 1320 1321 1322
                /* 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;
1323
                /* save the DC */
1324
                last_dc[current_frame_type] = DC_COEFF(i);
1325 1326
                if(DC_COEFF(i) && !(s->coeff_counts[i]&127)){
                    s->coeff_counts[i]= 129;
1327 1328 1329 1330
//                    s->all_fragments[i].next_coeff= s->next_coeff;
                    s->coeffs[i].next= s->next_coeff;
                    (s->next_coeff++)->next=NULL;
                }
1331 1332 1333 1334 1335
            }
        }
    }
}

1336 1337 1338 1339 1340 1341
/*
 * 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 已提交
1342
    int x;
1343
    int16_t *dequantizer;
1344
    DECLARE_ALIGNED_16(DCTELEM, block[64]);
1345 1346 1347 1348 1349 1350 1351 1352 1353 1354
    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 已提交
1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365
        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;
1366

1367

D
Diego Biurrun 已提交
1368
        if(FFABS(stride) > 2048)
1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388
            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;
1389
                    else
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 1420 1421 1422 1423 1424 1425 1426
                        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;
                        }
                    }
1427

1428 1429 1430 1431

                    /* first, take care of copying a block from either the
                     * previous or the golden frame */
                    if (s->all_fragments[i].coding_method != MODE_INTRA) {
1432 1433 1434
                        /* 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
1435 1436 1437 1438 1439 1440 1441 1442 1443
                           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,
1444 1445
                                motion_source - d,
                                motion_source + stride + 1 + d,
1446 1447
                                stride, 8);
                        }
1448
                        dequantizer = s->qmat[s->all_fragments[i].qpi][1][plane];
1449
                    }else{
1450
                        dequantizer = s->qmat[s->all_fragments[i].qpi][0][plane];
1451 1452 1453 1454 1455
                    }

                    /* dequantize the DCT coefficients */
                    if(s->avctx->idct_algo==FF_IDCT_VP3){
                        Coeff *coeff= s->coeffs + i;
L
Loren Merritt 已提交
1456
                        s->dsp.clear_block(block);
1457 1458 1459 1460 1461 1462
                        while(coeff->next){
                            block[coeff->index]= coeff->coeff * dequantizer[coeff->index];
                            coeff= coeff->next;
                        }
                    }else{
                        Coeff *coeff= s->coeffs + i;
L
Loren Merritt 已提交
1463
                        s->dsp.clear_block(block);
1464 1465 1466 1467 1468 1469 1470
                        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 */
1471

1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493
                    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);

                }
1494
#if 0
1495 1496 1497 1498 1499 1500 1501
                /* 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) */
1502
                if ((x > 0) &&
1503 1504 1505
                    ((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)) )) {
1506
                    horizontal_filter(
1507
                        output_plane + s->all_fragments[i].first_pixel + 7*stride,
M
Michael Niedermayer 已提交
1508
                        -stride, s->bounding_values_array + 127);
1509 1510
                }

1511 1512 1513 1514 1515 1516 1517
                /* 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) */
1518
                if ((y > 0) &&
1519 1520 1521
                    ((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)) )) {
1522
                    vertical_filter(
1523
                        output_plane + s->all_fragments[i].first_pixel - stride,
M
Michael Niedermayer 已提交
1524
                        -stride, s->bounding_values_array + 127);
1525
                }
1526
#endif
1527 1528 1529 1530 1531 1532 1533
            }
        }
    }

     /* this looks like a good place for slice dispatch... */
     /* algorithm:
      *   if (slice == s->macroblock_height - 1)
1534 1535 1536
      *     dispatch (both last slice & 2nd-to-last slice);
      *   else if (slice > 0)
      *     dispatch (slice - 1);
1537 1538 1539 1540 1541
      */

    emms_c();
}

1542 1543
static void apply_loop_filter(Vp3DecodeContext *s)
{
M
Michael Niedermayer 已提交
1544 1545
    int plane;
    int x, y;
1546
    int *bounding_values= s->bounding_values_array+127;
1547

1548
#if 0
1549
    int bounding_values_array[256];
1550 1551 1552 1553 1554 1555 1556
    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;
    }
1557
    filter_limit = vp31_filter_limit_values[s->quality_index];
1558 1559

    /* set up the bounding values */
1560
    memset(bounding_values_array, 0, 256 * sizeof(int));
1561 1562 1563 1564 1565 1566
    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;
    }
1567
#endif
1568 1569

    for (plane = 0; plane < 3; plane++) {
M
Michael Niedermayer 已提交
1570 1571 1572 1573 1574
        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 已提交
1575
        if (!s->flipped_image) stride = -stride;
1576 1577

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

1579 1580 1581 1582
            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 已提交
1583
                    s->dsp.vp3_h_loop_filter(
M
Michael Niedermayer 已提交
1584
                        plane_data + s->all_fragments[fragment].first_pixel,
1585 1586 1587 1588 1589 1590
                        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 已提交
1591
                    s->dsp.vp3_v_loop_filter(
M
Michael Niedermayer 已提交
1592
                        plane_data + s->all_fragments[fragment].first_pixel,
1593 1594 1595 1596 1597 1598 1599 1600 1601
                        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 已提交
1602
                    s->dsp.vp3_h_loop_filter(
M
Michael Niedermayer 已提交
1603
                        plane_data + s->all_fragments[fragment + 1].first_pixel,
1604 1605 1606 1607 1608 1609 1610 1611 1612
                        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 已提交
1613
                    s->dsp.vp3_v_loop_filter(
M
Michael Niedermayer 已提交
1614
                        plane_data + s->all_fragments[fragment + width].first_pixel,
1615 1616 1617 1618 1619 1620 1621
                        stride, bounding_values);
                }

                fragment++;
            }
        }
    }
1622 1623
}

1624
/*
1625 1626 1627 1628
 * 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.
 */
1629
static void vp3_calculate_pixel_addresses(Vp3DecodeContext *s)
1630
{
1631 1632
#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
1633 1634

    int i, x, y;
1635
    const int y_inc = s->flipped_image ? 1 : -1;
1636 1637 1638 1639

    /* figure out the first pixel addresses for each of the fragments */
    /* Y plane */
    i = 0;
1640
    for (y = Y_INITIAL(0); Y_FINISHED(0); y += y_inc) {
1641
        for (x = 0; x < s->fragment_width; x++) {
1642
            s->all_fragments[i++].first_pixel =
1643 1644 1645 1646 1647 1648 1649
                s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[0] +
                    x * FRAGMENT_PIXELS;
        }
    }

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

    /* V plane */
M
Michael Niedermayer 已提交
1661
    i = s->fragment_start[2];
1662
    for (y = Y_INITIAL(1); Y_FINISHED(1); y += y_inc) {
1663
        for (x = 0; x < s->fragment_width / 2; x++) {
1664
            s->all_fragments[i++].first_pixel =
1665 1666 1667 1668 1669 1670 1671
                s->golden_frame.linesize[2] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[2] +
                    x * FRAGMENT_PIXELS;
        }
    }
}

1672 1673 1674
/*
 * This is the ffmpeg/libavcodec API init function.
 */
1675
static av_cold int vp3_decode_init(AVCodecContext *avctx)
1676 1677
{
    Vp3DecodeContext *s = avctx->priv_data;
1678
    int i, inter, plane;
1679 1680 1681 1682
    int c_width;
    int c_height;
    int y_superblock_count;
    int c_superblock_count;
1683

A
Alex Beregszaszi 已提交
1684
    if (avctx->codec_tag == MKTAG('V','P','3','0'))
1685
        s->version = 0;
A
Alex Beregszaszi 已提交
1686
    else
1687
        s->version = 1;
A
Alex Beregszaszi 已提交
1688

1689
    s->avctx = avctx;
1690 1691
    s->width = FFALIGN(avctx->width, 16);
    s->height = FFALIGN(avctx->height, 16);
1692
    avctx->pix_fmt = PIX_FMT_YUV420P;
1693
    avctx->chroma_sample_location = AVCHROMA_LOC_CENTER;
1694 1695
    if(avctx->idct_algo==FF_IDCT_AUTO)
        avctx->idct_algo=FF_IDCT_VP3;
1696
    dsputil_init(&s->dsp, avctx);
1697

M
Michael Niedermayer 已提交
1698
    ff_init_scantable(s->dsp.idct_permutation, &s->scantable, ff_zigzag_direct);
1699 1700 1701

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

1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718
    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;
1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729
    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 已提交
1730 1731
    s->fragment_start[1] = s->fragment_width * s->fragment_height;
    s->fragment_start[2] = s->fragment_width * s->fragment_height * 5 / 4;
1732 1733

    s->all_fragments = av_malloc(s->fragment_count * sizeof(Vp3Fragment));
1734
    s->coeff_counts = av_malloc(s->fragment_count * sizeof(*s->coeff_counts));
1735
    s->coeffs = av_malloc(s->fragment_count * sizeof(Coeff) * 65);
1736
    s->coded_fragment_list = av_malloc(s->fragment_count * sizeof(int));
D
Diego Biurrun 已提交
1737
    s->pixel_addresses_initialized = 0;
1738

1739 1740
    if (!s->theora_tables)
    {
M
cleanup  
Michael Niedermayer 已提交
1741
        for (i = 0; i < 64; i++) {
1742 1743
            s->coded_dc_scale_factor[i] = vp31_dc_scale_factor[i];
            s->coded_ac_scale_factor[i] = vp31_ac_scale_factor[i];
1744 1745 1746
            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];
1747
            s->filter_limit_values[i] = vp31_filter_limit_values[i];
M
cleanup  
Michael Niedermayer 已提交
1748
        }
1749

1750 1751 1752 1753 1754 1755 1756 1757 1758
        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;
            }
        }

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 1808 1809 1810 1811 1812 1813 1814
        /* 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);
        }
1815 1816
    }

1817 1818 1819 1820
    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);

1821
    init_vlc(&s->fragment_run_length_vlc, 5, 30,
1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832
        &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);

1833 1834 1835 1836
    /* 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));
1837
    s->macroblock_coding = av_malloc(s->macroblock_count + 1);
1838 1839
    init_block_mapping(s);

1840 1841 1842 1843
    for (i = 0; i < 3; i++) {
        s->current_frame.data[i] = NULL;
        s->last_frame.data[i] = NULL;
        s->golden_frame.data[i] = NULL;
1844 1845
    }

1846 1847 1848 1849 1850 1851
    return 0;
}

/*
 * This is the ffmpeg/libavcodec API frame decode function.
 */
1852
static int vp3_decode_frame(AVCodecContext *avctx,
1853
                            void *data, int *data_size,
1854
                            AVPacket *avpkt)
1855
{
1856 1857
    const uint8_t *buf = avpkt->data;
    int buf_size = avpkt->size;
1858 1859 1860
    Vp3DecodeContext *s = avctx->priv_data;
    GetBitContext gb;
    static int counter = 0;
1861
    int i;
1862 1863

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

1865 1866
    if (s->theora && get_bits1(&gb))
    {
1867 1868
        av_log(avctx, AV_LOG_ERROR, "Header packet passed to frame decoder, skipping\n");
        return -1;
1869
    }
A
Alex Beregszaszi 已提交
1870 1871 1872

    s->keyframe = !get_bits1(&gb);
    if (!s->theora)
1873
        skip_bits(&gb, 1);
1874 1875
    for (i = 0; i < 3; i++)
        s->last_qps[i] = s->qps[i];
1876

1877
    s->nqps=0;
1878
    do{
1879 1880 1881 1882
        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;
1883

1884
    if (s->avctx->debug & FF_DEBUG_PICT_INFO)
1885
        av_log(s->avctx, AV_LOG_INFO, " VP3 %sframe #%d: Q index = %d\n",
1886
            s->keyframe?"key":"", counter, s->qps[0]);
1887 1888
    counter++;

1889
    if (s->qps[0] != s->last_qps[0])
1890
        init_loop_filter(s);
1891 1892 1893 1894 1895 1896

    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);
1897

1898 1899 1900
    if (avctx->skip_frame >= AVDISCARD_NONKEY && !s->keyframe)
        return buf_size;

1901
    if (s->keyframe) {
1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918
        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 已提交
1919

1920 1921 1922
        if (s->last_frame.data[0] == s->golden_frame.data[0]) {
            if (s->golden_frame.data[0])
                avctx->release_buffer(avctx, &s->golden_frame);
1923
            s->last_frame= s->golden_frame; /* ensure that we catch any access to this released frame */
1924 1925 1926 1927 1928 1929
        } 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);
        }
1930

1931
        s->golden_frame.reference = 3;
1932
        if(avctx->get_buffer(avctx, &s->golden_frame) < 0) {
1933
            av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
1934 1935 1936 1937
            return -1;
        }

        /* golden frame is also the current frame */
M
Michael Niedermayer 已提交
1938
        s->current_frame= s->golden_frame;
1939 1940

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

M
Michael Niedermayer 已提交
1959 1960 1961
    s->current_frame.qscale_table= s->qscale_table; //FIXME allocate individual tables per AVFrame
    s->current_frame.qstride= 0;

1962 1963
    init_frame(s, &gb);

M
Michael Niedermayer 已提交
1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975
    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;
    }
1976 1977 1978 1979
    if (unpack_block_qpis(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_block_qpis\n");
        return -1;
    }
M
Michael Niedermayer 已提交
1980 1981
    if (unpack_dct_coeffs(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_dct_coeffs\n");
1982 1983
        return -1;
    }
1984 1985

    reverse_dc_prediction(s, 0, s->fragment_width, s->fragment_height);
1986
    if ((avctx->flags & CODEC_FLAG_GRAY) == 0) {
M
Michael Niedermayer 已提交
1987
        reverse_dc_prediction(s, s->fragment_start[1],
1988
            s->fragment_width / 2, s->fragment_height / 2);
M
Michael Niedermayer 已提交
1989
        reverse_dc_prediction(s, s->fragment_start[2],
1990
            s->fragment_width / 2, s->fragment_height / 2);
1991 1992 1993 1994
    }

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

1996
    apply_loop_filter(s);
1997

1998 1999 2000
    *data_size=sizeof(AVFrame);
    *(AVFrame*)data= s->current_frame;

2001 2002 2003 2004 2005
    /* 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);
2006

2007
    /* shuffle frames (last = current) */
M
Michael Niedermayer 已提交
2008
    s->last_frame= s->current_frame;
2009
    s->current_frame.data[0]= NULL; /* ensure that we catch any access to this released frame */
2010 2011 2012 2013 2014 2015 2016

    return buf_size;
}

/*
 * This is the ffmpeg/libavcodec API module cleanup function.
 */
2017
static av_cold int vp3_decode_end(AVCodecContext *avctx)
2018 2019
{
    Vp3DecodeContext *s = avctx->priv_data;
2020
    int i;
2021

2022
    av_free(s->superblock_coding);
2023
    av_free(s->all_fragments);
2024
    av_free(s->coeff_counts);
2025
    av_free(s->coeffs);
2026 2027 2028 2029
    av_free(s->coded_fragment_list);
    av_free(s->superblock_fragments);
    av_free(s->superblock_macroblocks);
    av_free(s->macroblock_fragments);
2030
    av_free(s->macroblock_coding);
2031

2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044
    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);

2045
    /* release all frames */
2046
    if (s->golden_frame.data[0] && s->golden_frame.data[0] != s->last_frame.data[0])
2047 2048 2049 2050 2051
        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 */
2052 2053 2054 2055

    return 0;
}

2056 2057 2058 2059
static int read_huffman_tree(AVCodecContext *avctx, GetBitContext *gb)
{
    Vp3DecodeContext *s = avctx->priv_data;

2060
    if (get_bits1(gb)) {
2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078
        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;
2079 2080
        if (read_huffman_tree(avctx, gb))
            return -1;
2081
        s->hbits |= 1;
2082 2083
        if (read_huffman_tree(avctx, gb))
            return -1;
2084 2085 2086 2087 2088 2089
        s->hbits >>= 1;
        s->huff_code_size--;
    }
    return 0;
}

2090
#if CONFIG_THEORA_DECODER
2091
static int theora_decode_header(AVCodecContext *avctx, GetBitContext *gb)
2092 2093
{
    Vp3DecodeContext *s = avctx->priv_data;
2094
    int visible_width, visible_height;
2095

2096
    s->theora = get_bits_long(gb, 24);
2097
    av_log(avctx, AV_LOG_DEBUG, "Theora bitstream version %X\n", s->theora);
2098

M
Matthieu Castet 已提交
2099
    /* 3.2.0 aka alpha3 has the same frame orientation as original vp3 */
2100
    /* but previous versions have the image flipped relative to vp3 */
M
Matthieu Castet 已提交
2101
    if (s->theora < 0x030200)
2102
    {
2103
        s->flipped_image = 1;
2104 2105
        av_log(avctx, AV_LOG_DEBUG, "Old (<alpha3) Theora bitstream, flipped image\n");
    }
2106

2107 2108
    visible_width  = s->width  = get_bits(gb, 16) << 4;
    visible_height = s->height = get_bits(gb, 16) << 4;
2109

2110
    if(avcodec_check_dimensions(avctx, s->width, s->height)){
2111
        av_log(avctx, AV_LOG_ERROR, "Invalid dimensions (%dx%d)\n", s->width, s->height);
2112 2113 2114
        s->width= s->height= 0;
        return -1;
    }
2115 2116 2117

    if (s->theora >= 0x030400)
    {
2118
        skip_bits(gb, 32); /* total number of superblocks in a frame */
2119
        // fixme, the next field is 36bits long
2120 2121 2122
        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 */
2123
    }
2124

2125
    if (s->theora >= 0x030200) {
D
David Conrad 已提交
2126 2127
        visible_width  = get_bits_long(gb, 24);
        visible_height = get_bits_long(gb, 24);
2128

2129 2130 2131
        skip_bits(gb, 8); /* offset x */
        skip_bits(gb, 8); /* offset y */
    }
2132

2133 2134 2135 2136
    skip_bits(gb, 32); /* fps numerator */
    skip_bits(gb, 32); /* fps denumerator */
    skip_bits(gb, 24); /* aspect numerator */
    skip_bits(gb, 24); /* aspect denumerator */
2137

M
Matthieu Castet 已提交
2138
    if (s->theora < 0x030200)
2139 2140
        skip_bits(gb, 5); /* keyframe frequency force */
    skip_bits(gb, 8); /* colorspace */
2141
    if (s->theora >= 0x030400)
2142 2143
        skip_bits(gb, 2); /* pixel format: 420,res,422,444 */
    skip_bits(gb, 24); /* bitrate */
2144

2145
    skip_bits(gb, 6); /* quality hint */
2146

M
Matthieu Castet 已提交
2147
    if (s->theora >= 0x030200)
2148
    {
2149
        skip_bits(gb, 5); /* keyframe frequency force */
2150

2151
        if (s->theora < 0x030400)
2152
            skip_bits(gb, 5); /* spare bits */
2153
    }
2154

2155
//    align_get_bits(gb);
2156

2157 2158 2159 2160 2161
    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);
2162 2163 2164 2165

    return 0;
}

2166
static int theora_decode_tables(AVCodecContext *avctx, GetBitContext *gb)
2167 2168
{
    Vp3DecodeContext *s = avctx->priv_data;
2169
    int i, n, matrices, inter, plane;
M
Matthieu Castet 已提交
2170 2171

    if (s->theora >= 0x030200) {
2172
        n = get_bits(gb, 3);
2173
        /* loop filter limit values table */
2174
        for (i = 0; i < 64; i++) {
2175
            s->filter_limit_values[i] = get_bits(gb, n);
2176 2177 2178 2179 2180
            if (s->filter_limit_values[i] > 127) {
                av_log(avctx, AV_LOG_ERROR, "filter limit value too large (%i > 127), clamping\n", s->filter_limit_values[i]);
                s->filter_limit_values[i] = 127;
            }
        }
M
Matthieu Castet 已提交
2181
    }
2182

M
Matthieu Castet 已提交
2183
    if (s->theora >= 0x030200)
2184
        n = get_bits(gb, 4) + 1;
M
Matthieu Castet 已提交
2185 2186
    else
        n = 16;
2187 2188
    /* quality threshold table */
    for (i = 0; i < 64; i++)
2189
        s->coded_ac_scale_factor[i] = get_bits(gb, n);
2190

M
Matthieu Castet 已提交
2191
    if (s->theora >= 0x030200)
2192
        n = get_bits(gb, 4) + 1;
M
Matthieu Castet 已提交
2193 2194
    else
        n = 16;
2195 2196
    /* dc scale factor table */
    for (i = 0; i < 64; i++)
2197
        s->coded_dc_scale_factor[i] = get_bits(gb, n);
2198

M
Matthieu Castet 已提交
2199
    if (s->theora >= 0x030200)
2200
        matrices = get_bits(gb, 9) + 1;
M
Matthieu Castet 已提交
2201
    else
2202
        matrices = 3;
2203

2204 2205 2206 2207
    if(matrices > 384){
        av_log(avctx, AV_LOG_ERROR, "invalid number of base matrixes\n");
        return -1;
    }
A
Alex Beregszaszi 已提交
2208

2209
    for(n=0; n<matrices; n++){
2210
        for (i = 0; i < 64; i++)
2211 2212
            s->base_matrix[n][i]= get_bits(gb, 8);
    }
2213

2214 2215 2216 2217
    for (inter = 0; inter <= 1; inter++) {
        for (plane = 0; plane <= 2; plane++) {
            int newqr= 1;
            if (inter || plane > 0)
2218
                newqr = get_bits1(gb);
2219
            if (!newqr) {
2220
                int qtj, plj;
2221
                if(inter && get_bits1(gb)){
2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232
                    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;
2233
                int qi = 0;
2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246

                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;
2247
                }
2248

2249
                if (qi > 63) {
2250
                    av_log(avctx, AV_LOG_ERROR, "invalid qi %d > 63\n", qi);
2251 2252
                    return -1;
                }
2253
                s->qr_count[inter][plane]= qri;
2254 2255 2256 2257
            }
        }
    }

2258
    /* Huffman tables */
2259 2260 2261
    for (s->hti = 0; s->hti < 80; s->hti++) {
        s->entries = 0;
        s->huff_code_size = 1;
2262
        if (!get_bits1(gb)) {
2263
            s->hbits = 0;
2264 2265
            if(read_huffman_tree(avctx, gb))
                return -1;
2266
            s->hbits = 1;
2267 2268
            if(read_huffman_tree(avctx, gb))
                return -1;
2269 2270
        }
    }
2271

2272
    s->theora_tables = 1;
2273

2274 2275 2276
    return 0;
}

2277
static av_cold int theora_decode_init(AVCodecContext *avctx)
2278 2279 2280 2281
{
    Vp3DecodeContext *s = avctx->priv_data;
    GetBitContext gb;
    int ptype;
2282 2283 2284
    uint8_t *header_start[3];
    int header_len[3];
    int i;
2285

2286 2287 2288
    s->theora = 1;

    if (!avctx->extradata_size)
2289 2290
    {
        av_log(avctx, AV_LOG_ERROR, "Missing extradata!\n");
2291
        return -1;
2292
    }
2293

2294 2295 2296 2297 2298
    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;
    }
2299

2300 2301
  for(i=0;i<3;i++) {
    init_get_bits(&gb, header_start[i], header_len[i]);
2302 2303

    ptype = get_bits(&gb, 8);
2304

2305 2306 2307
     if (!(ptype & 0x80))
     {
        av_log(avctx, AV_LOG_ERROR, "Invalid extradata!\n");
2308
//        return -1;
2309
     }
2310

2311
    // FIXME: Check for this as well.
2312
    skip_bits_long(&gb, 6*8); /* "theora" */
2313

2314 2315 2316
    switch(ptype)
    {
        case 0x80:
2317
            theora_decode_header(avctx, &gb);
2318 2319
                break;
        case 0x81:
2320
// FIXME: is this needed? it breaks sometimes
2321 2322 2323
//            theora_decode_comments(avctx, gb);
            break;
        case 0x82:
2324 2325
            if (theora_decode_tables(avctx, &gb))
                return -1;
2326 2327 2328 2329
            break;
        default:
            av_log(avctx, AV_LOG_ERROR, "Unknown Theora config packet: %d\n", ptype&~0x80);
            break;
2330
    }
2331 2332
    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);
2333 2334
    if (s->theora < 0x030200)
        break;
2335
  }
2336

M
Matthieu Castet 已提交
2337
    vp3_decode_init(avctx);
2338 2339 2340
    return 0;
}

2341 2342
AVCodec theora_decoder = {
    "theora",
2343
    CODEC_TYPE_VIDEO,
2344
    CODEC_ID_THEORA,
2345
    sizeof(Vp3DecodeContext),
2346
    theora_decode_init,
2347 2348 2349
    NULL,
    vp3_decode_end,
    vp3_decode_frame,
2350
    CODEC_CAP_DR1,
2351
    NULL,
2352
    .long_name = NULL_IF_CONFIG_SMALL("Theora"),
2353
};
2354
#endif
2355

2356 2357
AVCodec vp3_decoder = {
    "vp3",
2358
    CODEC_TYPE_VIDEO,
2359
    CODEC_ID_VP3,
2360
    sizeof(Vp3DecodeContext),
2361
    vp3_decode_init,
2362 2363 2364
    NULL,
    vp3_decode_end,
    vp3_decode_frame,
2365
    CODEC_CAP_DR1,
2366
    NULL,
2367
    .long_name = NULL_IF_CONFIG_SMALL("On2 VP3"),
2368
};