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