Lines Matching refs:benchmark
1 #include "benchmark/benchmark.h"
10 void BM_PathConstructString(benchmark::State &st, GenInputs gen) {
16 benchmark::DoNotOptimize(PP.native().data());
19 benchmark::DoNotOptimize(P.native().data());
28 void BM_PathConstructCStr(benchmark::State &st, GenInputs gen) {
34 benchmark::DoNotOptimize(PP.native().data());
37 benchmark::DoNotOptimize(P.native().data());
45 void BM_PathConstructIter(benchmark::State &st, GenInputs gen) {
54 benchmark::DoNotOptimize(PP.native().data());
55 benchmark::DoNotOptimize(Start);
56 benchmark::DoNotOptimize(End);
59 benchmark::DoNotOptimize(P.native().data());
64 void BM_PathConstructInputIter(benchmark::State &st, GenInputs gen) {
68 void BM_PathConstructForwardIter(benchmark::State &st, GenInputs gen) {
78 void BM_PathIterateMultipleTimes(benchmark::State &st, GenInputs gen) {
84 benchmark::DoNotOptimize(PP.native().data());
87 benchmark::DoNotOptimize(E.native().data());
89 benchmark::ClobberMemory();
98 void BM_PathIterateOnce(benchmark::State &st, GenInputs gen) {
104 benchmark::DoNotOptimize(PP.native().data());
108 benchmark::DoNotOptimize(E.native().data());
110 benchmark::ClobberMemory();
118 void BM_PathIterateOnceBackwards(benchmark::State &st, GenInputs gen) {
124 benchmark::DoNotOptimize(PP.native().data());
131 benchmark::DoNotOptimize(*I);
133 benchmark::DoNotOptimize(*I);
149 void BM_LexicallyNormal(benchmark::State &st, GenInput gen, size_t PathLen) {
152 benchmark::DoNotOptimize(&In);
154 benchmark::DoNotOptimize(In.lexically_normal());