platform_bionic/benchmarks/math_benchmark.cpp
Adhemerval Zanella ff5a353112 Add logf and log2f benchmark
Similar to expf/exp2f, this patch add two benchmarks for logf and log2f:
one which measures thoughput and one which measures latency.

The input data is based on a reduced trace based on 2.8 billion samples
extracted from specpu2017 521.wrf_r benchmark.

Test: ran 32-bit and 64-bit x86 tests on host
Change-Id: If4fbd7eb3d40f8e155935149a82f162b222d5506
2018-06-19 11:34:54 -03:00

350 lines
8.4 KiB
C++

/*
* Copyright (C) 2013 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <fenv.h>
#include <math.h>
#include <benchmark/benchmark.h>
#include "util.h"
static const double values[] = { 1234.0, nan(""), HUGE_VAL, 0.0 };
static const char* names[] = { "1234.0", "nan", "HUGE_VAL", "0.0" };
static void SetLabel(benchmark::State& state) {
state.SetLabel(names[state.range(0)]);
}
// Avoid optimization.
volatile double d;
volatile double v;
volatile float f;
static float zero = 0.0f;
static void BM_math_sqrt(benchmark::State& state) {
d = 0.0;
v = 2.0;
while (state.KeepRunning()) {
d += sqrt(v);
}
}
BIONIC_BENCHMARK(BM_math_sqrt);
static void BM_math_log10(benchmark::State& state) {
d = 0.0;
v = 1234.0;
while (state.KeepRunning()) {
d += log10(v);
}
}
BIONIC_BENCHMARK(BM_math_log10);
static void BM_math_logb(benchmark::State& state) {
d = 0.0;
v = 1234.0;
while (state.KeepRunning()) {
d += logb(v);
}
}
BIONIC_BENCHMARK(BM_math_logb);
static void BM_math_isfinite_macro(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += isfinite(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_isfinite_macro, "MATH_COMMON");
static void BM_math_isfinite(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += isfinite(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_isfinite, "MATH_COMMON");
static void BM_math_isinf_macro(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += isinf(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_isinf_macro, "MATH_COMMON");
static void BM_math_isinf(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += (isinf)(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_isinf, "MATH_COMMON");
static void BM_math_isnan_macro(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += isnan(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_isnan_macro, "MATH_COMMON");
static void BM_math_isnan(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += (isnan)(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_isnan, "MATH_COMMON");
static void BM_math_isnormal_macro(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += isnormal(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_isnormal_macro, "MATH_COMMON");
static void BM_math_isnormal(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += isnormal(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_isnormal, "MATH_COMMON");
static void BM_math_sin_fast(benchmark::State& state) {
d = 1.0;
while (state.KeepRunning()) {
d += sin(d);
}
}
BIONIC_BENCHMARK(BM_math_sin_fast);
static void BM_math_sin_feupdateenv(benchmark::State& state) {
d = 1.0;
while (state.KeepRunning()) {
fenv_t __libc_save_rm;
feholdexcept(&__libc_save_rm);
fesetround(FE_TONEAREST);
d += sin(d);
feupdateenv(&__libc_save_rm);
}
}
BIONIC_BENCHMARK(BM_math_sin_feupdateenv);
static void BM_math_sin_fesetenv(benchmark::State& state) {
d = 1.0;
while (state.KeepRunning()) {
fenv_t __libc_save_rm;
feholdexcept(&__libc_save_rm);
fesetround(FE_TONEAREST);
d += sin(d);
fesetenv(&__libc_save_rm);
}
}
BIONIC_BENCHMARK(BM_math_sin_fesetenv);
static void BM_math_fpclassify(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += fpclassify(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_fpclassify, "MATH_COMMON");
static void BM_math_signbit_macro(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += signbit(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_signbit_macro, "MATH_COMMON");
static void BM_math_signbit(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += signbit(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_signbit, "MATH_COMMON");
static void BM_math_fabs_macro(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += fabs(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_fabs_macro, "MATH_COMMON");
static void BM_math_fabs(benchmark::State& state) {
d = 0.0;
v = values[state.range(0)];
while (state.KeepRunning()) {
d += (fabs)(v);
}
SetLabel(state);
}
BIONIC_BENCHMARK_WITH_ARG(BM_math_fabs, "MATH_COMMON");
static void BM_math_sincos(benchmark::State& state) {
d = 1.0;
while (state.KeepRunning()) {
double s, c;
sincos(d, &s, &c);
d += s + c;
}
}
BIONIC_BENCHMARK(BM_math_sincos);
#include "expf_input.cpp"
static void BM_math_expf_speccpu2017(benchmark::State& state) {
f = 0.0;
auto cin = expf_input.cbegin();
for (auto _ : state) {
f = expf(*cin);
if (++cin == expf_input.cend())
cin = expf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_expf_speccpu2017);
static void BM_math_expf_speccpu2017_latency(benchmark::State& state) {
f = 0.0;
auto cin = expf_input.cbegin();
for (auto _ : state) {
f = expf(f * zero + *cin);
if (++cin == expf_input.cend())
cin = expf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_expf_speccpu2017_latency);
static void BM_math_exp2f_speccpu2017(benchmark::State& state) {
f = 0.0;
auto cin = expf_input.cbegin();
for (auto _ : state) {
f = exp2f(*cin);
if (++cin == expf_input.cend())
cin = expf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_exp2f_speccpu2017);
static void BM_math_exp2f_speccpu2017_latency(benchmark::State& state) {
f = 0.0;
auto cin = expf_input.cbegin();
for (auto _ : state) {
f = exp2f(f * zero + *cin);
if (++cin == expf_input.cend())
cin = expf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_exp2f_speccpu2017_latency);
#include "powf_input.cpp"
static void BM_math_powf_speccpu2006(benchmark::State& state) {
f = 0.0;
auto cin = powf_input.cbegin();
for (auto _ : state) {
f = powf(cin->first, cin->second);
if (++cin == powf_input.cend())
cin = powf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_powf_speccpu2006);
static void BM_math_powf_speccpu2017_latency(benchmark::State& state) {
f = 0.0;
auto cin = powf_input.cbegin();
for (auto _ : state) {
f = powf(f * zero + cin->first, cin->second);
if (++cin == powf_input.cend())
cin = powf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_powf_speccpu2017_latency);
#include "logf_input.cpp"
static void BM_math_logf_speccpu2017(benchmark::State& state) {
f = 0.0;
auto cin = logf_input.cbegin();
for (auto _ : state) {
f = logf(*cin);
if (++cin == logf_input.cend())
cin = logf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_logf_speccpu2017);
static void BM_math_logf_speccpu2017_latency(benchmark::State& state) {
f = 0.0;
auto cin = logf_input.cbegin();
for (auto _ : state) {
f = logf(f * zero + *cin);
if (++cin == logf_input.cend())
cin = logf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_logf_speccpu2017_latency);
static void BM_math_log2f_speccpu2017(benchmark::State& state) {
f = 0.0;
auto cin = logf_input.cbegin();
for (auto _ : state) {
f = log2f(*cin);
if (++cin == logf_input.cend())
cin = logf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_log2f_speccpu2017);
static void BM_math_log2f_speccpu2017_latency(benchmark::State& state) {
f = 0.0;
auto cin = logf_input.cbegin();
for (auto _ : state) {
f = log2f(f * zero + *cin);
if (++cin == logf_input.cend())
cin = logf_input.cbegin();
}
}
BIONIC_BENCHMARK(BM_math_log2f_speccpu2017_latency);