Fix unmineable tx handling
This commit is contained in:
parent
d665d2a12c
commit
89d37f0058
@ -60,6 +60,7 @@ pub fn gbt(mempool: &mut ThreadTransactionsMap, accelerations: &[ThreadAccelerat
|
|||||||
indexed_accelerations[acceleration.uid as usize] = Some(acceleration);
|
indexed_accelerations[acceleration.uid as usize] = Some(acceleration);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
info!("Initializing working vecs with uid capacity for {}", max_uid + 1);
|
||||||
let mempool_len = mempool.len();
|
let mempool_len = mempool.len();
|
||||||
let mut audit_pool: AuditPool = Vec::with_capacity(max_uid + 1);
|
let mut audit_pool: AuditPool = Vec::with_capacity(max_uid + 1);
|
||||||
audit_pool.resize(max_uid + 1, None);
|
audit_pool.resize(max_uid + 1, None);
|
||||||
@ -127,74 +128,75 @@ pub fn gbt(mempool: &mut ThreadTransactionsMap, accelerations: &[ThreadAccelerat
|
|||||||
let next_from_stack = next_valid_from_stack(&mut mempool_stack, &audit_pool);
|
let next_from_stack = next_valid_from_stack(&mut mempool_stack, &audit_pool);
|
||||||
let next_from_queue = next_valid_from_queue(&mut modified, &audit_pool);
|
let next_from_queue = next_valid_from_queue(&mut modified, &audit_pool);
|
||||||
if next_from_stack.is_none() && next_from_queue.is_none() {
|
if next_from_stack.is_none() && next_from_queue.is_none() {
|
||||||
break;
|
info!("No transactions left! {:#?} in overflow", overflow.len());
|
||||||
}
|
|
||||||
let (next_tx, from_stack) = match (next_from_stack, next_from_queue) {
|
|
||||||
(Some(stack_tx), Some(queue_tx)) => match queue_tx.cmp(stack_tx) {
|
|
||||||
std::cmp::Ordering::Less => (stack_tx, true),
|
|
||||||
_ => (queue_tx, false),
|
|
||||||
},
|
|
||||||
(Some(stack_tx), None) => (stack_tx, true),
|
|
||||||
(None, Some(queue_tx)) => (queue_tx, false),
|
|
||||||
(None, None) => unreachable!(),
|
|
||||||
};
|
|
||||||
|
|
||||||
if from_stack {
|
|
||||||
mempool_stack.pop();
|
|
||||||
} else {
|
} else {
|
||||||
modified.pop();
|
let (next_tx, from_stack) = match (next_from_stack, next_from_queue) {
|
||||||
}
|
(Some(stack_tx), Some(queue_tx)) => match queue_tx.cmp(stack_tx) {
|
||||||
|
std::cmp::Ordering::Less => (stack_tx, true),
|
||||||
|
_ => (queue_tx, false),
|
||||||
|
},
|
||||||
|
(Some(stack_tx), None) => (stack_tx, true),
|
||||||
|
(None, Some(queue_tx)) => (queue_tx, false),
|
||||||
|
(None, None) => unreachable!(),
|
||||||
|
};
|
||||||
|
|
||||||
if blocks.len() < (MAX_BLOCKS - 1)
|
if from_stack {
|
||||||
&& ((block_weight + (4 * next_tx.ancestor_sigop_adjusted_vsize())
|
mempool_stack.pop();
|
||||||
>= MAX_BLOCK_WEIGHT_UNITS)
|
} else {
|
||||||
|| (block_sigops + next_tx.ancestor_sigops() > BLOCK_SIGOPS))
|
modified.pop();
|
||||||
{
|
|
||||||
// hold this package in an overflow list while we check for smaller options
|
|
||||||
overflow.push(next_tx.uid);
|
|
||||||
failures += 1;
|
|
||||||
} else {
|
|
||||||
let mut package: Vec<(u32, u32, usize)> = Vec::new();
|
|
||||||
let mut cluster: Vec<u32> = Vec::new();
|
|
||||||
let is_cluster: bool = !next_tx.ancestors.is_empty();
|
|
||||||
for ancestor_id in &next_tx.ancestors {
|
|
||||||
if let Some(Some(ancestor)) = audit_pool.get(*ancestor_id as usize) {
|
|
||||||
package.push((*ancestor_id, ancestor.order(), ancestor.ancestors.len()));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
package.sort_unstable_by(|a, b| -> Ordering {
|
|
||||||
if a.2 != b.2 {
|
|
||||||
// order by ascending ancestor count
|
|
||||||
a.2.cmp(&b.2)
|
|
||||||
} else if a.1 != b.1 {
|
|
||||||
// tie-break by ascending partial txid
|
|
||||||
a.1.cmp(&b.1)
|
|
||||||
} else {
|
|
||||||
// tie-break partial txid collisions by ascending uid
|
|
||||||
a.0.cmp(&b.0)
|
|
||||||
}
|
|
||||||
});
|
|
||||||
package.push((next_tx.uid, next_tx.order(), next_tx.ancestors.len()));
|
|
||||||
|
|
||||||
let cluster_rate = next_tx.cluster_rate();
|
|
||||||
|
|
||||||
for (txid, _, _) in &package {
|
|
||||||
cluster.push(*txid);
|
|
||||||
if let Some(Some(tx)) = audit_pool.get_mut(*txid as usize) {
|
|
||||||
tx.used = true;
|
|
||||||
tx.set_dirty_if_different(cluster_rate);
|
|
||||||
transactions.push(tx.uid);
|
|
||||||
block_weight += tx.weight;
|
|
||||||
block_sigops += tx.sigops;
|
|
||||||
}
|
|
||||||
update_descendants(*txid, &mut audit_pool, &mut modified, cluster_rate);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if is_cluster {
|
if blocks.len() < (MAX_BLOCKS - 1)
|
||||||
clusters.push(cluster);
|
&& ((block_weight + (4 * next_tx.ancestor_sigop_adjusted_vsize())
|
||||||
}
|
>= MAX_BLOCK_WEIGHT_UNITS)
|
||||||
|
|| (block_sigops + next_tx.ancestor_sigops() > BLOCK_SIGOPS))
|
||||||
|
{
|
||||||
|
// hold this package in an overflow list while we check for smaller options
|
||||||
|
overflow.push(next_tx.uid);
|
||||||
|
failures += 1;
|
||||||
|
} else {
|
||||||
|
let mut package: Vec<(u32, u32, usize)> = Vec::new();
|
||||||
|
let mut cluster: Vec<u32> = Vec::new();
|
||||||
|
let is_cluster: bool = !next_tx.ancestors.is_empty();
|
||||||
|
for ancestor_id in &next_tx.ancestors {
|
||||||
|
if let Some(Some(ancestor)) = audit_pool.get(*ancestor_id as usize) {
|
||||||
|
package.push((*ancestor_id, ancestor.order(), ancestor.ancestors.len()));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
package.sort_unstable_by(|a, b| -> Ordering {
|
||||||
|
if a.2 != b.2 {
|
||||||
|
// order by ascending ancestor count
|
||||||
|
a.2.cmp(&b.2)
|
||||||
|
} else if a.1 != b.1 {
|
||||||
|
// tie-break by ascending partial txid
|
||||||
|
a.1.cmp(&b.1)
|
||||||
|
} else {
|
||||||
|
// tie-break partial txid collisions by ascending uid
|
||||||
|
a.0.cmp(&b.0)
|
||||||
|
}
|
||||||
|
});
|
||||||
|
package.push((next_tx.uid, next_tx.order(), next_tx.ancestors.len()));
|
||||||
|
|
||||||
failures = 0;
|
let cluster_rate = next_tx.cluster_rate();
|
||||||
|
|
||||||
|
for (txid, _, _) in &package {
|
||||||
|
cluster.push(*txid);
|
||||||
|
if let Some(Some(tx)) = audit_pool.get_mut(*txid as usize) {
|
||||||
|
tx.used = true;
|
||||||
|
tx.set_dirty_if_different(cluster_rate);
|
||||||
|
transactions.push(tx.uid);
|
||||||
|
block_weight += tx.weight;
|
||||||
|
block_sigops += tx.sigops;
|
||||||
|
}
|
||||||
|
update_descendants(*txid, &mut audit_pool, &mut modified, cluster_rate);
|
||||||
|
}
|
||||||
|
|
||||||
|
if is_cluster {
|
||||||
|
clusters.push(cluster);
|
||||||
|
}
|
||||||
|
|
||||||
|
failures = 0;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// this block is full
|
// this block is full
|
||||||
@ -204,6 +206,7 @@ pub fn gbt(mempool: &mut ThreadTransactionsMap, accelerations: &[ThreadAccelerat
|
|||||||
if (exceeded_package_tries || queue_is_empty) && blocks.len() < (MAX_BLOCKS - 1) {
|
if (exceeded_package_tries || queue_is_empty) && blocks.len() < (MAX_BLOCKS - 1) {
|
||||||
// finalize this block
|
// finalize this block
|
||||||
if transactions.is_empty() {
|
if transactions.is_empty() {
|
||||||
|
info!("trying to push an empty block! breaking loop! mempool {:#?} | modified {:#?} | overflow {:#?}", mempool_stack.len(), modified.len(), overflow.len());
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -432,15 +432,16 @@ class MempoolBlocks {
|
|||||||
this.nextUid,
|
this.nextUid,
|
||||||
),
|
),
|
||||||
);
|
);
|
||||||
const resultMempoolSize = blocks.reduce((total, block) => total + block.length, 0);
|
//// different number of transactions is now expected, if any were unmineable
|
||||||
if (mempoolSize !== resultMempoolSize) {
|
// const resultMempoolSize = blocks.reduce((total, block) => total + block.length, 0);
|
||||||
throw new Error('GBT returned wrong number of transactions, cache is probably out of sync');
|
// if (mempoolSize !== resultMempoolSize) {
|
||||||
} else {
|
// throw new Error('GBT returned wrong number of transactions, cache is probably out of sync');
|
||||||
|
// } else {
|
||||||
const processed = this.processBlockTemplates(newMempool, blocks, blockWeights, rates, clusters, accelerations, accelerationPool, true);
|
const processed = this.processBlockTemplates(newMempool, blocks, blockWeights, rates, clusters, accelerations, accelerationPool, true);
|
||||||
this.removeUids(removedUids);
|
this.removeUids(removedUids);
|
||||||
logger.debug(`RUST updateBlockTemplates completed in ${(Date.now() - start)/1000} seconds`);
|
logger.debug(`RUST updateBlockTemplates completed in ${(Date.now() - start)/1000} seconds`);
|
||||||
return processed;
|
return processed;
|
||||||
}
|
// }
|
||||||
} catch (e) {
|
} catch (e) {
|
||||||
logger.err('RUST updateBlockTemplates failed. ' + (e instanceof Error ? e.message : e));
|
logger.err('RUST updateBlockTemplates failed. ' + (e instanceof Error ? e.message : e));
|
||||||
this.resetRustGbt();
|
this.resetRustGbt();
|
||||||
|
Loading…
x
Reference in New Issue
Block a user