mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-31 22:41:02 +00:00
Use same fmt and clippy configs as in Substrate (#7611)
* Use same rustfmt.toml as Substrate Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * format format file Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Format with new config Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Add Substrate Clippy config Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Print Clippy version in CI Otherwise its difficult to reproduce locally. Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Make fmt happy Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> * Update node/core/pvf/src/error.rs Co-authored-by: Tsvetomir Dimitrov <tsvetomir@parity.io> * Update node/core/pvf/src/error.rs Co-authored-by: Tsvetomir Dimitrov <tsvetomir@parity.io> --------- Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> Co-authored-by: Tsvetomir Dimitrov <tsvetomir@parity.io>
This commit is contained in:
Oliver Tale-Yazdi
committed by
GitHub
GitHub
parent
ac435c96cf
commit
342d720573
@@ -102,11 +102,13 @@ impl RecentlyOutdated {
|
||||
// Aggression has 3 levels:
|
||||
//
|
||||
// * Aggression Level 0: The basic behaviors described above.
|
||||
// * Aggression Level 1: The originator of a message sends to all peers. Other peers follow the rules above.
|
||||
// * Aggression Level 2: All peers send all messages to all their row and column neighbors.
|
||||
// This means that each validator will, on average, receive each message approximately `2*sqrt(n)` times.
|
||||
// The aggression level of messages pertaining to a block increases when that block is unfinalized and
|
||||
// is a child of the finalized block.
|
||||
// * Aggression Level 1: The originator of a message sends to all peers. Other peers follow the
|
||||
// rules above.
|
||||
// * Aggression Level 2: All peers send all messages to all their row and column neighbors. This
|
||||
// means that each validator will, on average, receive each message approximately `2*sqrt(n)`
|
||||
// times.
|
||||
// The aggression level of messages pertaining to a block increases when that block is unfinalized
|
||||
// and is a child of the finalized block.
|
||||
// This means that only one block at a time has its messages propagated with aggression > 0.
|
||||
//
|
||||
// A note on aggression thresholds: changes in propagation apply only to blocks which are the
|
||||
@@ -120,7 +122,8 @@ impl RecentlyOutdated {
|
||||
struct AggressionConfig {
|
||||
/// Aggression level 1: all validators send all their own messages to all peers.
|
||||
l1_threshold: Option<BlockNumber>,
|
||||
/// Aggression level 2: level 1 + all validators send all messages to all peers in the X and Y dimensions.
|
||||
/// Aggression level 2: level 1 + all validators send all messages to all peers in the X and Y
|
||||
/// dimensions.
|
||||
l2_threshold: Option<BlockNumber>,
|
||||
/// How often to re-send messages to all targeted recipients.
|
||||
/// This applies to all unfinalized blocks.
|
||||
@@ -167,11 +170,12 @@ struct State {
|
||||
blocks: HashMap<Hash, BlockEntry>,
|
||||
|
||||
/// Our view updates to our peers can race with `NewBlocks` updates. We store messages received
|
||||
/// against the directly mentioned blocks in our view in this map until `NewBlocks` is received.
|
||||
/// against the directly mentioned blocks in our view in this map until `NewBlocks` is
|
||||
/// received.
|
||||
///
|
||||
/// As long as the parent is already in the `blocks` map and `NewBlocks` messages aren't delayed
|
||||
/// by more than a block length, this strategy will work well for mitigating the race. This is
|
||||
/// also a race that occurs typically on local networks.
|
||||
/// As long as the parent is already in the `blocks` map and `NewBlocks` messages aren't
|
||||
/// delayed by more than a block length, this strategy will work well for mitigating the race.
|
||||
/// This is also a race that occurs typically on local networks.
|
||||
pending_known: HashMap<Hash, Vec<(PeerId, PendingMessage)>>,
|
||||
|
||||
/// Peer data is partially stored here, and partially inline within the [`BlockEntry`]s
|
||||
@@ -947,7 +951,8 @@ impl State {
|
||||
}
|
||||
}
|
||||
|
||||
// Invariant: to our knowledge, none of the peers except for the `source` know about the assignment.
|
||||
// Invariant: to our knowledge, none of the peers except for the `source` know about the
|
||||
// assignment.
|
||||
metrics.on_assignment_imported();
|
||||
|
||||
let topology = self.topologies.get_topology(entry.session);
|
||||
@@ -1239,7 +1244,8 @@ impl State {
|
||||
}
|
||||
}
|
||||
|
||||
// Invariant: to our knowledge, none of the peers except for the `source` know about the approval.
|
||||
// Invariant: to our knowledge, none of the peers except for the `source` know about the
|
||||
// approval.
|
||||
metrics.on_approval_imported();
|
||||
|
||||
let required_routing = match entry.candidates.get_mut(candidate_index as usize) {
|
||||
@@ -1925,9 +1931,9 @@ const fn ensure_size_not_zero(size: usize) -> usize {
|
||||
}
|
||||
|
||||
/// The maximum amount of assignments per batch is 33% of maximum allowed by protocol.
|
||||
/// This is an arbitrary value. Bumping this up increases the maximum amount of approvals or assignments
|
||||
/// we send in a single message to peers. Exceeding `MAX_NOTIFICATION_SIZE` will violate the protocol
|
||||
/// configuration.
|
||||
/// This is an arbitrary value. Bumping this up increases the maximum amount of approvals or
|
||||
/// assignments we send in a single message to peers. Exceeding `MAX_NOTIFICATION_SIZE` will violate
|
||||
/// the protocol configuration.
|
||||
pub const MAX_ASSIGNMENT_BATCH_SIZE: usize = ensure_size_not_zero(
|
||||
MAX_NOTIFICATION_SIZE as usize /
|
||||
std::mem::size_of::<(IndirectAssignmentCert, CandidateIndex)>() /
|
||||
|
||||
Reference in New Issue
Block a user