mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-30 12:36:06 +00:00
78b4b5cccb
This is an intermediate and fairly mechanical step towards unifying the benchmarks with the rest of the test suite. Moving this around requires a few changes, notably making sure we don't throw a wrench into the discovery process of the normal test suite. This won't be a problem anymore once benchmarks are taken into account by the test setup out of the box.
41 lines
1.3 KiB
C++
41 lines
1.3 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include <algorithm>
|
|
#include <numeric>
|
|
#include <random>
|
|
#include <vector>
|
|
|
|
#include "common.h"
|
|
|
|
namespace {
|
|
template <class ValueType>
|
|
struct LowerBound {
|
|
size_t Quantity;
|
|
|
|
mutable std::mt19937_64 rng{std::random_device{}()};
|
|
|
|
void run(benchmark::State& state) const {
|
|
runOpOnCopies<ValueType>(state, Quantity, Order::Ascending, BatchSize::CountBatch, [&](auto& Copy) {
|
|
auto result = std::lower_bound(Copy.begin(), Copy.end(), Copy[rng() % Copy.size()]);
|
|
benchmark::DoNotOptimize(result);
|
|
});
|
|
}
|
|
|
|
std::string name() const { return "BM_LowerBound" + ValueType::name() + "_" + std::to_string(Quantity); }
|
|
};
|
|
} // namespace
|
|
|
|
int main(int argc, char** argv) {
|
|
benchmark::Initialize(&argc, argv);
|
|
if (benchmark::ReportUnrecognizedArguments(argc, argv))
|
|
return 1;
|
|
makeCartesianProductBenchmark<LowerBound, AllValueTypes>(Quantities);
|
|
benchmark::RunSpecifiedBenchmarks();
|
|
}
|