Branch data Line data Source code
1 : : // Copyright (c) 2018-2022 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 <map>
6 : :
7 : : #include <clientversion.h>
8 : : #include <common/args.h>
9 : : #include <dbwrapper.h>
10 : : #include <hash.h>
11 : : #include <index/blockfilterindex.h>
12 : : #include <logging.h>
13 : : #include <node/blockstorage.h>
14 : : #include <undo.h>
15 : : #include <util/fs_helpers.h>
16 : : #include <util/syserror.h>
17 : :
18 : : /* The index database stores three items for each block: the disk location of the encoded filter,
19 : : * its dSHA256 hash, and the header. Those belonging to blocks on the active chain are indexed by
20 : : * height, and those belonging to blocks that have been reorganized out of the active chain are
21 : : * indexed by block hash. This ensures that filter data for any block that becomes part of the
22 : : * active chain can always be retrieved, alleviating timing concerns.
23 : : *
24 : : * The filters themselves are stored in flat files and referenced by the LevelDB entries. This
25 : : * minimizes the amount of data written to LevelDB and keeps the database values constant size. The
26 : : * disk location of the next block filter to be written (represented as a FlatFilePos) is stored
27 : : * under the DB_FILTER_POS key.
28 : : *
29 : : * Keys for the height index have the type [DB_BLOCK_HEIGHT, uint32 (BE)]. The height is represented
30 : : * as big-endian so that sequential reads of filters by height are fast.
31 : : * Keys for the hash index have the type [DB_BLOCK_HASH, uint256].
32 : : */
33 : : constexpr uint8_t DB_BLOCK_HASH{'s'};
34 : : constexpr uint8_t DB_BLOCK_HEIGHT{'t'};
35 : : constexpr uint8_t DB_FILTER_POS{'P'};
36 : :
37 : : constexpr unsigned int MAX_FLTR_FILE_SIZE = 0x1000000; // 16 MiB
38 : : /** The pre-allocation chunk size for fltr?????.dat files */
39 : : constexpr unsigned int FLTR_FILE_CHUNK_SIZE = 0x100000; // 1 MiB
40 : : /** Maximum size of the cfheaders cache
41 : : * We have a limit to prevent a bug in filling this cache
42 : : * potentially turning into an OOM. At 2000 entries, this cache
43 : : * is big enough for a 2,000,000 length block chain, which
44 : : * we should be enough until ~2047. */
45 : : constexpr size_t CF_HEADERS_CACHE_MAX_SZ{2000};
46 : :
47 : : namespace {
48 : :
49 : 0 : struct DBVal {
50 : : uint256 hash;
51 : : uint256 header;
52 : : FlatFilePos pos;
53 : :
54 : 0 : SERIALIZE_METHODS(DBVal, obj) { READWRITE(obj.hash, obj.header, obj.pos); }
55 : : };
56 : :
57 : : struct DBHeightKey {
58 : : int height;
59 : :
60 [ # # ]: 0 : explicit DBHeightKey(int height_in) : height(height_in) {}
61 : :
62 : : template<typename Stream>
63 : 0 : void Serialize(Stream& s) const
64 : : {
65 : 0 : ser_writedata8(s, DB_BLOCK_HEIGHT);
66 : 0 : ser_writedata32be(s, height);
67 : 0 : }
68 : :
69 : : template<typename Stream>
70 : 0 : void Unserialize(Stream& s)
71 : : {
72 : 0 : const uint8_t prefix{ser_readdata8(s)};
73 [ # # ]: 0 : if (prefix != DB_BLOCK_HEIGHT) {
74 [ # # ]: 0 : throw std::ios_base::failure("Invalid format for block filter index DB height key");
75 : : }
76 : 0 : height = ser_readdata32be(s);
77 : 0 : }
78 : : };
79 : :
80 : : struct DBHashKey {
81 : : uint256 hash;
82 : :
83 [ # # ]: 0 : explicit DBHashKey(const uint256& hash_in) : hash(hash_in) {}
84 : :
85 : 0 : SERIALIZE_METHODS(DBHashKey, obj) {
86 : 0 : uint8_t prefix{DB_BLOCK_HASH};
87 : 0 : READWRITE(prefix);
88 [ # # ]: 0 : if (prefix != DB_BLOCK_HASH) {
89 [ # # ]: 0 : throw std::ios_base::failure("Invalid format for block filter index DB hash key");
90 : : }
91 : :
92 : 0 : READWRITE(obj.hash);
93 : 0 : }
94 : : };
95 : :
96 : : }; // namespace
97 : :
98 : : static std::map<BlockFilterType, BlockFilterIndex> g_filter_indexes;
99 : :
100 : 0 : BlockFilterIndex::BlockFilterIndex(std::unique_ptr<interfaces::Chain> chain, BlockFilterType filter_type,
101 : 0 : size_t n_cache_size, bool f_memory, bool f_wipe)
102 [ # # ]: 0 : : BaseIndex(std::move(chain), BlockFilterTypeName(filter_type) + " block filter index")
103 [ # # # # ]: 0 : , m_filter_type(filter_type)
104 : : {
105 [ # # ]: 0 : const std::string& filter_name = BlockFilterTypeName(filter_type);
106 [ # # # # ]: 0 : if (filter_name.empty()) throw std::invalid_argument("unknown filter_type");
107 : :
108 [ # # # # : 0 : fs::path path = gArgs.GetDataDirNet() / "indexes" / "blockfilter" / fs::u8path(filter_name);
# # # # ]
109 [ # # ]: 0 : fs::create_directories(path);
110 : :
111 [ # # # # : 0 : m_db = std::make_unique<BaseIndex::DB>(path / "db", n_cache_size, f_memory, f_wipe);
# # ]
112 [ # # ]: 0 : m_filter_fileseq = std::make_unique<FlatFileSeq>(std::move(path), "fltr", FLTR_FILE_CHUNK_SIZE);
113 : 0 : }
114 : :
115 : 0 : interfaces::Chain::NotifyOptions BlockFilterIndex::CustomOptions()
116 : : {
117 : 0 : interfaces::Chain::NotifyOptions options;
118 : 0 : options.connect_undo_data = true;
119 : 0 : return options;
120 : : }
121 : :
122 : 0 : bool BlockFilterIndex::CustomInit(const std::optional<interfaces::BlockRef>& block)
123 : : {
124 [ # # ]: 0 : if (!m_db->Read(DB_FILTER_POS, m_next_filter_pos)) {
125 : : // Check that the cause of the read failure is that the key does not exist. Any other errors
126 : : // indicate database corruption or a disk failure, and starting the index would cause
127 : : // further corruption.
128 [ # # ]: 0 : if (m_db->Exists(DB_FILTER_POS)) {
129 : 0 : LogError("%s: Cannot read current %s state; index may be corrupted\n",
130 : : __func__, GetName());
131 : 0 : return false;
132 : : }
133 : :
134 : : // If the DB_FILTER_POS is not set, then initialize to the first location.
135 : 0 : m_next_filter_pos.nFile = 0;
136 : 0 : m_next_filter_pos.nPos = 0;
137 : : }
138 : :
139 [ # # ]: 0 : if (block) {
140 : 0 : auto op_last_header = ReadFilterHeader(block->height, block->hash);
141 [ # # ]: 0 : if (!op_last_header) {
142 : 0 : LogError("Cannot read last block filter header; index may be corrupted\n");
143 : 0 : return false;
144 : : }
145 : 0 : m_last_header = *op_last_header;
146 : : }
147 : :
148 : : return true;
149 : : }
150 : :
151 : 0 : bool BlockFilterIndex::CustomCommit(CDBBatch& batch)
152 : : {
153 : 0 : const FlatFilePos& pos = m_next_filter_pos;
154 : :
155 : : // Flush current filter file to disk.
156 [ # # ]: 0 : AutoFile file{m_filter_fileseq->Open(pos)};
157 [ # # ]: 0 : if (file.IsNull()) {
158 [ # # ]: 0 : LogError("%s: Failed to open filter file %d\n", __func__, pos.nFile);
159 : : return false;
160 : : }
161 [ # # # # ]: 0 : if (!file.Commit()) {
162 [ # # ]: 0 : LogError("%s: Failed to commit filter file %d\n", __func__, pos.nFile);
163 [ # # ]: 0 : (void)file.fclose();
164 : : return false;
165 : : }
166 [ # # # # ]: 0 : if (file.fclose() != 0) {
167 [ # # # # ]: 0 : LogError("Failed to close filter file %d after commit: %s", pos.nFile, SysErrorString(errno));
168 : 0 : return false;
169 : : }
170 : :
171 [ # # ]: 0 : batch.Write(DB_FILTER_POS, pos);
172 : : return true;
173 : 0 : }
174 : :
175 : 0 : bool BlockFilterIndex::ReadFilterFromDisk(const FlatFilePos& pos, const uint256& hash, BlockFilter& filter) const
176 : : {
177 [ # # ]: 0 : AutoFile filein{m_filter_fileseq->Open(pos, true)};
178 [ # # ]: 0 : if (filein.IsNull()) {
179 : : return false;
180 : : }
181 : :
182 : : // Check that the hash of the encoded_filter matches the one stored in the db.
183 : 0 : uint256 block_hash;
184 : 0 : std::vector<uint8_t> encoded_filter;
185 : 0 : try {
186 [ # # # # ]: 0 : filein >> block_hash >> encoded_filter;
187 [ # # # # ]: 0 : if (Hash(encoded_filter) != hash) {
188 [ # # ]: 0 : LogError("Checksum mismatch in filter decode.\n");
189 : : return false;
190 : : }
191 [ # # ]: 0 : filter = BlockFilter(GetFilterType(), block_hash, std::move(encoded_filter), /*skip_decode_check=*/true);
192 : : }
193 [ - - ]: 0 : catch (const std::exception& e) {
194 [ - - ]: 0 : LogError("%s: Failed to deserialize block filter from disk: %s\n", __func__, e.what());
195 : 0 : return false;
196 : 0 : }
197 : :
198 : 0 : return true;
199 : 0 : }
200 : :
201 : 0 : size_t BlockFilterIndex::WriteFilterToDisk(FlatFilePos& pos, const BlockFilter& filter)
202 : : {
203 [ # # ]: 0 : assert(filter.GetFilterType() == GetFilterType());
204 : :
205 : 0 : size_t data_size =
206 : 0 : GetSerializeSize(filter.GetBlockHash()) +
207 : 0 : GetSerializeSize(filter.GetEncodedFilter());
208 : :
209 : : // If writing the filter would overflow the file, flush and move to the next one.
210 [ # # ]: 0 : if (pos.nPos + data_size > MAX_FLTR_FILE_SIZE) {
211 [ # # ]: 0 : AutoFile last_file{m_filter_fileseq->Open(pos)};
212 [ # # ]: 0 : if (last_file.IsNull()) {
213 [ # # ]: 0 : LogPrintf("%s: Failed to open filter file %d\n", __func__, pos.nFile);
214 : : return 0;
215 : : }
216 [ # # # # ]: 0 : if (!last_file.Truncate(pos.nPos)) {
217 [ # # ]: 0 : LogPrintf("%s: Failed to truncate filter file %d\n", __func__, pos.nFile);
218 : : return 0;
219 : : }
220 [ # # # # ]: 0 : if (!last_file.Commit()) {
221 [ # # ]: 0 : LogPrintf("%s: Failed to commit filter file %d\n", __func__, pos.nFile);
222 [ # # ]: 0 : (void)last_file.fclose();
223 : : return 0;
224 : : }
225 [ # # # # ]: 0 : if (last_file.fclose() != 0) {
226 [ # # # # ]: 0 : LogError("Failed to close filter file %d after commit: %s", pos.nFile, SysErrorString(errno));
227 : 0 : return 0;
228 : : }
229 : :
230 : 0 : pos.nFile++;
231 : 0 : pos.nPos = 0;
232 : 0 : }
233 : :
234 : : // Pre-allocate sufficient space for filter data.
235 : 0 : bool out_of_space;
236 : 0 : m_filter_fileseq->Allocate(pos, data_size, out_of_space);
237 [ # # ]: 0 : if (out_of_space) {
238 : 0 : LogPrintf("%s: out of disk space\n", __func__);
239 : 0 : return 0;
240 : : }
241 : :
242 [ # # ]: 0 : AutoFile fileout{m_filter_fileseq->Open(pos)};
243 [ # # ]: 0 : if (fileout.IsNull()) {
244 [ # # ]: 0 : LogPrintf("%s: Failed to open filter file %d\n", __func__, pos.nFile);
245 : : return 0;
246 : : }
247 : :
248 [ # # # # ]: 0 : fileout << filter.GetBlockHash() << filter.GetEncodedFilter();
249 : :
250 [ # # # # ]: 0 : if (fileout.fclose() != 0) {
251 [ # # # # ]: 0 : LogError("Failed to close filter file %d: %s", pos.nFile, SysErrorString(errno));
252 : 0 : return 0;
253 : : }
254 : :
255 : : return data_size;
256 : 0 : }
257 : :
258 : 0 : std::optional<uint256> BlockFilterIndex::ReadFilterHeader(int height, const uint256& expected_block_hash)
259 : : {
260 : 0 : std::pair<uint256, DBVal> read_out;
261 [ # # ]: 0 : if (!m_db->Read(DBHeightKey(height), read_out)) {
262 : 0 : return std::nullopt;
263 : : }
264 : :
265 [ # # ]: 0 : if (read_out.first != expected_block_hash) {
266 [ # # # # ]: 0 : LogError("%s: previous block header belongs to unexpected block %s; expected %s\n",
267 : : __func__, read_out.first.ToString(), expected_block_hash.ToString());
268 : 0 : return std::nullopt;
269 : : }
270 : :
271 : 0 : return read_out.second.header;
272 : : }
273 : :
274 : 0 : bool BlockFilterIndex::CustomAppend(const interfaces::BlockInfo& block)
275 : : {
276 : 0 : BlockFilter filter(m_filter_type, *Assert(block.data), *Assert(block.undo_data));
277 [ # # ]: 0 : const uint256& header = filter.ComputeHeader(m_last_header);
278 [ # # ]: 0 : bool res = Write(filter, block.height, header);
279 [ # # ]: 0 : if (res) m_last_header = header; // update last header
280 : 0 : return res;
281 : 0 : }
282 : :
283 : 0 : bool BlockFilterIndex::Write(const BlockFilter& filter, uint32_t block_height, const uint256& filter_header)
284 : : {
285 : 0 : size_t bytes_written = WriteFilterToDisk(m_next_filter_pos, filter);
286 [ # # ]: 0 : if (bytes_written == 0) return false;
287 : :
288 : 0 : std::pair<uint256, DBVal> value;
289 : 0 : value.first = filter.GetBlockHash();
290 : 0 : value.second.hash = filter.GetHash();
291 : 0 : value.second.header = filter_header;
292 : 0 : value.second.pos = m_next_filter_pos;
293 : :
294 [ # # ]: 0 : if (!m_db->Write(DBHeightKey(block_height), value)) {
295 : : return false;
296 : : }
297 : :
298 : 0 : m_next_filter_pos.nPos += bytes_written;
299 : 0 : return true;
300 : : }
301 : :
302 : 0 : [[nodiscard]] static bool CopyHeightIndexToHashIndex(CDBIterator& db_it, CDBBatch& batch,
303 : : const std::string& index_name, int height)
304 : : {
305 : 0 : DBHeightKey key(height);
306 : 0 : db_it.Seek(key);
307 : :
308 [ # # # # ]: 0 : if (!db_it.GetKey(key) || key.height != height) {
309 : 0 : LogError("%s: unexpected key in %s: expected (%c, %d)\n",
310 : : __func__, index_name, DB_BLOCK_HEIGHT, height);
311 : 0 : return false;
312 : : }
313 : :
314 : 0 : std::pair<uint256, DBVal> value;
315 [ # # ]: 0 : if (!db_it.GetValue(value)) {
316 : 0 : LogError("%s: unable to read value in %s at key (%c, %d)\n",
317 : : __func__, index_name, DB_BLOCK_HEIGHT, height);
318 : 0 : return false;
319 : : }
320 : :
321 : 0 : batch.Write(DBHashKey(value.first), std::move(value.second));
322 : 0 : return true;
323 : : }
324 : :
325 : 0 : bool BlockFilterIndex::CustomRemove(const interfaces::BlockInfo& block)
326 : : {
327 : 0 : CDBBatch batch(*m_db);
328 [ # # # # ]: 0 : std::unique_ptr<CDBIterator> db_it(m_db->NewIterator());
329 : :
330 : : // During a reorg, we need to copy block filter that is getting disconnected from the
331 : : // height index to the hash index so we can still find it when the height index entry
332 : : // is overwritten.
333 [ # # # # ]: 0 : if (!CopyHeightIndexToHashIndex(*db_it, batch, m_name, block.height)) {
334 : : return false;
335 : : }
336 : :
337 : : // The latest filter position gets written in Commit by the call to the BaseIndex::Rewind.
338 : : // But since this creates new references to the filter, the position should get updated here
339 : : // atomically as well in case Commit fails.
340 [ # # ]: 0 : batch.Write(DB_FILTER_POS, m_next_filter_pos);
341 [ # # # # ]: 0 : if (!m_db->WriteBatch(batch)) return false;
342 : :
343 : : // Update cached header to the previous block hash
344 [ # # # # : 0 : m_last_header = *Assert(ReadFilterHeader(block.height - 1, *Assert(block.prev_hash)));
# # ]
345 : 0 : return true;
346 : 0 : }
347 : :
348 : 0 : static bool LookupOne(const CDBWrapper& db, const CBlockIndex* block_index, DBVal& result)
349 : : {
350 : : // First check if the result is stored under the height index and the value there matches the
351 : : // block hash. This should be the case if the block is on the active chain.
352 : 0 : std::pair<uint256, DBVal> read_out;
353 [ # # ]: 0 : if (!db.Read(DBHeightKey(block_index->nHeight), read_out)) {
354 : : return false;
355 : : }
356 [ # # ]: 0 : if (read_out.first == block_index->GetBlockHash()) {
357 : 0 : result = std::move(read_out.second);
358 : 0 : return true;
359 : : }
360 : :
361 : : // If value at the height index corresponds to an different block, the result will be stored in
362 : : // the hash index.
363 : 0 : return db.Read(DBHashKey(block_index->GetBlockHash()), result);
364 : : }
365 : :
366 : 0 : static bool LookupRange(CDBWrapper& db, const std::string& index_name, int start_height,
367 : : const CBlockIndex* stop_index, std::vector<DBVal>& results)
368 : : {
369 [ # # ]: 0 : if (start_height < 0) {
370 : 0 : LogError("%s: start height (%d) is negative\n", __func__, start_height);
371 : 0 : return false;
372 : : }
373 [ # # ]: 0 : if (start_height > stop_index->nHeight) {
374 : 0 : LogError("%s: start height (%d) is greater than stop height (%d)\n",
375 : : __func__, start_height, stop_index->nHeight);
376 : 0 : return false;
377 : : }
378 : :
379 : 0 : size_t results_size = static_cast<size_t>(stop_index->nHeight - start_height + 1);
380 : 0 : std::vector<std::pair<uint256, DBVal>> values(results_size);
381 : :
382 : 0 : DBHeightKey key(start_height);
383 [ # # # # ]: 0 : std::unique_ptr<CDBIterator> db_it(db.NewIterator());
384 [ # # ]: 0 : db_it->Seek(DBHeightKey(start_height));
385 [ # # ]: 0 : for (int height = start_height; height <= stop_index->nHeight; ++height) {
386 [ # # # # : 0 : if (!db_it->Valid() || !db_it->GetKey(key) || key.height != height) {
# # # # #
# ]
387 : 0 : return false;
388 : : }
389 : :
390 : 0 : size_t i = static_cast<size_t>(height - start_height);
391 [ # # # # ]: 0 : if (!db_it->GetValue(values[i])) {
392 [ # # ]: 0 : LogError("%s: unable to read value in %s at key (%c, %d)\n",
393 : : __func__, index_name, DB_BLOCK_HEIGHT, height);
394 : : return false;
395 : : }
396 : :
397 [ # # ]: 0 : db_it->Next();
398 : : }
399 : :
400 [ # # ]: 0 : results.resize(results_size);
401 : :
402 : : // Iterate backwards through block indexes collecting results in order to access the block hash
403 : : // of each entry in case we need to look it up in the hash index.
404 : 0 : for (const CBlockIndex* block_index = stop_index;
405 [ # # # # ]: 0 : block_index && block_index->nHeight >= start_height;
406 : 0 : block_index = block_index->pprev) {
407 : 0 : uint256 block_hash = block_index->GetBlockHash();
408 : :
409 : 0 : size_t i = static_cast<size_t>(block_index->nHeight - start_height);
410 [ # # ]: 0 : if (block_hash == values[i].first) {
411 : 0 : results[i] = std::move(values[i].second);
412 : 0 : continue;
413 : : }
414 : :
415 [ # # # # ]: 0 : if (!db.Read(DBHashKey(block_hash), results[i])) {
416 [ # # # # ]: 0 : LogError("%s: unable to read value in %s at key (%c, %s)\n",
417 : : __func__, index_name, DB_BLOCK_HASH, block_hash.ToString());
418 : 0 : return false;
419 : : }
420 : : }
421 : :
422 : : return true;
423 : 0 : }
424 : :
425 : 0 : bool BlockFilterIndex::LookupFilter(const CBlockIndex* block_index, BlockFilter& filter_out) const
426 : : {
427 : 0 : DBVal entry;
428 [ # # ]: 0 : if (!LookupOne(*m_db, block_index, entry)) {
429 : : return false;
430 : : }
431 : :
432 : 0 : return ReadFilterFromDisk(entry.pos, entry.hash, filter_out);
433 : : }
434 : :
435 : 0 : bool BlockFilterIndex::LookupFilterHeader(const CBlockIndex* block_index, uint256& header_out)
436 : : {
437 : 0 : LOCK(m_cs_headers_cache);
438 : :
439 : 0 : bool is_checkpoint{block_index->nHeight % CFCHECKPT_INTERVAL == 0};
440 : :
441 [ # # ]: 0 : if (is_checkpoint) {
442 : : // Try to find the block in the headers cache if this is a checkpoint height.
443 : 0 : auto header = m_headers_cache.find(block_index->GetBlockHash());
444 [ # # ]: 0 : if (header != m_headers_cache.end()) {
445 : 0 : header_out = header->second;
446 : 0 : return true;
447 : : }
448 : : }
449 : :
450 : 0 : DBVal entry;
451 [ # # # # ]: 0 : if (!LookupOne(*m_db, block_index, entry)) {
452 : : return false;
453 : : }
454 : :
455 [ # # # # ]: 0 : if (is_checkpoint &&
456 [ # # ]: 0 : m_headers_cache.size() < CF_HEADERS_CACHE_MAX_SZ) {
457 : : // Add to the headers cache if this is a checkpoint height.
458 [ # # ]: 0 : m_headers_cache.emplace(block_index->GetBlockHash(), entry.header);
459 : : }
460 : :
461 : 0 : header_out = entry.header;
462 : 0 : return true;
463 : 0 : }
464 : :
465 : 0 : bool BlockFilterIndex::LookupFilterRange(int start_height, const CBlockIndex* stop_index,
466 : : std::vector<BlockFilter>& filters_out) const
467 : : {
468 : 0 : std::vector<DBVal> entries;
469 [ # # # # ]: 0 : if (!LookupRange(*m_db, m_name, start_height, stop_index, entries)) {
470 : : return false;
471 : : }
472 : :
473 [ # # ]: 0 : filters_out.resize(entries.size());
474 : 0 : auto filter_pos_it = filters_out.begin();
475 [ # # ]: 0 : for (const auto& entry : entries) {
476 [ # # # # ]: 0 : if (!ReadFilterFromDisk(entry.pos, entry.hash, *filter_pos_it)) {
477 : : return false;
478 : : }
479 : 0 : ++filter_pos_it;
480 : : }
481 : :
482 : : return true;
483 : 0 : }
484 : :
485 : 0 : bool BlockFilterIndex::LookupFilterHashRange(int start_height, const CBlockIndex* stop_index,
486 : : std::vector<uint256>& hashes_out) const
487 : :
488 : : {
489 : 0 : std::vector<DBVal> entries;
490 [ # # # # ]: 0 : if (!LookupRange(*m_db, m_name, start_height, stop_index, entries)) {
491 : : return false;
492 : : }
493 : :
494 [ # # ]: 0 : hashes_out.clear();
495 [ # # ]: 0 : hashes_out.reserve(entries.size());
496 [ # # ]: 0 : for (const auto& entry : entries) {
497 [ # # ]: 0 : hashes_out.push_back(entry.hash);
498 : : }
499 : : return true;
500 : 0 : }
501 : :
502 : 4 : BlockFilterIndex* GetBlockFilterIndex(BlockFilterType filter_type)
503 : : {
504 : 4 : auto it = g_filter_indexes.find(filter_type);
505 [ - + ]: 4 : return it != g_filter_indexes.end() ? &it->second : nullptr;
506 : : }
507 : :
508 : 8 : void ForEachBlockFilterIndex(std::function<void (BlockFilterIndex&)> fn)
509 : : {
510 [ - + ]: 8 : for (auto& entry : g_filter_indexes) fn(entry.second);
511 : 8 : }
512 : :
513 : 0 : bool InitBlockFilterIndex(std::function<std::unique_ptr<interfaces::Chain>()> make_chain, BlockFilterType filter_type,
514 : : size_t n_cache_size, bool f_memory, bool f_wipe)
515 : : {
516 : 0 : auto result = g_filter_indexes.emplace(std::piecewise_construct,
517 [ # # ]: 0 : std::forward_as_tuple(filter_type),
518 [ # # ]: 0 : std::forward_as_tuple(make_chain(), filter_type,
519 : : n_cache_size, f_memory, f_wipe));
520 : 0 : return result.second;
521 : : }
522 : :
523 : 0 : bool DestroyBlockFilterIndex(BlockFilterType filter_type)
524 : : {
525 : 0 : return g_filter_indexes.erase(filter_type);
526 : : }
527 : :
528 : 0 : void DestroyAllBlockFilterIndexes()
529 : : {
530 : 0 : g_filter_indexes.clear();
531 : 0 : }
|
