FFmpeg
binkdsp.c
Go to the documentation of this file.
1 /*
2  * Bink DSP routines
3  * Copyright (c) 2009 Konstantin Shishkov
4  *
5  * This file is part of FFmpeg.
6  *
7  * FFmpeg 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.
11  *
12  * FFmpeg 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.
16  *
17  * You should have received a copy of the GNU Lesser General Public
18  * License along with FFmpeg; if not, write to the Free Software
19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20  */
21 
22 /**
23  * @file
24  * Bink DSP routines
25  */
26 
27 #include "config.h"
28 #include "libavutil/attributes.h"
29 #include "binkdsp.h"
30 
31 #define A1 2896 /* (1/sqrt(2))<<12 */
32 #define A2 2217
33 #define A3 3784
34 #define A4 -5352
35 
36 #define MUL(X,Y) ((int)((unsigned)(X) * (Y)) >> 11)
37 
38 #define IDCT_TRANSFORM(dest,s0,s1,s2,s3,s4,s5,s6,s7,d0,d1,d2,d3,d4,d5,d6,d7,munge,src) {\
39  const int a0 = (src)[s0] + (src)[s4]; \
40  const int a1 = (src)[s0] - (src)[s4]; \
41  const int a2 = (src)[s2] + (src)[s6]; \
42  const int a3 = MUL(A1, (src)[s2] - (src)[s6]); \
43  const int a4 = (src)[s5] + (src)[s3]; \
44  const int a5 = (src)[s5] - (src)[s3]; \
45  const int a6 = (src)[s1] + (src)[s7]; \
46  const int a7 = (src)[s1] - (src)[s7]; \
47  const int b0 = a4 + a6; \
48  const int b1 = MUL(A3, a5 + a7); \
49  const int b2 = MUL(A4, a5) - b0 + b1; \
50  const int b3 = MUL(A1, a6 - a4) - b2; \
51  const int b4 = MUL(A2, a7) + b3 - b1; \
52  (dest)[d0] = munge(a0+a2 +b0); \
53  (dest)[d1] = munge(a1+a3-a2+b2); \
54  (dest)[d2] = munge(a1-a3+a2+b3); \
55  (dest)[d3] = munge(a0-a2 -b4); \
56  (dest)[d4] = munge(a0-a2 +b4); \
57  (dest)[d5] = munge(a1-a3+a2-b3); \
58  (dest)[d6] = munge(a1+a3-a2-b2); \
59  (dest)[d7] = munge(a0+a2 -b0); \
60 }
61 /* end IDCT_TRANSFORM macro */
62 
63 #define MUNGE_NONE(x) (x)
64 #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)
65 
66 #define MUNGE_ROW(x) (((x) + 0x7F)>>8)
67 #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)
68 
69 static inline void bink_idct_col(int *dest, const int32_t *src)
70 {
71  if ((src[8]|src[16]|src[24]|src[32]|src[40]|src[48]|src[56])==0) {
72  dest[0] =
73  dest[8] =
74  dest[16] =
75  dest[24] =
76  dest[32] =
77  dest[40] =
78  dest[48] =
79  dest[56] = src[0];
80  } else {
81  IDCT_COL(dest, src);
82  }
83 }
84 
85 static void bink_idct_c(int32_t *block)
86 {
87  int i;
88  int temp[64];
89 
90  for (i = 0; i < 8; i++)
91  bink_idct_col(&temp[i], &block[i]);
92  for (i = 0; i < 8; i++) {
93  IDCT_ROW( (&block[8*i]), (&temp[8*i]) );
94  }
95 }
96 
97 static void bink_idct_add_c(uint8_t *dest, int linesize, int32_t *block)
98 {
99  int i, j;
100 
101  bink_idct_c(block);
102  for (i = 0; i < 8; i++, dest += linesize, block += 8)
103  for (j = 0; j < 8; j++)
104  dest[j] += block[j];
105 }
106 
107 static void bink_idct_put_c(uint8_t *dest, int linesize, int32_t *block)
108 {
109  int i;
110  int temp[64];
111  for (i = 0; i < 8; i++)
112  bink_idct_col(&temp[i], &block[i]);
113  for (i = 0; i < 8; i++) {
114  IDCT_ROW( (&dest[i*linesize]), (&temp[8*i]) );
115  }
116 }
117 
118 static void scale_block_c(const uint8_t src[64]/*align 8*/, uint8_t *dst/*align 8*/, int linesize)
119 {
120  int i, j;
121  uint16_t *dst1 = (uint16_t *) dst;
122  uint16_t *dst2 = (uint16_t *)(dst + linesize);
123 
124  for (j = 0; j < 8; j++) {
125  for (i = 0; i < 8; i++) {
126  dst1[i] = dst2[i] = src[i] * 0x0101;
127  }
128  src += 8;
129  dst1 += linesize;
130  dst2 += linesize;
131  }
132 }
133 
134 static void add_pixels8_c(uint8_t *av_restrict pixels, int16_t *block,
135  int line_size)
136 {
137  int i;
138 
139  for (i = 0; i < 8; i++) {
140  pixels[0] += block[0];
141  pixels[1] += block[1];
142  pixels[2] += block[2];
143  pixels[3] += block[3];
144  pixels[4] += block[4];
145  pixels[5] += block[5];
146  pixels[6] += block[6];
147  pixels[7] += block[7];
148  pixels += line_size;
149  block += 8;
150  }
151 }
152 
154 {
159 }
av_cold void ff_binkdsp_init(BinkDSPContext *c)
Definition: binkdsp.c:153
static void bink_idct_add_c(uint8_t *dest, int linesize, int32_t *block)
Definition: binkdsp.c:97
else temp
Definition: vf_mcdeint.c:256
void(* scale_block)(const uint8_t src[64], uint8_t *dst, int linesize)
Definition: binkdsp.h:37
static void scale_block_c(const uint8_t src[64], uint8_t *dst, int linesize)
Definition: binkdsp.c:118
#define src
Definition: vp8dsp.c:254
Macro definitions for various function/variable attributes.
void(* idct_put)(uint8_t *dest, int line_size, int32_t *block)
Definition: binkdsp.h:35
The exact code depends on how similar the blocks are and how related they are to the block
uint8_t
#define av_cold
Definition: attributes.h:82
Undefined Behavior In the C some operations are like signed integer dereferencing freed accessing outside allocated Undefined Behavior must not occur in a C it is not safe even if the output of undefined operations is unused The unsafety may seem nit picking but Optimizing compilers have in fact optimized code on the assumption that no undefined Behavior occurs Optimizing code based on wrong assumptions can and has in some cases lead to effects beyond the output of computations The signed integer overflow problem in speed critical code Code which is highly optimized and works with signed integers sometimes has the problem that often the output of the computation does not c
Definition: undefined.txt:32
static void bink_idct_put_c(uint8_t *dest, int linesize, int32_t *block)
Definition: binkdsp.c:107
Bink DSP routines.
#define i(width, name, range_min, range_max)
Definition: cbs_h2645.c:259
#define IDCT_COL(dest, src)
Definition: binkdsp.c:64
static void bink_idct_col(int *dest, const int32_t *src)
Definition: binkdsp.c:69
static void bink_idct_c(int32_t *block)
Definition: binkdsp.c:85
void(* idct_add)(uint8_t *dest, int line_size, int32_t *block)
Definition: binkdsp.h:36
int32_t
static void add_pixels8_c(uint8_t *av_restrict pixels, int16_t *block, int line_size)
Definition: binkdsp.c:134
void(* add_pixels8)(uint8_t *av_restrict pixels, int16_t *block, int line_size)
Definition: binkdsp.h:38
int pixels
Definition: avisynth_c.h:390
#define IDCT_ROW(dest, src)
Definition: binkdsp.c:67