Bitcoin Core 30.99.0
P2P Digital Currency
block_index.cpp
Go to the documentation of this file.
1// Copyright (c) 2023 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 <chain.h>
6#include <chainparams.h>
7#include <node/blockstorage.h>
9#include <test/fuzz/fuzz.h>
10#include <test/fuzz/util.h>
12#include <txdb.h>
13#include <validation.h>
14
16
17namespace {
18
19const BasicTestingSetup* g_setup;
20
21// Hardcoded block hash and nBits to make sure the blocks we store pass the pow check.
22uint256 g_block_hash;
23
24bool operator==(const CBlockFileInfo& a, const CBlockFileInfo& b)
25{
26 return a.nBlocks == b.nBlocks &&
27 a.nSize == b.nSize &&
28 a.nUndoSize == b.nUndoSize &&
30 a.nHeightLast == b.nHeightLast &&
31 a.nTimeFirst == b.nTimeFirst &&
32 a.nTimeLast == b.nTimeLast;
33}
34
35CBlockHeader ConsumeBlockHeader(FuzzedDataProvider& provider)
36{
37 CBlockHeader header;
38 header.nVersion = provider.ConsumeIntegral<decltype(header.nVersion)>();
39 header.hashPrevBlock = g_block_hash;
40 header.hashMerkleRoot = g_block_hash;
41 header.nTime = provider.ConsumeIntegral<decltype(header.nTime)>();
42 header.nBits = Params().GenesisBlock().nBits;
43 header.nNonce = provider.ConsumeIntegral<decltype(header.nNonce)>();
44 return header;
45}
46
47} // namespace
48
50{
51 static const auto testing_setup = MakeNoLogFileContext<>(ChainType::MAIN);
52 g_setup = testing_setup.get();
53 g_block_hash = Params().GenesisBlock().GetHash();
54}
55
57{
58 FuzzedDataProvider fuzzed_data_provider{buffer.data(), buffer.size()};
59 auto block_index = kernel::BlockTreeDB(DBParams{
60 .path = "", // Memory only.
61 .cache_bytes = 1 << 20, // 1MB.
62 .memory_only = true,
63 });
64
65 // Generate a number of block files to be stored in the index.
66 int files_count = fuzzed_data_provider.ConsumeIntegralInRange(1, 100);
67 std::vector<std::unique_ptr<CBlockFileInfo>> files;
68 files.reserve(files_count);
69 std::vector<std::pair<int, const CBlockFileInfo*>> files_info;
70 files_info.reserve(files_count);
71 for (int i = 0; i < files_count; i++) {
72 if (auto file_info = ConsumeDeserializable<CBlockFileInfo>(fuzzed_data_provider)) {
73 files.push_back(std::make_unique<CBlockFileInfo>(std::move(*file_info)));
74 files_info.emplace_back(i, files.back().get());
75 } else {
76 return;
77 }
78 }
79
80 // Generate a number of block headers to be stored in the index.
81 int blocks_count = fuzzed_data_provider.ConsumeIntegralInRange(files_count * 10, files_count * 100);
82 std::vector<std::unique_ptr<CBlockIndex>> blocks;
83 blocks.reserve(blocks_count);
84 std::vector<const CBlockIndex*> blocks_info;
85 blocks_info.reserve(blocks_count);
86 for (int i = 0; i < blocks_count; i++) {
87 CBlockHeader header{ConsumeBlockHeader(fuzzed_data_provider)};
88 blocks.push_back(std::make_unique<CBlockIndex>(std::move(header)));
89 blocks.back()->phashBlock = &g_block_hash;
90 blocks_info.push_back(blocks.back().get());
91 }
92
93 // Store these files and blocks in the block index. It should not fail.
94 block_index.WriteBatchSync(files_info, files_count - 1, blocks_info);
95
96 // We should be able to read every block file info we stored. Its value should correspond to
97 // what we stored above.
98 CBlockFileInfo info;
99 for (const auto& [n, file_info]: files_info) {
100 assert(block_index.ReadBlockFileInfo(n, info));
101 assert(info == *file_info);
102 }
103
104 // We should be able to read the last block file number. Its value should be consistent.
105 int last_block_file;
106 assert(block_index.ReadLastBlockFile(last_block_file));
107 assert(last_block_file == files_count - 1);
108
109 // We should be able to flip and read the reindexing flag.
110 bool reindexing;
111 block_index.WriteReindexing(true);
112 block_index.ReadReindexing(reindexing);
113 assert(reindexing);
114 block_index.WriteReindexing(false);
115 block_index.ReadReindexing(reindexing);
116 assert(!reindexing);
117
118 // We should be able to set and read the value of any random flag.
119 const std::string flag_name = fuzzed_data_provider.ConsumeRandomLengthString(100);
120 bool flag_value;
121 block_index.WriteFlag(flag_name, true);
122 block_index.ReadFlag(flag_name, flag_value);
123 assert(flag_value);
124 block_index.WriteFlag(flag_name, false);
125 block_index.ReadFlag(flag_name, flag_value);
126 assert(!flag_value);
127
128 // We should be able to load everything we've previously stored. Note to assert on the
129 // return value we need to make sure all blocks pass the pow check.
130 const auto params{Params().GetConsensus()};
131 const auto inserter = [&](const uint256&) {
132 return blocks.back().get();
133 };
134 WITH_LOCK(::cs_main, assert(block_index.LoadBlockIndexGuts(params, inserter, g_setup->m_interrupt)));
135}
FUZZ_TARGET(block_index,.init=init_block_index)
Definition: block_index.cpp:56
void init_block_index()
Definition: block_index.cpp:49
const CChainParams & Params()
Return the currently selected parameters.
Nodes collect new transactions into a block, hash them into a hash tree, and scan through nonce value...
Definition: block.h:22
uint32_t nNonce
Definition: block.h:30
uint32_t nBits
Definition: block.h:29
uint32_t nTime
Definition: block.h:28
int32_t nVersion
Definition: block.h:25
uint256 hashPrevBlock
Definition: block.h:26
uint256 hashMerkleRoot
Definition: block.h:27
uint256 GetHash() const
Definition: block.cpp:11
const CBlock & GenesisBlock() const
Definition: chainparams.h:95
const Consensus::Params & GetConsensus() const
Definition: chainparams.h:90
std::string ConsumeRandomLengthString(size_t max_length)
T ConsumeIntegralInRange(T min, T max)
Access to the block database (blocks/index/)
Definition: blockstorage.h:93
uint32_t nSize
number of used bytes of block file
Definition: blockstorage.h:54
uint32_t nUndoSize
number of used bytes in the undo file
Definition: blockstorage.h:55
uint64_t nTimeFirst
earliest time of block in file
Definition: blockstorage.h:58
uint64_t nTimeLast
latest time of block in file
Definition: blockstorage.h:59
uint32_t nHeightFirst
lowest height of block in file
Definition: blockstorage.h:56
uint32_t nBlocks
number of blocks stored in file
Definition: blockstorage.h:53
uint32_t nHeightLast
highest height of block in file
Definition: blockstorage.h:57
256-bit opaque blob.
Definition: uint256.h:196
RecursiveMutex cs_main
Mutex to guard access to validation specific variables, such as reading or changing the chainstate.
Definition: cs_main.cpp:8
bool operator==(const CNetAddr &a, const CNetAddr &b)
Definition: netaddress.cpp:603
Basic testing setup.
Definition: setup_common.h:64
util::SignalInterrupt m_interrupt
Definition: setup_common.h:65
Application-specific storage settings.
Definition: dbwrapper.h:33
fs::path path
Location in the filesystem where leveldb data will be stored.
Definition: dbwrapper.h:35
#define WITH_LOCK(cs, code)
Run code while locking a mutex.
Definition: sync.h:290
assert(!tx.IsCoinBase())
FuzzedDataProvider & fuzzed_data_provider
Definition: fees.cpp:38