Branch data Line data Source code
1 : : // Copyright (c) 2011-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 : : #ifndef BITCOIN_NODE_BLOCKSTORAGE_H
6 : : #define BITCOIN_NODE_BLOCKSTORAGE_H
7 : :
8 : : #include <attributes.h>
9 : : #include <chain.h>
10 : : #include <dbwrapper.h>
11 : : #include <flatfile.h>
12 : : #include <kernel/blockmanager_opts.h>
13 : : #include <kernel/chainparams.h>
14 : : #include <kernel/cs_main.h>
15 : : #include <kernel/messagestartchars.h>
16 : : #include <primitives/block.h>
17 : : #include <streams.h>
18 : : #include <sync.h>
19 : : #include <uint256.h>
20 : : #include <util/expected.h>
21 : : #include <util/fs.h>
22 : : #include <util/hasher.h>
23 : :
24 : : #include <array>
25 : : #include <atomic>
26 : : #include <cstdint>
27 : : #include <functional>
28 : : #include <limits>
29 : : #include <map>
30 : : #include <memory>
31 : : #include <optional>
32 : : #include <set>
33 : : #include <span>
34 : : #include <string>
35 : : #include <unordered_map>
36 : : #include <utility>
37 : : #include <vector>
38 : :
39 : : class BlockValidationState;
40 : : class CBlockUndo;
41 : : class Chainstate;
42 : : class ChainstateManager;
43 : : namespace Consensus {
44 : : struct Params;
45 : : }
46 : : namespace util {
47 : : class SignalInterrupt;
48 : : } // namespace util
49 : :
50 : : namespace kernel {
51 : : class CBlockFileInfo
52 : : {
53 : : public:
54 : : uint32_t nBlocks{}; //!< number of blocks stored in file
55 : : uint32_t nSize{}; //!< number of used bytes of block file
56 : : uint32_t nUndoSize{}; //!< number of used bytes in the undo file
57 : : uint32_t nHeightFirst{}; //!< lowest height of block in file
58 : : uint32_t nHeightLast{}; //!< highest height of block in file
59 : : uint64_t nTimeFirst{}; //!< earliest time of block in file
60 : : uint64_t nTimeLast{}; //!< latest time of block in file
61 : :
62 : 281306 : SERIALIZE_METHODS(CBlockFileInfo, obj)
63 : : {
64 : 163368 : READWRITE(VARINT(obj.nBlocks));
65 : 163348 : READWRITE(VARINT(obj.nSize));
66 : 163337 : READWRITE(VARINT(obj.nUndoSize));
67 : 163329 : READWRITE(VARINT(obj.nHeightFirst));
68 : 163325 : READWRITE(VARINT(obj.nHeightLast));
69 : 163325 : READWRITE(VARINT(obj.nTimeFirst));
70 : 163318 : READWRITE(VARINT(obj.nTimeLast));
71 : 163311 : }
72 : :
73 : 2177 : CBlockFileInfo() = default;
74 : :
75 : : std::string ToString() const;
76 : :
77 : : /** update statistics (does not update nSize) */
78 : 160358 : void AddBlock(unsigned int nHeightIn, uint64_t nTimeIn)
79 : : {
80 [ + + - + ]: 160358 : if (nBlocks == 0 || nHeightFirst > nHeightIn)
81 : 2177 : nHeightFirst = nHeightIn;
82 [ + + - + ]: 160358 : if (nBlocks == 0 || nTimeFirst > nTimeIn)
83 : 2177 : nTimeFirst = nTimeIn;
84 : 160358 : nBlocks++;
85 [ + + ]: 160358 : if (nHeightIn > nHeightLast)
86 : 147792 : nHeightLast = nHeightIn;
87 [ + + ]: 160358 : if (nTimeIn > nTimeLast)
88 : 30652 : nTimeLast = nTimeIn;
89 : 160358 : }
90 : : };
91 : :
92 : : /** Access to the block database (blocks/index/) */
93 : 2802 : class BlockTreeDB : public CDBWrapper
94 : : {
95 : : public:
96 [ + - ]: 2802 : using CDBWrapper::CDBWrapper;
97 : : void WriteBatchSync(const std::vector<std::pair<int, const CBlockFileInfo*>>& fileInfo, int nLastFile, const std::vector<const CBlockIndex*>& blockinfo);
98 : : bool ReadBlockFileInfo(int nFile, CBlockFileInfo& info);
99 : : bool ReadLastBlockFile(int& nFile);
100 : : void WriteReindexing(bool fReindexing);
101 : : void ReadReindexing(bool& fReindexing);
102 : : void WriteFlag(const std::string& name, bool fValue);
103 : : bool ReadFlag(const std::string& name, bool& fValue);
104 : : bool LoadBlockIndexGuts(const Consensus::Params& consensusParams, std::function<CBlockIndex*(const uint256&)> insertBlockIndex, const util::SignalInterrupt& interrupt)
105 : : EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
106 : : };
107 : : } // namespace kernel
108 : :
109 : : namespace node {
110 : : using kernel::CBlockFileInfo;
111 : : using kernel::BlockTreeDB;
112 : :
113 : : /** The pre-allocation chunk size for blk?????.dat files (since 0.8) */
114 : : static const unsigned int BLOCKFILE_CHUNK_SIZE = 0x1000000; // 16 MiB
115 : : /** The pre-allocation chunk size for rev?????.dat files (since 0.8) */
116 : : static const unsigned int UNDOFILE_CHUNK_SIZE = 0x100000; // 1 MiB
117 : : /** The maximum size of a blk?????.dat file (since 0.8) */
118 : : static const unsigned int MAX_BLOCKFILE_SIZE = 0x8000000; // 128 MiB
119 : :
120 : : /** Size of header written by WriteBlock before a serialized CBlock (8 bytes) */
121 : : static constexpr uint32_t STORAGE_HEADER_BYTES{std::tuple_size_v<MessageStartChars> + sizeof(unsigned int)};
122 : :
123 : : /** Total overhead when writing undo data: header (8 bytes) plus checksum (32 bytes) */
124 : : static constexpr uint32_t UNDO_DATA_DISK_OVERHEAD{STORAGE_HEADER_BYTES + uint256::size()};
125 : :
126 : : // Because validation code takes pointers to the map's CBlockIndex objects, if
127 : : // we ever switch to another associative container, we need to either use a
128 : : // container that has stable addressing (true of all std associative
129 : : // containers), or make the key a `std::unique_ptr<CBlockIndex>`
130 : : using BlockMap = std::unordered_map<uint256, CBlockIndex, BlockHasher>;
131 : :
132 : : struct CBlockIndexWorkComparator {
133 : : bool operator()(const CBlockIndex* pa, const CBlockIndex* pb) const;
134 : : };
135 : :
136 : : struct CBlockIndexHeightOnlyComparator {
137 : : /* Only compares the height of two block indices, doesn't try to tie-break */
138 : : bool operator()(const CBlockIndex* pa, const CBlockIndex* pb) const;
139 : : };
140 : :
141 : 0 : struct PruneLockInfo {
142 : : int height_first{std::numeric_limits<int>::max()}; //! Height of earliest block that should be kept and not pruned
143 : : };
144 : :
145 : : enum BlockfileType {
146 : : // Values used as array indexes - do not change carelessly.
147 : : NORMAL = 0,
148 : : ASSUMED = 1,
149 : : NUM_TYPES = 2,
150 : : };
151 : :
152 : : std::ostream& operator<<(std::ostream& os, const BlockfileType& type);
153 : :
154 : : struct BlockfileCursor {
155 : : // The latest blockfile number.
156 : : int file_num{0};
157 : :
158 : : // Track the height of the highest block in file_num whose undo
159 : : // data has been written. Block data is written to block files in download
160 : : // order, but is written to undo files in validation order, which is
161 : : // usually in order by height. To avoid wasting disk space, undo files will
162 : : // be trimmed whenever the corresponding block file is finalized and
163 : : // the height of the highest block written to the block file equals the
164 : : // height of the highest block written to the undo file. This is a
165 : : // heuristic and can sometimes preemptively trim undo files that will write
166 : : // more data later, and sometimes fail to trim undo files that can't have
167 : : // more data written later.
168 : : int undo_height{0};
169 : : };
170 : :
171 : : std::ostream& operator<<(std::ostream& os, const BlockfileCursor& cursor);
172 : :
173 : : enum class ReadRawError {
174 : : IO,
175 : : BadPartRange,
176 : : };
177 : :
178 : : /**
179 : : * Maintains a tree of blocks (stored in `m_block_index`) which is consulted
180 : : * to determine where the most-work tip is.
181 : : *
182 : : * This data is used mostly in `Chainstate` - information about, e.g.,
183 : : * candidate tips is not maintained here.
184 : : */
185 : : class BlockManager
186 : : {
187 : : friend Chainstate;
188 : : friend ChainstateManager;
189 : :
190 : : private:
191 [ + - - + : 317304 : const CChainParams& GetParams() const { return m_opts.chainparams; }
+ - ]
192 [ + - - + : 21039 : const Consensus::Params& GetConsensus() const { return m_opts.chainparams.GetConsensus(); }
- - + - ]
193 : : /**
194 : : * Load the blocktree off disk and into memory. Populate certain metadata
195 : : * per index entry (nStatus, nChainWork, nTimeMax, etc.) as well as peripheral
196 : : * collections like m_dirty_blockindex.
197 : : */
198 : : bool LoadBlockIndex(const std::optional<uint256>& snapshot_blockhash)
199 : : EXCLUSIVE_LOCKS_REQUIRED(cs_main);
200 : :
201 : : /** Return false if block file or undo file flushing fails. */
202 : : [[nodiscard]] bool FlushBlockFile(int blockfile_num, bool fFinalize, bool finalize_undo);
203 : :
204 : : /** Return false if undo file flushing fails. */
205 : : [[nodiscard]] bool FlushUndoFile(int block_file, bool finalize = false);
206 : :
207 : : /**
208 : : * Helper function performing various preparations before a block can be saved to disk:
209 : : * Returns the correct position for the block to be saved, which may be in the current or a new
210 : : * block file depending on nAddSize. May flush the previous blockfile to disk if full, updates
211 : : * blockfile info, and checks if there is enough disk space to save the block.
212 : : *
213 : : * The nAddSize argument passed to this function should include not just the size of the serialized CBlock, but also the size of
214 : : * separator fields (STORAGE_HEADER_BYTES).
215 : : */
216 : : [[nodiscard]] FlatFilePos FindNextBlockPos(unsigned int nAddSize, unsigned int nHeight, uint64_t nTime);
217 : : [[nodiscard]] bool FlushChainstateBlockFile(int tip_height);
218 : : bool FindUndoPos(BlockValidationState& state, int nFile, FlatFilePos& pos, unsigned int nAddSize);
219 : :
220 : : AutoFile OpenUndoFile(const FlatFilePos& pos, bool fReadOnly = false) const;
221 : :
222 : : /* Calculate the block/rev files to delete based on height specified by user with RPC command pruneblockchain */
223 : : void FindFilesToPruneManual(
224 : : std::set<int>& setFilesToPrune,
225 : : int nManualPruneHeight,
226 : : const Chainstate& chain,
227 : : ChainstateManager& chainman);
228 : :
229 : : /**
230 : : * Prune block and undo files (blk???.dat and rev???.dat) so that the disk space used is less than a user-defined target.
231 : : * The user sets the target (in MB) on the command line or in config file. This will be run on startup and whenever new
232 : : * space is allocated in a block or undo file, staying below the target. Changing back to unpruned requires a reindex
233 : : * (which in this case means the blockchain must be re-downloaded.)
234 : : *
235 : : * Pruning functions are called from FlushStateToDisk when the m_check_for_pruning flag has been set.
236 : : * Block and undo files are deleted in lock-step (when blk00003.dat is deleted, so is rev00003.dat.)
237 : : * Pruning cannot take place until the longest chain is at least a certain length (CChainParams::nPruneAfterHeight).
238 : : * Pruning will never delete a block within a defined distance (currently 288) from the active chain's tip.
239 : : * The block index is updated by unsetting HAVE_DATA and HAVE_UNDO for any blocks that were stored in the deleted files.
240 : : * A db flag records the fact that at least some block files have been pruned.
241 : : *
242 : : * @param[out] setFilesToPrune The set of file indices that can be unlinked will be returned
243 : : * @param last_prune The last height we're able to prune, according to the prune locks
244 : : */
245 : : void FindFilesToPrune(
246 : : std::set<int>& setFilesToPrune,
247 : : int last_prune,
248 : : const Chainstate& chain,
249 : : ChainstateManager& chainman);
250 : :
251 : : RecursiveMutex cs_LastBlockFile;
252 : : std::vector<CBlockFileInfo> m_blockfile_info;
253 : :
254 : : //! Since assumedvalid chainstates may be syncing a range of the chain that is very
255 : : //! far away from the normal/background validation process, we should segment blockfiles
256 : : //! for assumed chainstates. Otherwise, we might have wildly different height ranges
257 : : //! mixed into the same block files, which would impair our ability to prune
258 : : //! effectively.
259 : : //!
260 : : //! This data structure maintains separate blockfile number cursors for each
261 : : //! BlockfileType. The ASSUMED state is initialized, when necessary, in FindNextBlockPos().
262 : : //!
263 : : //! The first element is the NORMAL cursor, second is ASSUMED.
264 : : std::array<std::optional<BlockfileCursor>, BlockfileType::NUM_TYPES>
265 : : m_blockfile_cursors GUARDED_BY(cs_LastBlockFile) = {
266 : : BlockfileCursor{},
267 : : std::nullopt,
268 : : };
269 : 115391 : int MaxBlockfileNum() const EXCLUSIVE_LOCKS_REQUIRED(cs_LastBlockFile)
270 : : {
271 : 115391 : static const BlockfileCursor empty_cursor;
272 [ + - ]: 115391 : const auto& normal = m_blockfile_cursors[BlockfileType::NORMAL].value_or(empty_cursor);
273 [ - + ]: 115391 : const auto& assumed = m_blockfile_cursors[BlockfileType::ASSUMED].value_or(empty_cursor);
274 [ + - ]: 115391 : return std::max(normal.file_num, assumed.file_num);
275 : : }
276 : :
277 : : /** Global flag to indicate we should check to see if there are
278 : : * block/undo files that should be deleted. Set on startup
279 : : * or if we allocate more file space when we're in prune mode
280 : : */
281 : : bool m_check_for_pruning = false;
282 : :
283 : : const bool m_prune_mode;
284 : :
285 : : const Obfuscation m_obfuscation;
286 : :
287 : : /** Dirty block index entries. */
288 : : std::set<CBlockIndex*> m_dirty_blockindex;
289 : :
290 : : /** Dirty block file entries. */
291 : : std::set<int> m_dirty_fileinfo;
292 : :
293 : : /**
294 : : * Map from external index name to oldest block that must not be pruned.
295 : : *
296 : : * @note Internally, only blocks at height (height_first - PRUNE_LOCK_BUFFER - 1) and
297 : : * below will be pruned, but callers should avoid assuming any particular buffer size.
298 : : */
299 : : std::unordered_map<std::string, PruneLockInfo> m_prune_locks GUARDED_BY(::cs_main);
300 : :
301 : : BlockfileType BlockfileTypeForHeight(int height);
302 : :
303 : : const kernel::BlockManagerOpts m_opts;
304 : :
305 : : const FlatFileSeq m_block_file_seq;
306 : : const FlatFileSeq m_undo_file_seq;
307 : :
308 : : public:
309 : : using Options = kernel::BlockManagerOpts;
310 : : using ReadRawBlockResult = util::Expected<std::vector<std::byte>, ReadRawError>;
311 : :
312 : : explicit BlockManager(const util::SignalInterrupt& interrupt, Options opts);
313 : :
314 : : const util::SignalInterrupt& m_interrupt;
315 : : std::atomic<bool> m_importing{false};
316 : :
317 : : /**
318 : : * Whether all blockfiles have been added to the block tree database.
319 : : * Normally true, but set to false when a reindex is requested and the
320 : : * database is wiped. The value is persisted in the database across restarts
321 : : * and will be false until reindexing completes.
322 : : */
323 : : std::atomic_bool m_blockfiles_indexed{true};
324 : :
325 : : BlockMap m_block_index GUARDED_BY(cs_main);
326 : :
327 : : /**
328 : : * The height of the base block of an assumeutxo snapshot, if one is in use.
329 : : *
330 : : * This controls how blockfiles are segmented by chainstate type to avoid
331 : : * comingling different height regions of the chain when an assumedvalid chainstate
332 : : * is in use. If heights are drastically different in the same blockfile, pruning
333 : : * suffers.
334 : : *
335 : : * This is set during ActivateSnapshot() or upon LoadBlockIndex() if a snapshot
336 : : * had been previously loaded. After the snapshot is validated, this is unset to
337 : : * restore normal LoadBlockIndex behavior.
338 : : */
339 : : std::optional<int> m_snapshot_height;
340 : :
341 : : std::vector<CBlockIndex*> GetAllBlockIndices() EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
342 : :
343 : : /**
344 : : * All pairs A->B, where A (or one of its ancestors) misses transactions, but B has transactions.
345 : : * Pruned nodes may have entries where B is missing data.
346 : : */
347 : : std::multimap<CBlockIndex*, CBlockIndex*> m_blocks_unlinked;
348 : :
349 : : std::unique_ptr<BlockTreeDB> m_block_tree_db GUARDED_BY(::cs_main);
350 : :
351 : : void WriteBlockIndexDB() EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
352 : : bool LoadBlockIndexDB(const std::optional<uint256>& snapshot_blockhash)
353 : : EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
354 : :
355 : : /**
356 : : * Remove any pruned block & undo files that are still on disk.
357 : : * This could happen on some systems if the file was still being read while unlinked,
358 : : * or if we crash before unlinking.
359 : : */
360 : : void ScanAndUnlinkAlreadyPrunedFiles() EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
361 : :
362 : : CBlockIndex* AddToBlockIndex(const CBlockHeader& block, CBlockIndex*& best_header) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
363 : : /** Create a new block index entry for a given block hash */
364 : : CBlockIndex* InsertBlockIndex(const uint256& hash) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
365 : :
366 : : //! Mark one block file as pruned (modify associated database entries)
367 : : void PruneOneBlockFile(const int fileNumber) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
368 : :
369 : : CBlockIndex* LookupBlockIndex(const uint256& hash) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
370 : : const CBlockIndex* LookupBlockIndex(const uint256& hash) const EXCLUSIVE_LOCKS_REQUIRED(cs_main);
371 : :
372 : : /** Get block file info entry for one block file */
373 : : CBlockFileInfo* GetBlockFileInfo(size_t n);
374 : :
375 : : bool WriteBlockUndo(const CBlockUndo& blockundo, BlockValidationState& state, CBlockIndex& block)
376 : : EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
377 : :
378 : : /** Store block on disk and update block file statistics.
379 : : *
380 : : * @param[in] block the block to be stored
381 : : * @param[in] nHeight the height of the block
382 : : *
383 : : * @returns in case of success, the position to which the block was written to
384 : : * in case of an error, an empty FlatFilePos
385 : : */
386 : : FlatFilePos WriteBlock(const CBlock& block, int nHeight);
387 : :
388 : : /** Update blockfile info while processing a block during reindex. The block must be available on disk.
389 : : *
390 : : * @param[in] block the block being processed
391 : : * @param[in] nHeight the height of the block
392 : : * @param[in] pos the position of the serialized CBlock on disk
393 : : */
394 : : void UpdateBlockInfo(const CBlock& block, unsigned int nHeight, const FlatFilePos& pos);
395 : :
396 : : /** Whether running in -prune mode. */
397 [ + + ][ # # : 2443481 : [[nodiscard]] bool IsPruneMode() const { return m_prune_mode; }
# # # # #
# ][ - + -
+ - + #
# ][ - - +
- - + + -
- + ]
398 : :
399 : : /** Attempt to stay below this number of bytes of block files. */
400 [ - + ]: 2177 : [[nodiscard]] uint64_t GetPruneTarget() const { return m_opts.prune_target; }
[ # # # # ]
401 : : static constexpr auto PRUNE_TARGET_MANUAL{std::numeric_limits<uint64_t>::max()};
402 : :
403 [ + - - + ]: 799837 : [[nodiscard]] bool LoadingBlocks() const { return m_importing || !m_blockfiles_indexed; }
404 : :
405 : : /** Calculate the amount of disk space the block & undo files currently use */
406 : : uint64_t CalculateCurrentUsage();
407 : :
408 : : //! Check if all blocks in the [upper_block, lower_block] range have data available.
409 : : //! The caller is responsible for ensuring that lower_block is an ancestor of upper_block
410 : : //! (part of the same chain).
411 : : bool CheckBlockDataAvailability(const CBlockIndex& upper_block, const CBlockIndex& lower_block) EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
412 : :
413 : : /**
414 : : * @brief Returns the earliest block with specified `status_mask` flags set after
415 : : * the latest block _not_ having those flags.
416 : : *
417 : : * This function starts from `upper_block`, which must have all
418 : : * `status_mask` flags set, and iterates backwards through its ancestors. It
419 : : * continues as long as each block has all `status_mask` flags set, until
420 : : * reaching the oldest ancestor or `lower_block`.
421 : : *
422 : : * @pre `upper_block` must have all `status_mask` flags set.
423 : : * @pre `lower_block` must be null or an ancestor of `upper_block`
424 : : *
425 : : * @param upper_block The starting block for the search, which must have all
426 : : * `status_mask` flags set.
427 : : * @param status_mask Bitmask specifying required status flags.
428 : : * @param lower_block The earliest possible block to return. If null, the
429 : : * search can extend to the genesis block.
430 : : *
431 : : * @return A reference to the earliest block between `upper_block`
432 : : * and `lower_block`, inclusive, such that every block between the
433 : : * returned block and `upper_block` has `status_mask` flags set.
434 : : */
435 : : const CBlockIndex& GetFirstBlock(
436 : : const CBlockIndex& upper_block LIFETIMEBOUND,
437 : : uint32_t status_mask,
438 : : const CBlockIndex* lower_block LIFETIMEBOUND = nullptr
439 : : ) const EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
440 : :
441 : : /** True if any block files have ever been pruned. */
442 : : bool m_have_pruned = false;
443 : :
444 : : //! Check whether the block associated with this index entry is pruned or not.
445 : : bool IsBlockPruned(const CBlockIndex& block) const EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
446 : :
447 : : //! Create or update a prune lock identified by its name
448 : : void UpdatePruneLock(const std::string& name, const PruneLockInfo& lock_info) EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
449 : :
450 : : /** Open a block file (blk?????.dat) */
451 : : AutoFile OpenBlockFile(const FlatFilePos& pos, bool fReadOnly) const;
452 : :
453 : : /** Translation to a filesystem path */
454 : : fs::path GetBlockPosFilename(const FlatFilePos& pos) const;
455 : :
456 : : /**
457 : : * Actually unlink the specified files
458 : : */
459 : : void UnlinkPrunedFiles(const std::set<int>& setFilesToPrune) const;
460 : :
461 : : /** Functions for disk access for blocks */
462 : : bool ReadBlock(CBlock& block, const FlatFilePos& pos, const std::optional<uint256>& expected_hash) const;
463 : : bool ReadBlock(CBlock& block, const CBlockIndex& index) const;
464 : : ReadRawBlockResult ReadRawBlock(const FlatFilePos& pos, std::optional<std::pair<size_t, size_t>> block_part = std::nullopt) const;
465 : :
466 : : bool ReadBlockUndo(CBlockUndo& blockundo, const CBlockIndex& index) const;
467 : :
468 : : void CleanupBlockRevFiles() const;
469 : : };
470 : :
471 : : // Calls ActivateBestChain() even if no blocks are imported.
472 : : void ImportBlocks(ChainstateManager& chainman, std::span<const fs::path> import_paths);
473 : : } // namespace node
474 : :
475 : : #endif // BITCOIN_NODE_BLOCKSTORAGE_H
|
