![]() |
Bitcoin Core
21.99.0
P2P Digital Currency
|
CTxMemPool stores valid-according-to-the-current-best-chain transactions that may be included in the next block. More...
#include <txmempool.h>
Public Types | |
typedef boost::multi_index_container< CTxMemPoolEntry, boost::multi_index::indexed_by< boost::multi_index::hashed_unique< mempoolentry_txid, SaltedTxidHasher >, boost::multi_index::hashed_unique< boost::multi_index::tag< index_by_wtxid >, mempoolentry_wtxid, SaltedTxidHasher >, boost::multi_index::ordered_non_unique< boost::multi_index::tag< descendant_score >, boost::multi_index::identity< CTxMemPoolEntry >, CompareTxMemPoolEntryByDescendantScore >, boost::multi_index::ordered_non_unique< boost::multi_index::tag< entry_time >, boost::multi_index::identity< CTxMemPoolEntry >, CompareTxMemPoolEntryByEntryTime >, boost::multi_index::ordered_non_unique< boost::multi_index::tag< ancestor_score >, boost::multi_index::identity< CTxMemPoolEntry >, CompareTxMemPoolEntryByAncestorFee > > > | indexed_transaction_set |
using | txiter = indexed_transaction_set::nth_index< 0 >::type::const_iterator |
typedef std::set< txiter, CompareIteratorByHash > | setEntries |
Public Member Functions | |
indexed_transaction_set mapTx | GUARDED_BY (cs) |
std::vector< std::pair< uint256, txiter > > vTxHashes | GUARDED_BY (cs) |
All tx witness hashes/entries in mapTx, in random order. More... | |
uint64_t | CalculateDescendantMaximum (txiter entry) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
indirectmap< COutPoint, const CTransaction * > mapNextTx | GUARDED_BY (cs) |
CTxMemPool (CBlockPolicyEstimator *estimator=nullptr, int check_ratio=0) | |
Create a new CTxMemPool. More... | |
void | addUnchecked (const CTxMemPoolEntry &entry, setEntries &setAncestors, bool validFeeEstimate=true) EXCLUSIVE_LOCKS_REQUIRED(cs |
void | removeRecursive (const CTransaction &tx, MemPoolRemovalReason reason) EXCLUSIVE_LOCKS_REQUIRED(cs) |
void | removeForReorg (CChainState &active_chainstate, int flags) EXCLUSIVE_LOCKS_REQUIRED(cs |
void | removeConflicts (const CTransaction &tx) EXCLUSIVE_LOCKS_REQUIRED(cs) |
void | removeForBlock (const std::vector< CTransactionRef > &vtx, unsigned int nBlockHeight) EXCLUSIVE_LOCKS_REQUIRED(cs) |
Called when a block is connected. More... | |
void | clear () |
void | _clear () EXCLUSIVE_LOCKS_REQUIRED(cs) |
bool | CompareDepthAndScore (const uint256 &hasha, const uint256 &hashb, bool wtxid=false) |
void | queryHashes (std::vector< uint256 > &vtxid) const |
bool | isSpent (const COutPoint &outpoint) const |
unsigned int | GetTransactionsUpdated () const |
void | AddTransactionsUpdated (unsigned int n) |
bool | HasNoInputsOf (const CTransaction &tx) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
Check that none of this transactions inputs are in the mempool, and thus the tx is not dependent on other mempool transactions to be included in a block. More... | |
void | PrioritiseTransaction (const uint256 &hash, const CAmount &nFeeDelta) |
Affect CreateNewBlock prioritisation of transactions. More... | |
void | ApplyDelta (const uint256 &hash, CAmount &nFeeDelta) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
void | ClearPrioritisation (const uint256 &hash) EXCLUSIVE_LOCKS_REQUIRED(cs) |
const CTransaction * | GetConflictTx (const COutPoint &prevout) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
Get the transaction in the pool that spends the same prevout. More... | |
Optional< txiter > | GetIter (const uint256 &txid) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
Returns an iterator to the given hash, if found. More... | |
setEntries | GetIterSet (const std::set< uint256 > &hashes) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
Translate a set of hashes into a set of pool iterators to avoid repeated lookups. More... | |
void | RemoveStaged (setEntries &stage, bool updateDescendants, MemPoolRemovalReason reason) EXCLUSIVE_LOCKS_REQUIRED(cs) |
Remove a set of transactions from the mempool. More... | |
void | UpdateTransactionsFromBlock (const std::vector< uint256 > &vHashesToUpdate) EXCLUSIVE_LOCKS_REQUIRED(cs |
When adding transactions from a disconnected block back to the mempool, new mempool entries may have children in the mempool (which is generally not the case when otherwise adding transactions). More... | |
void cs_main | LOCKS_EXCLUDED (m_epoch) |
bool | CalculateMemPoolAncestors (const CTxMemPoolEntry &entry, setEntries &setAncestors, uint64_t limitAncestorCount, uint64_t limitAncestorSize, uint64_t limitDescendantCount, uint64_t limitDescendantSize, std::string &errString, bool fSearchForParents=true) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
Try to calculate all in-mempool ancestors of entry. More... | |
void | CalculateDescendants (txiter it, setEntries &setDescendants) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
Populate setDescendants with all in-mempool descendants of hash. More... | |
CFeeRate | GetMinFee (size_t sizelimit) const |
The minimum fee to get into the mempool, which may itself not be enough for larger-sized transactions. More... | |
void | TrimToSize (size_t sizelimit, std::vector< COutPoint > *pvNoSpendsRemaining=nullptr) EXCLUSIVE_LOCKS_REQUIRED(cs) |
Remove transactions from the mempool until its dynamic size is <= sizelimit. More... | |
int | Expire (std::chrono::seconds time) EXCLUSIVE_LOCKS_REQUIRED(cs) |
Expire all transaction (and their dependencies) in the mempool older than time. More... | |
void | GetTransactionAncestry (const uint256 &txid, size_t &ancestors, size_t &descendants) const |
Calculate the ancestor and descendant count for the given transaction. More... | |
bool | IsLoaded () const |
void | SetIsLoaded (bool loaded) |
Sets the current loaded state. More... | |
unsigned long | size () const |
uint64_t | GetTotalTxSize () const EXCLUSIVE_LOCKS_REQUIRED(cs) |
CAmount | GetTotalFee () const EXCLUSIVE_LOCKS_REQUIRED(cs) |
bool | exists (const GenTxid >xid) const |
bool | exists (const uint256 &txid) const |
CTransactionRef | get (const uint256 &hash) const |
txiter | get_iter_from_wtxid (const uint256 &wtxid) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
TxMempoolInfo | info (const uint256 &hash) const |
TxMempoolInfo | info (const GenTxid >xid) const |
std::vector< TxMempoolInfo > | infoAll () const |
size_t | DynamicMemoryUsage () const |
void | AddUnbroadcastTx (const uint256 &txid) |
Adds a transaction to the unbroadcast set. More... | |
void | RemoveUnbroadcastTx (const uint256 &txid, const bool unchecked=false) |
Removes a transaction from the unbroadcast set. More... | |
std::set< uint256 > | GetUnbroadcastTxs () const |
Returns transactions in unbroadcast set. More... | |
bool | IsUnbroadcastTx (const uint256 &txid) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
Returns whether a txid is in the unbroadcast set. More... | |
uint64_t | GetAndIncrementSequence () const EXCLUSIVE_LOCKS_REQUIRED(cs) |
Guards this internal counter for external reporting. More... | |
uint64_t | GetSequence () const EXCLUSIVE_LOCKS_REQUIRED(cs) |
bool | visited (const txiter it) const EXCLUSIVE_LOCKS_REQUIRED(cs |
visited marks a CTxMemPoolEntry as having been traversed during the lifetime of the most recently created Epoch::Guard and returns false if we are the first visitor, true otherwise. More... | |
bool | visited (Optional< txiter > it) const EXCLUSIVE_LOCKS_REQUIRED(cs |
Public Attributes | |
RecursiveMutex | cs |
This mutex needs to be locked when accessing mapTx or other members that are guarded by it. More... | |
std::map< uint256, CAmount > | mapDeltas |
void check(CChainState &active_chainstate) const EXCLUSIVE_LOCKS_REQUIRED(void | addUnchecked (const CTxMemPoolEntry &entry, bool validFeeEstimate=true) EXCLUSIVE_LOCKS_REQUIRED(cs |
If sanity-checking is turned on, check makes sure the pool is consistent (does not contain two transactions that spend the same inputs, all inputs are in the mapNextTx array). More... | |
void check(CChainState &active_chainstate) const EXCLUSIVE_LOCKS_REQUIRED(void | cs_main |
void | cs_main |
bool | m_epoch |
return !it visited * | it |
Static Public Attributes | |
static const int | ROLLING_FEE_HALFLIFE = 60 * 60 * 12 |
Private Types | |
typedef std::map< txiter, setEntries, CompareIteratorByHash > | cacheMap |
Private Member Functions | |
uint64_t totalTxSize | GUARDED_BY (cs) |
sum of all mempool tx's virtual sizes. Differs from serialized tx size since witness data is discounted. Defined in BIP 141. More... | |
CAmount m_total_fee | GUARDED_BY (cs) |
sum of all mempool tx's fees (NOT modified fee) More... | |
uint64_t cachedInnerUsage | GUARDED_BY (cs) |
sum of dynamic memory usage of all the map elements (NOT the maps themselves) More... | |
Epoch m_epoch | GUARDED_BY (cs) |
void | trackPackageRemoved (const CFeeRate &rate) EXCLUSIVE_LOCKS_REQUIRED(cs) |
bool m_is_loaded | GUARDED_BY (cs) |
void | UpdateParent (txiter entry, txiter parent, bool add) EXCLUSIVE_LOCKS_REQUIRED(cs) |
void | UpdateChild (txiter entry, txiter child, bool add) EXCLUSIVE_LOCKS_REQUIRED(cs) |
std::vector< indexed_transaction_set::const_iterator > | GetSortedDepthAndScore () const EXCLUSIVE_LOCKS_REQUIRED(cs) |
std::set< uint256 > m_unbroadcast_txids | GUARDED_BY (cs) |
Track locally submitted transactions to periodically retry initial broadcast. More... | |
void | UpdateForDescendants (txiter updateIt, cacheMap &cachedDescendants, const std::set< uint256 > &setExclude) EXCLUSIVE_LOCKS_REQUIRED(cs) |
UpdateForDescendants is used by UpdateTransactionsFromBlock to update the descendants for a single transaction that has been added to the mempool but may have child transactions in the mempool, eg during a chain reorg. More... | |
void | UpdateAncestorsOf (bool add, txiter hash, setEntries &setAncestors) EXCLUSIVE_LOCKS_REQUIRED(cs) |
Update ancestors of hash to add/remove it as a descendant transaction. More... | |
void | UpdateEntryForAncestors (txiter it, const setEntries &setAncestors) EXCLUSIVE_LOCKS_REQUIRED(cs) |
Set ancestor state for an entry. More... | |
void | UpdateForRemoveFromMempool (const setEntries &entriesToRemove, bool updateDescendants) EXCLUSIVE_LOCKS_REQUIRED(cs) |
For each transaction being removed, update ancestors and any direct children. More... | |
void | UpdateChildrenForRemoval (txiter entry) EXCLUSIVE_LOCKS_REQUIRED(cs) |
Sever link between specified transaction and direct children. More... | |
void | removeUnchecked (txiter entry, MemPoolRemovalReason reason) EXCLUSIVE_LOCKS_REQUIRED(cs) |
Before calling removeUnchecked for a given transaction, UpdateForRemoveFromMempool must be called on the entire (dependent) set of transactions being removed at the same time. More... | |
Private Attributes | |
const int | m_check_ratio |
Value n means that 1 times in n we check. More... | |
std::atomic< unsigned int > | nTransactionsUpdated {0} |
Used by getblocktemplate to trigger CreateNewBlock() invocation. More... | |
CBlockPolicyEstimator * | minerPolicyEstimator |
int64_t | lastRollingFeeUpdate |
bool | blockSinceLastRollingFeeBump |
double | rollingMinimumFeeRate |
minimum fee to get into the pool, decreases exponentially More... | |
uint64_t | m_sequence_number {1} |
CTxMemPool stores valid-according-to-the-current-best-chain transactions that may be included in the next block.
Transactions are added when they are seen on the network (or created by the local node), but not all transactions seen are added to the pool. For example, the following new transactions will not be added to the mempool:
CTxMemPool::mapTx, and CTxMemPoolEntry bookkeeping:
mapTx is a boost::multi_index that sorts the mempool on 5 criteria:
Note: the term "descendant" refers to in-mempool transactions that depend on this one, while "ancestor" refers to in-mempool transactions that a given transaction depends on.
In order for the feerate sort to remain correct, we must update transactions in the mempool when new descendants arrive. To facilitate this, we track the set of in-mempool direct parents and direct children in mapLinks. Within each CTxMemPoolEntry, we track the size and fees of all descendants.
Usually when a new transaction is added to the mempool, it has no in-mempool children (because any such children would be an orphan). So in addUnchecked(), we:
When a transaction is removed from the mempool, we must:
These happen in UpdateForRemoveFromMempool(). (Note that when removing a transaction along with its descendants, we must calculate that set of transactions to be removed before doing the removal, or else the mempool can be in an inconsistent state where it's impossible to walk the ancestors of a transaction.)
In the event of a reorg, the assumption that a newly added tx has no in-mempool children is false. In particular, the mempool is in an inconsistent state while new transactions are being added, because there may be descendant transactions of a tx coming from a disconnected block that are unreachable from just looking at transactions in the mempool (the linking transactions may also be in the disconnected block, waiting to be added). Because of this, there's not much benefit in trying to search for in-mempool children in addUnchecked(). Instead, in the special case of transactions being added from a disconnected block, we require the caller to clean up the state, to account for in-mempool, out-of-block descendants for all the in-block transactions by calling UpdateTransactionsFromBlock(). Note that until this is called, the mempool state is not consistent, and in particular mapLinks may not be correct (and therefore functions like CalculateMemPoolAncestors() and CalculateDescendants() that rely on them to walk the mempool are not generally safe to use).
Computational limits:
Updating all in-mempool ancestors of a newly added transaction can be slow, if no bound exists on how many in-mempool ancestors there may be. CalculateMemPoolAncestors() takes configurable limits that are designed to prevent these calculations from being too CPU intensive.
Definition at line 477 of file txmempool.h.
|
private |
Definition at line 575 of file txmempool.h.
typedef boost::multi_index_container< CTxMemPoolEntry, boost::multi_index::indexed_by< boost::multi_index::hashed_unique<mempoolentry_txid, SaltedTxidHasher>, boost::multi_index::hashed_unique< boost::multi_index::tag<index_by_wtxid>, mempoolentry_wtxid, SaltedTxidHasher >, boost::multi_index::ordered_non_unique< boost::multi_index::tag<descendant_score>, boost::multi_index::identity<CTxMemPoolEntry>, CompareTxMemPoolEntryByDescendantScore >, boost::multi_index::ordered_non_unique< boost::multi_index::tag<entry_time>, boost::multi_index::identity<CTxMemPoolEntry>, CompareTxMemPoolEntryByEntryTime >, boost::multi_index::ordered_non_unique< boost::multi_index::tag<ancestor_score>, boost::multi_index::identity<CTxMemPoolEntry>, CompareTxMemPoolEntryByAncestorFee > > > CTxMemPool::indexed_transaction_set |
Definition at line 536 of file txmempool.h.
typedef std::set<txiter, CompareIteratorByHash> CTxMemPool::setEntries |
Definition at line 571 of file txmempool.h.
using CTxMemPool::txiter = indexed_transaction_set::nth_index<0>::type::const_iterator |
Definition at line 568 of file txmempool.h.
|
explicit |
Create a new CTxMemPool.
Sanity checks will be off by default for performance, because otherwise accepting transactions becomes O(N^2) where N is the number of transactions in the pool.
[in] | estimator | is used to estimate appropriate transaction fees. |
[in] | check_ratio | is the ratio used to determine how often sanity checks will run. |
Definition at line 334 of file txmempool.cpp.
void CTxMemPool::_clear | ( | ) |
Definition at line 594 of file txmempool.cpp.
void CTxMemPool::AddTransactionsUpdated | ( | unsigned int | n | ) |
|
inline |
Adds a transaction to the unbroadcast set.
Definition at line 759 of file txmempool.h.
void CTxMemPool::addUnchecked | ( | const CTxMemPoolEntry & | entry, |
setEntries & | setAncestors, | ||
bool | validFeeEstimate = true |
||
) |
Definition at line 871 of file txmempool.cpp.
uint64_t CTxMemPool::CalculateDescendantMaximum | ( | txiter | entry | ) | const |
void CTxMemPool::CalculateDescendants | ( | txiter | it, |
setEntries & | setDescendants | ||
) | const |
Populate setDescendants with all in-mempool descendants of hash.
Assumes that setDescendants includes all in-mempool descendants of anything already in it.
Definition at line 452 of file txmempool.cpp.
bool CTxMemPool::CalculateMemPoolAncestors | ( | const CTxMemPoolEntry & | entry, |
setEntries & | setAncestors, | ||
uint64_t | limitAncestorCount, | ||
uint64_t | limitAncestorSize, | ||
uint64_t | limitDescendantCount, | ||
uint64_t | limitDescendantSize, | ||
std::string & | errString, | ||
bool | fSearchForParents = true |
||
) | const |
Try to calculate all in-mempool ancestors of entry.
(these are all calculated including the tx itself) limitAncestorCount = max number of ancestors limitAncestorSize = max size of ancestors limitDescendantCount = max number of descendants any ancestor can have limitDescendantSize = max size of descendants any ancestor can have errString = populated with error reason if any limits are hit fSearchForParents = whether to search a tx's vin for in-mempool parents, or look up parents from mapLinks. Must be true for entries not in the mempool
Definition at line 152 of file txmempool.cpp.
void CTxMemPool::clear | ( | ) |
Definition at line 607 of file txmempool.cpp.
void CTxMemPool::ClearPrioritisation | ( | const uint256 & | hash | ) |
size_t CTxMemPool::DynamicMemoryUsage | ( | ) | const |
Definition at line 936 of file txmempool.cpp.
|
inline |
Definition at line 736 of file txmempool.h.
|
inline |
Definition at line 744 of file txmempool.h.
int CTxMemPool::Expire | ( | std::chrono::seconds | time | ) |
Expire all transaction (and their dependencies) in the mempool older than time.
Return the number of removed transactions.
Definition at line 959 of file txmempool.cpp.
CTransactionRef CTxMemPool::get | ( | const uint256 & | hash | ) | const |
|
inline |
Guards this internal counter for external reporting.
Definition at line 785 of file txmempool.h.
const CTransaction * CTxMemPool::GetConflictTx | ( | const COutPoint & | prevout | ) | const |
Get the transaction in the pool that spends the same prevout.
Definition at line 887 of file txmempool.cpp.
Optional< CTxMemPool::txiter > CTxMemPool::GetIter | ( | const uint256 & | txid | ) | const |
Returns an iterator to the given hash, if found.
Definition at line 893 of file txmempool.cpp.
CTxMemPool::setEntries CTxMemPool::GetIterSet | ( | const std::set< uint256 > & | hashes | ) | const |
Translate a set of hashes into a set of pool iterators to avoid repeated lookups.
Definition at line 900 of file txmempool.cpp.
CFeeRate CTxMemPool::GetMinFee | ( | size_t | sizelimit | ) | const |
The minimum fee to get into the mempool, which may itself not be enough for larger-sized transactions.
The incrementalRelayFee policy variable is used to bound the time it takes the fee rate to go back down all the way to 0. When the feerate would otherwise be half of this, it is set to 0 instead.
Definition at line 1007 of file txmempool.cpp.
|
inline |
|
private |
|
inline |
|
inline |
void CTxMemPool::GetTransactionAncestry | ( | const uint256 & | txid, |
size_t & | ancestors, | ||
size_t & | descendants | ||
) | const |
Calculate the ancestor and descendant count for the given transaction.
The counts include the transaction itself.
Definition at line 1104 of file txmempool.cpp.
unsigned int CTxMemPool::GetTransactionsUpdated | ( | ) | const |
|
inline |
Returns transactions in unbroadcast set.
Definition at line 771 of file txmempool.h.
|
private |
sum of all mempool tx's virtual sizes. Differs from serialized tx size since witness data is discounted. Defined in BIP 141.
sum of all mempool tx's fees (NOT modified fee)
|
private |
sum of dynamic memory usage of all the map elements (NOT the maps themselves)
|
inlineprivate |
Definition at line 500 of file txmempool.h.
indexed_transaction_set mapTx CTxMemPool::GUARDED_BY | ( | cs | ) |
All tx witness hashes/entries in mapTx, in random order.
Track locally submitted transactions to periodically retry initial broadcast.
indirectmap<COutPoint, const CTransaction*> mapNextTx CTxMemPool::GUARDED_BY | ( | cs | ) |
bool CTxMemPool::HasNoInputsOf | ( | const CTransaction & | tx | ) | const |
Check that none of this transactions inputs are in the mempool, and thus the tx is not dependent on other mempool transactions to be included in a block.
Definition at line 910 of file txmempool.cpp.
TxMempoolInfo CTxMemPool::info | ( | const GenTxid & | gtxid | ) | const |
TxMempoolInfo CTxMemPool::info | ( | const uint256 & | hash | ) | const |
Definition at line 839 of file txmempool.cpp.
std::vector< TxMempoolInfo > CTxMemPool::infoAll | ( | ) | const |
Definition at line 807 of file txmempool.cpp.
bool CTxMemPool::IsLoaded | ( | ) | const |
Definition at line 1114 of file txmempool.cpp.
bool CTxMemPool::isSpent | ( | const COutPoint & | outpoint | ) | const |
|
inline |
Returns whether a txid is in the unbroadcast set.
Definition at line 778 of file txmempool.h.
Affect CreateNewBlock prioritisation of transactions.
Definition at line 841 of file txmempool.cpp.
void CTxMemPool::queryHashes | ( | std::vector< uint256 > & | vtxid | ) | const |
Definition at line 790 of file txmempool.cpp.
void CTxMemPool::removeConflicts | ( | const CTransaction & | tx | ) |
Definition at line 545 of file txmempool.cpp.
void CTxMemPool::removeForBlock | ( | const std::vector< CTransactionRef > & | vtx, |
unsigned int | nBlockHeight | ||
) |
Called when a block is connected.
Removes from mempool and updates the miner fee estimator.
Definition at line 565 of file txmempool.cpp.
void CTxMemPool::removeForReorg | ( | CChainState & | active_chainstate, |
int | flags | ||
) |
void CTxMemPool::removeRecursive | ( | const CTransaction & | tx, |
MemPoolRemovalReason | reason | ||
) |
Definition at line 476 of file txmempool.cpp.
void CTxMemPool::RemoveStaged | ( | setEntries & | stage, |
bool | updateDescendants, | ||
MemPoolRemovalReason | reason | ||
) |
Remove a set of transactions from the mempool.
If a transaction is in this set, then all in-mempool descendants must also be in the set, unless this transaction is being removed for being in a block. Set updateDescendants to true when removing a tx that was in a block, so that any in-mempool descendants have their ancestor state updated.
Definition at line 951 of file txmempool.cpp.
void CTxMemPool::RemoveUnbroadcastTx | ( | const uint256 & | txid, |
const bool | unchecked = false |
||
) |
Removes a transaction from the unbroadcast set.
Definition at line 942 of file txmempool.cpp.
|
private |
Before calling removeUnchecked for a given transaction, UpdateForRemoveFromMempool must be called on the entire (dependent) set of transactions being removed at the same time.
We use each CTxMemPoolEntry's setMemPoolParents in order to walk ancestors of a given transaction that is removed, so we can't remove intermediate transactions in a chain before we've updated all the state for the removal.
Definition at line 408 of file txmempool.cpp.
void CTxMemPool::SetIsLoaded | ( | bool | loaded | ) |
Sets the current loaded state.
Definition at line 1120 of file txmempool.cpp.
|
inline |
|
private |
Definition at line 1031 of file txmempool.cpp.
void CTxMemPool::TrimToSize | ( | size_t | sizelimit, |
std::vector< COutPoint > * | pvNoSpendsRemaining = nullptr |
||
) |
Remove transactions from the mempool until its dynamic size is <= sizelimit.
pvNoSpendsRemaining, if set, will be populated with the list of outpoints which are not in mempool which no longer have any spends in this mempool.
Definition at line 1039 of file txmempool.cpp.
|
private |
Update ancestors of hash to add/remove it as a descendant transaction.
Definition at line 217 of file txmempool.cpp.
Definition at line 985 of file txmempool.cpp.
|
private |
Sever link between specified transaction and direct children.
Definition at line 246 of file txmempool.cpp.
|
private |
Set ancestor state for an entry.
Definition at line 232 of file txmempool.cpp.
|
private |
UpdateForDescendants is used by UpdateTransactionsFromBlock to update the descendants for a single transaction that has been added to the mempool but may have child transactions in the mempool, eg during a chain reorg.
setExclude is the set of descendant transactions in the mempool that must not be accounted for (because any descendants in setExclude were added to the mempool after the transaction being updated and hence their state is already reflected in the parent state).
cachedDescendants will be updated with the descendants of the transaction being updated, so that future invocations don't need to walk the same transaction again, if encountered in another transaction chain.
Definition at line 60 of file txmempool.cpp.
|
private |
For each transaction being removed, update ancestors and any direct children.
If updateDescendants is true, then also update in-mempool descendants' ancestor state.
Definition at line 254 of file txmempool.cpp.
Definition at line 996 of file txmempool.cpp.
void CTxMemPool::UpdateTransactionsFromBlock | ( | const std::vector< uint256 > & | vHashesToUpdate | ) |
When adding transactions from a disconnected block back to the mempool, new mempool entries may have children in the mempool (which is generally not the case when otherwise adding transactions).
UpdateTransactionsFromBlock() will find child transactions and update the descendant state for each transaction in vHashesToUpdate (excluding any child transactions present in vHashesToUpdate, which are already accounted for). Note: vHashesToUpdate should be the set of transactions from the disconnected block that have been accepted back into the mempool.
Definition at line 107 of file txmempool.cpp.
bool CTxMemPool::visited | ( | const txiter | it | ) | const |
visited marks a CTxMemPoolEntry as having been traversed during the lifetime of the most recently created Epoch::Guard and returns false if we are the first visitor, true otherwise.
An Epoch::Guard must be held when visited is called or an assert will be triggered.
void CTxMemPool::addUnchecked |
If sanity-checking is turned on, check makes sure the pool is consistent (does not contain two transactions that spend the same inputs, all inputs are in the mapNextTx array).
If sanity-checking is turned off, check does nothing.
Definition at line 617 of file txmempool.h.
|
mutableprivate |
Definition at line 489 of file txmempool.h.
|
mutable |
This mutex needs to be locked when accessing mapTx
or other members that are guarded by it.
By design, it is guaranteed that:
cs_main
and mempool.cs
will give a view of mempool that is consistent with current chain tip (ChainActive()
and CoinsTip()
) and is fully populated. Fully populated means that if the current active chain is missing transactions that were present in a previously active chain, all the missing transactions will have been re-added to the mempool and should be present if they meet size and consistency constraints.mempool.cs
without cs_main
will give a view of a mempool consistent with some chain that was active since cs_main
was last locked, and that is fully populated as described above. It is ok for code that only needs to query or remove transactions from the mempool to lock just mempool.cs
without cs_main
.To provide these guarantees, it is necessary to lock both cs_main
and mempool.cs
whenever adding transactions to the mempool and whenever changing the chain tip. It's necessary to keep both mutexes locked until the mempool is consistent with the new chain tip and fully populated.
Definition at line 565 of file txmempool.h.
void CTxMemPool::cs_main |
Definition at line 617 of file txmempool.h.
void CTxMemPool::cs_main |
Definition at line 618 of file txmempool.h.
return !it visited* CTxMemPool::it |
Definition at line 847 of file txmempool.h.
|
mutableprivate |
Definition at line 488 of file txmempool.h.
|
private |
Value n means that 1 times in n we check.
Definition at line 480 of file txmempool.h.
bool CTxMemPool::m_epoch |
Definition at line 840 of file txmempool.h.
|
mutableprivate |
Definition at line 496 of file txmempool.h.
Definition at line 590 of file txmempool.h.
|
private |
Definition at line 482 of file txmempool.h.
|
private |
Used by getblocktemplate to trigger CreateNewBlock() invocation.
Definition at line 481 of file txmempool.h.
|
static |
Definition at line 504 of file txmempool.h.
|
mutableprivate |
minimum fee to get into the pool, decreases exponentially
Definition at line 490 of file txmempool.h.