Mercurial > libavcodec.hg
comparison dsputil.c @ 4179:46d38e3d7038 libavcodec
rename squareTbl -> ff_squareTbl
author | mru |
---|---|
date | Sun, 12 Nov 2006 21:48:04 +0000 |
parents | 23da44e8fd05 |
children | fbac0859753d |
comparison
equal
deleted
inserted
replaced
4178:f623a9939995 | 4179:46d38e3d7038 |
---|---|
39 | 39 |
40 /* vorbis.c */ | 40 /* vorbis.c */ |
41 void vorbis_inverse_coupling(float *mag, float *ang, int blocksize); | 41 void vorbis_inverse_coupling(float *mag, float *ang, int blocksize); |
42 | 42 |
43 uint8_t ff_cropTbl[256 + 2 * MAX_NEG_CROP] = {0, }; | 43 uint8_t ff_cropTbl[256 + 2 * MAX_NEG_CROP] = {0, }; |
44 uint32_t squareTbl[512] = {0, }; | 44 uint32_t ff_squareTbl[512] = {0, }; |
45 | 45 |
46 const uint8_t ff_zigzag_direct[64] = { | 46 const uint8_t ff_zigzag_direct[64] = { |
47 0, 1, 8, 16, 9, 2, 3, 10, | 47 0, 1, 8, 16, 9, 2, 3, 10, |
48 17, 24, 32, 25, 18, 11, 4, 5, | 48 17, 24, 32, 25, 18, 11, 4, 5, |
49 12, 19, 26, 33, 40, 48, 41, 34, | 49 12, 19, 26, 33, 40, 48, 41, 34, |
163 } | 163 } |
164 | 164 |
165 static int pix_norm1_c(uint8_t * pix, int line_size) | 165 static int pix_norm1_c(uint8_t * pix, int line_size) |
166 { | 166 { |
167 int s, i, j; | 167 int s, i, j; |
168 uint32_t *sq = squareTbl + 256; | 168 uint32_t *sq = ff_squareTbl + 256; |
169 | 169 |
170 s = 0; | 170 s = 0; |
171 for (i = 0; i < 16; i++) { | 171 for (i = 0; i < 16; i++) { |
172 for (j = 0; j < 16; j += 8) { | 172 for (j = 0; j < 16; j += 8) { |
173 #if 0 | 173 #if 0 |
229 } | 229 } |
230 | 230 |
231 static int sse4_c(void *v, uint8_t * pix1, uint8_t * pix2, int line_size, int h) | 231 static int sse4_c(void *v, uint8_t * pix1, uint8_t * pix2, int line_size, int h) |
232 { | 232 { |
233 int s, i; | 233 int s, i; |
234 uint32_t *sq = squareTbl + 256; | 234 uint32_t *sq = ff_squareTbl + 256; |
235 | 235 |
236 s = 0; | 236 s = 0; |
237 for (i = 0; i < h; i++) { | 237 for (i = 0; i < h; i++) { |
238 s += sq[pix1[0] - pix2[0]]; | 238 s += sq[pix1[0] - pix2[0]]; |
239 s += sq[pix1[1] - pix2[1]]; | 239 s += sq[pix1[1] - pix2[1]]; |
246 } | 246 } |
247 | 247 |
248 static int sse8_c(void *v, uint8_t * pix1, uint8_t * pix2, int line_size, int h) | 248 static int sse8_c(void *v, uint8_t * pix1, uint8_t * pix2, int line_size, int h) |
249 { | 249 { |
250 int s, i; | 250 int s, i; |
251 uint32_t *sq = squareTbl + 256; | 251 uint32_t *sq = ff_squareTbl + 256; |
252 | 252 |
253 s = 0; | 253 s = 0; |
254 for (i = 0; i < h; i++) { | 254 for (i = 0; i < h; i++) { |
255 s += sq[pix1[0] - pix2[0]]; | 255 s += sq[pix1[0] - pix2[0]]; |
256 s += sq[pix1[1] - pix2[1]]; | 256 s += sq[pix1[1] - pix2[1]]; |
267 } | 267 } |
268 | 268 |
269 static int sse16_c(void *v, uint8_t *pix1, uint8_t *pix2, int line_size, int h) | 269 static int sse16_c(void *v, uint8_t *pix1, uint8_t *pix2, int line_size, int h) |
270 { | 270 { |
271 int s, i; | 271 int s, i; |
272 uint32_t *sq = squareTbl + 256; | 272 uint32_t *sq = ff_squareTbl + 256; |
273 | 273 |
274 s = 0; | 274 s = 0; |
275 for (i = 0; i < h; i++) { | 275 for (i = 0; i < h; i++) { |
276 s += sq[pix1[ 0] - pix2[ 0]]; | 276 s += sq[pix1[ 0] - pix2[ 0]]; |
277 s += sq[pix1[ 1] - pix2[ 1]]; | 277 s += sq[pix1[ 1] - pix2[ 1]]; |
3870 ff_cropTbl[i] = 0; | 3870 ff_cropTbl[i] = 0; |
3871 ff_cropTbl[i + MAX_NEG_CROP + 256] = 255; | 3871 ff_cropTbl[i + MAX_NEG_CROP + 256] = 255; |
3872 } | 3872 } |
3873 | 3873 |
3874 for(i=0;i<512;i++) { | 3874 for(i=0;i<512;i++) { |
3875 squareTbl[i] = (i - 256) * (i - 256); | 3875 ff_squareTbl[i] = (i - 256) * (i - 256); |
3876 } | 3876 } |
3877 | 3877 |
3878 for(i=0; i<64; i++) inv_zigzag_direct16[ff_zigzag_direct[i]]= i+1; | 3878 for(i=0; i<64; i++) inv_zigzag_direct16[ff_zigzag_direct[i]]= i+1; |
3879 } | 3879 } |
3880 | 3880 |