d069b98b45
* final engine changes * migration to v13 * adding and removing pending transitions * epoch_transition_for * port snapshot to new engine methods * final validator set interface * fix compiler errors * revert v13/epoch_depth transition * make call on new epoch * rolling finality checker * tests for finality checker * constructing finality proof upon pending transition * fix warnings and finality proof checking * fix compiler warnings in tests * test fixes * don't include genesis in finality checking * change snapshot test chain building logic * minor refactorings * fetch epoch transition based on parent, fix divide-by-zero in SimpleList * fix formatting * fix ABIs and finality checking in snapshot restoration * encode signal number in proof * create more blocks at the end of tests * update gist to accurate contract code * test for epoch_transition_for * fix tests with immediateTransitions parameter * disable force flag after forcing * rename ValidatorsChanged to InitiateChange and finalizeSignal to finalizeChange * a few more validator set tests
329 lines
7.4 KiB
Rust
329 lines
7.4 KiB
Rust
// Copyright 2015-2017 Parity Technologies (UK) Ltd.
|
|
// This file is part of Parity.
|
|
|
|
// 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/>.
|
|
|
|
//! Blockchain DB extras.
|
|
|
|
use bloomchain;
|
|
use blooms::{GroupPosition, BloomGroup};
|
|
use db::Key;
|
|
use engines::epoch::{Transition as EpochTransition};
|
|
use header::BlockNumber;
|
|
use receipt::Receipt;
|
|
|
|
use rlp::*;
|
|
use util::*;
|
|
use util::kvdb::PREFIX_LEN as DB_PREFIX_LEN;
|
|
|
|
|
|
/// Represents index of extra data in database
|
|
#[derive(Copy, Debug, Hash, Eq, PartialEq, Clone)]
|
|
pub enum ExtrasIndex {
|
|
/// Block details index
|
|
BlockDetails = 0,
|
|
/// Block hash index
|
|
BlockHash = 1,
|
|
/// Transaction address index
|
|
TransactionAddress = 2,
|
|
/// Block blooms index
|
|
BlocksBlooms = 3,
|
|
/// Block receipts index
|
|
BlockReceipts = 4,
|
|
/// Epoch transition data index.
|
|
EpochTransitions = 5,
|
|
/// Pending epoch transition data index.
|
|
PendingEpochTransition = 6,
|
|
}
|
|
|
|
fn with_index(hash: &H256, i: ExtrasIndex) -> H264 {
|
|
let mut result = H264::default();
|
|
result[0] = i as u8;
|
|
(*result)[1..].clone_from_slice(hash);
|
|
result
|
|
}
|
|
|
|
pub struct BlockNumberKey([u8; 5]);
|
|
|
|
impl Deref for BlockNumberKey {
|
|
type Target = [u8];
|
|
|
|
fn deref(&self) -> &Self::Target {
|
|
&self.0
|
|
}
|
|
}
|
|
|
|
impl Key<H256> for BlockNumber {
|
|
type Target = BlockNumberKey;
|
|
|
|
fn key(&self) -> Self::Target {
|
|
let mut result = [0u8; 5];
|
|
result[0] = ExtrasIndex::BlockHash as u8;
|
|
result[1] = (self >> 24) as u8;
|
|
result[2] = (self >> 16) as u8;
|
|
result[3] = (self >> 8) as u8;
|
|
result[4] = *self as u8;
|
|
BlockNumberKey(result)
|
|
}
|
|
}
|
|
|
|
impl Key<BlockDetails> for H256 {
|
|
type Target = H264;
|
|
|
|
fn key(&self) -> H264 {
|
|
with_index(self, ExtrasIndex::BlockDetails)
|
|
}
|
|
}
|
|
|
|
pub struct LogGroupKey([u8; 6]);
|
|
|
|
impl Deref for LogGroupKey {
|
|
type Target = [u8];
|
|
|
|
fn deref(&self) -> &Self::Target {
|
|
&self.0
|
|
}
|
|
}
|
|
|
|
#[derive(Debug, PartialEq, Eq, Hash, Clone)]
|
|
pub struct LogGroupPosition(GroupPosition);
|
|
|
|
impl From<bloomchain::group::GroupPosition> for LogGroupPosition {
|
|
fn from(position: bloomchain::group::GroupPosition) -> Self {
|
|
LogGroupPosition(From::from(position))
|
|
}
|
|
}
|
|
|
|
impl HeapSizeOf for LogGroupPosition {
|
|
fn heap_size_of_children(&self) -> usize {
|
|
self.0.heap_size_of_children()
|
|
}
|
|
}
|
|
|
|
impl Key<BloomGroup> for LogGroupPosition {
|
|
type Target = LogGroupKey;
|
|
|
|
fn key(&self) -> Self::Target {
|
|
let mut result = [0u8; 6];
|
|
result[0] = ExtrasIndex::BlocksBlooms as u8;
|
|
result[1] = self.0.level;
|
|
result[2] = (self.0.index >> 24) as u8;
|
|
result[3] = (self.0.index >> 16) as u8;
|
|
result[4] = (self.0.index >> 8) as u8;
|
|
result[5] = self.0.index as u8;
|
|
LogGroupKey(result)
|
|
}
|
|
}
|
|
|
|
impl Key<TransactionAddress> for H256 {
|
|
type Target = H264;
|
|
|
|
fn key(&self) -> H264 {
|
|
with_index(self, ExtrasIndex::TransactionAddress)
|
|
}
|
|
}
|
|
|
|
impl Key<BlockReceipts> for H256 {
|
|
type Target = H264;
|
|
|
|
fn key(&self) -> H264 {
|
|
with_index(self, ExtrasIndex::BlockReceipts)
|
|
}
|
|
}
|
|
|
|
impl Key<::engines::epoch::PendingTransition> for H256 {
|
|
type Target = H264;
|
|
|
|
fn key(&self) -> H264 {
|
|
with_index(self, ExtrasIndex::PendingEpochTransition)
|
|
}
|
|
}
|
|
|
|
/// length of epoch keys.
|
|
pub const EPOCH_KEY_LEN: usize = DB_PREFIX_LEN + 16;
|
|
|
|
/// epoch key prefix.
|
|
/// used to iterate over all epoch transitions in order from genesis.
|
|
pub const EPOCH_KEY_PREFIX: &'static [u8; DB_PREFIX_LEN] = &[
|
|
ExtrasIndex::EpochTransitions as u8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
];
|
|
|
|
pub struct EpochTransitionsKey([u8; EPOCH_KEY_LEN]);
|
|
impl Deref for EpochTransitionsKey {
|
|
type Target = [u8];
|
|
|
|
fn deref(&self) -> &[u8] { &self.0[..] }
|
|
}
|
|
|
|
impl Key<EpochTransitions> for u64 {
|
|
type Target = EpochTransitionsKey;
|
|
|
|
fn key(&self) -> Self::Target {
|
|
let mut arr = [0u8; EPOCH_KEY_LEN];
|
|
arr[..DB_PREFIX_LEN].copy_from_slice(&EPOCH_KEY_PREFIX[..]);
|
|
|
|
write!(&mut arr[DB_PREFIX_LEN..], "{:016x}", self)
|
|
.expect("format arg is valid; no more than 16 chars will be written; qed");
|
|
|
|
EpochTransitionsKey(arr)
|
|
}
|
|
}
|
|
|
|
/// Familial details concerning a block
|
|
#[derive(Debug, Clone)]
|
|
pub struct BlockDetails {
|
|
/// Block number
|
|
pub number: BlockNumber,
|
|
/// Total difficulty of the block and all its parents
|
|
pub total_difficulty: U256,
|
|
/// Parent block hash
|
|
pub parent: H256,
|
|
/// List of children block hashes
|
|
pub children: Vec<H256>,
|
|
}
|
|
|
|
impl HeapSizeOf for BlockDetails {
|
|
fn heap_size_of_children(&self) -> usize {
|
|
self.children.heap_size_of_children()
|
|
}
|
|
}
|
|
|
|
impl Decodable for BlockDetails {
|
|
fn decode(rlp: &UntrustedRlp) -> Result<Self, DecoderError> {
|
|
let details = BlockDetails {
|
|
number: rlp.val_at(0)?,
|
|
total_difficulty: rlp.val_at(1)?,
|
|
parent: rlp.val_at(2)?,
|
|
children: rlp.list_at(3)?,
|
|
};
|
|
Ok(details)
|
|
}
|
|
}
|
|
|
|
impl Encodable for BlockDetails {
|
|
fn rlp_append(&self, s: &mut RlpStream) {
|
|
s.begin_list(4);
|
|
s.append(&self.number);
|
|
s.append(&self.total_difficulty);
|
|
s.append(&self.parent);
|
|
s.append_list(&self.children);
|
|
}
|
|
}
|
|
|
|
/// Represents address of certain transaction within block
|
|
#[derive(Debug, PartialEq, Clone)]
|
|
pub struct TransactionAddress {
|
|
/// Block hash
|
|
pub block_hash: H256,
|
|
/// Transaction index within the block
|
|
pub index: usize
|
|
}
|
|
|
|
impl HeapSizeOf for TransactionAddress {
|
|
fn heap_size_of_children(&self) -> usize { 0 }
|
|
}
|
|
|
|
impl Decodable for TransactionAddress {
|
|
fn decode(rlp: &UntrustedRlp) -> Result<Self, DecoderError> {
|
|
let tx_address = TransactionAddress {
|
|
block_hash: rlp.val_at(0)?,
|
|
index: rlp.val_at(1)?,
|
|
};
|
|
|
|
Ok(tx_address)
|
|
}
|
|
}
|
|
|
|
impl Encodable for TransactionAddress {
|
|
fn rlp_append(&self, s: &mut RlpStream) {
|
|
s.begin_list(2);
|
|
s.append(&self.block_hash);
|
|
s.append(&self.index);
|
|
}
|
|
}
|
|
|
|
/// Contains all block receipts.
|
|
#[derive(Clone)]
|
|
pub struct BlockReceipts {
|
|
pub receipts: Vec<Receipt>,
|
|
}
|
|
|
|
impl BlockReceipts {
|
|
pub fn new(receipts: Vec<Receipt>) -> Self {
|
|
BlockReceipts {
|
|
receipts: receipts
|
|
}
|
|
}
|
|
}
|
|
|
|
impl Decodable for BlockReceipts {
|
|
fn decode(rlp: &UntrustedRlp) -> Result<Self, DecoderError> {
|
|
Ok(BlockReceipts {
|
|
receipts: rlp.as_list()?,
|
|
})
|
|
}
|
|
}
|
|
|
|
impl Encodable for BlockReceipts {
|
|
fn rlp_append(&self, s: &mut RlpStream) {
|
|
s.append_list(&self.receipts);
|
|
}
|
|
}
|
|
|
|
impl HeapSizeOf for BlockReceipts {
|
|
fn heap_size_of_children(&self) -> usize {
|
|
self.receipts.heap_size_of_children()
|
|
}
|
|
}
|
|
|
|
/// Candidate transitions to an epoch with specific number.
|
|
#[derive(Clone)]
|
|
pub struct EpochTransitions {
|
|
pub number: u64,
|
|
pub candidates: Vec<EpochTransition>,
|
|
}
|
|
|
|
impl Encodable for EpochTransitions {
|
|
fn rlp_append(&self, s: &mut RlpStream) {
|
|
s.begin_list(2).append(&self.number).append_list(&self.candidates);
|
|
}
|
|
}
|
|
|
|
impl Decodable for EpochTransitions {
|
|
fn decode(rlp: &UntrustedRlp) -> Result<Self, DecoderError> {
|
|
Ok(EpochTransitions {
|
|
number: rlp.val_at(0)?,
|
|
candidates: rlp.list_at(1)?,
|
|
})
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use rlp::*;
|
|
use super::BlockReceipts;
|
|
|
|
#[test]
|
|
fn encode_block_receipts() {
|
|
let br = BlockReceipts::new(Vec::new());
|
|
|
|
let mut s = RlpStream::new_list(2);
|
|
s.append(&br);
|
|
assert!(!s.is_finished(), "List shouldn't finished yet");
|
|
s.append(&br);
|
|
assert!(s.is_finished(), "List should be finished now");
|
|
s.out();
|
|
}
|
|
}
|