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

/**
 * @file vp3.c
 * On2 VP3 Video Decoder
25 26 27 28 29 30
 *
 * 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
31 32 33 34 35 36 37 38 39 40 41 42 43
 */

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

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

#include "vp3data.h"
44
#include "xiph.h"
45 46 47

#define FRAGMENT_PIXELS 8

48
/*
49
 * Debugging Variables
50
 *
51 52 53
 * Define one or more of the following compile-time variables to 1 to obtain
 * elaborate information about certain aspects of the decoding process.
 *
54
 * KEYFRAMES_ONLY: set this to 1 to only see keyframes (VP3 slideshow mode)
55 56 57 58 59 60 61 62 63 64 65 66
 * 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
 */

67 68
#define KEYFRAMES_ONLY 0

A
Alex Beregszaszi 已提交
69
#define DEBUG_VP3 0
70 71 72 73 74 75 76 77 78 79 80
#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 已提交
81
#define debug_vp3(args...) av_log(NULL, AV_LOG_DEBUG, ## args)
82 83 84 85 86
#else
static inline void debug_vp3(const char *format, ...) { }
#endif

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

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

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

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

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

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

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

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

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

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

//FIXME split things out into their own arrays
147
typedef struct Vp3Fragment {
148
    Coeff *next_coeff;
149 150 151 152
    /* 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 */
153 154 155 156 157
    uint16_t macroblock;
    uint8_t coding_method;
    uint8_t coeff_count;
    int8_t motion_x;
    int8_t motion_y;
158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183
} 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 */
184
    {    MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
185
         MODE_INTER_PLUS_MV,    MODE_INTER_NO_MV,
186
         MODE_INTRA,            MODE_USING_GOLDEN,
187 188 189
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },

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

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

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

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

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

};

#define MIN_DEQUANT_VAL 2

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

235 236
    int qis[3];
    int nqis;
237 238 239 240 241 242
    int quality_index;
    int last_quality_index;

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

M
Michael Niedermayer 已提交
264
    ScanTable scantable;
265

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

    /* 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];

286 287 288 289 290
    VLC superblock_run_length_vlc;
    VLC fragment_run_length_vlc;
    VLC mode_code_vlc;
    VLC motion_vector_vlc;

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

    /* 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;
311
    /* This is an array that indicates how a particular macroblock
312
     * is coded. */
313
    unsigned char *macroblock_coding;
314

315 316 317 318 319
    int first_coded_y_fragment;
    int first_coded_c_fragment;
    int last_coded_y_fragment;
    int last_coded_c_fragment;

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

323 324 325 326 327 328 329 330 331
    /* 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];
332 333 334 335 336 337 338 339 340 341
} Vp3DecodeContext;

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

/*
 * This function sets up all of the various blocks mappings:
 * superblocks <-> fragments, macroblocks <-> fragments,
 * superblocks <-> macroblocks
342 343
 *
 * Returns 0 is successful; returns 1 if *anything* went wrong.
344
 */
345
static int init_block_mapping(Vp3DecodeContext *s)
346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362
{
    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] = {
363
         1,  1,  0, -1,
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 400 401
         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;
402
            current_width = -1;
403
            current_height = 0;
404
            superblock_row_inc = 3 * s->fragment_width -
405
                (s->y_superblock_width * 4 - s->fragment_width);
406 407 408 409 410 411 412 413 414

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

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

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

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

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

        }

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

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

            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;
475
    current_width = -1;
476
    current_height = 0;
477 478
    superblock_row_inc = s->macroblock_width -
        (s->y_superblock_width * 2 - s->macroblock_width);;
479 480 481 482 483
    hilbert = hilbert_walk_mb;
    mapping_index = 0;
    current_macroblock = -1;
    for (i = 0; i < s->u_superblock_start; i++) {

484
        if (current_width >= right_edge - 1) {
485
            /* reset width and move to next superblock row */
486
            current_width = -1;
487 488 489 490 491 492 493 494 495
            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];
496
            current_width += travel_width_mb[j];
497 498 499
            current_height += travel_height_mb[j];

            /* check if the macroblock is in bounds */
500
            if ((current_width < right_edge) &&
501 502
                (current_height < bottom_edge)) {
                s->superblock_macroblocks[mapping_index] = current_macroblock;
503 504 505
                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);
506 507
            } else {
                s->superblock_macroblocks[mapping_index] = -1;
508 509 510
                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);
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 536 537
            }

            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) {
538
                s->all_fragments[current_fragment + s->fragment_width].macroblock =
539
                    current_macroblock;
540
                s->macroblock_fragments[mapping_index++] =
541 542 543 544 545 546
                    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)) {
547
                s->all_fragments[current_fragment + s->fragment_width + 1].macroblock =
548
                    current_macroblock;
549
                s->macroblock_fragments[mapping_index++] =
550 551 552 553 554 555
                    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 已提交
556
            c_fragment = s->fragment_start[1] +
557
                (i * s->fragment_width / 4) + (j / 2);
558
            s->all_fragments[c_fragment].macroblock = s->macroblock_count;
559 560 561
            s->macroblock_fragments[mapping_index++] = c_fragment;
            debug_init("%d ", c_fragment);

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

            debug_init("\n");

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

        current_fragment += s->fragment_width;
    }
579 580

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

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

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

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

615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631
    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 已提交
632
                int qmin= 8<<(inter + !i);
633 634
                int qscale= i ? ac_scale_factor : dc_scale_factor;

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

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

643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664
/*
 * 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;
    }
}

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

    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 */
        bit = get_bits(gb, 1);
692
        /* toggle the bit because as soon as the first run length is
693 694 695
         * fetched the bit will be toggled again */
        bit ^= 1;
        while (current_superblock < s->superblock_count) {
696
            if (current_run-- == 0) {
697
                bit ^= 1;
698
                current_run = get_vlc2(gb,
699 700
                    s->superblock_run_length_vlc.table, 6, 2);
                if (current_run == 33)
701
                    current_run += get_bits(gb, 12);
702 703 704 705 706 707 708
                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 */
709
                if (bit == 0) {
710
                    decode_fully_flags = 1;
711
                } else {
712

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

        /* 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;
            bit = get_bits(gb, 1);
728
            /* toggle the bit because as soon as the first run length is
729 730 731 732 733 734 735
             * 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) {

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

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

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

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

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

                    if (bit) {
803
                        /* default mode; actual mode will be decoded in
804
                         * the next phase */
805
                        s->all_fragments[current_fragment].coding_method =
806
                            MODE_INTER_NO_MV;
807
                        s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
808
                        s->coded_fragment_list[s->coded_fragment_list_index] =
809
                            current_fragment;
M
Michael Niedermayer 已提交
810
                        if ((current_fragment >= s->fragment_start[1]) &&
811 812
                            (s->last_coded_y_fragment == -1) &&
                            (!first_c_fragment_seen)) {
813 814
                            s->first_coded_c_fragment = s->coded_fragment_list_index;
                            s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
815
                            first_c_fragment_seen = 1;
816 817
                        }
                        s->coded_fragment_list_index++;
818
                        s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
819 820 821 822 823 824 825 826 827 828 829 830 831 832
                        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 */
833
                    s->all_fragments[current_fragment].coding_method =
834
                        MODE_INTER_NO_MV;
835
                    s->all_fragments[current_fragment].next_coeff= s->coeffs + current_fragment;
836
                    s->coded_fragment_list[s->coded_fragment_list_index] =
837
                        current_fragment;
M
Michael Niedermayer 已提交
838
                    if ((current_fragment >= s->fragment_start[1]) &&
839 840
                        (s->last_coded_y_fragment == -1) &&
                        (!first_c_fragment_seen)) {
841 842
                        s->first_coded_c_fragment = s->coded_fragment_list_index;
                        s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
843
                        first_c_fragment_seen = 1;
844 845
                    }
                    s->coded_fragment_list_index++;
846
                    s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
847 848 849 850 851 852
                    debug_block_coding("      superblock %d is fully coded, fragment %d is coded\n",
                        i, current_fragment);
                }
            }
        }
    }
853

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

861 862 863 864 865 866
    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);
867 868

    return 0;
869 870 871 872 873 874
}

/*
 * This function unpacks all the coding mode data for individual macroblocks
 * from the bitstream.
 */
875
static int unpack_modes(Vp3DecodeContext *s, GetBitContext *gb)
876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900
{
    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++)
901
                ModeAlphabet[scheme][get_bits(gb, 3)] = i;
902 903 904
        }

        for (i = 0; i < 8; i++)
905
            debug_modes("      mode[%d][%d] = %d\n", scheme, i,
906 907 908 909 910 911 912 913 914
                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) ||
915
                    (s->macroblock_coding[current_macroblock] == MODE_COPY))
916
                    continue;
917
                if (current_macroblock >= s->macroblock_count) {
918
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_modes(): bad macroblock number (%d >= %d)\n",
919 920 921
                        current_macroblock, s->macroblock_count);
                    return 1;
                }
922 923 924 925 926

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

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

    return 0;
954 955
}

956 957 958 959
/*
 * This function unpacks all the motion vectors for the individual
 * macroblocks from the bitstream.
 */
960
static int unpack_vectors(Vp3DecodeContext *s, GetBitContext *gb)
961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994
{
    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 */
        coding_mode = get_bits(gb, 1);
        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) ||
995
                    (s->macroblock_coding[current_macroblock] == MODE_COPY))
996
                    continue;
997
                if (current_macroblock >= s->macroblock_count) {
998
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad macroblock number (%d >= %d)\n",
999 1000 1001
                        current_macroblock, s->macroblock_count);
                    return 1;
                }
1002 1003

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

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

1022 1023 1024 1025 1026 1027
                    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 */
1028
                    if (s->macroblock_coding[current_macroblock] ==
1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042
                        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) {
1043 1044
                            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)];
1045
                        } else {
1046 1047
                            motion_x[k] = fixed_motion_vector_table[get_bits(gb, 6)];
                            motion_y[k] = fixed_motion_vector_table[get_bits(gb, 6)];
1048 1049 1050 1051 1052
                        }
                        motion_x[4] += motion_x[k];
                        motion_y[4] += motion_y[k];
                    }

M
Michael Niedermayer 已提交
1053 1054 1055 1056
                    motion_x[5]=
                    motion_x[4]= RSHIFT(motion_x[4], 2);
                    motion_y[5]=
                    motion_y[4]= RSHIFT(motion_y[4], 2);
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 1093 1094

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

                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;
1103 1104 1105 1106 1107
                }

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

    return 0;
1129 1130
}

1131
/*
1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149
 * 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;
1150 1151
    int zero_run = 0;
    DCTELEM coeff = 0;
1152
    Vp3Fragment *fragment;
M
Michael Niedermayer 已提交
1153
    uint8_t *perm= s->scantable.permutated;
1154
    int bits_to_get;
1155

1156
    if ((first_fragment >= s->fragment_count) ||
1157 1158
        (last_fragment >= s->fragment_count)) {

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

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

        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 */
1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190
            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]);
            }
1191 1192 1193 1194
        }

        if (!eob_run) {
            fragment->coeff_count += zero_run;
1195 1196 1197 1198 1199 1200 1201
            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++;
            }
1202
            debug_vlc(" fragment %d coeff = %d\n",
1203
                s->coded_fragment_list[i], fragment->next_coeff[coeff_index]);
1204
        } else {
1205
            fragment->coeff_count |= 128;
1206
            debug_vlc(" fragment %d eob with %d coefficients\n",
1207
                s->coded_fragment_list[i], fragment->coeff_count&127);
1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218
            eob_run--;
        }
    }

    return eob_run;
}

/*
 * This function unpacks all of the DCT coefficient data from the
 * bitstream.
 */
1219
static int unpack_dct_coeffs(Vp3DecodeContext *s, GetBitContext *gb)
1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234
{
    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);
1235
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_y_table], 0,
1236
        s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1237 1238 1239 1240 1241

    /* 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,
1242
        s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
1243

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

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

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

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

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

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

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

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

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

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

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

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

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

    return 0;
1305 1306 1307 1308
}

/*
 * This function reverses the DC prediction for each coded fragment in
1309
 * the frame. Much of this function is adapted directly from the original
1310 1311 1312 1313 1314
 * 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)
1315
#define DC_COEFF(u) (s->coeffs[u].index ? 0 : s->coeffs[u].coeff) //FIXME do somethin to simplify this
1316 1317 1318 1319

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

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

    int x, y;
    int i = first_fragment;

1331
    int predicted_dc;
1332 1333 1334 1335 1336 1337 1338

    /* 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;

1339
    /*
1340 1341 1342 1343 1344 1345
     * The 6 fields mean:
     *   0: up-left multiplier
     *   1: up multiplier
     *   2: up-right multiplier
     *   3: left multiplier
     */
M
Michael Niedermayer 已提交
1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362
    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
1363 1364 1365 1366 1367
    };

    /* 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
1368
     * from other INTRA blocks. There are 2 golden frame coding types;
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 1400 1401
     * 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) {

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

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

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

                if (transform == 0) {

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

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

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

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

1469 1470 1471 1472 1473 1474 1475 1476
                /* 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;
1477
                /* save the DC */
1478 1479 1480 1481 1482 1483 1484
                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;
                }
1485 1486 1487 1488 1489
            }
        }
    }
}

1490 1491 1492 1493 1494 1495

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

1496 1497 1498 1499 1500 1501
/*
 * 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 已提交
1502
    int x;
1503 1504
    int m, n;
    int16_t *dequantizer;
1505
    DECLARE_ALIGNED_16(DCTELEM, block[64]);
1506 1507 1508 1509 1510 1511 1512 1513 1514 1515
    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 已提交
1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526
        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;
1527

1528

D
Diego Biurrun 已提交
1529
        if(FFABS(stride) > 2048)
1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549
            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;
1550
                    else
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 1586 1587
                        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;
                        }
                    }
1588

1589 1590 1591 1592

                    /* first, take care of copying a block from either the
                     * previous or the golden frame */
                    if (s->all_fragments[i].coding_method != MODE_INTRA) {
1593 1594 1595
                        /* 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
1596 1597 1598 1599 1600 1601 1602 1603 1604
                           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,
1605 1606
                                motion_source - d,
                                motion_source + stride + 1 + d,
1607 1608
                                stride, 8);
                        }
1609
                        dequantizer = s->qmat[1][plane];
1610
                    }else{
1611
                        dequantizer = s->qmat[0][plane];
1612 1613 1614
                    }

                    /* dequantize the DCT coefficients */
1615 1616
                    debug_idct("fragment %d, coding mode %d, DC = %d, dequant = %d:\n",
                        i, s->all_fragments[i].coding_method,
1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635
                        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 */
1636

1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655
                    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++) {
1656
                            debug_idct(" %3d", *(output_plane +
1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671
                                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);

                }
1672
#if 0
1673 1674 1675 1676 1677 1678 1679
                /* 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) */
1680
                if ((x > 0) &&
1681 1682 1683
                    ((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)) )) {
1684
                    horizontal_filter(
1685
                        output_plane + s->all_fragments[i].first_pixel + 7*stride,
M
Michael Niedermayer 已提交
1686
                        -stride, s->bounding_values_array + 127);
1687 1688
                }

1689 1690 1691 1692 1693 1694 1695
                /* 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) */
1696
                if ((y > 0) &&
1697 1698 1699
                    ((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)) )) {
1700
                    vertical_filter(
1701
                        output_plane + s->all_fragments[i].first_pixel - stride,
M
Michael Niedermayer 已提交
1702
                        -stride, s->bounding_values_array + 127);
1703
                }
1704
#endif
1705 1706 1707 1708 1709 1710 1711
            }
        }
    }

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

    emms_c();
}

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

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

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

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

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

1759
#if 0
1760
    int bounding_values_array[256];
1761 1762 1763 1764 1765 1766 1767
    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;
    }
1768
    filter_limit = vp31_filter_limit_values[s->quality_index];
1769 1770

    /* set up the bounding values */
1771
    memset(bounding_values_array, 0, 256 * sizeof(int));
1772 1773 1774 1775 1776 1777
    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;
    }
1778
#endif
1779 1780

    for (plane = 0; plane < 3; plane++) {
M
Michael Niedermayer 已提交
1781 1782 1783 1784 1785
        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 已提交
1786
        if (!s->flipped_image) stride = -stride;
1787 1788

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

1790
            for (x = 0; x < width; x++) {
M
Michael Niedermayer 已提交
1791
START_TIMER
1792 1793 1794 1795
                /* 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 已提交
1796
                        plane_data + s->all_fragments[fragment].first_pixel,
1797 1798 1799 1800 1801 1802 1803
                        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 已提交
1804
                        plane_data + s->all_fragments[fragment].first_pixel,
1805 1806 1807 1808 1809 1810 1811 1812 1813 1814
                        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 已提交
1815
                        plane_data + s->all_fragments[fragment + 1].first_pixel,
1816 1817 1818 1819 1820 1821 1822 1823 1824 1825
                        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 已提交
1826
                        plane_data + s->all_fragments[fragment + width].first_pixel,
1827 1828 1829 1830
                        stride, bounding_values);
                }

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

1837
/*
1838 1839 1840 1841
 * 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.
 */
1842
static void vp3_calculate_pixel_addresses(Vp3DecodeContext *s)
1843 1844 1845 1846 1847 1848 1849 1850 1851
{

    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++) {
1852
            s->all_fragments[i++].first_pixel =
1853 1854 1855
                s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[0] +
                    x * FRAGMENT_PIXELS;
1856
            debug_init("  fragment %d, first pixel @ %d\n",
1857 1858 1859 1860 1861
                i-1, s->all_fragments[i-1].first_pixel);
        }
    }

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

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

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

    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++) {
1899
            s->all_fragments[i++].first_pixel =
1900 1901 1902
                s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
                    s->golden_frame.linesize[0] +
                    x * FRAGMENT_PIXELS;
1903
            debug_init("  fragment %d, first pixel @ %d\n",
1904 1905 1906 1907 1908
                i-1, s->all_fragments[i-1].first_pixel);
        }
    }

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

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

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

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

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

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

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

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

1994 1995 1996 1997 1998 1999
    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);
2000
    debug_init("  total superblocks = %d, U starts @ %d, V starts @ %d\n",
2001
        s->superblock_count, s->u_superblock_start, s->v_superblock_start);
2002 2003 2004 2005 2006 2007
    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 已提交
2008 2009
        s->fragment_start[1],
        s->fragment_start[2]);
2010 2011

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

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

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

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 2090 2091
        /* 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);
        }
2092 2093
    }

2094 2095 2096 2097
    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);

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

2110 2111 2112 2113
    /* 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));
2114
    s->macroblock_coding = av_malloc(s->macroblock_count + 1);
2115 2116
    init_block_mapping(s);

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

2123 2124 2125 2126 2127 2128
    return 0;
}

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

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

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

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

    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];
2157

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

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

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

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

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

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

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

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

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

2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248
#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 已提交
2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269
    {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");
2270 2271
        return -1;
    }
M
Michael Niedermayer 已提交
2272 2273
    STOP_TIMER("unpack_dct_coeffs")}
    {START_TIMER
2274 2275

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

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

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

2296 2297 2298
    *data_size=sizeof(AVFrame);
    *(AVFrame*)data= s->current_frame;

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

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

    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);
2320
    av_free(s->coeffs);
2321 2322 2323 2324
    av_free(s->coded_fragment_list);
    av_free(s->superblock_fragments);
    av_free(s->superblock_macroblocks);
    av_free(s->macroblock_fragments);
2325
    av_free(s->macroblock_coding);
2326

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

    return 0;
}

2338 2339 2340 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 2368 2369
static int read_huffman_tree(AVCodecContext *avctx, GetBitContext *gb)
{
    Vp3DecodeContext *s = avctx->priv_data;

    if (get_bits(gb, 1)) {
        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;
}

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

2375
    s->theora = get_bits_long(gb, 24);
M
cleanup  
Michael Niedermayer 已提交
2376
    av_log(avctx, AV_LOG_INFO, "Theora bitstream version %X\n", s->theora);
2377

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

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

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

    if (s->theora >= 0x030400)
    {
2397
        skip_bits(gb, 32); /* total number of superblocks in a frame */
2398
        // fixme, the next field is 36bits long
2399 2400 2401
        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 */
2402

2403 2404
        skip_bits(gb, 24); /* frame width */
        skip_bits(gb, 24); /* frame height */
2405 2406 2407
    }
    else
    {
2408 2409
        skip_bits(gb, 24); /* frame width */
        skip_bits(gb, 24); /* frame height */
2410
    }
2411

2412
  if (s->theora >= 0x030200) {
2413 2414
    skip_bits(gb, 8); /* offset x */
    skip_bits(gb, 8); /* offset y */
2415
  }
2416

2417 2418 2419 2420
    skip_bits(gb, 32); /* fps numerator */
    skip_bits(gb, 32); /* fps denumerator */
    skip_bits(gb, 24); /* aspect numerator */
    skip_bits(gb, 24); /* aspect denumerator */
2421

M
Matthieu Castet 已提交
2422
    if (s->theora < 0x030200)
2423 2424
        skip_bits(gb, 5); /* keyframe frequency force */
    skip_bits(gb, 8); /* colorspace */
2425
    if (s->theora >= 0x030400)
2426 2427
        skip_bits(gb, 2); /* pixel format: 420,res,422,444 */
    skip_bits(gb, 24); /* bitrate */
2428

2429
    skip_bits(gb, 6); /* quality hint */
2430

M
Matthieu Castet 已提交
2431
    if (s->theora >= 0x030200)
2432
    {
2433
        skip_bits(gb, 5); /* keyframe frequency force */
2434

2435
        if (s->theora < 0x030400)
2436
            skip_bits(gb, 5); /* spare bits */
2437
    }
2438

2439
//    align_get_bits(gb);
2440

2441 2442 2443 2444 2445 2446
    avctx->width = s->width;
    avctx->height = s->height;

    return 0;
}

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

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

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

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

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

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

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

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

                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;
2523
                }
2524

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

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

2546
    s->theora_tables = 1;
2547

2548 2549 2550 2551 2552 2553 2554 2555
    return 0;
}

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

2560 2561 2562
    s->theora = 1;

    if (!avctx->extradata_size)
2563 2564
    {
        av_log(avctx, AV_LOG_ERROR, "Missing extradata!\n");
2565
        return -1;
2566
    }
2567

2568 2569 2570 2571 2572
    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;
    }
2573

2574 2575
  for(i=0;i<3;i++) {
    init_get_bits(&gb, header_start[i], header_len[i]);
2576 2577 2578

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

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

2586
    // FIXME: Check for this as well.
2587
    skip_bits(&gb, 6*8); /* "theora" */
2588

2589 2590 2591
    switch(ptype)
    {
        case 0x80:
2592
            theora_decode_header(avctx, &gb);
2593 2594
                break;
        case 0x81:
2595
// FIXME: is this needed? it breaks sometimes
2596 2597 2598
//            theora_decode_comments(avctx, gb);
            break;
        case 0x82:
2599
            theora_decode_tables(avctx, &gb);
2600 2601 2602 2603
            break;
        default:
            av_log(avctx, AV_LOG_ERROR, "Unknown Theora config packet: %d\n", ptype&~0x80);
            break;
2604
    }
2605 2606
    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);
2607 2608
    if (s->theora < 0x030200)
        break;
2609
  }
2610

M
Matthieu Castet 已提交
2611
    vp3_decode_init(avctx);
2612 2613 2614
    return 0;
}

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

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