toolbox.cpp

/*
   Copyright 2022 The Silkworm Authors

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.
*/

#include <bit>
#include <bitset>
#include <csignal>
#include <filesystem>
#include <fstream>
#include <iostream>
#include <regex>
#include <string>

#include <CLI/CLI.hpp>
#include <boost/bind/bind.hpp>
#include <boost/format.hpp>
#include <magic_enum.hpp>

#include <silkworm/chain/config.hpp>
#include <silkworm/chain/genesis.hpp>
#include <silkworm/common/as_range.hpp>
#include <silkworm/common/assert.hpp>
#include <silkworm/common/directories.hpp>
#include <silkworm/common/endian.hpp>
#include <silkworm/common/log.hpp>
#include <silkworm/concurrency/signal_handler.hpp>
#include <silkworm/db/genesis.hpp>
#include <silkworm/db/prune_mode.hpp>
#include <silkworm/db/stages.hpp>
#include <silkworm/stagedsync/stage_interhashes/trie_cursor.hpp>
#include <silkworm/trie/hash_builder.hpp>
#include <silkworm/trie/nibbles.hpp>
#include <silkworm/trie/prefix_set.hpp>

namespace fs = std::filesystem;
using namespace silkworm;
using namespace boost::placeholders;

class Progress {
  public:
    explicit Progress(uint32_t width) : bar_width_{width}, percent_step_{100u / width} {};
    ~Progress() = default;

    /// Returns current progress percent
    [[nodiscard]] uint32_t percent() const {
        if (!max_counter_) {
            return 100;
        }
        if (!current_counter_) {
            return 0;
        }
        return static_cast<uint32_t>(current_counter_ * 100 / max_counter_);
    }

    void step() { current_counter_++; }
    void set_current(size_t count) { current_counter_ = std::max(count, current_counter_); }
    [[nodiscard]] size_t get_current() const noexcept { return current_counter_; }
    [[nodiscard]] size_t get_increment_count() const noexcept { return bar_width_ ? (max_counter_ / bar_width_) : 0u; }

    void reset() {
        current_counter_ = 0;
        printed_bar_len_ = 0;
    }
    void set_task_count(size_t iterations) {
        reset();
        max_counter_ = iterations;
    }

    /// Prints progress ticks
    std::string print_interval(char c = '.') {
        uint32_t percentage{std::min(percent(), 100u)};
        uint32_t numChars{percentage / percent_step_};
        if (!numChars) return "";
        uint32_t intChars{numChars - printed_bar_len_};
        if (!intChars) return "";
        std::string ret(intChars, c);
        printed_bar_len_ += intChars;
        return ret;
    }

    [[maybe_unused]] [[nodiscard]] std::string print_progress(char c = '.') const {
        uint32_t percentage{percent()};
        uint32_t numChars{percentage / percent_step_};
        if (!numChars) {
            return "";
        }
        std::string ret(numChars, c);
        return ret;
    }

  private:
    uint32_t bar_width_;
    uint32_t percent_step_;
    size_t max_counter_{0};
    size_t current_counter_{0};
    uint32_t printed_bar_len_{0};
};

struct dbTableEntry {
    MDBX_dbi id{0};
    std::string name{};
    mdbx::txn::map_stat stat;
    mdbx::map_handle::info info;
    [[nodiscard]] size_t pages() const noexcept {
        return stat.ms_branch_pages + stat.ms_leaf_pages + stat.ms_overflow_pages;
    }
    [[nodiscard]] size_t size() const noexcept { return pages() * stat.ms_psize; }
};

struct dbTablesInfo {
    size_t mapsize{0};
    size_t filesize{0};
    size_t pageSize{0};
    size_t pages{0};
    size_t size{0};
    std::vector<dbTableEntry> tables{};
};

struct dbFreeEntry {
    size_t id{0};
    size_t pages{0};
    size_t size{0};
};

struct dbFreeInfo {
    size_t pages{0};
    size_t size{0};
    std::vector<dbFreeEntry> entries{};
};

bool user_confirmation() {
    static std::regex pattern{"^([yY])?([nN])?$"};
    std::smatch matches;

    std::string user_input;
    std::cout << "Confirm ? [y/N] ";
    do {
        std::cin >> user_input;
        std::cin.clear();
        if (std::regex_search(user_input, matches, pattern, std::regex_constants::match_default)) {
            break;
        }
    } while (true);

    if (matches[2].length()) {
        return false;
    }

    return true;
}

void do_clear(db::EnvConfig& config, bool dry, bool always_yes, const std::vector<std::string>& table_names,
              bool drop) {
    config.readonly = false;

    if (!config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to database");
    }

    auto env{db::open_env(config)};
    auto txn{env.start_write()};

    for (const auto& tablename : table_names) {
        if (!db::has_map(txn, tablename.c_str())) {
            std::cout << "Table " << tablename << " not found" << std::endl;
            continue;
        }

        mdbx::map_handle table_map{txn.open_map(tablename)};
        size_t rcount{txn.get_map_stat(table_map).ms_entries};

        if (!rcount && !drop) {
            std::cout << " Table " << tablename << " is already empty. Skipping" << std::endl;
            continue;
        }

        std::cout << "\n"
                  << (drop ? "Dropping" : "Emptying") << " table " << tablename << " (" << rcount << " records) "
                  << std::flush;

        if (!always_yes) {
            if (!user_confirmation()) {
                std::cout << "  Skipped." << std::endl;
                continue;
            }
        }

        std::cout << (dry ? "Simulating commit ..." : "Committing ...") << std::endl;

        if (drop) {
            txn.drop_map(table_map);
        } else {
            txn.clear_map(table_map);
        }
        if (dry) {
            txn.abort();
        } else {
            txn.commit();
        }
        txn = env.start_write();
    }
}

dbFreeInfo get_freeInfo(::mdbx::txn& txn) {
    dbFreeInfo ret{};

    ::mdbx::map_handle free_map{0};
    auto page_size{txn.get_map_stat(free_map).ms_psize};

    const auto& collect_func{[&ret, &page_size](const ::mdbx::cursor&, ::mdbx::cursor::move_result& data) -> bool {
        size_t txId;
        std::memcpy(&txId, data.key.data(), sizeof(size_t));
        uint32_t pagesCount;
        std::memcpy(&pagesCount, data.value.data(), sizeof(uint32_t));
        size_t pagesSize = pagesCount * page_size;
        ret.pages += pagesCount;
        ret.size += pagesSize;
        ret.entries.push_back({txId, pagesCount, pagesSize});
        return true;
    }};

    auto free_crs{txn.open_cursor(free_map)};
    (void)db::cursor_for_each(free_crs, collect_func);

    return ret;
}

dbTablesInfo get_tablesInfo(::mdbx::txn& txn) {
    dbTablesInfo ret{};
    dbTableEntry* table;

    ret.filesize = txn.env().get_info().mi_geo.current;

    // Get info from the free database
    ::mdbx::map_handle free_map{0};
    auto stat = txn.get_map_stat(free_map);
    auto info = txn.get_handle_info(free_map);
    table = new dbTableEntry{free_map.dbi, "FREE_DBI", stat, info};
    ret.pageSize += table->stat.ms_psize;
    ret.pages += table->pages();
    ret.size += table->size();
    ret.tables.push_back(*table);

    // Get info from the unnamed database
    ::mdbx::map_handle main_map{1};
    stat = txn.get_map_stat(main_map);
    info = txn.get_handle_info(main_map);
    table = new dbTableEntry{main_map.dbi, "MAIN_DBI", stat, info};
    ret.pageSize += table->stat.ms_psize;
    ret.pages += table->pages();
    ret.size += table->size();
    ret.tables.push_back(*table);

    const auto& collect_func{[&ret, &txn](const ::mdbx::cursor&, ::mdbx::cursor::move_result& data) -> bool {
        auto named_map{txn.open_map(data.key.as_string())};
        auto stat2{txn.get_map_stat(named_map)};
        auto info2{txn.get_handle_info(named_map)};
        auto* table2 = new dbTableEntry{named_map.dbi, data.key.as_string(), stat2, info2};

        ret.pageSize += table2->stat.ms_psize;
        ret.pages += table2->pages();
        ret.size += table2->size();
        ret.tables.push_back(*table2);

        return true;
    }};

    // Get all tables from the unnamed database
    auto main_crs{txn.open_cursor(main_map)};
    (void)db::cursor_for_each(main_crs, collect_func);
    return ret;
}

void do_scan(const db::EnvConfig& config) {
    static std::string fmt_hdr{" %3s %-24s %=50s %13s %13s %13s"};

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};

    auto tablesInfo{get_tablesInfo(txn)};

    std::cout << "\n Database tables    : " << tablesInfo.tables.size() << "\n"
              << std::endl;

    if (!tablesInfo.tables.empty()) {
        std::cout << (boost::format(fmt_hdr) % "Dbi" % "Table name" % "Progress" % "Keys" % "Data" % "Total")
                  << std::endl;
        std::cout << (boost::format(fmt_hdr) % std::string(3, '-') % std::string(24, '-') % std::string(50, '-') %
                      std::string(13, '-') % std::string(13, '-') % std::string(13, '-'))
                  << std::flush;

        for (dbTableEntry item : tablesInfo.tables) {
            mdbx::map_handle tbl_map;

            std::cout << "\n"
                      << (boost::format(" %3u %-24s ") % item.id % item.name) << std::flush;

            if (item.id < 2) {
                tbl_map = mdbx::map_handle(item.id);
            } else {
                tbl_map = txn.open_map(item.name);
            }

            size_t key_size{0};
            size_t data_size{0};
            Progress progress{50};
            progress.set_task_count(item.stat.ms_entries);
            size_t batch_size{progress.get_increment_count()};

            auto tbl_crs{txn.open_cursor(tbl_map)};
            auto result = tbl_crs.to_first(/*throw_notfound =*/false);

            while (result) {
                key_size += result.key.size();
                data_size += result.value.size();
                if (!--batch_size) {
                    if (SignalHandler::signalled()) {
                        break;
                    }
                    progress.set_current(progress.get_current() + progress.get_increment_count());
                    std::cout << progress.print_interval('.') << std::flush;
                    batch_size = progress.get_increment_count();
                }
                result = tbl_crs.to_next(/*throw_notfound =*/false);
            }

            if (!SignalHandler::signalled()) {
                progress.set_current(item.stat.ms_entries);
                std::cout << progress.print_interval('.') << std::flush;
                std::cout << (boost::format(" %13s %13s %13s") % human_size(key_size) % human_size(data_size) %
                              human_size(key_size + data_size))
                          << std::flush;
            } else {
                break;
            }
        }
    }

    std::cout << "\n"
              << (SignalHandler::signalled() ? "Aborted" : "Done") << " !\n " << std::endl;
    txn.commit();
    env.close(config.shared);
}

void do_stages(db::EnvConfig& config) {
    static std::string fmt_hdr{" %-24s %10s "};
    static std::string fmt_row{" %-24s %10u %-8s"};

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};
    if (!db::has_map(txn, db::table::kSyncStageProgress.name)) {
        throw std::runtime_error("Either not a Silkworm db or table " +
                                 std::string{db::table::kSyncStageProgress.name} + " not found");
    }

    auto crs{db::open_cursor(txn, db::table::kSyncStageProgress)};

    if (txn.get_map_stat(crs.map()).ms_entries) {
        std::cout << "\n"
                  << (boost::format(fmt_hdr) % "Stage Name" % "Block") << std::endl;
        std::cout << (boost::format(fmt_hdr) % std::string(24, '-') % std::string(10, '-')) << std::endl;

        auto result{crs.to_first(/*throw_notfound =*/false)};
        while (result) {
            size_t height{endian::load_big_u64(static_cast<uint8_t*>(result.value.data()))};

            // Handle "prune_" stages
            size_t offset{0};
            static const char* prune_prefix = "prune_";
            if (std::memcmp(result.key.data(), prune_prefix, 6) == 0) {
                offset = 6;
            }

            bool Known{db::stages::is_known_stage(result.key.char_ptr() + offset)};
            std::cout << (boost::format(fmt_row) % result.key.as_string() % height %
                          (Known ? std::string(8, ' ') : "Unknown"))
                      << std::endl;
            result = crs.to_next(/*throw_notfound =*/false);
        }
        std::cout << "\n"
                  << std::endl;
    } else {
        std::cout << "\n There are no stages to list\n"
                  << std::endl;
    }

    txn.commit();
    env.close(config.shared);
}

void do_migrations(db::EnvConfig& config) {
    static std::string fmt_hdr{" %-24s"};
    static std::string fmt_row{" %-24s"};

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};

    if (!db::has_map(txn, db::table::kMigrations.name)) {
        throw std::runtime_error("Either not a Silkworm db or table " + std::string{db::table::kMigrations.name} +
                                 " not found");
    }

    auto crs{db::open_cursor(txn, db::table::kMigrations)};

    if (txn.get_map_stat(crs.map()).ms_entries) {
        std::cout << "\n"
                  << (boost::format(fmt_hdr) % "Migration Name") << std::endl;
        std::cout << (boost::format(fmt_hdr) % std::string(24, '-')) << std::endl;

        auto result{crs.to_first(/*throw_notfound =*/false)};
        while (result) {
            std::cout << (boost::format(fmt_row) % result.key.as_string()) << std::endl;
            result = crs.to_next(/*throw_notfound =*/false);
        }
        std::cout << "\n"
                  << std::endl;
    } else {
        std::cout << "\n There are no migrations to list\n"
                  << std::endl;
    }

    txn.commit();
    env.close(config.shared);
}

void do_stage_set(db::EnvConfig& config, std::string&& stage_name, uint32_t new_height, bool dry) {
    config.readonly = false;

    if (!config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to database");
    }

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_write()};
    if (!db::stages::is_known_stage(stage_name.c_str())) {
        throw std::runtime_error("Stage name " + stage_name + " is not known");
    }
    if (!db::has_map(txn, silkworm::db::table::kSyncStageProgress.name)) {
        throw std::runtime_error("Either non Silkworm db or table " +
                                 std::string(silkworm::db::table::kSyncStageProgress.name) + " not found");
    }
    auto old_height{db::stages::read_stage_progress(txn, stage_name.c_str())};
    db::stages::write_stage_progress(txn, stage_name.c_str(), new_height);
    if (!dry) {
        txn.commit();
    }

    std::cout << "\n Stage " << stage_name << " touched from " << old_height << " to " << new_height << "\n"
              << std::endl;
}

void do_tables(db::EnvConfig& config) {
    static std::string fmt_hdr{" %3s %-24s %10s %2s %10s %10s %10s %12s %10s %10s"};
    static std::string fmt_row{" %3i %-24s %10u %2u %10u %10u %10u %12s %10s %10s"};

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};

    auto dbTablesInfo{get_tablesInfo(txn)};
    auto dbFreeInfo{get_freeInfo(txn)};

    std::cout << "\n Database tables          : " << dbTablesInfo.tables.size() << std::endl;
    std::cout << " Effective pruning        : " << db::read_prune_mode(txn).to_string() << "\n"
              << std::endl;

    if (!dbTablesInfo.tables.empty()) {
        std::cout << (boost::format(fmt_hdr) % "Dbi" % "Table name" % "Records" % "D" % "Branch" % "Leaf" % "Overflow" %
                      "Size" % "Key" % "Value")
                  << std::endl;
        std::cout << (boost::format(fmt_hdr) % std::string(3, '-') % std::string(24, '-') % std::string(10, '-') %
                      std::string(2, '-') % std::string(10, '-') % std::string(10, '-') % std::string(10, '-') %
                      std::string(12, '-') % std::string(10, '-') % std::string(10, '-'))
                  << std::endl;

        for (auto& item : dbTablesInfo.tables) {
            auto keyMode = magic_enum::enum_name(item.info.key_mode());
            auto valueMode = magic_enum::enum_name(item.info.value_mode());
            std::cout << (boost::format(fmt_row) % item.id % item.name % item.stat.ms_entries % item.stat.ms_depth %
                          item.stat.ms_branch_pages % item.stat.ms_leaf_pages % item.stat.ms_overflow_pages %
                          human_size(item.size()) % keyMode % valueMode)
                      << std::endl;
        }
    }

    std::cout << "\n"
              << " Database file size   (A) : " << (boost::format("%13s") % human_size(dbTablesInfo.filesize)) << "\n"
              << " Data pages count         : " << (boost::format("%13u") % dbTablesInfo.pages) << "\n"
              << " Data pages size      (B) : " << (boost::format("%13s") % human_size(dbTablesInfo.size)) << "\n"
              << " Free pages count         : " << (boost::format("%13u") % dbTablesInfo.tables[0].pages()) << "\n"
              << " Free pages size      (C) : " << (boost::format("%13s") % human_size(dbFreeInfo.size)) << "\n"
              << " Reclaimable space        : "
              << (boost::format("%13s") % human_size(dbTablesInfo.filesize - dbTablesInfo.size + dbFreeInfo.size))
              << " == A - B + C \n"
              << std::endl;

    txn.commit();
    env.close(config.shared);
}

void do_freelist(db::EnvConfig& config, bool detail) {
    static std::string fmt_hdr{"%9s %9s %12s"};
    static std::string fmt_row{"%9u %9u %12s"};

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};

    auto dbFreeInfo{get_freeInfo(txn)};
    if (!dbFreeInfo.entries.empty() && detail) {
        std::cout << "\n"
                  << (boost::format(fmt_hdr) % "TxId" % "Pages" % "Size") << "\n"
                  << (boost::format(fmt_hdr) % std::string(9, '-') % std::string(9, '-') % std::string(12, '-'))
                  << std::endl;
        for (auto& item : dbFreeInfo.entries) {
            std::cout << (boost::format(fmt_row) % item.id % item.pages % human_size(item.size)) << std::endl;
        }
    }
    std::cout << "\n Record count         : " << boost::format("%13u") % dbFreeInfo.entries.size() << "\n"
              << " Free pages count     : " << boost::format("%13u") % dbFreeInfo.pages << "\n"
              << " Free pages size      : " << boost::format("%13s") % human_size(dbFreeInfo.size) << "\n"
              << std::endl;

    txn.commit();
    env.close(config.shared);
}

void do_schema(db::EnvConfig& config) {
    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};

    auto schema_version{db::read_schema_version(txn)};
    if (!schema_version.has_value()) {
        throw std::runtime_error("Not a Silkworm db or no schema version found");
    }
    std::cout << "\n"
              << "Database schema version : " << schema_version->to_string() << "\n"
              << std::endl;

    txn.commit();
    env.close(config.shared);
}

void do_compact(db::EnvConfig& config, const std::string& work_dir, bool replace, bool nobak) {
    if (!config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to database");
    }

    fs::path work_path{work_dir};
    if (work_path.has_filename()) {
        work_path += fs::path::preferred_separator;
    }
    std::error_code ec;
    fs::create_directories(work_path, ec);
    if (ec) {
        throw std::runtime_error("Directory " + work_path.string() + " does not exist and could not be created");
    }

    fs::path target_file_path{work_path / fs::path(db::kDbDataFileName)};
    if (fs::exists(target_file_path)) {
        throw std::runtime_error("Directory " + work_path.string() + " already contains an " +
                                 std::string(db::kDbDataFileName) + " file");
    }

    auto env{silkworm::db::open_env(config)};

    // Determine file size of origin db
    size_t src_filesize{env.get_info().mi_geo.current};

    // Ensure target working directory has enough free space
    // at least the size of origin db
    auto target_space = fs::space(target_file_path.parent_path());
    if (target_space.free <= src_filesize) {
        throw std::runtime_error("Insufficient disk space on working directory's partition");
    }

    std::cout << "\n Compacting database from " << config.path << "\n into " << target_file_path
              << "\n Please be patient as there is no progress report ..." << std::endl;
    env.copy(/*destination*/ target_file_path.string(), /*compactify*/ true, /*forcedynamic*/ true);
    std::cout << "\n Database compaction " << (SignalHandler::signalled() ? "aborted !" : "completed ...") << std::endl;
    env.close();

    if (!SignalHandler::signalled()) {
        // Do we have a valid compacted file on disk ?
        // replace source with target
        if (!fs::exists(target_file_path)) {
            throw std::runtime_error("Can't locate compacted database");
        }

        // Do we have to replace original file ?
        if (replace) {
            auto source_file_path{db::get_datafile_path(fs::path(config.path))};
            // Create a backup copy before replacing ?
            if (!nobak) {
                std::cout << " Creating backup copy of origin database ..." << std::endl;
                std::string src_file_back{db::kDbDataFileName};
                src_file_back.append(".bak");
                fs::path src_path_bak{source_file_path.parent_path() / fs::path{src_file_back}};
                if (fs::exists(src_path_bak)) {
                    fs::remove(src_path_bak);
                }
                fs::rename(source_file_path, src_path_bak);
            }

            std::cout << " Replacing origin database with compacted ..." << std::endl;
            if (fs::exists(source_file_path)) {
                fs::remove(source_file_path);
            }
            fs::rename(target_file_path, source_file_path);
        }
    }
}

void do_copy(db::EnvConfig& src_config, const std::string& target_dir, bool create, bool noempty,
             std::vector<std::string>& names, std::vector<std::string>& xnames) {
    if (!src_config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to source database");
    }

    fs::path target_path{target_dir};
    if (target_path.has_filename()) {
        target_path += fs::path::preferred_separator;
    }
    if (!fs::exists(target_path) || !fs::is_directory(target_path)) {
        if (!create) {
            throw std::runtime_error("Directory " + target_path.string() + " does not exist. Try --create");
        }
        std::error_code ec;
        fs::create_directories(target_path, ec);
        if (ec) {
            throw std::runtime_error("Directory " + target_path.string() + " does not exist and could not be created");
        }
    }

    // Target config
    db::EnvConfig tgt_config{target_path.string()};
    tgt_config.exclusive = true;
    fs::path target_file_path{target_path / fs::path(db::kDbDataFileName)};
    if (!fs::exists(target_file_path)) {
        tgt_config.create = true;
    }

    // Source db
    auto src_env{silkworm::db::open_env(src_config)};
    auto src_txn{src_env.start_read()};

    // Target db
    auto tgt_env{silkworm::db::open_env(tgt_config)};
    auto tgt_txn{tgt_env.start_write()};

    // Get free info and tables from both source and target environment
    auto src_tableInfo = get_tablesInfo(src_txn);
    auto tgt_tableInfo = get_tablesInfo(tgt_txn);

    // Check source db has tables to copy besides the two system tables
    if (src_tableInfo.tables.size() < 3) {
        throw std::runtime_error("Source db has no tables to copy.");
    }

    size_t bytesWritten{0};
    std::cout << boost::format(" %-24s %=50s") % "Table" % "Progress" << std::endl;
    std::cout << boost::format(" %-24s %=50s") % std::string(24, '-') % std::string(50, '-') << std::flush;

    // Loop source tables
    for (auto& src_table : src_tableInfo.tables) {
        if (SignalHandler::signalled()) {
            break;
        }
        std::cout << "\n " << boost::format("%-24s ") % src_table.name << std::flush;

        // Is this a system table ?
        if (src_table.id < 2) {
            std::cout << "Skipped (SYSTEM TABLE)" << std::flush;
            continue;
        }

        // Is this table present in the list user has provided ?
        if (!names.empty()) {
            auto it = as_range::find(names, src_table.name);
            if (it == names.end()) {
                std::cout << "Skipped (no match --tables)" << std::flush;
                continue;
            }
        }

        // Is this table present in the list user has excluded ?
        if (!xnames.empty()) {
            auto it = as_range::find(xnames, src_table.name);
            if (it != xnames.end()) {
                std::cout << "Skipped (match --xtables)" << std::flush;
                continue;
            }
        }

        // Is table empty ?
        if (!src_table.stat.ms_entries && noempty) {
            std::cout << "Skipped (--noempty)" << std::flush;
            continue;
        }

        // Is source table already present in target db ?
        bool exists_on_target{false};
        bool populated_on_target{false};
        if (!tgt_tableInfo.tables.empty()) {
            auto it = as_range::find_if(
                tgt_tableInfo.tables, [&src_table](dbTableEntry& item) -> bool { return item.name == src_table.name; });
            if (it != tgt_tableInfo.tables.end()) {
                exists_on_target = true;
                populated_on_target = (it->stat.ms_entries > 0);
            }
        }

        // Ready to copy
        auto src_table_map{src_txn.open_map(src_table.name)};
        auto src_table_info{src_txn.get_handle_info(src_table_map)};

        // If table does not exist on target create it with same flags as
        // origin table. Check the info match otherwise.
        mdbx::map_handle tgt_table_map;
        if (!exists_on_target) {
            tgt_table_map = tgt_txn.create_map(src_table.name, src_table_info.key_mode(), src_table_info.value_mode());
        } else {
            tgt_table_map = tgt_txn.open_map(src_table.name);
            auto tgt_table_info{tgt_txn.get_handle_info(tgt_table_map)};
            if (src_table_info.flags != tgt_table_info.flags) {
                std::cout << "Skipped (source and target have incompatible flags)" << std::flush;
                continue;
            }
        }

        // Loop source and write into target
        Progress progress{50};
        progress.set_task_count(src_table.stat.ms_entries);
        size_t batch_size{progress.get_increment_count()};
        bool batch_committed{false};

        auto src_table_crs{src_txn.open_cursor(src_table_map)};
        auto tgt_table_crs{tgt_txn.open_cursor(tgt_table_map)};
        MDBX_put_flags_t put_flags{populated_on_target
                                       ? MDBX_put_flags_t::MDBX_UPSERT
                                       : ((src_table_info.flags & MDBX_DUPSORT) ? MDBX_put_flags_t::MDBX_APPENDDUP
                                                                                : MDBX_put_flags_t::MDBX_APPEND)};

        auto data{src_table_crs.to_first(/*throw_notfound =*/false)};
        while (data) {
            ::mdbx::error::success_or_throw(tgt_table_crs.put(data.key, &data.value, put_flags));
            bytesWritten += (data.key.length() + data.value.length());
            if (bytesWritten >= 2_Gibi) {
                tgt_txn.commit();
                tgt_txn = tgt_env.start_write();
                tgt_table_crs.renew(tgt_txn);
                batch_committed = true;
                bytesWritten = 0;
            }

            if (!--batch_size) {
                if (SignalHandler::signalled()) {
                    break;
                }
                progress.set_current(progress.get_current() + progress.get_increment_count());
                std::cout << progress.print_interval(batch_committed ? 'W' : '.') << std::flush;
                batch_committed = false;
                batch_size = progress.get_increment_count();
            }

            data = src_table_crs.to_next(/*throw_notfound =*/false);
        }

        // Close all
        if (SignalHandler::signalled()) {
            break;
        }

        tgt_txn.commit();
        tgt_txn = tgt_env.start_write();
        batch_committed = true;
        bytesWritten = 0;

        progress.set_current(src_table.stat.ms_entries);
        std::cout << progress.print_interval(batch_committed ? 'W' : '.') << std::flush;
    }

    std::cout << "\n All done!" << std::endl;
}

/**
 * \brief Initializes a silkworm db.
 *
 * Can parse a custom genesis file in json format or import data from known chain configs
 *
 * \param DataDir data_dir : hold data directory info about db paths
 * \param json_file : a string representing the path where to load custom json from
 * \param uint32_t chain_id : an identifier for a known chain
 * \param bool dry : whether or not commit data or run in simulation
 *
 */
void do_init_genesis(DataDirectory& data_dir, const std::string&& json_file, uint32_t chain_id, bool dry) {
    // Check datadir does not exist
    if (data_dir.exists()) {
        throw std::runtime_error("Provided data directory already exist");
    }

    // Ensure data directory tree is built
    data_dir.deploy();

    // Retrieve source data either from provided json file
    // or from embedded sources
    std::string source_data;
    if (!json_file.empty()) {
        std::ifstream ifs(json_file);
        source_data = std::string((std::istreambuf_iterator<char>(ifs)), std::istreambuf_iterator<char>());
    } else if (chain_id != 0) {
        source_data = read_genesis_data(chain_id);
    } else {
        throw std::invalid_argument("Either json file or chain_id must be provided");
    }

    // Parse Json data
    // N.B. = instead of {} initialization due to https://github.com/nlohmann/json/issues/2204
    auto genesis_json = nlohmann::json::parse(source_data, nullptr, /* allow_exceptions = */ false);

    // Prime database
    db::EnvConfig config{data_dir.chaindata().path().string(), /*create*/ true};
    auto env{db::open_env(config)};
    auto txn{env.start_write()};
    db::table::check_or_create_chaindata_tables(txn);
    db::initialize_genesis(txn, genesis_json, /*allow_exceptions=*/true);

    // Set schema version
    silkworm::db::VersionBase v{3, 0, 0};
    db::write_schema_version(txn, v);

    if (!dry) {
        txn.commit();
    } else {
        txn.abort();
    }
    env.close();
}

void do_chainconfig(db::EnvConfig& config) {
    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};
    auto chain_config{db::read_chain_config(txn)};
    if (!chain_config.has_value()) {
        throw std::runtime_error("Not an initialized Silkworm db or unknown/custom chain ");
    }
    const auto& chain{chain_config.value()};
    std::cout << "\n Chain id " << chain.chain_id << "\n Settings (json) : \n"
              << chain.to_json().dump() << "\n"
              << std::endl;

    txn.commit();
    env.close(config.shared);
}

void do_first_byte_analysis(db::EnvConfig& config) {
    static std::string fmt_hdr{" %-24s %=50s "};

    if (!config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to database");
    }

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};

    std::cout << "\n"
              << (boost::format(fmt_hdr) % "Table name" % "%") << "\n"
              << (boost::format(fmt_hdr) % std::string(24, '-') % std::string(50, '-')) << "\n"
              << (boost::format(" %-24s ") % db::table::kCode.name) << std::flush;

    std::unordered_map<uint8_t, size_t> histogram;
    auto code_cursor{db::open_cursor(txn, db::table::kCode)};

    Progress progress{50};
    size_t total_entries{txn.get_map_stat(code_cursor.map()).ms_entries};
    progress.set_task_count(total_entries);
    size_t batch_size{progress.get_increment_count()};

    code_cursor.to_first();
    db::cursor_for_each(code_cursor,
                        [&histogram, &batch_size, &progress](const ::mdbx::cursor&, mdbx::cursor::move_result& entry) {
                            if (entry.value.length() > 0) {
                                uint8_t first_byte{entry.value.at(0)};
                                ++histogram[first_byte];
                            }
                            if (!--batch_size) {
                                progress.set_current(progress.get_current() + progress.get_increment_count());
                                std::cout << progress.print_interval('.') << std::flush;
                                batch_size = progress.get_increment_count();
                            }
                            return true;
                        });

    BlockNum last_block{db::stages::read_stage_progress(txn, db::stages::kExecutionKey)};
    progress.set_current(total_entries);
    std::cout << progress.print_interval('.') << std::endl;

    std::cout << "\n Last block : " << last_block << "\n Contracts  : " << total_entries << "\n"
              << std::endl;

    // Sort histogram by usage (from most used to less used)
    std::vector<std::pair<uint8_t, size_t>> histogram_sorted;
    std::copy(histogram.begin(), histogram.end(),
              std::back_inserter<std::vector<std::pair<uint8_t, size_t>>>(histogram_sorted));
    std::sort(histogram_sorted.begin(), histogram_sorted.end(),
              [](std::pair<uint8_t, size_t>& a, std::pair<uint8_t, size_t>& b) -> bool {
                  return a.second == b.second ? a.first < b.first : a.second > b.second;
              });

    if (!histogram_sorted.empty()) {
        std::cout << (boost::format(" %-4s %8s") % "Byte" % "Count") << "\n"
                  << (boost::format(" %-4s %8s") % std::string(4, '-') % std::string(8, '-')) << std::endl;
        for (const auto& [byte_code, usage_count] : histogram_sorted) {
            std::cout << (boost::format(" 0x%02x %8u") % static_cast<int>(byte_code) % usage_count) << std::endl;
        }
    }

    std::cout << "\n"
              << std::endl;
}

void do_extract_headers(db::EnvConfig& config, const std::string& file_name, uint32_t step) {
    if (!config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to database");
    }

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};

    /// We can store all header hashes into a single byte array given all
    /// hashes are same in length. By consequence we only need to assert
    /// total size of byte array is a multiple of hash length.
    /// The process is mostly the same we have in genesistool.cpp

    /// Open the output file
    std::ofstream out_stream{file_name};
    out_stream << "/* Generated by Silkworm toolbox's extract headers */\n"
               << "#include <cstdint>\n"
               << "#include <cstddef>\n"
               << "static const uint64_t preverified_hashes_mainnet_internal[] = {" << std::endl;

    BlockNum block_max{silkworm::db::stages::read_stage_progress(txn, db::stages::kHeadersKey)};
    BlockNum max_height{0};
    auto hashes_table{db::open_cursor(txn, db::table::kCanonicalHashes)};

    for (BlockNum block_num = 0; block_num <= block_max; block_num += step) {
        auto block_key{db::block_key(block_num)};
        auto data{hashes_table.find(db::to_slice(block_key), false)};
        if (!data.done) {
            break;
        }

        const uint64_t* chuncks{reinterpret_cast<const uint64_t*>(db::from_slice(data.value).data())};
        out_stream << "   ";
        for (int i = 0; i < 4; ++i) {
            std::string hex{to_hex(chuncks[i], true)};
            out_stream << hex << ",";
        }
        out_stream << std::endl;
        max_height = block_num;
    }

    out_stream
        << "};\n"
        << "const uint64_t* preverified_hashes_mainnet_data(){return &preverified_hashes_mainnet_internal[0];}\n"
        << "size_t sizeof_preverified_hashes_mainnet_data(){return sizeof(preverified_hashes_mainnet_internal);}\n"
        << "uint64_t preverified_hashes_mainnet_height(){return " << max_height << "ull;}\n"
        << std::endl;
    out_stream.close();
}

void do_trie_account_analysis(db::EnvConfig& config) {
    static std::string fmt_hdr{" %-24s %=50s "};

    if (!config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to database");
    }

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};

    std::cout << "\n"
              << (boost::format(fmt_hdr) % "Table name" % "%") << "\n"
              << (boost::format(fmt_hdr) % std::string(24, '-') % std::string(50, '-')) << "\n"
              << (boost::format(" %-24s ") % db::table::kTrieOfAccounts.name) << std::flush;

    std::map<size_t, size_t> histogram;
    auto code_cursor{db::open_cursor(txn, db::table::kTrieOfAccounts)};

    Progress progress{50};
    size_t total_entries{txn.get_map_stat(code_cursor.map()).ms_entries};
    progress.set_task_count(total_entries);
    size_t batch_size{progress.get_increment_count()};

    code_cursor.to_first();
    db::cursor_for_each(code_cursor,
                        [&histogram, &batch_size, &progress](const ::mdbx::cursor&, mdbx::cursor::move_result& entry) {
                            ++histogram[entry.key.length()];
                            if (!--batch_size) {
                                progress.set_current(progress.get_current() + progress.get_increment_count());
                                std::cout << progress.print_interval('.') << std::flush;
                                batch_size = progress.get_increment_count();
                            }
                            return true;
                        });

    progress.set_current(total_entries);
    std::cout << progress.print_interval('.') << std::endl;

    if (!histogram.empty()) {
        std::cout << (boost::format(" %-4s %8s") % "Size" % "Count") << "\n"
                  << (boost::format(" %-4s %8s") % std::string(4, '-') % std::string(8, '-')) << std::endl;
        for (const auto& [size, usage_count] : histogram) {
            std::cout << (boost::format(" %4u %8u") % size % usage_count) << std::endl;
        }
    }
    std::cout << "\n"
              << std::endl;
}

void do_trie_scan(db::EnvConfig& config, bool del) {
    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_write()};
    std::vector<db::MapConfig> tables{db::table::kTrieOfAccounts, db::table::kTrieOfStorage};
    size_t counter{1};

    for (const auto& map_config : tables) {
        if (SignalHandler::signalled()) {
            break;
        }
        db::Cursor cursor(txn, map_config);
        std::cout << " Scanning " << map_config.name << std::endl;
        auto data{cursor.to_first(false)};
        while (data) {
            if (data.value.empty()) {
                std::cout << "Empty value at key " << to_hex(db::from_slice(data.key), true) << std::endl;
                if (del) {
                    cursor.erase();
                }
            }
            data = cursor.to_next(false);
            if (!--counter) {
                counter = 128;
                if (SignalHandler::signalled()) {
                    break;
                }
            }
        }
    }
    if (!SignalHandler::signalled()) {
        txn.commit();
    }
    std::cout << "\n"
              << std::endl;
}

void do_trie_integrity(db::EnvConfig& config, bool with_state_coverage, bool continue_scan, bool sanitize) {
    if (!config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to database");
    }

    using namespace std::chrono_literals;
    std::chrono::time_point start{std::chrono::steady_clock::now()};

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_write()};

    std::string source{db::table::kTrieOfAccounts.name};

    bool is_healthy{true};
    db::Cursor trie_cursor1(txn, db::table::kTrieOfAccounts);
    db::Cursor trie_cursor2(txn, db::table::kTrieOfAccounts);
    db::Cursor state_cursor(txn, db::table::kHashedAccounts);
    size_t prefix_len{0};

    Bytes buffer;
    buffer.reserve(256);

    // First loop Accounts; Second loop Storage
    for (int loop_id{0}; loop_id < 2; ++loop_id) {
        if (loop_id != 0) {
            source = std::string(db::table::kTrieOfStorage.name);
            trie_cursor1.bind(txn, db::table::kTrieOfStorage);
            trie_cursor2.bind(txn, db::table::kTrieOfStorage);
            state_cursor.bind(txn, db::table::kHashedStorage);
            prefix_len = db::kHashedStoragePrefixLength;
        }

        log::Info("Checking ...", {"source", source, "state", (with_state_coverage ? "true" : "false")});

        auto data1{trie_cursor1.to_first(false)};

        while (data1) {
            auto data1_k{db::from_slice(data1.key)};
            auto data1_v{db::from_slice(data1.value)};
            auto node_k{data1_k.substr(prefix_len)};

            // Only unmarshal relevant data without copy on read
            if (data1_v.length() < 6) {
                throw std::runtime_error("At key " + to_hex(data1_k, true) + " invalid value length " +
                                         std::to_string(data1_v.length()) + ". Expected >= 6");
            } else if ((data1_v.length() - 6) % kHashLength != 0) {
                throw std::runtime_error("At key " + to_hex(data1_k, true) + " invalid hashes count " +
                                         std::to_string(data1_v.length() - 6) + ". Expected multiple of " +
                                         std::to_string(kHashLength));
            }

            const auto node_state_mask{endian::load_big_u16(&data1_v[0])};
            const auto node_tree_mask{endian::load_big_u16(&data1_v[2])};
            const auto node_hash_mask{endian::load_big_u16(&data1_v[4])};
            bool node_has_root{false};

            if (!node_state_mask) {
                // This node should not be here as it does not point to anything
                std::string what{"At key " + to_hex(data1_k, true) +
                                 " node with nil state_mask. Does not point to anything. Shouldn't be here"};
                if (!continue_scan) {
                    throw std::runtime_error(what);
                }
                is_healthy = false;
                std::cout << " " << what << std::endl;
            }

            if (!trie::is_subset(node_tree_mask, node_state_mask)) {
                throw std::runtime_error("At key " + to_hex(data1_k, true) + " tree mask " +
                                         std::bitset<16>(node_tree_mask).to_string() + " is not subset of state mask " +
                                         std::bitset<16>(node_state_mask).to_string());
            }
            if (!trie::is_subset(node_hash_mask, node_state_mask)) {
                throw std::runtime_error("At key " + to_hex(data1_k, true) + " hash mask " +
                                         std::bitset<16>(node_hash_mask).to_string() + " is not subset of state mask " +
                                         std::bitset<16>(node_state_mask).to_string());
            }

            data1_v.remove_prefix(6);
            auto expected_hashes_count{static_cast<size_t>(std::popcount(node_hash_mask))};
            auto effective_hashes_count{data1_v.length() / kHashLength};
            if (!(effective_hashes_count == expected_hashes_count ||
                  effective_hashes_count == expected_hashes_count + 1u)) {
                std::string what{"At key " + to_hex(data1_k, true) + " invalid hashes count " +
                                 std::to_string(effective_hashes_count) + ". Expected " +
                                 std::to_string(expected_hashes_count) + " from mask " +
                                 std::bitset<16>(node_hash_mask).to_string()};

                if (!continue_scan) {
                    throw std::runtime_error(what);
                }
                is_healthy = false;
                std::cout << " " << what << std::endl;
            } else {
                node_has_root = (effective_hashes_count == expected_hashes_count + 1u);
            }

            /*
             * Nodes with a key length == 0 are root nodes and MUST have a root hash
             */
            if (node_k.empty() && !node_has_root) {
                std::string what{"At key " + to_hex(data1_k, true) + " found root node without root hash"};
                if (!continue_scan) {
                    throw std::runtime_error(what);
                }
                is_healthy = false;
                std::cout << " " << what << std::endl;
            } else if (!node_k.empty() && node_has_root) {
                log::Warning("Unexpected root hash", {"key", to_hex(data1_k, true)});
            }

            /*
             * Check children (if any)
             * Each bit set in tree_mask must point to an existing child
             * Example :
             * Current key       : 010203
             * Current tree_mask : 0b0000000000000100
             * Children key      : 01020302 must exist
             *
             * Current key       : 010203
             * Current tree_mask : 0b0000000000100000
             * Children key      : 01020305 must exist
             */

            if (node_tree_mask) {
                buffer.assign(data1_k).push_back('\0');
                for (int i{std::countr_zero(node_tree_mask)}, e{std::bit_width(node_tree_mask)}; i < e; ++i) {
                    if (((1 << i) & node_tree_mask) == 0) {
                        continue;
                    }
                    buffer.back() = static_cast<uint8_t>(i);
                    auto data2{trie_cursor2.lower_bound(db::to_slice(buffer), false)};
                    if (!data2) {
                        throw std::runtime_error("At key " + to_hex(data1_k, true) + " tree mask is " +
                                                 std::bitset<16>(node_tree_mask).to_string() +
                                                 " but there is no child " + std::to_string(i) +
                                                 " in db. LTE found is : null");
                    } else {
                        auto data2_k{db::from_slice(data2.key)};

                        if (!data2_k.starts_with(buffer)) {
                            throw std::runtime_error("At key " + to_hex(data1_k, true) + " tree mask is " +
                                                     std::bitset<16>(node_tree_mask).to_string() +
                                                     " but there is no child " + std::to_string(i) +
                                                     " in db. LTE found is : " + to_hex(data2_k, true));
                        }
                    }
                }
            }

            /*
             * Check parents (if not root)
             * Whether node key length > 1 then at least one parent with a key length shorter than this one must exist
             * Note : length is expressed in nibbles count
             * Example:
             * When node key : 01020304
             * Must find one key in list {010203; 0102} (max jump of 2)
             */

            if (!node_k.empty()) {
                bool found{false};

                for (size_t i{data1_k.size() - 1}; i >= prefix_len && !found; --i) {
                    auto parent_seek_key{data1_k.substr(0, i)};
                    auto data2{trie_cursor2.find(db::to_slice(parent_seek_key), false)};
                    if (!data2) {
                        continue;
                    }
                    found = true;
                    const auto data2_v{db::from_slice(data2.value)};
                    const auto parent_tree_mask{endian::load_big_u16(&data2_v[2])};
                    const auto parent_child_id{static_cast<int>(data1_k[i])};
                    const auto parent_has_tree_bit{(parent_tree_mask & (1 << parent_child_id)) != 0};
                    if (!parent_has_tree_bit) {
                        found = false;
                        if (sanitize) {
                            log::Warning("Erasing orphan", {"key", to_hex(data1_k, true)});
                            trie_cursor1.erase();
                            goto next_node;
                        }
                        std::string what{"At key " + to_hex(data1_k, true) + " found parent key " +
                                         to_hex(parent_seek_key, true) +
                                         " with tree mask : " + std::bitset<16>(parent_tree_mask).to_string() +
                                         " and no bit set at position " + std::to_string(parent_child_id)};
                        if (!continue_scan) {
                            throw std::runtime_error(what);
                        }
                        is_healthy = false;
                        std::cout << " " << what << std::endl;
                    }
                }

                if (!found) {
                    if (sanitize) {
                        log::Warning("Erasing orphan", {"key", to_hex(data1_k, true)});
                        trie_cursor1.erase();
                        goto next_node;
                    }
                    std::string what{"At key " + to_hex(data1_k, true) + " no parent found"};
                    if (!continue_scan) {
                        throw std::runtime_error(what);
                    }
                    is_healthy = false;
                    std::cout << " " << what << std::endl;
                }
            }

            /*
             * Slow check for state coverage
             * Whether the node has any hash_state bit set then we must ensure the bits point to
             * an existing hashed state (either account or storage)
             *
             * Example:
             * Current key        : 010203
             * Current state_mask : 0b0000000000000001
             * New Nibbled key    : 01020300
             * Packed key         : 1230
             * A state with prefix in range [1230 ... 1231) must exist
             */

            if (with_state_coverage && node_state_mask) {
                // Buffer is used to build seek key
                buffer.assign(data1_k.substr(prefix_len));
                buffer.push_back('\0');

                auto bits_to_match{buffer.length() * 4};

                // >>> See Erigon's /ethdb/kv_util.go::BytesMask
                uint8_t mask{0xff};
                auto fixed_bytes{(bits_to_match + 7) / 8};
                auto shift_bits{bits_to_match & 7};
                if (shift_bits != 0) {
                    mask <<= (8 - shift_bits);
                }
                // <<< See Erigon's ByteMask

                for (int i{std::countr_zero(node_state_mask)}, e{std::bit_width(node_state_mask)}; i < e; ++i) {
                    if (((1 << i) & node_state_mask) == 0) {
                        continue;
                    }

                    bool found{false};
                    buffer.back() = static_cast<uint8_t>(i);

                    Bytes seek{trie::pack_nibbles(buffer)};

                    // On first loop we search HashedAccounts (which is not dupsorted)
                    if (!loop_id) {
                        auto data3{state_cursor.lower_bound(db::to_slice(seek), false)};
                        if (data3) {
                            auto data3_k{db::from_slice(data3.key)};
                            if (data3_k.length() >= fixed_bytes) {
                                found = (bits_to_match == 0 ||
                                         ((data3_k.substr(0, fixed_bytes - 1) == seek.substr(0, fixed_bytes - 1)) &&
                                          ((data3_k[fixed_bytes - 1] & mask) == (seek[fixed_bytes - 1] & mask))));
                            }
                        }
                        if (!found) {
                            std::string what{"At key " + to_hex(data1_k, true) + " state mask is " +
                                             std::bitset<16>(node_state_mask).to_string() + " but there is no child " +
                                             std::to_string(i) + "," + to_hex(seek, true) + " in hashed state"};
                            if (data3) {
                                auto data3_k{db::from_slice(data3.key)};
                                what.append(" found instead " + to_hex(data3_k, true));
                            }
                            throw std::runtime_error(what);
                        }
                    } else {
                        // On second loop we search HashedStorage (which is dupsorted)
                        auto data3{state_cursor.lower_bound_multivalue(db::to_slice(data1_k.substr(0, prefix_len)),
                                                                       db::to_slice(seek), false)};
                        if (data3) {
                            auto data3_v{db::from_slice(data3.value)};
                            if (data3_v.length() >= fixed_bytes) {
                                found = (bits_to_match == 0 ||
                                         ((data3_v.substr(0, fixed_bytes - 1) == seek.substr(0, fixed_bytes - 1)) &&
                                          ((data3_v[fixed_bytes - 1] & mask) == (seek[fixed_bytes - 1] & mask))));
                            }
                        }
                        if (!found) {
                            std::string what{"At key " + to_hex(data1_k, true) + " state mask is " +
                                             std::bitset<16>(node_state_mask).to_string() + " but there is no child " +
                                             std::to_string(i) + "," + to_hex(seek, true) + " in state"};
                            if (data3) {
                                auto data3_k{db::from_slice(data3.key)};
                                auto data3_v{db::from_slice(data3.value)};
                                what.append(" found instead " + to_hex(data3_k, true) + to_hex(data3_v, false));
                            }
                            throw std::runtime_error(what);
                        }
                    };
                }
            }

            if (std::chrono::time_point now{std::chrono::steady_clock::now()}; now - start >= 10s) {
                if (SignalHandler::signalled()) {
                    throw std::runtime_error("Interrupted");
                }
                std::swap(start, now);
                log::Info("Checking ...", {"source", source, "key", to_hex(data1_k, true)});
            }

        next_node:
            data1 = trie_cursor1.to_next(false);
        }
    }
    if (!is_healthy) {
        throw std::runtime_error("Check failed");
    }

    log::Info("Integrity check", {"status", "ok"});
    log::Info("Closing db", {"path", env.get_path().string()});
    txn.commit();
    env.close();
}

void do_trie_reset(db::EnvConfig& config, bool always_yes) {
    if (!config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to database");
    }

    if (!always_yes) {
        if (!user_confirmation()) {
            return;
        }
    }

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_write()};
    log::Info("Clearing ...", {"table", db::table::kTrieOfAccounts.name});
    txn.clear_map(db::table::kTrieOfAccounts.name);
    log::Info("Clearing ...", {"table", db::table::kTrieOfStorage.name});
    txn.clear_map(db::table::kTrieOfStorage.name);
    log::Info("Setting progress ...", {"key", db::stages::kIntermediateHashesKey, "value", "0"});
    db::stages::write_stage_progress(txn, db::stages::kIntermediateHashesKey, 0);
    log::Info("Committing ...", {});
    txn.commit();
    log::Info("Closing db", {"path", env.get_path().string()});
    env.close();
}

void do_trie_root(db::EnvConfig& config) {
    if (!config.exclusive) {
        throw std::runtime_error("Function requires exclusive access to database");
    }

    auto env{silkworm::db::open_env(config)};
    auto txn{env.start_read()};
    db::Cursor trie_accounts(txn, db::table::kTrieOfAccounts);
    std::string source{db::table::kTrieOfAccounts.name};

    // Retrieve expected state root
    auto hashstate_stage_progress{db::stages::read_stage_progress(txn, db::stages::kHashStateKey)};
    auto intermediate_hashes_stage_progress{db::stages::read_stage_progress(txn, db::stages::kIntermediateHashesKey)};
    if (hashstate_stage_progress != intermediate_hashes_stage_progress) {
        throw std::runtime_error("HashState and Intermediate hashes stage progresses do not match");
    }
    auto header_hash{db::read_canonical_header_hash(txn, hashstate_stage_progress)};
    auto header{db::read_header(txn, hashstate_stage_progress, header_hash->bytes)};
    auto expected_state_root{header->state_root};

    trie::PrefixSet empty_changes{};  // We need this to tell we have no changes. If nullptr means full regen
    trie::HashBuilder hash_builder;

    trie::TrieCursor trie_cursor{trie_accounts, &empty_changes};
    for (auto trie_data{trie_cursor.to_prefix({})}; trie_data.key.has_value(); trie_data = trie_cursor.to_next()) {
        SILKWORM_ASSERT(!trie_data.first_uncovered.has_value());  // Means skip state
        log::Info("Trie", {"key", to_hex(trie_data.key.value(), true), "hash", to_hex(trie_data.hash.value(), true)});
        auto hash{to_bytes32(trie_data.hash.value())};
        hash_builder.add_branch_node(trie_data.key.value(), hash, false);
        if (SignalHandler::signalled()) {
            throw std::runtime_error("Interrupted");
        }
        if (trie_data.key->empty()) {
            break;  // just added root node
        }
    }

    auto computed_state_root{hash_builder.root_hash()};
    if (computed_state_root != expected_state_root) {
        log::Error("State root",
                   {"expected", to_hex(expected_state_root, true), "got", to_hex(hash_builder.root_hash(), true)});
    } else {
        log::Info("State root " + to_hex(computed_state_root, true));
    }
}

int main(int argc, char* argv[]) {
    SignalHandler::init();

    CLI::App app_main("Silkworm db tool");
    app_main.get_formatter()->column_width(50);
    app_main.require_subcommand(1);  // At least 1 subcommand is required
    log::Settings log_settings{};    // Holds logging settings

    /*
     * Database options (path required)
     */
    auto db_opts = app_main.add_option_group("Db", "Database options");
    db_opts->get_formatter()->column_width(35);
    auto shared_opt = db_opts->add_flag("--shared", "Open database in shared mode");
    auto exclusive_opt = db_opts->add_flag("--exclusive", "Open database in exclusive mode")->excludes(shared_opt);

    auto db_opts_paths = db_opts->add_option_group("Path", "Database path")->require_option(1);
    db_opts_paths->get_formatter()->column_width(35);

    auto chaindata_opt = db_opts_paths->add_option("--chaindata", "Path to directory for mdbx.dat");
    auto datadir_opt = db_opts_paths->add_option("--datadir", "Path to data directory")->excludes(chaindata_opt);

    /*
     * Common opts and flags
     */

    auto app_yes_opt = app_main.add_flag("-Y,--yes", "Assume yes to all requests of confirmation");
    auto app_dry_opt = app_main.add_flag("--dry", "Don't commit to db. Only simulate");

    /*
     * Subcommands
     */

    // List tables and gives info about storage
    auto cmd_tables = app_main.add_subcommand("tables", "List db and tables info");
    auto cmd_tables_scan_opt = cmd_tables->add_flag("--scan", "Scan real data size (long)");

    // List infor of free pages with optional detail
    auto cmd_freelist = app_main.add_subcommand("freelist", "Print free pages info");
    auto freelist_detail_opt = cmd_freelist->add_flag("--detail", "Gives detail for each FREE_DBI record");

    // Read db schema
    auto cmd_schema = app_main.add_subcommand("schema", "Reports schema version of Silkworm database");

    // List stages keys and their heights
    auto cmd_stages = app_main.add_subcommand("stages", "List stages and their actual heights");

    // List migration keys
    auto cmd_migrations = app_main.add_subcommand("migrations", "List migrations");

    // Clear table tool
    auto cmd_clear = app_main.add_subcommand("clear", "Empties or drops provided named table(s)");
    std::vector<std::string> cmd_clear_names;
    cmd_clear->add_option("--names", cmd_clear_names, "Name(s) of table to clear")->required();
    auto cmd_clear_drop_opt = cmd_clear->add_flag("--drop", "Drop table instead of emptying it");

    // Compact database file
    auto cmd_compact = app_main.add_subcommand("compact", "Compacts an lmdb database");
    auto cmd_compact_workdir_opt = cmd_compact->add_option("--workdir", "Working directory")->required();
    auto cmd_compact_replace_opt = cmd_compact->add_flag("--replace", "Replace original file with compacted");
    auto cmd_compact_nobak_opt = cmd_compact->add_flag("--nobak", "Don't create a bak copy of original when replacing")
                                     ->needs(cmd_compact_replace_opt);

    // Copy database file or subset of tables
    auto cmd_copy = app_main.add_subcommand("copy", "Copies an entire Silkworm database or subset of tables")
                        ->excludes(app_dry_opt);
    auto cmd_copy_targetdir_opt = cmd_copy->add_option("--targetdir", "Target directory")->required();
    auto cmd_copy_target_create_opt = cmd_copy->add_flag("--create", "Create target db if not exists");
    auto cmd_copy_target_noempty_opt = cmd_copy->add_flag("--noempty", "Skip copy of empty tables");
    std::vector<std::string> cmd_copy_names, cmd_copy_xnames;
    cmd_copy->add_option("--tables", cmd_copy_names, "Copy only tables matching this list of names")
        ->capture_default_str();
    cmd_copy->add_option("--xtables", cmd_copy_xnames, "Don't copy tables matching this list of names")
        ->capture_default_str();

    // Stages tool
    auto cmd_stageset = app_main.add_subcommand("stage-set", "Sets a stage to a new height");
    auto cmd_stageset_name_opt = cmd_stageset->add_option("--name", "Name of the stage to set")->required();
    auto cmd_stageset_height_opt =
        cmd_stageset->add_option("--height", "Name of the stage to set")->required()->check(CLI::Range(0u, UINT32_MAX));

    // Initialize with genesis tool
    auto cmd_initgenesis = app_main.add_subcommand("init-genesis", "Initialize a new db with genesis block");
    cmd_initgenesis->require_option(1);
    auto cmd_initgenesis_json_opt =
        cmd_initgenesis->add_option("--json", "Full path to genesis json file")->check(CLI::ExistingFile);

    auto cmd_initgenesis_chain_opt =
        cmd_initgenesis->add_option("--chain", "Name of the chain to initialize")
            ->excludes(cmd_initgenesis_json_opt)
            ->transform(CLI::Transformer(silkworm::get_known_chains_map(), CLI::ignore_case));

    // Read chain config held in db (if any)
    auto cmd_chainconfig = app_main.add_subcommand("chain-config", "Prints chain config held in database");

    // Do first byte analytics on deployed contract codes
    auto cmd_first_byte_analysis = app_main.add_subcommand(
        "first-byte-analysis", "Prints an histogram analysis of first byte for deployed contracts");

    // Extract a list of historical headers in given file
    auto cmd_extract_headers = app_main.add_subcommand(
        "extract-headers", "Hard-code historical headers, from block zero to the highest available");
    auto cmd_extract_headers_file_opt = cmd_extract_headers->add_option("--file", "Output file")->required();
    auto cmd_extract_headers_step_opt = cmd_extract_headers->add_option("--step", "Step every this number of blocks")
                                            ->default_val("100000")
                                            ->check(CLI::Range(1u, UINT32_MAX));

    // Scan tries
    auto cmd_trie_scan = app_main.add_subcommand("trie-scan", "Scans tries for empty values");
    auto cmd_trie_scan_delete_opt = cmd_trie_scan->add_flag("--delete", "Delete");

    // Reset tries
    auto cmd_trie_reset = app_main.add_subcommand("trie-reset", "Resets stage_interhashes");

    // Trie integrity
    auto cmd_trie_integrity = app_main.add_subcommand("trie-integrity", "Checks trie integrity");
    auto cmd_trie_integrity_state_opt = cmd_trie_integrity->add_flag("--with-state", "Checks covered states (slower)");
    auto cmd_trie_integrity_continue_opt = cmd_trie_integrity->add_flag("--continue", "Keeps scanning on found errors");
    auto cmd_trie_integrity_sanitize_opt = cmd_trie_integrity->add_flag("--sanitize", "Clean orphan nodes");

    // Trie account analysis
    auto cmd_trie_account_analysis =
        app_main.add_subcommand("trie-account-analysis", "Trie account key sizes analysis");

    // Trie root hash verification
    auto cmd_trie_root = app_main.add_subcommand("trie-root", "Checks trie root");

    /*
     * Parse arguments and validate
     */
    CLI11_PARSE(app_main, argc, argv);

    auto data_dir_factory = [&chaindata_opt, &datadir_opt]() -> DataDirectory {
        if (*chaindata_opt) {
            fs::path p{chaindata_opt->as<std::string>()};
            return DataDirectory::from_chaindata(p);
        }
        fs::path p{datadir_opt->as<std::string>()};
        return DataDirectory(p, false);
    };

    try {
        // Set origin data_dir
        DataDirectory data_dir{data_dir_factory()};

        if (!*cmd_initgenesis) {
            if (!data_dir.chaindata().exists() || data_dir.is_pristine()) {
                std::cerr << "\n Directory " << data_dir.chaindata().path().string() << " does not exist or is empty"
                          << std::endl;
                return -1;
            }
            auto mdbx_path{db::get_datafile_path(data_dir.chaindata().path())};
            if (!fs::exists(mdbx_path) || !fs::is_regular_file(mdbx_path)) {
                std::cerr << "\n Directory " << data_dir.chaindata().path().string() << " does not contain "
                          << db::kDbDataFileName << std::endl;
                return -1;
            }
        }

        db::EnvConfig src_config{data_dir.chaindata().path().string()};
        src_config.shared = static_cast<bool>(*shared_opt);
        src_config.exclusive = static_cast<bool>(*exclusive_opt);

        // Execute subcommand actions
        if (*cmd_tables) {
            if (*cmd_tables_scan_opt) {
                do_scan(src_config);
            } else {
                do_tables(src_config);
            }
        } else if (*cmd_freelist) {
            do_freelist(src_config, static_cast<bool>(*freelist_detail_opt));
        } else if (*cmd_schema) {
            do_schema(src_config);
        } else if (*cmd_stages) {
            do_stages(src_config);
        } else if (*cmd_migrations) {
            do_migrations(src_config);
        } else if (*cmd_clear) {
            do_clear(src_config, static_cast<bool>(*app_dry_opt), static_cast<bool>(*app_yes_opt), cmd_clear_names,
                     static_cast<bool>(*cmd_clear_drop_opt));
        } else if (*cmd_compact) {
            do_compact(src_config, cmd_compact_workdir_opt->as<std::string>(),
                       static_cast<bool>(*cmd_compact_replace_opt), static_cast<bool>(*cmd_compact_nobak_opt));
        } else if (*cmd_copy) {
            do_copy(src_config, cmd_copy_targetdir_opt->as<std::string>(),
                    static_cast<bool>(*cmd_copy_target_create_opt), static_cast<bool>(*cmd_copy_target_noempty_opt),
                    cmd_copy_names, cmd_copy_xnames);
        } else if (*cmd_stageset) {
            do_stage_set(src_config, cmd_stageset_name_opt->as<std::string>(), cmd_stageset_height_opt->as<uint32_t>(),
                         static_cast<bool>(*app_dry_opt));
        } else if (*cmd_initgenesis) {
            do_init_genesis(data_dir, cmd_initgenesis_json_opt->as<std::string>(),
                            *cmd_initgenesis_chain_opt ? cmd_initgenesis_chain_opt->as<uint32_t>() : 0u,
                            static_cast<bool>(*app_dry_opt));
            if (*app_dry_opt) {
                std::cout << "\nGenesis initialization succeeded. Due to --dry flag no data is persisted\n"
                          << std::endl;
                fs::remove_all(data_dir.path());
            }
        } else if (*cmd_chainconfig) {
            do_chainconfig(src_config);
        } else if (*cmd_first_byte_analysis) {
            do_first_byte_analysis(src_config);
        } else if (*cmd_extract_headers) {
            do_extract_headers(src_config, cmd_extract_headers_file_opt->as<std::string>(),
                               cmd_extract_headers_step_opt->as<uint32_t>());
        } else if (*cmd_trie_scan) {
            do_trie_scan(src_config, static_cast<bool>(*cmd_trie_scan_delete_opt));
        } else if (*cmd_trie_reset) {
            do_trie_reset(src_config, static_cast<bool>(*app_yes_opt));
        } else if (*cmd_trie_integrity) {
            do_trie_integrity(src_config, static_cast<bool>(*cmd_trie_integrity_state_opt),
                              static_cast<bool>(*cmd_trie_integrity_continue_opt),
                              static_cast<bool>(*cmd_trie_integrity_sanitize_opt));
        } else if (*cmd_trie_account_analysis) {
            do_trie_account_analysis(src_config);
        } else if (*cmd_trie_root) {
            do_trie_root(src_config);
        }

        return 0;

    } catch (const std::exception& ex) {
        std::cerr << "\nUnexpected error : " << ex.what() << "\n"
                  << std::endl;
    } catch (...) {
        std::cerr << "\nUnexpected undefined error\n"
                  << std::endl;
    }

    return -1;
}