Libav
h264chroma_template.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2000, 2001 Fabrice Bellard
3  * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
4  *
5  * This file is part of Libav.
6  *
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.
11  *
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.
16  *
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
20  */
21 
22 #include <assert.h>
23 
24 #include "bit_depth_template.c"
25 
26 #define H264_CHROMA_MC(OPNAME, OP)\
27 static void FUNCC(OPNAME ## h264_chroma_mc2)(uint8_t *_dst/*align 8*/, uint8_t *_src/*align 1*/, int stride, int h, int x, int y){\
28  pixel *dst = (pixel*)_dst;\
29  pixel *src = (pixel*)_src;\
30  const int A=(8-x)*(8-y);\
31  const int B=( x)*(8-y);\
32  const int C=(8-x)*( y);\
33  const int D=( x)*( y);\
34  int i;\
35  stride /= sizeof(pixel);\
36  \
37  assert(x<8 && y<8 && x>=0 && y>=0);\
38 \
39  if(D){\
40  for(i=0; i<h; i++){\
41  OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\
42  OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\
43  dst+= stride;\
44  src+= stride;\
45  }\
46  } else if (B + C) {\
47  const int E= B+C;\
48  const int step= C ? stride : 1;\
49  for(i=0; i<h; i++){\
50  OP(dst[0], (A*src[0] + E*src[step+0]));\
51  OP(dst[1], (A*src[1] + E*src[step+1]));\
52  dst+= stride;\
53  src+= stride;\
54  }\
55  } else {\
56  for ( i = 0; i < h; i++){\
57  OP(dst[0], A * src[0]);\
58  OP(dst[1], A * src[1]);\
59  dst += stride;\
60  src += stride;\
61  }\
62  }\
63 }\
64 \
65 static void FUNCC(OPNAME ## h264_chroma_mc4)(uint8_t *_dst/*align 8*/, uint8_t *_src/*align 1*/, int stride, int h, int x, int y){\
66  pixel *dst = (pixel*)_dst;\
67  pixel *src = (pixel*)_src;\
68  const int A=(8-x)*(8-y);\
69  const int B=( x)*(8-y);\
70  const int C=(8-x)*( y);\
71  const int D=( x)*( y);\
72  int i;\
73  stride /= sizeof(pixel);\
74  \
75  assert(x<8 && y<8 && x>=0 && y>=0);\
76 \
77  if(D){\
78  for(i=0; i<h; i++){\
79  OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\
80  OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\
81  OP(dst[2], (A*src[2] + B*src[3] + C*src[stride+2] + D*src[stride+3]));\
82  OP(dst[3], (A*src[3] + B*src[4] + C*src[stride+3] + D*src[stride+4]));\
83  dst+= stride;\
84  src+= stride;\
85  }\
86  } else if (B + C) {\
87  const int E= B+C;\
88  const int step= C ? stride : 1;\
89  for(i=0; i<h; i++){\
90  OP(dst[0], (A*src[0] + E*src[step+0]));\
91  OP(dst[1], (A*src[1] + E*src[step+1]));\
92  OP(dst[2], (A*src[2] + E*src[step+2]));\
93  OP(dst[3], (A*src[3] + E*src[step+3]));\
94  dst+= stride;\
95  src+= stride;\
96  }\
97  } else {\
98  for ( i = 0; i < h; i++){\
99  OP(dst[0], A * src[0]);\
100  OP(dst[1], A * src[1]);\
101  OP(dst[2], A * src[2]);\
102  OP(dst[3], A * src[3]);\
103  dst += stride;\
104  src += stride;\
105  }\
106  }\
107 }\
108 \
109 static void FUNCC(OPNAME ## h264_chroma_mc8)(uint8_t *_dst/*align 8*/, uint8_t *_src/*align 1*/, int stride, int h, int x, int y){\
110  pixel *dst = (pixel*)_dst;\
111  pixel *src = (pixel*)_src;\
112  const int A=(8-x)*(8-y);\
113  const int B=( x)*(8-y);\
114  const int C=(8-x)*( y);\
115  const int D=( x)*( y);\
116  int i;\
117  stride /= sizeof(pixel);\
118  \
119  assert(x<8 && y<8 && x>=0 && y>=0);\
120 \
121  if(D){\
122  for(i=0; i<h; i++){\
123  OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\
124  OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\
125  OP(dst[2], (A*src[2] + B*src[3] + C*src[stride+2] + D*src[stride+3]));\
126  OP(dst[3], (A*src[3] + B*src[4] + C*src[stride+3] + D*src[stride+4]));\
127  OP(dst[4], (A*src[4] + B*src[5] + C*src[stride+4] + D*src[stride+5]));\
128  OP(dst[5], (A*src[5] + B*src[6] + C*src[stride+5] + D*src[stride+6]));\
129  OP(dst[6], (A*src[6] + B*src[7] + C*src[stride+6] + D*src[stride+7]));\
130  OP(dst[7], (A*src[7] + B*src[8] + C*src[stride+7] + D*src[stride+8]));\
131  dst+= stride;\
132  src+= stride;\
133  }\
134  } else if (B + C) {\
135  const int E= B+C;\
136  const int step= C ? stride : 1;\
137  for(i=0; i<h; i++){\
138  OP(dst[0], (A*src[0] + E*src[step+0]));\
139  OP(dst[1], (A*src[1] + E*src[step+1]));\
140  OP(dst[2], (A*src[2] + E*src[step+2]));\
141  OP(dst[3], (A*src[3] + E*src[step+3]));\
142  OP(dst[4], (A*src[4] + E*src[step+4]));\
143  OP(dst[5], (A*src[5] + E*src[step+5]));\
144  OP(dst[6], (A*src[6] + E*src[step+6]));\
145  OP(dst[7], (A*src[7] + E*src[step+7]));\
146  dst+= stride;\
147  src+= stride;\
148  }\
149  } else {\
150  for ( i = 0; i < h; i++){\
151  OP(dst[0], A * src[0]);\
152  OP(dst[1], A * src[1]);\
153  OP(dst[2], A * src[2]);\
154  OP(dst[3], A * src[3]);\
155  OP(dst[4], A * src[4]);\
156  OP(dst[5], A * src[5]);\
157  OP(dst[6], A * src[6]);\
158  OP(dst[7], A * src[7]);\
159  dst += stride;\
160  src += stride;\
161  }\
162  }\
163 }
164 
165 #define op_avg(a, b) a = (((a)+(((b) + 32)>>6)+1)>>1)
166 #define op_put(a, b) a = (((b) + 32)>>6)
167 
168 H264_CHROMA_MC(put_ , op_put)
169 H264_CHROMA_MC(avg_ , op_avg)
170 #undef op_avg
171 #undef op_put