|
| 1 | +// bench_algorithms.cpp – xsimd algorithms vs std equivalents |
| 2 | +// |
| 3 | +// Build: cmake -DBUILD_BENCHMARKS=ON -DCMAKE_BUILD_TYPE=Release ... |
| 4 | +// Run: ./bench_algorithms --benchmark_format=json --benchmark_out=result.json |
| 5 | +// (add --benchmark_min_time=2x for more stable numbers on fast machines) |
| 6 | + |
| 7 | +#include <algorithm> |
| 8 | +#include <numeric> |
| 9 | +#include <vector> |
| 10 | + |
| 11 | +#include <benchmark/benchmark.h> |
| 12 | + |
| 13 | +#include "xsimd_algorithm/stl/arange.hpp" |
| 14 | +#include "xsimd_algorithm/stl/reduce.hpp" |
| 15 | +#include "xsimd_algorithm/stl/transform.hpp" |
| 16 | + |
| 17 | +template <typename T> |
| 18 | +static std::vector<T> make_input(std::size_t n) |
| 19 | +{ |
| 20 | + std::vector<T> v(n); |
| 21 | + std::iota(v.begin(), v.end(), T(1)); |
| 22 | + return v; |
| 23 | +} |
| 24 | + |
| 25 | +template <typename T> |
| 26 | +static void BM_std_iota(benchmark::State& state) |
| 27 | +{ |
| 28 | + std::vector<T> v(static_cast<std::size_t>(state.range(0))); |
| 29 | + for (auto _ : state) |
| 30 | + { |
| 31 | + std::iota(v.begin(), v.end(), T(0)); |
| 32 | + benchmark::DoNotOptimize(v.data()); |
| 33 | + benchmark::ClobberMemory(); |
| 34 | + } |
| 35 | + state.SetItemsProcessed(state.iterations() * state.range(0)); |
| 36 | +} |
| 37 | + |
| 38 | +template <typename T> |
| 39 | +static void BM_xsimd_arange(benchmark::State& state) |
| 40 | +{ |
| 41 | + std::vector<T> v(static_cast<std::size_t>(state.range(0))); |
| 42 | + for (auto _ : state) |
| 43 | + { |
| 44 | + xsimd::arange(v.begin(), v.end(), T(0), T(1)); |
| 45 | + benchmark::DoNotOptimize(v.data()); |
| 46 | + benchmark::ClobberMemory(); |
| 47 | + } |
| 48 | + state.SetItemsProcessed(state.iterations() * state.range(0)); |
| 49 | +} |
| 50 | + |
| 51 | +template <typename T> |
| 52 | +static void BM_std_transform_unary(benchmark::State& state) |
| 53 | +{ |
| 54 | + auto src = make_input<T>(static_cast<std::size_t>(state.range(0))); |
| 55 | + std::vector<T> dst(src.size()); |
| 56 | + for (auto _ : state) |
| 57 | + { |
| 58 | + std::transform(src.begin(), src.end(), dst.begin(), |
| 59 | + [](T x) noexcept |
| 60 | + { return x * x; }); |
| 61 | + benchmark::DoNotOptimize(dst.data()); |
| 62 | + benchmark::ClobberMemory(); |
| 63 | + } |
| 64 | + state.SetItemsProcessed(state.iterations() * state.range(0)); |
| 65 | +} |
| 66 | + |
| 67 | +template <typename T> |
| 68 | +static void BM_xsimd_transform_unary(benchmark::State& state) |
| 69 | +{ |
| 70 | + auto src = make_input<T>(static_cast<std::size_t>(state.range(0))); |
| 71 | + std::vector<T> dst(src.size()); |
| 72 | + for (auto _ : state) |
| 73 | + { |
| 74 | + xsimd::transform(src.begin(), src.end(), dst.begin(), |
| 75 | + [](auto x) noexcept |
| 76 | + { return x * x; }); |
| 77 | + benchmark::DoNotOptimize(dst.data()); |
| 78 | + benchmark::ClobberMemory(); |
| 79 | + } |
| 80 | + state.SetItemsProcessed(state.iterations() * state.range(0)); |
| 81 | +} |
| 82 | + |
| 83 | +template <typename T> |
| 84 | +static void BM_std_transform_binary(benchmark::State& state) |
| 85 | +{ |
| 86 | + std::size_t n = static_cast<std::size_t>(state.range(0)); |
| 87 | + auto a = make_input<T>(n); |
| 88 | + auto b = make_input<T>(n); |
| 89 | + std::vector<T> dst(n); |
| 90 | + for (auto _ : state) |
| 91 | + { |
| 92 | + std::transform(a.begin(), a.end(), b.begin(), dst.begin(), |
| 93 | + [](T x, T y) noexcept |
| 94 | + { return x + y; }); |
| 95 | + benchmark::DoNotOptimize(dst.data()); |
| 96 | + benchmark::ClobberMemory(); |
| 97 | + } |
| 98 | + state.SetItemsProcessed(state.iterations() * state.range(0)); |
| 99 | +} |
| 100 | + |
| 101 | +template <typename T> |
| 102 | +static void BM_xsimd_transform_binary(benchmark::State& state) |
| 103 | +{ |
| 104 | + std::size_t n = static_cast<std::size_t>(state.range(0)); |
| 105 | + auto a = make_input<T>(n); |
| 106 | + auto b = make_input<T>(n); |
| 107 | + std::vector<T> dst(n); |
| 108 | + for (auto _ : state) |
| 109 | + { |
| 110 | + xsimd::transform(a.begin(), a.end(), b.begin(), dst.begin(), |
| 111 | + [](auto x, auto y) noexcept |
| 112 | + { return x + y; }); |
| 113 | + benchmark::DoNotOptimize(dst.data()); |
| 114 | + benchmark::ClobberMemory(); |
| 115 | + } |
| 116 | + state.SetItemsProcessed(state.iterations() * state.range(0)); |
| 117 | +} |
| 118 | + |
| 119 | +template <typename T> |
| 120 | +static void BM_std_reduce(benchmark::State& state) |
| 121 | +{ |
| 122 | + auto v = make_input<T>(static_cast<std::size_t>(state.range(0))); |
| 123 | + for (auto _ : state) |
| 124 | + { |
| 125 | + T result = std::reduce(v.begin(), v.end(), T(0)); |
| 126 | + benchmark::DoNotOptimize(result); |
| 127 | + } |
| 128 | + state.SetItemsProcessed(state.iterations() * state.range(0)); |
| 129 | +} |
| 130 | + |
| 131 | +template <typename T> |
| 132 | +static void BM_xsimd_reduce(benchmark::State& state) |
| 133 | +{ |
| 134 | + auto v = make_input<T>(static_cast<std::size_t>(state.range(0))); |
| 135 | + for (auto _ : state) |
| 136 | + { |
| 137 | + T result = xsimd::reduce(v.begin(), v.end(), T(0)); |
| 138 | + benchmark::DoNotOptimize(result); |
| 139 | + } |
| 140 | + state.SetItemsProcessed(state.iterations() * state.range(0)); |
| 141 | +} |
| 142 | + |
| 143 | +static constexpr long long kSmall = 1LL << 12; |
| 144 | +static constexpr long long kMedium = 1LL << 18; |
| 145 | +static constexpr long long kLarge = 1LL << 22; |
| 146 | + |
| 147 | +#define BENCH_ARGS ->Arg(kSmall)->Arg(kMedium)->Arg(kLarge) |
| 148 | + |
| 149 | +// arange / iota |
| 150 | +BENCHMARK_TEMPLATE(BM_std_iota, float)->Arg(kSmall)->Arg(kMedium)->Arg(kLarge); |
| 151 | +BENCHMARK_TEMPLATE(BM_xsimd_arange, float)->Arg(kSmall)->Arg(kMedium)->Arg(kLarge); |
| 152 | +BENCHMARK_TEMPLATE(BM_std_iota, double)->Arg(kSmall)->Arg(kMedium)->Arg(kLarge); |
| 153 | +BENCHMARK_TEMPLATE(BM_xsimd_arange, double)->Arg(kSmall)->Arg(kMedium)->Arg(kLarge); |
| 154 | + |
| 155 | +// transform unary |
| 156 | +BENCHMARK_TEMPLATE(BM_std_transform_unary, float) |
| 157 | +BENCH_ARGS; |
| 158 | +BENCHMARK_TEMPLATE(BM_xsimd_transform_unary, float) |
| 159 | +BENCH_ARGS; |
| 160 | +BENCHMARK_TEMPLATE(BM_std_transform_unary, double) |
| 161 | +BENCH_ARGS; |
| 162 | +BENCHMARK_TEMPLATE(BM_xsimd_transform_unary, double) |
| 163 | +BENCH_ARGS; |
| 164 | + |
| 165 | +// transform binary |
| 166 | +BENCHMARK_TEMPLATE(BM_std_transform_binary, float) |
| 167 | +BENCH_ARGS; |
| 168 | +BENCHMARK_TEMPLATE(BM_xsimd_transform_binary, float) |
| 169 | +BENCH_ARGS; |
| 170 | +BENCHMARK_TEMPLATE(BM_std_transform_binary, double) |
| 171 | +BENCH_ARGS; |
| 172 | +BENCHMARK_TEMPLATE(BM_xsimd_transform_binary, double) |
| 173 | +BENCH_ARGS; |
| 174 | + |
| 175 | +// reduce |
| 176 | +BENCHMARK_TEMPLATE(BM_std_reduce, float) |
| 177 | +BENCH_ARGS; |
| 178 | +BENCHMARK_TEMPLATE(BM_xsimd_reduce, float) |
| 179 | +BENCH_ARGS; |
| 180 | +BENCHMARK_TEMPLATE(BM_std_reduce, double) |
| 181 | +BENCH_ARGS; |
| 182 | +BENCHMARK_TEMPLATE(BM_xsimd_reduce, double) |
| 183 | +BENCH_ARGS; |
| 184 | + |
| 185 | +BENCHMARK_MAIN(); |
0 commit comments