Statistics
| Branch: | Revision:

ffmpeg / libavcodec / vp6.c @ d37f007d

History | View | Annotate | Download (21.3 KB)

1
/**
2
 * @file vp6.c
3
 * VP6 compatible video decoder
4
 *
5
 * Copyright (C) 2006  Aurelien Jacobs <aurel@gnuage.org>
6
 *
7
 * The VP6F decoder accepts an optional 1 byte extradata. It is composed of:
8
 *  - upper 4bits: difference between encoded width and visible width
9
 *  - lower 4bits: difference between encoded height and visible height
10
 *
11
 * This file is part of FFmpeg.
12
 *
13
 * FFmpeg is free software; you can redistribute it and/or
14
 * modify it under the terms of the GNU Lesser General Public
15
 * License as published by the Free Software Foundation; either
16
 * version 2.1 of the License, or (at your option) any later version.
17
 *
18
 * FFmpeg is distributed in the hope that it will be useful,
19
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
21
 * Lesser General Public License for more details.
22
 *
23
 * You should have received a copy of the GNU Lesser General Public
24
 * License along with FFmpeg; if not, write to the Free Software
25
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
26
 */
27

    
28
#include <stdlib.h>
29

    
30
#include "avcodec.h"
31
#include "dsputil.h"
32
#include "bitstream.h"
33
#include "huffman.h"
34

    
35
#include "vp56.h"
36
#include "vp56data.h"
37
#include "vp6data.h"
38

    
39

    
40
static void vp6_parse_coeff(vp56_context_t *s);
41
static void vp6_parse_coeff_huffman(vp56_context_t *s);
42

    
43
static int vp6_parse_header(vp56_context_t *s, const uint8_t *buf, int buf_size,
44
                            int *golden_frame)
45
{
46
    vp56_range_coder_t *c = &s->c;
47
    int parse_filter_info = 0;
48
    int coeff_offset = 0;
49
    int vrt_shift = 0;
50
    int sub_version;
51
    int rows, cols;
52
    int res = 1;
53
    int separated_coeff = buf[0] & 1;
54

    
55
    s->framep[VP56_FRAME_CURRENT]->key_frame = !(buf[0] & 0x80);
56
    vp56_init_dequant(s, (buf[0] >> 1) & 0x3F);
57

    
58
    if (s->framep[VP56_FRAME_CURRENT]->key_frame) {
59
        sub_version = buf[1] >> 3;
60
        if (sub_version > 8)
61
            return 0;
62
        s->filter_header = buf[1] & 0x06;
63
        if (buf[1] & 1) {
64
            av_log(s->avctx, AV_LOG_ERROR, "interlacing not supported\n");
65
            return 0;
66
        }
67
        if (separated_coeff || !s->filter_header) {
68
            coeff_offset = AV_RB16(buf+2) - 2;
69
            buf += 2;
70
            buf_size -= 2;
71
        }
72

    
73
        rows = buf[2];  /* number of stored macroblock rows */
74
        cols = buf[3];  /* number of stored macroblock cols */
75
        /* buf[4] is number of displayed macroblock rows */
76
        /* buf[5] is number of displayed macroblock cols */
77

    
78
        if (16*cols != s->avctx->coded_width ||
79
            16*rows != s->avctx->coded_height) {
80
            avcodec_set_dimensions(s->avctx, 16*cols, 16*rows);
81
            if (s->avctx->extradata_size == 1) {
82
                s->avctx->width  -= s->avctx->extradata[0] >> 4;
83
                s->avctx->height -= s->avctx->extradata[0] & 0x0F;
84
            }
85
            res = 2;
86
        }
87

    
88
        vp56_init_range_decoder(c, buf+6, buf_size-6);
89
        vp56_rac_gets(c, 2);
90

    
91
        parse_filter_info = s->filter_header;
92
        if (sub_version < 8)
93
            vrt_shift = 5;
94
        s->sub_version = sub_version;
95
    } else {
96
        if (!s->sub_version)
97
            return 0;
98

    
99
        if (separated_coeff || !s->filter_header) {
100
            coeff_offset = AV_RB16(buf+1) - 2;
101
            buf += 2;
102
            buf_size -= 2;
103
        }
104
        vp56_init_range_decoder(c, buf+1, buf_size-1);
105

    
106
        *golden_frame = vp56_rac_get(c);
107
        if (s->filter_header) {
108
            s->deblock_filtering = vp56_rac_get(c);
109
            if (s->deblock_filtering)
110
                vp56_rac_get(c);
111
            if (s->sub_version > 7)
112
                parse_filter_info = vp56_rac_get(c);
113
        }
114
    }
115

    
116
    if (parse_filter_info) {
117
        if (vp56_rac_get(c)) {
118
            s->filter_mode = 2;
119
            s->sample_variance_threshold = vp56_rac_gets(c, 5) << vrt_shift;
120
            s->max_vector_length = 2 << vp56_rac_gets(c, 3);
121
        } else if (vp56_rac_get(c)) {
122
            s->filter_mode = 1;
123
        } else {
124
            s->filter_mode = 0;
125
        }
126
        if (s->sub_version > 7)
127
            s->filter_selection = vp56_rac_gets(c, 4);
128
        else
129
            s->filter_selection = 16;
130
    }
131

    
132
    s->use_huffman = vp56_rac_get(c);
133

    
134
    s->parse_coeff = vp6_parse_coeff;
135
    if (coeff_offset) {
136
        buf      += coeff_offset;
137
        buf_size -= coeff_offset;
138
        if (s->use_huffman) {
139
            s->parse_coeff = vp6_parse_coeff_huffman;
140
            init_get_bits(&s->gb, buf, buf_size<<3);
141
        } else {
142
            vp56_init_range_decoder(&s->cc, buf, buf_size);
143
            s->ccp = &s->cc;
144
        }
145
    } else {
146
        s->ccp = &s->c;
147
    }
148

    
149
    return res;
150
}
151

    
152
static void vp6_coeff_order_table_init(vp56_context_t *s)
153
{
154
    int i, pos, idx = 1;
155

    
156
    s->modelp->coeff_index_to_pos[0] = 0;
157
    for (i=0; i<16; i++)
158
        for (pos=1; pos<64; pos++)
159
            if (s->modelp->coeff_reorder[pos] == i)
160
                s->modelp->coeff_index_to_pos[idx++] = pos;
161
}
162

    
163
static void vp6_default_models_init(vp56_context_t *s)
164
{
165
    vp56_model_t *model = s->modelp;
166

    
167
    model->vector_dct[0] = 0xA2;
168
    model->vector_dct[1] = 0xA4;
169
    model->vector_sig[0] = 0x80;
170
    model->vector_sig[1] = 0x80;
171

    
172
    memcpy(model->mb_types_stats, vp56_def_mb_types_stats, sizeof(model->mb_types_stats));
173
    memcpy(model->vector_fdv, vp6_def_fdv_vector_model, sizeof(model->vector_fdv));
174
    memcpy(model->vector_pdv, vp6_def_pdv_vector_model, sizeof(model->vector_pdv));
175
    memcpy(model->coeff_runv, vp6_def_runv_coeff_model, sizeof(model->coeff_runv));
176
    memcpy(model->coeff_reorder, vp6_def_coeff_reorder, sizeof(model->coeff_reorder));
177

    
178
    vp6_coeff_order_table_init(s);
179
}
180

    
181
static void vp6_parse_vector_models(vp56_context_t *s)
182
{
183
    vp56_range_coder_t *c = &s->c;
184
    vp56_model_t *model = s->modelp;
185
    int comp, node;
186

    
187
    for (comp=0; comp<2; comp++) {
188
        if (vp56_rac_get_prob(c, vp6_sig_dct_pct[comp][0]))
189
            model->vector_dct[comp] = vp56_rac_gets_nn(c, 7);
190
        if (vp56_rac_get_prob(c, vp6_sig_dct_pct[comp][1]))
191
            model->vector_sig[comp] = vp56_rac_gets_nn(c, 7);
192
    }
193

    
194
    for (comp=0; comp<2; comp++)
195
        for (node=0; node<7; node++)
196
            if (vp56_rac_get_prob(c, vp6_pdv_pct[comp][node]))
197
                model->vector_pdv[comp][node] = vp56_rac_gets_nn(c, 7);
198

    
199
    for (comp=0; comp<2; comp++)
200
        for (node=0; node<8; node++)
201
            if (vp56_rac_get_prob(c, vp6_fdv_pct[comp][node]))
202
                model->vector_fdv[comp][node] = vp56_rac_gets_nn(c, 7);
203
}
204

    
205
static int vp6_huff_cmp(const void *va, const void *vb)
206
{
207
    const Node *a = va, *b = vb;
208
    return a->count >= b->count;
209
}
210

    
211
static void vp6_build_huff_tree(vp56_context_t *s, uint8_t coeff_model[],
212
                                const uint8_t *map, unsigned size, VLC *vlc)
213
{
214
    Node nodes[2*size], *tmp = &nodes[size];
215
    int a, b, i;
216

    
217
    /* first compute probabilities from model */
218
    tmp[0].count = 256;
219
    for (i=0; i<size-1; i++) {
220
        a = tmp[i].count *        coeff_model[i]  >> 8;
221
        b = tmp[i].count * (255 - coeff_model[i]) >> 8;
222
        nodes[map[2*i  ]].count = a + !a;
223
        nodes[map[2*i+1]].count = b + !b;
224
    }
225

    
226
    /* then build the huffman tree accodring to probabilities */
227
    ff_huff_build_tree(s->avctx, vlc, size, nodes, vp6_huff_cmp, 1);
228
}
229

    
230
static void vp6_parse_coeff_models(vp56_context_t *s)
231
{
232
    vp56_range_coder_t *c = &s->c;
233
    vp56_model_t *model = s->modelp;
234
    int def_prob[11];
235
    int node, cg, ctx, pos;
236
    int ct;    /* code type */
237
    int pt;    /* plane type (0 for Y, 1 for U or V) */
238

    
239
    memset(def_prob, 0x80, sizeof(def_prob));
240

    
241
    for (pt=0; pt<2; pt++)
242
        for (node=0; node<11; node++)
243
            if (vp56_rac_get_prob(c, vp6_dccv_pct[pt][node])) {
244
                def_prob[node] = vp56_rac_gets_nn(c, 7);
245
                model->coeff_dccv[pt][node] = def_prob[node];
246
            } else if (s->framep[VP56_FRAME_CURRENT]->key_frame) {
247
                model->coeff_dccv[pt][node] = def_prob[node];
248
            }
249

    
250
    if (vp56_rac_get(c)) {
251
        for (pos=1; pos<64; pos++)
252
            if (vp56_rac_get_prob(c, vp6_coeff_reorder_pct[pos]))
253
                model->coeff_reorder[pos] = vp56_rac_gets(c, 4);
254
        vp6_coeff_order_table_init(s);
255
    }
256

    
257
    for (cg=0; cg<2; cg++)
258
        for (node=0; node<14; node++)
259
            if (vp56_rac_get_prob(c, vp6_runv_pct[cg][node]))
260
                model->coeff_runv[cg][node] = vp56_rac_gets_nn(c, 7);
261

    
262
    for (ct=0; ct<3; ct++)
263
        for (pt=0; pt<2; pt++)
264
            for (cg=0; cg<6; cg++)
265
                for (node=0; node<11; node++)
266
                    if (vp56_rac_get_prob(c, vp6_ract_pct[ct][pt][cg][node])) {
267
                        def_prob[node] = vp56_rac_gets_nn(c, 7);
268
                        model->coeff_ract[pt][ct][cg][node] = def_prob[node];
269
                    } else if (s->framep[VP56_FRAME_CURRENT]->key_frame) {
270
                        model->coeff_ract[pt][ct][cg][node] = def_prob[node];
271
                    }
272

    
273
    if (s->use_huffman) {
274
        for (pt=0; pt<2; pt++) {
275
            vp6_build_huff_tree(s, model->coeff_dccv[pt],
276
                                vp6_huff_coeff_map, 12, &s->dccv_vlc[pt]);
277
            vp6_build_huff_tree(s, model->coeff_runv[pt],
278
                                vp6_huff_run_map, 9, &s->runv_vlc[pt]);
279
            for (ct=0; ct<3; ct++)
280
                for (cg = 0; cg < 6; cg++)
281
                    vp6_build_huff_tree(s, model->coeff_ract[pt][ct][cg],
282
                                        vp6_huff_coeff_map, 12,
283
                                        &s->ract_vlc[pt][ct][cg]);
284
        }
285
        memset(s->nb_null, 0, sizeof(s->nb_null));
286
    } else {
287
    /* coeff_dcct is a linear combination of coeff_dccv */
288
    for (pt=0; pt<2; pt++)
289
        for (ctx=0; ctx<3; ctx++)
290
            for (node=0; node<5; node++)
291
                model->coeff_dcct[pt][ctx][node] = av_clip(((model->coeff_dccv[pt][node] * vp6_dccv_lc[ctx][node][0] + 128) >> 8) + vp6_dccv_lc[ctx][node][1], 1, 255);
292
    }
293
}
294

    
295
static void vp6_parse_vector_adjustment(vp56_context_t *s, vp56_mv_t *vect)
296
{
297
    vp56_range_coder_t *c = &s->c;
298
    vp56_model_t *model = s->modelp;
299
    int comp;
300

    
301
    *vect = (vp56_mv_t) {0,0};
302
    if (s->vector_candidate_pos < 2)
303
        *vect = s->vector_candidate[0];
304

    
305
    for (comp=0; comp<2; comp++) {
306
        int i, delta = 0;
307

    
308
        if (vp56_rac_get_prob(c, model->vector_dct[comp])) {
309
            static const uint8_t prob_order[] = {0, 1, 2, 7, 6, 5, 4};
310
            for (i=0; i<sizeof(prob_order); i++) {
311
                int j = prob_order[i];
312
                delta |= vp56_rac_get_prob(c, model->vector_fdv[comp][j])<<j;
313
            }
314
            if (delta & 0xF0)
315
                delta |= vp56_rac_get_prob(c, model->vector_fdv[comp][3])<<3;
316
            else
317
                delta |= 8;
318
        } else {
319
            delta = vp56_rac_get_tree(c, vp56_pva_tree,
320
                                      model->vector_pdv[comp]);
321
        }
322

    
323
        if (delta && vp56_rac_get_prob(c, model->vector_sig[comp]))
324
            delta = -delta;
325

    
326
        if (!comp)
327
            vect->x += delta;
328
        else
329
            vect->y += delta;
330
    }
331
}
332

    
333
/**
334
 * Read number of consecutive blocks with null DC or AC.
335
 * This value is < 74.
336
 */
337
static unsigned vp6_get_nb_null(vp56_context_t *s)
338
{
339
    unsigned val = get_bits(&s->gb, 2);
340
    if (val == 2)
341
        val += get_bits(&s->gb, 2);
342
    else if (val == 3) {
343
        val = get_bits1(&s->gb) << 2;
344
        val = 6+val + get_bits(&s->gb, 2+val);
345
    }
346
    return val;
347
}
348

    
349
static void vp6_parse_coeff_huffman(vp56_context_t *s)
350
{
351
    vp56_model_t *model = s->modelp;
352
    uint8_t *permute = s->scantable.permutated;
353
    VLC *vlc_coeff;
354
    int coeff, sign, coeff_idx;
355
    int b, cg, idx;
356
    int pt = 0;    /* plane type (0 for Y, 1 for U or V) */
357

    
358
    for (b=0; b<6; b++) {
359
        int ct = 0;    /* code type */
360
        if (b > 3) pt = 1;
361
        vlc_coeff = &s->dccv_vlc[pt];
362

    
363
        for (coeff_idx=0; coeff_idx<64; ) {
364
            int run = 1;
365
            if (coeff_idx<2 && s->nb_null[coeff_idx][pt]) {
366
                s->nb_null[coeff_idx][pt]--;
367
                if (coeff_idx)
368
                    break;
369
            } else {
370
                coeff = get_vlc2(&s->gb, vlc_coeff->table, 9, 3);
371
                if (coeff == 0) {
372
                    if (coeff_idx) {
373
                        int pt = (coeff_idx >= 6);
374
                        run += get_vlc2(&s->gb, s->runv_vlc[pt].table, 9, 3);
375
                        if (run >= 9)
376
                            run += get_bits(&s->gb, 6);
377
                    } else
378
                        s->nb_null[0][pt] = vp6_get_nb_null(s);
379
                    ct = 0;
380
                } else if (coeff == 11) {  /* end of block */
381
                    if (coeff_idx == 1)    /* first AC coeff ? */
382
                        s->nb_null[1][pt] = vp6_get_nb_null(s);
383
                    break;
384
                } else {
385
                    int coeff2 = vp56_coeff_bias[coeff];
386
                    if (coeff > 4)
387
                        coeff2 += get_bits(&s->gb, coeff <= 9 ? coeff - 4 : 11);
388
                    ct = 1 + (coeff2 > 1);
389
                    sign = get_bits1(&s->gb);
390
                    coeff2 = (coeff2 ^ -sign) + sign;
391
                    if (coeff_idx)
392
                        coeff2 *= s->dequant_ac;
393
                    idx = model->coeff_index_to_pos[coeff_idx];
394
                    s->block_coeff[b][permute[idx]] = coeff2;
395
                }
396
            }
397
            coeff_idx+=run;
398
            cg = FFMIN(vp6_coeff_groups[coeff_idx], 3);
399
            vlc_coeff = &s->ract_vlc[pt][ct][cg];
400
        }
401
    }
402
}
403

    
404
static void vp6_parse_coeff(vp56_context_t *s)
405
{
406
    vp56_range_coder_t *c = s->ccp;
407
    vp56_model_t *model = s->modelp;
408
    uint8_t *permute = s->scantable.permutated;
409
    uint8_t *model1, *model2, *model3;
410
    int coeff, sign, coeff_idx;
411
    int b, i, cg, idx, ctx;
412
    int pt = 0;    /* plane type (0 for Y, 1 for U or V) */
413

    
414
    for (b=0; b<6; b++) {
415
        int ct = 1;    /* code type */
416
        int run = 1;
417

    
418
        if (b > 3) pt = 1;
419

    
420
        ctx = s->left_block[vp56_b6to4[b]].not_null_dc
421
              + s->above_blocks[s->above_block_idx[b]].not_null_dc;
422
        model1 = model->coeff_dccv[pt];
423
        model2 = model->coeff_dcct[pt][ctx];
424

    
425
        for (coeff_idx=0; coeff_idx<64; ) {
426
            if ((coeff_idx>1 && ct==0) || vp56_rac_get_prob(c, model2[0])) {
427
                /* parse a coeff */
428
                if (vp56_rac_get_prob(c, model2[2])) {
429
                    if (vp56_rac_get_prob(c, model2[3])) {
430
                        idx = vp56_rac_get_tree(c, vp56_pc_tree, model1);
431
                        coeff = vp56_coeff_bias[idx+5];
432
                        for (i=vp56_coeff_bit_length[idx]; i>=0; i--)
433
                            coeff += vp56_rac_get_prob(c, vp56_coeff_parse_table[idx][i]) << i;
434
                    } else {
435
                        if (vp56_rac_get_prob(c, model2[4]))
436
                            coeff = 3 + vp56_rac_get_prob(c, model1[5]);
437
                        else
438
                            coeff = 2;
439
                    }
440
                    ct = 2;
441
                } else {
442
                    ct = 1;
443
                    coeff = 1;
444
                }
445
                sign = vp56_rac_get(c);
446
                coeff = (coeff ^ -sign) + sign;
447
                if (coeff_idx)
448
                    coeff *= s->dequant_ac;
449
                idx = model->coeff_index_to_pos[coeff_idx];
450
                s->block_coeff[b][permute[idx]] = coeff;
451
                run = 1;
452
            } else {
453
                /* parse a run */
454
                ct = 0;
455
                if (coeff_idx > 0) {
456
                    if (!vp56_rac_get_prob(c, model2[1]))
457
                        break;
458

    
459
                    model3 = model->coeff_runv[coeff_idx >= 6];
460
                    run = vp56_rac_get_tree(c, vp6_pcr_tree, model3);
461
                    if (!run)
462
                        for (run=9, i=0; i<6; i++)
463
                            run += vp56_rac_get_prob(c, model3[i+8]) << i;
464
                }
465
            }
466

    
467
            cg = vp6_coeff_groups[coeff_idx+=run];
468
            model1 = model2 = model->coeff_ract[pt][ct][cg];
469
        }
470

    
471
        s->left_block[vp56_b6to4[b]].not_null_dc =
472
        s->above_blocks[s->above_block_idx[b]].not_null_dc = !!s->block_coeff[b][0];
473
    }
474
}
475

    
476
static int vp6_adjust(int v, int t)
477
{
478
    int V = v, s = v >> 31;
479
    V ^= s;
480
    V -= s;
481
    if (V-t-1 >= (unsigned)(t-1))
482
        return v;
483
    V = 2*t - V;
484
    V += s;
485
    V ^= s;
486
    return V;
487
}
488

    
489
static int vp6_block_variance(uint8_t *src, int stride)
490
{
491
    int sum = 0, square_sum = 0;
492
    int y, x;
493

    
494
    for (y=0; y<8; y+=2) {
495
        for (x=0; x<8; x+=2) {
496
            sum += src[x];
497
            square_sum += src[x]*src[x];
498
        }
499
        src += 2*stride;
500
    }
501
    return (16*square_sum - sum*sum) >> 8;
502
}
503

    
504
static void vp6_filter_hv4(uint8_t *dst, uint8_t *src, int stride,
505
                           int delta, const int16_t *weights)
506
{
507
    int x, y;
508

    
509
    for (y=0; y<8; y++) {
510
        for (x=0; x<8; x++) {
511
            dst[x] = av_clip_uint8((  src[x-delta  ] * weights[0]
512
                                 + src[x        ] * weights[1]
513
                                 + src[x+delta  ] * weights[2]
514
                                 + src[x+2*delta] * weights[3] + 64) >> 7);
515
        }
516
        src += stride;
517
        dst += stride;
518
    }
519
}
520

    
521
static void vp6_filter_diag2(vp56_context_t *s, uint8_t *dst, uint8_t *src,
522
                             int stride, int h_weight, int v_weight)
523
{
524
    uint8_t *tmp = s->edge_emu_buffer+16;
525
    s->dsp.put_h264_chroma_pixels_tab[0](tmp, src, stride, 9, h_weight, 0);
526
    s->dsp.put_h264_chroma_pixels_tab[0](dst, tmp, stride, 8, 0, v_weight);
527
}
528

    
529
static void vp6_filter_diag4(uint8_t *dst, uint8_t *src, int stride,
530
                             const int16_t *h_weights,const int16_t *v_weights)
531
{
532
    int x, y;
533
    int tmp[8*11];
534
    int *t = tmp;
535

    
536
    src -= stride;
537

    
538
    for (y=0; y<11; y++) {
539
        for (x=0; x<8; x++) {
540
            t[x] = av_clip_uint8((  src[x-1] * h_weights[0]
541
                               + src[x  ] * h_weights[1]
542
                               + src[x+1] * h_weights[2]
543
                               + src[x+2] * h_weights[3] + 64) >> 7);
544
        }
545
        src += stride;
546
        t += 8;
547
    }
548

    
549
    t = tmp + 8;
550
    for (y=0; y<8; y++) {
551
        for (x=0; x<8; x++) {
552
            dst[x] = av_clip_uint8((  t[x-8 ] * v_weights[0]
553
                                 + t[x   ] * v_weights[1]
554
                                 + t[x+8 ] * v_weights[2]
555
                                 + t[x+16] * v_weights[3] + 64) >> 7);
556
        }
557
        dst += stride;
558
        t += 8;
559
    }
560
}
561

    
562
static void vp6_filter(vp56_context_t *s, uint8_t *dst, uint8_t *src,
563
                       int offset1, int offset2, int stride,
564
                       vp56_mv_t mv, int mask, int select, int luma)
565
{
566
    int filter4 = 0;
567
    int x8 = mv.x & mask;
568
    int y8 = mv.y & mask;
569

    
570
    if (luma) {
571
        x8 *= 2;
572
        y8 *= 2;
573
        filter4 = s->filter_mode;
574
        if (filter4 == 2) {
575
            if (s->max_vector_length &&
576
                (FFABS(mv.x) > s->max_vector_length ||
577
                 FFABS(mv.y) > s->max_vector_length)) {
578
                filter4 = 0;
579
            } else if (s->sample_variance_threshold
580
                       && (vp6_block_variance(src+offset1, stride)
581
                           < s->sample_variance_threshold)) {
582
                filter4 = 0;
583
            }
584
        }
585
    }
586

    
587
    if ((y8 && (offset2-offset1)*s->flip<0) || (!y8 && offset1 > offset2)) {
588
        offset1 = offset2;
589
    }
590

    
591
    if (filter4) {
592
        if (!y8) {                      /* left or right combine */
593
            vp6_filter_hv4(dst, src+offset1, stride, 1,
594
                           vp6_block_copy_filter[select][x8]);
595
        } else if (!x8) {               /* above or below combine */
596
            vp6_filter_hv4(dst, src+offset1, stride, stride,
597
                           vp6_block_copy_filter[select][y8]);
598
        } else {
599
            vp6_filter_diag4(dst, src+offset1 + ((mv.x^mv.y)>>31), stride,
600
                             vp6_block_copy_filter[select][x8],
601
                             vp6_block_copy_filter[select][y8]);
602
        }
603
    } else {
604
        if (!x8 || !y8) {
605
            s->dsp.put_h264_chroma_pixels_tab[0](dst, src+offset1, stride, 8, x8, y8);
606
        } else {
607
            vp6_filter_diag2(s, dst, src+offset1 + ((mv.x^mv.y)>>31), stride, x8, y8);
608
        }
609
    }
610
}
611

    
612
static int vp6_decode_init(AVCodecContext *avctx)
613
{
614
    vp56_context_t *s = avctx->priv_data;
615

    
616
    vp56_init(avctx, avctx->codec->id == CODEC_ID_VP6,
617
                     avctx->codec->id == CODEC_ID_VP6A);
618
    s->vp56_coord_div = vp6_coord_div;
619
    s->parse_vector_adjustment = vp6_parse_vector_adjustment;
620
    s->adjust = vp6_adjust;
621
    s->filter = vp6_filter;
622
    s->default_models_init = vp6_default_models_init;
623
    s->parse_vector_models = vp6_parse_vector_models;
624
    s->parse_coeff_models = vp6_parse_coeff_models;
625
    s->parse_header = vp6_parse_header;
626

    
627
    return 0;
628
}
629

    
630
AVCodec vp6_decoder = {
631
    "vp6",
632
    CODEC_TYPE_VIDEO,
633
    CODEC_ID_VP6,
634
    sizeof(vp56_context_t),
635
    vp6_decode_init,
636
    NULL,
637
    vp56_free,
638
    vp56_decode_frame,
639
    CODEC_CAP_DR1,
640
};
641

    
642
/* flash version, not flipped upside-down */
643
AVCodec vp6f_decoder = {
644
    "vp6f",
645
    CODEC_TYPE_VIDEO,
646
    CODEC_ID_VP6F,
647
    sizeof(vp56_context_t),
648
    vp6_decode_init,
649
    NULL,
650
    vp56_free,
651
    vp56_decode_frame,
652
    CODEC_CAP_DR1,
653
};
654

    
655
/* flash version, not flipped upside-down, with alpha channel */
656
AVCodec vp6a_decoder = {
657
    "vp6a",
658
    CODEC_TYPE_VIDEO,
659
    CODEC_ID_VP6A,
660
    sizeof(vp56_context_t),
661
    vp6_decode_init,
662
    NULL,
663
    vp56_free,
664
    vp56_decode_frame,
665
    CODEC_CAP_DR1,
666
};