Page MenuHomePhabricator
Differential D1842 Diff 5193 src/bench/rollingbloom.cpp

Changeset View

Standalone View

View Options

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.h" #include "bench.h"
#include "bloom.h" #include "bloom.h"
#include "utiltime.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;
uint32_t nEntriesPerGeneration = (120000 + 1) / 2; uint32_t nEntriesPerGeneration = (120000 + 1) / 2;
uint32_t countnow = 0; uint32_t countnow = 0;
uint64_t match = 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;
if (countnow == nEntriesPerGeneration) { if (countnow == nEntriesPerGeneration) {
int64_t b = GetTimeMicros(); auto b = benchmark::clock::now();
filter.insert(data); filter.insert(data);
int64_t e = GetTimeMicros(); auto total = std::chrono::duration_cast<std::chrono::nanoseconds>(
std::cout << "RollingBloom-refresh,1," << (e - b) * 0.000001 << "," benchmark::clock::now() - b)
<< (e - b) * 0.000001 << "," << (e - b) * 0.000001 .count();
<< "\n"; std::cout << "RollingBloom-refresh,1," << total << "," << total
<< "," << total << "\n";
countnow = 0; countnow = 0;
} else { } else {
filter.insert(data); filter.insert(data);
} }
countnow++; countnow++;
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); match += filter.contains(data);
} }
} }
BENCHMARK(RollingBloom); BENCHMARK(RollingBloom);