mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-04-30 18:57:57 +00:00
Bastian Köcher
fd6b29dd2c
* Extend `Proposer` to optionally generate a proof of the proposal * Something * Refactor sr-api to not depend on client anymore * Fix benches * Apply suggestions from code review Co-Authored-By: Tomasz Drwięga <tomusdrw@users.noreply.github.com> * Apply suggestions from code review * Introduce new `into_storage_changes` function * Switch to runtime api for `execute_block` and don't require `H256` anywhere in the code * Put the `StorageChanges` into the `Proposal` * Move the runtime api error to its own trait * Adds `StorageTransactionCache` to the runtime api This requires that we add `type NodeBlock = ` to the `impl_runtime_apis!` macro to work around some bugs in rustc :( * Remove `type NodeBlock` and switch to a "better" hack * Start using the transaction cache from the runtime api * Make it compile * Move `InMemory` to its own file * Make all tests work again * Return block, storage_changes and proof from Blockbuilder::bake() * Make sure that we use/set `storage_changes` when possible * Add test * Fix deadlock * Remove accidentally added folders * Introduce `RecordProof` as argument type to be more explicit * Update client/src/client.rs Co-Authored-By: Tomasz Drwięga <tomusdrw@users.noreply.github.com> * Update primitives/state-machine/src/ext.rs Co-Authored-By: Tomasz Drwięga <tomusdrw@users.noreply.github.com> * Integrates review feedback * Remove `unsafe` usage * Update client/block-builder/src/lib.rs Co-Authored-By: Benjamin Kampmann <ben@gnunicorn.org> * Update client/src/call_executor.rs * Bump versions Co-authored-by: Tomasz Drwięga <tomusdrw@users.noreply.github.com> Co-authored-by: Benjamin Kampmann <ben.kampmann@googlemail.com>
78 lines
2.5 KiB
Rust
78 lines
2.5 KiB
Rust
// Copyright 2019-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 interfaces.
|
|
#![warn(missing_docs)]
|
|
|
|
pub mod backend;
|
|
pub mod call_executor;
|
|
pub mod client;
|
|
pub mod execution_extensions;
|
|
pub mod light;
|
|
pub mod notifications;
|
|
|
|
pub use sp_blockchain as blockchain;
|
|
pub use backend::*;
|
|
pub use notifications::*;
|
|
pub use call_executor::*;
|
|
pub use client::*;
|
|
pub use light::*;
|
|
pub use notifications::*;
|
|
|
|
pub use sp_state_machine::{StorageProof, ExecutionStrategy};
|
|
|
|
/// Utility methods for the client.
|
|
pub mod utils {
|
|
use sp_blockchain::{HeaderBackend, HeaderMetadata, Error};
|
|
use sp_runtime::traits::Block as BlockT;
|
|
use std::borrow::Borrow;
|
|
|
|
/// Returns a function for checking block ancestry, the returned function will
|
|
/// return `true` if the given hash (second parameter) is a descendent of the
|
|
/// base (first parameter). If the `current` parameter is defined, it should
|
|
/// represent the current block `hash` and its `parent hash`, if given the
|
|
/// function that's returned will assume that `hash` isn't part of the local DB
|
|
/// yet, and all searches in the DB will instead reference the parent.
|
|
pub fn is_descendent_of<'a, Block: BlockT, T>(
|
|
client: &'a T,
|
|
current: Option<(Block::Hash, Block::Hash)>,
|
|
) -> impl Fn(&Block::Hash, &Block::Hash) -> Result<bool, Error> + 'a
|
|
where T: HeaderBackend<Block> + HeaderMetadata<Block, Error = Error>,
|
|
{
|
|
move |base, hash| {
|
|
if base == hash { return Ok(false); }
|
|
|
|
let current = current.as_ref().map(|(c, p)| (c.borrow(), p.borrow()));
|
|
|
|
let mut hash = hash;
|
|
if let Some((current_hash, current_parent_hash)) = current {
|
|
if base == current_hash { return Ok(false); }
|
|
if hash == current_hash {
|
|
if base == current_parent_hash {
|
|
return Ok(true);
|
|
} else {
|
|
hash = current_parent_hash;
|
|
}
|
|
}
|
|
}
|
|
|
|
let ancestor = sp_blockchain::lowest_common_ancestor(client, *hash, *base)?;
|
|
|
|
Ok(ancestor.hash == *base)
|
|
}
|
|
}
|
|
}
|