1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
|
/* BSE - Better Sound Engine
* Copyright (C) 2006 Tim Janik
* Copyright (C) 2006 Stefan Westerfeld
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* A copy of the GNU Lesser General Public License should ship along
* with this library; if not, see http://www.gnu.org/copyleft/.
*/
#include "bseblockutils.hh"
#include "bseresampler.hh"
#include "bseresamplerimpl.hh"
namespace {
class BlockImpl : virtual public Bse::Block::Impl {
virtual const char*
impl_name ()
{
return "FPU";
}
virtual void
add (guint n_values,
float *ovalues,
const float *ivalues)
{
for (guint i = 0; i < n_values; i++)
ovalues[i] += ivalues[i];
}
virtual void
sub (guint n_values,
float *ovalues,
const float *ivalues)
{
for (guint i = 0; i < n_values; i++)
ovalues[i] -= ivalues[i];
}
virtual void
mul (guint n_values,
float *ovalues,
const float *ivalues)
{
for (guint i = 0; i < n_values; i++)
ovalues[i] *= ivalues[i];
}
virtual void
scale (guint n_values,
float *ovalues,
const float *ivalues,
const float level)
{
for (guint i = 0; i < n_values; i++)
ovalues[i] = ivalues[i] * level;
}
virtual void
interleave2 (guint n_ivalues,
float *ovalues, /* length_ovalues = n_ivalues * 2 */
const float *ivalues,
guint offset) /* 0=left, 1=right */
{
int n = n_ivalues;
ovalues += offset;
for (int pos = 0; pos < n; pos++)
ovalues[pos * 2] = ivalues[pos];
}
virtual void
interleave2_add (guint n_ivalues,
float *ovalues, /* length_ovalues = n_ivalues * 2 */
const float *ivalues,
guint offset) /* 0=left, 1=right */
{
int n = n_ivalues;
ovalues += offset;
for (int pos = 0; pos < n; pos++)
ovalues[pos * 2] += ivalues[pos];
}
virtual void
range (guint n_values,
const float *ivalues,
float& min_value,
float& max_value)
{
float minv, maxv;
if (n_values)
{
minv = maxv = ivalues[0];
for (guint i = 1; i < n_values; i++)
{
if (UNLIKELY (ivalues[i] < minv))
minv = ivalues[i];
if (UNLIKELY (ivalues[i] > maxv))
maxv = ivalues[i];
}
}
else
{
minv = maxv = 0;
}
min_value = minv;
max_value = maxv;
}
virtual float
square_sum (guint n_values,
const float *ivalues)
{
float square_sum = 0.0;
for (guint i = 0; i < n_values; i++)
square_sum += ivalues[i] * ivalues[i];
return square_sum;
}
virtual float
range_and_square_sum (guint n_values,
const float *ivalues,
float& min_value,
float& max_value)
{
float square_sum;
float minv, maxv;
if (n_values)
{
minv = maxv = ivalues[0];
square_sum = ivalues[0] * ivalues[0];
for (guint i = 1; i < n_values; i++)
{
square_sum += ivalues[i] * ivalues[i];
if (UNLIKELY (ivalues[i] < minv))
minv = ivalues[i];
if (UNLIKELY (ivalues[i] > maxv))
maxv = ivalues[i];
}
}
else
{
minv = maxv = square_sum = 0.0;
}
min_value = minv;
max_value = maxv;
return square_sum;
}
virtual Bse::Resampler::Resampler2*
create_resampler2 (BseResampler2Mode mode,
BseResampler2Precision precision)
{
struct FPUResampler2 : public Bse::Resampler::Resampler2 {
static inline Resampler2*
create_resampler (BseResampler2Mode mode,
BseResampler2Precision precision)
{
return create_impl<false> (mode, precision);
}
};
return FPUResampler2::create_resampler (mode, precision);
}
virtual bool
test_resampler2 (bool verbose)
{
/* there is currently only a test for the SSE filter code, so in the
* non-SSE-case we simply always return true
*/
g_print ("SSE filter implementation not tested: no SSE support available\n");
return true;
}
};
static BlockImpl default_block_impl;
} // Anon
namespace Bse {
Block::Impl*
Block::default_singleton ()
{
return &default_block_impl;
}
Block::Impl *Block::singleton = &default_block_impl;
Block::Impl*
Block::current_singleton ()
{
return Block::singleton;
}
Block::Impl::~Impl()
{}
void
Block::Impl::substitute (Impl *substitute_impl)
{
if (!substitute_impl)
substitute_impl = &default_block_impl;
Block::singleton = substitute_impl;
}
} // Bse
extern "C" const char*
bse_block_impl_name (void)
{
return Bse::Block::impl_name();
}
extern "C" void
bse_block_add_floats (guint n_values,
float *ovalues,
const float *ivalues)
{
Bse::Block::add (n_values, ovalues, ivalues);
}
extern "C" void
bse_block_sub_floats (guint n_values,
float *ovalues,
const float *ivalues)
{
Bse::Block::sub (n_values, ovalues, ivalues);
}
extern "C" void
bse_block_mul_floats (guint n_values,
float *ovalues,
const float *ivalues)
{
Bse::Block::mul (n_values, ovalues, ivalues);
}
void
bse_block_scale_floats (guint n_values,
float *ovalues,
const float *ivalues,
const float level)
{
Bse::Block::scale (n_values, ovalues, ivalues, level);
}
extern "C" void
bse_block_interleave2_floats (guint n_ivalues,
float *ovalues, /* length_ovalues = n_ivalues * 2 */
const float *ivalues,
guint offset) /* 0=left, 1=right */
{
Bse::Block::interleave2 (n_ivalues, ovalues, ivalues, offset);
}
extern "C" void
bse_block_interleave2_add_floats (guint n_ivalues,
float *ovalues, /* length_ovalues = n_ivalues * 2 */
const float *ivalues,
guint offset) /* 0=left, 1=right */
{
Bse::Block::interleave2_add (n_ivalues, ovalues, ivalues, offset);
}
extern "C" void
bse_block_calc_float_range (guint n_values,
const float *ivalues,
float *min_value,
float *max_value)
{
Bse::Block::range (n_values, ivalues, *min_value, *max_value);
}
extern "C" float
bse_block_calc_float_square_sum (guint n_values,
const float *ivalues)
{
return Bse::Block::square_sum (n_values, ivalues);
}
extern "C" float
bse_block_calc_float_range_and_square_sum (guint n_values,
const float *ivalues,
float *min_value,
float *max_value)
{
return Bse::Block::range_and_square_sum (n_values, ivalues, *min_value, *max_value);
}
|
