@@ -3052,7 +3052,7 @@ void PeerManager::ProcessMessage(CNode& pfrom, const std::string& msg_type, CDat
3052
3052
auto it_by_prev = mapOrphanTransactionsByPrev.find (COutPoint (txid, i));
3053
3053
if (it_by_prev != mapOrphanTransactionsByPrev.end ()) {
3054
3054
for (const auto & elem : it_by_prev->second ) {
3055
- pfrom.orphan_work_set .insert (elem->first );
3055
+ pfrom.m_orphan_work_set .insert (elem->first );
3056
3056
}
3057
3057
}
3058
3058
}
@@ -3069,7 +3069,7 @@ void PeerManager::ProcessMessage(CNode& pfrom, const std::string& msg_type, CDat
3069
3069
}
3070
3070
3071
3071
// Recursively process any orphan transactions that depended on this one
3072
- ProcessOrphanTx (pfrom.orphan_work_set );
3072
+ ProcessOrphanTx (pfrom.m_orphan_work_set );
3073
3073
}
3074
3074
else if (state.GetResult () == TxValidationResult::TX_MISSING_INPUTS)
3075
3075
{
@@ -3868,9 +3868,9 @@ bool PeerManager::ProcessMessages(CNode* pfrom, std::atomic<bool>& interruptMsgP
3868
3868
if (!pfrom->vRecvGetData .empty ())
3869
3869
ProcessGetData (*pfrom, m_chainparams, m_connman, m_mempool, interruptMsgProc);
3870
3870
3871
- if (!pfrom->orphan_work_set .empty ()) {
3871
+ if (!pfrom->m_orphan_work_set .empty ()) {
3872
3872
LOCK2 (cs_main, g_cs_orphans);
3873
- ProcessOrphanTx (pfrom->orphan_work_set );
3873
+ ProcessOrphanTx (pfrom->m_orphan_work_set );
3874
3874
}
3875
3875
3876
3876
if (pfrom->fDisconnect )
@@ -3879,7 +3879,7 @@ bool PeerManager::ProcessMessages(CNode* pfrom, std::atomic<bool>& interruptMsgP
3879
3879
// this maintains the order of responses
3880
3880
// and prevents vRecvGetData to grow unbounded
3881
3881
if (!pfrom->vRecvGetData .empty ()) return true ;
3882
- if (!pfrom->orphan_work_set .empty ()) return true ;
3882
+ if (!pfrom->m_orphan_work_set .empty ()) return true ;
3883
3883
3884
3884
// Don't bother if send buffer is too full to respond anyway
3885
3885
if (pfrom->fPauseSend )
0 commit comments