|
|
|
@ -3731,6 +3731,7 @@ CBlock* CreateNewBlock(CReserveKey& reservekey)
@@ -3731,6 +3731,7 @@ CBlock* CreateNewBlock(CReserveKey& reservekey)
|
|
|
|
|
// Priority order to process transactions
|
|
|
|
|
list<COrphan> vOrphan; // list memory doesn't move
|
|
|
|
|
map<uint256, vector<COrphan*> > mapDependers; |
|
|
|
|
bool fPrintPriority = GetBoolArg("-printpriority"); |
|
|
|
|
|
|
|
|
|
// This vector will be sorted into a priority queue:
|
|
|
|
|
vector<TxPriority> vecPriority; |
|
|
|
@ -3877,7 +3878,7 @@ CBlock* CreateNewBlock(CReserveKey& reservekey)
@@ -3877,7 +3878,7 @@ CBlock* CreateNewBlock(CReserveKey& reservekey)
|
|
|
|
|
nBlockSigOps += nTxSigOps; |
|
|
|
|
nFees += nTxFees; |
|
|
|
|
|
|
|
|
|
if (fDebug && GetBoolArg("-printpriority")) |
|
|
|
|
if (fPrintPriority) |
|
|
|
|
{ |
|
|
|
|
printf("priority %.1f feeperkb %.1f txid %s\n", |
|
|
|
|
dPriority, dFeePerKb, tx.GetHash().ToString().c_str()); |
|
|
|
|