36d3d0d7d7
* parking_lot in cargo.toml * replace all lock invocations with parking_lot ones * use parking_lot synchronization primitives
1068 lines
34 KiB
Rust
1068 lines
34 KiB
Rust
// Copyright 2015, 2016 Ethcore (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/>.
|
|
|
|
//! Disk-backed `HashDB` implementation.
|
|
|
|
use common::*;
|
|
use rlp::*;
|
|
use hashdb::*;
|
|
use memorydb::*;
|
|
use super::{DB_PREFIX_LEN, LATEST_ERA_KEY, VERSION_KEY};
|
|
use super::traits::JournalDB;
|
|
use kvdb::{Database, DBTransaction, DatabaseConfig};
|
|
#[cfg(test)]
|
|
use std::env;
|
|
|
|
#[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,
|
|
}
|
|
|
|
/// Implementation of the `HashDB` trait for a disk-backed database with a memory overlay
|
|
/// and latent-removal semantics.
|
|
///
|
|
/// 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
|
|
/// immediately. Rather some age (based on a linear but arbitrary metric) must pass before
|
|
/// the removals actually take effect.
|
|
pub struct EarlyMergeDB {
|
|
overlay: MemoryDB,
|
|
backing: Arc<Database>,
|
|
refs: Option<Arc<RwLock<HashMap<H256, RefInfo>>>>,
|
|
latest_era: Option<u64>,
|
|
}
|
|
|
|
const DB_VERSION : u32 = 0x003;
|
|
const PADDING : [u8; 10] = [ 0u8; 10 ];
|
|
|
|
impl EarlyMergeDB {
|
|
/// Create a new instance from file
|
|
pub fn new(path: &str, config: DatabaseConfig) -> EarlyMergeDB {
|
|
let opts = config.prefix(DB_PREFIX_LEN);
|
|
let backing = Database::open(&opts, path).unwrap_or_else(|e| {
|
|
panic!("Error opening state db: {}", e);
|
|
});
|
|
if !backing.is_empty() {
|
|
match backing.get(&VERSION_KEY).map(|d| d.map(|v| decode::<u32>(&v))) {
|
|
Ok(Some(DB_VERSION)) => {},
|
|
v => panic!("Incompatible DB version, expected {}, got {:?}; to resolve, remove {} and restart.", DB_VERSION, v, path)
|
|
}
|
|
} else {
|
|
backing.put(&VERSION_KEY, &encode(&DB_VERSION)).expect("Error writing version to database");
|
|
}
|
|
|
|
let (latest_era, refs) = EarlyMergeDB::read_refs(&backing);
|
|
let refs = Some(Arc::new(RwLock::new(refs)));
|
|
EarlyMergeDB {
|
|
overlay: MemoryDB::new(),
|
|
backing: Arc::new(backing),
|
|
refs: refs,
|
|
latest_era: latest_era,
|
|
}
|
|
}
|
|
|
|
/// Create a new instance with an anonymous temporary database.
|
|
#[cfg(test)]
|
|
fn new_temp() -> EarlyMergeDB {
|
|
let mut dir = env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
Self::new(dir.to_str().unwrap(), DatabaseConfig::default())
|
|
}
|
|
|
|
fn morph_key(key: &H256, index: u8) -> Bytes {
|
|
let mut ret = key.to_bytes();
|
|
ret.push(index);
|
|
ret
|
|
}
|
|
|
|
// The next three are valid only as long as there is an insert operation of `key` in the journal.
|
|
fn set_already_in(batch: &DBTransaction, key: &H256) { batch.put(&Self::morph_key(key, 0), &[1u8]).expect("Low-level database error. Some issue with your hard disk?"); }
|
|
fn reset_already_in(batch: &DBTransaction, key: &H256) { batch.delete(&Self::morph_key(key, 0)).expect("Low-level database error. Some issue with your hard disk?"); }
|
|
fn is_already_in(backing: &Database, key: &H256) -> bool {
|
|
backing.get(&Self::morph_key(key, 0)).expect("Low-level database error. Some issue with your hard disk?").is_some()
|
|
}
|
|
|
|
fn insert_keys(inserts: &[(H256, Bytes)], backing: &Database, refs: &mut HashMap<H256, RefInfo>, batch: &DBTransaction, trace: bool) {
|
|
for &(ref h, ref d) in inserts {
|
|
if let Some(c) = refs.get_mut(h) {
|
|
// already counting. increment.
|
|
c.queue_refs += 1;
|
|
if trace {
|
|
trace!(target: "jdb.fine", " insert({}): In queue: Incrementing refs to {}", h, c.queue_refs);
|
|
}
|
|
continue;
|
|
}
|
|
|
|
// this is the first entry for this node in the journal.
|
|
if backing.get(h).expect("Low-level database error. Some issue with your hard disk?").is_some() {
|
|
// already in the backing DB. start counting, and remember it was already in.
|
|
Self::set_already_in(batch, &h);
|
|
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);
|
|
}
|
|
continue;
|
|
}
|
|
|
|
// 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, &h));
|
|
batch.put(h, d).expect("Low-level database error. Some issue with your hard disk?");
|
|
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, refs: &mut HashMap<H256, RefInfo>) {
|
|
trace!(target: "jdb.fine", "replay_keys: inserts={:?}, refs={:?}", inserts, refs);
|
|
for h in inserts {
|
|
if let Some(c) = refs.get_mut(h) {
|
|
// already counting. increment.
|
|
c.queue_refs += 1;
|
|
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, h)});
|
|
}
|
|
trace!(target: "jdb.fine", "replay_keys: (end) refs={:?}", refs);
|
|
}
|
|
|
|
fn remove_keys(deletes: &[H256], refs: &mut HashMap<H256, RefInfo>, batch: &DBTransaction, from: RemoveFrom, trace: bool) {
|
|
// with a remove on {queue_refs: 1, in_archive: true}, we have two options:
|
|
// - 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, h);
|
|
if trace {
|
|
trace!(target: "jdb.fine", " remove({}): In archive, 1 in queue: Reducing to queue only and recording", h);
|
|
}
|
|
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);
|
|
}
|
|
continue;
|
|
} else {
|
|
n = Some(c.clone());
|
|
}
|
|
}
|
|
match n {
|
|
Some(RefInfo{queue_refs: 1, in_archive: true}) => {
|
|
refs.remove(h);
|
|
Self::reset_already_in(batch, h);
|
|
if trace {
|
|
trace!(target: "jdb.fine", " remove({}): In archive, 1 in queue: Removing from queue and leaving in archive", h);
|
|
}
|
|
}
|
|
Some(RefInfo{queue_refs: 1, in_archive: false}) => {
|
|
refs.remove(h);
|
|
batch.delete(h).expect("Low-level database error. Some issue with your hard disk?");
|
|
if trace {
|
|
trace!(target: "jdb.fine", " remove({}): Not in archive, only 1 ref in queue: Removing from queue and DB", h);
|
|
}
|
|
}
|
|
None => {
|
|
// 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(h).expect("Low-level database error. Some issue with your hard disk?");
|
|
if trace {
|
|
trace!(target: "jdb.fine", " remove({}): Not in queue - MUST BE IN ARCHIVE: Removing from DB", h);
|
|
}
|
|
}
|
|
_ => panic!("Invalid value in refs: {:?}", n),
|
|
}
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
fn can_reconstruct_refs(&self) -> bool {
|
|
let (latest_era, reconstructed) = Self::read_refs(&self.backing);
|
|
let refs = self.refs.as_ref().unwrap().write();
|
|
if *refs != reconstructed || latest_era != self.latest_era {
|
|
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
|
|
}
|
|
}
|
|
|
|
fn payload(&self, key: &H256) -> Option<Bytes> {
|
|
self.backing.get(key).expect("Low-level database error. Some issue with your hard disk?").map(|v| v.to_vec())
|
|
}
|
|
|
|
fn read_refs(db: &Database) -> (Option<u64>, HashMap<H256, RefInfo>) {
|
|
let mut refs = HashMap::new();
|
|
let mut latest_era = None;
|
|
if let Some(val) = db.get(&LATEST_ERA_KEY).expect("Low-level database error.") {
|
|
let mut era = decode::<u64>(&val);
|
|
latest_era = Some(era);
|
|
loop {
|
|
let mut index = 0usize;
|
|
while let Some(rlp_data) = db.get({
|
|
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, &mut refs);
|
|
index += 1;
|
|
};
|
|
if index == 0 || era == 0 {
|
|
break;
|
|
}
|
|
era -= 1;
|
|
}
|
|
}
|
|
(latest_era, refs)
|
|
}
|
|
}
|
|
|
|
impl HashDB for EarlyMergeDB {
|
|
fn keys(&self) -> HashMap<H256, i32> {
|
|
let mut ret: HashMap<H256, i32> = HashMap::new();
|
|
for (key, _) in self.backing.iter() {
|
|
let h = H256::from_slice(key.deref());
|
|
ret.insert(h, 1);
|
|
}
|
|
|
|
for (key, refs) in self.overlay.keys().into_iter() {
|
|
let refs = *ret.get(&key).unwrap_or(&0) + refs;
|
|
ret.insert(key, refs);
|
|
}
|
|
ret
|
|
}
|
|
|
|
fn get(&self, key: &H256) -> Option<&[u8]> {
|
|
let k = self.overlay.raw(key);
|
|
match k {
|
|
Some(&(ref d, rc)) if rc > 0 => Some(d),
|
|
_ => {
|
|
if let Some(x) = self.payload(key) {
|
|
Some(&self.overlay.denote(key, x).0)
|
|
}
|
|
else {
|
|
None
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
fn contains(&self, key: &H256) -> bool {
|
|
self.get(key).is_some()
|
|
}
|
|
|
|
fn insert(&mut self, value: &[u8]) -> H256 {
|
|
self.overlay.insert(value)
|
|
}
|
|
fn emplace(&mut self, key: H256, value: Bytes) {
|
|
self.overlay.emplace(key, value);
|
|
}
|
|
fn remove(&mut self, key: &H256) {
|
|
self.overlay.remove(key);
|
|
}
|
|
}
|
|
|
|
impl JournalDB for EarlyMergeDB {
|
|
fn boxed_clone(&self) -> Box<JournalDB> {
|
|
Box::new(EarlyMergeDB {
|
|
overlay: self.overlay.clone(),
|
|
backing: self.backing.clone(),
|
|
refs: self.refs.clone(),
|
|
latest_era: self.latest_era.clone(),
|
|
})
|
|
}
|
|
|
|
fn is_empty(&self) -> bool {
|
|
self.backing.get(&LATEST_ERA_KEY).expect("Low level database error").is_none()
|
|
}
|
|
|
|
fn latest_era(&self) -> Option<u64> { self.latest_era }
|
|
|
|
fn mem_used(&self) -> usize {
|
|
self.overlay.mem_used() + match self.refs {
|
|
Some(ref c) => c.read().heap_size_of_children(),
|
|
None => 0
|
|
}
|
|
}
|
|
|
|
fn state(&self, id: &H256) -> Option<Bytes> {
|
|
self.backing.get_by_prefix(&id[0..DB_PREFIX_LEN]).map(|b| b.to_vec())
|
|
}
|
|
|
|
#[cfg_attr(feature="dev", allow(cyclomatic_complexity))]
|
|
fn commit(&mut self, now: u64, id: &H256, end: Option<(u64, H256)>) -> Result<u32, UtilError> {
|
|
// journal format:
|
|
// [era, 0] => [ id, [insert_0, ...], [remove_0, ...] ]
|
|
// [era, 1] => [ id, [insert_0, ...], [remove_0, ...] ]
|
|
// [era, n] => [ ... ]
|
|
|
|
// TODO: store reclaim_period.
|
|
|
|
// 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).
|
|
//
|
|
|
|
// record new commit's details.
|
|
let mut refs = self.refs.as_ref().unwrap().write();
|
|
let batch = DBTransaction::new();
|
|
let trace = false;
|
|
{
|
|
let mut index = 0usize;
|
|
let mut last;
|
|
|
|
while try!(self.backing.get({
|
|
let mut r = RlpStream::new_list(3);
|
|
r.append(&now);
|
|
r.append(&index);
|
|
r.append(&&PADDING[..]);
|
|
last = r.drain();
|
|
&last
|
|
})).is_some() {
|
|
index += 1;
|
|
}
|
|
|
|
let drained = self.overlay.drain();
|
|
|
|
if trace {
|
|
trace!(target: "jdb", "commit: #{} ({}), end era: {:?}", now, id, end);
|
|
}
|
|
|
|
let removes: Vec<H256> = drained
|
|
.iter()
|
|
.filter_map(|(k, &(_, c))| if c < 0 {Some(k.clone())} else {None})
|
|
.collect();
|
|
let inserts: Vec<(H256, Bytes)> = drained
|
|
.into_iter()
|
|
.filter_map(|(k, (v, r))| if r > 0 { assert!(r == 1); Some((k, v)) } else { assert!(r >= -1); None })
|
|
.collect();
|
|
|
|
|
|
// TODO: check all removes are in the db.
|
|
|
|
let mut r = RlpStream::new_list(3);
|
|
r.append(id);
|
|
|
|
// 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);});
|
|
r.append(&removes);
|
|
Self::insert_keys(&inserts, &self.backing, &mut refs, &batch, trace);
|
|
if trace {
|
|
let ins = inserts.iter().map(|&(k, _)| k).collect::<Vec<_>>();
|
|
trace!(target: "jdb.ops", " Inserts: {:?}", ins);
|
|
trace!(target: "jdb.ops", " Deletes: {:?}", removes);
|
|
}
|
|
try!(batch.put(&last, r.as_raw()));
|
|
if self.latest_era.map_or(true, |e| now > e) {
|
|
try!(batch.put(&LATEST_ERA_KEY, &encode(&now)));
|
|
self.latest_era = Some(now);
|
|
}
|
|
}
|
|
|
|
// apply old commits' details
|
|
if let Some((end_era, canon_id)) = end {
|
|
let mut index = 0usize;
|
|
let mut last;
|
|
while let Some(rlp_data) = try!(self.backing.get({
|
|
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(0) {
|
|
// Collect keys to be removed. Canon block - remove the (enacted) deletes.
|
|
let deletes: Vec<H256> = rlp.val_at(2);
|
|
if trace {
|
|
trace!(target: "jdb.ops", " Expunging: {:?}", deletes);
|
|
}
|
|
Self::remove_keys(&deletes, &mut refs, &batch, RemoveFrom::Archive, trace);
|
|
|
|
if 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, 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);
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
// Collect keys to be removed. Non-canon block - remove the (reverted) inserts.
|
|
if trace {
|
|
trace!(target: "jdb.ops", " Reverting: {:?}", inserts);
|
|
}
|
|
Self::remove_keys(&inserts, &mut refs, &batch, RemoveFrom::Queue, trace);
|
|
}
|
|
|
|
try!(batch.delete(&last));
|
|
index += 1;
|
|
}
|
|
if trace {
|
|
trace!(target: "jdb", "EarlyMergeDB: delete journal for time #{}.{}, (canon was {})", end_era, index, canon_id);
|
|
}
|
|
}
|
|
|
|
try!(self.backing.write(batch));
|
|
|
|
// Comment out for now. TODO: automatically enable in tests.
|
|
|
|
if trace {
|
|
trace!(target: "jdb", "OK: {:?}", refs.clone());
|
|
}
|
|
|
|
Ok(0)
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
#![cfg_attr(feature="dev", allow(blacklisted_name))]
|
|
#![cfg_attr(feature="dev", allow(similar_names))]
|
|
|
|
use common::*;
|
|
use super::*;
|
|
use super::super::traits::JournalDB;
|
|
use hashdb::*;
|
|
use log::init_log;
|
|
use kvdb::DatabaseConfig;
|
|
|
|
#[test]
|
|
fn insert_same_in_fork() {
|
|
// history is 1
|
|
let mut jdb = EarlyMergeDB::new_temp();
|
|
|
|
let x = jdb.insert(b"X");
|
|
jdb.commit(1, &b"1".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(2, &b"2".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(3, &b"1002a".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(4, &b"1003a".sha3(), Some((2, b"2".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&x);
|
|
jdb.commit(3, &b"1002b".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
let x = jdb.insert(b"X");
|
|
jdb.commit(4, &b"1003b".sha3(), Some((2, b"2".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.commit(5, &b"1004a".sha3(), Some((3, b"1002a".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(6, &b"1005a".sha3(), Some((4, b"1003a".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
assert!(jdb.contains(&x));
|
|
}
|
|
|
|
#[test]
|
|
fn insert_older_era() {
|
|
let mut jdb = EarlyMergeDB::new_temp();
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.commit(0, &b"0a".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
let bar = jdb.insert(b"bar");
|
|
jdb.commit(1, &b"1".sha3(), Some((0, b"0a".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&bar);
|
|
jdb.commit(0, &b"0b".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
|
|
assert!(jdb.contains(&foo));
|
|
assert!(jdb.contains(&bar));
|
|
}
|
|
|
|
#[test]
|
|
fn long_history() {
|
|
// history is 3
|
|
let mut jdb = EarlyMergeDB::new_temp();
|
|
let h = jdb.insert(b"foo");
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&h));
|
|
jdb.remove(&h);
|
|
jdb.commit(1, &b"1".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&h));
|
|
jdb.commit(2, &b"2".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&h));
|
|
jdb.commit(3, &b"3".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&h));
|
|
jdb.commit(4, &b"4".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(!jdb.contains(&h));
|
|
}
|
|
|
|
#[test]
|
|
fn complex() {
|
|
// history is 1
|
|
let mut jdb = EarlyMergeDB::new_temp();
|
|
|
|
let foo = jdb.insert(b"foo");
|
|
let bar = jdb.insert(b"bar");
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
assert!(jdb.contains(&bar));
|
|
|
|
jdb.remove(&foo);
|
|
jdb.remove(&bar);
|
|
let baz = jdb.insert(b"baz");
|
|
jdb.commit(1, &b"1".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
assert!(jdb.contains(&bar));
|
|
assert!(jdb.contains(&baz));
|
|
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.remove(&baz);
|
|
jdb.commit(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
assert!(!jdb.contains(&bar));
|
|
assert!(jdb.contains(&baz));
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(3, &b"3".sha3(), Some((2, b"2".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
assert!(!jdb.contains(&bar));
|
|
assert!(!jdb.contains(&baz));
|
|
|
|
jdb.commit(4, &b"4".sha3(), Some((3, b"3".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(!jdb.contains(&foo));
|
|
assert!(!jdb.contains(&bar));
|
|
assert!(!jdb.contains(&baz));
|
|
}
|
|
|
|
#[test]
|
|
fn fork() {
|
|
// history is 1
|
|
let mut jdb = EarlyMergeDB::new_temp();
|
|
|
|
let foo = jdb.insert(b"foo");
|
|
let bar = jdb.insert(b"bar");
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
assert!(jdb.contains(&bar));
|
|
|
|
jdb.remove(&foo);
|
|
let baz = jdb.insert(b"baz");
|
|
jdb.commit(1, &b"1a".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&bar);
|
|
jdb.commit(1, &b"1b".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
assert!(jdb.contains(&foo));
|
|
assert!(jdb.contains(&bar));
|
|
assert!(jdb.contains(&baz));
|
|
|
|
jdb.commit(2, &b"2b".sha3(), Some((1, b"1b".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
assert!(!jdb.contains(&baz));
|
|
assert!(!jdb.contains(&bar));
|
|
}
|
|
|
|
#[test]
|
|
fn overwrite() {
|
|
// history is 1
|
|
let mut jdb = EarlyMergeDB::new_temp();
|
|
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(1, &b"1".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.insert(b"foo");
|
|
assert!(jdb.contains(&foo));
|
|
jdb.commit(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
jdb.commit(3, &b"2".sha3(), Some((0, b"2".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
}
|
|
|
|
#[test]
|
|
fn fork_same_key_one() {
|
|
let mut dir = ::std::env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.commit(1, &b"1a".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(1, &b"1b".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(1, &b"1c".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
assert!(jdb.contains(&foo));
|
|
|
|
jdb.commit(2, &b"2a".sha3(), Some((1, b"1a".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
}
|
|
|
|
#[test]
|
|
fn fork_same_key_other() {
|
|
let mut dir = ::std::env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.commit(1, &b"1a".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(1, &b"1b".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(1, &b"1c".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
assert!(jdb.contains(&foo));
|
|
|
|
jdb.commit(2, &b"2b".sha3(), Some((1, b"1b".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
}
|
|
|
|
#[test]
|
|
fn fork_ins_del_ins() {
|
|
let mut dir = ::std::env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.commit(1, &b"1".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(2, &b"2a".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(2, &b"2b".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(3, &b"3a".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(3, &b"3b".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.commit(4, &b"4a".sha3(), Some((2, b"2a".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.commit(5, &b"5a".sha3(), Some((3, b"3a".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
}
|
|
|
|
#[test]
|
|
fn reopen() {
|
|
let mut dir = ::std::env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
let bar = H256::random();
|
|
|
|
let foo = {
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
// history is 1
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.emplace(bar.clone(), b"bar".to_vec());
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
foo
|
|
};
|
|
|
|
{
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
jdb.remove(&foo);
|
|
jdb.commit(1, &b"1".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
}
|
|
|
|
{
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
assert!(jdb.contains(&foo));
|
|
assert!(jdb.contains(&bar));
|
|
jdb.commit(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(!jdb.contains(&foo));
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn insert_delete_insert_delete_insert_expunge() {
|
|
init_log();
|
|
let mut dir = ::std::env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
|
|
// history is 4
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.remove(&foo);
|
|
jdb.commit(1, &b"1".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.insert(b"foo");
|
|
jdb.commit(2, &b"2".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.remove(&foo);
|
|
jdb.commit(3, &b"3".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.insert(b"foo");
|
|
jdb.commit(4, &b"4".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
// expunge foo
|
|
jdb.commit(5, &b"5".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
}
|
|
|
|
#[test]
|
|
fn forked_insert_delete_insert_delete_insert_expunge() {
|
|
init_log();
|
|
let mut dir = ::std::env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
|
|
// history is 4
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(1, &b"1a".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(1, &b"1b".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(2, &b"2a".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(2, &b"2b".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(3, &b"3a".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(3, &b"3b".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(4, &b"4a".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(4, &b"4b".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
// expunge foo
|
|
jdb.commit(5, &b"5".sha3(), Some((1, b"1a".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
}
|
|
|
|
#[test]
|
|
fn broken_assert() {
|
|
let mut dir = ::std::env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
// history is 1
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.commit(1, &b"1".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
// foo is ancient history.
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(2, &b"2".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(3, &b"3".sha3(), Some((2, b"2".sha3()))).unwrap(); // BROKEN
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(4, &b"4".sha3(), Some((3, b"3".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.commit(5, &b"5".sha3(), Some((4, b"4".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(!jdb.contains(&foo));
|
|
}
|
|
|
|
#[test]
|
|
fn reopen_test() {
|
|
let mut dir = ::std::env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
// history is 4
|
|
let foo = jdb.insert(b"foo");
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(1, &b"1".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(2, &b"2".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(3, &b"3".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(4, &b"4".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
// foo is ancient history.
|
|
|
|
jdb.insert(b"foo");
|
|
let bar = jdb.insert(b"bar");
|
|
jdb.commit(5, &b"5".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.remove(&foo);
|
|
jdb.remove(&bar);
|
|
jdb.commit(6, &b"6".sha3(), Some((2, b"2".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.insert(b"foo");
|
|
jdb.insert(b"bar");
|
|
jdb.commit(7, &b"7".sha3(), Some((3, b"3".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
}
|
|
|
|
#[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 = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
// history is 1
|
|
jdb.insert(b"foo");
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.commit(1, &b"1".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
// foo is ancient history.
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(2, &b"2".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
|
|
jdb.insert(b"foo");
|
|
jdb.commit(3, &b"3".sha3(), Some((1, b"1".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
|
|
// incantation to reopen the db
|
|
}; { let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
|
|
jdb.remove(&foo);
|
|
jdb.commit(4, &b"4".sha3(), Some((2, b"2".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
|
|
// incantation to reopen the db
|
|
}; { let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
|
|
jdb.commit(5, &b"5".sha3(), Some((3, b"3".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
|
|
// incantation to reopen the db
|
|
}; { let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
|
|
jdb.commit(6, &b"6".sha3(), Some((4, b"4".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(!jdb.contains(&foo));
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn reopen_fork() {
|
|
let mut dir = ::std::env::temp_dir();
|
|
dir.push(H32::random().hex());
|
|
let (foo, bar, baz) = {
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
// history is 1
|
|
let foo = jdb.insert(b"foo");
|
|
let bar = jdb.insert(b"bar");
|
|
jdb.commit(0, &b"0".sha3(), None).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
jdb.remove(&foo);
|
|
let baz = jdb.insert(b"baz");
|
|
jdb.commit(1, &b"1a".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
|
|
jdb.remove(&bar);
|
|
jdb.commit(1, &b"1b".sha3(), Some((0, b"0".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
(foo, bar, baz)
|
|
};
|
|
|
|
{
|
|
let mut jdb = EarlyMergeDB::new(dir.to_str().unwrap(), DatabaseConfig::default());
|
|
jdb.commit(2, &b"2b".sha3(), Some((1, b"1b".sha3()))).unwrap();
|
|
assert!(jdb.can_reconstruct_refs());
|
|
assert!(jdb.contains(&foo));
|
|
assert!(!jdb.contains(&baz));
|
|
assert!(!jdb.contains(&bar));
|
|
}
|
|
}
|
|
}
|