Statistics
| Branch: | Revision:

ffmpeg / libavcodec / vp3.c @ e40f5d3c

History | View | Annotate | Download (100 KB)

1 d86053a4 Mike Melanson
/*
2
 *
3
 * Copyright (C) 2003 the ffmpeg project
4
 *
5
 * This library is free software; you can redistribute it and/or
6
 * modify it under the terms of the GNU Lesser General Public
7
 * License as published by the Free Software Foundation; either
8
 * version 2 of the License, or (at your option) any later version.
9
 *
10
 * This library is distributed in the hope that it will be useful,
11
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
13
 * Lesser General Public License for more details.
14
 *
15
 * You should have received a copy of the GNU Lesser General Public
16
 * License along with this library; if not, write to the Free Software
17
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
18
 *
19
 * VP3 Video Decoder by Mike Melanson (melanson@pcisys.net)
20 3d32b429 Mike Melanson
 * For more information about the VP3 coding process, visit:
21
 *   http://www.pcisys.net/~melanson/codecs/
22 d86053a4 Mike Melanson
 *
23 f44ee2c3 Alex Beregszaszi
 * Theora decoder by Alex Beregszaszi
24
 *
25 d86053a4 Mike Melanson
 */
26
27
/**
28
 * @file vp3.c
29
 * On2 VP3 Video Decoder
30
 */
31
32
#include <stdio.h>
33
#include <stdlib.h>
34
#include <string.h>
35
#include <unistd.h>
36
37
#include "common.h"
38
#include "avcodec.h"
39
#include "dsputil.h"
40
#include "mpegvideo.h"
41
#include "dsputil.h"
42
43
#include "vp3data.h"
44
45
#define FRAGMENT_PIXELS 8
46
47
/* 
48
 * Debugging Variables
49
 * 
50
 * Define one or more of the following compile-time variables to 1 to obtain
51
 * elaborate information about certain aspects of the decoding process.
52
 *
53 96a7e73b Mike Melanson
 * KEYFRAMES_ONLY: set this to 1 to only see keyframes (VP3 slideshow mode)
54 d86053a4 Mike Melanson
 * DEBUG_VP3: high-level decoding flow
55
 * DEBUG_INIT: initialization parameters
56
 * DEBUG_DEQUANTIZERS: display how the dequanization tables are built
57
 * DEBUG_BLOCK_CODING: unpacking the superblock/macroblock/fragment coding
58
 * DEBUG_MODES: unpacking the coding modes for individual fragments
59
 * DEBUG_VECTORS: display the motion vectors
60
 * DEBUG_TOKEN: display exhaustive information about each DCT token
61
 * DEBUG_VLC: display the VLCs as they are extracted from the stream
62
 * DEBUG_DC_PRED: display the process of reversing DC prediction
63
 * DEBUG_IDCT: show every detail of the IDCT process
64
 */
65
66 96a7e73b Mike Melanson
#define KEYFRAMES_ONLY 0
67
68 d86053a4 Mike Melanson
#define DEBUG_VP3 0
69
#define DEBUG_INIT 0
70
#define DEBUG_DEQUANTIZERS 0
71
#define DEBUG_BLOCK_CODING 0
72
#define DEBUG_MODES 0
73
#define DEBUG_VECTORS 0
74
#define DEBUG_TOKEN 0
75
#define DEBUG_VLC 0
76
#define DEBUG_DC_PRED 0
77
#define DEBUG_IDCT 0
78
79
#if DEBUG_VP3
80
#define debug_vp3 printf
81
#else
82
static inline void debug_vp3(const char *format, ...) { }
83
#endif
84
85
#if DEBUG_INIT
86
#define debug_init printf
87
#else
88
static inline void debug_init(const char *format, ...) { }
89
#endif
90
91
#if DEBUG_DEQUANTIZERS
92
#define debug_dequantizers printf 
93
#else
94
static inline void debug_dequantizers(const char *format, ...) { } 
95
#endif
96
97
#if DEBUG_BLOCK_CODING
98
#define debug_block_coding printf 
99
#else
100
static inline void debug_block_coding(const char *format, ...) { } 
101
#endif
102
103
#if DEBUG_MODES
104
#define debug_modes printf 
105
#else
106
static inline void debug_modes(const char *format, ...) { } 
107
#endif
108
109
#if DEBUG_VECTORS
110
#define debug_vectors printf 
111
#else
112
static inline void debug_vectors(const char *format, ...) { } 
113
#endif
114
115
#if DEBUG_TOKEN 
116
#define debug_token printf 
117
#else
118
static inline void debug_token(const char *format, ...) { } 
119
#endif
120
121
#if DEBUG_VLC
122
#define debug_vlc printf 
123
#else
124
static inline void debug_vlc(const char *format, ...) { } 
125
#endif
126
127
#if DEBUG_DC_PRED
128
#define debug_dc_pred printf 
129
#else
130
static inline void debug_dc_pred(const char *format, ...) { } 
131
#endif
132
133
#if DEBUG_IDCT
134
#define debug_idct printf 
135
#else
136
static inline void debug_idct(const char *format, ...) { } 
137
#endif
138
139
typedef struct Vp3Fragment {
140
    DCTELEM coeffs[64];
141
    int coding_method;
142
    int coeff_count;
143
    int last_coeff;
144
    int motion_x;
145
    int motion_y;
146
    /* address of first pixel taking into account which plane the fragment
147
     * lives on as well as the plane stride */
148
    int first_pixel;
149
    /* this is the macroblock that the fragment belongs to */
150
    int macroblock;
151
} Vp3Fragment;
152
153
#define SB_NOT_CODED        0
154
#define SB_PARTIALLY_CODED  1
155
#define SB_FULLY_CODED      2
156
157
#define MODE_INTER_NO_MV      0
158
#define MODE_INTRA            1
159
#define MODE_INTER_PLUS_MV    2
160
#define MODE_INTER_LAST_MV    3
161
#define MODE_INTER_PRIOR_LAST 4
162
#define MODE_USING_GOLDEN     5
163
#define MODE_GOLDEN_MV        6
164
#define MODE_INTER_FOURMV     7
165
#define CODING_MODE_COUNT     8
166
167
/* special internal mode */
168
#define MODE_COPY             8
169
170
/* There are 6 preset schemes, plus a free-form scheme */
171
static int ModeAlphabet[7][CODING_MODE_COUNT] =
172
{
173
    /* this is the custom scheme */
174
    { 0, 0, 0, 0, 0, 0, 0, 0 },
175
176
    /* scheme 1: Last motion vector dominates */
177
    {    MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,  
178
         MODE_INTER_PLUS_MV,    MODE_INTER_NO_MV,
179
         MODE_INTRA,            MODE_USING_GOLDEN,      
180
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },
181
182
    /* scheme 2 */
183
    {    MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,  
184
         MODE_INTER_NO_MV,      MODE_INTER_PLUS_MV,
185
         MODE_INTRA,            MODE_USING_GOLDEN,      
186
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },
187
188
    /* scheme 3 */
189
    {    MODE_INTER_LAST_MV,    MODE_INTER_PLUS_MV,     
190
         MODE_INTER_PRIOR_LAST, MODE_INTER_NO_MV,
191
         MODE_INTRA,            MODE_USING_GOLDEN,      
192
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },
193
194
    /* scheme 4 */
195
    {    MODE_INTER_LAST_MV,    MODE_INTER_PLUS_MV,     
196
         MODE_INTER_NO_MV,      MODE_INTER_PRIOR_LAST,
197
         MODE_INTRA,            MODE_USING_GOLDEN,      
198
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },
199
200
    /* scheme 5: No motion vector dominates */
201
    {    MODE_INTER_NO_MV,      MODE_INTER_LAST_MV,     
202
         MODE_INTER_PRIOR_LAST, MODE_INTER_PLUS_MV,
203
         MODE_INTRA,            MODE_USING_GOLDEN,      
204
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },
205
206
    /* scheme 6 */
207
    {    MODE_INTER_NO_MV,      MODE_USING_GOLDEN,      
208
         MODE_INTER_LAST_MV,    MODE_INTER_PRIOR_LAST,
209
         MODE_INTER_PLUS_MV,    MODE_INTRA,             
210
         MODE_GOLDEN_MV,        MODE_INTER_FOURMV },
211
212
};
213
214
#define MIN_DEQUANT_VAL 2
215
216
typedef struct Vp3DecodeContext {
217
    AVCodecContext *avctx;
218 f44ee2c3 Alex Beregszaszi
    int theora, theora_tables;
219 3c3f113e Alex Beregszaszi
    int version;
220 d86053a4 Mike Melanson
    int width, height;
221
    AVFrame golden_frame;
222
    AVFrame last_frame;
223
    AVFrame current_frame;
224
    int keyframe;
225
    DSPContext dsp;
226 9a7ad925 Alex Beregszaszi
    int flipped_image;
227 d86053a4 Mike Melanson
228
    int quality_index;
229
    int last_quality_index;
230
231
    int superblock_count;
232
    int superblock_width;
233
    int superblock_height;
234 892fc83e Mike Melanson
    int y_superblock_width;
235
    int y_superblock_height;
236
    int c_superblock_width;
237
    int c_superblock_height;
238 d86053a4 Mike Melanson
    int u_superblock_start;
239
    int v_superblock_start;
240
    unsigned char *superblock_coding;
241
242
    int macroblock_count;
243
    int macroblock_width;
244
    int macroblock_height;
245
246
    int fragment_count;
247
    int fragment_width;
248
    int fragment_height;
249
250
    Vp3Fragment *all_fragments;
251
    int u_fragment_start;
252
    int v_fragment_start;
253 f44ee2c3 Alex Beregszaszi
    
254
    /* tables */
255
    uint16_t coded_dc_scale_factor[64];
256
    uint32_t coded_quality_threshold[64];
257
    uint16_t coded_intra_y_dequant[64];
258
    uint16_t coded_intra_c_dequant[64];
259
    uint16_t coded_inter_dequant[64];
260 d86053a4 Mike Melanson
261
    /* this is a list of indices into the all_fragments array indicating
262
     * which of the fragments are coded */
263
    int *coded_fragment_list;
264
    int coded_fragment_list_index;
265
    int pixel_addresses_inited;
266
267
    VLC dc_vlc[16];
268
    VLC ac_vlc_1[16];
269
    VLC ac_vlc_2[16];
270
    VLC ac_vlc_3[16];
271
    VLC ac_vlc_4[16];
272
273
    int16_t intra_y_dequant[64];
274
    int16_t intra_c_dequant[64];
275
    int16_t inter_dequant[64];
276
277
    /* This table contains superblock_count * 16 entries. Each set of 16
278
     * numbers corresponds to the fragment indices 0..15 of the superblock.
279
     * An entry will be -1 to indicate that no entry corresponds to that
280
     * index. */
281
    int *superblock_fragments;
282
283
    /* This table contains superblock_count * 4 entries. Each set of 4
284
     * numbers corresponds to the macroblock indices 0..3 of the superblock.
285
     * An entry will be -1 to indicate that no entry corresponds to that
286
     * index. */
287
    int *superblock_macroblocks;
288
289
    /* This table contains macroblock_count * 6 entries. Each set of 6
290
     * numbers corresponds to the fragment indices 0..5 which comprise
291
     * the macroblock (4 Y fragments and 2 C fragments). */
292
    int *macroblock_fragments;
293 74c0ac12 Mike Melanson
    /* This is an array that indicates how a particular macroblock 
294
     * is coded. */
295 96a7e73b Mike Melanson
    unsigned char *macroblock_coding;
296 d86053a4 Mike Melanson
297 04331882 Mike Melanson
    int first_coded_y_fragment;
298
    int first_coded_c_fragment;
299
    int last_coded_y_fragment;
300
    int last_coded_c_fragment;
301
302 a2f11b3c Michael Niedermayer
    uint8_t edge_emu_buffer[9*2048]; //FIXME dynamic alloc
303 b928ec64 Michael Niedermayer
    uint8_t qscale_table[2048]; //FIXME dynamic alloc (width+15)/16
304 d86053a4 Mike Melanson
} Vp3DecodeContext;
305
306 3c3f113e Alex Beregszaszi
static int theora_decode_comments(AVCodecContext *avctx, GetBitContext gb);
307
static int theora_decode_tables(AVCodecContext *avctx, GetBitContext gb);
308
309 d86053a4 Mike Melanson
/************************************************************************
310 3d32b429 Mike Melanson
 * VP3 I/DCT
311
 ************************************************************************/
312
313
#define IdctAdjustBeforeShift 8
314
#define xC1S7 64277
315
#define xC2S6 60547
316
#define xC3S5 54491
317
#define xC4S4 46341
318
#define xC5S3 36410
319
#define xC6S2 25080
320
#define xC7S1 12785
321
322
void vp3_idct_c(int16_t *input_data, int16_t *dequant_matrix, 
323
    int16_t *output_data)
324
{
325
    int32_t intermediate_data[64];
326
    int32_t *ip = intermediate_data;
327
    int16_t *op = output_data;
328
329 e7015b41 Roman Shaposhnik
    int32_t A_, B_, C_, D_, _Ad, _Bd, _Cd, _Dd, E_, F_, G_, H_;
330 3d32b429 Mike Melanson
    int32_t _Ed, _Gd, _Add, _Bdd, _Fd, _Hd;
331
    int32_t t1, t2;
332
333
    int i, j;
334
335
    debug_idct("raw coefficient block:\n");
336
    for (i = 0; i < 8; i++) {
337
        for (j = 0; j < 8; j++) {
338
            debug_idct(" %5d", input_data[i * 8 + j]);
339
        }
340
        debug_idct("\n");
341
    }
342
    debug_idct("\n");
343
344
    for (i = 0; i < 64; i++) {
345
        j = dezigzag_index[i];
346
        intermediate_data[j] = dequant_matrix[i] * input_data[i];
347
    }
348
349
    debug_idct("dequantized block:\n");
350
    for (i = 0; i < 8; i++) {
351
        for (j = 0; j < 8; j++) {
352
            debug_idct(" %5d", intermediate_data[i * 8 + j]);
353
        }
354
        debug_idct("\n");
355
    }
356
    debug_idct("\n");
357
358
    /* Inverse DCT on the rows now */
359
    for (i = 0; i < 8; i++) {
360
        /* Check for non-zero values */
361
        if ( ip[0] | ip[1] | ip[2] | ip[3] | ip[4] | ip[5] | ip[6] | ip[7] ) {
362
            t1 = (int32_t)(xC1S7 * ip[1]);
363
            t2 = (int32_t)(xC7S1 * ip[7]);
364
            t1 >>= 16;
365
            t2 >>= 16;
366 e7015b41 Roman Shaposhnik
            A_ = t1 + t2;
367 3d32b429 Mike Melanson
368
            t1 = (int32_t)(xC7S1 * ip[1]);
369
            t2 = (int32_t)(xC1S7 * ip[7]);
370
            t1 >>= 16;
371
            t2 >>= 16;
372 e7015b41 Roman Shaposhnik
            B_ = t1 - t2;
373 3d32b429 Mike Melanson
374
            t1 = (int32_t)(xC3S5 * ip[3]);
375
            t2 = (int32_t)(xC5S3 * ip[5]);
376
            t1 >>= 16;
377
            t2 >>= 16;
378 e7015b41 Roman Shaposhnik
            C_ = t1 + t2;
379 3d32b429 Mike Melanson
380
            t1 = (int32_t)(xC3S5 * ip[5]);
381
            t2 = (int32_t)(xC5S3 * ip[3]);
382
            t1 >>= 16;
383
            t2 >>= 16;
384 e7015b41 Roman Shaposhnik
            D_ = t1 - t2;
385 3d32b429 Mike Melanson
386
387 e7015b41 Roman Shaposhnik
            t1 = (int32_t)(xC4S4 * (A_ - C_));
388 3d32b429 Mike Melanson
            t1 >>= 16;
389
            _Ad = t1;
390
391 e7015b41 Roman Shaposhnik
            t1 = (int32_t)(xC4S4 * (B_ - D_));
392 3d32b429 Mike Melanson
            t1 >>= 16;
393
            _Bd = t1;
394
395
396 e7015b41 Roman Shaposhnik
            _Cd = A_ + C_;
397
            _Dd = B_ + D_;
398 3d32b429 Mike Melanson
399
            t1 = (int32_t)(xC4S4 * (ip[0] + ip[4]));
400
            t1 >>= 16;
401 e7015b41 Roman Shaposhnik
            E_ = t1;
402 3d32b429 Mike Melanson
403
            t1 = (int32_t)(xC4S4 * (ip[0] - ip[4]));
404
            t1 >>= 16;
405 e7015b41 Roman Shaposhnik
            F_ = t1;
406 3d32b429 Mike Melanson
407
            t1 = (int32_t)(xC2S6 * ip[2]);
408
            t2 = (int32_t)(xC6S2 * ip[6]);
409
            t1 >>= 16;
410
            t2 >>= 16;
411 e7015b41 Roman Shaposhnik
            G_ = t1 + t2;
412 3d32b429 Mike Melanson
413
            t1 = (int32_t)(xC6S2 * ip[2]);
414
            t2 = (int32_t)(xC2S6 * ip[6]);
415
            t1 >>= 16;
416
            t2 >>= 16;
417 e7015b41 Roman Shaposhnik
            H_ = t1 - t2;
418 3d32b429 Mike Melanson
419
420 e7015b41 Roman Shaposhnik
            _Ed = E_ - G_;
421
            _Gd = E_ + G_;
422 3d32b429 Mike Melanson
423 e7015b41 Roman Shaposhnik
            _Add = F_ + _Ad;
424
            _Bdd = _Bd - H_;
425 3d32b429 Mike Melanson
426 e7015b41 Roman Shaposhnik
            _Fd = F_ - _Ad;
427
            _Hd = _Bd + H_;
428 3d32b429 Mike Melanson
429
            /*  Final sequence of operations over-write original inputs. */
430
            ip[0] = (int16_t)((_Gd + _Cd )   >> 0);
431
            ip[7] = (int16_t)((_Gd - _Cd )   >> 0);
432
433
            ip[1] = (int16_t)((_Add + _Hd )  >> 0);
434
            ip[2] = (int16_t)((_Add - _Hd )  >> 0);
435
436
            ip[3] = (int16_t)((_Ed + _Dd )   >> 0);
437
            ip[4] = (int16_t)((_Ed - _Dd )   >> 0);
438
439
            ip[5] = (int16_t)((_Fd + _Bdd )  >> 0);
440
            ip[6] = (int16_t)((_Fd - _Bdd )  >> 0);
441
442
        }
443
444
        ip += 8;            /* next row */
445
    }
446
447
    ip = intermediate_data;
448
449
    for ( i = 0; i < 8; i++) {
450
        /* Check for non-zero values (bitwise or faster than ||) */
451
        if ( ip[0 * 8] | ip[1 * 8] | ip[2 * 8] | ip[3 * 8] |
452
             ip[4 * 8] | ip[5 * 8] | ip[6 * 8] | ip[7 * 8] ) {
453
454
            t1 = (int32_t)(xC1S7 * ip[1*8]);
455
            t2 = (int32_t)(xC7S1 * ip[7*8]);
456
            t1 >>= 16;
457
            t2 >>= 16;
458 e7015b41 Roman Shaposhnik
            A_ = t1 + t2;
459 3d32b429 Mike Melanson
460
            t1 = (int32_t)(xC7S1 * ip[1*8]);
461
            t2 = (int32_t)(xC1S7 * ip[7*8]);
462
            t1 >>= 16;
463
            t2 >>= 16;
464 e7015b41 Roman Shaposhnik
            B_ = t1 - t2;
465 3d32b429 Mike Melanson
466
            t1 = (int32_t)(xC3S5 * ip[3*8]);
467
            t2 = (int32_t)(xC5S3 * ip[5*8]);
468
            t1 >>= 16;
469
            t2 >>= 16;
470 e7015b41 Roman Shaposhnik
            C_ = t1 + t2;
471 3d32b429 Mike Melanson
472
            t1 = (int32_t)(xC3S5 * ip[5*8]);
473
            t2 = (int32_t)(xC5S3 * ip[3*8]);
474
            t1 >>= 16;
475
            t2 >>= 16;
476 e7015b41 Roman Shaposhnik
            D_ = t1 - t2;
477 3d32b429 Mike Melanson
478
479 e7015b41 Roman Shaposhnik
            t1 = (int32_t)(xC4S4 * (A_ - C_));
480 3d32b429 Mike Melanson
            t1 >>= 16;
481
            _Ad = t1;
482
483 e7015b41 Roman Shaposhnik
            t1 = (int32_t)(xC4S4 * (B_ - D_));
484 3d32b429 Mike Melanson
            t1 >>= 16;
485
            _Bd = t1;
486
487
488 e7015b41 Roman Shaposhnik
            _Cd = A_ + C_;
489
            _Dd = B_ + D_;
490 3d32b429 Mike Melanson
491
            t1 = (int32_t)(xC4S4 * (ip[0*8] + ip[4*8]));
492
            t1 >>= 16;
493 e7015b41 Roman Shaposhnik
            E_ = t1;
494 3d32b429 Mike Melanson
495
            t1 = (int32_t)(xC4S4 * (ip[0*8] - ip[4*8]));
496
            t1 >>= 16;
497 e7015b41 Roman Shaposhnik
            F_ = t1;
498 3d32b429 Mike Melanson
499
            t1 = (int32_t)(xC2S6 * ip[2*8]);
500
            t2 = (int32_t)(xC6S2 * ip[6*8]);
501
            t1 >>= 16;
502
            t2 >>= 16;
503 e7015b41 Roman Shaposhnik
            G_ = t1 + t2;
504 3d32b429 Mike Melanson
505
            t1 = (int32_t)(xC6S2 * ip[2*8]);
506
            t2 = (int32_t)(xC2S6 * ip[6*8]);
507
            t1 >>= 16;
508
            t2 >>= 16;
509 e7015b41 Roman Shaposhnik
            H_ = t1 - t2;
510 3d32b429 Mike Melanson
511
512 e7015b41 Roman Shaposhnik
            _Ed = E_ - G_;
513
            _Gd = E_ + G_;
514 3d32b429 Mike Melanson
515 e7015b41 Roman Shaposhnik
            _Add = F_ + _Ad;
516
            _Bdd = _Bd - H_;
517 3d32b429 Mike Melanson
518 e7015b41 Roman Shaposhnik
            _Fd = F_ - _Ad;
519
            _Hd = _Bd + H_;
520 3d32b429 Mike Melanson
521
            _Gd += IdctAdjustBeforeShift;
522
            _Add += IdctAdjustBeforeShift;
523
            _Ed += IdctAdjustBeforeShift;
524
            _Fd += IdctAdjustBeforeShift;
525
526
            /* Final sequence of operations over-write original inputs. */
527
            op[0*8] = (int16_t)((_Gd + _Cd )   >> 4);
528
            op[7*8] = (int16_t)((_Gd - _Cd )   >> 4);
529
530
            op[1*8] = (int16_t)((_Add + _Hd )  >> 4);
531
            op[2*8] = (int16_t)((_Add - _Hd )  >> 4);
532
533
            op[3*8] = (int16_t)((_Ed + _Dd )   >> 4);
534
            op[4*8] = (int16_t)((_Ed - _Dd )   >> 4);
535
536
            op[5*8] = (int16_t)((_Fd + _Bdd )  >> 4);
537
            op[6*8] = (int16_t)((_Fd - _Bdd )  >> 4);
538
539
        } else {
540
541
            op[0*8] = 0;
542
            op[7*8] = 0;
543
            op[1*8] = 0;
544
            op[2*8] = 0;
545
            op[3*8] = 0;
546
            op[4*8] = 0;
547
            op[5*8] = 0;
548
            op[6*8] = 0;
549
        }
550
551
        ip++;            /* next column */
552
        op++;
553
    }
554
}
555
556
void vp3_idct_put(int16_t *input_data, int16_t *dequant_matrix, 
557
    uint8_t *dest, int stride)
558
{
559
    int16_t transformed_data[64];
560
    int16_t *op;
561
    int i, j;
562
563
    vp3_idct_c(input_data, dequant_matrix, transformed_data);
564
565
    /* place in final output */
566
    op = transformed_data;
567
    for (i = 0; i < 8; i++) {
568
        for (j = 0; j < 8; j++) {
569
            if (*op < -128)
570
                *dest = 0;
571
            else if (*op > 127)
572
                *dest = 255;
573
            else
574
                *dest = (uint8_t)(*op + 128);
575
            op++;
576
            dest++;
577
        }
578
        dest += (stride - 8);
579
    }
580
}
581
582
void vp3_idct_add(int16_t *input_data, int16_t *dequant_matrix, 
583
    uint8_t *dest, int stride)
584
{
585
    int16_t transformed_data[64];
586
    int16_t *op;
587
    int i, j;
588
    int16_t sample;
589
590
    vp3_idct_c(input_data, dequant_matrix, transformed_data);
591
592
    /* place in final output */
593
    op = transformed_data;
594
    for (i = 0; i < 8; i++) {
595
        for (j = 0; j < 8; j++) {
596
            sample = *dest + *op;
597
            if (sample < 0)
598
                *dest = 0;
599
            else if (sample > 255)
600
                *dest = 255;
601
            else
602
                *dest = (uint8_t)(sample & 0xFF);
603
            op++;
604
            dest++;
605
        }
606
        dest += (stride - 8);
607
    }
608
}
609
610
/************************************************************************
611 d86053a4 Mike Melanson
 * VP3 specific functions
612
 ************************************************************************/
613
614
/*
615
 * This function sets up all of the various blocks mappings:
616
 * superblocks <-> fragments, macroblocks <-> fragments,
617
 * superblocks <-> macroblocks
618 892fc83e Mike Melanson
 *
619
 * Returns 0 is successful; returns 1 if *anything* went wrong.
620 d86053a4 Mike Melanson
 */
621 892fc83e Mike Melanson
static int init_block_mapping(Vp3DecodeContext *s) 
622 d86053a4 Mike Melanson
{
623
    int i, j;
624
    signed int hilbert_walk_y[16];
625
    signed int hilbert_walk_c[16];
626
    signed int hilbert_walk_mb[4];
627
628
    int current_fragment = 0;
629
    int current_width = 0;
630
    int current_height = 0;
631
    int right_edge = 0;
632
    int bottom_edge = 0;
633
    int superblock_row_inc = 0;
634
    int *hilbert = NULL;
635
    int mapping_index = 0;
636
637
    int current_macroblock;
638
    int c_fragment;
639
640
    signed char travel_width[16] = {
641
         1,  1,  0, -1, 
642
         0,  0,  1,  0,
643
         1,  0,  1,  0,
644
         0, -1,  0,  1
645
    };
646
647
    signed char travel_height[16] = {
648
         0,  0,  1,  0,
649
         1,  1,  0, -1,
650
         0,  1,  0, -1,
651
        -1,  0, -1,  0
652
    };
653
654
    signed char travel_width_mb[4] = {
655
         1,  0,  1,  0
656
    };
657
658
    signed char travel_height_mb[4] = {
659
         0,  1,  0, -1
660
    };
661
662
    debug_vp3("  vp3: initialize block mapping tables\n");
663
664
    /* figure out hilbert pattern per these frame dimensions */
665
    hilbert_walk_y[0]  = 1;
666
    hilbert_walk_y[1]  = 1;
667
    hilbert_walk_y[2]  = s->fragment_width;
668
    hilbert_walk_y[3]  = -1;
669
    hilbert_walk_y[4]  = s->fragment_width;
670
    hilbert_walk_y[5]  = s->fragment_width;
671
    hilbert_walk_y[6]  = 1;
672
    hilbert_walk_y[7]  = -s->fragment_width;
673
    hilbert_walk_y[8]  = 1;
674
    hilbert_walk_y[9]  = s->fragment_width;
675
    hilbert_walk_y[10]  = 1;
676
    hilbert_walk_y[11] = -s->fragment_width;
677
    hilbert_walk_y[12] = -s->fragment_width;
678
    hilbert_walk_y[13] = -1;
679
    hilbert_walk_y[14] = -s->fragment_width;
680
    hilbert_walk_y[15] = 1;
681
682
    hilbert_walk_c[0]  = 1;
683
    hilbert_walk_c[1]  = 1;
684
    hilbert_walk_c[2]  = s->fragment_width / 2;
685
    hilbert_walk_c[3]  = -1;
686
    hilbert_walk_c[4]  = s->fragment_width / 2;
687
    hilbert_walk_c[5]  = s->fragment_width / 2;
688
    hilbert_walk_c[6]  = 1;
689
    hilbert_walk_c[7]  = -s->fragment_width / 2;
690
    hilbert_walk_c[8]  = 1;
691
    hilbert_walk_c[9]  = s->fragment_width / 2;
692
    hilbert_walk_c[10]  = 1;
693
    hilbert_walk_c[11] = -s->fragment_width / 2;
694
    hilbert_walk_c[12] = -s->fragment_width / 2;
695
    hilbert_walk_c[13] = -1;
696
    hilbert_walk_c[14] = -s->fragment_width / 2;
697
    hilbert_walk_c[15] = 1;
698
699
    hilbert_walk_mb[0] = 1;
700
    hilbert_walk_mb[1] = s->macroblock_width;
701
    hilbert_walk_mb[2] = 1;
702
    hilbert_walk_mb[3] = -s->macroblock_width;
703
704
    /* iterate through each superblock (all planes) and map the fragments */
705
    for (i = 0; i < s->superblock_count; i++) {
706
        debug_init("    superblock %d (u starts @ %d, v starts @ %d)\n",
707
            i, s->u_superblock_start, s->v_superblock_start);
708
709
        /* time to re-assign the limits? */
710
        if (i == 0) {
711
712
            /* start of Y superblocks */
713
            right_edge = s->fragment_width;
714
            bottom_edge = s->fragment_height;
715 892fc83e Mike Melanson
            current_width = -1;
716 d86053a4 Mike Melanson
            current_height = 0;
717 892fc83e Mike Melanson
            superblock_row_inc = 3 * s->fragment_width - 
718
                (s->y_superblock_width * 4 - s->fragment_width);
719 d86053a4 Mike Melanson
            hilbert = hilbert_walk_y;
720
721
            /* the first operation for this variable is to advance by 1 */
722
            current_fragment = -1;
723
724
        } else if (i == s->u_superblock_start) {
725
726
            /* start of U superblocks */
727
            right_edge = s->fragment_width / 2;
728
            bottom_edge = s->fragment_height / 2;
729 892fc83e Mike Melanson
            current_width = -1;
730 d86053a4 Mike Melanson
            current_height = 0;
731 892fc83e Mike Melanson
            superblock_row_inc = 3 * (s->fragment_width / 2) - 
732
                (s->c_superblock_width * 4 - s->fragment_width / 2);
733 d86053a4 Mike Melanson
            hilbert = hilbert_walk_c;
734
735
            /* the first operation for this variable is to advance by 1 */
736
            current_fragment = s->u_fragment_start - 1;
737
738
        } else if (i == s->v_superblock_start) {
739
740
            /* start of V superblocks */
741
            right_edge = s->fragment_width / 2;
742
            bottom_edge = s->fragment_height / 2;
743 892fc83e Mike Melanson
            current_width = -1;
744 d86053a4 Mike Melanson
            current_height = 0;
745 892fc83e Mike Melanson
            superblock_row_inc = 3 * (s->fragment_width / 2) - 
746
                (s->c_superblock_width * 4 - s->fragment_width / 2);
747 d86053a4 Mike Melanson
            hilbert = hilbert_walk_c;
748
749
            /* the first operation for this variable is to advance by 1 */
750
            current_fragment = s->v_fragment_start - 1;
751
752
        }
753
754 892fc83e Mike Melanson
        if (current_width >= right_edge - 1) {
755 d86053a4 Mike Melanson
            /* reset width and move to next superblock row */
756 892fc83e Mike Melanson
            current_width = -1;
757 d86053a4 Mike Melanson
            current_height += 4;
758
759
            /* fragment is now at the start of a new superblock row */
760
            current_fragment += superblock_row_inc;
761
        }
762
763
        /* iterate through all 16 fragments in a superblock */
764
        for (j = 0; j < 16; j++) {
765
            current_fragment += hilbert[j];
766 892fc83e Mike Melanson
            current_width += travel_width[j];
767 d86053a4 Mike Melanson
            current_height += travel_height[j];
768
769
            /* check if the fragment is in bounds */
770 892fc83e Mike Melanson
            if ((current_width < right_edge) &&
771 d86053a4 Mike Melanson
                (current_height < bottom_edge)) {
772
                s->superblock_fragments[mapping_index] = current_fragment;
773 892fc83e Mike Melanson
                debug_init("    mapping fragment %d to superblock %d, position %d (%d/%d x %d/%d)\n", 
774
                    s->superblock_fragments[mapping_index], i, j,
775
                    current_width, right_edge, current_height, bottom_edge);
776 d86053a4 Mike Melanson
            } else {
777
                s->superblock_fragments[mapping_index] = -1;
778 892fc83e Mike Melanson
                debug_init("    superblock %d, position %d has no fragment (%d/%d x %d/%d)\n", 
779
                    i, j,
780
                    current_width, right_edge, current_height, bottom_edge);
781 d86053a4 Mike Melanson
            }
782
783
            mapping_index++;
784
        }
785
    }
786
787
    /* initialize the superblock <-> macroblock mapping; iterate through
788
     * all of the Y plane superblocks to build this mapping */
789
    right_edge = s->macroblock_width;
790
    bottom_edge = s->macroblock_height;
791 892fc83e Mike Melanson
    current_width = -1;
792 d86053a4 Mike Melanson
    current_height = 0;
793 892fc83e Mike Melanson
    superblock_row_inc = s->macroblock_width -
794
        (s->y_superblock_width * 2 - s->macroblock_width);;
795 d86053a4 Mike Melanson
    hilbert = hilbert_walk_mb;
796
    mapping_index = 0;
797
    current_macroblock = -1;
798
    for (i = 0; i < s->u_superblock_start; i++) {
799
800 96a7e73b Mike Melanson
        if (current_width >= right_edge - 1) {
801 d86053a4 Mike Melanson
            /* reset width and move to next superblock row */
802 96a7e73b Mike Melanson
            current_width = -1;
803 d86053a4 Mike Melanson
            current_height += 2;
804
805
            /* macroblock is now at the start of a new superblock row */
806
            current_macroblock += superblock_row_inc;
807
        }
808
809
        /* iterate through each potential macroblock in the superblock */
810
        for (j = 0; j < 4; j++) {
811
            current_macroblock += hilbert_walk_mb[j];
812 892fc83e Mike Melanson
            current_width += travel_width_mb[j];
813 d86053a4 Mike Melanson
            current_height += travel_height_mb[j];
814
815
            /* check if the macroblock is in bounds */
816 892fc83e Mike Melanson
            if ((current_width < right_edge) &&
817 d86053a4 Mike Melanson
                (current_height < bottom_edge)) {
818
                s->superblock_macroblocks[mapping_index] = current_macroblock;
819 96a7e73b Mike Melanson
                debug_init("    mapping macroblock %d to superblock %d, position %d (%d/%d x %d/%d)\n",
820
                    s->superblock_macroblocks[mapping_index], i, j,
821
                    current_width, right_edge, current_height, bottom_edge);
822 d86053a4 Mike Melanson
            } else {
823
                s->superblock_macroblocks[mapping_index] = -1;
824 96a7e73b Mike Melanson
                debug_init("    superblock %d, position %d has no macroblock (%d/%d x %d/%d)\n",
825
                    i, j,
826
                    current_width, right_edge, current_height, bottom_edge);
827 d86053a4 Mike Melanson
            }
828
829
            mapping_index++;
830
        }
831
    }
832
833
    /* initialize the macroblock <-> fragment mapping */
834
    current_fragment = 0;
835
    current_macroblock = 0;
836
    mapping_index = 0;
837
    for (i = 0; i < s->fragment_height; i += 2) {
838
839
        for (j = 0; j < s->fragment_width; j += 2) {
840
841
            debug_init("    macroblock %d contains fragments: ", current_macroblock);
842
            s->all_fragments[current_fragment].macroblock = current_macroblock;
843
            s->macroblock_fragments[mapping_index++] = current_fragment;
844
            debug_init("%d ", current_fragment);
845
846
            if (j + 1 < s->fragment_width) {
847
                s->all_fragments[current_fragment + 1].macroblock = current_macroblock;
848
                s->macroblock_fragments[mapping_index++] = current_fragment + 1;
849
                debug_init("%d ", current_fragment + 1);
850
            } else
851
                s->macroblock_fragments[mapping_index++] = -1;
852
853
            if (i + 1 < s->fragment_height) {
854
                s->all_fragments[current_fragment + s->fragment_width].macroblock = 
855
                    current_macroblock;
856
                s->macroblock_fragments[mapping_index++] = 
857
                    current_fragment + s->fragment_width;
858
                debug_init("%d ", current_fragment + s->fragment_width);
859
            } else
860
                s->macroblock_fragments[mapping_index++] = -1;
861
862
            if ((j + 1 < s->fragment_width) && (i + 1 < s->fragment_height)) {
863
                s->all_fragments[current_fragment + s->fragment_width + 1].macroblock = 
864
                    current_macroblock;
865
                s->macroblock_fragments[mapping_index++] = 
866
                    current_fragment + s->fragment_width + 1;
867
                debug_init("%d ", current_fragment + s->fragment_width + 1);
868
            } else
869
                s->macroblock_fragments[mapping_index++] = -1;
870
871
            /* C planes */
872
            c_fragment = s->u_fragment_start + 
873
                (i * s->fragment_width / 4) + (j / 2);
874 892fc83e Mike Melanson
            s->all_fragments[c_fragment].macroblock = s->macroblock_count;
875 d86053a4 Mike Melanson
            s->macroblock_fragments[mapping_index++] = c_fragment;
876
            debug_init("%d ", c_fragment);
877
878
            c_fragment = s->v_fragment_start + 
879
                (i * s->fragment_width / 4) + (j / 2);
880 892fc83e Mike Melanson
            s->all_fragments[c_fragment].macroblock = s->macroblock_count;
881 d86053a4 Mike Melanson
            s->macroblock_fragments[mapping_index++] = c_fragment;
882
            debug_init("%d ", c_fragment);
883
884
            debug_init("\n");
885
886
            if (j + 2 <= s->fragment_width)
887
                current_fragment += 2;
888
            else 
889
                current_fragment++;
890
            current_macroblock++;
891
        }
892
893
        current_fragment += s->fragment_width;
894
    }
895 892fc83e Mike Melanson
896
    return 0;  /* successful path out */
897 d86053a4 Mike Melanson
}
898
899
/*
900
 * This function unpacks a single token (which should be in the range 0..31)
901
 * and returns a zero run (number of zero coefficients in current DCT matrix
902
 * before next non-zero coefficient), the next DCT coefficient, and the
903
 * number of consecutive, non-EOB'd DCT blocks to EOB.
904
 */
905
static void unpack_token(GetBitContext *gb, int token, int *zero_run,
906
                         DCTELEM *coeff, int *eob_run) 
907
{
908
    int sign;
909
910
    *zero_run = 0;
911
    *eob_run = 0;
912
    *coeff = 0;
913
914
    debug_token("    vp3 token %d: ", token);
915
    switch (token) {
916
917
    case 0:
918
        debug_token("DCT_EOB_TOKEN, EOB next block\n");
919
        *eob_run = 1;
920
        break;
921
922
    case 1:
923
        debug_token("DCT_EOB_PAIR_TOKEN, EOB next 2 blocks\n");
924
        *eob_run = 2;
925
        break;
926
927
    case 2:
928
        debug_token("DCT_EOB_TRIPLE_TOKEN, EOB next 3 blocks\n");
929
        *eob_run = 3;
930
        break;
931
932
    case 3:
933
        debug_token("DCT_REPEAT_RUN_TOKEN, ");
934
        *eob_run = get_bits(gb, 2) + 4;
935
        debug_token("EOB the next %d blocks\n", *eob_run);
936
        break;
937
938
    case 4:
939
        debug_token("DCT_REPEAT_RUN2_TOKEN, ");
940
        *eob_run = get_bits(gb, 3) + 8;
941
        debug_token("EOB the next %d blocks\n", *eob_run);
942
        break;
943
944
    case 5:
945
        debug_token("DCT_REPEAT_RUN3_TOKEN, ");
946
        *eob_run = get_bits(gb, 4) + 16;
947
        debug_token("EOB the next %d blocks\n", *eob_run);
948
        break;
949
950
    case 6:
951
        debug_token("DCT_REPEAT_RUN4_TOKEN, ");
952
        *eob_run = get_bits(gb, 12);
953
        debug_token("EOB the next %d blocks\n", *eob_run);
954
        break;
955
956
    case 7:
957
        debug_token("DCT_SHORT_ZRL_TOKEN, ");
958
        /* note that this token actually indicates that (3 extra bits) + 1 0s
959
         * should be output; this case specifies a run of (3 EBs) 0s and a
960
         * coefficient of 0. */
961
        *zero_run = get_bits(gb, 3);
962
        *coeff = 0;
963
        debug_token("skip the next %d positions in output matrix\n", *zero_run + 1);
964
        break;
965
966
    case 8:
967
        debug_token("DCT_ZRL_TOKEN, ");
968
        /* note that this token actually indicates that (6 extra bits) + 1 0s
969
         * should be output; this case specifies a run of (6 EBs) 0s and a
970
         * coefficient of 0. */
971
        *zero_run = get_bits(gb, 6);
972
        *coeff = 0;
973
        debug_token("skip the next %d positions in output matrix\n", *zero_run + 1);
974
        break;
975
976
    case 9:
977
        debug_token("ONE_TOKEN, output 1\n");
978
        *coeff = 1;
979
        break;
980
981
    case 10:
982
        debug_token("MINUS_ONE_TOKEN, output -1\n");
983
        *coeff = -1;
984
        break;
985
986
    case 11:
987
        debug_token("TWO_TOKEN, output 2\n");
988
        *coeff = 2;
989
        break;
990
991
    case 12:
992
        debug_token("MINUS_TWO_TOKEN, output -2\n");
993
        *coeff = -2;
994
        break;
995
996
    case 13:
997
    case 14:
998
    case 15:
999
    case 16:
1000
        debug_token("LOW_VAL_TOKENS, ");
1001
        if (get_bits(gb, 1))
1002
            *coeff = -(3 + (token - 13));
1003
        else
1004
            *coeff = 3 + (token - 13);
1005
        debug_token("output %d\n", *coeff);
1006
        break;
1007
1008
    case 17:
1009
        debug_token("DCT_VAL_CATEGORY3, ");
1010
        sign = get_bits(gb, 1);
1011
        *coeff = 7 + get_bits(gb, 1);
1012
        if (sign)
1013
            *coeff = -(*coeff);
1014
        debug_token("output %d\n", *coeff);
1015
        break;
1016
1017
    case 18:
1018
        debug_token("DCT_VAL_CATEGORY4, ");
1019
        sign = get_bits(gb, 1);
1020
        *coeff = 9 + get_bits(gb, 2);
1021
        if (sign)
1022
            *coeff = -(*coeff);
1023
        debug_token("output %d\n", *coeff);
1024
        break;
1025
1026
    case 19:
1027
        debug_token("DCT_VAL_CATEGORY5, ");
1028
        sign = get_bits(gb, 1);
1029
        *coeff = 13 + get_bits(gb, 3);
1030
        if (sign)
1031
            *coeff = -(*coeff);
1032
        debug_token("output %d\n", *coeff);
1033
        break;
1034
1035
    case 20:
1036
        debug_token("DCT_VAL_CATEGORY6, ");
1037
        sign = get_bits(gb, 1);
1038
        *coeff = 21 + get_bits(gb, 4);
1039
        if (sign)
1040
            *coeff = -(*coeff);
1041
        debug_token("output %d\n", *coeff);
1042
        break;
1043
1044
    case 21:
1045
        debug_token("DCT_VAL_CATEGORY7, ");
1046
        sign = get_bits(gb, 1);
1047
        *coeff = 37 + get_bits(gb, 5);
1048
        if (sign)
1049
            *coeff = -(*coeff);
1050
        debug_token("output %d\n", *coeff);
1051
        break;
1052
1053
    case 22:
1054
        debug_token("DCT_VAL_CATEGORY8, ");
1055
        sign = get_bits(gb, 1);
1056
        *coeff = 69 + get_bits(gb, 9);
1057
        if (sign)
1058
            *coeff = -(*coeff);
1059
        debug_token("output %d\n", *coeff);
1060
        break;
1061
1062
    case 23:
1063
    case 24:
1064
    case 25:
1065
    case 26:
1066
    case 27:
1067
        debug_token("DCT_RUN_CATEGORY1, ");
1068
        *zero_run = token - 22;
1069
        if (get_bits(gb, 1))
1070
            *coeff = -1;
1071
        else
1072
            *coeff = 1;
1073
        debug_token("output %d 0s, then %d\n", *zero_run, *coeff);
1074
        break;
1075
1076
    case 28:
1077
        debug_token("DCT_RUN_CATEGORY1B, ");
1078
        if (get_bits(gb, 1))
1079
            *coeff = -1;
1080
        else
1081
            *coeff = 1;
1082
        *zero_run = 6 + get_bits(gb, 2);
1083
        debug_token("output %d 0s, then %d\n", *zero_run, *coeff);
1084
        break;
1085
1086
    case 29:
1087
        debug_token("DCT_RUN_CATEGORY1C, ");
1088
        if (get_bits(gb, 1))
1089
            *coeff = -1;
1090
        else
1091
            *coeff = 1;
1092
        *zero_run = 10 + get_bits(gb, 3);
1093
        debug_token("output %d 0s, then %d\n", *zero_run, *coeff);
1094
        break;
1095
1096
    case 30:
1097
        debug_token("DCT_RUN_CATEGORY2, ");
1098
        sign = get_bits(gb, 1);
1099
        *coeff = 2 + get_bits(gb, 1);
1100
        if (sign)
1101
            *coeff = -(*coeff);
1102
        *zero_run = 1;
1103
        debug_token("output %d 0s, then %d\n", *zero_run, *coeff);
1104
        break;
1105
1106
    case 31:
1107
        debug_token("DCT_RUN_CATEGORY2, ");
1108
        sign = get_bits(gb, 1);
1109
        *coeff = 2 + get_bits(gb, 1);
1110
        if (sign)
1111
            *coeff = -(*coeff);
1112
        *zero_run = 2 + get_bits(gb, 1);
1113
        debug_token("output %d 0s, then %d\n", *zero_run, *coeff);
1114
        break;
1115
1116
    default:
1117 9b879566 Michel Bardiaux
        av_log(NULL, AV_LOG_ERROR, "  vp3: help! Got a bad token: %d > 31\n", token);
1118 d86053a4 Mike Melanson
        break;
1119
1120
  }
1121
}
1122
1123
/*
1124
 * This function wipes out all of the fragment data.
1125
 */
1126
static void init_frame(Vp3DecodeContext *s, GetBitContext *gb)
1127
{
1128
    int i;
1129
1130
    /* zero out all of the fragment information */
1131
    s->coded_fragment_list_index = 0;
1132
    for (i = 0; i < s->fragment_count; i++) {
1133
        memset(s->all_fragments[i].coeffs, 0, 64 * sizeof(DCTELEM));
1134
        s->all_fragments[i].coeff_count = 0;
1135
        s->all_fragments[i].last_coeff = 0;
1136 642d7e84 Mike Melanson
s->all_fragments[i].motion_x = 0xbeef;
1137
s->all_fragments[i].motion_y = 0xbeef;
1138 d86053a4 Mike Melanson
    }
1139
}
1140
1141
/*
1142
 * This function sets of the dequantization tables used for a particular
1143
 * frame.
1144
 */
1145
static void init_dequantizer(Vp3DecodeContext *s)
1146
{
1147
1148 f44ee2c3 Alex Beregszaszi
    int quality_scale = s->coded_quality_threshold[s->quality_index];
1149
    int dc_scale_factor = s->coded_dc_scale_factor[s->quality_index];
1150 d86053a4 Mike Melanson
    int i, j;
1151
1152
    debug_vp3("  vp3: initializing dequantization tables\n");
1153
1154
    /* 
1155
     * Scale dequantizers:
1156
     *
1157
     *   quantizer * sf
1158
     *   --------------
1159
     *        100
1160
     *
1161
     * where sf = dc_scale_factor for DC quantizer
1162
     *           or quality_scale for AC quantizer
1163
     *
1164
     * Then, saturate the result to a lower limit of MIN_DEQUANT_VAL.
1165
     */
1166 3d32b429 Mike Melanson
#define SCALER 4
1167 d86053a4 Mike Melanson
1168
    /* scale DC quantizers */
1169 f44ee2c3 Alex Beregszaszi
    s->intra_y_dequant[0] = s->coded_intra_y_dequant[0] * dc_scale_factor / 100;
1170 d86053a4 Mike Melanson
    if (s->intra_y_dequant[0] < MIN_DEQUANT_VAL * 2)
1171
        s->intra_y_dequant[0] = MIN_DEQUANT_VAL * 2;
1172
    s->intra_y_dequant[0] *= SCALER;
1173
1174 f44ee2c3 Alex Beregszaszi
    s->intra_c_dequant[0] = s->coded_intra_c_dequant[0] * dc_scale_factor / 100;
1175 d86053a4 Mike Melanson
    if (s->intra_c_dequant[0] < MIN_DEQUANT_VAL * 2)
1176
        s->intra_c_dequant[0] = MIN_DEQUANT_VAL * 2;
1177
    s->intra_c_dequant[0] *= SCALER;
1178
1179 f44ee2c3 Alex Beregszaszi
    s->inter_dequant[0] = s->coded_inter_dequant[0] * dc_scale_factor / 100;
1180 d86053a4 Mike Melanson
    if (s->inter_dequant[0] < MIN_DEQUANT_VAL * 4)
1181
        s->inter_dequant[0] = MIN_DEQUANT_VAL * 4;
1182
    s->inter_dequant[0] *= SCALER;
1183
1184
    /* scale AC quantizers, zigzag at the same time in preparation for
1185
     * the dequantization phase */
1186
    for (i = 1; i < 64; i++) {
1187
1188 463d086b Mike Melanson
        j = zigzag_index[i];
1189 d86053a4 Mike Melanson
1190 f44ee2c3 Alex Beregszaszi
        s->intra_y_dequant[j] = s->coded_intra_y_dequant[i] * quality_scale / 100;
1191 d86053a4 Mike Melanson
        if (s->intra_y_dequant[j] < MIN_DEQUANT_VAL)
1192
            s->intra_y_dequant[j] = MIN_DEQUANT_VAL;
1193
        s->intra_y_dequant[j] *= SCALER;
1194
1195 f44ee2c3 Alex Beregszaszi
        s->intra_c_dequant[j] = s->coded_intra_c_dequant[i] * quality_scale / 100;
1196 d86053a4 Mike Melanson
        if (s->intra_c_dequant[j] < MIN_DEQUANT_VAL)
1197
            s->intra_c_dequant[j] = MIN_DEQUANT_VAL;
1198
        s->intra_c_dequant[j] *= SCALER;
1199
1200 f44ee2c3 Alex Beregszaszi
        s->inter_dequant[j] = s->coded_inter_dequant[i] * quality_scale / 100;
1201 d86053a4 Mike Melanson
        if (s->inter_dequant[j] < MIN_DEQUANT_VAL * 2)
1202
            s->inter_dequant[j] = MIN_DEQUANT_VAL * 2;
1203
        s->inter_dequant[j] *= SCALER;
1204
    }
1205 b928ec64 Michael Niedermayer
    
1206
    memset(s->qscale_table, (FFMAX(s->intra_y_dequant[1], s->intra_c_dequant[1])+8)/16, 512); //FIXME finetune
1207 d86053a4 Mike Melanson
1208
    /* print debug information as requested */
1209
    debug_dequantizers("intra Y dequantizers:\n");
1210
    for (i = 0; i < 8; i++) {
1211
      for (j = i * 8; j < i * 8 + 8; j++) {
1212
        debug_dequantizers(" %4d,", s->intra_y_dequant[j]);
1213
      }
1214
      debug_dequantizers("\n");
1215
    }
1216
    debug_dequantizers("\n");
1217
1218
    debug_dequantizers("intra C dequantizers:\n");
1219
    for (i = 0; i < 8; i++) {
1220
      for (j = i * 8; j < i * 8 + 8; j++) {
1221
        debug_dequantizers(" %4d,", s->intra_c_dequant[j]);
1222
      }
1223
      debug_dequantizers("\n");
1224
    }
1225
    debug_dequantizers("\n");
1226
1227
    debug_dequantizers("interframe dequantizers:\n");
1228
    for (i = 0; i < 8; i++) {
1229
      for (j = i * 8; j < i * 8 + 8; j++) {
1230
        debug_dequantizers(" %4d,", s->inter_dequant[j]);
1231
      }
1232
      debug_dequantizers("\n");
1233
    }
1234
    debug_dequantizers("\n");
1235
}
1236
1237
/*
1238
 * This function is used to fetch runs of 1s or 0s from the bitstream for
1239
 * use in determining which superblocks are fully and partially coded.
1240
 *
1241
 *  Codeword                RunLength
1242
 *  0                       1
1243
 *  10x                     2-3
1244
 *  110x                    4-5
1245
 *  1110xx                  6-9
1246
 *  11110xxx                10-17
1247
 *  111110xxxx              18-33
1248
 *  111111xxxxxxxxxxxx      34-4129
1249
 */
1250
static int get_superblock_run_length(GetBitContext *gb)
1251
{
1252
1253
    if (get_bits(gb, 1) == 0)
1254
        return 1;
1255
1256
    else if (get_bits(gb, 1) == 0)
1257
        return (2 + get_bits(gb, 1));
1258
1259
    else if (get_bits(gb, 1) == 0)
1260
        return (4 + get_bits(gb, 1));
1261
1262
    else if (get_bits(gb, 1) == 0)
1263
        return (6 + get_bits(gb, 2));
1264
1265
    else if (get_bits(gb, 1) == 0)
1266
        return (10 + get_bits(gb, 3));
1267
1268
    else if (get_bits(gb, 1) == 0)
1269
        return (18 + get_bits(gb, 4));
1270
1271
    else
1272
        return (34 + get_bits(gb, 12));
1273
1274
}
1275
1276
/*
1277
 * This function is used to fetch runs of 1s or 0s from the bitstream for
1278
 * use in determining which particular fragments are coded.
1279
 *
1280
 * Codeword                RunLength
1281
 * 0x                      1-2
1282
 * 10x                     3-4
1283
 * 110x                    5-6
1284
 * 1110xx                  7-10
1285
 * 11110xx                 11-14
1286
 * 11111xxxx               15-30
1287
 */
1288
static int get_fragment_run_length(GetBitContext *gb)
1289
{
1290
1291
    if (get_bits(gb, 1) == 0)
1292
        return (1 + get_bits(gb, 1));
1293
1294
    else if (get_bits(gb, 1) == 0)
1295
        return (3 + get_bits(gb, 1));
1296
1297
    else if (get_bits(gb, 1) == 0)
1298
        return (5 + get_bits(gb, 1));
1299
1300
    else if (get_bits(gb, 1) == 0)
1301
        return (7 + get_bits(gb, 2));
1302
1303
    else if (get_bits(gb, 1) == 0)
1304
        return (11 + get_bits(gb, 2));
1305
1306
    else
1307
        return (15 + get_bits(gb, 4));
1308
1309
}
1310
1311
/*
1312
 * This function decodes a VLC from the bitstream and returns a number
1313
 * that ranges from 0..7. The number indicates which of the 8 coding
1314
 * modes to use.
1315
 *
1316
 *  VLC       Number
1317
 *  0            0
1318
 *  10           1
1319
 *  110          2
1320
 *  1110         3
1321
 *  11110        4
1322
 *  111110       5
1323
 *  1111110      6
1324
 *  1111111      7
1325
 *
1326
 */
1327
static int get_mode_code(GetBitContext *gb)
1328
{
1329
1330
    if (get_bits(gb, 1) == 0)
1331
        return 0;
1332
1333
    else if (get_bits(gb, 1) == 0)
1334
        return 1;
1335
1336
    else if (get_bits(gb, 1) == 0)
1337
        return 2;
1338
1339
    else if (get_bits(gb, 1) == 0)
1340
        return 3;
1341
1342
    else if (get_bits(gb, 1) == 0)
1343
        return 4;
1344
1345
    else if (get_bits(gb, 1) == 0)
1346
        return 5;
1347
1348
    else if (get_bits(gb, 1) == 0)
1349
        return 6;
1350
1351
    else
1352
        return 7;
1353
1354
}
1355
1356
/*
1357
 * This function extracts a motion vector from the bitstream using a VLC
1358
 * scheme. 3 bits are fetched from the bitstream and 1 of 8 actions is
1359
 * taken depending on the value on those 3 bits:
1360
 *
1361
 *  0: return 0
1362
 *  1: return 1
1363
 *  2: return -1
1364
 *  3: if (next bit is 1) return -2, else return 2
1365
 *  4: if (next bit is 1) return -3, else return 3
1366
 *  5: return 4 + (next 2 bits), next bit is sign
1367
 *  6: return 8 + (next 3 bits), next bit is sign
1368
 *  7: return 16 + (next 4 bits), next bit is sign
1369
 */
1370
static int get_motion_vector_vlc(GetBitContext *gb)
1371
{
1372
    int bits;
1373
1374
    bits = get_bits(gb, 3);
1375
1376
    switch(bits) {
1377
1378
    case 0:
1379
        bits = 0;
1380
        break;
1381
1382
    case 1:
1383
        bits = 1;
1384
        break;
1385
1386
    case 2:
1387
        bits = -1;
1388
        break;
1389
1390
    case 3:
1391
        if (get_bits(gb, 1) == 0)
1392
            bits = 2;
1393
        else
1394
            bits = -2;
1395
        break;
1396
1397
    case 4:
1398
        if (get_bits(gb, 1) == 0)
1399
            bits = 3;
1400
        else
1401
            bits = -3;
1402
        break;
1403
1404
    case 5:
1405
        bits = 4 + get_bits(gb, 2);
1406
        if (get_bits(gb, 1) == 1)
1407
            bits = -bits;
1408
        break;
1409
1410
    case 6:
1411
        bits = 8 + get_bits(gb, 3);
1412
        if (get_bits(gb, 1) == 1)
1413
            bits = -bits;
1414
        break;
1415
1416
    case 7:
1417
        bits = 16 + get_bits(gb, 4);
1418
        if (get_bits(gb, 1) == 1)
1419
            bits = -bits;
1420
        break;
1421
1422
    }
1423
1424
    return bits;
1425
}
1426
1427
/*
1428
 * This function fetches a 5-bit number from the stream followed by
1429
 * a sign and calls it a motion vector.
1430
 */
1431
static int get_motion_vector_fixed(GetBitContext *gb)
1432
{
1433
1434
    int bits;
1435
1436
    bits = get_bits(gb, 5);
1437
1438
    if (get_bits(gb, 1) == 1)
1439
        bits = -bits;
1440
1441
    return bits;
1442
}
1443
1444
/*
1445
 * This function unpacks all of the superblock/macroblock/fragment coding 
1446
 * information from the bitstream.
1447
 */
1448 892fc83e Mike Melanson
static int unpack_superblocks(Vp3DecodeContext *s, GetBitContext *gb)
1449 d86053a4 Mike Melanson
{
1450
    int bit = 0;
1451
    int current_superblock = 0;
1452
    int current_run = 0;
1453
    int decode_fully_flags = 0;
1454
    int decode_partial_blocks = 0;
1455 22493ab9 Mike Melanson
    int first_c_fragment_seen;
1456 d86053a4 Mike Melanson
1457
    int i, j;
1458
    int current_fragment;
1459
1460
    debug_vp3("  vp3: unpacking superblock coding\n");
1461
1462
    if (s->keyframe) {
1463
1464
        debug_vp3("    keyframe-- all superblocks are fully coded\n");
1465
        memset(s->superblock_coding, SB_FULLY_CODED, s->superblock_count);
1466
1467
    } else {
1468
1469
        /* unpack the list of partially-coded superblocks */
1470
        bit = get_bits(gb, 1);
1471
        /* toggle the bit because as soon as the first run length is 
1472
         * fetched the bit will be toggled again */
1473
        bit ^= 1;
1474
        while (current_superblock < s->superblock_count) {
1475
            if (current_run == 0) {
1476
                bit ^= 1;
1477
                current_run = get_superblock_run_length(gb);
1478
                debug_block_coding("      setting superblocks %d..%d to %s\n",
1479
                    current_superblock,
1480
                    current_superblock + current_run - 1,
1481
                    (bit) ? "partially coded" : "not coded");
1482
1483
                /* if any of the superblocks are not partially coded, flag
1484
                 * a boolean to decode the list of fully-coded superblocks */
1485 642d7e84 Mike Melanson
                if (bit == 0) {
1486 d86053a4 Mike Melanson
                    decode_fully_flags = 1;
1487 642d7e84 Mike Melanson
                } else {
1488 d86053a4 Mike Melanson
1489 642d7e84 Mike Melanson
                    /* make a note of the fact that there are partially coded
1490
                     * superblocks */
1491
                    decode_partial_blocks = 1;
1492
                }
1493 d86053a4 Mike Melanson
            }
1494
            s->superblock_coding[current_superblock++] = 
1495
                (bit) ? SB_PARTIALLY_CODED : SB_NOT_CODED;
1496
            current_run--;
1497
        }
1498
1499
        /* unpack the list of fully coded superblocks if any of the blocks were
1500
         * not marked as partially coded in the previous step */
1501
        if (decode_fully_flags) {
1502
1503
            current_superblock = 0;
1504
            current_run = 0;
1505
            bit = get_bits(gb, 1);
1506
            /* toggle the bit because as soon as the first run length is 
1507
             * fetched the bit will be toggled again */
1508
            bit ^= 1;
1509
            while (current_superblock < s->superblock_count) {
1510
1511
                /* skip any superblocks already marked as partially coded */
1512
                if (s->superblock_coding[current_superblock] == SB_NOT_CODED) {
1513
1514
                    if (current_run == 0) {
1515
                        bit ^= 1;
1516
                        current_run = get_superblock_run_length(gb);
1517
                    }
1518
1519
                    debug_block_coding("      setting superblock %d to %s\n",
1520
                        current_superblock,
1521
                        (bit) ? "fully coded" : "not coded");
1522
                    s->superblock_coding[current_superblock] = 
1523
                        (bit) ? SB_FULLY_CODED : SB_NOT_CODED;
1524
                    current_run--;
1525
                }
1526
                current_superblock++;
1527
            }
1528
        }
1529
1530
        /* if there were partial blocks, initialize bitstream for
1531
         * unpacking fragment codings */
1532
        if (decode_partial_blocks) {
1533
1534
            current_run = 0;
1535
            bit = get_bits(gb, 1);
1536
            /* toggle the bit because as soon as the first run length is 
1537
             * fetched the bit will be toggled again */
1538
            bit ^= 1;
1539
        }
1540
    }
1541
1542
    /* figure out which fragments are coded; iterate through each
1543
     * superblock (all planes) */
1544
    s->coded_fragment_list_index = 0;
1545 04331882 Mike Melanson
    s->first_coded_y_fragment = s->first_coded_c_fragment = 0;
1546
    s->last_coded_y_fragment = s->last_coded_c_fragment = -1;
1547 22493ab9 Mike Melanson
    first_c_fragment_seen = 0;
1548 96a7e73b Mike Melanson
    memset(s->macroblock_coding, MODE_COPY, s->macroblock_count);
1549 d86053a4 Mike Melanson
    for (i = 0; i < s->superblock_count; i++) {
1550
1551
        /* iterate through all 16 fragments in a superblock */
1552
        for (j = 0; j < 16; j++) {
1553
1554
            /* if the fragment is in bounds, check its coding status */
1555
            current_fragment = s->superblock_fragments[i * 16 + j];
1556 892fc83e Mike Melanson
            if (current_fragment >= s->fragment_count) {
1557 9b879566 Michel Bardiaux
                av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_superblocks(): bad fragment number (%d >= %d)\n",
1558 892fc83e Mike Melanson
                    current_fragment, s->fragment_count);
1559
                return 1;
1560
            }
1561 d86053a4 Mike Melanson
            if (current_fragment != -1) {
1562
                if (s->superblock_coding[i] == SB_NOT_CODED) {
1563
1564
                    /* copy all the fragments from the prior frame */
1565
                    s->all_fragments[current_fragment].coding_method = 
1566
                        MODE_COPY;
1567
1568
                } else if (s->superblock_coding[i] == SB_PARTIALLY_CODED) {
1569
1570
                    /* fragment may or may not be coded; this is the case
1571
                     * that cares about the fragment coding runs */
1572
                    if (current_run == 0) {
1573
                        bit ^= 1;
1574
                        current_run = get_fragment_run_length(gb);
1575
                    }
1576
1577
                    if (bit) {
1578 22493ab9 Mike Melanson
                        /* default mode; actual mode will be decoded in 
1579
                         * the next phase */
1580 d86053a4 Mike Melanson
                        s->all_fragments[current_fragment].coding_method = 
1581
                            MODE_INTER_NO_MV;
1582 04331882 Mike Melanson
                        s->coded_fragment_list[s->coded_fragment_list_index] = 
1583 d86053a4 Mike Melanson
                            current_fragment;
1584 04331882 Mike Melanson
                        if ((current_fragment >= s->u_fragment_start) &&
1585 22493ab9 Mike Melanson
                            (s->last_coded_y_fragment == -1) &&
1586
                            (!first_c_fragment_seen)) {
1587 04331882 Mike Melanson
                            s->first_coded_c_fragment = s->coded_fragment_list_index;
1588
                            s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
1589 22493ab9 Mike Melanson
                            first_c_fragment_seen = 1;
1590 04331882 Mike Melanson
                        }
1591
                        s->coded_fragment_list_index++;
1592 96a7e73b Mike Melanson
                        s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
1593 d86053a4 Mike Melanson
                        debug_block_coding("      superblock %d is partially coded, fragment %d is coded\n",
1594
                            i, current_fragment);
1595
                    } else {
1596
                        /* not coded; copy this fragment from the prior frame */
1597
                        s->all_fragments[current_fragment].coding_method =
1598
                            MODE_COPY;
1599
                        debug_block_coding("      superblock %d is partially coded, fragment %d is not coded\n",
1600
                            i, current_fragment);
1601
                    }
1602
1603
                    current_run--;
1604
1605
                } else {
1606
1607
                    /* fragments are fully coded in this superblock; actual
1608
                     * coding will be determined in next step */
1609
                    s->all_fragments[current_fragment].coding_method = 
1610
                        MODE_INTER_NO_MV;
1611 04331882 Mike Melanson
                    s->coded_fragment_list[s->coded_fragment_list_index] = 
1612 d86053a4 Mike Melanson
                        current_fragment;
1613 04331882 Mike Melanson
                    if ((current_fragment >= s->u_fragment_start) &&
1614 22493ab9 Mike Melanson
                        (s->last_coded_y_fragment == -1) &&
1615
                        (!first_c_fragment_seen)) {
1616 04331882 Mike Melanson
                        s->first_coded_c_fragment = s->coded_fragment_list_index;
1617
                        s->last_coded_y_fragment = s->first_coded_c_fragment - 1;
1618 22493ab9 Mike Melanson
                        first_c_fragment_seen = 1;
1619 04331882 Mike Melanson
                    }
1620
                    s->coded_fragment_list_index++;
1621 96a7e73b Mike Melanson
                    s->macroblock_coding[s->all_fragments[current_fragment].macroblock] = MODE_INTER_NO_MV;
1622 d86053a4 Mike Melanson
                    debug_block_coding("      superblock %d is fully coded, fragment %d is coded\n",
1623
                        i, current_fragment);
1624
                }
1625
            }
1626
        }
1627
    }
1628 04331882 Mike Melanson
1629 22493ab9 Mike Melanson
    if (!first_c_fragment_seen)
1630
        /* only Y fragments coded in this frame */
1631 04331882 Mike Melanson
        s->last_coded_y_fragment = s->coded_fragment_list_index - 1;
1632 22493ab9 Mike Melanson
    else 
1633 642d7e84 Mike Melanson
        /* end the list of coded C fragments */
1634 04331882 Mike Melanson
        s->last_coded_c_fragment = s->coded_fragment_list_index - 1;
1635 22493ab9 Mike Melanson
1636 04331882 Mike Melanson
    debug_block_coding("    %d total coded fragments, y: %d -> %d, c: %d -> %d\n",
1637
        s->coded_fragment_list_index,
1638
        s->first_coded_y_fragment,
1639
        s->last_coded_y_fragment,
1640
        s->first_coded_c_fragment,
1641
        s->last_coded_c_fragment);
1642 892fc83e Mike Melanson
1643
    return 0;
1644 d86053a4 Mike Melanson
}
1645
1646
/*
1647
 * This function unpacks all the coding mode data for individual macroblocks
1648
 * from the bitstream.
1649
 */
1650 892fc83e Mike Melanson
static int unpack_modes(Vp3DecodeContext *s, GetBitContext *gb)
1651 d86053a4 Mike Melanson
{
1652
    int i, j, k;
1653
    int scheme;
1654
    int current_macroblock;
1655
    int current_fragment;
1656
    int coding_mode;
1657
1658
    debug_vp3("  vp3: unpacking encoding modes\n");
1659
1660
    if (s->keyframe) {
1661
        debug_vp3("    keyframe-- all blocks are coded as INTRA\n");
1662
1663
        for (i = 0; i < s->fragment_count; i++)
1664
            s->all_fragments[i].coding_method = MODE_INTRA;
1665
1666
    } else {
1667
1668
        /* fetch the mode coding scheme for this frame */
1669
        scheme = get_bits(gb, 3);
1670
        debug_modes("    using mode alphabet %d\n", scheme);
1671
1672
        /* is it a custom coding scheme? */
1673
        if (scheme == 0) {
1674
            debug_modes("    custom mode alphabet ahead:\n");
1675
            for (i = 0; i < 8; i++)
1676 a466e345 Mike Melanson
                ModeAlphabet[scheme][get_bits(gb, 3)] = i;
1677 d86053a4 Mike Melanson
        }
1678
1679
        for (i = 0; i < 8; i++)
1680
            debug_modes("      mode[%d][%d] = %d\n", scheme, i, 
1681
                ModeAlphabet[scheme][i]);
1682
1683
        /* iterate through all of the macroblocks that contain 1 or more
1684
         * coded fragments */
1685
        for (i = 0; i < s->u_superblock_start; i++) {
1686
1687
            for (j = 0; j < 4; j++) {
1688
                current_macroblock = s->superblock_macroblocks[i * 4 + j];
1689
                if ((current_macroblock == -1) ||
1690 96a7e73b Mike Melanson
                    (s->macroblock_coding[current_macroblock] == MODE_COPY))
1691 d86053a4 Mike Melanson
                    continue;
1692 892fc83e Mike Melanson
                if (current_macroblock >= s->macroblock_count) {
1693 9b879566 Michel Bardiaux
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_modes(): bad macroblock number (%d >= %d)\n",
1694 892fc83e Mike Melanson
                        current_macroblock, s->macroblock_count);
1695
                    return 1;
1696
                }
1697 d86053a4 Mike Melanson
1698
                /* mode 7 means get 3 bits for each coding mode */
1699
                if (scheme == 7)
1700
                    coding_mode = get_bits(gb, 3);
1701
                else
1702
                    coding_mode = ModeAlphabet[scheme][get_mode_code(gb)];
1703
1704 96a7e73b Mike Melanson
                s->macroblock_coding[current_macroblock] = coding_mode;
1705 d86053a4 Mike Melanson
                for (k = 0; k < 6; k++) {
1706
                    current_fragment = 
1707
                        s->macroblock_fragments[current_macroblock * 6 + k];
1708 892fc83e Mike Melanson
                    if (current_fragment == -1)
1709
                        continue;
1710
                    if (current_fragment >= s->fragment_count) {
1711 9b879566 Michel Bardiaux
                        av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_modes(): bad fragment number (%d >= %d)\n",
1712 892fc83e Mike Melanson
                            current_fragment, s->fragment_count);
1713
                        return 1;
1714
                    }
1715 d86053a4 Mike Melanson
                    if (s->all_fragments[current_fragment].coding_method != 
1716
                        MODE_COPY)
1717
                        s->all_fragments[current_fragment].coding_method =
1718
                            coding_mode;
1719
                }
1720
1721
                debug_modes("    coding method for macroblock starting @ fragment %d = %d\n",
1722
                    s->macroblock_fragments[current_macroblock * 6], coding_mode);
1723
            }
1724
        }
1725
    }
1726 892fc83e Mike Melanson
1727
    return 0;
1728 44ae98dd Mike Melanson
}
1729
1730
/*
1731 d86053a4 Mike Melanson
 * This function unpacks all the motion vectors for the individual
1732
 * macroblocks from the bitstream.
1733
 */
1734 892fc83e Mike Melanson
static int unpack_vectors(Vp3DecodeContext *s, GetBitContext *gb)
1735 d86053a4 Mike Melanson
{
1736
    int i, j, k;
1737
    int coding_mode;
1738
    int motion_x[6];
1739
    int motion_y[6];
1740
    int last_motion_x = 0;
1741
    int last_motion_y = 0;
1742
    int prior_last_motion_x = 0;
1743
    int prior_last_motion_y = 0;
1744
    int current_macroblock;
1745
    int current_fragment;
1746
1747
    debug_vp3("  vp3: unpacking motion vectors\n");
1748
    if (s->keyframe) {
1749
1750
        debug_vp3("    keyframe-- there are no motion vectors\n");
1751
1752
    } else {
1753
1754
        memset(motion_x, 0, 6 * sizeof(int));
1755
        memset(motion_y, 0, 6 * sizeof(int));
1756
1757
        /* coding mode 0 is the VLC scheme; 1 is the fixed code scheme */
1758
        coding_mode = get_bits(gb, 1);
1759
        debug_vectors("    using %s scheme for unpacking motion vectors\n",
1760
            (coding_mode == 0) ? "VLC" : "fixed-length");
1761
1762
        /* iterate through all of the macroblocks that contain 1 or more
1763
         * coded fragments */
1764
        for (i = 0; i < s->u_superblock_start; i++) {
1765
1766
            for (j = 0; j < 4; j++) {
1767
                current_macroblock = s->superblock_macroblocks[i * 4 + j];
1768
                if ((current_macroblock == -1) ||
1769 96a7e73b Mike Melanson
                    (s->macroblock_coding[current_macroblock] == MODE_COPY))
1770 d86053a4 Mike Melanson
                    continue;
1771 892fc83e Mike Melanson
                if (current_macroblock >= s->macroblock_count) {
1772 9b879566 Michel Bardiaux
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad macroblock number (%d >= %d)\n",
1773 892fc83e Mike Melanson
                        current_macroblock, s->macroblock_count);
1774
                    return 1;
1775
                }
1776 d86053a4 Mike Melanson
1777
                current_fragment = s->macroblock_fragments[current_macroblock * 6];
1778 892fc83e Mike Melanson
                if (current_fragment >= s->fragment_count) {
1779 9b879566 Michel Bardiaux
                    av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad fragment number (%d >= %d\n",
1780 892fc83e Mike Melanson
                        current_fragment, s->fragment_count);
1781
                    return 1;
1782
                }
1783 96a7e73b Mike Melanson
                switch (s->macroblock_coding[current_macroblock]) {
1784 d86053a4 Mike Melanson
1785
                case MODE_INTER_PLUS_MV:
1786
                case MODE_GOLDEN_MV:
1787
                    /* all 6 fragments use the same motion vector */
1788
                    if (coding_mode == 0) {
1789
                        motion_x[0] = get_motion_vector_vlc(gb);
1790
                        motion_y[0] = get_motion_vector_vlc(gb);
1791
                    } else {
1792
                        motion_x[0] = get_motion_vector_fixed(gb);
1793
                        motion_y[0] = get_motion_vector_fixed(gb);
1794
                    }
1795
                    for (k = 1; k < 6; k++) {
1796
                        motion_x[k] = motion_x[0];
1797
                        motion_y[k] = motion_y[0];
1798
                    }
1799
1800
                    /* vector maintenance, only on MODE_INTER_PLUS_MV */
1801 642d7e84 Mike Melanson
                    if (s->macroblock_coding[current_macroblock] ==
1802 d86053a4 Mike Melanson
                        MODE_INTER_PLUS_MV) {
1803
                        prior_last_motion_x = last_motion_x;
1804
                        prior_last_motion_y = last_motion_y;
1805
                        last_motion_x = motion_x[0];
1806
                        last_motion_y = motion_y[0];
1807
                    }
1808
                    break;
1809
1810
                case MODE_INTER_FOURMV:
1811
                    /* fetch 4 vectors from the bitstream, one for each
1812
                     * Y fragment, then average for the C fragment vectors */
1813
                    motion_x[4] = motion_y[4] = 0;
1814
                    for (k = 0; k < 4; k++) {
1815
                        if (coding_mode == 0) {
1816
                            motion_x[k] = get_motion_vector_vlc(gb);
1817
                            motion_y[k] = get_motion_vector_vlc(gb);
1818
                        } else {
1819
                            motion_x[k] = get_motion_vector_fixed(gb);
1820
                            motion_y[k] = get_motion_vector_fixed(gb);
1821
                        }
1822
                        motion_x[4] += motion_x[k];
1823
                        motion_y[4] += motion_y[k];
1824
                    }
1825
1826
                    if (motion_x[4] >= 0) 
1827
                        motion_x[4] = (motion_x[4] + 2) / 4;
1828
                    else
1829
                        motion_x[4] = (motion_x[4] - 2) / 4;
1830
                    motion_x[5] = motion_x[4];
1831
1832
                    if (motion_y[4] >= 0) 
1833
                        motion_y[4] = (motion_y[4] + 2) / 4;
1834
                    else
1835
                        motion_y[4] = (motion_y[4] - 2) / 4;
1836
                    motion_y[5] = motion_y[4];
1837
1838
                    /* vector maintenance; vector[3] is treated as the
1839
                     * last vector in this case */
1840
                    prior_last_motion_x = last_motion_x;
1841
                    prior_last_motion_y = last_motion_y;
1842
                    last_motion_x = motion_x[3];
1843
                    last_motion_y = motion_y[3];
1844
                    break;
1845
1846
                case MODE_INTER_LAST_MV:
1847
                    /* all 6 fragments use the last motion vector */
1848
                    motion_x[0] = last_motion_x;
1849
                    motion_y[0] = last_motion_y;
1850
                    for (k = 1; k < 6; k++) {
1851
                        motion_x[k] = motion_x[0];
1852
                        motion_y[k] = motion_y[0];
1853
                    }
1854
1855
                    /* no vector maintenance (last vector remains the
1856
                     * last vector) */
1857
                    break;
1858
1859
                case MODE_INTER_PRIOR_LAST:
1860
                    /* all 6 fragments use the motion vector prior to the
1861
                     * last motion vector */
1862
                    motion_x[0] = prior_last_motion_x;
1863
                    motion_y[0] = prior_last_motion_y;
1864
                    for (k = 1; k < 6; k++) {
1865
                        motion_x[k] = motion_x[0];
1866
                        motion_y[k] = motion_y[0];
1867
                    }
1868
1869
                    /* vector maintenance */
1870
                    prior_last_motion_x = last_motion_x;
1871
                    prior_last_motion_y = last_motion_y;
1872
                    last_motion_x = motion_x[0];
1873
                    last_motion_y = motion_y[0];
1874
                    break;
1875 44ae98dd Mike Melanson
1876
                default:
1877
                    /* covers intra, inter without MV, golden without MV */
1878
                    memset(motion_x, 0, 6 * sizeof(int));
1879
                    memset(motion_y, 0, 6 * sizeof(int));
1880
1881
                    /* no vector maintenance */
1882
                    break;
1883 d86053a4 Mike Melanson
                }
1884
1885
                /* assign the motion vectors to the correct fragments */
1886
                debug_vectors("    vectors for macroblock starting @ fragment %d (coding method %d):\n",
1887
                    current_fragment,
1888 642d7e84 Mike Melanson
                    s->macroblock_coding[current_macroblock]);
1889 d86053a4 Mike Melanson
                for (k = 0; k < 6; k++) {
1890
                    current_fragment = 
1891
                        s->macroblock_fragments[current_macroblock * 6 + k];
1892 892fc83e Mike Melanson
                    if (current_fragment == -1)
1893
                        continue;
1894
                    if (current_fragment >= s->fragment_count) {
1895 9b879566 Michel Bardiaux
                        av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vectors(): bad fragment number (%d >= %d)\n",
1896 892fc83e Mike Melanson
                            current_fragment, s->fragment_count);
1897
                        return 1;
1898
                    }
1899 d86053a4 Mike Melanson
                    s->all_fragments[current_fragment].motion_x = motion_x[k];
1900 44ae98dd Mike Melanson
                    s->all_fragments[current_fragment].motion_y = motion_y[k];
1901 642d7e84 Mike Melanson
                    debug_vectors("    vector %d: fragment %d = (%d, %d)\n",
1902
                        k, current_fragment, motion_x[k], motion_y[k]);
1903 d86053a4 Mike Melanson
                }
1904
            }
1905
        }
1906
    }
1907 892fc83e Mike Melanson
1908
    return 0;
1909 d86053a4 Mike Melanson
}
1910
1911
/* 
1912
 * This function is called by unpack_dct_coeffs() to extract the VLCs from
1913
 * the bitstream. The VLCs encode tokens which are used to unpack DCT
1914
 * data. This function unpacks all the VLCs for either the Y plane or both
1915
 * C planes, and is called for DC coefficients or different AC coefficient
1916
 * levels (since different coefficient types require different VLC tables.
1917
 *
1918
 * This function returns a residual eob run. E.g, if a particular token gave
1919
 * instructions to EOB the next 5 fragments and there were only 2 fragments
1920
 * left in the current fragment range, 3 would be returned so that it could
1921
 * be passed into the next call to this same function.
1922
 */
1923
static int unpack_vlcs(Vp3DecodeContext *s, GetBitContext *gb,
1924
                        VLC *table, int coeff_index,
1925
                        int first_fragment, int last_fragment,
1926
                        int eob_run)
1927
{
1928
    int i;
1929
    int token;
1930
    int zero_run;
1931
    DCTELEM coeff;
1932
    Vp3Fragment *fragment;
1933
1934 22493ab9 Mike Melanson
    if ((first_fragment >= s->fragment_count) ||
1935 74c0ac12 Mike Melanson
        (last_fragment >= s->fragment_count)) {
1936
1937 9b879566 Michel Bardiaux
        av_log(s->avctx, AV_LOG_ERROR, "  vp3:unpack_vlcs(): bad fragment number (%d -> %d ?)\n",
1938 74c0ac12 Mike Melanson
            first_fragment, last_fragment);
1939 22493ab9 Mike Melanson
        return 0;
1940 74c0ac12 Mike Melanson
    }
1941
1942 04331882 Mike Melanson
    for (i = first_fragment; i <= last_fragment; i++) {
1943 d86053a4 Mike Melanson
1944
        fragment = &s->all_fragments[s->coded_fragment_list[i]];
1945
        if (fragment->coeff_count > coeff_index)
1946
            continue;
1947
1948
        if (!eob_run) {
1949
            /* decode a VLC into a token */
1950
            token = get_vlc2(gb, table->table, 5, 3);
1951
            debug_vlc(" token = %2d, ", token);
1952
            /* use the token to get a zero run, a coefficient, and an eob run */
1953
            unpack_token(gb, token, &zero_run, &coeff, &eob_run);
1954
        }
1955
1956
        if (!eob_run) {
1957
            fragment->coeff_count += zero_run;
1958
            if (fragment->coeff_count < 64)
1959
                fragment->coeffs[fragment->coeff_count++] = coeff;
1960
            debug_vlc(" fragment %d coeff = %d\n",
1961
                s->coded_fragment_list[i], fragment->coeffs[coeff_index]);
1962
        } else {
1963
            fragment->last_coeff = fragment->coeff_count;
1964
            fragment->coeff_count = 64;
1965
            debug_vlc(" fragment %d eob with %d coefficients\n", 
1966
                s->coded_fragment_list[i], fragment->last_coeff);
1967
            eob_run--;
1968
        }
1969
    }
1970
1971
    return eob_run;
1972
}
1973
1974
/*
1975
 * This function unpacks all of the DCT coefficient data from the
1976
 * bitstream.
1977
 */
1978 892fc83e Mike Melanson
static int unpack_dct_coeffs(Vp3DecodeContext *s, GetBitContext *gb)
1979 d86053a4 Mike Melanson
{
1980
    int i;
1981
    int dc_y_table;
1982
    int dc_c_table;
1983
    int ac_y_table;
1984
    int ac_c_table;
1985
    int residual_eob_run = 0;
1986
1987
    /* fetch the DC table indices */
1988
    dc_y_table = get_bits(gb, 4);
1989
    dc_c_table = get_bits(gb, 4);
1990
1991
    /* unpack the Y plane DC coefficients */
1992
    debug_vp3("  vp3: unpacking Y plane DC coefficients using table %d\n",
1993
        dc_y_table);
1994
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_y_table], 0, 
1995 04331882 Mike Melanson
        s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
1996 d86053a4 Mike Melanson
1997
    /* unpack the C plane DC coefficients */
1998
    debug_vp3("  vp3: unpacking C plane DC coefficients using table %d\n",
1999
        dc_c_table);
2000
    residual_eob_run = unpack_vlcs(s, gb, &s->dc_vlc[dc_c_table], 0,
2001 04331882 Mike Melanson
        s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
2002 d86053a4 Mike Melanson
2003 a466e345 Mike Melanson
    /* fetch the AC table indices */
2004 d86053a4 Mike Melanson
    ac_y_table = get_bits(gb, 4);
2005
    ac_c_table = get_bits(gb, 4);
2006
2007 a466e345 Mike Melanson
    /* unpack the group 1 AC coefficients (coeffs 1-5) */
2008 d86053a4 Mike Melanson
    for (i = 1; i <= 5; i++) {
2009
2010
        debug_vp3("  vp3: unpacking level %d Y plane AC coefficients using table %d\n",
2011
            i, ac_y_table);
2012
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_y_table], i, 
2013 04331882 Mike Melanson
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
2014 d86053a4 Mike Melanson
2015
        debug_vp3("  vp3: unpacking level %d C plane AC coefficients using table %d\n",
2016
            i, ac_c_table);
2017
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_1[ac_c_table], i, 
2018 04331882 Mike Melanson
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
2019 d86053a4 Mike Melanson
    }
2020
2021 a466e345 Mike Melanson
    /* unpack the group 2 AC coefficients (coeffs 6-14) */
2022 d86053a4 Mike Melanson
    for (i = 6; i <= 14; i++) {
2023
2024
        debug_vp3("  vp3: unpacking level %d Y plane AC coefficients using table %d\n",
2025
            i, ac_y_table);
2026
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_y_table], i, 
2027 04331882 Mike Melanson
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
2028 d86053a4 Mike Melanson
2029
        debug_vp3("  vp3: unpacking level %d C plane AC coefficients using table %d\n",
2030
            i, ac_c_table);
2031
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_2[ac_c_table], i, 
2032 04331882 Mike Melanson
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
2033 d86053a4 Mike Melanson
    }
2034
2035 a466e345 Mike Melanson
    /* unpack the group 3 AC coefficients (coeffs 15-27) */
2036 d86053a4 Mike Melanson
    for (i = 15; i <= 27; i++) {
2037
2038
        debug_vp3("  vp3: unpacking level %d Y plane AC coefficients using table %d\n",
2039
            i, ac_y_table);
2040
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_y_table], i, 
2041 04331882 Mike Melanson
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
2042 d86053a4 Mike Melanson
2043
        debug_vp3("  vp3: unpacking level %d C plane AC coefficients using table %d\n",
2044
            i, ac_c_table);
2045
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_3[ac_c_table], i, 
2046 04331882 Mike Melanson
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
2047 d86053a4 Mike Melanson
    }
2048
2049 a466e345 Mike Melanson
    /* unpack the group 4 AC coefficients (coeffs 28-63) */
2050 d86053a4 Mike Melanson
    for (i = 28; i <= 63; i++) {
2051
2052
        debug_vp3("  vp3: unpacking level %d Y plane AC coefficients using table %d\n",
2053
            i, ac_y_table);
2054
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_y_table], i, 
2055 04331882 Mike Melanson
            s->first_coded_y_fragment, s->last_coded_y_fragment, residual_eob_run);
2056 d86053a4 Mike Melanson
2057
        debug_vp3("  vp3: unpacking level %d C plane AC coefficients using table %d\n",
2058
            i, ac_c_table);
2059
        residual_eob_run = unpack_vlcs(s, gb, &s->ac_vlc_4[ac_c_table], i, 
2060 04331882 Mike Melanson
            s->first_coded_c_fragment, s->last_coded_c_fragment, residual_eob_run);
2061 d86053a4 Mike Melanson
    }
2062 892fc83e Mike Melanson
2063
    return 0;
2064 d86053a4 Mike Melanson
}
2065
2066
/*
2067
 * This function reverses the DC prediction for each coded fragment in
2068
 * the frame. Much of this function is adapted directly from the original 
2069
 * VP3 source code.
2070
 */
2071
#define COMPATIBLE_FRAME(x) \
2072
  (compatible_frame[s->all_fragments[x].coding_method] == current_frame_type)
2073
#define FRAME_CODED(x) (s->all_fragments[x].coding_method != MODE_COPY)
2074
static inline int iabs (int x) { return ((x < 0) ? -x : x); }
2075
2076
static void reverse_dc_prediction(Vp3DecodeContext *s,
2077
                                  int first_fragment,
2078
                                  int fragment_width,
2079
                                  int fragment_height) 
2080
{
2081
2082
#define PUL 8
2083
#define PU 4
2084
#define PUR 2
2085
#define PL 1
2086
2087
    int x, y;
2088
    int i = first_fragment;
2089
2090
    /*
2091
     * Fragment prediction groups:
2092
     *
2093
     * 32222222226
2094
     * 10000000004
2095
     * 10000000004
2096
     * 10000000004
2097
     * 10000000004
2098
     *
2099
     * Note: Groups 5 and 7 do not exist as it would mean that the 
2100
     * fragment's x coordinate is both 0 and (width - 1) at the same time.
2101
     */
2102
    int predictor_group;
2103
    short predicted_dc;
2104
2105
    /* validity flags for the left, up-left, up, and up-right fragments */
2106
    int fl, ful, fu, fur;
2107
2108
    /* DC values for the left, up-left, up, and up-right fragments */
2109
    int vl, vul, vu, vur;
2110
2111
    /* indices for the left, up-left, up, and up-right fragments */
2112
    int l, ul, u, ur;
2113
2114
    /* 
2115
     * The 6 fields mean:
2116
     *   0: up-left multiplier
2117
     *   1: up multiplier
2118
     *   2: up-right multiplier
2119
     *   3: left multiplier
2120
     *   4: mask
2121
     *   5: right bit shift divisor (e.g., 7 means >>=7, a.k.a. div by 128)
2122
     */
2123
    int predictor_transform[16][6] = {
2124
        {  0,  0,  0,  0,   0,  0 },
2125
        {  0,  0,  0,  1,   0,  0 },        // PL
2126
        {  0,  0,  1,  0,   0,  0 },        // PUR
2127
        {  0,  0, 53, 75, 127,  7 },        // PUR|PL
2128
        {  0,  1,  0,  0,   0,  0 },        // PU
2129
        {  0,  1,  0,  1,   1,  1 },        // PU|PL
2130
        {  0,  1,  0,  0,   0,  0 },        // PU|PUR
2131
        {  0,  0, 53, 75, 127,  7 },        // PU|PUR|PL
2132
        {  1,  0,  0,  0,   0,  0 },        // PUL
2133
        {  0,  0,  0,  1,   0,  0 },        // PUL|PL
2134
        {  1,  0,  1,  0,   1,  1 },        // PUL|PUR
2135
        {  0,  0, 53, 75, 127,  7 },        // PUL|PUR|PL
2136
        {  0,  1,  0,  0,   0,  0 },        // PUL|PU
2137
        {-26, 29,  0, 29,  31,  5 },        // PUL|PU|PL
2138
        {  3, 10,  3,  0,  15,  4 },        // PUL|PU|PUR
2139
        {-26, 29,  0, 29,  31,  5 }         // PUL|PU|PUR|PL
2140
    };
2141
2142
    /* This table shows which types of blocks can use other blocks for
2143
     * prediction. For example, INTRA is the only mode in this table to
2144
     * have a frame number of 0. That means INTRA blocks can only predict
2145
     * from other INTRA blocks. There are 2 golden frame coding types; 
2146
     * blocks encoding in these modes can only predict from other blocks
2147
     * that were encoded with these 1 of these 2 modes. */
2148
    unsigned char compatible_frame[8] = {
2149
        1,    /* MODE_INTER_NO_MV */
2150
        0,    /* MODE_INTRA */
2151
        1,    /* MODE_INTER_PLUS_MV */
2152
        1,    /* MODE_INTER_LAST_MV */
2153
        1,    /* MODE_INTER_PRIOR_MV */
2154
        2,    /* MODE_USING_GOLDEN */
2155
        2,    /* MODE_GOLDEN_MV */
2156
        1     /* MODE_INTER_FOUR_MV */
2157
    };
2158
    int current_frame_type;
2159
2160
    /* there is a last DC predictor for each of the 3 frame types */
2161
    short last_dc[3];
2162
2163
    int transform = 0;
2164
2165
    debug_vp3("  vp3: reversing DC prediction\n");
2166
2167
    vul = vu = vur = vl = 0;
2168
    last_dc[0] = last_dc[1] = last_dc[2] = 0;
2169
2170
    /* for each fragment row... */
2171
    for (y = 0; y < fragment_height; y++) {
2172
2173
        /* for each fragment in a row... */
2174
        for (x = 0; x < fragment_width; x++, i++) {
2175
2176
            /* reverse prediction if this block was coded */
2177
            if (s->all_fragments[i].coding_method != MODE_COPY) {
2178
2179
                current_frame_type = 
2180
                    compatible_frame[s->all_fragments[i].coding_method];
2181
                predictor_group = (x == 0) + ((y == 0) << 1) +
2182
                    ((x + 1 == fragment_width) << 2);
2183
                debug_dc_pred(" frag %d: group %d, orig DC = %d, ",
2184
                    i, predictor_group, s->all_fragments[i].coeffs[0]);
2185
2186
                switch (predictor_group) {
2187
2188
                case 0:
2189
                    /* main body of fragments; consider all 4 possible
2190
                     * fragments for prediction */
2191
2192
                    /* calculate the indices of the predicting fragments */
2193
                    ul = i - fragment_width - 1;
2194
                    u = i - fragment_width;
2195
                    ur = i - fragment_width + 1;
2196
                    l = i - 1;
2197
2198
                    /* fetch the DC values for the predicting fragments */
2199
                    vul = s->all_fragments[ul].coeffs[0];
2200
                    vu = s->all_fragments[u].coeffs[0];
2201
                    vur = s->all_fragments[ur].coeffs[0];
2202
                    vl = s->all_fragments[l].coeffs[0];
2203
2204
                    /* figure out which fragments are valid */
2205
                    ful = FRAME_CODED(ul) && COMPATIBLE_FRAME(ul);
2206
                    fu = FRAME_CODED(u) && COMPATIBLE_FRAME(u);
2207
                    fur = FRAME_CODED(ur) && COMPATIBLE_FRAME(ur);
2208
                    fl = FRAME_CODED(l) && COMPATIBLE_FRAME(l);
2209
2210
                    /* decide which predictor transform to use */
2211
                    transform = (fl*PL) | (fu*PU) | (ful*PUL) | (fur*PUR);
2212
2213
                    break;
2214
2215
                case 1:
2216
                    /* left column of fragments, not including top corner;
2217
                     * only consider up and up-right fragments */
2218
2219
                    /* calculate the indices of the predicting fragments */
2220
                    u = i - fragment_width;
2221
                    ur = i - fragment_width + 1;
2222
2223
                    /* fetch the DC values for the predicting fragments */
2224
                    vu = s->all_fragments[u].coeffs[0];
2225
                    vur = s->all_fragments[ur].coeffs[0];
2226
2227
                    /* figure out which fragments are valid */
2228
                    fur = FRAME_CODED(ur) && COMPATIBLE_FRAME(ur);
2229
                    fu = FRAME_CODED(u) && COMPATIBLE_FRAME(u);
2230
2231
                    /* decide which predictor transform to use */
2232
                    transform = (fu*PU) | (fur*PUR);
2233
2234
                    break;
2235
2236
                case 2:
2237
                case 6:
2238
                    /* top row of fragments, not including top-left frag;
2239
                     * only consider the left fragment for prediction */
2240
2241
                    /* calculate the indices of the predicting fragments */
2242
                    l = i - 1;
2243
2244
                    /* fetch the DC values for the predicting fragments */
2245
                    vl = s->all_fragments[l].coeffs[0];
2246
2247
                    /* figure out which fragments are valid */
2248
                    fl = FRAME_CODED(l) && COMPATIBLE_FRAME(l);
2249
2250
                    /* decide which predictor transform to use */
2251
                    transform = (fl*PL);
2252
2253
                    break;
2254
2255
                case 3:
2256
                    /* top-left fragment */
2257
2258
                    /* nothing to predict from in this case */
2259
                    transform = 0;
2260
2261
                    break;
2262
2263
                case 4:
2264
                    /* right column of fragments, not including top corner;
2265
                     * consider up-left, up, and left fragments for
2266
                     * prediction */
2267
2268
                    /* calculate the indices of the predicting fragments */
2269
                    ul = i - fragment_width - 1;
2270
                    u = i - fragment_width;
2271
                    l = i - 1;
2272
2273
                    /* fetch the DC values for the predicting fragments */
2274
                    vul = s->all_fragments[ul].coeffs[0];
2275
                    vu = s->all_fragments[u].coeffs[0];
2276
                    vl = s->all_fragments[l].coeffs[0];
2277
2278
                    /* figure out which fragments are valid */
2279
                    ful = FRAME_CODED(ul) && COMPATIBLE_FRAME(ul);
2280
                    fu = FRAME_CODED(u) && COMPATIBLE_FRAME(u);
2281
                    fl = FRAME_CODED(l) && COMPATIBLE_FRAME(l);
2282
2283
                    /* decide which predictor transform to use */
2284
                    transform = (fl*PL) | (fu*PU) | (ful*PUL);
2285
2286
                    break;
2287
2288
                }
2289
2290
                debug_dc_pred("transform = %d, ", transform);
2291
2292
                if (transform == 0) {
2293
2294
                    /* if there were no fragments to predict from, use last
2295
                     * DC saved */
2296
                    s->all_fragments[i].coeffs[0] += last_dc[current_frame_type];
2297
                    debug_dc_pred("from last DC (%d) = %d\n", 
2298
                        current_frame_type, s->all_fragments[i].coeffs[0]);
2299
2300
                } else {
2301
2302
                    /* apply the appropriate predictor transform */
2303
                    predicted_dc =
2304
                        (predictor_transform[transform][0] * vul) +
2305
                        (predictor_transform[transform][1] * vu) +
2306
                        (predictor_transform[transform][2] * vur) +
2307
                        (predictor_transform[transform][3] * vl);
2308
2309
                    /* if there is a shift value in the transform, add
2310
                     * the sign bit before the shift */
2311
                    if (predictor_transform[transform][5] != 0) {
2312
                        predicted_dc += ((predicted_dc >> 15) & 
2313
                            predictor_transform[transform][4]);
2314
                        predicted_dc >>= predictor_transform[transform][5];
2315
                    }
2316
2317
                    /* check for outranging on the [ul u l] and
2318
                     * [ul u ur l] predictors */
2319
                    if ((transform == 13) || (transform == 15)) {
2320
                        if (iabs(predicted_dc - vu) > 128)
2321
                            predicted_dc = vu;
2322
                        else if (iabs(predicted_dc - vl) > 128)
2323
                            predicted_dc = vl;
2324
                        else if (iabs(predicted_dc - vul) > 128)
2325
                            predicted_dc = vul;
2326
                    }
2327
2328
                    /* at long last, apply the predictor */
2329
                    s->all_fragments[i].coeffs[0] += predicted_dc;
2330
                    debug_dc_pred("from pred DC = %d\n", 
2331
                    s->all_fragments[i].coeffs[0]);
2332
                }
2333
2334
                /* save the DC */
2335
                last_dc[current_frame_type] = s->all_fragments[i].coeffs[0];
2336
            }
2337
        }
2338
    }
2339
}
2340
2341
/*
2342
 * This function performs the final rendering of each fragment's data
2343
 * onto the output frame.
2344
 */
2345
static void render_fragments(Vp3DecodeContext *s,
2346
                             int first_fragment,
2347 44ae98dd Mike Melanson
                             int width,
2348
                             int height,
2349 d86053a4 Mike Melanson
                             int plane /* 0 = Y, 1 = U, 2 = V */) 
2350
{
2351
    int x, y;
2352
    int m, n;
2353
    int i = first_fragment;
2354
    int16_t *dequantizer;
2355
    unsigned char *output_plane;
2356
    unsigned char *last_plane;
2357
    unsigned char *golden_plane;
2358
    int stride;
2359 44ae98dd Mike Melanson
    int motion_x, motion_y;
2360 a466e345 Mike Melanson
    int upper_motion_limit, lower_motion_limit;
2361 44ae98dd Mike Melanson
    int motion_halfpel_index;
2362 a2f11b3c Michael Niedermayer
    uint8_t *motion_source;
2363 d86053a4 Mike Melanson
2364
    debug_vp3("  vp3: rendering final fragments for %s\n",
2365
        (plane == 0) ? "Y plane" : (plane == 1) ? "U plane" : "V plane");
2366
2367
    /* set up plane-specific parameters */
2368
    if (plane == 0) {
2369
        dequantizer = s->intra_y_dequant;
2370
        output_plane = s->current_frame.data[0];
2371 61873c4a Mike Melanson
        last_plane = s->last_frame.data[0];
2372
        golden_plane = s->golden_frame.data[0];
2373 9a7ad925 Alex Beregszaszi
        stride = s->current_frame.linesize[0];
2374
        if (!s->flipped_image) stride = -stride;
2375 a466e345 Mike Melanson
        upper_motion_limit = 7 * s->current_frame.linesize[0];
2376
        lower_motion_limit = height * s->current_frame.linesize[0] + width - 8;
2377 d86053a4 Mike Melanson
    } else if (plane == 1) {
2378
        dequantizer = s->intra_c_dequant;
2379
        output_plane = s->current_frame.data[1];
2380 61873c4a Mike Melanson
        last_plane = s->last_frame.data[1];
2381
        golden_plane = s->golden_frame.data[1];
2382 9a7ad925 Alex Beregszaszi
        stride = s->current_frame.linesize[1];
2383
        if (!s->flipped_image) stride = -stride;
2384 a466e345 Mike Melanson
        upper_motion_limit = 7 * s->current_frame.linesize[1];
2385
        lower_motion_limit = height * s->current_frame.linesize[1] + width - 8;
2386 d86053a4 Mike Melanson
    } else {
2387
        dequantizer = s->intra_c_dequant;
2388
        output_plane = s->current_frame.data[2];
2389 61873c4a Mike Melanson
        last_plane = s->last_frame.data[2];
2390
        golden_plane = s->golden_frame.data[2];
2391 9a7ad925 Alex Beregszaszi
        stride = s->current_frame.linesize[2];
2392
        if (!s->flipped_image) stride = -stride;
2393 a466e345 Mike Melanson
        upper_motion_limit = 7 * s->current_frame.linesize[2];
2394
        lower_motion_limit = height * s->current_frame.linesize[2] + width - 8;
2395 d86053a4 Mike Melanson
    }
2396
2397
    /* for each fragment row... */
2398 44ae98dd Mike Melanson
    for (y = 0; y < height; y += 8) {
2399 d86053a4 Mike Melanson
2400
        /* for each fragment in a row... */
2401 44ae98dd Mike Melanson
        for (x = 0; x < width; x += 8, i++) {
2402 d86053a4 Mike Melanson
2403 74c0ac12 Mike Melanson
            if ((i < 0) || (i >= s->fragment_count)) {
2404 9b879566 Michel Bardiaux
                av_log(s->avctx, AV_LOG_ERROR, "  vp3:render_fragments(): bad fragment number (%d)\n", i);
2405 74c0ac12 Mike Melanson
                return;
2406
            }
2407
2408 d86053a4 Mike Melanson
            /* transform if this block was coded */
2409 f8830383 Alex Beregszaszi
            if ((s->all_fragments[i].coding_method != MODE_COPY) &&
2410
                !((s->avctx->flags & CODEC_FLAG_GRAY) && plane)) {
2411 44ae98dd Mike Melanson
2412 a2f11b3c Michael Niedermayer
                if ((s->all_fragments[i].coding_method == MODE_USING_GOLDEN) ||
2413
                    (s->all_fragments[i].coding_method == MODE_GOLDEN_MV))
2414
                    motion_source= golden_plane;
2415
                else 
2416
                    motion_source= last_plane;
2417
2418
                motion_source += s->all_fragments[i].first_pixel;
2419 642d7e84 Mike Melanson
                motion_halfpel_index = 0;
2420
2421
                /* sort out the motion vector if this fragment is coded
2422
                 * using a motion vector method */
2423
                if ((s->all_fragments[i].coding_method > MODE_INTRA) &&
2424
                    (s->all_fragments[i].coding_method != MODE_USING_GOLDEN)) {
2425 a2f11b3c Michael Niedermayer
                    int src_x, src_y;
2426 642d7e84 Mike Melanson
                    motion_x = s->all_fragments[i].motion_x;
2427
                    motion_y = s->all_fragments[i].motion_y;
2428 b928ec64 Michael Niedermayer
                    if(plane){
2429
                        motion_x= (motion_x>>1) | (motion_x&1);
2430
                        motion_y= (motion_y>>1) | (motion_y&1);
2431
                    }
2432
2433 a2f11b3c Michael Niedermayer
                    src_x= (motion_x>>1) + x;
2434
                    src_y= (motion_y>>1) + y;
2435 642d7e84 Mike Melanson
if ((motion_x == 0xbeef) || (motion_y == 0xbeef))
2436 9b879566 Michel Bardiaux
av_log(s->avctx, AV_LOG_ERROR, " help! got beefy vector! (%X, %X)\n", motion_x, motion_y);
2437 642d7e84 Mike Melanson
2438 b928ec64 Michael Niedermayer
                    motion_halfpel_index = motion_x & 0x01;
2439
                    motion_source += (motion_x >> 1);
2440 642d7e84 Mike Melanson
2441
//                    motion_y = -motion_y;
2442 b928ec64 Michael Niedermayer
                    motion_halfpel_index |= (motion_y & 0x01) << 1;
2443
                    motion_source += ((motion_y >> 1) * stride);
2444 642d7e84 Mike Melanson
2445 a2f11b3c Michael Niedermayer
                    if(src_x<0 || src_y<0 || src_x + 9 >= width || src_y + 9 >= height){
2446
                        uint8_t *temp= s->edge_emu_buffer;
2447
                        if(stride<0) temp -= 9*stride;
2448 9a7ad925 Alex Beregszaszi
                        else temp += 9*stride;
2449 a2f11b3c Michael Niedermayer
2450
                        ff_emulated_edge_mc(temp, motion_source, stride, 9, 9, src_x, src_y, width, height);
2451
                        motion_source= temp;
2452 642d7e84 Mike Melanson
                    }
2453 a466e345 Mike Melanson
                }
2454
2455 44ae98dd Mike Melanson
                /* first, take care of copying a block from either the
2456
                 * previous or the golden frame */
2457
                if (s->all_fragments[i].coding_method != MODE_INTRA) {
2458
2459 a2f11b3c Michael Niedermayer
                    s->dsp.put_no_rnd_pixels_tab[1][motion_halfpel_index](
2460 44ae98dd Mike Melanson
                        output_plane + s->all_fragments[i].first_pixel,
2461 a2f11b3c Michael Niedermayer
                        motion_source,
2462 44ae98dd Mike Melanson
                        stride, 8);
2463
                }
2464
2465 d86053a4 Mike Melanson
                /* dequantize the DCT coefficients */
2466 44ae98dd Mike Melanson
                debug_idct("fragment %d, coding mode %d, DC = %d, dequant = %d:\n", 
2467
                    i, s->all_fragments[i].coding_method, 
2468
                    s->all_fragments[i].coeffs[0], dequantizer[0]);
2469 d86053a4 Mike Melanson
2470 4e80eb21 Mike Melanson
                /* invert DCT and place (or add) in final output */
2471
                if (s->all_fragments[i].coding_method == MODE_INTRA) {
2472 3d32b429 Mike Melanson
                    vp3_idct_put(s->all_fragments[i].coeffs, dequantizer,
2473 44ae98dd Mike Melanson
                        output_plane + s->all_fragments[i].first_pixel,
2474 3d32b429 Mike Melanson
                        stride);
2475 4e80eb21 Mike Melanson
                } else {
2476 3d32b429 Mike Melanson
                    vp3_idct_add(s->all_fragments[i].coeffs, dequantizer,
2477 44ae98dd Mike Melanson
                        output_plane + s->all_fragments[i].first_pixel,
2478 3d32b429 Mike Melanson
                        stride);
2479 4e80eb21 Mike Melanson
                }
2480 44ae98dd Mike Melanson
2481
                debug_idct("block after idct_%s():\n",
2482
                    (s->all_fragments[i].coding_method == MODE_INTRA)?
2483
                    "put" : "add");
2484 d86053a4 Mike Melanson
                for (m = 0; m < 8; m++) {
2485
                    for (n = 0; n < 8; n++) {
2486 44ae98dd Mike Melanson
                        debug_idct(" %3d", *(output_plane + 
2487
                            s->all_fragments[i].first_pixel + (m * stride + n)));
2488 d86053a4 Mike Melanson
                    }
2489
                    debug_idct("\n");
2490
                }
2491
                debug_idct("\n");
2492
2493
            } else {
2494
2495 44ae98dd Mike Melanson
                /* copy directly from the previous frame */
2496
                s->dsp.put_pixels_tab[1][0](
2497
                    output_plane + s->all_fragments[i].first_pixel,
2498
                    last_plane + s->all_fragments[i].first_pixel,
2499
                    stride, 8);
2500 d86053a4 Mike Melanson
2501
            }
2502
        }
2503
    }
2504
2505
    emms_c();
2506
2507
}
2508
2509
/* 
2510
 * This function computes the first pixel addresses for each fragment.
2511
 * This function needs to be invoked after the first frame is allocated
2512
 * so that it has access to the plane strides.
2513
 */
2514
static void vp3_calculate_pixel_addresses(Vp3DecodeContext *s) 
2515
{
2516
2517
    int i, x, y;
2518
2519
    /* figure out the first pixel addresses for each of the fragments */
2520
    /* Y plane */
2521
    i = 0;
2522
    for (y = s->fragment_height; y > 0; y--) {
2523
        for (x = 0; x < s->fragment_width; x++) {
2524
            s->all_fragments[i++].first_pixel = 
2525
                s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
2526
                    s->golden_frame.linesize[0] +
2527
                    x * FRAGMENT_PIXELS;
2528
            debug_init("  fragment %d, first pixel @ %d\n", 
2529
                i-1, s->all_fragments[i-1].first_pixel);
2530
        }
2531
    }
2532
2533
    /* U plane */
2534
    i = s->u_fragment_start;
2535
    for (y = s->fragment_height / 2; y > 0; y--) {
2536
        for (x = 0; x < s->fragment_width / 2; x++) {
2537
            s->all_fragments[i++].first_pixel = 
2538
                s->golden_frame.linesize[1] * y * FRAGMENT_PIXELS -
2539
                    s->golden_frame.linesize[1] +
2540
                    x * FRAGMENT_PIXELS;
2541
            debug_init("  fragment %d, first pixel @ %d\n", 
2542
                i-1, s->all_fragments[i-1].first_pixel);
2543
        }
2544
    }
2545
2546
    /* V plane */
2547
    i = s->v_fragment_start;
2548
    for (y = s->fragment_height / 2; y > 0; y--) {
2549
        for (x = 0; x < s->fragment_width / 2; x++) {
2550
            s->all_fragments[i++].first_pixel = 
2551
                s->golden_frame.linesize[2] * y * FRAGMENT_PIXELS -
2552
                    s->golden_frame.linesize[2] +
2553
                    x * FRAGMENT_PIXELS;
2554
            debug_init("  fragment %d, first pixel @ %d\n", 
2555
                i-1, s->all_fragments[i-1].first_pixel);
2556
        }
2557
    }
2558
}
2559
2560 9a7ad925 Alex Beregszaszi
/* FIXME: this should be merged with the above! */
2561
static void theora_calculate_pixel_addresses(Vp3DecodeContext *s) 
2562
{
2563
2564
    int i, x, y;
2565
2566
    /* figure out the first pixel addresses for each of the fragments */
2567
    /* Y plane */
2568
    i = 0;
2569
    for (y = 1; y <= s->fragment_height; y++) {
2570
        for (x = 0; x < s->fragment_width; x++) {
2571
            s->all_fragments[i++].first_pixel = 
2572
                s->golden_frame.linesize[0] * y * FRAGMENT_PIXELS -
2573
                    s->golden_frame.linesize[0] +
2574
                    x * FRAGMENT_PIXELS;
2575
            debug_init("  fragment %d, first pixel @ %d\n", 
2576
                i-1, s->all_fragments[i-1].first_pixel);
2577
        }
2578
    }
2579
2580
    /* U plane */
2581
    i = s->u_fragment_start;
2582
    for (y = 1; y <= s->fragment_height / 2; y++) {
2583
        for (x = 0; x < s->fragment_width / 2; x++) {
2584
            s->all_fragments[i++].first_pixel = 
2585
                s->golden_frame.linesize[1] * y * FRAGMENT_PIXELS -
2586
                    s->golden_frame.linesize[1] +
2587
                    x * FRAGMENT_PIXELS;
2588
            debug_init("  fragment %d, first pixel @ %d\n", 
2589
                i-1, s->all_fragments[i-1].first_pixel);
2590
        }
2591
    }
2592
2593
    /* V plane */
2594
    i = s->v_fragment_start;
2595
    for (y = 1; y <= s->fragment_height / 2; y++) {
2596
        for (x = 0; x < s->fragment_width / 2; x++) {
2597
            s->all_fragments[i++].first_pixel = 
2598
                s->golden_frame.linesize[2] * y * FRAGMENT_PIXELS -
2599
                    s->golden_frame.linesize[2] +
2600
                    x * FRAGMENT_PIXELS;
2601
            debug_init("  fragment %d, first pixel @ %d\n", 
2602
                i-1, s->all_fragments[i-1].first_pixel);
2603
        }
2604
    }
2605
}
2606
2607 d86053a4 Mike Melanson
/*
2608
 * This is the ffmpeg/libavcodec API init function.
2609
 */
2610
static int vp3_decode_init(AVCodecContext *avctx)
2611
{
2612
    Vp3DecodeContext *s = avctx->priv_data;
2613
    int i;
2614 892fc83e Mike Melanson
    int c_width;
2615
    int c_height;
2616
    int y_superblock_count;
2617
    int c_superblock_count;
2618 d86053a4 Mike Melanson
2619 3c3f113e Alex Beregszaszi
    if (avctx->codec_tag == MKTAG('V','P','3','0'))
2620
        s->version = 0;
2621
    else
2622
        s->version = 1;
2623
2624 d86053a4 Mike Melanson
    s->avctx = avctx;
2625 642d7e84 Mike Melanson
#if 0
2626 d86053a4 Mike Melanson
    s->width = avctx->width;
2627
    s->height = avctx->height;
2628 642d7e84 Mike Melanson
#else
2629
    s->width = (avctx->width + 15) & 0xFFFFFFF0;
2630
    s->height = (avctx->height + 15) & 0xFFFFFFF0;
2631
#endif
2632 d86053a4 Mike Melanson
    avctx->pix_fmt = PIX_FMT_YUV420P;
2633
    avctx->has_b_frames = 0;
2634
    dsputil_init(&s->dsp, avctx);
2635
2636
    /* initialize to an impossible value which will force a recalculation
2637
     * in the first frame decode */
2638
    s->quality_index = -1;
2639
2640 892fc83e Mike Melanson
    s->y_superblock_width = (s->width + 31) / 32;
2641
    s->y_superblock_height = (s->height + 31) / 32;
2642
    y_superblock_count = s->y_superblock_width * s->y_superblock_height;
2643
2644
    /* work out the dimensions for the C planes */
2645
    c_width = s->width / 2;
2646
    c_height = s->height / 2;
2647
    s->c_superblock_width = (c_width + 31) / 32;
2648
    s->c_superblock_height = (c_height + 31) / 32;
2649
    c_superblock_count = s->c_superblock_width * s->c_superblock_height;
2650
2651
    s->superblock_count = y_superblock_count + (c_superblock_count * 2);
2652
    s->u_superblock_start = y_superblock_count;
2653
    s->v_superblock_start = s->u_superblock_start + c_superblock_count;
2654 d86053a4 Mike Melanson
    s->superblock_coding = av_malloc(s->superblock_count);
2655
2656
    s->macroblock_width = (s->width + 15) / 16;
2657
    s->macroblock_height = (s->height + 15) / 16;
2658
    s->macroblock_count = s->macroblock_width * s->macroblock_height;
2659
2660
    s->fragment_width = s->width / FRAGMENT_PIXELS;
2661
    s->fragment_height = s->height / FRAGMENT_PIXELS;
2662
2663
    /* fragment count covers all 8x8 blocks for all 3 planes */
2664
    s->fragment_count = s->fragment_width * s->fragment_height * 3 / 2;
2665
    s->u_fragment_start = s->fragment_width * s->fragment_height;
2666
    s->v_fragment_start = s->fragment_width * s->fragment_height * 5 / 4;
2667
2668 892fc83e Mike Melanson
    debug_init("  Y plane: %d x %d\n", s->width, s->height);
2669
    debug_init("  C plane: %d x %d\n", c_width, c_height);
2670
    debug_init("  Y superblocks: %d x %d, %d total\n",
2671
        s->y_superblock_width, s->y_superblock_height, y_superblock_count);
2672
    debug_init("  C superblocks: %d x %d, %d total\n",
2673
        s->c_superblock_width, s->c_superblock_height, c_superblock_count);
2674
    debug_init("  total superblocks = %d, U starts @ %d, V starts @ %d\n", 
2675
        s->superblock_count, s->u_superblock_start, s->v_superblock_start);
2676 d86053a4 Mike Melanson
    debug_init("  macroblocks: %d x %d, %d total\n",
2677
        s->macroblock_width, s->macroblock_height, s->macroblock_count);
2678
    debug_init("  %d fragments, %d x %d, u starts @ %d, v starts @ %d\n",
2679
        s->fragment_count,
2680
        s->fragment_width,
2681
        s->fragment_height,
2682
        s->u_fragment_start,
2683
        s->v_fragment_start);
2684
2685
    s->all_fragments = av_malloc(s->fragment_count * sizeof(Vp3Fragment));
2686
    s->coded_fragment_list = av_malloc(s->fragment_count * sizeof(int));
2687
    s->pixel_addresses_inited = 0;
2688
2689 f44ee2c3 Alex Beregszaszi
    if (!s->theora_tables)
2690
    {
2691
        for (i = 0; i < 64; i++)
2692
            s->coded_dc_scale_factor[i] = vp31_dc_scale_factor[i];
2693
        for (i = 0; i < 64; i++)
2694
            s->coded_quality_threshold[i] = vp31_quality_threshold[i];
2695
        for (i = 0; i < 64; i++)
2696
            s->coded_intra_y_dequant[i] = vp31_intra_y_dequant[i];
2697
        for (i = 0; i < 64; i++)
2698
            s->coded_intra_c_dequant[i] = vp31_intra_c_dequant[i];
2699
        for (i = 0; i < 64; i++)
2700
            s->coded_inter_dequant[i] = vp31_inter_dequant[i];
2701
    }
2702
2703 d86053a4 Mike Melanson
    /* init VLC tables */
2704
    for (i = 0; i < 16; i++) {
2705
2706 96a7e73b Mike Melanson
        /* DC histograms */
2707 d86053a4 Mike Melanson
        init_vlc(&s->dc_vlc[i], 5, 32,
2708
            &dc_bias[i][0][1], 4, 2,
2709
            &dc_bias[i][0][0], 4, 2);
2710
2711 a466e345 Mike Melanson
        /* group 1 AC histograms */
2712 d86053a4 Mike Melanson
        init_vlc(&s->ac_vlc_1[i], 5, 32,
2713
            &ac_bias_0[i][0][1], 4, 2,
2714
            &ac_bias_0[i][0][0], 4, 2);
2715
2716 a466e345 Mike Melanson
        /* group 2 AC histograms */
2717 d86053a4 Mike Melanson
        init_vlc(&s->ac_vlc_2[i], 5, 32,
2718
            &ac_bias_1[i][0][1], 4, 2,
2719
            &ac_bias_1[i][0][0], 4, 2);
2720
2721 a466e345 Mike Melanson
        /* group 3 AC histograms */
2722 d86053a4 Mike Melanson
        init_vlc(&s->ac_vlc_3[i], 5, 32,
2723
            &ac_bias_2[i][0][1], 4, 2,
2724
            &ac_bias_2[i][0][0], 4, 2);
2725
2726 a466e345 Mike Melanson
        /* group 4 AC histograms */
2727 d86053a4 Mike Melanson
        init_vlc(&s->ac_vlc_4[i], 5, 32,
2728
            &ac_bias_3[i][0][1], 4, 2,
2729
            &ac_bias_3[i][0][0], 4, 2);
2730
    }
2731
2732 96a7e73b Mike Melanson
    /* build quantization zigzag table */
2733 d86053a4 Mike Melanson
    for (i = 0; i < 64; i++)
2734 463d086b Mike Melanson
        zigzag_index[dezigzag_index[i]] = i;
2735 d86053a4 Mike Melanson
2736
    /* work out the block mapping tables */
2737
    s->superblock_fragments = av_malloc(s->superblock_count * 16 * sizeof(int));
2738
    s->superblock_macroblocks = av_malloc(s->superblock_count * 4 * sizeof(int));
2739
    s->macroblock_fragments = av_malloc(s->macroblock_count * 6 * sizeof(int));
2740 96a7e73b Mike Melanson
    s->macroblock_coding = av_malloc(s->macroblock_count + 1);
2741 d86053a4 Mike Melanson
    init_block_mapping(s);
2742
2743 44ae98dd Mike Melanson
    for (i = 0; i < 3; i++) {
2744
        s->current_frame.data[i] = NULL;
2745
        s->last_frame.data[i] = NULL;
2746
        s->golden_frame.data[i] = NULL;
2747 61873c4a Mike Melanson
    }
2748
2749 d86053a4 Mike Melanson
    return 0;
2750
}
2751
2752
/*
2753
 * This is the ffmpeg/libavcodec API frame decode function.
2754
 */
2755
static int vp3_decode_frame(AVCodecContext *avctx, 
2756
                            void *data, int *data_size,
2757
                            uint8_t *buf, int buf_size)
2758
{
2759
    Vp3DecodeContext *s = avctx->priv_data;
2760
    GetBitContext gb;
2761
    static int counter = 0;
2762
2763
    *data_size = 0;
2764
2765
    init_get_bits(&gb, buf, buf_size * 8);
2766 f44ee2c3 Alex Beregszaszi
    
2767
    if (s->theora && get_bits1(&gb))
2768
    {
2769 3c3f113e Alex Beregszaszi
        int ptype = get_bits(&gb, 7);
2770 d86053a4 Mike Melanson
2771 3c3f113e Alex Beregszaszi
        skip_bits(&gb, 6*8); /* "theora" */
2772
        
2773
        switch(ptype)
2774 9a7ad925 Alex Beregszaszi
        {
2775 3c3f113e Alex Beregszaszi
            case 1:
2776
                theora_decode_comments(avctx, gb);
2777
                break;
2778
            case 2:
2779
                theora_decode_tables(avctx, gb);
2780
                    init_dequantizer(s);
2781
                break;
2782
            default:
2783
                av_log(avctx, AV_LOG_ERROR, "Unknown Theora config packet: %d\n", ptype);
2784 9a7ad925 Alex Beregszaszi
        }
2785 3c3f113e Alex Beregszaszi
        return buf_size;
2786 f44ee2c3 Alex Beregszaszi
    }
2787 3c3f113e Alex Beregszaszi
2788
    s->keyframe = !get_bits1(&gb);
2789
    if (!s->theora)
2790 f44ee2c3 Alex Beregszaszi
        skip_bits(&gb, 1);
2791 3c3f113e Alex Beregszaszi
    s->last_quality_index = s->quality_index;
2792
    s->quality_index = get_bits(&gb, 6);
2793
    if (s->theora >= 0x030300)
2794
        skip_bits1(&gb);
2795 d86053a4 Mike Melanson
2796 f8830383 Alex Beregszaszi
    if (s->avctx->debug & FF_DEBUG_PICT_INFO)
2797
        av_log(s->avctx, AV_LOG_INFO, " VP3 %sframe #%d: Q index = %d\n",
2798
            s->keyframe?"key":"", counter, s->quality_index);
2799 d86053a4 Mike Melanson
    counter++;
2800
2801 642d7e84 Mike Melanson
    if (s->quality_index != s->last_quality_index)
2802
        init_dequantizer(s);
2803
2804 d86053a4 Mike Melanson
    if (s->keyframe) {
2805 3c3f113e Alex Beregszaszi
        if (!s->theora)
2806
        {
2807
            skip_bits(&gb, 4); /* width code */
2808
            skip_bits(&gb, 4); /* height code */
2809
            if (s->version)
2810
            {
2811
                s->version = get_bits(&gb, 5);
2812
                if (counter == 1)
2813
                    av_log(s->avctx, AV_LOG_DEBUG, "VP version: %d\n", s->version);
2814
            }
2815
        }
2816
        if (s->version || s->theora)
2817
        {
2818
                if (get_bits1(&gb))
2819
                    av_log(s->avctx, AV_LOG_ERROR, "Warning, unsupported keyframe coding type?!\n");
2820
            skip_bits(&gb, 2); /* reserved? */
2821
        }
2822
2823 74c0ac12 Mike Melanson
        if (s->last_frame.data[0] == s->golden_frame.data[0]) {
2824
            if (s->golden_frame.data[0])
2825
                avctx->release_buffer(avctx, &s->golden_frame);
2826 8e39d4a7 Michael Niedermayer
            s->last_frame= s->golden_frame; /* ensure that we catch any access to this released frame */
2827 74c0ac12 Mike Melanson
        } else {
2828
            if (s->golden_frame.data[0])
2829
                avctx->release_buffer(avctx, &s->golden_frame);
2830
            if (s->last_frame.data[0])
2831
                avctx->release_buffer(avctx, &s->last_frame);
2832
        }
2833 d86053a4 Mike Melanson
2834 8e39d4a7 Michael Niedermayer
        s->golden_frame.reference = 3;
2835 d86053a4 Mike Melanson
        if(avctx->get_buffer(avctx, &s->golden_frame) < 0) {
2836 9b879566 Michel Bardiaux
            av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
2837 d86053a4 Mike Melanson
            return -1;
2838
        }
2839
2840
        /* golden frame is also the current frame */
2841 61873c4a Mike Melanson
        memcpy(&s->current_frame, &s->golden_frame, sizeof(AVFrame));
2842 d86053a4 Mike Melanson
2843
        /* time to figure out pixel addresses? */
2844
        if (!s->pixel_addresses_inited)
2845 9a7ad925 Alex Beregszaszi
        {
2846
            if (!s->flipped_image)
2847
                vp3_calculate_pixel_addresses(s);
2848
            else
2849
                theora_calculate_pixel_addresses(s);
2850
        }
2851 d86053a4 Mike Melanson
    } else {
2852
        /* allocate a new current frame */
2853 8e39d4a7 Michael Niedermayer
        s->current_frame.reference = 3;
2854 d86053a4 Mike Melanson
        if(avctx->get_buffer(avctx, &s->current_frame) < 0) {
2855 9b879566 Michel Bardiaux
            av_log(s->avctx, AV_LOG_ERROR, "vp3: get_buffer() failed\n");
2856 d86053a4 Mike Melanson
            return -1;
2857
        }
2858
    }
2859
2860 b928ec64 Michael Niedermayer
    s->current_frame.qscale_table= s->qscale_table; //FIXME allocate individual tables per AVFrame
2861
    s->current_frame.qstride= 0;
2862
2863 d86053a4 Mike Melanson
    init_frame(s, &gb);
2864
2865 892fc83e Mike Melanson
#if KEYFRAMES_ONLY
2866
if (!s->keyframe) {
2867
2868
    memcpy(s->current_frame.data[0], s->golden_frame.data[0],
2869
        s->current_frame.linesize[0] * s->height);
2870
    memcpy(s->current_frame.data[1], s->golden_frame.data[1],
2871
        s->current_frame.linesize[1] * s->height / 2);
2872
    memcpy(s->current_frame.data[2], s->golden_frame.data[2],
2873
        s->current_frame.linesize[2] * s->height / 2);
2874
2875
} else {
2876
#endif
2877
2878
    if (unpack_superblocks(s, &gb) ||
2879
        unpack_modes(s, &gb) ||
2880
        unpack_vectors(s, &gb) ||
2881
        unpack_dct_coeffs(s, &gb)) {
2882
2883 9b879566 Michel Bardiaux
        av_log(s->avctx, AV_LOG_ERROR, "  vp3: could not decode frame\n");
2884 892fc83e Mike Melanson
        return -1;
2885
    }
2886 d86053a4 Mike Melanson
2887
    reverse_dc_prediction(s, 0, s->fragment_width, s->fragment_height);
2888 44ae98dd Mike Melanson
    render_fragments(s, 0, s->width, s->height, 0);
2889 3d32b429 Mike Melanson
2890
    if ((avctx->flags & CODEC_FLAG_GRAY) == 0) {
2891
        reverse_dc_prediction(s, s->u_fragment_start,
2892
            s->fragment_width / 2, s->fragment_height / 2);
2893
        reverse_dc_prediction(s, s->v_fragment_start,
2894
            s->fragment_width / 2, s->fragment_height / 2);
2895
        render_fragments(s, s->u_fragment_start, s->width / 2, s->height / 2, 1);
2896
        render_fragments(s, s->v_fragment_start, s->width / 2, s->height / 2, 2);
2897
    } else {
2898
        memset(s->current_frame.data[1], 0x80, s->width * s->height / 4);
2899
        memset(s->current_frame.data[2], 0x80, s->width * s->height / 4);
2900
    }
2901 d86053a4 Mike Melanson
2902 892fc83e Mike Melanson
#if KEYFRAMES_ONLY
2903
}
2904
#endif
2905
2906 d86053a4 Mike Melanson
    *data_size=sizeof(AVFrame);
2907
    *(AVFrame*)data= s->current_frame;
2908
2909 44ae98dd Mike Melanson
    /* release the last frame, if it is allocated and if it is not the
2910
     * golden frame */
2911
    if ((s->last_frame.data[0]) &&
2912
        (s->last_frame.data[0] != s->golden_frame.data[0]))
2913
        avctx->release_buffer(avctx, &s->last_frame);
2914 d86053a4 Mike Melanson
2915 61873c4a Mike Melanson
    /* shuffle frames (last = current) */
2916
    memcpy(&s->last_frame, &s->current_frame, sizeof(AVFrame));
2917 8e39d4a7 Michael Niedermayer
    s->current_frame.data[0]= NULL; /* ensure that we catch any access to this released frame */
2918 d86053a4 Mike Melanson
2919
    return buf_size;
2920
}
2921
2922
/*
2923
 * This is the ffmpeg/libavcodec API module cleanup function.
2924
 */
2925
static int vp3_decode_end(AVCodecContext *avctx)
2926
{
2927
    Vp3DecodeContext *s = avctx->priv_data;
2928
2929
    av_free(s->all_fragments);
2930
    av_free(s->coded_fragment_list);
2931
    av_free(s->superblock_fragments);
2932
    av_free(s->superblock_macroblocks);
2933
    av_free(s->macroblock_fragments);
2934 96a7e73b Mike Melanson
    av_free(s->macroblock_coding);
2935 8e39d4a7 Michael Niedermayer
    
2936 d86053a4 Mike Melanson
    /* release all frames */
2937 8e39d4a7 Michael Niedermayer
    if (s->golden_frame.data[0] && s->golden_frame.data[0] != s->last_frame.data[0])
2938 892fc83e Mike Melanson
        avctx->release_buffer(avctx, &s->golden_frame);
2939
    if (s->last_frame.data[0])
2940
        avctx->release_buffer(avctx, &s->last_frame);
2941
    /* no need to release the current_frame since it will always be pointing
2942
     * to the same frame as either the golden or last frame */
2943 d86053a4 Mike Melanson
2944
    return 0;
2945
}
2946
2947 f44ee2c3 Alex Beregszaszi
static int theora_decode_header(AVCodecContext *avctx, GetBitContext gb)
2948
{
2949
    Vp3DecodeContext *s = avctx->priv_data;
2950 9a7ad925 Alex Beregszaszi
    int major, minor, micro;
2951
2952
    major = get_bits(&gb, 8); /* version major */
2953
    minor = get_bits(&gb, 8); /* version minor */
2954
    micro = get_bits(&gb, 8); /* version micro */
2955
    av_log(avctx, AV_LOG_INFO, "Theora bitstream version %d.%d.%d\n",
2956
        major, minor, micro);
2957
2958 105c3d25 Alex Beregszaszi
    /* FIXME: endianess? */
2959
    s->theora = (major << 16) | (minor << 8) | micro;
2960
2961 9a7ad925 Alex Beregszaszi
    /* 3.3.0 aka alpha3 has the same frame orientation as original vp3 */
2962
    /* but previous versions have the image flipped relative to vp3 */
2963 105c3d25 Alex Beregszaszi
    if (s->theora < 0x030300)
2964 9a7ad925 Alex Beregszaszi
    {
2965
        s->flipped_image = 1;
2966
        av_log(avctx, AV_LOG_DEBUG, "Old (<alpha3) Theora bitstream, flipped image\n");
2967
    }
2968 f44ee2c3 Alex Beregszaszi
2969
    s->width = get_bits(&gb, 16) << 4;
2970
    s->height = get_bits(&gb, 16) << 4;
2971
    
2972
    skip_bits(&gb, 24); /* frame width */
2973
    skip_bits(&gb, 24); /* frame height */
2974
2975
    skip_bits(&gb, 8); /* offset x */
2976
    skip_bits(&gb, 8); /* offset y */
2977
2978
    skip_bits(&gb, 32); /* fps numerator */
2979
    skip_bits(&gb, 32); /* fps denumerator */
2980
    skip_bits(&gb, 24); /* aspect numerator */
2981
    skip_bits(&gb, 24); /* aspect denumerator */
2982
    
2983 105c3d25 Alex Beregszaszi
    if (s->theora < 0x030300)
2984
        skip_bits(&gb, 5); /* keyframe frequency force */
2985 f44ee2c3 Alex Beregszaszi
    skip_bits(&gb, 8); /* colorspace */
2986
    skip_bits(&gb, 24); /* bitrate */
2987
2988
    skip_bits(&gb, 6); /* last(?) quality index */
2989
    
2990 105c3d25 Alex Beregszaszi
    if (s->theora >= 0x030300)
2991
    {
2992
        skip_bits(&gb, 5); /* keyframe frequency force */
2993
        skip_bits(&gb, 5); /* spare bits */
2994
    }
2995
    
2996 f44ee2c3 Alex Beregszaszi
//    align_get_bits(&gb);
2997
    
2998
    avctx->width = s->width;
2999
    avctx->height = s->height;
3000
3001
    vp3_decode_init(avctx);
3002
3003
    return 0;
3004
}
3005
3006 91381201 Alex Beregszaszi
static int theora_decode_comments(AVCodecContext *avctx, GetBitContext gb)
3007
{
3008
    int nb_comments, i, tmp;
3009
3010
    tmp = get_bits(&gb, 32);
3011 3c3f113e Alex Beregszaszi
    tmp = be2me_32(tmp);
3012
    while(tmp--)
3013
            skip_bits(&gb, 8);
3014 91381201 Alex Beregszaszi
3015
    nb_comments = get_bits(&gb, 32);
3016 3c3f113e Alex Beregszaszi
    nb_comments = be2me_32(nb_comments);
3017 91381201 Alex Beregszaszi
    for (i = 0; i < nb_comments; i++)
3018
    {
3019
        tmp = get_bits(&gb, 32);
3020 3c3f113e Alex Beregszaszi
        tmp = be2me_32(tmp);
3021
        while(tmp--)
3022 91381201 Alex Beregszaszi
            skip_bits(&gb, 8);
3023
    }
3024
    
3025
    return 0;
3026
}
3027
3028 f44ee2c3 Alex Beregszaszi
static int theora_decode_tables(AVCodecContext *avctx, GetBitContext gb)
3029
{
3030
    Vp3DecodeContext *s = avctx->priv_data;
3031
    int i;
3032
    
3033
    /* quality threshold table */
3034
    for (i = 0; i < 64; i++)
3035
        s->coded_quality_threshold[i] = get_bits(&gb, 16);
3036
3037
    /* dc scale factor table */
3038
    for (i = 0; i < 64; i++)
3039
        s->coded_dc_scale_factor[i] = get_bits(&gb, 16);
3040
3041
    /* y coeffs */
3042
    for (i = 0; i < 64; i++)
3043
        s->coded_intra_y_dequant[i] = get_bits(&gb, 8);
3044
3045
    /* uv coeffs */
3046
    for (i = 0; i < 64; i++)
3047
        s->coded_intra_c_dequant[i] = get_bits(&gb, 8);
3048
3049
    /* inter coeffs */
3050
    for (i = 0; i < 64; i++)
3051
        s->coded_inter_dequant[i] = get_bits(&gb, 8);
3052 3c3f113e Alex Beregszaszi
3053
    /* FIXME: read huffmann tree.. */
3054 f44ee2c3 Alex Beregszaszi
    
3055
    s->theora_tables = 1;
3056
    
3057
    return 0;
3058
}
3059
3060
static int theora_decode_init(AVCodecContext *avctx)
3061
{
3062
    Vp3DecodeContext *s = avctx->priv_data;
3063
    GetBitContext gb;
3064
    int ptype;
3065
    
3066
    s->theora = 1;
3067
3068