mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-06-22 06:43:25 +02:00
scripted-diff: rename and de-globalise g_cs_orphans
-BEGIN VERIFY SCRIPT- sed -i -e 's/static RecursiveMutex/mutable Mutex/' src/txorphanage.h sed -i -e '/RecursiveMutex/d' src/txorphanage.cpp sed -i -e 's/g_cs_orphans/m_mutex/g' $(git grep -l g_cs_orphans src/) -END VERIFY SCRIPT-
This commit is contained in:
parent
733d85f79c
commit
7082ce3e88
@ -20,15 +20,15 @@ BOOST_FIXTURE_TEST_SUITE(orphanage_tests, TestingSetup)
|
|||||||
class TxOrphanageTest : public TxOrphanage
|
class TxOrphanageTest : public TxOrphanage
|
||||||
{
|
{
|
||||||
public:
|
public:
|
||||||
inline size_t CountOrphans() const EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans)
|
inline size_t CountOrphans() const EXCLUSIVE_LOCKS_REQUIRED(!m_mutex)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
return m_orphans.size();
|
return m_orphans.size();
|
||||||
}
|
}
|
||||||
|
|
||||||
CTransactionRef RandomOrphan() EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans)
|
CTransactionRef RandomOrphan() EXCLUSIVE_LOCKS_REQUIRED(!m_mutex)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
std::map<uint256, OrphanTx>::iterator it;
|
std::map<uint256, OrphanTx>::iterator it;
|
||||||
it = m_orphans.lower_bound(InsecureRand256());
|
it = m_orphans.lower_bound(InsecureRand256());
|
||||||
if (it == m_orphans.end())
|
if (it == m_orphans.end())
|
||||||
|
@ -15,11 +15,10 @@ static constexpr int64_t ORPHAN_TX_EXPIRE_TIME = 20 * 60;
|
|||||||
/** Minimum time between orphan transactions expire time checks in seconds */
|
/** Minimum time between orphan transactions expire time checks in seconds */
|
||||||
static constexpr int64_t ORPHAN_TX_EXPIRE_INTERVAL = 5 * 60;
|
static constexpr int64_t ORPHAN_TX_EXPIRE_INTERVAL = 5 * 60;
|
||||||
|
|
||||||
RecursiveMutex TxOrphanage::g_cs_orphans;
|
|
||||||
|
|
||||||
bool TxOrphanage::AddTx(const CTransactionRef& tx, NodeId peer)
|
bool TxOrphanage::AddTx(const CTransactionRef& tx, NodeId peer)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
|
|
||||||
const uint256& hash = tx->GetHash();
|
const uint256& hash = tx->GetHash();
|
||||||
if (m_orphans.count(hash))
|
if (m_orphans.count(hash))
|
||||||
@ -55,13 +54,13 @@ bool TxOrphanage::AddTx(const CTransactionRef& tx, NodeId peer)
|
|||||||
|
|
||||||
int TxOrphanage::EraseTx(const uint256& txid)
|
int TxOrphanage::EraseTx(const uint256& txid)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
return _EraseTx(txid);
|
return _EraseTx(txid);
|
||||||
}
|
}
|
||||||
|
|
||||||
int TxOrphanage::_EraseTx(const uint256& txid)
|
int TxOrphanage::_EraseTx(const uint256& txid)
|
||||||
{
|
{
|
||||||
AssertLockHeld(g_cs_orphans);
|
AssertLockHeld(m_mutex);
|
||||||
std::map<uint256, OrphanTx>::iterator it = m_orphans.find(txid);
|
std::map<uint256, OrphanTx>::iterator it = m_orphans.find(txid);
|
||||||
if (it == m_orphans.end())
|
if (it == m_orphans.end())
|
||||||
return 0;
|
return 0;
|
||||||
@ -93,7 +92,7 @@ int TxOrphanage::_EraseTx(const uint256& txid)
|
|||||||
|
|
||||||
void TxOrphanage::EraseForPeer(NodeId peer)
|
void TxOrphanage::EraseForPeer(NodeId peer)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
|
|
||||||
m_peer_work_set.erase(peer);
|
m_peer_work_set.erase(peer);
|
||||||
|
|
||||||
@ -112,7 +111,7 @@ void TxOrphanage::EraseForPeer(NodeId peer)
|
|||||||
|
|
||||||
void TxOrphanage::LimitOrphans(unsigned int max_orphans)
|
void TxOrphanage::LimitOrphans(unsigned int max_orphans)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
|
|
||||||
unsigned int nEvicted = 0;
|
unsigned int nEvicted = 0;
|
||||||
static int64_t nNextSweep;
|
static int64_t nNextSweep;
|
||||||
@ -148,7 +147,7 @@ void TxOrphanage::LimitOrphans(unsigned int max_orphans)
|
|||||||
|
|
||||||
void TxOrphanage::AddChildrenToWorkSet(const CTransaction& tx, NodeId peer)
|
void TxOrphanage::AddChildrenToWorkSet(const CTransaction& tx, NodeId peer)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
|
|
||||||
// Get this peer's work set, emplacing an empty set it didn't exist
|
// Get this peer's work set, emplacing an empty set it didn't exist
|
||||||
std::set<uint256>& orphan_work_set = m_peer_work_set.try_emplace(peer).first->second;
|
std::set<uint256>& orphan_work_set = m_peer_work_set.try_emplace(peer).first->second;
|
||||||
@ -165,7 +164,7 @@ void TxOrphanage::AddChildrenToWorkSet(const CTransaction& tx, NodeId peer)
|
|||||||
|
|
||||||
bool TxOrphanage::HaveTx(const GenTxid& gtxid) const
|
bool TxOrphanage::HaveTx(const GenTxid& gtxid) const
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
if (gtxid.IsWtxid()) {
|
if (gtxid.IsWtxid()) {
|
||||||
return m_wtxid_to_orphan_it.count(gtxid.GetHash());
|
return m_wtxid_to_orphan_it.count(gtxid.GetHash());
|
||||||
} else {
|
} else {
|
||||||
@ -175,7 +174,7 @@ bool TxOrphanage::HaveTx(const GenTxid& gtxid) const
|
|||||||
|
|
||||||
CTransactionRef TxOrphanage::GetTxToReconsider(NodeId peer, NodeId& originator, bool& more)
|
CTransactionRef TxOrphanage::GetTxToReconsider(NodeId peer, NodeId& originator, bool& more)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
|
|
||||||
auto work_set_it = m_peer_work_set.find(peer);
|
auto work_set_it = m_peer_work_set.find(peer);
|
||||||
if (work_set_it != m_peer_work_set.end()) {
|
if (work_set_it != m_peer_work_set.end()) {
|
||||||
@ -198,7 +197,7 @@ CTransactionRef TxOrphanage::GetTxToReconsider(NodeId peer, NodeId& originator,
|
|||||||
|
|
||||||
void TxOrphanage::EraseForBlock(const CBlock& block)
|
void TxOrphanage::EraseForBlock(const CBlock& block)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
|
|
||||||
std::vector<uint256> vOrphanErase;
|
std::vector<uint256> vOrphanErase;
|
||||||
|
|
||||||
|
@ -21,10 +21,10 @@
|
|||||||
class TxOrphanage {
|
class TxOrphanage {
|
||||||
public:
|
public:
|
||||||
/** Add a new orphan transaction */
|
/** Add a new orphan transaction */
|
||||||
bool AddTx(const CTransactionRef& tx, NodeId peer) EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans);
|
bool AddTx(const CTransactionRef& tx, NodeId peer) EXCLUSIVE_LOCKS_REQUIRED(!m_mutex);
|
||||||
|
|
||||||
/** Check if we already have an orphan transaction (by txid or wtxid) */
|
/** Check if we already have an orphan transaction (by txid or wtxid) */
|
||||||
bool HaveTx(const GenTxid& gtxid) const EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans);
|
bool HaveTx(const GenTxid& gtxid) const EXCLUSIVE_LOCKS_REQUIRED(!m_mutex);
|
||||||
|
|
||||||
/** Extract a transaction from a peer's work set
|
/** Extract a transaction from a peer's work set
|
||||||
* Returns nullptr and sets more to false if there are no transactions
|
* Returns nullptr and sets more to false if there are no transactions
|
||||||
@ -33,33 +33,33 @@ public:
|
|||||||
* the originating peer, and whether there are more orphans for this peer
|
* the originating peer, and whether there are more orphans for this peer
|
||||||
* to work on after this tx.
|
* to work on after this tx.
|
||||||
*/
|
*/
|
||||||
CTransactionRef GetTxToReconsider(NodeId peer, NodeId& originator, bool& more) EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans);
|
CTransactionRef GetTxToReconsider(NodeId peer, NodeId& originator, bool& more) EXCLUSIVE_LOCKS_REQUIRED(!m_mutex);
|
||||||
|
|
||||||
/** Erase an orphan by txid */
|
/** Erase an orphan by txid */
|
||||||
int EraseTx(const uint256& txid) EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans);
|
int EraseTx(const uint256& txid) EXCLUSIVE_LOCKS_REQUIRED(!m_mutex);
|
||||||
|
|
||||||
/** Erase all orphans announced by a peer (eg, after that peer disconnects) */
|
/** Erase all orphans announced by a peer (eg, after that peer disconnects) */
|
||||||
void EraseForPeer(NodeId peer) EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans);
|
void EraseForPeer(NodeId peer) EXCLUSIVE_LOCKS_REQUIRED(!m_mutex);
|
||||||
|
|
||||||
/** Erase all orphans included in or invalidated by a new block */
|
/** Erase all orphans included in or invalidated by a new block */
|
||||||
void EraseForBlock(const CBlock& block) EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans);
|
void EraseForBlock(const CBlock& block) EXCLUSIVE_LOCKS_REQUIRED(!m_mutex);
|
||||||
|
|
||||||
/** Limit the orphanage to the given maximum */
|
/** Limit the orphanage to the given maximum */
|
||||||
void LimitOrphans(unsigned int max_orphans) EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans);
|
void LimitOrphans(unsigned int max_orphans) EXCLUSIVE_LOCKS_REQUIRED(!m_mutex);
|
||||||
|
|
||||||
/** Add any orphans that list a particular tx as a parent into a peer's work set */
|
/** Add any orphans that list a particular tx as a parent into a peer's work set */
|
||||||
void AddChildrenToWorkSet(const CTransaction& tx, NodeId peer) EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans);
|
void AddChildrenToWorkSet(const CTransaction& tx, NodeId peer) EXCLUSIVE_LOCKS_REQUIRED(!m_mutex);
|
||||||
|
|
||||||
/** Return how many entries exist in the orphange */
|
/** Return how many entries exist in the orphange */
|
||||||
size_t Size() EXCLUSIVE_LOCKS_REQUIRED(!g_cs_orphans)
|
size_t Size() EXCLUSIVE_LOCKS_REQUIRED(!m_mutex)
|
||||||
{
|
{
|
||||||
LOCK(g_cs_orphans);
|
LOCK(m_mutex);
|
||||||
return m_orphans.size();
|
return m_orphans.size();
|
||||||
}
|
}
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
/** Guards orphan transactions */
|
/** Guards orphan transactions */
|
||||||
static RecursiveMutex g_cs_orphans;
|
mutable Mutex m_mutex;
|
||||||
|
|
||||||
struct OrphanTx {
|
struct OrphanTx {
|
||||||
CTransactionRef tx;
|
CTransactionRef tx;
|
||||||
@ -70,10 +70,10 @@ protected:
|
|||||||
|
|
||||||
/** Map from txid to orphan transaction record. Limited by
|
/** Map from txid to orphan transaction record. Limited by
|
||||||
* -maxorphantx/DEFAULT_MAX_ORPHAN_TRANSACTIONS */
|
* -maxorphantx/DEFAULT_MAX_ORPHAN_TRANSACTIONS */
|
||||||
std::map<uint256, OrphanTx> m_orphans GUARDED_BY(g_cs_orphans);
|
std::map<uint256, OrphanTx> m_orphans GUARDED_BY(m_mutex);
|
||||||
|
|
||||||
/** Which peer provided a parent tx of orphans that need to be reconsidered */
|
/** Which peer provided a parent tx of orphans that need to be reconsidered */
|
||||||
std::map<NodeId, std::set<uint256>> m_peer_work_set GUARDED_BY(g_cs_orphans);
|
std::map<NodeId, std::set<uint256>> m_peer_work_set GUARDED_BY(m_mutex);
|
||||||
|
|
||||||
using OrphanMap = decltype(m_orphans);
|
using OrphanMap = decltype(m_orphans);
|
||||||
|
|
||||||
@ -88,17 +88,17 @@ protected:
|
|||||||
|
|
||||||
/** Index from the parents' COutPoint into the m_orphans. Used
|
/** Index from the parents' COutPoint into the m_orphans. Used
|
||||||
* to remove orphan transactions from the m_orphans */
|
* to remove orphan transactions from the m_orphans */
|
||||||
std::map<COutPoint, std::set<OrphanMap::iterator, IteratorComparator>> m_outpoint_to_orphan_it GUARDED_BY(g_cs_orphans);
|
std::map<COutPoint, std::set<OrphanMap::iterator, IteratorComparator>> m_outpoint_to_orphan_it GUARDED_BY(m_mutex);
|
||||||
|
|
||||||
/** Orphan transactions in vector for quick random eviction */
|
/** Orphan transactions in vector for quick random eviction */
|
||||||
std::vector<OrphanMap::iterator> m_orphan_list GUARDED_BY(g_cs_orphans);
|
std::vector<OrphanMap::iterator> m_orphan_list GUARDED_BY(m_mutex);
|
||||||
|
|
||||||
/** Index from wtxid into the m_orphans to lookup orphan
|
/** Index from wtxid into the m_orphans to lookup orphan
|
||||||
* transactions using their witness ids. */
|
* transactions using their witness ids. */
|
||||||
std::map<uint256, OrphanMap::iterator> m_wtxid_to_orphan_it GUARDED_BY(g_cs_orphans);
|
std::map<uint256, OrphanMap::iterator> m_wtxid_to_orphan_it GUARDED_BY(m_mutex);
|
||||||
|
|
||||||
/** Erase an orphan by txid */
|
/** Erase an orphan by txid */
|
||||||
int _EraseTx(const uint256& txid) EXCLUSIVE_LOCKS_REQUIRED(g_cs_orphans);
|
int _EraseTx(const uint256& txid) EXCLUSIVE_LOCKS_REQUIRED(m_mutex);
|
||||||
};
|
};
|
||||||
|
|
||||||
#endif // BITCOIN_TXORPHANAGE_H
|
#endif // BITCOIN_TXORPHANAGE_H
|
||||||
|
Loading…
x
Reference in New Issue
Block a user