source: roaraudio/libroardsp/remove.c @ 2965:3e0e878ed13c

Last change on this file since 2965:3e0e878ed13c was 2423:da9a0d1c16dc, checked in by phi, 15 years ago

use correct consts

File size: 5.6 KB
Line 
1//remove.c:
2
3/*
4 *      Copyright (C) Philipp 'ph3-der-loewe' Schafft - 2009
5 *
6 *  This file is part of libroardsp a part of RoarAudio,
7 *  a cross-platform sound system for both, home and professional use.
8 *  See README for details.
9 *
10 *  This file is free software; you can redistribute it and/or modify
11 *  it under the terms of the GNU General Public License version 3
12 *  as published by the Free Software Foundation.
13 *
14 *  libroardsp is distributed in the hope that it will be useful,
15 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
16 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
17 *  GNU General Public License for more details.
18 *
19 *  You should have received a copy of the GNU General Public License
20 *  along with this software; see the file COPYING.  If not, write to
21 *  the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
22 *
23 */
24
25#include "libroardsp.h"
26
27int roar_remove_init (struct roar_remove_state * state) {
28 if ( state == NULL )
29  return -1;
30
31 memset(state, 0, sizeof(struct roar_remove_state));
32
33 state->old = 65535;
34
35 return 0;
36}
37
38int roar_remove      (void * inout, void * subs, int samples, int bits, struct roar_remove_state * state) {
39 if ( inout == NULL || subs == NULL || samples < 0 )
40  return -1;
41
42 switch (bits) {
43  case  8: return roar_remove_8 (inout, subs, samples, state); break;
44  case 16: return roar_remove_16(inout, subs, samples, state); break;
45  case 32: return roar_remove_32(inout, subs, samples, state); break;
46 }
47
48 return -1;
49}
50
51int roar_remove_8    (int8_t  * inout, int8_t  * subs, int samples, struct roar_remove_state * state) {
52 int i;
53 register int_least16_t s;
54 register int_least16_t peak;
55
56 if ( state == NULL ) {
57  for (i = 0; i < samples; i++) {
58   s  = inout[i];
59   s -= subs[i];
60   inout[i] = s;
61  }
62 } else {
63  peak = 127;
64  for (i = 0; i < samples; i++) {
65   s  = inout[i];
66   s -= subs[i];
67   s  = s < 0 ? -s : s; // we true 32 bit, not int operation here
68   if ( s > peak )
69    peak = s;
70  }
71
72  for (i = 0; i < samples; i++) {
73   s  = -subs[i];
74   s *=  127;
75   s /=  peak;
76   s +=  inout[i];
77   inout[i] = s;
78  }
79 }
80
81 return 0;
82}
83
84int roar_remove_16   (int16_t * inout, int16_t * subs, int samples, struct roar_remove_state * state) {
85 int i;
86 register int32_t s;
87 register int32_t peak;
88
89 if ( state == NULL ) {
90  for (i = 0; i < samples; i++) {
91   s  = inout[i];
92   s -= subs[i];
93   inout[i] = s;
94  }
95 } else {
96  peak = 65535;
97  for (i = 0; i < samples; i++) {
98   s  = inout[i];
99   s -= subs[i];
100   s  = s < 0 ? -s : s; // we true 32 bit, not int operation here
101   if ( s > peak )
102    peak = s;
103  }
104
105  for (i = 0; i < samples; i++) {
106   s  = -subs[i];
107   s *=  65535;
108   s /=  peak;
109   s +=  inout[i];
110   inout[i] = s;
111  }
112 }
113
114 return 0;
115}
116
117int roar_remove_32   (int32_t * inout, int32_t * subs, int samples, struct roar_remove_state * state) {
118 int i;
119 register int64_t s;
120 register int64_t peak;
121
122 if ( state == NULL ) {
123  for (i = 0; i < samples; i++) {
124   s  = inout[i];
125   s -= subs[i];
126   inout[i] = s;
127  }
128 } else {
129  peak = 4294967295UL;
130  for (i = 0; i < samples; i++) {
131   s  = inout[i];
132   s -= subs[i];
133   s  = s < 0 ? -s : s; // we true 32 bit, not int operation here
134   if ( s > peak )
135    peak = s;
136  }
137
138  for (i = 0; i < samples; i++) {
139   s  = -subs[i];
140   s *=  4294967295UL;
141   s /=  peak;
142   s +=  inout[i];
143   inout[i] = s;
144  }
145 }
146
147 return 0;
148}
149
150int roar_remove_so   (void    * subout, void   * in, int samples, int bits, struct roar_remove_state * state) {
151 if ( subout == NULL || in == NULL || samples < 0 )
152  return -1;
153
154 switch (bits) {
155  case  8: return roar_remove_so8 (subout, in, samples, state); break;
156  case 16: return roar_remove_so16(subout, in, samples, state); break;
157  case 32: return roar_remove_so32(subout, in, samples, state); break;
158 }
159
160 return -1;
161}
162
163int roar_remove_so8  (int8_t  * subout, int8_t  * in, int samples, struct roar_remove_state * state) {
164 int i;
165 register int_least16_t s;
166 register int_least16_t peak;
167
168 if ( state == NULL ) {
169  for (i = 0; i < samples; i++) {
170   s  = -subout[i];
171   s +=  in[i];
172   subout[i] = s;
173  }
174 } else {
175  peak = 127;
176  for (i = 0; i < samples; i++) {
177   s  = -subout[i];
178   s +=  in[i];
179   s  = s < 0 ? -s : s; // we true 32 bit, not int operation here
180   if ( s > peak )
181    peak = s;
182  }
183
184  for (i = 0; i < samples; i++) {
185   s  = -subout[i];
186   s *=  127;
187   s /=  peak;
188   s +=  in[i];
189   subout[i] = s;
190  }
191 }
192
193 return 0;
194}
195
196int roar_remove_so16 (int16_t * subout, int16_t * in, int samples, struct roar_remove_state * state) {
197 int i;
198 register int32_t s;
199 register int32_t peak;
200
201 if ( state == NULL ) {
202  for (i = 0; i < samples; i++) {
203   s  = -subout[i];
204   s +=  in[i];
205   subout[i] = s;
206  }
207 } else {
208  peak = 65535;
209  for (i = 0; i < samples; i++) {
210   s  = -subout[i];
211   s +=  in[i];
212   s  = s < 0 ? -s : s; // we true 32 bit, not int operation here
213   if ( s > peak )
214    peak = s;
215  }
216
217  for (i = 0; i < samples; i++) {
218   s  = -subout[i];
219   s *=  65535;
220   s /=  peak;
221   s +=  in[i];
222   subout[i] = s;
223  }
224 }
225
226 return 0;
227}
228
229int roar_remove_so32 (int32_t * subout, int32_t * in, int samples, struct roar_remove_state * state) {
230 int i;
231 register int64_t s;
232 register int64_t peak;
233
234 if ( state == NULL ) {
235  for (i = 0; i < samples; i++) {
236   s  = -subout[i];
237   s +=  in[i];
238   subout[i] = s;
239  }
240 } else {
241  peak = 2147483647UL;
242  for (i = 0; i < samples; i++) {
243   s  = -subout[i];
244   s +=  in[i];
245   s  = s < 0 ? -s : s; // we true 32 bit, not int operation here
246   if ( s > peak )
247    peak = s;
248  }
249
250  for (i = 0; i < samples; i++) {
251   s  = -subout[i];
252   s *=  2147483647UL;
253   s /=  peak;
254   s +=  in[i];
255   subout[i] = s;
256  }
257 }
258
259 return 0;
260}
261
262//ll
Note: See TracBrowser for help on using the repository browser.