mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-06-21 07:31:03 +00:00
002d9260f9
**Update:** Pushed additional changes based on the review comments. **This pull request fixes various spelling mistakes in this repository.** Most of the changes are contained in the first **3** commits: - `Fix spelling mistakes in comments and docs` - `Fix spelling mistakes in test names` - `Fix spelling mistakes in error messages, panic messages, logs and tracing` Other source code spelling mistakes are separated into individual commits for easier reviewing: - `Fix the spelling of 'authority'` - `Fix the spelling of 'REASONABLE_HEADERS_IN_JUSTIFICATION_ANCESTRY'` - `Fix the spelling of 'prev_enqueud_messages'` - `Fix the spelling of 'endpoint'` - `Fix the spelling of 'children'` - `Fix the spelling of 'PenpalSiblingSovereignAccount'` - `Fix the spelling of 'PenpalSudoAccount'` - `Fix the spelling of 'insufficient'` - `Fix the spelling of 'PalletXcmExtrinsicsBenchmark'` - `Fix the spelling of 'subtracted'` - `Fix the spelling of 'CandidatePendingAvailability'` - `Fix the spelling of 'exclusive'` - `Fix the spelling of 'until'` - `Fix the spelling of 'discriminator'` - `Fix the spelling of 'nonexistent'` - `Fix the spelling of 'subsystem'` - `Fix the spelling of 'indices'` - `Fix the spelling of 'committed'` - `Fix the spelling of 'topology'` - `Fix the spelling of 'response'` - `Fix the spelling of 'beneficiary'` - `Fix the spelling of 'formatted'` - `Fix the spelling of 'UNKNOWN_PROOF_REQUEST'` - `Fix the spelling of 'succeeded'` - `Fix the spelling of 'reopened'` - `Fix the spelling of 'proposer'` - `Fix the spelling of 'InstantiationNonce'` - `Fix the spelling of 'depositor'` - `Fix the spelling of 'expiration'` - `Fix the spelling of 'phantom'` - `Fix the spelling of 'AggregatedKeyValue'` - `Fix the spelling of 'randomness'` - `Fix the spelling of 'defendant'` - `Fix the spelling of 'AquaticMammal'` - `Fix the spelling of 'transactions'` - `Fix the spelling of 'PassingTracingSubscriber'` - `Fix the spelling of 'TxSignaturePayload'` - `Fix the spelling of 'versioning'` - `Fix the spelling of 'descendant'` - `Fix the spelling of 'overridden'` - `Fix the spelling of 'network'` Let me know if this structure is adequate. **Note:** The usage of the words `Merkle`, `Merkelize`, `Merklization`, `Merkelization`, `Merkleization`, is somewhat inconsistent but I left it as it is. ~~**Note:** In some places the term `Receival` is used to refer to message reception, IMO `Reception` is the correct word here, but I left it as it is.~~ ~~**Note:** In some places the term `Overlayed` is used instead of the more acceptable version `Overlaid` but I also left it as it is.~~ ~~**Note:** In some places the term `Applyable` is used instead of the correct version `Applicable` but I also left it as it is.~~ **Note:** Some usage of British vs American english e.g. `judgement` vs `judgment`, `initialise` vs `initialize`, `optimise` vs `optimize` etc. are both present in different places, but I suppose that's understandable given the number of contributors. ~~**Note:** There is a spelling mistake in `.github/CODEOWNERS` but it triggers errors in CI when I make changes to it, so I left it as it is.~~
425 lines
15 KiB
Rust
425 lines
15 KiB
Rust
// Copyright (C) Parity Technologies (UK) Ltd.
|
|
// This file is part of Parity Bridges Common.
|
|
|
|
// Parity Bridges Common is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// Parity Bridges Common is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Parity Bridges Common. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//! Everything about outgoing messages sending.
|
|
|
|
use crate::{Config, LOG_TARGET};
|
|
|
|
use bp_messages::{DeliveredMessages, LaneId, MessageNonce, OutboundLaneData, UnrewardedRelayer};
|
|
use codec::{Decode, Encode};
|
|
use frame_support::{
|
|
weights::{RuntimeDbWeight, Weight},
|
|
BoundedVec, PalletError,
|
|
};
|
|
use num_traits::Zero;
|
|
use scale_info::TypeInfo;
|
|
use sp_runtime::RuntimeDebug;
|
|
use sp_std::collections::vec_deque::VecDeque;
|
|
|
|
/// Outbound lane storage.
|
|
pub trait OutboundLaneStorage {
|
|
type StoredMessagePayload;
|
|
|
|
/// Lane id.
|
|
fn id(&self) -> LaneId;
|
|
/// Get lane data from the storage.
|
|
fn data(&self) -> OutboundLaneData;
|
|
/// Update lane data in the storage.
|
|
fn set_data(&mut self, data: OutboundLaneData);
|
|
/// Returns saved outbound message payload.
|
|
#[cfg(test)]
|
|
fn message(&self, nonce: &MessageNonce) -> Option<Self::StoredMessagePayload>;
|
|
/// Save outbound message in the storage.
|
|
fn save_message(&mut self, nonce: MessageNonce, message_payload: Self::StoredMessagePayload);
|
|
/// Remove outbound message from the storage.
|
|
fn remove_message(&mut self, nonce: &MessageNonce);
|
|
}
|
|
|
|
/// Outbound message data wrapper that implements `MaxEncodedLen`.
|
|
pub type StoredMessagePayload<T, I> = BoundedVec<u8, <T as Config<I>>::MaximalOutboundPayloadSize>;
|
|
|
|
/// Result of messages receival confirmation.
|
|
#[derive(Encode, Decode, RuntimeDebug, PartialEq, Eq, PalletError, TypeInfo)]
|
|
pub enum ReceptionConfirmationError {
|
|
/// Bridged chain is trying to confirm more messages than we have generated. May be a result
|
|
/// of invalid bridged chain storage.
|
|
FailedToConfirmFutureMessages,
|
|
/// The unrewarded relayers vec contains an empty entry. May be a result of invalid bridged
|
|
/// chain storage.
|
|
EmptyUnrewardedRelayerEntry,
|
|
/// The unrewarded relayers vec contains non-consecutive entries. May be a result of invalid
|
|
/// bridged chain storage.
|
|
NonConsecutiveUnrewardedRelayerEntries,
|
|
/// The chain has more messages that need to be confirmed than there is in the proof.
|
|
TryingToConfirmMoreMessagesThanExpected,
|
|
}
|
|
|
|
/// Outbound messages lane.
|
|
pub struct OutboundLane<S> {
|
|
storage: S,
|
|
}
|
|
|
|
impl<S: OutboundLaneStorage> OutboundLane<S> {
|
|
/// Create new outbound lane backed by given storage.
|
|
pub fn new(storage: S) -> Self {
|
|
OutboundLane { storage }
|
|
}
|
|
|
|
/// Get this lane data.
|
|
pub fn data(&self) -> OutboundLaneData {
|
|
self.storage.data()
|
|
}
|
|
|
|
/// Send message over lane.
|
|
///
|
|
/// Returns new message nonce.
|
|
pub fn send_message(&mut self, message_payload: S::StoredMessagePayload) -> MessageNonce {
|
|
let mut data = self.storage.data();
|
|
let nonce = data.latest_generated_nonce + 1;
|
|
data.latest_generated_nonce = nonce;
|
|
|
|
self.storage.save_message(nonce, message_payload);
|
|
self.storage.set_data(data);
|
|
|
|
nonce
|
|
}
|
|
|
|
/// Confirm messages delivery.
|
|
pub fn confirm_delivery<RelayerId>(
|
|
&mut self,
|
|
max_allowed_messages: MessageNonce,
|
|
latest_delivered_nonce: MessageNonce,
|
|
relayers: &VecDeque<UnrewardedRelayer<RelayerId>>,
|
|
) -> Result<Option<DeliveredMessages>, ReceptionConfirmationError> {
|
|
let mut data = self.storage.data();
|
|
let confirmed_messages = DeliveredMessages {
|
|
begin: data.latest_received_nonce.saturating_add(1),
|
|
end: latest_delivered_nonce,
|
|
};
|
|
if confirmed_messages.total_messages() == 0 {
|
|
return Ok(None)
|
|
}
|
|
if confirmed_messages.end > data.latest_generated_nonce {
|
|
return Err(ReceptionConfirmationError::FailedToConfirmFutureMessages)
|
|
}
|
|
if confirmed_messages.total_messages() > max_allowed_messages {
|
|
// that the relayer has declared correct number of messages that the proof contains (it
|
|
// is checked outside of the function). But it may happen (but only if this/bridged
|
|
// chain storage is corrupted, though) that the actual number of confirmed messages if
|
|
// larger than declared. This would mean that 'reward loop' will take more time than the
|
|
// weight formula accounts, so we can't allow that.
|
|
log::trace!(
|
|
target: LOG_TARGET,
|
|
"Messages delivery proof contains too many messages to confirm: {} vs declared {}",
|
|
confirmed_messages.total_messages(),
|
|
max_allowed_messages,
|
|
);
|
|
return Err(ReceptionConfirmationError::TryingToConfirmMoreMessagesThanExpected)
|
|
}
|
|
|
|
ensure_unrewarded_relayers_are_correct(confirmed_messages.end, relayers)?;
|
|
|
|
data.latest_received_nonce = confirmed_messages.end;
|
|
self.storage.set_data(data);
|
|
|
|
Ok(Some(confirmed_messages))
|
|
}
|
|
|
|
/// Prune at most `max_messages_to_prune` already received messages.
|
|
///
|
|
/// Returns weight, consumed by messages pruning and lane state update.
|
|
pub fn prune_messages(
|
|
&mut self,
|
|
db_weight: RuntimeDbWeight,
|
|
mut remaining_weight: Weight,
|
|
) -> Weight {
|
|
let write_weight = db_weight.writes(1);
|
|
let two_writes_weight = write_weight + write_weight;
|
|
let mut spent_weight = Weight::zero();
|
|
let mut data = self.storage.data();
|
|
while remaining_weight.all_gte(two_writes_weight) &&
|
|
data.oldest_unpruned_nonce <= data.latest_received_nonce
|
|
{
|
|
self.storage.remove_message(&data.oldest_unpruned_nonce);
|
|
|
|
spent_weight += write_weight;
|
|
remaining_weight -= write_weight;
|
|
data.oldest_unpruned_nonce += 1;
|
|
}
|
|
|
|
if !spent_weight.is_zero() {
|
|
spent_weight += write_weight;
|
|
self.storage.set_data(data);
|
|
}
|
|
|
|
spent_weight
|
|
}
|
|
}
|
|
|
|
/// Verifies unrewarded relayers vec.
|
|
///
|
|
/// Returns `Err(_)` if unrewarded relayers vec contains invalid data, meaning that the bridged
|
|
/// chain has invalid runtime storage.
|
|
fn ensure_unrewarded_relayers_are_correct<RelayerId>(
|
|
latest_received_nonce: MessageNonce,
|
|
relayers: &VecDeque<UnrewardedRelayer<RelayerId>>,
|
|
) -> Result<(), ReceptionConfirmationError> {
|
|
let mut expected_entry_begin = relayers.front().map(|entry| entry.messages.begin);
|
|
for entry in relayers {
|
|
// unrewarded relayer entry must have at least 1 unconfirmed message
|
|
// (guaranteed by the `InboundLane::receive_message()`)
|
|
if entry.messages.end < entry.messages.begin {
|
|
return Err(ReceptionConfirmationError::EmptyUnrewardedRelayerEntry)
|
|
}
|
|
// every entry must confirm range of messages that follows previous entry range
|
|
// (guaranteed by the `InboundLane::receive_message()`)
|
|
if expected_entry_begin != Some(entry.messages.begin) {
|
|
return Err(ReceptionConfirmationError::NonConsecutiveUnrewardedRelayerEntries)
|
|
}
|
|
expected_entry_begin = entry.messages.end.checked_add(1);
|
|
// entry can't confirm messages larger than `inbound_lane_data.latest_received_nonce()`
|
|
// (guaranteed by the `InboundLane::receive_message()`)
|
|
if entry.messages.end > latest_received_nonce {
|
|
return Err(ReceptionConfirmationError::FailedToConfirmFutureMessages)
|
|
}
|
|
}
|
|
|
|
Ok(())
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
use crate::{
|
|
mock::{
|
|
outbound_message_data, run_test, unrewarded_relayer, TestRelayer, TestRuntime,
|
|
REGULAR_PAYLOAD, TEST_LANE_ID,
|
|
},
|
|
outbound_lane,
|
|
};
|
|
use frame_support::weights::constants::RocksDbWeight;
|
|
use sp_std::ops::RangeInclusive;
|
|
|
|
fn unrewarded_relayers(
|
|
nonces: RangeInclusive<MessageNonce>,
|
|
) -> VecDeque<UnrewardedRelayer<TestRelayer>> {
|
|
vec![unrewarded_relayer(*nonces.start(), *nonces.end(), 0)]
|
|
.into_iter()
|
|
.collect()
|
|
}
|
|
|
|
fn delivered_messages(nonces: RangeInclusive<MessageNonce>) -> DeliveredMessages {
|
|
DeliveredMessages { begin: *nonces.start(), end: *nonces.end() }
|
|
}
|
|
|
|
fn assert_3_messages_confirmation_fails(
|
|
latest_received_nonce: MessageNonce,
|
|
relayers: &VecDeque<UnrewardedRelayer<TestRelayer>>,
|
|
) -> Result<Option<DeliveredMessages>, ReceptionConfirmationError> {
|
|
run_test(|| {
|
|
let mut lane = outbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
assert_eq!(lane.storage.data().latest_generated_nonce, 3);
|
|
assert_eq!(lane.storage.data().latest_received_nonce, 0);
|
|
let result = lane.confirm_delivery(3, latest_received_nonce, relayers);
|
|
assert_eq!(lane.storage.data().latest_generated_nonce, 3);
|
|
assert_eq!(lane.storage.data().latest_received_nonce, 0);
|
|
result
|
|
})
|
|
}
|
|
|
|
#[test]
|
|
fn send_message_works() {
|
|
run_test(|| {
|
|
let mut lane = outbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
assert_eq!(lane.storage.data().latest_generated_nonce, 0);
|
|
assert_eq!(lane.send_message(outbound_message_data(REGULAR_PAYLOAD)), 1);
|
|
assert!(lane.storage.message(&1).is_some());
|
|
assert_eq!(lane.storage.data().latest_generated_nonce, 1);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn confirm_delivery_works() {
|
|
run_test(|| {
|
|
let mut lane = outbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
assert_eq!(lane.send_message(outbound_message_data(REGULAR_PAYLOAD)), 1);
|
|
assert_eq!(lane.send_message(outbound_message_data(REGULAR_PAYLOAD)), 2);
|
|
assert_eq!(lane.send_message(outbound_message_data(REGULAR_PAYLOAD)), 3);
|
|
assert_eq!(lane.storage.data().latest_generated_nonce, 3);
|
|
assert_eq!(lane.storage.data().latest_received_nonce, 0);
|
|
assert_eq!(
|
|
lane.confirm_delivery(3, 3, &unrewarded_relayers(1..=3)),
|
|
Ok(Some(delivered_messages(1..=3))),
|
|
);
|
|
assert_eq!(lane.storage.data().latest_generated_nonce, 3);
|
|
assert_eq!(lane.storage.data().latest_received_nonce, 3);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn confirm_delivery_rejects_nonce_lesser_than_latest_received() {
|
|
run_test(|| {
|
|
let mut lane = outbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
assert_eq!(lane.storage.data().latest_generated_nonce, 3);
|
|
assert_eq!(lane.storage.data().latest_received_nonce, 0);
|
|
assert_eq!(
|
|
lane.confirm_delivery(3, 3, &unrewarded_relayers(1..=3)),
|
|
Ok(Some(delivered_messages(1..=3))),
|
|
);
|
|
assert_eq!(lane.confirm_delivery(3, 3, &unrewarded_relayers(1..=3)), Ok(None),);
|
|
assert_eq!(lane.storage.data().latest_generated_nonce, 3);
|
|
assert_eq!(lane.storage.data().latest_received_nonce, 3);
|
|
|
|
assert_eq!(lane.confirm_delivery(1, 2, &unrewarded_relayers(1..=1)), Ok(None),);
|
|
assert_eq!(lane.storage.data().latest_generated_nonce, 3);
|
|
assert_eq!(lane.storage.data().latest_received_nonce, 3);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn confirm_delivery_rejects_nonce_larger_than_last_generated() {
|
|
assert_eq!(
|
|
assert_3_messages_confirmation_fails(10, &unrewarded_relayers(1..=10),),
|
|
Err(ReceptionConfirmationError::FailedToConfirmFutureMessages),
|
|
);
|
|
}
|
|
|
|
#[test]
|
|
fn confirm_delivery_fails_if_entry_confirms_future_messages() {
|
|
assert_eq!(
|
|
assert_3_messages_confirmation_fails(
|
|
3,
|
|
&unrewarded_relayers(1..=1)
|
|
.into_iter()
|
|
.chain(unrewarded_relayers(2..=30).into_iter())
|
|
.chain(unrewarded_relayers(3..=3).into_iter())
|
|
.collect(),
|
|
),
|
|
Err(ReceptionConfirmationError::FailedToConfirmFutureMessages),
|
|
);
|
|
}
|
|
|
|
#[test]
|
|
#[allow(clippy::reversed_empty_ranges)]
|
|
fn confirm_delivery_fails_if_entry_is_empty() {
|
|
assert_eq!(
|
|
assert_3_messages_confirmation_fails(
|
|
3,
|
|
&unrewarded_relayers(1..=1)
|
|
.into_iter()
|
|
.chain(unrewarded_relayers(2..=1).into_iter())
|
|
.chain(unrewarded_relayers(2..=3).into_iter())
|
|
.collect(),
|
|
),
|
|
Err(ReceptionConfirmationError::EmptyUnrewardedRelayerEntry),
|
|
);
|
|
}
|
|
|
|
#[test]
|
|
fn confirm_delivery_fails_if_entries_are_non_consecutive() {
|
|
assert_eq!(
|
|
assert_3_messages_confirmation_fails(
|
|
3,
|
|
&unrewarded_relayers(1..=1)
|
|
.into_iter()
|
|
.chain(unrewarded_relayers(3..=3).into_iter())
|
|
.chain(unrewarded_relayers(2..=2).into_iter())
|
|
.collect(),
|
|
),
|
|
Err(ReceptionConfirmationError::NonConsecutiveUnrewardedRelayerEntries),
|
|
);
|
|
}
|
|
|
|
#[test]
|
|
fn prune_messages_works() {
|
|
run_test(|| {
|
|
let mut lane = outbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
// when lane is empty, nothing is pruned
|
|
assert_eq!(
|
|
lane.prune_messages(RocksDbWeight::get(), RocksDbWeight::get().writes(101)),
|
|
Weight::zero()
|
|
);
|
|
assert_eq!(lane.storage.data().oldest_unpruned_nonce, 1);
|
|
// when nothing is confirmed, nothing is pruned
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
assert!(lane.storage.message(&1).is_some());
|
|
assert!(lane.storage.message(&2).is_some());
|
|
assert!(lane.storage.message(&3).is_some());
|
|
assert_eq!(
|
|
lane.prune_messages(RocksDbWeight::get(), RocksDbWeight::get().writes(101)),
|
|
Weight::zero()
|
|
);
|
|
assert_eq!(lane.storage.data().oldest_unpruned_nonce, 1);
|
|
// after confirmation, some messages are received
|
|
assert_eq!(
|
|
lane.confirm_delivery(2, 2, &unrewarded_relayers(1..=2)),
|
|
Ok(Some(delivered_messages(1..=2))),
|
|
);
|
|
assert_eq!(
|
|
lane.prune_messages(RocksDbWeight::get(), RocksDbWeight::get().writes(101)),
|
|
RocksDbWeight::get().writes(3),
|
|
);
|
|
assert!(lane.storage.message(&1).is_none());
|
|
assert!(lane.storage.message(&2).is_none());
|
|
assert!(lane.storage.message(&3).is_some());
|
|
assert_eq!(lane.storage.data().oldest_unpruned_nonce, 3);
|
|
// after last message is confirmed, everything is pruned
|
|
assert_eq!(
|
|
lane.confirm_delivery(1, 3, &unrewarded_relayers(3..=3)),
|
|
Ok(Some(delivered_messages(3..=3))),
|
|
);
|
|
assert_eq!(
|
|
lane.prune_messages(RocksDbWeight::get(), RocksDbWeight::get().writes(101)),
|
|
RocksDbWeight::get().writes(2),
|
|
);
|
|
assert!(lane.storage.message(&1).is_none());
|
|
assert!(lane.storage.message(&2).is_none());
|
|
assert!(lane.storage.message(&3).is_none());
|
|
assert_eq!(lane.storage.data().oldest_unpruned_nonce, 4);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn confirm_delivery_detects_when_more_than_expected_messages_are_confirmed() {
|
|
run_test(|| {
|
|
let mut lane = outbound_lane::<TestRuntime, _>(TEST_LANE_ID);
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
lane.send_message(outbound_message_data(REGULAR_PAYLOAD));
|
|
assert_eq!(
|
|
lane.confirm_delivery(0, 3, &unrewarded_relayers(1..=3)),
|
|
Err(ReceptionConfirmationError::TryingToConfirmMoreMessagesThanExpected),
|
|
);
|
|
assert_eq!(
|
|
lane.confirm_delivery(2, 3, &unrewarded_relayers(1..=3)),
|
|
Err(ReceptionConfirmationError::TryingToConfirmMoreMessagesThanExpected),
|
|
);
|
|
assert_eq!(
|
|
lane.confirm_delivery(3, 3, &unrewarded_relayers(1..=3)),
|
|
Ok(Some(delivered_messages(1..=3))),
|
|
);
|
|
});
|
|
}
|
|
}
|