source: roaraudio/libroardsp/remove.c @ 2395:9923da8efe75

Last change on this file since 2395:9923da8efe75 was 2395:9923da8efe75, checked in by phi, 15 years ago

added support for 8 bit so remove

File size: 5.4 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 16: return roar_remove_so16(subout, in, samples, state); break;
156 }
157
158 return -1;
159}
160
161int roar_remove_so8  (int8_t  * subout, int8_t  * in, int samples, struct roar_remove_state * state) {
162 int i;
163 register int_least16_t s;
164 register int_least16_t peak;
165
166 if ( state == NULL ) {
167  for (i = 0; i < samples; i++) {
168   s  = -subout[i];
169   s +=  in[i];
170   subout[i] = s;
171  }
172 } else {
173  peak = 127;
174  for (i = 0; i < samples; i++) {
175   s  = -subout[i];
176   s +=  in[i];
177   s  = s < 0 ? -s : s; // we true 32 bit, not int operation here
178   if ( s > peak )
179    peak = s;
180  }
181
182  for (i = 0; i < samples; i++) {
183   s  = -subout[i];
184   s *=  127;
185   s /=  peak;
186   s +=  in[i];
187   subout[i] = s;
188  }
189 }
190
191 return 0;
192}
193
194int roar_remove_so16 (int16_t * subout, int16_t * in, int samples, struct roar_remove_state * state) {
195 int i;
196 register int32_t s;
197 register int32_t peak;
198
199 if ( state == NULL ) {
200  for (i = 0; i < samples; i++) {
201   s  = -subout[i];
202   s +=  in[i];
203   subout[i] = s;
204  }
205 } else {
206  peak = 65535;
207  for (i = 0; i < samples; i++) {
208   s  = -subout[i];
209   s +=  in[i];
210   s  = s < 0 ? -s : s; // we true 32 bit, not int operation here
211   if ( s > peak )
212    peak = s;
213  }
214
215  for (i = 0; i < samples; i++) {
216   s  = -subout[i];
217   s *=  65535;
218   s /=  peak;
219   s +=  in[i];
220   subout[i] = s;
221  }
222 }
223
224 return 0;
225}
226
227int roar_remove_so32 (int32_t * subout, int32_t * in, int samples, struct roar_remove_state * state) {
228 int i;
229 register int64_t s;
230 register int64_t peak;
231
232 if ( state == NULL ) {
233  for (i = 0; i < samples; i++) {
234   s  = -subout[i];
235   s +=  in[i];
236   subout[i] = s;
237  }
238 } else {
239  peak = 4294967295UL;
240  for (i = 0; i < samples; i++) {
241   s  = -subout[i];
242   s +=  in[i];
243   s  = s < 0 ? -s : s; // we true 32 bit, not int operation here
244   if ( s > peak )
245    peak = s;
246  }
247
248  for (i = 0; i < samples; i++) {
249   s  = -subout[i];
250   s *=  4294967295UL;
251   s /=  peak;
252   s +=  in[i];
253   subout[i] = s;
254  }
255 }
256
257 return 0;
258}
259
260//ll
Note: See TracBrowser for help on using the repository browser.