 |
Bitcoin Core
27.99.0
P2P Digital Currency
|
|
Bitcoin Core
27.99.0
P2P Digital Currency
|
Public Member Functions | |
| CFeeRate | GetMinFee (size_t sizelimit) const |
| CFeeRate | GetMinFee () const |
| The minimum fee to get into the mempool, which may itself not be enough for larger-sized transactions. More... | |
 Public Member Functions inherited from CTxMemPool | |
| indexed_transaction_set mapTx | GUARDED_BY (cs) |
| std::vector< CTransactionRef > txns_randomized | GUARDED_BY (cs) |
| All transactions in mapTx, in random order. More... | |
| uint64_t | CalculateDescendantMaximum (txiter entry) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| indirectmap< COutPoint, const CTransaction * > mapNextTx | GUARDED_BY (cs) |
| std::map< uint256, CAmount > mapDeltas | GUARDED_BY (cs) |
| CTxMemPool (const Options &opts) | |
| Create a new CTxMemPool. More... | |
| void | addUnchecked (const CTxMemPoolEntry &entry, setEntries &setAncestors) EXCLUSIVE_LOCKS_REQUIRED(cs |
| void | removeRecursive (const CTransaction &tx, MemPoolRemovalReason reason) EXCLUSIVE_LOCKS_REQUIRED(cs) |
| void | removeForReorg (CChain &chain, std::function< bool(txiter)> filter_final_and_mature) EXCLUSIVE_LOCKS_REQUIRED(cs |
| After reorg, filter the entries that would no longer be valid in the next block, and update the entries' cached LockPoints if needed. More... | |
| 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... | |
| bool | CompareDepthAndScore (const uint256 &hasha, const uint256 &hashb, bool wtxid=false) |
| 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) |
| std::vector< delta_info > | GetPrioritisedTransactions () const EXCLUSIVE_LOCKS_REQUIRED(!cs) |
| Return a vector of all entries in mapDeltas with their corresponding delta_info. More... | |
| const CTransaction * | GetConflictTx (const COutPoint &prevout) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| Get the transaction in the pool that spends the same prevout. More... | |
| std::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< Txid > &hashes) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| Translate a set of hashes into a set of pool iterators to avoid repeated lookups. More... | |
| std::vector< txiter > | GetIterVec (const std::vector< uint256 > &txids) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| Translate a list of hashes into a list of mempool 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 |
| UpdateTransactionsFromBlock is called 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) |
| util::Result< setEntries > | CalculateMemPoolAncestors (const CTxMemPoolEntry &entry, const Limits &limits, bool fSearchForParents=true) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| Try to calculate all in-mempool ancestors of entry. More... | |
| setEntries | AssumeCalculateMemPoolAncestors (std::string_view calling_fn_name, const CTxMemPoolEntry &entry, const Limits &limits, bool fSearchForParents=true) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| Same as CalculateMemPoolAncestors, but always returns a (non-optional) setEntries. More... | |
| std::vector< txiter > | GatherClusters (const std::vector< uint256 > &txids) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| Collect the entire cluster of connected transactions for each transaction in txids. More... | |
| util::Result< void > | CheckPackageLimits (const Package &package, int64_t total_vsize) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| Calculate all in-mempool ancestors of a set of transactions not already in the mempool and check ancestor and descendant limits. More... | |
| void | CalculateDescendants (txiter it, setEntries &setDescendants) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| Populate setDescendants with all in-mempool descendants of hash. More... | |
| CFeeRate | GetMinFee () 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, size_t *ancestorsize=nullptr, CAmount *ancestorfees=nullptr) const |
| Calculate the ancestor and descendant count for the given transaction. More... | |
| bool | GetLoadTried () const |
| void | SetLoadTried (bool load_tried) |
| Set whether or not an initial attempt to load the persisted mempool was made (regardless of whether the attempt was successful or not) 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 |
| const CTxMemPoolEntry * | GetEntry (const Txid &txid) const LIFETIMEBOUND EXCLUSIVE_LOCKS_REQUIRED(cs) |
| CTransactionRef | get (const uint256 &hash) const |
| txiter | get_iter_from_wtxid (const uint256 &wtxid) const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| TxMempoolInfo | info (const GenTxid >xid) const |
| TxMempoolInfo | info_for_relay (const GenTxid >xid, uint64_t last_sequence) const |
| Returns info for a transaction if its entry_sequence < last_sequence. More... | |
| std::vector< CTxMemPoolEntryRef > | entryAll () const EXCLUSIVE_LOCKS_REQUIRED(cs) |
| 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) |
| util::Result< std::pair< std::vector< FeeFrac >, std::vector< FeeFrac > > > | CalculateFeerateDiagramsForRBF (CAmount replacement_fees, int64_t replacement_vsize, const setEntries &direct_conflicts, const setEntries &all_conflicts) EXCLUSIVE_LOCKS_REQUIRED(cs) |
| Calculate the old and new mempool feerate diagrams relating to the clusters that would be affected by a potential replacement transaction. More... | |
| std::optional< std::string > | CheckConflictTopology (const setEntries &direct_conflicts) |
| 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 (std::optional< txiter > it) const EXCLUSIVE_LOCKS_REQUIRED(cs |
Additional Inherited Members | |
| Public Types inherited from CTxMemPool | |
| 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 |
| using | Limits = kernel::MemPoolLimits |
| using | Options = kernel::MemPoolOptions |
| Public Attributes inherited from CTxMemPool | |
| RecursiveMutex | cs |
This mutex needs to be locked when accessing mapTx or other members that are guarded by it. More... | |
| const int64_t | m_max_size_bytes |
| const std::chrono::seconds | m_expiry |
| const CFeeRate | m_incremental_relay_feerate |
| const CFeeRate | m_min_relay_feerate |
| const CFeeRate | m_dust_relay_feerate |
| const bool | m_permit_bare_multisig |
| const std::optional< unsigned > | m_max_datacarrier_bytes |
| const bool | m_require_standard |
| const bool | m_full_rbf |
| const bool | m_persist_v1_dat |
| const Limits | m_limits |
| ValidationSignals *const | m_signals |
| void check(const CCoinsViewCache &active_coins_tip, int64_t spendheight) const EXCLUSIVE_LOCKS_REQUIRED(void | addUnchecked (const CTxMemPoolEntry &entry) 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(const CCoinsViewCache &active_coins_tip, int64_t spendheight) const EXCLUSIVE_LOCKS_REQUIRED(void | cs_main |
| void | cs_main |
| bool | m_epoch |
| return !it visited * | it |
| Static Public Attributes inherited from CTxMemPool | |
| static const int | ROLLING_FEE_HALFLIFE = 60 * 60 * 12 |
| Protected Member Functions inherited from CTxMemPool | |
| uint64_t totalTxSize | GUARDED_BY (cs) |
| CAmount m_total_fee | 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... | |
| uint64_t cachedInnerUsage | GUARDED_BY (cs) |
| sum of all mempool tx's fees (NOT modified fee) More... | |
| int64_t lastRollingFeeUpdate | GUARDED_BY (cs) |
| sum of dynamic memory usage of all the map elements (NOT the maps themselves) More... | |
| bool blockSinceLastRollingFeeBump | GUARDED_BY (cs) |
| double rollingMinimumFeeRate | GUARDED_BY (cs) |
| Epoch m_epoch | GUARDED_BY (cs) |
| minimum fee to get into the pool, decreases exponentially More... | |
| uint64_t m_sequence_number | GUARDED_BY (cs) |
| void | trackPackageRemoved (const CFeeRate &rate) EXCLUSIVE_LOCKS_REQUIRED(cs) |
| bool m_load_tried | GUARDED_BY (cs) |
| CFeeRate | GetMinFee (size_t sizelimit) const |
| Protected Attributes inherited from CTxMemPool | |
| 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... | |
Definition at line 20 of file mempool_tests.cpp.
|
inline |
The minimum fee to get into the mempool, which may itself not be enough for larger-sized transactions.
The m_incremental_relay_feerate 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 627 of file txmempool.h.
| CFeeRate CTxMemPool::GetMinFee |
1.9.1