1 /*
2 * Copyright (C) 2006 Aurelien Jacobs <aurel@gnuage.org>
3 *
4 * This file is part of FFmpeg.
5 *
6 * FFmpeg is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * FFmpeg is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with FFmpeg; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21 /**
22 * @file
23 * VP5 and VP6 compatible video decoder (common features)
24 */
25
29
32
33
35 {
36 s->quantizer = quantizer;
39 memset(s->qscale_table, quantizer, s->mb_width);
40 }
41
44 {
45 int nb_pred = 0;
46 VP56mv vect[2] = {{0,0}, {0,0}};
49
50 for (pos=0; pos<12; pos++) {
52 mvp.
y = row + vp56_candidate_predictor_pos[pos][1];
53 if (mvp.
x < 0 || mvp.
x >= s->mb_width ||
54 mvp.
y < 0 || mvp.
y >= s->mb_height)
55 continue;
56 offset = mvp.
x + s->mb_width*mvp.
y;
57
59 continue;
60 if ((s->macroblocks[offset].mv.x == vect[0].
x &&
61 s->macroblocks[offset].mv.y == vect[0].
y) ||
62 (s->macroblocks[offset].mv.x == 0 &&
63 s->macroblocks[offset].mv.y == 0))
64 continue;
65
66 vect[nb_pred++] = s->macroblocks[
offset].mv;
67 if (nb_pred > 1) {
68 nb_pred = -1;
69 break;
70 }
71 s->vector_candidate_pos = pos;
72 }
73
74 s->vector_candidate[0] = vect[0];
75 s->vector_candidate[1] = vect[1];
76
77 return nb_pred+1;
78 }
79
81 {
84 int i, ctx, type;
85
86 for (ctx=0; ctx<3; ctx++) {
92 }
94 for (type=0; type<10; type++) {
95 for(i=0; i<2; i++) {
98
101 if (!delta)
104 }
105 }
106 }
107 }
108 }
109
110 /* compute MB type probability tables based on previous MB type */
111 for (ctx=0; ctx<3; ctx++) {
112 int p[10];
113
114 for (type=0; type<10; type++)
116
117 for (type=0; type<10; type++) {
118 int p02, p34, p0234, p17, p56, p89, p5689, p156789;
119
120 /* conservative MB type probability */
122
123 p[type] = 0; /* same MB type => weight is null */
124
125 /* binary tree parsing probabilities */
126 p02 = p[0] + p[2];
127 p34 = p[3] + p[4];
128 p0234 = p02 + p34;
129 p17 = p[1] + p[7];
130 p56 = p[5] + p[6];
131 p89 = p[8] + p[9];
132 p5689 = p56 + p89;
133 p156789 = p17 + p5689;
134
135 model->
mb_type[ctx][type][1] = 1 + 255 * p0234/(1+p0234+p156789);
136 model->
mb_type[ctx][type][2] = 1 + 255 * p02 / (1+p0234);
137 model->
mb_type[ctx][type][3] = 1 + 255 * p17 / (1+p156789);
138 model->
mb_type[ctx][type][4] = 1 + 255 * p[0] / (1+p02);
139 model->
mb_type[ctx][type][5] = 1 + 255 * p[3] / (1+p34);
140 model->
mb_type[ctx][type][6] = 1 + 255 * p[1] / (1+p17);
141 model->
mb_type[ctx][type][7] = 1 + 255 * p56 / (1+p5689);
142 model->
mb_type[ctx][type][8] = 1 + 255 * p[5] / (1+p56);
143 model->
mb_type[ctx][type][9] = 1 + 255 * p[8] / (1+p89);
144
145 /* restore initial value */
147 }
148 }
149 }
150
152 VP56mb prev_type,
int ctx)
153 {
154 uint8_t *mb_type_model = s->modelp->mb_type[ctx][prev_type];
156
158 return prev_type;
159 else
161 }
162
164 {
166 int type[4];
168
169 /* parse each block type */
170 for (b=0; b<4; b++) {
172 if (type[b])
173 type[
b]++;
/* only returns 0, 2, 3 or 4 (all INTER_PF) */
174 }
175
176 /* get vectors */
177 for (b=0; b<4; b++) {
178 switch (type[b]) {
181 break;
183 s->parse_vector_adjustment(s, &s->mv[b]);
184 break;
186 s->mv[
b] = s->vector_candidate[0];
187 break;
189 s->mv[
b] = s->vector_candidate[1];
190 break;
191 }
194 }
195
196 /* this is the one selected for the whole MB for prediction */
197 s->macroblocks[row * s->mb_width + col].mv = s->mv[3];
198
199 /* chroma vectors are average luma vectors */
201 s->mv[4].x = s->mv[5].x =
RSHIFT(mv.
x,2);
202 s->mv[4].y = s->mv[5].y =
RSHIFT(mv.
y,2);
203 } else {
204 s->mv[4] = s->mv[5] = (
VP56mv) {mv.
x/4, mv.
y/4};
205 }
206 }
207
209 {
212
215 s->macroblocks[row * s->mb_width + col].type = s->mb_type;
216
217 switch (s->mb_type) {
219 mv = &s->vector_candidate[0];
220 break;
221
223 mv = &s->vector_candidate[1];
224 break;
225
228 mv = &s->vector_candidate[0];
229 break;
230
233 mv = &s->vector_candidate[1];
234 break;
235
237 s->parse_vector_adjustment(s, &vect);
238 mv = &vect;
239 break;
240
243 s->parse_vector_adjustment(s, &vect);
244 mv = &vect;
245 break;
246
249 return s->mb_type;
250
251 default:
252 mv = &vect;
253 break;
254 }
255
256 s->macroblocks[row*s->mb_width + col].mv = *
mv;
257
258 /* same vector for all blocks */
259 for (b=0; b<6; b++)
260 s->mv[b] = *mv;
261
262 return s->mb_type;
263 }
264
266 {
267 int idx = s->scantable.permutated[0];
269
270 for (b=0; b<6; b++) {
271 VP56RefDc *ab = &s->above_blocks[s->above_block_idx[
b]];
273 int count = 0;
274 int dc = 0;
275 int i;
276
279 count++;
280 }
283 count++;
284 }
286 for (i=0; i<2; i++)
287 if (count < 2 && ref_frame == ab[-1+2*i].ref_frame) {
289 count++;
290 }
291 if (count == 0)
293 else if (count == 2)
294 dc /= 2;
295
296 s->block_coeff[
b][idx] += dc;
297 s->prev_dc[
ff_vp56_b2p[
b]][ref_frame] = s->block_coeff[
b][idx];
302 s->block_coeff[
b][idx] *= s->dequant_dc;
303 }
304 }
305
307 int stride,
int dx,
int dy)
308 {
310 if (dx) s->vp56dsp.edge_filter_hor(yuv + 10-dx , stride, t);
311 if (dy) s->vp56dsp.edge_filter_ver(yuv + stride*(10-dy), stride, t);
312 }
313
316 {
319 int src_offset;
320 int overlap_offset = 0;
321 int mask = s->vp56_coord_div[
b] - 1;
322 int deblock_filtering = s->deblock_filtering;
323 int dx;
324 int dy;
325
329 deblock_filtering = 0;
330
331 dx = s->mv[
b].x / s->vp56_coord_div[
b];
332 dy = s->mv[
b].y / s->vp56_coord_div[
b];
333
334 if (b >= 4) {
335 x /= 2;
336 y /= 2;
337 }
338 x += dx - 2;
339 y += dy - 2;
340
341 if (x<0 || x+12>=s->plane_width[plane] ||
342 y<0 || y+12>=s->plane_height[plane]) {
343 s->vdsp.emulated_edge_mc(s->edge_emu_buffer,
344 src + s->block_offset[b] + (dy-2)*stride + (dx-2),
345 stride, 12, 12, x, y,
346 s->plane_width[plane],
347 s->plane_height[plane]);
348 src_block = s->edge_emu_buffer;
349 src_offset = 2 + 2*
stride;
350 } else if (deblock_filtering) {
351 /* only need a 12x12 block, but there is no such dsp function, */
352 /* so copy a 16x12 block */
353 s->dsp.put_pixels_tab[0][0](s->edge_emu_buffer,
354 src + s->block_offset[
b] + (dy-2)*stride + (dx-2),
356 src_block = s->edge_emu_buffer;
357 src_offset = 2 + 2*
stride;
358 } else {
359 src_block = src;
360 src_offset = s->block_offset[
b] + dy*stride + dx;
361 }
362
363 if (deblock_filtering)
365
366 if (s->mv[b].x & mask)
367 overlap_offset += (s->mv[
b].x > 0) ? 1 : -1;
368 if (s->mv[b].y & mask)
369 overlap_offset += (s->mv[
b].y > 0) ? stride : -stride;
370
371 if (overlap_offset) {
372 if (s->filter)
373 s->filter(s, dst, src_block, src_offset, src_offset+overlap_offset,
374 stride, s->mv[b], mask, s->filter_selection, b<4);
375 else
376 s->dsp.put_no_rnd_pixels_l2[1](
dst, src_block+src_offset,
377 src_block+src_offset+overlap_offset,
379 } else {
380 s->dsp.put_pixels_tab[1][0](
dst, src_block+src_offset,
stride, 8);
381 }
382 }
383
385 {
386 AVFrame *frame_current, *frame_ref;
389 int b, ab, b_max, plane,
off;
390
393 else
396
397 s->dsp.clear_blocks(*s->block_coeff);
398
399 s->parse_coeff(s);
400
402
404 frame_ref = s->framep[ref_frame];
406 return;
407
408 ab = 6*is_alpha;
409 b_max = 6 - 2*is_alpha;
410
411 switch (mb_type) {
413 for (b=0; b<b_max; b++) {
415 s->vp3dsp.idct_put(frame_current->
data[plane] + s->block_offset[b],
416 s->stride[plane], s->block_coeff[b]);
417 }
418 break;
419
422 for (b=0; b<b_max; b++) {
424 off = s->block_offset[
b];
425 s->dsp.put_pixels_tab[1][0](frame_current->
data[plane] +
off,
427 s->stride[plane], 8);
428 s->vp3dsp.idct_add(frame_current->
data[plane] + off,
429 s->stride[plane], s->block_coeff[b]);
430 }
431 break;
432
440 for (b=0; b<b_max; b++) {
441 int x_off = b==1 || b==3 ? 8 : 0;
442 int y_off = b==2 || b==3 ? 8 : 0;
444 vp56_mc(s, b, plane, frame_ref->
data[plane], s->stride[plane],
445 16*col+x_off, 16*row+y_off);
446 s->vp3dsp.idct_add(frame_current->
data[plane] + s->block_offset[b],
447 s->stride[plane], s->block_coeff[b]);
448 }
449 break;
450 }
451 }
452
454 {
457 int i;
458
459 s->plane_width[0] = s->plane_width[3] = avctx->
coded_width;
460 s->plane_width[1] = s->plane_width[2] = avctx->
coded_width/2;
461 s->plane_height[0] = s->plane_height[3] = avctx->
coded_height;
462 s->plane_height[1] = s->plane_height[2] = avctx->
coded_height/2;
463
464 for (i=0; i<4; i++)
466
469
470 if (s->mb_width > 1000 || s->mb_height > 1000) {
473 return -1;
474 }
475
476 s->qscale_table =
av_realloc(s->qscale_table, s->mb_width);
478 (4*s->mb_width+6) * sizeof(*s->above_blocks));
480 s->mb_width*s->mb_height*sizeof(*s->macroblocks));
481 av_free(s->edge_emu_buffer_alloc);
482 s->edge_emu_buffer_alloc =
av_malloc(16*stride);
483 s->edge_emu_buffer = s->edge_emu_buffer_alloc;
484 if (s->flip < 0)
485 s->edge_emu_buffer += 15 *
stride;
486
487 if (s->alpha_context)
489
490 return 0;
491 }
492
494
497 {
501 int remaining_buf_size = avpkt->
size;
503 int i, res;
504
505 /* select a current frame from the unused frames */
506 for (i = 0; i < 4; ++i) {
507 if (!s->frames[i].data[0]) {
508 p = &s->frames[i];
509 break;
510 }
511 }
514 if (s->alpha_context)
516
517 if (s->has_alpha) {
518 if (remaining_buf_size < 3)
519 return -1;
520 alpha_offset = bytestream_get_be24(&buf);
521 remaining_buf_size -= 3;
522 if (remaining_buf_size < alpha_offset)
523 return -1;
524 }
525
526 res = s->parse_header(s, buf, remaining_buf_size);
527 if (res < 0)
528 return res;
529
531 for (i = 0; i < 4; i++) {
532 if (s->frames[i].data[0])
534 }
535 }
536
540 return -1;
541 }
542
546 return -1;
547 }
548 }
549
550 if (s->has_alpha) {
551 int bak_w = avctx->
width;
552 int bak_h = avctx->
height;
555 buf += alpha_offset;
556 remaining_buf_size -= alpha_offset;
557
558 res = s->alpha_context->parse_header(s->alpha_context, buf, remaining_buf_size);
559 if (res != 0) {
562 avctx->
width = bak_w;
566 }
568 return -1;
569 }
570 }
571
573
574 /* release frames that aren't in use */
575 for (i = 0; i < 4; ++i) {
576 AVFrame *victim = &s->frames[i];
577 if (!victim->
data[0])
578 continue;
583 }
584
589 *got_frame = 1;
590
592 }
593
595 int jobnr, int threadnr)
596 {
598 int is_alpha = (jobnr == 1);
599 VP56Context *s = is_alpha ? s0->alpha_context :
s0;
601 int mb_row, mb_col, mb_row_flip, mb_offset = 0;
602 int block, y, uv, stride_y, stride_uv;
603
606 s->default_models_init(s);
607 for (block=0; block<s->mb_height*s->mb_width; block++)
609 } else {
612 s->parse_vector_models(s);
614 }
615
616 if (s->parse_coeff_models(s))
617 goto next;
618
619 memset(s->prev_dc, 0, sizeof(s->prev_dc));
622
623 for (block=0; block < 4*s->mb_width+6; block++) {
625 s->above_blocks[
block].dc_coeff = 0;
626 s->above_blocks[
block].not_null_dc = 0;
627 }
630
633
634 if (s->flip < 0)
635 mb_offset = 7;
636
637 /* main macroblocks loop */
638 for (mb_row=0; mb_row<s->mb_height; mb_row++) {
639 if (s->flip < 0)
640 mb_row_flip = s->mb_height - mb_row - 1;
641 else
642 mb_row_flip = mb_row;
643
644 for (block=0; block<4; block++) {
646 s->left_block[
block].dc_coeff = 0;
647 s->left_block[
block].not_null_dc = 0;
648 }
649 memset(s->coeff_ctx, 0, sizeof(s->coeff_ctx));
650 memset(s->coeff_ctx_last, 24, sizeof(s->coeff_ctx_last));
651
652 s->above_block_idx[0] = 1;
653 s->above_block_idx[1] = 2;
654 s->above_block_idx[2] = 1;
655 s->above_block_idx[3] = 2;
656 s->above_block_idx[4] = 2*s->mb_width + 2 + 1;
657 s->above_block_idx[5] = 3*s->mb_width + 4 + 1;
658
659 s->block_offset[s->frbi] = (mb_row_flip*16 + mb_offset) * stride_y;
660 s->block_offset[s->srbi] = s->block_offset[s->frbi] + 8*stride_y;
661 s->block_offset[1] = s->block_offset[0] + 8;
662 s->block_offset[3] = s->block_offset[2] + 8;
663 s->block_offset[4] = (mb_row_flip*8 + mb_offset) * stride_uv;
664 s->block_offset[5] = s->block_offset[4];
665
666 for (mb_col=0; mb_col<s->mb_width; mb_col++) {
668
669 for (y=0; y<4; y++) {
670 s->above_block_idx[y] += 2;
671 s->block_offset[y] += 16;
672 }
673
674 for (uv=4; uv<6; uv++) {
675 s->above_block_idx[uv] += 1;
676 s->block_offset[uv] += 8;
677 }
678 }
679 }
680
681 next:
684 }
685
688 return 0;
689 }
690
692 {
695 }
696
698 int flip,
int has_alpha)
699 {
700 int i;
701
702 s->avctx = avctx;
704
711
712 for (i=0; i<4; i++) {
713 s->framep[i] = &s->frames[i];
715 }
718 s->edge_emu_buffer_alloc =
NULL;
719
720 s->above_blocks =
NULL;
721 s->macroblocks =
NULL;
722 s->quantizer = -1;
723 s->deblock_filtering = 1;
724 s->golden_frame = 0;
725
727
728 s->has_alpha = has_alpha;
729
730 s->modelp = &s->model;
731
732 if (flip) {
733 s->flip = -1;
734 s->frbi = 2;
735 s->srbi = 0;
736 } else {
737 s->flip = 1;
738 s->frbi = 0;
739 s->srbi = 2;
740 }
741 }
742
744 {
747 }
748
750 {
752 int i;
753
757 av_freep(&s->edge_emu_buffer_alloc);
758 for (i = 0; i < 4; ++i) {
759 if (s->frames[i].data[0])
761 }
762 return 0;
763 }