Page MenuHomePhabricator
Differential D4904 Diff 15368 src/test/mempool_tests.cpp

Changeset View

Standalone View

View Options

src/test/mempool_tests.cpp

Show All 29 LinesBOOST_AUTO_TEST_CASE(TestPackageAccounting) {
// Construct a parent for the rest of the chain // Construct a parent for the rest of the chain
parentOfAll.vin.resize(1); parentOfAll.vin.resize(1);
parentOfAll.vin[0].scriptSig = CScript(); parentOfAll.vin[0].scriptSig = CScript();
// Give us a couple outpoints so we can spend them // Give us a couple outpoints so we can spend them
for (size_t i = 0; i < maxOutputs; i++) { for (size_t i = 0; i < maxOutputs; i++) {
parentOfAll.vout.emplace_back(10 * SATOSHI, CScript() << OP_TRUE); parentOfAll.vout.emplace_back(10 * SATOSHI, CScript() << OP_TRUE);
} }
TxId parentOfAllId = parentOfAll.GetId(); TxId parentOfAllId = parentOfAll.GetId();
testPool.addUnchecked(parentOfAllId, entry.FromTx(parentOfAll)); testPool.addUnchecked(parentOfAllId,
entry.SigOpCount(0).FromTx(parentOfAll));
// Add some outpoints to the tracking vector // Add some outpoints to the tracking vector
for (size_t i = 0; i < maxOutputs; i++) { for (size_t i = 0; i < maxOutputs; i++) {
outpoints.emplace_back(COutPoint(parentOfAllId, i)); outpoints.emplace_back(COutPoint(parentOfAllId, i));
} }
Amount totalFee = Amount::zero(); Amount totalFee = Amount::zero();
size_t totalSize = CTransaction(parentOfAll).GetTotalSize(); size_t totalSize = CTransaction(parentOfAll).GetTotalSize();
// Generate 100 transactions // Generate 100 transactions
for (size_t totalTransactions = 0; totalTransactions < 100; for (size_t totalTransactions = 0; totalTransactions < 100;
totalTransactions++) { totalTransactions++) {
CMutableTransaction tx; CMutableTransaction tx;
uint64_t minAncestors = std::numeric_limits<size_t>::max(); uint64_t minAncestors = std::numeric_limits<size_t>::max();
uint64_t maxAncestors = 0; uint64_t maxAncestors = 0;
Amount minFees = MAX_MONEY; Amount minFees = MAX_MONEY;
Amount maxFees = Amount::zero(); Amount maxFees = Amount::zero();
uint64_t minSize = std::numeric_limits<size_t>::max(); uint64_t minSize = std::numeric_limits<size_t>::max();
uint64_t maxSize = 0; uint64_t maxSize = 0;
int64_t minSigOpCount = std::numeric_limits<int64_t>::max();
int64_t maxSigOpCount = 0;
// Consume random inputs, but make sure we don't consume more than // Consume random inputs, but make sure we don't consume more than
// available // available
for (size_t input = std::min(InsecureRandRange(maxOutputs) + 1, for (size_t input = std::min(InsecureRandRange(maxOutputs) + 1,
uint64_t(outpoints.size())); uint64_t(outpoints.size()));
input > 0; input--) { input > 0; input--) {
std::swap(outpoints[InsecureRandRange(outpoints.size())], std::swap(outpoints[InsecureRandRange(outpoints.size())],
outpoints.back()); outpoints.back());
tx.vin.emplace_back(outpoints.back()); tx.vin.emplace_back(outpoints.back());
outpoints.pop_back(); outpoints.pop_back();
// We don't know exactly how many ancestors this transaction has // We don't know exactly how many ancestors this transaction has
// due to possible duplicates. Calculate a valid range based on // due to possible duplicates. Calculate a valid range based on
// parents. // parents.
CTxMemPoolEntry parent = CTxMemPoolEntry parent =
*testPool.mapTx.find(tx.vin.back().prevout.GetTxId()); *testPool.mapTx.find(tx.vin.back().prevout.GetTxId());
minAncestors = minAncestors =
std::min(minAncestors, parent.GetCountWithAncestors()); std::min(minAncestors, parent.GetCountWithAncestors());
maxAncestors += parent.GetCountWithAncestors(); maxAncestors += parent.GetCountWithAncestors();
minFees = std::min(minFees, parent.GetModFeesWithAncestors()); minFees = std::min(minFees, parent.GetModFeesWithAncestors());
maxFees += parent.GetModFeesWithAncestors(); maxFees += parent.GetModFeesWithAncestors();
minSize = std::min(minSize, parent.GetSizeWithAncestors()); minSize = std::min(minSize, parent.GetSizeWithAncestors());
maxSize += parent.GetSizeWithAncestors(); maxSize += parent.GetSizeWithAncestors();
minSigOpCount =
std::min(minSigOpCount, parent.GetSigOpCountWithAncestors());
maxSigOpCount += parent.GetSigOpCountWithAncestors();
} }
// Produce random number of outputs // Produce random number of outputs
for (size_t output = InsecureRandRange(maxOutputs) + 1; output > 0; for (size_t output = InsecureRandRange(maxOutputs) + 1; output > 0;
output--) { output--) {
tx.vout.emplace_back(10 * SATOSHI, CScript() << OP_TRUE); tx.vout.emplace_back(10 * SATOSHI, CScript() << OP_TRUE);
} }
TxId curId = tx.GetId(); TxId curId = tx.GetId();
// Record the outputs // Record the outputs
for (size_t output = tx.vout.size(); output > 0; output--) { for (size_t output = tx.vout.size(); output > 0; output--) {
outpoints.emplace_back(COutPoint(curId, output)); outpoints.emplace_back(COutPoint(curId, output));
} }
Amount randFee = int64_t(InsecureRandRange(300)) * SATOSHI; Amount randFee = int64_t(InsecureRandRange(300)) * SATOSHI;
int randSigOpCount = InsecureRandRange(5);
testPool.addUnchecked(curId, entry.Fee(randFee).FromTx(tx)); testPool.addUnchecked(
curId, entry.Fee(randFee).SigOpCount(randSigOpCount).FromTx(tx));
// Add this transaction to the totals. // Add this transaction to the totals.
minAncestors += 1; minAncestors += 1;
maxAncestors += 1; maxAncestors += 1;
minFees += randFee; minFees += randFee;
maxFees += randFee; maxFees += randFee;
minSize += CTransaction(tx).GetTotalSize(); minSize += CTransaction(tx).GetTotalSize();
maxSize += CTransaction(tx).GetTotalSize(); maxSize += CTransaction(tx).GetTotalSize();
minSigOpCount += randSigOpCount;
maxSigOpCount += randSigOpCount;
// Calculate overall values // Calculate overall values
totalFee += randFee; totalFee += randFee;
totalSize += CTransaction(tx).GetTotalSize(); totalSize += CTransaction(tx).GetTotalSize();
CTxMemPoolEntry parentEntry = *testPool.mapTx.find(parentOfAllId); CTxMemPoolEntry parentEntry = *testPool.mapTx.find(parentOfAllId);
CTxMemPoolEntry latestEntry = *testPool.mapTx.find(curId); CTxMemPoolEntry latestEntry = *testPool.mapTx.find(curId);
// Ensure values are within the expected ranges // Ensure values are within the expected ranges
BOOST_CHECK(latestEntry.GetCountWithAncestors() >= minAncestors); BOOST_CHECK(latestEntry.GetCountWithAncestors() >= minAncestors);
BOOST_CHECK(latestEntry.GetCountWithAncestors() <= maxAncestors); BOOST_CHECK(latestEntry.GetCountWithAncestors() <= maxAncestors);
BOOST_CHECK(latestEntry.GetSizeWithAncestors() >= minSize); BOOST_CHECK(latestEntry.GetSizeWithAncestors() >= minSize);
BOOST_CHECK(latestEntry.GetSizeWithAncestors() <= maxSize); BOOST_CHECK(latestEntry.GetSizeWithAncestors() <= maxSize);
BOOST_CHECK(latestEntry.GetSigOpCountWithAncestors() >= minSigOpCount);
BOOST_CHECK(latestEntry.GetSigOpCountWithAncestors() <= maxSigOpCount);
BOOST_CHECK(latestEntry.GetModFeesWithAncestors() >= minFees); BOOST_CHECK(latestEntry.GetModFeesWithAncestors() >= minFees);
BOOST_CHECK(latestEntry.GetModFeesWithAncestors() <= maxFees); BOOST_CHECK(latestEntry.GetModFeesWithAncestors() <= maxFees);
BOOST_CHECK_EQUAL(parentEntry.GetCountWithDescendants(), BOOST_CHECK_EQUAL(parentEntry.GetCountWithDescendants(),
testPool.mapTx.size()); testPool.mapTx.size());
BOOST_CHECK_EQUAL(parentEntry.GetSizeWithDescendants(), totalSize); BOOST_CHECK_EQUAL(parentEntry.GetSizeWithDescendants(), totalSize);
BOOST_CHECK_EQUAL(parentEntry.GetModFeesWithDescendants(), totalFee); BOOST_CHECK_EQUAL(parentEntry.GetModFeesWithDescendants(), totalFee);
} }
▲ Show 20 Lines • Show All 910 Lines • Show Last 20 Lines