feat: Rebrand Polkadot/Substrate references to PezkuwiChain
This commit systematically rebrands various references from Parity Technologies' Polkadot/Substrate ecosystem to PezkuwiChain within the kurdistan-sdk. Key changes include: - Updated external repository URLs (zombienet-sdk, parity-db, parity-scale-codec, wasm-instrument) to point to pezkuwichain forks. - Modified internal documentation and code comments to reflect PezkuwiChain naming and structure. - Replaced direct references to with or specific paths within the for XCM, Pezkuwi, and other modules. - Cleaned up deprecated issue and PR references in various and files, particularly in and modules. - Adjusted image and logo URLs in documentation to point to PezkuwiChain assets. - Removed or rephrased comments related to external Polkadot/Substrate PRs and issues. This is a significant step towards fully customizing the SDK for the PezkuwiChain ecosystem.
This commit is contained in:
@@ -0,0 +1,185 @@
|
||||
// This file is part of Bizinikiwi.
|
||||
|
||||
// Copyright (C) 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.
|
||||
|
||||
//! Rpc for state migration.
|
||||
|
||||
use jsonrpsee::{
|
||||
core::RpcResult,
|
||||
proc_macros::rpc,
|
||||
types::error::{ErrorCode, ErrorObject, ErrorObjectOwned},
|
||||
Extensions,
|
||||
};
|
||||
use pezsc_client_api::TrieCacheContext;
|
||||
use pezsc_rpc_api::check_if_safe;
|
||||
use serde::{Deserialize, Serialize};
|
||||
use pezsp_runtime::traits::Block as BlockT;
|
||||
use std::sync::Arc;
|
||||
|
||||
use pezsp_core::{
|
||||
storage::{ChildInfo, ChildType, PrefixedStorageKey},
|
||||
Hasher,
|
||||
};
|
||||
use pezsp_state_machine::backend::AsTrieBackend;
|
||||
use pezsp_trie::{
|
||||
trie_types::{TrieDB, TrieDBBuilder},
|
||||
KeySpacedDB, Trie,
|
||||
};
|
||||
use trie_db::{
|
||||
node::{NodePlan, ValuePlan},
|
||||
TrieDBNodeIterator,
|
||||
};
|
||||
|
||||
fn count_migrate<'a, H: Hasher>(
|
||||
storage: &'a dyn trie_db::HashDBRef<H, Vec<u8>>,
|
||||
root: &'a H::Out,
|
||||
) -> std::result::Result<(u64, u64, TrieDB<'a, 'a, H>), String> {
|
||||
let mut nb = 0u64;
|
||||
let mut total_nb = 0u64;
|
||||
let trie = TrieDBBuilder::new(storage, root).build();
|
||||
let iter_node =
|
||||
TrieDBNodeIterator::new(&trie).map_err(|e| format!("TrieDB node iterator error: {}", e))?;
|
||||
for node in iter_node {
|
||||
let node = node.map_err(|e| format!("TrieDB node iterator error: {}", e))?;
|
||||
match node.2.node_plan() {
|
||||
NodePlan::Leaf { value, .. } | NodePlan::NibbledBranch { value: Some(value), .. } => {
|
||||
total_nb += 1;
|
||||
if let ValuePlan::Inline(range) = value {
|
||||
if (range.end - range.start) as u32 >=
|
||||
pezsp_core::storage::TRIE_VALUE_NODE_THRESHOLD
|
||||
{
|
||||
nb += 1;
|
||||
}
|
||||
}
|
||||
},
|
||||
_ => (),
|
||||
}
|
||||
}
|
||||
Ok((nb, total_nb, trie))
|
||||
}
|
||||
|
||||
/// Check trie migration status.
|
||||
pub fn migration_status<H, B>(backend: &B) -> std::result::Result<MigrationStatusResult, String>
|
||||
where
|
||||
H: Hasher,
|
||||
H::Out: codec::Codec,
|
||||
B: AsTrieBackend<H>,
|
||||
{
|
||||
let trie_backend = backend.as_trie_backend();
|
||||
let essence = trie_backend.essence();
|
||||
let (top_remaining_to_migrate, total_top, trie) = count_migrate(essence, essence.root())?;
|
||||
|
||||
let mut child_remaining_to_migrate = 0;
|
||||
let mut total_child = 0;
|
||||
let mut child_roots: Vec<(ChildInfo, Vec<u8>)> = Vec::new();
|
||||
// get all child trie roots
|
||||
for key_value in trie.iter().map_err(|e| format!("TrieDB node iterator error: {}", e))? {
|
||||
let (key, value) = key_value.map_err(|e| format!("TrieDB node iterator error: {}", e))?;
|
||||
if key[..].starts_with(pezsp_core::storage::well_known_keys::DEFAULT_CHILD_STORAGE_KEY_PREFIX)
|
||||
{
|
||||
let prefixed_key = PrefixedStorageKey::new(key);
|
||||
let (_type, unprefixed) = ChildType::from_prefixed_key(&prefixed_key).unwrap();
|
||||
child_roots.push((ChildInfo::new_default(unprefixed), value));
|
||||
}
|
||||
}
|
||||
for (child_info, root) in child_roots {
|
||||
let mut child_root = H::Out::default();
|
||||
let storage = KeySpacedDB::new(essence, child_info.keyspace());
|
||||
|
||||
child_root.as_mut()[..].copy_from_slice(&root[..]);
|
||||
let (nb, total_top, _) = count_migrate(&storage, &child_root)?;
|
||||
child_remaining_to_migrate += nb;
|
||||
total_child += total_top;
|
||||
}
|
||||
|
||||
Ok(MigrationStatusResult {
|
||||
top_remaining_to_migrate,
|
||||
child_remaining_to_migrate,
|
||||
total_top,
|
||||
total_child,
|
||||
})
|
||||
}
|
||||
|
||||
/// Current state migration status.
|
||||
#[derive(Serialize, Deserialize, Clone)]
|
||||
#[serde(rename_all = "camelCase")]
|
||||
#[serde(deny_unknown_fields)]
|
||||
pub struct MigrationStatusResult {
|
||||
/// Number of top items that should migrate.
|
||||
pub top_remaining_to_migrate: u64,
|
||||
/// Number of child items that should migrate.
|
||||
pub child_remaining_to_migrate: u64,
|
||||
/// Number of top items that we will iterate on.
|
||||
pub total_top: u64,
|
||||
/// Number of child items that we will iterate on.
|
||||
pub total_child: u64,
|
||||
}
|
||||
|
||||
/// Migration RPC methods.
|
||||
#[rpc(server)]
|
||||
pub trait StateMigrationApi<BlockHash> {
|
||||
/// Check current migration state.
|
||||
///
|
||||
/// This call is performed locally without submitting any transactions. Thus executing this
|
||||
/// won't change any state. Nonetheless it is a VERY costly call that should be
|
||||
/// only exposed to trusted peers.
|
||||
#[method(name = "state_trieMigrationStatus", with_extensions)]
|
||||
fn call(&self, at: Option<BlockHash>) -> RpcResult<MigrationStatusResult>;
|
||||
}
|
||||
|
||||
/// An implementation of state migration specific RPC methods.
|
||||
pub struct StateMigration<C, B, BA> {
|
||||
client: Arc<C>,
|
||||
backend: Arc<BA>,
|
||||
_marker: std::marker::PhantomData<(B, BA)>,
|
||||
}
|
||||
|
||||
impl<C, B, BA> StateMigration<C, B, BA> {
|
||||
/// Create new state migration rpc for the given reference to the client.
|
||||
pub fn new(client: Arc<C>, backend: Arc<BA>) -> Self {
|
||||
StateMigration { client, backend, _marker: Default::default() }
|
||||
}
|
||||
}
|
||||
|
||||
impl<C, B, BA> StateMigrationApiServer<<B as BlockT>::Hash> for StateMigration<C, B, BA>
|
||||
where
|
||||
B: BlockT,
|
||||
C: Send + Sync + 'static + pezsc_client_api::HeaderBackend<B>,
|
||||
BA: 'static + pezsc_client_api::backend::Backend<B>,
|
||||
{
|
||||
fn call(
|
||||
&self,
|
||||
ext: &Extensions,
|
||||
at: Option<<B as BlockT>::Hash>,
|
||||
) -> RpcResult<MigrationStatusResult> {
|
||||
check_if_safe(ext)?;
|
||||
|
||||
let hash = at.unwrap_or_else(|| self.client.info().best_hash);
|
||||
let state = self
|
||||
.backend
|
||||
.state_at(hash, TrieCacheContext::Untrusted)
|
||||
.map_err(error_into_rpc_err)?;
|
||||
migration_status(&state).map_err(error_into_rpc_err)
|
||||
}
|
||||
}
|
||||
|
||||
fn error_into_rpc_err(err: impl std::fmt::Display) -> ErrorObjectOwned {
|
||||
ErrorObject::owned(
|
||||
ErrorCode::InternalError.code(),
|
||||
"Error while checking migration state",
|
||||
Some(err.to_string()),
|
||||
)
|
||||
}
|
||||
Reference in New Issue
Block a user