source: trunk/libavcodec/vp3dsp.c@ 256

Last change on this file since 256 was 256, checked in by vladest, 18 years ago

ffmpeg updated
added support for avcodec parser. mpeg audio decoding code level back to mainstream
File size: 7.0 KB
Line 
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 vp3dsp.c
23 * Standard C DSP-oriented functions cribbed from the original VP3
24 * source code.
25 */
26
27#include "common.h"
28#include "avcodec.h"
29#include "dsputil.h"
30
31#define IdctAdjustBeforeShift 8
32#define xC1S7 64277
33#define xC2S6 60547
34#define xC3S5 54491
35#define xC4S4 46341
36#define xC5S3 36410
37#define xC6S2 25080
38#define xC7S1 12785
39
40#define M(a,b) (((a) * (b))>>16)
41
42static always_inline void idct(uint8_t *dst, int stride, int16_t *input, int type)
43{
44 int16_t *ip = input;
45 uint8_t *cm = cropTbl + MAX_NEG_CROP;
46
47 int A, B, C, D, Ad, Bd, Cd, Dd, E, F, G, H;
48 int Ed, Gd, Add, Bdd, Fd, Hd;
49
50 int i;
51
52 /* Inverse DCT on the rows now */
53 for (i = 0; i < 8; i++) {
54 /* Check for non-zero values */
55 if ( ip[0] | ip[1] | ip[2] | ip[3] | ip[4] | ip[5] | ip[6] | ip[7] ) {
56 A = M(xC1S7, ip[1]) + M(xC7S1, ip[7]);
57 B = M(xC7S1, ip[1]) - M(xC1S7, ip[7]);
58 C = M(xC3S5, ip[3]) + M(xC5S3, ip[5]);
59 D = M(xC3S5, ip[5]) - M(xC5S3, ip[3]);
60
61 Ad = M(xC4S4, (A - C));
62 Bd = M(xC4S4, (B - D));
63
64 Cd = A + C;
65 Dd = B + D;
66
67 E = M(xC4S4, (ip[0] + ip[4]));
68 F = M(xC4S4, (ip[0] - ip[4]));
69
70 G = M(xC2S6, ip[2]) + M(xC6S2, ip[6]);
71 H = M(xC6S2, ip[2]) - M(xC2S6, ip[6]);
72
73 Ed = E - G;
74 Gd = E + G;
75
76 Add = F + Ad;
77 Bdd = Bd - H;
78
79 Fd = F - Ad;
80 Hd = Bd + H;
81
82 /* Final sequence of operations over-write original inputs. */
83 ip[0] = Gd + Cd ;
84 ip[7] = Gd - Cd ;
85
86 ip[1] = Add + Hd;
87 ip[2] = Add - Hd;
88
89 ip[3] = Ed + Dd ;
90 ip[4] = Ed - Dd ;
91
92 ip[5] = Fd + Bdd;
93 ip[6] = Fd - Bdd;
94 }
95
96 ip += 8; /* next row */
97 }
98
99 ip = input;
100
101 for ( i = 0; i < 8; i++) {
102 /* Check for non-zero values (bitwise or faster than ||) */
103 if ( ip[1 * 8] | ip[2 * 8] | ip[3 * 8] |
104 ip[4 * 8] | ip[5 * 8] | ip[6 * 8] | ip[7 * 8] ) {
105
106 A = M(xC1S7, ip[1*8]) + M(xC7S1, ip[7*8]);
107 B = M(xC7S1, ip[1*8]) - M(xC1S7, ip[7*8]);
108 C = M(xC3S5, ip[3*8]) + M(xC5S3, ip[5*8]);
109 D = M(xC3S5, ip[5*8]) - M(xC5S3, ip[3*8]);
110
111 Ad = M(xC4S4, (A - C));
112 Bd = M(xC4S4, (B - D));
113
114 Cd = A + C;
115 Dd = B + D;
116
117 E = M(xC4S4, (ip[0*8] + ip[4*8])) + 8;
118 F = M(xC4S4, (ip[0*8] - ip[4*8])) + 8;
119
120 if(type==1){ //HACK
121 E += 16*128;
122 F += 16*128;
123 }
124
125 G = M(xC2S6, ip[2*8]) + M(xC6S2, ip[6*8]);
126 H = M(xC6S2, ip[2*8]) - M(xC2S6, ip[6*8]);
127
128 Ed = E - G;
129 Gd = E + G;
130
131 Add = F + Ad;
132 Bdd = Bd - H;
133
134 Fd = F - Ad;
135 Hd = Bd + H;
136
137 /* Final sequence of operations over-write original inputs. */
138 if(type==0){
139 ip[0*8] = (Gd + Cd ) >> 4;
140 ip[7*8] = (Gd - Cd ) >> 4;
141
142 ip[1*8] = (Add + Hd ) >> 4;
143 ip[2*8] = (Add - Hd ) >> 4;
144
145 ip[3*8] = (Ed + Dd ) >> 4;
146 ip[4*8] = (Ed - Dd ) >> 4;
147
148 ip[5*8] = (Fd + Bdd ) >> 4;
149 ip[6*8] = (Fd - Bdd ) >> 4;
150 }else if(type==1){
151 dst[0*stride] = cm[(Gd + Cd ) >> 4];
152 dst[7*stride] = cm[(Gd - Cd ) >> 4];
153
154 dst[1*stride] = cm[(Add + Hd ) >> 4];
155 dst[2*stride] = cm[(Add - Hd ) >> 4];
156
157 dst[3*stride] = cm[(Ed + Dd ) >> 4];
158 dst[4*stride] = cm[(Ed - Dd ) >> 4];
159
160 dst[5*stride] = cm[(Fd + Bdd ) >> 4];
161 dst[6*stride] = cm[(Fd - Bdd ) >> 4];
162 }else{
163 dst[0*stride] = cm[dst[0*stride] + ((Gd + Cd ) >> 4)];
164 dst[7*stride] = cm[dst[7*stride] + ((Gd - Cd ) >> 4)];
165
166 dst[1*stride] = cm[dst[1*stride] + ((Add + Hd ) >> 4)];
167 dst[2*stride] = cm[dst[2*stride] + ((Add - Hd ) >> 4)];
168
169 dst[3*stride] = cm[dst[3*stride] + ((Ed + Dd ) >> 4)];
170 dst[4*stride] = cm[dst[4*stride] + ((Ed - Dd ) >> 4)];
171
172 dst[5*stride] = cm[dst[5*stride] + ((Fd + Bdd ) >> 4)];
173 dst[6*stride] = cm[dst[6*stride] + ((Fd - Bdd ) >> 4)];
174 }
175
176 } else {
177 if(type==0){
178 ip[0*8] =
179 ip[1*8] =
180 ip[2*8] =
181 ip[3*8] =
182 ip[4*8] =
183 ip[5*8] =
184 ip[6*8] =
185 ip[7*8] = ((xC4S4 * ip[0*8] + (IdctAdjustBeforeShift<<16))>>20);
186 }else if(type==1){
187 dst[0*stride]=
188 dst[1*stride]=
189 dst[2*stride]=
190 dst[3*stride]=
191 dst[4*stride]=
192 dst[5*stride]=
193 dst[6*stride]=
194 dst[7*stride]= 128 + ((xC4S4 * ip[0*8] + (IdctAdjustBeforeShift<<16))>>20);
195 }else{
196 if(ip[0*8]){
197 int v= ((xC4S4 * ip[0*8] + (IdctAdjustBeforeShift<<16))>>20);
198 dst[0*stride] = cm[dst[0*stride] + v];
199 dst[1*stride] = cm[dst[1*stride] + v];
200 dst[2*stride] = cm[dst[2*stride] + v];
201 dst[3*stride] = cm[dst[3*stride] + v];
202 dst[4*stride] = cm[dst[4*stride] + v];
203 dst[5*stride] = cm[dst[5*stride] + v];
204 dst[6*stride] = cm[dst[6*stride] + v];
205 dst[7*stride] = cm[dst[7*stride] + v];
206 }
207 }
208 }
209
210 ip++; /* next column */
211 dst++;
212 }
213}
214
215void ff_vp3_idct_c(DCTELEM *block/* align 16*/){
216 idct(NULL, 0, block, 0);
217}
218
219void ff_vp3_idct_put_c(uint8_t *dest/*align 8*/, int line_size, DCTELEM *block/*align 16*/){
220 idct(dest, line_size, block, 1);
221}
222
223void ff_vp3_idct_add_c(uint8_t *dest/*align 8*/, int line_size, DCTELEM *block/*align 16*/){
224 idct(dest, line_size, block, 2);
225}
Note: See TracBrowser for help on using the repository browser.