mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-26 21:56:04 +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.2 KiB
C++
41 lines
1.2 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 "common.h"
|
|
|
|
namespace {
|
|
template <class ValueType, class Order>
|
|
struct RangesPushHeap {
|
|
size_t Quantity;
|
|
|
|
void run(benchmark::State& state) const {
|
|
runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) {
|
|
for (auto I = Copy.begin(), E = Copy.end(); I != E; ++I) {
|
|
std::ranges::push_heap(Copy.begin(), I + 1);
|
|
}
|
|
});
|
|
}
|
|
|
|
bool skip() const { return Order() == ::Order::Heap; }
|
|
|
|
std::string name() const {
|
|
return "BM_RangesPushHeap" + ValueType::name() + Order::name() + "_" + std::to_string(Quantity);
|
|
};
|
|
};
|
|
} // namespace
|
|
|
|
int main(int argc, char** argv) {
|
|
benchmark::Initialize(&argc, argv);
|
|
if (benchmark::ReportUnrecognizedArguments(argc, argv))
|
|
return 1;
|
|
makeCartesianProductBenchmark<RangesPushHeap, AllValueTypes, AllOrders>(Quantities);
|
|
benchmark::RunSpecifiedBenchmarks();
|
|
}
|