3 * Copyright (c) 2009 Kostya Shishkov
5 * This file is part of Libav.
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.
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.
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
30 #define A1 2896 /* (1/sqrt(2))<<12 */
35 #define IDCT_TRANSFORM(dest,s0,s1,s2,s3,s4,s5,s6,s7,d0,d1,d2,d3,d4,d5,d6,d7,munge,src) {\
36 const int a0 = (src)[s0] + (src)[s4]; \
37 const int a1 = (src)[s0] - (src)[s4]; \
38 const int a2 = (src)[s2] + (src)[s6]; \
39 const int a3 = (A1*((src)[s2] - (src)[s6])) >> 11; \
40 const int a4 = (src)[s5] + (src)[s3]; \
41 const int a5 = (src)[s5] - (src)[s3]; \
42 const int a6 = (src)[s1] + (src)[s7]; \
43 const int a7 = (src)[s1] - (src)[s7]; \
44 const int b0 = a4 + a6; \
45 const int b1 = (A3*(a5 + a7)) >> 11; \
46 const int b2 = ((A4*a5) >> 11) - b0 + b1; \
47 const int b3 = (A1*(a6 - a4) >> 11) - b2; \
48 const int b4 = ((A2*a7) >> 11) + b3 - b1; \
49 (dest)[d0] = munge(a0+a2 +b0); \
50 (dest)[d1] = munge(a1+a3-a2+b2); \
51 (dest)[d2] = munge(a1-a3+a2+b3); \
52 (dest)[d3] = munge(a0-a2 -b4); \
53 (dest)[d4] = munge(a0-a2 +b4); \
54 (dest)[d5] = munge(a1-a3+a2-b3); \
55 (dest)[d6] = munge(a1+a3-a2-b2); \
56 (dest)[d7] = munge(a0+a2 -b0); \
58 /* end IDCT_TRANSFORM macro */
60 #define MUNGE_NONE(x) (x)
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)
63 #define MUNGE_ROW(x) (((x) + 0x7F)>>8)
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)
66 static inline void bink_idct_col(int *dest
, const int32_t *src
)
68 if ((src
[8]|src
[16]|src
[24]|src
[32]|src
[40]|src
[48]|src
[56])==0) {
82 static void bink_idct_c(int32_t *block
)
87 for (i
= 0; i
< 8; i
++)
88 bink_idct_col(&temp
[i
], &block
[i
]);
89 for (i
= 0; i
< 8; i
++) {
90 IDCT_ROW( (&block
[8*i
]), (&temp
[8*i
]) );
94 static void bink_idct_add_c(uint8_t *dest
, int linesize
, int32_t *block
)
99 for (i
= 0; i
< 8; i
++, dest
+= linesize
, block
+= 8)
100 for (j
= 0; j
< 8; j
++)
104 static void bink_idct_put_c(uint8_t *dest
, int linesize
, int32_t *block
)
108 for (i
= 0; i
< 8; i
++)
109 bink_idct_col(&temp
[i
], &block
[i
]);
110 for (i
= 0; i
< 8; i
++) {
111 IDCT_ROW( (&dest
[i
*linesize
]), (&temp
[8*i
]) );
115 static void scale_block_c(const uint8_t src
[64]/*align 8*/, uint8_t *dst
/*align 8*/, int linesize
)
118 uint16_t *dst1
= (uint16_t *) dst
;
119 uint16_t *dst2
= (uint16_t *)(dst
+ linesize
);
121 for (j
= 0; j
< 8; j
++) {
122 for (i
= 0; i
< 8; i
++) {
123 dst1
[i
] = dst2
[i
] = src
[i
] * 0x0101;
131 void ff_binkdsp_init(BinkDSPContext
*c
)
133 c
->idct_add
= bink_idct_add_c
;
134 c
->idct_put
= bink_idct_put_c
;
135 c
->scale_block
= scale_block_c
;