yading@10
|
1 /*
|
yading@10
|
2 * Bink DSP routines
|
yading@10
|
3 * Copyright (c) 2009 Kostya Shishkov
|
yading@10
|
4 *
|
yading@10
|
5 * This file is part of FFmpeg.
|
yading@10
|
6 *
|
yading@10
|
7 * FFmpeg is free software; you can redistribute it and/or
|
yading@10
|
8 * modify it under the terms of the GNU Lesser General Public
|
yading@10
|
9 * License as published by the Free Software Foundation; either
|
yading@10
|
10 * version 2.1 of the License, or (at your option) any later version.
|
yading@10
|
11 *
|
yading@10
|
12 * FFmpeg is distributed in the hope that it will be useful,
|
yading@10
|
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
yading@10
|
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
yading@10
|
15 * Lesser General Public License for more details.
|
yading@10
|
16 *
|
yading@10
|
17 * You should have received a copy of the GNU Lesser General Public
|
yading@10
|
18 * License along with FFmpeg; if not, write to the Free Software
|
yading@10
|
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
yading@10
|
20 */
|
yading@10
|
21
|
yading@10
|
22 /**
|
yading@10
|
23 * @file
|
yading@10
|
24 * Bink DSP routines
|
yading@10
|
25 */
|
yading@10
|
26
|
yading@10
|
27 #include "dsputil.h"
|
yading@10
|
28 #include "binkdsp.h"
|
yading@10
|
29
|
yading@10
|
30 #define A1 2896 /* (1/sqrt(2))<<12 */
|
yading@10
|
31 #define A2 2217
|
yading@10
|
32 #define A3 3784
|
yading@10
|
33 #define A4 -5352
|
yading@10
|
34
|
yading@10
|
35 #define IDCT_TRANSFORM(dest,s0,s1,s2,s3,s4,s5,s6,s7,d0,d1,d2,d3,d4,d5,d6,d7,munge,src) {\
|
yading@10
|
36 const int a0 = (src)[s0] + (src)[s4]; \
|
yading@10
|
37 const int a1 = (src)[s0] - (src)[s4]; \
|
yading@10
|
38 const int a2 = (src)[s2] + (src)[s6]; \
|
yading@10
|
39 const int a3 = (A1*((src)[s2] - (src)[s6])) >> 11; \
|
yading@10
|
40 const int a4 = (src)[s5] + (src)[s3]; \
|
yading@10
|
41 const int a5 = (src)[s5] - (src)[s3]; \
|
yading@10
|
42 const int a6 = (src)[s1] + (src)[s7]; \
|
yading@10
|
43 const int a7 = (src)[s1] - (src)[s7]; \
|
yading@10
|
44 const int b0 = a4 + a6; \
|
yading@10
|
45 const int b1 = (A3*(a5 + a7)) >> 11; \
|
yading@10
|
46 const int b2 = ((A4*a5) >> 11) - b0 + b1; \
|
yading@10
|
47 const int b3 = (A1*(a6 - a4) >> 11) - b2; \
|
yading@10
|
48 const int b4 = ((A2*a7) >> 11) + b3 - b1; \
|
yading@10
|
49 (dest)[d0] = munge(a0+a2 +b0); \
|
yading@10
|
50 (dest)[d1] = munge(a1+a3-a2+b2); \
|
yading@10
|
51 (dest)[d2] = munge(a1-a3+a2+b3); \
|
yading@10
|
52 (dest)[d3] = munge(a0-a2 -b4); \
|
yading@10
|
53 (dest)[d4] = munge(a0-a2 +b4); \
|
yading@10
|
54 (dest)[d5] = munge(a1-a3+a2-b3); \
|
yading@10
|
55 (dest)[d6] = munge(a1+a3-a2-b2); \
|
yading@10
|
56 (dest)[d7] = munge(a0+a2 -b0); \
|
yading@10
|
57 }
|
yading@10
|
58 /* end IDCT_TRANSFORM macro */
|
yading@10
|
59
|
yading@10
|
60 #define MUNGE_NONE(x) (x)
|
yading@10
|
61 #define IDCT_COL(dest,src) IDCT_TRANSFORM(dest,0,8,16,24,32,40,48,56,0,8,16,24,32,40,48,56,MUNGE_NONE,src)
|
yading@10
|
62
|
yading@10
|
63 #define MUNGE_ROW(x) (((x) + 0x7F)>>8)
|
yading@10
|
64 #define IDCT_ROW(dest,src) IDCT_TRANSFORM(dest,0,1,2,3,4,5,6,7,0,1,2,3,4,5,6,7,MUNGE_ROW,src)
|
yading@10
|
65
|
yading@10
|
66 static inline void bink_idct_col(int *dest, const int32_t *src)
|
yading@10
|
67 {
|
yading@10
|
68 if ((src[8]|src[16]|src[24]|src[32]|src[40]|src[48]|src[56])==0) {
|
yading@10
|
69 dest[0] =
|
yading@10
|
70 dest[8] =
|
yading@10
|
71 dest[16] =
|
yading@10
|
72 dest[24] =
|
yading@10
|
73 dest[32] =
|
yading@10
|
74 dest[40] =
|
yading@10
|
75 dest[48] =
|
yading@10
|
76 dest[56] = src[0];
|
yading@10
|
77 } else {
|
yading@10
|
78 IDCT_COL(dest, src);
|
yading@10
|
79 }
|
yading@10
|
80 }
|
yading@10
|
81
|
yading@10
|
82 static void bink_idct_c(int32_t *block)
|
yading@10
|
83 {
|
yading@10
|
84 int i;
|
yading@10
|
85 int temp[64];
|
yading@10
|
86
|
yading@10
|
87 for (i = 0; i < 8; i++)
|
yading@10
|
88 bink_idct_col(&temp[i], &block[i]);
|
yading@10
|
89 for (i = 0; i < 8; i++) {
|
yading@10
|
90 IDCT_ROW( (&block[8*i]), (&temp[8*i]) );
|
yading@10
|
91 }
|
yading@10
|
92 }
|
yading@10
|
93
|
yading@10
|
94 static void bink_idct_add_c(uint8_t *dest, int linesize, int32_t *block)
|
yading@10
|
95 {
|
yading@10
|
96 int i, j;
|
yading@10
|
97
|
yading@10
|
98 bink_idct_c(block);
|
yading@10
|
99 for (i = 0; i < 8; i++, dest += linesize, block += 8)
|
yading@10
|
100 for (j = 0; j < 8; j++)
|
yading@10
|
101 dest[j] += block[j];
|
yading@10
|
102 }
|
yading@10
|
103
|
yading@10
|
104 static void bink_idct_put_c(uint8_t *dest, int linesize, int32_t *block)
|
yading@10
|
105 {
|
yading@10
|
106 int i;
|
yading@10
|
107 int temp[64];
|
yading@10
|
108 for (i = 0; i < 8; i++)
|
yading@10
|
109 bink_idct_col(&temp[i], &block[i]);
|
yading@10
|
110 for (i = 0; i < 8; i++) {
|
yading@10
|
111 IDCT_ROW( (&dest[i*linesize]), (&temp[8*i]) );
|
yading@10
|
112 }
|
yading@10
|
113 }
|
yading@10
|
114
|
yading@10
|
115 static void scale_block_c(const uint8_t src[64]/*align 8*/, uint8_t *dst/*align 8*/, int linesize)
|
yading@10
|
116 {
|
yading@10
|
117 int i, j;
|
yading@10
|
118 uint16_t *dst1 = (uint16_t *) dst;
|
yading@10
|
119 uint16_t *dst2 = (uint16_t *)(dst + linesize);
|
yading@10
|
120
|
yading@10
|
121 for (j = 0; j < 8; j++) {
|
yading@10
|
122 for (i = 0; i < 8; i++) {
|
yading@10
|
123 dst1[i] = dst2[i] = src[i] * 0x0101;
|
yading@10
|
124 }
|
yading@10
|
125 src += 8;
|
yading@10
|
126 dst1 += linesize;
|
yading@10
|
127 dst2 += linesize;
|
yading@10
|
128 }
|
yading@10
|
129 }
|
yading@10
|
130
|
yading@10
|
131 void ff_binkdsp_init(BinkDSPContext *c)
|
yading@10
|
132 {
|
yading@10
|
133 c->idct_add = bink_idct_add_c;
|
yading@10
|
134 c->idct_put = bink_idct_put_c;
|
yading@10
|
135 c->scale_block = scale_block_c;
|
yading@10
|
136 }
|