671 lines
31 KiB
Rust
671 lines
31 KiB
Rust
//! Fast access to blockchain data.
|
|
|
|
use util::*;
|
|
use rocksdb::{DB, WriteBatch, Writable};
|
|
use header::*;
|
|
use extras::*;
|
|
use transaction::*;
|
|
use views::*;
|
|
|
|
/// Represents a tree route between `from` block and `to` block:
|
|
///
|
|
/// - `blocks` - a vector of hashes of all blocks, ordered from `from` to `to`.
|
|
///
|
|
/// - `ancestor` - best common ancestor of these blocks.
|
|
///
|
|
/// - `index` - an index where best common ancestor would be.
|
|
pub struct TreeRoute {
|
|
pub blocks: Vec<H256>,
|
|
pub ancestor: H256,
|
|
pub index: usize
|
|
}
|
|
|
|
/// Represents blockchain's in-memory cache size in bytes.
|
|
#[derive(Debug)]
|
|
pub struct CacheSize {
|
|
pub blocks: usize,
|
|
pub block_details: usize,
|
|
pub transaction_addresses: usize,
|
|
pub block_logs: usize,
|
|
pub blocks_blooms: usize
|
|
}
|
|
|
|
/// Information about best block gathered together
|
|
struct BestBlock {
|
|
pub hash: H256,
|
|
pub number: U256,
|
|
pub total_difficulty: U256
|
|
}
|
|
|
|
impl BestBlock {
|
|
fn new() -> BestBlock {
|
|
BestBlock {
|
|
hash: H256::new(),
|
|
number: U256::from(0),
|
|
total_difficulty: U256::from(0)
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Structure providing fast access to blockchain data.
|
|
///
|
|
/// **Does not do input data verification.**
|
|
pub struct BlockChain {
|
|
best_block: RefCell<BestBlock>,
|
|
|
|
// block cache
|
|
blocks: RefCell<HashMap<H256, Bytes>>,
|
|
|
|
// extra caches
|
|
block_details: RefCell<HashMap<H256, BlockDetails>>,
|
|
block_hashes: RefCell<HashMap<U256, H256>>,
|
|
transaction_addresses: RefCell<HashMap<H256, TransactionAddress>>,
|
|
block_logs: RefCell<HashMap<H256, BlockLogBlooms>>,
|
|
blocks_blooms: RefCell<HashMap<H256, BlocksBlooms>>,
|
|
|
|
extras_db: DB,
|
|
blocks_db: DB
|
|
}
|
|
|
|
impl BlockChain {
|
|
/// Create new instance of blockchain from given Genesis
|
|
///
|
|
/// ```rust
|
|
/// extern crate ethcore_util as util;
|
|
/// extern crate ethcore;
|
|
/// use std::env;
|
|
/// use std::str::FromStr;
|
|
/// use ethcore::genesis::*;
|
|
/// use ethcore::blockchain::*;
|
|
/// use util::hash::*;
|
|
/// use util::uint::*;
|
|
///
|
|
/// fn main() {
|
|
/// let genesis = Genesis::new_frontier();
|
|
///
|
|
/// let mut dir = env::temp_dir();
|
|
/// dir.push(H32::random().hex());
|
|
///
|
|
/// let bc = BlockChain::new(genesis.block(), &dir);
|
|
///
|
|
/// let genesis_hash = "d4e56740f876aef8c010b86a40d5f56745a118d0906a34e69aec8c0db1cb8fa3";
|
|
/// assert_eq!(bc.genesis_hash(), H256::from_str(genesis_hash).unwrap());
|
|
/// assert!(bc.is_known(&bc.genesis_hash()));
|
|
/// assert_eq!(bc.genesis_hash(), bc.block_hash(&U256::from(0u8)).unwrap());
|
|
/// }
|
|
/// ```
|
|
pub fn new(genesis: &[u8], path: &Path) -> BlockChain {
|
|
// open extras db
|
|
let mut extras_path = path.to_path_buf();
|
|
extras_path.push("extras");
|
|
let extras_db = DB::open_default(extras_path.to_str().unwrap()).unwrap();
|
|
|
|
// open blocks db
|
|
let mut blocks_path = path.to_path_buf();
|
|
blocks_path.push("blocks");
|
|
let blocks_db = DB::open_default(blocks_path.to_str().unwrap()).unwrap();
|
|
|
|
let bc = BlockChain {
|
|
best_block: RefCell::new(BestBlock::new()),
|
|
blocks: RefCell::new(HashMap::new()),
|
|
block_details: RefCell::new(HashMap::new()),
|
|
block_hashes: RefCell::new(HashMap::new()),
|
|
transaction_addresses: RefCell::new(HashMap::new()),
|
|
block_logs: RefCell::new(HashMap::new()),
|
|
blocks_blooms: RefCell::new(HashMap::new()),
|
|
extras_db: extras_db,
|
|
blocks_db: blocks_db
|
|
};
|
|
|
|
// load best block
|
|
let best_block_hash = match bc.extras_db.get(b"best").unwrap() {
|
|
Some(best) => H256::from_slice(&best),
|
|
None => {
|
|
// best block does not exist
|
|
// we need to insert genesis into the cache
|
|
let block = BlockView::new(genesis);
|
|
let header = block.header_view();
|
|
let hash = block.sha3();
|
|
|
|
let details = BlockDetails {
|
|
number: header.number(),
|
|
total_difficulty: header.difficulty(),
|
|
parent: header.parent_hash(),
|
|
children: vec![]
|
|
};
|
|
|
|
bc.blocks_db.put(&hash, genesis).unwrap();
|
|
|
|
let batch = WriteBatch::new();
|
|
batch.put_extras(&hash, &details);
|
|
batch.put_extras(&header.number(), &hash);
|
|
batch.put(b"best", &hash).unwrap();
|
|
bc.extras_db.write(batch).unwrap();
|
|
|
|
hash
|
|
}
|
|
};
|
|
|
|
{
|
|
let mut best_block = bc.best_block.borrow_mut();
|
|
best_block.number = bc.block_number(&best_block_hash).unwrap();
|
|
best_block.total_difficulty = bc.block_details(&best_block_hash).unwrap().total_difficulty;
|
|
best_block.hash = best_block_hash;
|
|
}
|
|
|
|
bc
|
|
}
|
|
|
|
/// Returns a tree route between `from` and `to`, which is a tuple of:
|
|
///
|
|
/// - a vector of hashes of all blocks, ordered from `from` to `to`.
|
|
///
|
|
/// - common ancestor of these blocks.
|
|
///
|
|
/// - an index where best common ancestor would be
|
|
///
|
|
/// 1.) from newer to older
|
|
///
|
|
/// - bc: `A1 -> A2 -> A3 -> A4 -> A5`
|
|
/// - from: A5, to: A4
|
|
/// - route:
|
|
///
|
|
/// ```json
|
|
/// { blocks: [A5], ancestor: A4, index: 1 }
|
|
/// ```
|
|
///
|
|
/// 2.) from older to newer
|
|
///
|
|
/// - bc: `A1 -> A2 -> A3 -> A4 -> A5`
|
|
/// - from: A3, to: A4
|
|
/// - route:
|
|
///
|
|
/// ```json
|
|
/// { blocks: [A4], ancestor: A3, index: 0 }
|
|
/// ```
|
|
///
|
|
/// 3.) fork:
|
|
///
|
|
/// - bc:
|
|
///
|
|
/// ```text
|
|
/// A1 -> A2 -> A3 -> A4
|
|
/// -> B3 -> B4
|
|
/// ```
|
|
/// - from: B4, to: A4
|
|
/// - route:
|
|
///
|
|
/// ```json
|
|
/// { blocks: [B4, B3, A3, A4], ancestor: A2, index: 2 }
|
|
/// ```
|
|
pub fn tree_route(&self, from: H256, to: H256) -> TreeRoute {
|
|
let from_details = self.block_details(&from).expect("from hash is invalid!");
|
|
let to_details = self.block_details(&to).expect("to hash is invalid!");
|
|
|
|
self._tree_route((from_details, from), (to_details, to))
|
|
}
|
|
|
|
/// Similar to `tree_route` function, but can be used to return a route
|
|
/// between blocks which may not be in database yet.
|
|
fn _tree_route(&self, from: (BlockDetails, H256), to: (BlockDetails, H256)) -> TreeRoute {
|
|
let mut from_branch = vec![];
|
|
let mut to_branch = vec![];
|
|
|
|
let mut from_details = from.0;
|
|
let mut to_details = to.0;
|
|
let mut current_from = from.1;
|
|
let mut current_to = to.1;
|
|
|
|
// reset from && to to the same level
|
|
while from_details.number > to_details.number {
|
|
from_branch.push(current_from);
|
|
current_from = from_details.parent.clone();
|
|
from_details = self.block_details(&from_details.parent).unwrap();
|
|
}
|
|
|
|
while to_details.number > from_details.number {
|
|
to_branch.push(current_to);
|
|
current_to = to_details.parent.clone();
|
|
to_details = self.block_details(&to_details.parent).unwrap();
|
|
}
|
|
|
|
assert_eq!(from_details.number, to_details.number);
|
|
|
|
// move to shared parent
|
|
while current_from != current_to {
|
|
from_branch.push(current_from);
|
|
current_from = from_details.parent.clone();
|
|
from_details = self.block_details(&from_details.parent).unwrap();
|
|
|
|
to_branch.push(current_to);
|
|
current_to = to_details.parent.clone();
|
|
to_details = self.block_details(&to_details.parent).unwrap();
|
|
}
|
|
|
|
let index = from_branch.len();
|
|
|
|
from_branch.extend(to_branch.into_iter().rev());
|
|
|
|
TreeRoute {
|
|
blocks: from_branch,
|
|
ancestor: current_from,
|
|
index: index
|
|
}
|
|
}
|
|
|
|
|
|
/// Inserts the block into backing cache database.
|
|
/// Expects the block to be valid and already verified.
|
|
/// If the block is already known, does nothing.
|
|
pub fn insert_block(&self, bytes: &[u8]) {
|
|
// create views onto rlp
|
|
let block = BlockView::new(bytes);
|
|
let header = block.header_view();
|
|
let hash = block.sha3();
|
|
|
|
if self.is_known(&hash) {
|
|
return;
|
|
}
|
|
|
|
// store block in db
|
|
self.blocks_db.put(&hash, &bytes).unwrap();
|
|
let (batch, new_best) = self.block_to_extras_insert_batch(bytes);
|
|
|
|
// update best block
|
|
let mut best_block = self.best_block.borrow_mut();
|
|
if let Some(b) = new_best {
|
|
*best_block = b;
|
|
}
|
|
|
|
// update caches
|
|
let mut write = self.block_details.borrow_mut();
|
|
write.remove(&header.parent_hash());
|
|
|
|
// update extras database
|
|
self.extras_db.write(batch).unwrap();
|
|
}
|
|
|
|
/// Transforms block into WriteBatch that may be written into database
|
|
/// Additionally, if it's new best block it returns new best block object.
|
|
fn block_to_extras_insert_batch(&self, bytes: &[u8]) -> (WriteBatch, Option<BestBlock>) {
|
|
// create views onto rlp
|
|
let block = BlockView::new(bytes);
|
|
let header = block.header_view();
|
|
|
|
// prepare variables
|
|
let hash = block.sha3();
|
|
let mut parent_details = self.block_details(&header.parent_hash()).expect("Invalid parent hash.");
|
|
let total_difficulty = parent_details.total_difficulty + header.difficulty();
|
|
let is_new_best = total_difficulty > self.best_block_total_difficulty();
|
|
let parent_hash = header.parent_hash();
|
|
|
|
// create current block details
|
|
let details = BlockDetails {
|
|
number: header.number(),
|
|
total_difficulty: total_difficulty,
|
|
parent: parent_hash.clone(),
|
|
children: vec![]
|
|
};
|
|
|
|
// prepare the batch
|
|
let batch = WriteBatch::new();
|
|
|
|
// insert new block details
|
|
batch.put_extras(&hash, &details);
|
|
|
|
// update parent details
|
|
parent_details.children.push(hash.clone());
|
|
batch.put_extras(&parent_hash, &parent_details);
|
|
|
|
// if it's not new best block, just return
|
|
if !is_new_best {
|
|
return (batch, None);
|
|
}
|
|
|
|
// if its new best block we need to make sure that all ancestors
|
|
// are moved to "canon chain"
|
|
// find the route between old best block and the new one
|
|
let best_hash = self.best_block_hash();
|
|
let best_details = self.block_details(&best_hash).expect("best block hash is invalid!");
|
|
let route = self._tree_route((best_details, best_hash), (details, hash.clone()));
|
|
|
|
match route.blocks.len() {
|
|
// its our parent
|
|
1 => batch.put_extras(&header.number(), &hash),
|
|
// it is a fork
|
|
i if i > 1 => {
|
|
let ancestor_number = self.block_number(&route.ancestor).unwrap();
|
|
let start_number = ancestor_number + U256::from(1u8);
|
|
for (index, hash) in route.blocks.iter().skip(route.index).enumerate() {
|
|
batch.put_extras(&(start_number + U256::from(index as u64)), hash);
|
|
}
|
|
},
|
|
// route.blocks.len() could be 0 only if inserted block is best block,
|
|
// and this is not possible at this stage
|
|
_ => { unreachable!(); }
|
|
};
|
|
|
|
// this is new best block
|
|
batch.put(b"best", &hash).unwrap();
|
|
|
|
let best_block = BestBlock {
|
|
hash: hash,
|
|
number: header.number(),
|
|
total_difficulty: total_difficulty
|
|
};
|
|
|
|
(batch, Some(best_block))
|
|
}
|
|
|
|
/// Returns true if the given block is known
|
|
/// (though not necessarily a part of the canon chain).
|
|
pub fn is_known(&self, hash: &H256) -> bool {
|
|
self.query_extras_exist(hash, &self.block_details)
|
|
}
|
|
|
|
/// Returns true if transaction is known.
|
|
pub fn is_known_transaction(&self, hash: &H256) -> bool {
|
|
self.query_extras_exist(hash, &self.transaction_addresses)
|
|
}
|
|
|
|
/// Returns reference to genesis hash.
|
|
pub fn genesis_hash(&self) -> H256 {
|
|
self.block_hash(&U256::from(0u8)).expect("Genesis hash should always exist")
|
|
}
|
|
|
|
/// Get the partial-header of a block.
|
|
pub fn block_header(&self, hash: &H256) -> Option<Header> {
|
|
self.block(hash).map(|bytes| BlockView::new(&bytes).header())
|
|
}
|
|
|
|
/// Get a list of transactions for a given block.
|
|
/// Returns None if block deos not exist.
|
|
pub fn transactions(&self, hash: &H256) -> Option<Vec<Transaction>> {
|
|
self.block(hash).map(|bytes| BlockView::new(&bytes).transactions())
|
|
}
|
|
|
|
/// Get a list of transaction hashes for a given block.
|
|
/// Returns None if block does not exist.
|
|
pub fn transaction_hashes(&self, hash: &H256) -> Option<Vec<H256>> {
|
|
self.block(hash).map(|bytes| BlockView::new(&bytes).transaction_hashes())
|
|
}
|
|
|
|
/// Get a list of uncles for a given block.
|
|
/// Returns None if block deos not exist.
|
|
pub fn uncles(&self, hash: &H256) -> Option<Vec<Header>> {
|
|
self.block(hash).map(|bytes| BlockView::new(&bytes).uncles())
|
|
}
|
|
|
|
/// Get a list of uncle hashes for a given block.
|
|
/// Returns None if block does not exist.
|
|
pub fn uncle_hashes(&self, hash: &H256) -> Option<Vec<H256>> {
|
|
self.block(hash).map(|bytes| BlockView::new(&bytes).uncle_hashes())
|
|
}
|
|
|
|
/// Get the familial details concerning a block.
|
|
pub fn block_details(&self, hash: &H256) -> Option<BlockDetails> {
|
|
self.query_extras(hash, &self.block_details)
|
|
}
|
|
|
|
/// Get the hash of given block's number.
|
|
pub fn block_hash(&self, hash: &U256) -> Option<H256> {
|
|
self.query_extras(hash, &self.block_hashes)
|
|
}
|
|
|
|
/// Get best block hash.
|
|
pub fn best_block_hash(&self) -> H256 {
|
|
self.best_block.borrow().hash.clone()
|
|
}
|
|
|
|
/// Get best block number.
|
|
pub fn best_block_number(&self) -> U256 {
|
|
self.best_block.borrow().number
|
|
}
|
|
|
|
/// Get best block total difficulty.
|
|
pub fn best_block_total_difficulty(&self) -> U256 {
|
|
self.best_block.borrow().total_difficulty
|
|
}
|
|
|
|
/// Get the number of given block's hash.
|
|
pub fn block_number(&self, hash: &H256) -> Option<U256> {
|
|
self.block(hash).map(|bytes| BlockView::new(&bytes).header_view().number())
|
|
}
|
|
|
|
/// Get the transactions' log blooms of a block.
|
|
pub fn log_blooms(&self, hash: &H256) -> Option<BlockLogBlooms> {
|
|
self.query_extras(hash, &self.block_logs)
|
|
}
|
|
|
|
fn block(&self, hash: &H256) -> Option<Bytes> {
|
|
{
|
|
let read = self.blocks.borrow();
|
|
match read.get(hash) {
|
|
Some(v) => return Some(v.clone()),
|
|
None => ()
|
|
}
|
|
}
|
|
|
|
let opt = self.blocks_db.get(hash)
|
|
.expect("Low level database error. Some issue with disk?");
|
|
|
|
match opt {
|
|
Some(b) => {
|
|
let bytes: Bytes = b.to_vec();
|
|
let mut write = self.blocks.borrow_mut();
|
|
write.insert(hash.clone(), bytes.clone());
|
|
Some(bytes)
|
|
},
|
|
None => None
|
|
}
|
|
}
|
|
|
|
fn query_extras<K, T>(&self, hash: &K, cache: &RefCell<HashMap<K, T>>) -> Option<T> where
|
|
T: Clone + Decodable + ExtrasIndexable,
|
|
K: ExtrasSliceConvertable + Eq + Hash + Clone {
|
|
{
|
|
let read = cache.borrow();
|
|
match read.get(hash) {
|
|
Some(v) => return Some(v.clone()),
|
|
None => ()
|
|
}
|
|
}
|
|
|
|
self.extras_db.get_extras(hash).map(| t: T | {
|
|
let mut write = cache.borrow_mut();
|
|
write.insert(hash.clone(), t.clone());
|
|
t
|
|
})
|
|
}
|
|
|
|
fn query_extras_exist<K, T>(&self, hash: &K, cache: &RefCell<HashMap<K, T>>) -> bool where
|
|
K: ExtrasSliceConvertable + Eq + Hash + Clone,
|
|
T: ExtrasIndexable {
|
|
{
|
|
let read = cache.borrow();
|
|
match read.get(hash) {
|
|
Some(_) => return true,
|
|
None => ()
|
|
}
|
|
}
|
|
|
|
self.extras_db.extras_exists::<_, T>(hash)
|
|
}
|
|
|
|
/// Get current cache size.
|
|
pub fn cache_size(&self) -> CacheSize {
|
|
CacheSize {
|
|
blocks: self.blocks.heap_size_of_children(),
|
|
block_details: self.block_details.heap_size_of_children(),
|
|
transaction_addresses: self.transaction_addresses.heap_size_of_children(),
|
|
block_logs: self.block_logs.heap_size_of_children(),
|
|
blocks_blooms: self.blocks_blooms.heap_size_of_children()
|
|
}
|
|
}
|
|
|
|
/// Tries to squeeze the cache if its too big.
|
|
pub fn squeeze_to_fit(&self, size: CacheSize) {
|
|
self.blocks.borrow_mut().squeeze(size.blocks);
|
|
self.block_details.borrow_mut().squeeze(size.block_details);
|
|
self.transaction_addresses.borrow_mut().squeeze(size.transaction_addresses);
|
|
self.block_logs.borrow_mut().squeeze(size.block_logs);
|
|
self.blocks_blooms.borrow_mut().squeeze(size.blocks_blooms);
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use std::env;
|
|
use std::str::FromStr;
|
|
use rustc_serialize::hex::FromHex;
|
|
use util::hash::*;
|
|
use util::uint::*;
|
|
use blockchain::*;
|
|
|
|
#[test]
|
|
fn valid_tests_extra32() {
|
|
let genesis = "f901fcf901f7a00000000000000000000000000000000000000000000000000000000000000000a01dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347948888f1f195afa192cfee860698584c030f4c9db1a0925002c3260b44e44c3edebad1cc442142b03020209df1ab8bb86752edbd2cd7a056e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421a056e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421b90100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008302000080832fefd8808454c98c8142a0363659b251bf8b819179874c8cce7b9b983d7f3704cbb58a3b334431f7032871889032d09c281e1236c0c0".from_hex().unwrap();
|
|
|
|
let mut dir = env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
let bc = BlockChain::new(&genesis, &dir);
|
|
|
|
let genesis_hash = H256::from_str("3caa2203f3d7c136c0295ed128a7d31cea520b1ca5e27afe17d0853331798942").unwrap();
|
|
|
|
assert_eq!(bc.genesis_hash(), genesis_hash.clone());
|
|
assert_eq!(bc.best_block_number(), U256::from(0u8));
|
|
assert_eq!(bc.best_block_hash(), genesis_hash.clone());
|
|
assert_eq!(bc.block_hash(&U256::from(0u8)), Some(genesis_hash.clone()));
|
|
assert_eq!(bc.block_hash(&U256::from(1u8)), None);
|
|
|
|
|
|
let first = "f90285f90219a03caa2203f3d7c136c0295ed128a7d31cea520b1ca5e27afe17d0853331798942a01dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347948888f1f195afa192cfee860698584c030f4c9db1a0bac6177a79e910c98d86ec31a09ae37ac2de15b754fd7bed1ba52362c49416bfa0d45893a296c1490a978e0bd321b5f2635d8280365c1fe9f693d65f233e791344a0c7778a7376099ee2e5c455791c1885b5c361b95713fddcbe32d97fd01334d296b90100000000000000000010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000200000000000000000008000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000040000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000200000000000400000000000000000000000000000000000000000000000000000008302000001832fefd882560b845627cb99a00102030405060708091011121314151617181920212223242526272829303132a08ccb2837fb2923bd97e8f2d08ea32012d6e34be018c73e49a0f98843e8f47d5d88e53be49fec01012ef866f864800a82c35094095e7baea6a6c7c4c2dfeb977efac326af552d8785012a05f200801ba0cb088b8d2ff76a7b2c6616c9d02fb6b7a501afbf8b69d7180b09928a1b80b5e4a06448fe7476c606582039bb72a9f6f4b4fad18507b8dfbd00eebbe151cc573cd2c0".from_hex().unwrap();
|
|
|
|
bc.insert_block(&first);
|
|
|
|
let first_hash = H256::from_str("a940e5af7d146b3b917c953a82e1966b906dace3a4e355b5b0a4560190357ea1").unwrap();
|
|
|
|
assert_eq!(bc.block_hash(&U256::from(0u8)), Some(genesis_hash.clone()));
|
|
assert_eq!(bc.best_block_number(), U256::from(1u8));
|
|
assert_eq!(bc.best_block_hash(), first_hash.clone());
|
|
assert_eq!(bc.block_hash(&U256::from(1u8)), Some(first_hash.clone()));
|
|
assert_eq!(bc.block_details(&first_hash).unwrap().parent, genesis_hash.clone());
|
|
assert_eq!(bc.block_details(&genesis_hash).unwrap().children, vec![first_hash.clone()]);
|
|
assert_eq!(bc.block_hash(&U256::from(2u8)), None);
|
|
}
|
|
|
|
#[test]
|
|
fn test_small_fork() {
|
|
let genesis = "f901fcf901f7a00000000000000000000000000000000000000000000000000000000000000000a01dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347948888f1f195afa192cfee860698584c030f4c9db1a07dba07d6b448a186e9612e5f737d1c909dce473e53199901a302c00646d523c1a056e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421a056e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421b90100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008302000080832fefd8808454c98c8142a059262c330941f3fe2a34d16d6e3c7b30d2ceb37c6a0e9a994c494ee1a61d2410885aa4c8bf8e56e264c0c0".from_hex().unwrap();
|
|
let b1 = "f90261f901f9a05716670833ec874362d65fea27a7cd35af5897d275b31a44944113111e4e96d2a01dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347948888f1f195afa192cfee860698584c030f4c9db1a0cb52de543653d86ccd13ba3ddf8b052525b04231c6884a4db3188a184681d878a0e78628dd45a1f8dc495594d83b76c588a3ee67463260f8b7d4a42f574aeab29aa0e9244cf7503b79c03d3a099e07a80d2dbc77bb0b502d8a89d51ac0d68dd31313b90100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008302000001832fefd882520884562791e580a051b3ecba4e3f2b49c11d42dd0851ec514b1be3138080f72a2b6e83868275d98f8877671f479c414b47f862f86080018304cb2f94095e7baea6a6c7c4c2dfeb977efac326af552d870a801ca09e2709d7ec9bbe6b1bbbf0b2088828d14cd5e8642a1fee22dc74bfa89761a7f9a04bd8813dee4be989accdb708b1c2e325a7e9c695a8024e30e89d6c644e424747c0".from_hex().unwrap();
|
|
let b2 = "f902ccf901f9a0437e51676ff10756fcfee5edd9159fa41dbcb1b2c592850450371cbecd54ee4fa01dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347948888f1f195afa192cfee860698584c030f4c9db1a0c70a5dc56146e5ef025e4e5726a6373c6f12fd2f6784093a19ead0a7d17fb292a040645cbce4fd399e7bb9160b4c30c40d7ee616a030d4e18ef0ed3b02bdb65911a086e608555f63628417032a011d107b36427af37d153f0da02ce3f90fdd5e8c08b90100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008302004002832fefd882c0e384562791e880a0e3cc39ff775cc0a32f175995b92e84b729e5c9a3563ff899e3555b908bc21d75887c3cde283f4846a6f8cdf8cb01018304cb2f8080b87e6060604052606e8060106000396000f360606040526000357c010000000000000000000000000000000000000000000000000000000090048063c0406226146037576035565b005b60406004506056565b6040518082815260200191505060405180910390f35b6000600560006000508190555060059050606b565b90561ba05258615c63503c0a600d6994b12ea5750d45b3c69668e2a371b4fbfb9eeff6b8a0a11be762bc90491231274a2945be35a43f23c27775b1ff24dd521702fe15f73ec0".from_hex().unwrap();
|
|
let b3a = "f90261f901f9a036fde1253128666fcb95a5956da14a73489e988bb72738717ec1d31e1cee781aa01dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347948888f1f195afa192cfee860698584c030f4c9db1a05fb2b4bfdef7b314451cb138a534d225c922fc0e5fbe25e451142732c3e25c25a09dc4b1357c0b7b8108f8a098f4f9a1a274957bc9ebc22a9ae67ae81739e5b19ca007c6fdfa8eea7e86b81f5b0fc0f78f90cc19f4aa60d323151e0cac660199e9a1b90100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008302008003832fefd882524d84562791eb80a074861666bd346c025889745c793b91ab9cd1e2ca19b5cf3c50d04d135b0a4d2b8809fe9587ea4cdc04f862f86002018304cb2f94ec0e71ad0a90ffe1909d27dac207f7680abba42d01801ba06fd84874d36d5de9e8e48978c03619b53a96b7ae0a4cd1ac118f103098b44801a00572596974dd7df4f9f69bd7456585618c568d8434ef6453391b89281ce12ae1c0".from_hex().unwrap();
|
|
let b3b = "f90265f901f9a036fde1253128666fcb95a5956da14a73489e988bb72738717ec1d31e1cee781aa01dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347948888f1f195afa192cfee860698584c030f4c9db1a0ab87dc338bfd6f662b1cd90bc0c9e40a1b2146a095312393c9e13ce3a5008b09a0e609b7a7d4b8a2403ec1268627ecd98783627246e8f1b26addb3ff504f76a054a0592fabf92476512952db3a69a2481a42912e668a1ee28c4c322e703bb665f8beb90100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008302008003832fefd882a1f084562791ee80a0fe7098fa7e4ac5d637eea81fb23f8f78346826dbab430068dd9a249d0afa99818853e1a6b201ae3545f866f86402018304cb2f94ec0e71ad0a90ffe1909d27dac207f7680abba42d0284c04062261ca06edc9ce8e7da4cc34067beb325dcad59e5655a164a5100a50bc3eb681b12c716a0abf9053d5de65b1be81fe50d327b84de685efbeecea34e7b747180a6c6023e44c0".from_hex().unwrap();
|
|
|
|
let genesis_hash = H256::from_str("5716670833ec874362d65fea27a7cd35af5897d275b31a44944113111e4e96d2").unwrap();
|
|
let b1_hash = H256::from_str("437e51676ff10756fcfee5edd9159fa41dbcb1b2c592850450371cbecd54ee4f").unwrap();
|
|
let b2_hash = H256::from_str("36fde1253128666fcb95a5956da14a73489e988bb72738717ec1d31e1cee781a").unwrap();
|
|
let b3a_hash = H256::from_str("c208f88c9f5bf7e00840439742c12e5226d9752981f3ec0521bdcb6dd08af277").unwrap();
|
|
let b3b_hash = H256::from_str("bf72270ae0d95c9ea39a6adab994793fddb8c10fba7391e26279474124605d54").unwrap();
|
|
|
|
// b3a is a part of canon chain, whereas b3b is part of sidechain
|
|
let best_block_hash = H256::from_str("c208f88c9f5bf7e00840439742c12e5226d9752981f3ec0521bdcb6dd08af277").unwrap();
|
|
|
|
let mut dir = env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
let bc = BlockChain::new(&genesis, &dir);
|
|
bc.insert_block(&b1);
|
|
bc.insert_block(&b2);
|
|
bc.insert_block(&b3a);
|
|
bc.insert_block(&b3b);
|
|
|
|
assert_eq!(bc.best_block_hash(), best_block_hash);
|
|
assert_eq!(bc.block_number(&genesis_hash).unwrap(), U256::from(0));
|
|
assert_eq!(bc.block_number(&b1_hash).unwrap(), U256::from(1));
|
|
assert_eq!(bc.block_number(&b2_hash).unwrap(), U256::from(2));
|
|
assert_eq!(bc.block_number(&b3a_hash).unwrap(), U256::from(3));
|
|
assert_eq!(bc.block_number(&b3b_hash).unwrap(), U256::from(3));
|
|
|
|
assert_eq!(bc.block_hash(&U256::from(0)).unwrap(), genesis_hash);
|
|
assert_eq!(bc.block_hash(&U256::from(1)).unwrap(), b1_hash);
|
|
assert_eq!(bc.block_hash(&U256::from(2)).unwrap(), b2_hash);
|
|
assert_eq!(bc.block_hash(&U256::from(3)).unwrap(), b3a_hash);
|
|
|
|
// test trie route
|
|
let r0_1 = bc.tree_route(genesis_hash.clone(), b1_hash.clone());
|
|
assert_eq!(r0_1.ancestor, genesis_hash);
|
|
assert_eq!(r0_1.blocks, [b1_hash.clone()]);
|
|
assert_eq!(r0_1.index, 0);
|
|
|
|
let r0_2 = bc.tree_route(genesis_hash.clone(), b2_hash.clone());
|
|
assert_eq!(r0_2.ancestor, genesis_hash);
|
|
assert_eq!(r0_2.blocks, [b1_hash.clone(), b2_hash.clone()]);
|
|
assert_eq!(r0_2.index, 0);
|
|
|
|
let r1_3a = bc.tree_route(b1_hash.clone(), b3a_hash.clone());
|
|
assert_eq!(r1_3a.ancestor, b1_hash);
|
|
assert_eq!(r1_3a.blocks, [b2_hash.clone(), b3a_hash.clone()]);
|
|
assert_eq!(r1_3a.index, 0);
|
|
|
|
let r1_3b = bc.tree_route(b1_hash.clone(), b3b_hash.clone());
|
|
assert_eq!(r1_3b.ancestor, b1_hash);
|
|
assert_eq!(r1_3b.blocks, [b2_hash.clone(), b3b_hash.clone()]);
|
|
assert_eq!(r1_3b.index, 0);
|
|
|
|
let r3a_3b = bc.tree_route(b3a_hash.clone(), b3b_hash.clone());
|
|
assert_eq!(r3a_3b.ancestor, b2_hash);
|
|
assert_eq!(r3a_3b.blocks, [b3a_hash.clone(), b3b_hash.clone()]);
|
|
assert_eq!(r3a_3b.index, 1);
|
|
|
|
let r1_0 = bc.tree_route(b1_hash.clone(), genesis_hash.clone());
|
|
assert_eq!(r1_0.ancestor, genesis_hash);
|
|
assert_eq!(r1_0.blocks, [b1_hash.clone()]);
|
|
assert_eq!(r1_0.index, 1);
|
|
|
|
let r2_0 = bc.tree_route(b2_hash.clone(), genesis_hash.clone());
|
|
assert_eq!(r2_0.ancestor, genesis_hash);
|
|
assert_eq!(r2_0.blocks, [b2_hash.clone(), b1_hash.clone()]);
|
|
assert_eq!(r2_0.index, 2);
|
|
|
|
let r3a_1 = bc.tree_route(b3a_hash.clone(), b1_hash.clone());
|
|
assert_eq!(r3a_1.ancestor, b1_hash);
|
|
assert_eq!(r3a_1.blocks, [b3a_hash.clone(), b2_hash.clone()]);
|
|
assert_eq!(r3a_1.index, 2);
|
|
|
|
let r3b_1 = bc.tree_route(b3b_hash.clone(), b1_hash.clone());
|
|
assert_eq!(r3b_1.ancestor, b1_hash);
|
|
assert_eq!(r3b_1.blocks, [b3b_hash.clone(), b2_hash.clone()]);
|
|
assert_eq!(r3b_1.index, 2);
|
|
|
|
let r3b_3a = bc.tree_route(b3b_hash.clone(), b3a_hash.clone());
|
|
assert_eq!(r3b_3a.ancestor, b2_hash);
|
|
assert_eq!(r3b_3a.blocks, [b3b_hash.clone(), b3a_hash.clone()]);
|
|
assert_eq!(r3b_3a.index, 1);
|
|
}
|
|
|
|
#[test]
|
|
fn test_reopen_blockchain_db() {
|
|
let genesis = "f901fcf901f7a00000000000000000000000000000000000000000000000000000000000000000a01dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347948888f1f195afa192cfee860698584c030f4c9db1a07dba07d6b448a186e9612e5f737d1c909dce473e53199901a302c00646d523c1a056e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421a056e81f171bcc55a6ff8345e692c0f86e5b48e01b996cadc001622fb5e363b421b90100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008302000080832fefd8808454c98c8142a059262c330941f3fe2a34d16d6e3c7b30d2ceb37c6a0e9a994c494ee1a61d2410885aa4c8bf8e56e264c0c0".from_hex().unwrap();
|
|
let b1 = "f90261f901f9a05716670833ec874362d65fea27a7cd35af5897d275b31a44944113111e4e96d2a01dcc4de8dec75d7aab85b567b6ccd41ad312451b948a7413f0a142fd40d49347948888f1f195afa192cfee860698584c030f4c9db1a0cb52de543653d86ccd13ba3ddf8b052525b04231c6884a4db3188a184681d878a0e78628dd45a1f8dc495594d83b76c588a3ee67463260f8b7d4a42f574aeab29aa0e9244cf7503b79c03d3a099e07a80d2dbc77bb0b502d8a89d51ac0d68dd31313b90100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008302000001832fefd882520884562791e580a051b3ecba4e3f2b49c11d42dd0851ec514b1be3138080f72a2b6e83868275d98f8877671f479c414b47f862f86080018304cb2f94095e7baea6a6c7c4c2dfeb977efac326af552d870a801ca09e2709d7ec9bbe6b1bbbf0b2088828d14cd5e8642a1fee22dc74bfa89761a7f9a04bd8813dee4be989accdb708b1c2e325a7e9c695a8024e30e89d6c644e424747c0".from_hex().unwrap();
|
|
let genesis_hash = H256::from_str("5716670833ec874362d65fea27a7cd35af5897d275b31a44944113111e4e96d2").unwrap();
|
|
let b1_hash = H256::from_str("437e51676ff10756fcfee5edd9159fa41dbcb1b2c592850450371cbecd54ee4f").unwrap();
|
|
|
|
let mut dir = env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
{
|
|
let bc = BlockChain::new(&genesis, &dir);
|
|
assert_eq!(bc.best_block_hash(), genesis_hash);
|
|
bc.insert_block(&b1);
|
|
assert_eq!(bc.best_block_hash(), b1_hash);
|
|
}
|
|
|
|
{
|
|
let bc = BlockChain::new(&genesis, &dir);
|
|
assert_eq!(bc.best_block_hash(), b1_hash);
|
|
}
|
|
}
|
|
}
|