fuzz coverage

Coverage Report

Created: 2025-06-01 19:34

/Users/eugenesiegel/btc/bitcoin/src/kernel/disconnected_transactions.cpp
Line
Count
Source (jump to first uncovered line)
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 <kernel/disconnected_transactions.h>
6
7
#include <assert.h>
8
#include <core_memusage.h>
9
#include <memusage.h>
10
#include <primitives/transaction.h>
11
#include <util/hasher.h>
12
13
#include <memory>
14
#include <utility>
15
16
// It's almost certainly a logic bug if we don't clear out queuedTx before
17
// destruction, as we add to it while disconnecting blocks, and then we
18
// need to re-process remaining transactions to ensure mempool consistency.
19
// For now, assert() that we've emptied out this object on destruction.
20
// This assert() can always be removed if the reorg-processing code were
21
// to be refactored such that this assumption is no longer true (for
22
// instance if there was some other way we cleaned up the mempool after a
23
// reorg, besides draining this object).
24
DisconnectedBlockTransactions::~DisconnectedBlockTransactions()
25
10.0M
{
26
10.0M
    assert(queuedTx.empty());
27
10.0M
    assert(iters_by_txid.empty());
28
10.0M
    assert(cachedInnerUsage == 0);
29
10.0M
}
30
31
std::vector<CTransactionRef> DisconnectedBlockTransactions::LimitMemoryUsage()
32
55
{
33
55
    std::vector<CTransactionRef> evicted;
34
35
55
    while (!queuedTx.empty() && DynamicMemoryUsage() > m_max_mem_usage) {
36
0
        evicted.emplace_back(queuedTx.front());
37
0
        cachedInnerUsage -= RecursiveDynamicUsage(queuedTx.front());
38
0
        iters_by_txid.erase(queuedTx.front()->GetHash());
39
0
        queuedTx.pop_front();
40
0
    }
41
55
    return evicted;
42
55
}
43
44
size_t DisconnectedBlockTransactions::DynamicMemoryUsage() const
45
55
{
46
55
    return cachedInnerUsage + memusage::DynamicUsage(iters_by_txid) + memusage::DynamicUsage(queuedTx);
47
55
}
48
49
[[nodiscard]] std::vector<CTransactionRef> DisconnectedBlockTransactions::AddTransactionsFromBlock(const std::vector<CTransactionRef>& vtx)
50
55
{
51
55
    iters_by_txid.reserve(iters_by_txid.size() + vtx.size());
52
110
    for (auto block_it = vtx.rbegin(); block_it != vtx.rend(); 
++block_it55
) {
53
55
        auto it = queuedTx.insert(queuedTx.end(), *block_it);
54
55
        auto [_, inserted] = iters_by_txid.emplace((*block_it)->GetHash(), it);
55
55
        assert(inserted); // callers may never pass multiple transactions with the same txid
56
55
        cachedInnerUsage += RecursiveDynamicUsage(*block_it);
57
55
    }
58
55
    return LimitMemoryUsage();
59
55
}
60
61
void DisconnectedBlockTransactions::removeForBlock(const std::vector<CTransactionRef>& vtx)
62
10.0M
{
63
    // Short-circuit in the common case of a block being added to the tip
64
10.0M
    if (queuedTx.empty()) {
65
10.0M
        return;
66
10.0M
    }
67
55
    for (const auto& tx : vtx) {
68
55
        auto iter = iters_by_txid.find(tx->GetHash());
69
55
        if (iter != iters_by_txid.end()) {
70
55
            auto list_iter = iter->second;
71
55
            iters_by_txid.erase(iter);
72
55
            cachedInnerUsage -= RecursiveDynamicUsage(*list_iter);
73
55
            queuedTx.erase(list_iter);
74
55
        }
75
55
    }
76
55
}
77
78
void DisconnectedBlockTransactions::clear()
79
55
{
80
55
    cachedInnerUsage = 0;
81
55
    iters_by_txid.clear();
82
55
    queuedTx.clear();
83
55
}
84
85
std::list<CTransactionRef> DisconnectedBlockTransactions::take()
86
55
{
87
55
    std::list<CTransactionRef> ret = std::move(queuedTx);
88
55
    clear();
89
55
    return ret;
90
55
}