txorphanage.h

Go to the documentation of this file.

// Copyright (c) 2021-2022 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
 
#ifndef BITCOIN_TXORPHANAGE_H
#define BITCOIN_TXORPHANAGE_H
 
#include <net.h>
#include <primitives/block.h>
#include <primitives/transaction.h>
#include <sync.h>
#include <util/time.h>
 
#include <map>
#include <set>
 
class TxOrphanage {
public:
    bool AddTx(const CTransactionRef& tx, NodeId peer);
 
    bool HaveTx(const Wtxid& wtxid) const;
 
    CTransactionRef GetTxToReconsider(NodeId peer);
 
    int EraseTx(const Wtxid& wtxid);
 
    void EraseForPeer(NodeId peer);
 
    void EraseForBlock(const CBlock& block);
 
    void LimitOrphans(unsigned int max_orphans, FastRandomContext& rng);
 
    void AddChildrenToWorkSet(const CTransaction& tx);
 
    bool HaveTxToReconsider(NodeId peer);
 
    std::vector<CTransactionRef> GetChildrenFromSamePeer(const CTransactionRef& parent, NodeId nodeid) const;
 
    std::vector<std::pair<CTransactionRef, NodeId>> GetChildrenFromDifferentPeer(const CTransactionRef& parent, NodeId nodeid) const;
 
    size_t Size()
    {
        return m_orphans.size();
    }
 
protected:
    struct OrphanTx {
        CTransactionRef tx;
        NodeId fromPeer;
        NodeSeconds nTimeExpire;
        size_t list_pos;
    };
 
    std::map<Wtxid, OrphanTx> m_orphans;
 
    std::map<NodeId, std::set<Wtxid>> m_peer_work_set;
 
    using OrphanMap = decltype(m_orphans);
 
    struct IteratorComparator
    {
        template<typename I>
        bool operator()(const I& a, const I& b) const
        {
            return a->first < b->first;
        }
    };
 
    std::map<COutPoint, std::set<OrphanMap::iterator, IteratorComparator>> m_outpoint_to_orphan_it;
 
    std::vector<OrphanMap::iterator> m_orphan_list;
 
    NodeSeconds m_next_sweep{0s};
};
 
#endif // BITCOIN_TXORPHANAGE_H