Skip to content

Commit

Permalink
WIP: just use a ramdisk, actually
Browse files Browse the repository at this point in the history
It lets us cache the initial chainstate by creating it first at init and copying it over on every iteration.
  • Loading branch information
darosior committed Jul 8, 2024
1 parent 588bb1d commit 1059ca3
Showing 1 changed file with 90 additions and 42 deletions.
132 changes: 90 additions & 42 deletions src/test/fuzz/chainstate.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,7 @@

#include <chain.h>
#include <chainparams.h>
#include <config/bitcoin-config.h>
#include <consensus/merkle.h>
#include <kernel/notifications_interface.h>
#include <node/blockstorage.h>
Expand Down Expand Up @@ -60,20 +61,32 @@ class DummyQueue : public util::TaskRunnerInterface

size_t size() override { return 0; }
};
ValidationSignals dummy_main_signals{std::make_unique<DummyQueue>()};

auto g_notifications{KernelNotifications()};

//! See net_processing.
static const int MAX_HEADERS_RESULTS{2000};

struct TestData {
fs::path init_datadir;
fs::path working_datadir;
ValidationSignals main_signals{std::make_unique<DummyQueue>()};
KernelNotifications notifs;

void Init() {
init_datadir = fs::temp_directory_path() / "fuzz_chainstate_init_" PACKAGE_NAME;
fs::remove_all(init_datadir);
fs::create_directories(init_datadir / "blocks");
working_datadir = fs::temp_directory_path() / "fuzz_chainstate_" PACKAGE_NAME;
}

~TestData() {
fs::remove_all(init_datadir);
}
} g_test_data;

// Mapping from file path to in-memory file (descriptor). It's fine to use a path as key as we only
// ever use unique pathnames for block files.
std::unordered_map<fs::path, int, std::hash<std::filesystem::path>> g_fds;

//! The initial block chain used to test the chainstate.
std::vector<std::shared_ptr<CBlock>> g_initial_blockchain;

void mock_filesystem_calls()
{
fs::g_mock_create_dirs = [](const fs::path&) { return true; };
Expand Down Expand Up @@ -301,7 +314,7 @@ FUZZ_TARGET(blockstorage, .init = init_blockstorage)
.chainparams = chainparams,
.prune_target = prune_target,
.blocks_dir = "blocks",
.notifications = g_notifications,
.notifications = g_test_data.notifs,
};
auto blockman{node::BlockManager{*g_setup->m_node.shutdown, std::move(blockman_opts)}};
{
Expand Down Expand Up @@ -427,29 +440,78 @@ FUZZ_TARGET(blockstorage, .init = init_blockstorage)

void init_chainstate()
{
static const auto testing_setup = MakeNoLogFileContext<>(ChainType::MAIN);
// FIXME: only used to setup logging. Set it up without instantiating a whole, unused, BasicTestingSetup.
static const auto testing_setup = MakeNoLogFileContext<>(ChainType::MAIN/*, {"-printtoconsole", "-debug"}*/);
g_setup = testing_setup.get();

mock_filesystem_calls();

// Make the pow check always pass to be able to mine a chain from inside the target.
// TODO: we could have two mocks, once which passes, the other which fails. This way we can
// also fuzz the codepath for invalid pow.
g_check_pow_mock = [](uint256 hash, unsigned int, const Consensus::Params&) {
return true;
};

// Get 10 spendable UTxOs.
g_initial_blockchain = CreateBlockChain(110, Params());
// This creates the datadirs in the tmp dir.
g_test_data.Init();

// Create the chainstate for the initial datadir. On every round we'll restart from this chainstate instead of
// re-creating one from scratch.
node::BlockManager::Options blockman_opts{
.chainparams = Params(),
.blocks_dir = g_test_data.init_datadir / "blocks",
.notifications = g_test_data.notifs,
};
const ChainstateManager::Options chainman_opts{
.chainparams = Params(),
.datadir = g_test_data.init_datadir,
.check_block_index = false,
.checkpoints_enabled = false,
.minimum_chain_work = UintToArith256(uint256{}),
.assumed_valid_block = uint256{},
.notifications = g_test_data.notifs,
.signals = &g_test_data.main_signals,
};
ChainstateManager chainman{*g_setup->m_node.shutdown, chainman_opts, blockman_opts};
node::CacheSizes cache_sizes;
cache_sizes.block_tree_db = 1;
cache_sizes.coins_db = 2;
cache_sizes.coins = 3;
node::ChainstateLoadOptions load_opts {
.require_full_verification = false,
.coins_error_cb = nullptr,
};
auto [status, _] = node::LoadChainstate(chainman, cache_sizes, load_opts);
assert(status == node::ChainstateLoadStatus::SUCCESS);

// Connect the initial chain to get 10 spendable UTxOs at the start of every fuzzing round.
const auto g_initial_blockchain{CreateBlockChain(110, Params())};
BlockValidationState valstate;
auto& chainstate{chainman.ActiveChainstate()};
assert(chainstate.ActivateBestChain(valstate, nullptr));
for (const auto& block : g_initial_blockchain) {
bool new_block{false};
assert(chainman.ProcessNewBlock(block, true, true, &new_block));
assert(new_block);
}

LOCK(cs_main);
if (chainstate.CanFlushToDisk()) {
chainstate.ForceFlushStateToDisk();
}
}

FUZZ_TARGET(chainstate, .init = init_chainstate)
{
FuzzedDataProvider fuzzed_data_provider{buffer.data(), buffer.size()};
const auto& chainparams{Params()};
const fs::path datadir{""};
std::unordered_map<COutPoint, CTxOut, SaltedOutpointHasher> utxos;

//const auto first_time{SteadyClock::now()};

// On every round start from a freshly copied initial datadir.
fs::remove_all(g_test_data.working_datadir);
fs::copy(g_test_data.init_datadir, g_test_data.working_datadir, fs::copy_options::overwrite_existing | fs::copy_options::recursive);

// Create the chainstate..
uint64_t prune_target{0};
if (fuzzed_data_provider.ConsumeBool()) {
Expand All @@ -458,19 +520,19 @@ FUZZ_TARGET(chainstate, .init = init_chainstate)
node::BlockManager::Options blockman_opts{
.chainparams = chainparams,
.prune_target = prune_target,
.blocks_dir = datadir / "blocks",
.notifications = g_notifications,
.blocks_dir = g_test_data.working_datadir / "blocks",
.notifications = g_test_data.notifs,
};
const ChainstateManager::Options chainman_opts{
.chainparams = chainparams,
.datadir = "",
// TODO: make it possible to call CheckBlockIndex() without having set it here, call it in CallOneOf().
.datadir = g_test_data.working_datadir,
// TODO: make it possible to call CheckBlockIndex() without having set it here, and call it in CallOneOf().
.check_block_index = true,
.checkpoints_enabled = false,
.minimum_chain_work = UintToArith256(uint256{}),
.assumed_valid_block = uint256{},
.notifications = g_notifications,
.signals = &dummy_main_signals,
.notifications = g_test_data.notifs,
.signals = &g_test_data.main_signals,
};
ChainstateManager chainman{*g_setup->m_node.shutdown, chainman_opts, blockman_opts};

Expand All @@ -480,25 +542,16 @@ FUZZ_TARGET(chainstate, .init = init_chainstate)
cache_sizes.coins_db = 2 << 22;
cache_sizes.coins = (450 << 20) - (2 << 20) - (2 << 22);
node::ChainstateLoadOptions load_opts {
.block_tree_db_in_memory = true,
.coins_db_in_memory = true,
.prune = prune_target > 0,
.require_full_verification = false,
.coins_error_cb = nullptr,
};
auto [status, _] = node::LoadChainstate(chainman, cache_sizes, load_opts);
assert(status == node::ChainstateLoadStatus::SUCCESS);

// Activate the initial chain.
BlockValidationState dummy_valstate;
for (Chainstate* chainstate : chainman.GetAll()) {
assert(chainstate->ActivateBestChain(dummy_valstate, nullptr));
}
for (const auto& block : g_initial_blockchain) {
bool new_block{false};
assert(chainman.ProcessNewBlock(block, true, true, &new_block));
assert(new_block);
}
//const auto time_before_loop{SteadyClock::now()};

BlockValidationState dummy_valstate;
std::vector<CBlock> blocks_in_flight;
LIMITED_WHILE(fuzzed_data_provider.ConsumeBool(), 10'000) {
// Every so often, update our cache used to create non-coinbase txs.
Expand Down Expand Up @@ -628,18 +681,13 @@ FUZZ_TARGET(chainstate, .init = init_chainstate)
);
};

for (const auto& [_, fd]: g_fds) {
close(fd);
}
g_fds.clear();

for (const auto& [_, fd]: g_fds) {
close(fd);
}
g_fds.clear();
//const auto time_end{SteadyClock::now()};
//const auto creation_duration{duration_cast<std::chrono::milliseconds>(time_before_loop - first_time)};
//std::cout << "Creation duration: " << creation_duration << std::endl;
//const auto loop_duration{duration_cast<std::chrono::milliseconds>(time_end - time_before_loop)};
//std::cout << "Loop duration: " << loop_duration << std::endl;

// FIXME: ImportBlocks is insanely slow because we've got 128MiB blk files. Can we find an alternative to be able to
// exercise the reindex logic?
// TODO: exercise the reindex logic.
// TODO: sometimes run with an assumed chainstate too. One way could be to generate a snapshot during init and
// sometimes ActivateSnapshot() at the beginning of the harness.
}

0 comments on commit 1059ca3

Please sign in to comment.