mirror of
https://gitlab.freedesktop.org/pipewire/pipewire.git
synced 2025-11-09 13:30:06 -05:00
audioconvert: move some things around
To make it easier to add other implementations later. Improve selection of resampler function
This commit is contained in:
parent
bf3ebb67aa
commit
0d1cef6b3a
12 changed files with 172 additions and 131 deletions
|
|
@ -1,121 +0,0 @@
|
|||
/* Spa
|
||||
*
|
||||
* Copyright © 2018 Wim Taymans
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining a
|
||||
* copy of this software and associated documentation files (the "Software"),
|
||||
* to deal in the Software without restriction, including without limitation
|
||||
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
||||
* and/or sell copies of the Software, and to permit persons to whom the
|
||||
* Software is furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice (including the next
|
||||
* paragraph) shall be included in all copies or substantial portions of the
|
||||
* Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
||||
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||||
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
||||
* DEALINGS IN THE SOFTWARE.
|
||||
*/
|
||||
|
||||
#include <math.h>
|
||||
|
||||
struct peaks_data {
|
||||
uint32_t o_count;
|
||||
uint32_t i_count;
|
||||
float max_f[0];
|
||||
};
|
||||
|
||||
#if defined (__SSE__)
|
||||
#include "resample-peaks-sse.h"
|
||||
#endif
|
||||
|
||||
static void impl_peaks_free(struct resample *r)
|
||||
{
|
||||
free(r->data);
|
||||
r->data = NULL;
|
||||
}
|
||||
|
||||
static void impl_peaks_update_rate(struct resample *r, double rate)
|
||||
{
|
||||
}
|
||||
|
||||
static void impl_peaks_process(struct resample *r,
|
||||
const void * SPA_RESTRICT src[], uint32_t *in_len,
|
||||
void * SPA_RESTRICT dst[], uint32_t *out_len)
|
||||
{
|
||||
struct peaks_data *pd = r->data;
|
||||
uint32_t c, i, o, end, chunk, o_count, i_count;
|
||||
|
||||
if (SPA_UNLIKELY(r->channels == 0))
|
||||
return;
|
||||
|
||||
for (c = 0; c < r->channels; c++) {
|
||||
const float *s = src[c];
|
||||
float *d = dst[c], m = pd->max_f[c];
|
||||
|
||||
o_count = pd->o_count;
|
||||
i_count = pd->i_count;
|
||||
o = i = 0;
|
||||
|
||||
while (i < *in_len && o < *out_len) {
|
||||
end = ((uint64_t) (o_count + 1) * r->i_rate) / r->o_rate;
|
||||
end = end > i_count ? end - i_count : 0;
|
||||
chunk = SPA_MIN(end, *in_len);
|
||||
|
||||
for (; i < chunk; i++)
|
||||
m = SPA_MAX(fabsf(s[i]), m);
|
||||
|
||||
if (i == end) {
|
||||
d[o++] = m;
|
||||
m = 0.0f;
|
||||
o_count++;
|
||||
}
|
||||
}
|
||||
pd->max_f[c] = m;
|
||||
}
|
||||
|
||||
*out_len = o;
|
||||
*in_len = i;
|
||||
pd->o_count = o_count;
|
||||
pd->i_count = i_count + i;
|
||||
|
||||
while (pd->i_count >= r->i_rate) {
|
||||
pd->i_count -= r->i_rate;
|
||||
pd->o_count -= r->o_rate;
|
||||
}
|
||||
}
|
||||
|
||||
static void impl_peaks_reset (struct resample *r)
|
||||
{
|
||||
struct peaks_data *d = r->data;
|
||||
d->i_count = d->o_count = 0;
|
||||
}
|
||||
|
||||
static int impl_peaks_init(struct resample *r)
|
||||
{
|
||||
struct peaks_data *d;
|
||||
|
||||
r->free = impl_peaks_free;
|
||||
r->update_rate = impl_peaks_update_rate;
|
||||
#if defined (__SSE__)
|
||||
if (r->cpu_flags & SPA_CPU_FLAG_SSE)
|
||||
r->process = impl_peaks_process_sse;
|
||||
else
|
||||
#endif
|
||||
r->process = impl_peaks_process;
|
||||
|
||||
r->reset = impl_peaks_reset;
|
||||
d = r->data = calloc(1, sizeof(struct peaks_data) * sizeof(float) * r->channels);
|
||||
if (r->data == NULL)
|
||||
return -errno;
|
||||
|
||||
spa_log_debug(r->log, "peaks %p: in:%d out:%d", r, r->i_rate, r->o_rate);
|
||||
|
||||
d->i_count = d->o_count = 0;
|
||||
return 0;
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue