|
| 1 | +#include "numpy/core.h" |
| 2 | +#include "numpy/linalg.h" |
| 3 | +#include <benchmark/benchmark.h> |
| 4 | +#include <vector> |
| 5 | +#include <random> |
| 6 | +#include <cmath> |
| 7 | + |
| 8 | +// ---- helpers ----------------------------------------------------------------- |
| 9 | + |
| 10 | +std::vector<double> make_data(size_t n) { |
| 11 | + std::vector<double> v(n); |
| 12 | + std::mt19937 rng(42); |
| 13 | + std::uniform_real_distribution<double> dist(1.0, 100.0); |
| 14 | + for (size_t i = 0; i < n; ++i) v[i] = dist(rng); |
| 15 | + return v; |
| 16 | +} |
| 17 | + |
| 18 | +// ---- element-wise ------------------------------------------------------------- |
| 19 | + |
| 20 | +#define BENCH_ELEMWISE(NAME) \ |
| 21 | +static void BM_##NAME(benchmark::State& state) { \ |
| 22 | + size_t n = state.range(0); \ |
| 23 | + auto src = make_data(n); \ |
| 24 | + std::vector<double> dst(n); \ |
| 25 | + for (auto _ : state) { \ |
| 26 | + numpy::NAME(src.data(), dst.data(), n); \ |
| 27 | + benchmark::DoNotOptimize(dst.data()); \ |
| 28 | + } \ |
| 29 | + state.SetItemsProcessed(state.iterations() * n); \ |
| 30 | +} \ |
| 31 | +BENCHMARK(BM_##NAME)->Range(1 << 10, 1 << 22); |
| 32 | + |
| 33 | +BENCH_ELEMWISE(sqrt) |
| 34 | +BENCH_ELEMWISE(abs) |
| 35 | +BENCH_ELEMWISE(exp) |
| 36 | +BENCH_ELEMWISE(log) |
| 37 | +BENCH_ELEMWISE(sin) |
| 38 | +BENCH_ELEMWISE(cos) |
| 39 | + |
| 40 | +// ---- reduction --------------------------------------------------------------- |
| 41 | + |
| 42 | +static void BM_sum(benchmark::State& state) { |
| 43 | + size_t n = state.range(0); |
| 44 | + auto src = make_data(n); |
| 45 | + for (auto _ : state) { |
| 46 | + double s = numpy::sum(src.data(), n); |
| 47 | + benchmark::DoNotOptimize(s); |
| 48 | + } |
| 49 | + state.SetItemsProcessed(state.iterations() * n); |
| 50 | +} |
| 51 | +BENCHMARK(BM_sum)->Range(1 << 10, 1 << 22); |
| 52 | + |
| 53 | +static void BM_mean(benchmark::State& state) { |
| 54 | + size_t n = state.range(0); |
| 55 | + auto src = make_data(n); |
| 56 | + for (auto _ : state) { |
| 57 | + double m = numpy::mean(src.data(), n); |
| 58 | + benchmark::DoNotOptimize(m); |
| 59 | + } |
| 60 | + state.SetItemsProcessed(state.iterations() * n); |
| 61 | +} |
| 62 | +BENCHMARK(BM_mean)->Range(1 << 10, 1 << 22); |
| 63 | + |
| 64 | +static void BM_max(benchmark::State& state) { |
| 65 | + size_t n = state.range(0); |
| 66 | + auto src = make_data(n); |
| 67 | + for (auto _ : state) { |
| 68 | + double m = numpy::max(src.data(), n); |
| 69 | + benchmark::DoNotOptimize(m); |
| 70 | + } |
| 71 | + state.SetItemsProcessed(state.iterations() * n); |
| 72 | +} |
| 73 | +BENCHMARK(BM_max)->Range(1 << 10, 1 << 22); |
| 74 | + |
| 75 | +// ---- dot product (1D) --------------------------------------------------------- |
| 76 | + |
| 77 | +static void BM_dot(benchmark::State& state) { |
| 78 | + size_t n = state.range(0); |
| 79 | + auto a = make_data(n); |
| 80 | + auto b = make_data(n); |
| 81 | + for (auto _ : state) { |
| 82 | + double d = numpy::dot(a.data(), b.data(), n); |
| 83 | + benchmark::DoNotOptimize(d); |
| 84 | + } |
| 85 | + state.SetItemsProcessed(state.iterations() * n); |
| 86 | +} |
| 87 | +BENCHMARK(BM_dot)->Range(1 << 10, 1 << 22); |
| 88 | + |
| 89 | +// ---- linalg norm -------------------------------------------------------------- |
| 90 | + |
| 91 | +static void BM_norm(benchmark::State& state) { |
| 92 | + size_t n = state.range(0); |
| 93 | + auto src = make_data(n); |
| 94 | + for (auto _ : state) { |
| 95 | + double r = numpy::linalg::norm(src.data(), n); |
| 96 | + benchmark::DoNotOptimize(r); |
| 97 | + } |
| 98 | + state.SetItemsProcessed(state.iterations() * n); |
| 99 | +} |
| 100 | +BENCHMARK(BM_norm)->Range(1 << 10, 1 << 22); |
| 101 | + |
| 102 | +// ---- main -------------------------------------------------------------------- |
| 103 | + |
| 104 | +BENCHMARK_MAIN(); |
0 commit comments