mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-01-12 04:42:36 -03:00
tests: Add fuzzing harness for CBlockPolicyEstimator
This commit is contained in:
parent
00c1a4d9a9
commit
3439c88a5d
3 changed files with 91 additions and 0 deletions
|
@ -67,6 +67,7 @@ FUZZ_TARGETS = \
|
||||||
test/fuzz/parse_univalue \
|
test/fuzz/parse_univalue \
|
||||||
test/fuzz/partial_merkle_tree_deserialize \
|
test/fuzz/partial_merkle_tree_deserialize \
|
||||||
test/fuzz/partially_signed_transaction_deserialize \
|
test/fuzz/partially_signed_transaction_deserialize \
|
||||||
|
test/fuzz/policy_estimator \
|
||||||
test/fuzz/pow \
|
test/fuzz/pow \
|
||||||
test/fuzz/prefilled_transaction_deserialize \
|
test/fuzz/prefilled_transaction_deserialize \
|
||||||
test/fuzz/prevector \
|
test/fuzz/prevector \
|
||||||
|
@ -683,6 +684,12 @@ test_fuzz_partially_signed_transaction_deserialize_LDADD = $(FUZZ_SUITE_LD_COMMO
|
||||||
test_fuzz_partially_signed_transaction_deserialize_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS)
|
test_fuzz_partially_signed_transaction_deserialize_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS)
|
||||||
test_fuzz_partially_signed_transaction_deserialize_SOURCES = test/fuzz/deserialize.cpp
|
test_fuzz_partially_signed_transaction_deserialize_SOURCES = test/fuzz/deserialize.cpp
|
||||||
|
|
||||||
|
test_fuzz_policy_estimator_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
|
||||||
|
test_fuzz_policy_estimator_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
|
||||||
|
test_fuzz_policy_estimator_LDADD = $(FUZZ_SUITE_LD_COMMON)
|
||||||
|
test_fuzz_policy_estimator_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS)
|
||||||
|
test_fuzz_policy_estimator_SOURCES = test/fuzz/policy_estimator.cpp
|
||||||
|
|
||||||
test_fuzz_pow_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
|
test_fuzz_pow_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
|
||||||
test_fuzz_pow_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
|
test_fuzz_pow_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
|
||||||
test_fuzz_pow_LDADD = $(FUZZ_SUITE_LD_COMMON)
|
test_fuzz_pow_LDADD = $(FUZZ_SUITE_LD_COMMON)
|
||||||
|
|
69
src/test/fuzz/policy_estimator.cpp
Normal file
69
src/test/fuzz/policy_estimator.cpp
Normal file
|
@ -0,0 +1,69 @@
|
||||||
|
// Copyright (c) 2020 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 <optional.h>
|
||||||
|
#include <policy/fees.h>
|
||||||
|
#include <primitives/transaction.h>
|
||||||
|
#include <test/fuzz/FuzzedDataProvider.h>
|
||||||
|
#include <test/fuzz/fuzz.h>
|
||||||
|
#include <test/fuzz/util.h>
|
||||||
|
#include <txmempool.h>
|
||||||
|
|
||||||
|
#include <cstdint>
|
||||||
|
#include <string>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
void test_one_input(const std::vector<uint8_t>& buffer)
|
||||||
|
{
|
||||||
|
FuzzedDataProvider fuzzed_data_provider(buffer.data(), buffer.size());
|
||||||
|
CBlockPolicyEstimator block_policy_estimator;
|
||||||
|
while (fuzzed_data_provider.ConsumeBool()) {
|
||||||
|
switch (fuzzed_data_provider.ConsumeIntegralInRange<int>(0, 3)) {
|
||||||
|
case 0: {
|
||||||
|
const Optional<CMutableTransaction> mtx = ConsumeDeserializable<CMutableTransaction>(fuzzed_data_provider);
|
||||||
|
if (!mtx) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
const CTransaction tx{*mtx};
|
||||||
|
block_policy_estimator.processTransaction(ConsumeTxMemPoolEntry(fuzzed_data_provider, tx), fuzzed_data_provider.ConsumeBool());
|
||||||
|
if (fuzzed_data_provider.ConsumeBool()) {
|
||||||
|
(void)block_policy_estimator.removeTx(tx.GetHash(), /* inBlock */ fuzzed_data_provider.ConsumeBool());
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case 1: {
|
||||||
|
std::vector<CTxMemPoolEntry> mempool_entries;
|
||||||
|
while (fuzzed_data_provider.ConsumeBool()) {
|
||||||
|
const Optional<CMutableTransaction> mtx = ConsumeDeserializable<CMutableTransaction>(fuzzed_data_provider);
|
||||||
|
if (!mtx) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
const CTransaction tx{*mtx};
|
||||||
|
mempool_entries.push_back(ConsumeTxMemPoolEntry(fuzzed_data_provider, tx));
|
||||||
|
}
|
||||||
|
std::vector<const CTxMemPoolEntry*> ptrs;
|
||||||
|
ptrs.reserve(mempool_entries.size());
|
||||||
|
for (const CTxMemPoolEntry& mempool_entry : mempool_entries) {
|
||||||
|
ptrs.push_back(&mempool_entry);
|
||||||
|
}
|
||||||
|
block_policy_estimator.processBlock(fuzzed_data_provider.ConsumeIntegral<unsigned int>(), ptrs);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case 2: {
|
||||||
|
(void)block_policy_estimator.removeTx(ConsumeUInt256(fuzzed_data_provider), /* inBlock */ fuzzed_data_provider.ConsumeBool());
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case 3: {
|
||||||
|
block_policy_estimator.FlushUnconfirmed();
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
(void)block_policy_estimator.estimateFee(fuzzed_data_provider.ConsumeIntegral<int>());
|
||||||
|
EstimationResult result;
|
||||||
|
(void)block_policy_estimator.estimateRawFee(fuzzed_data_provider.ConsumeIntegral<int>(), fuzzed_data_provider.ConsumeFloatingPoint<double>(), fuzzed_data_provider.PickValueInArray({FeeEstimateHorizon::SHORT_HALFLIFE, FeeEstimateHorizon::MED_HALFLIFE, FeeEstimateHorizon::LONG_HALFLIFE}), fuzzed_data_provider.ConsumeBool() ? &result : nullptr);
|
||||||
|
FeeCalculation fee_calculation;
|
||||||
|
(void)block_policy_estimator.estimateSmartFee(fuzzed_data_provider.ConsumeIntegral<int>(), fuzzed_data_provider.ConsumeBool() ? &fee_calculation : nullptr, fuzzed_data_provider.ConsumeBool());
|
||||||
|
(void)block_policy_estimator.HighestTargetTracked(fuzzed_data_provider.PickValueInArray({FeeEstimateHorizon::SHORT_HALFLIFE, FeeEstimateHorizon::MED_HALFLIFE, FeeEstimateHorizon::LONG_HALFLIFE}));
|
||||||
|
}
|
||||||
|
}
|
|
@ -8,12 +8,15 @@
|
||||||
#include <amount.h>
|
#include <amount.h>
|
||||||
#include <arith_uint256.h>
|
#include <arith_uint256.h>
|
||||||
#include <attributes.h>
|
#include <attributes.h>
|
||||||
|
#include <consensus/consensus.h>
|
||||||
#include <optional.h>
|
#include <optional.h>
|
||||||
|
#include <primitives/transaction.h>
|
||||||
#include <script/script.h>
|
#include <script/script.h>
|
||||||
#include <serialize.h>
|
#include <serialize.h>
|
||||||
#include <streams.h>
|
#include <streams.h>
|
||||||
#include <test/fuzz/FuzzedDataProvider.h>
|
#include <test/fuzz/FuzzedDataProvider.h>
|
||||||
#include <test/fuzz/fuzz.h>
|
#include <test/fuzz/fuzz.h>
|
||||||
|
#include <txmempool.h>
|
||||||
#include <uint256.h>
|
#include <uint256.h>
|
||||||
#include <version.h>
|
#include <version.h>
|
||||||
|
|
||||||
|
@ -97,6 +100,18 @@ NODISCARD inline arith_uint256 ConsumeArithUInt256(FuzzedDataProvider& fuzzed_da
|
||||||
return UintToArith256(ConsumeUInt256(fuzzed_data_provider));
|
return UintToArith256(ConsumeUInt256(fuzzed_data_provider));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
NODISCARD inline CTxMemPoolEntry ConsumeTxMemPoolEntry(FuzzedDataProvider& fuzzed_data_provider, const CTransaction& tx) noexcept
|
||||||
|
{
|
||||||
|
// Avoid:
|
||||||
|
// policy/feerate.cpp:28:34: runtime error: signed integer overflow: 34873208148477500 * 1000 cannot be represented in type 'long'
|
||||||
|
const CAmount fee = ConsumeMoney(fuzzed_data_provider) / static_cast<CAmount>(100);
|
||||||
|
const int64_t time = fuzzed_data_provider.ConsumeIntegral<int64_t>();
|
||||||
|
const unsigned int entry_height = fuzzed_data_provider.ConsumeIntegral<unsigned int>();
|
||||||
|
const bool spends_coinbase = fuzzed_data_provider.ConsumeBool();
|
||||||
|
const unsigned int sig_op_cost = fuzzed_data_provider.ConsumeIntegralInRange<unsigned int>(0, MAX_BLOCK_SIGOPS_COST);
|
||||||
|
return CTxMemPoolEntry{MakeTransactionRef(tx), fee, time, entry_height, spends_coinbase, sig_op_cost, {}};
|
||||||
|
}
|
||||||
|
|
||||||
template <typename T>
|
template <typename T>
|
||||||
NODISCARD bool MultiplicationOverflow(const T i, const T j) noexcept
|
NODISCARD bool MultiplicationOverflow(const T i, const T j) noexcept
|
||||||
{
|
{
|
||||||
|
|
Loading…
Reference in a new issue