mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-26 21:56:04 +00:00

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.
36 lines
1.1 KiB
C++
36 lines
1.1 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 <benchmark/benchmark.h>
|
|
#include <cstring>
|
|
#include <random>
|
|
#include <vector>
|
|
|
|
static void bm_vector_bool_count(benchmark::State& state) {
|
|
std::vector<bool> vec1(state.range(), false);
|
|
|
|
for (auto _ : state) {
|
|
benchmark::DoNotOptimize(vec1);
|
|
benchmark::DoNotOptimize(std::count(vec1.begin(), vec1.end(), true));
|
|
}
|
|
}
|
|
BENCHMARK(bm_vector_bool_count)->DenseRange(1, 8)->Range(16, 1 << 20);
|
|
|
|
static void bm_vector_bool_ranges_count(benchmark::State& state) {
|
|
std::vector<bool> vec1(state.range(), false);
|
|
|
|
for (auto _ : state) {
|
|
benchmark::DoNotOptimize(vec1);
|
|
benchmark::DoNotOptimize(std::ranges::count(vec1.begin(), vec1.end(), true));
|
|
}
|
|
}
|
|
BENCHMARK(bm_vector_bool_ranges_count)->DenseRange(1, 8)->Range(16, 1 << 20);
|
|
|
|
BENCHMARK_MAIN();
|