Page MenuHomePhabricator
Differential D1581 Diff 4481 src/test/mempool_tests.cpp

Changeset View

Standalone View

View Options

src/test/mempool_tests.cpp

Show First 20 Lines • Show All 317 Lines • ▼ Show 20 LinesBOOST_AUTO_TEST_CASE(MempoolIndexingTest) {
* tx10 = 200k (1 tx) * tx10 = 200k (1 tx)
* tx6 = 2.2M (5 txs) * tx6 = 2.2M (5 txs)
* tx7 = 2.2M (4 txs) * tx7 = 2.2M (4 txs)
*/ */
// take out tx9, tx8 from the beginning // take out tx9, tx8 from the beginning
sortedOrder.erase(sortedOrder.begin(), sortedOrder.begin() + 2); sortedOrder.erase(sortedOrder.begin(), sortedOrder.begin() + 2);
sortedOrder.insert(sortedOrder.begin() + 5, tx9.GetId().ToString()); sortedOrder.insert(sortedOrder.begin() + 5, tx9.GetId().ToString());
sortedOrder.insert(sortedOrder.begin() + 6, tx8.GetId().ToString()); sortedOrder.insert(sortedOrder.begin() + 6, tx8.GetId().ToString());
// tx10 is just before tx6 // tx10 is before tx7
sortedOrder.insert(sortedOrder.begin() + 7, tx10.GetId().ToString()); sortedOrder.insert(sortedOrder.begin() + 8, tx10.GetId().ToString());
CheckSort<descendant_score>(pool, sortedOrder, "MempoolIndexingTest6"); CheckSort<descendant_score>(pool, sortedOrder, "MempoolIndexingTest6");
// there should be 10 transactions in the mempool // there should be 10 transactions in the mempool
BOOST_CHECK_EQUAL(pool.size(), 10UL); BOOST_CHECK_EQUAL(pool.size(), 10UL);
// Now try removing tx10 and verify the sort order returns to normal // Now try removing tx10 and verify the sort order returns to normal
pool.removeRecursive(pool.mapTx.find(tx10.GetId())->GetTx()); pool.removeRecursive(pool.mapTx.find(tx10.GetId())->GetTx());
CheckSort<descendant_score>(pool, snapshotOrder, "MempoolIndexingTest7"); CheckSort<descendant_score>(pool, snapshotOrder, "MempoolIndexingTest7");
▲ Show 20 Lines • Show All 125 Lines • ▼ Show 20 LinesBOOST_AUTO_TEST_CASE(MempoolAncestorIndexingTest) {
uint64_t tx7Size = CTransaction(tx7).GetTotalSize(); uint64_t tx7Size = CTransaction(tx7).GetTotalSize();
/* set the fee to just below tx2's feerate when including ancestor */ /* set the fee to just below tx2's feerate when including ancestor */
Amount fee((20000 / tx2Size) * (tx7Size + tx6Size) - 1); Amount fee((20000 / tx2Size) * (tx7Size + tx6Size) - 1);
// CTxMemPoolEntry entry7(tx7, fee, 2, 10.0, 1, true); // CTxMemPoolEntry entry7(tx7, fee, 2, 10.0, 1, true);
pool.addUnchecked(tx7.GetId(), entry.Fee(Amount(fee)).FromTx(tx7)); pool.addUnchecked(tx7.GetId(), entry.Fee(Amount(fee)).FromTx(tx7));
BOOST_CHECK_EQUAL(pool.size(), 7UL); BOOST_CHECK_EQUAL(pool.size(), 7UL);
sortedOrder.insert(sortedOrder.begin() + 1, tx7.GetId().ToString()); sortedOrder.insert(sortedOrder.begin(), tx7.GetId().ToString());
CheckSort<ancestor_score>(pool, sortedOrder, CheckSort<ancestor_score>(pool, sortedOrder,
"MempoolAncestorIndexingTest3"); "MempoolAncestorIndexingTest3");
/* after tx6 is mined, tx7 should move up in the sort */ /* after tx6 is mined, tx7 should move up in the sort */
std::vector<CTransactionRef> vtx; std::vector<CTransactionRef> vtx;
vtx.push_back(MakeTransactionRef(tx6)); vtx.push_back(MakeTransactionRef(tx6));
pool.removeForBlock(vtx, 1); pool.removeForBlock(vtx, 1);
sortedOrder.erase(sortedOrder.begin() + 1); sortedOrder.erase(sortedOrder.begin());
// Ties are broken by hash // Ties are broken by hash
if (tx3.GetId() < tx6.GetId()) if (tx3.GetId() < tx6.GetId())
sortedOrder.pop_back(); sortedOrder.pop_back();
else else
sortedOrder.erase(sortedOrder.end() - 2); sortedOrder.erase(sortedOrder.end() - 2);
sortedOrder.insert(sortedOrder.begin(), tx7.GetId().ToString()); sortedOrder.insert(sortedOrder.begin(), tx7.GetId().ToString());
CheckSort<ancestor_score>(pool, sortedOrder, CheckSort<ancestor_score>(pool, sortedOrder,
"MempoolAncestorIndexingTest4"); "MempoolAncestorIndexingTest4");
▲ Show 20 Lines • Show All 178 Lines • Show Last 20 Lines