//! Storage functionality for Lighthouse. //! //! Provides the following stores: //! //! - `DiskStore`: an on-disk store backed by leveldb. Used in production. //! - `MemoryStore`: an in-memory store backed by a hash-map. Used for testing. //! //! Provides a simple API for storing/retrieving all types that sometimes needs type-hints. See //! tests for implementation examples. mod block_at_slot; mod errors; mod impls; mod leveldb_store; mod memory_store; pub mod iter; pub use self::leveldb_store::LevelDB as DiskStore; pub use self::memory_store::MemoryStore; pub use errors::Error; pub use types::*; /// An object capable of storing and retrieving objects implementing `StoreItem`. /// /// A `Store` is fundamentally backed by a key-value database, however it provides support for /// columns. A simple column implementation might involve prefixing a key with some bytes unique to /// each column. pub trait Store: Sync + Send + Sized { /// Store an item in `Self`. fn put(&self, key: &Hash256, item: &impl StoreItem) -> Result<(), Error> { item.db_put(self, key) } /// Retrieve an item from `Self`. fn get(&self, key: &Hash256) -> Result, Error> { I::db_get(self, key) } /// Returns `true` if the given key represents an item in `Self`. fn exists(&self, key: &Hash256) -> Result { I::db_exists(self, key) } /// Remove an item from `Self`. fn delete(&self, key: &Hash256) -> Result<(), Error> { I::db_delete(self, key) } /// Given the root of an existing block in the store (`start_block_root`), return a parent /// block with the specified `slot`. /// /// Returns `None` if no parent block exists at that slot, or if `slot` is greater than the /// slot of `start_block_root`. fn get_block_at_preceeding_slot( &self, start_block_root: Hash256, slot: Slot, ) -> Result)>, Error> { block_at_slot::get_block_at_preceeding_slot::<_, E>(self, slot, start_block_root) } /// Retrieve some bytes in `column` with `key`. fn get_bytes(&self, column: &str, key: &[u8]) -> Result>, Error>; /// Store some `value` in `column`, indexed with `key`. fn put_bytes(&self, column: &str, key: &[u8], value: &[u8]) -> Result<(), Error>; /// Return `true` if `key` exists in `column`. fn key_exists(&self, column: &str, key: &[u8]) -> Result; /// Removes `key` from `column`. fn key_delete(&self, column: &str, key: &[u8]) -> Result<(), Error>; } /// A unique column identifier. pub enum DBColumn { BeaconBlock, BeaconState, BeaconChain, } impl<'a> Into<&'a str> for DBColumn { /// Returns a `&str` that can be used for keying a key-value data base. fn into(self) -> &'a str { match self { DBColumn::BeaconBlock => &"blk", DBColumn::BeaconState => &"ste", DBColumn::BeaconChain => &"bch", } } } /// An item that may be stored in a `Store`. /// /// Provides default methods that are suitable for most applications, however when overridden they /// provide full customizability of `Store` operations. pub trait StoreItem: Sized { /// Identifies which column this item should be placed in. fn db_column() -> DBColumn; /// Serialize `self` as bytes. fn as_store_bytes(&self) -> Vec; /// De-serialize `self` from bytes. fn from_store_bytes(bytes: &mut [u8]) -> Result; /// Store `self`. fn db_put(&self, store: &impl Store, key: &Hash256) -> Result<(), Error> { let column = Self::db_column().into(); let key = key.as_bytes(); store .put_bytes(column, key, &self.as_store_bytes()) .map_err(Into::into) } /// Retrieve an instance of `Self`. fn db_get(store: &impl Store, key: &Hash256) -> Result, Error> { let column = Self::db_column().into(); let key = key.as_bytes(); match store.get_bytes(column, key)? { Some(mut bytes) => Ok(Some(Self::from_store_bytes(&mut bytes[..])?)), None => Ok(None), } } /// Return `true` if an instance of `Self` exists in `Store`. fn db_exists(store: &impl Store, key: &Hash256) -> Result { let column = Self::db_column().into(); let key = key.as_bytes(); store.key_exists(column, key) } /// Delete `self` from the `Store`. fn db_delete(store: &impl Store, key: &Hash256) -> Result<(), Error> { let column = Self::db_column().into(); let key = key.as_bytes(); store.key_delete(column, key) } } #[cfg(test)] mod tests { use super::*; use ssz::{Decode, Encode}; use ssz_derive::{Decode, Encode}; use tempfile::tempdir; #[derive(PartialEq, Debug, Encode, Decode)] struct StorableThing { a: u64, b: u64, } impl StoreItem for StorableThing { fn db_column() -> DBColumn { DBColumn::BeaconBlock } fn as_store_bytes(&self) -> Vec { self.as_ssz_bytes() } fn from_store_bytes(bytes: &mut [u8]) -> Result { Self::from_ssz_bytes(bytes).map_err(Into::into) } } fn test_impl(store: impl Store) { let key = Hash256::random(); let item = StorableThing { a: 1, b: 42 }; assert_eq!(store.exists::(&key), Ok(false)); store.put(&key, &item).unwrap(); assert_eq!(store.exists::(&key), Ok(true)); let retrieved = store.get(&key).unwrap().unwrap(); assert_eq!(item, retrieved); store.delete::(&key).unwrap(); assert_eq!(store.exists::(&key), Ok(false)); assert_eq!(store.get::(&key), Ok(None)); } #[test] fn diskdb() { let dir = tempdir().unwrap(); let path = dir.path(); let store = DiskStore::open(&path).unwrap(); test_impl(store); } #[test] fn memorydb() { let store = MemoryStore::open(); test_impl(store); } #[test] fn exists() { let store = MemoryStore::open(); let key = Hash256::random(); let item = StorableThing { a: 1, b: 42 }; assert_eq!(store.exists::(&key).unwrap(), false); store.put(&key, &item).unwrap(); assert_eq!(store.exists::(&key).unwrap(), true); store.delete::(&key).unwrap(); assert_eq!(store.exists::(&key).unwrap(), false); } }