Bitcoin Core  0.19.99
P2P Digital Currency
txmempool.h
Go to the documentation of this file.
1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2020 The Bitcoin Core developers
3 // Distributed under the MIT software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
5 
6 #ifndef BITCOIN_TXMEMPOOL_H
7 #define BITCOIN_TXMEMPOOL_H
8 
9 #include <atomic>
10 #include <map>
11 #include <set>
12 #include <string>
13 #include <utility>
14 #include <vector>
15 
16 #include <amount.h>
17 #include <coins.h>
18 #include <crypto/siphash.h>
19 #include <indirectmap.h>
20 #include <optional.h>
21 #include <policy/feerate.h>
22 #include <primitives/transaction.h>
23 #include <sync.h>
24 #include <random.h>
25 
26 #include <boost/multi_index_container.hpp>
27 #include <boost/multi_index/hashed_index.hpp>
28 #include <boost/multi_index/ordered_index.hpp>
29 #include <boost/multi_index/sequenced_index.hpp>
30 #include <boost/signals2/signal.hpp>
31 
32 class CBlockIndex;
33 extern RecursiveMutex cs_main;
34 
36 static const uint32_t MEMPOOL_HEIGHT = 0x7FFFFFFF;
37 
38 struct LockPoints
39 {
40  // Will be set to the blockchain height and median time past
41  // values that would be necessary to satisfy all relative locktime
42  // constraints (BIP68) of this tx given our view of block chain history
43  int height;
44  int64_t time;
45  // As long as the current chain descends from the highest height block
46  // containing one of the inputs used in the calculation, then the cached
47  // values are still valid even after a reorg.
49 
50  LockPoints() : height(0), time(0), maxInputBlock(nullptr) { }
51 };
52 
66 {
67 private:
69  const CAmount nFee;
70  const size_t nTxWeight;
71  const size_t nUsageSize;
72  const int64_t nTime;
73  const unsigned int entryHeight;
74  const bool spendsCoinbase;
75  const int64_t sigOpCost;
76  int64_t feeDelta;
78 
79  // Information about descendants of this transaction that are in the
80  // mempool; if we remove this transaction we must remove all of these
81  // descendants as well.
85 
86  // Analogous statistics for ancestor transactions
91 
92 public:
93  CTxMemPoolEntry(const CTransactionRef& _tx, const CAmount& _nFee,
94  int64_t _nTime, unsigned int _entryHeight,
95  bool spendsCoinbase,
96  int64_t nSigOpsCost, LockPoints lp);
97 
98  const CTransaction& GetTx() const { return *this->tx; }
99  CTransactionRef GetSharedTx() const { return this->tx; }
100  const CAmount& GetFee() const { return nFee; }
101  size_t GetTxSize() const;
102  size_t GetTxWeight() const { return nTxWeight; }
103  std::chrono::seconds GetTime() const { return std::chrono::seconds{nTime}; }
104  unsigned int GetHeight() const { return entryHeight; }
105  int64_t GetSigOpCost() const { return sigOpCost; }
106  int64_t GetModifiedFee() const { return nFee + feeDelta; }
107  size_t DynamicMemoryUsage() const { return nUsageSize; }
108  const LockPoints& GetLockPoints() const { return lockPoints; }
109 
110  // Adjusts the descendant state.
111  void UpdateDescendantState(int64_t modifySize, CAmount modifyFee, int64_t modifyCount);
112  // Adjusts the ancestor state
113  void UpdateAncestorState(int64_t modifySize, CAmount modifyFee, int64_t modifyCount, int64_t modifySigOps);
114  // Updates the fee delta used for mining priority score, and the
115  // modified fees with descendants.
116  void UpdateFeeDelta(int64_t feeDelta);
117  // Update the LockPoints after a reorg
118  void UpdateLockPoints(const LockPoints& lp);
119 
120  uint64_t GetCountWithDescendants() const { return nCountWithDescendants; }
121  uint64_t GetSizeWithDescendants() const { return nSizeWithDescendants; }
122  CAmount GetModFeesWithDescendants() const { return nModFeesWithDescendants; }
123 
124  bool GetSpendsCoinbase() const { return spendsCoinbase; }
125 
126  uint64_t GetCountWithAncestors() const { return nCountWithAncestors; }
127  uint64_t GetSizeWithAncestors() const { return nSizeWithAncestors; }
128  CAmount GetModFeesWithAncestors() const { return nModFeesWithAncestors; }
129  int64_t GetSigOpCostWithAncestors() const { return nSigOpCostWithAncestors; }
130 
131  mutable size_t vTxHashesIdx;
132  mutable uint64_t m_epoch;
133 };
134 
135 // Helpers for modifying CTxMemPool::mapTx, which is a boost multi_index.
137 {
138  update_descendant_state(int64_t _modifySize, CAmount _modifyFee, int64_t _modifyCount) :
139  modifySize(_modifySize), modifyFee(_modifyFee), modifyCount(_modifyCount)
140  {}
141 
142  void operator() (CTxMemPoolEntry &e)
143  { e.UpdateDescendantState(modifySize, modifyFee, modifyCount); }
144 
145  private:
146  int64_t modifySize;
148  int64_t modifyCount;
149 };
150 
152 {
153  update_ancestor_state(int64_t _modifySize, CAmount _modifyFee, int64_t _modifyCount, int64_t _modifySigOpsCost) :
154  modifySize(_modifySize), modifyFee(_modifyFee), modifyCount(_modifyCount), modifySigOpsCost(_modifySigOpsCost)
155  {}
156 
157  void operator() (CTxMemPoolEntry &e)
158  { e.UpdateAncestorState(modifySize, modifyFee, modifyCount, modifySigOpsCost); }
159 
160  private:
161  int64_t modifySize;
163  int64_t modifyCount;
165 };
166 
168 {
169  explicit update_fee_delta(int64_t _feeDelta) : feeDelta(_feeDelta) { }
170 
171  void operator() (CTxMemPoolEntry &e) { e.UpdateFeeDelta(feeDelta); }
172 
173 private:
174  int64_t feeDelta;
175 };
176 
178 {
179  explicit update_lock_points(const LockPoints& _lp) : lp(_lp) { }
180 
181  void operator() (CTxMemPoolEntry &e) { e.UpdateLockPoints(lp); }
182 
183 private:
184  const LockPoints& lp;
185 };
186 
187 // extracts a transaction hash from CTxMemPoolEntry or CTransactionRef
189 {
191  result_type operator() (const CTxMemPoolEntry &entry) const
192  {
193  return entry.GetTx().GetHash();
194  }
195 
196  result_type operator() (const CTransactionRef& tx) const
197  {
198  return tx->GetHash();
199  }
200 };
201 
207 {
208 public:
209  bool operator()(const CTxMemPoolEntry& a, const CTxMemPoolEntry& b) const
210  {
211  double a_mod_fee, a_size, b_mod_fee, b_size;
212 
213  GetModFeeAndSize(a, a_mod_fee, a_size);
214  GetModFeeAndSize(b, b_mod_fee, b_size);
215 
216  // Avoid division by rewriting (a/b > c/d) as (a*d > c*b).
217  double f1 = a_mod_fee * b_size;
218  double f2 = a_size * b_mod_fee;
219 
220  if (f1 == f2) {
221  return a.GetTime() >= b.GetTime();
222  }
223  return f1 < f2;
224  }
225 
226  // Return the fee/size we're using for sorting this entry.
227  void GetModFeeAndSize(const CTxMemPoolEntry &a, double &mod_fee, double &size) const
228  {
229  // Compare feerate with descendants to feerate of the transaction, and
230  // return the fee/size for the max.
231  double f1 = (double)a.GetModifiedFee() * a.GetSizeWithDescendants();
232  double f2 = (double)a.GetModFeesWithDescendants() * a.GetTxSize();
233 
234  if (f2 > f1) {
235  mod_fee = a.GetModFeesWithDescendants();
236  size = a.GetSizeWithDescendants();
237  } else {
238  mod_fee = a.GetModifiedFee();
239  size = a.GetTxSize();
240  }
241  }
242 };
243 
252 {
253 public:
254  bool operator()(const CTxMemPoolEntry& a, const CTxMemPoolEntry& b) const
255  {
256  double f1 = (double)a.GetFee() * b.GetTxSize();
257  double f2 = (double)b.GetFee() * a.GetTxSize();
258  if (f1 == f2) {
259  return b.GetTx().GetHash() < a.GetTx().GetHash();
260  }
261  return f1 > f2;
262  }
263 };
264 
266 {
267 public:
268  bool operator()(const CTxMemPoolEntry& a, const CTxMemPoolEntry& b) const
269  {
270  return a.GetTime() < b.GetTime();
271  }
272 };
273 
279 {
280 public:
281  template<typename T>
282  bool operator()(const T& a, const T& b) const
283  {
284  double a_mod_fee, a_size, b_mod_fee, b_size;
285 
286  GetModFeeAndSize(a, a_mod_fee, a_size);
287  GetModFeeAndSize(b, b_mod_fee, b_size);
288 
289  // Avoid division by rewriting (a/b > c/d) as (a*d > c*b).
290  double f1 = a_mod_fee * b_size;
291  double f2 = a_size * b_mod_fee;
292 
293  if (f1 == f2) {
294  return a.GetTx().GetHash() < b.GetTx().GetHash();
295  }
296  return f1 > f2;
297  }
298 
299  // Return the fee/size we're using for sorting this entry.
300  template <typename T>
301  void GetModFeeAndSize(const T &a, double &mod_fee, double &size) const
302  {
303  // Compare feerate with ancestors to feerate of the transaction, and
304  // return the fee/size for the min.
305  double f1 = (double)a.GetModifiedFee() * a.GetSizeWithAncestors();
306  double f2 = (double)a.GetModFeesWithAncestors() * a.GetTxSize();
307 
308  if (f1 > f2) {
309  mod_fee = a.GetModFeesWithAncestors();
310  size = a.GetSizeWithAncestors();
311  } else {
312  mod_fee = a.GetModifiedFee();
313  size = a.GetTxSize();
314  }
315  }
316 };
317 
318 // Multi_index tag names
320 struct entry_time {};
321 struct ancestor_score {};
322 
324 
329 {
332 
334  std::chrono::seconds m_time;
335 
338 
340  size_t vsize;
341 
343  int64_t nFeeDelta;
344 };
345 
350  EXPIRY,
351  SIZELIMIT,
352  REORG,
353  BLOCK,
354  CONFLICT,
355  REPLACED,
356 };
357 
359 {
360 private:
362  const uint64_t k0, k1;
363 
364 public:
366 
367  size_t operator()(const uint256& txid) const {
368  return SipHashUint256(k0, k1, txid);
369  }
370 };
371 
445 {
446 private:
447  uint32_t nCheckFrequency GUARDED_BY(cs);
448  std::atomic<unsigned int> nTransactionsUpdated;
450 
451  uint64_t totalTxSize;
452  uint64_t cachedInnerUsage;
453 
454  mutable int64_t lastRollingFeeUpdate;
456  mutable double rollingMinimumFeeRate;
457  mutable uint64_t m_epoch;
458  mutable bool m_has_epoch_guard;
459 
460  void trackPackageRemoved(const CFeeRate& rate) EXCLUSIVE_LOCKS_REQUIRED(cs);
461 
462  bool m_is_loaded GUARDED_BY(cs){false};
463 
464 public:
465 
466  static const int ROLLING_FEE_HALFLIFE = 60 * 60 * 12; // public only for testing
467 
468  typedef boost::multi_index_container<
470  boost::multi_index::indexed_by<
471  // sorted by txid
472  boost::multi_index::hashed_unique<mempoolentry_txid, SaltedTxidHasher>,
473  // sorted by fee rate
474  boost::multi_index::ordered_non_unique<
475  boost::multi_index::tag<descendant_score>,
476  boost::multi_index::identity<CTxMemPoolEntry>,
478  >,
479  // sorted by entry time
480  boost::multi_index::ordered_non_unique<
481  boost::multi_index::tag<entry_time>,
482  boost::multi_index::identity<CTxMemPoolEntry>,
484  >,
485  // sorted by fee rate with ancestors
486  boost::multi_index::ordered_non_unique<
487  boost::multi_index::tag<ancestor_score>,
488  boost::multi_index::identity<CTxMemPoolEntry>,
490  >
491  >
493 
523 
524  using txiter = indexed_transaction_set::nth_index<0>::type::const_iterator;
525  std::vector<std::pair<uint256, txiter>> vTxHashes GUARDED_BY(cs);
526 
528  bool operator()(const txiter &a, const txiter &b) const {
529  return a->GetTx().GetHash() < b->GetTx().GetHash();
530  }
531  };
532  typedef std::set<txiter, CompareIteratorByHash> setEntries;
533 
534  const setEntries & GetMemPoolParents(txiter entry) const EXCLUSIVE_LOCKS_REQUIRED(cs);
535  const setEntries & GetMemPoolChildren(txiter entry) const EXCLUSIVE_LOCKS_REQUIRED(cs);
536  uint64_t CalculateDescendantMaximum(txiter entry) const EXCLUSIVE_LOCKS_REQUIRED(cs);
537 private:
538  typedef std::map<txiter, setEntries, CompareIteratorByHash> cacheMap;
539 
540  struct TxLinks {
541  setEntries parents;
542  setEntries children;
543  };
544 
545  typedef std::map<txiter, TxLinks, CompareIteratorByHash> txlinksMap;
546  txlinksMap mapLinks;
547 
548  void UpdateParent(txiter entry, txiter parent, bool add);
549  void UpdateChild(txiter entry, txiter child, bool add);
550 
551  std::vector<indexed_transaction_set::const_iterator> GetSortedDepthAndScore() const EXCLUSIVE_LOCKS_REQUIRED(cs);
552 
553 public:
554  indirectmap<COutPoint, const CTransaction*> mapNextTx GUARDED_BY(cs);
555  std::map<uint256, CAmount> mapDeltas;
556 
559  explicit CTxMemPool(CBlockPolicyEstimator* estimator = nullptr);
560 
567  void check(const CCoinsViewCache *pcoins) const;
568  void setSanityCheck(double dFrequency = 1.0) { LOCK(cs); nCheckFrequency = static_cast<uint32_t>(dFrequency * 4294967295.0); }
569 
570  // addUnchecked must updated state for all ancestors of a given transaction,
571  // to track size/count of descendant transactions. First version of
572  // addUnchecked can be used to have it call CalculateMemPoolAncestors(), and
573  // then invoke the second version.
574  // Note that addUnchecked is ONLY called from ATMP outside of tests
575  // and any other callers may break wallet's in-mempool tracking (due to
576  // lack of CValidationInterface::TransactionAddedToMempool callbacks).
577  void addUnchecked(const CTxMemPoolEntry& entry, bool validFeeEstimate = true) EXCLUSIVE_LOCKS_REQUIRED(cs, cs_main);
578  void addUnchecked(const CTxMemPoolEntry& entry, setEntries& setAncestors, bool validFeeEstimate = true) EXCLUSIVE_LOCKS_REQUIRED(cs, cs_main);
579 
580  void removeRecursive(const CTransaction& tx, MemPoolRemovalReason reason) EXCLUSIVE_LOCKS_REQUIRED(cs);
581  void removeForReorg(const CCoinsViewCache* pcoins, unsigned int nMemPoolHeight, int flags) EXCLUSIVE_LOCKS_REQUIRED(cs, cs_main);
582  void removeConflicts(const CTransaction& tx) EXCLUSIVE_LOCKS_REQUIRED(cs);
583  void removeForBlock(const std::vector<CTransactionRef>& vtx, unsigned int nBlockHeight) EXCLUSIVE_LOCKS_REQUIRED(cs);
584 
585  void clear();
586  void _clear() EXCLUSIVE_LOCKS_REQUIRED(cs); //lock free
587  bool CompareDepthAndScore(const uint256& hasha, const uint256& hashb);
588  void queryHashes(std::vector<uint256>& vtxid) const;
589  bool isSpent(const COutPoint& outpoint) const;
590  unsigned int GetTransactionsUpdated() const;
591  void AddTransactionsUpdated(unsigned int n);
596  bool HasNoInputsOf(const CTransaction& tx) const EXCLUSIVE_LOCKS_REQUIRED(cs);
597 
599  void PrioritiseTransaction(const uint256& hash, const CAmount& nFeeDelta);
600  void ApplyDelta(const uint256 hash, CAmount &nFeeDelta) const;
601  void ClearPrioritisation(const uint256 hash);
602 
604  const CTransaction* GetConflictTx(const COutPoint& prevout) const EXCLUSIVE_LOCKS_REQUIRED(cs);
605 
607  Optional<txiter> GetIter(const uint256& txid) const EXCLUSIVE_LOCKS_REQUIRED(cs);
608 
610  setEntries GetIterSet(const std::set<uint256>& hashes) const EXCLUSIVE_LOCKS_REQUIRED(cs);
611 
619  void RemoveStaged(setEntries& stage, bool updateDescendants, MemPoolRemovalReason reason) EXCLUSIVE_LOCKS_REQUIRED(cs);
620 
630  void UpdateTransactionsFromBlock(const std::vector<uint256>& vHashesToUpdate) EXCLUSIVE_LOCKS_REQUIRED(cs, cs_main);
631 
642  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);
643 
647  void CalculateDescendants(txiter it, setEntries& setDescendants) const EXCLUSIVE_LOCKS_REQUIRED(cs);
648 
655  CFeeRate GetMinFee(size_t sizelimit) const;
656 
661  void TrimToSize(size_t sizelimit, std::vector<COutPoint>* pvNoSpendsRemaining = nullptr) EXCLUSIVE_LOCKS_REQUIRED(cs);
662 
664  int Expire(std::chrono::seconds time) EXCLUSIVE_LOCKS_REQUIRED(cs);
665 
670  void GetTransactionAncestry(const uint256& txid, size_t& ancestors, size_t& descendants) const;
671 
673  bool IsLoaded() const;
674 
676  void SetIsLoaded(bool loaded);
677 
678  unsigned long size() const
679  {
680  LOCK(cs);
681  return mapTx.size();
682  }
683 
684  uint64_t GetTotalTxSize() const
685  {
686  LOCK(cs);
687  return totalTxSize;
688  }
689 
690  bool exists(const uint256& hash) const
691  {
692  LOCK(cs);
693  return (mapTx.count(hash) != 0);
694  }
695 
696  CTransactionRef get(const uint256& hash) const;
697  TxMempoolInfo info(const uint256& hash) const;
698  std::vector<TxMempoolInfo> infoAll() const;
699 
700  size_t DynamicMemoryUsage() const;
701 
702  boost::signals2::signal<void (CTransactionRef)> NotifyEntryAdded;
703  boost::signals2::signal<void (CTransactionRef, MemPoolRemovalReason)> NotifyEntryRemoved;
704 
705 private:
719  void UpdateForDescendants(txiter updateIt,
720  cacheMap &cachedDescendants,
721  const std::set<uint256> &setExclude) EXCLUSIVE_LOCKS_REQUIRED(cs);
723  void UpdateAncestorsOf(bool add, txiter hash, setEntries &setAncestors) EXCLUSIVE_LOCKS_REQUIRED(cs);
725  void UpdateEntryForAncestors(txiter it, const setEntries &setAncestors) EXCLUSIVE_LOCKS_REQUIRED(cs);
729  void UpdateForRemoveFromMempool(const setEntries &entriesToRemove, bool updateDescendants) EXCLUSIVE_LOCKS_REQUIRED(cs);
731  void UpdateChildrenForRemoval(txiter entry) EXCLUSIVE_LOCKS_REQUIRED(cs);
732 
741  void removeUnchecked(txiter entry, MemPoolRemovalReason reason) EXCLUSIVE_LOCKS_REQUIRED(cs);
742 public:
762  class EpochGuard {
763  const CTxMemPool& pool;
764  public:
765  EpochGuard(const CTxMemPool& in);
766  ~EpochGuard();
767  };
768  // N.B. GetFreshEpoch modifies mutable state via the EpochGuard construction
769  // (and later destruction)
770  EpochGuard GetFreshEpoch() const EXCLUSIVE_LOCKS_REQUIRED(cs);
771 
780  bool visited(txiter it) const EXCLUSIVE_LOCKS_REQUIRED(cs) {
781  assert(m_has_epoch_guard);
782  bool ret = it->m_epoch >= m_epoch;
783  it->m_epoch = std::max(it->m_epoch, m_epoch);
784  return ret;
785  }
786 
788  assert(m_has_epoch_guard);
789  return !it || visited(*it);
790  }
791 };
792 
806 {
807 protected:
809 
810 public:
811  CCoinsViewMemPool(CCoinsView* baseIn, const CTxMemPool& mempoolIn);
812  bool GetCoin(const COutPoint &outpoint, Coin &coin) const override;
813 };
814 
830 // multi_index tag names
831 struct txid_index {};
832 struct insertion_order {};
833 
835  typedef boost::multi_index_container<
837  boost::multi_index::indexed_by<
838  // sorted by txid
839  boost::multi_index::hashed_unique<
840  boost::multi_index::tag<txid_index>,
843  >,
844  // sorted by order in the blockchain
845  boost::multi_index::sequenced<
846  boost::multi_index::tag<insertion_order>
847  >
848  >
850 
851  // It's almost certainly a logic bug if we don't clear out queuedTx before
852  // destruction, as we add to it while disconnecting blocks, and then we
853  // need to re-process remaining transactions to ensure mempool consistency.
854  // For now, assert() that we've emptied out this object on destruction.
855  // This assert() can always be removed if the reorg-processing code were
856  // to be refactored such that this assumption is no longer true (for
857  // instance if there was some other way we cleaned up the mempool after a
858  // reorg, besides draining this object).
859  ~DisconnectedBlockTransactions() { assert(queuedTx.empty()); }
860 
862  uint64_t cachedInnerUsage = 0;
863 
864  // Estimate the overhead of queuedTx to be 6 pointers + an allocation, as
865  // no exact formula for boost::multi_index_contained is implemented.
866  size_t DynamicMemoryUsage() const {
867  return memusage::MallocUsage(sizeof(CTransactionRef) + 6 * sizeof(void*)) * queuedTx.size() + cachedInnerUsage;
868  }
869 
870  void addTransaction(const CTransactionRef& tx)
871  {
872  queuedTx.insert(tx);
873  cachedInnerUsage += RecursiveDynamicUsage(tx);
874  }
875 
876  // Remove entries based on txid_index, and update memory usage.
877  void removeForBlock(const std::vector<CTransactionRef>& vtx)
878  {
879  // Short-circuit in the common case of a block being added to the tip
880  if (queuedTx.empty()) {
881  return;
882  }
883  for (auto const &tx : vtx) {
884  auto it = queuedTx.find(tx->GetHash());
885  if (it != queuedTx.end()) {
886  cachedInnerUsage -= RecursiveDynamicUsage(*it);
887  queuedTx.erase(it);
888  }
889  }
890  }
891 
892  // Remove an entry by insertion_order index, and update memory usage.
893  void removeEntry(indexed_disconnected_transactions::index<insertion_order>::type::iterator entry)
894  {
895  cachedInnerUsage -= RecursiveDynamicUsage(*entry);
896  queuedTx.get<insertion_order>().erase(entry);
897  }
898 
899  void clear()
900  {
901  cachedInnerUsage = 0;
902  queuedTx.clear();
903  }
904 };
905 
906 #endif // BITCOIN_TXMEMPOOL_H
std::shared_ptr< const CTransaction > CTransactionRef
Definition: transaction.h:408
CAmount GetModFeesWithAncestors() const
Definition: txmempool.h:128
size_t vTxHashesIdx
Index in mempool&#39;s vTxHashes.
Definition: txmempool.h:131
const bool spendsCoinbase
keep track of transactions that spend a coinbase
Definition: txmempool.h:74
uint64_t SipHashUint256(uint64_t k0, uint64_t k1, const uint256 &val)
Optimized SipHash-2-4 implementation for uint256.
Definition: siphash.cpp:94
Information about a mempool transaction.
Definition: txmempool.h:328
update_fee_delta(int64_t _feeDelta)
Definition: txmempool.h:169
const CTransactionRef tx
Definition: txmempool.h:68
uint64_t GetSizeWithAncestors() const
Definition: txmempool.h:127
bool m_has_epoch_guard
Definition: txmempool.h:458
CAmount nModFeesWithDescendants
... and total fees (all including us)
Definition: txmempool.h:84
void UpdateLockPoints(const LockPoints &lp)
Definition: txmempool.cpp:47
std::map< txiter, TxLinks, CompareIteratorByHash > txlinksMap
Definition: txmempool.h:545
uint64_t m_epoch
Definition: txmempool.h:457
indexed_transaction_set::nth_index< 0 >::type::const_iterator txiter
Definition: txmempool.h:524
RecursiveMutex cs_main
Mutex to guard access to validation specific variables, such as reading or changing the chainstate...
Definition: validation.cpp:106
A UTXO entry.
Definition: coins.h:30
size_t GetTxSize() const
Definition: txmempool.cpp:52
size_t GetTxWeight() const
Definition: txmempool.h:102
boost::signals2::signal< void(CTransactionRef)> NotifyEntryAdded
Definition: txmempool.h:702
static void pool cs
LockPoints()
Definition: txmempool.h:50
bool operator()(const CTxMemPoolEntry &a, const CTxMemPoolEntry &b) const
Definition: txmempool.h:268
int height
Definition: txmempool.h:43
Removed in size limiting.
const unsigned int entryHeight
Chain height when entering the mempool.
Definition: txmempool.h:73
CAmount GetModFeesWithDescendants() const
Definition: txmempool.h:122
int64_t feeDelta
Definition: txmempool.h:174
uint64_t GetTotalTxSize() const
Definition: txmempool.h:684
bool operator()(const txiter &a, const txiter &b) const
Definition: txmempool.h:528
uint64_t m_epoch
epoch when last touched, useful for graph algorithms
Definition: txmempool.h:132
uint64_t GetSizeWithDescendants() const
Definition: txmempool.h:121
std::set< txiter, CompareIteratorByHash > setEntries
Definition: txmempool.h:532
void addTransaction(const CTransactionRef &tx)
Definition: txmempool.h:870
size_t vsize
Virtual size of the transaction.
Definition: txmempool.h:340
MemPoolRemovalReason
Reason why a transaction was removed from the mempool, this is passed to the notification signal...
Definition: txmempool.h:349
const uint64_t k1
Definition: txmempool.h:362
bool operator()(const CTxMemPoolEntry &a, const CTxMemPoolEntry &b) const
Definition: txmempool.h:209
bool GetSpendsCoinbase() const
Definition: txmempool.h:124
std::atomic< unsigned int > nTransactionsUpdated
Used by getblocktemplate to trigger CreateNewBlock() invocation.
Definition: txmempool.h:448
const int64_t nTime
Local time when entering the mempool.
Definition: txmempool.h:72
void UpdateAncestorState(int64_t modifySize, CAmount modifyFee, int64_t modifyCount, int64_t modifySigOps)
Definition: txmempool.cpp:318
uint64_t nCountWithDescendants
number of descendant transactions
Definition: txmempool.h:82
int64_t lastRollingFeeUpdate
Definition: txmempool.h:454
int64_t nFeeDelta
The fee delta.
Definition: txmempool.h:343
update_descendant_state(int64_t _modifySize, CAmount _modifyFee, int64_t _modifyCount)
Definition: txmempool.h:138
pool TrimToSize(limit, &vNoSpendsRemaining)
CTransactionRef tx
The transaction itself.
Definition: txmempool.h:331
disconnectpool queuedTx clear()
CTxMemPoolEntry stores data about the corresponding transaction, as well as data about all in-mempool...
Definition: txmempool.h:65
void GetModFeeAndSize(const T &a, double &mod_fee, double &size) const
Definition: txmempool.h:301
boost::multi_index_container< CTransactionRef, boost::multi_index::indexed_by< boost::multi_index::hashed_unique< boost::multi_index::tag< txid_index >, mempoolentry_txid, SaltedTxidHasher >, boost::multi_index::sequenced< boost::multi_index::tag< insertion_order > > > > indexed_disconnected_transactions
Definition: txmempool.h:849
int64_t CAmount
Amount in satoshis (Can be negative)
Definition: amount.h:12
bool operator()(const T &a, const T &b) const
Definition: txmempool.h:282
bool blockSinceLastRollingFeeBump
Definition: txmempool.h:455
Removed for reorganization.
indexed_disconnected_transactions queuedTx
Definition: txmempool.h:861
static const uint32_t MEMPOOL_HEIGHT
Fake height value used in Coin to signify they are only in the memory pool (since 0...
Definition: txmempool.h:36
int64_t nSigOpCostWithAncestors
Definition: txmempool.h:90
const size_t nTxWeight
... and avoid recomputing tx weight (also used for GetTxSize())
Definition: txmempool.h:70
void UpdateFeeDelta(int64_t feeDelta)
Definition: txmempool.cpp:40
Definition: txmempool.h:278
uint64_t nSizeWithAncestors
Definition: txmempool.h:88
int64_t feeDelta
Used for determining the priority of the transaction for mining in a block.
Definition: txmempool.h:76
Abstract view on the open txout dataset.
Definition: coins.h:154
size_t DynamicMemoryUsage() const
Definition: txmempool.h:107
unsigned int GetHeight() const
Definition: txmempool.h:104
bool exists(const uint256 &hash) const
Definition: txmempool.h:690
void removeForBlock(const std::vector< CTransactionRef > &vtx)
Definition: txmempool.h:877
#define LOCK(cs)
Definition: sync.h:179
The BlockPolicyEstimator is used for estimating the feerate needed for a transaction to be included i...
Definition: fees.h:131
const uint256 & GetHash() const
Definition: transaction.h:322
const CAmount & GetFee() const
Definition: txmempool.h:100
Removed for conflict with in-block transaction.
DisconnectedBlockTransactions.
Definition: txmempool.h:831
CTransactionRef GetSharedTx() const
Definition: txmempool.h:99
Removed for block.
mempool UpdateTransactionsFromBlock(vHashUpdate)
uint64_t cachedInnerUsage
sum of dynamic memory usage of all the map elements (NOT the maps themselves)
Definition: txmempool.h:452
Sort an entry by max(score/size of entry&#39;s tx, score/size with all descendants).
Definition: txmempool.h:206
CAmount nModFeesWithAncestors
Definition: txmempool.h:89
Expired from mempool.
std::chrono::seconds GetTime() const
Definition: txmempool.h:103
An outpoint - a combination of a transaction hash and an index n into its vout.
Definition: transaction.h:18
uint64_t nSizeWithDescendants
... and size
Definition: txmempool.h:83
uint256 result_type
Definition: txmempool.h:190
uint64_t GetCountWithDescendants() const
Definition: txmempool.h:120
const size_t nUsageSize
... and total memory usage
Definition: txmempool.h:71
uint64_t totalTxSize
sum of all mempool tx&#39;s virtual sizes. Differs from serialized tx size since witness data is discount...
Definition: txmempool.h:451
static size_t MallocUsage(size_t alloc)
Compute the total memory used by allocating alloc bytes.
Definition: memusage.h:48
int64_t GetSigOpCostWithAncestors() const
Definition: txmempool.h:129
const int64_t sigOpCost
Total sigop cost.
Definition: txmempool.h:75
int flags
Definition: bitcoin-tx.cpp:508
bool visited(Optional< txiter > it) const EXCLUSIVE_LOCKS_REQUIRED(cs)
Definition: txmempool.h:787
uint64_t GetCountWithAncestors() const
Definition: txmempool.h:126
256-bit opaque blob.
Definition: uint256.h:120
#define EXCLUSIVE_LOCKS_REQUIRED(...)
Definition: threadsafety.h:51
CTxMemPool stores valid-according-to-the-current-best-chain transactions that may be included in the ...
Definition: txmempool.h:444
std::map< txiter, setEntries, CompareIteratorByHash > cacheMap
Definition: txmempool.h:538
The block chain is a tree shaped structure starting with the genesis block at the root...
Definition: chain.h:137
LockPoints lockPoints
Track the height and time at which tx was final.
Definition: txmempool.h:77
pool addUnchecked(CTxMemPoolEntry(tx, nFee, nTime, nHeight, spendsCoinbase, sigOpCost, lp))
void UpdateDescendantState(int64_t modifySize, CAmount modifyFee, int64_t modifyCount)
Definition: txmempool.cpp:309
const CTransaction & GetTx() const
Definition: txmempool.h:98
const LockPoints & lp
Definition: txmempool.h:184
update_ancestor_state(int64_t _modifySize, CAmount _modifyFee, int64_t _modifyCount, int64_t _modifySigOpsCost)
Definition: txmempool.h:153
int64_t GetModifiedFee() const
Definition: txmempool.h:106
unsigned int sigOpCost
boost::multi_index_container< CTxMemPoolEntry, boost::multi_index::indexed_by< boost::multi_index::hashed_unique< mempoolentry_txid, 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
Definition: txmempool.h:492
uint64_t nCountWithAncestors
Definition: txmempool.h:87
Fee rate in satoshis per kilobyte: CAmount / kB.
Definition: feerate.h:19
int64_t GetSigOpCost() const
Definition: txmempool.h:105
#define GUARDED_BY(x)
Definition: threadsafety.h:38
const CAmount nFee
Cached to avoid expensive parent-transaction lookups.
Definition: txmempool.h:69
bool spendsCoinbase
size_t operator()(const uint256 &txid) const
Definition: txmempool.h:367
CAmount fee
Fee of the transaction.
Definition: txmempool.h:337
static size_t RecursiveDynamicUsage(const CScript &script)
Definition: core_memusage.h:12
update_lock_points(const LockPoints &_lp)
Definition: txmempool.h:179
int64_t time
Definition: txmempool.h:44
boost::signals2::signal< void(CTransactionRef, MemPoolRemovalReason)> NotifyEntryRemoved
Definition: txmempool.h:703
size_t DynamicMemoryUsage() const
Definition: txmempool.h:866
The basic transaction that is broadcasted on the network and contained in blocks. ...
Definition: transaction.h:270
CCoinsView backed by another CCoinsView.
Definition: coins.h:191
boost::optional< T > Optional
Substitute for C++17 std::optional.
Definition: optional.h:14
const LockPoints & GetLockPoints() const
Definition: txmempool.h:108
CCoinsView that adds a memory cache for transactions to another CCoinsView.
Definition: coins.h:210
Sort by feerate of entry (fee/size) in descending order This is only used for transaction relay...
Definition: txmempool.h:251
const CTxMemPool & mempool
Definition: txmempool.h:808
auto it
Definition: validation.cpp:362
txlinksMap mapLinks
Definition: txmempool.h:546
Removed for replacement.
CBlockPolicyEstimator * minerPolicyEstimator
Definition: txmempool.h:449
std::chrono::seconds m_time
Time the transaction entered the mempool.
Definition: txmempool.h:334
CBlockIndex * maxInputBlock
Definition: txmempool.h:48
void GetModFeeAndSize(const CTxMemPoolEntry &a, double &mod_fee, double &size) const
Definition: txmempool.h:227
double rollingMinimumFeeRate
minimum fee to get into the pool, decreases exponentially
Definition: txmempool.h:456
CCoinsView that brings transactions from a mempool into view.
Definition: txmempool.h:805
EpochGuard: RAII-style guard for using epoch-based graph traversal algorithms.
Definition: txmempool.h:762
void removeEntry(indexed_disconnected_transactions::index< insertion_order >::type::iterator entry)
Definition: txmempool.h:893
int64_t modifySigOpsCost
Definition: txmempool.h:164
bool m_is_loaded GUARDED_BY(cs)
Definition: txmempool.h:462
bool operator()(const CTxMemPoolEntry &a, const CTxMemPoolEntry &b) const
Definition: txmempool.h:254
const CTxMemPool & pool
Definition: txmempool.h:763
RecursiveMutex cs
This mutex needs to be locked when accessing mapTx or other members that are guarded by it...
Definition: txmempool.h:521
Definition: txmempool.h:265
LockPoints lp