git / moonbite-core / src/bench/mempool_stress.cpp · raw

// Copyright (c) 2011-2019 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 <bench/bench.h>#include <policy/policy.h>#include <test/util/setup_common.h>#include <txmempool.h>#include <vector>static void AddTx(const CTransactionRef& tx, CTxMemPool& pool) EXCLUSIVE_LOCKS_REQUIRED(cs_main, pool.cs){    int64_t nTime = 0;    unsigned int nHeight = 1;    bool spendsCoinbase = false;    unsigned int sigOpCost = 4;    LockPoints lp;    pool.addUnchecked(CTxMemPoolEntry(tx, 1000, nTime, nHeight, spendsCoinbase, sigOpCost, lp));}struct Available {    CTransactionRef ref;    size_t vin_left{0};    size_t tx_count;    Available(CTransactionRef& ref, size_t tx_count) : ref(ref), tx_count(tx_count){}};static void ComplexMemPool(benchmark::Bench& bench){    int childTxs = 800;    if (bench.complexityN() > 1) {        childTxs = static_cast<int>(bench.complexityN());    }    FastRandomContext det_rand{true};    std::vector<Available> available_coins;    std::vector<CTransactionRef> ordered_coins;    // Create some base transactions    size_t tx_counter = 1;    for (auto x = 0; x < 100; ++x) {        CMutableTransaction tx = CMutableTransaction();        tx.vin.resize(1);        tx.vin[0].scriptSig = CScript() << CScriptNum(tx_counter);        tx.vin[0].scriptWitness.stack.push_back(CScriptNum(x).getvch());        tx.vout.resize(det_rand.randrange(10)+2);        for (auto& out : tx.vout) {            out.scriptPubKey = CScript() << CScriptNum(tx_counter) << OP_EQUAL;            out.nValue = 10 * COIN;        }        ordered_coins.emplace_back(MakeTransactionRef(tx));        available_coins.emplace_back(ordered_coins.back(), tx_counter++);    }    for (auto x = 0; x < childTxs && !available_coins.empty(); ++x) {        CMutableTransaction tx = CMutableTransaction();        size_t n_ancestors = det_rand.randrange(10)+1;        for (size_t ancestor = 0; ancestor < n_ancestors && !available_coins.empty(); ++ancestor){            size_t idx = det_rand.randrange(available_coins.size());            Available coin = available_coins[idx];            uint256 hash = coin.ref->GetHash();            // biased towards taking just one ancestor, but maybe more            size_t n_to_take = det_rand.randrange(2) == 0 ? 1 : 1+det_rand.randrange(coin.ref->vout.size() - coin.vin_left);            for (size_t i = 0; i < n_to_take; ++i) {                tx.vin.emplace_back();                tx.vin.back().prevout = COutPoint(hash, coin.vin_left++);                tx.vin.back().scriptSig = CScript() << coin.tx_count;                tx.vin.back().scriptWitness.stack.push_back(CScriptNum(coin.tx_count).getvch());            }            if (coin.vin_left == coin.ref->vin.size()) {                coin = available_coins.back();                available_coins.pop_back();            }            tx.vout.resize(det_rand.randrange(10)+2);            for (auto& out : tx.vout) {                out.scriptPubKey = CScript() << CScriptNum(tx_counter) << OP_EQUAL;                out.nValue = 10 * COIN;            }        }        ordered_coins.emplace_back(MakeTransactionRef(tx));        available_coins.emplace_back(ordered_coins.back(), tx_counter++);    }    TestingSetup test_setup;    CTxMemPool pool;    LOCK2(cs_main, pool.cs);    bench.run([&]() NO_THREAD_SAFETY_ANALYSIS {        for (auto& tx : ordered_coins) {            AddTx(tx, pool);        }        pool.TrimToSize(pool.DynamicMemoryUsage() * 3 / 4);        pool.TrimToSize(GetVirtualTransactionSize(*ordered_coins.front()));    });}BENCHMARK(ComplexMemPool);