highperfocused/bitcoin
1
0
Fork 0
mirror of https://github.com/bitcoin/bitcoin.git synced 2025-06-19 13:22:02 +02:00
Code Issues Packages Projects Releases Wiki Activity

mempool: Calculate descendant maximum thoroughly

Browse Source
This commit is contained in:
Karl-Johan Alm 2018-05-23 09:13:43 +09:00
parent 6d3568371e
commit a08d76bcfe
No known key found for this signature in database
GPG Key ID: 57AF762DB3353322
1 changed files with 18 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
src/txmempool.cpp
View File

@ -1056,14 +1056,25 @@ void CTxMemPool::TrimToSize(size_t sizelimit, std::vector<COutPoint>* pvNoSpends
} }
uint64_t CTxMemPool::CalculateDescendantMaximum(txiter entry) const { uint64_t CTxMemPool::CalculateDescendantMaximum(txiter entry) const {
// find top parent // find parent with highest descendant count
txiter top = entry; std::vector<txiter> candidates;
for (;;) { setEntries counted;
const setEntries& parents = GetMemPoolParents(top); candidates.push_back(entry);
if (parents.size() == 0) break; uint64_t maximum = 0;
top = *parents.begin(); while (candidates.size()) {
txiter candidate = candidates.back();
candidates.pop_back();
if (!counted.insert(candidate).second) continue;
const setEntries& parents = GetMemPoolParents(candidate);
if (parents.size() == 0) {
maximum = std::max(maximum, candidate->GetCountWithDescendants());
} else {
for (txiter i : parents) {
candidates.push_back(i);
} }
return top->GetCountWithDescendants(); }
}
return maximum;
} }
void CTxMemPool::GetTransactionAncestry(const uint256& txid, size_t& ancestors, size_t& descendants) const { void CTxMemPool::GetTransactionAncestry(const uint256& txid, size_t& ancestors, size_t& descendants) const {