1 /*
2 * Copyright (C) 2004 the ffmpeg project
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 * Standard C DSP-oriented functions cribbed from the original VP3
24 * source code.
25 */
26
33
34 #define IdctAdjustBeforeShift 8
42
43 #define M(a,b) (((a) * (b))>>16)
44
46 {
47 int16_t *ip = input;
48
49 int A,
B,
C,
D, Ad, Bd, Cd, Dd,
E,
F,
G,
H;
50 int Ed, Gd, Add, Bdd, Fd, Hd;
51
52 int i;
53
54 /* Inverse DCT on the rows now */
55 for (i = 0; i < 8; i++) {
56 /* Check for non-zero values */
57 if ( ip[0 * 8] | ip[1 * 8] | ip[2 * 8] | ip[3 * 8] |
58 ip[4 * 8] | ip[5 * 8] | ip[6 * 8] | ip[7 * 8] ) {
63
66
67 Cd = A + C;
69
70 E =
M(
xC4S4, (ip[0 * 8] + ip[4 * 8]));
71 F =
M(
xC4S4, (ip[0 * 8] - ip[4 * 8]));
72
75
78
79 Add = F + Ad;
81
82 Fd = F - Ad;
84
85 /* Final sequence of operations over-write original inputs. */
86 ip[0 * 8] = Gd + Cd ;
87 ip[7 * 8] = Gd - Cd ;
88
89 ip[1 * 8] = Add + Hd;
90 ip[2 * 8] = Add - Hd;
91
92 ip[3 * 8] = Ed + Dd ;
93 ip[4 * 8] = Ed - Dd ;
94
95 ip[5 * 8] = Fd + Bdd;
96 ip[6 * 8] = Fd - Bdd;
97 }
98
99 ip += 1; /* next row */
100 }
101
102 ip = input;
103
104 for ( i = 0; i < 8; i++) {
105 /* Check for non-zero values (bitwise or faster than ||) */
106 if ( ip[1] | ip[2] | ip[3] |
107 ip[4] | ip[5] | ip[6] | ip[7] ) {
108
113
116
117 Cd = A + C;
119
120 E =
M(
xC4S4, (ip[0] + ip[4])) + 8;
121 F =
M(
xC4S4, (ip[0] - ip[4])) + 8;
122
123 if(type==1){ //HACK
124 E += 16*128;
125 F += 16*128;
126 }
127
130
133
134 Add = F + Ad;
136
137 Fd = F - Ad;
139
140 /* Final sequence of operations over-write original inputs. */
141 if (type == 1) {
142 dst[0*
stride] = av_clip_uint8((Gd + Cd ) >> 4);
143 dst[7*
stride] = av_clip_uint8((Gd - Cd ) >> 4);
144
145 dst[1*
stride] = av_clip_uint8((Add + Hd ) >> 4);
146 dst[2*
stride] = av_clip_uint8((Add - Hd ) >> 4);
147
148 dst[3*
stride] = av_clip_uint8((Ed + Dd ) >> 4);
149 dst[4*
stride] = av_clip_uint8((Ed - Dd ) >> 4);
150
151 dst[5*
stride] = av_clip_uint8((Fd + Bdd ) >> 4);
152 dst[6*
stride] = av_clip_uint8((Fd - Bdd ) >> 4);
153 }else{
154 dst[0*
stride] = av_clip_uint8(dst[0*stride] + ((Gd + Cd ) >> 4));
155 dst[7*
stride] = av_clip_uint8(dst[7*stride] + ((Gd - Cd ) >> 4));
156
157 dst[1*
stride] = av_clip_uint8(dst[1*stride] + ((Add + Hd ) >> 4));
158 dst[2*
stride] = av_clip_uint8(dst[2*stride] + ((Add - Hd ) >> 4));
159
160 dst[3*
stride] = av_clip_uint8(dst[3*stride] + ((Ed + Dd ) >> 4));
161 dst[4*
stride] = av_clip_uint8(dst[4*stride] + ((Ed - Dd ) >> 4));
162
163 dst[5*
stride] = av_clip_uint8(dst[5*stride] + ((Fd + Bdd ) >> 4));
164 dst[6*
stride] = av_clip_uint8(dst[6*stride] + ((Fd - Bdd ) >> 4));
165 }
166
167 } else {
168 if (type == 1) {
177 }else{
178 if(ip[0]){
179 int v= ((
xC4S4 * ip[0] + (IdctAdjustBeforeShift<<16))>>20);
180 dst[0*
stride] = av_clip_uint8(dst[0*stride] + v);
181 dst[1*
stride] = av_clip_uint8(dst[1*stride] + v);
182 dst[2*
stride] = av_clip_uint8(dst[2*stride] + v);
183 dst[3*
stride] = av_clip_uint8(dst[3*stride] + v);
184 dst[4*
stride] = av_clip_uint8(dst[4*stride] + v);
185 dst[5*
stride] = av_clip_uint8(dst[5*stride] + v);
186 dst[6*
stride] = av_clip_uint8(dst[6*stride] + v);
187 dst[7*
stride] = av_clip_uint8(dst[7*stride] + v);
188 }
189 }
190 }
191
192 ip += 8; /* next column */
193 dst++;
194 }
195 }
196
198 int16_t *
block /*align 16*/)
199 {
200 idct(dest, line_size, block, 1);
201 memset(block, 0, sizeof(*block) * 64);
202 }
203
205 int16_t *
block /*align 16*/)
206 {
207 idct(dest, line_size, block, 2);
208 memset(block, 0, sizeof(*block) * 64);
209 }
210
212 int16_t *
block /*align 16*/)
213 {
214 int i,
dc = (block[0] + 15) >> 5;
215
216 for(i = 0; i < 8; i++){
217 dest[0] = av_clip_uint8(dest[0] + dc);
218 dest[1] = av_clip_uint8(dest[1] + dc);
219 dest[2] = av_clip_uint8(dest[2] + dc);
220 dest[3] = av_clip_uint8(dest[3] + dc);
221 dest[4] = av_clip_uint8(dest[4] + dc);
222 dest[5] = av_clip_uint8(dest[5] + dc);
223 dest[6] = av_clip_uint8(dest[6] + dc);
224 dest[7] = av_clip_uint8(dest[7] + dc);
225 dest += line_size;
226 }
227 block[0] = 0;
228 }
229
231 int *bounding_values)
232 {
235 const int nstride= -
stride;
236
237 for (end= first_pixel + 8; first_pixel <
end; first_pixel++) {
238 filter_value =
239 (first_pixel[2 * nstride] - first_pixel[
stride])
240 +3*(first_pixel[0 ] - first_pixel[nstride]);
241 filter_value = bounding_values[(filter_value + 4) >> 3];
242 first_pixel[nstride] = av_clip_uint8(first_pixel[nstride] + filter_value);
243 first_pixel[0] = av_clip_uint8(first_pixel[0] - filter_value);
244 }
245 }
246
248 int *bounding_values)
249 {
252
253 for (end= first_pixel + 8*stride; first_pixel !=
end; first_pixel +=
stride) {
254 filter_value =
255 (first_pixel[-2] - first_pixel[ 1])
256 +3*(first_pixel[ 0] - first_pixel[-1]);
257 filter_value = bounding_values[(filter_value + 4) >> 3];
258 first_pixel[-1] = av_clip_uint8(first_pixel[-1] + filter_value);
259 first_pixel[ 0] = av_clip_uint8(first_pixel[ 0] - filter_value);
260 }
261 }
262
265 {
266 int i;
267
268 for (i = 0; i < h; i++) {
270
271 a =
AV_RN32(&src1[i * stride]);
272 b =
AV_RN32(&src2[i * stride]);
274 a =
AV_RN32(&src1[i * stride + 4]);
275 b =
AV_RN32(&src2[i * stride + 4]);
277 }
278 }
279
281 {
283
289
290 if (ARCH_ARM)
292 if (ARCH_BFIN)
294 if (ARCH_PPC)
296 if (ARCH_X86)
298 }