mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 02:33:06 +01:00
0f55045526
This patch pulls google/benchmark v1.4.1 into the LLVM tree so that any project could use it for benchmark generation. A dummy benchmark is added to `llvm/benchmarks/DummyYAML.cpp` to validate the correctness of the build process. The current version does not utilize LLVM LNT and LLVM CMake infrastructure, but that might be sufficient for most users. Two introduced CMake variables: * `LLVM_INCLUDE_BENCHMARKS` (`ON` by default) generates benchmark targets * `LLVM_BUILD_BENCHMARKS` (`OFF` by default) adds generated benchmark targets to the list of default LLVM targets (i.e. if `ON` benchmarks will be built upon standard build invocation, e.g. `ninja` or `make` with no specific targets) List of modifications: * `BENCHMARK_ENABLE_TESTING` is disabled * `BENCHMARK_ENABLE_EXCEPTIONS` is disabled * `BENCHMARK_ENABLE_INSTALL` is disabled * `BENCHMARK_ENABLE_GTEST_TESTS` is disabled * `BENCHMARK_DOWNLOAD_DEPENDENCIES` is disabled Original discussion can be found here: http://lists.llvm.org/pipermail/llvm-dev/2018-August/125023.html Reviewed by: dberris, lebedev.ri Subscribers: ilya-biryukov, ioeric, EricWF, lebedev.ri, srhines, dschuff, mgorny, krytarowski, fedor.sergeev, mgrang, jfb, llvm-commits Differential Revision: https://reviews.llvm.org/D50894 llvm-svn: 340809
66 lines
1.8 KiB
C++
66 lines
1.8 KiB
C++
#include "benchmark/benchmark.h"
|
|
#include <chrono>
|
|
#include <thread>
|
|
|
|
#if defined(NDEBUG)
|
|
#undef NDEBUG
|
|
#endif
|
|
#include <cassert>
|
|
|
|
void BM_basic(benchmark::State& state) {
|
|
for (auto _ : state) {
|
|
}
|
|
}
|
|
|
|
void BM_basic_slow(benchmark::State& state) {
|
|
std::chrono::milliseconds sleep_duration(state.range(0));
|
|
for (auto _ : state) {
|
|
std::this_thread::sleep_for(
|
|
std::chrono::duration_cast<std::chrono::nanoseconds>(sleep_duration));
|
|
}
|
|
}
|
|
|
|
BENCHMARK(BM_basic);
|
|
BENCHMARK(BM_basic)->Arg(42);
|
|
BENCHMARK(BM_basic_slow)->Arg(10)->Unit(benchmark::kNanosecond);
|
|
BENCHMARK(BM_basic_slow)->Arg(100)->Unit(benchmark::kMicrosecond);
|
|
BENCHMARK(BM_basic_slow)->Arg(1000)->Unit(benchmark::kMillisecond);
|
|
BENCHMARK(BM_basic)->Range(1, 8);
|
|
BENCHMARK(BM_basic)->RangeMultiplier(2)->Range(1, 8);
|
|
BENCHMARK(BM_basic)->DenseRange(10, 15);
|
|
BENCHMARK(BM_basic)->Args({42, 42});
|
|
BENCHMARK(BM_basic)->Ranges({{64, 512}, {64, 512}});
|
|
BENCHMARK(BM_basic)->MinTime(0.7);
|
|
BENCHMARK(BM_basic)->UseRealTime();
|
|
BENCHMARK(BM_basic)->ThreadRange(2, 4);
|
|
BENCHMARK(BM_basic)->ThreadPerCpu();
|
|
BENCHMARK(BM_basic)->Repetitions(3);
|
|
|
|
void CustomArgs(benchmark::internal::Benchmark* b) {
|
|
for (int i = 0; i < 10; ++i) {
|
|
b->Arg(i);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(BM_basic)->Apply(CustomArgs);
|
|
|
|
void BM_explicit_iteration_count(benchmark::State& state) {
|
|
// Test that benchmarks specified with an explicit iteration count are
|
|
// only run once.
|
|
static bool invoked_before = false;
|
|
assert(!invoked_before);
|
|
invoked_before = true;
|
|
|
|
// Test that the requested iteration count is respected.
|
|
assert(state.max_iterations == 42);
|
|
size_t actual_iterations = 0;
|
|
for (auto _ : state)
|
|
++actual_iterations;
|
|
assert(state.iterations() == state.max_iterations);
|
|
assert(state.iterations() == 42);
|
|
|
|
}
|
|
BENCHMARK(BM_explicit_iteration_count)->Iterations(42);
|
|
|
|
BENCHMARK_MAIN();
|