aboutsummaryrefslogtreecommitdiff
path: root/src/cryptonote_core/tx_pool.cpp
diff options
context:
space:
mode:
authorRiccardo Spagni <ric@spagni.net>2015-05-13 11:18:22 +0200
committerRiccardo Spagni <ric@spagni.net>2015-05-13 11:18:22 +0200
commit012164fff8fa43a83ae0a61fbc98e7935f63f552 (patch)
tree257c042c6de95e4ffe3bc11c71f43b25e1ff4b8c /src/cryptonote_core/tx_pool.cpp
parentMerge pull request #274 (diff)
parentSort txs by per-kb-fee for miners (diff)
downloadmonero-012164fff8fa43a83ae0a61fbc98e7935f63f552.tar.xz
resolved merge conflict in tx_pool.cpp
Diffstat (limited to 'src/cryptonote_core/tx_pool.cpp')
-rw-r--r--src/cryptonote_core/tx_pool.cpp45
1 files changed, 33 insertions, 12 deletions
diff --git a/src/cryptonote_core/tx_pool.cpp b/src/cryptonote_core/tx_pool.cpp
index 5543ac64f..781d1af5c 100644
--- a/src/cryptonote_core/tx_pool.cpp
+++ b/src/cryptonote_core/tx_pool.cpp
@@ -186,6 +186,8 @@ namespace cryptonote
}
tvc.m_verifivation_failed = false;
+
+ m_txs_by_fee.emplace(id, (double)blob_size / fee);
//succeed
return true;
}
@@ -232,11 +234,16 @@ namespace cryptonote
if(it == m_transactions.end())
return false;
+ auto sorted_it = m_txs_by_fee.find(id);
+ if (sorted_it == m_txs_by_fee.end())
+ return false;
+
tx = it->second.tx;
blob_size = it->second.blob_size;
fee = it->second.fee;
remove_transaction_keyimages(it->second.tx);
m_transactions.erase(it);
+ m_txs_by_fee.erase(sorted_it);
return true;
}
//---------------------------------------------------------------------------------
@@ -258,7 +265,9 @@ namespace cryptonote
{
LOG_PRINT_L1("Tx " << it->first << " removed from tx pool due to outdated, age: " << tx_age );
remove_transaction_keyimages(it->second.tx);
+ auto sorted_it = m_txs_by_fee.find(it->first);
m_transactions.erase(it++);
+ m_txs_by_fee.erase(sorted_it);
}else
++it;
}
@@ -470,10 +479,13 @@ namespace cryptonote
size_t max_total_size = (130 * median_size) / 100 - CRYPTONOTE_COINBASE_BLOB_RESERVED_SIZE;
std::unordered_set<crypto::key_image> k_images;
- BOOST_FOREACH(transactions_container::value_type& tx, m_transactions)
+ m_txs_by_fee::const_iterator sorted_it = m_txs_by_fee.begin();
+ while (sorted_it != m_txs_by_fee.end())
{
+ m_transactions::const_iterator tx_it = m_transactions.find(sorted_it->first);
+
// Can not exceed maximum block size
- if (max_total_size < total_size + tx.second.blob_size)
+ if (max_total_size < total_size + tx_it->second->blob_size)
continue;
// If adding this tx will make the block size
@@ -481,7 +493,7 @@ namespace cryptonote
// _BLOCK_SIZE bytes, reject the tx; this will
// keep block sizes from becoming too unwieldly
// to propagate at 60s block times.
- if ( (total_size + tx.second.blob_size) > CRYPTONOTE_GETBLOCKTEMPLATE_MAX_BLOCK_SIZE )
+ if ( (total_size + tx_it->second.blob_size) > CRYPTONOTE_GETBLOCKTEMPLATE_MAX_BLOCK_SIZE )
continue;
// If we've exceeded the penalty free size,
@@ -495,10 +507,11 @@ namespace cryptonote
if (!is_transaction_ready_to_go(tx.second) || have_key_images(k_images, tx.second.tx))
continue;
- bl.tx_hashes.push_back(tx.first);
- total_size += tx.second.blob_size;
- fee += tx.second.fee;
- append_key_images(k_images, tx.second.tx);
+ bl.tx_hashes.push_back(tx_it->first);
+ total_size += tx_it->second.blob_size;
+ fee += tx_it->second.fee;
+ append_key_images(k_images, tx_it->second.tx);
+ sorted_it++;
}
return true;
@@ -523,12 +536,20 @@ namespace cryptonote
}
for (auto it = m_transactions.begin(); it != m_transactions.end(); ) {
- auto it2 = it++;
- if (it2->second.blob_size >= TRANSACTION_SIZE_LIMIT) {
- LOG_PRINT_L1("Transaction " << get_transaction_hash(it2->second.tx) << " is too big (" << it2->second.blob_size << " bytes), removing it from pool");
- remove_transaction_keyimages(it2->second.tx);
- m_transactions.erase(it2);
+ if (it->second.blob_size >= TRANSACTION_SIZE_LIMIT) {
+ LOG_PRINT_L1("Transaction " << get_transaction_hash(it->second.tx) << " is too big (" << it->second.blob_size << " bytes), removing it from pool");
+ remove_transaction_keyimages(it->second.tx);
+ auto sorted_it = m_txs_by_fee.find(it->first);
+ m_txs_by_fee.erase(sorted_it);
+ m_transactions.erase(it);
}
+ it++;
+ }
+
+ // no need to store queue of sorted transactions, as it's easy to generate.
+ for (const auto& tx : m_transactions)
+ {
+ m_txs_by_fee.emplace(tx.first, (double)tx.second.blob_size / tx.second.fee);
}
// Ignore deserialization error