|
6 | 6 | * See LICENSE for more information. |
7 | 7 | */ |
8 | 8 |
|
9 | | -int main(int argc, char** argv) |
10 | | -{ |
| 9 | +#include <benchmark/benchmark.h> |
| 10 | +#include <vector> |
| 11 | +#include <random> |
| 12 | + |
| 13 | +#include <cmath> |
| 14 | +#include "ccmath/ccmath.hpp" |
| 15 | + |
| 16 | +namespace bm = benchmark; |
| 17 | + |
| 18 | +// Global seed value for random number generator |
| 19 | +constexpr unsigned int DefaultSeed = 937162211; // Using a long prime number as our default seed |
| 20 | + |
| 21 | +// Generate a fixed set of random integers for benchmarking |
| 22 | +std::vector<int> generateRandomIntegers(size_t count, unsigned int seed) { |
| 23 | + std::vector<int> randomIntegers; |
| 24 | + std::mt19937 gen(seed); |
| 25 | + std::uniform_int_distribution<int> dist(std::numeric_limits<int>::min(), std::numeric_limits<int>::max()); |
| 26 | + for (size_t i = 0; i < count; ++i) { |
| 27 | + randomIntegers.push_back(dist(gen)); |
| 28 | + } |
| 29 | + return randomIntegers; |
| 30 | +} |
| 31 | + |
| 32 | +// Generate a fixed set of random integers for benchmarking |
| 33 | +std::vector<double> generateRandomDoubles(size_t count, unsigned int seed) { |
| 34 | + std::vector<double> randomDouble; |
| 35 | + std::mt19937 gen(seed); |
| 36 | + std::uniform_real_distribution<double> dist(std::numeric_limits<double>::min(), std::numeric_limits<double>::max()); |
| 37 | + for (size_t i = 0; i < count; ++i) { |
| 38 | + randomDouble.push_back(dist(gen)); |
| 39 | + } |
| 40 | + return randomDouble; |
| 41 | +} |
| 42 | + |
| 43 | +// Benchmarking std::abs with the same set of random integers |
| 44 | +static void BM_std_abs_rand_int(benchmark::State& state) { |
| 45 | + auto randomIntegers = generateRandomIntegers(static_cast<size_t>(state.range(0)), DefaultSeed); |
| 46 | + while (state.KeepRunning()) { |
| 47 | + for (auto x : randomIntegers) { |
| 48 | + benchmark::DoNotOptimize(std::abs(x)); |
| 49 | + } |
| 50 | + } |
| 51 | + state.SetComplexityN(state.range(0)); |
11 | 52 | } |
| 53 | +BENCHMARK(BM_std_abs_rand_int)->Range(8, 8<<10)->Complexity(); |
| 54 | + |
| 55 | +// Benchmarking ccm::abs with the same set of random integers |
| 56 | +static void BM_ccm_abs_rand_int(benchmark::State& state) { |
| 57 | + auto randomIntegers = generateRandomIntegers(static_cast<size_t>(state.range(0)), DefaultSeed); |
| 58 | + while (state.KeepRunning()) { |
| 59 | + for (auto x : randomIntegers) { |
| 60 | + benchmark::DoNotOptimize(ccm::abs(x)); |
| 61 | + } |
| 62 | + } |
| 63 | + state.SetComplexityN(state.range(0)); |
| 64 | +} |
| 65 | +BENCHMARK(BM_ccm_abs_rand_int)->Range(8, 8<<10)->Complexity(); |
| 66 | + |
| 67 | +// Benchmarking std::abs with the same set of random integers |
| 68 | +static void BM_std_abs_rand_double(benchmark::State& state) { |
| 69 | + auto randomIntegers = generateRandomDoubles(static_cast<size_t>(state.range(0)), DefaultSeed); |
| 70 | + while (state.KeepRunning()) { |
| 71 | + for (auto x : randomIntegers) { |
| 72 | + benchmark::DoNotOptimize(std::abs(x)); |
| 73 | + } |
| 74 | + } |
| 75 | + state.SetComplexityN(state.range(0)); |
| 76 | +} |
| 77 | +BENCHMARK(BM_std_abs_rand_double)->Range(8, 8<<10)->Complexity(); |
| 78 | + |
| 79 | +// Benchmarking ccm::abs with the same set of random integers |
| 80 | +static void BM_ccm_abs_rand_double(benchmark::State& state) { |
| 81 | + auto randomIntegers = generateRandomDoubles(static_cast<size_t>(state.range(0)), DefaultSeed); |
| 82 | + while (state.KeepRunning()) { |
| 83 | + for (auto x : randomIntegers) { |
| 84 | + benchmark::DoNotOptimize(ccm::abs(x)); |
| 85 | + } |
| 86 | + } |
| 87 | + state.SetComplexityN(state.range(0)); |
| 88 | +} |
| 89 | +BENCHMARK(BM_ccm_abs_rand_double)->Range(8, 8<<10)->Complexity(); |
| 90 | + |
| 91 | + |
| 92 | +static void BM_std_abs(benchmark::State& state) { |
| 93 | + for (auto _ : state) { |
| 94 | + benchmark::DoNotOptimize(std::abs(state.range(0))); |
| 95 | + } |
| 96 | + state.SetComplexityN(state.range(0)); |
| 97 | +} |
| 98 | +BENCHMARK(BM_std_abs)->Arg(16)->Arg(256)->Arg(4096)->Arg(65536)->Complexity(); |
| 99 | + |
| 100 | +static void BM_ccm_abs(benchmark::State& state) { |
| 101 | + for (auto _ : state) { |
| 102 | + benchmark::DoNotOptimize(ccm::abs(state.range(0))); |
| 103 | + } |
| 104 | + state.SetComplexityN(state.range(0)); |
| 105 | +} |
| 106 | +BENCHMARK(BM_ccm_abs)->Arg(16)->Arg(256)->Arg(4096)->Arg(65536)->Complexity(); |
| 107 | + |
| 108 | + |
| 109 | +static void BM_ccm_log(bm::State& state) { |
| 110 | + for (auto _ : state) { |
| 111 | + bm::DoNotOptimize(ccm::log(state.range(0))); |
| 112 | + } |
| 113 | +} |
| 114 | +BENCHMARK(BM_ccm_log)->Arg(16)->Arg(256)->Arg(4096)->Arg(65536)->Complexity(); |
| 115 | + |
| 116 | +static void BM_std_log(bm::State& state) { |
| 117 | + for (auto _ : state) { |
| 118 | + bm::DoNotOptimize(std::log(state.range(0))); |
| 119 | + } |
| 120 | + state.SetComplexityN(state.range(0)); |
| 121 | +} |
| 122 | +BENCHMARK(BM_std_log)->Arg(16)->Arg(256)->Arg(4096)->Arg(65536)->Complexity(); |
| 123 | + |
| 124 | +static void BM_ccm_log2(bm::State& state) { |
| 125 | + for (auto _ : state) { |
| 126 | + bm::DoNotOptimize(ccm::log2(state.range(0))); |
| 127 | + } |
| 128 | + state.SetComplexityN(state.range(0)); |
| 129 | +} |
| 130 | +BENCHMARK(BM_ccm_log2)->Arg(16)->Arg(256)->Arg(4096)->Arg(65536)->Complexity(); |
| 131 | + |
| 132 | +static void BM_std_log2(bm::State& state) { |
| 133 | + for (auto _ : state) { |
| 134 | + bm::DoNotOptimize(std::log2(state.range(0))); |
| 135 | + } |
| 136 | + state.SetComplexityN(state.range(0)); |
| 137 | +} |
| 138 | +BENCHMARK(BM_std_log2)->Arg(16)->Arg(256)->Arg(4096)->Arg(65536)->Complexity(); |
| 139 | + |
| 140 | +BENCHMARK_MAIN(); |
0 commit comments