mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-07-31 10:05:42 +00:00
da8b91ae7b
* switch to simple codec, trie broken for now * Actualy use trie_root_noext * align some hash, failing test on EMCH comment * Fix trie code over layout instead of hash, revert legacy code for legacy mainnet ?? * stub behind LayOut * fix no_std * temp solution for legacy trie behind feature legacy-key in various crate * use remote project * rc client db need prefix * update trie deps * bum spec runtime version * Removing legacy as default. * Switch mode to non legacy. * bump runtime version * Remove legacy trie compatibility features. * fix warning * bump version * change hash on new test. * Move dependency (#11 trie PR) patched to a parity repo. Bench reverted to correct hasher. Some renaming and doc improvments. * ChildBitmap renaming to BitMap. * Renaming of LayOut to Layout. * formatting. * Removing abreviation such as _ix nb_ or bm. * Update deps and apply renaming 'Buff' -> 'Buffer'. * Align to latest trie crates naming changes. * Update trie dependency. * Update trie dependency. * change block_import test hash * update trie deps (trie use new scale codec but it does not seems to be an issue). * update to use latest trie version (no mgmt of multiple radix). * tabify * Restoring test to 10 000. * Use published crate, trie bench is currently down until publishing (require another pr to update version). * Update trie-bench.
121 lines
3.6 KiB
Rust
121 lines
3.6 KiB
Rust
// Copyright 2015-2019 Parity Technologies (UK) Ltd.
|
|
// This file is part of Substrate.
|
|
|
|
// Parity 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.
|
|
|
|
// Parity 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 Parity. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//! The node header.
|
|
|
|
use crate::trie_constants;
|
|
use codec::{Encode, Decode, Input, Output};
|
|
use rstd::iter::once;
|
|
|
|
/// A node header
|
|
#[derive(Copy, Clone, PartialEq, Eq)]
|
|
#[cfg_attr(feature = "std", derive(Debug))]
|
|
pub(crate) enum NodeHeader {
|
|
Null,
|
|
Branch(bool, usize),
|
|
Leaf(usize),
|
|
}
|
|
|
|
/// NodeHeader without content
|
|
pub(crate) enum NodeKind {
|
|
Leaf,
|
|
BranchNoValue,
|
|
BranchWithValue,
|
|
}
|
|
|
|
impl Encode for NodeHeader {
|
|
fn encode_to<T: Output>(&self, output: &mut T) {
|
|
match self {
|
|
NodeHeader::Null => output.push_byte(trie_constants::EMPTY_TRIE),
|
|
NodeHeader::Branch(true, nibble_count) =>
|
|
encode_size_and_prefix(*nibble_count, trie_constants::BRANCH_WITH_MASK, output),
|
|
NodeHeader::Branch(false, nibble_count) =>
|
|
encode_size_and_prefix(*nibble_count, trie_constants::BRANCH_WITHOUT_MASK, output),
|
|
NodeHeader::Leaf(nibble_count) =>
|
|
encode_size_and_prefix(*nibble_count, trie_constants::LEAF_PREFIX_MASK, output),
|
|
}
|
|
}
|
|
}
|
|
|
|
impl Decode for NodeHeader {
|
|
fn decode<I: Input>(input: &mut I) -> Option<Self> {
|
|
let i = input.read_byte()?;
|
|
if i == trie_constants::EMPTY_TRIE {
|
|
return Some(NodeHeader::Null);
|
|
}
|
|
match i & (0b11 << 6) {
|
|
trie_constants::LEAF_PREFIX_MASK => Some(NodeHeader::Leaf(decode_size(i, input)?)),
|
|
trie_constants::BRANCH_WITHOUT_MASK => Some(NodeHeader::Branch(false, decode_size(i, input)?)),
|
|
trie_constants::BRANCH_WITH_MASK => Some(NodeHeader::Branch(true, decode_size(i, input)?)),
|
|
// do not allow any special encoding
|
|
_ => None,
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Returns an iterator over encoded bytes for node header and size.
|
|
/// Size encoding allows unlimited, length unefficient, representation, but
|
|
/// is bounded to 16 bit maximum value to avoid possible DOS.
|
|
pub(crate) fn size_and_prefix_iterator(size: usize, prefix: u8) -> impl Iterator<Item = u8> {
|
|
let size = rstd::cmp::min(trie_constants::NIBBLE_SIZE_BOUND, size);
|
|
|
|
let l1 = rstd::cmp::min(62, size);
|
|
let (first_byte, mut rem) = if size == l1 {
|
|
(once(prefix + l1 as u8), 0)
|
|
} else {
|
|
(once(prefix + 63), size - l1)
|
|
};
|
|
let next_bytes = move || {
|
|
if rem > 0 {
|
|
if rem < 256 {
|
|
let result = rem - 1;
|
|
rem = 0;
|
|
Some(result as u8)
|
|
} else {
|
|
rem = rem.saturating_sub(255);
|
|
Some(255)
|
|
}
|
|
} else {
|
|
None
|
|
}
|
|
};
|
|
first_byte.chain(rstd::iter::from_fn(next_bytes))
|
|
}
|
|
|
|
/// Encodes size and prefix to a stream output.
|
|
fn encode_size_and_prefix(size: usize, prefix: u8, out: &mut impl Output) {
|
|
for b in size_and_prefix_iterator(size, prefix) {
|
|
out.push_byte(b)
|
|
}
|
|
}
|
|
|
|
/// Decode size only from stream input and header byte.
|
|
fn decode_size(first: u8, input: &mut impl Input) -> Option<usize> {
|
|
let mut result = (first & 255u8 >> 2) as usize;
|
|
if result < 63 {
|
|
return Some(result);
|
|
}
|
|
result -= 1;
|
|
while result <= trie_constants::NIBBLE_SIZE_BOUND {
|
|
let n = input.read_byte()? as usize;
|
|
if n < 255 {
|
|
return Some(result + n + 1);
|
|
}
|
|
result += 255;
|
|
}
|
|
Some(trie_constants::NIBBLE_SIZE_BOUND)
|
|
}
|