vp3.c 77.3 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
 */

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

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

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

#define FRAGMENT_PIXELS 8

45 46
static av_cold int vp3_decode_end(AVCodecContext *avctx);

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

//FIXME split things out into their own arrays
54
typedef struct Vp3Fragment {
55
    Coeff *next_coeff;
56 57 58
    uint8_t coding_method;
    int8_t motion_x;
    int8_t motion_y;
59
    uint8_t qpi;
60 61 62 63 64 65
} Vp3Fragment;

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

66 67 68 69 70
// This is the maximum length of a single long bit run that can be encoded
// for superblock coding or block qps. Theora special-cases this to read a
// bit instead of flipping the current bit to allow for runs longer than 4129.
#define MAXIMUM_LONG_BIT_RUN 4129

71 72 73 74 75 76 77 78 79 80 81 82 83 84
#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 */
85
static const int ModeAlphabet[6][CODING_MODE_COUNT] =
86 87
{
    /* scheme 1: Last motion vector dominates */
88
    {    MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
89
         MODE_INTER_PLUS_MV,    MODE_INTER_NO_MV,
90
         MODE_INTRA,            MODE_USING_GOLDEN,
91 92 93
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

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

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

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

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

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

};

#define MIN_DEQUANT_VAL 2

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

140 141 142
    int qps[3];
    int nqps;
    int last_qps[3];
143 144

    int superblock_count;
145 146 147 148
    int y_superblock_width;
    int y_superblock_height;
    int c_superblock_width;
    int c_superblock_height;
149 150 151 152 153 154 155 156 157 158 159 160 161
    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;
162
    uint8_t *coeff_counts;
163 164
    Coeff *coeffs;
    Coeff *next_coeff;
M
Michael Niedermayer 已提交
165
    int fragment_start[3];
D
David Conrad 已提交
166
    int data_offset[3];
167

M
Michael Niedermayer 已提交
168
    ScanTable scantable;
169

170 171
    /* tables */
    uint16_t coded_dc_scale_factor[64];
172
    uint32_t coded_ac_scale_factor[64];
173 174 175 176
    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];
177

178
    /* this is a list of indexes into the all_fragments array indicating
179 180 181 182
     * which of the fragments are coded */
    int *coded_fragment_list;
    int coded_fragment_list_index;

183 184 185 186 187 188 189 190
    /* track which fragments have already been decoded; called 'fast'
     * because this data structure avoids having to iterate through every
     * fragment in coded_fragment_list; once a fragment has been fully
     * decoded, it is removed from this list */
    int *fast_fragment_list;
    int fragment_list_y_head;
    int fragment_list_c_head;

191 192 193 194 195 196
    VLC dc_vlc[16];
    VLC ac_vlc_1[16];
    VLC ac_vlc_2[16];
    VLC ac_vlc_3[16];
    VLC ac_vlc_4[16];

197 198 199 200 201
    VLC superblock_run_length_vlc;
    VLC fragment_run_length_vlc;
    VLC mode_code_vlc;
    VLC motion_vector_vlc;

202 203
    /* these arrays need to be on 16-byte boundaries since SSE2 operations
     * index into them */
204
    DECLARE_ALIGNED_16(int16_t, qmat)[3][2][3][64];     //<qmat[qpi][is_inter][plane]
205 206

    /* This table contains superblock_count * 16 entries. Each set of 16
207
     * numbers corresponds to the fragment indexes 0..15 of the superblock.
208 209 210 211
     * An entry will be -1 to indicate that no entry corresponds to that
     * index. */
    int *superblock_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];
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
{
    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;

262
    static const signed char travel_width[16] = {
263
         1,  1,  0, -1,
264 265 266 267 268
         0,  0,  1,  0,
         1,  0,  1,  0,
         0, -1,  0,  1
    };

269
    static const signed char travel_height[16] = {
270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288
         0,  0,  1,  0,
         1,  1,  0, -1,
         0,  1,  0, -1,
        -1,  0, -1,  0
    };

    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;
289
            current_width = -1;
290
            current_height = 0;
291
            superblock_row_inc = 3 * s->fragment_width -
292
                (s->y_superblock_width * 4 - s->fragment_width);
293 294 295 296 297 298 299 300 301

            /* 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;
302
            current_width = -1;
303
            current_height = 0;
304
            superblock_row_inc = 3 * (s->fragment_width / 2) -
305
                (s->c_superblock_width * 4 - s->fragment_width / 2);
306 307

            /* the first operation for this variable is to advance by 1 */
M
Michael Niedermayer 已提交
308
            current_fragment = s->fragment_start[1] - 1;
309 310 311 312 313 314

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

            /* start of V superblocks */
            right_edge = s->fragment_width / 2;
            bottom_edge = s->fragment_height / 2;
315
            current_width = -1;
316
            current_height = 0;
317
            superblock_row_inc = 3 * (s->fragment_width / 2) -
318
                (s->c_superblock_width * 4 - s->fragment_width / 2);
319 320

            /* the first operation for this variable is to advance by 1 */
M
Michael Niedermayer 已提交
321
            current_fragment = s->fragment_start[2] - 1;
322 323 324

        }

325
        if (current_width >= right_edge - 1) {
326
            /* reset width and move to next superblock row */
327
            current_width = -1;
328 329 330 331 332 333 334 335
            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 已提交
336
            current_fragment += travel_width[j] + right_edge * travel_height[j];
337
            current_width += travel_width[j];
338 339 340
            current_height += travel_height[j];

            /* check if the fragment is in bounds */
341
            if ((current_width < right_edge) &&
342 343 344 345 346 347 348 349 350 351
                (current_height < bottom_edge)) {
                s->superblock_fragments[mapping_index] = current_fragment;
            } else {
                s->superblock_fragments[mapping_index] = -1;
            }

            mapping_index++;
        }
    }

352
    return 0;  /* successful path out */
353 354 355 356 357 358 359 360 361 362 363 364
}

/*
 * 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++) {
365
        s->coeff_counts[i] = 0;
366 367 368
        s->all_fragments[i].motion_x = 127;
        s->all_fragments[i].motion_y = 127;
        s->all_fragments[i].next_coeff= NULL;
369
        s->all_fragments[i].qpi = 0;
370 371 372
        s->coeffs[i].index=
        s->coeffs[i].coeff=0;
        s->coeffs[i].next= NULL;
373 374 375 376
    }
}

/*
377
 * This function sets up the dequantization tables used for a particular
378 379
 * frame.
 */
380
static void init_dequantizer(Vp3DecodeContext *s, int qpi)
381
{
382 383
    int ac_scale_factor = s->coded_ac_scale_factor[s->qps[qpi]];
    int dc_scale_factor = s->coded_dc_scale_factor[s->qps[qpi]];
384
    int i, plane, inter, qri, bmi, bmj, qistart;
385

386 387 388 389 390
    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];
391
                if(s->qps[qpi] <= sum)
392 393 394 395 396 397
                    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++){
398 399
                int coeff= (  2*(sum    -s->qps[qpi])*s->base_matrix[bmi][i]
                            - 2*(qistart-s->qps[qpi])*s->base_matrix[bmj][i]
400 401 402
                            + s->qr_size[inter][plane][qri])
                           / (2*s->qr_size[inter][plane][qri]);

M
Michael Niedermayer 已提交
403
                int qmin= 8<<(inter + !i);
404 405
                int qscale= i ? ac_scale_factor : dc_scale_factor;

406
                s->qmat[qpi][inter][plane][s->dsp.idct_permutation[i]]= av_clip((qscale * coeff)/100 * 4, qmin, 4096);
407
            }
408 409
            // 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];
410
        }
411
    }
412

413
    memset(s->qscale_table, (FFMAX(s->qmat[0][0][0][1], s->qmat[0][0][1][1])+8)/16, 512); //FIXME finetune
414 415
}

416 417 418
/*
 * This function initializes the loop filter boundary limits if the frame's
 * quality index is different from the previous frame's.
419 420
 *
 * The filter_limit_values may not be larger than 127.
421 422 423 424 425 426
 */
static void init_loop_filter(Vp3DecodeContext *s)
{
    int *bounding_values= s->bounding_values_array+127;
    int filter_limit;
    int x;
427
    int value;
428

429
    filter_limit = s->filter_limit_values[s->qps[0]];
430 431 432 433 434 435 436

    /* 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;
    }
437 438 439 440 441 442
    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 已提交
443
    bounding_values[129] = bounding_values[130] = filter_limit * 0x02020202;
444 445
}

446
/*
447
 * This function unpacks all of the superblock/macroblock/fragment coding
448 449
 * information from the bitstream.
 */
450
static int unpack_superblocks(Vp3DecodeContext *s, GetBitContext *gb)
451 452 453 454
{
    int bit = 0;
    int current_superblock = 0;
    int current_run = 0;
455
    int num_partial_superblocks = 0;
456
    int first_c_fragment_seen;
457 458 459 460 461 462 463 464 465 466

    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 */
467
        bit = get_bits1(gb);
468
        while (current_superblock < s->superblock_count) {
469
                current_run = get_vlc2(gb,
470 471
                    s->superblock_run_length_vlc.table, 6, 2) + 1;
                if (current_run == 34)
472
                    current_run += get_bits(gb, 12);
473

474 475 476 477 478 479 480 481
            if (current_superblock + current_run > s->superblock_count) {
                av_log(s->avctx, AV_LOG_ERROR, "Invalid partially coded superblock run length\n");
                return -1;
            }

            memset(s->superblock_coding + current_superblock, bit, current_run);

            current_superblock += current_run;
482 483
            if (bit)
                num_partial_superblocks += current_run;
484 485

                bit ^= 1;
486 487 488 489
        }

        /* unpack the list of fully coded superblocks if any of the blocks were
         * not marked as partially coded in the previous step */
490 491
        if (num_partial_superblocks < s->superblock_count) {
            int superblocks_decoded = 0;
492 493

            current_superblock = 0;
494
            bit = get_bits1(gb);
495
            while (superblocks_decoded < s->superblock_count - num_partial_superblocks) {
496
                        current_run = get_vlc2(gb,
497 498
                            s->superblock_run_length_vlc.table, 6, 2) + 1;
                        if (current_run == 34)
499
                            current_run += get_bits(gb, 12);
500 501 502 503 504

                for (j = 0; j < current_run; current_superblock++) {
                    if (current_superblock >= s->superblock_count) {
                        av_log(s->avctx, AV_LOG_ERROR, "Invalid fully coded superblock run length\n");
                        return -1;
505
                    }
506 507 508

                /* skip any superblocks already marked as partially coded */
                if (s->superblock_coding[current_superblock] == SB_NOT_CODED) {
509
                    s->superblock_coding[current_superblock] = 2*bit;
510 511
                    j++;
                }
512
                }
513 514 515
                superblocks_decoded += current_run;

                    bit ^= 1;
516 517 518 519 520
            }
        }

        /* if there were partial blocks, initialize bitstream for
         * unpacking fragment codings */
521
        if (num_partial_superblocks) {
522 523

            current_run = 0;
524
            bit = get_bits1(gb);
525
            /* toggle the bit because as soon as the first run length is
526 527 528 529 530 531 532 533
             * 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;
534
    s->next_coeff= s->coeffs + s->fragment_count;
535 536
    s->first_coded_y_fragment = s->first_coded_c_fragment = 0;
    s->last_coded_y_fragment = s->last_coded_c_fragment = -1;
537
    first_c_fragment_seen = 0;
538
    memset(s->macroblock_coding, MODE_COPY, s->macroblock_count);
539 540 541 542 543 544 545
    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];
546
            if (current_fragment >= s->fragment_count) {
547
                av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_superblocks(): bad fragment number (%d >= %d)\n",
548 549 550
                    current_fragment, s->fragment_count);
                return 1;
            }
551 552 553 554
            if (current_fragment != -1) {
                if (s->superblock_coding[i] == SB_NOT_CODED) {

                    /* copy all the fragments from the prior frame */
555
                    s->all_fragments[current_fragment].coding_method =
556 557 558 559 560 561
                        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 */
562
                    if (current_run-- == 0) {
563
                        bit ^= 1;
564
                        current_run = get_vlc2(gb,
565
                            s->fragment_run_length_vlc.table, 5, 2);
566 567 568
                    }

                    if (bit) {
569
                        /* default mode; actual mode will be decoded in
570
                         * the next phase */
571
                        s->all_fragments[current_fragment].coding_method =
572
                            MODE_INTER_NO_MV;
573
                        s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
574
                        s->coded_fragment_list[s->coded_fragment_list_index] =
575
                            current_fragment;
M
Michael Niedermayer 已提交
576
                        if ((current_fragment >= s->fragment_start[1]) &&
577 578
                            (s->last_coded_y_fragment == -1) &&
                            (!first_c_fragment_seen)) {
579 580
                            s->first_coded_c_fragment = s->coded_fragment_list_index;
                            s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
581
                            first_c_fragment_seen = 1;
582 583
                        }
                        s->coded_fragment_list_index++;
584 585 586 587 588 589 590 591 592 593
                    } 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 */
594
                    s->all_fragments[current_fragment].coding_method =
595
                        MODE_INTER_NO_MV;
596
                    s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
597
                    s->coded_fragment_list[s->coded_fragment_list_index] =
598
                        current_fragment;
M
Michael Niedermayer 已提交
599
                    if ((current_fragment >= s->fragment_start[1]) &&
600 601
                        (s->last_coded_y_fragment == -1) &&
                        (!first_c_fragment_seen)) {
602 603
                        s->first_coded_c_fragment = s->coded_fragment_list_index;
                        s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
604
                        first_c_fragment_seen = 1;
605 606
                    }
                    s->coded_fragment_list_index++;
607 608 609 610
                }
            }
        }
    }
611

612 613
    if (!first_c_fragment_seen)
        /* only Y fragments coded in this frame */
614
        s->last_coded_y_fragment = s->coded_fragment_list_index - 1;
615
    else
616
        /* end the list of coded C fragments */
617
        s->last_coded_c_fragment = s->coded_fragment_list_index - 1;
618

619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637
    for (i = 0; i < s->fragment_count - 1; i++) {
        s->fast_fragment_list[i] = i + 1;
    }
    s->fast_fragment_list[s->fragment_count - 1] = -1;

    if (s->last_coded_y_fragment == -1)
        s->fragment_list_y_head = -1;
    else {
        s->fragment_list_y_head = s->first_coded_y_fragment;
        s->fast_fragment_list[s->last_coded_y_fragment] = -1;
    }

    if (s->last_coded_c_fragment == -1)
        s->fragment_list_c_head = -1;
    else {
        s->fragment_list_c_head = s->first_coded_c_fragment;
        s->fast_fragment_list[s->last_coded_c_fragment] = -1;
    }

638
    return 0;
639 640 641 642 643 644
}

/*
 * This function unpacks all the coding mode data for individual macroblocks
 * from the bitstream.
 */
645
static int unpack_modes(Vp3DecodeContext *s, GetBitContext *gb)
646
{
647
    int i, j, k, sb_x, sb_y;
648 649 650 651
    int scheme;
    int current_macroblock;
    int current_fragment;
    int coding_mode;
652
    int custom_mode_alphabet[CODING_MODE_COUNT];
653
    const int *alphabet;
654 655 656 657 658 659 660 661 662 663 664 665

    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) {
666 667
            for (i = 0; i < 8; i++)
                custom_mode_alphabet[i] = MODE_INTER_NO_MV;
668
            for (i = 0; i < 8; i++)
669
                custom_mode_alphabet[get_bits(gb, 3)] = i;
670 671 672
            alphabet = custom_mode_alphabet;
        } else
            alphabet = ModeAlphabet[scheme-1];
673 674 675

        /* iterate through all of the macroblocks that contain 1 or more
         * coded fragments */
676 677
        for (sb_y = 0; sb_y < s->y_superblock_height; sb_y++) {
            for (sb_x = 0; sb_x < s->y_superblock_width; sb_x++) {
678 679

            for (j = 0; j < 4; j++) {
680 681
                int mb_x = 2*sb_x +   (j>>1);
                int mb_y = 2*sb_y + (((j>>1)+j)&1);
682
                int frags_coded = 0;
683 684
                current_macroblock = mb_y * s->macroblock_width + mb_x;

685
                if (mb_x >= s->macroblock_width || mb_y >= s->macroblock_height)
686 687
                    continue;

688 689
#define BLOCK_X (2*mb_x + (k&1))
#define BLOCK_Y (2*mb_y + (k>>1))
690 691 692 693 694 695 696 697 698 699 700
                /* coding modes are only stored if the macroblock has at least one
                 * luma block coded, otherwise it must be INTER_NO_MV */
                for (k = 0; k < 4; k++) {
                    current_fragment = BLOCK_Y*s->fragment_width + BLOCK_X;
                    if (s->all_fragments[current_fragment].coding_method != MODE_COPY)
                        break;
                }
                if (k == 4) {
                    s->macroblock_coding[current_macroblock] = MODE_INTER_NO_MV;
                    continue;
                }
701

702 703 704 705
                /* mode 7 means get 3 bits for each coding mode */
                if (scheme == 7)
                    coding_mode = get_bits(gb, 3);
                else
706
                    coding_mode = alphabet
707
                        [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
708

709
                s->macroblock_coding[current_macroblock] = coding_mode;
710
                for (k = 0; k < 4; k++) {
711
                    current_fragment =
712 713 714 715 716 717 718 719 720
                        BLOCK_Y*s->fragment_width + BLOCK_X;
                    if (s->all_fragments[current_fragment].coding_method !=
                        MODE_COPY)
                        s->all_fragments[current_fragment].coding_method =
                            coding_mode;
                }
                for (k = 0; k < 2; k++) {
                    current_fragment = s->fragment_start[k+1] +
                        mb_y*(s->fragment_width>>1) + mb_x;
721
                    if (s->all_fragments[current_fragment].coding_method !=
722 723 724 725 726
                        MODE_COPY)
                        s->all_fragments[current_fragment].coding_method =
                            coding_mode;
                }
            }
727
            }
728 729
        }
    }
730 731

    return 0;
732 733
}

734 735 736 737
/*
 * This function unpacks all the motion vectors for the individual
 * macroblocks from the bitstream.
 */
738
static int unpack_vectors(Vp3DecodeContext *s, GetBitContext *gb)
739
{
740
    int j, k, sb_x, sb_y;
741 742 743 744 745 746 747 748 749 750
    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 已提交
751
    if (s->keyframe)
752
        return 0;
D
David Conrad 已提交
753

D
David Conrad 已提交
754 755
    memset(motion_x, 0, 6 * sizeof(int));
    memset(motion_y, 0, 6 * sizeof(int));
756

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

D
David Conrad 已提交
760 761
    /* iterate through all of the macroblocks that contain 1 or more
     * coded fragments */
762 763
    for (sb_y = 0; sb_y < s->y_superblock_height; sb_y++) {
        for (sb_x = 0; sb_x < s->y_superblock_width; sb_x++) {
764

D
David Conrad 已提交
765
        for (j = 0; j < 4; j++) {
766 767 768 769 770
            int mb_x = 2*sb_x +   (j>>1);
            int mb_y = 2*sb_y + (((j>>1)+j)&1);
            current_macroblock = mb_y * s->macroblock_width + mb_x;

            if (mb_x >= s->macroblock_width || mb_y >= s->macroblock_height ||
D
David Conrad 已提交
771 772
                (s->macroblock_coding[current_macroblock] == MODE_COPY))
                continue;
773

D
David Conrad 已提交
774 775 776 777 778 779 780 781 782 783 784
            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)];
785
                }
786

D
David Conrad 已提交
787 788 789
                /* vector maintenance, only on MODE_INTER_PLUS_MV */
                if (s->macroblock_coding[current_macroblock] ==
                    MODE_INTER_PLUS_MV) {
790 791
                    prior_last_motion_x = last_motion_x;
                    prior_last_motion_y = last_motion_y;
D
David Conrad 已提交
792 793 794 795 796 797 798 799 800 801 802 803 804 805
                    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++) {
806
                    current_fragment = BLOCK_Y*s->fragment_width + BLOCK_X;
807
                    if (s->all_fragments[current_fragment].coding_method != MODE_COPY) {
D
David Conrad 已提交
808 809 810
                        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)];
811
                        } else {
D
David Conrad 已提交
812 813
                            motion_x[k] = fixed_motion_vector_table[get_bits(gb, 6)];
                            motion_y[k] = fixed_motion_vector_table[get_bits(gb, 6)];
814
                        }
D
David Conrad 已提交
815 816 817 818 819
                        last_motion_x = motion_x[k];
                        last_motion_y = motion_y[k];
                    } else {
                        motion_x[k] = 0;
                        motion_y[k] = 0;
820
                    }
D
David Conrad 已提交
821 822 823
                    motion_x[4] += motion_x[k];
                    motion_y[4] += motion_y[k];
                }
824

D
David Conrad 已提交
825 826 827 828 829 830 831 832 833 834
                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;
835

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

D
David Conrad 已提交
846 847 848 849 850 851
                /* 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;
852

D
David Conrad 已提交
853 854
            default:
                /* covers intra, inter without MV, golden without MV */
855 856
                motion_x[0] = 0;
                motion_y[0] = 0;
857

D
David Conrad 已提交
858 859 860
                /* no vector maintenance */
                break;
            }
861

D
David Conrad 已提交
862
            /* assign the motion vectors to the correct fragments */
863
            for (k = 0; k < 4; k++) {
D
David Conrad 已提交
864
                current_fragment =
865
                    BLOCK_Y*s->fragment_width + BLOCK_X;
866
                if (s->macroblock_coding[current_macroblock] == MODE_INTER_FOURMV) {
867 868
                    s->all_fragments[current_fragment].motion_x = motion_x[k];
                    s->all_fragments[current_fragment].motion_y = motion_y[k];
869 870 871 872
                } else {
                    s->all_fragments[current_fragment].motion_x = motion_x[0];
                    s->all_fragments[current_fragment].motion_y = motion_y[0];
                }
873
            }
874 875 876 877 878 879 880 881 882 883 884
            for (k = 0; k < 2; k++) {
                current_fragment = s->fragment_start[k+1] +
                    mb_y*(s->fragment_width>>1) + mb_x;
                if (s->macroblock_coding[current_macroblock] == MODE_INTER_FOURMV) {
                    s->all_fragments[current_fragment].motion_x = motion_x[k+4];
                    s->all_fragments[current_fragment].motion_y = motion_y[k+4];
                } else {
                    s->all_fragments[current_fragment].motion_x = motion_x[0];
                    s->all_fragments[current_fragment].motion_y = motion_y[0];
                }
            }
885
        }
886
        }
D
David Conrad 已提交
887
    }
888 889

    return 0;
890 891
}

892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911
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++) {
912
                if (i >= s->coded_fragment_list_index)
913 914 915 916 917 918 919 920
                    return -1;

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

921
            if (run_length == MAXIMUM_LONG_BIT_RUN)
922 923 924 925 926 927 928 929 930 931 932
                bit = get_bits1(gb);
            else
                bit ^= 1;
        } while (blocks_decoded < num_blocks);

        num_blocks -= num_blocks_at_qpi;
    }

    return 0;
}

933
/*
934 935 936 937 938 939 940 941 942 943 944 945 946
 * 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,
947
                        int y_plane,
948 949 950 951
                        int eob_run)
{
    int i;
    int token;
952 953
    int zero_run = 0;
    DCTELEM coeff = 0;
954
    Vp3Fragment *fragment;
955
    int bits_to_get;
956 957 958 959
    int next_fragment;
    int previous_fragment;
    int fragment_num;
    int *list_head;
960

961 962 963 964 965 966
    /* local references to structure members to avoid repeated deferences */
    uint8_t *perm= s->scantable.permutated;
    int *coded_fragment_list = s->coded_fragment_list;
    Vp3Fragment *all_fragments = s->all_fragments;
    uint8_t *coeff_counts = s->coeff_counts;
    VLC_TYPE (*vlc_table)[2] = table->table;
967
    int *fast_fragment_list = s->fast_fragment_list;
968

969 970 971 972 973 974
    if (y_plane) {
        next_fragment = s->fragment_list_y_head;
        list_head = &s->fragment_list_y_head;
    } else {
        next_fragment = s->fragment_list_c_head;
        list_head = &s->fragment_list_c_head;
975 976
    }

977 978 979 980
    i = next_fragment;
    previous_fragment = -1;  /* this indicates that the previous fragment is actually the list head */
    while (i != -1) {
        fragment_num = coded_fragment_list[i];
981

982 983 984
        if (coeff_counts[fragment_num] > coeff_index) {
            previous_fragment = i;
            i = fast_fragment_list[i];
985
            continue;
986
        }
987
        fragment = &all_fragments[fragment_num];
988 989 990

        if (!eob_run) {
            /* decode a VLC into a token */
991
            token = get_vlc2(gb, vlc_table, 5, 3);
992
            /* use the token to get a zero run, a coefficient, and an eob run */
993 994 995 996 997 998 999
            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];
1000 1001 1002
                if (bits_to_get)
                    bits_to_get = get_bits(gb, bits_to_get);
                coeff = coeff_tables[token][bits_to_get];
1003 1004 1005 1006 1007

                zero_run = zero_run_base[token];
                if (zero_run_get_bits[token])
                    zero_run += get_bits(gb, zero_run_get_bits[token]);
            }
1008 1009 1010
        }

        if (!eob_run) {
1011 1012
            coeff_counts[fragment_num] += zero_run;
            if (coeff_counts[fragment_num] < 64){
1013
                fragment->next_coeff->coeff= coeff;
1014
                fragment->next_coeff->index= perm[coeff_counts[fragment_num]++]; //FIXME perm here already?
1015 1016 1017 1018
                fragment->next_coeff->next= s->next_coeff;
                s->next_coeff->next=NULL;
                fragment->next_coeff= s->next_coeff++;
            }
1019 1020
            /* previous fragment is now this fragment */
            previous_fragment = i;
1021
        } else {
1022
            coeff_counts[fragment_num] |= 128;
1023
            eob_run--;
1024 1025 1026 1027 1028 1029
            /* remove this fragment from the list */
            if (previous_fragment != -1)
                fast_fragment_list[previous_fragment] = fast_fragment_list[i];
            else
                *list_head = fast_fragment_list[i];
            /* previous fragment remains unchanged */
1030
        }
1031 1032

        i = fast_fragment_list[i];
1033 1034 1035 1036 1037
    }

    return eob_run;
}

1038 1039 1040 1041
static void reverse_dc_prediction(Vp3DecodeContext *s,
                                  int first_fragment,
                                  int fragment_width,
                                  int fragment_height);
1042 1043 1044 1045
/*
 * This function unpacks all of the DCT coefficient data from the
 * bitstream.
 */
1046
static int unpack_dct_coeffs(Vp3DecodeContext *s, GetBitContext *gb)
1047 1048 1049 1050 1051 1052 1053
{
    int i;
    int dc_y_table;
    int dc_c_table;
    int ac_y_table;
    int ac_c_table;
    int residual_eob_run = 0;
1054 1055
    VLC *y_tables[64];
    VLC *c_tables[64];
1056

1057
    /* fetch the DC table indexes */
1058 1059 1060 1061
    dc_y_table = get_bits(gb, 4);
    dc_c_table = get_bits(gb, 4);

    /* unpack the Y plane DC coefficients */
1062
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_y_table], 0,
1063
        1, residual_eob_run);
1064

1065 1066 1067
    /* reverse prediction of the Y-plane DC coefficients */
    reverse_dc_prediction(s, 0, s->fragment_width, s->fragment_height);

1068 1069
    /* unpack the C plane DC coefficients */
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_c_table], 0,
1070
        0, residual_eob_run);
1071

1072 1073 1074 1075 1076 1077 1078 1079 1080
    /* reverse prediction of the C-plane DC coefficients */
    if (!(s->avctx->flags & CODEC_FLAG_GRAY))
    {
        reverse_dc_prediction(s, s->fragment_start[1],
            s->fragment_width / 2, s->fragment_height / 2);
        reverse_dc_prediction(s, s->fragment_start[2],
            s->fragment_width / 2, s->fragment_height / 2);
    }

1081
    /* fetch the AC table indexes */
1082 1083 1084
    ac_y_table = get_bits(gb, 4);
    ac_c_table = get_bits(gb, 4);

1085
    /* build tables of AC VLC tables */
1086
    for (i = 1; i <= 5; i++) {
1087 1088
        y_tables[i] = &s->ac_vlc_1[ac_y_table];
        c_tables[i] = &s->ac_vlc_1[ac_c_table];
1089 1090
    }
    for (i = 6; i <= 14; i++) {
1091 1092
        y_tables[i] = &s->ac_vlc_2[ac_y_table];
        c_tables[i] = &s->ac_vlc_2[ac_c_table];
1093 1094
    }
    for (i = 15; i <= 27; i++) {
1095 1096
        y_tables[i] = &s->ac_vlc_3[ac_y_table];
        c_tables[i] = &s->ac_vlc_3[ac_c_table];
1097 1098
    }
    for (i = 28; i <= 63; i++) {
1099 1100 1101 1102 1103 1104 1105 1106 1107
        y_tables[i] = &s->ac_vlc_4[ac_y_table];
        c_tables[i] = &s->ac_vlc_4[ac_c_table];
    }

    /* decode all AC coefficents */
    for (i = 1; i <= 63; i++) {
        if (s->fragment_list_y_head != -1)
            residual_eob_run = unpack_vlcs(s, gb, y_tables[i], i,
                1, residual_eob_run);
1108

1109 1110 1111
        if (s->fragment_list_c_head != -1)
            residual_eob_run = unpack_vlcs(s, gb, c_tables[i], i,
                0, residual_eob_run);
1112
    }
1113 1114

    return 0;
1115 1116 1117 1118
}

/*
 * This function reverses the DC prediction for each coded fragment in
1119
 * the frame. Much of this function is adapted directly from the original
1120 1121 1122 1123
 * VP3 source code.
 */
#define COMPATIBLE_FRAME(x) \
  (compatible_frame[s->all_fragments[x].coding_method] == current_frame_type)
1124
#define DC_COEFF(u) (s->coeffs[u].index ? 0 : s->coeffs[u].coeff) //FIXME do somethin to simplify this
1125 1126 1127 1128

static void reverse_dc_prediction(Vp3DecodeContext *s,
                                  int first_fragment,
                                  int fragment_width,
1129
                                  int fragment_height)
1130 1131 1132 1133 1134 1135 1136 1137 1138 1139
{

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

    int x, y;
    int i = first_fragment;

1140
    int predicted_dc;
1141 1142 1143 1144

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

1145
    /* indexes for the left, up-left, up, and up-right fragments */
1146 1147
    int l, ul, u, ur;

1148
    /*
1149 1150 1151 1152 1153 1154
     * The 6 fields mean:
     *   0: up-left multiplier
     *   1: up multiplier
     *   2: up-right multiplier
     *   3: left multiplier
     */
1155
    static const int predictor_transform[16][4] = {
M
Michael Niedermayer 已提交
1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171
        {  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
1172 1173 1174 1175 1176
    };

    /* 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
1177
     * from other INTRA blocks. There are 2 golden frame coding types;
1178 1179
     * blocks encoding in these modes can only predict from other blocks
     * that were encoded with these 1 of these 2 modes. */
1180
    static const unsigned char compatible_frame[9] = {
1181 1182 1183 1184 1185 1186 1187
        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 */
1188 1189
        1,    /* MODE_INTER_FOUR_MV */
        3     /* MODE_COPY */
1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209
    };
    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) {

1210
                current_frame_type =
1211 1212
                    compatible_frame[s->all_fragments[i].coding_method];

M
Michael Niedermayer 已提交
1213 1214 1215
                transform= 0;
                if(x){
                    l= i-1;
1216
                    vl = DC_COEFF(l);
1217
                    if(COMPATIBLE_FRAME(l))
M
Michael Niedermayer 已提交
1218
                        transform |= PL;
M
Michael Niedermayer 已提交
1219 1220 1221
                }
                if(y){
                    u= i-fragment_width;
1222
                    vu = DC_COEFF(u);
1223
                    if(COMPATIBLE_FRAME(u))
M
Michael Niedermayer 已提交
1224
                        transform |= PU;
M
Michael Niedermayer 已提交
1225 1226 1227
                    if(x){
                        ul= i-fragment_width-1;
                        vul = DC_COEFF(ul);
1228
                        if(COMPATIBLE_FRAME(ul))
M
Michael Niedermayer 已提交
1229
                            transform |= PUL;
M
Michael Niedermayer 已提交
1230 1231 1232 1233
                    }
                    if(x + 1 < fragment_width){
                        ur= i-fragment_width+1;
                        vur = DC_COEFF(ur);
1234
                        if(COMPATIBLE_FRAME(ur))
M
Michael Niedermayer 已提交
1235
                            transform |= PUR;
M
Michael Niedermayer 已提交
1236
                    }
1237 1238 1239 1240 1241 1242
                }

                if (transform == 0) {

                    /* if there were no fragments to predict from, use last
                     * DC saved */
1243
                    predicted_dc = last_dc[current_frame_type];
1244 1245 1246 1247 1248 1249 1250 1251 1252
                } 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 已提交
1253
                    predicted_dc /= 128;
1254 1255 1256

                    /* check for outranging on the [ul u l] and
                     * [ul u ur l] predictors */
1257
                    if ((transform == 15) || (transform == 13)) {
D
Diego Biurrun 已提交
1258
                        if (FFABS(predicted_dc - vu) > 128)
1259
                            predicted_dc = vu;
D
Diego Biurrun 已提交
1260
                        else if (FFABS(predicted_dc - vl) > 128)
1261
                            predicted_dc = vl;
D
Diego Biurrun 已提交
1262
                        else if (FFABS(predicted_dc - vul) > 128)
1263 1264 1265 1266
                            predicted_dc = vul;
                    }
                }

1267 1268 1269 1270 1271 1272 1273 1274
                /* 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;
1275
                /* save the DC */
1276
                last_dc[current_frame_type] = DC_COEFF(i);
1277 1278
                if(DC_COEFF(i) && !(s->coeff_counts[i]&127)){
                    s->coeff_counts[i]= 129;
1279 1280 1281 1282
//                    s->all_fragments[i].next_coeff= s->next_coeff;
                    s->coeffs[i].next= s->next_coeff;
                    (s->next_coeff++)->next=NULL;
                }
1283 1284 1285 1286 1287
            }
        }
    }
}

1288
static void apply_loop_filter(Vp3DecodeContext *s, int plane, int ystart, int yend)
1289 1290 1291 1292
{
    int x, y;
    int *bounding_values= s->bounding_values_array+127;

D
David Conrad 已提交
1293 1294 1295 1296 1297 1298
    int width           = s->fragment_width  >> !!plane;
    int height          = s->fragment_height >> !!plane;
    int fragment        = s->fragment_start        [plane] + ystart * width;
    int stride          = s->current_frame.linesize[plane];
    uint8_t *plane_data = s->current_frame.data    [plane];
    if (!s->flipped_image) stride = -stride;
D
David Conrad 已提交
1299
    plane_data += s->data_offset[plane] + 8*ystart*stride;
D
David Conrad 已提交
1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312

    for (y = ystart; y < yend; y++) {

        for (x = 0; x < width; x++) {
            /* This code basically just deblocks on the edges of coded blocks.
             * However, it has to be much more complicated because of the
             * braindamaged deblock ordering used in VP3/Theora. Order matters
             * because some pixels get filtered twice. */
            if( s->all_fragments[fragment].coding_method != MODE_COPY )
            {
                /* do not perform left edge filter for left columns frags */
                if (x > 0) {
                    s->dsp.vp3_h_loop_filter(
D
David Conrad 已提交
1313
                        plane_data + 8*x,
D
David Conrad 已提交
1314 1315
                        stride, bounding_values);
                }
1316

D
David Conrad 已提交
1317 1318 1319
                /* do not perform top edge filter for top row fragments */
                if (y > 0) {
                    s->dsp.vp3_v_loop_filter(
D
David Conrad 已提交
1320
                        plane_data + 8*x,
D
David Conrad 已提交
1321 1322
                        stride, bounding_values);
                }
1323

D
David Conrad 已提交
1324 1325 1326 1327 1328 1329
                /* 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 + 1].coding_method == MODE_COPY)) {
                    s->dsp.vp3_h_loop_filter(
D
David Conrad 已提交
1330
                        plane_data + 8*x + 8,
D
David Conrad 已提交
1331
                        stride, bounding_values);
1332 1333
                }

D
David Conrad 已提交
1334 1335 1336 1337 1338 1339
                /* 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 + width].coding_method == MODE_COPY)) {
                    s->dsp.vp3_v_loop_filter(
D
David Conrad 已提交
1340
                        plane_data + 8*x + 8*stride,
D
David Conrad 已提交
1341 1342
                        stride, bounding_values);
                }
1343
            }
D
David Conrad 已提交
1344 1345

            fragment++;
1346
        }
D
David Conrad 已提交
1347
        plane_data += 8*stride;
D
David Conrad 已提交
1348
    }
1349 1350
}

1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381
/**
 * called when all pixels up to row y are complete
 */
static void vp3_draw_horiz_band(Vp3DecodeContext *s, int y)
{
    int h, cy;
    int offset[4];

    if(s->avctx->draw_horiz_band==NULL)
        return;

    h= y - s->last_slice_end;
    y -= h;

    if (!s->flipped_image) {
        if (y == 0)
            h -= s->height - s->avctx->height;  // account for non-mod16
        y = s->height - y - h;
    }

    cy = y >> 1;
    offset[0] = s->current_frame.linesize[0]*y;
    offset[1] = s->current_frame.linesize[1]*cy;
    offset[2] = s->current_frame.linesize[2]*cy;
    offset[3] = 0;

    emms_c();
    s->avctx->draw_horiz_band(s->avctx, &s->current_frame, offset, y, 3, h);
    s->last_slice_end= y + h;
}

1382 1383 1384 1385 1386 1387
/*
 * 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 已提交
1388
    int x;
1389
    int16_t *dequantizer;
1390
    LOCAL_ALIGNED_16(DCTELEM, block, [64]);
1391 1392 1393 1394 1395 1396 1397 1398 1399
    int motion_x = 0xdeadbeef, motion_y = 0xdeadbeef;
    int motion_halfpel_index;
    uint8_t *motion_source;
    int plane;

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

    for (plane = 0; plane < 3; plane++) {
D
David Conrad 已提交
1400 1401 1402
        uint8_t *output_plane = s->current_frame.data    [plane] + s->data_offset[plane];
        uint8_t *  last_plane = s->   last_frame.data    [plane] + s->data_offset[plane];
        uint8_t *golden_plane = s-> golden_frame.data    [plane] + s->data_offset[plane];
M
Michael Niedermayer 已提交
1403 1404 1405 1406 1407
        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);
1408
        int i = s->fragment_start[plane] + (y>>3)*(s->fragment_width>>!!plane);
M
Michael Niedermayer 已提交
1409 1410

        if (!s->flipped_image) stride = -stride;
1411 1412
        if (CONFIG_GRAY && plane && (s->avctx->flags & CODEC_FLAG_GRAY))
            continue;
1413

1414

D
Diego Biurrun 已提交
1415
        if(FFABS(stride) > 2048)
1416 1417 1418 1419 1420 1421 1422
            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++) {
D
David Conrad 已提交
1423
                int first_pixel = y*stride + x;
1424 1425 1426 1427 1428 1429 1430

                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 */
1431
                if (s->all_fragments[i].coding_method != MODE_COPY) {
1432 1433 1434 1435

                    if ((s->all_fragments[i].coding_method == MODE_USING_GOLDEN) ||
                        (s->all_fragments[i].coding_method == MODE_GOLDEN_MV))
                        motion_source= golden_plane;
1436
                    else
1437 1438
                        motion_source= last_plane;

D
David Conrad 已提交
1439
                    motion_source += first_pixel;
1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473
                    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;
                        }
                    }
1474

1475 1476 1477 1478

                    /* first, take care of copying a block from either the
                     * previous or the golden frame */
                    if (s->all_fragments[i].coding_method != MODE_INTRA) {
1479 1480 1481
                        /* 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
1482 1483 1484
                           put_no_rnd_pixels_tab is better optimzed */
                        if(motion_halfpel_index != 3){
                            s->dsp.put_no_rnd_pixels_tab[1][motion_halfpel_index](
D
David Conrad 已提交
1485
                                output_plane + first_pixel,
1486 1487 1488 1489
                                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](
D
David Conrad 已提交
1490
                                output_plane + first_pixel,
1491 1492
                                motion_source - d,
                                motion_source + stride + 1 + d,
1493 1494
                                stride, 8);
                        }
1495
                        dequantizer = s->qmat[s->all_fragments[i].qpi][1][plane];
1496
                    }else{
1497
                        dequantizer = s->qmat[s->all_fragments[i].qpi][0][plane];
1498 1499 1500 1501 1502
                    }

                    /* dequantize the DCT coefficients */
                    if(s->avctx->idct_algo==FF_IDCT_VP3){
                        Coeff *coeff= s->coeffs + i;
L
Loren Merritt 已提交
1503
                        s->dsp.clear_block(block);
1504 1505 1506 1507 1508 1509
                        while(coeff->next){
                            block[coeff->index]= coeff->coeff * dequantizer[coeff->index];
                            coeff= coeff->next;
                        }
                    }else{
                        Coeff *coeff= s->coeffs + i;
L
Loren Merritt 已提交
1510
                        s->dsp.clear_block(block);
1511 1512 1513 1514 1515 1516 1517
                        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 */
1518

1519 1520 1521 1522
                    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(
D
David Conrad 已提交
1523
                            output_plane + first_pixel,
1524 1525 1526 1527
                            stride,
                            block);
                    } else {
                        s->dsp.idct_add(
D
David Conrad 已提交
1528
                            output_plane + first_pixel,
1529 1530 1531 1532 1533 1534 1535
                            stride,
                            block);
                    }
                } else {

                    /* copy directly from the previous frame */
                    s->dsp.put_pixels_tab[1][0](
D
David Conrad 已提交
1536 1537
                        output_plane + first_pixel,
                        last_plane + first_pixel,
1538 1539 1540 1541
                        stride, 8);

                }
            }
1542 1543 1544 1545
            // Filter the previous block row. We can't filter the current row yet
            // since it needs pixels from the next row
            if (y > 0)
                apply_loop_filter(s, plane, (y>>3)-1, (y>>3));
1546 1547 1548 1549 1550 1551
        }
    }

     /* this looks like a good place for slice dispatch... */
     /* algorithm:
      *   if (slice == s->macroblock_height - 1)
1552 1553 1554
      *     dispatch (both last slice & 2nd-to-last slice);
      *   else if (slice > 0)
      *     dispatch (slice - 1);
1555 1556
      */

1557 1558 1559
    // now that we've filtered the last rows, they're safe to display
    if (slice)
        vp3_draw_horiz_band(s, 16*slice);
1560 1561
}

1562 1563 1564
/*
 * This is the ffmpeg/libavcodec API init function.
 */
1565
static av_cold int vp3_decode_init(AVCodecContext *avctx)
1566 1567
{
    Vp3DecodeContext *s = avctx->priv_data;
1568
    int i, inter, plane;
1569 1570 1571 1572
    int c_width;
    int c_height;
    int y_superblock_count;
    int c_superblock_count;
1573

A
Alex Beregszaszi 已提交
1574
    if (avctx->codec_tag == MKTAG('V','P','3','0'))
1575
        s->version = 0;
A
Alex Beregszaszi 已提交
1576
    else
1577
        s->version = 1;
A
Alex Beregszaszi 已提交
1578

1579
    s->avctx = avctx;
1580 1581
    s->width = FFALIGN(avctx->width, 16);
    s->height = FFALIGN(avctx->height, 16);
1582
    avctx->pix_fmt = PIX_FMT_YUV420P;
1583
    avctx->chroma_sample_location = AVCHROMA_LOC_CENTER;
1584 1585
    if(avctx->idct_algo==FF_IDCT_AUTO)
        avctx->idct_algo=FF_IDCT_VP3;
1586
    dsputil_init(&s->dsp, avctx);
1587

M
Michael Niedermayer 已提交
1588
    ff_init_scantable(s->dsp.idct_permutation, &s->scantable, ff_zigzag_direct);
1589 1590 1591

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

1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608
    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;
1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619
    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 已提交
1620 1621
    s->fragment_start[1] = s->fragment_width * s->fragment_height;
    s->fragment_start[2] = s->fragment_width * s->fragment_height * 5 / 4;
1622 1623

    s->all_fragments = av_malloc(s->fragment_count * sizeof(Vp3Fragment));
1624
    s->coeff_counts = av_malloc(s->fragment_count * sizeof(*s->coeff_counts));
1625
    s->coeffs = av_malloc(s->fragment_count * sizeof(Coeff) * 65);
1626
    s->coded_fragment_list = av_malloc(s->fragment_count * sizeof(int));
1627
    s->fast_fragment_list = av_malloc(s->fragment_count * sizeof(int));
1628
    if (!s->superblock_coding || !s->all_fragments || !s->coeff_counts ||
1629
        !s->coeffs || !s->coded_fragment_list || !s->fast_fragment_list) {
1630 1631 1632
        vp3_decode_end(avctx);
        return -1;
    }
1633

1634 1635
    if (!s->theora_tables)
    {
M
cleanup  
Michael Niedermayer 已提交
1636
        for (i = 0; i < 64; i++) {
1637 1638
            s->coded_dc_scale_factor[i] = vp31_dc_scale_factor[i];
            s->coded_ac_scale_factor[i] = vp31_ac_scale_factor[i];
1639 1640 1641
            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];
1642
            s->filter_limit_values[i] = vp31_filter_limit_values[i];
M
cleanup  
Michael Niedermayer 已提交
1643
        }
1644

1645 1646 1647 1648 1649 1650 1651 1652 1653
        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;
            }
        }

1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685
        /* 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 */
1686
            if (init_vlc(&s->dc_vlc[i], 5, 32,
1687
                &s->huffman_table[i][0][1], 4, 2,
1688 1689
                &s->huffman_table[i][0][0], 4, 2, 0) < 0)
                goto vlc_fail;
1690 1691

            /* group 1 AC histograms */
1692
            if (init_vlc(&s->ac_vlc_1[i], 5, 32,
1693
                &s->huffman_table[i+16][0][1], 4, 2,
1694 1695
                &s->huffman_table[i+16][0][0], 4, 2, 0) < 0)
                goto vlc_fail;
1696 1697

            /* group 2 AC histograms */
1698
            if (init_vlc(&s->ac_vlc_2[i], 5, 32,
1699
                &s->huffman_table[i+16*2][0][1], 4, 2,
1700 1701
                &s->huffman_table[i+16*2][0][0], 4, 2, 0) < 0)
                goto vlc_fail;
1702 1703

            /* group 3 AC histograms */
1704
            if (init_vlc(&s->ac_vlc_3[i], 5, 32,
1705
                &s->huffman_table[i+16*3][0][1], 4, 2,
1706 1707
                &s->huffman_table[i+16*3][0][0], 4, 2, 0) < 0)
                goto vlc_fail;
1708 1709

            /* group 4 AC histograms */
1710
            if (init_vlc(&s->ac_vlc_4[i], 5, 32,
1711
                &s->huffman_table[i+16*4][0][1], 4, 2,
1712 1713
                &s->huffman_table[i+16*4][0][0], 4, 2, 0) < 0)
                goto vlc_fail;
1714
        }
1715 1716
    }

1717 1718 1719 1720
    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);

1721
    init_vlc(&s->fragment_run_length_vlc, 5, 30,
1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732
        &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);

1733 1734
    /* work out the block mapping tables */
    s->superblock_fragments = av_malloc(s->superblock_count * 16 * sizeof(int));
1735
    s->macroblock_coding = av_malloc(s->macroblock_count + 1);
1736
    if (!s->superblock_fragments || !s->macroblock_coding) {
1737 1738 1739
        vp3_decode_end(avctx);
        return -1;
    }
1740 1741
    init_block_mapping(s);

1742 1743 1744 1745
    for (i = 0; i < 3; i++) {
        s->current_frame.data[i] = NULL;
        s->last_frame.data[i] = NULL;
        s->golden_frame.data[i] = NULL;
1746 1747
    }

1748
    return 0;
1749 1750 1751 1752

vlc_fail:
    av_log(avctx, AV_LOG_FATAL, "Invalid huffman table\n");
    return -1;
1753 1754 1755 1756 1757
}

/*
 * This is the ffmpeg/libavcodec API frame decode function.
 */
1758
static int vp3_decode_frame(AVCodecContext *avctx,
1759
                            void *data, int *data_size,
1760
                            AVPacket *avpkt)
1761
{
1762 1763
    const uint8_t *buf = avpkt->data;
    int buf_size = avpkt->size;
1764 1765 1766
    Vp3DecodeContext *s = avctx->priv_data;
    GetBitContext gb;
    static int counter = 0;
1767
    int i;
1768 1769

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

1771 1772
    if (s->theora && get_bits1(&gb))
    {
1773 1774
        av_log(avctx, AV_LOG_ERROR, "Header packet passed to frame decoder, skipping\n");
        return -1;
1775
    }
A
Alex Beregszaszi 已提交
1776 1777 1778

    s->keyframe = !get_bits1(&gb);
    if (!s->theora)
1779
        skip_bits(&gb, 1);
1780 1781
    for (i = 0; i < 3; i++)
        s->last_qps[i] = s->qps[i];
1782

1783
    s->nqps=0;
1784
    do{
1785 1786 1787 1788
        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;
1789

1790
    if (s->avctx->debug & FF_DEBUG_PICT_INFO)
1791
        av_log(s->avctx, AV_LOG_INFO, " VP3 %sframe #%d: Q index = %d\n",
1792
            s->keyframe?"key":"", counter, s->qps[0]);
1793 1794
    counter++;

1795
    if (s->qps[0] != s->last_qps[0])
1796
        init_loop_filter(s);
1797 1798 1799 1800 1801 1802

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

1804 1805 1806
    if (avctx->skip_frame >= AVDISCARD_NONKEY && !s->keyframe)
        return buf_size;

1807
    if (s->keyframe) {
1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824
        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 已提交
1825

1826 1827 1828
        if (s->last_frame.data[0] == s->golden_frame.data[0]) {
            if (s->golden_frame.data[0])
                avctx->release_buffer(avctx, &s->golden_frame);
1829
            s->last_frame= s->golden_frame; /* ensure that we catch any access to this released frame */
1830 1831 1832 1833 1834 1835
        } 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);
        }
1836

1837
        s->golden_frame.reference = 3;
1838
        if(avctx->get_buffer(avctx, &s->golden_frame) < 0) {
1839
            av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
1840 1841 1842 1843
            return -1;
        }

        /* golden frame is also the current frame */
M
Michael Niedermayer 已提交
1844
        s->current_frame= s->golden_frame;
1845 1846
    } else {
        /* allocate a new current frame */
1847
        s->current_frame.reference = 3;
D
David Conrad 已提交
1848
        if (!s->golden_frame.data[0]) {
1849 1850 1851
            av_log(s->avctx, AV_LOG_ERROR, "vp3: first frame not a keyframe\n");
            return -1;
        }
1852
        if(avctx->get_buffer(avctx, &s->current_frame) < 0) {
1853
            av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
1854 1855 1856 1857
            return -1;
        }
    }

M
Michael Niedermayer 已提交
1858 1859 1860
    s->current_frame.qscale_table= s->qscale_table; //FIXME allocate individual tables per AVFrame
    s->current_frame.qstride= 0;

1861 1862
    init_frame(s, &gb);

M
Michael Niedermayer 已提交
1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874
    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;
    }
1875 1876 1877 1878
    if (unpack_block_qpis(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_block_qpis\n");
        return -1;
    }
M
Michael Niedermayer 已提交
1879 1880
    if (unpack_dct_coeffs(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_dct_coeffs\n");
1881 1882
        return -1;
    }
D
David Conrad 已提交
1883 1884 1885 1886 1887 1888 1889

    for (i = 0; i < 3; i++) {
        if (s->flipped_image)
            s->data_offset[i] = 0;
        else
            s->data_offset[i] = ((s->height>>!!i)-1) * s->current_frame.linesize[i];
    }
1890

1891
    s->last_slice_end = 0;
1892 1893
    for (i = 0; i < s->macroblock_height; i++)
        render_slice(s, i);
1894

1895 1896 1897 1898 1899
    // filter the last row
    for (i = 0; i < 3; i++) {
        int row = (s->height >> (3+!!i)) - 1;
        apply_loop_filter(s, i, row, row+1);
    }
1900
    vp3_draw_horiz_band(s, s->height);
1901

1902 1903 1904
    *data_size=sizeof(AVFrame);
    *(AVFrame*)data= s->current_frame;

1905 1906 1907 1908 1909
    /* 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);
1910

1911
    /* shuffle frames (last = current) */
M
Michael Niedermayer 已提交
1912
    s->last_frame= s->current_frame;
1913
    s->current_frame.data[0]= NULL; /* ensure that we catch any access to this released frame */
1914 1915 1916 1917 1918 1919 1920

    return buf_size;
}

/*
 * This is the ffmpeg/libavcodec API module cleanup function.
 */
1921
static av_cold int vp3_decode_end(AVCodecContext *avctx)
1922 1923
{
    Vp3DecodeContext *s = avctx->priv_data;
1924
    int i;
1925

1926
    av_free(s->superblock_coding);
1927
    av_free(s->all_fragments);
1928
    av_free(s->coeff_counts);
1929
    av_free(s->coeffs);
1930
    av_free(s->coded_fragment_list);
1931
    av_free(s->fast_fragment_list);
1932
    av_free(s->superblock_fragments);
1933
    av_free(s->macroblock_coding);
1934

1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947
    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);

1948
    /* release all frames */
1949
    if (s->golden_frame.data[0] && s->golden_frame.data[0] != s->last_frame.data[0])
1950 1951 1952 1953 1954
        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 */
1955 1956 1957 1958

    return 0;
}

1959 1960 1961 1962
static int read_huffman_tree(AVCodecContext *avctx, GetBitContext *gb)
{
    Vp3DecodeContext *s = avctx->priv_data;

1963
    if (get_bits1(gb)) {
1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981
        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;
1982 1983
        if (read_huffman_tree(avctx, gb))
            return -1;
1984
        s->hbits |= 1;
1985 1986
        if (read_huffman_tree(avctx, gb))
            return -1;
1987 1988 1989 1990 1991 1992
        s->hbits >>= 1;
        s->huff_code_size--;
    }
    return 0;
}

1993
#if CONFIG_THEORA_DECODER
1994
static int theora_decode_header(AVCodecContext *avctx, GetBitContext *gb)
1995 1996
{
    Vp3DecodeContext *s = avctx->priv_data;
1997
    int visible_width, visible_height, colorspace;
1998

1999
    s->theora = get_bits_long(gb, 24);
2000
    av_log(avctx, AV_LOG_DEBUG, "Theora bitstream version %X\n", s->theora);
2001

M
Matthieu Castet 已提交
2002
    /* 3.2.0 aka alpha3 has the same frame orientation as original vp3 */
2003
    /* but previous versions have the image flipped relative to vp3 */
M
Matthieu Castet 已提交
2004
    if (s->theora < 0x030200)
2005
    {
2006
        s->flipped_image = 1;
2007 2008
        av_log(avctx, AV_LOG_DEBUG, "Old (<alpha3) Theora bitstream, flipped image\n");
    }
2009

2010 2011
    visible_width  = s->width  = get_bits(gb, 16) << 4;
    visible_height = s->height = get_bits(gb, 16) << 4;
2012

2013
    if(avcodec_check_dimensions(avctx, s->width, s->height)){
2014
        av_log(avctx, AV_LOG_ERROR, "Invalid dimensions (%dx%d)\n", s->width, s->height);
2015 2016 2017
        s->width= s->height= 0;
        return -1;
    }
2018

2019
    if (s->theora >= 0x030200) {
D
David Conrad 已提交
2020 2021
        visible_width  = get_bits_long(gb, 24);
        visible_height = get_bits_long(gb, 24);
2022

2023 2024 2025
        skip_bits(gb, 8); /* offset x */
        skip_bits(gb, 8); /* offset y */
    }
2026

2027 2028 2029 2030
    skip_bits(gb, 32); /* fps numerator */
    skip_bits(gb, 32); /* fps denumerator */
    skip_bits(gb, 24); /* aspect numerator */
    skip_bits(gb, 24); /* aspect denumerator */
2031

M
Matthieu Castet 已提交
2032
    if (s->theora < 0x030200)
2033
        skip_bits(gb, 5); /* keyframe frequency force */
2034
    colorspace = get_bits(gb, 8);
2035
    skip_bits(gb, 24); /* bitrate */
2036

2037
    skip_bits(gb, 6); /* quality hint */
2038

M
Matthieu Castet 已提交
2039
    if (s->theora >= 0x030200)
2040
    {
2041
        skip_bits(gb, 5); /* keyframe frequency force */
2042 2043
        skip_bits(gb, 2); /* pixel format: 420,res,422,444 */
        skip_bits(gb, 3); /* reserved */
2044
    }
2045

2046
//    align_get_bits(gb);
2047

2048 2049 2050 2051 2052
    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);
2053

2054 2055 2056 2057 2058 2059 2060 2061 2062 2063
    if (colorspace == 1) {
        avctx->color_primaries = AVCOL_PRI_BT470M;
    } else if (colorspace == 2) {
        avctx->color_primaries = AVCOL_PRI_BT470BG;
    }
    if (colorspace == 1 || colorspace == 2) {
        avctx->colorspace = AVCOL_SPC_BT470BG;
        avctx->color_trc  = AVCOL_TRC_BT709;
    }

2064 2065 2066
    return 0;
}

2067
static int theora_decode_tables(AVCodecContext *avctx, GetBitContext *gb)
2068 2069
{
    Vp3DecodeContext *s = avctx->priv_data;
2070
    int i, n, matrices, inter, plane;
M
Matthieu Castet 已提交
2071 2072

    if (s->theora >= 0x030200) {
2073
        n = get_bits(gb, 3);
2074
        /* loop filter limit values table */
2075
        for (i = 0; i < 64; i++) {
2076
            s->filter_limit_values[i] = get_bits(gb, n);
2077 2078 2079 2080 2081
            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 已提交
2082
    }
2083

M
Matthieu Castet 已提交
2084
    if (s->theora >= 0x030200)
2085
        n = get_bits(gb, 4) + 1;
M
Matthieu Castet 已提交
2086 2087
    else
        n = 16;
2088 2089
    /* quality threshold table */
    for (i = 0; i < 64; i++)
2090
        s->coded_ac_scale_factor[i] = get_bits(gb, n);
2091

M
Matthieu Castet 已提交
2092
    if (s->theora >= 0x030200)
2093
        n = get_bits(gb, 4) + 1;
M
Matthieu Castet 已提交
2094 2095
    else
        n = 16;
2096 2097
    /* dc scale factor table */
    for (i = 0; i < 64; i++)
2098
        s->coded_dc_scale_factor[i] = get_bits(gb, n);
2099

M
Matthieu Castet 已提交
2100
    if (s->theora >= 0x030200)
2101
        matrices = get_bits(gb, 9) + 1;
M
Matthieu Castet 已提交
2102
    else
2103
        matrices = 3;
2104

2105 2106 2107 2108
    if(matrices > 384){
        av_log(avctx, AV_LOG_ERROR, "invalid number of base matrixes\n");
        return -1;
    }
A
Alex Beregszaszi 已提交
2109

2110
    for(n=0; n<matrices; n++){
2111
        for (i = 0; i < 64; i++)
2112 2113
            s->base_matrix[n][i]= get_bits(gb, 8);
    }
2114

2115 2116 2117 2118
    for (inter = 0; inter <= 1; inter++) {
        for (plane = 0; plane <= 2; plane++) {
            int newqr= 1;
            if (inter || plane > 0)
2119
                newqr = get_bits1(gb);
2120
            if (!newqr) {
2121
                int qtj, plj;
2122
                if(inter && get_bits1(gb)){
2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133
                    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;
2134
                int qi = 0;
2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147

                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;
2148
                }
2149

2150
                if (qi > 63) {
2151
                    av_log(avctx, AV_LOG_ERROR, "invalid qi %d > 63\n", qi);
2152 2153
                    return -1;
                }
2154
                s->qr_count[inter][plane]= qri;
2155 2156 2157 2158
            }
        }
    }

2159
    /* Huffman tables */
2160 2161 2162
    for (s->hti = 0; s->hti < 80; s->hti++) {
        s->entries = 0;
        s->huff_code_size = 1;
2163
        if (!get_bits1(gb)) {
2164
            s->hbits = 0;
2165 2166
            if(read_huffman_tree(avctx, gb))
                return -1;
2167
            s->hbits = 1;
2168 2169
            if(read_huffman_tree(avctx, gb))
                return -1;
2170 2171
        }
    }
2172

2173
    s->theora_tables = 1;
2174

2175 2176 2177
    return 0;
}

2178
static av_cold int theora_decode_init(AVCodecContext *avctx)
2179 2180 2181 2182
{
    Vp3DecodeContext *s = avctx->priv_data;
    GetBitContext gb;
    int ptype;
2183 2184 2185
    uint8_t *header_start[3];
    int header_len[3];
    int i;
2186

2187 2188 2189
    s->theora = 1;

    if (!avctx->extradata_size)
2190 2191
    {
        av_log(avctx, AV_LOG_ERROR, "Missing extradata!\n");
2192
        return -1;
2193
    }
2194

2195 2196 2197 2198 2199
    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;
    }
2200

2201
  for(i=0;i<3;i++) {
G
Google Chrome 已提交
2202
    init_get_bits(&gb, header_start[i], header_len[i] * 8);
2203 2204

    ptype = get_bits(&gb, 8);
2205

2206 2207 2208
     if (!(ptype & 0x80))
     {
        av_log(avctx, AV_LOG_ERROR, "Invalid extradata!\n");
2209
//        return -1;
2210
     }
2211

2212
    // FIXME: Check for this as well.
2213
    skip_bits_long(&gb, 6*8); /* "theora" */
2214

2215 2216 2217
    switch(ptype)
    {
        case 0x80:
2218
            theora_decode_header(avctx, &gb);
2219 2220
                break;
        case 0x81:
2221
// FIXME: is this needed? it breaks sometimes
2222 2223 2224
//            theora_decode_comments(avctx, gb);
            break;
        case 0x82:
2225 2226
            if (theora_decode_tables(avctx, &gb))
                return -1;
2227 2228 2229 2230
            break;
        default:
            av_log(avctx, AV_LOG_ERROR, "Unknown Theora config packet: %d\n", ptype&~0x80);
            break;
2231
    }
2232 2233
    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);
2234 2235
    if (s->theora < 0x030200)
        break;
2236
  }
2237

2238
    return vp3_decode_init(avctx);
2239 2240
}

2241 2242
AVCodec theora_decoder = {
    "theora",
2243
    CODEC_TYPE_VIDEO,
2244
    CODEC_ID_THEORA,
2245
    sizeof(Vp3DecodeContext),
2246
    theora_decode_init,
2247 2248 2249
    NULL,
    vp3_decode_end,
    vp3_decode_frame,
2250
    CODEC_CAP_DR1 | CODEC_CAP_DRAW_HORIZ_BAND,
2251
    NULL,
2252
    .long_name = NULL_IF_CONFIG_SMALL("Theora"),
2253
};
2254
#endif
2255

2256 2257
AVCodec vp3_decoder = {
    "vp3",
2258
    CODEC_TYPE_VIDEO,
2259
    CODEC_ID_VP3,
2260
    sizeof(Vp3DecodeContext),
2261
    vp3_decode_init,
2262 2263 2264
    NULL,
    vp3_decode_end,
    vp3_decode_frame,
2265
    CODEC_CAP_DR1 | CODEC_CAP_DRAW_HORIZ_BAND,
2266
    NULL,
2267
    .long_name = NULL_IF_CONFIG_SMALL("On2 VP3"),
2268
};