|
|
|
@ -818,7 +818,7 @@ bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
@@ -818,7 +818,7 @@ bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
bool CTxMemPool::remove(CTransaction &tx) |
|
|
|
|
bool CTxMemPool::remove(const CTransaction &tx, bool fRecursive) |
|
|
|
|
{ |
|
|
|
|
// Remove transaction from memory pool
|
|
|
|
|
{ |
|
|
|
@ -826,6 +826,13 @@ bool CTxMemPool::remove(CTransaction &tx)
@@ -826,6 +826,13 @@ bool CTxMemPool::remove(CTransaction &tx)
|
|
|
|
|
uint256 hash = tx.GetHash(); |
|
|
|
|
if (mapTx.count(hash)) |
|
|
|
|
{ |
|
|
|
|
if (fRecursive) { |
|
|
|
|
for (unsigned int i = 0; i < tx.vout.size(); i++) { |
|
|
|
|
std::map<COutPoint, CInPoint>::iterator it = mapNextTx.find(COutPoint(hash, i)); |
|
|
|
|
if (it != mapNextTx.end()) |
|
|
|
|
remove(*it->second.ptx, true); |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
BOOST_FOREACH(const CTxIn& txin, tx.vin) |
|
|
|
|
mapNextTx.erase(txin.prevout); |
|
|
|
|
mapTx.erase(hash); |
|
|
|
@ -835,6 +842,21 @@ bool CTxMemPool::remove(CTransaction &tx)
@@ -835,6 +842,21 @@ bool CTxMemPool::remove(CTransaction &tx)
|
|
|
|
|
return true; |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
bool CTxMemPool::removeConflicts(const CTransaction &tx) |
|
|
|
|
{ |
|
|
|
|
// Remove transactions which depend on inputs of tx, recursively
|
|
|
|
|
LOCK(cs); |
|
|
|
|
BOOST_FOREACH(const CTxIn &txin, tx.vin) { |
|
|
|
|
std::map<COutPoint, CInPoint>::iterator it = mapNextTx.find(txin.prevout); |
|
|
|
|
if (it != mapNextTx.end()) { |
|
|
|
|
const CTransaction &txConflict = *it->second.ptx; |
|
|
|
|
if (txConflict != tx) |
|
|
|
|
remove(txConflict, true); |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
return true; |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
void CTxMemPool::clear() |
|
|
|
|
{ |
|
|
|
|
LOCK(cs); |
|
|
|
@ -1757,8 +1779,10 @@ bool SetBestChain(CBlockIndex* pindexNew)
@@ -1757,8 +1779,10 @@ bool SetBestChain(CBlockIndex* pindexNew)
|
|
|
|
|
tx.AcceptToMemoryPool(false); |
|
|
|
|
|
|
|
|
|
// Delete redundant memory transactions that are in the connected branch
|
|
|
|
|
BOOST_FOREACH(CTransaction& tx, vDelete) |
|
|
|
|
BOOST_FOREACH(CTransaction& tx, vDelete) { |
|
|
|
|
mempool.remove(tx); |
|
|
|
|
mempool.removeConflicts(tx); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// Update best block in wallet (so we can detect restored wallets)
|
|
|
|
|
if (!fIsInitialDownload) |
|
|
|
|