Go to the documentation of this file.
2 #include "benchmark/benchmark.h"
4 #define BASIC_BENCHMARK_TEST(x) BENCHMARK(x)->Arg(8)->Arg(512)->Arg(8192)
16 for (
int x = 0;
x <
state.range(0); ++
x) {
25 for (
int i = 0;
i <
state.range(0); ++
i) {
29 for (
int i = 0;
i <
state.range(0); ++
i) {
40 for (
int i = 0;
i <
state.range(0); ++
i) {
44 for (
int i = 0;
i <
state.range(0); ++
i) {
65 for (
int i = 0;
i <
state.range(0); ++
i) {
69 for (
int i = 0;
i <
state.range(0); ++
i) {
77 for (
int i = 0;
i <
state.range(0); ++
i) {
81 for (
int i = 0;
i <
state.range(0); ++
i) {
85 for (
int i = 0;
i <
state.range(0); ++
i) {
102 assert(iter_count ==
state.iterations());
103 while (
state.KeepRunning()) {
106 assert(iter_count ==
state.iterations());
119 while (
state.KeepRunningBatch(batch_size)) {
120 iter_count += batch_size;
122 assert(
state.iterations() == iter_count);
126 assert(iter_count == batch_size
127 || iter_count > prior_iter_count);
128 prior_iter_count = iter_count;
141 assert(iter_count ==
state.max_iterations);
147 static_assert(std::is_same<
void BM_pause_during(benchmark::State &state)
void BM_empty(benchmark::State &state)
void BM_spin_pause_after(benchmark::State &state)
BENCHMARK_ALWAYS_INLINE void DoNotOptimize(Tp const &value)
void BM_RangedFor(benchmark::State &state)
void BM_spin_pause_before(benchmark::State &state)
void BM_KeepRunning(benchmark::State &state)
void BM_KeepRunningBatch(benchmark::State &state)
#define BASIC_BENCHMARK_TEST(x)
void BM_spin_pause_during(benchmark::State &state)
void BM_spin_empty(benchmark::State &state)
void BM_spin_pause_before_and_after(benchmark::State &state)
void BM_empty_stop_start(benchmark::State &state)
grpc
Author(s):
autogenerated on Fri May 16 2025 02:57:45