Lines Matching full:benchmark
1 #include "benchmark/benchmark.h"
54 static void BM_Factorial(benchmark::State& state) {
62 BENCHMARK(BM_Factorial);
63 BENCHMARK(BM_Factorial)->UseRealTime();
65 static void BM_CalculatePiRange(benchmark::State& state) {
74 static void BM_CalculatePi(benchmark::State& state) {
77 benchmark::DoNotOptimize(CalculatePi(depth));
80 BENCHMARK(BM_CalculatePi)->Threads(8);
81 BENCHMARK(BM_CalculatePi)->ThreadRange(1, 32);
82 BENCHMARK(BM_CalculatePi)->ThreadPerCpu();
84 static void BM_SetInsert(benchmark::State& state) {
97 // non-timed part of each iteration will make the benchmark take forever.
98 BENCHMARK(BM_SetInsert)->Ranges({{1 << 10, 8 << 10}, {128, 512}});
102 static void BM_Sequential(benchmark::State& state) {
120 static void BM_StringCompare(benchmark::State& state) {
123 for (auto _ : state) benchmark::DoNotOptimize(s1.compare(s2));
125 BENCHMARK(BM_StringCompare)->Range(1, 1 << 20);
127 static void BM_SetupTeardown(benchmark::State& state) {
145 BENCHMARK(BM_SetupTeardown)->ThreadPerCpu();
147 static void BM_LongTest(benchmark::State& state) {
151 benchmark::DoNotOptimize(tracker += i);
154 BENCHMARK(BM_LongTest)->Range(1 << 16, 1 << 28);
156 static void BM_ParallelMemset(benchmark::State& state) {
170 benchmark::DoNotOptimize(test_vector->at(i) = 1);
178 BENCHMARK(BM_ParallelMemset)->Arg(10 << 20)->ThreadRange(1, 4);
180 static void BM_ManualTiming(benchmark::State& state) {
201 BENCHMARK(BM_ManualTiming)->Range(1, 1 << 14)->UseRealTime();
202 BENCHMARK(BM_ManualTiming)->Range(1, 1 << 14)->UseManualTime();
207 void BM_with_args(benchmark::State& state, Args&&...) {
215 void BM_non_template_args(benchmark::State& state, int, double) {
222 static void BM_DenseThreadRanges(benchmark::State& st) {
240 BENCHMARK(BM_DenseThreadRanges)->Arg(1)->DenseThreadRange(1, 3);
241 BENCHMARK(BM_DenseThreadRanges)->Arg(2)->DenseThreadRange(1, 4, 2);
242 BENCHMARK(BM_DenseThreadRanges)->Arg(3)->DenseThreadRange(5, 14, 3);
