Branch data Line data Source code
1 : : // Copyright (c) 2011-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 <node/blockstorage.h>
6 : :
7 : : #include <arith_uint256.h>
8 : : #include <chain.h>
9 : : #include <consensus/params.h>
10 : : #include <crypto/hex_base.h>
11 : : #include <dbwrapper.h>
12 : : #include <flatfile.h>
13 : : #include <hash.h>
14 : : #include <kernel/blockmanager_opts.h>
15 : : #include <kernel/chainparams.h>
16 : : #include <kernel/messagestartchars.h>
17 : : #include <kernel/notifications_interface.h>
18 : : #include <kernel/types.h>
19 : : #include <pow.h>
20 : : #include <primitives/block.h>
21 : : #include <primitives/transaction.h>
22 : : #include <random.h>
23 : : #include <serialize.h>
24 : : #include <signet.h>
25 : : #include <streams.h>
26 : : #include <sync.h>
27 : : #include <tinyformat.h>
28 : : #include <uint256.h>
29 : : #include <undo.h>
30 : : #include <util/check.h>
31 : : #include <util/expected.h>
32 : : #include <util/fs.h>
33 : : #include <util/log.h>
34 : : #include <util/obfuscation.h>
35 : : #include <util/overflow.h>
36 : : #include <util/result.h>
37 : : #include <util/signalinterrupt.h>
38 : : #include <util/strencodings.h>
39 : : #include <util/syserror.h>
40 : : #include <util/time.h>
41 : : #include <util/translation.h>
42 : : #include <validation.h>
43 : :
44 : : #include <cerrno>
45 : : #include <compare>
46 : : #include <cstddef>
47 : : #include <cstdio>
48 : : #include <exception>
49 : : #include <map>
50 : : #include <optional>
51 : : #include <ostream>
52 : : #include <span>
53 : : #include <stdexcept>
54 : : #include <system_error>
55 : : #include <unordered_map>
56 : :
57 : : namespace kernel {
58 : : static constexpr uint8_t DB_BLOCK_FILES{'f'};
59 : : static constexpr uint8_t DB_BLOCK_INDEX{'b'};
60 : : static constexpr uint8_t DB_FLAG{'F'};
61 : : static constexpr uint8_t DB_REINDEX_FLAG{'R'};
62 : : static constexpr uint8_t DB_LAST_BLOCK{'l'};
63 : : // Keys used in previous version that might still be found in the DB:
64 : : // BlockTreeDB::DB_TXINDEX_BLOCK{'T'};
65 : : // BlockTreeDB::DB_TXINDEX{'t'}
66 : : // BlockTreeDB::ReadFlag("txindex")
67 : :
68 : 2663 : bool BlockTreeDB::ReadBlockFileInfo(int nFile, CBlockFileInfo& info)
69 : : {
70 : 2663 : return Read(std::make_pair(DB_BLOCK_FILES, nFile), info);
71 : : }
72 : :
73 : 35 : void BlockTreeDB::WriteReindexing(bool fReindexing)
74 : : {
75 [ + + ]: 35 : if (fReindexing) {
76 : 18 : Write(DB_REINDEX_FLAG, uint8_t{'1'});
77 : : } else {
78 : 17 : Erase(DB_REINDEX_FLAG);
79 : : }
80 : 35 : }
81 : :
82 : 1245 : void BlockTreeDB::ReadReindexing(bool& fReindexing)
83 : : {
84 : 1245 : fReindexing = Exists(DB_REINDEX_FLAG);
85 : 1245 : }
86 : :
87 : 1246 : bool BlockTreeDB::ReadLastBlockFile(int& nFile)
88 : : {
89 : 1246 : return Read(DB_LAST_BLOCK, nFile);
90 : : }
91 : :
92 : 3560 : void BlockTreeDB::WriteBatchSync(const std::vector<std::pair<int, const CBlockFileInfo*>>& fileInfo, int nLastFile, const std::vector<const CBlockIndex*>& blockinfo)
93 : : {
94 : 3560 : CDBBatch batch(*this);
95 [ + - + + ]: 5393 : for (const auto& [file, info] : fileInfo) {
96 [ + - ]: 1833 : batch.Write(std::make_pair(DB_BLOCK_FILES, file), *info);
97 : : }
98 [ + - ]: 3560 : batch.Write(DB_LAST_BLOCK, nLastFile);
99 [ + + ]: 163211 : for (const CBlockIndex* bi : blockinfo) {
100 [ + - ]: 159651 : batch.Write(std::make_pair(DB_BLOCK_INDEX, bi->GetBlockHash()), CDiskBlockIndex{bi});
101 : : }
102 [ + - ]: 3560 : WriteBatch(batch, true);
103 : 3560 : }
104 : :
105 : 18 : void BlockTreeDB::WriteFlag(const std::string& name, bool fValue)
106 : : {
107 [ - + - + : 36 : Write(std::make_pair(DB_FLAG, name), fValue ? uint8_t{'1'} : uint8_t{'0'});
+ - ]
108 : 18 : }
109 : :
110 : 1245 : bool BlockTreeDB::ReadFlag(const std::string& name, bool& fValue)
111 : : {
112 : 1245 : uint8_t ch;
113 [ - + + - : 2490 : if (!Read(std::make_pair(DB_FLAG, name), ch)) {
+ + ]
114 : : return false;
115 : : }
116 : 21 : fValue = ch == uint8_t{'1'};
117 : 21 : return true;
118 : : }
119 : :
120 : 1248 : bool BlockTreeDB::LoadBlockIndexGuts(const Consensus::Params& consensusParams, std::function<CBlockIndex*(const uint256&)> insertBlockIndex, const util::SignalInterrupt& interrupt)
121 : : {
122 : 1248 : AssertLockHeld(::cs_main);
123 [ + - ]: 1248 : std::unique_ptr<CDBIterator> pcursor(NewIterator());
124 [ + - ]: 1248 : pcursor->Seek(std::make_pair(DB_BLOCK_INDEX, uint256()));
125 : :
126 : : // Load m_block_index
127 [ + - + + ]: 183517 : while (pcursor->Valid()) {
128 [ + - + - ]: 183060 : if (interrupt) return false;
129 : 183060 : std::pair<uint8_t, uint256> key;
130 [ + - + + : 183060 : if (pcursor->GetKey(key) && key.first == DB_BLOCK_INDEX) {
+ - ]
131 : 182269 : CDiskBlockIndex diskindex;
132 [ + - + - ]: 182269 : if (pcursor->GetValue(diskindex)) {
133 : : // Construct block index object
134 [ + - + - ]: 182269 : CBlockIndex* pindexNew = insertBlockIndex(diskindex.ConstructBlockHash());
135 [ + - ]: 182269 : pindexNew->pprev = insertBlockIndex(diskindex.hashPrev);
136 : 182269 : pindexNew->nHeight = diskindex.nHeight;
137 : 182269 : pindexNew->nFile = diskindex.nFile;
138 : 182269 : pindexNew->nDataPos = diskindex.nDataPos;
139 : 182269 : pindexNew->nUndoPos = diskindex.nUndoPos;
140 : 182269 : pindexNew->nVersion = diskindex.nVersion;
141 : 182269 : pindexNew->hashMerkleRoot = diskindex.hashMerkleRoot;
142 : 182269 : pindexNew->nTime = diskindex.nTime;
143 : 182269 : pindexNew->nBits = diskindex.nBits;
144 : 182269 : pindexNew->nNonce = diskindex.nNonce;
145 : 182269 : pindexNew->nStatus = diskindex.nStatus;
146 : 182269 : pindexNew->nTx = diskindex.nTx;
147 : :
148 [ + - - + ]: 182269 : if (!CheckProofOfWork(pindexNew->GetBlockHash(), pindexNew->nBits, consensusParams)) {
149 [ # # # # ]: 0 : LogError("%s: CheckProofOfWork failed: %s\n", __func__, pindexNew->ToString());
150 : 0 : return false;
151 : : }
152 : :
153 [ + - ]: 182269 : pcursor->Next();
154 : : } else {
155 [ # # ]: 0 : LogError("%s: failed to read value\n", __func__);
156 : : return false;
157 : : }
158 : : } else {
159 : : break;
160 : : }
161 : : }
162 : :
163 : : return true;
164 : 1248 : }
165 : :
166 : 1382 : std::string CBlockFileInfo::ToString() const
167 : : {
168 [ + - + - ]: 2764 : return strprintf("CBlockFileInfo(blocks=%u, size=%u, heights=%u...%u, time=%s...%s)", nBlocks, nSize, nHeightFirst, nHeightLast, FormatISO8601Date(nTimeFirst), FormatISO8601Date(nTimeLast));
169 : : }
170 : : } // namespace kernel
171 : :
172 : : namespace node {
173 : :
174 : 799538419 : bool CBlockIndexWorkComparator::operator()(const CBlockIndex* pa, const CBlockIndex* pb) const
175 : : {
176 : : // First sort by most total work, ...
177 [ + + ]: 799538419 : if (pa->nChainWork > pb->nChainWork) return false;
178 [ + + ]: 526245491 : if (pa->nChainWork < pb->nChainWork) return true;
179 : :
180 : : // ... then by earliest activatable time, ...
181 [ + + ]: 2773307 : if (pa->nSequenceId < pb->nSequenceId) return false;
182 [ + + ]: 2697385 : if (pa->nSequenceId > pb->nSequenceId) return true;
183 : :
184 : : // Use pointer address as tie breaker (should only happen with blocks
185 : : // loaded from disk, as those share the same id: 0 for blocks on the
186 : : // best chain, 1 for all others).
187 [ + + ]: 2622487 : if (pa < pb) return false;
188 [ + + ]: 2621731 : if (pa > pb) return true;
189 : :
190 : : // Identical blocks.
191 : : return false;
192 : : }
193 : :
194 : 3682264 : bool CBlockIndexHeightOnlyComparator::operator()(const CBlockIndex* pa, const CBlockIndex* pb) const
195 : : {
196 : 3682264 : return pa->nHeight < pb->nHeight;
197 : : }
198 : :
199 : 3774 : std::vector<CBlockIndex*> BlockManager::GetAllBlockIndices()
200 : : {
201 : 3774 : AssertLockHeld(cs_main);
202 : 3774 : std::vector<CBlockIndex*> rv;
203 [ + - ]: 3774 : rv.reserve(m_block_index.size());
204 [ + + + - ]: 555676 : for (auto& [_, block_index] : m_block_index) {
205 [ + - ]: 551902 : rv.push_back(&block_index);
206 : : }
207 : 3774 : return rv;
208 : 0 : }
209 : :
210 : 708714 : CBlockIndex* BlockManager::LookupBlockIndex(const uint256& hash)
211 : : {
212 : 708714 : AssertLockHeld(cs_main);
213 : 708714 : BlockMap::iterator it = m_block_index.find(hash);
214 [ + + ]: 708714 : return it == m_block_index.end() ? nullptr : &it->second;
215 : : }
216 : :
217 : 6 : const CBlockIndex* BlockManager::LookupBlockIndex(const uint256& hash) const
218 : : {
219 : 6 : AssertLockHeld(cs_main);
220 : 6 : BlockMap::const_iterator it = m_block_index.find(hash);
221 [ + + ]: 6 : return it == m_block_index.end() ? nullptr : &it->second;
222 : : }
223 : :
224 : 147822 : CBlockIndex* BlockManager::AddToBlockIndex(const CBlockHeader& block, CBlockIndex*& best_header)
225 : : {
226 : 147822 : AssertLockHeld(cs_main);
227 : :
228 [ + + ]: 147822 : auto [mi, inserted] = m_block_index.try_emplace(block.GetHash(), block);
229 [ + + ]: 147822 : if (!inserted) {
230 : 3 : return &mi->second;
231 : : }
232 : 147819 : CBlockIndex* pindexNew = &(*mi).second;
233 : :
234 : : // We assign the sequence id to blocks only when the full data is available,
235 : : // to avoid miners withholding blocks but broadcasting headers, to get a
236 : : // competitive advantage.
237 : 147819 : pindexNew->nSequenceId = SEQ_ID_INIT_FROM_DISK;
238 : :
239 : 147819 : pindexNew->phashBlock = &((*mi).first);
240 : 147819 : BlockMap::iterator miPrev = m_block_index.find(block.hashPrevBlock);
241 [ + + ]: 147819 : if (miPrev != m_block_index.end()) {
242 : 147346 : pindexNew->pprev = &(*miPrev).second;
243 : 147346 : pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
244 : 147346 : pindexNew->BuildSkip();
245 : : }
246 [ + + + + ]: 147819 : pindexNew->nTimeMax = (pindexNew->pprev ? std::max(pindexNew->pprev->nTimeMax, pindexNew->nTime) : pindexNew->nTime);
247 [ + + ]: 147819 : pindexNew->nChainWork = (pindexNew->pprev ? pindexNew->pprev->nChainWork : 0) + GetBlockProof(*pindexNew);
248 : 147819 : pindexNew->RaiseValidity(BLOCK_VALID_TREE);
249 [ + + + + ]: 147819 : if (best_header == nullptr || best_header->nChainWork < pindexNew->nChainWork) {
250 : 126655 : best_header = pindexNew;
251 : : }
252 : :
253 : 147819 : m_dirty_blockindex.insert(pindexNew);
254 : :
255 : 147819 : return pindexNew;
256 : : }
257 : :
258 : 76 : void BlockManager::PruneOneBlockFile(const int fileNumber)
259 : : {
260 : 76 : AssertLockHeld(cs_main);
261 : :
262 [ + + ]: 130009 : for (auto& entry : m_block_index) {
263 : 129933 : CBlockIndex* pindex = &entry.second;
264 : 129933 : if (pindex->nFile == fileNumber) {
265 : 18215 : pindex->nStatus &= ~BLOCK_HAVE_DATA;
266 : 18215 : pindex->nStatus &= ~BLOCK_HAVE_UNDO;
267 : 18215 : pindex->nFile = 0;
268 : 18215 : pindex->nDataPos = 0;
269 : 18215 : pindex->nUndoPos = 0;
270 : 18215 : m_dirty_blockindex.insert(pindex);
271 : :
272 : : // Prune from m_blocks_unlinked -- any block we prune would have
273 : : // to be downloaded again in order to consider its chain, at which
274 : : // point it would be considered as a candidate for
275 : : // m_blocks_unlinked or setBlockIndexCandidates.
276 : 18215 : auto range = m_blocks_unlinked.equal_range(pindex->pprev);
277 [ + + ]: 36431 : while (range.first != range.second) {
278 : 1 : std::multimap<CBlockIndex*, CBlockIndex*>::iterator _it = range.first;
279 : 1 : range.first++;
280 [ + - ]: 1 : if (_it->second == pindex) {
281 : 1 : m_blocks_unlinked.erase(_it);
282 : : }
283 : : }
284 : : }
285 : : }
286 : :
287 : 76 : m_blockfile_info.at(fileNumber) = CBlockFileInfo{};
288 : 76 : m_dirty_fileinfo.insert(fileNumber);
289 : 76 : }
290 : :
291 : 31 : void BlockManager::FindFilesToPruneManual(
292 : : std::set<int>& setFilesToPrune,
293 : : int nManualPruneHeight,
294 : : const Chainstate& chain)
295 : : {
296 [ + - - + ]: 31 : assert(IsPruneMode() && nManualPruneHeight > 0);
297 : :
298 : 31 : LOCK(::cs_main);
299 [ - + - + ]: 31 : if (chain.m_chain.Height() < 0) {
300 [ # # ]: 0 : return;
301 : : }
302 : :
303 [ + - ]: 31 : const auto [min_block_to_prune, last_block_can_prune] = chain.GetPruneRange(nManualPruneHeight);
304 : :
305 : 31 : int count = 0;
306 [ + + ]: 160 : for (int fileNumber = 0; fileNumber < this->MaxBlockfileNum(); fileNumber++) {
307 [ + + ]: 129 : const auto& fileinfo = m_blockfile_info[fileNumber];
308 [ + + + + : 129 : if (fileinfo.nSize == 0 || fileinfo.nHeightLast > (unsigned)last_block_can_prune || fileinfo.nHeightFirst < (unsigned)min_block_to_prune) {
- + ]
309 : 72 : continue;
310 : : }
311 : :
312 [ + - ]: 57 : PruneOneBlockFile(fileNumber);
313 [ + - ]: 57 : setFilesToPrune.insert(fileNumber);
314 : 57 : count++;
315 : : }
316 [ + - + - : 31 : LogInfo("[%s] Prune (Manual): prune_height=%d removed %d blk/rev pairs",
+ - ]
317 : : chain.GetRole(), last_block_can_prune, count);
318 : 31 : }
319 : :
320 : 634 : void BlockManager::FindFilesToPrune(
321 : : std::set<int>& setFilesToPrune,
322 : : int last_prune,
323 : : const Chainstate& chain,
324 : : ChainstateManager& chainman)
325 : : {
326 : 634 : LOCK(::cs_main);
327 : : // Compute `target` value with maximum size (in bytes) of blocks below the
328 : : // `last_prune` height which should be preserved and not pruned. The
329 : : // `target` value will be derived from the -prune preference provided by the
330 : : // user. If there is a historical chainstate being used to populate indexes
331 : : // and validate the snapshot, the target is divided by two so half of the
332 : : // block storage will be reserved for the historical chainstate, and the
333 : : // other half will be reserved for the most-work chainstate.
334 [ + + ]: 634 : const int num_chainstates{chainman.HistoricalChainstate() ? 2 : 1};
335 [ + + ]: 634 : const auto target = std::max(
336 [ + + ]: 634 : MIN_DISK_SPACE_FOR_BLOCK_FILES, GetPruneTarget() / num_chainstates);
337 : 634 : const uint64_t target_sync_height = chainman.m_best_header->nHeight;
338 : :
339 [ - + + + : 634 : if (chain.m_chain.Height() < 0 || target == 0) {
+ - ]
340 : : return;
341 : : }
342 [ + + ]: 615 : if (static_cast<uint64_t>(chain.m_chain.Height()) <= chainman.GetParams().PruneAfterHeight()) {
343 : : return;
344 : : }
345 : :
346 [ + - + - ]: 505 : const auto [min_block_to_prune, last_block_can_prune] = chain.GetPruneRange(last_prune);
347 : :
348 [ + - ]: 505 : uint64_t nCurrentUsage = CalculateCurrentUsage();
349 : : // We don't check to prune until after we've allocated new space for files
350 : : // So we should leave a buffer under our target to account for another allocation
351 : : // before the next pruning.
352 : 505 : uint64_t nBuffer = BLOCKFILE_CHUNK_SIZE + UNDOFILE_CHUNK_SIZE;
353 : 505 : uint64_t nBytesToPrune;
354 : 505 : int count = 0;
355 : :
356 [ + + ]: 505 : if (nCurrentUsage + nBuffer >= target) {
357 : : // On a prune event, the chainstate DB is flushed.
358 : : // To avoid excessive prune events negating the benefit of high dbcache
359 : : // values, we should not prune too rapidly.
360 : : // So when pruning in IBD, increase the buffer to avoid a re-prune too soon.
361 [ - + ]: 23 : const auto chain_tip_height = chain.m_chain.Height();
362 [ - + - - ]: 23 : if (chainman.IsInitialBlockDownload() && target_sync_height > (uint64_t)chain_tip_height) {
363 : : // Since this is only relevant during IBD, we assume blocks are at least 1 MB on average
364 : 0 : static constexpr uint64_t average_block_size = 1000000; /* 1 MB */
365 : 0 : const uint64_t remaining_blocks = target_sync_height - chain_tip_height;
366 : 0 : nBuffer += average_block_size * remaining_blocks;
367 : : }
368 : :
369 [ + + ]: 169 : for (int fileNumber = 0; fileNumber < this->MaxBlockfileNum(); fileNumber++) {
370 [ + + ]: 158 : const auto& fileinfo = m_blockfile_info[fileNumber];
371 : 158 : nBytesToPrune = fileinfo.nSize + fileinfo.nUndoSize;
372 : :
373 [ + + ]: 158 : if (fileinfo.nSize == 0) {
374 : 86 : continue;
375 : : }
376 : :
377 [ + + ]: 72 : if (nCurrentUsage + nBuffer < target) { // are we below our target?
378 : : break;
379 : : }
380 : :
381 : : // don't prune files that could have a block that's not within the allowable
382 : : // prune range for the chain being pruned.
383 [ + + - + ]: 60 : if (fileinfo.nHeightLast > (unsigned)last_block_can_prune || fileinfo.nHeightFirst < (unsigned)min_block_to_prune) {
384 : 44 : continue;
385 : : }
386 : :
387 [ + - ]: 16 : PruneOneBlockFile(fileNumber);
388 : : // Queue up the files for removal
389 [ + - ]: 16 : setFilesToPrune.insert(fileNumber);
390 : 16 : nCurrentUsage -= nBytesToPrune;
391 : 16 : count++;
392 : : }
393 : : }
394 : :
395 [ + - + - : 505 : LogDebug(BCLog::PRUNE, "[%s] target=%dMiB actual=%dMiB diff=%dMiB min_height=%d max_prune_height=%d removed %d blk/rev pairs\n",
+ - + - +
- ]
396 : : chain.GetRole(), target / 1_MiB, nCurrentUsage / 1_MiB,
397 : : (int64_t(target) - int64_t(nCurrentUsage)) / int64_t(1_MiB),
398 : : min_block_to_prune, last_block_can_prune, count);
399 : 634 : }
400 : :
401 : 20733 : void BlockManager::UpdatePruneLock(const std::string& name, const PruneLockInfo& lock_info) {
402 : 20733 : AssertLockHeld(::cs_main);
403 : 20733 : m_prune_locks[name] = lock_info;
404 : 20733 : }
405 : :
406 : 3 : bool BlockManager::DeletePruneLock(const std::string& name)
407 : : {
408 : 3 : AssertLockHeld(::cs_main);
409 : 3 : return m_prune_locks.erase(name) > 0;
410 : : }
411 : :
412 : 364538 : CBlockIndex* BlockManager::InsertBlockIndex(const uint256& hash)
413 : : {
414 : 364538 : AssertLockHeld(cs_main);
415 : :
416 [ + + ]: 729076 : if (hash.IsNull()) {
417 : : return nullptr;
418 : : }
419 : :
420 [ + + ]: 363748 : const auto [mi, inserted]{m_block_index.try_emplace(hash)};
421 [ + + ]: 363748 : CBlockIndex* pindex = &(*mi).second;
422 [ + + ]: 363748 : if (inserted) {
423 : 181282 : pindex->phashBlock = &((*mi).first);
424 : : }
425 : : return pindex;
426 : : }
427 : :
428 : 1248 : bool BlockManager::LoadBlockIndex(const std::optional<uint256>& snapshot_blockhash)
429 : : {
430 [ + - ]: 1248 : if (!m_block_tree_db->LoadBlockIndexGuts(
431 [ + - + - ]: 367034 : GetConsensus(), [this](const uint256& hash) EXCLUSIVE_LOCKS_REQUIRED(cs_main) { return this->InsertBlockIndex(hash); }, m_interrupt)) {
432 : : return false;
433 : : }
434 : :
435 [ + + ]: 1248 : if (snapshot_blockhash) {
436 : 8 : const std::optional<AssumeutxoData> maybe_au_data = GetParams().AssumeutxoForBlockhash(*snapshot_blockhash);
437 [ + + ]: 8 : if (!maybe_au_data) {
438 [ + - + - ]: 2 : m_opts.notifications.fatalError(strprintf(_("Assumeutxo data not found for the given blockhash '%s'."), snapshot_blockhash->ToString()));
439 : 1 : return false;
440 : : }
441 : 7 : const AssumeutxoData& au_data = *Assert(maybe_au_data);
442 : 7 : m_snapshot_height = au_data.height;
443 : 7 : CBlockIndex* base{LookupBlockIndex(*snapshot_blockhash)};
444 : :
445 : : // Since m_chain_tx_count (responsible for estimated progress) isn't persisted
446 : : // to disk, we must bootstrap the value for assumedvalid chainstates
447 : : // from the hardcoded assumeutxo chainparams.
448 : 7 : base->m_chain_tx_count = au_data.m_chain_tx_count;
449 [ + - ]: 7 : LogInfo("[snapshot] set m_chain_tx_count=%d for %s", au_data.m_chain_tx_count, snapshot_blockhash->ToString());
450 : : } else {
451 : : // If this isn't called with a snapshot blockhash, make sure the cached snapshot height
452 : : // is null. This is relevant during snapshot completion, when the blockman may be loaded
453 : : // with a height that then needs to be cleared after the snapshot is fully validated.
454 [ + + ]: 1240 : m_snapshot_height.reset();
455 : : }
456 : :
457 [ - + ]: 1247 : Assert(m_snapshot_height.has_value() == snapshot_blockhash.has_value());
458 : :
459 : : // Calculate nChainWork
460 : 1247 : std::vector<CBlockIndex*> vSortedByHeight{GetAllBlockIndices()};
461 [ + - ]: 1247 : std::sort(vSortedByHeight.begin(), vSortedByHeight.end(),
462 : : CBlockIndexHeightOnlyComparator());
463 : :
464 : 1247 : CBlockIndex* previous_index{nullptr};
465 [ + + ]: 183317 : for (CBlockIndex* pindex : vSortedByHeight) {
466 [ + - + - ]: 182071 : if (m_interrupt) return false;
467 [ + + + + ]: 182071 : if (previous_index && pindex->nHeight > previous_index->nHeight + 1) {
468 [ + - ]: 1247 : LogError("%s: block index is non-contiguous, index of height %d missing\n", __func__, previous_index->nHeight + 1);
469 : : return false;
470 : : }
471 : 182070 : previous_index = pindex;
472 [ + - + + : 182070 : pindex->nChainWork = (pindex->pprev ? pindex->pprev->nChainWork : 0) + GetBlockProof(*pindex);
+ + ]
473 [ + + + + ]: 182070 : pindex->nTimeMax = (pindex->pprev ? std::max(pindex->pprev->nTimeMax, pindex->nTime) : pindex->nTime);
474 : :
475 : : // We can link the chain of blocks for which we've received transactions at some point, or
476 : : // blocks that are assumed-valid on the basis of snapshot load (see
477 : : // PopulateAndValidateSnapshot()).
478 : : // Pruned nodes may have deleted the block.
479 [ + + ]: 182070 : if (pindex->nTx > 0) {
480 [ + + ]: 180557 : if (pindex->pprev) {
481 [ + + + + : 179769 : if (m_snapshot_height && pindex->nHeight == *m_snapshot_height &&
+ - ]
482 [ + - ]: 4 : pindex->GetBlockHash() == *snapshot_blockhash) {
483 : : // Should have been set above; don't disturb it with code below.
484 [ - + ]: 4 : Assert(pindex->m_chain_tx_count > 0);
485 [ + + ]: 179761 : } else if (pindex->pprev->m_chain_tx_count > 0) {
486 : 179756 : pindex->m_chain_tx_count = pindex->pprev->m_chain_tx_count + pindex->nTx;
487 : : } else {
488 : 5 : pindex->m_chain_tx_count = 0;
489 [ + + ]: 5 : if (pindex->nStatus & BLOCK_HAVE_DATA) {
490 [ + - ]: 4 : m_blocks_unlinked.insert(std::make_pair(pindex->pprev, pindex));
491 : : }
492 : : }
493 : : } else {
494 : 792 : pindex->m_chain_tx_count = pindex->nTx;
495 : : }
496 : : }
497 : :
498 [ + + ]: 182070 : if (pindex->nStatus & BLOCK_FAILED_CHILD) {
499 : : // BLOCK_FAILED_CHILD is deprecated, but may still exist on disk. Replace it with BLOCK_FAILED_VALID.
500 : 1 : pindex->nStatus = (pindex->nStatus & ~BLOCK_FAILED_CHILD) | BLOCK_FAILED_VALID;
501 [ + - ]: 1 : m_dirty_blockindex.insert(pindex);
502 : : }
503 [ + + + + : 182070 : if (!(pindex->nStatus & BLOCK_FAILED_VALID) && pindex->pprev && (pindex->pprev->nStatus & BLOCK_FAILED_VALID)) {
+ + ]
504 : : // All descendants of invalid blocks are invalid too.
505 : 1 : pindex->nStatus |= BLOCK_FAILED_VALID;
506 [ + - ]: 1 : m_dirty_blockindex.insert(pindex);
507 : : }
508 : :
509 [ + + ]: 182070 : if (pindex->pprev) {
510 [ + - ]: 181251 : pindex->BuildSkip();
511 : : }
512 : : }
513 : :
514 : : return true;
515 : 1247 : }
516 : :
517 : 3560 : void BlockManager::WriteBlockIndexDB()
518 : : {
519 : 3560 : AssertLockHeld(::cs_main);
520 : 3560 : std::vector<std::pair<int, const CBlockFileInfo*>> vFiles;
521 [ + - ]: 3560 : vFiles.reserve(m_dirty_fileinfo.size());
522 [ + + ]: 5393 : for (std::set<int>::iterator it = m_dirty_fileinfo.begin(); it != m_dirty_fileinfo.end();) {
523 [ + - ]: 1833 : vFiles.emplace_back(*it, &m_blockfile_info[*it]);
524 : 1833 : m_dirty_fileinfo.erase(it++);
525 : : }
526 : 3560 : std::vector<const CBlockIndex*> vBlocks;
527 [ + - ]: 3560 : vBlocks.reserve(m_dirty_blockindex.size());
528 [ + + ]: 163211 : for (std::set<CBlockIndex*>::iterator it = m_dirty_blockindex.begin(); it != m_dirty_blockindex.end();) {
529 [ + - ]: 159651 : vBlocks.push_back(*it);
530 : 159651 : m_dirty_blockindex.erase(it++);
531 : : }
532 : 3560 : int max_blockfile{this->MaxBlockfileNum()};
533 [ + - ]: 3560 : m_block_tree_db->WriteBatchSync(vFiles, max_blockfile, vBlocks);
534 : 3560 : }
535 : :
536 : 1248 : bool BlockManager::LoadBlockIndexDB(const std::optional<uint256>& snapshot_blockhash)
537 : : {
538 : 1248 : AssertLockHeld(::cs_main);
539 [ + + ]: 1248 : if (!LoadBlockIndex(snapshot_blockhash)) {
540 : : return false;
541 : : }
542 : 1246 : int max_blockfile_num{0};
543 : :
544 : : // Load block file info
545 : 1246 : m_block_tree_db->ReadLastBlockFile(max_blockfile_num);
546 : 1246 : m_blockfile_info.resize(max_blockfile_num + 1);
547 : 1246 : LogInfo("Loading block index db: last block file = %i", max_blockfile_num);
548 [ + + ]: 2663 : for (int nFile = 0; nFile <= max_blockfile_num; nFile++) {
549 : 1417 : m_block_tree_db->ReadBlockFileInfo(nFile, m_blockfile_info[nFile]);
550 : : }
551 [ + - ]: 1246 : LogInfo("Loading block index db: last block file info: %s", m_blockfile_info[max_blockfile_num].ToString());
552 : 1246 : for (int nFile = max_blockfile_num + 1; true; nFile++) {
553 : 1246 : CBlockFileInfo info;
554 [ - + ]: 1246 : if (m_block_tree_db->ReadBlockFileInfo(nFile, info)) {
555 : 0 : m_blockfile_info.push_back(info);
556 : : } else {
557 : : break;
558 : : }
559 : 0 : }
560 : :
561 : : // Check presence of blk files
562 : 1246 : LogInfo("Checking all blk files are present...");
563 : 1246 : std::set<int> setBlkDataFiles;
564 [ + + + + ]: 183287 : for (const auto& [_, block_index] : m_block_index) {
565 [ + + ]: 182041 : if (block_index.nStatus & BLOCK_HAVE_DATA) {
566 [ + - ]: 159164 : setBlkDataFiles.insert(block_index.nFile);
567 : : }
568 : : }
569 [ + + ]: 2118 : for (std::set<int>::iterator it = setBlkDataFiles.begin(); it != setBlkDataFiles.end(); it++) {
570 [ + - ]: 873 : FlatFilePos pos(*it, 0);
571 [ + - + + ]: 873 : if (OpenBlockFile(pos, /*fReadOnly=*/true).IsNull()) {
572 : : return false;
573 : : }
574 : : }
575 : :
576 : : {
577 : : // Initialize the blockfile cursors.
578 [ - + + + ]: 2661 : for (size_t i = 0; i < m_blockfile_info.size(); ++i) {
579 [ + - ]: 1416 : const auto last_height_in_file = m_blockfile_info[i].nHeightLast;
580 [ + - + + ]: 2832 : m_blockfile_cursors[BlockfileTypeForHeight(last_height_in_file)] = {static_cast<int>(i), 0};
581 : : }
582 : : }
583 : :
584 : : // Check whether we have ever pruned block & undo files
585 [ + - + - ]: 1245 : m_block_tree_db->ReadFlag("prunedblockfiles", m_have_pruned);
586 [ + + ]: 1245 : if (m_have_pruned) {
587 [ + - ]: 21 : LogInfo("Loading block index db: Block files have previously been pruned");
588 : : }
589 : :
590 : : // Check whether we need to continue reindexing
591 : 1245 : bool fReindexing = false;
592 [ + - ]: 1245 : m_block_tree_db->ReadReindexing(fReindexing);
593 [ + + ]: 1245 : if (fReindexing) m_blockfiles_indexed = false;
594 : :
595 : : return true;
596 : 1246 : }
597 : :
598 : 1248 : void BlockManager::ScanAndUnlinkAlreadyPrunedFiles()
599 : : {
600 : 1248 : AssertLockHeld(::cs_main);
601 : 1248 : int max_blockfile{this->MaxBlockfileNum()};
602 [ + + ]: 1248 : if (!m_have_pruned) {
603 : : return;
604 : : }
605 : :
606 : 23 : std::set<int> block_files_to_prune;
607 [ + + ]: 156 : for (int file_number = 0; file_number < max_blockfile; file_number++) {
608 [ + + ]: 133 : if (m_blockfile_info[file_number].nSize == 0) {
609 [ + - ]: 92 : block_files_to_prune.insert(file_number);
610 : : }
611 : : }
612 : :
613 [ + - ]: 23 : UnlinkPrunedFiles(block_files_to_prune);
614 : 23 : }
615 : :
616 : 434 : bool BlockManager::IsBlockPruned(const CBlockIndex& block) const
617 : : {
618 : 434 : AssertLockHeld(::cs_main);
619 [ + + + - : 434 : return m_have_pruned && !(block.nStatus & BLOCK_HAVE_DATA) && (block.nTx > 0);
- + ]
620 : : }
621 : :
622 : 128 : const CBlockIndex& BlockManager::GetFirstBlock(const CBlockIndex& upper_block, uint32_t status_mask, const CBlockIndex* lower_block) const
623 : : {
624 : 128 : AssertLockHeld(::cs_main);
625 : 128 : const CBlockIndex* last_block = &upper_block;
626 [ - + ]: 128 : assert((last_block->nStatus & status_mask) == status_mask); // 'upper_block' must satisfy the status mask
627 [ + + + + ]: 46097 : while (last_block->pprev && ((last_block->pprev->nStatus & status_mask) == status_mask)) {
628 [ + + ]: 45983 : if (lower_block) {
629 : : // Return if we reached the lower_block
630 [ + + ]: 45834 : if (last_block == lower_block) return *lower_block;
631 : : // if range was surpassed, means that 'lower_block' is not part of the 'upper_block' chain
632 : : // and so far this is not allowed.
633 [ - + ]: 45820 : assert(last_block->nHeight >= lower_block->nHeight);
634 : : }
635 : : last_block = last_block->pprev;
636 : : }
637 [ - + ]: 114 : assert(last_block != nullptr);
638 : : return *last_block;
639 : : }
640 : :
641 : 49 : bool BlockManager::CheckBlockDataAvailability(const CBlockIndex& upper_block, const CBlockIndex& lower_block, BlockStatus block_status)
642 : : {
643 [ + - ]: 49 : if (!(upper_block.nStatus & block_status)) return false;
644 : 49 : const auto& first_block = GetFirstBlock(upper_block, block_status, &lower_block);
645 : : // Special case: the genesis block has no undo data
646 [ + + + + : 49 : if (block_status & BLOCK_HAVE_UNDO && lower_block.nHeight == 0 && first_block.nHeight == 1) {
+ + ]
647 : : // This might indicate missing data, or it could simply reflect the expected absence of undo data for the genesis block.
648 : : // To distinguish between the two, check if all required block data *except* undo is available up to the genesis block.
649 : 16 : BlockStatus flags{block_status & ~BLOCK_HAVE_UNDO};
650 [ + - - + ]: 16 : return first_block.pprev && first_block.pprev->nStatus & flags;
651 : : }
652 : 33 : return &first_block == &lower_block;
653 : : }
654 : :
655 : : // If we're using -prune with -reindex, then delete block files that will be ignored by the
656 : : // reindex. Since reindexing works by starting at block file 0 and looping until a blockfile
657 : : // is missing, do the same here to delete any later block files after a gap. Also delete all
658 : : // rev files since they'll be rewritten by the reindex anyway. This ensures that m_blockfile_info
659 : : // is in sync with what's actually on disk by the time we start downloading, so that pruning
660 : : // works correctly.
661 : 5 : void BlockManager::CleanupBlockRevFiles() const
662 : : {
663 [ + - ]: 5 : std::map<std::string, fs::path> mapBlockFiles;
664 : :
665 : : // Glob all blk?????.dat and rev?????.dat files from the blocks directory.
666 : : // Remove the rev files immediately and insert the blk file paths into an
667 : : // ordered map keyed by block file index.
668 [ + - ]: 5 : LogInfo("Removing unusable blk?????.dat and rev?????.dat files for -reindex with -prune");
669 [ + - + + : 53 : for (fs::directory_iterator it(m_opts.blocks_dir); it != fs::directory_iterator(); it++) {
+ + ]
670 [ + - - + ]: 172 : const std::string path = fs::PathToString(it->path().filename());
671 [ + - ]: 43 : if (fs::is_regular_file(*it) &&
672 [ + + + + ]: 81 : path.length() == 12 &&
673 [ + - ]: 28 : path.ends_with(".dat"))
674 : : {
675 [ + + ]: 28 : if (path.starts_with("blk")) {
676 [ + - + - : 28 : mapBlockFiles[path.substr(3, 5)] = it->path();
+ - ]
677 [ + - ]: 14 : } else if (path.starts_with("rev")) {
678 [ + - ]: 14 : remove(it->path());
679 : : }
680 : : }
681 [ + - ]: 43 : }
682 : :
683 : : // Remove all block files that aren't part of a contiguous set starting at
684 : : // zero by walking the ordered map (keys are block file indices) by
685 : : // keeping a separate counter. Once we hit a gap (or if 0 doesn't exist)
686 : : // start removing block files.
687 : 5 : int nContigCounter = 0;
688 [ + + ]: 19 : for (const std::pair<const std::string, fs::path>& item : mapBlockFiles) {
689 [ - + + - : 14 : if (LocaleIndependentAtoi<int>(item.first) == nContigCounter) {
+ + ]
690 : 1 : nContigCounter++;
691 : 1 : continue;
692 : : }
693 [ + - ]: 13 : remove(item.second);
694 : : }
695 : 5 : }
696 : :
697 : 3 : CBlockFileInfo* BlockManager::GetBlockFileInfo(size_t n)
698 : : {
699 : 3 : AssertLockHeld(::cs_main);
700 : 3 : return &m_blockfile_info.at(n);
701 : : }
702 : :
703 : 56427 : bool BlockManager::ReadBlockUndo(CBlockUndo& blockundo, const CBlockIndex& index) const
704 : : {
705 [ + - ]: 112854 : const FlatFilePos pos{WITH_LOCK(::cs_main, return index.GetUndoPos())};
706 : :
707 : : // Open history file to read
708 : 56427 : AutoFile file{OpenUndoFile(pos, true)};
709 [ + + ]: 56427 : if (file.IsNull()) {
710 [ + - + - ]: 6 : LogError("OpenUndoFile failed for %s while reading block undo", pos.ToString());
711 : 6 : return false;
712 : : }
713 [ + - ]: 56421 : BufferedReader filein{std::move(file)};
714 : :
715 : 56421 : try {
716 : : // Read block
717 [ + - ]: 56421 : HashVerifier verifier{filein}; // Use HashVerifier, as reserializing may lose data, c.f. commit d3424243
718 : :
719 [ + - ]: 56421 : verifier << index.pprev->GetBlockHash();
720 [ + + ]: 56421 : verifier >> blockundo;
721 : :
722 : 56420 : uint256 hashChecksum;
723 [ + - ]: 56420 : filein >> hashChecksum;
724 : :
725 : : // Verify checksum
726 [ + - - + ]: 56420 : if (hashChecksum != verifier.GetHash()) {
727 [ # # # # ]: 0 : LogError("Checksum mismatch at %s while reading block undo", pos.ToString());
728 : 0 : return false;
729 : : }
730 [ - + ]: 1 : } catch (const std::exception& e) {
731 [ + - + - ]: 1 : LogError("Deserialize or I/O error - %s at %s while reading block undo", e.what(), pos.ToString());
732 : 1 : return false;
733 : 1 : }
734 : :
735 : : return true;
736 : 56427 : }
737 : :
738 : 3670 : bool BlockManager::FlushUndoFile(int block_file, bool finalize)
739 : : {
740 : 3670 : FlatFilePos undo_pos_old(block_file, m_blockfile_info[block_file].nUndoSize);
741 [ - + ]: 3670 : if (!m_undo_file_seq.Flush(undo_pos_old, finalize)) {
742 [ # # ]: 0 : m_opts.notifications.flushError(_("Flushing undo file to disk failed. This is likely the result of an I/O error."));
743 : 0 : return false;
744 : : }
745 : : return true;
746 : : }
747 : :
748 : 3671 : bool BlockManager::FlushBlockFile(int blockfile_num, bool fFinalize, bool finalize_undo)
749 : : {
750 : 3671 : AssertLockHeld(::cs_main);
751 : 3671 : bool success = true;
752 : :
753 [ - + + - ]: 3671 : if (m_blockfile_info.size() < 1) {
754 : : // Return if we haven't loaded any blockfiles yet. This happens during
755 : : // chainstate init, when we call ChainstateManager::MaybeRebalanceCaches() (which
756 : : // then calls FlushStateToDisk()), resulting in a call to this function before we
757 : : // have populated `m_blockfile_info` via LoadBlockIndexDB().
758 : : return true;
759 : : }
760 [ - + ]: 3671 : assert(static_cast<int>(m_blockfile_info.size()) > blockfile_num);
761 : :
762 : 3671 : FlatFilePos block_pos_old(blockfile_num, m_blockfile_info[blockfile_num].nSize);
763 [ - + ]: 3671 : if (!m_block_file_seq.Flush(block_pos_old, fFinalize)) {
764 [ # # ]: 0 : m_opts.notifications.flushError(_("Flushing block file to disk failed. This is likely the result of an I/O error."));
765 : 0 : success = false;
766 : : }
767 : : // we do not always flush the undo file, as the chain tip may be lagging behind the incoming blocks,
768 : : // e.g. during IBD or a sync after a node going offline
769 [ + + ]: 3671 : if (!fFinalize || finalize_undo) {
770 [ - + ]: 3669 : if (!FlushUndoFile(blockfile_num, finalize_undo)) {
771 : 0 : success = false;
772 : : }
773 : : }
774 : : return success;
775 : : }
776 : :
777 : 272628 : BlockfileType BlockManager::BlockfileTypeForHeight(int height)
778 : : {
779 [ + + ]: 272628 : if (!m_snapshot_height) {
780 : : return BlockfileType::NORMAL;
781 : : }
782 [ + + ]: 5468 : return (height >= *m_snapshot_height) ? BlockfileType::ASSUMED : BlockfileType::NORMAL;
783 : : }
784 : :
785 : 3560 : bool BlockManager::FlushChainstateBlockFile(int tip_height)
786 : : {
787 : 3560 : AssertLockHeld(::cs_main);
788 [ + + ]: 3560 : auto& cursor = m_blockfile_cursors[BlockfileTypeForHeight(tip_height)];
789 : : // If the cursor does not exist, it means an assumeutxo snapshot is loaded,
790 : : // but no blocks past the snapshot height have been written yet, so there
791 : : // is no data associated with the chainstate, and it is safe not to flush.
792 [ + + ]: 3560 : if (cursor) {
793 : 3535 : return FlushBlockFile(cursor->file_num, /*fFinalize=*/false, /*finalize_undo=*/false);
794 : : }
795 : : // No need to log warnings in this case.
796 : : return true;
797 : : }
798 : :
799 : 16131 : uint64_t BlockManager::CalculateCurrentUsage()
800 : : {
801 : 16131 : AssertLockHeld(::cs_main);
802 : 16131 : uint64_t retval = 0;
803 [ + + ]: 34737 : for (const CBlockFileInfo& file : m_blockfile_info) {
804 : 18606 : retval += file.nSize + file.nUndoSize;
805 : : }
806 : 16131 : return retval;
807 : : }
808 : :
809 : 63 : void BlockManager::UnlinkPrunedFiles(const std::set<int>& setFilesToPrune) const
810 : : {
811 : 63 : std::error_code ec;
812 [ + + ]: 230 : for (std::set<int>::iterator it = setFilesToPrune.begin(); it != setFilesToPrune.end(); ++it) {
813 : 167 : FlatFilePos pos(*it, 0);
814 : 167 : const bool removed_blockfile{fs::remove(m_block_file_seq.FileName(pos), ec)};
815 : 167 : const bool removed_undofile{fs::remove(m_undo_file_seq.FileName(pos), ec)};
816 [ + + ]: 167 : if (removed_blockfile || removed_undofile) {
817 [ + - ]: 76 : LogDebug(BCLog::BLOCKSTORAGE, "Prune: %s deleted blk/rev (%05u)\n", __func__, *it);
818 : : }
819 : : }
820 : 63 : }
821 : :
822 : 310998 : AutoFile BlockManager::OpenBlockFile(const FlatFilePos& pos, bool fReadOnly) const
823 : : {
824 : 310998 : return AutoFile{m_block_file_seq.Open(pos, fReadOnly), m_obfuscation};
825 : : }
826 : :
827 : : /** Open an undo file (rev?????.dat) */
828 : 184812 : AutoFile BlockManager::OpenUndoFile(const FlatFilePos& pos, bool fReadOnly) const
829 : : {
830 : 184812 : return AutoFile{m_undo_file_seq.Open(pos, fReadOnly), m_obfuscation};
831 : : }
832 : :
833 : 35 : fs::path BlockManager::GetBlockPosFilename(const FlatFilePos& pos) const
834 : : {
835 : 35 : return m_block_file_seq.FileName(pos);
836 : : }
837 : :
838 : 131608 : FlatFilePos BlockManager::FindNextBlockPos(unsigned int nAddSize, unsigned int nHeight, uint64_t nTime)
839 : : {
840 : 131608 : AssertLockHeld(::cs_main);
841 : 131608 : const BlockfileType chain_type = BlockfileTypeForHeight(nHeight);
842 : :
843 [ + + ]: 131608 : if (!m_blockfile_cursors[chain_type]) {
844 : : // If a snapshot is loaded during runtime, we may not have initialized this cursor yet.
845 [ - + ]: 13 : assert(chain_type == BlockfileType::ASSUMED);
846 : 13 : const auto new_cursor = BlockfileCursor{this->MaxBlockfileNum() + 1};
847 : 13 : m_blockfile_cursors[chain_type] = new_cursor;
848 [ + + ]: 13 : LogDebug(BCLog::BLOCKSTORAGE, "[%s] initializing blockfile cursor to %s\n", chain_type, new_cursor);
849 : : }
850 [ - + ]: 131608 : const int last_blockfile = m_blockfile_cursors[chain_type]->file_num;
851 : :
852 : 131608 : int nFile = last_blockfile;
853 [ - + + + ]: 131608 : if (static_cast<int>(m_blockfile_info.size()) <= nFile) {
854 : 20 : m_blockfile_info.resize(nFile + 1);
855 : : }
856 : :
857 : 131608 : bool finalize_undo = false;
858 : 131608 : unsigned int max_blockfile_size{MAX_BLOCKFILE_SIZE};
859 : : // Use smaller blockfiles in test-only -fastprune mode - but avoid
860 : : // the possibility of having a block not fit into the block file.
861 [ + + ]: 131608 : if (m_opts.fast_prune) {
862 : 19765 : max_blockfile_size = 0x10000; // 64kiB
863 [ + + ]: 19765 : if (nAddSize >= max_blockfile_size) {
864 : : // dynamically adjust the blockfile size to be larger than the added size
865 : 2 : max_blockfile_size = nAddSize + 1;
866 : : }
867 : : }
868 [ - + ]: 131608 : assert(nAddSize < max_blockfile_size);
869 : :
870 [ + + ]: 131744 : while (m_blockfile_info[nFile].nSize + nAddSize >= max_blockfile_size) {
871 : : // when the undo file is keeping up with the block file, we want to flush it explicitly
872 : : // when it is lagging behind (more blocks arrive than are being connected), we let the
873 : : // undo block write case handle it
874 : 272 : finalize_undo = (static_cast<int>(m_blockfile_info[nFile].nHeightLast) ==
875 [ - + + - ]: 136 : Assert(m_blockfile_cursors[chain_type])->undo_height);
876 : :
877 : : // Try the next unclaimed blockfile number
878 : 136 : nFile = this->MaxBlockfileNum() + 1;
879 : : // Set to increment MaxBlockfileNum() for next iteration
880 [ + - ]: 136 : m_blockfile_cursors[chain_type] = BlockfileCursor{nFile};
881 : :
882 [ - + + - ]: 136 : if (static_cast<int>(m_blockfile_info.size()) <= nFile) {
883 : 136 : m_blockfile_info.resize(nFile + 1);
884 : : }
885 : : }
886 : 131608 : FlatFilePos pos;
887 : 131608 : pos.nFile = nFile;
888 : 131608 : pos.nPos = m_blockfile_info[nFile].nSize;
889 : :
890 [ + + ]: 131608 : if (nFile != last_blockfile) {
891 [ + - + - ]: 136 : LogDebug(BCLog::BLOCKSTORAGE, "Leaving block file %i: %s (onto %i) (height %i)\n",
892 : : last_blockfile, m_blockfile_info[last_blockfile].ToString(), nFile, nHeight);
893 : :
894 : : // Do not propagate the return code. The flush concerns a previous block
895 : : // and undo file that has already been written to. If a flush fails
896 : : // here, and we crash, there is no expected additional block data
897 : : // inconsistency arising from the flush failure here. However, the undo
898 : : // data may be inconsistent after a crash if the flush is called during
899 : : // a reindex. A flush error might also leave some of the data files
900 : : // untrimmed.
901 [ - + ]: 136 : if (!FlushBlockFile(last_blockfile, /*fFinalize=*/true, finalize_undo)) {
902 : 0 : LogWarning(
903 : : "Failed to flush previous block file %05i (finalize=1, finalize_undo=%i) before opening new block file %05i\n",
904 : : last_blockfile, finalize_undo, nFile);
905 : : }
906 : : // No undo data yet in the new file, so reset our undo-height tracking.
907 [ + - ]: 136 : m_blockfile_cursors[chain_type] = BlockfileCursor{nFile};
908 : : }
909 : :
910 : 131608 : m_blockfile_info[nFile].AddBlock(nHeight, nTime);
911 : 131608 : m_blockfile_info[nFile].nSize += nAddSize;
912 : :
913 : 131608 : bool out_of_space;
914 : 131608 : size_t bytes_allocated = m_block_file_seq.Allocate(pos, nAddSize, out_of_space);
915 [ - + ]: 131608 : if (out_of_space) {
916 [ # # ]: 0 : m_opts.notifications.fatalError(_("Disk space is too low!"));
917 : 0 : return {};
918 : : }
919 [ + + + + ]: 131608 : if (bytes_allocated != 0 && IsPruneMode()) {
920 : 477 : m_check_for_pruning = true;
921 : : }
922 : :
923 : 131608 : m_dirty_fileinfo.insert(nFile);
924 : 131608 : return pos;
925 : : }
926 : :
927 : 1944 : void BlockManager::UpdateBlockInfo(const CBlock& block, unsigned int nHeight, const FlatFilePos& pos)
928 : : {
929 : 1944 : AssertLockHeld(::cs_main);
930 : : // Update the cursor so it points to the last file.
931 : 1944 : const BlockfileType chain_type{BlockfileTypeForHeight(nHeight)};
932 [ + - ]: 1944 : auto& cursor{m_blockfile_cursors[chain_type]};
933 [ + - + + ]: 1944 : if (!cursor || cursor->file_num < pos.nFile) {
934 [ + - ]: 1 : m_blockfile_cursors[chain_type] = BlockfileCursor{pos.nFile};
935 : : }
936 : :
937 : : // Update the file information with the current block.
938 : 1944 : const unsigned int added_size = ::GetSerializeSize(TX_WITH_WITNESS(block));
939 : 1944 : const int nFile = pos.nFile;
940 [ - + + + ]: 1944 : if (static_cast<int>(m_blockfile_info.size()) <= nFile) {
941 : 15 : m_blockfile_info.resize(nFile + 1);
942 : : }
943 : 1944 : m_blockfile_info[nFile].AddBlock(nHeight, block.GetBlockTime());
944 [ + + ]: 1944 : m_blockfile_info[nFile].nSize = std::max(pos.nPos + added_size, m_blockfile_info[nFile].nSize);
945 : 1944 : m_dirty_fileinfo.insert(nFile);
946 : 1944 : }
947 : :
948 : 128385 : bool BlockManager::FindUndoPos(BlockValidationState& state, int nFile, FlatFilePos& pos, unsigned int nAddSize)
949 : : {
950 : 128385 : AssertLockHeld(::cs_main);
951 : 128385 : pos.nFile = nFile;
952 : :
953 : 128385 : pos.nPos = m_blockfile_info[nFile].nUndoSize;
954 : 128385 : m_blockfile_info[nFile].nUndoSize += nAddSize;
955 : 128385 : m_dirty_fileinfo.insert(nFile);
956 : :
957 : 128385 : bool out_of_space;
958 : 128385 : size_t bytes_allocated = m_undo_file_seq.Allocate(pos, nAddSize, out_of_space);
959 [ - + ]: 128385 : if (out_of_space) {
960 [ # # ]: 0 : return FatalError(m_opts.notifications, state, _("Disk space is too low!"));
961 : : }
962 [ + + + + ]: 128385 : if (bytes_allocated != 0 && IsPruneMode()) {
963 : 107 : m_check_for_pruning = true;
964 : : }
965 : :
966 : : return true;
967 : : }
968 : :
969 : 134100 : bool BlockManager::WriteBlockUndo(const CBlockUndo& blockundo, BlockValidationState& state, CBlockIndex& block)
970 : : {
971 : 134100 : AssertLockHeld(::cs_main);
972 : 134100 : const BlockfileType type = BlockfileTypeForHeight(block.nHeight);
973 [ - + + + ]: 134100 : auto& cursor = *Assert(m_blockfile_cursors[type]);
974 : :
975 : : // Write undo information to disk
976 [ + + ]: 134100 : if (block.GetUndoPos().IsNull()) {
977 : 128385 : FlatFilePos pos;
978 : 128385 : const auto blockundo_size{static_cast<uint32_t>(GetSerializeSize(blockundo))};
979 [ - + ]: 128385 : if (!FindUndoPos(state, block.nFile, pos, blockundo_size + UNDO_DATA_DISK_OVERHEAD)) {
980 [ # # ]: 0 : LogError("FindUndoPos failed for %s while writing block undo", pos.ToString());
981 : 0 : return false;
982 : : }
983 : :
984 : : // Open history file to append
985 : 128385 : AutoFile file{OpenUndoFile(pos)};
986 [ - + ]: 128385 : if (file.IsNull()) {
987 [ # # # # ]: 0 : LogError("OpenUndoFile failed for %s while writing block undo", pos.ToString());
988 [ # # # # ]: 0 : return FatalError(m_opts.notifications, state, _("Failed to write undo data."));
989 : : }
990 : 128385 : {
991 [ + - ]: 128385 : BufferedWriter fileout{file};
992 : :
993 : : // Write index header
994 [ + - + - ]: 128385 : fileout << GetParams().MessageStart() << blockundo_size;
995 : 128385 : pos.nPos += STORAGE_HEADER_BYTES;
996 : 128385 : {
997 : : // Calculate checksum
998 [ + - ]: 128385 : HashWriter hasher{};
999 [ + - + - ]: 128385 : hasher << block.pprev->GetBlockHash() << blockundo;
1000 : : // Write undo data & checksum
1001 [ + - + - ]: 256770 : fileout << blockundo << hasher.GetHash();
1002 : : }
1003 : : // BufferedWriter will flush pending data to file when fileout goes out of scope.
1004 : 0 : }
1005 : :
1006 : : // Make sure that the file is closed before we call `FlushUndoFile`.
1007 [ + - - + ]: 256770 : if (file.fclose() != 0) {
1008 [ # # # # : 0 : LogError("Failed to close block undo file %s: %s", pos.ToString(), SysErrorString(errno));
# # ]
1009 [ # # # # ]: 0 : return FatalError(m_opts.notifications, state, _("Failed to close block undo file."));
1010 : : }
1011 : :
1012 : : // rev files are written in block height order, whereas blk files are written as blocks come in (often out of order)
1013 : : // we want to flush the rev (undo) file once we've written the last block, which is indicated by the last height
1014 : : // in the block file info as below; note that this does not catch the case where the undo writes are keeping up
1015 : : // with the block writes (usually when a synced up node is getting newly mined blocks) -- this case is caught in
1016 : : // the FindNextBlockPos function
1017 [ + + + + ]: 128385 : if (pos.nFile < cursor.file_num && static_cast<uint32_t>(block.nHeight) == m_blockfile_info[pos.nFile].nHeightLast) {
1018 : : // Do not propagate the return code, a failed flush here should not
1019 : : // be an indication for a failed write. If it were propagated here,
1020 : : // the caller would assume the undo data not to be written, when in
1021 : : // fact it is. Note though, that a failed flush might leave the data
1022 : : // file untrimmed.
1023 [ + - - + ]: 1 : if (!FlushUndoFile(pos.nFile, true)) {
1024 [ # # ]: 0 : LogWarning("Failed to flush undo file %05i\n", pos.nFile);
1025 : : }
1026 [ + + + + ]: 128384 : } else if (pos.nFile == cursor.file_num && block.nHeight > cursor.undo_height) {
1027 : 118295 : cursor.undo_height = block.nHeight;
1028 : : }
1029 : : // update nUndoPos in block index
1030 : 128385 : block.nUndoPos = pos.nPos;
1031 : 128385 : block.nStatus |= BLOCK_HAVE_UNDO;
1032 [ + - ]: 128385 : m_dirty_blockindex.insert(&block);
1033 : 128385 : }
1034 : :
1035 : : return true;
1036 : : }
1037 : :
1038 : 139983 : bool BlockManager::ReadBlock(CBlock& block, const FlatFilePos& pos, const std::optional<uint256>& expected_hash) const
1039 : : {
1040 : 139983 : block.SetNull();
1041 : :
1042 : : // Open history file to read
1043 : 139983 : const auto block_data{ReadRawBlock(pos)};
1044 [ + + ]: 139983 : if (!block_data) {
1045 : : return false;
1046 : : }
1047 : :
1048 : 139876 : try {
1049 : : // Read block
1050 [ - + + - ]: 139876 : SpanReader{*block_data} >> TX_WITH_WITNESS(block);
1051 [ - - ]: 0 : } catch (const std::exception& e) {
1052 [ - - - - ]: 0 : LogError("Deserialize or I/O error - %s at %s while reading block", e.what(), pos.ToString());
1053 : 0 : return false;
1054 : 0 : }
1055 : :
1056 [ + - ]: 139876 : const auto block_hash{block.GetHash()};
1057 : :
1058 : : // Check the header
1059 [ + - + + ]: 139876 : if (!CheckProofOfWork(block_hash, block.nBits, GetConsensus())) {
1060 [ + - + - ]: 3 : LogError("Errors in block header at %s while reading block", pos.ToString());
1061 : 3 : return false;
1062 : : }
1063 : :
1064 : : // Signet only: check block solution
1065 [ + + + - : 139873 : if (GetConsensus().signet_blocks && !CheckSignetBlockSolution(block, GetConsensus())) {
- + ]
1066 [ # # # # ]: 0 : LogError("Errors in block solution at %s while reading block", pos.ToString());
1067 : 0 : return false;
1068 : : }
1069 : :
1070 [ + + + + ]: 139873 : if (expected_hash && block_hash != *expected_hash) {
1071 [ + - + - : 1 : LogError("GetHash() doesn't match index at %s while reading block (%s != %s)",
+ - + - ]
1072 : : pos.ToString(), block_hash.ToString(), expected_hash->ToString());
1073 : 1 : return false;
1074 : : }
1075 : :
1076 : : return true;
1077 : 139983 : }
1078 : :
1079 : 134737 : bool BlockManager::ReadBlock(CBlock& block, const CBlockIndex& index) const
1080 : : {
1081 [ + - ]: 269474 : const FlatFilePos block_pos{WITH_LOCK(cs_main, return index.GetBlockPos())};
1082 : 134737 : return ReadBlock(block, block_pos, index.GetBlockHash());
1083 : : }
1084 : :
1085 : 178439 : BlockManager::ReadRawBlockResult BlockManager::ReadRawBlock(const FlatFilePos& pos, std::optional<std::pair<size_t, size_t>> block_part) const
1086 : : {
1087 [ + + ]: 178439 : if (pos.nPos < STORAGE_HEADER_BYTES) {
1088 : : // If nPos is less than STORAGE_HEADER_BYTES, we can't read the header that precedes the block data
1089 : : // This would cause an unsigned integer underflow when trying to position the file cursor
1090 : : // This can happen after pruning or default constructed positions
1091 [ + - ]: 103 : LogError("Failed for %s while reading raw block storage header", pos.ToString());
1092 : 103 : return util::Unexpected{ReadRawError::IO};
1093 : : }
1094 : 178336 : AutoFile filein{OpenBlockFile({pos.nFile, pos.nPos - STORAGE_HEADER_BYTES}, /*fReadOnly=*/true)};
1095 [ + + ]: 178336 : if (filein.IsNull()) {
1096 [ + - + - ]: 7 : LogError("OpenBlockFile failed for %s while reading raw block", pos.ToString());
1097 : 7 : return util::Unexpected{ReadRawError::IO};
1098 : : }
1099 : :
1100 : 178329 : try {
1101 : 178329 : MessageStartChars blk_start;
1102 : 178329 : unsigned int blk_size;
1103 : :
1104 [ + - + - ]: 178329 : filein >> blk_start >> blk_size;
1105 : :
1106 [ + + ]: 178329 : if (blk_start != GetParams().MessageStart()) {
1107 [ + - + - : 1 : LogError("Block magic mismatch for %s: %s versus expected %s while reading raw block",
+ - + - ]
1108 : : pos.ToString(), HexStr(blk_start), HexStr(GetParams().MessageStart()));
1109 : 1 : return util::Unexpected{ReadRawError::IO};
1110 : : }
1111 : :
1112 [ - + ]: 178328 : if (blk_size > MAX_SIZE) {
1113 [ # # # # ]: 0 : LogError("Block data is larger than maximum deserialization size for %s: %s versus %s while reading raw block",
1114 : : pos.ToString(), blk_size, MAX_SIZE);
1115 : 0 : return util::Unexpected{ReadRawError::IO};
1116 : : }
1117 : :
1118 [ + + ]: 178328 : if (block_part) {
1119 [ + + ]: 39 : const auto [offset, size]{*block_part};
1120 [ + + + + ]: 39 : if (size == 0 || SaturatingAdd(offset, size) > blk_size) {
1121 : 24 : return util::Unexpected{ReadRawError::BadPartRange}; // Avoid logging - offset/size come from untrusted REST input
1122 : : }
1123 [ + - ]: 15 : filein.seek(offset, SEEK_CUR);
1124 : 15 : blk_size = size;
1125 : : }
1126 : :
1127 [ + - ]: 178304 : std::vector<std::byte> data(blk_size); // Zeroing of memory is intentional here
1128 [ - + + - ]: 178304 : filein.read(data);
1129 : 178304 : return data;
1130 [ - - ]: 178304 : } catch (const std::exception& e) {
1131 [ - - - - ]: 0 : LogError("Read from block file failed: %s for %s while reading raw block", e.what(), pos.ToString());
1132 : 0 : return util::Unexpected{ReadRawError::IO};
1133 : 0 : }
1134 : 178336 : }
1135 : :
1136 : 131608 : FlatFilePos BlockManager::WriteBlock(const CBlock& block, int nHeight)
1137 : : {
1138 : 131608 : AssertLockHeld(::cs_main);
1139 : 131608 : const unsigned int block_size{static_cast<unsigned int>(GetSerializeSize(TX_WITH_WITNESS(block)))};
1140 : 131608 : FlatFilePos pos{FindNextBlockPos(block_size + STORAGE_HEADER_BYTES, nHeight, block.GetBlockTime())};
1141 [ - + ]: 131608 : if (pos.IsNull()) {
1142 [ # # ]: 0 : LogError("FindNextBlockPos failed for %s while writing block", pos.ToString());
1143 : 0 : return FlatFilePos();
1144 : : }
1145 : 131608 : AutoFile file{OpenBlockFile(pos, /*fReadOnly=*/false)};
1146 [ - + ]: 131608 : if (file.IsNull()) {
1147 [ # # # # ]: 0 : LogError("OpenBlockFile failed for %s while writing block", pos.ToString());
1148 [ # # # # ]: 0 : m_opts.notifications.fatalError(_("Failed to write block."));
1149 : 0 : return FlatFilePos();
1150 : : }
1151 : 131608 : {
1152 [ + - ]: 131608 : BufferedWriter fileout{file};
1153 : :
1154 : : // Write index header
1155 [ + - + - ]: 131608 : fileout << GetParams().MessageStart() << block_size;
1156 : 131608 : pos.nPos += STORAGE_HEADER_BYTES;
1157 : : // Write block
1158 [ + - ]: 263216 : fileout << TX_WITH_WITNESS(block);
1159 : 0 : }
1160 : :
1161 [ + - - + ]: 263216 : if (file.fclose() != 0) {
1162 [ # # # # : 0 : LogError("Failed to close block file %s: %s", pos.ToString(), SysErrorString(errno));
# # ]
1163 [ # # # # ]: 0 : m_opts.notifications.fatalError(_("Failed to close file when writing block."));
1164 : 0 : return FlatFilePos();
1165 : : }
1166 : :
1167 : 131608 : return pos;
1168 : 131608 : }
1169 : :
1170 : 1274 : static auto InitBlocksdirXorKey(const BlockManager::Options& opts)
1171 : : {
1172 : : // Bytes are serialized without length indicator, so this is also the exact
1173 : : // size of the XOR-key file.
1174 : 1274 : std::array<std::byte, Obfuscation::KEY_SIZE> obfuscation{};
1175 : :
1176 : : // Consider this to be the first run if the blocksdir contains only hidden
1177 : : // files (those which start with a .). Checking for a fully-empty dir would
1178 : : // be too aggressive as a .lock file may have already been written.
1179 : 1274 : bool first_run = true;
1180 [ + + + + : 5702 : for (const auto& entry : fs::directory_iterator(opts.blocks_dir)) {
+ + + + +
+ ]
1181 [ + - - + ]: 4428 : const std::string path = fs::PathToString(entry.path().filename());
1182 [ + - + + ]: 1400 : if (!entry.is_regular_file() || !path.starts_with('.')) {
1183 : 814 : first_run = false;
1184 : 814 : break;
1185 : : }
1186 [ + - + + : 2381 : }
+ + - - ]
1187 : :
1188 [ + + + + ]: 1274 : if (opts.use_xor && first_run) {
1189 : : // Only use random fresh key when the boolean option is set and on the
1190 : : // very first start of the program.
1191 : 460 : FastRandomContext{}.fillrand(obfuscation);
1192 : : }
1193 : :
1194 [ + - ]: 2548 : const fs::path xor_key_path{opts.blocks_dir / "xor.dat"};
1195 [ + - + + ]: 1274 : if (fs::exists(xor_key_path)) {
1196 : : // A pre-existing xor key file has priority.
1197 [ + - + - ]: 1624 : AutoFile xor_key_file{fsbridge::fopen(xor_key_path, "rb")};
1198 [ + - ]: 812 : xor_key_file >> obfuscation;
1199 : 812 : } else {
1200 : : // Create initial or missing xor key file
1201 : 462 : AutoFile xor_key_file{fsbridge::fopen(xor_key_path,
1202 : : #ifdef __MINGW64__
1203 : : "wb" // Temporary workaround for https://github.com/bitcoin/bitcoin/issues/30210
1204 : : #else
1205 : : "wbx"
1206 : : #endif
1207 [ + - + - ]: 924 : )};
1208 [ + - ]: 462 : xor_key_file << obfuscation;
1209 [ + - - + ]: 924 : if (xor_key_file.fclose() != 0) {
1210 : 0 : throw std::runtime_error{strprintf("Error closing XOR key file %s: %s",
1211 [ # # ]: 0 : fs::PathToString(xor_key_path),
1212 [ # # # # ]: 0 : SysErrorString(errno))};
1213 : : }
1214 : 462 : }
1215 : : // If the user disabled the key, it must be zero.
1216 [ + + + + ]: 1274 : if (!opts.use_xor && obfuscation != decltype(obfuscation){}) {
1217 : 1 : throw std::runtime_error{
1218 [ + - ]: 2 : strprintf("The blocksdir XOR-key can not be disabled when a random key was already stored! "
1219 : : "Stored key: '%s', stored path: '%s'.",
1220 [ + - ]: 2 : HexStr(obfuscation), fs::PathToString(xor_key_path)),
1221 [ - + + - ]: 3 : };
1222 : : }
1223 [ + - - + : 2546 : LogInfo("Using obfuscation key for blocksdir *.dat files (%s): '%s'\n", fs::PathToString(opts.blocks_dir), HexStr(obfuscation));
+ - ]
1224 : 1273 : return Obfuscation{obfuscation};
1225 : 1273 : }
1226 : :
1227 : 1274 : BlockManager::BlockManager(const util::SignalInterrupt& interrupt, Options opts)
1228 : 1274 : : m_prune_mode{opts.prune_target > 0},
1229 : 1274 : m_obfuscation{InitBlocksdirXorKey(opts)},
1230 [ + - ]: 1273 : m_opts{std::move(opts)},
1231 [ + - + + : 2509 : m_block_file_seq{FlatFileSeq{m_opts.blocks_dir, "blk", m_opts.fast_prune ? 0x4000 /* 16kB */ : BLOCKFILE_CHUNK_SIZE}},
+ - ]
1232 [ + - + - ]: 1274 : m_undo_file_seq{FlatFileSeq{m_opts.blocks_dir, "rev", UNDOFILE_CHUNK_SIZE}},
1233 [ + - + + ]: 2547 : m_interrupt{interrupt}
1234 : : {
1235 [ + + ]: 1273 : m_block_tree_db = std::make_unique<BlockTreeDB>(m_opts.block_tree_db_params);
1236 : :
1237 [ + + ]: 1272 : if (m_opts.block_tree_db_params.wipe_data) {
1238 [ + - ]: 18 : m_block_tree_db->WriteReindexing(true);
1239 [ + + ]: 18 : m_blockfiles_indexed = false;
1240 : : // If we're reindexing in prune mode, wipe away unusable block files and all undo data files
1241 [ + + ]: 18 : if (m_prune_mode) {
1242 [ + - ]: 5 : CleanupBlockRevFiles();
1243 : : }
1244 : : }
1245 : 1277 : }
1246 : :
1247 : : class ImportingNow
1248 : : {
1249 : : std::atomic<bool>& m_importing;
1250 : :
1251 : : public:
1252 : 1064 : ImportingNow(std::atomic<bool>& importing) : m_importing{importing}
1253 : : {
1254 [ - + ]: 1064 : assert(m_importing == false);
1255 : 1064 : m_importing = true;
1256 : 1064 : }
1257 : 1064 : ~ImportingNow()
1258 : : {
1259 [ - + ]: 1064 : assert(m_importing == true);
1260 : 1064 : m_importing = false;
1261 : 1064 : }
1262 : : };
1263 : :
1264 : 1064 : void ImportBlocks(ChainstateManager& chainman, std::span<const fs::path> import_paths)
1265 : : {
1266 : 1064 : ImportingNow imp{chainman.m_blockman.m_importing};
1267 : :
1268 : : // -reindex
1269 [ + + ]: 1064 : if (!chainman.m_blockman.m_blockfiles_indexed) {
1270 : : int total_files{0};
1271 [ + - + + ]: 105 : while (fs::exists(chainman.m_blockman.GetBlockPosFilename(FlatFilePos(total_files, 0)))) {
1272 : 16 : total_files++;
1273 : : }
1274 : :
1275 : : // Map of disk positions for blocks with unknown parent (only used for reindex);
1276 : : // parent hash -> child disk position, multiple children can have the same parent.
1277 : 19 : std::multimap<uint256, FlatFilePos> blocks_with_unknown_parent;
1278 : :
1279 [ + + ]: 33 : for (int nFile{0}; nFile < total_files; ++nFile) {
1280 [ + - ]: 16 : FlatFilePos pos(nFile, 0);
1281 [ + - ]: 16 : AutoFile file{chainman.m_blockman.OpenBlockFile(pos, /*fReadOnly=*/true)};
1282 [ + - ]: 16 : if (file.IsNull()) {
1283 : : break; // This error is logged in OpenBlockFile
1284 : : }
1285 [ + - ]: 16 : LogInfo("Reindexing block file blk%05u.dat (%d%% complete)...", (unsigned int)nFile, nFile * 100 / total_files);
1286 [ + - ]: 16 : chainman.LoadExternalBlockFile(file, &pos, &blocks_with_unknown_parent);
1287 [ + - + + ]: 16 : if (chainman.m_interrupt) {
1288 [ + - ]: 2 : LogInfo("Interrupt requested. Exit reindexing.");
1289 : 2 : return;
1290 : : }
1291 : 16 : }
1292 [ + - + - ]: 51 : WITH_LOCK(::cs_main, chainman.m_blockman.m_block_tree_db->WriteReindexing(false));
1293 [ + - ]: 17 : chainman.m_blockman.m_blockfiles_indexed = true;
1294 [ + - ]: 17 : LogInfo("Reindexing finished");
1295 : : // To avoid ending up in a situation without genesis block, re-try initializing (no-op if reindexing worked):
1296 [ + - + - ]: 17 : chainman.ActiveChainstate().LoadGenesisBlock();
1297 : 19 : }
1298 : :
1299 : : // -loadblock=
1300 [ + + ]: 1064 : for (const fs::path& path : import_paths) {
1301 [ + - + - ]: 4 : AutoFile file{fsbridge::fopen(path, "rb")};
1302 [ + - ]: 2 : if (!file.IsNull()) {
1303 [ - + + - ]: 4 : LogInfo("Importing blocks file %s...", fs::PathToString(path));
1304 [ + - ]: 2 : chainman.LoadExternalBlockFile(file);
1305 [ + - - + ]: 2 : if (chainman.m_interrupt) {
1306 [ # # ]: 0 : LogInfo("Interrupt requested. Exit block importing.");
1307 : 0 : return;
1308 : : }
1309 : : } else {
1310 [ # # # # ]: 0 : LogWarning("Could not open blocks file %s", fs::PathToString(path));
1311 : : }
1312 : 2 : }
1313 : :
1314 : : // scan for better chains in the block chain database, that are not yet connected in the active best chain
1315 [ + - - + ]: 1062 : if (auto result = chainman.ActivateBestChains(); !result) {
1316 [ # # # # ]: 0 : chainman.GetNotifications().fatalError(util::ErrorString(result));
1317 : 0 : }
1318 : : // End scope of ImportingNow
1319 : 1064 : }
1320 : :
1321 : 12 : std::ostream& operator<<(std::ostream& os, const BlockfileType& type) {
1322 [ - + - ]: 12 : switch(type) {
1323 : 0 : case BlockfileType::NORMAL: os << "normal"; break;
1324 : 12 : case BlockfileType::ASSUMED: os << "assumed"; break;
1325 : 0 : default: os.setstate(std::ios_base::failbit);
1326 : : }
1327 : 12 : return os;
1328 : : }
1329 : :
1330 : 12 : std::ostream& operator<<(std::ostream& os, const BlockfileCursor& cursor) {
1331 [ - + ]: 24 : os << strprintf("BlockfileCursor(file_num=%d, undo_height=%d)", cursor.file_num, cursor.undo_height);
1332 : 12 : return os;
1333 : : }
1334 : : } // namespace node
|
