1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265
// MIT License
//
// Copyright (c) 2022-2024 Robin Doer
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
// IN THE SOFTWARE.
//! A sample [`nuts_backend::Backend`] implementation which stores the data in
//! memory.
//!
//! **This implementation is mainly used for demonstration, testing and
//! documentation.**
//!
//! It stores the content of the data blocks in a [hash](HashMap) indexed by
//! the [`Id`](nuts_backend::Backend::Id) of this backend, where the
//! [id](nuts_backend::Backend::Id) is a simple `u32` value.
use nuts_backend::{Backend, BlockId, Create, HeaderGet, HeaderSet, Open, HEADER_MAX_SIZE};
use nuts_bytes::{FromBytes, ToBytes};
use std::borrow::Cow;
use std::collections::HashMap;
use std::num::ParseIntError;
use std::str::FromStr;
use std::{cmp, fmt, mem};
use thiserror::Error;
/// Error used by the memory backend.
#[derive(Debug, Error)]
pub enum Error {
/// Tried to read or write from/to an id, which does not exist.
#[error("no such id: {0}")]
NoSuchId(Id),
/// Failed to aquire the given id.
#[error("already aquired: {0}")]
AlreadAquired(Id),
/// Tried to open the backend without header data
#[error("no header data available")]
NoHeader,
/// Failed to serialize binary data.
#[error(transparent)]
Bytes(#[from] nuts_bytes::Error),
}
/// The [id](nuts_backend::Backend::Id) of the memory backend.
#[derive(Clone, Copy, Debug, FromBytes, PartialEq, ToBytes)]
pub struct Id(u32);
impl fmt::Display for Id {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
fmt::Display::fmt(&self.0, fmt)
}
}
impl Id {
fn null() -> Id {
Id(u32::MAX)
}
}
impl FromStr for Id {
type Err = ParseIntError;
fn from_str(s: &str) -> Result<Self, ParseIntError> {
FromStr::from_str(s).map(|n| Id(n))
}
}
impl BlockId for Id {
fn null() -> Id {
Id::null()
}
fn is_null(&self) -> bool {
self.eq(&Id::null())
}
fn size() -> usize {
mem::size_of::<u32>()
}
}
/// The [`Backend`] implementation itself.
///
/// See the [module](crate) documentation for details.
#[derive(Debug, PartialEq)]
pub struct MemoryBackend {
bsize: u32,
blocks: HashMap<u32, Vec<u8>>,
header: Option<[u8; HEADER_MAX_SIZE]>,
}
impl MemoryBackend {
/// Creates a new instance of the `MemoryBackend` type.
///
/// The block-size is set to 512 bytes.
pub fn new() -> MemoryBackend {
Self::new_with_bsize(512)
}
/// Creates a new instance of the `MemoryBackend` type with the given
/// block-size.
pub fn new_with_bsize(bsize: u32) -> MemoryBackend {
MemoryBackend {
bsize,
blocks: HashMap::new(),
header: None,
}
}
/// Returns the block size specified for this backend instance.
pub fn block_size(&self) -> u32 {
self.bsize
}
/// Receives the content of the block with the given `id`.
///
/// Returns [`None`] if the block does not exist.
pub fn get(&self, id: &Id) -> Option<&[u8]> {
self.blocks.get(&id.0).map(|buf| buf.as_slice())
}
/// Inserts a new block.
///
/// The block contains only zeros.
///
/// Returns the id of the new block.
pub fn insert(&mut self) -> Result<Id, Error> {
self.insert_data(&[])
}
/// Inserts a new block with some initial data.
///
/// Assigns the first [`block-size`](Self::block_size) bytes from `data` to
/// the new block. If `data` does not have [`block-size`](Self::block_size)
/// bytes, the new block is padded with zero bytes.
///
/// Returns the id of the new block.
pub fn insert_data(&mut self, data: &[u8]) -> Result<Id, Error> {
let id = Id(self.max_id() + 1);
let mut block = vec![0; self.bsize as usize];
let n = cmp::min(block.len(), data.len());
block[..n].copy_from_slice(&data[..n]);
match self.blocks.insert(id.0, block) {
Some(_) => Err(Error::AlreadAquired(id)),
None => Ok(id),
}
}
fn max_id(&self) -> u32 {
*self.blocks.keys().max().unwrap_or(&0)
}
}
impl HeaderGet<Self> for MemoryBackend {
fn get_header_bytes(&mut self, bytes: &mut [u8; HEADER_MAX_SIZE]) -> Result<(), Error> {
match self.header.as_ref() {
Some(source) => Ok(bytes.copy_from_slice(source)),
None => Err(Error::NoHeader),
}
}
}
impl HeaderSet<Self> for MemoryBackend {
fn put_header_bytes(&mut self, bytes: &[u8; HEADER_MAX_SIZE]) -> Result<(), Error> {
self.header = Some(*bytes);
Ok(())
}
}
impl Create<Self> for MemoryBackend {
fn settings(&self) -> () {
()
}
fn build(self) -> Result<MemoryBackend, Error> {
Ok(self)
}
}
impl Open<Self> for MemoryBackend {
fn build(self, _settings: ()) -> Result<MemoryBackend, Error> {
Ok(self)
}
}
impl Backend for MemoryBackend {
type CreateOptions = Self;
type OpenOptions = Self;
type Settings = ();
type Err = Error;
type Id = Id;
type Info = ();
fn info(&self) -> Result<(), Error> {
Ok(())
}
fn block_size(&self) -> u32 {
self.bsize
}
fn aquire(&mut self, buf: &[u8]) -> Result<Id, Error> {
self.insert_data(buf)
}
fn release(&mut self, id: Id) -> Result<(), Error> {
self.blocks.remove(&id.0);
Ok(())
}
fn read(&mut self, id: &Id, buf: &mut [u8]) -> Result<usize, Error> {
match self.blocks.get(&id.0) {
Some(src) => {
let len = cmp::min(src.len(), buf.len());
let source = &src[..len];
let target = &mut buf[..len];
target.copy_from_slice(source);
Ok(len)
}
None => Err(Error::NoSuchId(*id)),
}
}
fn write(&mut self, id: &Id, buf: &[u8]) -> Result<usize, Error> {
match self.blocks.get_mut(&id.0) {
Some(target) => {
let mut source = Cow::from(buf);
let mut len = source.len();
if len != self.bsize as usize {
len = cmp::min(source.len(), self.bsize as usize);
source.to_mut().resize(self.bsize as usize, 0);
}
target.copy_from_slice(&source);
Ok(len)
}
None => Err(Error::NoSuchId(*id)),
}
}
}