818 lines
28 KiB
C++
818 lines
28 KiB
C++
// Copyright (c) 2009-2010 Satoshi Nakamoto
|
|
// Copyright (c) 2009-2014 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or https://www.opensource.org/licenses/mit-license.php .
|
|
|
|
#include "txmempool.h"
|
|
|
|
#include "clientversion.h"
|
|
#include "consensus/consensus.h"
|
|
#include "consensus/validation.h"
|
|
#include "main.h"
|
|
#include "policy/fees.h"
|
|
#include "streams.h"
|
|
#include "timedata.h"
|
|
#include "util.h"
|
|
#include "utilmoneystr.h"
|
|
#include "validationinterface.h"
|
|
#include "version.h"
|
|
|
|
using namespace std;
|
|
|
|
CTxMemPoolEntry::CTxMemPoolEntry():
|
|
nFee(0), nTxSize(0), nModSize(0), nUsageSize(0), nTime(0), dPriority(0.0),
|
|
hadNoDependencies(false), spendsCoinbase(false)
|
|
{
|
|
nHeight = MEMPOOL_HEIGHT;
|
|
}
|
|
|
|
CTxMemPoolEntry::CTxMemPoolEntry(const CTransaction& _tx, const CAmount& _nFee,
|
|
int64_t _nTime, double _dPriority,
|
|
unsigned int _nHeight, bool poolHasNoInputsOf,
|
|
bool _spendsCoinbase, uint32_t _nBranchId):
|
|
tx(_tx), nFee(_nFee), nTime(_nTime), dPriority(_dPriority), nHeight(_nHeight),
|
|
hadNoDependencies(poolHasNoInputsOf),
|
|
spendsCoinbase(_spendsCoinbase), nBranchId(_nBranchId)
|
|
{
|
|
nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
|
|
nModSize = tx.CalculateModifiedSize(nTxSize);
|
|
nUsageSize = RecursiveDynamicUsage(tx);
|
|
feeRate = CFeeRate(nFee, nTxSize);
|
|
}
|
|
|
|
CTxMemPoolEntry::CTxMemPoolEntry(const CTxMemPoolEntry& other)
|
|
{
|
|
*this = other;
|
|
}
|
|
|
|
double
|
|
CTxMemPoolEntry::GetPriority(unsigned int currentHeight) const
|
|
{
|
|
CAmount nValueIn = tx.GetValueOut()+nFee;
|
|
double deltaPriority = ((double)(currentHeight-nHeight)*nValueIn)/nModSize;
|
|
double dResult = dPriority + deltaPriority;
|
|
return dResult;
|
|
}
|
|
|
|
CTxMemPool::CTxMemPool(const CFeeRate& _minRelayFee) :
|
|
nTransactionsUpdated(0)
|
|
{
|
|
// Sanity checks off by default for performance, because otherwise
|
|
// accepting transactions becomes O(N^2) where N is the number
|
|
// of transactions in the pool
|
|
nCheckFrequency = 0;
|
|
|
|
minerPolicyEstimator = new CBlockPolicyEstimator(_minRelayFee);
|
|
}
|
|
|
|
CTxMemPool::~CTxMemPool()
|
|
{
|
|
delete minerPolicyEstimator;
|
|
delete recentlyEvicted;
|
|
delete weightedTxTree;
|
|
}
|
|
|
|
void CTxMemPool::pruneSpent(const uint256 &hashTx, CCoins &coins)
|
|
{
|
|
LOCK(cs);
|
|
|
|
std::map<COutPoint, CInPoint>::iterator it = mapNextTx.lower_bound(COutPoint(hashTx, 0));
|
|
|
|
// iterate over all COutPoints in mapNextTx whose hash equals the provided hashTx
|
|
while (it != mapNextTx.end() && it->first.hash == hashTx) {
|
|
coins.Spend(it->first.n); // and remove those outputs from coins
|
|
it++;
|
|
}
|
|
}
|
|
|
|
unsigned int CTxMemPool::GetTransactionsUpdated() const
|
|
{
|
|
LOCK(cs);
|
|
return nTransactionsUpdated;
|
|
}
|
|
|
|
void CTxMemPool::AddTransactionsUpdated(unsigned int n)
|
|
{
|
|
LOCK(cs);
|
|
nTransactionsUpdated += n;
|
|
}
|
|
|
|
|
|
bool CTxMemPool::addUnchecked(const uint256& hash, const CTxMemPoolEntry &entry, bool fCurrentEstimate)
|
|
{
|
|
// Add to memory pool without checking anything.
|
|
// Used by main.cpp AcceptToMemoryPool(), which DOES do
|
|
// all the appropriate checks.
|
|
LOCK(cs);
|
|
weightedTxTree->add(WeightedTxInfo::from(entry.GetTx(), entry.GetFee()));
|
|
mapTx.insert(entry);
|
|
const CTransaction& tx = mapTx.find(hash)->GetTx();
|
|
mapRecentlyAddedTx[tx.GetHash()] = &tx;
|
|
nRecentlyAddedSequence += 1;
|
|
for (unsigned int i = 0; i < tx.vin.size(); i++)
|
|
mapNextTx[tx.vin[i].prevout] = CInPoint(&tx, i);
|
|
BOOST_FOREACH(const JSDescription &joinsplit, tx.vJoinSplit) {
|
|
BOOST_FOREACH(const uint256 &nf, joinsplit.nullifiers) {
|
|
mapSproutNullifiers[nf] = &tx;
|
|
}
|
|
}
|
|
for (const SpendDescription &spendDescription : tx.vShieldedSpend) {
|
|
mapSaplingNullifiers[spendDescription.nullifier] = &tx;
|
|
}
|
|
nTransactionsUpdated++;
|
|
totalTxSize += entry.GetTxSize();
|
|
cachedInnerUsage += entry.DynamicMemoryUsage();
|
|
minerPolicyEstimator->processTransaction(entry, fCurrentEstimate);
|
|
|
|
return true;
|
|
}
|
|
|
|
void CTxMemPool::addAddressIndex(const CTxMemPoolEntry &entry, const CCoinsViewCache &view)
|
|
{
|
|
LOCK(cs);
|
|
const CTransaction& tx = entry.GetTx();
|
|
std::vector<CMempoolAddressDeltaKey> inserted;
|
|
|
|
uint256 txhash = tx.GetHash();
|
|
for (unsigned int j = 0; j < tx.vin.size(); j++) {
|
|
const CTxIn input = tx.vin[j];
|
|
const CTxOut &prevout = view.GetOutputFor(input);
|
|
CScript::ScriptType type = prevout.scriptPubKey.GetType();
|
|
if (type == CScript::UNKNOWN)
|
|
continue;
|
|
CMempoolAddressDeltaKey key(type, prevout.scriptPubKey.AddressHash(), txhash, j, 1);
|
|
CMempoolAddressDelta delta(entry.GetTime(), prevout.nValue * -1, input.prevout.hash, input.prevout.n);
|
|
mapAddress.insert(make_pair(key, delta));
|
|
inserted.push_back(key);
|
|
}
|
|
|
|
for (unsigned int j = 0; j < tx.vout.size(); j++) {
|
|
const CTxOut &out = tx.vout[j];
|
|
CScript::ScriptType type = out.scriptPubKey.GetType();
|
|
if (type == CScript::UNKNOWN)
|
|
continue;
|
|
CMempoolAddressDeltaKey key(type, out.scriptPubKey.AddressHash(), txhash, j, 0);
|
|
mapAddress.insert(make_pair(key, CMempoolAddressDelta(entry.GetTime(), out.nValue)));
|
|
inserted.push_back(key);
|
|
}
|
|
|
|
mapAddressInserted.insert(make_pair(txhash, inserted));
|
|
}
|
|
|
|
// START insightexplorer
|
|
void CTxMemPool::getAddressIndex(
|
|
const std::vector<std::pair<uint160, int>>& addresses,
|
|
std::vector<std::pair<CMempoolAddressDeltaKey, CMempoolAddressDelta>>& results)
|
|
{
|
|
LOCK(cs);
|
|
for (const auto& it : addresses) {
|
|
auto ait = mapAddress.lower_bound(CMempoolAddressDeltaKey(it.second, it.first));
|
|
while (ait != mapAddress.end() && (*ait).first.addressBytes == it.first && (*ait).first.type == it.second) {
|
|
results.push_back(*ait);
|
|
ait++;
|
|
}
|
|
}
|
|
}
|
|
|
|
void CTxMemPool::removeAddressIndex(const uint256& txhash)
|
|
{
|
|
LOCK(cs);
|
|
auto it = mapAddressInserted.find(txhash);
|
|
|
|
if (it != mapAddressInserted.end()) {
|
|
std::vector<CMempoolAddressDeltaKey> keys = it->second;
|
|
for (const auto& mit : keys) {
|
|
mapAddress.erase(mit);
|
|
}
|
|
mapAddressInserted.erase(it);
|
|
}
|
|
}
|
|
|
|
void CTxMemPool::addSpentIndex(const CTxMemPoolEntry &entry, const CCoinsViewCache &view)
|
|
{
|
|
LOCK(cs);
|
|
const CTransaction& tx = entry.GetTx();
|
|
uint256 txhash = tx.GetHash();
|
|
std::vector<CSpentIndexKey> inserted;
|
|
|
|
for (unsigned int j = 0; j < tx.vin.size(); j++) {
|
|
const CTxIn input = tx.vin[j];
|
|
const CTxOut &prevout = view.GetOutputFor(input);
|
|
CSpentIndexKey key = CSpentIndexKey(input.prevout.hash, input.prevout.n);
|
|
CSpentIndexValue value = CSpentIndexValue(txhash, j, -1, prevout.nValue,
|
|
prevout.scriptPubKey.GetType(),
|
|
prevout.scriptPubKey.AddressHash());
|
|
mapSpent.insert(make_pair(key, value));
|
|
inserted.push_back(key);
|
|
}
|
|
mapSpentInserted.insert(make_pair(txhash, inserted));
|
|
}
|
|
|
|
bool CTxMemPool::getSpentIndex(const CSpentIndexKey &key, CSpentIndexValue &value)
|
|
{
|
|
LOCK(cs);
|
|
std::map<CSpentIndexKey, CSpentIndexValue, CSpentIndexKeyCompare>::iterator it = mapSpent.find(key);
|
|
if (it != mapSpent.end()) {
|
|
value = it->second;
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void CTxMemPool::removeSpentIndex(const uint256 txhash)
|
|
{
|
|
LOCK(cs);
|
|
auto it = mapSpentInserted.find(txhash);
|
|
|
|
if (it != mapSpentInserted.end()) {
|
|
std::vector<CSpentIndexKey> keys = (*it).second;
|
|
for (std::vector<CSpentIndexKey>::iterator mit = keys.begin(); mit != keys.end(); mit++) {
|
|
mapSpent.erase(*mit);
|
|
}
|
|
mapSpentInserted.erase(it);
|
|
}
|
|
}
|
|
// END insightexplorer
|
|
|
|
void CTxMemPool::remove(const CTransaction &origTx, std::list<CTransaction>& removed, bool fRecursive)
|
|
{
|
|
// Remove transaction from memory pool
|
|
{
|
|
LOCK(cs);
|
|
std::deque<uint256> txToRemove;
|
|
txToRemove.push_back(origTx.GetHash());
|
|
if (fRecursive && !mapTx.count(origTx.GetHash())) {
|
|
// If recursively removing but origTx isn't in the mempool
|
|
// be sure to remove any children that are in the pool. This can
|
|
// happen during chain re-orgs if origTx isn't re-accepted into
|
|
// the mempool for any reason.
|
|
for (unsigned int i = 0; i < origTx.vout.size(); i++) {
|
|
std::map<COutPoint, CInPoint>::iterator it = mapNextTx.find(COutPoint(origTx.GetHash(), i));
|
|
if (it == mapNextTx.end())
|
|
continue;
|
|
txToRemove.push_back(it->second.ptx->GetHash());
|
|
}
|
|
}
|
|
while (!txToRemove.empty())
|
|
{
|
|
uint256 hash = txToRemove.front();
|
|
txToRemove.pop_front();
|
|
if (!mapTx.count(hash))
|
|
continue;
|
|
const CTransaction& tx = mapTx.find(hash)->GetTx();
|
|
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())
|
|
continue;
|
|
txToRemove.push_back(it->second.ptx->GetHash());
|
|
}
|
|
}
|
|
mapRecentlyAddedTx.erase(hash);
|
|
BOOST_FOREACH(const CTxIn& txin, tx.vin)
|
|
mapNextTx.erase(txin.prevout);
|
|
BOOST_FOREACH(const JSDescription& joinsplit, tx.vJoinSplit) {
|
|
BOOST_FOREACH(const uint256& nf, joinsplit.nullifiers) {
|
|
mapSproutNullifiers.erase(nf);
|
|
}
|
|
}
|
|
for (const SpendDescription &spendDescription : tx.vShieldedSpend) {
|
|
mapSaplingNullifiers.erase(spendDescription.nullifier);
|
|
}
|
|
removed.push_back(tx);
|
|
totalTxSize -= mapTx.find(hash)->GetTxSize();
|
|
cachedInnerUsage -= mapTx.find(hash)->DynamicMemoryUsage();
|
|
mapTx.erase(hash);
|
|
nTransactionsUpdated++;
|
|
minerPolicyEstimator->removeTx(hash);
|
|
|
|
// insightexplorer
|
|
if (fAddressIndex)
|
|
removeAddressIndex(hash);
|
|
if (fSpentIndex)
|
|
removeSpentIndex(hash);
|
|
}
|
|
for (CTransaction tx : removed) {
|
|
weightedTxTree->remove(tx.GetHash());
|
|
}
|
|
}
|
|
}
|
|
|
|
void CTxMemPool::removeForReorg(const CCoinsViewCache *pcoins, unsigned int nMemPoolHeight, int flags)
|
|
{
|
|
// Remove transactions spending a coinbase which are now immature and no-longer-final transactions
|
|
LOCK(cs);
|
|
list<CTransaction> transactionsToRemove;
|
|
for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++) {
|
|
const CTransaction& tx = it->GetTx();
|
|
if (!CheckFinalTx(tx, flags)) {
|
|
transactionsToRemove.push_back(tx);
|
|
} else if (it->GetSpendsCoinbase()) {
|
|
BOOST_FOREACH(const CTxIn& txin, tx.vin) {
|
|
indexed_transaction_set::const_iterator it2 = mapTx.find(txin.prevout.hash);
|
|
if (it2 != mapTx.end())
|
|
continue;
|
|
const CCoins *coins = pcoins->AccessCoins(txin.prevout.hash);
|
|
if (nCheckFrequency != 0) assert(coins);
|
|
if (!coins || (coins->IsCoinBase() && ((signed long)nMemPoolHeight) - coins->nHeight < COINBASE_MATURITY)) {
|
|
transactionsToRemove.push_back(tx);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
BOOST_FOREACH(const CTransaction& tx, transactionsToRemove) {
|
|
list<CTransaction> removed;
|
|
remove(tx, removed, true);
|
|
}
|
|
}
|
|
|
|
|
|
void CTxMemPool::removeWithAnchor(const uint256 &invalidRoot, ShieldedType type)
|
|
{
|
|
// If a block is disconnected from the tip, and the root changed,
|
|
// we must invalidate transactions from the mempool which spend
|
|
// from that root -- almost as though they were spending coinbases
|
|
// which are no longer valid to spend due to coinbase maturity.
|
|
LOCK(cs);
|
|
list<CTransaction> transactionsToRemove;
|
|
|
|
for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++) {
|
|
const CTransaction& tx = it->GetTx();
|
|
switch (type) {
|
|
case SPROUT:
|
|
BOOST_FOREACH(const JSDescription& joinsplit, tx.vJoinSplit) {
|
|
if (joinsplit.anchor == invalidRoot) {
|
|
transactionsToRemove.push_back(tx);
|
|
break;
|
|
}
|
|
}
|
|
break;
|
|
case SAPLING:
|
|
BOOST_FOREACH(const SpendDescription& spendDescription, tx.vShieldedSpend) {
|
|
if (spendDescription.anchor == invalidRoot) {
|
|
transactionsToRemove.push_back(tx);
|
|
break;
|
|
}
|
|
}
|
|
break;
|
|
default:
|
|
throw runtime_error("Unknown shielded type");
|
|
break;
|
|
}
|
|
}
|
|
|
|
BOOST_FOREACH(const CTransaction& tx, transactionsToRemove) {
|
|
list<CTransaction> removed;
|
|
remove(tx, removed, true);
|
|
}
|
|
}
|
|
|
|
void CTxMemPool::removeConflicts(const CTransaction &tx, std::list<CTransaction>& removed)
|
|
{
|
|
// Remove transactions which depend on inputs of tx, recursively
|
|
list<CTransaction> result;
|
|
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, removed, true);
|
|
}
|
|
}
|
|
}
|
|
|
|
BOOST_FOREACH(const JSDescription &joinsplit, tx.vJoinSplit) {
|
|
BOOST_FOREACH(const uint256 &nf, joinsplit.nullifiers) {
|
|
std::map<uint256, const CTransaction*>::iterator it = mapSproutNullifiers.find(nf);
|
|
if (it != mapSproutNullifiers.end()) {
|
|
const CTransaction &txConflict = *it->second;
|
|
if (txConflict != tx) {
|
|
remove(txConflict, removed, true);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
for (const SpendDescription &spendDescription : tx.vShieldedSpend) {
|
|
std::map<uint256, const CTransaction*>::iterator it = mapSaplingNullifiers.find(spendDescription.nullifier);
|
|
if (it != mapSaplingNullifiers.end()) {
|
|
const CTransaction &txConflict = *it->second;
|
|
if (txConflict != tx) {
|
|
remove(txConflict, removed, true);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void CTxMemPool::removeExpired(unsigned int nBlockHeight)
|
|
{
|
|
// Remove expired txs from the mempool
|
|
LOCK(cs);
|
|
list<CTransaction> transactionsToRemove;
|
|
for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++)
|
|
{
|
|
const CTransaction& tx = it->GetTx();
|
|
if (IsExpiredTx(tx, nBlockHeight)) {
|
|
transactionsToRemove.push_back(tx);
|
|
}
|
|
}
|
|
for (const CTransaction& tx : transactionsToRemove) {
|
|
list<CTransaction> removed;
|
|
remove(tx, removed, true);
|
|
LogPrint("mempool", "Removing expired txid: %s\n", tx.GetHash().ToString());
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Called when a block is connected. Removes from mempool and updates the miner fee estimator.
|
|
*/
|
|
void CTxMemPool::removeForBlock(const std::vector<CTransaction>& vtx, unsigned int nBlockHeight,
|
|
std::list<CTransaction>& conflicts, bool fCurrentEstimate)
|
|
{
|
|
LOCK(cs);
|
|
std::vector<CTxMemPoolEntry> entries;
|
|
BOOST_FOREACH(const CTransaction& tx, vtx)
|
|
{
|
|
uint256 hash = tx.GetHash();
|
|
|
|
indexed_transaction_set::iterator i = mapTx.find(hash);
|
|
if (i != mapTx.end())
|
|
entries.push_back(*i);
|
|
}
|
|
BOOST_FOREACH(const CTransaction& tx, vtx)
|
|
{
|
|
std::list<CTransaction> dummy;
|
|
remove(tx, dummy, false);
|
|
removeConflicts(tx, conflicts);
|
|
ClearPrioritisation(tx.GetHash());
|
|
}
|
|
// After the txs in the new block have been removed from the mempool, update policy estimates
|
|
minerPolicyEstimator->processBlock(nBlockHeight, entries, fCurrentEstimate);
|
|
}
|
|
|
|
/**
|
|
* Called whenever the tip changes. Removes transactions which don't commit to
|
|
* the given branch ID from the mempool.
|
|
*/
|
|
void CTxMemPool::removeWithoutBranchId(uint32_t nMemPoolBranchId)
|
|
{
|
|
LOCK(cs);
|
|
std::list<CTransaction> transactionsToRemove;
|
|
|
|
for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++) {
|
|
const CTransaction& tx = it->GetTx();
|
|
if (it->GetValidatedBranchId() != nMemPoolBranchId) {
|
|
transactionsToRemove.push_back(tx);
|
|
}
|
|
}
|
|
|
|
for (const CTransaction& tx : transactionsToRemove) {
|
|
std::list<CTransaction> removed;
|
|
remove(tx, removed, true);
|
|
}
|
|
}
|
|
|
|
void CTxMemPool::clear()
|
|
{
|
|
LOCK(cs);
|
|
mapTx.clear();
|
|
mapNextTx.clear();
|
|
totalTxSize = 0;
|
|
cachedInnerUsage = 0;
|
|
++nTransactionsUpdated;
|
|
}
|
|
|
|
void CTxMemPool::check(const CCoinsViewCache *pcoins) const
|
|
{
|
|
if (nCheckFrequency == 0)
|
|
return;
|
|
|
|
if (insecure_rand() >= nCheckFrequency)
|
|
return;
|
|
|
|
LogPrint("mempool", "Checking mempool with %u transactions and %u inputs\n", (unsigned int)mapTx.size(), (unsigned int)mapNextTx.size());
|
|
|
|
uint64_t checkTotal = 0;
|
|
uint64_t innerUsage = 0;
|
|
|
|
CCoinsViewCache mempoolDuplicate(const_cast<CCoinsViewCache*>(pcoins));
|
|
const int64_t nSpendHeight = GetSpendHeight(mempoolDuplicate);
|
|
|
|
LOCK(cs);
|
|
list<const CTxMemPoolEntry*> waitingOnDependants;
|
|
for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++) {
|
|
unsigned int i = 0;
|
|
checkTotal += it->GetTxSize();
|
|
innerUsage += it->DynamicMemoryUsage();
|
|
const CTransaction& tx = it->GetTx();
|
|
bool fDependsWait = false;
|
|
BOOST_FOREACH(const CTxIn &txin, tx.vin) {
|
|
// Check that every mempool transaction's inputs refer to available coins, or other mempool tx's.
|
|
indexed_transaction_set::const_iterator it2 = mapTx.find(txin.prevout.hash);
|
|
if (it2 != mapTx.end()) {
|
|
const CTransaction& tx2 = it2->GetTx();
|
|
assert(tx2.vout.size() > txin.prevout.n && !tx2.vout[txin.prevout.n].IsNull());
|
|
fDependsWait = true;
|
|
} else {
|
|
const CCoins* coins = pcoins->AccessCoins(txin.prevout.hash);
|
|
assert(coins && coins->IsAvailable(txin.prevout.n));
|
|
}
|
|
// Check whether its inputs are marked in mapNextTx.
|
|
std::map<COutPoint, CInPoint>::const_iterator it3 = mapNextTx.find(txin.prevout);
|
|
assert(it3 != mapNextTx.end());
|
|
assert(it3->second.ptx == &tx);
|
|
assert(it3->second.n == i);
|
|
i++;
|
|
}
|
|
|
|
boost::unordered_map<uint256, SproutMerkleTree, CCoinsKeyHasher> intermediates;
|
|
|
|
BOOST_FOREACH(const JSDescription &joinsplit, tx.vJoinSplit) {
|
|
BOOST_FOREACH(const uint256 &nf, joinsplit.nullifiers) {
|
|
assert(!pcoins->GetNullifier(nf, SPROUT));
|
|
}
|
|
|
|
SproutMerkleTree tree;
|
|
auto it = intermediates.find(joinsplit.anchor);
|
|
if (it != intermediates.end()) {
|
|
tree = it->second;
|
|
} else {
|
|
assert(pcoins->GetSproutAnchorAt(joinsplit.anchor, tree));
|
|
}
|
|
|
|
BOOST_FOREACH(const uint256& commitment, joinsplit.commitments)
|
|
{
|
|
tree.append(commitment);
|
|
}
|
|
|
|
intermediates.insert(std::make_pair(tree.root(), tree));
|
|
}
|
|
for (const SpendDescription &spendDescription : tx.vShieldedSpend) {
|
|
SaplingMerkleTree tree;
|
|
|
|
assert(pcoins->GetSaplingAnchorAt(spendDescription.anchor, tree));
|
|
assert(!pcoins->GetNullifier(spendDescription.nullifier, SAPLING));
|
|
}
|
|
if (fDependsWait)
|
|
waitingOnDependants.push_back(&(*it));
|
|
else {
|
|
CValidationState state;
|
|
bool fCheckResult = tx.IsCoinBase() ||
|
|
Consensus::CheckTxInputs(tx, state, mempoolDuplicate, nSpendHeight, Params().GetConsensus());
|
|
assert(fCheckResult);
|
|
UpdateCoins(tx, mempoolDuplicate, 1000000);
|
|
}
|
|
}
|
|
unsigned int stepsSinceLastRemove = 0;
|
|
while (!waitingOnDependants.empty()) {
|
|
const CTxMemPoolEntry* entry = waitingOnDependants.front();
|
|
waitingOnDependants.pop_front();
|
|
CValidationState state;
|
|
if (!mempoolDuplicate.HaveInputs(entry->GetTx())) {
|
|
waitingOnDependants.push_back(entry);
|
|
stepsSinceLastRemove++;
|
|
assert(stepsSinceLastRemove < waitingOnDependants.size());
|
|
} else {
|
|
bool fCheckResult = entry->GetTx().IsCoinBase() ||
|
|
Consensus::CheckTxInputs(entry->GetTx(), state, mempoolDuplicate, nSpendHeight, Params().GetConsensus());
|
|
assert(fCheckResult);
|
|
UpdateCoins(entry->GetTx(), mempoolDuplicate, 1000000);
|
|
stepsSinceLastRemove = 0;
|
|
}
|
|
}
|
|
for (std::map<COutPoint, CInPoint>::const_iterator it = mapNextTx.begin(); it != mapNextTx.end(); it++) {
|
|
uint256 hash = it->second.ptx->GetHash();
|
|
indexed_transaction_set::const_iterator it2 = mapTx.find(hash);
|
|
const CTransaction& tx = it2->GetTx();
|
|
assert(it2 != mapTx.end());
|
|
assert(&tx == it->second.ptx);
|
|
assert(tx.vin.size() > it->second.n);
|
|
assert(it->first == it->second.ptx->vin[it->second.n].prevout);
|
|
}
|
|
|
|
checkNullifiers(SPROUT);
|
|
checkNullifiers(SAPLING);
|
|
|
|
assert(totalTxSize == checkTotal);
|
|
assert(innerUsage == cachedInnerUsage);
|
|
}
|
|
|
|
void CTxMemPool::checkNullifiers(ShieldedType type) const
|
|
{
|
|
const std::map<uint256, const CTransaction*>* mapToUse;
|
|
switch (type) {
|
|
case SPROUT:
|
|
mapToUse = &mapSproutNullifiers;
|
|
break;
|
|
case SAPLING:
|
|
mapToUse = &mapSaplingNullifiers;
|
|
break;
|
|
default:
|
|
throw runtime_error("Unknown nullifier type");
|
|
}
|
|
for (const auto& entry : *mapToUse) {
|
|
uint256 hash = entry.second->GetHash();
|
|
CTxMemPool::indexed_transaction_set::const_iterator findTx = mapTx.find(hash);
|
|
const CTransaction& tx = findTx->GetTx();
|
|
assert(findTx != mapTx.end());
|
|
assert(&tx == entry.second);
|
|
}
|
|
}
|
|
|
|
void CTxMemPool::queryHashes(vector<uint256>& vtxid)
|
|
{
|
|
vtxid.clear();
|
|
|
|
LOCK(cs);
|
|
vtxid.reserve(mapTx.size());
|
|
for (indexed_transaction_set::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
|
|
vtxid.push_back(mi->GetTx().GetHash());
|
|
}
|
|
|
|
bool CTxMemPool::lookup(uint256 hash, CTransaction& result) const
|
|
{
|
|
LOCK(cs);
|
|
indexed_transaction_set::const_iterator i = mapTx.find(hash);
|
|
if (i == mapTx.end()) return false;
|
|
result = i->GetTx();
|
|
return true;
|
|
}
|
|
|
|
CFeeRate CTxMemPool::estimateFee(int nBlocks) const
|
|
{
|
|
LOCK(cs);
|
|
return minerPolicyEstimator->estimateFee(nBlocks);
|
|
}
|
|
double CTxMemPool::estimatePriority(int nBlocks) const
|
|
{
|
|
LOCK(cs);
|
|
return minerPolicyEstimator->estimatePriority(nBlocks);
|
|
}
|
|
|
|
bool
|
|
CTxMemPool::WriteFeeEstimates(CAutoFile& fileout) const
|
|
{
|
|
try {
|
|
LOCK(cs);
|
|
fileout << 109900; // version required to read: 0.10.99 or later
|
|
fileout << CLIENT_VERSION; // version that wrote the file
|
|
minerPolicyEstimator->Write(fileout);
|
|
}
|
|
catch (const std::exception&) {
|
|
LogPrintf("CTxMemPool::WriteFeeEstimates(): unable to write policy estimator data (non-fatal)\n");
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
CTxMemPool::ReadFeeEstimates(CAutoFile& filein)
|
|
{
|
|
try {
|
|
int nVersionRequired, nVersionThatWrote;
|
|
filein >> nVersionRequired >> nVersionThatWrote;
|
|
if (nVersionRequired > CLIENT_VERSION)
|
|
return error("CTxMemPool::ReadFeeEstimates(): up-version (%d) fee estimate file", nVersionRequired);
|
|
|
|
LOCK(cs);
|
|
minerPolicyEstimator->Read(filein);
|
|
}
|
|
catch (const std::exception&) {
|
|
LogPrintf("CTxMemPool::ReadFeeEstimates(): unable to read policy estimator data (non-fatal)\n");
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
void CTxMemPool::PrioritiseTransaction(const uint256 hash, const string strHash, double dPriorityDelta, const CAmount& nFeeDelta)
|
|
{
|
|
{
|
|
LOCK(cs);
|
|
std::pair<double, CAmount> &deltas = mapDeltas[hash];
|
|
deltas.first += dPriorityDelta;
|
|
deltas.second += nFeeDelta;
|
|
}
|
|
LogPrintf("PrioritiseTransaction: %s priority += %f, fee += %d\n", strHash, dPriorityDelta, FormatMoney(nFeeDelta));
|
|
}
|
|
|
|
void CTxMemPool::ApplyDeltas(const uint256 hash, double &dPriorityDelta, CAmount &nFeeDelta)
|
|
{
|
|
LOCK(cs);
|
|
std::map<uint256, std::pair<double, CAmount> >::iterator pos = mapDeltas.find(hash);
|
|
if (pos == mapDeltas.end())
|
|
return;
|
|
const std::pair<double, CAmount> &deltas = pos->second;
|
|
dPriorityDelta += deltas.first;
|
|
nFeeDelta += deltas.second;
|
|
}
|
|
|
|
void CTxMemPool::ClearPrioritisation(const uint256 hash)
|
|
{
|
|
LOCK(cs);
|
|
mapDeltas.erase(hash);
|
|
}
|
|
|
|
bool CTxMemPool::HasNoInputsOf(const CTransaction &tx) const
|
|
{
|
|
for (unsigned int i = 0; i < tx.vin.size(); i++)
|
|
if (exists(tx.vin[i].prevout.hash))
|
|
return false;
|
|
return true;
|
|
}
|
|
|
|
bool CTxMemPool::nullifierExists(const uint256& nullifier, ShieldedType type) const
|
|
{
|
|
switch (type) {
|
|
case SPROUT:
|
|
return mapSproutNullifiers.count(nullifier);
|
|
case SAPLING:
|
|
return mapSaplingNullifiers.count(nullifier);
|
|
default:
|
|
throw runtime_error("Unknown nullifier type");
|
|
}
|
|
}
|
|
|
|
std::pair<std::vector<CTransaction>, uint64_t> CTxMemPool::DrainRecentlyAdded()
|
|
{
|
|
uint64_t recentlyAddedSequence;
|
|
std::vector<CTransaction> txs;
|
|
{
|
|
LOCK(cs);
|
|
recentlyAddedSequence = nRecentlyAddedSequence;
|
|
for (const auto& kv : mapRecentlyAddedTx) {
|
|
txs.push_back(*(kv.second));
|
|
}
|
|
mapRecentlyAddedTx.clear();
|
|
}
|
|
|
|
return std::make_pair(txs, recentlyAddedSequence);
|
|
}
|
|
|
|
void CTxMemPool::SetNotifiedSequence(uint64_t recentlyAddedSequence) {
|
|
assert(Params().NetworkIDString() == "regtest");
|
|
LOCK(cs);
|
|
nNotifiedSequence = recentlyAddedSequence;
|
|
}
|
|
|
|
bool CTxMemPool::IsFullyNotified() {
|
|
assert(Params().NetworkIDString() == "regtest");
|
|
LOCK(cs);
|
|
return nRecentlyAddedSequence == nNotifiedSequence;
|
|
}
|
|
|
|
CCoinsViewMemPool::CCoinsViewMemPool(CCoinsView *baseIn, CTxMemPool &mempoolIn) : CCoinsViewBacked(baseIn), mempool(mempoolIn) { }
|
|
|
|
bool CCoinsViewMemPool::GetNullifier(const uint256 &nf, ShieldedType type) const
|
|
{
|
|
return mempool.nullifierExists(nf, type) || base->GetNullifier(nf, type);
|
|
}
|
|
|
|
bool CCoinsViewMemPool::GetCoins(const uint256 &txid, CCoins &coins) const {
|
|
// If an entry in the mempool exists, always return that one, as it's guaranteed to never
|
|
// conflict with the underlying cache, and it cannot have pruned entries (as it contains full)
|
|
// transactions. First checking the underlying cache risks returning a pruned entry instead.
|
|
CTransaction tx;
|
|
if (mempool.lookup(txid, tx)) {
|
|
coins = CCoins(tx, MEMPOOL_HEIGHT);
|
|
return true;
|
|
}
|
|
return (base->GetCoins(txid, coins) && !coins.IsPruned());
|
|
}
|
|
|
|
bool CCoinsViewMemPool::HaveCoins(const uint256 &txid) const {
|
|
return mempool.exists(txid) || base->HaveCoins(txid);
|
|
}
|
|
|
|
size_t CTxMemPool::DynamicMemoryUsage() const {
|
|
LOCK(cs);
|
|
// Estimate the overhead of mapTx to be 6 pointers + an allocation, as no exact formula for boost::multi_index_contained is implemented.
|
|
return memusage::MallocUsage(sizeof(CTxMemPoolEntry) + 6 * sizeof(void*)) * mapTx.size() + memusage::DynamicUsage(mapNextTx) + memusage::DynamicUsage(mapDeltas) + cachedInnerUsage;
|
|
}
|
|
|
|
void CTxMemPool::SetMempoolCostLimit(int64_t totalCostLimit, int64_t evictionMemorySeconds) {
|
|
LOCK(cs);
|
|
LogPrint("mempool", "Setting mempool cost limit: (limit=%d, time=%d)\n", totalCostLimit, evictionMemorySeconds);
|
|
delete recentlyEvicted;
|
|
delete weightedTxTree;
|
|
recentlyEvicted = new RecentlyEvictedList(evictionMemorySeconds);
|
|
weightedTxTree = new WeightedTxTree(totalCostLimit);
|
|
}
|
|
|
|
bool CTxMemPool::IsRecentlyEvicted(const uint256& txId) {
|
|
LOCK(cs);
|
|
return recentlyEvicted->contains(txId);
|
|
}
|
|
|
|
void CTxMemPool::EnsureSizeLimit() {
|
|
AssertLockHeld(cs);
|
|
boost::optional<uint256> maybeDropTxId;
|
|
while ((maybeDropTxId = weightedTxTree->maybeDropRandom()).is_initialized()) {
|
|
uint256 txId = maybeDropTxId.get();
|
|
recentlyEvicted->add(txId);
|
|
std::list<CTransaction> removed;
|
|
remove(mapTx.find(txId)->GetTx(), removed, true);
|
|
}
|
|
}
|