2018-01-02 14:12:05 -03:00
|
|
|
// Copyright (c) 2016-2017 The Bitcoin Core developers
|
2016-04-24 12:12:34 -03: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-09 21:57:53 -03:00
|
|
|
#include <bench/bench.h>
|
|
|
|
#include <bloom.h>
|
2016-04-24 12:12:34 -03:00
|
|
|
|
|
|
|
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;
|
2017-10-17 11:48:02 -03:00
|
|
|
filter.insert(data);
|
|
|
|
|
2016-04-24 12:12:34 -03:00
|
|
|
data[0] = count >> 24;
|
|
|
|
data[1] = count >> 16;
|
|
|
|
data[2] = count >> 8;
|
|
|
|
data[3] = count;
|
|
|
|
match += filter.contains(data);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-10-17 11:48:02 -03:00
|
|
|
BENCHMARK(RollingBloom, 1500 * 1000);
|