vp3.c 77.0 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
//FIXME split things out into their own arrays
48
typedef struct Vp3Fragment {
49
    int16_t dc;
50 51 52
    uint8_t coding_method;
    int8_t motion_x;
    int8_t motion_y;
53
    uint8_t qpi;
54 55 56 57 58 59
} Vp3Fragment;

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

60 61 62 63 64
// 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

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

    /* scheme 2 */
88
    {    MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
89
         MODE_INTER_NO_MV,      MODE_INTER_PLUS_MV,
90
         MODE_INTRA,            MODE_USING_GOLDEN,
91 92 93
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

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

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

    /* scheme 5: No motion vector dominates */
106
    {    MODE_INTER_NO_MV,      MODE_INTER_LAST_MV,
107
         MODE_INTER_PRIOR_LAST, MODE_INTER_PLUS_MV,
108
         MODE_INTRA,            MODE_USING_GOLDEN,
109 110 111
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 6 */
112
    {    MODE_INTER_NO_MV,      MODE_USING_GOLDEN,
113
         MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
114
         MODE_INTER_PLUS_MV,    MODE_INTRA,
115 116 117 118
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

};

119 120 121 122 123 124 125
static const uint8_t hilbert_offset[16][2] = {
    {0,0}, {1,0}, {1,1}, {0,1},
    {0,2}, {0,3}, {1,3}, {1,2},
    {2,2}, {2,3}, {3,3}, {3,2},
    {3,1}, {2,1}, {2,0}, {3,0}
};

126 127 128 129
#define MIN_DEQUANT_VAL 2

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

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

    int superblock_count;
146 147
    int y_superblock_width;
    int y_superblock_height;
148
    int y_superblock_count;
149 150
    int c_superblock_width;
    int c_superblock_height;
151
    int c_superblock_count;
152 153 154 155 156 157 158 159 160 161 162 163 164
    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;
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 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206
    /**
     * This is a list of all tokens in bitstream order. Reordering takes place
     * by pulling from each level during IDCT. As a consequence, IDCT must be
     * in Hilbert order, making the minimum slice height 64 for 4:2:0 and 32
     * otherwise. The 32 different tokens with up to 12 bits of extradata are
     * collapsed into 3 types, packed as follows:
     *   (from the low to high bits)
     *
     * 2 bits: type (0,1,2)
     *   0: EOB run, 14 bits for run length (12 needed)
     *   1: zero run, 7 bits for run length
     *                7 bits for the next coefficient (3 needed)
     *   2: coefficient, 14 bits (11 needed)
     *
     * Coefficients are signed, so are packed in the highest bits for automatic
     * sign extension.
     */
    int16_t *dct_tokens[3][64];
    int16_t *dct_tokens_base;
#define TOKEN_EOB(eob_run)              ((eob_run) << 2)
#define TOKEN_ZERO_RUN(coeff, zero_run) (((coeff) << 9) + ((zero_run) << 2) + 1)
#define TOKEN_COEFF(coeff)              (((coeff) << 2) + 2)

    /**
     * number of blocks that contain DCT coefficients at the given level or higher
     */
    int num_coded_frags[3][64];
    int total_num_coded_frags;

207
    /* this is a list of indexes into the all_fragments array indicating
208
     * which of the fragments are coded */
209
    int *coded_fragment_list[3];
210

211 212 213 214 215 216
    VLC dc_vlc[16];
    VLC ac_vlc_1[16];
    VLC ac_vlc_2[16];
    VLC ac_vlc_3[16];
    VLC ac_vlc_4[16];

217 218 219 220 221
    VLC superblock_run_length_vlc;
    VLC fragment_run_length_vlc;
    VLC mode_code_vlc;
    VLC motion_vector_vlc;

222 223
    /* these arrays need to be on 16-byte boundaries since SSE2 operations
     * index into them */
224
    DECLARE_ALIGNED(16, int16_t, qmat)[3][2][3][64];     //<qmat[qpi][is_inter][plane]
225 226

    /* This table contains superblock_count * 16 entries. Each set of 16
227
     * numbers corresponds to the fragment indexes 0..15 of the superblock.
228 229 230 231
     * An entry will be -1 to indicate that no entry corresponds to that
     * index. */
    int *superblock_fragments;

232
    /* This is an array that indicates how a particular macroblock
233
     * is coded. */
234
    unsigned char *macroblock_coding;
235

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

239 240 241 242 243 244 245
    /* Huffman decode */
    int hti;
    unsigned int hbits;
    int entries;
    int huff_code_size;
    uint16_t huffman_table[80][32][2];

246
    uint8_t filter_limit_values[64];
247
    DECLARE_ALIGNED(8, int, bounding_values_array)[256+2];
248 249 250 251 252 253 254 255 256 257
} Vp3DecodeContext;

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

/*
 * This function sets up all of the various blocks mappings:
 * superblocks <-> fragments, macroblocks <-> fragments,
 * superblocks <-> macroblocks
258 259
 *
 * Returns 0 is successful; returns 1 if *anything* went wrong.
260
 */
261
static int init_block_mapping(Vp3DecodeContext *s)
262 263 264 265 266 267 268 269 270 271 272 273
{
    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;

274
    static const signed char travel_width[16] = {
275
         1,  1,  0, -1,
276 277 278 279 280
         0,  0,  1,  0,
         1,  0,  1,  0,
         0, -1,  0,  1
    };

281
    static const signed char travel_height[16] = {
282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300
         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;
301
            current_width = -1;
302
            current_height = 0;
303
            superblock_row_inc = 3 * s->fragment_width -
304
                (s->y_superblock_width * 4 - s->fragment_width);
305 306 307 308 309 310 311 312 313

            /* 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;
314
            current_width = -1;
315
            current_height = 0;
316
            superblock_row_inc = 3 * (s->fragment_width / 2) -
317
                (s->c_superblock_width * 4 - s->fragment_width / 2);
318 319

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

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

            /* start of V superblocks */
            right_edge = s->fragment_width / 2;
            bottom_edge = s->fragment_height / 2;
327
            current_width = -1;
328
            current_height = 0;
329
            superblock_row_inc = 3 * (s->fragment_width / 2) -
330
                (s->c_superblock_width * 4 - s->fragment_width / 2);
331 332

            /* the first operation for this variable is to advance by 1 */
M
Michael Niedermayer 已提交
333
            current_fragment = s->fragment_start[2] - 1;
334 335 336

        }

337
        if (current_width >= right_edge - 1) {
338
            /* reset width and move to next superblock row */
339
            current_width = -1;
340 341 342 343 344 345 346 347
            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 已提交
348
            current_fragment += travel_width[j] + right_edge * travel_height[j];
349
            current_width += travel_width[j];
350 351 352
            current_height += travel_height[j];

            /* check if the fragment is in bounds */
353
            if ((current_width < right_edge) &&
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++;
        }
    }

364
    return 0;  /* successful path out */
365 366 367 368 369 370 371 372 373 374 375
}

/*
 * 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 */
    for (i = 0; i < s->fragment_count; i++) {
376 377
        s->all_fragments[i].motion_x = 127;
        s->all_fragments[i].motion_y = 127;
378
        s->all_fragments[i].dc = 0;
379
        s->all_fragments[i].qpi = 0;
380 381 382 383
    }
}

/*
384
 * This function sets up the dequantization tables used for a particular
385 386
 * frame.
 */
387
static void init_dequantizer(Vp3DecodeContext *s, int qpi)
388
{
389 390
    int ac_scale_factor = s->coded_ac_scale_factor[s->qps[qpi]];
    int dc_scale_factor = s->coded_dc_scale_factor[s->qps[qpi]];
391
    int i, plane, inter, qri, bmi, bmj, qistart;
392

393 394 395 396 397
    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];
398
                if(s->qps[qpi] <= sum)
399 400 401 402 403 404
                    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++){
405 406
                int coeff= (  2*(sum    -s->qps[qpi])*s->base_matrix[bmi][i]
                            - 2*(qistart-s->qps[qpi])*s->base_matrix[bmj][i]
407 408 409
                            + s->qr_size[inter][plane][qri])
                           / (2*s->qr_size[inter][plane][qri]);

M
Michael Niedermayer 已提交
410
                int qmin= 8<<(inter + !i);
411 412
                int qscale= i ? ac_scale_factor : dc_scale_factor;

413
                s->qmat[qpi][inter][plane][s->dsp.idct_permutation[i]]= av_clip((qscale * coeff)/100 * 4, qmin, 4096);
414
            }
415 416
            // 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];
417
        }
418
    }
419

420
    memset(s->qscale_table, (FFMAX(s->qmat[0][0][0][1], s->qmat[0][0][1][1])+8)/16, 512); //FIXME finetune
421 422
}

423 424 425
/*
 * This function initializes the loop filter boundary limits if the frame's
 * quality index is different from the previous frame's.
426 427
 *
 * The filter_limit_values may not be larger than 127.
428 429 430 431 432 433
 */
static void init_loop_filter(Vp3DecodeContext *s)
{
    int *bounding_values= s->bounding_values_array+127;
    int filter_limit;
    int x;
434
    int value;
435

436
    filter_limit = s->filter_limit_values[s->qps[0]];
437 438 439 440 441 442 443

    /* 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;
    }
444 445 446 447 448 449
    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 已提交
450
    bounding_values[129] = bounding_values[130] = filter_limit * 0x02020202;
451 452
}

453
/*
454
 * This function unpacks all of the superblock/macroblock/fragment coding
455 456
 * information from the bitstream.
 */
457
static int unpack_superblocks(Vp3DecodeContext *s, GetBitContext *gb)
458
{
D
David Conrad 已提交
459
    int superblock_starts[3] = { 0, s->u_superblock_start, s->v_superblock_start };
460 461 462
    int bit = 0;
    int current_superblock = 0;
    int current_run = 0;
463
    int num_partial_superblocks = 0;
464 465 466

    int i, j;
    int current_fragment;
467
    int plane;
468 469 470 471 472 473 474

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

    } else {

        /* unpack the list of partially-coded superblocks */
475
        bit = get_bits1(gb);
476
        while (current_superblock < s->superblock_count) {
477
                current_run = get_vlc2(gb,
478 479
                    s->superblock_run_length_vlc.table, 6, 2) + 1;
                if (current_run == 34)
480
                    current_run += get_bits(gb, 12);
481

482 483 484 485 486 487 488 489
            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;
490 491
            if (bit)
                num_partial_superblocks += current_run;
492

493 494 495
            if (s->theora && current_run == MAXIMUM_LONG_BIT_RUN)
                bit = get_bits1(gb);
            else
496
                bit ^= 1;
497 498 499 500
        }

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

            current_superblock = 0;
505
            bit = get_bits1(gb);
506
            while (superblocks_decoded < s->superblock_count - num_partial_superblocks) {
507
                        current_run = get_vlc2(gb,
508 509
                            s->superblock_run_length_vlc.table, 6, 2) + 1;
                        if (current_run == 34)
510
                            current_run += get_bits(gb, 12);
511 512 513 514 515

                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;
516
                    }
517 518 519

                /* skip any superblocks already marked as partially coded */
                if (s->superblock_coding[current_superblock] == SB_NOT_CODED) {
520
                    s->superblock_coding[current_superblock] = 2*bit;
521 522
                    j++;
                }
523
                }
524 525
                superblocks_decoded += current_run;

526 527 528
                if (s->theora && current_run == MAXIMUM_LONG_BIT_RUN)
                    bit = get_bits1(gb);
                else
529
                    bit ^= 1;
530 531 532 533 534
            }
        }

        /* if there were partial blocks, initialize bitstream for
         * unpacking fragment codings */
535
        if (num_partial_superblocks) {
536 537

            current_run = 0;
538
            bit = get_bits1(gb);
539
            /* toggle the bit because as soon as the first run length is
540 541 542 543 544 545 546
             * fetched the bit will be toggled again */
            bit ^= 1;
        }
    }

    /* figure out which fragments are coded; iterate through each
     * superblock (all planes) */
547
    s->total_num_coded_frags = 0;
548
    memset(s->macroblock_coding, MODE_COPY, s->macroblock_count);
549 550

    for (plane = 0; plane < 3; plane++) {
D
David Conrad 已提交
551
        int sb_start = superblock_starts[plane];
552
        int sb_end = sb_start + (plane ? s->c_superblock_count : s->y_superblock_count);
553
        int num_coded_frags = 0;
554 555

    for (i = sb_start; i < sb_end; i++) {
556 557 558 559 560 561

        /* 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];
562
            if (current_fragment >= s->fragment_count) {
563
                av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_superblocks(): bad fragment number (%d >= %d)\n",
564 565 566
                    current_fragment, s->fragment_count);
                return 1;
            }
567
            if (current_fragment != -1) {
568
                int coded = s->superblock_coding[i];
569

570
                if (s->superblock_coding[i] == SB_PARTIALLY_CODED) {
571 572 573

                    /* fragment may or may not be coded; this is the case
                     * that cares about the fragment coding runs */
574
                    if (current_run-- == 0) {
575
                        bit ^= 1;
576
                        current_run = get_vlc2(gb,
577
                            s->fragment_run_length_vlc.table, 5, 2);
578
                    }
579 580
                    coded = bit;
                }
581

582
                    if (coded) {
583
                        /* default mode; actual mode will be decoded in
584
                         * the next phase */
585
                        s->all_fragments[current_fragment].coding_method =
586
                            MODE_INTER_NO_MV;
587
                        s->coded_fragment_list[plane][num_coded_frags++] =
588 589 590 591 592 593 594 595 596
                            current_fragment;
                    } else {
                        /* not coded; copy this fragment from the prior frame */
                        s->all_fragments[current_fragment].coding_method =
                            MODE_COPY;
                    }
            }
        }
    }
597 598 599 600 601
        s->total_num_coded_frags += num_coded_frags;
        for (i = 0; i < 64; i++)
            s->num_coded_frags[plane][i] = num_coded_frags;
        if (plane < 2)
            s->coded_fragment_list[plane+1] = s->coded_fragment_list[plane] + num_coded_frags;
602
    }
603
    return 0;
604 605 606 607 608 609
}

/*
 * This function unpacks all the coding mode data for individual macroblocks
 * from the bitstream.
 */
610
static int unpack_modes(Vp3DecodeContext *s, GetBitContext *gb)
611
{
612
    int i, j, k, sb_x, sb_y;
613 614 615 616
    int scheme;
    int current_macroblock;
    int current_fragment;
    int coding_mode;
617
    int custom_mode_alphabet[CODING_MODE_COUNT];
618
    const int *alphabet;
619 620 621 622 623 624 625 626 627 628 629 630

    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) {
631 632
            for (i = 0; i < 8; i++)
                custom_mode_alphabet[i] = MODE_INTER_NO_MV;
633
            for (i = 0; i < 8; i++)
634
                custom_mode_alphabet[get_bits(gb, 3)] = i;
635 636 637
            alphabet = custom_mode_alphabet;
        } else
            alphabet = ModeAlphabet[scheme-1];
638 639 640

        /* iterate through all of the macroblocks that contain 1 or more
         * coded fragments */
641 642
        for (sb_y = 0; sb_y < s->y_superblock_height; sb_y++) {
            for (sb_x = 0; sb_x < s->y_superblock_width; sb_x++) {
643 644

            for (j = 0; j < 4; j++) {
645 646 647 648
                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;

649
                if (mb_x >= s->macroblock_width || mb_y >= s->macroblock_height)
650 651
                    continue;

652 653
#define BLOCK_X (2*mb_x + (k&1))
#define BLOCK_Y (2*mb_y + (k>>1))
654 655 656 657 658 659 660 661 662 663 664
                /* 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;
                }
665

666 667 668 669
                /* mode 7 means get 3 bits for each coding mode */
                if (scheme == 7)
                    coding_mode = get_bits(gb, 3);
                else
670
                    coding_mode = alphabet
671
                        [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
672

673
                s->macroblock_coding[current_macroblock] = coding_mode;
674
                for (k = 0; k < 4; k++) {
675
                    current_fragment =
676 677 678 679 680 681 682 683 684
                        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;
685
                    if (s->all_fragments[current_fragment].coding_method !=
686 687 688 689 690
                        MODE_COPY)
                        s->all_fragments[current_fragment].coding_method =
                            coding_mode;
                }
            }
691
            }
692 693
        }
    }
694 695

    return 0;
696 697
}

698 699 700 701
/*
 * This function unpacks all the motion vectors for the individual
 * macroblocks from the bitstream.
 */
702
static int unpack_vectors(Vp3DecodeContext *s, GetBitContext *gb)
703
{
704
    int j, k, sb_x, sb_y;
705 706 707 708 709 710 711 712 713 714
    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 已提交
715
    if (s->keyframe)
716
        return 0;
D
David Conrad 已提交
717

D
David Conrad 已提交
718 719
    memset(motion_x, 0, 6 * sizeof(int));
    memset(motion_y, 0, 6 * sizeof(int));
720

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

D
David Conrad 已提交
724 725
    /* iterate through all of the macroblocks that contain 1 or more
     * coded fragments */
726 727
    for (sb_y = 0; sb_y < s->y_superblock_height; sb_y++) {
        for (sb_x = 0; sb_x < s->y_superblock_width; sb_x++) {
728

D
David Conrad 已提交
729
        for (j = 0; j < 4; j++) {
730 731 732 733 734
            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 已提交
735 736
                (s->macroblock_coding[current_macroblock] == MODE_COPY))
                continue;
737

D
David Conrad 已提交
738 739 740 741 742 743 744 745 746 747 748
            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)];
749
                }
750

D
David Conrad 已提交
751 752 753
                /* vector maintenance, only on MODE_INTER_PLUS_MV */
                if (s->macroblock_coding[current_macroblock] ==
                    MODE_INTER_PLUS_MV) {
754 755
                    prior_last_motion_x = last_motion_x;
                    prior_last_motion_y = last_motion_y;
D
David Conrad 已提交
756 757 758 759 760 761 762 763 764 765 766 767 768 769
                    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++) {
770
                    current_fragment = BLOCK_Y*s->fragment_width + BLOCK_X;
771
                    if (s->all_fragments[current_fragment].coding_method != MODE_COPY) {
D
David Conrad 已提交
772 773 774
                        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)];
775
                        } else {
D
David Conrad 已提交
776 777
                            motion_x[k] = fixed_motion_vector_table[get_bits(gb, 6)];
                            motion_y[k] = fixed_motion_vector_table[get_bits(gb, 6)];
778
                        }
D
David Conrad 已提交
779 780 781 782 783
                        last_motion_x = motion_x[k];
                        last_motion_y = motion_y[k];
                    } else {
                        motion_x[k] = 0;
                        motion_y[k] = 0;
784
                    }
D
David Conrad 已提交
785 786 787
                    motion_x[4] += motion_x[k];
                    motion_y[4] += motion_y[k];
                }
788

D
David Conrad 已提交
789 790 791 792 793 794 795 796 797 798
                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;
799

D
David Conrad 已提交
800 801 802 803 804 805 806 807 808
                /* 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;
809

D
David Conrad 已提交
810 811 812 813 814 815
                /* 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;
816

D
David Conrad 已提交
817 818
            default:
                /* covers intra, inter without MV, golden without MV */
819 820
                motion_x[0] = 0;
                motion_y[0] = 0;
821

D
David Conrad 已提交
822 823 824
                /* no vector maintenance */
                break;
            }
825

D
David Conrad 已提交
826
            /* assign the motion vectors to the correct fragments */
827
            for (k = 0; k < 4; k++) {
D
David Conrad 已提交
828
                current_fragment =
829
                    BLOCK_Y*s->fragment_width + BLOCK_X;
830
                if (s->macroblock_coding[current_macroblock] == MODE_INTER_FOURMV) {
831 832
                    s->all_fragments[current_fragment].motion_x = motion_x[k];
                    s->all_fragments[current_fragment].motion_y = motion_y[k];
833 834 835 836
                } else {
                    s->all_fragments[current_fragment].motion_x = motion_x[0];
                    s->all_fragments[current_fragment].motion_y = motion_y[0];
                }
837
            }
838 839 840 841 842 843 844 845 846 847 848
            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];
                }
            }
849
        }
850
        }
D
David Conrad 已提交
851
    }
852 853

    return 0;
854 855
}

856 857 858
static int unpack_block_qpis(Vp3DecodeContext *s, GetBitContext *gb)
{
    int qpi, i, j, bit, run_length, blocks_decoded, num_blocks_at_qpi;
859
    int num_blocks = s->total_num_coded_frags;
860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875

    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++) {
876
                if (i >= s->total_num_coded_frags)
877 878
                    return -1;

879 880
                if (s->all_fragments[s->coded_fragment_list[0][i]].qpi == qpi) {
                    s->all_fragments[s->coded_fragment_list[0][i]].qpi += bit;
881 882 883 884
                    j++;
                }
            }

885
            if (run_length == MAXIMUM_LONG_BIT_RUN)
886 887 888 889 890 891 892 893 894 895 896
                bit = get_bits1(gb);
            else
                bit ^= 1;
        } while (blocks_decoded < num_blocks);

        num_blocks -= num_blocks_at_qpi;
    }

    return 0;
}

897
/*
898 899 900 901 902 903 904 905 906 907 908 909 910
 * 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,
911
                        int plane,
912 913
                        int eob_run)
{
914
    int i, j = 0;
915
    int token;
916 917 918
    int zero_run = 0;
    DCTELEM coeff = 0;
    int bits_to_get;
919 920 921 922
    int blocks_ended;
    int coeff_i = 0;
    int num_coeffs = s->num_coded_frags[plane][coeff_index];
    int16_t *dct_tokens = s->dct_tokens[plane][coeff_index];
923

924
    /* local references to structure members to avoid repeated deferences */
925
    int *coded_fragment_list = s->coded_fragment_list[plane];
926 927 928
    Vp3Fragment *all_fragments = s->all_fragments;
    VLC_TYPE (*vlc_table)[2] = table->table;

929 930 931 932 933 934
    if (num_coeffs < 0)
        av_log(s->avctx, AV_LOG_ERROR, "Invalid number of coefficents at level %d\n", coeff_index);

    if (eob_run > num_coeffs) {
        coeff_i = blocks_ended = num_coeffs;
        eob_run -= num_coeffs;
935
    } else {
936 937
        coeff_i = blocks_ended = eob_run;
        eob_run = 0;
938 939
    }

940 941 942
    // insert fake EOB token to cover the split between planes or zzi
    if (blocks_ended)
        dct_tokens[j++] = blocks_ended << 2;
943

944
    while (coeff_i < num_coeffs) {
945
            /* decode a VLC into a token */
946
            token = get_vlc2(gb, vlc_table, 5, 3);
947
            /* use the token to get a zero run, a coefficient, and an eob run */
948 949 950 951
            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]);
952 953 954 955 956 957 958 959 960 961 962 963 964 965

                // record only the number of blocks ended in this plane,
                // any spill will be recorded in the next plane.
                if (eob_run > num_coeffs - coeff_i) {
                    dct_tokens[j++] = TOKEN_EOB(num_coeffs - coeff_i);
                    blocks_ended   += num_coeffs - coeff_i;
                    eob_run        -= num_coeffs - coeff_i;
                    coeff_i         = num_coeffs;
                } else {
                    dct_tokens[j++] = TOKEN_EOB(eob_run);
                    blocks_ended   += eob_run;
                    coeff_i        += eob_run;
                    eob_run = 0;
                }
966 967
            } else {
                bits_to_get = coeff_get_bits[token];
968 969 970
                if (bits_to_get)
                    bits_to_get = get_bits(gb, bits_to_get);
                coeff = coeff_tables[token][bits_to_get];
971 972 973 974

                zero_run = zero_run_base[token];
                if (zero_run_get_bits[token])
                    zero_run += get_bits(gb, zero_run_get_bits[token]);
975

976 977 978 979 980 981 982 983 984 985 986 987 988 989
                if (zero_run) {
                    dct_tokens[j++] = TOKEN_ZERO_RUN(coeff, zero_run);
                } else {
                    // Save DC into the fragment structure. DC prediction is
                    // done in raster order, so the actual DC can't be in with
                    // other tokens. We still need the token in dct_tokens[]
                    // however, or else the structure collapses on itself.
                    if (!coeff_index)
                        all_fragments[coded_fragment_list[coeff_i]].dc = coeff;

                    dct_tokens[j++] = TOKEN_COEFF(coeff);
                }

                if (coeff_index + zero_run > 64) {
990
                    av_log(s->avctx, AV_LOG_DEBUG, "Invalid zero run of %d with"
991 992 993
                           " %d coeffs left\n", zero_run, 64-coeff_index);
                    zero_run = 64 - coeff_index;
                }
994

995 996 997 998 999 1000
                // zero runs code multiple coefficients,
                // so don't try to decode coeffs for those higher levels
                for (i = coeff_index+1; i <= coeff_index+zero_run; i++)
                    s->num_coded_frags[plane][i]--;
                coeff_i++;
            }
1001 1002
    }

1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017
    if (blocks_ended > s->num_coded_frags[plane][coeff_index])
        av_log(s->avctx, AV_LOG_ERROR, "More blocks ended than coded!\n");

    // decrement the number of blocks that have higher coeffecients for each
    // EOB run at this level
    if (blocks_ended)
        for (i = coeff_index+1; i < 64; i++)
            s->num_coded_frags[plane][i] -= blocks_ended;

    // setup the next buffer
    if (plane < 2)
        s->dct_tokens[plane+1][coeff_index] = dct_tokens + j;
    else if (coeff_index < 63)
        s->dct_tokens[0][coeff_index+1] = dct_tokens + j;

1018 1019 1020
    return eob_run;
}

1021 1022 1023 1024
static void reverse_dc_prediction(Vp3DecodeContext *s,
                                  int first_fragment,
                                  int fragment_width,
                                  int fragment_height);
1025 1026 1027 1028
/*
 * This function unpacks all of the DCT coefficient data from the
 * bitstream.
 */
1029
static int unpack_dct_coeffs(Vp3DecodeContext *s, GetBitContext *gb)
1030 1031 1032 1033 1034 1035 1036
{
    int i;
    int dc_y_table;
    int dc_c_table;
    int ac_y_table;
    int ac_c_table;
    int residual_eob_run = 0;
1037 1038
    VLC *y_tables[64];
    VLC *c_tables[64];
1039

1040 1041
    s->dct_tokens[0][0] = s->dct_tokens_base;

1042
    /* fetch the DC table indexes */
1043 1044 1045 1046
    dc_y_table = get_bits(gb, 4);
    dc_c_table = get_bits(gb, 4);

    /* unpack the Y plane DC coefficients */
1047
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_y_table], 0,
1048
        0, residual_eob_run);
1049

1050 1051 1052
    /* reverse prediction of the Y-plane DC coefficients */
    reverse_dc_prediction(s, 0, s->fragment_width, s->fragment_height);

1053 1054
    /* unpack the C plane DC coefficients */
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_c_table], 0,
1055 1056 1057
        1, residual_eob_run);
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_c_table], 0,
        2, residual_eob_run);
1058

1059 1060 1061 1062 1063 1064 1065 1066 1067
    /* 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);
    }

1068
    /* fetch the AC table indexes */
1069 1070 1071
    ac_y_table = get_bits(gb, 4);
    ac_c_table = get_bits(gb, 4);

1072
    /* build tables of AC VLC tables */
1073
    for (i = 1; i <= 5; i++) {
1074 1075
        y_tables[i] = &s->ac_vlc_1[ac_y_table];
        c_tables[i] = &s->ac_vlc_1[ac_c_table];
1076 1077
    }
    for (i = 6; i <= 14; i++) {
1078 1079
        y_tables[i] = &s->ac_vlc_2[ac_y_table];
        c_tables[i] = &s->ac_vlc_2[ac_c_table];
1080 1081
    }
    for (i = 15; i <= 27; i++) {
1082 1083
        y_tables[i] = &s->ac_vlc_3[ac_y_table];
        c_tables[i] = &s->ac_vlc_3[ac_c_table];
1084 1085
    }
    for (i = 28; i <= 63; i++) {
1086 1087 1088 1089 1090 1091 1092
        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++) {
            residual_eob_run = unpack_vlcs(s, gb, y_tables[i], i,
1093
                0, residual_eob_run);
1094

1095
            residual_eob_run = unpack_vlcs(s, gb, c_tables[i], i,
1096 1097 1098
                1, residual_eob_run);
            residual_eob_run = unpack_vlcs(s, gb, c_tables[i], i,
                2, residual_eob_run);
1099
    }
1100 1101

    return 0;
1102 1103 1104 1105
}

/*
 * This function reverses the DC prediction for each coded fragment in
1106
 * the frame. Much of this function is adapted directly from the original
1107 1108 1109 1110
 * VP3 source code.
 */
#define COMPATIBLE_FRAME(x) \
  (compatible_frame[s->all_fragments[x].coding_method] == current_frame_type)
1111
#define DC_COEFF(u) s->all_fragments[u].dc
1112 1113 1114 1115

static void reverse_dc_prediction(Vp3DecodeContext *s,
                                  int first_fragment,
                                  int fragment_width,
1116
                                  int fragment_height)
1117 1118 1119 1120 1121 1122 1123 1124 1125 1126
{

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

    int x, y;
    int i = first_fragment;

1127
    int predicted_dc;
1128 1129 1130 1131

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

1132
    /* indexes for the left, up-left, up, and up-right fragments */
1133 1134
    int l, ul, u, ur;

1135
    /*
1136 1137 1138 1139 1140 1141
     * The 6 fields mean:
     *   0: up-left multiplier
     *   1: up multiplier
     *   2: up-right multiplier
     *   3: left multiplier
     */
1142
    static const int predictor_transform[16][4] = {
M
Michael Niedermayer 已提交
1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158
        {  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
1159 1160 1161 1162 1163
    };

    /* 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
1164
     * from other INTRA blocks. There are 2 golden frame coding types;
1165 1166
     * blocks encoding in these modes can only predict from other blocks
     * that were encoded with these 1 of these 2 modes. */
1167
    static const unsigned char compatible_frame[9] = {
1168 1169 1170 1171 1172 1173 1174
        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 */
1175 1176
        1,    /* MODE_INTER_FOUR_MV */
        3     /* MODE_COPY */
1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196
    };
    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) {

1197
                current_frame_type =
1198 1199
                    compatible_frame[s->all_fragments[i].coding_method];

M
Michael Niedermayer 已提交
1200 1201 1202
                transform= 0;
                if(x){
                    l= i-1;
1203
                    vl = DC_COEFF(l);
1204
                    if(COMPATIBLE_FRAME(l))
M
Michael Niedermayer 已提交
1205
                        transform |= PL;
M
Michael Niedermayer 已提交
1206 1207 1208
                }
                if(y){
                    u= i-fragment_width;
1209
                    vu = DC_COEFF(u);
1210
                    if(COMPATIBLE_FRAME(u))
M
Michael Niedermayer 已提交
1211
                        transform |= PU;
M
Michael Niedermayer 已提交
1212 1213 1214
                    if(x){
                        ul= i-fragment_width-1;
                        vul = DC_COEFF(ul);
1215
                        if(COMPATIBLE_FRAME(ul))
M
Michael Niedermayer 已提交
1216
                            transform |= PUL;
M
Michael Niedermayer 已提交
1217 1218 1219 1220
                    }
                    if(x + 1 < fragment_width){
                        ur= i-fragment_width+1;
                        vur = DC_COEFF(ur);
1221
                        if(COMPATIBLE_FRAME(ur))
M
Michael Niedermayer 已提交
1222
                            transform |= PUR;
M
Michael Niedermayer 已提交
1223
                    }
1224 1225 1226 1227 1228 1229
                }

                if (transform == 0) {

                    /* if there were no fragments to predict from, use last
                     * DC saved */
1230
                    predicted_dc = last_dc[current_frame_type];
1231 1232 1233 1234 1235 1236 1237 1238 1239
                } 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 已提交
1240
                    predicted_dc /= 128;
1241 1242 1243

                    /* check for outranging on the [ul u l] and
                     * [ul u ur l] predictors */
1244
                    if ((transform == 15) || (transform == 13)) {
D
Diego Biurrun 已提交
1245
                        if (FFABS(predicted_dc - vu) > 128)
1246
                            predicted_dc = vu;
D
Diego Biurrun 已提交
1247
                        else if (FFABS(predicted_dc - vl) > 128)
1248
                            predicted_dc = vl;
D
Diego Biurrun 已提交
1249
                        else if (FFABS(predicted_dc - vul) > 128)
1250 1251 1252 1253
                            predicted_dc = vul;
                    }
                }

1254
                /* at long last, apply the predictor */
1255
                DC_COEFF(i) += predicted_dc;
1256
                /* save the DC */
1257
                last_dc[current_frame_type] = DC_COEFF(i);
1258 1259 1260 1261 1262
            }
        }
    }
}

1263
static void apply_loop_filter(Vp3DecodeContext *s, int plane, int ystart, int yend)
1264 1265 1266 1267
{
    int x, y;
    int *bounding_values= s->bounding_values_array+127;

D
David Conrad 已提交
1268 1269 1270 1271 1272 1273
    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 已提交
1274
    plane_data += s->data_offset[plane] + 8*ystart*stride;
D
David Conrad 已提交
1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287

    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 已提交
1288
                        plane_data + 8*x,
D
David Conrad 已提交
1289 1290
                        stride, bounding_values);
                }
1291

D
David Conrad 已提交
1292 1293 1294
                /* do not perform top edge filter for top row fragments */
                if (y > 0) {
                    s->dsp.vp3_v_loop_filter(
D
David Conrad 已提交
1295
                        plane_data + 8*x,
D
David Conrad 已提交
1296 1297
                        stride, bounding_values);
                }
1298

D
David Conrad 已提交
1299 1300 1301 1302 1303 1304
                /* 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 已提交
1305
                        plane_data + 8*x + 8,
D
David Conrad 已提交
1306
                        stride, bounding_values);
1307 1308
                }

D
David Conrad 已提交
1309 1310 1311 1312 1313 1314
                /* 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 已提交
1315
                        plane_data + 8*x + 8*stride,
D
David Conrad 已提交
1316 1317
                        stride, bounding_values);
                }
1318
            }
D
David Conrad 已提交
1319 1320

            fragment++;
1321
        }
D
David Conrad 已提交
1322
        plane_data += 8*stride;
D
David Conrad 已提交
1323
    }
1324 1325
}

1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366
/**
 * Pulls DCT tokens from the 64 levels to decode and dequant the coefficients
 * for the next block in coding order
 */
static inline int vp3_dequant(Vp3DecodeContext *s, Vp3Fragment *frag,
                              int plane, int inter, DCTELEM block[64])
{
    int16_t *dequantizer = s->qmat[frag->qpi][inter][plane];
    uint8_t *perm = s->scantable.permutated;
    int i = 0;

    do {
        int token = *s->dct_tokens[plane][i];
        switch (token & 3) {
        case 0: // EOB
            if (--token < 4) // 0-3 are token types, so the EOB run must now be 0
                s->dct_tokens[plane][i]++;
            else
                *s->dct_tokens[plane][i] = token & ~3;
            goto end;
        case 1: // zero run
            s->dct_tokens[plane][i]++;
            i += (token >> 2) & 0x7f;
            block[perm[i]] = (token >> 9) * dequantizer[perm[i]];
            i++;
            break;
        case 2: // coeff
            block[perm[i]] = (token >> 2) * dequantizer[perm[i]];
            s->dct_tokens[plane][i++]++;
            break;
        default:
            av_log(s->avctx, AV_LOG_ERROR, "internal: invalid token type\n");
            return i;
        }
    } while (i < 64);
end:
    // the actual DC+prediction is in the fragment structure
    block[0] = frag->dc * s->qmat[0][inter][plane][0];
    return i;
}

1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397
/**
 * 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;
}

1398 1399
/*
 * Perform the final rendering for a particular slice of data.
1400
 * The slice number ranges from 0..(c_superblock_height - 1).
1401 1402 1403
 */
static void render_slice(Vp3DecodeContext *s, int slice)
{
1404
    int x, y, i, j;
1405
    LOCAL_ALIGNED_16(DCTELEM, block, [64]);
1406 1407 1408
    int motion_x = 0xdeadbeef, motion_y = 0xdeadbeef;
    int motion_halfpel_index;
    uint8_t *motion_source;
1409
    int plane, first_pixel;
1410

1411
    if (slice >= s->c_superblock_height)
1412 1413 1414
        return;

    for (plane = 0; plane < 3; plane++) {
D
David Conrad 已提交
1415 1416 1417
        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 已提交
1418 1419 1420
        int stride            = s->current_frame.linesize[plane];
        int plane_width       = s->width  >> !!plane;
        int plane_height      = s->height >> !!plane;
1421 1422 1423 1424 1425 1426 1427 1428

        int sb_x, sb_y        = slice << !plane;
        int slice_height      = sb_y + (plane ? 1 : 2);
        int slice_width       = plane ? s->c_superblock_width : s->y_superblock_width;

        int fragment_width    = s->fragment_width  >> !!plane;
        int fragment_height   = s->fragment_height >> !!plane;
        int fragment_start    = s->fragment_start[plane];
M
Michael Niedermayer 已提交
1429 1430

        if (!s->flipped_image) stride = -stride;
1431 1432
        if (CONFIG_GRAY && plane && (s->avctx->flags & CODEC_FLAG_GRAY))
            continue;
1433

1434

D
Diego Biurrun 已提交
1435
        if(FFABS(stride) > 2048)
1436 1437
            return; //various tables are fixed size

1438 1439
        /* for each superblock row in the slice (both of them)... */
        for (; sb_y < slice_height; sb_y++) {
1440

1441 1442
            /* for each superblock in a row... */
            for (sb_x = 0; sb_x < slice_width; sb_x++) {
1443

1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455
                /* for each block in a superblock... */
                for (j = 0; j < 16; j++) {
                    x = 4*sb_x + hilbert_offset[j][0];
                    y = 4*sb_y + hilbert_offset[j][1];

                    i = fragment_start + y*fragment_width + x;

                    // bounds check
                    if (x >= fragment_width || y >= fragment_height)
                        continue;

                first_pixel = 8*y*stride + 8*x;
1456 1457

                /* transform if this block was coded */
1458
                if (s->all_fragments[i].coding_method != MODE_COPY) {
1459
                    int intra = s->all_fragments[i].coding_method == MODE_INTRA;
1460 1461 1462 1463

                    if ((s->all_fragments[i].coding_method == MODE_USING_GOLDEN) ||
                        (s->all_fragments[i].coding_method == MODE_GOLDEN_MV))
                        motion_source= golden_plane;
1464
                    else
1465 1466
                        motion_source= last_plane;

D
David Conrad 已提交
1467
                    motion_source += first_pixel;
1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481
                    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);
                        }

1482 1483
                        src_x= (motion_x>>1) + 8*x;
                        src_y= (motion_y>>1) + 8*y;
1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501
                        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;
                        }
                    }
1502

1503 1504 1505 1506

                    /* first, take care of copying a block from either the
                     * previous or the golden frame */
                    if (s->all_fragments[i].coding_method != MODE_INTRA) {
1507 1508 1509
                        /* 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
1510 1511 1512
                           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 已提交
1513
                                output_plane + first_pixel,
1514 1515 1516 1517
                                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 已提交
1518
                                output_plane + first_pixel,
1519 1520
                                motion_source - d,
                                motion_source + stride + 1 + d,
1521 1522 1523 1524
                                stride, 8);
                        }
                    }

L
Loren Merritt 已提交
1525
                        s->dsp.clear_block(block);
1526
                        vp3_dequant(s, s->all_fragments + i, plane, !intra, block);
1527 1528

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

1530 1531 1532 1533
                    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 已提交
1534
                            output_plane + first_pixel,
1535 1536 1537 1538
                            stride,
                            block);
                    } else {
                        s->dsp.idct_add(
D
David Conrad 已提交
1539
                            output_plane + first_pixel,
1540 1541 1542 1543 1544 1545 1546
                            stride,
                            block);
                    }
                } else {

                    /* copy directly from the previous frame */
                    s->dsp.put_pixels_tab[1][0](
D
David Conrad 已提交
1547 1548
                        output_plane + first_pixel,
                        last_plane + first_pixel,
1549 1550 1551
                        stride, 8);

                }
1552
                }
1553
            }
1554 1555 1556

            // Filter up to the last row in the superblock row
            apply_loop_filter(s, plane, 4*sb_y - !!sb_y, FFMIN(4*sb_y+3, fragment_height-1));
1557 1558 1559 1560 1561 1562
        }
    }

     /* this looks like a good place for slice dispatch... */
     /* algorithm:
      *   if (slice == s->macroblock_height - 1)
1563 1564 1565
      *     dispatch (both last slice & 2nd-to-last slice);
      *   else if (slice > 0)
      *     dispatch (slice - 1);
1566 1567
      */

1568
    vp3_draw_horiz_band(s, FFMIN(64*slice + 64-16, s->height-16));
1569 1570
}

1571 1572 1573
/*
 * This is the ffmpeg/libavcodec API init function.
 */
1574
static av_cold int vp3_decode_init(AVCodecContext *avctx)
1575 1576
{
    Vp3DecodeContext *s = avctx->priv_data;
1577
    int i, inter, plane;
1578 1579
    int c_width;
    int c_height;
1580

A
Alex Beregszaszi 已提交
1581
    if (avctx->codec_tag == MKTAG('V','P','3','0'))
1582
        s->version = 0;
A
Alex Beregszaszi 已提交
1583
    else
1584
        s->version = 1;
A
Alex Beregszaszi 已提交
1585

1586
    s->avctx = avctx;
1587 1588
    s->width = FFALIGN(avctx->width, 16);
    s->height = FFALIGN(avctx->height, 16);
1589
    avctx->pix_fmt = PIX_FMT_YUV420P;
1590
    avctx->chroma_sample_location = AVCHROMA_LOC_CENTER;
1591 1592
    if(avctx->idct_algo==FF_IDCT_AUTO)
        avctx->idct_algo=FF_IDCT_VP3;
1593
    dsputil_init(&s->dsp, avctx);
1594

M
Michael Niedermayer 已提交
1595
    ff_init_scantable(s->dsp.idct_permutation, &s->scantable, ff_zigzag_direct);
1596 1597 1598

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

1602 1603
    s->y_superblock_width = (s->width + 31) / 32;
    s->y_superblock_height = (s->height + 31) / 32;
1604
    s->y_superblock_count = s->y_superblock_width * s->y_superblock_height;
1605 1606 1607 1608 1609 1610

    /* 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;
1611
    s->c_superblock_count = s->c_superblock_width * s->c_superblock_height;
1612

1613 1614 1615
    s->superblock_count = s->y_superblock_count + (s->c_superblock_count * 2);
    s->u_superblock_start = s->y_superblock_count;
    s->v_superblock_start = s->u_superblock_start + s->c_superblock_count;
1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626
    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 已提交
1627 1628
    s->fragment_start[1] = s->fragment_width * s->fragment_height;
    s->fragment_start[2] = s->fragment_width * s->fragment_height * 5 / 4;
1629 1630

    s->all_fragments = av_malloc(s->fragment_count * sizeof(Vp3Fragment));
1631 1632 1633 1634
    s->coded_fragment_list[0] = av_malloc(s->fragment_count * sizeof(int));
    s->dct_tokens_base = av_malloc(64*s->fragment_count * sizeof(*s->dct_tokens_base));
    if (!s->superblock_coding || !s->all_fragments || !s->dct_tokens_base ||
        !s->coded_fragment_list[0]) {
1635 1636 1637
        vp3_decode_end(avctx);
        return -1;
    }
1638

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

1650 1651 1652 1653 1654 1655 1656 1657 1658
        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;
            }
        }

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 1686 1687 1688 1689 1690
        /* 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 */
1691
            if (init_vlc(&s->dc_vlc[i], 5, 32,
1692
                &s->huffman_table[i][0][1], 4, 2,
1693 1694
                &s->huffman_table[i][0][0], 4, 2, 0) < 0)
                goto vlc_fail;
1695 1696

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

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

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

            /* group 4 AC histograms */
1715
            if (init_vlc(&s->ac_vlc_4[i], 5, 32,
1716
                &s->huffman_table[i+16*4][0][1], 4, 2,
1717 1718
                &s->huffman_table[i+16*4][0][0], 4, 2, 0) < 0)
                goto vlc_fail;
1719
        }
1720 1721
    }

1722 1723 1724 1725
    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);

1726
    init_vlc(&s->fragment_run_length_vlc, 5, 30,
1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737
        &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);

1738 1739
    /* work out the block mapping tables */
    s->superblock_fragments = av_malloc(s->superblock_count * 16 * sizeof(int));
1740
    s->macroblock_coding = av_malloc(s->macroblock_count + 1);
1741
    if (!s->superblock_fragments || !s->macroblock_coding) {
1742 1743 1744
        vp3_decode_end(avctx);
        return -1;
    }
1745 1746
    init_block_mapping(s);

1747 1748 1749 1750
    for (i = 0; i < 3; i++) {
        s->current_frame.data[i] = NULL;
        s->last_frame.data[i] = NULL;
        s->golden_frame.data[i] = NULL;
1751 1752
    }

1753
    return 0;
1754 1755 1756 1757

vlc_fail:
    av_log(avctx, AV_LOG_FATAL, "Invalid huffman table\n");
    return -1;
1758 1759 1760 1761 1762
}

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

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

1776 1777
    if (s->theora && get_bits1(&gb))
    {
1778 1779
        av_log(avctx, AV_LOG_ERROR, "Header packet passed to frame decoder, skipping\n");
        return -1;
1780
    }
A
Alex Beregszaszi 已提交
1781 1782 1783

    s->keyframe = !get_bits1(&gb);
    if (!s->theora)
1784
        skip_bits(&gb, 1);
1785 1786
    for (i = 0; i < 3; i++)
        s->last_qps[i] = s->qps[i];
1787

1788
    s->nqps=0;
1789
    do{
1790 1791 1792 1793
        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;
1794

1795
    if (s->avctx->debug & FF_DEBUG_PICT_INFO)
1796
        av_log(s->avctx, AV_LOG_INFO, " VP3 %sframe #%d: Q index = %d\n",
1797
            s->keyframe?"key":"", counter, s->qps[0]);
1798 1799
    counter++;

1800
    if (s->qps[0] != s->last_qps[0])
1801
        init_loop_filter(s);
1802 1803 1804 1805 1806 1807

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

1809 1810 1811
    if (avctx->skip_frame >= AVDISCARD_NONKEY && !s->keyframe)
        return buf_size;

D
David Conrad 已提交
1812
    s->current_frame.reference = 3;
D
David Conrad 已提交
1813
    s->current_frame.pict_type = s->keyframe ? FF_I_TYPE : FF_P_TYPE;
D
David Conrad 已提交
1814 1815
    if (avctx->get_buffer(avctx, &s->current_frame) < 0) {
        av_log(s->avctx, AV_LOG_ERROR, "get_buffer() failed\n");
D
David Conrad 已提交
1816
        goto error;
D
David Conrad 已提交
1817 1818
    }

1819
    if (s->keyframe) {
1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836
        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? */
        }
1837
    } else {
D
David Conrad 已提交
1838
        if (!s->golden_frame.data[0]) {
1839
            av_log(s->avctx, AV_LOG_WARNING, "vp3: first frame not a keyframe\n");
D
David Conrad 已提交
1840

1841
            s->golden_frame.reference = 3;
D
David Conrad 已提交
1842
            s->golden_frame.pict_type = FF_I_TYPE;
1843 1844 1845 1846 1847 1848
            if (avctx->get_buffer(avctx, &s->golden_frame) < 0) {
                av_log(s->avctx, AV_LOG_ERROR, "get_buffer() failed\n");
                goto error;
            }
            s->last_frame = s->golden_frame;
            s->last_frame.type = FF_BUFFER_TYPE_COPY;
1849 1850 1851
        }
    }

M
Michael Niedermayer 已提交
1852 1853 1854
    s->current_frame.qscale_table= s->qscale_table; //FIXME allocate individual tables per AVFrame
    s->current_frame.qstride= 0;

1855 1856
    init_frame(s, &gb);

M
Michael Niedermayer 已提交
1857 1858
    if (unpack_superblocks(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_superblocks\n");
D
David Conrad 已提交
1859
        goto error;
M
Michael Niedermayer 已提交
1860 1861 1862
    }
    if (unpack_modes(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_modes\n");
D
David Conrad 已提交
1863
        goto error;
M
Michael Niedermayer 已提交
1864 1865 1866
    }
    if (unpack_vectors(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_vectors\n");
D
David Conrad 已提交
1867
        goto error;
M
Michael Niedermayer 已提交
1868
    }
1869 1870
    if (unpack_block_qpis(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_block_qpis\n");
D
David Conrad 已提交
1871
        goto error;
1872
    }
M
Michael Niedermayer 已提交
1873 1874
    if (unpack_dct_coeffs(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_dct_coeffs\n");
D
David Conrad 已提交
1875
        goto error;
1876
    }
D
David Conrad 已提交
1877 1878 1879 1880 1881 1882 1883

    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];
    }
1884

1885
    s->last_slice_end = 0;
1886
    for (i = 0; i < s->c_superblock_height; i++)
1887
        render_slice(s, i);
1888

1889 1890 1891 1892 1893
    // 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);
    }
1894
    vp3_draw_horiz_band(s, s->height);
1895

1896 1897 1898
    *data_size=sizeof(AVFrame);
    *(AVFrame*)data= s->current_frame;

1899 1900
    /* release the last frame, if it is allocated and if it is not the
     * golden frame */
D
David Conrad 已提交
1901
    if (s->last_frame.data[0] && s->last_frame.type != FF_BUFFER_TYPE_COPY)
1902
        avctx->release_buffer(avctx, &s->last_frame);
1903

1904
    /* shuffle frames (last = current) */
M
Michael Niedermayer 已提交
1905
    s->last_frame= s->current_frame;
D
David Conrad 已提交
1906 1907 1908 1909 1910

    if (s->keyframe) {
        if (s->golden_frame.data[0])
            avctx->release_buffer(avctx, &s->golden_frame);
        s->golden_frame = s->current_frame;
D
David Conrad 已提交
1911
        s->last_frame.type = FF_BUFFER_TYPE_COPY;
D
David Conrad 已提交
1912 1913
    }

1914
    s->current_frame.data[0]= NULL; /* ensure that we catch any access to this released frame */
1915 1916

    return buf_size;
D
David Conrad 已提交
1917 1918 1919 1920 1921

error:
    if (s->current_frame.data[0])
        avctx->release_buffer(avctx, &s->current_frame);
    return -1;
1922 1923 1924 1925 1926
}

/*
 * This is the ffmpeg/libavcodec API module cleanup function.
 */
1927
static av_cold int vp3_decode_end(AVCodecContext *avctx)
1928 1929
{
    Vp3DecodeContext *s = avctx->priv_data;
1930
    int i;
1931

1932
    av_free(s->superblock_coding);
1933
    av_free(s->all_fragments);
1934 1935
    av_free(s->coded_fragment_list[0]);
    av_free(s->dct_tokens_base);
1936
    av_free(s->superblock_fragments);
1937
    av_free(s->macroblock_coding);
1938

1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951
    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);

1952
    /* release all frames */
D
David Conrad 已提交
1953
    if (s->golden_frame.data[0])
1954
        avctx->release_buffer(avctx, &s->golden_frame);
D
David Conrad 已提交
1955
    if (s->last_frame.data[0] && s->last_frame.type != FF_BUFFER_TYPE_COPY)
1956 1957 1958
        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 */
1959 1960 1961 1962

    return 0;
}

1963 1964 1965 1966
static int read_huffman_tree(AVCodecContext *avctx, GetBitContext *gb)
{
    Vp3DecodeContext *s = avctx->priv_data;

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

1997
#if CONFIG_THEORA_DECODER
1998
static int theora_decode_header(AVCodecContext *avctx, GetBitContext *gb)
1999 2000
{
    Vp3DecodeContext *s = avctx->priv_data;
2001
    int visible_width, visible_height, colorspace;
2002

2003
    s->theora = get_bits_long(gb, 24);
2004
    av_log(avctx, AV_LOG_DEBUG, "Theora bitstream version %X\n", s->theora);
2005

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

2014 2015
    visible_width  = s->width  = get_bits(gb, 16) << 4;
    visible_height = s->height = get_bits(gb, 16) << 4;
2016

2017
    if(avcodec_check_dimensions(avctx, s->width, s->height)){
2018
        av_log(avctx, AV_LOG_ERROR, "Invalid dimensions (%dx%d)\n", s->width, s->height);
2019 2020 2021
        s->width= s->height= 0;
        return -1;
    }
2022

2023
    if (s->theora >= 0x030200) {
D
David Conrad 已提交
2024 2025
        visible_width  = get_bits_long(gb, 24);
        visible_height = get_bits_long(gb, 24);
2026

2027 2028 2029
        skip_bits(gb, 8); /* offset x */
        skip_bits(gb, 8); /* offset y */
    }
2030

2031 2032 2033 2034
    skip_bits(gb, 32); /* fps numerator */
    skip_bits(gb, 32); /* fps denumerator */
    skip_bits(gb, 24); /* aspect numerator */
    skip_bits(gb, 24); /* aspect denumerator */
2035

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

2041
    skip_bits(gb, 6); /* quality hint */
2042

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

2050
//    align_get_bits(gb);
2051

2052 2053 2054 2055 2056
    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);
2057

2058 2059 2060 2061 2062 2063 2064 2065 2066 2067
    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;
    }

2068 2069 2070
    return 0;
}

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

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

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

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

M
Matthieu Castet 已提交
2104
    if (s->theora >= 0x030200)
2105
        matrices = get_bits(gb, 9) + 1;
M
Matthieu Castet 已提交
2106
    else
2107
        matrices = 3;
2108

2109 2110 2111 2112
    if(matrices > 384){
        av_log(avctx, AV_LOG_ERROR, "invalid number of base matrixes\n");
        return -1;
    }
A
Alex Beregszaszi 已提交
2113

2114
    for(n=0; n<matrices; n++){
2115
        for (i = 0; i < 64; i++)
2116 2117
            s->base_matrix[n][i]= get_bits(gb, 8);
    }
2118

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

                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;
2152
                }
2153

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

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

2177
    s->theora_tables = 1;
2178

2179 2180 2181
    return 0;
}

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

2191 2192 2193
    s->theora = 1;

    if (!avctx->extradata_size)
2194 2195
    {
        av_log(avctx, AV_LOG_ERROR, "Missing extradata!\n");
2196
        return -1;
2197
    }
2198

2199 2200 2201 2202 2203
    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;
    }
2204

2205
  for(i=0;i<3;i++) {
G
Google Chrome 已提交
2206
    init_get_bits(&gb, header_start[i], header_len[i] * 8);
2207 2208

    ptype = get_bits(&gb, 8);
2209

2210 2211 2212
     if (!(ptype & 0x80))
     {
        av_log(avctx, AV_LOG_ERROR, "Invalid extradata!\n");
2213
//        return -1;
2214
     }
2215

2216
    // FIXME: Check for this as well.
2217
    skip_bits_long(&gb, 6*8); /* "theora" */
2218

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

2242
    return vp3_decode_init(avctx);
2243 2244
}

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

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