Bitcoin ABC 0.32.4
P2P Digital Currency
checkqueue.cpp
Go to the documentation of this file.
1// Copyright (c) 2015 The Bitcoin Core developers
2// Distributed under the MIT software license, see the accompanying
3// file COPYING or http://www.opensource.org/licenses/mit-license.php.
4
5#include <bench/bench.h>
6#include <checkqueue.h>
7#include <common/system.h>
8#include <key.h>
9#include <prevector.h>
10#include <pubkey.h>
11#include <random.h>
12#include <script/script.h>
13
14#include <vector>
15
16static const int MIN_CORES = 2;
17static const size_t BATCHES = 101;
18static const size_t BATCH_SIZE = 30;
19static const size_t QUEUE_BATCH_SIZE = 128;
20// This Benchmark tests the CheckQueue with a slightly realistic workload, where
21// checks all contain a prevector that is indirect 50% of the time and there is
22// a little bit of work done between calls to Add.
24 const ECCVerifyHandle verify_handle;
25 ECC_Start();
26
27 struct PrevectorJob {
29 explicit PrevectorJob(FastRandomContext &insecure_rand) {
30 p.resize(insecure_rand.randrange(CScriptBase::STATIC_SIZE * 2));
31 }
32 std::optional<int> operator()() { return std::nullopt; }
33 };
35 queue.StartWorkerThreads(std::max(MIN_CORES, GetNumCores()));
36
37 // create all the data once, then submit copies in the benchmark.
38 FastRandomContext insecure_rand(true);
39 std::vector<std::vector<PrevectorJob>> vBatches(BATCHES);
40 for (auto &vChecks : vBatches) {
41 vChecks.reserve(BATCH_SIZE);
42 for (size_t x = 0; x < BATCH_SIZE; ++x) {
43 vChecks.emplace_back(insecure_rand);
44 }
45 }
46
47 bench.minEpochIterations(10)
49 .unit("job")
50 .run([&] {
51 // Make insecure_rand here so that each iteration is identical.
53 std::vector<std::vector<PrevectorJob>> vBatches(BATCHES);
54 for (auto &vChecks : vBatches) {
55 control.Add(std::move(vChecks));
56 }
57 // control waits for completion by RAII, but it is done explicitly
58 // here for clarity
59 control.Complete();
60 });
61 queue.StopWorkerThreads();
62 ECC_Stop();
63}
BENCHMARK(CCheckQueueSpeedPrevectorJob)
static const int MIN_CORES
Definition: checkqueue.cpp:16
static const size_t BATCH_SIZE
Definition: checkqueue.cpp:18
static void CCheckQueueSpeedPrevectorJob(benchmark::Bench &bench)
Definition: checkqueue.cpp:23
static const size_t BATCHES
Definition: checkqueue.cpp:17
static const size_t QUEUE_BATCH_SIZE
Definition: checkqueue.cpp:19
RAII-style controller object for a CCheckQueue that guarantees the passed queue is finished before co...
Definition: checkqueue.h:216
std::optional< R > Complete()
Definition: checkqueue.h:233
void Add(std::vector< T > &&vChecks)
Definition: checkqueue.h:242
The verifications are represented by a type T, which must provide an operator(), returning an std::op...
Definition: checkqueue.h:32
Users of this module must hold an ECCVerifyHandle.
Definition: pubkey.h:223
Fast randomness source.
Definition: random.h:156
uint64_t randrange(uint64_t range) noexcept
Generate a random integer in the range [0..range).
Definition: random.h:220
Main entry point to nanobench's benchmarking facility.
Definition: nanobench.h:616
ANKERL_NANOBENCH(NODISCARD) std Bench & batch(T b) noexcept
Sets the batch size.
Bench & run(char const *benchmarkName, Op &&op)
Repeatedly calls op() based on the configuration, and performs measurements.
Definition: nanobench.h:1183
Bench & unit(char const *unit)
Sets the operation unit.
ANKERL_NANOBENCH(NODISCARD) std Bench & minEpochIterations(uint64_t numIters) noexcept
Sets the minimum number of iterations each epoch should take.
Implements a drop-in replacement for std::vector<T> which stores up to N elements directly (without h...
Definition: prevector.h:38
static constexpr unsigned int STATIC_SIZE
Definition: prevector.h:40
void resize(size_type new_size)
Definition: prevector.h:426
void ECC_Start()
Initialize the elliptic curve support.
Definition: key.cpp:434
void ECC_Stop()
Deinitialize the elliptic curve support.
Definition: key.cpp:451
int GetNumCores()
Return the number of cores available on the current system.
Definition: system.cpp:112