2 * Copyright (C) 2010 David Conrad
3 * Copyright (C) 2010 Ronald S. Bultje
5 * This file is part of Libav.
7 * Libav 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.
12 * Libav 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.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with Libav; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
24 * VP8 compatible video decoder
30 // TODO: Maybe add dequant
31 static void vp8_luma_dc_wht_c(DCTELEM block[4][4][16], DCTELEM dc[16])
33 int i, t0, t1, t2, t3;
35 for (i = 0; i < 4; i++) {
36 t0 = dc[0*4+i] + dc[3*4+i];
37 t1 = dc[1*4+i] + dc[2*4+i];
38 t2 = dc[1*4+i] - dc[2*4+i];
39 t3 = dc[0*4+i] - dc[3*4+i];
47 for (i = 0; i < 4; i++) {
48 t0 = dc[i*4+0] + dc[i*4+3] + 3; // rounding
49 t1 = dc[i*4+1] + dc[i*4+2];
50 t2 = dc[i*4+1] - dc[i*4+2];
51 t3 = dc[i*4+0] - dc[i*4+3] + 3; // rounding
57 block[i][0][0] = (t0 + t1) >> 3;
58 block[i][1][0] = (t3 + t2) >> 3;
59 block[i][2][0] = (t0 - t1) >> 3;
60 block[i][3][0] = (t3 - t2) >> 3;
64 static void vp8_luma_dc_wht_dc_c(DCTELEM block[4][4][16], DCTELEM dc[16])
66 int i, val = (dc[0] + 3) >> 3;
69 for (i = 0; i < 4; i++) {
77 #define MUL_20091(a) ((((a)*20091) >> 16) + (a))
78 #define MUL_35468(a) (((a)*35468) >> 16)
80 static void vp8_idct_add_c(uint8_t *dst, DCTELEM block[16], int stride)
82 int i, t0, t1, t2, t3;
83 uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
86 for (i = 0; i < 4; i++) {
87 t0 = block[0*4+i] + block[2*4+i];
88 t1 = block[0*4+i] - block[2*4+i];
89 t2 = MUL_35468(block[1*4+i]) - MUL_20091(block[3*4+i]);
90 t3 = MUL_20091(block[1*4+i]) + MUL_35468(block[3*4+i]);
102 for (i = 0; i < 4; i++) {
103 t0 = tmp[0*4+i] + tmp[2*4+i];
104 t1 = tmp[0*4+i] - tmp[2*4+i];
105 t2 = MUL_35468(tmp[1*4+i]) - MUL_20091(tmp[3*4+i]);
106 t3 = MUL_20091(tmp[1*4+i]) + MUL_35468(tmp[3*4+i]);
108 dst[0] = cm[dst[0] + ((t0 + t3 + 4) >> 3)];
109 dst[1] = cm[dst[1] + ((t1 + t2 + 4) >> 3)];
110 dst[2] = cm[dst[2] + ((t1 - t2 + 4) >> 3)];
111 dst[3] = cm[dst[3] + ((t0 - t3 + 4) >> 3)];
116 static void vp8_idct_dc_add_c(uint8_t *dst, DCTELEM block[16], int stride)
118 int i, dc = (block[0] + 4) >> 3;
119 uint8_t *cm = ff_cropTbl + MAX_NEG_CROP + dc;
122 for (i = 0; i < 4; i++) {
131 static void vp8_idct_dc_add4uv_c(uint8_t *dst, DCTELEM block[4][16], int stride)
133 vp8_idct_dc_add_c(dst+stride*0+0, block[0], stride);
134 vp8_idct_dc_add_c(dst+stride*0+4, block[1], stride);
135 vp8_idct_dc_add_c(dst+stride*4+0, block[2], stride);
136 vp8_idct_dc_add_c(dst+stride*4+4, block[3], stride);
139 static void vp8_idct_dc_add4y_c(uint8_t *dst, DCTELEM block[4][16], int stride)
141 vp8_idct_dc_add_c(dst+ 0, block[0], stride);
142 vp8_idct_dc_add_c(dst+ 4, block[1], stride);
143 vp8_idct_dc_add_c(dst+ 8, block[2], stride);
144 vp8_idct_dc_add_c(dst+12, block[3], stride);
147 // because I like only having two parameters to pass functions...
149 int av_unused p3 = p[-4*stride];\
150 int av_unused p2 = p[-3*stride];\
151 int av_unused p1 = p[-2*stride];\
152 int av_unused p0 = p[-1*stride];\
153 int av_unused q0 = p[ 0*stride];\
154 int av_unused q1 = p[ 1*stride];\
155 int av_unused q2 = p[ 2*stride];\
156 int av_unused q3 = p[ 3*stride];
158 #define clip_int8(n) (cm[n+0x80]-0x80)
160 static av_always_inline void filter_common(uint8_t *p, int stride, int is4tap)
164 uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
169 a += clip_int8(p1 - q1);
173 // We deviate from the spec here with c(a+3) >> 3
174 // since that's what libvpx does.
175 f1 = FFMIN(a+4, 127) >> 3;
176 f2 = FFMIN(a+3, 127) >> 3;
178 // Despite what the spec says, we do need to clamp here to
179 // be bitexact with libvpx.
180 p[-1*stride] = cm[p0 + f2];
181 p[ 0*stride] = cm[q0 - f1];
183 // only used for _inner on blocks without high edge variance
186 p[-2*stride] = cm[p1 + a];
187 p[ 1*stride] = cm[q1 - a];
191 static av_always_inline int simple_limit(uint8_t *p, int stride, int flim)
194 return 2*FFABS(p0-q0) + (FFABS(p1-q1) >> 1) <= flim;
198 * E - limit at the macroblock edge
199 * I - limit for interior difference
201 static av_always_inline int normal_limit(uint8_t *p, int stride, int E, int I)
204 return simple_limit(p, stride, E)
205 && FFABS(p3-p2) <= I && FFABS(p2-p1) <= I && FFABS(p1-p0) <= I
206 && FFABS(q3-q2) <= I && FFABS(q2-q1) <= I && FFABS(q1-q0) <= I;
209 // high edge variance
210 static av_always_inline int hev(uint8_t *p, int stride, int thresh)
213 return FFABS(p1-p0) > thresh || FFABS(q1-q0) > thresh;
216 static av_always_inline void filter_mbedge(uint8_t *p, int stride)
219 uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
223 w = clip_int8(p1-q1);
224 w = clip_int8(w + 3*(q0-p0));
226 a0 = (27*w + 63) >> 7;
227 a1 = (18*w + 63) >> 7;
228 a2 = ( 9*w + 63) >> 7;
230 p[-3*stride] = cm[p2 + a2];
231 p[-2*stride] = cm[p1 + a1];
232 p[-1*stride] = cm[p0 + a0];
233 p[ 0*stride] = cm[q0 - a0];
234 p[ 1*stride] = cm[q1 - a1];
235 p[ 2*stride] = cm[q2 - a2];
238 #define LOOP_FILTER(dir, size, stridea, strideb, maybe_inline) \
239 static maybe_inline void vp8_ ## dir ## _loop_filter ## size ## _c(uint8_t *dst, int stride,\
240 int flim_E, int flim_I, int hev_thresh)\
244 for (i = 0; i < size; i++)\
245 if (normal_limit(dst+i*stridea, strideb, flim_E, flim_I)) {\
246 if (hev(dst+i*stridea, strideb, hev_thresh))\
247 filter_common(dst+i*stridea, strideb, 1);\
249 filter_mbedge(dst+i*stridea, strideb);\
253 static maybe_inline void vp8_ ## dir ## _loop_filter ## size ## _inner_c(uint8_t *dst, int stride,\
254 int flim_E, int flim_I, int hev_thresh)\
258 for (i = 0; i < size; i++)\
259 if (normal_limit(dst+i*stridea, strideb, flim_E, flim_I)) {\
260 int hv = hev(dst+i*stridea, strideb, hev_thresh);\
262 filter_common(dst+i*stridea, strideb, 1);\
264 filter_common(dst+i*stridea, strideb, 0);\
268 LOOP_FILTER(v, 16, 1, stride,)
269 LOOP_FILTER(h, 16, stride, 1,)
271 #define UV_LOOP_FILTER(dir, stridea, strideb) \
272 LOOP_FILTER(dir, 8, stridea, strideb, av_always_inline) \
273 static void vp8_ ## dir ## _loop_filter8uv_c(uint8_t *dstU, uint8_t *dstV, int stride,\
274 int fE, int fI, int hev_thresh)\
276 vp8_ ## dir ## _loop_filter8_c(dstU, stride, fE, fI, hev_thresh);\
277 vp8_ ## dir ## _loop_filter8_c(dstV, stride, fE, fI, hev_thresh);\
279 static void vp8_ ## dir ## _loop_filter8uv_inner_c(uint8_t *dstU, uint8_t *dstV, int stride,\
280 int fE, int fI, int hev_thresh)\
282 vp8_ ## dir ## _loop_filter8_inner_c(dstU, stride, fE, fI, hev_thresh);\
283 vp8_ ## dir ## _loop_filter8_inner_c(dstV, stride, fE, fI, hev_thresh);\
286 UV_LOOP_FILTER(v, 1, stride)
287 UV_LOOP_FILTER(h, stride, 1)
289 static void vp8_v_loop_filter_simple_c(uint8_t *dst, int stride, int flim)
293 for (i = 0; i < 16; i++)
294 if (simple_limit(dst+i, stride, flim))
295 filter_common(dst+i, stride, 1);
298 static void vp8_h_loop_filter_simple_c(uint8_t *dst, int stride, int flim)
302 for (i = 0; i < 16; i++)
303 if (simple_limit(dst+i*stride, 1, flim))
304 filter_common(dst+i*stride, 1, 1);
307 static const uint8_t subpel_filters[7][6] = {
308 { 0, 6, 123, 12, 1, 0 },
309 { 2, 11, 108, 36, 8, 1 },
310 { 0, 9, 93, 50, 6, 0 },
311 { 3, 16, 77, 77, 16, 3 },
312 { 0, 6, 50, 93, 9, 0 },
313 { 1, 8, 36, 108, 11, 2 },
314 { 0, 1, 12, 123, 6, 0 },
317 #define PUT_PIXELS(WIDTH) \
318 static void put_vp8_pixels ## WIDTH ##_c(uint8_t *dst, int dststride, uint8_t *src, int srcstride, int h, int x, int y) { \
320 for (i = 0; i < h; i++, dst+= dststride, src+= srcstride) { \
321 memcpy(dst, src, WIDTH); \
329 #define FILTER_6TAP(src, F, stride) \
330 cm[(F[2]*src[x+0*stride] - F[1]*src[x-1*stride] + F[0]*src[x-2*stride] + \
331 F[3]*src[x+1*stride] - F[4]*src[x+2*stride] + F[5]*src[x+3*stride] + 64) >> 7]
333 #define FILTER_4TAP(src, F, stride) \
334 cm[(F[2]*src[x+0*stride] - F[1]*src[x-1*stride] + \
335 F[3]*src[x+1*stride] - F[4]*src[x+2*stride] + 64) >> 7]
337 #define VP8_EPEL_H(SIZE, TAPS) \
338 static void put_vp8_epel ## SIZE ## _h ## TAPS ## _c(uint8_t *dst, int dststride, uint8_t *src, int srcstride, int h, int mx, int my) \
340 const uint8_t *filter = subpel_filters[mx-1]; \
341 uint8_t *cm = ff_cropTbl + MAX_NEG_CROP; \
344 for (y = 0; y < h; y++) { \
345 for (x = 0; x < SIZE; x++) \
346 dst[x] = FILTER_ ## TAPS ## TAP(src, filter, 1); \
351 #define VP8_EPEL_V(SIZE, TAPS) \
352 static void put_vp8_epel ## SIZE ## _v ## TAPS ## _c(uint8_t *dst, int dststride, uint8_t *src, int srcstride, int h, int mx, int my) \
354 const uint8_t *filter = subpel_filters[my-1]; \
355 uint8_t *cm = ff_cropTbl + MAX_NEG_CROP; \
358 for (y = 0; y < h; y++) { \
359 for (x = 0; x < SIZE; x++) \
360 dst[x] = FILTER_ ## TAPS ## TAP(src, filter, srcstride); \
365 #define VP8_EPEL_HV(SIZE, HTAPS, VTAPS) \
366 static void put_vp8_epel ## SIZE ## _h ## HTAPS ## v ## VTAPS ## _c(uint8_t *dst, int dststride, uint8_t *src, int srcstride, int h, int mx, int my) \
368 const uint8_t *filter = subpel_filters[mx-1]; \
369 uint8_t *cm = ff_cropTbl + MAX_NEG_CROP; \
371 uint8_t tmp_array[(2*SIZE+VTAPS-1)*SIZE]; \
372 uint8_t *tmp = tmp_array; \
373 src -= (2-(VTAPS==4))*srcstride; \
375 for (y = 0; y < h+VTAPS-1; y++) { \
376 for (x = 0; x < SIZE; x++) \
377 tmp[x] = FILTER_ ## HTAPS ## TAP(src, filter, 1); \
382 tmp = tmp_array + (2-(VTAPS==4))*SIZE; \
383 filter = subpel_filters[my-1]; \
385 for (y = 0; y < h; y++) { \
386 for (x = 0; x < SIZE; x++) \
387 dst[x] = FILTER_ ## VTAPS ## TAP(tmp, filter, SIZE); \
405 VP8_EPEL_HV(16, 4, 4)
408 VP8_EPEL_HV(16, 4, 6)
411 VP8_EPEL_HV(16, 6, 4)
414 VP8_EPEL_HV(16, 6, 6)
418 #define VP8_BILINEAR(SIZE) \
419 static void put_vp8_bilinear ## SIZE ## _h_c(uint8_t *dst, int stride, uint8_t *src, int s2, int h, int mx, int my) \
421 int a = 8-mx, b = mx; \
424 for (y = 0; y < h; y++) { \
425 for (x = 0; x < SIZE; x++) \
426 dst[x] = (a*src[x] + b*src[x+1] + 4) >> 3; \
431 static void put_vp8_bilinear ## SIZE ## _v_c(uint8_t *dst, int stride, uint8_t *src, int s2, int h, int mx, int my) \
433 int c = 8-my, d = my; \
436 for (y = 0; y < h; y++) { \
437 for (x = 0; x < SIZE; x++) \
438 dst[x] = (c*src[x] + d*src[x+stride] + 4) >> 3; \
444 static void put_vp8_bilinear ## SIZE ## _hv_c(uint8_t *dst, int stride, uint8_t *src, int s2, int h, int mx, int my) \
446 int a = 8-mx, b = mx; \
447 int c = 8-my, d = my; \
449 uint8_t tmp_array[(2*SIZE+1)*SIZE]; \
450 uint8_t *tmp = tmp_array; \
452 for (y = 0; y < h+1; y++) { \
453 for (x = 0; x < SIZE; x++) \
454 tmp[x] = (a*src[x] + b*src[x+1] + 4) >> 3; \
461 for (y = 0; y < h; y++) { \
462 for (x = 0; x < SIZE; x++) \
463 dst[x] = (c*tmp[x] + d*tmp[x+SIZE] + 4) >> 3; \
473 #define VP8_MC_FUNC(IDX, SIZE) \
474 dsp->put_vp8_epel_pixels_tab[IDX][0][0] = put_vp8_pixels ## SIZE ## _c; \
475 dsp->put_vp8_epel_pixels_tab[IDX][0][1] = put_vp8_epel ## SIZE ## _h4_c; \
476 dsp->put_vp8_epel_pixels_tab[IDX][0][2] = put_vp8_epel ## SIZE ## _h6_c; \
477 dsp->put_vp8_epel_pixels_tab[IDX][1][0] = put_vp8_epel ## SIZE ## _v4_c; \
478 dsp->put_vp8_epel_pixels_tab[IDX][1][1] = put_vp8_epel ## SIZE ## _h4v4_c; \
479 dsp->put_vp8_epel_pixels_tab[IDX][1][2] = put_vp8_epel ## SIZE ## _h6v4_c; \
480 dsp->put_vp8_epel_pixels_tab[IDX][2][0] = put_vp8_epel ## SIZE ## _v6_c; \
481 dsp->put_vp8_epel_pixels_tab[IDX][2][1] = put_vp8_epel ## SIZE ## _h4v6_c; \
482 dsp->put_vp8_epel_pixels_tab[IDX][2][2] = put_vp8_epel ## SIZE ## _h6v6_c
484 #define VP8_BILINEAR_MC_FUNC(IDX, SIZE) \
485 dsp->put_vp8_bilinear_pixels_tab[IDX][0][0] = put_vp8_pixels ## SIZE ## _c; \
486 dsp->put_vp8_bilinear_pixels_tab[IDX][0][1] = put_vp8_bilinear ## SIZE ## _h_c; \
487 dsp->put_vp8_bilinear_pixels_tab[IDX][0][2] = put_vp8_bilinear ## SIZE ## _h_c; \
488 dsp->put_vp8_bilinear_pixels_tab[IDX][1][0] = put_vp8_bilinear ## SIZE ## _v_c; \
489 dsp->put_vp8_bilinear_pixels_tab[IDX][1][1] = put_vp8_bilinear ## SIZE ## _hv_c; \
490 dsp->put_vp8_bilinear_pixels_tab[IDX][1][2] = put_vp8_bilinear ## SIZE ## _hv_c; \
491 dsp->put_vp8_bilinear_pixels_tab[IDX][2][0] = put_vp8_bilinear ## SIZE ## _v_c; \
492 dsp->put_vp8_bilinear_pixels_tab[IDX][2][1] = put_vp8_bilinear ## SIZE ## _hv_c; \
493 dsp->put_vp8_bilinear_pixels_tab[IDX][2][2] = put_vp8_bilinear ## SIZE ## _hv_c
495 av_cold void ff_vp8dsp_init(VP8DSPContext *dsp)
497 dsp->vp8_luma_dc_wht = vp8_luma_dc_wht_c;
498 dsp->vp8_luma_dc_wht_dc = vp8_luma_dc_wht_dc_c;
499 dsp->vp8_idct_add = vp8_idct_add_c;
500 dsp->vp8_idct_dc_add = vp8_idct_dc_add_c;
501 dsp->vp8_idct_dc_add4y = vp8_idct_dc_add4y_c;
502 dsp->vp8_idct_dc_add4uv = vp8_idct_dc_add4uv_c;
504 dsp->vp8_v_loop_filter16y = vp8_v_loop_filter16_c;
505 dsp->vp8_h_loop_filter16y = vp8_h_loop_filter16_c;
506 dsp->vp8_v_loop_filter8uv = vp8_v_loop_filter8uv_c;
507 dsp->vp8_h_loop_filter8uv = vp8_h_loop_filter8uv_c;
509 dsp->vp8_v_loop_filter16y_inner = vp8_v_loop_filter16_inner_c;
510 dsp->vp8_h_loop_filter16y_inner = vp8_h_loop_filter16_inner_c;
511 dsp->vp8_v_loop_filter8uv_inner = vp8_v_loop_filter8uv_inner_c;
512 dsp->vp8_h_loop_filter8uv_inner = vp8_h_loop_filter8uv_inner_c;
514 dsp->vp8_v_loop_filter_simple = vp8_v_loop_filter_simple_c;
515 dsp->vp8_h_loop_filter_simple = vp8_h_loop_filter_simple_c;
521 VP8_BILINEAR_MC_FUNC(0, 16);
522 VP8_BILINEAR_MC_FUNC(1, 8);
523 VP8_BILINEAR_MC_FUNC(2, 4);
526 ff_vp8dsp_init_x86(dsp);
528 ff_vp8dsp_init_altivec(dsp);
530 ff_vp8dsp_init_arm(dsp);