mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-06-18 15:21:05 +00:00
Use Message Queue as DMP and XCMP dispatch queue (#1246)
(imported from https://github.com/paritytech/cumulus/pull/2157) ## Changes This MR refactores the XCMP, Parachains System and DMP pallets to use the [MessageQueue](https://github.com/paritytech/substrate/pull/12485) for delayed execution of incoming messages. The DMP pallet is entirely replaced by the MQ and thereby removed. This allows for PoV-bounded execution and resolves a number of issues that stem from the current work-around. All System Parachains adopt this change. The most important changes are in `primitives/core/src/lib.rs`, `parachains/common/src/process_xcm_message.rs`, `pallets/parachain-system/src/lib.rs`, `pallets/xcmp-queue/src/lib.rs` and the runtime configs. ### DMP Queue Pallet The pallet got removed and its logic refactored into parachain-system. Overweight message management can be done directly through the MQ pallet. Final undeployment migrations are provided by `cumulus_pallet_dmp_queue::UndeployDmpQueue` and `DeleteDmpQueue` that can be configured with an aux config trait like: ```rust parameter_types! { pub const DmpQueuePalletName: &'static str = \"DmpQueue\" < CHANGE ME; pub const RelayOrigin: AggregateMessageOrigin = AggregateMessageOrigin::Parent; } impl cumulus_pallet_dmp_queue::MigrationConfig for Runtime { type PalletName = DmpQueuePalletName; type DmpHandler = frame_support::traits::EnqueueWithOrigin<MessageQueue, RelayOrigin>; type DbWeight = <Runtime as frame_system::Config>::DbWeight; } // And adding them to your Migrations tuple: pub type Migrations = ( ... cumulus_pallet_dmp_queue::UndeployDmpQueue<Runtime>, cumulus_pallet_dmp_queue::DeleteDmpQueue<Runtime>, ); ``` ### XCMP Queue pallet Removed all dispatch queue functionality. Incoming XCMP messages are now either: Immediately handled if they are Signals, enqueued into the MQ pallet otherwise. New config items for the XCMP queue pallet: ```rust /// The actual queue implementation that retains the messages for later processing. type XcmpQueue: EnqueueMessage<ParaId>; /// How a XCM over HRMP from a sibling parachain should be processed. type XcmpProcessor: ProcessMessage<Origin = ParaId>; /// The maximal number of suspended XCMP channels at the same time. #[pallet::constant] type MaxInboundSuspended: Get<u32>; ``` How to configure those: ```rust // Use the MessageQueue pallet to store messages for later processing. The `TransformOrigin` is needed since // the MQ pallet itself operators on `AggregateMessageOrigin` but we want to enqueue `ParaId`s. type XcmpQueue = TransformOrigin<MessageQueue, AggregateMessageOrigin, ParaId, ParaIdToSibling>; // Process XCMP messages from siblings. This is type-safe to only accept `ParaId`s. They will be dispatched // with origin `Junction::Sibling(…)`. type XcmpProcessor = ProcessFromSibling< ProcessXcmMessage< AggregateMessageOrigin, xcm_executor::XcmExecutor<xcm_config::XcmConfig>, RuntimeCall, >, >; // Not really important what to choose here. Just something larger than the maximal number of channels. type MaxInboundSuspended = sp_core::ConstU32<1_000>; ``` The `InboundXcmpStatus` storage item was replaced by `InboundXcmpSuspended` since it now only tracks inbound queue suspension and no message indices anymore. Now only sends the most recent channel `Signals`, as all prio ones are out-dated anyway. ### Parachain System pallet For `DMP` messages instead of forwarding them to the `DMP` pallet, it now pushes them to the configured `DmpQueue`. The message processing which was triggered in `set_validation_data` is now being done by the MQ pallet `on_initialize`. XCMP messages are still handed off to the `XcmpMessageHandler` (XCMP-Queue pallet) - no change here. New config items for the parachain system pallet: ```rust /// Queues inbound downward messages for delayed processing. /// /// Analogous to the `XcmpQueue` of the XCMP queue pallet. type DmpQueue: EnqueueMessage<AggregateMessageOrigin>; ``` How to configure: ```rust /// Use the MQ pallet to store DMP messages for delayed processing. type DmpQueue = MessageQueue; ``` ## Message Flow The flow of messages on the parachain side. Messages come in from the left via the `Validation Data` and finally end up at the `Xcm Executor` on the right.  ## Further changes - Bumped the default suspension, drop and resume thresholds in `QueueConfigData::default()`. - `XcmpQueue::{suspend_xcm_execution, resume_xcm_execution}` errors when they would be a noop. - Properly validate the `QueueConfigData` before setting it. - Marked weight files as auto-generated so they wont auto-expand in the MR files view. - Move the `hypothetical` asserts to `frame_support` under the name `experimental_hypothetically` Questions: - [ ] What about the ugly `#[cfg(feature = \"runtime-benchmarks\")]` in the runtimes? Not sure how to best fix. Just having them like this makes tests fail that rely on the real message processor when the feature is enabled. - [ ] Need a good weight for `MessageQueueServiceWeight`. The scheduler already takes 80% so I put it to 10% but that is quite low. TODO: - [x] Remove c&p code after https://github.com/paritytech/polkadot/pull/6271 - [x] Use `HandleMessage` once it is public in Substrate - [x] fix `runtime-benchmarks` feature https://github.com/paritytech/polkadot/pull/6966 - [x] Benchmarks - [x] Tests - [ ] Migrate `InboundXcmpStatus` to `InboundXcmpSuspended` - [x] Possibly cleanup Migrations (DMP+XCMP) - [x] optional: create `TransformProcessMessageOrigin` in Substrate and replace `ProcessFromSibling` - [ ] Rerun weights on ref HW --------- Signed-off-by: Oliver Tale-Yazdi <oliver.tale-yazdi@parity.io> Co-authored-by: Liam Aharon <liam.aharon@hotmail.com> Co-authored-by: joe petrowski <25483142+joepetrowski@users.noreply.github.com> Co-authored-by: Kian Paimani <5588131+kianenigma@users.noreply.github.com> Co-authored-by: command-bot <>
This commit is contained in:
committed by
GitHub
parent
7df0417bcd
commit
e1c033ebe1
@@ -13,433 +13,20 @@
|
||||
|
||||
// You should have received a copy of the GNU General Public License
|
||||
// along with Cumulus. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
#![cfg(test)]
|
||||
|
||||
use super::*;
|
||||
use crate::mock::*;
|
||||
|
||||
use codec::Encode;
|
||||
use cumulus_primitives_core::{
|
||||
relay_chain::BlockNumber as RelayBlockNumber, AbridgedHrmpChannel, InboundDownwardMessage,
|
||||
InboundHrmpMessage, PersistedValidationData,
|
||||
};
|
||||
use cumulus_test_relay_sproof_builder::RelayStateSproofBuilder;
|
||||
use frame_support::{
|
||||
assert_ok,
|
||||
inherent::{InherentData, ProvideInherent},
|
||||
parameter_types,
|
||||
traits::{OnFinalize, OnInitialize, UnfilteredDispatchable},
|
||||
weights::Weight,
|
||||
};
|
||||
use frame_system::{
|
||||
pallet_prelude::{BlockNumberFor, HeaderFor},
|
||||
RawOrigin,
|
||||
};
|
||||
use cumulus_primitives_core::{AbridgedHrmpChannel, InboundDownwardMessage, InboundHrmpMessage};
|
||||
use frame_support::{assert_ok, parameter_types, weights::Weight};
|
||||
use frame_system::RawOrigin;
|
||||
use hex_literal::hex;
|
||||
use rand::Rng;
|
||||
use relay_chain::HrmpChannelId;
|
||||
use sp_core::{blake2_256, H256};
|
||||
use sp_runtime::{
|
||||
traits::{BlakeTwo256, IdentityLookup},
|
||||
BuildStorage, DispatchErrorWithPostInfo,
|
||||
};
|
||||
use sp_std::{collections::vec_deque::VecDeque, num::NonZeroU32};
|
||||
use sp_version::RuntimeVersion;
|
||||
use std::cell::RefCell;
|
||||
|
||||
use crate as parachain_system;
|
||||
use crate::consensus_hook::UnincludedSegmentCapacity;
|
||||
|
||||
type Block = frame_system::mocking::MockBlock<Test>;
|
||||
|
||||
frame_support::construct_runtime!(
|
||||
pub enum Test
|
||||
{
|
||||
System: frame_system::{Pallet, Call, Config<T>, Storage, Event<T>},
|
||||
ParachainSystem: parachain_system::{Pallet, Call, Config<T>, Storage, Inherent, Event<T>, ValidateUnsigned},
|
||||
}
|
||||
);
|
||||
|
||||
parameter_types! {
|
||||
pub const BlockHashCount: u64 = 250;
|
||||
pub Version: RuntimeVersion = RuntimeVersion {
|
||||
spec_name: sp_version::create_runtime_str!("test"),
|
||||
impl_name: sp_version::create_runtime_str!("system-test"),
|
||||
authoring_version: 1,
|
||||
spec_version: 1,
|
||||
impl_version: 1,
|
||||
apis: sp_version::create_apis_vec!([]),
|
||||
transaction_version: 1,
|
||||
state_version: 1,
|
||||
};
|
||||
pub const ParachainId: ParaId = ParaId::new(200);
|
||||
pub const ReservedXcmpWeight: Weight = Weight::zero();
|
||||
pub const ReservedDmpWeight: Weight = Weight::zero();
|
||||
}
|
||||
impl frame_system::Config for Test {
|
||||
type RuntimeOrigin = RuntimeOrigin;
|
||||
type RuntimeCall = RuntimeCall;
|
||||
type Nonce = u64;
|
||||
type Hash = H256;
|
||||
type Hashing = BlakeTwo256;
|
||||
type AccountId = u64;
|
||||
type Lookup = IdentityLookup<Self::AccountId>;
|
||||
type Block = Block;
|
||||
type RuntimeEvent = RuntimeEvent;
|
||||
type BlockHashCount = BlockHashCount;
|
||||
type BlockLength = ();
|
||||
type BlockWeights = ();
|
||||
type Version = Version;
|
||||
type PalletInfo = PalletInfo;
|
||||
type AccountData = ();
|
||||
type OnNewAccount = ();
|
||||
type OnKilledAccount = ();
|
||||
type DbWeight = ();
|
||||
type BaseCallFilter = frame_support::traits::Everything;
|
||||
type SystemWeightInfo = ();
|
||||
type SS58Prefix = ();
|
||||
type OnSetCode = ParachainSetCode<Self>;
|
||||
type MaxConsumers = frame_support::traits::ConstU32<16>;
|
||||
}
|
||||
impl Config for Test {
|
||||
type RuntimeEvent = RuntimeEvent;
|
||||
type OnSystemEvent = ();
|
||||
type SelfParaId = ParachainId;
|
||||
type OutboundXcmpMessageSource = FromThreadLocal;
|
||||
type DmpMessageHandler = SaveIntoThreadLocal;
|
||||
type ReservedDmpWeight = ReservedDmpWeight;
|
||||
type XcmpMessageHandler = SaveIntoThreadLocal;
|
||||
type ReservedXcmpWeight = ReservedXcmpWeight;
|
||||
type CheckAssociatedRelayNumber = AnyRelayNumber;
|
||||
type ConsensusHook = TestConsensusHook;
|
||||
}
|
||||
|
||||
pub struct FromThreadLocal;
|
||||
pub struct SaveIntoThreadLocal;
|
||||
|
||||
std::thread_local! {
|
||||
static HANDLED_DMP_MESSAGES: RefCell<Vec<(relay_chain::BlockNumber, Vec<u8>)>> = RefCell::new(Vec::new());
|
||||
static HANDLED_XCMP_MESSAGES: RefCell<Vec<(ParaId, relay_chain::BlockNumber, Vec<u8>)>> = RefCell::new(Vec::new());
|
||||
static SENT_MESSAGES: RefCell<Vec<(ParaId, Vec<u8>)>> = RefCell::new(Vec::new());
|
||||
static CONSENSUS_HOOK: RefCell<Box<dyn Fn(&RelayChainStateProof) -> (Weight, UnincludedSegmentCapacity)>>
|
||||
= RefCell::new(Box::new(|_| (Weight::zero(), NonZeroU32::new(1).unwrap().into())));
|
||||
}
|
||||
|
||||
pub struct TestConsensusHook;
|
||||
|
||||
impl ConsensusHook for TestConsensusHook {
|
||||
fn on_state_proof(s: &RelayChainStateProof) -> (Weight, UnincludedSegmentCapacity) {
|
||||
CONSENSUS_HOOK.with(|f| f.borrow_mut()(s))
|
||||
}
|
||||
}
|
||||
|
||||
fn send_message(dest: ParaId, message: Vec<u8>) {
|
||||
SENT_MESSAGES.with(|m| m.borrow_mut().push((dest, message)));
|
||||
}
|
||||
|
||||
impl XcmpMessageSource for FromThreadLocal {
|
||||
fn take_outbound_messages(maximum_channels: usize) -> Vec<(ParaId, Vec<u8>)> {
|
||||
let mut ids = std::collections::BTreeSet::<ParaId>::new();
|
||||
let mut taken_messages = 0;
|
||||
let mut taken_bytes = 0;
|
||||
let mut result = Vec::new();
|
||||
SENT_MESSAGES.with(|ms| {
|
||||
ms.borrow_mut().retain(|m| {
|
||||
let status = <Pallet<Test> as GetChannelInfo>::get_channel_status(m.0);
|
||||
let (max_size_now, max_size_ever) = match status {
|
||||
ChannelStatus::Ready(now, ever) => (now, ever),
|
||||
ChannelStatus::Closed => return false, // drop message
|
||||
ChannelStatus::Full => return true, // keep message queued.
|
||||
};
|
||||
|
||||
let msg_len = m.1.len();
|
||||
|
||||
if !ids.contains(&m.0) &&
|
||||
taken_messages < maximum_channels &&
|
||||
msg_len <= max_size_ever &&
|
||||
taken_bytes + msg_len <= max_size_now
|
||||
{
|
||||
ids.insert(m.0);
|
||||
taken_messages += 1;
|
||||
taken_bytes += msg_len;
|
||||
result.push(m.clone());
|
||||
false
|
||||
} else {
|
||||
true
|
||||
}
|
||||
})
|
||||
});
|
||||
result
|
||||
}
|
||||
}
|
||||
|
||||
impl DmpMessageHandler for SaveIntoThreadLocal {
|
||||
fn handle_dmp_messages(
|
||||
iter: impl Iterator<Item = (RelayBlockNumber, Vec<u8>)>,
|
||||
_max_weight: Weight,
|
||||
) -> Weight {
|
||||
HANDLED_DMP_MESSAGES.with(|m| {
|
||||
for i in iter {
|
||||
m.borrow_mut().push(i);
|
||||
}
|
||||
Weight::zero()
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
impl XcmpMessageHandler for SaveIntoThreadLocal {
|
||||
fn handle_xcmp_messages<'a, I: Iterator<Item = (ParaId, RelayBlockNumber, &'a [u8])>>(
|
||||
iter: I,
|
||||
_max_weight: Weight,
|
||||
) -> Weight {
|
||||
HANDLED_XCMP_MESSAGES.with(|m| {
|
||||
for (sender, sent_at, message) in iter {
|
||||
m.borrow_mut().push((sender, sent_at, message.to_vec()));
|
||||
}
|
||||
Weight::zero()
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
// This function basically just builds a genesis storage key/value store according to
|
||||
// our desired mockup.
|
||||
fn new_test_ext() -> sp_io::TestExternalities {
|
||||
HANDLED_DMP_MESSAGES.with(|m| m.borrow_mut().clear());
|
||||
HANDLED_XCMP_MESSAGES.with(|m| m.borrow_mut().clear());
|
||||
|
||||
frame_system::GenesisConfig::<Test>::default().build_storage().unwrap().into()
|
||||
}
|
||||
|
||||
struct ReadRuntimeVersion(Vec<u8>);
|
||||
|
||||
impl sp_core::traits::ReadRuntimeVersion for ReadRuntimeVersion {
|
||||
fn read_runtime_version(
|
||||
&self,
|
||||
_wasm_code: &[u8],
|
||||
_ext: &mut dyn sp_externalities::Externalities,
|
||||
) -> Result<Vec<u8>, String> {
|
||||
Ok(self.0.clone())
|
||||
}
|
||||
}
|
||||
|
||||
fn wasm_ext() -> sp_io::TestExternalities {
|
||||
let version = RuntimeVersion {
|
||||
spec_name: "test".into(),
|
||||
spec_version: 2,
|
||||
impl_version: 1,
|
||||
..Default::default()
|
||||
};
|
||||
|
||||
let mut ext = new_test_ext();
|
||||
ext.register_extension(sp_core::traits::ReadRuntimeVersionExt::new(ReadRuntimeVersion(
|
||||
version.encode(),
|
||||
)));
|
||||
ext
|
||||
}
|
||||
|
||||
struct BlockTest {
|
||||
n: BlockNumberFor<Test>,
|
||||
within_block: Box<dyn Fn()>,
|
||||
after_block: Option<Box<dyn Fn()>>,
|
||||
}
|
||||
|
||||
/// BlockTests exist to test blocks with some setup: we have to assume that
|
||||
/// `validate_block` will mutate and check storage in certain predictable
|
||||
/// ways, for example, and we want to always ensure that tests are executed
|
||||
/// in the context of some particular block number.
|
||||
#[derive(Default)]
|
||||
struct BlockTests {
|
||||
tests: Vec<BlockTest>,
|
||||
pending_upgrade: Option<RelayChainBlockNumber>,
|
||||
ran: bool,
|
||||
relay_sproof_builder_hook:
|
||||
Option<Box<dyn Fn(&BlockTests, RelayChainBlockNumber, &mut RelayStateSproofBuilder)>>,
|
||||
inherent_data_hook:
|
||||
Option<Box<dyn Fn(&BlockTests, RelayChainBlockNumber, &mut ParachainInherentData)>>,
|
||||
inclusion_delay: Option<usize>,
|
||||
relay_block_number: Option<Box<dyn Fn(&BlockNumberFor<Test>) -> RelayChainBlockNumber>>,
|
||||
|
||||
included_para_head: Option<relay_chain::HeadData>,
|
||||
pending_blocks: VecDeque<relay_chain::HeadData>,
|
||||
}
|
||||
|
||||
impl BlockTests {
|
||||
fn new() -> BlockTests {
|
||||
Default::default()
|
||||
}
|
||||
|
||||
fn add_raw(mut self, test: BlockTest) -> Self {
|
||||
self.tests.push(test);
|
||||
self
|
||||
}
|
||||
|
||||
fn add<F>(self, n: BlockNumberFor<Test>, within_block: F) -> Self
|
||||
where
|
||||
F: 'static + Fn(),
|
||||
{
|
||||
self.add_raw(BlockTest { n, within_block: Box::new(within_block), after_block: None })
|
||||
}
|
||||
|
||||
fn add_with_post_test<F1, F2>(
|
||||
self,
|
||||
n: BlockNumberFor<Test>,
|
||||
within_block: F1,
|
||||
after_block: F2,
|
||||
) -> Self
|
||||
where
|
||||
F1: 'static + Fn(),
|
||||
F2: 'static + Fn(),
|
||||
{
|
||||
self.add_raw(BlockTest {
|
||||
n,
|
||||
within_block: Box::new(within_block),
|
||||
after_block: Some(Box::new(after_block)),
|
||||
})
|
||||
}
|
||||
|
||||
fn with_relay_sproof_builder<F>(mut self, f: F) -> Self
|
||||
where
|
||||
F: 'static + Fn(&BlockTests, RelayChainBlockNumber, &mut RelayStateSproofBuilder),
|
||||
{
|
||||
self.relay_sproof_builder_hook = Some(Box::new(f));
|
||||
self
|
||||
}
|
||||
|
||||
fn with_relay_block_number<F>(mut self, f: F) -> Self
|
||||
where
|
||||
F: 'static + Fn(&BlockNumberFor<Test>) -> RelayChainBlockNumber,
|
||||
{
|
||||
self.relay_block_number = Some(Box::new(f));
|
||||
self
|
||||
}
|
||||
|
||||
fn with_inherent_data<F>(mut self, f: F) -> Self
|
||||
where
|
||||
F: 'static + Fn(&BlockTests, RelayChainBlockNumber, &mut ParachainInherentData),
|
||||
{
|
||||
self.inherent_data_hook = Some(Box::new(f));
|
||||
self
|
||||
}
|
||||
|
||||
fn with_inclusion_delay(mut self, inclusion_delay: usize) -> Self {
|
||||
self.inclusion_delay.replace(inclusion_delay);
|
||||
self
|
||||
}
|
||||
|
||||
fn run(&mut self) {
|
||||
self.ran = true;
|
||||
wasm_ext().execute_with(|| {
|
||||
let mut parent_head_data = {
|
||||
let header = HeaderFor::<Test>::new_from_number(0);
|
||||
relay_chain::HeadData(header.encode())
|
||||
};
|
||||
|
||||
self.included_para_head = Some(parent_head_data.clone());
|
||||
|
||||
for BlockTest { n, within_block, after_block } in self.tests.iter() {
|
||||
let relay_parent_number = self
|
||||
.relay_block_number
|
||||
.as_ref()
|
||||
.map(|f| f(n))
|
||||
.unwrap_or(*n as RelayChainBlockNumber);
|
||||
// clear pending updates, as applicable
|
||||
if let Some(upgrade_block) = self.pending_upgrade {
|
||||
if n >= &upgrade_block.into() {
|
||||
self.pending_upgrade = None;
|
||||
}
|
||||
}
|
||||
|
||||
// begin initialization
|
||||
let parent_hash = BlakeTwo256::hash(&parent_head_data.0);
|
||||
System::reset_events();
|
||||
System::initialize(n, &parent_hash, &Default::default());
|
||||
|
||||
// now mess with the storage the way validate_block does
|
||||
let mut sproof_builder = RelayStateSproofBuilder::default();
|
||||
sproof_builder.included_para_head = self
|
||||
.included_para_head
|
||||
.clone()
|
||||
.unwrap_or_else(|| parent_head_data.clone())
|
||||
.into();
|
||||
if let Some(ref hook) = self.relay_sproof_builder_hook {
|
||||
hook(self, relay_parent_number, &mut sproof_builder);
|
||||
}
|
||||
let (relay_parent_storage_root, relay_chain_state) =
|
||||
sproof_builder.into_state_root_and_proof();
|
||||
let vfp = PersistedValidationData {
|
||||
relay_parent_number,
|
||||
relay_parent_storage_root,
|
||||
..Default::default()
|
||||
};
|
||||
|
||||
<ValidationData<Test>>::put(&vfp);
|
||||
NewValidationCode::<Test>::kill();
|
||||
|
||||
// It is insufficient to push the validation function params
|
||||
// to storage; they must also be included in the inherent data.
|
||||
let inherent_data = {
|
||||
let mut inherent_data = InherentData::default();
|
||||
let mut system_inherent_data = ParachainInherentData {
|
||||
validation_data: vfp.clone(),
|
||||
relay_chain_state,
|
||||
downward_messages: Default::default(),
|
||||
horizontal_messages: Default::default(),
|
||||
};
|
||||
if let Some(ref hook) = self.inherent_data_hook {
|
||||
hook(self, relay_parent_number, &mut system_inherent_data);
|
||||
}
|
||||
inherent_data
|
||||
.put_data(
|
||||
cumulus_primitives_parachain_inherent::INHERENT_IDENTIFIER,
|
||||
&system_inherent_data,
|
||||
)
|
||||
.expect("failed to put VFP inherent");
|
||||
inherent_data
|
||||
};
|
||||
|
||||
// execute the block
|
||||
ParachainSystem::on_initialize(*n);
|
||||
ParachainSystem::create_inherent(&inherent_data)
|
||||
.expect("got an inherent")
|
||||
.dispatch_bypass_filter(RawOrigin::None.into())
|
||||
.expect("dispatch succeeded");
|
||||
within_block();
|
||||
ParachainSystem::on_finalize(*n);
|
||||
|
||||
// did block execution set new validation code?
|
||||
if NewValidationCode::<Test>::exists() && self.pending_upgrade.is_some() {
|
||||
panic!("attempted to set validation code while upgrade was pending");
|
||||
}
|
||||
|
||||
// clean up
|
||||
let header = System::finalize();
|
||||
let head_data = relay_chain::HeadData(header.encode());
|
||||
parent_head_data = head_data.clone();
|
||||
match self.inclusion_delay {
|
||||
Some(delay) if delay > 0 => {
|
||||
self.pending_blocks.push_back(head_data);
|
||||
if self.pending_blocks.len() > delay {
|
||||
let included = self.pending_blocks.pop_front().unwrap();
|
||||
|
||||
self.included_para_head.replace(included);
|
||||
}
|
||||
},
|
||||
_ => {
|
||||
self.included_para_head.replace(head_data);
|
||||
},
|
||||
}
|
||||
|
||||
if let Some(after_block) = after_block {
|
||||
after_block();
|
||||
}
|
||||
}
|
||||
});
|
||||
}
|
||||
}
|
||||
|
||||
impl Drop for BlockTests {
|
||||
fn drop(&mut self) {
|
||||
if !self.ran {
|
||||
self.run();
|
||||
}
|
||||
}
|
||||
}
|
||||
use sp_core::H256;
|
||||
use sp_std::num::NonZeroU32;
|
||||
|
||||
#[test]
|
||||
#[should_panic]
|
||||
@@ -659,30 +246,6 @@ fn inherent_processed_messages_are_ignored() {
|
||||
CONSENSUS_HOOK.with(|c| {
|
||||
*c.borrow_mut() = Box::new(|_| (Weight::zero(), NonZeroU32::new(2).unwrap().into()))
|
||||
});
|
||||
lazy_static::lazy_static! {
|
||||
static ref DMQ_MSG: InboundDownwardMessage = InboundDownwardMessage {
|
||||
sent_at: 3,
|
||||
msg: b"down".to_vec(),
|
||||
};
|
||||
|
||||
static ref XCMP_MSG_1: InboundHrmpMessage = InboundHrmpMessage {
|
||||
sent_at: 2,
|
||||
data: b"h1".to_vec(),
|
||||
};
|
||||
|
||||
static ref XCMP_MSG_2: InboundHrmpMessage = InboundHrmpMessage {
|
||||
sent_at: 3,
|
||||
data: b"h2".to_vec(),
|
||||
};
|
||||
|
||||
static ref EXPECTED_PROCESSED_DMQ: Vec<(RelayChainBlockNumber, Vec<u8>)> = vec![
|
||||
(DMQ_MSG.sent_at, DMQ_MSG.msg.clone())
|
||||
];
|
||||
static ref EXPECTED_PROCESSED_XCMP: Vec<(ParaId, RelayChainBlockNumber, Vec<u8>)> = vec![
|
||||
(ParaId::from(200), XCMP_MSG_1.sent_at, XCMP_MSG_1.data.clone()),
|
||||
(ParaId::from(200), XCMP_MSG_2.sent_at, XCMP_MSG_2.data.clone()),
|
||||
];
|
||||
}
|
||||
|
||||
BlockTests::new()
|
||||
.with_inclusion_delay(1)
|
||||
@@ -690,11 +253,11 @@ fn inherent_processed_messages_are_ignored() {
|
||||
.with_relay_sproof_builder(|_, relay_block_num, sproof| match relay_block_num {
|
||||
3 => {
|
||||
sproof.dmq_mqc_head =
|
||||
Some(MessageQueueChain::default().extend_downward(&DMQ_MSG).head());
|
||||
Some(MessageQueueChain::default().extend_downward(&mk_dmp(3)).head());
|
||||
sproof.upsert_inbound_channel(ParaId::from(200)).mqc_head = Some(
|
||||
MessageQueueChain::default()
|
||||
.extend_hrmp(&XCMP_MSG_1)
|
||||
.extend_hrmp(&XCMP_MSG_2)
|
||||
.extend_hrmp(&mk_hrmp(2))
|
||||
.extend_hrmp(&mk_hrmp(3))
|
||||
.head(),
|
||||
);
|
||||
},
|
||||
@@ -702,9 +265,8 @@ fn inherent_processed_messages_are_ignored() {
|
||||
})
|
||||
.with_inherent_data(|_, relay_block_num, data| match relay_block_num {
|
||||
3 => {
|
||||
data.downward_messages.push(DMQ_MSG.clone());
|
||||
data.horizontal_messages
|
||||
.insert(ParaId::from(200), vec![XCMP_MSG_1.clone(), XCMP_MSG_2.clone()]);
|
||||
data.downward_messages.push(mk_dmp(3));
|
||||
data.horizontal_messages.insert(ParaId::from(200), vec![mk_hrmp(2), mk_hrmp(3)]);
|
||||
},
|
||||
_ => unreachable!(),
|
||||
})
|
||||
@@ -712,22 +274,29 @@ fn inherent_processed_messages_are_ignored() {
|
||||
// Don't drop processed messages for this test.
|
||||
HANDLED_DMP_MESSAGES.with(|m| {
|
||||
let m = m.borrow();
|
||||
assert_eq!(&*m, EXPECTED_PROCESSED_DMQ.as_slice());
|
||||
// NOTE: if this fails, then run the test without benchmark features.
|
||||
assert_eq!(&*m, &[mk_dmp(3).msg]);
|
||||
});
|
||||
HANDLED_XCMP_MESSAGES.with(|m| {
|
||||
let m = m.borrow_mut();
|
||||
assert_eq!(&*m, EXPECTED_PROCESSED_XCMP.as_slice());
|
||||
assert_eq!(
|
||||
&*m,
|
||||
&[(ParaId::from(200), 2, b"2".to_vec()), (ParaId::from(200), 3, b"3".to_vec()),]
|
||||
);
|
||||
});
|
||||
})
|
||||
.add(2, || {})
|
||||
.add(3, || {
|
||||
HANDLED_DMP_MESSAGES.with(|m| {
|
||||
let m = m.borrow();
|
||||
assert_eq!(&*m, EXPECTED_PROCESSED_DMQ.as_slice());
|
||||
assert_eq!(&*m, &[mk_dmp(3).msg]);
|
||||
});
|
||||
HANDLED_XCMP_MESSAGES.with(|m| {
|
||||
let m = m.borrow_mut();
|
||||
assert_eq!(&*m, EXPECTED_PROCESSED_XCMP.as_slice());
|
||||
assert_eq!(
|
||||
&*m,
|
||||
&[(ParaId::from(200), 2, b"2".to_vec()), (ParaId::from(200), 3, b"3".to_vec()),]
|
||||
);
|
||||
});
|
||||
});
|
||||
}
|
||||
@@ -1183,6 +752,7 @@ fn message_queue_chain() {
|
||||
}
|
||||
|
||||
#[test]
|
||||
#[cfg(not(feature = "runtime-benchmarks"))]
|
||||
fn receive_dmp() {
|
||||
lazy_static::lazy_static! {
|
||||
static ref MSG: InboundDownwardMessage = InboundDownwardMessage {
|
||||
@@ -1208,41 +778,31 @@ fn receive_dmp() {
|
||||
.add(1, || {
|
||||
HANDLED_DMP_MESSAGES.with(|m| {
|
||||
let mut m = m.borrow_mut();
|
||||
assert_eq!(&*m, &[(MSG.sent_at, MSG.msg.clone())]);
|
||||
assert_eq!(&*m, &[(MSG.msg.clone())]);
|
||||
m.clear();
|
||||
});
|
||||
});
|
||||
}
|
||||
|
||||
#[test]
|
||||
#[cfg(not(feature = "runtime-benchmarks"))]
|
||||
fn receive_dmp_after_pause() {
|
||||
lazy_static::lazy_static! {
|
||||
static ref MSG_1: InboundDownwardMessage = InboundDownwardMessage {
|
||||
sent_at: 1,
|
||||
msg: b"down1".to_vec(),
|
||||
};
|
||||
static ref MSG_2: InboundDownwardMessage = InboundDownwardMessage {
|
||||
sent_at: 3,
|
||||
msg: b"down2".to_vec(),
|
||||
};
|
||||
}
|
||||
|
||||
BlockTests::new()
|
||||
.with_relay_sproof_builder(|_, relay_block_num, sproof| match relay_block_num {
|
||||
1 => {
|
||||
sproof.dmq_mqc_head =
|
||||
Some(MessageQueueChain::default().extend_downward(&MSG_1).head());
|
||||
Some(MessageQueueChain::default().extend_downward(&mk_dmp(1)).head());
|
||||
},
|
||||
2 => {
|
||||
// no new messages, mqc stayed the same.
|
||||
sproof.dmq_mqc_head =
|
||||
Some(MessageQueueChain::default().extend_downward(&MSG_1).head());
|
||||
Some(MessageQueueChain::default().extend_downward(&mk_dmp(1)).head());
|
||||
},
|
||||
3 => {
|
||||
sproof.dmq_mqc_head = Some(
|
||||
MessageQueueChain::default()
|
||||
.extend_downward(&MSG_1)
|
||||
.extend_downward(&MSG_2)
|
||||
.extend_downward(&mk_dmp(1))
|
||||
.extend_downward(&mk_dmp(3))
|
||||
.head(),
|
||||
);
|
||||
},
|
||||
@@ -1250,20 +810,20 @@ fn receive_dmp_after_pause() {
|
||||
})
|
||||
.with_inherent_data(|_, relay_block_num, data| match relay_block_num {
|
||||
1 => {
|
||||
data.downward_messages.push(MSG_1.clone());
|
||||
data.downward_messages.push(mk_dmp(1));
|
||||
},
|
||||
2 => {
|
||||
// no new messages
|
||||
},
|
||||
3 => {
|
||||
data.downward_messages.push(MSG_2.clone());
|
||||
data.downward_messages.push(mk_dmp(3));
|
||||
},
|
||||
_ => unreachable!(),
|
||||
})
|
||||
.add(1, || {
|
||||
HANDLED_DMP_MESSAGES.with(|m| {
|
||||
let mut m = m.borrow_mut();
|
||||
assert_eq!(&*m, &[(MSG_1.sent_at, MSG_1.msg.clone())]);
|
||||
assert_eq!(&*m, &[(mk_dmp(1).msg.clone())]);
|
||||
m.clear();
|
||||
});
|
||||
})
|
||||
@@ -1271,54 +831,88 @@ fn receive_dmp_after_pause() {
|
||||
.add(3, || {
|
||||
HANDLED_DMP_MESSAGES.with(|m| {
|
||||
let mut m = m.borrow_mut();
|
||||
assert_eq!(&*m, &[(MSG_2.sent_at, MSG_2.msg.clone())]);
|
||||
assert_eq!(&*m, &[(mk_dmp(3).msg.clone())]);
|
||||
m.clear();
|
||||
});
|
||||
});
|
||||
}
|
||||
|
||||
// Sent up to 100 DMP messages per block over a period of 100 blocks.
|
||||
#[test]
|
||||
#[cfg(not(feature = "runtime-benchmarks"))]
|
||||
fn receive_dmp_many() {
|
||||
wasm_ext().execute_with(|| {
|
||||
parameter_types! {
|
||||
pub storage MqcHead: MessageQueueChain = Default::default();
|
||||
pub storage SentInBlock: Vec<Vec<InboundDownwardMessage>> = Default::default();
|
||||
}
|
||||
|
||||
let mut sent_in_block = vec![vec![]];
|
||||
let mut rng = rand::thread_rng();
|
||||
|
||||
for block in 1..100 {
|
||||
let mut msgs = vec![];
|
||||
for _ in 1..=rng.gen_range(1..=100) {
|
||||
// Just use the same message multiple times per block.
|
||||
msgs.push(mk_dmp(block));
|
||||
}
|
||||
sent_in_block.push(msgs);
|
||||
}
|
||||
SentInBlock::set(&sent_in_block);
|
||||
|
||||
let mut tester = BlockTests::new_without_externalities()
|
||||
.with_relay_sproof_builder(|_, relay_block_num, sproof| {
|
||||
let mut new_hash = MqcHead::get();
|
||||
|
||||
for msg in SentInBlock::get()[relay_block_num as usize].iter() {
|
||||
new_hash.extend_downward(&msg);
|
||||
}
|
||||
|
||||
sproof.dmq_mqc_head = Some(new_hash.head());
|
||||
MqcHead::set(&new_hash);
|
||||
})
|
||||
.with_inherent_data(|_, relay_block_num, data| {
|
||||
for msg in SentInBlock::get()[relay_block_num as usize].iter() {
|
||||
data.downward_messages.push(msg.clone());
|
||||
}
|
||||
});
|
||||
|
||||
for block in 1..100 {
|
||||
tester = tester.add(block, move || {
|
||||
HANDLED_DMP_MESSAGES.with(|m| {
|
||||
let mut m = m.borrow_mut();
|
||||
let msgs = SentInBlock::get()[block as usize]
|
||||
.iter()
|
||||
.map(|m| m.msg.clone())
|
||||
.collect::<Vec<_>>();
|
||||
assert_eq!(&*m, &msgs);
|
||||
m.clear();
|
||||
});
|
||||
});
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn receive_hrmp() {
|
||||
lazy_static::lazy_static! {
|
||||
static ref MSG_1: InboundHrmpMessage = InboundHrmpMessage {
|
||||
sent_at: 1,
|
||||
data: b"1".to_vec(),
|
||||
};
|
||||
|
||||
static ref MSG_2: InboundHrmpMessage = InboundHrmpMessage {
|
||||
sent_at: 2,
|
||||
data: b"2".to_vec(),
|
||||
};
|
||||
|
||||
static ref MSG_3: InboundHrmpMessage = InboundHrmpMessage {
|
||||
sent_at: 2,
|
||||
data: b"3".to_vec(),
|
||||
};
|
||||
|
||||
static ref MSG_4: InboundHrmpMessage = InboundHrmpMessage {
|
||||
sent_at: 2,
|
||||
data: b"4".to_vec(),
|
||||
};
|
||||
}
|
||||
|
||||
BlockTests::new()
|
||||
.with_relay_sproof_builder(|_, relay_block_num, sproof| match relay_block_num {
|
||||
1 => {
|
||||
// 200 - doesn't exist yet
|
||||
// 300 - one new message
|
||||
sproof.upsert_inbound_channel(ParaId::from(300)).mqc_head =
|
||||
Some(MessageQueueChain::default().extend_hrmp(&MSG_1).head());
|
||||
Some(MessageQueueChain::default().extend_hrmp(&mk_hrmp(1)).head());
|
||||
},
|
||||
2 => {
|
||||
// 200 - now present with one message
|
||||
// 300 - two new messages
|
||||
sproof.upsert_inbound_channel(ParaId::from(200)).mqc_head =
|
||||
Some(MessageQueueChain::default().extend_hrmp(&MSG_4).head());
|
||||
Some(MessageQueueChain::default().extend_hrmp(&mk_hrmp(4)).head());
|
||||
sproof.upsert_inbound_channel(ParaId::from(300)).mqc_head = Some(
|
||||
MessageQueueChain::default()
|
||||
.extend_hrmp(&MSG_1)
|
||||
.extend_hrmp(&MSG_2)
|
||||
.extend_hrmp(&MSG_3)
|
||||
.extend_hrmp(&mk_hrmp(1))
|
||||
.extend_hrmp(&mk_hrmp(2))
|
||||
.extend_hrmp(&mk_hrmp(3))
|
||||
.head(),
|
||||
);
|
||||
},
|
||||
@@ -1326,13 +920,13 @@ fn receive_hrmp() {
|
||||
// 200 - no new messages
|
||||
// 300 - is gone
|
||||
sproof.upsert_inbound_channel(ParaId::from(200)).mqc_head =
|
||||
Some(MessageQueueChain::default().extend_hrmp(&MSG_4).head());
|
||||
Some(MessageQueueChain::default().extend_hrmp(&mk_hrmp(4)).head());
|
||||
},
|
||||
_ => unreachable!(),
|
||||
})
|
||||
.with_inherent_data(|_, relay_block_num, data| match relay_block_num {
|
||||
1 => {
|
||||
data.horizontal_messages.insert(ParaId::from(300), vec![MSG_1.clone()]);
|
||||
data.horizontal_messages.insert(ParaId::from(300), vec![mk_hrmp(1)]);
|
||||
},
|
||||
2 => {
|
||||
data.horizontal_messages.insert(
|
||||
@@ -1341,11 +935,11 @@ fn receive_hrmp() {
|
||||
// can't be sent at the block 1 actually. However, we cheat here
|
||||
// because we want to test the case where there are multiple messages
|
||||
// but the harness at the moment doesn't support block skipping.
|
||||
MSG_2.clone(),
|
||||
MSG_3.clone(),
|
||||
mk_hrmp(2).clone(),
|
||||
mk_hrmp(3).clone(),
|
||||
],
|
||||
);
|
||||
data.horizontal_messages.insert(ParaId::from(200), vec![MSG_4.clone()]);
|
||||
data.horizontal_messages.insert(ParaId::from(200), vec![mk_hrmp(4)]);
|
||||
},
|
||||
3 => {},
|
||||
_ => unreachable!(),
|
||||
@@ -1363,9 +957,9 @@ fn receive_hrmp() {
|
||||
assert_eq!(
|
||||
&*m,
|
||||
&[
|
||||
(ParaId::from(200), 2, b"4".to_vec()),
|
||||
(ParaId::from(300), 2, b"2".to_vec()),
|
||||
(ParaId::from(300), 2, b"3".to_vec()),
|
||||
(ParaId::from(300), 3, b"3".to_vec()),
|
||||
(ParaId::from(200), 4, b"4".to_vec()),
|
||||
]
|
||||
);
|
||||
m.clear();
|
||||
@@ -1394,55 +988,46 @@ fn receive_hrmp_empty_channel() {
|
||||
|
||||
#[test]
|
||||
fn receive_hrmp_after_pause() {
|
||||
lazy_static::lazy_static! {
|
||||
static ref MSG_1: InboundHrmpMessage = InboundHrmpMessage {
|
||||
sent_at: 1,
|
||||
data: b"mikhailinvanovich".to_vec(),
|
||||
};
|
||||
|
||||
static ref MSG_2: InboundHrmpMessage = InboundHrmpMessage {
|
||||
sent_at: 3,
|
||||
data: b"1000000000".to_vec(),
|
||||
};
|
||||
}
|
||||
|
||||
const ALICE: ParaId = ParaId::new(300);
|
||||
|
||||
BlockTests::new()
|
||||
.with_relay_sproof_builder(|_, relay_block_num, sproof| match relay_block_num {
|
||||
1 => {
|
||||
sproof.upsert_inbound_channel(ALICE).mqc_head =
|
||||
Some(MessageQueueChain::default().extend_hrmp(&MSG_1).head());
|
||||
Some(MessageQueueChain::default().extend_hrmp(&mk_hrmp(1)).head());
|
||||
},
|
||||
2 => {
|
||||
// 300 - no new messages, mqc stayed the same.
|
||||
sproof.upsert_inbound_channel(ALICE).mqc_head =
|
||||
Some(MessageQueueChain::default().extend_hrmp(&MSG_1).head());
|
||||
Some(MessageQueueChain::default().extend_hrmp(&mk_hrmp(1)).head());
|
||||
},
|
||||
3 => {
|
||||
// 300 - new message.
|
||||
sproof.upsert_inbound_channel(ALICE).mqc_head = Some(
|
||||
MessageQueueChain::default().extend_hrmp(&MSG_1).extend_hrmp(&MSG_2).head(),
|
||||
MessageQueueChain::default()
|
||||
.extend_hrmp(&mk_hrmp(1))
|
||||
.extend_hrmp(&mk_hrmp(3))
|
||||
.head(),
|
||||
);
|
||||
},
|
||||
_ => unreachable!(),
|
||||
})
|
||||
.with_inherent_data(|_, relay_block_num, data| match relay_block_num {
|
||||
1 => {
|
||||
data.horizontal_messages.insert(ALICE, vec![MSG_1.clone()]);
|
||||
data.horizontal_messages.insert(ALICE, vec![mk_hrmp(1)]);
|
||||
},
|
||||
2 => {
|
||||
// no new messages
|
||||
},
|
||||
3 => {
|
||||
data.horizontal_messages.insert(ALICE, vec![MSG_2.clone()]);
|
||||
data.horizontal_messages.insert(ALICE, vec![mk_hrmp(3)]);
|
||||
},
|
||||
_ => unreachable!(),
|
||||
})
|
||||
.add(1, || {
|
||||
HANDLED_XCMP_MESSAGES.with(|m| {
|
||||
let mut m = m.borrow_mut();
|
||||
assert_eq!(&*m, &[(ALICE, 1, b"mikhailinvanovich".to_vec())]);
|
||||
assert_eq!(&*m, &[(ALICE, 1, b"1".to_vec())]);
|
||||
m.clear();
|
||||
});
|
||||
})
|
||||
@@ -1450,14 +1035,75 @@ fn receive_hrmp_after_pause() {
|
||||
.add(3, || {
|
||||
HANDLED_XCMP_MESSAGES.with(|m| {
|
||||
let mut m = m.borrow_mut();
|
||||
assert_eq!(&*m, &[(ALICE, 3, b"1000000000".to_vec())]);
|
||||
assert_eq!(&*m, &[(ALICE, 3, b"3".to_vec())]);
|
||||
m.clear();
|
||||
});
|
||||
});
|
||||
}
|
||||
|
||||
// Sent up to 100 HRMP messages per block over a period of 100 blocks.
|
||||
#[test]
|
||||
fn receive_hrmp_many() {
|
||||
const ALICE: ParaId = ParaId::new(300);
|
||||
|
||||
wasm_ext().execute_with(|| {
|
||||
parameter_types! {
|
||||
pub storage MqcHead: MessageQueueChain = Default::default();
|
||||
pub storage SentInBlock: Vec<Vec<InboundHrmpMessage>> = Default::default();
|
||||
}
|
||||
|
||||
let mut sent_in_block = vec![vec![]];
|
||||
let mut rng = rand::thread_rng();
|
||||
|
||||
for block in 1..100 {
|
||||
let mut msgs = vec![];
|
||||
for _ in 1..=rng.gen_range(1..=100) {
|
||||
// Just use the same message multiple times per block.
|
||||
msgs.push(mk_hrmp(block));
|
||||
}
|
||||
sent_in_block.push(msgs);
|
||||
}
|
||||
SentInBlock::set(&sent_in_block);
|
||||
|
||||
let mut tester = BlockTests::new_without_externalities()
|
||||
.with_relay_sproof_builder(|_, relay_block_num, sproof| {
|
||||
let mut new_hash = MqcHead::get();
|
||||
|
||||
for msg in SentInBlock::get()[relay_block_num as usize].iter() {
|
||||
new_hash.extend_hrmp(&msg);
|
||||
}
|
||||
|
||||
sproof.upsert_inbound_channel(ALICE).mqc_head = Some(new_hash.head());
|
||||
MqcHead::set(&new_hash);
|
||||
})
|
||||
.with_inherent_data(|_, relay_block_num, data| {
|
||||
// TODO use vector for dmp as well
|
||||
data.horizontal_messages
|
||||
.insert(ALICE, SentInBlock::get()[relay_block_num as usize].clone());
|
||||
});
|
||||
|
||||
for block in 1..100 {
|
||||
tester = tester.add(block, move || {
|
||||
HANDLED_XCMP_MESSAGES.with(|m| {
|
||||
let mut m = m.borrow_mut();
|
||||
let msgs = SentInBlock::get()[block as usize]
|
||||
.iter()
|
||||
.map(|m| (ALICE, m.sent_at, m.data.clone()))
|
||||
.collect::<Vec<_>>();
|
||||
assert_eq!(&*m, &msgs);
|
||||
m.clear();
|
||||
});
|
||||
});
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn upgrade_version_checks_should_work() {
|
||||
use codec::Encode;
|
||||
use sp_runtime::DispatchErrorWithPostInfo;
|
||||
use sp_version::RuntimeVersion;
|
||||
|
||||
let test_data = vec![
|
||||
("test", 0, 1, Err(frame_system::Error::<Test>::SpecVersionNeedsToIncrease)),
|
||||
("test", 1, 0, Err(frame_system::Error::<Test>::SpecVersionNeedsToIncrease)),
|
||||
@@ -1479,7 +1125,7 @@ fn upgrade_version_checks_should_work() {
|
||||
ext.register_extension(sp_core::traits::ReadRuntimeVersionExt::new(read_runtime_version));
|
||||
ext.execute_with(|| {
|
||||
let new_code = vec![1, 2, 3, 4];
|
||||
let new_code_hash = sp_core::H256(blake2_256(&new_code));
|
||||
let new_code_hash = H256(sp_core::blake2_256(&new_code));
|
||||
|
||||
let _authorize =
|
||||
ParachainSystem::authorize_upgrade(RawOrigin::Root.into(), new_code_hash, true);
|
||||
|
||||
Reference in New Issue
Block a user