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

/**
 * @file vp3.c
 * On2 VP3 Video Decoder
24 25 26 27 28 29
 *
 * VP3 Video Decoder by Mike Melanson (mike at multimedia.cx)
 * For more information about the VP3 coding process, visit:
 *   http://multimedia.cx/
 *
 * Theora decoder by Alex Beregszaszi
30 31 32 33 34 35 36 37 38 39 40 41
 */

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

#include "avcodec.h"
#include "dsputil.h"
#include "mpegvideo.h"

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

#define FRAGMENT_PIXELS 8

46
/*
47
 * Debugging Variables
48
 *
49 50 51
 * Define one or more of the following compile-time variables to 1 to obtain
 * elaborate information about certain aspects of the decoding process.
 *
52
 * KEYFRAMES_ONLY: set this to 1 to only see keyframes (VP3 slideshow mode)
53 54 55 56 57 58 59 60 61 62 63 64
 * DEBUG_VP3: high-level decoding flow
 * DEBUG_INIT: initialization parameters
 * DEBUG_DEQUANTIZERS: display how the dequanization tables are built
 * DEBUG_BLOCK_CODING: unpacking the superblock/macroblock/fragment coding
 * DEBUG_MODES: unpacking the coding modes for individual fragments
 * DEBUG_VECTORS: display the motion vectors
 * DEBUG_TOKEN: display exhaustive information about each DCT token
 * DEBUG_VLC: display the VLCs as they are extracted from the stream
 * DEBUG_DC_PRED: display the process of reversing DC prediction
 * DEBUG_IDCT: show every detail of the IDCT process
 */

65 66
#define KEYFRAMES_ONLY 0

A
Alex Beregszaszi 已提交
67
#define DEBUG_VP3 0
68 69 70 71 72 73 74 75 76 77 78
#define DEBUG_INIT 0
#define DEBUG_DEQUANTIZERS 0
#define DEBUG_BLOCK_CODING 0
#define DEBUG_MODES 0
#define DEBUG_VECTORS 0
#define DEBUG_TOKEN 0
#define DEBUG_VLC 0
#define DEBUG_DC_PRED 0
#define DEBUG_IDCT 0

#if DEBUG_VP3
A
Alex Beregszaszi 已提交
79
#define debug_vp3(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
80 81 82 83 84
#else
static inline void debug_vp3(const char *format, ...) { }
#endif

#if DEBUG_INIT
A
Alex Beregszaszi 已提交
85
#define debug_init(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
86 87 88 89 90
#else
static inline void debug_init(const char *format, ...) { }
#endif

#if DEBUG_DEQUANTIZERS
A
Alex Beregszaszi 已提交
91
#define debug_dequantizers(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
92
#else
93
static inline void debug_dequantizers(const char *format, ...) { }
94 95 96
#endif

#if DEBUG_BLOCK_CODING
A
Alex Beregszaszi 已提交
97
#define debug_block_coding(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
98
#else
99
static inline void debug_block_coding(const char *format, ...) { }
100 101 102
#endif

#if DEBUG_MODES
103
#define debug_modes(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
104
#else
105
static inline void debug_modes(const char *format, ...) { }
106 107 108
#endif

#if DEBUG_VECTORS
A
Alex Beregszaszi 已提交
109
#define debug_vectors(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
110
#else
111
static inline void debug_vectors(const char *format, ...) { }
112 113
#endif

114
#if DEBUG_TOKEN
A
Alex Beregszaszi 已提交
115
#define debug_token(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
116
#else
117
static inline void debug_token(const char *format, ...) { }
118 119 120
#endif

#if DEBUG_VLC
A
Alex Beregszaszi 已提交
121
#define debug_vlc(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
122
#else
123
static inline void debug_vlc(const char *format, ...) { }
124 125 126
#endif

#if DEBUG_DC_PRED
A
Alex Beregszaszi 已提交
127
#define debug_dc_pred(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
128
#else
129
static inline void debug_dc_pred(const char *format, ...) { }
130 131 132
#endif

#if DEBUG_IDCT
A
Alex Beregszaszi 已提交
133
#define debug_idct(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
134
#else
135
static inline void debug_idct(const char *format, ...) { }
136 137
#endif

138 139 140 141 142 143 144
typedef struct Coeff {
    struct Coeff *next;
    DCTELEM coeff;
    uint8_t index;
} Coeff;

//FIXME split things out into their own arrays
145
typedef struct Vp3Fragment {
146
    Coeff *next_coeff;
147 148 149 150
    /* address of first pixel taking into account which plane the fragment
     * lives on as well as the plane stride */
    int first_pixel;
    /* this is the macroblock that the fragment belongs to */
151 152 153 154 155
    uint16_t macroblock;
    uint8_t coding_method;
    uint8_t coeff_count;
    int8_t motion_x;
    int8_t motion_y;
156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181
} Vp3Fragment;

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

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

/* special internal mode */
#define MODE_COPY             8

/* There are 6 preset schemes, plus a free-form scheme */
static int ModeAlphabet[7][CODING_MODE_COUNT] =
{
    /* this is the custom scheme */
    { 0, 0, 0, 0, 0, 0, 0, 0 },

    /* scheme 1: Last motion vector dominates */
182
    {    MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
183
         MODE_INTER_PLUS_MV,    MODE_INTER_NO_MV,
184
         MODE_INTRA,            MODE_USING_GOLDEN,
185 186 187
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 2 */
188
    {    MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
189
         MODE_INTER_NO_MV,      MODE_INTER_PLUS_MV,
190
         MODE_INTRA,            MODE_USING_GOLDEN,
191 192 193
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 3 */
194
    {    MODE_INTER_LAST_MV,    MODE_INTER_PLUS_MV,
195
         MODE_INTER_PRIOR_LAST, MODE_INTER_NO_MV,
196
         MODE_INTRA,            MODE_USING_GOLDEN,
197 198 199
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 4 */
200
    {    MODE_INTER_LAST_MV,    MODE_INTER_PLUS_MV,
201
         MODE_INTER_NO_MV,      MODE_INTER_PRIOR_LAST,
202
         MODE_INTRA,            MODE_USING_GOLDEN,
203 204 205
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 5: No motion vector dominates */
206
    {    MODE_INTER_NO_MV,      MODE_INTER_LAST_MV,
207
         MODE_INTER_PRIOR_LAST, MODE_INTER_PLUS_MV,
208
         MODE_INTRA,            MODE_USING_GOLDEN,
209 210 211
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

    /* scheme 6 */
212
    {    MODE_INTER_NO_MV,      MODE_USING_GOLDEN,
213
         MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
214
         MODE_INTER_PLUS_MV,    MODE_INTRA,
215 216 217 218 219 220 221 222
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

};

#define MIN_DEQUANT_VAL 2

typedef struct Vp3DecodeContext {
    AVCodecContext *avctx;
223
    int theora, theora_tables;
A
Alex Beregszaszi 已提交
224
    int version;
225 226 227 228 229 230
    int width, height;
    AVFrame golden_frame;
    AVFrame last_frame;
    AVFrame current_frame;
    int keyframe;
    DSPContext dsp;
231
    int flipped_image;
232

233 234
    int qis[3];
    int nqis;
235 236 237 238 239 240
    int quality_index;
    int last_quality_index;

    int superblock_count;
    int superblock_width;
    int superblock_height;
241 242 243 244
    int y_superblock_width;
    int y_superblock_height;
    int c_superblock_width;
    int c_superblock_height;
245 246 247 248 249 250 251 252 253 254 255 256 257
    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;
258 259
    Coeff *coeffs;
    Coeff *next_coeff;
M
Michael Niedermayer 已提交
260
    int fragment_start[3];
261

M
Michael Niedermayer 已提交
262
    ScanTable scantable;
263

264 265
    /* tables */
    uint16_t coded_dc_scale_factor[64];
266
    uint32_t coded_ac_scale_factor[64];
267 268 269 270
    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];
271 272 273 274 275 276 277 278 279 280 281 282 283

    /* this is a list of indices into the all_fragments array indicating
     * which of the fragments are coded */
    int *coded_fragment_list;
    int coded_fragment_list_index;
    int pixel_addresses_inited;

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

284 285 286 287 288
    VLC superblock_run_length_vlc;
    VLC fragment_run_length_vlc;
    VLC mode_code_vlc;
    VLC motion_vector_vlc;

289 290
    /* these arrays need to be on 16-byte boundaries since SSE2 operations
     * index into them */
291
    DECLARE_ALIGNED_16(int16_t, qmat[2][4][64]);        //<qmat[is_inter][plane]
292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308

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

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

    /* This table contains macroblock_count * 6 entries. Each set of 6
     * numbers corresponds to the fragment indices 0..5 which comprise
     * the macroblock (4 Y fragments and 2 C fragments). */
    int *macroblock_fragments;
309
    /* This is an array that indicates how a particular macroblock
310
     * is coded. */
311
    unsigned char *macroblock_coding;
312

313 314 315 316 317
    int first_coded_y_fragment;
    int first_coded_c_fragment;
    int last_coded_y_fragment;
    int last_coded_c_fragment;

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

321 322 323 324 325 326 327 328 329
    /* Huffman decode */
    int hti;
    unsigned int hbits;
    int entries;
    int huff_code_size;
    uint16_t huffman_table[80][32][2];

    uint32_t filter_limit_values[64];
    int bounding_values_array[256];
330 331 332 333 334 335 336 337 338 339
} Vp3DecodeContext;

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

/*
 * This function sets up all of the various blocks mappings:
 * superblocks <-> fragments, macroblocks <-> fragments,
 * superblocks <-> macroblocks
340 341
 *
 * Returns 0 is successful; returns 1 if *anything* went wrong.
342
 */
343
static int init_block_mapping(Vp3DecodeContext *s)
344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360
{
    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 *hilbert = NULL;
    int mapping_index = 0;

    int current_macroblock;
    int c_fragment;

    signed char travel_width[16] = {
361
         1,  1,  0, -1,
362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399
         0,  0,  1,  0,
         1,  0,  1,  0,
         0, -1,  0,  1
    };

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

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

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

    debug_vp3("  vp3: initialize block mapping tables\n");

    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++) {
        debug_init("    superblock %d (u starts @ %d, v starts @ %d)\n",
            i, s->u_superblock_start, s->v_superblock_start);

        /* time to re-assign the limits? */
        if (i == 0) {

            /* start of Y superblocks */
            right_edge = s->fragment_width;
            bottom_edge = s->fragment_height;
400
            current_width = -1;
401
            current_height = 0;
402
            superblock_row_inc = 3 * s->fragment_width -
403
                (s->y_superblock_width * 4 - s->fragment_width);
404 405 406 407 408 409 410 411 412

            /* 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;
413
            current_width = -1;
414
            current_height = 0;
415
            superblock_row_inc = 3 * (s->fragment_width / 2) -
416
                (s->c_superblock_width * 4 - s->fragment_width / 2);
417 418

            /* the first operation for this variable is to advance by 1 */
M
Michael Niedermayer 已提交
419
            current_fragment = s->fragment_start[1] - 1;
420 421 422 423 424 425

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

            /* start of V superblocks */
            right_edge = s->fragment_width / 2;
            bottom_edge = s->fragment_height / 2;
426
            current_width = -1;
427
            current_height = 0;
428
            superblock_row_inc = 3 * (s->fragment_width / 2) -
429
                (s->c_superblock_width * 4 - s->fragment_width / 2);
430 431

            /* the first operation for this variable is to advance by 1 */
M
Michael Niedermayer 已提交
432
            current_fragment = s->fragment_start[2] - 1;
433 434 435

        }

436
        if (current_width >= right_edge - 1) {
437
            /* reset width and move to next superblock row */
438
            current_width = -1;
439 440 441 442 443 444 445 446
            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 已提交
447
            current_fragment += travel_width[j] + right_edge * travel_height[j];
448
            current_width += travel_width[j];
449 450 451
            current_height += travel_height[j];

            /* check if the fragment is in bounds */
452
            if ((current_width < right_edge) &&
453 454
                (current_height < bottom_edge)) {
                s->superblock_fragments[mapping_index] = current_fragment;
455
                debug_init("    mapping fragment %d to superblock %d, position %d (%d/%d x %d/%d)\n",
456 457
                    s->superblock_fragments[mapping_index], i, j,
                    current_width, right_edge, current_height, bottom_edge);
458 459
            } else {
                s->superblock_fragments[mapping_index] = -1;
460
                debug_init("    superblock %d, position %d has no fragment (%d/%d x %d/%d)\n",
461 462
                    i, j,
                    current_width, right_edge, current_height, bottom_edge);
463 464 465 466 467 468 469 470 471 472
            }

            mapping_index++;
        }
    }

    /* initialize the superblock <-> macroblock mapping; iterate through
     * all of the Y plane superblocks to build this mapping */
    right_edge = s->macroblock_width;
    bottom_edge = s->macroblock_height;
473
    current_width = -1;
474
    current_height = 0;
475 476
    superblock_row_inc = s->macroblock_width -
        (s->y_superblock_width * 2 - s->macroblock_width);;
477 478 479 480 481
    hilbert = hilbert_walk_mb;
    mapping_index = 0;
    current_macroblock = -1;
    for (i = 0; i < s->u_superblock_start; i++) {

482
        if (current_width >= right_edge - 1) {
483
            /* reset width and move to next superblock row */
484
            current_width = -1;
485 486 487 488 489 490 491 492 493
            current_height += 2;

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

        /* iterate through each potential macroblock in the superblock */
        for (j = 0; j < 4; j++) {
            current_macroblock += hilbert_walk_mb[j];
494
            current_width += travel_width_mb[j];
495 496 497
            current_height += travel_height_mb[j];

            /* check if the macroblock is in bounds */
498
            if ((current_width < right_edge) &&
499 500
                (current_height < bottom_edge)) {
                s->superblock_macroblocks[mapping_index] = current_macroblock;
501 502 503
                debug_init("    mapping macroblock %d to superblock %d, position %d (%d/%d x %d/%d)\n",
                    s->superblock_macroblocks[mapping_index], i, j,
                    current_width, right_edge, current_height, bottom_edge);
504 505
            } else {
                s->superblock_macroblocks[mapping_index] = -1;
506 507 508
                debug_init("    superblock %d, position %d has no macroblock (%d/%d x %d/%d)\n",
                    i, j,
                    current_width, right_edge, current_height, bottom_edge);
509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535
            }

            mapping_index++;
        }
    }

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

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

            debug_init("    macroblock %d contains fragments: ", current_macroblock);
            s->all_fragments[current_fragment].macroblock = current_macroblock;
            s->macroblock_fragments[mapping_index++] = current_fragment;
            debug_init("%d ", current_fragment);

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

            if (i + 1 < s->fragment_height) {
536
                s->all_fragments[current_fragment + s->fragment_width].macroblock =
537
                    current_macroblock;
538
                s->macroblock_fragments[mapping_index++] =
539 540 541 542 543 544
                    current_fragment + s->fragment_width;
                debug_init("%d ", current_fragment + s->fragment_width);
            } else
                s->macroblock_fragments[mapping_index++] = -1;

            if ((j + 1 < s->fragment_width) && (i + 1 < s->fragment_height)) {
545
                s->all_fragments[current_fragment + s->fragment_width + 1].macroblock =
546
                    current_macroblock;
547
                s->macroblock_fragments[mapping_index++] =
548 549 550 551 552 553
                    current_fragment + s->fragment_width + 1;
                debug_init("%d ", current_fragment + s->fragment_width + 1);
            } else
                s->macroblock_fragments[mapping_index++] = -1;

            /* C planes */
M
Michael Niedermayer 已提交
554
            c_fragment = s->fragment_start[1] +
555
                (i * s->fragment_width / 4) + (j / 2);
556
            s->all_fragments[c_fragment].macroblock = s->macroblock_count;
557 558 559
            s->macroblock_fragments[mapping_index++] = c_fragment;
            debug_init("%d ", c_fragment);

M
Michael Niedermayer 已提交
560
            c_fragment = s->fragment_start[2] +
561
                (i * s->fragment_width / 4) + (j / 2);
562
            s->all_fragments[c_fragment].macroblock = s->macroblock_count;
563 564 565 566 567 568 569
            s->macroblock_fragments[mapping_index++] = c_fragment;
            debug_init("%d ", c_fragment);

            debug_init("\n");

            if (j + 2 <= s->fragment_width)
                current_fragment += 2;
570
            else
571 572 573 574 575 576
                current_fragment++;
            current_macroblock++;
        }

        current_fragment += s->fragment_width;
    }
577 578

    return 0;  /* successful path out */
579 580 581 582 583 584 585 586 587 588 589 590 591
}

/*
 * 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++) {
        s->all_fragments[i].coeff_count = 0;
592 593 594
        s->all_fragments[i].motion_x = 127;
        s->all_fragments[i].motion_y = 127;
        s->all_fragments[i].next_coeff= NULL;
595 596 597
        s->coeffs[i].index=
        s->coeffs[i].coeff=0;
        s->coeffs[i].next= NULL;
598 599 600 601
    }
}

/*
602
 * This function sets up the dequantization tables used for a particular
603 604 605 606
 * frame.
 */
static void init_dequantizer(Vp3DecodeContext *s)
{
607
    int ac_scale_factor = s->coded_ac_scale_factor[s->quality_index];
608
    int dc_scale_factor = s->coded_dc_scale_factor[s->quality_index];
609
    int i, plane, inter, qri, bmi, bmj, qistart;
610 611 612

    debug_vp3("  vp3: initializing dequantization tables\n");

613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629
    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];
                if(s->quality_index <= sum)
                    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++){
                int coeff= (  2*(sum    -s->quality_index)*s->base_matrix[bmi][i]
                            - 2*(qistart-s->quality_index)*s->base_matrix[bmj][i]
                            + s->qr_size[inter][plane][qri])
                           / (2*s->qr_size[inter][plane][qri]);

M
Michael Niedermayer 已提交
630
                int qmin= 8<<(inter + !i);
631 632
                int qscale= i ? ac_scale_factor : dc_scale_factor;

633
                s->qmat[inter][plane][i]= av_clip((qscale * coeff)/100 * 4, qmin, 4096);
634 635
            }
        }
636
    }
637

638
    memset(s->qscale_table, (FFMAX(s->qmat[0][0][1], s->qmat[0][1][1])+8)/16, 512); //FIXME finetune
639 640
}

641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662
/*
 * This function initializes the loop filter boundary limits if the frame's
 * quality index is different from the previous frame's.
 */
static void init_loop_filter(Vp3DecodeContext *s)
{
    int *bounding_values= s->bounding_values_array+127;
    int filter_limit;
    int x;

    filter_limit = s->filter_limit_values[s->quality_index];

    /* set up the bounding values */
    memset(s->bounding_values_array, 0, 256 * sizeof(int));
    for (x = 0; x < filter_limit; x++) {
        bounding_values[-x - filter_limit] = -filter_limit + x;
        bounding_values[-x] = -x;
        bounding_values[x] = x;
        bounding_values[x + filter_limit] = filter_limit - x;
    }
}

663
/*
664
 * This function unpacks all of the superblock/macroblock/fragment coding
665 666
 * information from the bitstream.
 */
667
static int unpack_superblocks(Vp3DecodeContext *s, GetBitContext *gb)
668 669 670 671 672 673
{
    int bit = 0;
    int current_superblock = 0;
    int current_run = 0;
    int decode_fully_flags = 0;
    int decode_partial_blocks = 0;
674
    int first_c_fragment_seen;
675 676 677 678 679 680 681 682 683 684 685 686 687 688

    int i, j;
    int current_fragment;

    debug_vp3("  vp3: unpacking superblock coding\n");

    if (s->keyframe) {

        debug_vp3("    keyframe-- all superblocks are fully coded\n");
        memset(s->superblock_coding, SB_FULLY_CODED, s->superblock_count);

    } else {

        /* unpack the list of partially-coded superblocks */
689
        bit = get_bits1(gb);
690
        /* toggle the bit because as soon as the first run length is
691 692 693
         * fetched the bit will be toggled again */
        bit ^= 1;
        while (current_superblock < s->superblock_count) {
694
            if (current_run-- == 0) {
695
                bit ^= 1;
696
                current_run = get_vlc2(gb,
697 698
                    s->superblock_run_length_vlc.table, 6, 2);
                if (current_run == 33)
699
                    current_run += get_bits(gb, 12);
700 701 702 703 704 705 706
                debug_block_coding("      setting superblocks %d..%d to %s\n",
                    current_superblock,
                    current_superblock + current_run - 1,
                    (bit) ? "partially coded" : "not coded");

                /* if any of the superblocks are not partially coded, flag
                 * a boolean to decode the list of fully-coded superblocks */
707
                if (bit == 0) {
708
                    decode_fully_flags = 1;
709
                } else {
710

711 712 713 714
                    /* make a note of the fact that there are partially coded
                     * superblocks */
                    decode_partial_blocks = 1;
                }
715
            }
716
            s->superblock_coding[current_superblock++] = bit;
717 718 719 720 721 722 723 724
        }

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

            current_superblock = 0;
            current_run = 0;
725
            bit = get_bits1(gb);
726
            /* toggle the bit because as soon as the first run length is
727 728 729 730 731 732 733
             * fetched the bit will be toggled again */
            bit ^= 1;
            while (current_superblock < s->superblock_count) {

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

734
                    if (current_run-- == 0) {
735
                        bit ^= 1;
736
                        current_run = get_vlc2(gb,
737 738
                            s->superblock_run_length_vlc.table, 6, 2);
                        if (current_run == 33)
739
                            current_run += get_bits(gb, 12);
740 741 742 743 744
                    }

                    debug_block_coding("      setting superblock %d to %s\n",
                        current_superblock,
                        (bit) ? "fully coded" : "not coded");
745
                    s->superblock_coding[current_superblock] = 2*bit;
746 747 748 749 750 751 752 753 754 755
                }
                current_superblock++;
            }
        }

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

            current_run = 0;
756
            bit = get_bits1(gb);
757
            /* toggle the bit because as soon as the first run length is
758 759 760 761 762 763 764 765
             * 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;
766
    s->next_coeff= s->coeffs + s->fragment_count;
767 768
    s->first_coded_y_fragment = s->first_coded_c_fragment = 0;
    s->last_coded_y_fragment = s->last_coded_c_fragment = -1;
769
    first_c_fragment_seen = 0;
770
    memset(s->macroblock_coding, MODE_COPY, s->macroblock_count);
771 772 773 774 775 776 777
    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];
778
            if (current_fragment >= s->fragment_count) {
779
                av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_superblocks(): bad fragment number (%d >= %d)\n",
780 781 782
                    current_fragment, s->fragment_count);
                return 1;
            }
783 784 785 786
            if (current_fragment != -1) {
                if (s->superblock_coding[i] == SB_NOT_CODED) {

                    /* copy all the fragments from the prior frame */
787
                    s->all_fragments[current_fragment].coding_method =
788 789 790 791 792 793
                        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 */
794
                    if (current_run-- == 0) {
795
                        bit ^= 1;
796
                        current_run = get_vlc2(gb,
797
                            s->fragment_run_length_vlc.table, 5, 2);
798 799 800
                    }

                    if (bit) {
801
                        /* default mode; actual mode will be decoded in
802
                         * the next phase */
803
                        s->all_fragments[current_fragment].coding_method =
804
                            MODE_INTER_NO_MV;
805
                        s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
806
                        s->coded_fragment_list[s->coded_fragment_list_index] =
807
                            current_fragment;
M
Michael Niedermayer 已提交
808
                        if ((current_fragment >= s->fragment_start[1]) &&
809 810
                            (s->last_coded_y_fragment == -1) &&
                            (!first_c_fragment_seen)) {
811 812
                            s->first_coded_c_fragment = s->coded_fragment_list_index;
                            s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
813
                            first_c_fragment_seen = 1;
814 815
                        }
                        s->coded_fragment_list_index++;
816
                        s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
817 818 819 820 821 822 823 824 825 826 827 828 829 830
                        debug_block_coding("      superblock %d is partially coded, fragment %d is coded\n",
                            i, current_fragment);
                    } else {
                        /* not coded; copy this fragment from the prior frame */
                        s->all_fragments[current_fragment].coding_method =
                            MODE_COPY;
                        debug_block_coding("      superblock %d is partially coded, fragment %d is not coded\n",
                            i, current_fragment);
                    }

                } else {

                    /* fragments are fully coded in this superblock; actual
                     * coding will be determined in next step */
831
                    s->all_fragments[current_fragment].coding_method =
832
                        MODE_INTER_NO_MV;
833
                    s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
834
                    s->coded_fragment_list[s->coded_fragment_list_index] =
835
                        current_fragment;
M
Michael Niedermayer 已提交
836
                    if ((current_fragment >= s->fragment_start[1]) &&
837 838
                        (s->last_coded_y_fragment == -1) &&
                        (!first_c_fragment_seen)) {
839 840
                        s->first_coded_c_fragment = s->coded_fragment_list_index;
                        s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
841
                        first_c_fragment_seen = 1;
842 843
                    }
                    s->coded_fragment_list_index++;
844
                    s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
845 846 847 848 849 850
                    debug_block_coding("      superblock %d is fully coded, fragment %d is coded\n",
                        i, current_fragment);
                }
            }
        }
    }
851

852 853
    if (!first_c_fragment_seen)
        /* only Y fragments coded in this frame */
854
        s->last_coded_y_fragment = s->coded_fragment_list_index - 1;
855
    else
856
        /* end the list of coded C fragments */
857
        s->last_coded_c_fragment = s->coded_fragment_list_index - 1;
858

859 860 861 862 863 864
    debug_block_coding("    %d total coded fragments, y: %d -> %d, c: %d -> %d\n",
        s->coded_fragment_list_index,
        s->first_coded_y_fragment,
        s->last_coded_y_fragment,
        s->first_coded_c_fragment,
        s->last_coded_c_fragment);
865 866

    return 0;
867 868 869 870 871 872
}

/*
 * This function unpacks all the coding mode data for individual macroblocks
 * from the bitstream.
 */
873
static int unpack_modes(Vp3DecodeContext *s, GetBitContext *gb)
874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898
{
    int i, j, k;
    int scheme;
    int current_macroblock;
    int current_fragment;
    int coding_mode;

    debug_vp3("  vp3: unpacking encoding modes\n");

    if (s->keyframe) {
        debug_vp3("    keyframe-- all blocks are coded as INTRA\n");

        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);
        debug_modes("    using mode alphabet %d\n", scheme);

        /* is it a custom coding scheme? */
        if (scheme == 0) {
            debug_modes("    custom mode alphabet ahead:\n");
            for (i = 0; i < 8; i++)
899
                ModeAlphabet[scheme][get_bits(gb, 3)] = i;
900 901 902
        }

        for (i = 0; i < 8; i++)
903
            debug_modes("      mode[%d][%d] = %d\n", scheme, i,
904 905 906 907 908 909 910 911 912
                ModeAlphabet[scheme][i]);

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

            for (j = 0; j < 4; j++) {
                current_macroblock = s->superblock_macroblocks[i * 4 + j];
                if ((current_macroblock == -1) ||
913
                    (s->macroblock_coding[current_macroblock] == MODE_COPY))
914
                    continue;
915
                if (current_macroblock >= s->macroblock_count) {
916
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_modes(): bad macroblock number (%d >= %d)\n",
917 918 919
                        current_macroblock, s->macroblock_count);
                    return 1;
                }
920 921 922 923 924

                /* mode 7 means get 3 bits for each coding mode */
                if (scheme == 7)
                    coding_mode = get_bits(gb, 3);
                else
925 926
                    coding_mode = ModeAlphabet[scheme]
                        [get_vlc2(gb, s->mode_code_vlc.table, 3, 3)];
927

928
                s->macroblock_coding[current_macroblock] = coding_mode;
929
                for (k = 0; k < 6; k++) {
930
                    current_fragment =
931
                        s->macroblock_fragments[current_macroblock * 6 + k];
932 933 934
                    if (current_fragment == -1)
                        continue;
                    if (current_fragment >= s->fragment_count) {
935
                        av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_modes(): bad fragment number (%d >= %d)\n",
936 937 938
                            current_fragment, s->fragment_count);
                        return 1;
                    }
939
                    if (s->all_fragments[current_fragment].coding_method !=
940 941 942 943 944 945 946 947 948 949
                        MODE_COPY)
                        s->all_fragments[current_fragment].coding_method =
                            coding_mode;
                }

                debug_modes("    coding method for macroblock starting @ fragment %d = %d\n",
                    s->macroblock_fragments[current_macroblock * 6], coding_mode);
            }
        }
    }
950 951

    return 0;
952 953
}

954 955 956 957
/*
 * This function unpacks all the motion vectors for the individual
 * macroblocks from the bitstream.
 */
958
static int unpack_vectors(Vp3DecodeContext *s, GetBitContext *gb)
959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981
{
    int i, j, k;
    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;

    debug_vp3("  vp3: unpacking motion vectors\n");
    if (s->keyframe) {

        debug_vp3("    keyframe-- there are no motion vectors\n");

    } else {

        memset(motion_x, 0, 6 * sizeof(int));
        memset(motion_y, 0, 6 * sizeof(int));

        /* coding mode 0 is the VLC scheme; 1 is the fixed code scheme */
982
        coding_mode = get_bits1(gb);
983 984 985 986 987 988 989 990 991 992
        debug_vectors("    using %s scheme for unpacking motion vectors\n",
            (coding_mode == 0) ? "VLC" : "fixed-length");

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

            for (j = 0; j < 4; j++) {
                current_macroblock = s->superblock_macroblocks[i * 4 + j];
                if ((current_macroblock == -1) ||
993
                    (s->macroblock_coding[current_macroblock] == MODE_COPY))
994
                    continue;
995
                if (current_macroblock >= s->macroblock_count) {
996
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad macroblock number (%d >= %d)\n",
997 998 999
                        current_macroblock, s->macroblock_count);
                    return 1;
                }
1000 1001

                current_fragment = s->macroblock_fragments[current_macroblock * 6];
1002
                if (current_fragment >= s->fragment_count) {
1003
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad fragment number (%d >= %d\n",
1004 1005 1006
                        current_fragment, s->fragment_count);
                    return 1;
                }
1007
                switch (s->macroblock_coding[current_macroblock]) {
1008 1009 1010 1011 1012

                case MODE_INTER_PLUS_MV:
                case MODE_GOLDEN_MV:
                    /* all 6 fragments use the same motion vector */
                    if (coding_mode == 0) {
1013 1014
                        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)];
1015
                    } else {
1016 1017
                        motion_x[0] = fixed_motion_vector_table[get_bits(gb, 6)];
                        motion_y[0] = fixed_motion_vector_table[get_bits(gb, 6)];
1018
                    }
1019

1020 1021 1022 1023 1024 1025
                    for (k = 1; k < 6; k++) {
                        motion_x[k] = motion_x[0];
                        motion_y[k] = motion_y[0];
                    }

                    /* vector maintenance, only on MODE_INTER_PLUS_MV */
1026
                    if (s->macroblock_coding[current_macroblock] ==
1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040
                        MODE_INTER_PLUS_MV) {
                        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;

                case MODE_INTER_FOURMV:
                    /* 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++) {
                        if (coding_mode == 0) {
1041 1042
                            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)];
1043
                        } else {
1044 1045
                            motion_x[k] = fixed_motion_vector_table[get_bits(gb, 6)];
                            motion_y[k] = fixed_motion_vector_table[get_bits(gb, 6)];
1046 1047 1048 1049 1050
                        }
                        motion_x[4] += motion_x[k];
                        motion_y[4] += motion_y[k];
                    }

M
Michael Niedermayer 已提交
1051 1052 1053 1054
                    motion_x[5]=
                    motion_x[4]= RSHIFT(motion_x[4], 2);
                    motion_y[5]=
                    motion_y[4]= RSHIFT(motion_y[4], 2);
1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092

                    /* vector maintenance; vector[3] is treated as the
                     * last vector in this case */
                    prior_last_motion_x = last_motion_x;
                    prior_last_motion_y = last_motion_y;
                    last_motion_x = motion_x[3];
                    last_motion_y = motion_y[3];
                    break;

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

                    /* no vector maintenance (last vector remains the
                     * last vector) */
                    break;

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

                    /* 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;
1093 1094 1095 1096 1097 1098 1099 1100

                default:
                    /* covers intra, inter without MV, golden without MV */
                    memset(motion_x, 0, 6 * sizeof(int));
                    memset(motion_y, 0, 6 * sizeof(int));

                    /* no vector maintenance */
                    break;
1101 1102 1103 1104 1105
                }

                /* assign the motion vectors to the correct fragments */
                debug_vectors("    vectors for macroblock starting @ fragment %d (coding method %d):\n",
                    current_fragment,
1106
                    s->macroblock_coding[current_macroblock]);
1107
                for (k = 0; k < 6; k++) {
1108
                    current_fragment =
1109
                        s->macroblock_fragments[current_macroblock * 6 + k];
1110 1111 1112
                    if (current_fragment == -1)
                        continue;
                    if (current_fragment >= s->fragment_count) {
1113
                        av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad fragment number (%d >= %d)\n",
1114 1115 1116
                            current_fragment, s->fragment_count);
                        return 1;
                    }
1117
                    s->all_fragments[current_fragment].motion_x = motion_x[k];
1118
                    s->all_fragments[current_fragment].motion_y = motion_y[k];
1119 1120
                    debug_vectors("    vector %d: fragment %d = (%d, %d)\n",
                        k, current_fragment, motion_x[k], motion_y[k]);
1121 1122 1123 1124
                }
            }
        }
    }
1125 1126

    return 0;
1127 1128
}

1129
/*
1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147
 * This function is called by unpack_dct_coeffs() to extract the VLCs from
 * the bitstream. The VLCs encode tokens which are used to unpack DCT
 * data. This function unpacks all the VLCs for either the Y plane or both
 * C planes, and is called for DC coefficients or different AC coefficient
 * levels (since different coefficient types require different VLC tables.
 *
 * This function returns a residual eob run. E.g, if a particular token gave
 * instructions to EOB the next 5 fragments and there were only 2 fragments
 * left in the current fragment range, 3 would be returned so that it could
 * be passed into the next call to this same function.
 */
static int unpack_vlcs(Vp3DecodeContext *s, GetBitContext *gb,
                        VLC *table, int coeff_index,
                        int first_fragment, int last_fragment,
                        int eob_run)
{
    int i;
    int token;
1148 1149
    int zero_run = 0;
    DCTELEM coeff = 0;
1150
    Vp3Fragment *fragment;
M
Michael Niedermayer 已提交
1151
    uint8_t *perm= s->scantable.permutated;
1152
    int bits_to_get;
1153

1154
    if ((first_fragment >= s->fragment_count) ||
1155 1156
        (last_fragment >= s->fragment_count)) {

1157
        av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vlcs(): bad fragment number (%d -> %d ?)\n",
1158
            first_fragment, last_fragment);
1159
        return 0;
1160 1161
    }

1162
    for (i = first_fragment; i <= last_fragment; i++) {
1163 1164 1165 1166 1167 1168 1169 1170 1171 1172

        fragment = &s->all_fragments[s->coded_fragment_list[i]];
        if (fragment->coeff_count > coeff_index)
            continue;

        if (!eob_run) {
            /* decode a VLC into a token */
            token = get_vlc2(gb, table->table, 5, 3);
            debug_vlc(" token = %2d, ", token);
            /* use the token to get a zero run, a coefficient, and an eob run */
1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188
            if (token <= 6) {
                eob_run = eob_run_base[token];
                if (eob_run_get_bits[token])
                    eob_run += get_bits(gb, eob_run_get_bits[token]);
                coeff = zero_run = 0;
            } else {
                bits_to_get = coeff_get_bits[token];
                if (!bits_to_get)
                    coeff = coeff_tables[token][0];
                else
                    coeff = coeff_tables[token][get_bits(gb, bits_to_get)];

                zero_run = zero_run_base[token];
                if (zero_run_get_bits[token])
                    zero_run += get_bits(gb, zero_run_get_bits[token]);
            }
1189 1190 1191 1192
        }

        if (!eob_run) {
            fragment->coeff_count += zero_run;
1193 1194 1195 1196 1197 1198 1199
            if (fragment->coeff_count < 64){
                fragment->next_coeff->coeff= coeff;
                fragment->next_coeff->index= perm[fragment->coeff_count++]; //FIXME perm here already?
                fragment->next_coeff->next= s->next_coeff;
                s->next_coeff->next=NULL;
                fragment->next_coeff= s->next_coeff++;
            }
1200
            debug_vlc(" fragment %d coeff = %d\n",
1201
                s->coded_fragment_list[i], fragment->next_coeff[coeff_index]);
1202
        } else {
1203
            fragment->coeff_count |= 128;
1204
            debug_vlc(" fragment %d eob with %d coefficients\n",
1205
                s->coded_fragment_list[i], fragment->coeff_count&127);
1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216
            eob_run--;
        }
    }

    return eob_run;
}

/*
 * This function unpacks all of the DCT coefficient data from the
 * bitstream.
 */
1217
static int unpack_dct_coeffs(Vp3DecodeContext *s, GetBitContext *gb)
1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232
{
    int i;
    int dc_y_table;
    int dc_c_table;
    int ac_y_table;
    int ac_c_table;
    int residual_eob_run = 0;

    /* fetch the DC table indices */
    dc_y_table = get_bits(gb, 4);
    dc_c_table = get_bits(gb, 4);

    /* unpack the Y plane DC coefficients */
    debug_vp3("  vp3: unpacking Y plane DC coefficients using table %d\n",
        dc_y_table);
1233
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_y_table], 0,
1234
        s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1235 1236 1237 1238 1239

    /* unpack the C plane DC coefficients */
    debug_vp3("  vp3: unpacking C plane DC coefficients using table %d\n",
        dc_c_table);
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_c_table], 0,
1240
        s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1241

1242
    /* fetch the AC table indices */
1243 1244 1245
    ac_y_table = get_bits(gb, 4);
    ac_c_table = get_bits(gb, 4);

1246
    /* unpack the group 1 AC coefficients (coeffs 1-5) */
1247 1248 1249 1250
    for (i = 1; i <= 5; i++) {

        debug_vp3("  vp3: unpacking level %d Y plane AC coefficients using table %d\n",
            i, ac_y_table);
1251
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_y_table], i,
1252
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1253 1254 1255

        debug_vp3("  vp3: unpacking level %d C plane AC coefficients using table %d\n",
            i, ac_c_table);
1256
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_c_table], i,
1257
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1258 1259
    }

1260
    /* unpack the group 2 AC coefficients (coeffs 6-14) */
1261 1262 1263 1264
    for (i = 6; i <= 14; i++) {

        debug_vp3("  vp3: unpacking level %d Y plane AC coefficients using table %d\n",
            i, ac_y_table);
1265
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_y_table], i,
1266
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1267 1268 1269

        debug_vp3("  vp3: unpacking level %d C plane AC coefficients using table %d\n",
            i, ac_c_table);
1270
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_c_table], i,
1271
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1272 1273
    }

1274
    /* unpack the group 3 AC coefficients (coeffs 15-27) */
1275 1276 1277 1278
    for (i = 15; i <= 27; i++) {

        debug_vp3("  vp3: unpacking level %d Y plane AC coefficients using table %d\n",
            i, ac_y_table);
1279
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_y_table], i,
1280
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1281 1282 1283

        debug_vp3("  vp3: unpacking level %d C plane AC coefficients using table %d\n",
            i, ac_c_table);
1284
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_c_table], i,
1285
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1286 1287
    }

1288
    /* unpack the group 4 AC coefficients (coeffs 28-63) */
1289 1290 1291 1292
    for (i = 28; i <= 63; i++) {

        debug_vp3("  vp3: unpacking level %d Y plane AC coefficients using table %d\n",
            i, ac_y_table);
1293
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_y_table], i,
1294
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1295 1296 1297

        debug_vp3("  vp3: unpacking level %d C plane AC coefficients using table %d\n",
            i, ac_c_table);
1298
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_c_table], i,
1299
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1300
    }
1301 1302

    return 0;
1303 1304 1305 1306
}

/*
 * This function reverses the DC prediction for each coded fragment in
1307
 * the frame. Much of this function is adapted directly from the original
1308 1309 1310 1311 1312
 * VP3 source code.
 */
#define COMPATIBLE_FRAME(x) \
  (compatible_frame[s->all_fragments[x].coding_method] == current_frame_type)
#define FRAME_CODED(x) (s->all_fragments[x].coding_method != MODE_COPY)
1313
#define DC_COEFF(u) (s->coeffs[u].index ? 0 : s->coeffs[u].coeff) //FIXME do somethin to simplify this
1314 1315 1316 1317

static void reverse_dc_prediction(Vp3DecodeContext *s,
                                  int first_fragment,
                                  int fragment_width,
1318
                                  int fragment_height)
1319 1320 1321 1322 1323 1324 1325 1326 1327 1328
{

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

    int x, y;
    int i = first_fragment;

1329
    int predicted_dc;
1330 1331 1332 1333 1334 1335 1336

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

    /* indices for the left, up-left, up, and up-right fragments */
    int l, ul, u, ur;

1337
    /*
1338 1339 1340 1341 1342 1343
     * The 6 fields mean:
     *   0: up-left multiplier
     *   1: up multiplier
     *   2: up-right multiplier
     *   3: left multiplier
     */
M
Michael Niedermayer 已提交
1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360
    int predictor_transform[16][4] = {
        {  0,  0,  0,  0},
        {  0,  0,  0,128},        // PL
        {  0,  0,128,  0},        // PUR
        {  0,  0, 53, 75},        // PUR|PL
        {  0,128,  0,  0},        // PU
        {  0, 64,  0, 64},        // PU|PL
        {  0,128,  0,  0},        // PU|PUR
        {  0,  0, 53, 75},        // PU|PUR|PL
        {128,  0,  0,  0},        // PUL
        {  0,  0,  0,128},        // PUL|PL
        { 64,  0, 64,  0},        // PUL|PUR
        {  0,  0, 53, 75},        // PUL|PUR|PL
        {  0,128,  0,  0},        // PUL|PU
       {-104,116,  0,116},        // PUL|PU|PL
        { 24, 80, 24,  0},        // PUL|PU|PUR
       {-104,116,  0,116}         // PUL|PU|PUR|PL
1361 1362 1363 1364 1365
    };

    /* 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
1366
     * from other INTRA blocks. There are 2 golden frame coding types;
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 1398 1399
     * blocks encoding in these modes can only predict from other blocks
     * that were encoded with these 1 of these 2 modes. */
    unsigned char compatible_frame[8] = {
        1,    /* MODE_INTER_NO_MV */
        0,    /* MODE_INTRA */
        1,    /* MODE_INTER_PLUS_MV */
        1,    /* MODE_INTER_LAST_MV */
        1,    /* MODE_INTER_PRIOR_MV */
        2,    /* MODE_USING_GOLDEN */
        2,    /* MODE_GOLDEN_MV */
        1     /* MODE_INTER_FOUR_MV */
    };
    int current_frame_type;

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

    int transform = 0;

    debug_vp3("  vp3: reversing DC prediction\n");

    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) {

1400
                current_frame_type =
1401
                    compatible_frame[s->all_fragments[i].coding_method];
M
Michael Niedermayer 已提交
1402 1403
                debug_dc_pred(" frag %d: orig DC = %d, ",
                    i, DC_COEFF(i));
1404

M
Michael Niedermayer 已提交
1405 1406 1407
                transform= 0;
                if(x){
                    l= i-1;
1408
                    vl = DC_COEFF(l);
M
Michael Niedermayer 已提交
1409 1410
                    if(FRAME_CODED(l) && COMPATIBLE_FRAME(l))
                        transform |= PL;
M
Michael Niedermayer 已提交
1411 1412 1413
                }
                if(y){
                    u= i-fragment_width;
1414
                    vu = DC_COEFF(u);
M
Michael Niedermayer 已提交
1415 1416
                    if(FRAME_CODED(u) && COMPATIBLE_FRAME(u))
                        transform |= PU;
M
Michael Niedermayer 已提交
1417 1418 1419
                    if(x){
                        ul= i-fragment_width-1;
                        vul = DC_COEFF(ul);
M
Michael Niedermayer 已提交
1420 1421
                        if(FRAME_CODED(ul) && COMPATIBLE_FRAME(ul))
                            transform |= PUL;
M
Michael Niedermayer 已提交
1422 1423 1424 1425
                    }
                    if(x + 1 < fragment_width){
                        ur= i-fragment_width+1;
                        vur = DC_COEFF(ur);
M
Michael Niedermayer 已提交
1426 1427
                        if(FRAME_CODED(ur) && COMPATIBLE_FRAME(ur))
                            transform |= PUR;
M
Michael Niedermayer 已提交
1428
                    }
1429 1430 1431 1432 1433 1434 1435 1436
                }

                debug_dc_pred("transform = %d, ", transform);

                if (transform == 0) {

                    /* if there were no fragments to predict from, use last
                     * DC saved */
1437
                    predicted_dc = last_dc[current_frame_type];
1438
                    debug_dc_pred("from last DC (%d) = %d\n",
1439
                        current_frame_type, DC_COEFF(i));
1440 1441 1442 1443 1444 1445 1446 1447 1448 1449

                } 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 已提交
1450
                    predicted_dc /= 128;
1451 1452 1453 1454

                    /* check for outranging on the [ul u l] and
                     * [ul u ur l] predictors */
                    if ((transform == 13) || (transform == 15)) {
D
Diego Biurrun 已提交
1455
                        if (FFABS(predicted_dc - vu) > 128)
1456
                            predicted_dc = vu;
D
Diego Biurrun 已提交
1457
                        else if (FFABS(predicted_dc - vl) > 128)
1458
                            predicted_dc = vl;
D
Diego Biurrun 已提交
1459
                        else if (FFABS(predicted_dc - vul) > 128)
1460 1461 1462
                            predicted_dc = vul;
                    }

1463
                    debug_dc_pred("from pred DC = %d\n",
1464
                    DC_COEFF(i));
1465 1466
                }

1467 1468 1469 1470 1471 1472 1473 1474
                /* 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;
1475
                /* save the DC */
1476 1477 1478 1479 1480 1481 1482
                last_dc[current_frame_type] = DC_COEFF(i);
                if(DC_COEFF(i) && !(s->all_fragments[i].coeff_count&127)){
                    s->all_fragments[i].coeff_count= 129;
//                    s->all_fragments[i].next_coeff= s->next_coeff;
                    s->coeffs[i].next= s->next_coeff;
                    (s->next_coeff++)->next=NULL;
                }
1483 1484 1485 1486 1487
            }
        }
    }
}

1488 1489 1490 1491 1492 1493

static void horizontal_filter(unsigned char *first_pixel, int stride,
    int *bounding_values);
static void vertical_filter(unsigned char *first_pixel, int stride,
    int *bounding_values);

1494 1495 1496 1497 1498 1499
/*
 * 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 已提交
1500
    int x;
1501 1502
    int m, n;
    int16_t *dequantizer;
1503
    DECLARE_ALIGNED_16(DCTELEM, block[64]);
1504 1505 1506 1507 1508 1509 1510 1511 1512 1513
    int motion_x = 0xdeadbeef, motion_y = 0xdeadbeef;
    int motion_halfpel_index;
    uint8_t *motion_source;
    int plane;
    int current_macroblock_entry = slice * s->macroblock_width * 6;

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

    for (plane = 0; plane < 3; plane++) {
M
Michael Niedermayer 已提交
1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524
        uint8_t *output_plane = s->current_frame.data    [plane];
        uint8_t *  last_plane = s->   last_frame.data    [plane];
        uint8_t *golden_plane = s-> golden_frame.data    [plane];
        int stride            = s->current_frame.linesize[plane];
        int plane_width       = s->width  >> !!plane;
        int plane_height      = s->height >> !!plane;
        int y =        slice *  FRAGMENT_PIXELS << !plane ;
        int slice_height = y + (FRAGMENT_PIXELS << !plane);
        int i = s->macroblock_fragments[current_macroblock_entry + plane + 3*!!plane];

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

1526

D
Diego Biurrun 已提交
1527
        if(FFABS(stride) > 2048)
1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547
            return; //various tables are fixed size

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

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

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

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

                    if ((s->all_fragments[i].coding_method == MODE_USING_GOLDEN) ||
                        (s->all_fragments[i].coding_method == MODE_GOLDEN_MV))
                        motion_source= golden_plane;
1548
                    else
1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585
                        motion_source= last_plane;

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

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

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

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

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

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

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

1587 1588 1589 1590

                    /* first, take care of copying a block from either the
                     * previous or the golden frame */
                    if (s->all_fragments[i].coding_method != MODE_INTRA) {
1591 1592 1593
                        /* 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
1594 1595 1596 1597 1598 1599 1600 1601 1602
                           put_no_rnd_pixels_tab is better optimzed */
                        if(motion_halfpel_index != 3){
                            s->dsp.put_no_rnd_pixels_tab[1][motion_halfpel_index](
                                output_plane + s->all_fragments[i].first_pixel,
                                motion_source, stride, 8);
                        }else{
                            int d= (motion_x ^ motion_y)>>31; // d is 0 if motion_x and _y have the same sign, else -1
                            s->dsp.put_no_rnd_pixels_l2[1](
                                output_plane + s->all_fragments[i].first_pixel,
1603 1604
                                motion_source - d,
                                motion_source + stride + 1 + d,
1605 1606
                                stride, 8);
                        }
1607
                        dequantizer = s->qmat[1][plane];
1608
                    }else{
1609
                        dequantizer = s->qmat[0][plane];
1610 1611 1612
                    }

                    /* dequantize the DCT coefficients */
1613 1614
                    debug_idct("fragment %d, coding mode %d, DC = %d, dequant = %d:\n",
                        i, s->all_fragments[i].coding_method,
1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633
                        DC_COEFF(i), dequantizer[0]);

                    if(s->avctx->idct_algo==FF_IDCT_VP3){
                        Coeff *coeff= s->coeffs + i;
                        memset(block, 0, sizeof(block));
                        while(coeff->next){
                            block[coeff->index]= coeff->coeff * dequantizer[coeff->index];
                            coeff= coeff->next;
                        }
                    }else{
                        Coeff *coeff= s->coeffs + i;
                        memset(block, 0, sizeof(block));
                        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 */
1634

1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653
                    if (s->all_fragments[i].coding_method == MODE_INTRA) {
                        if(s->avctx->idct_algo!=FF_IDCT_VP3)
                            block[0] += 128<<3;
                        s->dsp.idct_put(
                            output_plane + s->all_fragments[i].first_pixel,
                            stride,
                            block);
                    } else {
                        s->dsp.idct_add(
                            output_plane + s->all_fragments[i].first_pixel,
                            stride,
                            block);
                    }

                    debug_idct("block after idct_%s():\n",
                        (s->all_fragments[i].coding_method == MODE_INTRA)?
                        "put" : "add");
                    for (m = 0; m < 8; m++) {
                        for (n = 0; n < 8; n++) {
1654
                            debug_idct(" %3d", *(output_plane +
1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669
                                s->all_fragments[i].first_pixel + (m * stride + n)));
                        }
                        debug_idct("\n");
                    }
                    debug_idct("\n");

                } else {

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

                }
1670
#if 0
1671 1672 1673 1674 1675 1676 1677
                /* perform the left edge filter if:
                 *   - the fragment is not on the left column
                 *   - the fragment is coded in this frame
                 *   - the fragment is not coded in this frame but the left
                 *     fragment is coded in this frame (this is done instead
                 *     of a right edge filter when rendering the left fragment
                 *     since this fragment is not available yet) */
1678
                if ((x > 0) &&
1679 1680 1681
                    ((s->all_fragments[i].coding_method != MODE_COPY) ||
                     ((s->all_fragments[i].coding_method == MODE_COPY) &&
                      (s->all_fragments[i - 1].coding_method != MODE_COPY)) )) {
1682
                    horizontal_filter(
1683
                        output_plane + s->all_fragments[i].first_pixel + 7*stride,
M
Michael Niedermayer 已提交
1684
                        -stride, s->bounding_values_array + 127);
1685 1686
                }

1687 1688 1689 1690 1691 1692 1693
                /* perform the top edge filter if:
                 *   - the fragment is not on the top row
                 *   - the fragment is coded in this frame
                 *   - the fragment is not coded in this frame but the above
                 *     fragment is coded in this frame (this is done instead
                 *     of a bottom edge filter when rendering the above
                 *     fragment since this fragment is not available yet) */
1694
                if ((y > 0) &&
1695 1696 1697
                    ((s->all_fragments[i].coding_method != MODE_COPY) ||
                     ((s->all_fragments[i].coding_method == MODE_COPY) &&
                      (s->all_fragments[i - fragment_width].coding_method != MODE_COPY)) )) {
1698
                    vertical_filter(
1699
                        output_plane + s->all_fragments[i].first_pixel - stride,
M
Michael Niedermayer 已提交
1700
                        -stride, s->bounding_values_array + 127);
1701
                }
1702
#endif
1703 1704 1705 1706 1707 1708 1709
            }
        }
    }

     /* this looks like a good place for slice dispatch... */
     /* algorithm:
      *   if (slice == s->macroblock_height - 1)
1710 1711 1712
      *     dispatch (both last slice & 2nd-to-last slice);
      *   else if (slice > 0)
      *     dispatch (slice - 1);
1713 1714 1715 1716 1717
      */

    emms_c();
}

1718 1719 1720
static void horizontal_filter(unsigned char *first_pixel, int stride,
    int *bounding_values)
{
1721
    unsigned char *end;
1722 1723
    int filter_value;

M
Michael Niedermayer 已提交
1724
    for (end= first_pixel + 8*stride; first_pixel != end; first_pixel += stride) {
1725
        filter_value =
1726 1727
            (first_pixel[-2] - first_pixel[ 1])
         +3*(first_pixel[ 0] - first_pixel[-1]);
1728
        filter_value = bounding_values[(filter_value + 4) >> 3];
1729 1730
        first_pixel[-1] = av_clip_uint8(first_pixel[-1] + filter_value);
        first_pixel[ 0] = av_clip_uint8(first_pixel[ 0] - filter_value);
1731 1732 1733 1734 1735 1736
    }
}

static void vertical_filter(unsigned char *first_pixel, int stride,
    int *bounding_values)
{
1737
    unsigned char *end;
1738
    int filter_value;
1739
    const int nstride= -stride;
1740

1741
    for (end= first_pixel + 8; first_pixel < end; first_pixel++) {
1742
        filter_value =
1743 1744
            (first_pixel[2 * nstride] - first_pixel[ stride])
         +3*(first_pixel[0          ] - first_pixel[nstride]);
1745
        filter_value = bounding_values[(filter_value + 4) >> 3];
1746 1747
        first_pixel[nstride] = av_clip_uint8(first_pixel[nstride] + filter_value);
        first_pixel[0] = av_clip_uint8(first_pixel[0] - filter_value);
1748 1749 1750 1751 1752
    }
}

static void apply_loop_filter(Vp3DecodeContext *s)
{
M
Michael Niedermayer 已提交
1753 1754
    int plane;
    int x, y;
1755
    int *bounding_values= s->bounding_values_array+127;
1756

1757
#if 0
1758
    int bounding_values_array[256];
1759 1760 1761 1762 1763 1764 1765
    int filter_limit;

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

    /* set up the bounding values */
1769
    memset(bounding_values_array, 0, 256 * sizeof(int));
1770 1771 1772 1773 1774 1775
    for (x = 0; x < filter_limit; x++) {
        bounding_values[-x - filter_limit] = -filter_limit + x;
        bounding_values[-x] = -x;
        bounding_values[x] = x;
        bounding_values[x + filter_limit] = filter_limit - x;
    }
1776
#endif
1777 1778

    for (plane = 0; plane < 3; plane++) {
M
Michael Niedermayer 已提交
1779 1780 1781 1782 1783
        int width           = s->fragment_width  >> !!plane;
        int height          = s->fragment_height >> !!plane;
        int fragment        = s->fragment_start        [plane];
        int stride          = s->current_frame.linesize[plane];
        uint8_t *plane_data = s->current_frame.data    [plane];
M
Michael Niedermayer 已提交
1784
        if (!s->flipped_image) stride = -stride;
1785 1786

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

1788
            for (x = 0; x < width; x++) {
M
Michael Niedermayer 已提交
1789
START_TIMER
1790 1791 1792 1793
                /* do not perform left edge filter for left columns frags */
                if ((x > 0) &&
                    (s->all_fragments[fragment].coding_method != MODE_COPY)) {
                    horizontal_filter(
M
Michael Niedermayer 已提交
1794
                        plane_data + s->all_fragments[fragment].first_pixel,
1795 1796 1797 1798 1799 1800 1801
                        stride, bounding_values);
                }

                /* do not perform top edge filter for top row fragments */
                if ((y > 0) &&
                    (s->all_fragments[fragment].coding_method != MODE_COPY)) {
                    vertical_filter(
M
Michael Niedermayer 已提交
1802
                        plane_data + s->all_fragments[fragment].first_pixel,
1803 1804 1805 1806 1807 1808 1809 1810 1811 1812
                        stride, bounding_values);
                }

                /* do not perform right edge filter for right column
                 * fragments or if right fragment neighbor is also coded
                 * in this frame (it will be filtered in next iteration) */
                if ((x < width - 1) &&
                    (s->all_fragments[fragment].coding_method != MODE_COPY) &&
                    (s->all_fragments[fragment + 1].coding_method == MODE_COPY)) {
                    horizontal_filter(
M
Michael Niedermayer 已提交
1813
                        plane_data + s->all_fragments[fragment + 1].first_pixel,
1814 1815 1816 1817 1818 1819 1820 1821 1822 1823
                        stride, bounding_values);
                }

                /* do not perform bottom edge filter for bottom row
                 * fragments or if bottom fragment neighbor is also coded
                 * in this frame (it will be filtered in the next row) */
                if ((y < height - 1) &&
                    (s->all_fragments[fragment].coding_method != MODE_COPY) &&
                    (s->all_fragments[fragment + width].coding_method == MODE_COPY)) {
                    vertical_filter(
M
Michael Niedermayer 已提交
1824
                        plane_data + s->all_fragments[fragment + width].first_pixel,
1825 1826 1827 1828
                        stride, bounding_values);
                }

                fragment++;
M
Michael Niedermayer 已提交
1829
STOP_TIMER("loop filter")
1830 1831 1832
            }
        }
    }
1833 1834
}

1835
/*
1836 1837 1838 1839
 * This function computes the first pixel addresses for each fragment.
 * This function needs to be invoked after the first frame is allocated
 * so that it has access to the plane strides.
 */
1840
static void vp3_calculate_pixel_addresses(Vp3DecodeContext *s)
1841 1842 1843 1844 1845 1846 1847 1848 1849
{

    int i, x, y;

    /* figure out the first pixel addresses for each of the fragments */
    /* Y plane */
    i = 0;
    for (y = s->fragment_height; y > 0; y--) {
        for (x = 0; x < s->fragment_width; x++) {
1850
            s->all_fragments[i++].first_pixel =
1851 1852 1853
                s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[0] +
                    x * FRAGMENT_PIXELS;
1854
            debug_init("  fragment %d, first pixel @ %d\n",
1855 1856 1857 1858 1859
                i-1, s->all_fragments[i-1].first_pixel);
        }
    }

    /* U plane */
M
Michael Niedermayer 已提交
1860
    i = s->fragment_start[1];
1861 1862
    for (y = s->fragment_height / 2; y > 0; y--) {
        for (x = 0; x < s->fragment_width / 2; x++) {
1863
            s->all_fragments[i++].first_pixel =
1864 1865 1866
                s->golden_frame.linesize[1] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[1] +
                    x * FRAGMENT_PIXELS;
1867
            debug_init("  fragment %d, first pixel @ %d\n",
1868 1869 1870 1871 1872
                i-1, s->all_fragments[i-1].first_pixel);
        }
    }

    /* V plane */
M
Michael Niedermayer 已提交
1873
    i = s->fragment_start[2];
1874 1875
    for (y = s->fragment_height / 2; y > 0; y--) {
        for (x = 0; x < s->fragment_width / 2; x++) {
1876
            s->all_fragments[i++].first_pixel =
1877 1878 1879
                s->golden_frame.linesize[2] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[2] +
                    x * FRAGMENT_PIXELS;
1880
            debug_init("  fragment %d, first pixel @ %d\n",
1881 1882 1883 1884 1885
                i-1, s->all_fragments[i-1].first_pixel);
        }
    }
}

1886
/* FIXME: this should be merged with the above! */
1887
static void theora_calculate_pixel_addresses(Vp3DecodeContext *s)
1888 1889 1890 1891 1892 1893 1894 1895 1896
{

    int i, x, y;

    /* figure out the first pixel addresses for each of the fragments */
    /* Y plane */
    i = 0;
    for (y = 1; y <= s->fragment_height; y++) {
        for (x = 0; x < s->fragment_width; x++) {
1897
            s->all_fragments[i++].first_pixel =
1898 1899 1900
                s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[0] +
                    x * FRAGMENT_PIXELS;
1901
            debug_init("  fragment %d, first pixel @ %d\n",
1902 1903 1904 1905 1906
                i-1, s->all_fragments[i-1].first_pixel);
        }
    }

    /* U plane */
M
Michael Niedermayer 已提交
1907
    i = s->fragment_start[1];
1908 1909
    for (y = 1; y <= s->fragment_height / 2; y++) {
        for (x = 0; x < s->fragment_width / 2; x++) {
1910
            s->all_fragments[i++].first_pixel =
1911 1912 1913
                s->golden_frame.linesize[1] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[1] +
                    x * FRAGMENT_PIXELS;
1914
            debug_init("  fragment %d, first pixel @ %d\n",
1915 1916 1917 1918 1919
                i-1, s->all_fragments[i-1].first_pixel);
        }
    }

    /* V plane */
M
Michael Niedermayer 已提交
1920
    i = s->fragment_start[2];
1921 1922
    for (y = 1; y <= s->fragment_height / 2; y++) {
        for (x = 0; x < s->fragment_width / 2; x++) {
1923
            s->all_fragments[i++].first_pixel =
1924 1925 1926
                s->golden_frame.linesize[2] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[2] +
                    x * FRAGMENT_PIXELS;
1927
            debug_init("  fragment %d, first pixel @ %d\n",
1928 1929 1930 1931 1932
                i-1, s->all_fragments[i-1].first_pixel);
        }
    }
}

1933 1934 1935 1936 1937 1938
/*
 * This is the ffmpeg/libavcodec API init function.
 */
static int vp3_decode_init(AVCodecContext *avctx)
{
    Vp3DecodeContext *s = avctx->priv_data;
1939
    int i, inter, plane;
1940 1941 1942 1943
    int c_width;
    int c_height;
    int y_superblock_count;
    int c_superblock_count;
1944

A
Alex Beregszaszi 已提交
1945
    if (avctx->codec_tag == MKTAG('V','P','3','0'))
1946
        s->version = 0;
A
Alex Beregszaszi 已提交
1947
    else
1948
        s->version = 1;
A
Alex Beregszaszi 已提交
1949

1950
    s->avctx = avctx;
1951 1952
    s->width = (avctx->width + 15) & 0xFFFFFFF0;
    s->height = (avctx->height + 15) & 0xFFFFFFF0;
1953
    avctx->pix_fmt = PIX_FMT_YUV420P;
1954 1955
    if(avctx->idct_algo==FF_IDCT_AUTO)
        avctx->idct_algo=FF_IDCT_VP3;
1956
    dsputil_init(&s->dsp, avctx);
1957

M
Michael Niedermayer 已提交
1958
    ff_init_scantable(s->dsp.idct_permutation, &s->scantable, ff_zigzag_direct);
1959 1960 1961 1962 1963

    /* initialize to an impossible value which will force a recalculation
     * in the first frame decode */
    s->quality_index = -1;

1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977
    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;
1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988
    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 已提交
1989 1990
    s->fragment_start[1] = s->fragment_width * s->fragment_height;
    s->fragment_start[2] = s->fragment_width * s->fragment_height * 5 / 4;
1991

1992 1993 1994 1995 1996 1997
    debug_init("  Y plane: %d x %d\n", s->width, s->height);
    debug_init("  C plane: %d x %d\n", c_width, c_height);
    debug_init("  Y superblocks: %d x %d, %d total\n",
        s->y_superblock_width, s->y_superblock_height, y_superblock_count);
    debug_init("  C superblocks: %d x %d, %d total\n",
        s->c_superblock_width, s->c_superblock_height, c_superblock_count);
1998
    debug_init("  total superblocks = %d, U starts @ %d, V starts @ %d\n",
1999
        s->superblock_count, s->u_superblock_start, s->v_superblock_start);
2000 2001 2002 2003 2004 2005
    debug_init("  macroblocks: %d x %d, %d total\n",
        s->macroblock_width, s->macroblock_height, s->macroblock_count);
    debug_init("  %d fragments, %d x %d, u starts @ %d, v starts @ %d\n",
        s->fragment_count,
        s->fragment_width,
        s->fragment_height,
M
Michael Niedermayer 已提交
2006 2007
        s->fragment_start[1],
        s->fragment_start[2]);
2008 2009

    s->all_fragments = av_malloc(s->fragment_count * sizeof(Vp3Fragment));
2010
    s->coeffs = av_malloc(s->fragment_count * sizeof(Coeff) * 65);
2011 2012 2013
    s->coded_fragment_list = av_malloc(s->fragment_count * sizeof(int));
    s->pixel_addresses_inited = 0;

2014 2015
    if (!s->theora_tables)
    {
M
cleanup  
Michael Niedermayer 已提交
2016
        for (i = 0; i < 64; i++) {
2017 2018
            s->coded_dc_scale_factor[i] = vp31_dc_scale_factor[i];
            s->coded_ac_scale_factor[i] = vp31_ac_scale_factor[i];
2019 2020 2021
            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];
2022
            s->filter_limit_values[i] = vp31_filter_limit_values[i];
M
cleanup  
Michael Niedermayer 已提交
2023
        }
2024

2025 2026 2027 2028 2029 2030 2031 2032 2033
        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;
            }
        }

2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089
        /* init VLC tables */
        for (i = 0; i < 16; i++) {

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

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

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

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

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

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

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

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

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

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

2092 2093 2094 2095
    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);

2096
    init_vlc(&s->fragment_run_length_vlc, 5, 30,
2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107
        &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);

2108 2109 2110 2111
    /* work out the block mapping tables */
    s->superblock_fragments = av_malloc(s->superblock_count * 16 * sizeof(int));
    s->superblock_macroblocks = av_malloc(s->superblock_count * 4 * sizeof(int));
    s->macroblock_fragments = av_malloc(s->macroblock_count * 6 * sizeof(int));
2112
    s->macroblock_coding = av_malloc(s->macroblock_count + 1);
2113 2114
    init_block_mapping(s);

2115 2116 2117 2118
    for (i = 0; i < 3; i++) {
        s->current_frame.data[i] = NULL;
        s->last_frame.data[i] = NULL;
        s->golden_frame.data[i] = NULL;
2119 2120
    }

2121 2122 2123 2124 2125 2126
    return 0;
}

/*
 * This is the ffmpeg/libavcodec API frame decode function.
 */
2127
static int vp3_decode_frame(AVCodecContext *avctx,
2128 2129 2130 2131 2132 2133
                            void *data, int *data_size,
                            uint8_t *buf, int buf_size)
{
    Vp3DecodeContext *s = avctx->priv_data;
    GetBitContext gb;
    static int counter = 0;
2134
    int i;
2135 2136

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

2138 2139
    if (s->theora && get_bits1(&gb))
    {
2140 2141
        av_log(avctx, AV_LOG_ERROR, "Header packet passed to frame decoder, skipping\n");
        return -1;
2142
    }
A
Alex Beregszaszi 已提交
2143 2144 2145

    s->keyframe = !get_bits1(&gb);
    if (!s->theora)
2146
        skip_bits(&gb, 1);
A
Alex Beregszaszi 已提交
2147
    s->last_quality_index = s->quality_index;
2148 2149 2150 2151 2152 2153 2154

    s->nqis=0;
    do{
        s->qis[s->nqis++]= get_bits(&gb, 6);
    } while(s->theora >= 0x030200 && s->nqis<3 && get_bits1(&gb));

    s->quality_index= s->qis[0];
2155

2156
    if (s->avctx->debug & FF_DEBUG_PICT_INFO)
2157 2158
        av_log(s->avctx, AV_LOG_INFO, " VP3 %sframe #%d: Q index = %d\n",
            s->keyframe?"key":"", counter, s->quality_index);
2159 2160
    counter++;

2161
    if (s->quality_index != s->last_quality_index) {
2162
        init_dequantizer(s);
2163 2164
        init_loop_filter(s);
    }
2165

2166
    if (s->keyframe) {
2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183
        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 已提交
2184

2185 2186 2187
        if (s->last_frame.data[0] == s->golden_frame.data[0]) {
            if (s->golden_frame.data[0])
                avctx->release_buffer(avctx, &s->golden_frame);
2188
            s->last_frame= s->golden_frame; /* ensure that we catch any access to this released frame */
2189 2190 2191 2192 2193 2194
        } 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);
        }
2195

2196
        s->golden_frame.reference = 3;
2197
        if(avctx->get_buffer(avctx, &s->golden_frame) < 0) {
2198
            av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
2199 2200 2201 2202
            return -1;
        }

        /* golden frame is also the current frame */
M
Michael Niedermayer 已提交
2203
        s->current_frame= s->golden_frame;
2204 2205 2206

        /* time to figure out pixel addresses? */
        if (!s->pixel_addresses_inited)
2207 2208 2209 2210 2211
        {
            if (!s->flipped_image)
                vp3_calculate_pixel_addresses(s);
            else
                theora_calculate_pixel_addresses(s);
2212
            s->pixel_addresses_inited = 1;
2213
        }
2214 2215
    } else {
        /* allocate a new current frame */
2216
        s->current_frame.reference = 3;
2217 2218 2219 2220
        if (!s->pixel_addresses_inited) {
            av_log(s->avctx, AV_LOG_ERROR, "vp3: first frame not a keyframe\n");
            return -1;
        }
2221
        if(avctx->get_buffer(avctx, &s->current_frame) < 0) {
2222
            av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
2223 2224 2225 2226
            return -1;
        }
    }

M
Michael Niedermayer 已提交
2227 2228 2229
    s->current_frame.qscale_table= s->qscale_table; //FIXME allocate individual tables per AVFrame
    s->current_frame.qstride= 0;

M
Michael Niedermayer 已提交
2230
    {START_TIMER
2231
    init_frame(s, &gb);
M
Michael Niedermayer 已提交
2232
    STOP_TIMER("init_frame")}
2233

2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246
#if KEYFRAMES_ONLY
if (!s->keyframe) {

    memcpy(s->current_frame.data[0], s->golden_frame.data[0],
        s->current_frame.linesize[0] * s->height);
    memcpy(s->current_frame.data[1], s->golden_frame.data[1],
        s->current_frame.linesize[1] * s->height / 2);
    memcpy(s->current_frame.data[2], s->golden_frame.data[2],
        s->current_frame.linesize[2] * s->height / 2);

} else {
#endif

M
Michael Niedermayer 已提交
2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267
    {START_TIMER
    if (unpack_superblocks(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_superblocks\n");
        return -1;
    }
    STOP_TIMER("unpack_superblocks")}
    {START_TIMER
    if (unpack_modes(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_modes\n");
        return -1;
    }
    STOP_TIMER("unpack_modes")}
    {START_TIMER
    if (unpack_vectors(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_vectors\n");
        return -1;
    }
    STOP_TIMER("unpack_vectors")}
    {START_TIMER
    if (unpack_dct_coeffs(s, &gb)){
        av_log(s->avctx, AV_LOG_ERROR, "error in unpack_dct_coeffs\n");
2268 2269
        return -1;
    }
M
Michael Niedermayer 已提交
2270 2271
    STOP_TIMER("unpack_dct_coeffs")}
    {START_TIMER
2272 2273

    reverse_dc_prediction(s, 0, s->fragment_width, s->fragment_height);
2274
    if ((avctx->flags & CODEC_FLAG_GRAY) == 0) {
M
Michael Niedermayer 已提交
2275
        reverse_dc_prediction(s, s->fragment_start[1],
2276
            s->fragment_width / 2, s->fragment_height / 2);
M
Michael Niedermayer 已提交
2277
        reverse_dc_prediction(s, s->fragment_start[2],
2278
            s->fragment_width / 2, s->fragment_height / 2);
2279 2280 2281 2282 2283 2284 2285
    }
    STOP_TIMER("reverse_dc_prediction")}
    {START_TIMER

    for (i = 0; i < s->macroblock_height; i++)
        render_slice(s, i);
    STOP_TIMER("render_fragments")}
2286

M
Michael Niedermayer 已提交
2287
    {START_TIMER
2288
    apply_loop_filter(s);
M
Michael Niedermayer 已提交
2289
    STOP_TIMER("apply_loop_filter")}
2290 2291 2292 2293
#if KEYFRAMES_ONLY
}
#endif

2294 2295 2296
    *data_size=sizeof(AVFrame);
    *(AVFrame*)data= s->current_frame;

2297 2298 2299 2300 2301
    /* 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);
2302

2303
    /* shuffle frames (last = current) */
M
Michael Niedermayer 已提交
2304
    s->last_frame= s->current_frame;
2305
    s->current_frame.data[0]= NULL; /* ensure that we catch any access to this released frame */
2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317

    return buf_size;
}

/*
 * This is the ffmpeg/libavcodec API module cleanup function.
 */
static int vp3_decode_end(AVCodecContext *avctx)
{
    Vp3DecodeContext *s = avctx->priv_data;

    av_free(s->all_fragments);
2318
    av_free(s->coeffs);
2319 2320 2321 2322
    av_free(s->coded_fragment_list);
    av_free(s->superblock_fragments);
    av_free(s->superblock_macroblocks);
    av_free(s->macroblock_fragments);
2323
    av_free(s->macroblock_coding);
2324

2325
    /* release all frames */
2326
    if (s->golden_frame.data[0] && s->golden_frame.data[0] != s->last_frame.data[0])
2327 2328 2329 2330 2331
        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 */
2332 2333 2334 2335

    return 0;
}

2336 2337 2338 2339
static int read_huffman_tree(AVCodecContext *avctx, GetBitContext *gb)
{
    Vp3DecodeContext *s = avctx->priv_data;

2340
    if (get_bits1(gb)) {
2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367
        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;
        read_huffman_tree(avctx, gb);
        s->hbits |= 1;
        read_huffman_tree(avctx, gb);
        s->hbits >>= 1;
        s->huff_code_size--;
    }
    return 0;
}

2368
#ifdef CONFIG_THEORA_DECODER
2369
static int theora_decode_header(AVCodecContext *avctx, GetBitContext *gb)
2370 2371
{
    Vp3DecodeContext *s = avctx->priv_data;
2372
    int visible_width, visible_height;
2373

2374
    s->theora = get_bits_long(gb, 24);
D
Diego Biurrun 已提交
2375
    av_log(avctx, AV_LOG_VERBOSE, "Theora bitstream version %X\n", s->theora);
2376

M
Matthieu Castet 已提交
2377
    /* 3.2.0 aka alpha3 has the same frame orientation as original vp3 */
2378
    /* but previous versions have the image flipped relative to vp3 */
M
Matthieu Castet 已提交
2379
    if (s->theora < 0x030200)
2380
    {
2381
        s->flipped_image = 1;
2382 2383
        av_log(avctx, AV_LOG_DEBUG, "Old (<alpha3) Theora bitstream, flipped image\n");
    }
2384

2385 2386
    s->width = get_bits(gb, 16) << 4;
    s->height = get_bits(gb, 16) << 4;
2387

2388
    if(avcodec_check_dimensions(avctx, s->width, s->height)){
2389
        av_log(avctx, AV_LOG_ERROR, "Invalid dimensions (%dx%d)\n", s->width, s->height);
2390 2391 2392
        s->width= s->height= 0;
        return -1;
    }
2393 2394 2395

    if (s->theora >= 0x030400)
    {
2396
        skip_bits(gb, 32); /* total number of superblocks in a frame */
2397
        // fixme, the next field is 36bits long
2398 2399 2400
        skip_bits(gb, 32); /* total number of blocks in a frame */
        skip_bits(gb, 4); /* total number of blocks in a frame */
        skip_bits(gb, 32); /* total number of macroblocks in a frame */
2401
    }
2402

2403 2404 2405
    visible_width  = get_bits_long(gb, 24);
    visible_height = get_bits_long(gb, 24);

2406 2407 2408 2409
    if (s->theora >= 0x030200) {
        skip_bits(gb, 8); /* offset x */
        skip_bits(gb, 8); /* offset y */
    }
2410

2411 2412 2413 2414
    skip_bits(gb, 32); /* fps numerator */
    skip_bits(gb, 32); /* fps denumerator */
    skip_bits(gb, 24); /* aspect numerator */
    skip_bits(gb, 24); /* aspect denumerator */
2415

M
Matthieu Castet 已提交
2416
    if (s->theora < 0x030200)
2417 2418
        skip_bits(gb, 5); /* keyframe frequency force */
    skip_bits(gb, 8); /* colorspace */
2419
    if (s->theora >= 0x030400)
2420 2421
        skip_bits(gb, 2); /* pixel format: 420,res,422,444 */
    skip_bits(gb, 24); /* bitrate */
2422

2423
    skip_bits(gb, 6); /* quality hint */
2424

M
Matthieu Castet 已提交
2425
    if (s->theora >= 0x030200)
2426
    {
2427
        skip_bits(gb, 5); /* keyframe frequency force */
2428

2429
        if (s->theora < 0x030400)
2430
            skip_bits(gb, 5); /* spare bits */
2431
    }
2432

2433
//    align_get_bits(gb);
2434

2435 2436 2437 2438 2439
    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);
2440 2441 2442 2443

    return 0;
}

2444
static int theora_decode_tables(AVCodecContext *avctx, GetBitContext *gb)
2445 2446
{
    Vp3DecodeContext *s = avctx->priv_data;
2447
    int i, n, matrices, inter, plane;
M
Matthieu Castet 已提交
2448 2449

    if (s->theora >= 0x030200) {
2450
        n = get_bits(gb, 3);
2451
        /* loop filter limit values table */
M
Matthieu Castet 已提交
2452
        for (i = 0; i < 64; i++)
2453
            s->filter_limit_values[i] = get_bits(gb, n);
M
Matthieu Castet 已提交
2454
    }
2455

M
Matthieu Castet 已提交
2456
    if (s->theora >= 0x030200)
2457
        n = get_bits(gb, 4) + 1;
M
Matthieu Castet 已提交
2458 2459
    else
        n = 16;
2460 2461
    /* quality threshold table */
    for (i = 0; i < 64; i++)
2462
        s->coded_ac_scale_factor[i] = get_bits(gb, n);
2463

M
Matthieu Castet 已提交
2464
    if (s->theora >= 0x030200)
2465
        n = get_bits(gb, 4) + 1;
M
Matthieu Castet 已提交
2466 2467
    else
        n = 16;
2468 2469
    /* dc scale factor table */
    for (i = 0; i < 64; i++)
2470
        s->coded_dc_scale_factor[i] = get_bits(gb, n);
2471

M
Matthieu Castet 已提交
2472
    if (s->theora >= 0x030200)
2473
        matrices = get_bits(gb, 9) + 1;
M
Matthieu Castet 已提交
2474
    else
2475
        matrices = 3;
2476

2477 2478 2479 2480
    if(matrices > 384){
        av_log(avctx, AV_LOG_ERROR, "invalid number of base matrixes\n");
        return -1;
    }
A
Alex Beregszaszi 已提交
2481

2482
    for(n=0; n<matrices; n++){
2483
        for (i = 0; i < 64; i++)
2484 2485
            s->base_matrix[n][i]= get_bits(gb, 8);
    }
2486

2487 2488 2489 2490
    for (inter = 0; inter <= 1; inter++) {
        for (plane = 0; plane <= 2; plane++) {
            int newqr= 1;
            if (inter || plane > 0)
2491
                newqr = get_bits1(gb);
2492
            if (!newqr) {
2493
                int qtj, plj;
2494
                if(inter && get_bits1(gb)){
2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505
                    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;
2506
                int qi = 0;
2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519

                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;
2520
                }
2521

2522
                if (qi > 63) {
2523
                    av_log(avctx, AV_LOG_ERROR, "invalid qi %d > 63\n", qi);
2524 2525
                    return -1;
                }
2526
                s->qr_count[inter][plane]= qri;
2527 2528 2529 2530
            }
        }
    }

2531
    /* Huffman tables */
2532 2533 2534
    for (s->hti = 0; s->hti < 80; s->hti++) {
        s->entries = 0;
        s->huff_code_size = 1;
2535
        if (!get_bits1(gb)) {
2536
            s->hbits = 0;
2537
            read_huffman_tree(avctx, gb);
2538
            s->hbits = 1;
2539
            read_huffman_tree(avctx, gb);
2540 2541
        }
    }
2542

2543
    s->theora_tables = 1;
2544

2545 2546 2547 2548 2549 2550 2551 2552
    return 0;
}

static int theora_decode_init(AVCodecContext *avctx)
{
    Vp3DecodeContext *s = avctx->priv_data;
    GetBitContext gb;
    int ptype;
2553 2554 2555
    uint8_t *header_start[3];
    int header_len[3];
    int i;
2556

2557 2558 2559
    s->theora = 1;

    if (!avctx->extradata_size)
2560 2561
    {
        av_log(avctx, AV_LOG_ERROR, "Missing extradata!\n");
2562
        return -1;
2563
    }
2564

2565 2566 2567 2568 2569
    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;
    }
2570

2571 2572
  for(i=0;i<3;i++) {
    init_get_bits(&gb, header_start[i], header_len[i]);
2573 2574 2575

    ptype = get_bits(&gb, 8);
    debug_vp3("Theora headerpacket type: %x\n", ptype);
2576

2577 2578 2579
     if (!(ptype & 0x80))
     {
        av_log(avctx, AV_LOG_ERROR, "Invalid extradata!\n");
2580
//        return -1;
2581
     }
2582

2583
    // FIXME: Check for this as well.
2584
    skip_bits(&gb, 6*8); /* "theora" */
2585

2586 2587 2588
    switch(ptype)
    {
        case 0x80:
2589
            theora_decode_header(avctx, &gb);
2590 2591
                break;
        case 0x81:
2592
// FIXME: is this needed? it breaks sometimes
2593 2594 2595
//            theora_decode_comments(avctx, gb);
            break;
        case 0x82:
2596
            theora_decode_tables(avctx, &gb);
2597 2598 2599 2600
            break;
        default:
            av_log(avctx, AV_LOG_ERROR, "Unknown Theora config packet: %d\n", ptype&~0x80);
            break;
2601
    }
2602 2603
    if(8*header_len[i] != get_bits_count(&gb))
        av_log(avctx, AV_LOG_ERROR, "%d bits left in packet %X\n", 8*header_len[i] - get_bits_count(&gb), ptype);
2604 2605
    if (s->theora < 0x030200)
        break;
2606
  }
2607

M
Matthieu Castet 已提交
2608
    vp3_decode_init(avctx);
2609 2610 2611
    return 0;
}

2612 2613
AVCodec theora_decoder = {
    "theora",
2614
    CODEC_TYPE_VIDEO,
2615
    CODEC_ID_THEORA,
2616
    sizeof(Vp3DecodeContext),
2617
    theora_decode_init,
2618 2619 2620 2621 2622 2623
    NULL,
    vp3_decode_end,
    vp3_decode_frame,
    0,
    NULL
};
2624
#endif
2625

2626 2627
AVCodec vp3_decoder = {
    "vp3",
2628
    CODEC_TYPE_VIDEO,
2629
    CODEC_ID_VP3,
2630
    sizeof(Vp3DecodeContext),
2631
    vp3_decode_init,
2632 2633 2634 2635 2636 2637
    NULL,
    vp3_decode_end,
    vp3_decode_frame,
    0,
    NULL
};