-
Notifications
You must be signed in to change notification settings - Fork 710
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
statement-distribution: fix filtering of statements for elastic parachains #3879
Merged
Merged
Changes from all commits
Commits
Show all changes
19 commits
Select commit
Hold shift + click to select a range
e3b5192
refactor: move claim queue fetch utils to utils crate
sandreim 01ceb3b
cache all groups per para and remove para:group 1:1 assumption
sandreim 5ed7841
Merge branch 'master' of github.com:paritytech/polkadot-sdk into sand…
sandreim 5f0872f
typo
sandreim 034b61a
fix test build
sandreim 9c91193
testing some local test run weirdness
sandreim f87a624
fix doctest
sandreim 70213c5
remove panic
sandreim 4c66001
add new cluster test
sandreim 21ae63d
add grid test
sandreim e923dac
Merge branch 'master' of github.com:paritytech/polkadot-sdk into sand…
sandreim 27ee145
fmt
sandreim be1a2c7
explicit max_candidate_depth
sandreim b9f1afc
fix test comment
sandreim 17c4025
remove check for scheduled != occupied
sandreim a185390
review feedback
sandreim 39f480d
Merge branch 'master' of github.com:paritytech/polkadot-sdk into sand…
sandreim d14384c
review
sandreim 9de1a04
review
sandreim File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -46,6 +46,7 @@ use polkadot_node_subsystem_util::{ | |
backing_implicit_view::View as ImplicitView, | ||
reputation::ReputationAggregator, | ||
runtime::{request_min_backing_votes, ProspectiveParachainsMode}, | ||
vstaging::fetch_claim_queue, | ||
}; | ||
use polkadot_primitives::{ | ||
AuthorityDiscoveryId, CandidateHash, CompactStatement, CoreIndex, CoreState, GroupIndex, | ||
|
@@ -149,10 +150,9 @@ pub(crate) const REQUEST_RETRY_DELAY: Duration = Duration::from_secs(1); | |
struct PerRelayParentState { | ||
local_validator: Option<LocalValidatorState>, | ||
statement_store: StatementStore, | ||
availability_cores: Vec<CoreState>, | ||
group_rotation_info: GroupRotationInfo, | ||
seconding_limit: usize, | ||
session: SessionIndex, | ||
groups_per_para: HashMap<ParaId, Vec<GroupIndex>>, | ||
} | ||
|
||
impl PerRelayParentState { | ||
|
@@ -563,11 +563,13 @@ pub(crate) async fn handle_active_leaves_update<Context>( | |
activated: &ActivatedLeaf, | ||
leaf_mode: ProspectiveParachainsMode, | ||
) -> JfyiErrorResult<()> { | ||
let seconding_limit = match leaf_mode { | ||
let max_candidate_depth = match leaf_mode { | ||
ProspectiveParachainsMode::Disabled => return Ok(()), | ||
ProspectiveParachainsMode::Enabled { max_candidate_depth, .. } => max_candidate_depth + 1, | ||
ProspectiveParachainsMode::Enabled { max_candidate_depth, .. } => max_candidate_depth, | ||
}; | ||
|
||
let seconding_limit = max_candidate_depth + 1; | ||
|
||
state | ||
.implicit_view | ||
.activate_leaf(ctx.sender(), activated.hash) | ||
|
@@ -693,15 +695,23 @@ pub(crate) async fn handle_active_leaves_update<Context>( | |
} | ||
}); | ||
|
||
let groups_per_para = determine_groups_per_para( | ||
ctx.sender(), | ||
new_relay_parent, | ||
availability_cores, | ||
group_rotation_info, | ||
max_candidate_depth, | ||
) | ||
.await; | ||
|
||
state.per_relay_parent.insert( | ||
new_relay_parent, | ||
PerRelayParentState { | ||
local_validator, | ||
statement_store: StatementStore::new(&per_session.groups), | ||
availability_cores, | ||
group_rotation_info, | ||
seconding_limit, | ||
session: session_index, | ||
groups_per_para, | ||
}, | ||
); | ||
} | ||
|
@@ -2126,17 +2136,64 @@ async fn provide_candidate_to_grid<Context>( | |
} | ||
} | ||
|
||
fn group_for_para( | ||
availability_cores: &[CoreState], | ||
group_rotation_info: &GroupRotationInfo, | ||
para_id: ParaId, | ||
) -> Option<GroupIndex> { | ||
// Note: this won't work well for on-demand parachains as it assumes that core assignments are | ||
// fixed across blocks. | ||
let core_index = availability_cores.iter().position(|c| c.para_id() == Some(para_id)); | ||
// Utility function to populate per relay parent `ParaId` to `GroupIndex` mappings. | ||
async fn determine_groups_per_para( | ||
sender: &mut impl overseer::StatementDistributionSenderTrait, | ||
relay_parent: Hash, | ||
availability_cores: Vec<CoreState>, | ||
group_rotation_info: GroupRotationInfo, | ||
max_candidate_depth: usize, | ||
) -> HashMap<ParaId, Vec<GroupIndex>> { | ||
let maybe_claim_queue = fetch_claim_queue(sender, relay_parent) | ||
.await | ||
.unwrap_or_else(|err| { | ||
gum::debug!( | ||
target: LOG_TARGET, | ||
?relay_parent, | ||
?err, | ||
"determine_groups_per_para: `claim_queue` API not available, falling back to iterating availability cores" | ||
); | ||
None | ||
}); | ||
|
||
let n_cores = availability_cores.len(); | ||
|
||
// Determine the core indices occupied by each para at the current relay parent. To support | ||
// on-demand parachains we also consider the core indices at next block if core has a candidate | ||
// pending availability. | ||
let para_core_indices: Vec<_> = if let Some(claim_queue) = maybe_claim_queue { | ||
claim_queue | ||
.into_iter() | ||
.filter_map(|(core_index, paras)| Some((*paras.front()?, core_index))) | ||
.collect() | ||
} else { | ||
availability_cores | ||
.into_iter() | ||
.enumerate() | ||
.filter_map(|(index, core)| match core { | ||
CoreState::Scheduled(scheduled_core) => | ||
Some((scheduled_core.para_id, CoreIndex(index as u32))), | ||
CoreState::Occupied(occupied_core) => | ||
if max_candidate_depth >= 1 { | ||
occupied_core | ||
.next_up_on_available | ||
.map(|scheduled_core| (scheduled_core.para_id, CoreIndex(index as u32))) | ||
} else { | ||
None | ||
}, | ||
CoreState::Free => None, | ||
}) | ||
.collect() | ||
}; | ||
|
||
core_index | ||
.map(|c| group_rotation_info.group_for_core(CoreIndex(c as _), availability_cores.len())) | ||
let mut groups_per_para = HashMap::new(); | ||
// Map from `CoreIndex` to `GroupIndex` and collect as `HashMap`. | ||
for (para, core_index) in para_core_indices { | ||
let group_index = group_rotation_info.group_for_core(core_index, n_cores); | ||
groups_per_para.entry(para).or_insert_with(Vec::new).push(group_index) | ||
} | ||
|
||
groups_per_para | ||
} | ||
|
||
#[overseer::contextbounds(StatementDistribution, prefix=self::overseer)] | ||
|
@@ -2192,18 +2249,23 @@ async fn fragment_tree_update_inner<Context>( | |
let confirmed_candidate = state.candidates.get_confirmed(&candidate_hash); | ||
let prs = state.per_relay_parent.get_mut(&receipt.descriptor().relay_parent); | ||
if let (Some(confirmed), Some(prs)) = (confirmed_candidate, prs) { | ||
let group_index = group_for_para( | ||
&prs.availability_cores, | ||
&prs.group_rotation_info, | ||
receipt.descriptor().para_id, | ||
); | ||
|
||
let per_session = state.per_session.get(&prs.session); | ||
if let (Some(per_session), Some(group_index)) = (per_session, group_index) { | ||
let group_index = confirmed.group_index(); | ||
|
||
// Sanity check if group_index is valid for this para at relay parent. | ||
let Some(expected_groups) = prs.groups_per_para.get(&receipt.descriptor().para_id) | ||
else { | ||
continue | ||
}; | ||
if !expected_groups.iter().any(|g| *g == group_index) { | ||
continue | ||
} | ||
|
||
if let Some(per_session) = per_session { | ||
send_backing_fresh_statements( | ||
ctx, | ||
candidate_hash, | ||
group_index, | ||
confirmed.group_index(), | ||
&receipt.descriptor().relay_parent, | ||
prs, | ||
confirmed, | ||
|
@@ -2311,13 +2373,12 @@ async fn handle_incoming_manifest_common<'a, Context>( | |
Some(x) => x, | ||
}; | ||
|
||
let expected_group = group_for_para( | ||
&relay_parent_state.availability_cores, | ||
&relay_parent_state.group_rotation_info, | ||
para_id, | ||
); | ||
let Some(expected_groups) = relay_parent_state.groups_per_para.get(¶_id) else { | ||
modify_reputation(reputation, ctx.sender(), peer, COST_MALFORMED_MANIFEST).await; | ||
return None | ||
}; | ||
|
||
if expected_group != Some(manifest_summary.claimed_group_index) { | ||
if !expected_groups.iter().any(|g| g == &manifest_summary.claimed_group_index) { | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Nice! |
||
modify_reputation(reputation, ctx.sender(), peer, COST_MALFORMED_MANIFEST).await; | ||
return None | ||
} | ||
|
@@ -3037,13 +3098,11 @@ pub(crate) async fn handle_response<Context>( | |
relay_parent_state.session, | ||
|v| per_session.session_info.validators.get(v).map(|x| x.clone()), | ||
|para, g_index| { | ||
let expected_group = group_for_para( | ||
&relay_parent_state.availability_cores, | ||
&relay_parent_state.group_rotation_info, | ||
para, | ||
); | ||
let Some(expected_groups) = relay_parent_state.groups_per_para.get(¶) else { | ||
return false | ||
}; | ||
|
||
Some(g_index) == expected_group | ||
expected_groups.iter().any(|g| g == &g_index) | ||
}, | ||
disabled_mask, | ||
); | ||
|
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Ok, my thinking was to move all fetches here, including
availability_cores
for consistency. It's weird if we pass in one thing, but fetch the other our selves. I know this is used in one other place as well (wrongly), but given that we pass per value already, there is not much gain in avoiding the double fetch.There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LocalValidatorState is built outside this fn and requires
availability_cores