2 * Copyright (C) 2010 David Conrad
3 * Copyright (C) 2010 Ronald S. Bultje
4 * Copyright (C) 2014 Peter Ross
6 * This file is part of FFmpeg.
8 * FFmpeg is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
13 * FFmpeg is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with FFmpeg; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
25 * VP8 compatible video decoder
30 #include "libavutil/common.h"
32 static void vp7_luma_dc_wht_c(int16_t block[4][4][16], int16_t dc[16])
34 int i, a1, b1, c1, d1;
37 for (i = 0; i < 4; i++) {
38 a1 = (dc[i*4+0] + dc[i*4+2]) * 23170;
39 b1 = (dc[i*4+0] - dc[i*4+2]) * 23170;
40 c1 = dc[i*4+1] * 12540 - dc[i*4+3] * 30274;
41 d1 = dc[i*4+1] * 30274 + dc[i*4+3] * 12540;
42 tmp[i*4+0] = (a1 + d1) >> 14;
43 tmp[i*4+3] = (a1 - d1) >> 14;
44 tmp[i*4+1] = (b1 + c1) >> 14;
45 tmp[i*4+2] = (b1 - c1) >> 14;
48 for (i = 0; i < 4; i++) {
49 a1 = (tmp[i + 0] + tmp[i + 8]) * 23170;
50 b1 = (tmp[i + 0] - tmp[i + 8]) * 23170;
51 c1 = tmp[i + 4] * 12540 - tmp[i + 12] * 30274;
52 d1 = tmp[i + 4] * 30274 + tmp[i + 12] * 12540;
57 block[0][i][0] = (a1 + d1 + 0x20000) >> 18;
58 block[3][i][0] = (a1 - d1 + 0x20000) >> 18;
59 block[1][i][0] = (b1 + c1 + 0x20000) >> 18;
60 block[2][i][0] = (b1 - c1 + 0x20000) >> 18;
64 static void vp7_luma_dc_wht_dc_c(int16_t block[4][4][16], int16_t dc[16])
66 int i, val = (23170 * (23170 * dc[0] >> 14) + 0x20000) >> 18;
69 for (i = 0; i < 4; i++) {
77 static void vp7_idct_add_c(uint8_t *dst, int16_t block[16], ptrdiff_t stride)
79 int i, a1, b1, c1, d1;
82 for (i = 0; i < 4; i++) {
83 a1 = (block[i*4+0] + block[i*4+2]) * 23170;
84 b1 = (block[i*4+0] - block[i*4+2]) * 23170;
85 c1 = block[i*4+1] * 12540 - block[i*4+3] * 30274;
86 d1 = block[i*4+1] * 30274 + block[i*4+3] * 12540;
91 tmp[i*4+0] = (a1 + d1) >> 14;
92 tmp[i*4+3] = (a1 - d1) >> 14;
93 tmp[i*4+1] = (b1 + c1) >> 14;
94 tmp[i*4+2] = (b1 - c1) >> 14;
97 for (i = 0; i < 4; i++) {
98 a1 = (tmp[i + 0] + tmp[i + 8]) * 23170;
99 b1 = (tmp[i + 0] - tmp[i + 8]) * 23170;
100 c1 = tmp[i + 4] * 12540 - tmp[i + 12] * 30274;
101 d1 = tmp[i + 4] * 30274 + tmp[i + 12] * 12540;
102 dst[0*stride+i] = av_clip_uint8(dst[0*stride+i] + ((a1 + d1 + 0x20000) >> 18));
103 dst[3*stride+i] = av_clip_uint8(dst[3*stride+i] + ((a1 - d1 + 0x20000) >> 18));
104 dst[1*stride+i] = av_clip_uint8(dst[1*stride+i] + ((b1 + c1 + 0x20000) >> 18));
105 dst[2*stride+i] = av_clip_uint8(dst[2*stride+i] + ((b1 - c1 + 0x20000) >> 18));
109 static void vp7_idct_dc_add_c(uint8_t *dst, int16_t block[16], ptrdiff_t stride)
111 int i, dc = (23170 * (23170 * block[0] >> 14) + 0x20000) >> 18;
114 for (i = 0; i < 4; i++) {
115 dst[0] = av_clip_uint8(dst[0] + dc);
116 dst[1] = av_clip_uint8(dst[1] + dc);
117 dst[2] = av_clip_uint8(dst[2] + dc);
118 dst[3] = av_clip_uint8(dst[3] + dc);
123 // TODO: Maybe add dequant
124 static void vp8_luma_dc_wht_c(int16_t block[4][4][16], int16_t dc[16])
126 int i, t0, t1, t2, t3;
128 for (i = 0; i < 4; i++) {
129 t0 = dc[0*4+i] + dc[3*4+i];
130 t1 = dc[1*4+i] + dc[2*4+i];
131 t2 = dc[1*4+i] - dc[2*4+i];
132 t3 = dc[0*4+i] - dc[3*4+i];
140 for (i = 0; i < 4; i++) {
141 t0 = dc[i*4+0] + dc[i*4+3] + 3; // rounding
142 t1 = dc[i*4+1] + dc[i*4+2];
143 t2 = dc[i*4+1] - dc[i*4+2];
144 t3 = dc[i*4+0] - dc[i*4+3] + 3; // rounding
150 block[i][0][0] = (t0 + t1) >> 3;
151 block[i][1][0] = (t3 + t2) >> 3;
152 block[i][2][0] = (t0 - t1) >> 3;
153 block[i][3][0] = (t3 - t2) >> 3;
157 static void vp8_luma_dc_wht_dc_c(int16_t block[4][4][16], int16_t dc[16])
159 int i, val = (dc[0] + 3) >> 3;
162 for (i = 0; i < 4; i++) {
163 block[i][0][0] = val;
164 block[i][1][0] = val;
165 block[i][2][0] = val;
166 block[i][3][0] = val;
170 #define MUL_20091(a) ((((a)*20091) >> 16) + (a))
171 #define MUL_35468(a) (((a)*35468) >> 16)
173 static void vp8_idct_add_c(uint8_t *dst, int16_t block[16], ptrdiff_t stride)
175 int i, t0, t1, t2, t3;
178 for (i = 0; i < 4; i++) {
179 t0 = block[0*4+i] + block[2*4+i];
180 t1 = block[0*4+i] - block[2*4+i];
181 t2 = MUL_35468(block[1*4+i]) - MUL_20091(block[3*4+i]);
182 t3 = MUL_20091(block[1*4+i]) + MUL_35468(block[3*4+i]);
188 tmp[i*4+0] = t0 + t3;
189 tmp[i*4+1] = t1 + t2;
190 tmp[i*4+2] = t1 - t2;
191 tmp[i*4+3] = t0 - t3;
194 for (i = 0; i < 4; i++) {
195 t0 = tmp[0*4+i] + tmp[2*4+i];
196 t1 = tmp[0*4+i] - tmp[2*4+i];
197 t2 = MUL_35468(tmp[1*4+i]) - MUL_20091(tmp[3*4+i]);
198 t3 = MUL_20091(tmp[1*4+i]) + MUL_35468(tmp[3*4+i]);
200 dst[0] = av_clip_uint8(dst[0] + ((t0 + t3 + 4) >> 3));
201 dst[1] = av_clip_uint8(dst[1] + ((t1 + t2 + 4) >> 3));
202 dst[2] = av_clip_uint8(dst[2] + ((t1 - t2 + 4) >> 3));
203 dst[3] = av_clip_uint8(dst[3] + ((t0 - t3 + 4) >> 3));
208 static void vp8_idct_dc_add_c(uint8_t *dst, int16_t block[16], ptrdiff_t stride)
210 int i, dc = (block[0] + 4) >> 3;
213 for (i = 0; i < 4; i++) {
214 dst[0] = av_clip_uint8(dst[0] + dc);
215 dst[1] = av_clip_uint8(dst[1] + dc);
216 dst[2] = av_clip_uint8(dst[2] + dc);
217 dst[3] = av_clip_uint8(dst[3] + dc);
222 #define MK_IDCT_DC_ADD4_C(name) \
223 static void name ## _idct_dc_add4uv_c(uint8_t *dst, int16_t block[4][16], ptrdiff_t stride)\
225 name ## _idct_dc_add_c(dst+stride*0+0, block[0], stride);\
226 name ## _idct_dc_add_c(dst+stride*0+4, block[1], stride);\
227 name ## _idct_dc_add_c(dst+stride*4+0, block[2], stride);\
228 name ## _idct_dc_add_c(dst+stride*4+4, block[3], stride);\
231 static void name ## _idct_dc_add4y_c(uint8_t *dst, int16_t block[4][16], ptrdiff_t stride)\
233 name ## _idct_dc_add_c(dst+ 0, block[0], stride);\
234 name ## _idct_dc_add_c(dst+ 4, block[1], stride);\
235 name ## _idct_dc_add_c(dst+ 8, block[2], stride);\
236 name ## _idct_dc_add_c(dst+12, block[3], stride);\
239 MK_IDCT_DC_ADD4_C(vp7)
240 MK_IDCT_DC_ADD4_C(vp8)
242 // because I like only having two parameters to pass functions...
244 int av_unused p3 = p[-4*stride];\
245 int av_unused p2 = p[-3*stride];\
246 int av_unused p1 = p[-2*stride];\
247 int av_unused p0 = p[-1*stride];\
248 int av_unused q0 = p[ 0*stride];\
249 int av_unused q1 = p[ 1*stride];\
250 int av_unused q2 = p[ 2*stride];\
251 int av_unused q3 = p[ 3*stride];
253 #define clip_int8(n) (cm[n+0x80]-0x80)
255 static av_always_inline void filter_common(uint8_t *p, ptrdiff_t stride, int is4tap, int vpn)
259 const uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
264 a += clip_int8(p1 - q1);
268 // We deviate from the spec here with c(a+3) >> 3
269 // since that's what libvpx does.
270 f1 = FFMIN(a+4, 127) >> 3;
273 f2 = f1 - ((a & 7) == 4);
275 f2 = FFMIN(a+3, 127) >> 3;
277 // Despite what the spec says, we do need to clamp here to
278 // be bitexact with libvpx.
279 p[-1*stride] = cm[p0 + f2];
280 p[ 0*stride] = cm[q0 - f1];
282 // only used for _inner on blocks without high edge variance
285 p[-2*stride] = cm[p1 + a];
286 p[ 1*stride] = cm[q1 - a];
290 static av_always_inline int vp7_simple_limit(uint8_t *p, ptrdiff_t stride, int flim)
293 return FFABS(p0-q0) <= flim;
296 static av_always_inline int vp8_simple_limit(uint8_t *p, ptrdiff_t stride, int flim)
299 return 2*FFABS(p0-q0) + (FFABS(p1-q1) >> 1) <= flim;
303 * E - limit at the macroblock edge
304 * I - limit for interior difference
306 #define NORMAL_LIMIT(vpn) \
307 static av_always_inline int vp ## vpn ## _normal_limit(uint8_t *p, ptrdiff_t stride, int E, int I)\
310 return vp ## vpn ## _simple_limit(p, stride, E)\
311 && FFABS(p3-p2) <= I && FFABS(p2-p1) <= I && FFABS(p1-p0) <= I\
312 && FFABS(q3-q2) <= I && FFABS(q2-q1) <= I && FFABS(q1-q0) <= I;\
318 // high edge variance
319 static av_always_inline int hev(uint8_t *p, ptrdiff_t stride, int thresh)
322 return FFABS(p1-p0) > thresh || FFABS(q1-q0) > thresh;
325 static av_always_inline void filter_mbedge(uint8_t *p, ptrdiff_t stride)
328 const uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
332 w = clip_int8(p1-q1);
333 w = clip_int8(w + 3*(q0-p0));
335 a0 = (27*w + 63) >> 7;
336 a1 = (18*w + 63) >> 7;
337 a2 = ( 9*w + 63) >> 7;
339 p[-3*stride] = cm[p2 + a2];
340 p[-2*stride] = cm[p1 + a1];
341 p[-1*stride] = cm[p0 + a0];
342 p[ 0*stride] = cm[q0 - a0];
343 p[ 1*stride] = cm[q1 - a1];
344 p[ 2*stride] = cm[q2 - a2];
347 #define LOOP_FILTER(vpn, dir, size, stridea, strideb, maybe_inline) \
348 static maybe_inline void vp ## vpn ## _ ## dir ## _loop_filter ## size ## _c(uint8_t *dst, ptrdiff_t stride,\
349 int flim_E, int flim_I, int hev_thresh)\
353 for (i = 0; i < size; i++)\
354 if (vp ## vpn ## _normal_limit(dst+i*stridea, strideb, flim_E, flim_I)) {\
355 if (hev(dst+i*stridea, strideb, hev_thresh))\
356 filter_common(dst+i*stridea, strideb, 1, vpn);\
358 filter_mbedge(dst+i*stridea, strideb);\
362 static maybe_inline void vp ## vpn ## _ ## dir ## _loop_filter ## size ## _inner_c(uint8_t *dst, ptrdiff_t stride,\
363 int flim_E, int flim_I, int hev_thresh)\
367 for (i = 0; i < size; i++)\
368 if (vp ## vpn ## _normal_limit(dst+i*stridea, strideb, flim_E, flim_I)) {\
369 int hv = hev(dst+i*stridea, strideb, hev_thresh);\
371 filter_common(dst+i*stridea, strideb, 1, vpn);\
373 filter_common(dst+i*stridea, strideb, 0, vpn);\
377 LOOP_FILTER(7, v, 16, 1, stride,)
378 LOOP_FILTER(7, h, 16, stride, 1,)
380 LOOP_FILTER(8, v, 16, 1, stride,)
381 LOOP_FILTER(8, h, 16, stride, 1,)
383 #define UV_LOOP_FILTER(vpn, dir, stridea, strideb) \
384 LOOP_FILTER(vpn, dir, 8, stridea, strideb, av_always_inline) \
385 static void vp ## vpn ## _ ## dir ## _loop_filter8uv_c(uint8_t *dstU, uint8_t *dstV, ptrdiff_t stride,\
386 int fE, int fI, int hev_thresh)\
388 vp ## vpn ## _ ## dir ## _loop_filter8_c(dstU, stride, fE, fI, hev_thresh);\
389 vp ## vpn ## _ ## dir ## _loop_filter8_c(dstV, stride, fE, fI, hev_thresh);\
391 static void vp ## vpn ## _ ## dir ## _loop_filter8uv_inner_c(uint8_t *dstU, uint8_t *dstV, ptrdiff_t stride,\
392 int fE, int fI, int hev_thresh)\
394 vp ## vpn ## _ ## dir ## _loop_filter8_inner_c(dstU, stride, fE, fI, hev_thresh);\
395 vp ## vpn ## _ ## dir ## _loop_filter8_inner_c(dstV, stride, fE, fI, hev_thresh);\
398 UV_LOOP_FILTER(7, v, 1, stride)
399 UV_LOOP_FILTER(7, h, stride, 1)
401 UV_LOOP_FILTER(8, v, 1, stride)
402 UV_LOOP_FILTER(8, h, stride, 1)
404 #define LOOP_FILTER_SIMPLE(vpn) \
405 static void vp ## vpn ## _v_loop_filter_simple_c(uint8_t *dst, ptrdiff_t stride, int flim)\
409 for (i = 0; i < 16; i++)\
410 if (vp ## vpn ## _simple_limit(dst+i, stride, flim))\
411 filter_common(dst+i, stride, 1, vpn);\
414 static void vp ## vpn ## _h_loop_filter_simple_c(uint8_t *dst, ptrdiff_t stride, int flim)\
418 for (i = 0; i < 16; i++)\
419 if (vp ## vpn ## _simple_limit(dst+i*stride, 1, flim))\
420 filter_common(dst+i*stride, 1, 1, vpn);\
423 LOOP_FILTER_SIMPLE(7)
424 LOOP_FILTER_SIMPLE(8)
426 static const uint8_t subpel_filters[7][6] = {
427 { 0, 6, 123, 12, 1, 0 },
428 { 2, 11, 108, 36, 8, 1 },
429 { 0, 9, 93, 50, 6, 0 },
430 { 3, 16, 77, 77, 16, 3 },
431 { 0, 6, 50, 93, 9, 0 },
432 { 1, 8, 36, 108, 11, 2 },
433 { 0, 1, 12, 123, 6, 0 },
436 #define PUT_PIXELS(WIDTH) \
437 static void put_vp8_pixels ## WIDTH ##_c(uint8_t *dst, ptrdiff_t dststride, uint8_t *src, ptrdiff_t srcstride, int h, int x, int y) { \
439 for (i = 0; i < h; i++, dst+= dststride, src+= srcstride) { \
440 memcpy(dst, src, WIDTH); \
448 #define FILTER_6TAP(src, F, stride) \
449 cm[(F[2]*src[x+0*stride] - F[1]*src[x-1*stride] + F[0]*src[x-2*stride] + \
450 F[3]*src[x+1*stride] - F[4]*src[x+2*stride] + F[5]*src[x+3*stride] + 64) >> 7]
452 #define FILTER_4TAP(src, F, stride) \
453 cm[(F[2]*src[x+0*stride] - F[1]*src[x-1*stride] + \
454 F[3]*src[x+1*stride] - F[4]*src[x+2*stride] + 64) >> 7]
456 #define VP8_EPEL_H(SIZE, TAPS) \
457 static void put_vp8_epel ## SIZE ## _h ## TAPS ## _c(uint8_t *dst, ptrdiff_t dststride, uint8_t *src, ptrdiff_t srcstride, int h, int mx, int my) \
459 const uint8_t *filter = subpel_filters[mx-1]; \
460 const uint8_t *cm = ff_cropTbl + MAX_NEG_CROP; \
463 for (y = 0; y < h; y++) { \
464 for (x = 0; x < SIZE; x++) \
465 dst[x] = FILTER_ ## TAPS ## TAP(src, filter, 1); \
470 #define VP8_EPEL_V(SIZE, TAPS) \
471 static void put_vp8_epel ## SIZE ## _v ## TAPS ## _c(uint8_t *dst, ptrdiff_t dststride, uint8_t *src, ptrdiff_t srcstride, int h, int mx, int my) \
473 const uint8_t *filter = subpel_filters[my-1]; \
474 const uint8_t *cm = ff_cropTbl + MAX_NEG_CROP; \
477 for (y = 0; y < h; y++) { \
478 for (x = 0; x < SIZE; x++) \
479 dst[x] = FILTER_ ## TAPS ## TAP(src, filter, srcstride); \
484 #define VP8_EPEL_HV(SIZE, HTAPS, VTAPS) \
485 static void put_vp8_epel ## SIZE ## _h ## HTAPS ## v ## VTAPS ## _c(uint8_t *dst, ptrdiff_t dststride, uint8_t *src, ptrdiff_t srcstride, int h, int mx, int my) \
487 const uint8_t *filter = subpel_filters[mx-1]; \
488 const uint8_t *cm = ff_cropTbl + MAX_NEG_CROP; \
490 uint8_t tmp_array[(2*SIZE+VTAPS-1)*SIZE]; \
491 uint8_t *tmp = tmp_array; \
492 src -= (2-(VTAPS==4))*srcstride; \
494 for (y = 0; y < h+VTAPS-1; y++) { \
495 for (x = 0; x < SIZE; x++) \
496 tmp[x] = FILTER_ ## HTAPS ## TAP(src, filter, 1); \
501 tmp = tmp_array + (2-(VTAPS==4))*SIZE; \
502 filter = subpel_filters[my-1]; \
504 for (y = 0; y < h; y++) { \
505 for (x = 0; x < SIZE; x++) \
506 dst[x] = FILTER_ ## VTAPS ## TAP(tmp, filter, SIZE); \
524 VP8_EPEL_HV(16, 4, 4)
527 VP8_EPEL_HV(16, 4, 6)
530 VP8_EPEL_HV(16, 6, 4)
533 VP8_EPEL_HV(16, 6, 6)
537 #define VP8_BILINEAR(SIZE) \
538 static void put_vp8_bilinear ## SIZE ## _h_c(uint8_t *dst, ptrdiff_t dstride, uint8_t *src, ptrdiff_t sstride, int h, int mx, int my) \
540 int a = 8-mx, b = mx; \
543 for (y = 0; y < h; y++) { \
544 for (x = 0; x < SIZE; x++) \
545 dst[x] = (a*src[x] + b*src[x+1] + 4) >> 3; \
550 static void put_vp8_bilinear ## SIZE ## _v_c(uint8_t *dst, ptrdiff_t dstride, uint8_t *src, ptrdiff_t sstride, int h, int mx, int my) \
552 int c = 8-my, d = my; \
555 for (y = 0; y < h; y++) { \
556 for (x = 0; x < SIZE; x++) \
557 dst[x] = (c*src[x] + d*src[x+sstride] + 4) >> 3; \
563 static void put_vp8_bilinear ## SIZE ## _hv_c(uint8_t *dst, ptrdiff_t dstride, uint8_t *src, ptrdiff_t sstride, int h, int mx, int my) \
565 int a = 8-mx, b = mx; \
566 int c = 8-my, d = my; \
568 uint8_t tmp_array[(2*SIZE+1)*SIZE]; \
569 uint8_t *tmp = tmp_array; \
571 for (y = 0; y < h+1; y++) { \
572 for (x = 0; x < SIZE; x++) \
573 tmp[x] = (a*src[x] + b*src[x+1] + 4) >> 3; \
580 for (y = 0; y < h; y++) { \
581 for (x = 0; x < SIZE; x++) \
582 dst[x] = (c*tmp[x] + d*tmp[x+SIZE] + 4) >> 3; \
592 #define VP8_MC_FUNC(IDX, SIZE) \
593 dsp->put_vp8_epel_pixels_tab[IDX][0][0] = put_vp8_pixels ## SIZE ## _c; \
594 dsp->put_vp8_epel_pixels_tab[IDX][0][1] = put_vp8_epel ## SIZE ## _h4_c; \
595 dsp->put_vp8_epel_pixels_tab[IDX][0][2] = put_vp8_epel ## SIZE ## _h6_c; \
596 dsp->put_vp8_epel_pixels_tab[IDX][1][0] = put_vp8_epel ## SIZE ## _v4_c; \
597 dsp->put_vp8_epel_pixels_tab[IDX][1][1] = put_vp8_epel ## SIZE ## _h4v4_c; \
598 dsp->put_vp8_epel_pixels_tab[IDX][1][2] = put_vp8_epel ## SIZE ## _h6v4_c; \
599 dsp->put_vp8_epel_pixels_tab[IDX][2][0] = put_vp8_epel ## SIZE ## _v6_c; \
600 dsp->put_vp8_epel_pixels_tab[IDX][2][1] = put_vp8_epel ## SIZE ## _h4v6_c; \
601 dsp->put_vp8_epel_pixels_tab[IDX][2][2] = put_vp8_epel ## SIZE ## _h6v6_c
603 #define VP8_BILINEAR_MC_FUNC(IDX, SIZE) \
604 dsp->put_vp8_bilinear_pixels_tab[IDX][0][0] = put_vp8_pixels ## SIZE ## _c; \
605 dsp->put_vp8_bilinear_pixels_tab[IDX][0][1] = put_vp8_bilinear ## SIZE ## _h_c; \
606 dsp->put_vp8_bilinear_pixels_tab[IDX][0][2] = put_vp8_bilinear ## SIZE ## _h_c; \
607 dsp->put_vp8_bilinear_pixels_tab[IDX][1][0] = put_vp8_bilinear ## SIZE ## _v_c; \
608 dsp->put_vp8_bilinear_pixels_tab[IDX][1][1] = put_vp8_bilinear ## SIZE ## _hv_c; \
609 dsp->put_vp8_bilinear_pixels_tab[IDX][1][2] = put_vp8_bilinear ## SIZE ## _hv_c; \
610 dsp->put_vp8_bilinear_pixels_tab[IDX][2][0] = put_vp8_bilinear ## SIZE ## _v_c; \
611 dsp->put_vp8_bilinear_pixels_tab[IDX][2][1] = put_vp8_bilinear ## SIZE ## _hv_c; \
612 dsp->put_vp8_bilinear_pixels_tab[IDX][2][2] = put_vp8_bilinear ## SIZE ## _hv_c
614 av_cold void ff_vp8dsp_init(VP8DSPContext *dsp, int vp7)
616 #define VPX(f) vp7 ? vp7 ## _ ## f : vp8 ## _ ## f
618 dsp->vp8_luma_dc_wht = VPX(luma_dc_wht_c);
619 dsp->vp8_luma_dc_wht_dc = VPX(luma_dc_wht_dc_c);
620 dsp->vp8_idct_add = VPX(idct_add_c);
621 dsp->vp8_idct_dc_add = VPX(idct_dc_add_c);
622 dsp->vp8_idct_dc_add4y = VPX(idct_dc_add4y_c);
623 dsp->vp8_idct_dc_add4uv = VPX(idct_dc_add4uv_c);
625 dsp->vp8_v_loop_filter16y = VPX(v_loop_filter16_c);
626 dsp->vp8_h_loop_filter16y = VPX(h_loop_filter16_c);
627 dsp->vp8_v_loop_filter8uv = VPX(v_loop_filter8uv_c);
628 dsp->vp8_h_loop_filter8uv = VPX(h_loop_filter8uv_c);
630 dsp->vp8_v_loop_filter16y_inner = VPX(v_loop_filter16_inner_c);
631 dsp->vp8_h_loop_filter16y_inner = VPX(h_loop_filter16_inner_c);
632 dsp->vp8_v_loop_filter8uv_inner = VPX(v_loop_filter8uv_inner_c);
633 dsp->vp8_h_loop_filter8uv_inner = VPX(h_loop_filter8uv_inner_c);
635 dsp->vp8_v_loop_filter_simple = VPX(v_loop_filter_simple_c);
636 dsp->vp8_h_loop_filter_simple = VPX(h_loop_filter_simple_c);
642 VP8_BILINEAR_MC_FUNC(0, 16);
643 VP8_BILINEAR_MC_FUNC(1, 8);
644 VP8_BILINEAR_MC_FUNC(2, 4);
647 ff_vp8dsp_init_arm(dsp, vp7);
649 ff_vp8dsp_init_ppc(dsp);
651 ff_vp8dsp_init_x86(dsp, vp7);