mirror of
https://gitlab.freedesktop.org/pipewire/pipewire.git
synced 2025-11-03 09:01:54 -05:00
audioconvert: add simple and faster resampler
Add a sinc based resampler that, unlike speex, avoids memcpy and works directly on the source data. It also allows for ssse3 optimizations and aligned loads. It will later switch to table interpolation when doing variable rate.
This commit is contained in:
Wim Taymans
parent
f29d14fcc8
commit
9c8913437b
10 changed files with 720 additions and 7 deletions
273
spa/plugins/audioconvert/resample-native.h
Normal file
273
spa/plugins/audioconvert/resample-native.h
Normal file
|
|
@ -0,0 +1,273 @@
|
|||
/* Spa
|
||||
*
|
||||
* Copyright © 2019 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>
|
||||
|
||||
typedef void (*resample_func_t)(struct resample *r,
|
||||
const void * SPA_RESTRICT src[], uint32_t *in_len,
|
||||
void * SPA_RESTRICT dst[], uint32_t offs, uint32_t *out_len);
|
||||
|
||||
struct native_data {
|
||||
double rate;
|
||||
uint32_t n_taps;
|
||||
uint32_t n_phases;
|
||||
uint32_t in_rate;
|
||||
uint32_t out_rate;
|
||||
uint32_t index;
|
||||
uint32_t phase;
|
||||
uint32_t inc;
|
||||
uint32_t frac;
|
||||
uint32_t hist;
|
||||
float **history;
|
||||
resample_func_t func;
|
||||
float *filter;
|
||||
float *hist_mem;
|
||||
};
|
||||
|
||||
#include "resample-native-impl.h"
|
||||
#include "resample-native-c.h"
|
||||
#if defined (__SSE__)
|
||||
#include "resample-native-sse.h"
|
||||
#endif
|
||||
#if defined (__SSSE3__)
|
||||
#include "resample-native-ssse3.h"
|
||||
#endif
|
||||
|
||||
struct quality {
|
||||
uint32_t n_taps;
|
||||
double cutoff;
|
||||
};
|
||||
|
||||
#define DEFAULT_QUALITY 4
|
||||
|
||||
static const struct quality blackman_qualities[] = {
|
||||
{ 8, 0.5, },
|
||||
{ 16, 0.6, },
|
||||
{ 24, 0.72, },
|
||||
{ 32, 0.8, },
|
||||
{ 48, 0.85, }, /* default */
|
||||
{ 64, 0.90, },
|
||||
{ 80, 0.92, },
|
||||
{ 96, 0.933, },
|
||||
{ 128, 0.950, },
|
||||
{ 144, 0.955, },
|
||||
{ 160, 0.960, }
|
||||
};
|
||||
|
||||
static inline double sinc(double x)
|
||||
{
|
||||
if (x < 1e-6) return 1.0;
|
||||
x *= M_PI;
|
||||
return sin(x) / x;
|
||||
}
|
||||
|
||||
static inline double blackman(double x, double n_taps)
|
||||
{
|
||||
double w = 2.0 * x * M_PI / n_taps + M_PI;
|
||||
return 0.3635819 - 0.4891775 * cos(w) +
|
||||
0.1365995 * cos(2 * w) - 0.0106411 * cos(3 * w);
|
||||
}
|
||||
|
||||
static int build_filter(float *taps, uint32_t stride, uint32_t n_taps, uint32_t n_phases, double cutoff)
|
||||
{
|
||||
uint32_t i, j, n_taps12 = n_taps/2;
|
||||
|
||||
for (i = 0; i <= n_phases; i++) {
|
||||
double t = (double) i / (double) n_phases;
|
||||
for (j = 0; j < n_taps12; j++, t += 1.0)
|
||||
taps[i * stride + (n_taps12 - j - 1)] =
|
||||
cutoff * sinc(t * cutoff) * blackman(t, n_taps);
|
||||
}
|
||||
for (i = 0; i <= n_phases; i++) {
|
||||
for (j = n_taps12; j < n_taps; j++)
|
||||
taps[i * stride + j] = taps[(n_phases - i) * stride + n_taps - j - 1];
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void impl_native_free(struct resample *r)
|
||||
{
|
||||
free(r->data);
|
||||
r->data = NULL;
|
||||
}
|
||||
|
||||
static void impl_native_update_rate(struct resample *r, double rate)
|
||||
{
|
||||
}
|
||||
|
||||
static void impl_native_process(struct resample *r,
|
||||
const void * SPA_RESTRICT src[], uint32_t *in_len,
|
||||
void * SPA_RESTRICT dst[], uint32_t *out_len)
|
||||
{
|
||||
struct native_data *data = r->data;
|
||||
uint32_t n_taps = data->n_taps;
|
||||
float **history = data->history;
|
||||
const float **s;
|
||||
uint32_t c, refill, hist, in, out, remain;
|
||||
|
||||
out = refill = in = 0;
|
||||
hist = data->hist;
|
||||
|
||||
if (hist) {
|
||||
if (hist < n_taps) {
|
||||
refill = SPA_MIN(*in_len, n_taps);
|
||||
for (c = 0; c < r->channels; c++)
|
||||
memcpy(&history[c][hist], src[c], refill * sizeof(float));
|
||||
|
||||
if (hist + refill < n_taps) {
|
||||
data->hist = hist + refill;
|
||||
*in_len = refill;
|
||||
*out_len = 0;
|
||||
return;
|
||||
}
|
||||
}
|
||||
in = hist + refill;
|
||||
out = *out_len;
|
||||
data->func(r, (const void**)history, &in, dst, 0, &out);
|
||||
data->index -= hist;
|
||||
}
|
||||
|
||||
if (out < *out_len) {
|
||||
in = *in_len;
|
||||
s = (const float **)src;
|
||||
data->func(r, src, &in, dst, out, out_len);
|
||||
remain = *in_len - in;
|
||||
} else {
|
||||
s = (const float **)history;
|
||||
remain = hist - in;
|
||||
if (*in_len < n_taps) {
|
||||
remain += refill;
|
||||
*in_len = refill;
|
||||
} else {
|
||||
*in_len = 0;
|
||||
}
|
||||
}
|
||||
if (remain < n_taps) {
|
||||
for (c = 0; c < r->channels; c++)
|
||||
memmove(history[c], &s[c][in], remain * sizeof(float));
|
||||
} else {
|
||||
remain = 0;
|
||||
*in_len = in;
|
||||
}
|
||||
data->index = 0;
|
||||
data->hist = remain;
|
||||
return;
|
||||
}
|
||||
|
||||
static void impl_native_reset (struct resample *r)
|
||||
{
|
||||
struct native_data *d = r->data;
|
||||
memset(d->hist_mem, 0, r->channels * sizeof(float) * d->n_taps * 2);
|
||||
d->hist = d->n_taps / 2;
|
||||
d->index = 0;
|
||||
d->phase = 0;
|
||||
}
|
||||
|
||||
static uint32_t impl_native_delay (struct resample *r)
|
||||
{
|
||||
struct native_data *d = r->data;
|
||||
return d->n_taps;
|
||||
}
|
||||
|
||||
static inline uint32_t calc_gcd(uint32_t a, uint32_t b)
|
||||
{
|
||||
while (b != 0) {
|
||||
uint32_t temp = a;
|
||||
a = b;
|
||||
b = b % temp;
|
||||
}
|
||||
return a;
|
||||
}
|
||||
|
||||
static int impl_native_init(struct resample *r)
|
||||
{
|
||||
struct native_data *d;
|
||||
const struct quality *q = &blackman_qualities[DEFAULT_QUALITY];
|
||||
double scale;
|
||||
uint32_t c, n_taps, n_phases, filter_size, in_rate, out_rate, gcd, stride;
|
||||
uint32_t history_stride, history_size;
|
||||
|
||||
r->free = impl_native_free;
|
||||
r->update_rate = impl_native_update_rate;
|
||||
r->process = impl_native_process;
|
||||
r->reset = impl_native_reset;
|
||||
r->delay = impl_native_delay;
|
||||
|
||||
gcd = calc_gcd(r->i_rate, r->o_rate);
|
||||
|
||||
in_rate = r->i_rate /= gcd;
|
||||
out_rate = r->o_rate /= gcd;
|
||||
|
||||
scale = SPA_MIN(q->cutoff * r->o_rate / r->i_rate, 1.0);
|
||||
n_taps = SPA_ROUND_UP_N((uint32_t)ceil(q->n_taps / scale), 8);
|
||||
stride = n_taps * sizeof(float);
|
||||
n_phases = out_rate;
|
||||
|
||||
fprintf(stderr, "in %d out %d %d %d %d %f\n", in_rate, out_rate, gcd, n_taps, n_phases, scale);
|
||||
|
||||
filter_size = stride * (n_phases + 1);
|
||||
history_stride = 2 * n_taps * sizeof(float);
|
||||
history_size = r->channels * history_stride;
|
||||
|
||||
d = malloc(sizeof(struct native_data) +
|
||||
filter_size +
|
||||
history_size +
|
||||
(r->channels * sizeof(float*)) +
|
||||
32);
|
||||
|
||||
if (d == NULL)
|
||||
return -ENOMEM;
|
||||
|
||||
r->data = d;
|
||||
d->rate = 1.0f;
|
||||
d->filter = SPA_MEMBER(d, sizeof(struct native_data), float);
|
||||
d->filter = SPA_PTR_ALIGN(d->filter, 16, float);
|
||||
d->hist_mem = SPA_MEMBER(d->filter, filter_size, float);
|
||||
d->hist_mem = SPA_PTR_ALIGN(d->hist_mem, 16, float);
|
||||
d->history = SPA_MEMBER(d->hist_mem, history_size, float*);
|
||||
for (c = 0; c < r->channels; c++)
|
||||
d->history[c] = SPA_MEMBER(d->hist_mem, c * history_stride, float);
|
||||
|
||||
d->in_rate = in_rate;
|
||||
d->out_rate = out_rate;
|
||||
d->inc = in_rate / out_rate;
|
||||
d->frac = in_rate % out_rate;
|
||||
d->n_taps = n_taps;
|
||||
d->n_phases = n_phases;
|
||||
|
||||
build_filter(d->filter, n_taps, n_taps, n_phases, scale);
|
||||
|
||||
impl_native_reset (r);
|
||||
|
||||
d->func = d->rate == 1.0f ? do_resample_full_c : do_resample_inter_c;
|
||||
#if defined (__SSE__)
|
||||
if (r->cpu_flags & SPA_CPU_FLAG_SSE)
|
||||
d->func = d->rate == 1.0f ? do_resample_full_sse : do_resample_inter_sse;
|
||||
#endif
|
||||
#if defined (__SSSE3__)
|
||||
if (r->cpu_flags & SPA_CPU_FLAG_SSSE3)
|
||||
d->func = d->rate == 1.0f ? do_resample_full_ssse3 : do_resample_inter_ssse3;
|
||||
#endif
|
||||
return 0;
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue