mirror of
https://github.com/sigp/lighthouse.git
synced 2026-03-15 19:02:42 +00:00
Use async code when interacting with EL (#3244)
## Overview
This rather extensive PR achieves two primary goals:
1. Uses the finalized/justified checkpoints of fork choice (FC), rather than that of the head state.
2. Refactors fork choice, block production and block processing to `async` functions.
Additionally, it achieves:
- Concurrent forkchoice updates to the EL and cache pruning after a new head is selected.
- Concurrent "block packing" (attestations, etc) and execution payload retrieval during block production.
- Concurrent per-block-processing and execution payload verification during block processing.
- The `Arc`-ification of `SignedBeaconBlock` during block processing (it's never mutated, so why not?):
- I had to do this to deal with sending blocks into spawned tasks.
- Previously we were cloning the beacon block at least 2 times during each block processing, these clones are either removed or turned into cheaper `Arc` clones.
- We were also `Box`-ing and un-`Box`-ing beacon blocks as they moved throughout the networking crate. This is not a big deal, but it's nice to avoid shifting things between the stack and heap.
- Avoids cloning *all the blocks* in *every chain segment* during sync.
- It also has the potential to clean up our code where we need to pass an *owned* block around so we can send it back in the case of an error (I didn't do much of this, my PR is already big enough 😅)
- The `BeaconChain::HeadSafetyStatus` struct was removed. It was an old relic from prior merge specs.
For motivation for this change, see https://github.com/sigp/lighthouse/pull/3244#issuecomment-1160963273
## Changes to `canonical_head` and `fork_choice`
Previously, the `BeaconChain` had two separate fields:
```
canonical_head: RwLock<Snapshot>,
fork_choice: RwLock<BeaconForkChoice>
```
Now, we have grouped these values under a single struct:
```
canonical_head: CanonicalHead {
cached_head: RwLock<Arc<Snapshot>>,
fork_choice: RwLock<BeaconForkChoice>
}
```
Apart from ergonomics, the only *actual* change here is wrapping the canonical head snapshot in an `Arc`. This means that we no longer need to hold the `cached_head` (`canonical_head`, in old terms) lock when we want to pull some values from it. This was done to avoid deadlock risks by preventing functions from acquiring (and holding) the `cached_head` and `fork_choice` locks simultaneously.
## Breaking Changes
### The `state` (root) field in the `finalized_checkpoint` SSE event
Consider the scenario where epoch `n` is just finalized, but `start_slot(n)` is skipped. There are two state roots we might in the `finalized_checkpoint` SSE event:
1. The state root of the finalized block, which is `get_block(finalized_checkpoint.root).state_root`.
4. The state root at slot of `start_slot(n)`, which would be the state from (1), but "skipped forward" through any skip slots.
Previously, Lighthouse would choose (2). However, we can see that when [Teku generates that event](de2b2801c8/data/beaconrestapi/src/main/java/tech/pegasys/teku/beaconrestapi/handlers/v1/events/EventSubscriptionManager.java (L171-L182)) it uses [`getStateRootFromBlockRoot`](de2b2801c8/data/provider/src/main/java/tech/pegasys/teku/api/ChainDataProvider.java (L336-L341)) which uses (1).
I have switched Lighthouse from (2) to (1). I think it's a somewhat arbitrary choice between the two, where (1) is easier to compute and is consistent with Teku.
## Notes for Reviewers
I've renamed `BeaconChain::fork_choice` to `BeaconChain::recompute_head`. Doing this helped ensure I broke all previous uses of fork choice and I also find it more descriptive. It describes an action and can't be confused with trying to get a reference to the `ForkChoice` struct.
I've changed the ordering of SSE events when a block is received. It used to be `[block, finalized, head]` and now it's `[block, head, finalized]`. It was easier this way and I don't think we were making any promises about SSE event ordering so it's not "breaking".
I've made it so fork choice will run when it's first constructed. I did this because I wanted to have a cached version of the last call to `get_head`. Ensuring `get_head` has been run *at least once* means that the cached values doesn't need to wrapped in an `Option`. This was fairly simple, it just involved passing a `slot` to the constructor so it knows *when* it's being run. When loading a fork choice from the store and a slot clock isn't handy I've just used the `slot` that was saved in the `fork_choice_store`. That seems like it would be a faithful representation of the slot when we saved it.
I added the `genesis_time: u64` to the `BeaconChain`. It's small, constant and nice to have around.
Since we're using FC for the fin/just checkpoints, we no longer get the `0x00..00` roots at genesis. You can see I had to remove a work-around in `ef-tests` here: b56be3bc2. I can't find any reason why this would be an issue, if anything I think it'll be better since the genesis-alias has caught us out a few times (0x00..00 isn't actually a real root). Edit: I did find a case where the `network` expected the 0x00..00 alias and patched it here: 3f26ac3e2.
You'll notice a lot of changes in tests. Generally, tests should be functionally equivalent. Here are the things creating the most diff-noise in tests:
- Changing tests to be `tokio::async` tests.
- Adding `.await` to fork choice, block processing and block production functions.
- Refactor of the `canonical_head` "API" provided by the `BeaconChain`. E.g., `chain.canonical_head.cached_head()` instead of `chain.canonical_head.read()`.
- Wrapping `SignedBeaconBlock` in an `Arc`.
- In the `beacon_chain/tests/block_verification`, we can't use the `lazy_static` `CHAIN_SEGMENT` variable anymore since it's generated with an async function. We just generate it in each test, not so efficient but hopefully insignificant.
I had to disable `rayon` concurrent tests in the `fork_choice` tests. This is because the use of `rayon` and `block_on` was causing a panic.
Co-authored-by: Mac L <mjladson@pm.me>
This commit is contained in:
@@ -8,7 +8,6 @@ use beacon_chain::test_utils::{
|
||||
AttestationStrategy, BeaconChainHarness, BlockStrategy, EphemeralHarnessType,
|
||||
};
|
||||
use beacon_chain::{BeaconChain, MAXIMUM_GOSSIP_CLOCK_DISPARITY};
|
||||
use environment::{null_logger, Environment, EnvironmentBuilder};
|
||||
use lighthouse_network::{
|
||||
discv5::enr::{CombinedKey, EnrBuilder},
|
||||
rpc::methods::{MetaData, MetaDataV2},
|
||||
@@ -20,7 +19,6 @@ use std::cmp;
|
||||
use std::iter::Iterator;
|
||||
use std::sync::Arc;
|
||||
use std::time::Duration;
|
||||
use tokio::runtime::Handle;
|
||||
use tokio::sync::mpsc;
|
||||
use types::{
|
||||
Attestation, AttesterSlashing, EthSpec, MainnetEthSpec, ProposerSlashing, SignedBeaconBlock,
|
||||
@@ -45,7 +43,7 @@ const STANDARD_TIMEOUT: Duration = Duration::from_secs(10);
|
||||
/// Provides utilities for testing the `BeaconProcessor`.
|
||||
struct TestRig {
|
||||
chain: Arc<BeaconChain<T>>,
|
||||
next_block: SignedBeaconBlock<E>,
|
||||
next_block: Arc<SignedBeaconBlock<E>>,
|
||||
attestations: Vec<(Attestation<E>, SubnetId)>,
|
||||
next_block_attestations: Vec<(Attestation<E>, SubnetId)>,
|
||||
next_block_aggregate_attestations: Vec<SignedAggregateAndProof<E>>,
|
||||
@@ -56,7 +54,7 @@ struct TestRig {
|
||||
work_journal_rx: mpsc::Receiver<&'static str>,
|
||||
_network_rx: mpsc::UnboundedReceiver<NetworkMessage<E>>,
|
||||
_sync_rx: mpsc::UnboundedReceiver<SyncMessage<E>>,
|
||||
environment: Option<Environment<E>>,
|
||||
_harness: BeaconChainHarness<T>,
|
||||
}
|
||||
|
||||
/// This custom drop implementation ensures that we shut down the tokio runtime gracefully. Without
|
||||
@@ -65,12 +63,11 @@ impl Drop for TestRig {
|
||||
fn drop(&mut self) {
|
||||
// Causes the beacon processor to shutdown.
|
||||
self.beacon_processor_tx = mpsc::channel(MAX_WORK_EVENT_QUEUE_LEN).0;
|
||||
self.environment.take().unwrap().shutdown_on_idle();
|
||||
}
|
||||
}
|
||||
|
||||
impl TestRig {
|
||||
pub fn new(chain_length: u64) -> Self {
|
||||
pub async fn new(chain_length: u64) -> Self {
|
||||
// This allows for testing voluntary exits without building out a massive chain.
|
||||
let mut spec = E::default_spec();
|
||||
spec.shard_committee_period = 2;
|
||||
@@ -84,16 +81,18 @@ impl TestRig {
|
||||
harness.advance_slot();
|
||||
|
||||
for _ in 0..chain_length {
|
||||
harness.extend_chain(
|
||||
1,
|
||||
BlockStrategy::OnCanonicalHead,
|
||||
AttestationStrategy::AllValidators,
|
||||
);
|
||||
harness
|
||||
.extend_chain(
|
||||
1,
|
||||
BlockStrategy::OnCanonicalHead,
|
||||
AttestationStrategy::AllValidators,
|
||||
)
|
||||
.await;
|
||||
|
||||
harness.advance_slot();
|
||||
}
|
||||
|
||||
let head = harness.chain.head().unwrap();
|
||||
let head = harness.chain.head_snapshot();
|
||||
|
||||
assert_eq!(
|
||||
harness.chain.slot().unwrap(),
|
||||
@@ -101,8 +100,9 @@ impl TestRig {
|
||||
"precondition: current slot is one after head"
|
||||
);
|
||||
|
||||
let (next_block, next_state) =
|
||||
harness.make_block(head.beacon_state.clone(), harness.chain.slot().unwrap());
|
||||
let (next_block, next_state) = harness
|
||||
.make_block(head.beacon_state.clone(), harness.chain.slot().unwrap())
|
||||
.await;
|
||||
|
||||
let head_state_root = head.beacon_state_root();
|
||||
let attestations = harness
|
||||
@@ -155,11 +155,11 @@ impl TestRig {
|
||||
let proposer_slashing = harness.make_proposer_slashing(2);
|
||||
let voluntary_exit = harness.make_voluntary_exit(3, harness.chain.epoch().unwrap());
|
||||
|
||||
let chain = harness.chain;
|
||||
let chain = harness.chain.clone();
|
||||
|
||||
let (network_tx, _network_rx) = mpsc::unbounded_channel();
|
||||
|
||||
let log = null_logger().unwrap();
|
||||
let log = harness.logger().clone();
|
||||
|
||||
let (beacon_processor_tx, beacon_processor_rx) = mpsc::channel(MAX_WORK_EVENT_QUEUE_LEN);
|
||||
let (sync_tx, _sync_rx) = mpsc::unbounded_channel();
|
||||
@@ -181,15 +181,7 @@ impl TestRig {
|
||||
&log,
|
||||
));
|
||||
|
||||
let mut environment = EnvironmentBuilder::mainnet()
|
||||
.null_logger()
|
||||
.unwrap()
|
||||
.multi_threaded_tokio_runtime()
|
||||
.unwrap()
|
||||
.build()
|
||||
.unwrap();
|
||||
|
||||
let executor = environment.core_context().executor;
|
||||
let executor = harness.runtime.task_executor.clone();
|
||||
|
||||
let (work_journal_tx, work_journal_rx) = mpsc::channel(16_364);
|
||||
|
||||
@@ -208,7 +200,7 @@ impl TestRig {
|
||||
|
||||
Self {
|
||||
chain,
|
||||
next_block,
|
||||
next_block: Arc::new(next_block),
|
||||
attestations,
|
||||
next_block_attestations,
|
||||
next_block_aggregate_attestations,
|
||||
@@ -219,12 +211,16 @@ impl TestRig {
|
||||
work_journal_rx,
|
||||
_network_rx,
|
||||
_sync_rx,
|
||||
environment: Some(environment),
|
||||
_harness: harness,
|
||||
}
|
||||
}
|
||||
|
||||
pub async fn recompute_head(&self) {
|
||||
self.chain.recompute_head_at_current_slot().await.unwrap()
|
||||
}
|
||||
|
||||
pub fn head_root(&self) -> Hash256 {
|
||||
self.chain.head().unwrap().beacon_block_root
|
||||
self.chain.head_snapshot().beacon_block_root
|
||||
}
|
||||
|
||||
pub fn enqueue_gossip_block(&self) {
|
||||
@@ -233,7 +229,7 @@ impl TestRig {
|
||||
junk_message_id(),
|
||||
junk_peer_id(),
|
||||
Client::default(),
|
||||
Box::new(self.next_block.clone()),
|
||||
self.next_block.clone(),
|
||||
Duration::from_secs(0),
|
||||
))
|
||||
.unwrap();
|
||||
@@ -241,7 +237,7 @@ impl TestRig {
|
||||
|
||||
pub fn enqueue_rpc_block(&self) {
|
||||
let event = WorkEvent::rpc_beacon_block(
|
||||
Box::new(self.next_block.clone()),
|
||||
self.next_block.clone(),
|
||||
std::time::Duration::default(),
|
||||
BlockProcessType::ParentLookup {
|
||||
chain_hash: Hash256::random(),
|
||||
@@ -324,28 +320,16 @@ impl TestRig {
|
||||
.unwrap();
|
||||
}
|
||||
|
||||
fn handle(&mut self) -> Handle {
|
||||
self.environment
|
||||
.as_mut()
|
||||
.unwrap()
|
||||
.core_context()
|
||||
.executor
|
||||
.handle()
|
||||
.unwrap()
|
||||
}
|
||||
|
||||
/// Assert that the `BeaconProcessor` doesn't produce any events in the given `duration`.
|
||||
pub fn assert_no_events_for(&mut self, duration: Duration) {
|
||||
self.handle().block_on(async {
|
||||
tokio::select! {
|
||||
_ = tokio::time::sleep(duration) => (),
|
||||
event = self.work_journal_rx.recv() => panic!(
|
||||
"received {:?} within {:?} when expecting no events",
|
||||
event,
|
||||
duration
|
||||
),
|
||||
}
|
||||
})
|
||||
pub async fn assert_no_events_for(&mut self, duration: Duration) {
|
||||
tokio::select! {
|
||||
_ = tokio::time::sleep(duration) => (),
|
||||
event = self.work_journal_rx.recv() => panic!(
|
||||
"received {:?} within {:?} when expecting no events",
|
||||
event,
|
||||
duration
|
||||
),
|
||||
}
|
||||
}
|
||||
|
||||
/// Checks that the `BeaconProcessor` event journal contains the `expected` events in the given
|
||||
@@ -354,57 +338,54 @@ impl TestRig {
|
||||
///
|
||||
/// Given the described logic, `expected` must not contain `WORKER_FREED` or `NOTHING_TO_DO`
|
||||
/// events.
|
||||
pub fn assert_event_journal_contains_ordered(&mut self, expected: &[&str]) {
|
||||
pub async fn assert_event_journal_contains_ordered(&mut self, expected: &[&str]) {
|
||||
assert!(expected
|
||||
.iter()
|
||||
.all(|ev| ev != &WORKER_FREED && ev != &NOTHING_TO_DO));
|
||||
|
||||
let (events, worker_freed_remaining) = self.handle().block_on(async {
|
||||
let mut events = Vec::with_capacity(expected.len());
|
||||
let mut worker_freed_remaining = expected.len();
|
||||
let mut events = Vec::with_capacity(expected.len());
|
||||
let mut worker_freed_remaining = expected.len();
|
||||
|
||||
let drain_future = async {
|
||||
loop {
|
||||
match self.work_journal_rx.recv().await {
|
||||
Some(event) if event == WORKER_FREED => {
|
||||
worker_freed_remaining -= 1;
|
||||
if worker_freed_remaining == 0 {
|
||||
// Break when all expected events are finished.
|
||||
break;
|
||||
}
|
||||
let drain_future = async {
|
||||
loop {
|
||||
match self.work_journal_rx.recv().await {
|
||||
Some(event) if event == WORKER_FREED => {
|
||||
worker_freed_remaining -= 1;
|
||||
if worker_freed_remaining == 0 {
|
||||
// Break when all expected events are finished.
|
||||
break;
|
||||
}
|
||||
Some(event) if event == NOTHING_TO_DO => {
|
||||
// Ignore these.
|
||||
}
|
||||
Some(event) => {
|
||||
events.push(event);
|
||||
}
|
||||
None => break,
|
||||
}
|
||||
Some(event) if event == NOTHING_TO_DO => {
|
||||
// Ignore these.
|
||||
}
|
||||
Some(event) => {
|
||||
events.push(event);
|
||||
}
|
||||
None => break,
|
||||
}
|
||||
};
|
||||
|
||||
// Drain the expected number of events from the channel, or time out and give up.
|
||||
tokio::select! {
|
||||
_ = tokio::time::sleep(STANDARD_TIMEOUT) => panic!(
|
||||
"Timeout ({:?}) expired waiting for events. Expected {:?} but got {:?} waiting for {} `WORKER_FREED` events.",
|
||||
STANDARD_TIMEOUT,
|
||||
expected,
|
||||
events,
|
||||
worker_freed_remaining,
|
||||
),
|
||||
_ = drain_future => {},
|
||||
}
|
||||
};
|
||||
|
||||
(events, worker_freed_remaining)
|
||||
});
|
||||
// Drain the expected number of events from the channel, or time out and give up.
|
||||
tokio::select! {
|
||||
_ = tokio::time::sleep(STANDARD_TIMEOUT) => panic!(
|
||||
"Timeout ({:?}) expired waiting for events. Expected {:?} but got {:?} waiting for {} `WORKER_FREED` events.",
|
||||
STANDARD_TIMEOUT,
|
||||
expected,
|
||||
events,
|
||||
worker_freed_remaining,
|
||||
),
|
||||
_ = drain_future => {},
|
||||
}
|
||||
|
||||
assert_eq!(events, expected);
|
||||
assert_eq!(worker_freed_remaining, 0);
|
||||
}
|
||||
|
||||
pub fn assert_event_journal(&mut self, expected: &[&str]) {
|
||||
self.assert_event_journal_with_timeout(expected, STANDARD_TIMEOUT);
|
||||
pub async fn assert_event_journal(&mut self, expected: &[&str]) {
|
||||
self.assert_event_journal_with_timeout(expected, STANDARD_TIMEOUT)
|
||||
.await
|
||||
}
|
||||
|
||||
/// Assert that the `BeaconProcessor` event journal is as `expected`.
|
||||
@@ -413,34 +394,34 @@ impl TestRig {
|
||||
///
|
||||
/// We won't attempt to listen for any more than `expected.len()` events. As such, it makes sense
|
||||
/// to use the `NOTHING_TO_DO` event to ensure that execution has completed.
|
||||
pub fn assert_event_journal_with_timeout(&mut self, expected: &[&str], timeout: Duration) {
|
||||
let events = self.handle().block_on(async {
|
||||
let mut events = Vec::with_capacity(expected.len());
|
||||
pub async fn assert_event_journal_with_timeout(
|
||||
&mut self,
|
||||
expected: &[&str],
|
||||
timeout: Duration,
|
||||
) {
|
||||
let mut events = Vec::with_capacity(expected.len());
|
||||
|
||||
let drain_future = async {
|
||||
while let Some(event) = self.work_journal_rx.recv().await {
|
||||
events.push(event);
|
||||
let drain_future = async {
|
||||
while let Some(event) = self.work_journal_rx.recv().await {
|
||||
events.push(event);
|
||||
|
||||
// Break as soon as we collect the desired number of events.
|
||||
if events.len() >= expected.len() {
|
||||
break;
|
||||
}
|
||||
// Break as soon as we collect the desired number of events.
|
||||
if events.len() >= expected.len() {
|
||||
break;
|
||||
}
|
||||
};
|
||||
|
||||
// Drain the expected number of events from the channel, or time out and give up.
|
||||
tokio::select! {
|
||||
_ = tokio::time::sleep(timeout) => panic!(
|
||||
"Timeout ({:?}) expired waiting for events. Expected {:?} but got {:?}",
|
||||
timeout,
|
||||
expected,
|
||||
events
|
||||
),
|
||||
_ = drain_future => {},
|
||||
}
|
||||
};
|
||||
|
||||
events
|
||||
});
|
||||
// Drain the expected number of events from the channel, or time out and give up.
|
||||
tokio::select! {
|
||||
_ = tokio::time::sleep(timeout) => panic!(
|
||||
"Timeout ({:?}) expired waiting for events. Expected {:?} but got {:?}",
|
||||
timeout,
|
||||
expected,
|
||||
events
|
||||
),
|
||||
_ = drain_future => {},
|
||||
}
|
||||
|
||||
assert_eq!(events, expected);
|
||||
}
|
||||
@@ -455,9 +436,9 @@ fn junk_message_id() -> MessageId {
|
||||
}
|
||||
|
||||
/// Blocks that arrive early should be queued for later processing.
|
||||
#[test]
|
||||
fn import_gossip_block_acceptably_early() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN);
|
||||
#[tokio::test]
|
||||
async fn import_gossip_block_acceptably_early() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN).await;
|
||||
|
||||
let slot_start = rig
|
||||
.chain
|
||||
@@ -477,7 +458,8 @@ fn import_gossip_block_acceptably_early() {
|
||||
|
||||
rig.enqueue_gossip_block();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_BLOCK, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_BLOCK, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
// Note: this section of the code is a bit race-y. We're assuming that we can set the slot clock
|
||||
// and check the head in the time between the block arrived early and when its due for
|
||||
@@ -492,7 +474,8 @@ fn import_gossip_block_acceptably_early() {
|
||||
"block not yet imported"
|
||||
);
|
||||
|
||||
rig.assert_event_journal(&[DELAYED_IMPORT_BLOCK, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[DELAYED_IMPORT_BLOCK, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.head_root(),
|
||||
@@ -502,9 +485,9 @@ fn import_gossip_block_acceptably_early() {
|
||||
}
|
||||
|
||||
/// Blocks that are *too* early shouldn't get into the delay queue.
|
||||
#[test]
|
||||
fn import_gossip_block_unacceptably_early() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN);
|
||||
#[tokio::test]
|
||||
async fn import_gossip_block_unacceptably_early() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN).await;
|
||||
|
||||
let slot_start = rig
|
||||
.chain
|
||||
@@ -524,11 +507,12 @@ fn import_gossip_block_unacceptably_early() {
|
||||
|
||||
rig.enqueue_gossip_block();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_BLOCK, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_BLOCK, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
// Waiting for 5 seconds is a bit arbitrary, however it *should* be long enough to ensure the
|
||||
// block isn't imported.
|
||||
rig.assert_no_events_for(Duration::from_secs(5));
|
||||
rig.assert_no_events_for(Duration::from_secs(5)).await;
|
||||
|
||||
assert!(
|
||||
rig.head_root() != rig.next_block.canonical_root(),
|
||||
@@ -537,9 +521,9 @@ fn import_gossip_block_unacceptably_early() {
|
||||
}
|
||||
|
||||
/// Blocks that arrive on-time should be processed normally.
|
||||
#[test]
|
||||
fn import_gossip_block_at_current_slot() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN);
|
||||
#[tokio::test]
|
||||
async fn import_gossip_block_at_current_slot() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN).await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.slot().unwrap(),
|
||||
@@ -549,7 +533,8 @@ fn import_gossip_block_at_current_slot() {
|
||||
|
||||
rig.enqueue_gossip_block();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_BLOCK, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_BLOCK, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.head_root(),
|
||||
@@ -559,15 +544,16 @@ fn import_gossip_block_at_current_slot() {
|
||||
}
|
||||
|
||||
/// Ensure a valid attestation can be imported.
|
||||
#[test]
|
||||
fn import_gossip_attestation() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN);
|
||||
#[tokio::test]
|
||||
async fn import_gossip_attestation() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN).await;
|
||||
|
||||
let initial_attns = rig.chain.naive_aggregation_pool.read().num_items();
|
||||
|
||||
rig.enqueue_unaggregated_attestation();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_ATTESTATION, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_ATTESTATION, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.naive_aggregation_pool.read().num_items(),
|
||||
@@ -583,8 +569,8 @@ enum BlockImportMethod {
|
||||
|
||||
/// Ensure that attestations that reference an unknown block get properly re-queued and
|
||||
/// re-processed upon importing the block.
|
||||
fn attestation_to_unknown_block_processed(import_method: BlockImportMethod) {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN);
|
||||
async fn attestation_to_unknown_block_processed(import_method: BlockImportMethod) {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN).await;
|
||||
|
||||
// Send the attestation but not the block, and check that it was not imported.
|
||||
|
||||
@@ -592,7 +578,8 @@ fn attestation_to_unknown_block_processed(import_method: BlockImportMethod) {
|
||||
|
||||
rig.enqueue_next_block_unaggregated_attestation();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_ATTESTATION, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_ATTESTATION, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.naive_aggregation_pool.read().num_items(),
|
||||
@@ -613,11 +600,12 @@ fn attestation_to_unknown_block_processed(import_method: BlockImportMethod) {
|
||||
}
|
||||
};
|
||||
|
||||
rig.assert_event_journal_contains_ordered(&[block_event, UNKNOWN_BLOCK_ATTESTATION]);
|
||||
rig.assert_event_journal_contains_ordered(&[block_event, UNKNOWN_BLOCK_ATTESTATION])
|
||||
.await;
|
||||
|
||||
// Run fork choice, since it isn't run when processing an RPC block. At runtime it is the
|
||||
// responsibility of the sync manager to do this.
|
||||
rig.chain.fork_choice().unwrap();
|
||||
rig.recompute_head().await;
|
||||
|
||||
assert_eq!(
|
||||
rig.head_root(),
|
||||
@@ -632,20 +620,20 @@ fn attestation_to_unknown_block_processed(import_method: BlockImportMethod) {
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn attestation_to_unknown_block_processed_after_gossip_block() {
|
||||
attestation_to_unknown_block_processed(BlockImportMethod::Gossip)
|
||||
#[tokio::test]
|
||||
async fn attestation_to_unknown_block_processed_after_gossip_block() {
|
||||
attestation_to_unknown_block_processed(BlockImportMethod::Gossip).await
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn attestation_to_unknown_block_processed_after_rpc_block() {
|
||||
attestation_to_unknown_block_processed(BlockImportMethod::Rpc)
|
||||
#[tokio::test]
|
||||
async fn attestation_to_unknown_block_processed_after_rpc_block() {
|
||||
attestation_to_unknown_block_processed(BlockImportMethod::Rpc).await
|
||||
}
|
||||
|
||||
/// Ensure that attestations that reference an unknown block get properly re-queued and
|
||||
/// re-processed upon importing the block.
|
||||
fn aggregate_attestation_to_unknown_block(import_method: BlockImportMethod) {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN);
|
||||
async fn aggregate_attestation_to_unknown_block(import_method: BlockImportMethod) {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN).await;
|
||||
|
||||
// Empty the op pool.
|
||||
rig.chain
|
||||
@@ -659,7 +647,8 @@ fn aggregate_attestation_to_unknown_block(import_method: BlockImportMethod) {
|
||||
|
||||
rig.enqueue_next_block_aggregated_attestation();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_AGGREGATE, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_AGGREGATE, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.op_pool.num_attestations(),
|
||||
@@ -680,11 +669,12 @@ fn aggregate_attestation_to_unknown_block(import_method: BlockImportMethod) {
|
||||
}
|
||||
};
|
||||
|
||||
rig.assert_event_journal_contains_ordered(&[block_event, UNKNOWN_BLOCK_AGGREGATE]);
|
||||
rig.assert_event_journal_contains_ordered(&[block_event, UNKNOWN_BLOCK_AGGREGATE])
|
||||
.await;
|
||||
|
||||
// Run fork choice, since it isn't run when processing an RPC block. At runtime it is the
|
||||
// responsibility of the sync manager to do this.
|
||||
rig.chain.fork_choice().unwrap();
|
||||
rig.recompute_head().await;
|
||||
|
||||
assert_eq!(
|
||||
rig.head_root(),
|
||||
@@ -699,21 +689,21 @@ fn aggregate_attestation_to_unknown_block(import_method: BlockImportMethod) {
|
||||
);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn aggregate_attestation_to_unknown_block_processed_after_gossip_block() {
|
||||
aggregate_attestation_to_unknown_block(BlockImportMethod::Gossip)
|
||||
#[tokio::test]
|
||||
async fn aggregate_attestation_to_unknown_block_processed_after_gossip_block() {
|
||||
aggregate_attestation_to_unknown_block(BlockImportMethod::Gossip).await
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn aggregate_attestation_to_unknown_block_processed_after_rpc_block() {
|
||||
aggregate_attestation_to_unknown_block(BlockImportMethod::Rpc)
|
||||
#[tokio::test]
|
||||
async fn aggregate_attestation_to_unknown_block_processed_after_rpc_block() {
|
||||
aggregate_attestation_to_unknown_block(BlockImportMethod::Rpc).await
|
||||
}
|
||||
|
||||
/// Ensure that attestations that reference an unknown block get properly re-queued and re-processed
|
||||
/// when the block is not seen.
|
||||
#[test]
|
||||
fn requeue_unknown_block_gossip_attestation_without_import() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN);
|
||||
#[tokio::test]
|
||||
async fn requeue_unknown_block_gossip_attestation_without_import() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN).await;
|
||||
|
||||
// Send the attestation but not the block, and check that it was not imported.
|
||||
|
||||
@@ -721,7 +711,8 @@ fn requeue_unknown_block_gossip_attestation_without_import() {
|
||||
|
||||
rig.enqueue_next_block_unaggregated_attestation();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_ATTESTATION, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_ATTESTATION, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.naive_aggregation_pool.read().num_items(),
|
||||
@@ -734,7 +725,8 @@ fn requeue_unknown_block_gossip_attestation_without_import() {
|
||||
rig.assert_event_journal_with_timeout(
|
||||
&[UNKNOWN_BLOCK_ATTESTATION, WORKER_FREED, NOTHING_TO_DO],
|
||||
Duration::from_secs(1) + QUEUED_ATTESTATION_DELAY,
|
||||
);
|
||||
)
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.naive_aggregation_pool.read().num_items(),
|
||||
@@ -745,9 +737,9 @@ fn requeue_unknown_block_gossip_attestation_without_import() {
|
||||
|
||||
/// Ensure that aggregate that reference an unknown block get properly re-queued and re-processed
|
||||
/// when the block is not seen.
|
||||
#[test]
|
||||
fn requeue_unknown_block_gossip_aggregated_attestation_without_import() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN);
|
||||
#[tokio::test]
|
||||
async fn requeue_unknown_block_gossip_aggregated_attestation_without_import() {
|
||||
let mut rig = TestRig::new(SMALL_CHAIN).await;
|
||||
|
||||
// Send the attestation but not the block, and check that it was not imported.
|
||||
|
||||
@@ -755,7 +747,8 @@ fn requeue_unknown_block_gossip_aggregated_attestation_without_import() {
|
||||
|
||||
rig.enqueue_next_block_aggregated_attestation();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_AGGREGATE, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_AGGREGATE, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.naive_aggregation_pool.read().num_items(),
|
||||
@@ -768,7 +761,8 @@ fn requeue_unknown_block_gossip_aggregated_attestation_without_import() {
|
||||
rig.assert_event_journal_with_timeout(
|
||||
&[UNKNOWN_BLOCK_AGGREGATE, WORKER_FREED, NOTHING_TO_DO],
|
||||
Duration::from_secs(1) + QUEUED_ATTESTATION_DELAY,
|
||||
);
|
||||
)
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.op_pool.num_attestations(),
|
||||
@@ -778,10 +772,10 @@ fn requeue_unknown_block_gossip_aggregated_attestation_without_import() {
|
||||
}
|
||||
|
||||
/// Ensure a bunch of valid operations can be imported.
|
||||
#[test]
|
||||
fn import_misc_gossip_ops() {
|
||||
#[tokio::test]
|
||||
async fn import_misc_gossip_ops() {
|
||||
// Exits need the long chain so validators aren't too young to exit.
|
||||
let mut rig = TestRig::new(LONG_CHAIN);
|
||||
let mut rig = TestRig::new(LONG_CHAIN).await;
|
||||
|
||||
/*
|
||||
* Attester slashing
|
||||
@@ -791,7 +785,8 @@ fn import_misc_gossip_ops() {
|
||||
|
||||
rig.enqueue_gossip_attester_slashing();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_ATTESTER_SLASHING, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_ATTESTER_SLASHING, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.op_pool.num_attester_slashings(),
|
||||
@@ -807,7 +802,8 @@ fn import_misc_gossip_ops() {
|
||||
|
||||
rig.enqueue_gossip_proposer_slashing();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_PROPOSER_SLASHING, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_PROPOSER_SLASHING, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.op_pool.num_proposer_slashings(),
|
||||
@@ -823,7 +819,8 @@ fn import_misc_gossip_ops() {
|
||||
|
||||
rig.enqueue_gossip_voluntary_exit();
|
||||
|
||||
rig.assert_event_journal(&[GOSSIP_VOLUNTARY_EXIT, WORKER_FREED, NOTHING_TO_DO]);
|
||||
rig.assert_event_journal(&[GOSSIP_VOLUNTARY_EXIT, WORKER_FREED, NOTHING_TO_DO])
|
||||
.await;
|
||||
|
||||
assert_eq!(
|
||||
rig.chain.op_pool.num_voluntary_exits(),
|
||||
|
||||
Reference in New Issue
Block a user