mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-04-26 21:37:56 +00:00
c4e20af74d
* client: allow reverting blocks past finality * client: fix leaves reversion * client: extend docs on revert * client: add comment on leaves revert
356 lines
12 KiB
Rust
356 lines
12 KiB
Rust
// Copyright 2017-2020 Parity Technologies (UK) Ltd.
|
|
// This file is part of Substrate.
|
|
|
|
// Substrate is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// Substrate is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Substrate. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//! Substrate Client data backend
|
|
|
|
use std::sync::Arc;
|
|
use std::collections::HashMap;
|
|
use sp_core::ChangesTrieConfiguration;
|
|
use sp_core::offchain::OffchainStorage;
|
|
use sp_runtime::{generic::BlockId, Justification, Storage};
|
|
use sp_runtime::traits::{Block as BlockT, NumberFor};
|
|
use sp_state_machine::backend::Backend as StateBackend;
|
|
use sp_state_machine::{ChangesTrieStorage as StateChangesTrieStorage, ChangesTrieTransaction};
|
|
use crate::{
|
|
blockchain::{
|
|
Backend as BlockchainBackend, well_known_cache_keys
|
|
},
|
|
light::RemoteBlockchain,
|
|
};
|
|
use sp_blockchain;
|
|
use sp_consensus::BlockOrigin;
|
|
use hash_db::Hasher;
|
|
use parking_lot::RwLock;
|
|
|
|
/// In memory array of storage values.
|
|
pub type StorageCollection = Vec<(Vec<u8>, Option<Vec<u8>>)>;
|
|
|
|
/// In memory arrays of storage values for multiple child tries.
|
|
pub type ChildStorageCollection = Vec<(Vec<u8>, StorageCollection)>;
|
|
|
|
/// Import operation summary.
|
|
///
|
|
/// Contains information about the block that just got imported,
|
|
/// including storage changes, reorged blocks, etc.
|
|
pub struct ImportSummary<Block: BlockT> {
|
|
/// Block hash of the imported block.
|
|
pub hash: Block::Hash,
|
|
/// Import origin.
|
|
pub origin: BlockOrigin,
|
|
/// Header of the imported block.
|
|
pub header: Block::Header,
|
|
/// Is this block a new best block.
|
|
pub is_new_best: bool,
|
|
/// Optional storage changes.
|
|
pub storage_changes: Option<(StorageCollection, ChildStorageCollection)>,
|
|
/// Blocks that got retracted because of this one got imported.
|
|
pub retracted: Vec<Block::Hash>,
|
|
}
|
|
|
|
/// Import operation wrapper
|
|
pub struct ClientImportOperation<
|
|
Block: BlockT,
|
|
H: Hasher<Out=Block::Hash>,
|
|
B: Backend<Block, H>,
|
|
> {
|
|
/// DB Operation.
|
|
pub op: B::BlockImportOperation,
|
|
/// Summary of imported block.
|
|
pub notify_imported: Option<ImportSummary<Block>>,
|
|
/// A list of hashes of blocks that got finalized.
|
|
pub notify_finalized: Vec<Block::Hash>,
|
|
}
|
|
|
|
/// State of a new block.
|
|
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
|
|
pub enum NewBlockState {
|
|
/// Normal block.
|
|
Normal,
|
|
/// New best block.
|
|
Best,
|
|
/// Newly finalized block (implicitly best).
|
|
Final,
|
|
}
|
|
|
|
impl NewBlockState {
|
|
/// Whether this block is the new best block.
|
|
pub fn is_best(self) -> bool {
|
|
match self {
|
|
NewBlockState::Best | NewBlockState::Final => true,
|
|
NewBlockState::Normal => false,
|
|
}
|
|
}
|
|
|
|
/// Whether this block is considered final.
|
|
pub fn is_final(self) -> bool {
|
|
match self {
|
|
NewBlockState::Final => true,
|
|
NewBlockState::Best | NewBlockState::Normal => false,
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Block insertion operation.
|
|
///
|
|
/// Keeps hold if the inserted block state and data.
|
|
pub trait BlockImportOperation<Block, H> where
|
|
Block: BlockT,
|
|
H: Hasher<Out=Block::Hash>,
|
|
{
|
|
/// Associated state backend type.
|
|
type State: StateBackend<H>;
|
|
|
|
/// Returns pending state.
|
|
///
|
|
/// Returns None for backends with locally-unavailable state data.
|
|
fn state(&self) -> sp_blockchain::Result<Option<&Self::State>>;
|
|
|
|
/// Append block data to the transaction.
|
|
fn set_block_data(
|
|
&mut self,
|
|
header: Block::Header,
|
|
body: Option<Vec<Block::Extrinsic>>,
|
|
justification: Option<Justification>,
|
|
state: NewBlockState,
|
|
) -> sp_blockchain::Result<()>;
|
|
|
|
/// Update cached data.
|
|
fn update_cache(&mut self, cache: HashMap<well_known_cache_keys::Id, Vec<u8>>);
|
|
|
|
/// Inject storage data into the database.
|
|
fn update_db_storage(&mut self, update: <Self::State as StateBackend<H>>::Transaction) -> sp_blockchain::Result<()>;
|
|
|
|
/// Inject storage data into the database replacing any existing data.
|
|
fn reset_storage(&mut self, storage: Storage) -> sp_blockchain::Result<H::Out>;
|
|
|
|
/// Set storage changes.
|
|
fn update_storage(
|
|
&mut self,
|
|
update: StorageCollection,
|
|
child_update: ChildStorageCollection,
|
|
) -> sp_blockchain::Result<()>;
|
|
|
|
/// Inject changes trie data into the database.
|
|
fn update_changes_trie(&mut self, update: ChangesTrieTransaction<H, NumberFor<Block>>) -> sp_blockchain::Result<()>;
|
|
|
|
/// Insert auxiliary keys.
|
|
///
|
|
/// Values are `None` if should be deleted.
|
|
fn insert_aux<I>(&mut self, ops: I) -> sp_blockchain::Result<()>
|
|
where I: IntoIterator<Item=(Vec<u8>, Option<Vec<u8>>)>;
|
|
|
|
/// Mark a block as finalized.
|
|
fn mark_finalized(&mut self, id: BlockId<Block>, justification: Option<Justification>) -> sp_blockchain::Result<()>;
|
|
/// Mark a block as new head. If both block import and set head are specified, set head overrides block import's best block rule.
|
|
fn mark_head(&mut self, id: BlockId<Block>) -> sp_blockchain::Result<()>;
|
|
}
|
|
|
|
/// Finalize Facilities
|
|
pub trait Finalizer<Block: BlockT, H: Hasher<Out=Block::Hash>, B: Backend<Block, H>> {
|
|
/// Mark all blocks up to given as finalized in operation.
|
|
///
|
|
/// If `justification` is provided it is stored with the given finalized
|
|
/// block (any other finalized blocks are left unjustified).
|
|
///
|
|
/// If the block being finalized is on a different fork from the current
|
|
/// best block the finalized block is set as best, this might be slightly
|
|
/// inaccurate (i.e. outdated). Usages that require determining an accurate
|
|
/// best block should use `SelectChain` instead of the client.
|
|
fn apply_finality(
|
|
&self,
|
|
operation: &mut ClientImportOperation<Block, H, B>,
|
|
id: BlockId<Block>,
|
|
justification: Option<Justification>,
|
|
notify: bool,
|
|
) -> sp_blockchain::Result<()>;
|
|
|
|
|
|
/// Finalize a block.
|
|
///
|
|
/// This will implicitly finalize all blocks up to it and
|
|
/// fire finality notifications.
|
|
///
|
|
/// If the block being finalized is on a different fork from the current
|
|
/// best block, the finalized block is set as best. This might be slightly
|
|
/// inaccurate (i.e. outdated). Usages that require determining an accurate
|
|
/// best block should use `SelectChain` instead of the client.
|
|
///
|
|
/// Pass a flag to indicate whether finality notifications should be propagated.
|
|
/// This is usually tied to some synchronization state, where we don't send notifications
|
|
/// while performing major synchronization work.
|
|
fn finalize_block(
|
|
&self,
|
|
id: BlockId<Block>,
|
|
justification: Option<Justification>,
|
|
notify: bool,
|
|
) -> sp_blockchain::Result<()>;
|
|
|
|
}
|
|
|
|
/// Provides access to an auxiliary database.
|
|
pub trait AuxStore {
|
|
/// Insert auxiliary data into key-value store.
|
|
///
|
|
/// Deletions occur after insertions.
|
|
fn insert_aux<
|
|
'a,
|
|
'b: 'a,
|
|
'c: 'a,
|
|
I: IntoIterator<Item=&'a(&'c [u8], &'c [u8])>,
|
|
D: IntoIterator<Item=&'a &'b [u8]>,
|
|
>(&self, insert: I, delete: D) -> sp_blockchain::Result<()>;
|
|
|
|
/// Query auxiliary data from key-value store.
|
|
fn get_aux(&self, key: &[u8]) -> sp_blockchain::Result<Option<Vec<u8>>>;
|
|
}
|
|
|
|
/// Client backend.
|
|
///
|
|
/// Manages the data layer.
|
|
///
|
|
/// Note on state pruning: while an object from `state_at` is alive, the state
|
|
/// should not be pruned. The backend should internally reference-count
|
|
/// its state objects.
|
|
///
|
|
/// The same applies for live `BlockImportOperation`s: while an import operation building on a parent `P`
|
|
/// is alive, the state for `P` should not be pruned.
|
|
pub trait Backend<Block, H>: AuxStore + Send + Sync where
|
|
Block: BlockT,
|
|
H: Hasher<Out=Block::Hash>,
|
|
{
|
|
/// Associated block insertion operation type.
|
|
type BlockImportOperation: BlockImportOperation<Block, H, State=Self::State>;
|
|
/// Associated blockchain backend type.
|
|
type Blockchain: BlockchainBackend<Block>;
|
|
/// Associated state backend type.
|
|
type State: StateBackend<H>;
|
|
/// Changes trie storage.
|
|
type ChangesTrieStorage: PrunableStateChangesTrieStorage<Block, H>;
|
|
/// Offchain workers local storage.
|
|
type OffchainStorage: OffchainStorage;
|
|
|
|
/// Begin a new block insertion transaction with given parent block id.
|
|
///
|
|
/// When constructing the genesis, this is called with all-zero hash.
|
|
fn begin_operation(&self) -> sp_blockchain::Result<Self::BlockImportOperation>;
|
|
|
|
/// Note an operation to contain state transition.
|
|
fn begin_state_operation(&self, operation: &mut Self::BlockImportOperation, block: BlockId<Block>) -> sp_blockchain::Result<()>;
|
|
|
|
/// Commit block insertion.
|
|
fn commit_operation(&self, transaction: Self::BlockImportOperation) -> sp_blockchain::Result<()>;
|
|
|
|
/// Finalize block with given Id.
|
|
///
|
|
/// This should only be called if the parent of the given block has been finalized.
|
|
fn finalize_block(&self, block: BlockId<Block>, justification: Option<Justification>) -> sp_blockchain::Result<()>;
|
|
|
|
/// Returns reference to blockchain backend.
|
|
fn blockchain(&self) -> &Self::Blockchain;
|
|
|
|
/// Returns the used state cache, if existent.
|
|
fn used_state_cache_size(&self) -> Option<usize>;
|
|
|
|
/// Returns reference to changes trie storage.
|
|
fn changes_trie_storage(&self) -> Option<&Self::ChangesTrieStorage>;
|
|
|
|
/// Returns a handle to offchain storage.
|
|
fn offchain_storage(&self) -> Option<Self::OffchainStorage>;
|
|
|
|
/// Returns true if state for given block is available.
|
|
fn have_state_at(&self, hash: &Block::Hash, _number: NumberFor<Block>) -> bool {
|
|
self.state_at(BlockId::Hash(hash.clone())).is_ok()
|
|
}
|
|
|
|
/// Returns state backend with post-state of given block.
|
|
fn state_at(&self, block: BlockId<Block>) -> sp_blockchain::Result<Self::State>;
|
|
|
|
/// Destroy state and save any useful data, such as cache.
|
|
fn destroy_state(&self, _state: Self::State) -> sp_blockchain::Result<()> {
|
|
Ok(())
|
|
}
|
|
|
|
/// Attempts to revert the chain by `n` blocks. If `revert_finalized` is set
|
|
/// it will attempt to revert past any finalized block, this is unsafe and
|
|
/// can potentially leave the node in an inconsistent state.
|
|
///
|
|
/// Returns the number of blocks that were successfully reverted.
|
|
fn revert(
|
|
&self,
|
|
n: NumberFor<Block>,
|
|
revert_finalized: bool,
|
|
) -> sp_blockchain::Result<NumberFor<Block>>;
|
|
|
|
/// Insert auxiliary data into key-value store.
|
|
fn insert_aux<
|
|
'a,
|
|
'b: 'a,
|
|
'c: 'a,
|
|
I: IntoIterator<Item=&'a(&'c [u8], &'c [u8])>,
|
|
D: IntoIterator<Item=&'a &'b [u8]>,
|
|
>(&self, insert: I, delete: D) -> sp_blockchain::Result<()>
|
|
{
|
|
AuxStore::insert_aux(self, insert, delete)
|
|
}
|
|
/// Query auxiliary data from key-value store.
|
|
fn get_aux(&self, key: &[u8]) -> sp_blockchain::Result<Option<Vec<u8>>> {
|
|
AuxStore::get_aux(self, key)
|
|
}
|
|
|
|
/// Gain access to the import lock around this backend.
|
|
///
|
|
/// _Note_ Backend isn't expected to acquire the lock by itself ever. Rather
|
|
/// the using components should acquire and hold the lock whenever they do
|
|
/// something that the import of a block would interfere with, e.g. importing
|
|
/// a new block or calculating the best head.
|
|
fn get_import_lock(&self) -> &RwLock<()>;
|
|
}
|
|
|
|
/// Changes trie storage that supports pruning.
|
|
pub trait PrunableStateChangesTrieStorage<Block: BlockT, H: Hasher>:
|
|
StateChangesTrieStorage<H, NumberFor<Block>>
|
|
{
|
|
/// Get number block of oldest, non-pruned changes trie.
|
|
fn oldest_changes_trie_block(
|
|
&self,
|
|
config: &ChangesTrieConfiguration,
|
|
best_finalized: NumberFor<Block>,
|
|
) -> NumberFor<Block>;
|
|
}
|
|
|
|
/// Mark for all Backend implementations, that are making use of state data, stored locally.
|
|
pub trait LocalBackend<Block, H>: Backend<Block, H>
|
|
where
|
|
Block: BlockT,
|
|
H: Hasher<Out=Block::Hash>,
|
|
{}
|
|
|
|
/// Mark for all Backend implementations, that are fetching required state data from remote nodes.
|
|
pub trait RemoteBackend<Block, H>: Backend<Block, H>
|
|
where
|
|
Block: BlockT,
|
|
H: Hasher<Out=Block::Hash>,
|
|
{
|
|
/// Returns true if the state for given block is available locally.
|
|
fn is_local_state_available(&self, block: &BlockId<Block>) -> bool;
|
|
|
|
/// Returns reference to blockchain backend.
|
|
///
|
|
/// Returned backend either resolves blockchain data
|
|
/// locally, or prepares request to fetch that data from remote node.
|
|
fn remote_blockchain(&self) -> Arc<dyn RemoteBlockchain<Block>>;
|
|
}
|