mirror of
https://github.com/Retropex/bitcoin.git
synced 2025-06-02 23:42:33 +02:00
fa1e5de2db
-BEGIN VERIFY SCRIPT- # Move to directory mkdir src/common git mv src/bloom.cpp src/common/ git mv src/bloom.h src/common/ # Replace occurrences sed -i 's|\<bloom\.cpp\>|common/bloom.cpp|g' $(git grep -l 'bloom.cpp') sed -i 's|\<bloom\.h\>|common/bloom.h|g' $(git grep -l 'bloom.h') sed -i 's|BITCOIN_BLOOM_H|BITCOIN_COMMON_BLOOM_H|g' $(git grep -l 'BLOOM_H') -END VERIFY SCRIPT-
40 lines
1.0 KiB
C++
40 lines
1.0 KiB
C++
// Copyright (c) 2016-2020 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 <bench/bench.h>
|
|
#include <common/bloom.h>
|
|
|
|
static void RollingBloom(benchmark::Bench& bench)
|
|
{
|
|
CRollingBloomFilter filter(120000, 0.000001);
|
|
std::vector<unsigned char> data(32);
|
|
uint32_t count = 0;
|
|
bench.run([&] {
|
|
count++;
|
|
data[0] = count & 0xFF;
|
|
data[1] = (count >> 8) & 0xFF;
|
|
data[2] = (count >> 16) & 0xFF;
|
|
data[3] = (count >> 24) & 0xFF;
|
|
filter.insert(data);
|
|
|
|
data[0] = (count >> 24) & 0xFF;
|
|
data[1] = (count >> 16) & 0xFF;
|
|
data[2] = (count >> 8) & 0xFF;
|
|
data[3] = count & 0xFF;
|
|
filter.contains(data);
|
|
});
|
|
}
|
|
|
|
static void RollingBloomReset(benchmark::Bench& bench)
|
|
{
|
|
CRollingBloomFilter filter(120000, 0.000001);
|
|
bench.run([&] {
|
|
filter.reset();
|
|
});
|
|
}
|
|
|
|
BENCHMARK(RollingBloom);
|
|
BENCHMARK(RollingBloomReset);
|