2018-06-04 10:19:50 +02:00
|
|
|
// Copyright 2015-2018 Parity Technologies (UK) Ltd.
|
2016-02-05 13:40:41 +01:00
|
|
|
// 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/>.
|
|
|
|
|
2018-07-02 18:50:05 +02:00
|
|
|
use hashdb::{HashDB, Hasher};
|
2016-06-07 20:44:09 +02:00
|
|
|
use super::triedb::TrieDB;
|
2018-07-02 18:50:05 +02:00
|
|
|
use super::{Result, Trie, TrieItem, TrieIterator, Query};
|
|
|
|
use node_codec::NodeCodec;
|
2016-01-06 13:59:48 +01:00
|
|
|
|
|
|
|
/// A `Trie` implementation which hashes keys and uses a generic `HashDB` backing database.
|
2016-04-06 10:07:24 +02:00
|
|
|
///
|
|
|
|
/// Use it as a `Trie` trait object. You can use `raw()` to get the backing `TrieDB` object.
|
2018-07-02 18:50:05 +02:00
|
|
|
pub struct SecTrieDB<'db, H, C>
|
|
|
|
where
|
|
|
|
H: Hasher + 'db,
|
|
|
|
C: NodeCodec<H>
|
|
|
|
{
|
|
|
|
raw: TrieDB<'db, H, C>
|
2016-01-06 13:59:48 +01:00
|
|
|
}
|
|
|
|
|
2018-07-02 18:50:05 +02:00
|
|
|
impl<'db, H, C> SecTrieDB<'db, H, C>
|
|
|
|
where
|
|
|
|
H: Hasher,
|
|
|
|
C: NodeCodec<H>
|
|
|
|
{
|
2016-01-06 13:59:48 +01:00
|
|
|
/// Create a new trie with the backing database `db` and empty `root`
|
2016-06-07 20:44:09 +02:00
|
|
|
///
|
2016-01-06 13:59:48 +01:00
|
|
|
/// Initialise to the state entailed by the genesis block.
|
|
|
|
/// This guarantees the trie is built correctly.
|
2016-06-07 20:44:09 +02:00
|
|
|
/// Returns an error if root does not exist.
|
2018-07-02 18:50:05 +02:00
|
|
|
pub fn new(db: &'db HashDB<H>, root: &'db H::Out) -> Result<Self, H::Out, C::Error> {
|
2016-12-27 12:53:56 +01:00
|
|
|
Ok(SecTrieDB { raw: TrieDB::new(db, root)? })
|
2016-01-06 13:59:48 +01:00
|
|
|
}
|
|
|
|
|
2016-04-06 10:07:24 +02:00
|
|
|
/// Get a reference to the underlying raw `TrieDB` struct.
|
2018-07-02 18:50:05 +02:00
|
|
|
pub fn raw(&self) -> &TrieDB<H, C> {
|
2016-01-06 13:59:48 +01:00
|
|
|
&self.raw
|
|
|
|
}
|
|
|
|
|
2016-04-06 10:07:24 +02:00
|
|
|
/// Get a mutable reference to the underlying raw `TrieDB` struct.
|
2018-07-02 18:50:05 +02:00
|
|
|
pub fn raw_mut(&mut self) -> &mut TrieDB<'db, H, C> {
|
2016-01-06 13:59:48 +01:00
|
|
|
&mut self.raw
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-07-02 18:50:05 +02:00
|
|
|
impl<'db, H, C> Trie<H, C> for SecTrieDB<'db, H, C>
|
|
|
|
where
|
|
|
|
H: Hasher,
|
|
|
|
C: NodeCodec<H>
|
|
|
|
{
|
|
|
|
fn root(&self) -> &H::Out { self.raw.root() }
|
2016-06-27 10:59:59 +02:00
|
|
|
|
2018-07-02 18:50:05 +02:00
|
|
|
fn contains(&self, key: &[u8]) -> Result<bool, H::Out, C::Error> {
|
|
|
|
self.raw.contains(H::hash(key).as_ref())
|
2016-01-06 13:59:48 +01:00
|
|
|
}
|
|
|
|
|
2018-07-02 18:50:05 +02:00
|
|
|
fn get_with<'a, 'key, Q: Query<H>>(&'a self, key: &'key [u8], query: Q) -> Result<Option<Q::Item>, H::Out, C::Error>
|
2017-01-06 16:18:45 +01:00
|
|
|
where 'a: 'key
|
2016-08-03 18:35:48 +02:00
|
|
|
{
|
2018-07-02 18:50:05 +02:00
|
|
|
self.raw.get_with(H::hash(key).as_ref(), query)
|
|
|
|
}
|
|
|
|
|
|
|
|
fn iter<'a>(&'a self) -> Result<Box<TrieIterator<H, C, Item = TrieItem<H::Out, C::Error>> + 'a>, H::Out, C::Error> {
|
|
|
|
TrieDB::iter(&self.raw)
|
2016-01-06 13:59:48 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-07-02 18:50:05 +02:00
|
|
|
#[cfg(test)]
|
|
|
|
mod test {
|
2016-06-07 20:44:09 +02:00
|
|
|
use memorydb::MemoryDB;
|
2017-01-06 16:18:45 +01:00
|
|
|
use hashdb::DBValue;
|
2018-07-02 18:50:05 +02:00
|
|
|
use keccak;
|
|
|
|
use keccak_hasher::KeccakHasher;
|
|
|
|
use ethtrie::{TrieDBMut, SecTrieDB, trie::{Trie, TrieMut}};
|
|
|
|
use ethereum_types::H256;
|
2016-01-06 13:59:48 +01:00
|
|
|
|
2018-07-02 18:50:05 +02:00
|
|
|
#[test]
|
|
|
|
fn trie_to_sectrie() {
|
|
|
|
let mut db = MemoryDB::<KeccakHasher>::new();
|
|
|
|
let mut root = H256::new();
|
|
|
|
{
|
|
|
|
let mut t = TrieDBMut::new(&mut db, &mut root);
|
|
|
|
t.insert(&keccak::keccak(&[0x01u8, 0x23]), &[0x01u8, 0x23]).unwrap();
|
|
|
|
}
|
|
|
|
let t = SecTrieDB::new(&db, &root).unwrap();
|
|
|
|
assert_eq!(t.get(&[0x01u8, 0x23]).unwrap().unwrap(), DBValue::from_slice(&[0x01u8, 0x23]));
|
2016-01-06 13:59:48 +01:00
|
|
|
}
|
2018-07-02 18:50:05 +02:00
|
|
|
}
|