Changeset View
Changeset View
Standalone View
Standalone View
src/bench/rollingbloom.cpp
// Copyright (c) 2016 The Bitcoin Core developers | // Copyright (c) 2016 The Bitcoin Core developers | ||||
// Distributed under the MIT software license, see the accompanying | // Distributed under the MIT software license, see the accompanying | ||||
// file COPYING or http://www.opensource.org/licenses/mit-license.php. | // file COPYING or http://www.opensource.org/licenses/mit-license.php. | ||||
#include <iostream> | #include <iostream> | ||||
#include <bench/bench.h> | #include <bench/bench.h> | ||||
#include <bloom.h> | #include <bloom.h> | ||||
static void RollingBloom(benchmark::State &state) { | static void RollingBloom(benchmark::State &state) { | ||||
CRollingBloomFilter filter(120000, 0.000001); | CRollingBloomFilter filter(120000, 0.000001); | ||||
std::vector<uint8_t> data(32); | std::vector<uint8_t> data(32); | ||||
uint32_t count = 0; | uint32_t count = 0; | ||||
uint64_t match = 0; | |||||
while (state.KeepRunning()) { | while (state.KeepRunning()) { | ||||
count++; | count++; | ||||
data[0] = count; | data[0] = count; | ||||
data[1] = count >> 8; | data[1] = count >> 8; | ||||
data[2] = count >> 16; | data[2] = count >> 16; | ||||
data[3] = count >> 24; | data[3] = count >> 24; | ||||
filter.insert(data); | filter.insert(data); | ||||
data[0] = count >> 24; | data[0] = count >> 24; | ||||
data[1] = count >> 16; | data[1] = count >> 16; | ||||
data[2] = count >> 8; | data[2] = count >> 8; | ||||
data[3] = count; | data[3] = count; | ||||
match += filter.contains(data); | filter.contains(data); | ||||
} | } | ||||
} | } | ||||
BENCHMARK(RollingBloom, 1500 * 1000); | BENCHMARK(RollingBloom, 1500 * 1000); |