You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
45 lines
1.6 KiB
45 lines
1.6 KiB
// Copyright (c) 2016-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 <policy/rbf.h>
|
|
#include <util/rbf.h>
|
|
|
|
RBFTransactionState IsRBFOptIn(const CTransaction& tx, const CTxMemPool& pool)
|
|
{
|
|
AssertLockHeld(pool.cs);
|
|
|
|
CTxMemPool::setEntries setAncestors;
|
|
|
|
// First check the transaction itself.
|
|
if (SignalsOptInRBF(tx)) {
|
|
return RBFTransactionState::REPLACEABLE_BIP125;
|
|
}
|
|
|
|
// If this transaction is not in our mempool, then we can't be sure
|
|
// we will know about all its inputs.
|
|
if (!pool.exists(tx.GetHash())) {
|
|
return RBFTransactionState::UNKNOWN;
|
|
}
|
|
|
|
// If all the inputs have nSequence >= maxint-1, it still might be
|
|
// signaled for RBF if any unconfirmed parents have signaled.
|
|
uint64_t noLimit = std::numeric_limits<uint64_t>::max();
|
|
std::string dummy;
|
|
CTxMemPoolEntry entry = *pool.mapTx.find(tx.GetHash());
|
|
pool.CalculateMemPoolAncestors(entry, setAncestors, noLimit, noLimit, noLimit, noLimit, dummy, false);
|
|
|
|
for (CTxMemPool::txiter it : setAncestors) {
|
|
if (SignalsOptInRBF(it->GetTx())) {
|
|
return RBFTransactionState::REPLACEABLE_BIP125;
|
|
}
|
|
}
|
|
return RBFTransactionState::FINAL;
|
|
}
|
|
|
|
RBFTransactionState IsRBFOptInEmptyMempool(const CTransaction& tx)
|
|
{
|
|
// If we don't have a local mempool we can only check the transaction itself.
|
|
return SignalsOptInRBF(tx) ? RBFTransactionState::REPLACEABLE_BIP125 : RBFTransactionState::UNKNOWN;
|
|
}
|