-
-
Notifications
You must be signed in to change notification settings - Fork 58
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #85 from jpcima/multiply-add
Add multiplyAdd with fixed gain
- Loading branch information
Showing
7 changed files
with
219 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,78 @@ | ||
// SPDX-License-Identifier: BSD-2-Clause | ||
|
||
// This code is part of the sfizz library and is licensed under a BSD 2-clause | ||
// license. You should have receive a LICENSE.md file along with the code. | ||
// If not, contact the sfizz maintainers at https://github.com/sfztools/sfizz | ||
|
||
#include "SIMDHelpers.h" | ||
#include <benchmark/benchmark.h> | ||
#include <random> | ||
#include <numeric> | ||
#include <vector> | ||
#include <cmath> | ||
#include <iostream> | ||
|
||
class MultiplyAddFixedGain : public benchmark::Fixture { | ||
public: | ||
void SetUp(const ::benchmark::State& state) { | ||
std::random_device rd { }; | ||
std::mt19937 gen { rd() }; | ||
std::uniform_real_distribution<float> dist { 0, 1 }; | ||
input = std::vector<float>(state.range(0)); | ||
output = std::vector<float>(state.range(0)); | ||
gain = dist(gen); | ||
std::fill(output.begin(), output.end(), 1.0f ); | ||
std::generate(input.begin(), input.end(), [&]() { return dist(gen); }); | ||
} | ||
|
||
void TearDown(const ::benchmark::State& state [[maybe_unused]]) { | ||
|
||
} | ||
|
||
float gain = {}; | ||
std::vector<float> input; | ||
std::vector<float> output; | ||
}; | ||
|
||
BENCHMARK_DEFINE_F(MultiplyAddFixedGain, Straight)(benchmark::State& state) { | ||
for (auto _ : state) | ||
{ | ||
for (int i = 0; i < state.range(0); ++i) | ||
output[i] += gain * input[i]; | ||
} | ||
} | ||
|
||
BENCHMARK_DEFINE_F(MultiplyAddFixedGain, Scalar)(benchmark::State& state) { | ||
for (auto _ : state) | ||
{ | ||
sfz::multiplyAdd<float, false>(gain, input, absl::MakeSpan(output)); | ||
} | ||
} | ||
|
||
BENCHMARK_DEFINE_F(MultiplyAddFixedGain, SIMD)(benchmark::State& state) { | ||
for (auto _ : state) | ||
{ | ||
sfz::multiplyAdd<float, true>(gain, input, absl::MakeSpan(output)); | ||
} | ||
} | ||
|
||
BENCHMARK_DEFINE_F(MultiplyAddFixedGain, Scalar_Unaligned)(benchmark::State& state) { | ||
for (auto _ : state) | ||
{ | ||
sfz::multiplyAdd<float, false>(gain, absl::MakeSpan(input).subspan(1), absl::MakeSpan(output).subspan(1)); | ||
} | ||
} | ||
|
||
BENCHMARK_DEFINE_F(MultiplyAddFixedGain, SIMD_Unaligned)(benchmark::State& state) { | ||
for (auto _ : state) | ||
{ | ||
sfz::multiplyAdd<float, true>(gain, absl::MakeSpan(input).subspan(1), absl::MakeSpan(output).subspan(1)); | ||
} | ||
} | ||
|
||
BENCHMARK_REGISTER_F(MultiplyAddFixedGain, Straight)->RangeMultiplier(4)->Range(1 << 2, 1 << 12); | ||
BENCHMARK_REGISTER_F(MultiplyAddFixedGain, Scalar)->RangeMultiplier(4)->Range(1 << 2, 1 << 12); | ||
BENCHMARK_REGISTER_F(MultiplyAddFixedGain, SIMD)->RangeMultiplier(4)->Range(1 << 2, 1 << 12); | ||
BENCHMARK_REGISTER_F(MultiplyAddFixedGain, Scalar_Unaligned)->RangeMultiplier(4)->Range(1 << 2, 1 << 12); | ||
BENCHMARK_REGISTER_F(MultiplyAddFixedGain, SIMD_Unaligned)->RangeMultiplier(4)->Range(1 << 2, 1 << 12); | ||
BENCHMARK_MAIN(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters