blob: bdb151133e825ca6831f004838d7f1c2779f2525 [file] [log] [blame]
Marat Dukhan346a9e52019-11-15 09:06:30 -08001// Copyright 2019 Google LLC
2//
3// This source code is licensed under the BSD-style license found in the
4// LICENSE file in the root directory of this source tree.
5
6#include <algorithm>
7#include <cfloat>
8#include <cmath>
9#include <functional>
10#include <random>
11#include <vector>
12
13#include <benchmark/benchmark.h>
14#include <fp16/fp16.h>
15
16#include <xnnpack/AlignedAllocator.h>
17#include <xnnpack/common.h>
18#include <xnnpack/math-stubs.h>
19
20
21static void SigmoidError(benchmark::State& state,
22 xnn_f32_unary_math_function sigmoid,
23 size_t tile_size)
24{
25 // The smallest x for which sigmoidf(x) is normalized (-0x1.5D589Ep+6f).
26 const uint32_t min_input = 0xC2AEAC4F;
27 // The largest x for which sigmoidf(x) is not 1.0f (0x1.154244p+4f).
28 const uint32_t max_input = 0x418AA122;
29 // Number of tiles in one block of inputs/outputs. Combining multiple tiles in a block reduce function call overhead.
30 const size_t num_tiles = 100;
31
32 double max_ulp_error = 0.0;
33 std::vector<float, AlignedAllocator<float, 64>> x(tile_size * num_tiles);
34 std::vector<float, AlignedAllocator<float, 64>> y(tile_size * num_tiles);
35 for (auto _ : state) {
36 for (uint32_t n = min_input; int32_t(n) < 0; n -= tile_size * num_tiles) {
37 for (uint32_t i = 0; i < tile_size * num_tiles; i++) {
38 x[i] = fp32_from_bits(std::max<uint32_t>(n - i, 0x80000000));
39 }
40 std::fill(y.begin(), y.end(), std::nanf(""));
41
42 sigmoid(tile_size * num_tiles * sizeof(float), x.data(), y.data());
43
44 for (uint32_t i = 0; i < tile_size * num_tiles; i++) {
45 const double e_ref = std::exp(double(x[i]));
46 const double y_ref = e_ref / (e_ref + 1.0);
47 const double abs_error = std::abs(y_ref - double(y[i]));
48 const float y_abs = std::abs(y_ref);
49 const float y_ulp = fp32_from_bits(fp32_to_bits(y_abs) + 1) - y_abs;
50 max_ulp_error = std::max<double>(max_ulp_error, abs_error / y_ulp);
51 }
52 }
53 for (uint32_t n = 0; n < max_input; n += tile_size * num_tiles) {
54 for (uint32_t i = 0; i < tile_size * num_tiles; i++) {
55 x[i] = fp32_from_bits(std::min<uint32_t>(n + i, max_input));
56 }
57 std::fill(y.begin(), y.end(), std::nanf(""));
58
59 sigmoid(tile_size * num_tiles * sizeof(float), x.data(), y.data());
60
61 for (uint32_t i = 0; i < tile_size * num_tiles; i++) {
62 const double y_ref = 1.0 / (1.0 + std::exp(-double(x[i])));
63 const double abs_error = std::abs(y_ref - double(y[i]));
64 const float y_abs = std::abs(y_ref);
65 const float y_ulp = fp32_from_bits(fp32_to_bits(y_abs) + 1) - y_abs;
66 max_ulp_error = std::max<double>(max_ulp_error, abs_error / y_ulp);
67 }
68 }
69 }
70
71 state.counters["ULPERROR"] = benchmark::Counter(max_ulp_error);
72}
73
74#if XNN_ARCH_ARM || XNN_ARCH_ARM64
Marat Dukhan8d3c07e2020-01-02 01:20:59 -080075 static void f32_sigmoid__neon_lut2048_p1_nr2recps(benchmark::State& state) {
76 SigmoidError(state, xnn_math_f32_sigmoid__neon_lut2048_p1_nr2recps, 4);
Marat Dukhan91f8d862019-11-27 12:25:42 -080077 }
78 static void f32_sigmoid__neonfma_lut2048_p1_nr2recps(benchmark::State& state) {
79 SigmoidError(state, xnn_math_f32_sigmoid__neonfma_lut2048_p1_nr2recps, 4);
80 }
Marat Dukhan8d3c07e2020-01-02 01:20:59 -080081 static void f32_sigmoid__neonfma_lut2048_p1_nr1recps1fma(benchmark::State& state) {
82 SigmoidError(state, xnn_math_f32_sigmoid__neonfma_lut2048_p1_nr1recps1fma, 4);
83 }
Marat Dukhan91f8d862019-11-27 12:25:42 -080084 static void f32_sigmoid__neonfma_lut2048_p1_nr2fma(benchmark::State& state) {
85 SigmoidError(state, xnn_math_f32_sigmoid__neonfma_lut2048_p1_nr2fma, 4);
86 }
87
Marat Dukhan8d3c07e2020-01-02 01:20:59 -080088 static void f32_sigmoid__neon_p5_nr2recps(benchmark::State& state) {
89 SigmoidError(state, xnn_math_f32_sigmoid__neon_p5_nr2recps, 4);
Marat Dukhan22aae132019-11-22 17:10:29 -080090 }
Marat Dukhan22aae132019-11-22 17:10:29 -080091 static void f32_sigmoid__neonfma_p5_nr2recps(benchmark::State& state) {
92 SigmoidError(state, xnn_math_f32_sigmoid__neonfma_p5_nr2recps, 4);
93 }
Marat Dukhan8d3c07e2020-01-02 01:20:59 -080094 static void f32_sigmoid__neonfma_p5_nr1recps1fma(benchmark::State& state) {
95 SigmoidError(state, xnn_math_f32_sigmoid__neonfma_p5_nr1recps1fma, 4);
96 }
Marat Dukhan80bafd22019-11-18 10:16:01 -080097 static void f32_sigmoid__neonfma_p5_nr2fma(benchmark::State& state) {
98 SigmoidError(state, xnn_math_f32_sigmoid__neonfma_p5_nr2fma, 4);
Marat Dukhan346a9e52019-11-15 09:06:30 -080099 }
100
Marat Dukhan8d3c07e2020-01-02 01:20:59 -0800101 BENCHMARK(f32_sigmoid__neon_lut2048_p1_nr2recps)->Unit(benchmark::kMillisecond)->Iterations(1);
Marat Dukhan91f8d862019-11-27 12:25:42 -0800102 BENCHMARK(f32_sigmoid__neonfma_lut2048_p1_nr2recps)->Unit(benchmark::kMillisecond)->Iterations(1);
Marat Dukhan8d3c07e2020-01-02 01:20:59 -0800103 BENCHMARK(f32_sigmoid__neonfma_lut2048_p1_nr1recps1fma)->Unit(benchmark::kMillisecond)->Iterations(1);
Marat Dukhan91f8d862019-11-27 12:25:42 -0800104 BENCHMARK(f32_sigmoid__neonfma_lut2048_p1_nr2fma)->Unit(benchmark::kMillisecond)->Iterations(1);
105
Marat Dukhan8d3c07e2020-01-02 01:20:59 -0800106 BENCHMARK(f32_sigmoid__neon_p5_nr2recps)->Unit(benchmark::kMillisecond)->Iterations(1);
Marat Dukhan22aae132019-11-22 17:10:29 -0800107 BENCHMARK(f32_sigmoid__neonfma_p5_nr2recps)->Unit(benchmark::kMillisecond)->Iterations(1);
Marat Dukhan8d3c07e2020-01-02 01:20:59 -0800108 BENCHMARK(f32_sigmoid__neonfma_p5_nr1recps1fma)->Unit(benchmark::kMillisecond)->Iterations(1);
Marat Dukhan80bafd22019-11-18 10:16:01 -0800109 BENCHMARK(f32_sigmoid__neonfma_p5_nr2fma)->Unit(benchmark::kMillisecond)->Iterations(1);
Marat Dukhan346a9e52019-11-15 09:06:30 -0800110#endif // XNN_ARCH_ARM || XNN_ARCH_ARM64
111
Marat Dukhan22aae132019-11-22 17:10:29 -0800112#if XNN_ARCH_ARM64
Marat Dukhan91f8d862019-11-27 12:25:42 -0800113 static void f32_sigmoid__neonfma_lut2048_p1_div(benchmark::State& state) {
114 SigmoidError(state, xnn_math_f32_sigmoid__neonfma_lut2048_p1_div, 4);
115 }
Marat Dukhan22aae132019-11-22 17:10:29 -0800116 static void f32_sigmoid__neonfma_p5_div(benchmark::State& state) {
117 SigmoidError(state, xnn_math_f32_sigmoid__neonfma_p5_div, 4);
118 }
119
Marat Dukhan91f8d862019-11-27 12:25:42 -0800120 BENCHMARK(f32_sigmoid__neonfma_lut2048_p1_div)->Unit(benchmark::kMillisecond)->Iterations(1);
Marat Dukhan22aae132019-11-22 17:10:29 -0800121 BENCHMARK(f32_sigmoid__neonfma_p5_div)->Unit(benchmark::kMillisecond)->Iterations(1);
122#endif // XNN_ARCH_ARM64
123
Marat Dukhan80bafd22019-11-18 10:16:01 -0800124#if XNN_ARCH_X86 || XNN_ARCH_X86_64
125 static void f32_sigmoid__sse2_p5_div(benchmark::State& state) {
126 SigmoidError(state, xnn_math_f32_sigmoid__sse2_p5_div, 4);
127 }
128
129 BENCHMARK(f32_sigmoid__sse2_p5_div)->Unit(benchmark::kMillisecond)->Iterations(1);
130#endif // XNN_ARCH_X86 || XNN_ARCH_X86_64
131
Marat Dukhan8d3c07e2020-01-02 01:20:59 -0800132#if !XNN_ARCH_WASM && !XNN_ARCH_ASMJS
133 static void f32_sigmoid__psimd_p5_div(benchmark::State& state) {
134 SigmoidError(state, xnn_math_f32_sigmoid__psimd_p5_div, 4);
135 }
136
137 BENCHMARK(f32_sigmoid__psimd_p5_div)->Unit(benchmark::kMillisecond)->Iterations(1);
138#endif // !XNN_ARCH_WASM && !XNN_ARCH_ASMJS
139
Marat Dukhan5739f702019-12-22 19:45:09 -0800140static void f32_sigmoid__scalar_lut2048_p1_div(benchmark::State& state) {
141 SigmoidError(state, xnn_math_f32_sigmoid__scalar_lut2048_p1_div, 1);
142}
143static void f32_sigmoid__scalar_lut64_p2_div(benchmark::State& state) {
144 SigmoidError(state, xnn_math_f32_sigmoid__scalar_lut64_p2_div, 1);
145}
146static void f32_sigmoid__scalar_p5_div(benchmark::State& state) {
147 SigmoidError(state, xnn_math_f32_sigmoid__scalar_p5_div, 1);
148}
149
150BENCHMARK(f32_sigmoid__scalar_lut2048_p1_div)->Unit(benchmark::kMillisecond)->Iterations(1);
151BENCHMARK(f32_sigmoid__scalar_lut64_p2_div)->Unit(benchmark::kMillisecond)->Iterations(1);
152BENCHMARK(f32_sigmoid__scalar_p5_div)->Unit(benchmark::kMillisecond)->Iterations(1);
153
Marat Dukhan346a9e52019-11-15 09:06:30 -0800154#ifndef XNNPACK_BENCHMARK_NO_MAIN
155BENCHMARK_MAIN();
156#endif