Home
last modified time | relevance | path

Searched refs:BM_Complexity_O1 (Results 1 – 4 of 4) sorted by relevance

/external/google-benchmark/test/
Dcomplexity_test.cc55 void BM_Complexity_O1(benchmark::State& state) { in BM_Complexity_O1() function
63 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
64 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity();
65 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity([](int64_t) { in __anon2aab94050202()
Dreporter_output_test.cc239 void BM_Complexity_O1(benchmark::State& state) { in BM_Complexity_O1() function
244 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
/external/libcxx/utils/google-benchmark/test/
Dcomplexity_test.cc55 void BM_Complexity_O1(benchmark::State& state) { in BM_Complexity_O1() function
63 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
64 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity();
65 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity([](int64_t) { in __anon0c8aa21e0202()
Dreporter_output_test.cc239 void BM_Complexity_O1(benchmark::State& state) { in BM_Complexity_O1() function
244 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);