mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-04-29 14:59:39 -04:00
ab2b67fce2
See https://en.cppreference.com/w/cpp/types/is_enum for more details. -BEGIN VERIFY SCRIPT- sed -i -E 's/(std::[a-z_]+)(<[^<>]+>)::value\b/\1_v\2/g' $(git grep -l '::value' ./src ':(exclude)src/bench/nanobench.h' ':(exclude)src/minisketch' ':(exclude)src/span.h') -END VERIFY SCRIPT-
128 lines
3.4 KiB
C++
128 lines
3.4 KiB
C++
// Copyright (c) 2015-2022 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include <prevector.h>
|
|
|
|
#include <bench/bench.h>
|
|
#include <serialize.h>
|
|
#include <streams.h>
|
|
|
|
#include <type_traits>
|
|
#include <vector>
|
|
|
|
struct nontrivial_t {
|
|
int x{-1};
|
|
nontrivial_t() = default;
|
|
SERIALIZE_METHODS(nontrivial_t, obj) { READWRITE(obj.x); }
|
|
};
|
|
static_assert(!std::is_trivially_default_constructible_v<nontrivial_t>,
|
|
"expected nontrivial_t to not be trivially constructible");
|
|
|
|
typedef unsigned char trivial_t;
|
|
static_assert(std::is_trivially_default_constructible_v<trivial_t>,
|
|
"expected trivial_t to be trivially constructible");
|
|
|
|
template <typename T>
|
|
static void PrevectorDestructor(benchmark::Bench& bench)
|
|
{
|
|
bench.batch(2).run([&] {
|
|
prevector<28, T> t0;
|
|
prevector<28, T> t1;
|
|
t0.resize(28);
|
|
t1.resize(29);
|
|
});
|
|
}
|
|
|
|
template <typename T>
|
|
static void PrevectorClear(benchmark::Bench& bench)
|
|
{
|
|
prevector<28, T> t0;
|
|
prevector<28, T> t1;
|
|
bench.batch(2).run([&] {
|
|
t0.resize(28);
|
|
t0.clear();
|
|
t1.resize(29);
|
|
t1.clear();
|
|
});
|
|
}
|
|
|
|
template <typename T>
|
|
static void PrevectorResize(benchmark::Bench& bench)
|
|
{
|
|
prevector<28, T> t0;
|
|
prevector<28, T> t1;
|
|
bench.batch(4).run([&] {
|
|
t0.resize(28);
|
|
t0.resize(0);
|
|
t1.resize(29);
|
|
t1.resize(0);
|
|
});
|
|
}
|
|
|
|
template <typename T>
|
|
static void PrevectorDeserialize(benchmark::Bench& bench)
|
|
{
|
|
DataStream s0{};
|
|
prevector<28, T> t0;
|
|
t0.resize(28);
|
|
for (auto x = 0; x < 900; ++x) {
|
|
s0 << t0;
|
|
}
|
|
t0.resize(100);
|
|
for (auto x = 0; x < 101; ++x) {
|
|
s0 << t0;
|
|
}
|
|
bench.batch(1000).run([&] {
|
|
prevector<28, T> t1;
|
|
for (auto x = 0; x < 1000; ++x) {
|
|
s0 >> t1;
|
|
}
|
|
s0.Rewind();
|
|
});
|
|
}
|
|
|
|
template <typename T>
|
|
static void PrevectorFillVectorDirect(benchmark::Bench& bench)
|
|
{
|
|
bench.run([&] {
|
|
std::vector<prevector<28, T>> vec;
|
|
vec.reserve(260);
|
|
for (size_t i = 0; i < 260; ++i) {
|
|
vec.emplace_back();
|
|
}
|
|
});
|
|
}
|
|
|
|
|
|
template <typename T>
|
|
static void PrevectorFillVectorIndirect(benchmark::Bench& bench)
|
|
{
|
|
bench.run([&] {
|
|
std::vector<prevector<28, T>> vec;
|
|
vec.reserve(260);
|
|
for (size_t i = 0; i < 260; ++i) {
|
|
// force allocation
|
|
vec.emplace_back(29, T{});
|
|
}
|
|
});
|
|
}
|
|
|
|
#define PREVECTOR_TEST(name) \
|
|
static void Prevector##name##Nontrivial(benchmark::Bench& bench) \
|
|
{ \
|
|
Prevector##name<nontrivial_t>(bench); \
|
|
} \
|
|
BENCHMARK(Prevector##name##Nontrivial, benchmark::PriorityLevel::HIGH); \
|
|
static void Prevector##name##Trivial(benchmark::Bench& bench) \
|
|
{ \
|
|
Prevector##name<trivial_t>(bench); \
|
|
} \
|
|
BENCHMARK(Prevector##name##Trivial, benchmark::PriorityLevel::HIGH);
|
|
|
|
PREVECTOR_TEST(Clear)
|
|
PREVECTOR_TEST(Destructor)
|
|
PREVECTOR_TEST(Resize)
|
|
PREVECTOR_TEST(Deserialize)
|
|
PREVECTOR_TEST(FillVectorDirect)
|
|
PREVECTOR_TEST(FillVectorIndirect)
|