mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-07-02 09:27:24 +00:00
444d4e204c
* implement max_values + storages info * some formatting + doc * sudo sanity check * timestamp * assets (not working) * fix assets * impl for proxy * update balances * rename StoragesInfo -> PalletStorageInfo * merge both StorageInfoTrait and PalletStorageInfo I think it is more future proof. In the future some storage could make use of multiple prefix. Like one to store how much value has been inserted, etc... * Update frame/support/procedural/src/storage/parse.rs Co-authored-by: Peter Goodspeed-Niklaus <coriolinus@users.noreply.github.com> * Update frame/support/procedural/src/storage/storage_struct.rs Co-authored-by: Peter Goodspeed-Niklaus <coriolinus@users.noreply.github.com> * Fix max_size using hasher information hasher now expose `max_len` which allows to computes their maximum len. For hasher without concatenation, it is the size of the hash part, for hasher with concatenation, it is the size of the hash part + max encoded len of the key. * fix tests * fix ui tests * Move `MaxBoundedLen` into its own crate (#8814) * move MaxEncodedLen into its own crate * remove MaxEncodedLen impl from frame-support * add to assets and balances * try more fixes * fix compile Co-authored-by: Shawn Tabrizi <shawntabrizi@gmail.com> * nits * fix compile * line width * fix max-values-macro merge * Add some derive, needed for test and other purpose * use weak bounded vec in some cases * Update lib.rs * move max-encoded-len crate * fix * remove app crypto for now * width * Revert "remove app crypto for now" This reverts commit 73623e9933d50648e0e7fe90b6171a8e45d7f5a2. * unused variable * more unused variables * more fixes * Add #[max_encoded_len_crate(...)] helper attribute The purpose of this attribute is to reduce the surface area of max_encoded_len changes. Crates deriving `MaxEncodedLen` do not need to add it to `Cargo.toml`; they can instead just do ```rust \#[derive(Encode, MaxEncodedLen)] \#[max_encoded_len_crate(frame_support::max_encoded_len)] struct Example; ``` * fix a ui test * use #[max_encoded_len_crate(...)] helper in app_crypto * remove max_encoded_len import where not necessary * update lockfile * fix ui test * ui * newline * fix merge * try fix ui again * Update max-encoded-len/derive/src/lib.rs Co-authored-by: Peter Goodspeed-Niklaus <coriolinus@users.noreply.github.com> * extract generate_crate_access_2018 * Update lib.rs * compiler isnt smart enough Co-authored-by: thiolliere <gui.thiolliere@gmail.com> Co-authored-by: Peter Goodspeed-Niklaus <coriolinus@users.noreply.github.com> Co-authored-by: Peter Goodspeed-Niklaus <peter.r.goodspeedniklaus@gmail.com>
1693 lines
55 KiB
Rust
1693 lines
55 KiB
Rust
// This file is part of Substrate.
|
|
|
|
// Copyright (C) 2017-2021 Parity Technologies (UK) Ltd.
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
//! # System Pallet
|
|
//!
|
|
//! The System pallet provides low-level access to core types and cross-cutting utilities.
|
|
//! It acts as the base layer for other pallets to interact with the Substrate framework components.
|
|
//!
|
|
//! - [`Config`]
|
|
//!
|
|
//! ## Overview
|
|
//!
|
|
//! The System pallet defines the core data types used in a Substrate runtime.
|
|
//! It also provides several utility functions (see [`Pallet`]) for other FRAME pallets.
|
|
//!
|
|
//! In addition, it manages the storage items for extrinsics data, indexes, event records, and digest items,
|
|
//! among other things that support the execution of the current block.
|
|
//!
|
|
//! It also handles low-level tasks like depositing logs, basic set up and take down of
|
|
//! temporary storage entries, and access to previous block hashes.
|
|
//!
|
|
//! ## Interface
|
|
//!
|
|
//! ### Dispatchable Functions
|
|
//!
|
|
//! The System pallet does not implement any dispatchable functions.
|
|
//!
|
|
//! ### Public Functions
|
|
//!
|
|
//! See the [`Pallet`] struct for details of publicly available functions.
|
|
//!
|
|
//! ### Signed Extensions
|
|
//!
|
|
//! The System pallet defines the following extensions:
|
|
//!
|
|
//! - [`CheckWeight`]: Checks the weight and length of the block and ensure that it does not
|
|
//! exceed the limits.
|
|
//! - [`CheckNonce`]: Checks the nonce of the transaction. Contains a single payload of type
|
|
//! `T::Index`.
|
|
//! - [`CheckEra`]: Checks the era of the transaction. Contains a single payload of type `Era`.
|
|
//! - [`CheckGenesis`]: Checks the provided genesis hash of the transaction. Must be a part of the
|
|
//! signed payload of the transaction.
|
|
//! - [`CheckSpecVersion`]: Checks that the runtime version is the same as the one used to sign the
|
|
//! transaction.
|
|
//! - [`CheckTxVersion`]: Checks that the transaction version is the same as the one used to sign the
|
|
//! transaction.
|
|
//!
|
|
//! Lookup the runtime aggregator file (e.g. `node/runtime`) to see the full list of signed
|
|
//! extensions included in a chain.
|
|
|
|
#![cfg_attr(not(feature = "std"), no_std)]
|
|
|
|
#[cfg(feature = "std")]
|
|
use serde::Serialize;
|
|
use sp_std::prelude::*;
|
|
#[cfg(any(feature = "std", test))]
|
|
use sp_std::map;
|
|
use sp_std::marker::PhantomData;
|
|
use sp_std::fmt::Debug;
|
|
use sp_version::RuntimeVersion;
|
|
use sp_runtime::{
|
|
RuntimeDebug, Perbill, DispatchError, Either, generic,
|
|
traits::{
|
|
self, CheckEqual, AtLeast32Bit, Zero, Lookup, LookupError,
|
|
SimpleBitOps, Hash, Member, MaybeDisplay, BadOrigin,
|
|
MaybeSerializeDeserialize, MaybeMallocSizeOf, StaticLookup, One, Bounded,
|
|
Dispatchable, AtLeast32BitUnsigned, Saturating, StoredMapError,
|
|
},
|
|
offchain::storage_lock::BlockNumberProvider,
|
|
};
|
|
|
|
use sp_core::{ChangesTrieConfiguration, storage::well_known_keys};
|
|
use frame_support::{
|
|
Parameter, storage,
|
|
traits::{
|
|
SortedMembers, Get, PalletInfo, OnNewAccount, OnKilledAccount, HandleLifetime,
|
|
StoredMap, EnsureOrigin, OriginTrait, Filter, MaxEncodedLen,
|
|
},
|
|
weights::{
|
|
Weight, RuntimeDbWeight, DispatchInfo, DispatchClass,
|
|
extract_actual_weight, PerDispatchClass,
|
|
},
|
|
dispatch::{DispatchResultWithPostInfo, DispatchResult},
|
|
};
|
|
use codec::{Encode, Decode, FullCodec, EncodeLike};
|
|
|
|
#[cfg(feature = "std")]
|
|
use frame_support::traits::GenesisBuild;
|
|
#[cfg(any(feature = "std", test))]
|
|
use sp_io::TestExternalities;
|
|
|
|
pub mod offchain;
|
|
pub mod limits;
|
|
#[cfg(test)]
|
|
pub(crate) mod mock;
|
|
|
|
mod extensions;
|
|
pub mod weights;
|
|
#[cfg(test)]
|
|
mod tests;
|
|
#[cfg(feature = "std")]
|
|
pub mod mocking;
|
|
|
|
|
|
pub use extensions::{
|
|
check_mortality::CheckMortality, check_genesis::CheckGenesis, check_nonce::CheckNonce,
|
|
check_spec_version::CheckSpecVersion, check_tx_version::CheckTxVersion,
|
|
check_weight::CheckWeight,
|
|
};
|
|
// Backward compatible re-export.
|
|
pub use extensions::check_mortality::CheckMortality as CheckEra;
|
|
pub use weights::WeightInfo;
|
|
|
|
/// Compute the trie root of a list of extrinsics.
|
|
pub fn extrinsics_root<H: Hash, E: codec::Encode>(extrinsics: &[E]) -> H::Output {
|
|
extrinsics_data_root::<H>(extrinsics.iter().map(codec::Encode::encode).collect())
|
|
}
|
|
|
|
/// Compute the trie root of a list of extrinsics.
|
|
pub fn extrinsics_data_root<H: Hash>(xts: Vec<Vec<u8>>) -> H::Output {
|
|
H::ordered_trie_root(xts)
|
|
}
|
|
|
|
/// An object to track the currently used extrinsic weight in a block.
|
|
pub type ConsumedWeight = PerDispatchClass<Weight>;
|
|
|
|
pub use pallet::*;
|
|
|
|
/// Do something when we should be setting the code.
|
|
pub trait SetCode {
|
|
/// Set the code to the given blob.
|
|
fn set_code(code: Vec<u8>) -> DispatchResult;
|
|
}
|
|
|
|
impl SetCode for () {
|
|
fn set_code(code: Vec<u8>) -> DispatchResult {
|
|
storage::unhashed::put_raw(well_known_keys::CODE, &code);
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
#[frame_support::pallet]
|
|
pub mod pallet {
|
|
use crate::{*, pallet_prelude::*, self as frame_system};
|
|
use frame_support::pallet_prelude::*;
|
|
|
|
/// System configuration trait. Implemented by runtime.
|
|
#[pallet::config]
|
|
#[pallet::disable_frame_system_supertrait_check]
|
|
pub trait Config: 'static + Eq + Clone {
|
|
/// The basic call filter to use in Origin. All origins are built with this filter as base,
|
|
/// except Root.
|
|
type BaseCallFilter: Filter<Self::Call>;
|
|
|
|
/// Block & extrinsics weights: base values and limits.
|
|
#[pallet::constant]
|
|
type BlockWeights: Get<limits::BlockWeights>;
|
|
|
|
/// The maximum length of a block (in bytes).
|
|
#[pallet::constant]
|
|
type BlockLength: Get<limits::BlockLength>;
|
|
|
|
/// The `Origin` type used by dispatchable calls.
|
|
type Origin:
|
|
Into<Result<RawOrigin<Self::AccountId>, Self::Origin>>
|
|
+ From<RawOrigin<Self::AccountId>>
|
|
+ Clone
|
|
+ OriginTrait<Call=Self::Call>;
|
|
|
|
/// The aggregated `Call` type.
|
|
type Call: Dispatchable + Debug;
|
|
|
|
/// Account index (aka nonce) type. This stores the number of previous transactions associated
|
|
/// with a sender account.
|
|
type Index:
|
|
Parameter + Member + MaybeSerializeDeserialize + Debug + Default + MaybeDisplay + AtLeast32Bit
|
|
+ Copy;
|
|
|
|
/// The block number type used by the runtime.
|
|
type BlockNumber:
|
|
Parameter + Member + MaybeSerializeDeserialize + Debug + MaybeDisplay +
|
|
AtLeast32BitUnsigned + Default + Bounded + Copy + sp_std::hash::Hash +
|
|
sp_std::str::FromStr + MaybeMallocSizeOf + MaxEncodedLen;
|
|
|
|
/// The output of the `Hashing` function.
|
|
type Hash:
|
|
Parameter + Member + MaybeSerializeDeserialize + Debug + MaybeDisplay + SimpleBitOps + Ord
|
|
+ Default + Copy + CheckEqual + sp_std::hash::Hash + AsRef<[u8]> + AsMut<[u8]>
|
|
+ MaybeMallocSizeOf + MaxEncodedLen;
|
|
|
|
/// The hashing system (algorithm) being used in the runtime (e.g. Blake2).
|
|
type Hashing: Hash<Output=Self::Hash>;
|
|
|
|
/// The user account identifier type for the runtime.
|
|
type AccountId: Parameter + Member + MaybeSerializeDeserialize + Debug + MaybeDisplay + Ord
|
|
+ Default + MaxEncodedLen;
|
|
|
|
/// Converting trait to take a source type and convert to `AccountId`.
|
|
///
|
|
/// Used to define the type and conversion mechanism for referencing accounts in transactions.
|
|
/// It's perfectly reasonable for this to be an identity conversion (with the source type being
|
|
/// `AccountId`), but other pallets (e.g. Indices pallet) may provide more functional/efficient
|
|
/// alternatives.
|
|
type Lookup: StaticLookup<Target=Self::AccountId>;
|
|
|
|
/// The block header.
|
|
type Header: Parameter + traits::Header<
|
|
Number=Self::BlockNumber,
|
|
Hash=Self::Hash,
|
|
>;
|
|
|
|
/// The aggregated event type of the runtime.
|
|
type Event: Parameter + Member + From<Event<Self>> + Debug + IsType<<Self as frame_system::Config>::Event>;
|
|
|
|
/// Maximum number of block number to block hash mappings to keep (oldest pruned first).
|
|
#[pallet::constant]
|
|
type BlockHashCount: Get<Self::BlockNumber>;
|
|
|
|
/// The weight of runtime database operations the runtime can invoke.
|
|
#[pallet::constant]
|
|
type DbWeight: Get<RuntimeDbWeight>;
|
|
|
|
/// Get the chain's current version.
|
|
#[pallet::constant]
|
|
type Version: Get<RuntimeVersion>;
|
|
|
|
/// Provides information about the pallet setup in the runtime.
|
|
///
|
|
/// Expects the `PalletInfo` type that is being generated by `construct_runtime!` in the
|
|
/// runtime.
|
|
///
|
|
/// For tests it is okay to use `()` as type, however it will provide "useless" data.
|
|
type PalletInfo: PalletInfo;
|
|
|
|
/// Data to be associated with an account (other than nonce/transaction counter, which this
|
|
/// pallet does regardless).
|
|
type AccountData: Member + FullCodec + Clone + Default;
|
|
|
|
/// Handler for when a new account has just been created.
|
|
type OnNewAccount: OnNewAccount<Self::AccountId>;
|
|
|
|
/// A function that is invoked when an account has been determined to be dead.
|
|
///
|
|
/// All resources should be cleaned up associated with the given account.
|
|
type OnKilledAccount: OnKilledAccount<Self::AccountId>;
|
|
|
|
type SystemWeightInfo: WeightInfo;
|
|
|
|
/// The designated SS85 prefix of this chain.
|
|
///
|
|
/// This replaces the "ss58Format" property declared in the chain spec. Reason is
|
|
/// that the runtime should know about the prefix in order to make use of it as
|
|
/// an identifier of the chain.
|
|
#[pallet::constant]
|
|
type SS58Prefix: Get<u8>;
|
|
|
|
/// What to do if the user wants the code set to something. Just use `()` unless you are in
|
|
/// cumulus.
|
|
type OnSetCode: SetCode;
|
|
}
|
|
|
|
#[pallet::pallet]
|
|
#[pallet::generate_store(pub (super) trait Store)]
|
|
pub struct Pallet<T>(_);
|
|
|
|
#[pallet::hooks]
|
|
impl<T: Config> Hooks<BlockNumberFor<T>> for Pallet<T> {
|
|
fn on_runtime_upgrade() -> frame_support::weights::Weight {
|
|
if !UpgradedToTripleRefCount::<T>::get() {
|
|
UpgradedToTripleRefCount::<T>::put(true);
|
|
migrations::migrate_to_triple_ref_count::<T>()
|
|
} else {
|
|
0
|
|
}
|
|
}
|
|
|
|
fn integrity_test() {
|
|
T::BlockWeights::get()
|
|
.validate()
|
|
.expect("The weights are invalid.");
|
|
}
|
|
}
|
|
|
|
#[pallet::call]
|
|
impl<T: Config> Pallet<T> {
|
|
/// A dispatch that will fill the block weight up to the given ratio.
|
|
// TODO: This should only be available for testing, rather than in general usage, but
|
|
// that's not possible at present (since it's within the pallet macro).
|
|
#[pallet::weight(*_ratio * T::BlockWeights::get().max_block)]
|
|
pub(crate) fn fill_block(origin: OriginFor<T>, _ratio: Perbill) -> DispatchResultWithPostInfo {
|
|
ensure_root(origin)?;
|
|
Ok(().into())
|
|
}
|
|
|
|
/// Make some on-chain remark.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(1)`
|
|
/// # </weight>
|
|
#[pallet::weight(T::SystemWeightInfo::remark(_remark.len() as u32))]
|
|
pub(crate) fn remark(origin: OriginFor<T>, _remark: Vec<u8>) -> DispatchResultWithPostInfo {
|
|
ensure_signed(origin)?;
|
|
Ok(().into())
|
|
}
|
|
|
|
/// Set the number of pages in the WebAssembly environment's heap.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(1)`
|
|
/// - 1 storage write.
|
|
/// - Base Weight: 1.405 µs
|
|
/// - 1 write to HEAP_PAGES
|
|
/// # </weight>
|
|
#[pallet::weight((T::SystemWeightInfo::set_heap_pages(), DispatchClass::Operational))]
|
|
pub(crate) fn set_heap_pages(origin: OriginFor<T>, pages: u64) -> DispatchResultWithPostInfo {
|
|
ensure_root(origin)?;
|
|
storage::unhashed::put_raw(well_known_keys::HEAP_PAGES, &pages.encode());
|
|
Ok(().into())
|
|
}
|
|
|
|
/// Set the new runtime code.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(C + S)` where `C` length of `code` and `S` complexity of `can_set_code`
|
|
/// - 1 storage write (codec `O(C)`).
|
|
/// - 1 call to `can_set_code`: `O(S)` (calls `sp_io::misc::runtime_version` which is expensive).
|
|
/// - 1 event.
|
|
/// The weight of this function is dependent on the runtime, but generally this is very expensive.
|
|
/// We will treat this as a full block.
|
|
/// # </weight>
|
|
#[pallet::weight((T::BlockWeights::get().max_block, DispatchClass::Operational))]
|
|
pub fn set_code(origin: OriginFor<T>, code: Vec<u8>) -> DispatchResultWithPostInfo {
|
|
ensure_root(origin)?;
|
|
Self::can_set_code(&code)?;
|
|
|
|
T::OnSetCode::set_code(code)?;
|
|
Self::deposit_event(Event::CodeUpdated);
|
|
Ok(().into())
|
|
}
|
|
|
|
/// Set the new runtime code without doing any checks of the given `code`.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(C)` where `C` length of `code`
|
|
/// - 1 storage write (codec `O(C)`).
|
|
/// - 1 event.
|
|
/// The weight of this function is dependent on the runtime. We will treat this as a full block.
|
|
/// # </weight>
|
|
#[pallet::weight((T::BlockWeights::get().max_block, DispatchClass::Operational))]
|
|
pub fn set_code_without_checks(
|
|
origin: OriginFor<T>,
|
|
code: Vec<u8>,
|
|
) -> DispatchResultWithPostInfo {
|
|
ensure_root(origin)?;
|
|
T::OnSetCode::set_code(code)?;
|
|
Self::deposit_event(Event::CodeUpdated);
|
|
Ok(().into())
|
|
}
|
|
|
|
/// Set the new changes trie configuration.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(1)`
|
|
/// - 1 storage write or delete (codec `O(1)`).
|
|
/// - 1 call to `deposit_log`: Uses `append` API, so O(1)
|
|
/// - Base Weight: 7.218 µs
|
|
/// - DB Weight:
|
|
/// - Writes: Changes Trie, System Digest
|
|
/// # </weight>
|
|
#[pallet::weight((T::SystemWeightInfo::set_changes_trie_config(), DispatchClass::Operational))]
|
|
pub fn set_changes_trie_config(
|
|
origin: OriginFor<T>,
|
|
changes_trie_config: Option<ChangesTrieConfiguration>,
|
|
) -> DispatchResultWithPostInfo {
|
|
ensure_root(origin)?;
|
|
match changes_trie_config.clone() {
|
|
Some(changes_trie_config) => storage::unhashed::put_raw(
|
|
well_known_keys::CHANGES_TRIE_CONFIG,
|
|
&changes_trie_config.encode(),
|
|
),
|
|
None => storage::unhashed::kill(well_known_keys::CHANGES_TRIE_CONFIG),
|
|
}
|
|
|
|
let log = generic::DigestItem::ChangesTrieSignal(
|
|
generic::ChangesTrieSignal::NewConfiguration(changes_trie_config),
|
|
);
|
|
Self::deposit_log(log.into());
|
|
Ok(().into())
|
|
}
|
|
|
|
/// Set some items of storage.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(I)` where `I` length of `items`
|
|
/// - `I` storage writes (`O(1)`).
|
|
/// - Base Weight: 0.568 * i µs
|
|
/// - Writes: Number of items
|
|
/// # </weight>
|
|
#[pallet::weight((
|
|
T::SystemWeightInfo::set_storage(items.len() as u32),
|
|
DispatchClass::Operational,
|
|
))]
|
|
pub(crate) fn set_storage(origin: OriginFor<T>, items: Vec<KeyValue>) -> DispatchResultWithPostInfo {
|
|
ensure_root(origin)?;
|
|
for i in &items {
|
|
storage::unhashed::put_raw(&i.0, &i.1);
|
|
}
|
|
Ok(().into())
|
|
}
|
|
|
|
/// Kill some items from storage.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(IK)` where `I` length of `keys` and `K` length of one key
|
|
/// - `I` storage deletions.
|
|
/// - Base Weight: .378 * i µs
|
|
/// - Writes: Number of items
|
|
/// # </weight>
|
|
#[pallet::weight((
|
|
T::SystemWeightInfo::kill_storage(keys.len() as u32),
|
|
DispatchClass::Operational,
|
|
))]
|
|
pub(crate) fn kill_storage(origin: OriginFor<T>, keys: Vec<Key>) -> DispatchResultWithPostInfo {
|
|
ensure_root(origin)?;
|
|
for key in &keys {
|
|
storage::unhashed::kill(&key);
|
|
}
|
|
Ok(().into())
|
|
}
|
|
|
|
/// Kill all storage items with a key that starts with the given prefix.
|
|
///
|
|
/// **NOTE:** We rely on the Root origin to provide us the number of subkeys under
|
|
/// the prefix we are removing to accurately calculate the weight of this function.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(P)` where `P` amount of keys with prefix `prefix`
|
|
/// - `P` storage deletions.
|
|
/// - Base Weight: 0.834 * P µs
|
|
/// - Writes: Number of subkeys + 1
|
|
/// # </weight>
|
|
#[pallet::weight((
|
|
T::SystemWeightInfo::kill_prefix(_subkeys.saturating_add(1)),
|
|
DispatchClass::Operational,
|
|
))]
|
|
pub(crate) fn kill_prefix(
|
|
origin: OriginFor<T>,
|
|
prefix: Key,
|
|
_subkeys: u32,
|
|
) -> DispatchResultWithPostInfo {
|
|
ensure_root(origin)?;
|
|
storage::unhashed::kill_prefix(&prefix);
|
|
Ok(().into())
|
|
}
|
|
|
|
/// Make some on-chain remark and emit event.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(b)` where b is the length of the remark.
|
|
/// - 1 event.
|
|
/// # </weight>
|
|
#[pallet::weight(T::SystemWeightInfo::remark_with_event(remark.len() as u32))]
|
|
pub(crate) fn remark_with_event(origin: OriginFor<T>, remark: Vec<u8>) -> DispatchResultWithPostInfo {
|
|
let who = ensure_signed(origin)?;
|
|
let hash = T::Hashing::hash(&remark[..]);
|
|
Self::deposit_event(Event::Remarked(who, hash));
|
|
Ok(().into())
|
|
}
|
|
}
|
|
|
|
/// Event for the System pallet.
|
|
#[pallet::event]
|
|
#[pallet::metadata(T::AccountId = "AccountId", T::Hash = "Hash")]
|
|
pub enum Event<T: Config> {
|
|
/// An extrinsic completed successfully. \[info\]
|
|
ExtrinsicSuccess(DispatchInfo),
|
|
/// An extrinsic failed. \[error, info\]
|
|
ExtrinsicFailed(DispatchError, DispatchInfo),
|
|
/// `:code` was updated.
|
|
CodeUpdated,
|
|
/// A new \[account\] was created.
|
|
NewAccount(T::AccountId),
|
|
/// An \[account\] was reaped.
|
|
KilledAccount(T::AccountId),
|
|
/// On on-chain remark happened. \[origin, remark_hash\]
|
|
Remarked(T::AccountId, T::Hash),
|
|
}
|
|
|
|
/// Old name generated by `decl_event`.
|
|
#[deprecated(note = "use `Event` instead")]
|
|
pub type RawEvent<T> = Event<T>;
|
|
|
|
/// Error for the System pallet
|
|
#[pallet::error]
|
|
pub enum Error<T> {
|
|
/// The name of specification does not match between the current runtime
|
|
/// and the new runtime.
|
|
InvalidSpecName,
|
|
/// The specification version is not allowed to decrease between the current runtime
|
|
/// and the new runtime.
|
|
SpecVersionNeedsToIncrease,
|
|
/// Failed to extract the runtime version from the new runtime.
|
|
///
|
|
/// Either calling `Core_version` or decoding `RuntimeVersion` failed.
|
|
FailedToExtractRuntimeVersion,
|
|
/// Suicide called when the account has non-default composite data.
|
|
NonDefaultComposite,
|
|
/// There is a non-zero reference count preventing the account from being purged.
|
|
NonZeroRefCount,
|
|
}
|
|
|
|
/// Exposed trait-generic origin type.
|
|
#[pallet::origin]
|
|
pub type Origin<T> = RawOrigin<<T as Config>::AccountId>;
|
|
|
|
/// The full account information for a particular account ID.
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn account)]
|
|
pub type Account<T: Config> = StorageMap<
|
|
_,
|
|
Blake2_128Concat,
|
|
T::AccountId,
|
|
AccountInfo<T::Index, T::AccountData>,
|
|
ValueQuery,
|
|
>;
|
|
|
|
/// Total extrinsics count for the current block.
|
|
#[pallet::storage]
|
|
pub(super) type ExtrinsicCount<T: Config> = StorageValue<_, u32>;
|
|
|
|
/// The current weight for the block.
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn block_weight)]
|
|
pub(super) type BlockWeight<T: Config> = StorageValue<_, ConsumedWeight, ValueQuery>;
|
|
|
|
/// Total length (in bytes) for all extrinsics put together, for the current block.
|
|
#[pallet::storage]
|
|
pub(super) type AllExtrinsicsLen<T: Config> = StorageValue<_, u32>;
|
|
|
|
/// Map of block numbers to block hashes.
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn block_hash)]
|
|
pub type BlockHash<T: Config> =
|
|
StorageMap<_, Twox64Concat, T::BlockNumber, T::Hash, ValueQuery>;
|
|
|
|
/// Extrinsics data for the current block (maps an extrinsic's index to its data).
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn extrinsic_data)]
|
|
pub(super) type ExtrinsicData<T: Config> =
|
|
StorageMap<_, Twox64Concat, u32, Vec<u8>, ValueQuery>;
|
|
|
|
/// The current block number being processed. Set by `execute_block`.
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn block_number)]
|
|
pub(super) type Number<T: Config> = StorageValue<_, T::BlockNumber, ValueQuery>;
|
|
|
|
/// Hash of the previous block.
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn parent_hash)]
|
|
pub(super) type ParentHash<T: Config> = StorageValue<_, T::Hash, ValueQuery>;
|
|
|
|
/// Digest of the current block, also part of the block header.
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn digest)]
|
|
pub(super) type Digest<T: Config> = StorageValue<_, DigestOf<T>, ValueQuery>;
|
|
|
|
/// Events deposited for the current block.
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn events)]
|
|
pub(super) type Events<T: Config> =
|
|
StorageValue<_, Vec<EventRecord<T::Event, T::Hash>>, ValueQuery>;
|
|
|
|
/// The number of events in the `Events<T>` list.
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn event_count)]
|
|
pub(super) type EventCount<T: Config> = StorageValue<_, EventIndex, ValueQuery>;
|
|
|
|
/// Mapping between a topic (represented by T::Hash) and a vector of indexes
|
|
/// of events in the `<Events<T>>` list.
|
|
///
|
|
/// All topic vectors have deterministic storage locations depending on the topic. This
|
|
/// allows light-clients to leverage the changes trie storage tracking mechanism and
|
|
/// in case of changes fetch the list of events of interest.
|
|
///
|
|
/// The value has the type `(T::BlockNumber, EventIndex)` because if we used only just
|
|
/// the `EventIndex` then in case if the topic has the same contents on the next block
|
|
/// no notification will be triggered thus the event might be lost.
|
|
#[pallet::storage]
|
|
#[pallet::getter(fn event_topics)]
|
|
pub(super) type EventTopics<T: Config> =
|
|
StorageMap<_, Blake2_128Concat, T::Hash, Vec<(T::BlockNumber, EventIndex)>, ValueQuery>;
|
|
|
|
/// Stores the `spec_version` and `spec_name` of when the last runtime upgrade happened.
|
|
#[pallet::storage]
|
|
pub type LastRuntimeUpgrade<T: Config> = StorageValue<_, LastRuntimeUpgradeInfo>;
|
|
|
|
/// True if we have upgraded so that `type RefCount` is `u32`. False (default) if not.
|
|
#[pallet::storage]
|
|
pub(super) type UpgradedToU32RefCount<T: Config> = StorageValue<_, bool, ValueQuery>;
|
|
|
|
/// True if we have upgraded so that AccountInfo contains three types of `RefCount`. False
|
|
/// (default) if not.
|
|
#[pallet::storage]
|
|
pub(super) type UpgradedToTripleRefCount<T: Config> = StorageValue<_, bool, ValueQuery>;
|
|
|
|
/// The execution phase of the block.
|
|
#[pallet::storage]
|
|
pub(super) type ExecutionPhase<T: Config> = StorageValue<_, Phase>;
|
|
|
|
#[pallet::genesis_config]
|
|
pub struct GenesisConfig {
|
|
pub changes_trie_config: Option<ChangesTrieConfiguration>,
|
|
#[serde(with = "sp_core::bytes")]
|
|
pub code: Vec<u8>,
|
|
}
|
|
|
|
#[cfg(feature = "std")]
|
|
impl Default for GenesisConfig {
|
|
fn default() -> Self {
|
|
Self {
|
|
changes_trie_config: Default::default(),
|
|
code: Default::default(),
|
|
}
|
|
}
|
|
}
|
|
|
|
#[pallet::genesis_build]
|
|
impl<T: Config> GenesisBuild<T> for GenesisConfig {
|
|
fn build(&self) {
|
|
<BlockHash<T>>::insert::<_, T::Hash>(T::BlockNumber::zero(), hash69());
|
|
<ParentHash<T>>::put::<T::Hash>(hash69());
|
|
<LastRuntimeUpgrade<T>>::put(LastRuntimeUpgradeInfo::from(T::Version::get()));
|
|
<UpgradedToU32RefCount<T>>::put(true);
|
|
<UpgradedToTripleRefCount<T>>::put(true);
|
|
|
|
sp_io::storage::set(well_known_keys::CODE, &self.code);
|
|
sp_io::storage::set(well_known_keys::EXTRINSIC_INDEX, &0u32.encode());
|
|
if let Some(ref changes_trie_config) = self.changes_trie_config {
|
|
sp_io::storage::set(well_known_keys::CHANGES_TRIE_CONFIG, &changes_trie_config.encode());
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
pub mod migrations {
|
|
use super::*;
|
|
|
|
#[allow(dead_code)]
|
|
/// Migrate from unique `u8` reference counting to triple `u32` reference counting.
|
|
pub fn migrate_all<T: Config>() -> frame_support::weights::Weight {
|
|
Account::<T>::translate::<(T::Index, u8, T::AccountData), _>(|_key, (nonce, rc, data)|
|
|
Some(AccountInfo { nonce, consumers: rc as RefCount, providers: 1, sufficients: 0, data })
|
|
);
|
|
T::BlockWeights::get().max_block
|
|
}
|
|
|
|
#[allow(dead_code)]
|
|
/// Migrate from unique `u32` reference counting to triple `u32` reference counting.
|
|
pub fn migrate_to_dual_ref_count<T: Config>() -> frame_support::weights::Weight {
|
|
Account::<T>::translate::<(T::Index, RefCount, T::AccountData), _>(|_key, (nonce, consumers, data)|
|
|
Some(AccountInfo { nonce, consumers, providers: 1, sufficients: 0, data })
|
|
);
|
|
T::BlockWeights::get().max_block
|
|
}
|
|
|
|
/// Migrate from dual `u32` reference counting to triple `u32` reference counting.
|
|
pub fn migrate_to_triple_ref_count<T: Config>() -> frame_support::weights::Weight {
|
|
Account::<T>::translate::<(T::Index, RefCount, RefCount, T::AccountData), _>(
|
|
|_key, (nonce, consumers, providers, data)| {
|
|
Some(AccountInfo { nonce, consumers, providers, sufficients: 0, data })
|
|
}
|
|
);
|
|
T::BlockWeights::get().max_block
|
|
}
|
|
}
|
|
|
|
#[cfg(feature = "std")]
|
|
impl GenesisConfig {
|
|
/// Direct implementation of `GenesisBuild::build_storage`.
|
|
///
|
|
/// Kept in order not to break dependency.
|
|
pub fn build_storage<T: Config>(&self) -> Result<sp_runtime::Storage, String> {
|
|
<Self as GenesisBuild<T>>::build_storage(self)
|
|
}
|
|
|
|
/// Direct implementation of `GenesisBuild::assimilate_storage`.
|
|
///
|
|
/// Kept in order not to break dependency.
|
|
pub fn assimilate_storage<T: Config>(
|
|
&self,
|
|
storage: &mut sp_runtime::Storage
|
|
) -> Result<(), String> {
|
|
<Self as GenesisBuild<T>>::assimilate_storage(self, storage)
|
|
}
|
|
}
|
|
|
|
pub type DigestOf<T> = generic::Digest<<T as Config>::Hash>;
|
|
pub type DigestItemOf<T> = generic::DigestItem<<T as Config>::Hash>;
|
|
|
|
pub type Key = Vec<u8>;
|
|
pub type KeyValue = (Vec<u8>, Vec<u8>);
|
|
|
|
/// A phase of a block's execution.
|
|
#[derive(Encode, Decode, RuntimeDebug)]
|
|
#[cfg_attr(feature = "std", derive(Serialize, PartialEq, Eq, Clone))]
|
|
pub enum Phase {
|
|
/// Applying an extrinsic.
|
|
ApplyExtrinsic(u32),
|
|
/// Finalizing the block.
|
|
Finalization,
|
|
/// Initializing the block.
|
|
Initialization,
|
|
}
|
|
|
|
impl Default for Phase {
|
|
fn default() -> Self {
|
|
Self::Initialization
|
|
}
|
|
}
|
|
|
|
/// Record of an event happening.
|
|
#[derive(Encode, Decode, RuntimeDebug)]
|
|
#[cfg_attr(feature = "std", derive(Serialize, PartialEq, Eq, Clone))]
|
|
pub struct EventRecord<E: Parameter + Member, T> {
|
|
/// The phase of the block it happened in.
|
|
pub phase: Phase,
|
|
/// The event itself.
|
|
pub event: E,
|
|
/// The list of the topics this event has.
|
|
pub topics: Vec<T>,
|
|
}
|
|
|
|
/// Origin for the System pallet.
|
|
#[derive(PartialEq, Eq, Clone, RuntimeDebug, Encode, Decode)]
|
|
pub enum RawOrigin<AccountId> {
|
|
/// The system itself ordained this dispatch to happen: this is the highest privilege level.
|
|
Root,
|
|
/// It is signed by some public key and we provide the `AccountId`.
|
|
Signed(AccountId),
|
|
/// It is signed by nobody, can be either:
|
|
/// * included and agreed upon by the validators anyway,
|
|
/// * or unsigned transaction validated by a pallet.
|
|
None,
|
|
}
|
|
|
|
impl<AccountId> From<Option<AccountId>> for RawOrigin<AccountId> {
|
|
fn from(s: Option<AccountId>) -> RawOrigin<AccountId> {
|
|
match s {
|
|
Some(who) => RawOrigin::Signed(who),
|
|
None => RawOrigin::None,
|
|
}
|
|
}
|
|
}
|
|
|
|
// Create a Hash with 69 for each byte,
|
|
// only used to build genesis config.
|
|
#[cfg(feature = "std")]
|
|
fn hash69<T: AsMut<[u8]> + Default>() -> T {
|
|
let mut h = T::default();
|
|
h.as_mut().iter_mut().for_each(|byte| *byte = 69);
|
|
h
|
|
}
|
|
|
|
/// This type alias represents an index of an event.
|
|
///
|
|
/// We use `u32` here because this index is used as index for `Events<T>`
|
|
/// which can't contain more than `u32::max_value()` items.
|
|
type EventIndex = u32;
|
|
|
|
/// Type used to encode the number of references an account has.
|
|
pub type RefCount = u32;
|
|
|
|
/// Information of an account.
|
|
#[derive(Clone, Eq, PartialEq, Default, RuntimeDebug, Encode, Decode)]
|
|
pub struct AccountInfo<Index, AccountData> {
|
|
/// The number of transactions this account has sent.
|
|
pub nonce: Index,
|
|
/// The number of other modules that currently depend on this account's existence. The account
|
|
/// cannot be reaped until this is zero.
|
|
pub consumers: RefCount,
|
|
/// The number of other modules that allow this account to exist. The account may not be reaped
|
|
/// until this and `sufficients` are both zero.
|
|
pub providers: RefCount,
|
|
/// The number of modules that allow this account to exist for their own purposes only. The
|
|
/// account may not be reaped until this and `providers` are both zero.
|
|
pub sufficients: RefCount,
|
|
/// The additional data that belongs to this account. Used to store the balance(s) in a lot of
|
|
/// chains.
|
|
pub data: AccountData,
|
|
}
|
|
|
|
/// Stores the `spec_version` and `spec_name` of when the last runtime upgrade
|
|
/// happened.
|
|
#[derive(sp_runtime::RuntimeDebug, Encode, Decode)]
|
|
#[cfg_attr(feature = "std", derive(PartialEq))]
|
|
pub struct LastRuntimeUpgradeInfo {
|
|
pub spec_version: codec::Compact<u32>,
|
|
pub spec_name: sp_runtime::RuntimeString,
|
|
}
|
|
|
|
impl LastRuntimeUpgradeInfo {
|
|
/// Returns if the runtime was upgraded in comparison of `self` and `current`.
|
|
///
|
|
/// Checks if either the `spec_version` increased or the `spec_name` changed.
|
|
pub fn was_upgraded(&self, current: &sp_version::RuntimeVersion) -> bool {
|
|
current.spec_version > self.spec_version.0 || current.spec_name != self.spec_name
|
|
}
|
|
}
|
|
|
|
impl From<sp_version::RuntimeVersion> for LastRuntimeUpgradeInfo {
|
|
fn from(version: sp_version::RuntimeVersion) -> Self {
|
|
Self {
|
|
spec_version: version.spec_version.into(),
|
|
spec_name: version.spec_name,
|
|
}
|
|
}
|
|
}
|
|
|
|
pub struct EnsureRoot<AccountId>(sp_std::marker::PhantomData<AccountId>);
|
|
impl<
|
|
O: Into<Result<RawOrigin<AccountId>, O>> + From<RawOrigin<AccountId>>,
|
|
AccountId,
|
|
> EnsureOrigin<O> for EnsureRoot<AccountId> {
|
|
type Success = ();
|
|
fn try_origin(o: O) -> Result<Self::Success, O> {
|
|
o.into().and_then(|o| match o {
|
|
RawOrigin::Root => Ok(()),
|
|
r => Err(O::from(r)),
|
|
})
|
|
}
|
|
|
|
#[cfg(feature = "runtime-benchmarks")]
|
|
fn successful_origin() -> O {
|
|
O::from(RawOrigin::Root)
|
|
}
|
|
}
|
|
|
|
pub struct EnsureSigned<AccountId>(sp_std::marker::PhantomData<AccountId>);
|
|
impl<
|
|
O: Into<Result<RawOrigin<AccountId>, O>> + From<RawOrigin<AccountId>>,
|
|
AccountId: Default,
|
|
> EnsureOrigin<O> for EnsureSigned<AccountId> {
|
|
type Success = AccountId;
|
|
fn try_origin(o: O) -> Result<Self::Success, O> {
|
|
o.into().and_then(|o| match o {
|
|
RawOrigin::Signed(who) => Ok(who),
|
|
r => Err(O::from(r)),
|
|
})
|
|
}
|
|
|
|
#[cfg(feature = "runtime-benchmarks")]
|
|
fn successful_origin() -> O {
|
|
O::from(RawOrigin::Signed(Default::default()))
|
|
}
|
|
}
|
|
|
|
pub struct EnsureSignedBy<Who, AccountId>(sp_std::marker::PhantomData<(Who, AccountId)>);
|
|
impl<
|
|
O: Into<Result<RawOrigin<AccountId>, O>> + From<RawOrigin<AccountId>>,
|
|
Who: SortedMembers<AccountId>,
|
|
AccountId: PartialEq + Clone + Ord + Default,
|
|
> EnsureOrigin<O> for EnsureSignedBy<Who, AccountId> {
|
|
type Success = AccountId;
|
|
fn try_origin(o: O) -> Result<Self::Success, O> {
|
|
o.into().and_then(|o| match o {
|
|
RawOrigin::Signed(ref who) if Who::contains(who) => Ok(who.clone()),
|
|
r => Err(O::from(r)),
|
|
})
|
|
}
|
|
|
|
#[cfg(feature = "runtime-benchmarks")]
|
|
fn successful_origin() -> O {
|
|
let members = Who::sorted_members();
|
|
let first_member = match members.get(0) {
|
|
Some(account) => account.clone(),
|
|
None => Default::default(),
|
|
};
|
|
O::from(RawOrigin::Signed(first_member.clone()))
|
|
}
|
|
}
|
|
|
|
pub struct EnsureNone<AccountId>(sp_std::marker::PhantomData<AccountId>);
|
|
impl<
|
|
O: Into<Result<RawOrigin<AccountId>, O>> + From<RawOrigin<AccountId>>,
|
|
AccountId,
|
|
> EnsureOrigin<O> for EnsureNone<AccountId> {
|
|
type Success = ();
|
|
fn try_origin(o: O) -> Result<Self::Success, O> {
|
|
o.into().and_then(|o| match o {
|
|
RawOrigin::None => Ok(()),
|
|
r => Err(O::from(r)),
|
|
})
|
|
}
|
|
|
|
#[cfg(feature = "runtime-benchmarks")]
|
|
fn successful_origin() -> O {
|
|
O::from(RawOrigin::None)
|
|
}
|
|
}
|
|
|
|
pub struct EnsureNever<T>(sp_std::marker::PhantomData<T>);
|
|
impl<O, T> EnsureOrigin<O> for EnsureNever<T> {
|
|
type Success = T;
|
|
fn try_origin(o: O) -> Result<Self::Success, O> {
|
|
Err(o)
|
|
}
|
|
|
|
#[cfg(feature = "runtime-benchmarks")]
|
|
fn successful_origin() -> O {
|
|
unimplemented!()
|
|
}
|
|
}
|
|
|
|
/// The "OR gate" implementation of `EnsureOrigin`.
|
|
///
|
|
/// Origin check will pass if `L` or `R` origin check passes. `L` is tested first.
|
|
pub struct EnsureOneOf<AccountId, L, R>(sp_std::marker::PhantomData<(AccountId, L, R)>);
|
|
impl<
|
|
AccountId,
|
|
O: Into<Result<RawOrigin<AccountId>, O>> + From<RawOrigin<AccountId>>,
|
|
L: EnsureOrigin<O>,
|
|
R: EnsureOrigin<O>,
|
|
> EnsureOrigin<O> for EnsureOneOf<AccountId, L, R> {
|
|
type Success = Either<L::Success, R::Success>;
|
|
fn try_origin(o: O) -> Result<Self::Success, O> {
|
|
L::try_origin(o).map_or_else(
|
|
|o| R::try_origin(o).map(|o| Either::Right(o)),
|
|
|o| Ok(Either::Left(o)),
|
|
)
|
|
}
|
|
|
|
#[cfg(feature = "runtime-benchmarks")]
|
|
fn successful_origin() -> O {
|
|
L::successful_origin()
|
|
}
|
|
}
|
|
|
|
/// Ensure that the origin `o` represents a signed extrinsic (i.e. transaction).
|
|
/// Returns `Ok` with the account that signed the extrinsic or an `Err` otherwise.
|
|
pub fn ensure_signed<OuterOrigin, AccountId>(o: OuterOrigin) -> Result<AccountId, BadOrigin>
|
|
where OuterOrigin: Into<Result<RawOrigin<AccountId>, OuterOrigin>>
|
|
{
|
|
match o.into() {
|
|
Ok(RawOrigin::Signed(t)) => Ok(t),
|
|
_ => Err(BadOrigin),
|
|
}
|
|
}
|
|
|
|
/// Ensure that the origin `o` represents the root. Returns `Ok` or an `Err` otherwise.
|
|
pub fn ensure_root<OuterOrigin, AccountId>(o: OuterOrigin) -> Result<(), BadOrigin>
|
|
where OuterOrigin: Into<Result<RawOrigin<AccountId>, OuterOrigin>>
|
|
{
|
|
match o.into() {
|
|
Ok(RawOrigin::Root) => Ok(()),
|
|
_ => Err(BadOrigin),
|
|
}
|
|
}
|
|
|
|
/// Ensure that the origin `o` represents an unsigned extrinsic. Returns `Ok` or an `Err` otherwise.
|
|
pub fn ensure_none<OuterOrigin, AccountId>(o: OuterOrigin) -> Result<(), BadOrigin>
|
|
where OuterOrigin: Into<Result<RawOrigin<AccountId>, OuterOrigin>>
|
|
{
|
|
match o.into() {
|
|
Ok(RawOrigin::None) => Ok(()),
|
|
_ => Err(BadOrigin),
|
|
}
|
|
}
|
|
|
|
/// A type of block initialization to perform.
|
|
pub enum InitKind {
|
|
/// Leave inspectable storage entries in state.
|
|
///
|
|
/// i.e. `Events` are not being reset.
|
|
/// Should only be used for off-chain calls,
|
|
/// regular block execution should clear those.
|
|
Inspection,
|
|
|
|
/// Reset also inspectable storage entries.
|
|
///
|
|
/// This should be used for regular block execution.
|
|
Full,
|
|
}
|
|
|
|
impl Default for InitKind {
|
|
fn default() -> Self {
|
|
InitKind::Full
|
|
}
|
|
}
|
|
|
|
/// Reference status; can be either referenced or unreferenced.
|
|
#[derive(RuntimeDebug)]
|
|
pub enum RefStatus {
|
|
Referenced,
|
|
Unreferenced,
|
|
}
|
|
|
|
/// Some resultant status relevant to incrementing a provider/self-sufficient reference.
|
|
#[derive(Eq, PartialEq, RuntimeDebug)]
|
|
pub enum IncRefStatus {
|
|
/// Account was created.
|
|
Created,
|
|
/// Account already existed.
|
|
Existed,
|
|
}
|
|
|
|
/// Some resultant status relevant to decrementing a provider/self-sufficient reference.
|
|
#[derive(Eq, PartialEq, RuntimeDebug)]
|
|
pub enum DecRefStatus {
|
|
/// Account was destroyed.
|
|
Reaped,
|
|
/// Account still exists.
|
|
Exists,
|
|
}
|
|
|
|
/// Some resultant status relevant to decrementing a provider reference.
|
|
#[derive(Eq, PartialEq, RuntimeDebug)]
|
|
pub enum DecRefError {
|
|
/// Account cannot have the last provider reference removed while there is a consumer.
|
|
ConsumerRemaining,
|
|
}
|
|
|
|
/// Some resultant status relevant to incrementing a consumer reference.
|
|
#[derive(Eq, PartialEq, RuntimeDebug)]
|
|
pub enum IncRefError {
|
|
/// Account cannot introduce a consumer while there are no providers.
|
|
NoProviders,
|
|
}
|
|
|
|
impl<T: Config> Pallet<T> {
|
|
pub fn account_exists(who: &T::AccountId) -> bool {
|
|
Account::<T>::contains_key(who)
|
|
}
|
|
|
|
/// Increment the reference counter on an account.
|
|
#[deprecated = "Use `inc_consumers` instead"]
|
|
pub fn inc_ref(who: &T::AccountId) {
|
|
let _ = Self::inc_consumers(who);
|
|
}
|
|
|
|
/// Decrement the reference counter on an account. This *MUST* only be done once for every time
|
|
/// you called `inc_consumers` on `who`.
|
|
#[deprecated = "Use `dec_consumers` instead"]
|
|
pub fn dec_ref(who: &T::AccountId) {
|
|
let _ = Self::dec_consumers(who);
|
|
}
|
|
|
|
/// The number of outstanding references for the account `who`.
|
|
#[deprecated = "Use `consumers` instead"]
|
|
pub fn refs(who: &T::AccountId) -> RefCount {
|
|
Self::consumers(who)
|
|
}
|
|
|
|
/// True if the account has no outstanding references.
|
|
#[deprecated = "Use `!is_provider_required` instead"]
|
|
pub fn allow_death(who: &T::AccountId) -> bool {
|
|
!Self::is_provider_required(who)
|
|
}
|
|
|
|
/// Increment the provider reference counter on an account.
|
|
pub fn inc_providers(who: &T::AccountId) -> IncRefStatus {
|
|
Account::<T>::mutate(who, |a| if a.providers == 0 && a.sufficients == 0 {
|
|
// Account is being created.
|
|
a.providers = 1;
|
|
Self::on_created_account(who.clone(), a);
|
|
IncRefStatus::Created
|
|
} else {
|
|
a.providers = a.providers.saturating_add(1);
|
|
IncRefStatus::Existed
|
|
})
|
|
}
|
|
|
|
/// Decrement the provider reference counter on an account.
|
|
///
|
|
/// This *MUST* only be done once for every time you called `inc_providers` on `who`.
|
|
pub fn dec_providers(who: &T::AccountId) -> Result<DecRefStatus, DecRefError> {
|
|
Account::<T>::try_mutate_exists(who, |maybe_account| {
|
|
if let Some(mut account) = maybe_account.take() {
|
|
if account.providers == 0 {
|
|
// Logic error - cannot decrement beyond zero.
|
|
log::error!(
|
|
target: "runtime::system",
|
|
"Logic error: Unexpected underflow in reducing provider",
|
|
);
|
|
account.providers = 1;
|
|
}
|
|
match (account.providers, account.consumers, account.sufficients) {
|
|
(1, 0, 0) => {
|
|
// No providers left (and no consumers) and no sufficients. Account dead.
|
|
|
|
Pallet::<T>::on_killed_account(who.clone());
|
|
Ok(DecRefStatus::Reaped)
|
|
}
|
|
(1, c, _) if c > 0 => {
|
|
// Cannot remove last provider if there are consumers.
|
|
Err(DecRefError::ConsumerRemaining)
|
|
}
|
|
(x, _, _) => {
|
|
// Account will continue to exist as there is either > 1 provider or
|
|
// > 0 sufficients.
|
|
account.providers = x - 1;
|
|
*maybe_account = Some(account);
|
|
Ok(DecRefStatus::Exists)
|
|
}
|
|
}
|
|
} else {
|
|
log::error!(
|
|
target: "runtime::system",
|
|
"Logic error: Account already dead when reducing provider",
|
|
);
|
|
Ok(DecRefStatus::Reaped)
|
|
}
|
|
})
|
|
}
|
|
|
|
/// Increment the self-sufficient reference counter on an account.
|
|
pub fn inc_sufficients(who: &T::AccountId) -> IncRefStatus {
|
|
Account::<T>::mutate(who, |a| if a.providers + a.sufficients == 0 {
|
|
// Account is being created.
|
|
a.sufficients = 1;
|
|
Self::on_created_account(who.clone(), a);
|
|
IncRefStatus::Created
|
|
} else {
|
|
a.sufficients = a.sufficients.saturating_add(1);
|
|
IncRefStatus::Existed
|
|
})
|
|
}
|
|
|
|
/// Decrement the sufficients reference counter on an account.
|
|
///
|
|
/// This *MUST* only be done once for every time you called `inc_sufficients` on `who`.
|
|
pub fn dec_sufficients(who: &T::AccountId) -> DecRefStatus {
|
|
Account::<T>::mutate_exists(who, |maybe_account| {
|
|
if let Some(mut account) = maybe_account.take() {
|
|
if account.sufficients == 0 {
|
|
// Logic error - cannot decrement beyond zero.
|
|
log::error!(
|
|
target: "runtime::system",
|
|
"Logic error: Unexpected underflow in reducing sufficients",
|
|
);
|
|
}
|
|
match (account.sufficients, account.providers) {
|
|
(0, 0) | (1, 0) => {
|
|
Pallet::<T>::on_killed_account(who.clone());
|
|
DecRefStatus::Reaped
|
|
}
|
|
(x, _) => {
|
|
account.sufficients = x - 1;
|
|
*maybe_account = Some(account);
|
|
DecRefStatus::Exists
|
|
}
|
|
}
|
|
} else {
|
|
log::error!(
|
|
target: "runtime::system",
|
|
"Logic error: Account already dead when reducing provider",
|
|
);
|
|
DecRefStatus::Reaped
|
|
}
|
|
})
|
|
}
|
|
|
|
/// The number of outstanding provider references for the account `who`.
|
|
pub fn providers(who: &T::AccountId) -> RefCount {
|
|
Account::<T>::get(who).providers
|
|
}
|
|
|
|
/// The number of outstanding sufficient references for the account `who`.
|
|
pub fn sufficients(who: &T::AccountId) -> RefCount {
|
|
Account::<T>::get(who).sufficients
|
|
}
|
|
|
|
/// The number of outstanding provider and sufficient references for the account `who`.
|
|
pub fn reference_count(who: &T::AccountId) -> RefCount {
|
|
let a = Account::<T>::get(who);
|
|
a.providers + a.sufficients
|
|
}
|
|
|
|
/// Increment the reference counter on an account.
|
|
///
|
|
/// The account `who`'s `providers` must be non-zero or this will return an error.
|
|
pub fn inc_consumers(who: &T::AccountId) -> Result<(), IncRefError> {
|
|
Account::<T>::try_mutate(who, |a| if a.providers > 0 {
|
|
a.consumers = a.consumers.saturating_add(1);
|
|
Ok(())
|
|
} else {
|
|
Err(IncRefError::NoProviders)
|
|
})
|
|
}
|
|
|
|
/// Decrement the reference counter on an account. This *MUST* only be done once for every time
|
|
/// you called `inc_consumers` on `who`.
|
|
pub fn dec_consumers(who: &T::AccountId) {
|
|
Account::<T>::mutate(who, |a| if a.consumers > 0 {
|
|
a.consumers -= 1;
|
|
} else {
|
|
log::error!(
|
|
target: "runtime::system",
|
|
"Logic error: Unexpected underflow in reducing consumer",
|
|
);
|
|
})
|
|
}
|
|
|
|
/// The number of outstanding references for the account `who`.
|
|
pub fn consumers(who: &T::AccountId) -> RefCount {
|
|
Account::<T>::get(who).consumers
|
|
}
|
|
|
|
/// True if the account has some outstanding consumer references.
|
|
pub fn is_provider_required(who: &T::AccountId) -> bool {
|
|
Account::<T>::get(who).consumers != 0
|
|
}
|
|
|
|
/// True if the account has no outstanding consumer references or more than one provider.
|
|
pub fn can_dec_provider(who: &T::AccountId) -> bool {
|
|
let a = Account::<T>::get(who);
|
|
a.consumers == 0 || a.providers > 1
|
|
}
|
|
|
|
/// True if the account has at least one provider reference.
|
|
pub fn can_inc_consumer(who: &T::AccountId) -> bool {
|
|
Account::<T>::get(who).providers > 0
|
|
}
|
|
|
|
/// Deposits an event into this block's event record.
|
|
pub fn deposit_event(event: impl Into<T::Event>) {
|
|
Self::deposit_event_indexed(&[], event.into());
|
|
}
|
|
|
|
/// Deposits an event into this block's event record adding this event
|
|
/// to the corresponding topic indexes.
|
|
///
|
|
/// This will update storage entries that correspond to the specified topics.
|
|
/// It is expected that light-clients could subscribe to this topics.
|
|
pub fn deposit_event_indexed(topics: &[T::Hash], event: T::Event) {
|
|
let block_number = Self::block_number();
|
|
// Don't populate events on genesis.
|
|
if block_number.is_zero() { return }
|
|
|
|
let phase = ExecutionPhase::<T>::get().unwrap_or_default();
|
|
let event = EventRecord {
|
|
phase,
|
|
event,
|
|
topics: topics.iter().cloned().collect::<Vec<_>>(),
|
|
};
|
|
|
|
// Index of the to be added event.
|
|
let event_idx = {
|
|
let old_event_count = EventCount::<T>::get();
|
|
let new_event_count = match old_event_count.checked_add(1) {
|
|
// We've reached the maximum number of events at this block, just
|
|
// don't do anything and leave the event_count unaltered.
|
|
None => return,
|
|
Some(nc) => nc,
|
|
};
|
|
EventCount::<T>::put(new_event_count);
|
|
old_event_count
|
|
};
|
|
|
|
Events::<T>::append(&event);
|
|
|
|
for topic in topics {
|
|
<EventTopics<T>>::append(topic, &(block_number, event_idx));
|
|
}
|
|
}
|
|
|
|
/// Gets the index of extrinsic that is currently executing.
|
|
pub fn extrinsic_index() -> Option<u32> {
|
|
storage::unhashed::get(well_known_keys::EXTRINSIC_INDEX)
|
|
}
|
|
|
|
/// Gets extrinsics count.
|
|
pub fn extrinsic_count() -> u32 {
|
|
ExtrinsicCount::<T>::get().unwrap_or_default()
|
|
}
|
|
|
|
pub fn all_extrinsics_len() -> u32 {
|
|
AllExtrinsicsLen::<T>::get().unwrap_or_default()
|
|
}
|
|
|
|
/// Inform the system pallet of some additional weight that should be accounted for, in the
|
|
/// current block.
|
|
///
|
|
/// NOTE: use with extra care; this function is made public only be used for certain pallets
|
|
/// that need it. A runtime that does not have dynamic calls should never need this and should
|
|
/// stick to static weights. A typical use case for this is inner calls or smart contract calls.
|
|
/// Furthermore, it only makes sense to use this when it is presumably _cheap_ to provide the
|
|
/// argument `weight`; In other words, if this function is to be used to account for some
|
|
/// unknown, user provided call's weight, it would only make sense to use it if you are sure you
|
|
/// can rapidly compute the weight of the inner call.
|
|
///
|
|
/// Even more dangerous is to note that this function does NOT take any action, if the new sum
|
|
/// of block weight is more than the block weight limit. This is what the _unchecked_.
|
|
///
|
|
/// Another potential use-case could be for the `on_initialize` and `on_finalize` hooks.
|
|
pub fn register_extra_weight_unchecked(weight: Weight, class: DispatchClass) {
|
|
BlockWeight::<T>::mutate(|current_weight| {
|
|
current_weight.add(weight, class);
|
|
});
|
|
}
|
|
|
|
/// Start the execution of a particular block.
|
|
pub fn initialize(
|
|
number: &T::BlockNumber,
|
|
parent_hash: &T::Hash,
|
|
digest: &DigestOf<T>,
|
|
kind: InitKind,
|
|
) {
|
|
// populate environment
|
|
ExecutionPhase::<T>::put(Phase::Initialization);
|
|
storage::unhashed::put(well_known_keys::EXTRINSIC_INDEX, &0u32);
|
|
<Number<T>>::put(number);
|
|
<Digest<T>>::put(digest);
|
|
<ParentHash<T>>::put(parent_hash);
|
|
<BlockHash<T>>::insert(*number - One::one(), parent_hash);
|
|
|
|
// Remove previous block data from storage
|
|
BlockWeight::<T>::kill();
|
|
|
|
// Kill inspectable storage entries in state when `InitKind::Full`.
|
|
if let InitKind::Full = kind {
|
|
<Events<T>>::kill();
|
|
EventCount::<T>::kill();
|
|
<EventTopics<T>>::remove_all();
|
|
}
|
|
}
|
|
|
|
/// Remove temporary "environment" entries in storage, compute the storage root and return the
|
|
/// resulting header for this block.
|
|
pub fn finalize() -> T::Header {
|
|
ExecutionPhase::<T>::kill();
|
|
AllExtrinsicsLen::<T>::kill();
|
|
|
|
// The following fields
|
|
//
|
|
// - <Events<T>>
|
|
// - <EventCount<T>>
|
|
// - <EventTopics<T>>
|
|
// - <Number<T>>
|
|
// - <ParentHash<T>>
|
|
// - <Digest<T>>
|
|
//
|
|
// stay to be inspected by the client and will be cleared by `Self::initialize`.
|
|
let number = <Number<T>>::get();
|
|
let parent_hash = <ParentHash<T>>::get();
|
|
let mut digest = <Digest<T>>::get();
|
|
|
|
let extrinsics = (0..ExtrinsicCount::<T>::take().unwrap_or_default())
|
|
.map(ExtrinsicData::<T>::take)
|
|
.collect();
|
|
let extrinsics_root = extrinsics_data_root::<T::Hashing>(extrinsics);
|
|
|
|
// move block hash pruning window by one block
|
|
let block_hash_count = T::BlockHashCount::get();
|
|
let to_remove = number.saturating_sub(block_hash_count).saturating_sub(One::one());
|
|
|
|
// keep genesis hash
|
|
if !to_remove.is_zero() {
|
|
<BlockHash<T>>::remove(to_remove);
|
|
}
|
|
|
|
let storage_root = T::Hash::decode(&mut &sp_io::storage::root()[..])
|
|
.expect("Node is configured to use the same hash; qed");
|
|
let storage_changes_root = sp_io::storage::changes_root(&parent_hash.encode());
|
|
|
|
// we can't compute changes trie root earlier && put it to the Digest
|
|
// because it will include all currently existing temporaries.
|
|
if let Some(storage_changes_root) = storage_changes_root {
|
|
let item = generic::DigestItem::ChangesTrieRoot(
|
|
T::Hash::decode(&mut &storage_changes_root[..])
|
|
.expect("Node is configured to use the same hash; qed")
|
|
);
|
|
digest.push(item);
|
|
}
|
|
|
|
<T::Header as traits::Header>::new(number, extrinsics_root, storage_root, parent_hash, digest)
|
|
}
|
|
|
|
/// Deposits a log and ensures it matches the block's log data.
|
|
///
|
|
/// # <weight>
|
|
/// - `O(1)`
|
|
/// - 1 storage write (codec `O(1)`)
|
|
/// # </weight>
|
|
pub fn deposit_log(item: DigestItemOf<T>) {
|
|
<Digest<T>>::append(item);
|
|
}
|
|
|
|
/// Get the basic externalities for this pallet, useful for tests.
|
|
#[cfg(any(feature = "std", test))]
|
|
pub fn externalities() -> TestExternalities {
|
|
TestExternalities::new(sp_core::storage::Storage {
|
|
top: map![
|
|
<BlockHash<T>>::hashed_key_for(T::BlockNumber::zero()) => [69u8; 32].encode(),
|
|
<Number<T>>::hashed_key().to_vec() => T::BlockNumber::one().encode(),
|
|
<ParentHash<T>>::hashed_key().to_vec() => [69u8; 32].encode()
|
|
],
|
|
children_default: map![],
|
|
})
|
|
}
|
|
|
|
/// Set the block number to something in particular. Can be used as an alternative to
|
|
/// `initialize` for tests that don't need to bother with the other environment entries.
|
|
#[cfg(any(feature = "std", feature = "runtime-benchmarks", test))]
|
|
pub fn set_block_number(n: T::BlockNumber) {
|
|
<Number<T>>::put(n);
|
|
}
|
|
|
|
/// Sets the index of extrinsic that is currently executing.
|
|
#[cfg(any(feature = "std", test))]
|
|
pub fn set_extrinsic_index(extrinsic_index: u32) {
|
|
storage::unhashed::put(well_known_keys::EXTRINSIC_INDEX, &extrinsic_index)
|
|
}
|
|
|
|
/// Set the parent hash number to something in particular. Can be used as an alternative to
|
|
/// `initialize` for tests that don't need to bother with the other environment entries.
|
|
#[cfg(any(feature = "std", test))]
|
|
pub fn set_parent_hash(n: T::Hash) {
|
|
<ParentHash<T>>::put(n);
|
|
}
|
|
|
|
/// Set the current block weight. This should only be used in some integration tests.
|
|
#[cfg(any(feature = "std", test))]
|
|
pub fn set_block_consumed_resources(weight: Weight, len: usize) {
|
|
BlockWeight::<T>::mutate(|current_weight| {
|
|
current_weight.set(weight, DispatchClass::Normal)
|
|
});
|
|
AllExtrinsicsLen::<T>::put(len as u32);
|
|
}
|
|
|
|
/// Reset events. Can be used as an alternative to
|
|
/// `initialize` for tests that don't need to bother with the other environment entries.
|
|
#[cfg(any(feature = "std", feature = "runtime-benchmarks", test))]
|
|
pub fn reset_events() {
|
|
<Events<T>>::kill();
|
|
EventCount::<T>::kill();
|
|
<EventTopics<T>>::remove_all();
|
|
}
|
|
|
|
/// Assert the given `event` exists.
|
|
#[cfg(any(feature = "std", feature = "runtime-benchmarks", test))]
|
|
pub fn assert_has_event(event: T::Event) {
|
|
assert!(Self::events().iter().any(|record| record.event == event))
|
|
}
|
|
|
|
/// Assert the last event equal to the given `event`.
|
|
#[cfg(any(feature = "std", feature = "runtime-benchmarks", test))]
|
|
pub fn assert_last_event(event: T::Event) {
|
|
assert_eq!(Self::events().last().expect("events expected").event, event);
|
|
}
|
|
|
|
/// Return the chain's current runtime version.
|
|
pub fn runtime_version() -> RuntimeVersion { T::Version::get() }
|
|
|
|
/// Retrieve the account transaction counter from storage.
|
|
pub fn account_nonce(who: impl EncodeLike<T::AccountId>) -> T::Index {
|
|
Account::<T>::get(who).nonce
|
|
}
|
|
|
|
/// Increment a particular account's nonce by 1.
|
|
pub fn inc_account_nonce(who: impl EncodeLike<T::AccountId>) {
|
|
Account::<T>::mutate(who, |a| a.nonce += T::Index::one());
|
|
}
|
|
|
|
/// Note what the extrinsic data of the current extrinsic index is.
|
|
///
|
|
/// This is required to be called before applying an extrinsic. The data will used
|
|
/// in [`Self::finalize`] to calculate the correct extrinsics root.
|
|
pub fn note_extrinsic(encoded_xt: Vec<u8>) {
|
|
ExtrinsicData::<T>::insert(Self::extrinsic_index().unwrap_or_default(), encoded_xt);
|
|
}
|
|
|
|
/// To be called immediately after an extrinsic has been applied.
|
|
pub fn note_applied_extrinsic(r: &DispatchResultWithPostInfo, mut info: DispatchInfo) {
|
|
info.weight = extract_actual_weight(r, &info);
|
|
Self::deposit_event(
|
|
match r {
|
|
Ok(_) => Event::ExtrinsicSuccess(info),
|
|
Err(err) => {
|
|
log::trace!(
|
|
target: "runtime::system",
|
|
"Extrinsic failed at block({:?}): {:?}",
|
|
Self::block_number(),
|
|
err,
|
|
);
|
|
Event::ExtrinsicFailed(err.error, info)
|
|
},
|
|
}
|
|
);
|
|
|
|
let next_extrinsic_index = Self::extrinsic_index().unwrap_or_default() + 1u32;
|
|
|
|
storage::unhashed::put(well_known_keys::EXTRINSIC_INDEX, &next_extrinsic_index);
|
|
ExecutionPhase::<T>::put(Phase::ApplyExtrinsic(next_extrinsic_index));
|
|
}
|
|
|
|
/// To be called immediately after `note_applied_extrinsic` of the last extrinsic of the block
|
|
/// has been called.
|
|
pub fn note_finished_extrinsics() {
|
|
let extrinsic_index: u32 = storage::unhashed::take(well_known_keys::EXTRINSIC_INDEX)
|
|
.unwrap_or_default();
|
|
ExtrinsicCount::<T>::put(extrinsic_index);
|
|
ExecutionPhase::<T>::put(Phase::Finalization);
|
|
}
|
|
|
|
/// To be called immediately after finishing the initialization of the block
|
|
/// (e.g., called `on_initialize` for all pallets).
|
|
pub fn note_finished_initialize() {
|
|
ExecutionPhase::<T>::put(Phase::ApplyExtrinsic(0))
|
|
}
|
|
|
|
/// An account is being created.
|
|
pub fn on_created_account(who: T::AccountId, _a: &mut AccountInfo<T::Index, T::AccountData>) {
|
|
T::OnNewAccount::on_new_account(&who);
|
|
Self::deposit_event(Event::NewAccount(who));
|
|
}
|
|
|
|
/// Do anything that needs to be done after an account has been killed.
|
|
fn on_killed_account(who: T::AccountId) {
|
|
T::OnKilledAccount::on_killed_account(&who);
|
|
Self::deposit_event(Event::KilledAccount(who));
|
|
}
|
|
|
|
/// Determine whether or not it is possible to update the code.
|
|
///
|
|
/// Checks the given code if it is a valid runtime wasm blob by instantianting
|
|
/// it and extracting the runtime version of it. It checks that the runtime version
|
|
/// of the old and new runtime has the same spec name and that the spec version is increasing.
|
|
pub fn can_set_code(code: &[u8]) -> Result<(), sp_runtime::DispatchError> {
|
|
let current_version = T::Version::get();
|
|
let new_version = sp_io::misc::runtime_version(&code)
|
|
.and_then(|v| RuntimeVersion::decode(&mut &v[..]).ok())
|
|
.ok_or_else(|| Error::<T>::FailedToExtractRuntimeVersion)?;
|
|
|
|
if new_version.spec_name != current_version.spec_name {
|
|
Err(Error::<T>::InvalidSpecName)?
|
|
}
|
|
|
|
if new_version.spec_version <= current_version.spec_version {
|
|
Err(Error::<T>::SpecVersionNeedsToIncrease)?
|
|
}
|
|
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
/// Event handler which registers a provider when created.
|
|
pub struct Provider<T>(PhantomData<T>);
|
|
impl<T: Config> HandleLifetime<T::AccountId> for Provider<T> {
|
|
fn created(t: &T::AccountId) -> Result<(), StoredMapError> {
|
|
Pallet::<T>::inc_providers(t);
|
|
Ok(())
|
|
}
|
|
fn killed(t: &T::AccountId) -> Result<(), StoredMapError> {
|
|
Pallet::<T>::dec_providers(t)
|
|
.map(|_| ())
|
|
.or_else(|e| match e {
|
|
DecRefError::ConsumerRemaining => Err(StoredMapError::ConsumerRemaining),
|
|
})
|
|
}
|
|
}
|
|
|
|
/// Event handler which registers a self-sufficient when created.
|
|
pub struct SelfSufficient<T>(PhantomData<T>);
|
|
impl<T: Config> HandleLifetime<T::AccountId> for SelfSufficient<T> {
|
|
fn created(t: &T::AccountId) -> Result<(), StoredMapError> {
|
|
Pallet::<T>::inc_sufficients(t);
|
|
Ok(())
|
|
}
|
|
fn killed(t: &T::AccountId) -> Result<(), StoredMapError> {
|
|
Pallet::<T>::dec_sufficients(t);
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
/// Event handler which registers a consumer when created.
|
|
pub struct Consumer<T>(PhantomData<T>);
|
|
impl<T: Config> HandleLifetime<T::AccountId> for Consumer<T> {
|
|
fn created(t: &T::AccountId) -> Result<(), StoredMapError> {
|
|
Pallet::<T>::inc_consumers(t)
|
|
.map_err(|e| match e {
|
|
IncRefError::NoProviders => StoredMapError::NoProviders
|
|
})
|
|
}
|
|
fn killed(t: &T::AccountId) -> Result<(), StoredMapError> {
|
|
Pallet::<T>::dec_consumers(t);
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
impl<T: Config> BlockNumberProvider for Pallet<T>
|
|
{
|
|
type BlockNumber = <T as Config>::BlockNumber;
|
|
|
|
fn current_block_number() -> Self::BlockNumber {
|
|
Pallet::<T>::block_number()
|
|
}
|
|
}
|
|
|
|
fn is_providing<T: Default + Eq>(d: &T) -> bool {
|
|
d != &T::default()
|
|
}
|
|
|
|
/// Implement StoredMap for a simple single-item, provide-when-not-default system. This works fine
|
|
/// for storing a single item which allows the account to continue existing as long as it's not
|
|
/// empty/default.
|
|
///
|
|
/// Anything more complex will need more sophisticated logic.
|
|
impl<T: Config> StoredMap<T::AccountId, T::AccountData> for Pallet<T> {
|
|
fn get(k: &T::AccountId) -> T::AccountData {
|
|
Account::<T>::get(k).data
|
|
}
|
|
|
|
fn try_mutate_exists<R, E: From<StoredMapError>>(
|
|
k: &T::AccountId,
|
|
f: impl FnOnce(&mut Option<T::AccountData>) -> Result<R, E>,
|
|
) -> Result<R, E> {
|
|
let account = Account::<T>::get(k);
|
|
let was_providing = is_providing(&account.data);
|
|
let mut some_data = if was_providing { Some(account.data) } else { None };
|
|
let result = f(&mut some_data)?;
|
|
let is_providing = some_data.is_some();
|
|
if !was_providing && is_providing {
|
|
Self::inc_providers(k);
|
|
} else if was_providing && !is_providing {
|
|
match Self::dec_providers(k) {
|
|
Err(DecRefError::ConsumerRemaining) => Err(StoredMapError::ConsumerRemaining)?,
|
|
Ok(DecRefStatus::Reaped) => return Ok(result),
|
|
Ok(DecRefStatus::Exists) => {
|
|
// Update value as normal...
|
|
}
|
|
}
|
|
} else if !was_providing && !is_providing {
|
|
return Ok(result)
|
|
}
|
|
Account::<T>::mutate(k, |a| a.data = some_data.unwrap_or_default());
|
|
Ok(result)
|
|
}
|
|
}
|
|
|
|
/// Split an `option` into two constituent options, as defined by a `splitter` function.
|
|
pub fn split_inner<T, R, S>(option: Option<T>, splitter: impl FnOnce(T) -> (R, S))
|
|
-> (Option<R>, Option<S>)
|
|
{
|
|
match option {
|
|
Some(inner) => {
|
|
let (r, s) = splitter(inner);
|
|
(Some(r), Some(s))
|
|
}
|
|
None => (None, None),
|
|
}
|
|
}
|
|
|
|
pub struct ChainContext<T>(PhantomData<T>);
|
|
impl<T> Default for ChainContext<T> {
|
|
fn default() -> Self {
|
|
ChainContext(PhantomData)
|
|
}
|
|
}
|
|
|
|
impl<T: Config> Lookup for ChainContext<T> {
|
|
type Source = <T::Lookup as StaticLookup>::Source;
|
|
type Target = <T::Lookup as StaticLookup>::Target;
|
|
|
|
fn lookup(&self, s: Self::Source) -> Result<Self::Target, LookupError> {
|
|
<T::Lookup as StaticLookup>::lookup(s)
|
|
}
|
|
}
|
|
|
|
/// Prelude to be used alongside pallet macro, for ease of use.
|
|
pub mod pallet_prelude {
|
|
pub use crate::{ensure_signed, ensure_none, ensure_root};
|
|
|
|
/// Type alias for the `Origin` associated type of system config.
|
|
pub type OriginFor<T> = <T as crate::Config>::Origin;
|
|
|
|
/// Type alias for the `BlockNumber` associated type of system config.
|
|
pub type BlockNumberFor<T> = <T as crate::Config>::BlockNumber;
|
|
}
|