mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-02-10 10:52:31 -05:00
82bb7831fa
To avoid wasting processing power, we can skip blocks that occurred before the wallet's creation time, since these blocks are guaranteed not to contain any relevant wallet data. This has direct implications (an speed improvement) on the underlying blockchain synchronization process as well. The reason is that the validation interface queue is limited to 10 tasks per time. This means that no more than 10 blocks can be waiting for the wallet(s) to be processed while we are synchronizing the chain (activating the best chain to be more precise). Which can be a bottleneck if blocks arrive and are processed faster from the network than what they are processed by the wallet(s).
27 lines
836 B
C++
27 lines
836 B
C++
// Copyright (c) 2022 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include <chain.h>
|
|
#include <interfaces/chain.h>
|
|
#include <sync.h>
|
|
#include <uint256.h>
|
|
|
|
class CBlock;
|
|
|
|
namespace kernel {
|
|
interfaces::BlockInfo MakeBlockInfo(const CBlockIndex* index, const CBlock* data)
|
|
{
|
|
interfaces::BlockInfo info{index ? *index->phashBlock : uint256::ZERO};
|
|
if (index) {
|
|
info.prev_hash = index->pprev ? index->pprev->phashBlock : nullptr;
|
|
info.height = index->nHeight;
|
|
info.chain_time_max = index->GetBlockTimeMax();
|
|
LOCK(::cs_main);
|
|
info.file_number = index->nFile;
|
|
info.data_pos = index->nDataPos;
|
|
}
|
|
info.data = data;
|
|
return info;
|
|
}
|
|
} // namespace kernel
|