07a0e0fb31
We're currently running all the algorithms benchmarks for the `std` and `ranges` variants, even though almost all the algorithms share the same code. This makes running the benchmarks on a large set of commits very slow and costly. This reduced running the `algorithm/` subdirectory from ~4 hours to roughtly 2.5 hours. Fixes #175973
81 lines
2.7 KiB
C++
81 lines
2.7 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UNSUPPORTED: c++03, c++11, c++14, c++17
|
|
|
|
#include <algorithm>
|
|
#include <cstddef>
|
|
#include <deque>
|
|
#include <iterator>
|
|
#include <list>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include "benchmark/benchmark.h"
|
|
#include "../../GenerateInput.h"
|
|
#include "test_macros.h"
|
|
|
|
int main(int argc, char** argv) {
|
|
auto std_move = [](auto first, auto last, auto out) { return std::move(first, last, out); };
|
|
|
|
// {std,ranges}::move(normal container)
|
|
{
|
|
auto bm = []<class Container>(std::string name, auto move) {
|
|
benchmark::RegisterBenchmark(name, [move](auto& st) {
|
|
std::size_t const size = st.range(0);
|
|
using ValueType = typename Container::value_type;
|
|
Container c1(size);
|
|
Container c2(size);
|
|
std::generate_n(c1.begin(), size, [] { return Generate<ValueType>::random(); });
|
|
|
|
Container* in = &c1;
|
|
Container* out = &c2;
|
|
for ([[maybe_unused]] auto _ : st) {
|
|
benchmark::DoNotOptimize(in);
|
|
benchmark::DoNotOptimize(out);
|
|
auto result = move(in->begin(), in->end(), out->begin());
|
|
benchmark::DoNotOptimize(result);
|
|
std::swap(in, out);
|
|
}
|
|
})->Range(8, 1 << 20);
|
|
};
|
|
bm.operator()<std::vector<int>>("std::move(vector<int>)", std_move);
|
|
bm.operator()<std::deque<int>>("std::move(deque<int>)", std_move);
|
|
bm.operator()<std::list<int>>("std::move(list<int>)", std_move);
|
|
}
|
|
|
|
// {std,ranges}::move(vector<bool>)
|
|
{
|
|
auto bm = []<bool Aligned>(std::string name, auto move) {
|
|
benchmark::RegisterBenchmark(name, [move](auto& st) {
|
|
std::size_t const size = st.range(0);
|
|
std::vector<bool> c1(size, true);
|
|
std::vector<bool> c2(size, false);
|
|
|
|
std::vector<bool>* in = &c1;
|
|
std::vector<bool>* out = &c2;
|
|
for ([[maybe_unused]] auto _ : st) {
|
|
benchmark::DoNotOptimize(in);
|
|
benchmark::DoNotOptimize(out);
|
|
auto first = Aligned ? in->begin() : in->begin() + 4;
|
|
auto result = move(first, in->end(), out->begin());
|
|
benchmark::DoNotOptimize(result);
|
|
std::swap(in, out);
|
|
}
|
|
})->Range(64, 1 << 20);
|
|
};
|
|
bm.operator()<true>("std::move(vector<bool>) (aligned)", std_move);
|
|
bm.operator()<false>("std::move(vector<bool>) (unaligned)", std_move);
|
|
}
|
|
|
|
benchmark::Initialize(&argc, argv);
|
|
benchmark::RunSpecifiedBenchmarks();
|
|
benchmark::Shutdown();
|
|
return 0;
|
|
}
|