diff options
| author | Volker Rümelin <vr_qemu@t-online.de> | 2023-02-24 20:05:43 +0100 |
|---|---|---|
| committer | Marc-André Lureau <marcandre.lureau@redhat.com> | 2023-03-06 10:30:23 +0400 |
| commit | 8933882da9c63a0b60706828e11f3c09e2a903c7 (patch) | |
| tree | 8334e426b9f969cff1653e21bef3748e15c74cc2 /audio | |
| parent | 2c3f9a0a92ac98c31d501c2a73119853cb6739f1 (diff) | |
| download | qemu-8933882da9c63a0b60706828e11f3c09e2a903c7.zip qemu-8933882da9c63a0b60706828e11f3c09e2a903c7.tar.gz qemu-8933882da9c63a0b60706828e11f3c09e2a903c7.tar.bz2 | |
audio: make the resampling code greedy
Read the maximum possible number of audio frames instead of the
minimum necessary number of frames when the audio stream is
downsampled and the output buffer is limited. This makes the
function symmetrical to upsampling when the input buffer is
limited. The maximum possible number of frames is written here.
With this change it's easier to calculate the exact number of
audio frames the resample function will read or write. These two
functions will be introduced later.
Acked-by: Mark Cave-Ayland <mark.cave-ayland@ilande.co.uk>
Acked-by: Marc-André Lureau <marcandre.lureau@redhat.com>
Signed-off-by: Volker Rümelin <vr_qemu@t-online.de>
Message-Id: <20230224190555.7409-3-vr_qemu@t-online.de>
Diffstat (limited to 'audio')
| -rw-r--r-- | audio/rate_template.h | 21 |
1 files changed, 13 insertions, 8 deletions
diff --git a/audio/rate_template.h b/audio/rate_template.h index b432719..6648f0d 100644 --- a/audio/rate_template.h +++ b/audio/rate_template.h @@ -40,8 +40,6 @@ void NAME (void *opaque, struct st_sample *ibuf, struct st_sample *obuf, int64_t t; #endif - ilast = rate->ilast; - istart = ibuf; iend = ibuf + *isamp; @@ -59,15 +57,17 @@ void NAME (void *opaque, struct st_sample *ibuf, struct st_sample *obuf, return; } - while (obuf < oend) { + /* without input samples, there's nothing to do */ + if (ibuf >= iend) { + *osamp = 0; + return; + } - /* Safety catch to make sure we have input samples. */ - if (ibuf >= iend) { - break; - } + ilast = rate->ilast; - /* read as many input samples so that ipos > opos */ + while (true) { + /* read as many input samples so that ipos > opos */ while (rate->ipos <= (rate->opos >> 32)) { ilast = *ibuf++; rate->ipos++; @@ -78,6 +78,11 @@ void NAME (void *opaque, struct st_sample *ibuf, struct st_sample *obuf, } } + /* make sure that the next output sample can be written */ + if (obuf >= oend) { + break; + } + icur = *ibuf; /* wrap ipos and opos around long before they overflow */ |