92020a042c
- 64db19b773134c6c8004e3b23c9ca892efbf8bae Move SpinLock's adaptive spin count computation from a st... by Derek Mauro <dmauro@google.com> - 6f9533fb44a52485a7c2bbb9b4efc7bf8d6c359a Import of CCTZ from GitHub. by Abseil Team <absl-team@google.com> - a211d7255c986e8dd4ceada362c0d054a6a1969a Cleanup exception flags by Abseil Team <absl-team@google.com> - babdb29c590126fe9bba5229fe91034b5b5c358a Release time benchmarks. by Alex Strelnikov <strel@google.com> - 5803b32a3ff123d1fb57a0c471d199c818357c9f Release memutil microbenchmarks. by Alex Strelnikov <strel@google.com> - 5357d4890d30e80c53beb05af32500fb20e9402b Add parens around expansion of ABSL_PREDICT_{FALSE,TRUE} ... by Abseil Team <absl-team@google.com> - 32023f61a239a5f6b1c59e577bfe81b179bbcd2d Reformat build rule tag. by Alex Strelnikov <strel@google.com> - 833758ecf2b0cf7a42bbd50b5b127e416425c168 Release uint128 microbenchmarks. by Alex Strelnikov <strel@google.com> - c115a9bca1f944b90fdc78a56b2de176466b124f Disambiguate bitwise-not of size_type by Abseil Team <absl-team@google.com> - f6905f5b5f6e425792de646edafde440548d9346 Updates ConstructorTracker and TrackedObjects with 1) a m... by Abseil Team <absl-team@google.com> - 147c553bdd5d2db20a38f75c4d1ef973d6c709c5 Changes the absl::Duration factory functions to disallow ... by Greg Miller <jgm@google.com> - dba2b96d11b5264546b283ba452f2de1303b0f07 White space fix by Alex Strelnikov <strel@google.com> GitOrigin-RevId: abacaab4b11a69dd4db627bd183571d7cabb8def Change-Id: I6fa34f20d0b2f898e7b5475a603111413bb80a67
361 lines
9.9 KiB
C++
361 lines
9.9 KiB
C++
// Copyright 2018 The Abseil Authors.
|
|
// 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 <cmath>
|
|
#include <cstddef>
|
|
#include <cstdint>
|
|
#include <ctime>
|
|
#include <string>
|
|
|
|
#include "absl/time/time.h"
|
|
#include "benchmark/benchmark.h"
|
|
|
|
namespace {
|
|
|
|
//
|
|
// Factory functions
|
|
//
|
|
|
|
void BM_Duration_Factory_Nanoseconds(benchmark::State& state) {
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::Nanoseconds(1));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Factory_Nanoseconds);
|
|
|
|
void BM_Duration_Factory_Microseconds(benchmark::State& state) {
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::Microseconds(1));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Factory_Microseconds);
|
|
|
|
void BM_Duration_Factory_Milliseconds(benchmark::State& state) {
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::Milliseconds(1));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Factory_Milliseconds);
|
|
|
|
void BM_Duration_Factory_Seconds(benchmark::State& state) {
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::Seconds(1));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Factory_Seconds);
|
|
|
|
void BM_Duration_Factory_Minutes(benchmark::State& state) {
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::Minutes(1));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Factory_Minutes);
|
|
|
|
void BM_Duration_Factory_Hours(benchmark::State& state) {
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::Hours(1));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Factory_Hours);
|
|
|
|
//
|
|
// Arithmetic
|
|
//
|
|
|
|
void BM_Duration_Addition(benchmark::State& state) {
|
|
absl::Duration d = absl::Nanoseconds(1);
|
|
absl::Duration step = absl::Milliseconds(1);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(d += step);
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Addition);
|
|
|
|
void BM_Duration_Subtraction(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(std::numeric_limits<int64_t>::max());
|
|
absl::Duration step = absl::Milliseconds(1);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(d -= step);
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Subtraction);
|
|
|
|
void BM_Duration_Multiplication_Fixed(benchmark::State& state) {
|
|
absl::Duration d = absl::Milliseconds(1);
|
|
absl::Duration s;
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(s += d * (i + 1));
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Multiplication_Fixed);
|
|
|
|
void BM_Duration_Multiplication_Double(benchmark::State& state) {
|
|
absl::Duration d = absl::Milliseconds(1);
|
|
absl::Duration s;
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(s += d * (i + 1.0));
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Multiplication_Double);
|
|
|
|
void BM_Duration_Division_Fixed(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(1);
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(d /= i + 1);
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Division_Fixed);
|
|
|
|
void BM_Duration_Division_Double(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(1);
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(d /= i + 1.0);
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_Division_Double);
|
|
|
|
void BM_Duration_FDivDuration_Nanoseconds(benchmark::State& state) {
|
|
double d = 1;
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(
|
|
d += absl::FDivDuration(absl::Milliseconds(i), absl::Nanoseconds(1)));
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_FDivDuration_Nanoseconds);
|
|
|
|
void BM_Duration_IDivDuration_Nanoseconds(benchmark::State& state) {
|
|
int64_t a = 1;
|
|
absl::Duration ignore;
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(a +=
|
|
absl::IDivDuration(absl::Nanoseconds(i),
|
|
absl::Nanoseconds(1), &ignore));
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_IDivDuration_Nanoseconds);
|
|
|
|
void BM_Duration_IDivDuration_Microseconds(benchmark::State& state) {
|
|
int64_t a = 1;
|
|
absl::Duration ignore;
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(a += absl::IDivDuration(absl::Microseconds(i),
|
|
absl::Microseconds(1),
|
|
&ignore));
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_IDivDuration_Microseconds);
|
|
|
|
void BM_Duration_IDivDuration_Milliseconds(benchmark::State& state) {
|
|
int64_t a = 1;
|
|
absl::Duration ignore;
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(a += absl::IDivDuration(absl::Milliseconds(i),
|
|
absl::Milliseconds(1),
|
|
&ignore));
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_IDivDuration_Milliseconds);
|
|
|
|
void BM_Duration_IDivDuration_Seconds(benchmark::State& state) {
|
|
int64_t a = 1;
|
|
absl::Duration ignore;
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(
|
|
a += absl::IDivDuration(absl::Seconds(i), absl::Seconds(1), &ignore));
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_IDivDuration_Seconds);
|
|
|
|
void BM_Duration_IDivDuration_Minutes(benchmark::State& state) {
|
|
int64_t a = 1;
|
|
absl::Duration ignore;
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(
|
|
a += absl::IDivDuration(absl::Minutes(i), absl::Minutes(1), &ignore));
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_IDivDuration_Minutes);
|
|
|
|
void BM_Duration_IDivDuration_Hours(benchmark::State& state) {
|
|
int64_t a = 1;
|
|
absl::Duration ignore;
|
|
int i = 0;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(
|
|
a += absl::IDivDuration(absl::Hours(i), absl::Hours(1), &ignore));
|
|
++i;
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_IDivDuration_Hours);
|
|
|
|
void BM_Duration_ToInt64Nanoseconds(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(100000);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::ToInt64Nanoseconds(d));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_ToInt64Nanoseconds);
|
|
|
|
void BM_Duration_ToInt64Microseconds(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(100000);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::ToInt64Microseconds(d));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_ToInt64Microseconds);
|
|
|
|
void BM_Duration_ToInt64Milliseconds(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(100000);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::ToInt64Milliseconds(d));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_ToInt64Milliseconds);
|
|
|
|
void BM_Duration_ToInt64Seconds(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(100000);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::ToInt64Seconds(d));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_ToInt64Seconds);
|
|
|
|
void BM_Duration_ToInt64Minutes(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(100000);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::ToInt64Minutes(d));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_ToInt64Minutes);
|
|
|
|
void BM_Duration_ToInt64Hours(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(100000);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::ToInt64Hours(d));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_ToInt64Hours);
|
|
|
|
//
|
|
// To/FromTimespec
|
|
//
|
|
|
|
void BM_Duration_ToTimespec_AbslTime(benchmark::State& state) {
|
|
absl::Duration d = absl::Seconds(1);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::ToTimespec(d));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_ToTimespec_AbslTime);
|
|
|
|
ABSL_ATTRIBUTE_NOINLINE timespec DoubleToTimespec(double seconds) {
|
|
timespec ts;
|
|
ts.tv_sec = seconds;
|
|
ts.tv_nsec = (seconds - ts.tv_sec) * (1000 * 1000 * 1000);
|
|
return ts;
|
|
}
|
|
|
|
void BM_Duration_ToTimespec_Double(benchmark::State& state) {
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(DoubleToTimespec(1.0));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_ToTimespec_Double);
|
|
|
|
void BM_Duration_FromTimespec_AbslTime(benchmark::State& state) {
|
|
timespec ts;
|
|
ts.tv_sec = 0;
|
|
ts.tv_nsec = 0;
|
|
while (state.KeepRunning()) {
|
|
if (++ts.tv_nsec == 1000 * 1000 * 1000) {
|
|
++ts.tv_sec;
|
|
ts.tv_nsec = 0;
|
|
}
|
|
benchmark::DoNotOptimize(absl::DurationFromTimespec(ts));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_FromTimespec_AbslTime);
|
|
|
|
ABSL_ATTRIBUTE_NOINLINE double TimespecToDouble(timespec ts) {
|
|
return ts.tv_sec + (ts.tv_nsec / (1000 * 1000 * 1000));
|
|
}
|
|
|
|
void BM_Duration_FromTimespec_Double(benchmark::State& state) {
|
|
timespec ts;
|
|
ts.tv_sec = 0;
|
|
ts.tv_nsec = 0;
|
|
while (state.KeepRunning()) {
|
|
if (++ts.tv_nsec == 1000 * 1000 * 1000) {
|
|
++ts.tv_sec;
|
|
ts.tv_nsec = 0;
|
|
}
|
|
benchmark::DoNotOptimize(TimespecToDouble(ts));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_FromTimespec_Double);
|
|
|
|
//
|
|
// String conversions
|
|
//
|
|
|
|
const char* const kDurations[] = {
|
|
"0", // 0
|
|
"123ns", // 1
|
|
"1h2m3s", // 2
|
|
"-2h3m4.005006007s", // 3
|
|
"2562047788015215h30m7.99999999975s", // 4
|
|
};
|
|
const int kNumDurations = sizeof(kDurations) / sizeof(kDurations[0]);
|
|
|
|
void BM_Duration_FormatDuration(benchmark::State& state) {
|
|
const std::string s = kDurations[state.range(0)];
|
|
state.SetLabel(s);
|
|
absl::Duration d;
|
|
absl::ParseDuration(kDurations[state.range(0)], &d);
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::FormatDuration(d));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_FormatDuration)->DenseRange(0, kNumDurations - 1);
|
|
|
|
void BM_Duration_ParseDuration(benchmark::State& state) {
|
|
const std::string s = kDurations[state.range(0)];
|
|
state.SetLabel(s);
|
|
absl::Duration d;
|
|
while (state.KeepRunning()) {
|
|
benchmark::DoNotOptimize(absl::ParseDuration(s, &d));
|
|
}
|
|
}
|
|
BENCHMARK(BM_Duration_ParseDuration)->DenseRange(0, kNumDurations - 1);
|
|
|
|
} // namespace
|