sam/sfizz
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Merge pull request #714 from jpcima/linear-smoother-bypass

Browse source 
Smoother bypass when delay is short
This commit is contained in:
JP Cimalando 2021-03-18 16:14:39 +01:00 • committed by GitHub
commit c81805c545
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
src/sfizz/Smoothers.cpp
View file

@ -87,8 +87,9 @@ void LinearSmoother::process(absl::Span<const float> input, absl::Span<float> ou
float current = current_; float current = current_;
float target = target_; float target = target_;
const int32_t smoothFrames = smoothFrames_;
if (canShortcut && current == target && current == input.front()) { if (smoothFrames < 2 || (canShortcut && current == target && current == input.front())) {
if (input.data() != output.data()) if (input.data() != output.data())
copy<float>(input, output); copy<float>(input, output);
reset(input.back()); reset(input.back());
@ -97,7 +98,6 @@ void LinearSmoother::process(absl::Span<const float> input, absl::Span<float> ou
float step = step_; float step = step_;
// int32_t framesToTarget = framesToTarget_; // int32_t framesToTarget = framesToTarget_;
const int32_t smoothFrames = smoothFrames_;
#if SIMDE_NATURAL_VECTOR_SIZE_GE(128) #if SIMDE_NATURAL_VECTOR_SIZE_GE(128)
for (; i + 15 < count; i += 16) { for (; i + 15 < count; i += 16) {