openethereum/util/src/journaldb/earlymergedb.rs

1097 lines
34 KiB
Rust
Raw Normal View History

2016-12-11 19:31:31 +01:00
// Copyright 2015, 2016 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/>.
2016-04-06 10:07:24 +02:00
//! Disk-backed `HashDB` implementation.
2016-01-18 12:41:31 +01:00
use common::*;
use rlp::*;
use hashdb::*;
2016-02-04 02:40:35 +01:00
use memorydb::*;
use super::{DB_PREFIX_LEN, LATEST_ERA_KEY};
2016-03-11 13:50:39 +01:00
use super::traits::JournalDB;
use kvdb::{Database, DBTransaction};
2016-01-31 17:01:36 +01:00
#[cfg(test)]
use std::env;
2016-01-18 12:41:31 +01:00
2016-03-12 09:51:17 +01:00
#[derive(Clone, PartialEq, Eq)]
struct RefInfo {
queue_refs: usize,
in_archive: bool,
}
impl HeapSizeOf for RefInfo {
fn heap_size_of_children(&self) -> usize { 0 }
}
impl fmt::Display for RefInfo {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}+{}", self.queue_refs, if self.in_archive {1} else {0})
}
}
impl fmt::Debug for RefInfo {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}+{}", self.queue_refs, if self.in_archive {1} else {0})
}
}
#[derive(Clone, PartialEq, Eq)]
enum RemoveFrom {
Queue,
Archive,
}
2016-04-06 10:07:24 +02:00
/// Implementation of the `HashDB` trait for a disk-backed database with a memory overlay
2016-03-06 21:57:55 +01:00
/// and latent-removal semantics.
2016-01-18 12:41:31 +01:00
///
2016-04-06 10:07:24 +02:00
/// Like `OverlayDB`, there is a memory overlay; `commit()` must be called in order to
/// write operations out to disk. Unlike `OverlayDB`, `remove()` operations do not take effect
2016-01-18 12:41:31 +01:00
/// immediately. Rather some age (based on a linear but arbitrary metric) must pass before
/// the removals actually take effect.
///
/// journal format:
/// ```
/// [era, 0] => [ id, [insert_0, ...], [remove_0, ...] ]
/// [era, 1] => [ id, [insert_0, ...], [remove_0, ...] ]
/// [era, n] => [ ... ]
/// ```
///
/// When we make a new commit, we make a journal of all blocks in the recent history and record
/// all keys that were inserted and deleted. The journal is ordered by era; multiple commits can
/// share the same era. This forms a data structure similar to a queue but whose items are tuples.
/// By the time comes to remove a tuple from the queue (i.e. then the era passes from recent history
/// into ancient history) then only one commit from the tuple is considered canonical. This commit
/// is kept in the main backing database, whereas any others from the same era are reverted.
///
/// It is possible that a key, properly available in the backing database be deleted and re-inserted
/// in the recent history queue, yet have both operations in commits that are eventually non-canonical.
/// To avoid the original, and still required, key from being deleted, we maintain a reference count
/// which includes an original key, if any.
///
/// The semantics of the `counter` are:
/// ```
/// insert key k:
/// counter already contains k: count += 1
/// counter doesn't contain k:
/// backing db contains k: count = 1
/// backing db doesn't contain k: insert into backing db, count = 0
/// delete key k:
/// counter contains k (count is asserted to be non-zero):
/// count > 1: counter -= 1
/// count == 1: remove counter
/// count == 0: remove key from backing db
/// counter doesn't contain k: remove key from backing db
/// ```
///
/// Practically, this means that for each commit block turning from recent to ancient we do the
/// following:
/// ```
/// is_canonical:
/// inserts: Ignored (left alone in the backing database).
/// deletes: Enacted; however, recent history queue is checked for ongoing references. This is
/// reduced as a preference to deletion from the backing database.
/// !is_canonical:
/// inserts: Reverted; however, recent history queue is checked for ongoing references. This is
/// reduced as a preference to deletion from the backing database.
/// deletes: Ignored (they were never inserted).
/// ```
///
/// TODO: `store_reclaim_period`
pub struct EarlyMergeDB {
2016-02-04 02:40:35 +01:00
overlay: MemoryDB,
backing: Arc<Database>,
2016-03-12 09:51:17 +01:00
refs: Option<Arc<RwLock<HashMap<H256, RefInfo>>>>,
2016-03-12 19:19:45 +01:00
latest_era: Option<u64>,
column: Option<u32>,
2016-01-18 12:41:31 +01:00
}
const PADDING : [u8; 10] = [ 0u8; 10 ];
2016-02-04 21:33:30 +01:00
impl EarlyMergeDB {
/// Create a new instance from file
pub fn new(backing: Arc<Database>, col: Option<u32>) -> EarlyMergeDB {
let (latest_era, refs) = EarlyMergeDB::read_refs(&backing, col);
2016-03-12 17:30:46 +01:00
let refs = Some(Arc::new(RwLock::new(refs)));
EarlyMergeDB {
2016-02-04 02:40:35 +01:00
overlay: MemoryDB::new(),
backing: backing,
2016-03-12 09:51:17 +01:00
refs: refs,
2016-03-12 17:30:46 +01:00
latest_era: latest_era,
column: col,
2016-01-21 23:33:52 +01:00
}
}
2016-01-18 12:41:31 +01:00
/// Create a new instance with an anonymous temporary database.
#[cfg(test)]
fn new_temp() -> EarlyMergeDB {
2016-01-18 12:41:31 +01:00
let mut dir = env::temp_dir();
dir.push(H32::random().hex());
let backing = Arc::new(Database::open_default(dir.to_str().unwrap()).unwrap());
Self::new(backing, None)
2016-01-18 12:41:31 +01:00
}
2016-03-06 21:57:55 +01:00
fn morph_key(key: &H256, index: u8) -> Bytes {
let mut ret = (&**key).to_owned();
2016-03-06 21:57:55 +01:00
ret.push(index);
ret
}
2016-03-06 21:57:55 +01:00
// The next three are valid only as long as there is an insert operation of `key` in the journal.
fn set_already_in(batch: &mut DBTransaction, col: Option<u32>, key: &H256) { batch.put(col, &Self::morph_key(key, 0), &[1u8]); }
fn reset_already_in(batch: &mut DBTransaction, col: Option<u32>, key: &H256) { batch.delete(col, &Self::morph_key(key, 0)); }
fn is_already_in(backing: &Database, col: Option<u32>, key: &H256) -> bool {
backing.get(col, &Self::morph_key(key, 0)).expect("Low-level database error. Some issue with your hard disk?").is_some()
2016-03-06 21:57:55 +01:00
}
2016-10-26 13:53:47 +02:00
fn insert_keys(inserts: &[(H256, DBValue)], backing: &Database, col: Option<u32>, refs: &mut HashMap<H256, RefInfo>, batch: &mut DBTransaction, trace: bool) {
2016-03-06 21:57:55 +01:00
for &(ref h, ref d) in inserts {
2016-03-12 09:51:17 +01:00
if let Some(c) = refs.get_mut(h) {
2016-03-06 21:57:55 +01:00
// already counting. increment.
2016-03-12 09:51:17 +01:00
c.queue_refs += 1;
if trace {
trace!(target: "jdb.fine", " insert({}): In queue: Incrementing refs to {}", h, c.queue_refs);
}
2016-03-06 21:57:55 +01:00
continue;
}
2016-03-06 21:57:55 +01:00
// this is the first entry for this node in the journal.
if backing.get(col, h).expect("Low-level database error. Some issue with your hard disk?").is_some() {
2016-03-06 21:57:55 +01:00
// already in the backing DB. start counting, and remember it was already in.
Self::set_already_in(batch, col, h);
2016-03-12 09:51:17 +01:00
refs.insert(h.clone(), RefInfo{queue_refs: 1, in_archive: true});
if trace {
trace!(target: "jdb.fine", " insert({}): New to queue, in DB: Recording and inserting into queue", h);
}
2016-03-06 21:57:55 +01:00
continue;
}
2016-03-06 21:57:55 +01:00
// Gets removed when a key leaves the journal, so should never be set when we're placing a new key.
//Self::reset_already_in(&h);
assert!(!Self::is_already_in(backing, col, &h));
batch.put(col, h, d);
2016-03-12 09:51:17 +01:00
refs.insert(h.clone(), RefInfo{queue_refs: 1, in_archive: false});
if trace {
trace!(target: "jdb.fine", " insert({}): New to queue, not in DB: Inserting into queue and DB", h);
}
}
}
fn replay_keys(inserts: &[H256], backing: &Database, col: Option<u32>, refs: &mut HashMap<H256, RefInfo>) {
2016-03-12 09:51:17 +01:00
trace!(target: "jdb.fine", "replay_keys: inserts={:?}, refs={:?}", inserts, refs);
2016-03-06 21:57:55 +01:00
for h in inserts {
2016-03-12 09:51:17 +01:00
if let Some(c) = refs.get_mut(h) {
2016-03-06 21:57:55 +01:00
// already counting. increment.
2016-03-12 09:51:17 +01:00
c.queue_refs += 1;
2016-03-06 21:57:55 +01:00
continue;
}
// this is the first entry for this node in the journal.
// it is initialised to 1 if it was already in.
refs.insert(h.clone(), RefInfo{queue_refs: 1, in_archive: Self::is_already_in(backing, col, h)});
2016-03-06 21:57:55 +01:00
}
2016-03-12 09:51:17 +01:00
trace!(target: "jdb.fine", "replay_keys: (end) refs={:?}", refs);
2016-03-06 21:57:55 +01:00
}
fn remove_keys(deletes: &[H256], refs: &mut HashMap<H256, RefInfo>, batch: &mut DBTransaction, col: Option<u32>, from: RemoveFrom, trace: bool) {
// with a remove on {queue_refs: 1, in_archive: true}, we have two options:
2016-03-12 09:51:17 +01:00
// - convert to {queue_refs: 1, in_archive: false} (i.e. remove it from the conceptual archive)
// - convert to {queue_refs: 0, in_archive: true} (i.e. remove it from the conceptual queue)
// (the latter option would then mean removing the RefInfo, since it would no longer be counted in the queue.)
// both are valid, but we switch between them depending on context.
// All inserts in queue (i.e. those which may yet be reverted) have an entry in refs.
for h in deletes.iter() {
let mut n: Option<RefInfo> = None;
if let Some(c) = refs.get_mut(h) {
if c.in_archive && from == RemoveFrom::Archive {
c.in_archive = false;
Self::reset_already_in(batch, col, h);
2016-03-12 09:51:17 +01:00
if trace {
trace!(target: "jdb.fine", " remove({}): In archive, 1 in queue: Reducing to queue only and recording", h);
2016-03-12 09:51:17 +01:00
}
continue;
} else if c.queue_refs > 1 {
c.queue_refs -= 1;
if trace {
trace!(target: "jdb.fine", " remove({}): In queue > 1 refs: Decrementing ref count to {}", h, c.queue_refs);
2016-03-12 09:51:17 +01:00
}
2016-03-06 21:57:55 +01:00
continue;
} else {
2016-03-12 09:51:17 +01:00
n = Some(c.clone());
2016-03-06 21:57:55 +01:00
}
}
match n {
2016-03-12 09:51:17 +01:00
Some(RefInfo{queue_refs: 1, in_archive: true}) => {
refs.remove(h);
Self::reset_already_in(batch, col, h);
2016-03-12 09:51:17 +01:00
if trace {
trace!(target: "jdb.fine", " remove({}): In archive, 1 in queue: Removing from queue and leaving in archive", h);
2016-03-12 09:51:17 +01:00
}
}
Some(RefInfo{queue_refs: 1, in_archive: false}) => {
refs.remove(h);
batch.delete(col, h);
2016-03-12 09:51:17 +01:00
if trace {
trace!(target: "jdb.fine", " remove({}): Not in archive, only 1 ref in queue: Removing from queue and DB", h);
2016-03-12 09:51:17 +01:00
}
2016-03-06 21:57:55 +01:00
}
None => {
2016-03-06 21:57:55 +01:00
// Gets removed when moving from 1 to 0 additional refs. Should never be here at 0 additional refs.
//assert!(!Self::is_already_in(db, &h));
batch.delete(col, h);
2016-03-12 09:51:17 +01:00
if trace {
trace!(target: "jdb.fine", " remove({}): Not in queue - MUST BE IN ARCHIVE: Removing from DB", h);
2016-03-12 09:51:17 +01:00
}
2016-03-06 21:57:55 +01:00
}
2016-03-12 09:51:17 +01:00
_ => panic!("Invalid value in refs: {:?}", n),
2016-03-06 21:57:55 +01:00
}
}
}
2016-03-12 09:51:17 +01:00
#[cfg(test)]
fn can_reconstruct_refs(&self) -> bool {
let (latest_era, reconstructed) = Self::read_refs(&self.backing, self.column);
let refs = self.refs.as_ref().unwrap().write();
2016-03-12 17:30:46 +01:00
if *refs != reconstructed || latest_era != self.latest_era {
2016-03-12 09:51:17 +01:00
let clean_refs = refs.iter().filter_map(|(k, v)| if reconstructed.get(k) == Some(v) {None} else {Some((k.clone(), v.clone()))}).collect::<HashMap<_, _>>();
let clean_recon = reconstructed.into_iter().filter_map(|(k, v)| if refs.get(&k) == Some(&v) {None} else {Some((k.clone(), v.clone()))}).collect::<HashMap<_, _>>();
warn!(target: "jdb", "mem: {:?} != log: {:?}", clean_refs, clean_recon);
false
} else {
true
}
}
2016-10-26 13:53:47 +02:00
fn payload(&self, key: &H256) -> Option<DBValue> {
self.backing.get(self.column, key).expect("Low-level database error. Some issue with your hard disk?")
2016-03-11 13:50:39 +01:00
}
fn read_refs(db: &Database, col: Option<u32>) -> (Option<u64>, HashMap<H256, RefInfo>) {
2016-03-12 09:51:17 +01:00
let mut refs = HashMap::new();
2016-03-12 19:19:45 +01:00
let mut latest_era = None;
if let Some(val) = db.get(col, &LATEST_ERA_KEY).expect("Low-level database error.") {
2016-03-12 19:19:45 +01:00
let mut era = decode::<u64>(&val);
latest_era = Some(era);
2016-03-11 13:50:39 +01:00
loop {
let mut index = 0usize;
while let Some(rlp_data) = db.get(col, {
2016-03-11 13:50:39 +01:00
let mut r = RlpStream::new_list(3);
r.append(&era);
r.append(&index);
r.append(&&PADDING[..]);
&r.drain()
}).expect("Low-level database error.") {
let rlp = Rlp::new(&rlp_data);
let inserts: Vec<H256> = rlp.val_at(1);
Self::replay_keys(&inserts, db, col, &mut refs);
2016-03-11 13:50:39 +01:00
index += 1;
};
if index == 0 || era == 0 {
break;
}
era -= 1;
}
}
2016-03-12 17:30:46 +01:00
(latest_era, refs)
2016-03-11 13:50:39 +01:00
}
}
2016-03-11 13:50:39 +01:00
impl HashDB for EarlyMergeDB {
2016-03-11 13:50:39 +01:00
fn keys(&self) -> HashMap<H256, i32> {
let mut ret: HashMap<H256, i32> = HashMap::new();
for (key, _) in self.backing.iter(self.column) {
let h = H256::from_slice(&*key);
2016-03-11 13:50:39 +01:00
ret.insert(h, 1);
}
for (key, refs) in self.overlay.keys() {
2016-03-11 13:50:39 +01:00
let refs = *ret.get(&key).unwrap_or(&0) + refs;
ret.insert(key, refs);
}
ret
}
2016-10-26 13:53:47 +02:00
fn get(&self, key: &H256) -> Option<DBValue> {
2016-03-11 13:50:39 +01:00
let k = self.overlay.raw(key);
2016-10-26 13:53:47 +02:00
if let Some((d, rc)) = k {
if rc > 0 { return Some(d) }
2016-03-11 13:50:39 +01:00
}
2016-10-26 13:53:47 +02:00
self.payload(key)
2016-03-11 13:50:39 +01:00
}
fn contains(&self, key: &H256) -> bool {
self.get(key).is_some()
2016-03-11 13:50:39 +01:00
}
fn insert(&mut self, value: &[u8]) -> H256 {
self.overlay.insert(value)
}
2016-10-26 13:53:47 +02:00
fn emplace(&mut self, key: H256, value: DBValue) {
2016-03-11 13:50:39 +01:00
self.overlay.emplace(key, value);
}
fn remove(&mut self, key: &H256) {
self.overlay.remove(key);
2016-03-11 13:50:39 +01:00
}
}
impl JournalDB for EarlyMergeDB {
2016-03-28 09:42:50 +02:00
fn boxed_clone(&self) -> Box<JournalDB> {
Box::new(EarlyMergeDB {
2016-03-27 14:35:27 +02:00
overlay: self.overlay.clone(),
2016-03-11 13:50:39 +01:00
backing: self.backing.clone(),
2016-03-12 09:51:17 +01:00
refs: self.refs.clone(),
2016-03-12 19:19:45 +01:00
latest_era: self.latest_era.clone(),
column: self.column.clone(),
2016-03-11 13:50:39 +01:00
})
}
2016-03-12 09:51:17 +01:00
fn is_empty(&self) -> bool {
self.backing.get(self.column, &LATEST_ERA_KEY).expect("Low level database error").is_none()
}
fn backing(&self) -> &Arc<Database> {
&self.backing
2016-03-12 09:51:17 +01:00
}
2016-04-12 03:42:50 +02:00
fn latest_era(&self) -> Option<u64> { self.latest_era }
2016-04-12 00:51:14 +02:00
2016-03-11 13:50:39 +01:00
fn mem_used(&self) -> usize {
2016-03-12 09:51:17 +01:00
self.overlay.mem_used() + match self.refs {
Some(ref c) => c.read().heap_size_of_children(),
2016-03-11 13:50:39 +01:00
None => 0
}
}
fn state(&self, id: &H256) -> Option<Bytes> {
self.backing.get_by_prefix(self.column, &id[0..DB_PREFIX_LEN]).map(|b| b.to_vec())
}
fn journal_under(&mut self, batch: &mut DBTransaction, now: u64, id: &H256) -> Result<u32, UtilError> {
let trace = false;
2016-01-18 12:41:31 +01:00
// record new commit's details.
let mut refs = match self.refs.as_ref() {
Some(refs) => refs.write(),
None => return Ok(0),
};
2016-01-18 12:41:31 +01:00
{
let mut index = 0usize;
let mut last;
while self.backing.get(self.column, {
2016-03-06 22:43:21 +01:00
let mut r = RlpStream::new_list(3);
2016-03-06 21:57:55 +01:00
r.append(&now);
r.append(&index);
r.append(&&PADDING[..]);
2016-03-06 21:57:55 +01:00
last = r.drain();
&last
})?.is_some() {
2016-01-18 12:41:31 +01:00
index += 1;
}
2016-03-06 21:57:55 +01:00
let drained = self.overlay.drain();
2016-03-12 09:51:17 +01:00
if trace {
trace!(target: "jdb", "commit: #{} ({})", now, id);
2016-03-12 09:51:17 +01:00
}
2016-03-06 21:57:55 +01:00
let removes: Vec<H256> = drained
.iter()
.filter_map(|(k, &(_, c))| if c < 0 {Some(k.clone())} else {None})
2016-03-06 21:57:55 +01:00
.collect();
2016-10-26 13:53:47 +02:00
let inserts: Vec<(H256, _)> = drained
2016-03-06 21:57:55 +01:00
.into_iter()
.filter_map(|(k, (v, r))| if r > 0 { assert!(r == 1); Some((k, v)) } else { assert!(r >= -1); None })
.collect();
2016-03-12 09:51:17 +01:00
// TODO: check all removes are in the db.
2016-01-18 12:41:31 +01:00
let mut r = RlpStream::new_list(3);
r.append(id);
2016-03-06 21:57:55 +01:00
// Process the new inserts.
// We use the inserts for three things. For each:
// - we place into the backing DB or increment the counter if already in;
// - we note in the backing db that it was already in;
// - we write the key into our journal for this block;
r.begin_list(inserts.len());
inserts.iter().foreach(|&(k, _)| {r.append(&k);});
2016-02-04 02:40:35 +01:00
r.append(&removes);
Self::insert_keys(&inserts, &self.backing, self.column, &mut refs, batch, trace);
let ins = inserts.iter().map(|&(k, _)| k).collect::<Vec<_>>();
2016-03-12 09:51:17 +01:00
if trace {
trace!(target: "jdb.ops", " Deletes: {:?}", removes);
trace!(target: "jdb.ops", " Inserts: {:?}", ins);
2016-03-12 09:51:17 +01:00
}
batch.put(self.column, &last, r.as_raw());
2016-03-12 19:19:45 +01:00
if self.latest_era.map_or(true, |e| now > e) {
batch.put(self.column, &LATEST_ERA_KEY, &encode(&now));
2016-03-12 19:19:45 +01:00
self.latest_era = Some(now);
2016-03-12 17:30:46 +01:00
}
Ok((ins.len() + removes.len()) as u32)
2016-01-18 12:41:31 +01:00
}
}
2016-01-18 12:41:31 +01:00
#[cfg_attr(feature="dev", allow(cyclomatic_complexity))]
fn mark_canonical(&mut self, batch: &mut DBTransaction, end_era: u64, canon_id: &H256) -> Result<u32, UtilError> {
let trace = false;
2016-03-12 09:51:17 +01:00
let mut refs = self.refs.as_ref().unwrap().write();
2016-03-12 09:51:17 +01:00
// apply old commits' details
let mut index = 0usize;
let mut last;
while let Some(rlp_data) = self.backing.get(self.column, {
let mut r = RlpStream::new_list(3);
r.append(&end_era);
r.append(&index);
r.append(&&PADDING[..]);
last = r.drain();
&last
})? {
let rlp = Rlp::new(&rlp_data);
let inserts: Vec<H256> = rlp.val_at(1);
if canon_id == &rlp.val_at::<H256>(0) {
// Collect keys to be removed. Canon block - remove the (enacted) deletes.
let deletes: Vec<H256> = rlp.val_at(2);
trace!(target: "jdb.ops", " Expunging: {:?}", deletes);
Self::remove_keys(&deletes, &mut refs, batch, self.column, RemoveFrom::Archive, trace);
trace!(target: "jdb.ops", " Finalising: {:?}", inserts);
for k in &inserts {
match refs.get(k).cloned() {
None => {
// [in archive] -> SHIFT remove -> SHIFT insert None->Some{queue_refs: 1, in_archive: true} -> TAKE remove Some{queue_refs: 1, in_archive: true}->None -> TAKE insert
// already expunged from the queue (which is allowed since the key is in the archive).
// leave well alone.
}
Some( RefInfo{queue_refs: 1, in_archive: false} ) => {
// just delete the refs entry.
refs.remove(k);
}
Some( RefInfo{queue_refs: x, in_archive: false} ) => {
// must set already in; ,
Self::set_already_in(batch, self.column, k);
refs.insert(k.clone(), RefInfo{ queue_refs: x - 1, in_archive: true });
}
Some( RefInfo{in_archive: true, ..} ) => {
// Invalid! Reinserted the same key twice.
warn!("Key {} inserted twice into same fork.", k);
2016-03-12 09:51:17 +01:00
}
}
}
} else {
// Collect keys to be removed. Non-canon block - remove the (reverted) inserts.
trace!(target: "jdb.ops", " Reverting: {:?}", inserts);
Self::remove_keys(&inserts, &mut refs, batch, self.column, RemoveFrom::Queue, trace);
2016-03-12 09:51:17 +01:00
}
2016-01-18 12:41:31 +01:00
batch.delete(self.column, &last);
index += 1;
2016-03-12 09:51:17 +01:00
}
trace!(target: "jdb", "EarlyMergeDB: delete journal for time #{}.{}, (canon was {})", end_era, index, canon_id);
trace!(target: "jdb", "OK: {:?}", refs.clone());
2016-03-06 21:57:55 +01:00
Ok(0)
2016-02-05 22:54:33 +01:00
}
fn inject(&mut self, batch: &mut DBTransaction) -> Result<u32, UtilError> {
let mut ops = 0;
for (key, (value, rc)) in self.overlay.drain() {
if rc != 0 { ops += 1 }
match rc {
0 => {}
1 => {
if self.backing.get(self.column, &key)?.is_some() {
return Err(BaseDataError::AlreadyExists(key).into());
}
batch.put(self.column, &key, &value)
}
-1 => {
if self.backing.get(self.column, &key)?.is_none() {
return Err(BaseDataError::NegativelyReferencedHash(key).into());
}
batch.delete(self.column, &key)
}
_ => panic!("Attempted to inject invalid state."),
}
}
Ok(ops)
}
fn consolidate(&mut self, with: MemoryDB) {
self.overlay.consolidate(with);
}
}
2016-01-18 13:30:01 +01:00
#[cfg(test)]
mod tests {
2016-03-18 10:14:19 +01:00
#![cfg_attr(feature="dev", allow(blacklisted_name))]
2016-04-06 10:07:24 +02:00
#![cfg_attr(feature="dev", allow(similar_names))]
2016-03-18 10:14:19 +01:00
2016-01-18 13:30:01 +01:00
use common::*;
2016-11-28 17:05:37 +01:00
use hashdb::{HashDB, DBValue};
2016-01-18 13:30:01 +01:00
use super::*;
2016-03-12 09:57:57 +01:00
use super::super::traits::JournalDB;
2016-03-12 09:51:17 +01:00
use log::init_log;
use kvdb::{Database, DatabaseConfig};
2016-01-18 13:30:01 +01:00
2016-03-06 21:57:55 +01:00
#[test]
fn insert_same_in_fork() {
// history is 1
let mut jdb = EarlyMergeDB::new_temp();
2016-03-06 21:57:55 +01:00
let x = jdb.insert(b"X");
jdb.commit_batch(1, &b"1".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(2, &b"2".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(3, &b"1002a".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(4, &b"1003a".sha3(), Some((2, b"2".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-03-06 21:57:55 +01:00
jdb.remove(&x);
jdb.commit_batch(3, &b"1002b".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-03-06 21:57:55 +01:00
let x = jdb.insert(b"X");
jdb.commit_batch(4, &b"1003b".sha3(), Some((2, b"2".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-03-06 21:57:55 +01:00
jdb.commit_batch(5, &b"1004a".sha3(), Some((3, b"1002a".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(6, &b"1005a".sha3(), Some((4, b"1003a".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-03-06 21:57:55 +01:00
assert!(jdb.contains(&x));
2016-03-06 21:57:55 +01:00
}
2016-03-13 11:50:09 +01:00
#[test]
fn insert_older_era() {
let mut jdb = EarlyMergeDB::new_temp();
let foo = jdb.insert(b"foo");
jdb.commit_batch(0, &b"0a".sha3(), None).unwrap();
2016-03-13 11:50:09 +01:00
assert!(jdb.can_reconstruct_refs());
let bar = jdb.insert(b"bar");
jdb.commit_batch(1, &b"1".sha3(), Some((0, b"0a".sha3()))).unwrap();
2016-03-13 11:50:09 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&bar);
jdb.commit_batch(0, &b"0b".sha3(), None).unwrap();
2016-03-13 11:50:09 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-13 11:50:09 +01:00
assert!(jdb.contains(&foo));
assert!(jdb.contains(&bar));
2016-03-13 11:50:09 +01:00
}
2016-01-18 13:30:01 +01:00
#[test]
fn long_history() {
// history is 3
let mut jdb = EarlyMergeDB::new_temp();
2016-01-18 13:30:01 +01:00
let h = jdb.insert(b"foo");
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&h));
2016-01-18 13:30:01 +01:00
jdb.remove(&h);
jdb.commit_batch(1, &b"1".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&h));
jdb.commit_batch(2, &b"2".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&h));
jdb.commit_batch(3, &b"3".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&h));
jdb.commit_batch(4, &b"4".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(!jdb.contains(&h));
2016-01-18 13:30:01 +01:00
}
#[test]
fn complex() {
// history is 1
let mut jdb = EarlyMergeDB::new_temp();
2016-01-18 13:30:01 +01:00
let foo = jdb.insert(b"foo");
let bar = jdb.insert(b"bar");
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
assert!(jdb.contains(&bar));
2016-01-18 13:30:01 +01:00
jdb.remove(&foo);
jdb.remove(&bar);
let baz = jdb.insert(b"baz");
jdb.commit_batch(1, &b"1".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
assert!(jdb.contains(&bar));
assert!(jdb.contains(&baz));
2016-01-18 13:30:01 +01:00
let foo = jdb.insert(b"foo");
jdb.remove(&baz);
jdb.commit_batch(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
assert!(!jdb.contains(&bar));
assert!(jdb.contains(&baz));
2016-01-18 13:30:01 +01:00
jdb.remove(&foo);
jdb.commit_batch(3, &b"3".sha3(), Some((2, b"2".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
assert!(!jdb.contains(&bar));
assert!(!jdb.contains(&baz));
2016-01-18 13:30:01 +01:00
jdb.commit_batch(4, &b"4".sha3(), Some((3, b"3".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(!jdb.contains(&foo));
assert!(!jdb.contains(&bar));
assert!(!jdb.contains(&baz));
2016-01-18 13:30:01 +01:00
}
#[test]
fn fork() {
// history is 1
let mut jdb = EarlyMergeDB::new_temp();
2016-01-18 13:30:01 +01:00
let foo = jdb.insert(b"foo");
let bar = jdb.insert(b"bar");
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
assert!(jdb.contains(&bar));
2016-01-18 13:30:01 +01:00
jdb.remove(&foo);
let baz = jdb.insert(b"baz");
jdb.commit_batch(1, &b"1a".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-01-18 13:30:01 +01:00
jdb.remove(&bar);
jdb.commit_batch(1, &b"1b".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-01-18 13:30:01 +01:00
assert!(jdb.contains(&foo));
assert!(jdb.contains(&bar));
assert!(jdb.contains(&baz));
2016-01-18 13:30:01 +01:00
jdb.commit_batch(2, &b"2b".sha3(), Some((1, b"1b".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
assert!(!jdb.contains(&baz));
assert!(!jdb.contains(&bar));
2016-01-18 13:30:01 +01:00
}
2016-02-04 21:33:30 +01:00
#[test]
fn overwrite() {
// history is 1
let mut jdb = EarlyMergeDB::new_temp();
2016-02-04 21:33:30 +01:00
let foo = jdb.insert(b"foo");
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-02-04 21:33:30 +01:00
jdb.remove(&foo);
jdb.commit_batch(1, &b"1".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-02-04 21:33:30 +01:00
jdb.insert(b"foo");
assert!(jdb.contains(&foo));
jdb.commit_batch(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
jdb.commit_batch(3, &b"2".sha3(), Some((0, b"2".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-02-04 21:33:30 +01:00
}
2016-02-05 22:54:33 +01:00
#[test]
2016-03-12 09:51:17 +01:00
fn fork_same_key_one() {
let mut jdb = EarlyMergeDB::new_temp();
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-02-05 22:54:33 +01:00
let foo = jdb.insert(b"foo");
jdb.commit_batch(1, &b"1a".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-02-05 22:54:33 +01:00
jdb.insert(b"foo");
jdb.commit_batch(1, &b"1b".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(1, &b"1c".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-02-05 22:54:33 +01:00
jdb.commit_batch(2, &b"2a".sha3(), Some((1, b"1a".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-03-12 09:51:17 +01:00
}
#[test]
fn fork_same_key_other() {
let mut jdb = EarlyMergeDB::new_temp();
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
let foo = jdb.insert(b"foo");
jdb.commit_batch(1, &b"1a".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(1, &b"1b".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(1, &b"1c".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-03-12 09:51:17 +01:00
jdb.commit_batch(2, &b"2b".sha3(), Some((1, b"1b".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-02-05 22:54:33 +01:00
}
2016-03-12 09:51:17 +01:00
#[test]
fn fork_ins_del_ins() {
let mut jdb = EarlyMergeDB::new_temp();
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
let foo = jdb.insert(b"foo");
jdb.commit_batch(1, &b"1".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
jdb.commit_batch(2, &b"2a".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
jdb.commit_batch(2, &b"2b".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(3, &b"3a".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(3, &b"3b".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(4, &b"4a".sha3(), Some((2, b"2a".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(5, &b"5a".sha3(), Some((3, b"3a".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
}
fn new_db(path: &Path) -> EarlyMergeDB {
let config = DatabaseConfig::with_columns(Some(1));
let backing = Arc::new(Database::open(&config, path.to_str().unwrap()).unwrap());
EarlyMergeDB::new(backing, Some(0))
}
#[test]
fn reopen() {
let mut dir = ::std::env::temp_dir();
dir.push(H32::random().hex());
let bar = H256::random();
let foo = {
let mut jdb = new_db(&dir);
// history is 1
let foo = jdb.insert(b"foo");
2016-10-26 13:53:47 +02:00
jdb.emplace(bar.clone(), DBValue::from_slice(b"bar"));
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
foo
};
{
let mut jdb = new_db(&dir);
jdb.remove(&foo);
jdb.commit_batch(1, &b"1".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
}
{
let mut jdb = new_db(&dir);
assert!(jdb.contains(&foo));
assert!(jdb.contains(&bar));
jdb.commit_batch(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(!jdb.contains(&foo));
}
}
#[test]
2016-03-12 09:51:17 +01:00
fn insert_delete_insert_delete_insert_expunge() {
init_log();
let mut jdb = EarlyMergeDB::new_temp();
2016-03-12 09:51:17 +01:00
// history is 4
let foo = jdb.insert(b"foo");
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
jdb.commit_batch(1, &b"1".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(2, &b"2".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
jdb.commit_batch(3, &b"3".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(4, &b"4".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
// expunge foo
jdb.commit_batch(5, &b"5".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
}
#[test]
fn forked_insert_delete_insert_delete_insert_expunge() {
init_log();
let mut jdb = EarlyMergeDB::new_temp();
2016-03-12 09:51:17 +01:00
// history is 4
let foo = jdb.insert(b"foo");
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
jdb.commit_batch(1, &b"1a".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
jdb.commit_batch(1, &b"1b".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(2, &b"2a".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(2, &b"2b".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
jdb.commit_batch(3, &b"3a".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
jdb.commit_batch(3, &b"3b".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(4, &b"4a".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(4, &b"4b".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
// expunge foo
jdb.commit_batch(5, &b"5".sha3(), Some((1, b"1a".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
}
#[test]
fn broken_assert() {
let mut jdb = EarlyMergeDB::new_temp();
2016-03-12 09:51:17 +01:00
// history is 1
let foo = jdb.insert(b"foo");
jdb.commit_batch(1, &b"1".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
// foo is ancient history.
jdb.remove(&foo);
jdb.commit_batch(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.commit_batch(3, &b"3".sha3(), Some((2, b"2".sha3()))).unwrap(); // BROKEN
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-03-12 09:51:17 +01:00
jdb.remove(&foo);
jdb.commit_batch(4, &b"4".sha3(), Some((3, b"3".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(5, &b"5".sha3(), Some((4, b"4".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(!jdb.contains(&foo));
2016-03-12 09:51:17 +01:00
}
2016-03-13 21:06:24 +01:00
2016-03-12 09:51:17 +01:00
#[test]
fn reopen_test() {
let mut jdb = EarlyMergeDB::new_temp();
2016-03-12 09:51:17 +01:00
// history is 4
let foo = jdb.insert(b"foo");
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(1, &b"1".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(2, &b"2".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(3, &b"3".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(4, &b"4".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
// foo is ancient history.
jdb.insert(b"foo");
let bar = jdb.insert(b"bar");
jdb.commit_batch(5, &b"5".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
jdb.remove(&bar);
jdb.commit_batch(6, &b"6".sha3(), Some((2, b"2".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.insert(b"foo");
jdb.insert(b"bar");
jdb.commit_batch(7, &b"7".sha3(), Some((3, b"3".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
}
2016-03-13 21:06:24 +01:00
2016-03-12 09:51:17 +01:00
#[test]
fn reopen_remove_three() {
init_log();
let mut dir = ::std::env::temp_dir();
dir.push(H32::random().hex());
let foo = b"foo".sha3();
{
let mut jdb = new_db(&dir);
// history is 1
2016-03-12 09:51:17 +01:00
jdb.insert(b"foo");
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.commit_batch(1, &b"1".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
2016-03-07 09:10:02 +01:00
// foo is ancient history.
2016-03-12 09:51:17 +01:00
jdb.remove(&foo);
jdb.commit_batch(2, &b"2".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-03-12 09:51:17 +01:00
jdb.insert(b"foo");
jdb.commit_batch(3, &b"3".sha3(), Some((1, b"1".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-03-12 09:51:17 +01:00
// incantation to reopen the db
}; {
let mut jdb = new_db(&dir);
jdb.remove(&foo);
jdb.commit_batch(4, &b"4".sha3(), Some((2, b"2".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-03-12 09:51:17 +01:00
// incantation to reopen the db
}; {
let mut jdb = new_db(&dir);
2016-03-12 09:51:17 +01:00
jdb.commit_batch(5, &b"5".sha3(), Some((3, b"3".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
2016-03-12 09:51:17 +01:00
// incantation to reopen the db
}; {
let mut jdb = new_db(&dir);
2016-03-12 09:51:17 +01:00
jdb.commit_batch(6, &b"6".sha3(), Some((4, b"4".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(!jdb.contains(&foo));
}
}
2016-03-13 21:06:24 +01:00
#[test]
fn reopen_fork() {
let mut dir = ::std::env::temp_dir();
dir.push(H32::random().hex());
let (foo, bar, baz) = {
let mut jdb = new_db(&dir);
// history is 1
let foo = jdb.insert(b"foo");
let bar = jdb.insert(b"bar");
jdb.commit_batch(0, &b"0".sha3(), None).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&foo);
let baz = jdb.insert(b"baz");
jdb.commit_batch(1, &b"1a".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
jdb.remove(&bar);
jdb.commit_batch(1, &b"1b".sha3(), Some((0, b"0".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
(foo, bar, baz)
};
{
let mut jdb = new_db(&dir);
jdb.commit_batch(2, &b"2b".sha3(), Some((1, b"1b".sha3()))).unwrap();
2016-03-12 09:51:17 +01:00
assert!(jdb.can_reconstruct_refs());
assert!(jdb.contains(&foo));
assert!(!jdb.contains(&baz));
assert!(!jdb.contains(&bar));
}
}
#[test]
fn inject() {
let temp = ::devtools::RandomTempPath::new();
let mut jdb = new_db(temp.as_path().as_path());
let key = jdb.insert(b"dog");
jdb.inject_batch().unwrap();
2016-10-26 13:53:47 +02:00
assert_eq!(jdb.get(&key).unwrap(), DBValue::from_slice(b"dog"));
jdb.remove(&key);
jdb.inject_batch().unwrap();
assert!(jdb.get(&key).is_none());
}
2016-01-18 13:30:01 +01:00
}