1 /*
2 * Chinese AVS video (AVS1-P2, JiZhun profile) decoder.
3 * Copyright (c) 2006 Stefan Gehrer <stefan.gehrer@gmx.de>
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 /**
23 * @file
24 * Chinese AVS video (AVS1-P2, JiZhun profile) decoder
25 * @author Stefan Gehrer <stefan.gehrer@gmx.de>
26 */
27
29
39
41 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3,
42 4, 4, 5, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 18, 20,
43 22, 24, 26, 28, 30, 33, 33, 35, 35, 36, 37, 37, 39, 39, 42, 44,
44 46, 48, 50, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64
45 };
46
48 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2,
49 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6,
50 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 14,
51 15, 16, 17, 18, 19, 20, 21, 22, 23, 23, 24, 24, 25, 25, 26, 27
52 };
53
55 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
56 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2,
57 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4,
58 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9
59 };
60
61 /** mark block as unavailable, i.e. out of picture
62 * or not yet decoded */
64
69
70 /*****************************************************************************
71 *
72 * in-loop deblocking filter
73 *
74 ****************************************************************************/
75
77 {
79 return 2;
80 if((
abs(mvP->
x - mvQ->
x) >= 4) ||
81 (
abs(mvP->
y - mvQ->
y) >= 4) ||
83 return 1;
87 if((
abs(mvP->
x - mvQ->
x) >= 4) ||
88 (
abs(mvP->
y - mvQ->
y) >= 4) ||
90 return 1;
91 }
92 return 0;
93 }
94
96 alpha = alpha_tab[av_clip_uintp2(qp_avg + h->alpha_offset, 6)]; \
97 beta = beta_tab[av_clip_uintp2(qp_avg + h->beta_offset, 6)]; \
98 tc = tc_tab[av_clip_uintp2(qp_avg + h->alpha_offset, 6)];
99
100 /**
101 * in-loop deblocking filter for a single macroblock
102 *
103 * boundary strength (bs) mapping:
104 *
105 * --4---5--
106 * 0 2 |
107 * | 6 | 7 |
108 * 1 3 |
109 * ---------
110 */
112 {
113 uint8_t bs[8];
116
117 /* save un-deblocked lines */
118 h->topleft_border_y =
h->top_border_y[
h->mbx * 16 + 15];
119 h->topleft_border_u =
h->top_border_u[
h->mbx * 10 + 8];
120 h->topleft_border_v =
h->top_border_v[
h->mbx * 10 + 8];
121 memcpy(&
h->top_border_y[
h->mbx * 16],
h->cy + 15 *
h->l_stride, 16);
122 memcpy(&
h->top_border_u[
h->mbx * 10 + 1],
h->cu + 7 *
h->c_stride, 8);
123 memcpy(&
h->top_border_v[
h->mbx * 10 + 1],
h->cv + 7 *
h->c_stride, 8);
124 for (
i = 0;
i < 8;
i++) {
125 h->left_border_y[
i * 2 + 1] = *(
h->cy + 15 + (
i * 2 + 0) *
h->l_stride);
126 h->left_border_y[
i * 2 + 2] = *(
h->cy + 15 + (
i * 2 + 1) *
h->l_stride);
127 h->left_border_u[
i + 1] = *(
h->cu + 7 +
i *
h->c_stride);
128 h->left_border_v[
i + 1] = *(
h->cv + 7 +
i *
h->c_stride);
129 }
130 if (!
h->loop_filter_disable) {
131 /* determine bs */
132 if (mb_type ==
I_8X8)
133 memset(bs, 2, 8);
134 else {
135 memset(bs, 0, 8);
139 }
143 }
148 }
151 qp_avg = (
h->qp +
h->left_qp + 1) >> 1;
153 h->cdsp.cavs_filter_lv(
h->cy,
h->l_stride,
alpha, beta,
tc, bs[0], bs[1]);
156 h->cdsp.cavs_filter_cv(
h->cu,
h->c_stride,
alpha, beta,
tc, bs[0], bs[1]);
157 h->cdsp.cavs_filter_cv(
h->cv,
h->c_stride,
alpha, beta,
tc, bs[0], bs[1]);
158 }
161 h->cdsp.cavs_filter_lv(
h->cy + 8,
h->l_stride,
alpha, beta,
tc, bs[2], bs[3]);
162 h->cdsp.cavs_filter_lh(
h->cy + 8 *
h->l_stride,
h->l_stride,
alpha, beta,
tc, bs[6], bs[7]);
163
165 qp_avg = (
h->qp +
h->top_qp[
h->mbx] + 1) >> 1;
167 h->cdsp.cavs_filter_lh(
h->cy,
h->l_stride,
alpha, beta,
tc, bs[4], bs[5]);
170 h->cdsp.cavs_filter_ch(
h->cu,
h->c_stride,
alpha, beta,
tc, bs[4], bs[5]);
171 h->cdsp.cavs_filter_ch(
h->cv,
h->c_stride,
alpha, beta,
tc, bs[4], bs[5]);
172 }
173 }
174 }
176 h->top_qp[
h->mbx] =
h->qp;
177 }
178
179 #undef SET_PARAMS
180
181 /*****************************************************************************
182 *
183 * spatial intra prediction
184 *
185 ****************************************************************************/
186
189 {
191
193 case 0:
194 *
left =
h->left_border_y;
195 h->left_border_y[0] =
h->left_border_y[1];
196 memset(&
h->left_border_y[17],
h->left_border_y[16], 9);
197 memcpy(&top[1], &
h->top_border_y[
h->mbx * 16], 16);
198 top[17] = top[16];
199 top[0] = top[1];
201 h->left_border_y[0] = top[0] =
h->topleft_border_y;
202 break;
203 case 1:
204 *
left =
h->intern_border_y;
205 for (
i = 0;
i < 8;
i++)
206 h->intern_border_y[
i + 1] = *(
h->cy + 7 +
i *
h->l_stride);
207 memset(&
h->intern_border_y[9],
h->intern_border_y[8], 9);
208 h->intern_border_y[0] =
h->intern_border_y[1];
209 memcpy(&top[1], &
h->top_border_y[
h->mbx * 16 + 8], 8);
211 memcpy(&top[9], &
h->top_border_y[(
h->mbx + 1) * 16], 8);
212 else
213 memset(&top[9], top[8], 9);
214 top[17] = top[16];
215 top[0] = top[1];
217 h->intern_border_y[0] = top[0] =
h->top_border_y[
h->mbx * 16 + 7];
218 break;
219 case 2:
220 *
left = &
h->left_border_y[8];
221 memcpy(&top[1],
h->cy + 7 *
h->l_stride, 16);
222 top[17] = top[16];
223 top[0] = top[1];
225 top[0] =
h->left_border_y[8];
226 break;
227 case 3:
228 *
left = &
h->intern_border_y[8];
229 for (
i = 0;
i < 8;
i++)
230 h->intern_border_y[
i + 9] = *(
h->cy + 7 + (
i + 8) *
h->l_stride);
231 memset(&
h->intern_border_y[17],
h->intern_border_y[16], 9);
232 memcpy(&top[0],
h->cy + 7 + 7 *
h->l_stride, 9);
233 memset(&top[9], top[8], 9);
234 break;
235 }
236 }
237
239 {
240 /* extend borders by one pixel */
241 h->left_border_u[9] =
h->left_border_u[8];
242 h->left_border_v[9] =
h->left_border_v[8];
244 h->top_border_u[
h->mbx*10 + 9] =
h->top_border_u[
h->mbx*10 + 11];
245 h->top_border_v[
h->mbx*10 + 9] =
h->top_border_v[
h->mbx*10 + 11];
246 } else {
247 h->top_border_u[
h->mbx * 10 + 9] =
h->top_border_u[
h->mbx * 10 + 8];
248 h->top_border_v[
h->mbx * 10 + 9] =
h->top_border_v[
h->mbx * 10 + 8];
249 }
251 h->top_border_u[
h->mbx * 10] =
h->left_border_u[0] =
h->topleft_border_u;
252 h->top_border_v[
h->mbx * 10] =
h->left_border_v[0] =
h->topleft_border_v;
253 } else {
254 h->left_border_u[0] =
h->left_border_u[1];
255 h->left_border_v[0] =
h->left_border_v[1];
256 h->top_border_u[
h->mbx * 10] =
h->top_border_u[
h->mbx * 10 + 1];
257 h->top_border_v[
h->mbx * 10] =
h->top_border_v[
h->mbx * 10 + 1];
258 }
259 }
260
262 {
263 int y;
265 for (y = 0; y < 8; y++)
266 *((uint64_t *)(
d + y *
stride)) =
a;
267 }
268
270 {
271 int y;
273 for (y = 0; y < 8; y++) {
274 a =
left[y + 1] * 0x0101010101010101ULL;
275 *((uint64_t *)(
d + y *
stride)) =
a;
276 }
277 }
278
280 {
281 int y;
282 uint64_t
a = 0x8080808080808080ULL;
283 for (y = 0; y < 8; y++)
284 *((uint64_t *)(
d + y *
stride)) =
a;
285 }
286
288 {
289 int x, y, ia;
290 int ih = 0;
291 int iv = 0;
293
294 for (x = 0; x < 4; x++) {
295 ih += (x + 1) * (top[5 + x] - top[3 - x]);
296 iv += (x + 1) * (
left[5 + x] -
left[3 - x]);
297 }
298 ia = (top[8] +
left[8]) << 4;
299 ih = (17 * ih + 16) >> 5;
300 iv = (17 * iv + 16) >> 5;
301 for (y = 0; y < 8; y++)
302 for (x = 0; x < 8; x++)
303 d[y *
stride + x] =
cm[(ia + (x - 3) * ih + (y - 3) * iv + 16) >> 5];
304 }
305
306 #define LOWPASS(ARRAY, INDEX) \
307 ((ARRAY[(INDEX) - 1] + 2 * ARRAY[(INDEX)] + ARRAY[(INDEX) + 1] + 2) >> 2)
308
310 {
311 int x, y;
312 for (y = 0; y < 8; y++)
313 for (x = 0; x < 8; x++)
315 }
316
318 {
319 int x, y;
320 for (y = 0; y < 8; y++)
321 for (x = 0; x < 8; x++)
323 }
324
326 {
327 int x, y;
328 for (y = 0; y < 8; y++)
329 for (x = 0; x < 8; x++)
330 if (x == y)
331 d[y *
stride + x] = (
left[1] + 2 * top[0] + top[1] + 2) >> 2;
332 else if (x > y)
334 else
336 }
337
339 {
340 int x, y;
341 for (y = 0; y < 8; y++)
342 for (x = 0; x < 8; x++)
344 }
345
347 {
348 int x, y;
349 for (y = 0; y < 8; y++)
350 for (x = 0; x < 8; x++)
352 }
353
354 #undef LOWPASS
355
357 {
362 }
363 }
364
366 {
367 /* save pred modes before they get modified */
368 h->pred_mode_Y[3] =
h->pred_mode_Y[5];
369 h->pred_mode_Y[6] =
h->pred_mode_Y[8];
370 h->top_pred_Y[
h->mbx * 2 + 0] =
h->pred_mode_Y[7];
371 h->top_pred_Y[
h->mbx * 2 + 1] =
h->pred_mode_Y[8];
372
373 /* modify pred modes according to availability of neighbour samples */
378 }
383 }
384 }
385
386 /*****************************************************************************
387 *
388 * motion compensation
389 *
390 ****************************************************************************/
391
394 uint8_t *dest_cb, uint8_t *dest_cr,
395 int src_x_offset, int src_y_offset,
398 {
399 const int mx =
mv->x + src_x_offset * 8;
400 const int my =
mv->y + src_y_offset * 8;
401 const int luma_xy = (mx & 3) + ((my & 3) << 2);
402 uint8_t *src_y = pic->
data[0] + (mx >> 2) + (my >> 2) *
h->l_stride;
403 uint8_t *src_cb = pic->
data[1] + (mx >> 3) + (my >> 3) *
h->c_stride;
404 uint8_t *src_cr = pic->
data[2] + (mx >> 3) + (my >> 3) *
h->c_stride;
405 int extra_width = 0;
406 int extra_height = extra_width;
407 const int full_mx = mx >> 2;
408 const int full_my = my >> 2;
409 const int pic_width = 16 *
h->mb_width;
410 const int pic_height = 16 *
h->mb_height;
411 int emu = 0;
412
414 return;
415 if (mx & 7)
416 extra_width -= 3;
417 if (my & 7)
418 extra_height -= 3;
419
420 if (full_mx < 0 - extra_width ||
421 full_my < 0 - extra_height ||
422 full_mx + 16 /* FIXME */ > pic_width + extra_width ||
423 full_my + 16 /* FIXME */ > pic_height + extra_height) {
424 h->vdsp.emulated_edge_mc(
h->edge_emu_buffer,
425 src_y - 2 - 2 *
h->l_stride,
426 h->l_stride,
h->l_stride,
427 16 + 5, 16 + 5 /* FIXME */,
428 full_mx - 2, full_my - 2,
429 pic_width, pic_height);
430 src_y =
h->edge_emu_buffer + 2 + 2 *
h->l_stride;
431 emu = 1;
432 }
433
434 // FIXME try variable height perhaps?
435 qpix_op[luma_xy](dest_y, src_y,
h->l_stride);
436
437 if (emu) {
438 h->vdsp.emulated_edge_mc(
h->edge_emu_buffer, src_cb,
439 h->c_stride,
h->c_stride,
440 9, 9 /* FIXME */,
441 mx >> 3, my >> 3,
442 pic_width >> 1, pic_height >> 1);
443 src_cb =
h->edge_emu_buffer;
444 }
445 chroma_op(dest_cb, src_cb,
h->c_stride, chroma_height, mx & 7, my & 7);
446
447 if (emu) {
448 h->vdsp.emulated_edge_mc(
h->edge_emu_buffer, src_cr,
449 h->c_stride,
h->c_stride,
450 9, 9 /* FIXME */,
451 mx >> 3, my >> 3,
452 pic_width >> 1, pic_height >> 1);
453 src_cr =
h->edge_emu_buffer;
454 }
455 chroma_op(dest_cr, src_cr,
h->c_stride, chroma_height, mx & 7, my & 7);
456 }
457
459 uint8_t *dest_y,
460 uint8_t *dest_cb,
461 uint8_t *dest_cr,
462 int x_offset, int y_offset,
468 {
471
472 dest_y += x_offset * 2 + y_offset *
h->l_stride * 2;
473 dest_cb += x_offset + y_offset *
h->c_stride;
474 dest_cr += x_offset + y_offset *
h->c_stride;
475 x_offset += 8 *
h->mbx;
476 y_offset += 8 *
h->mby;
477
481 dest_y, dest_cb, dest_cr, x_offset, y_offset,
482 qpix_op, chroma_op,
mv);
483
484 qpix_op = qpix_avg;
485 chroma_op = chroma_avg;
486 }
487
491 dest_y, dest_cb, dest_cr, x_offset, y_offset,
493 }
494 }
495
497 {
500 h->cdsp.put_cavs_qpel_pixels_tab[0],
501 h->h264chroma.put_h264_chroma_pixels_tab[0],
502 h->cdsp.avg_cavs_qpel_pixels_tab[0],
503 h->h264chroma.avg_h264_chroma_pixels_tab[0],
505 } else {
507 h->cdsp.put_cavs_qpel_pixels_tab[1],
508 h->h264chroma.put_h264_chroma_pixels_tab[1],
509 h->cdsp.avg_cavs_qpel_pixels_tab[1],
510 h->h264chroma.avg_h264_chroma_pixels_tab[1],
513 h->cdsp.put_cavs_qpel_pixels_tab[1],
514 h->h264chroma.put_h264_chroma_pixels_tab[1],
515 h->cdsp.avg_cavs_qpel_pixels_tab[1],
516 h->h264chroma.avg_h264_chroma_pixels_tab[1],
519 h->cdsp.put_cavs_qpel_pixels_tab[1],
520 h->h264chroma.put_h264_chroma_pixels_tab[1],
521 h->cdsp.avg_cavs_qpel_pixels_tab[1],
522 h->h264chroma.avg_h264_chroma_pixels_tab[1],
525 h->cdsp.put_cavs_qpel_pixels_tab[1],
526 h->h264chroma.put_h264_chroma_pixels_tab[1],
527 h->cdsp.avg_cavs_qpel_pixels_tab[1],
528 h->h264chroma.avg_h264_chroma_pixels_tab[1],
530 }
531 }
532
533 /*****************************************************************************
534 *
535 * motion vector prediction
536 *
537 ****************************************************************************/
538
541 {
542 int64_t den =
h->scale_den[
FFMAX(
src->ref, 0)];
545 }
546
552 {
553 int ax, ay, bx, by, cx, cy;
554 int len_ab, len_bc, len_ca, len_mid;
555
556 /* scale candidates according to their temporal span */
560 /* find the geometrical median of the three candidates */
561 len_ab =
abs(ax - bx) +
abs(ay - by);
562 len_bc =
abs(bx - cx) +
abs(by - cy);
563 len_ca =
abs(cx - ax) +
abs(cy - ay);
564 len_mid =
mid_pred(len_ab, len_bc, len_ca);
565 if (len_mid == len_ab) {
568 } else if (len_mid == len_bc) {
571 } else {
574 }
575 }
576
579 {
585
589 mvC = &
h->mv[nP - 5];
// set to top-left (mvD)
593 (mvA->
x | mvA->
y | mvA->
ref) == 0 ||
594 (mvB->
x | mvB->
y | mvB->
ref) == 0)) {
596 /* if there is only one suitable candidate, take it */
597 }
else if (mvA->
ref >= 0 && mvB->
ref < 0 && mvC->
ref < 0) {
598 mvP2 = mvA;
599 }
else if (mvA->
ref < 0 && mvB->
ref >= 0 && mvC->
ref < 0) {
600 mvP2 = mvB;
601 }
else if (mvA->
ref < 0 && mvB->
ref < 0 && mvC->
ref >= 0) {
602 mvP2 = mvC;
604 mvP2 = mvA;
606 mvP2 = mvB;
608 mvP2 = mvC;
609 }
610 if (mvP2) {
613 } else
615
619
620 if (mx != (int16_t)mx || my != (int16_t)my) {
622 } else {
625 }
626 }
628 }
629
630 /*****************************************************************************
631 *
632 * macroblock level
633 *
634 ****************************************************************************/
635
636 /**
637 * initialise predictors for motion vectors and intra prediction
638 */
640 {
642
643 /* copy predictors from top line (MB B and C) into cache */
644 for (
i = 0;
i < 3;
i++) {
647 }
648 h->pred_mode_Y[1] =
h->top_pred_Y[
h->mbx * 2 + 0];
649 h->pred_mode_Y[2] =
h->top_pred_Y[
h->mbx * 2 + 1];
650 /* clear top predictors if MB B is not available */
660 }
661 if (
h->mbx ==
h->mb_width - 1)
// MB C not available
663 /* clear top-right predictors if MB C is not available */
667 }
668 /* clear top-left predictors if MB D is not available */
672 }
673 }
674
675 /**
676 * save predictors for later macroblocks and increase
677 * macroblock address
678 * @return 0 if end of frame is reached, 1 otherwise
679 */
681 {
683
688 /* copy mvs as predictors to the left */
689 for (
i = 0;
i <= 20;
i += 4)
690 h->mv[
i] =
h->mv[
i + 2];
691 /* copy bottom mvs from cache to top line */
696 /* next MB address */
699 if (
h->mbx ==
h->mb_width) {
// New mb line
701 /* clear left pred_modes */
703 /* clear left mv predictors */
704 for (
i = 0;
i <= 20;
i += 4)
708 /* re-calculate sample pointers */
709 h->cy =
h->cur.f->data[0] +
h->mby * 16 *
h->l_stride;
710 h->cu =
h->cur.f->data[1] +
h->mby * 8 *
h->c_stride;
711 h->cv =
h->cur.f->data[2] +
h->mby * 8 *
h->c_stride;
712 if (
h->mby ==
h->mb_height) {
// Frame end
713 return 0;
714 }
715 }
716 return 1;
717 }
718
719 /*****************************************************************************
720 *
721 * frame level
722 *
723 ****************************************************************************/
724
726 {
728
729 /* clear some predictors */
730 for (
i = 0;
i <= 20;
i += 4)
737 h->cy =
h->cur.f->data[0];
738 h->cu =
h->cur.f->data[1];
739 h->cv =
h->cur.f->data[2];
740 h->l_stride =
h->cur.f->linesize[0];
741 h->c_stride =
h->cur.f->linesize[1];
742 h->luma_scan[2] = 8 *
h->l_stride;
743 h->luma_scan[3] = 8 *
h->l_stride + 8;
744 h->mbx =
h->mby =
h->mbidx = 0;
746
747 return 0;
748 }
749
750 /*****************************************************************************
751 *
752 * headers and interface
753 *
754 ****************************************************************************/
755
756 /**
757 * some predictions require data from the top-neighbouring macroblock.
758 * this data has to be stored for one complete row of macroblocks
759 * and this storage space is allocated here
760 */
762 {
763 /* alloc top line of predictors */
767 h->top_pred_Y =
av_calloc(
h->mb_width * 2,
sizeof(*
h->top_pred_Y));
771
772 /* alloc space for co-located MVs and types */
774 4 *
sizeof(*
h->col_mv));
777
778 if (!
h->top_qp || !
h->top_mv[0] || !
h->top_mv[1] || !
h->top_pred_Y ||
779 !
h->top_border_y || !
h->top_border_u || !
h->top_border_v ||
780 !
h->col_mv || !
h->col_type_base || !
h->block) {
792 }
793 return 0;
794 }
795
797 {
799
808
811
815 if (!
h->cur.f || !
h->DPB[0].f || !
h->DPB[1].f) {
818 }
819
839 return 0;
840 }
841
843 {
845
849
861 return 0;
862 }