Bitcoin Core Fuzz Coverage Report

Coverage Report

Created: 2026-03-24 13:57

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/root/bitcoin/src/policy/truc_policy.cpp
Line
Count
Source
1
// Copyright (c) 2022-present 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 <policy/truc_policy.h>
6
7
#include <coins.h>
8
#include <consensus/amount.h>
9
#include <tinyformat.h>
10
#include <util/check.h>
11
12
#include <algorithm>
13
#include <numeric>
14
#include <vector>
15
16
/** Helper for PackageTRUCChecks: Returns a vector containing the indices of transactions (within
17
 * package) that are direct parents of ptx. */
18
std::vector<size_t> FindInPackageParents(const Package& package, const CTransactionRef& ptx)
19
0
{
20
0
    std::vector<size_t> in_package_parents;
21
22
0
    std::set<Txid> possible_parents;
23
0
    for (auto &input : ptx->vin) {
24
0
        possible_parents.insert(input.prevout.hash);
25
0
    }
26
27
0
    for (size_t i{0}; i < package.size(); ++i) {
28
0
        const auto& tx = package.at(i);
29
        // We assume the package is sorted, so that we don't need to continue
30
        // looking past the transaction itself.
31
0
        if (&(*tx) == &(*ptx)) break;
32
0
        if (possible_parents.contains(tx->GetHash())) {
33
0
            in_package_parents.push_back(i);
34
0
        }
35
0
    }
36
0
    return in_package_parents;
37
0
}
38
39
/** Helper for PackageTRUCChecks, storing info for a mempool or package parent. */
40
struct ParentInfo {
41
    /** Txid used to identify this parent by prevout */
42
    const Txid& m_txid;
43
    /** Wtxid used for debug string */
44
    const Wtxid& m_wtxid;
45
    /** version used to check inheritance of TRUC and non-TRUC */
46
    decltype(CTransaction::version) m_version;
47
    /** If parent is in mempool, whether it has any descendants in mempool. */
48
    bool m_has_mempool_descendant;
49
50
    ParentInfo() = delete;
51
    ParentInfo(const Txid& txid, const Wtxid& wtxid, decltype(CTransaction::version) version, bool has_mempool_descendant) :
52
0
        m_txid{txid}, m_wtxid{wtxid}, m_version{version},
53
0
        m_has_mempool_descendant{has_mempool_descendant}
54
0
    {}
55
};
56
57
std::optional<std::string> PackageTRUCChecks(const CTxMemPool& pool, const CTransactionRef& ptx, int64_t vsize,
58
                                           const Package& package,
59
                                           const std::vector<CTxMemPoolEntry::CTxMemPoolEntryRef>& mempool_parents)
60
0
{
61
0
    AssertLockHeld(pool.cs);
Line
Count
Source
142
0
#define AssertLockHeld(cs) AssertLockHeldInternal(#cs, __FILE__, __LINE__, &cs)
62
    // This function is specialized for these limits, and must be reimplemented if they ever change.
63
0
    static_assert(TRUC_ANCESTOR_LIMIT == 2);
64
0
    static_assert(TRUC_DESCENDANT_LIMIT == 2);
65
66
0
    const auto in_package_parents{FindInPackageParents(package, ptx)};
67
68
    // Now we have all parents, so we can start checking TRUC rules.
69
0
    if (ptx->version == TRUC_VERSION) {
70
        // SingleTRUCChecks should have checked this already.
71
0
        if (!Assume(vsize <= TRUC_MAX_VSIZE)) {
Line
Count
Source
125
0
#define Assume(val) inline_assertion_check<false>(val, std::source_location::current(), #val)
72
0
            return strprintf("version=3 tx %s (wtxid=%s) is too big: %u > %u virtual bytes",
Line
Count
Source
1172
0
#define strprintf tfm::format
73
0
                             ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString(), vsize, TRUC_MAX_VSIZE);
74
0
        }
75
76
0
        if (mempool_parents.size() + in_package_parents.size() + 1 > TRUC_ANCESTOR_LIMIT) {
77
0
            return strprintf("tx %s (wtxid=%s) would have too many ancestors",
Line
Count
Source
1172
0
#define strprintf tfm::format
78
0
                             ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString());
79
0
        }
80
81
0
        if (mempool_parents.size()) {
82
0
            if (pool.GetAncestorCount(mempool_parents[0]) + in_package_parents.size() + 1 > TRUC_ANCESTOR_LIMIT) {
83
0
                return strprintf("tx %s (wtxid=%s) would have too many ancestors",
Line
Count
Source
1172
0
#define strprintf tfm::format
84
0
                                 ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString());
85
0
            }
86
0
        }
87
88
0
        const bool has_parent{mempool_parents.size() + in_package_parents.size() > 0};
89
0
        if (has_parent) {
90
            // A TRUC child cannot be too large.
91
0
            if (vsize > TRUC_CHILD_MAX_VSIZE) {
92
0
                return strprintf("version=3 child tx %s (wtxid=%s) is too big: %u > %u virtual bytes",
Line
Count
Source
1172
0
#define strprintf tfm::format
93
0
                                 ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString(),
94
0
                                 vsize, TRUC_CHILD_MAX_VSIZE);
95
0
            }
96
97
            // Exactly 1 parent exists, either in mempool or package. Find it.
98
0
            const auto parent_info = [&] {
99
0
                if (mempool_parents.size() > 0) {
100
0
                    const auto& mempool_parent = &mempool_parents[0].get();
101
0
                    return ParentInfo{mempool_parent->GetTx().GetHash(),
102
0
                                      mempool_parent->GetTx().GetWitnessHash(),
103
0
                                      mempool_parent->GetTx().version,
104
0
                                      /*has_mempool_descendant=*/pool.GetDescendantCount(*mempool_parent) > 1};
105
0
                } else {
106
0
                    auto& parent_index = in_package_parents.front();
107
0
                    auto& package_parent = package.at(parent_index);
108
0
                    return ParentInfo{package_parent->GetHash(),
109
0
                                      package_parent->GetWitnessHash(),
110
0
                                      package_parent->version,
111
0
                                      /*has_mempool_descendant=*/false};
112
0
                }
113
0
            }();
114
115
            // If there is a parent, it must have the right version.
116
0
            if (parent_info.m_version != TRUC_VERSION) {
117
0
                return strprintf("version=3 tx %s (wtxid=%s) cannot spend from non-version=3 tx %s (wtxid=%s)",
Line
Count
Source
1172
0
#define strprintf tfm::format
118
0
                                 ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString(),
119
0
                                 parent_info.m_txid.ToString(), parent_info.m_wtxid.ToString());
120
0
            }
121
122
0
            for (const auto& package_tx : package) {
123
                // Skip same tx.
124
0
                if (&(*package_tx) == &(*ptx)) continue;
125
126
0
                for (auto& input : package_tx->vin) {
127
                    // Fail if we find another tx with the same parent. We don't check whether the
128
                    // sibling is to-be-replaced (done in SingleTRUCChecks) because these transactions
129
                    // are within the same package.
130
0
                    if (input.prevout.hash == parent_info.m_txid) {
131
0
                        return strprintf("tx %s (wtxid=%s) would exceed descendant count limit",
Line
Count
Source
1172
0
#define strprintf tfm::format
132
0
                                         parent_info.m_txid.ToString(),
133
0
                                         parent_info.m_wtxid.ToString());
134
0
                    }
135
136
                    // This tx can't have both a parent and an in-package child.
137
0
                    if (input.prevout.hash == ptx->GetHash()) {
138
0
                        return strprintf("tx %s (wtxid=%s) would have too many ancestors",
Line
Count
Source
1172
0
#define strprintf tfm::format
139
0
                                         package_tx->GetHash().ToString(), package_tx->GetWitnessHash().ToString());
140
0
                    }
141
0
                }
142
0
            }
143
144
0
            if (parent_info.m_has_mempool_descendant) {
145
0
                return strprintf("tx %s (wtxid=%s) would exceed descendant count limit",
Line
Count
Source
1172
0
#define strprintf tfm::format
146
0
                                parent_info.m_txid.ToString(), parent_info.m_wtxid.ToString());
147
0
            }
148
0
        }
149
0
    } else {
150
        // Non-TRUC transactions cannot have TRUC parents.
151
0
        for (auto it : mempool_parents) {
152
0
            if (it.get().GetTx().version == TRUC_VERSION) {
153
0
                return strprintf("non-version=3 tx %s (wtxid=%s) cannot spend from version=3 tx %s (wtxid=%s)",
Line
Count
Source
1172
0
#define strprintf tfm::format
154
0
                                 ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString(),
155
0
                                 it.get().GetSharedTx()->GetHash().ToString(), it.get().GetSharedTx()->GetWitnessHash().ToString());
156
0
            }
157
0
        }
158
0
        for (const auto& index: in_package_parents) {
159
0
            if (package.at(index)->version == TRUC_VERSION) {
160
0
                return strprintf("non-version=3 tx %s (wtxid=%s) cannot spend from version=3 tx %s (wtxid=%s)",
Line
Count
Source
1172
0
#define strprintf tfm::format
161
0
                                 ptx->GetHash().ToString(),
162
0
                                 ptx->GetWitnessHash().ToString(),
163
0
                                 package.at(index)->GetHash().ToString(),
164
0
                                 package.at(index)->GetWitnessHash().ToString());
165
0
            }
166
0
        }
167
0
    }
168
0
    return std::nullopt;
169
0
}
170
171
std::optional<std::pair<std::string, CTransactionRef>> SingleTRUCChecks(const CTxMemPool& pool, const CTransactionRef& ptx,
172
                                          const std::vector<CTxMemPoolEntry::CTxMemPoolEntryRef>& mempool_parents,
173
                                          const std::set<Txid>& direct_conflicts,
174
                                          int64_t vsize)
175
0
{
176
0
    AssertLockHeld(pool.cs);
Line
Count
Source
142
0
#define AssertLockHeld(cs) AssertLockHeldInternal(#cs, __FILE__, __LINE__, &cs)
177
    // Check TRUC and non-TRUC inheritance.
178
0
    for (const auto& entry_ref : mempool_parents) {
179
0
        const auto& entry = &entry_ref.get();
180
0
        if (ptx->version != TRUC_VERSION && entry->GetTx().version == TRUC_VERSION) {
181
0
            return std::make_pair(strprintf("non-version=3 tx %s (wtxid=%s) cannot spend from version=3 tx %s (wtxid=%s)",
Line
Count
Source
1172
0
#define strprintf tfm::format
182
0
                             ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString(),
183
0
                             entry->GetSharedTx()->GetHash().ToString(), entry->GetSharedTx()->GetWitnessHash().ToString()),
184
0
                nullptr);
185
0
        } else if (ptx->version == TRUC_VERSION && entry->GetTx().version != TRUC_VERSION) {
186
0
            return std::make_pair(strprintf("version=3 tx %s (wtxid=%s) cannot spend from non-version=3 tx %s (wtxid=%s)",
Line
Count
Source
1172
0
#define strprintf tfm::format
187
0
                             ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString(),
188
0
                             entry->GetSharedTx()->GetHash().ToString(), entry->GetSharedTx()->GetWitnessHash().ToString()),
189
0
                nullptr);
190
0
        }
191
0
    }
192
193
    // This function is specialized for these limits, and must be reimplemented if they ever change.
194
0
    static_assert(TRUC_ANCESTOR_LIMIT == 2);
195
0
    static_assert(TRUC_DESCENDANT_LIMIT == 2);
196
197
    // The rest of the rules only apply to transactions with version=3.
198
0
    if (ptx->version != TRUC_VERSION) return std::nullopt;
199
200
0
    if (vsize > TRUC_MAX_VSIZE) {
201
0
        return std::make_pair(strprintf("version=3 tx %s (wtxid=%s) is too big: %u > %u virtual bytes",
Line
Count
Source
1172
0
#define strprintf tfm::format
202
0
                         ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString(), vsize, TRUC_MAX_VSIZE),
203
0
            nullptr);
204
0
    }
205
206
    // Check that TRUC_ANCESTOR_LIMIT would not be violated.
207
0
    if (mempool_parents.size() + 1 > TRUC_ANCESTOR_LIMIT) {
208
0
        return std::make_pair(strprintf("tx %s (wtxid=%s) would have too many ancestors",
Line
Count
Source
1172
0
#define strprintf tfm::format
209
0
                         ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString()),
210
0
            nullptr);
211
0
    }
212
213
    // Remaining checks only pertain to transactions with unconfirmed ancestors.
214
0
    if (mempool_parents.size() > 0) {
215
        // Ensure that the in-mempool parent doesn't have any additional
216
        // ancestors, as that would also be a violation.
217
0
        if (pool.GetAncestorCount(mempool_parents[0]) + 1 > TRUC_ANCESTOR_LIMIT) {
218
0
            return std::make_pair(strprintf("tx %s (wtxid=%s) would have too many ancestors",
Line
Count
Source
1172
0
#define strprintf tfm::format
219
0
                             ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString()),
220
0
                nullptr);
221
0
        }
222
        // If this transaction spends TRUC parents, it cannot be too large.
223
0
        if (vsize > TRUC_CHILD_MAX_VSIZE) {
224
0
            return std::make_pair(strprintf("version=3 child tx %s (wtxid=%s) is too big: %u > %u virtual bytes",
Line
Count
Source
1172
0
#define strprintf tfm::format
225
0
                             ptx->GetHash().ToString(), ptx->GetWitnessHash().ToString(), vsize, TRUC_CHILD_MAX_VSIZE),
226
0
                nullptr);
227
0
        }
228
229
        // Check the descendant counts of in-mempool parents.
230
0
        const auto& parent_entry = mempool_parents[0].get();
231
        // If there are any parents, this is the only child allowed. The parent cannot have any
232
        // other descendants. We handle the possibility of multiple children as that case is
233
        // possible through a reorg.
234
0
        CTxMemPool::setEntries descendants;
235
0
        auto parent_it = pool.CalculateDescendants(parent_entry, descendants);
236
0
        descendants.erase(parent_it);
237
        // Don't double-count a transaction that is going to be replaced. This logic assumes that
238
        // any descendant of the TRUC transaction is a direct child, which makes sense because a
239
        // TRUC transaction can only have 1 descendant.
240
0
        const bool child_will_be_replaced = !descendants.empty() &&
241
0
            std::any_of(descendants.cbegin(), descendants.cend(),
242
0
                [&direct_conflicts](const CTxMemPool::txiter& child){return direct_conflicts.contains(child->GetTx().GetHash());});
243
0
        if (pool.GetDescendantCount(parent_entry) + 1 > TRUC_DESCENDANT_LIMIT && !child_will_be_replaced) {
244
            // Allow sibling eviction for TRUC transaction: if another child already exists, even if
245
            // we don't conflict inputs with it, consider evicting it under RBF rules. We rely on TRUC rules
246
            // only permitting 1 descendant, as otherwise we would need to have logic for deciding
247
            // which descendant to evict. Skip if this isn't true, e.g. if the transaction has
248
            // multiple children or the sibling also has descendants due to a reorg.
249
0
            const bool consider_sibling_eviction{pool.GetDescendantCount(parent_entry) == 2 &&
250
0
                pool.GetAncestorCount(**descendants.begin()) == 2};
251
252
            // Return the sibling if its eviction can be considered. Provide the "descendant count
253
            // limit" string either way, as the caller may decide not to do sibling eviction.
254
0
            return std::make_pair(strprintf("tx %u (wtxid=%s) would exceed descendant count limit",
Line
Count
Source
1172
0
#define strprintf tfm::format
255
0
                                            parent_entry.GetSharedTx()->GetHash().ToString(),
256
0
                                            parent_entry.GetSharedTx()->GetWitnessHash().ToString()),
257
0
                                  consider_sibling_eviction ? (*descendants.begin())->GetSharedTx() : nullptr);
258
0
        }
259
0
    }
260
0
    return std::nullopt;
261
0
}