2018-07-27 00:36:45 +02:00
|
|
|
// Copyright (c) 2016-2018 The Bitcoin Core developers
|
2016-04-24 17:12:34 +02:00
|
|
|
// Distributed under the MIT software license, see the accompanying
|
|
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
|
|
|
|
#include <iostream>
|
|
|
|
|
2017-11-10 01:57:53 +01:00
|
|
|
#include <bench/bench.h>
|
|
|
|
#include <bloom.h>
|
2016-04-24 17:12:34 +02:00
|
|
|
|
|
|
|
static void RollingBloom(benchmark::State& state)
|
|
|
|
{
|
|
|
|
CRollingBloomFilter filter(120000, 0.000001);
|
|
|
|
std::vector<unsigned char> data(32);
|
|
|
|
uint32_t count = 0;
|
|
|
|
while (state.KeepRunning()) {
|
|
|
|
count++;
|
|
|
|
data[0] = count;
|
|
|
|
data[1] = count >> 8;
|
|
|
|
data[2] = count >> 16;
|
|
|
|
data[3] = count >> 24;
|
2017-10-17 16:48:02 +02:00
|
|
|
filter.insert(data);
|
|
|
|
|
2016-04-24 17:12:34 +02:00
|
|
|
data[0] = count >> 24;
|
|
|
|
data[1] = count >> 16;
|
|
|
|
data[2] = count >> 8;
|
|
|
|
data[3] = count;
|
2018-07-26 16:33:45 +02:00
|
|
|
filter.contains(data);
|
2016-04-24 17:12:34 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-10-17 16:48:02 +02:00
|
|
|
BENCHMARK(RollingBloom, 1500 * 1000);
|