mirror of
https://github.com/ElementsProject/elements.git
synced 2026-08-13 12:33:42 +02:00
00721e69f8
* inline performance critical code * Average runtime is specified and used to calculate iterations. * Console: show median of multiple runs * plot: show box plot * filter benchmarks * specify scaling factor * ignore src/test and src/bench in command line check script * number of iterations instead of time * Replaced runtime in BENCHMARK makro number of iterations. * Added -? to bench_bitcoin * Benchmark plotly.js URL, width, height can be customized * Fixed incorrect precision warning
32 lines
849 B
C++
32 lines
849 B
C++
// Copyright (c) 2016 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 <iostream>
|
|
|
|
#include <bench/bench.h>
|
|
#include <bloom.h>
|
|
|
|
static void RollingBloom(benchmark::State& state)
|
|
{
|
|
CRollingBloomFilter filter(120000, 0.000001);
|
|
std::vector<unsigned char> data(32);
|
|
uint32_t count = 0;
|
|
uint64_t match = 0;
|
|
while (state.KeepRunning()) {
|
|
count++;
|
|
data[0] = count;
|
|
data[1] = count >> 8;
|
|
data[2] = count >> 16;
|
|
data[3] = count >> 24;
|
|
filter.insert(data);
|
|
|
|
data[0] = count >> 24;
|
|
data[1] = count >> 16;
|
|
data[2] = count >> 8;
|
|
data[3] = count;
|
|
match += filter.contains(data);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(RollingBloom, 1500 * 1000);
|