Bitcoin Core 31.0.0
P2P Digital Currency
Loading...
Searching...
No Matches
cuckoocache.cpp
Go to the documentation of this file.
1// Copyright (c) 2020-present The Bitcoin Core developers
2// Distributed under the MIT software license, see the accompanying
3// file COPYING or http://www.opensource.org/licenses/mit-license.php.
4
5#include <cuckoocache.h>
6#include <script/sigcache.h>
8#include <test/fuzz/fuzz.h>
9#include <test/fuzz/util.h>
11
12#include <cstdint>
13#include <string>
14#include <vector>
15
16namespace {
17FuzzedDataProvider* fuzzed_data_provider_ptr = nullptr;
18
19struct RandomHasher {
20 template <uint8_t>
21 uint32_t operator()(const bool& /* unused */) const
22 {
23 assert(fuzzed_data_provider_ptr != nullptr);
24 return fuzzed_data_provider_ptr->ConsumeIntegral<uint32_t>();
25 }
26};
27} // namespace
28
29FUZZ_TARGET(cuckoocache)
30{
31 FuzzedDataProvider fuzzed_data_provider(buffer.data(), buffer.size());
32 fuzzed_data_provider_ptr = &fuzzed_data_provider;
34 if (fuzzed_data_provider.ConsumeBool()) {
35 const size_t megabytes = fuzzed_data_provider.ConsumeIntegralInRange<size_t>(0, 16);
36 cuckoo_cache.setup_bytes(megabytes << 20);
37 } else {
38 cuckoo_cache.setup(fuzzed_data_provider.ConsumeIntegralInRange<uint32_t>(0, 4096));
39 }
40 LIMITED_WHILE(fuzzed_data_provider.ConsumeBool(), 10000) {
41 if (fuzzed_data_provider.ConsumeBool()) {
42 cuckoo_cache.insert(fuzzed_data_provider.ConsumeBool());
43 } else {
44 auto e = fuzzed_data_provider.ConsumeBool();
45 auto erase = fuzzed_data_provider.ConsumeBool();
46 cuckoo_cache.contains(e, erase);
47 }
48 }
49 fuzzed_data_provider_ptr = nullptr;
50}
cache implements a cache with properties similar to a cuckoo-set.
std::pair< uint32_t, size_t > setup_bytes(size_t bytes)
setup_bytes is a convenience function which accounts for internal memory usage when deciding how many...
uint32_t setup(uint32_t new_size)
setup initializes the container to store no more than new_size elements and no less than 2 elements.
void insert(Element e)
insert loops at most depth_limit times trying to insert a hash at various locations in the table via ...
bool contains(const Element &e, const bool erase) const
contains iterates through the hash locations for a given element and checks to see if it is present.
T ConsumeIntegralInRange(T min, T max)
#define FUZZ_TARGET(...)
Definition fuzz.h:35
#define LIMITED_WHILE(condition, limit)
Can be used to limit a theoretically unbounded loop.
Definition fuzz.h:22
assert(!tx.IsCoinBase())