Branch data Line data Source code
1 : : // Copyright (c) 2017-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 <index/base.h>
6 : :
7 : : #include <chain.h>
8 : : #include <common/args.h>
9 : : #include <dbwrapper.h>
10 : : #include <interfaces/chain.h>
11 : : #include <interfaces/types.h>
12 : : #include <kernel/types.h>
13 : : #include <node/abort.h>
14 : : #include <node/blockstorage.h>
15 : : #include <node/context.h>
16 : : #include <node/database_args.h>
17 : : #include <node/interface_ui.h>
18 : : #include <primitives/block.h>
19 : : #include <sync.h>
20 : : #include <tinyformat.h>
21 : : #include <uint256.h>
22 : : #include <undo.h>
23 : : #include <util/check.h>
24 : : #include <util/fs.h>
25 : : #include <util/log.h>
26 : : #include <util/string.h>
27 : : #include <util/thread.h>
28 : : #include <util/threadinterrupt.h>
29 : : #include <util/time.h>
30 : : #include <util/translation.h>
31 : : #include <validation.h>
32 : : #include <validationinterface.h>
33 : :
34 : : #include <compare>
35 : : #include <cstdint>
36 : : #include <functional>
37 : : #include <memory>
38 : : #include <optional>
39 : : #include <stdexcept>
40 : : #include <string>
41 : : #include <thread>
42 : : #include <utility>
43 : : #include <vector>
44 : :
45 : : using kernel::ChainstateRole;
46 : :
47 : : constexpr uint8_t DB_BEST_BLOCK{'B'};
48 : :
49 : : constexpr auto SYNC_LOG_INTERVAL{30s};
50 : : constexpr auto SYNC_LOCATOR_WRITE_INTERVAL{30s};
51 : :
52 : : template <typename... Args>
53 : 0 : void BaseIndex::FatalErrorf(util::ConstevalFormatString<sizeof...(Args)> fmt, const Args&... args)
54 : : {
55 : 0 : auto message = tfm::format(fmt, args...);
56 [ # # # # : 0 : node::AbortNode(m_chain->context()->shutdown_request, m_chain->context()->exit_status, Untranslated(message), m_chain->context()->warnings.get());
# # # # #
# # # ]
57 : 0 : }
58 : :
59 : 300 : CBlockLocator GetLocator(interfaces::Chain& chain, const uint256& block_hash)
60 : : {
61 : 300 : CBlockLocator locator;
62 [ + - ]: 300 : bool found = chain.findBlock(block_hash, interfaces::FoundBlock().locator(locator));
63 [ - + ]: 300 : assert(found);
64 [ - + ]: 300 : assert(!locator.IsNull());
65 : 300 : return locator;
66 : 0 : }
67 : :
68 : 174 : BaseIndex::DB::DB(const fs::path& path, size_t n_cache_size, bool f_memory, bool f_wipe, bool f_obfuscate) :
69 : 7 : CDBWrapper{DBParams{
70 : : .path = path,
71 : : .cache_bytes = n_cache_size,
72 : : .memory_only = f_memory,
73 : : .wipe_data = f_wipe,
74 : : .obfuscate = f_obfuscate,
75 [ + - + + ]: 174 : .options = [] { DBOptions options; node::ReadDatabaseArgs(gArgs, options); return options; }()}}
76 : 167 : {}
77 : :
78 : 175 : CBlockLocator BaseIndex::DB::ReadBestBlock() const
79 : : {
80 : 175 : CBlockLocator locator;
81 : :
82 [ + - ]: 175 : bool success = Read(DB_BEST_BLOCK, locator);
83 [ + + ]: 175 : if (!success) {
84 [ - + ]: 71 : locator.SetNull();
85 : : }
86 : :
87 : 175 : return locator;
88 : 0 : }
89 : :
90 : 300 : void BaseIndex::DB::WriteBestBlock(CDBBatch& batch, const CBlockLocator& locator)
91 : : {
92 : 300 : batch.Write(DB_BEST_BLOCK, locator);
93 : 300 : }
94 : :
95 : 174 : BaseIndex::BaseIndex(std::unique_ptr<interfaces::Chain> chain, std::string name, std::string thread_name)
96 [ + - ]: 174 : : m_chain{std::move(chain)}, m_name{std::move(name)}, m_thread_name{std::move(thread_name)} {}
97 : :
98 : 174 : BaseIndex::~BaseIndex()
99 : : {
100 : 174 : Interrupt();
101 : 174 : Stop();
102 : 174 : }
103 : :
104 : 175 : bool BaseIndex::Init()
105 : : {
106 : 175 : AssertLockNotHeld(cs_main);
107 : :
108 : : // May need reset if index is being restarted.
109 : 175 : m_interrupt.reset();
110 : :
111 : : // m_chainstate member gives indexing code access to node internals. It is
112 : : // removed in followup https://github.com/bitcoin/bitcoin/pull/24230
113 [ + - + - ]: 525 : m_chainstate = WITH_LOCK(::cs_main,
114 : : return &m_chain->context()->chainman->ValidatedChainstate());
115 : : // Register to validation interface before setting the 'm_synced' flag, so that
116 : : // callbacks are not missed once m_synced is true.
117 : 175 : m_chain->context()->validation_signals->RegisterValidationInterface(this);
118 : :
119 : 175 : const auto locator{GetDB().ReadBestBlock()};
120 : :
121 [ + - ]: 175 : LOCK(cs_main);
122 : 175 : CChain& index_chain = m_chainstate->m_chain;
123 : :
124 [ + + ]: 175 : if (locator.IsNull()) {
125 [ + - ]: 71 : SetBestBlockIndex(nullptr);
126 : : } else {
127 : : // Setting the best block to the locator's top block. If it is not part of the
128 : : // best chain, we will rewind to the fork point during index sync
129 [ + - + - ]: 104 : const CBlockIndex* locator_index{m_chainstate->m_blockman.LookupBlockIndex(locator.vHave.at(0))};
130 [ - + ]: 104 : if (!locator_index) {
131 [ # # # # : 0 : return InitError(Untranslated(strprintf("best block of %s not found. Please rebuild the index.", GetName())));
# # ]
132 : : }
133 [ + - ]: 104 : SetBestBlockIndex(locator_index);
134 : : }
135 : :
136 : : // Child init
137 [ + + ]: 175 : const CBlockIndex* start_block = m_best_block_index.load();
138 [ + + + - : 175 : if (!CustomInit(start_block ? std::make_optional(interfaces::BlockRef{start_block->GetBlockHash(), start_block->nHeight}) : std::nullopt)) {
+ - ]
139 : : return false;
140 : : }
141 : :
142 : : // Note: this will latch to true immediately if the user starts up with an empty
143 : : // datadir and an index enabled. If this is the case, indexation will happen solely
144 : : // via `BlockConnected` signals until, possibly, the next restart.
145 [ - + ]: 350 : m_synced = start_block == index_chain.Tip();
146 : 175 : m_init = true;
147 : 175 : return true;
148 : 175 : }
149 : :
150 : 11530 : static const CBlockIndex* NextSyncBlock(const CBlockIndex* const pindex_prev, CChain& chain) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
151 : : {
152 : 11530 : AssertLockHeld(cs_main);
153 : :
154 [ + + ]: 11530 : if (!pindex_prev) {
155 [ - + ]: 41 : return chain.Genesis();
156 : : }
157 : :
158 [ + + ]: 11489 : if (const auto* pindex{chain.Next(*pindex_prev)}) {
159 : : return pindex;
160 : : }
161 : :
162 : : // If there is no next block, we might be synced
163 [ - + + + ]: 244 : if (pindex_prev == chain.Tip()) {
164 : : return nullptr;
165 : : }
166 : :
167 : : // Since block is not in the chain, return the next block in the chain AFTER the last common ancestor.
168 : : // Caller will be responsible for rewinding back to the common ancestor.
169 : 2 : const auto* fork{chain.FindFork(*pindex_prev)};
170 : : // Common ancestor must exist (genesis).
171 [ - + ]: 2 : return chain.Next(*Assert(fork));
172 : : }
173 : :
174 : 34481 : bool BaseIndex::ProcessBlock(const CBlockIndex* pindex, const CBlock* block_data)
175 : : {
176 : 34481 : interfaces::BlockInfo block_info = kernel::MakeBlockInfo(pindex, block_data);
177 : :
178 : 34481 : CBlock block;
179 [ + + ]: 34481 : if (!block_data) { // disk lookup if block data wasn't provided
180 [ + - - + ]: 11410 : if (!m_chainstate->m_blockman.ReadBlock(block, *pindex)) {
181 [ # # ]: 0 : FatalErrorf("Failed to read block %s from disk",
182 [ # # ]: 0 : pindex->GetBlockHash().ToString());
183 : 0 : return false;
184 : : }
185 : 11410 : block_info.data = █
186 : : }
187 : :
188 : 34481 : CBlockUndo block_undo;
189 [ + - + + ]: 34481 : if (CustomOptions().connect_undo_data) {
190 [ + + + - : 29492 : if (pindex->nHeight > 0 && !m_chainstate->m_blockman.ReadBlockUndo(block_undo, *pindex)) {
- + ]
191 [ # # ]: 0 : FatalErrorf("Failed to read undo block data %s from disk",
192 [ # # ]: 0 : pindex->GetBlockHash().ToString());
193 : 0 : return false;
194 : : }
195 : 29492 : block_info.undo_data = &block_undo;
196 : : }
197 : :
198 [ + - - + ]: 34481 : if (!CustomAppend(block_info)) {
199 [ # # ]: 0 : FatalErrorf("Failed to write block %s to index database",
200 [ # # ]: 0 : pindex->GetBlockHash().ToString());
201 : 0 : return false;
202 : : }
203 : :
204 : : return true;
205 : 68962 : }
206 : :
207 : 166 : void BaseIndex::Sync()
208 : : {
209 [ + + ]: 166 : const CBlockIndex* pindex = m_best_block_index.load();
210 [ + + ]: 166 : if (!m_synced) {
211 : 98 : auto last_log_time{NodeClock::now()};
212 : 98 : auto last_locator_write_time{last_log_time};
213 : 11508 : while (true) {
214 [ + + ]: 11508 : if (m_interrupt) {
215 : 38 : LogInfo("%s: m_interrupt set; exiting ThreadSync", GetName());
216 : :
217 : 38 : SetBestBlockIndex(pindex);
218 : : // No need to handle errors in Commit. If it fails, the error will be already be
219 : : // logged. The best way to recover is to continue, as index cannot be corrupted by
220 : : // a missed commit to disk for an advanced index state.
221 : 38 : Commit();
222 : 38 : return;
223 : : }
224 : :
225 [ + - + - ]: 34410 : const CBlockIndex* pindex_next = WITH_LOCK(cs_main, return NextSyncBlock(pindex, m_chainstate->m_chain));
226 : : // If pindex_next is null, it means pindex is the chain tip, so
227 : : // commit data indexed so far.
228 [ + + ]: 11470 : if (!pindex_next) {
229 : 60 : SetBestBlockIndex(pindex);
230 : : // No need to handle errors in Commit. See rationale above.
231 : 60 : Commit();
232 : :
233 : : // If pindex is still the chain tip after committing, exit the
234 : : // sync loop. It is important for cs_main to be locked while
235 : : // setting m_synced = true, otherwise a new block could be
236 : : // attached while m_synced is still false, and it would not be
237 : : // indexed.
238 : 60 : LOCK(::cs_main);
239 [ + - ]: 60 : pindex_next = NextSyncBlock(pindex, m_chainstate->m_chain);
240 [ + - ]: 60 : if (!pindex_next) {
241 [ + - ]: 60 : m_synced = true;
242 [ + - ]: 60 : break;
243 : : }
244 : 60 : }
245 [ + + - + ]: 11410 : if (pindex_next->pprev != pindex && !Rewind(pindex, pindex_next->pprev)) {
246 : 0 : FatalErrorf("Failed to rewind %s to a previous chain tip", GetName());
247 : 0 : return;
248 : : }
249 : 11410 : pindex = pindex_next;
250 : :
251 : :
252 [ + - ]: 11410 : if (!ProcessBlock(pindex)) return; // error logged internally
253 : :
254 : 11410 : auto current_time{NodeClock::now()};
255 [ + + ]: 11410 : if (current_time - last_log_time >= SYNC_LOG_INTERVAL) {
256 : 3 : LogInfo("Syncing %s with block chain from height %d", GetName(), pindex->nHeight);
257 : 3 : last_log_time = current_time;
258 : : }
259 : :
260 [ + + ]: 11410 : if (current_time - last_locator_write_time >= SYNC_LOCATOR_WRITE_INTERVAL) {
261 : 3 : SetBestBlockIndex(pindex);
262 : 3 : last_locator_write_time = current_time;
263 : : // No need to handle errors in Commit. See rationale above.
264 : 3 : Commit();
265 : : }
266 : : }
267 : : }
268 : :
269 [ + + ]: 128 : if (pindex) {
270 : 119 : LogInfo("%s is enabled at height %d", GetName(), pindex->nHeight);
271 : : } else {
272 : 9 : LogInfo("%s is enabled", GetName());
273 : : }
274 : : }
275 : :
276 : 331 : void BaseIndex::Commit()
277 : : {
278 : : // Don't commit anything if we haven't indexed any block yet
279 : : // (this could happen if init is interrupted).
280 [ + - ]: 331 : bool ok = m_best_block_index != nullptr;
281 [ + - ]: 331 : if (ok) {
282 : : // Don't commit if the index best block is not an ancestor of the chainstate's last flushed
283 : : // block. Otherwise, after an unclean shutdown, the index could be
284 : : // persisted ahead of a chainstate it can no longer roll back to, which
285 : : // would corrupt indexes with state (e.g. coinstatsindex).
286 : 331 : const CBlockIndex* index_tip = m_best_block_index.load();
287 [ + - ]: 662 : const CBlockIndex* last_flushed = WITH_LOCK(::cs_main, return m_chainstate->GetLastFlushedBlock());
288 [ + + + + ]: 331 : if (!last_flushed || last_flushed->GetAncestor(index_tip->nHeight) != index_tip) {
289 [ + - + + ]: 31 : LogDebug(BCLog::COINDB, "Skipping commit, index is ahead of flushed chainstate (index height %d, last flush at height %d)",
290 : : index_tip->nHeight, last_flushed ? last_flushed->nHeight : -1);
291 : 31 : return;
292 : : }
293 : 300 : CDBBatch batch(GetDB());
294 [ + - ]: 300 : ok = CustomCommit(batch);
295 [ + - ]: 300 : if (ok) {
296 [ + - + - : 300 : GetDB().WriteBestBlock(batch, GetLocator(*m_chain, m_best_block_index.load()->GetBlockHash()));
+ - ]
297 [ + - + - ]: 300 : GetDB().WriteBatch(batch);
298 : : }
299 : 300 : }
300 [ - + ]: 300 : if (!ok) {
301 : 0 : LogError("Failed to commit latest %s state", GetName());
302 : : }
303 : : }
304 : :
305 : 28 : bool BaseIndex::Rewind(const CBlockIndex* current_tip, const CBlockIndex* new_tip)
306 : : {
307 [ - + ]: 28 : assert(current_tip->GetAncestor(new_tip->nHeight) == new_tip);
308 : :
309 : 28 : CBlock block;
310 : 28 : CBlockUndo block_undo;
311 : :
312 [ + + ]: 464 : for (const CBlockIndex* iter_tip = current_tip; iter_tip != new_tip; iter_tip = iter_tip->pprev) {
313 [ + - ]: 436 : interfaces::BlockInfo block_info = kernel::MakeBlockInfo(iter_tip);
314 [ + - + + ]: 436 : if (CustomOptions().disconnect_data) {
315 [ + - - + ]: 169 : if (!m_chainstate->m_blockman.ReadBlock(block, *iter_tip)) {
316 [ # # # # ]: 0 : LogError("Failed to read block %s from disk",
317 : : iter_tip->GetBlockHash().ToString());
318 : 0 : return false;
319 : : }
320 : 169 : block_info.data = █
321 : : }
322 [ + - + + : 436 : if (CustomOptions().disconnect_undo_data && iter_tip->nHeight > 0) {
+ - ]
323 [ + - + - ]: 165 : if (!m_chainstate->m_blockman.ReadBlockUndo(block_undo, *iter_tip)) {
324 : : return false;
325 : : }
326 : 165 : block_info.undo_data = &block_undo;
327 : : }
328 [ + - + - ]: 436 : if (!CustomRemove(block_info)) {
329 : : return false;
330 : : }
331 : : }
332 : :
333 : : // Don't commit here - the committed index state must never be ahead of the
334 : : // flushed chainstate, otherwise unclean restarts would lead to index corruption.
335 : : // Pruning has a minimum of 288 blocks-to-keep and getting the index
336 : : // out of sync may be possible but a users fault.
337 : : // In case we reorg beyond the pruned depth, ReadBlock would
338 : : // throw and lead to a graceful shutdown
339 [ + - ]: 28 : SetBestBlockIndex(new_tip);
340 : : return true;
341 : 28 : }
342 : :
343 : 25782 : void BaseIndex::BlockConnected(const ChainstateRole& role, const std::shared_ptr<const CBlock>& block, const CBlockIndex* pindex)
344 : : {
345 : : // Ignore events from not fully validated chains to avoid out-of-order indexing.
346 : : //
347 : : // TODO at some point we could parameterize whether a particular index can be
348 : : // built out of order, but for now just do the conservative simple thing.
349 [ + + ]: 25782 : if (!role.validated) {
350 : : return;
351 : : }
352 : :
353 : : // Ignore BlockConnected signals until we have fully indexed the chain.
354 [ + + ]: 24982 : if (!m_synced) {
355 : : return;
356 : : }
357 : :
358 [ + + ]: 23071 : const CBlockIndex* best_block_index = m_best_block_index.load();
359 [ + + ]: 23071 : if (!best_block_index) {
360 [ - + ]: 25 : if (pindex->nHeight != 0) {
361 : 0 : FatalErrorf("First block connected is not the genesis block (height=%d)",
362 : 0 : pindex->nHeight);
363 : 0 : return;
364 : : }
365 : : } else {
366 : : // Ensure block connects to an ancestor of the current best block. This should be the case
367 : : // most of the time, but may not be immediately after the sync thread catches up and sets
368 : : // m_synced. Consider the case where there is a reorg and the blocks on the stale branch are
369 : : // in the ValidationInterface queue backlog even after the sync thread has caught up to the
370 : : // new chain tip. In this unlikely event, log a warning and let the queue clear.
371 [ - + ]: 23046 : if (best_block_index->GetAncestor(pindex->nHeight - 1) != pindex->pprev) {
372 [ # # # # ]: 0 : LogWarning("Block %s does not connect to an ancestor of "
373 : : "known best chain (tip=%s); not updating index",
374 : : pindex->GetBlockHash().ToString(),
375 : : best_block_index->GetBlockHash().ToString());
376 : 0 : return;
377 : : }
378 [ + + - + ]: 23046 : if (best_block_index != pindex->pprev && !Rewind(best_block_index, pindex->pprev)) {
379 : 0 : FatalErrorf("Failed to rewind %s to a previous chain tip",
380 : 0 : GetName());
381 : 0 : return;
382 : : }
383 : : }
384 : :
385 : : // Dispatch block to child class; errors are logged internally and abort the node.
386 [ + - ]: 23071 : if (ProcessBlock(pindex, block.get())) {
387 : : // Setting the best block index is intentionally the last step of this
388 : : // function, so BlockUntilSyncedToCurrentChain callers waiting for the
389 : : // best block index to be updated can rely on the block being fully
390 : : // processed, and the index object being safe to delete.
391 : 23071 : SetBestBlockIndex(pindex);
392 : : }
393 : : }
394 : :
395 : 315 : void BaseIndex::ChainStateFlushed(const ChainstateRole& role, const CBlockLocator& locator)
396 : : {
397 : : // Ignore events from not fully validated chains to avoid out-of-order indexing.
398 [ + + ]: 315 : if (!role.validated) {
399 : : return;
400 : : }
401 : :
402 [ + + ]: 286 : if (!m_synced) {
403 : : return;
404 : : }
405 : :
406 : 241 : const uint256& locator_tip_hash = locator.vHave.front();
407 : 241 : const CBlockIndex* locator_tip_index;
408 : 241 : {
409 : 241 : LOCK(cs_main);
410 [ + - + - ]: 241 : locator_tip_index = m_chainstate->m_blockman.LookupBlockIndex(locator_tip_hash);
411 : 0 : }
412 : :
413 [ - + ]: 241 : if (!locator_tip_index) {
414 [ # # ]: 0 : FatalErrorf("First block (hash=%s) in locator was not found",
415 : 0 : locator_tip_hash.ToString());
416 : 0 : return;
417 : : }
418 : :
419 : : // This checks that ChainStateFlushed callbacks are received after BlockConnected. The check may fail
420 : : // immediately after the sync thread catches up and sets m_synced. Consider the case where
421 : : // there is a reorg and the blocks on the stale branch are in the ValidationInterface queue
422 : : // backlog even after the sync thread has caught up to the new chain tip. In this unlikely
423 : : // event, log a warning and let the queue clear.
424 : 241 : const CBlockIndex* best_block_index = m_best_block_index.load();
425 [ + + ]: 241 : if (best_block_index->GetAncestor(locator_tip_index->nHeight) != locator_tip_index) {
426 [ + - + - ]: 11 : LogWarning("Locator contains block (hash=%s) not on known best "
427 : : "chain (tip=%s); not writing index locator",
428 : : locator_tip_hash.ToString(),
429 : : best_block_index->GetBlockHash().ToString());
430 : 11 : return;
431 : : }
432 : :
433 : : // No need to handle errors in Commit. If it fails, the error will be already be logged. The
434 : : // best way to recover is to continue, as index cannot be corrupted by a missed commit to disk
435 : : // for an advanced index state.
436 : 230 : Commit();
437 : : }
438 : :
439 : 137 : bool BaseIndex::BlockUntilSyncedToCurrentChain() const
440 : : {
441 : 137 : AssertLockNotHeld(cs_main);
442 : :
443 [ + + ]: 137 : if (!m_synced) {
444 : : return false;
445 : : }
446 : :
447 : 133 : {
448 : : // Skip the queue-draining stuff if we know we're caught up with
449 : : // m_chain.Tip().
450 : 133 : LOCK(cs_main);
451 [ - + ]: 133 : const CBlockIndex* chain_tip = m_chainstate->m_chain.Tip();
452 [ + - ]: 133 : const CBlockIndex* best_block_index = m_best_block_index.load();
453 [ + - + + ]: 133 : if (best_block_index->GetAncestor(chain_tip->nHeight) == chain_tip) {
454 [ + - ]: 128 : return true;
455 : : }
456 : 128 : }
457 : :
458 : 5 : LogInfo("%s is catching up on block notifications", GetName());
459 : 5 : m_chain->context()->validation_signals->SyncWithValidationInterfaceQueue();
460 : 5 : return true;
461 : : }
462 : :
463 : 337 : void BaseIndex::Interrupt()
464 : : {
465 : 337 : m_interrupt();
466 : 337 : }
467 : :
468 : 158 : bool BaseIndex::StartBackgroundSync()
469 : : {
470 [ - + - - ]: 158 : if (!m_init) throw std::logic_error("Error: Cannot start a non-initialized index");
471 : :
472 : 316 : m_thread_sync = std::thread(&util::TraceThread, m_thread_name, [this] { Sync(); });
473 : 158 : return true;
474 : : }
475 : :
476 : 349 : void BaseIndex::Stop()
477 : : {
478 [ + + ]: 349 : if (m_chain->context()->validation_signals) {
479 : 346 : m_chain->context()->validation_signals->UnregisterValidationInterface(this);
480 : : }
481 : :
482 [ + + ]: 349 : if (m_thread_sync.joinable()) {
483 : 158 : m_thread_sync.join();
484 : : }
485 : 349 : }
486 : :
487 : 296 : IndexSummary BaseIndex::GetSummary() const
488 : : {
489 [ + - ]: 296 : IndexSummary summary{};
490 [ + - ]: 296 : summary.name = GetName();
491 [ + + ]: 296 : summary.synced = m_synced;
492 [ + + ]: 296 : if (const auto& pindex = m_best_block_index.load()) {
493 : 259 : summary.best_block_height = pindex->nHeight;
494 : 259 : summary.best_block_hash = pindex->GetBlockHash();
495 : : } else {
496 : 37 : summary.best_block_height = 0;
497 [ + - ]: 37 : summary.best_block_hash = m_chain->getBlockHash(0);
498 : : }
499 : 296 : return summary;
500 : 0 : }
501 : :
502 : 23375 : void BaseIndex::SetBestBlockIndex(const CBlockIndex* block)
503 : : {
504 [ + + - + ]: 23375 : assert(!m_chainstate->m_blockman.IsPruneMode() || AllowPrune());
505 : :
506 [ + + + + ]: 23375 : if (AllowPrune() && block) {
507 : 21151 : node::PruneLockInfo prune_lock;
508 : 21151 : prune_lock.height_first = block->nHeight;
509 [ + - ]: 63453 : WITH_LOCK(::cs_main, m_chainstate->m_blockman.UpdatePruneLock(GetName(), prune_lock));
510 : : }
511 : :
512 : : // Intentionally set m_best_block_index as the last step in this function,
513 : : // after updating prune locks above, and after making any other references
514 : : // to *this, so the BlockUntilSyncedToCurrentChain function (which checks
515 : : // m_best_block_index as an optimization) can be used to wait for the last
516 : : // BlockConnected notification and safely assume that prune locks are
517 : : // updated and that the index object is safe to delete.
518 : 23375 : m_best_block_index = block;
519 : 23375 : }
|
