lkv 0.2.0

A lightweight and fast embedded key-value store for Rust.
Documentation
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
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
use super::state::BaseBytes;
use crate::error::{Error, Result};
use crate::format::{segment, superblock::DATA_START};
use std::fs::File;
use std::io::{self, ErrorKind, Read, Seek, SeekFrom, Write};
use std::sync::Arc;

/// Represents the storage backend for the database
pub enum Storage {
    File(File),
    Memory(MemoryStorage),
}

impl Storage {
    pub fn memory() -> Self {
        Self::Memory(MemoryStorage::default())
    }

    #[cfg(test)]
    pub fn file(&self) -> Option<&File> {
        match self {
            Self::File(file) => Some(file),
            Self::Memory(_) => None,
        }
    }

    pub fn len(&self) -> Result<u64> {
        match self {
            Self::File(file) => Ok(file.metadata()?.len()),
            Self::Memory(memory) => Ok(memory.len),
        }
    }

    pub fn set_len(&mut self, len: u64) -> Result<()> {
        match self {
            Self::File(file) => Ok(file.set_len(len)?),
            Self::Memory(memory) => memory.set_len(len),
        }
    }

    pub fn sync_data(&self) -> Result<()> {
        match self {
            Self::File(file) => Ok(file.sync_data()?),
            Self::Memory(_) => Ok(()),
        }
    }

    pub fn sync_all(&self) -> Result<()> {
        match self {
            Self::File(file) => Ok(file.sync_all()?),
            Self::Memory(_) => Ok(()),
        }
    }

    pub fn load_immutable(&mut self, offset: u64, size: u64) -> Result<BaseBytes> {
        match self {
            Self::File(file) => Ok(BaseBytes::Mapped(segment::map(file, offset, size)?)),
            Self::Memory(memory) => memory.load_immutable(offset, size),
        }
    }

    pub fn replace_memory_base(&mut self, offset: u64, bytes: Arc<Vec<u8>>) -> Result<()> {
        match self {
            Self::Memory(memory) => memory.replace_base(offset, bytes),
            Self::File(_) => Err(Error::from_io(
                ErrorKind::InvalidInput,
                "cannot install an in-memory Base into file storage",
            )),
        }
    }

    pub fn extend_memory_log(&mut self, additional: u64) -> Result<()> {
        match self {
            Self::Memory(memory) => memory.extend_log(additional),
            Self::File(_) => Err(Error::from_io(
                ErrorKind::InvalidInput,
                "cannot extend an in-memory log in file storage",
            )),
        }
    }

    #[cfg(test)]
    pub fn memory_base_mapping(&self) -> Option<&Arc<Vec<u8>>> {
        match self {
            Self::Memory(memory) => memory.base.as_ref().map(|base| &base.bytes),
            Self::File(_) => None,
        }
    }

    #[cfg(test)]
    pub fn memory_materialized_bytes(&self) -> Option<usize> {
        match self {
            Self::Memory(memory) => Some(
                memory.header.len()
                    + memory.base.as_ref().map_or(0, |base| base.bytes.len())
                    + memory.tail.len(),
            ),
            Self::File(_) => None,
        }
    }

    pub fn is_memory(&self) -> bool {
        matches!(self, Self::Memory(_))
    }
}

impl Read for Storage {
    fn read(&mut self, buffer: &mut [u8]) -> io::Result<usize> {
        match self {
            Self::File(file) => file.read(buffer),
            Self::Memory(memory) => memory.read(buffer),
        }
    }
}

impl Write for Storage {
    fn write(&mut self, bytes: &[u8]) -> io::Result<usize> {
        match self {
            Self::File(file) => file.write(bytes),
            Self::Memory(memory) => memory.write(bytes),
        }
    }

    fn flush(&mut self) -> io::Result<()> {
        match self {
            Self::File(file) => file.flush(),
            Self::Memory(memory) => memory.flush(),
        }
    }
}

impl Seek for Storage {
    fn seek(&mut self, position: SeekFrom) -> io::Result<u64> {
        match self {
            Self::File(file) => file.seek(position),
            Self::Memory(memory) => memory.seek(position),
        }
    }
}

pub struct MemoryStorage {
    // The active Base is shared with readers. Obsolete generations and the
    // non-durable Overlay log consume logical offsets but no backing bytes.
    header: Vec<u8>,
    base: Option<MemoryRegion>,
    tail_start: u64,
    tail: Vec<u8>,
    len: u64,
    position: u64,
}

struct MemoryRegion {
    offset: u64,
    bytes: Arc<Vec<u8>>,
}

impl Default for MemoryStorage {
    fn default() -> Self {
        Self {
            header: Vec::new(),
            base: None,
            tail_start: DATA_START,
            tail: Vec::new(),
            len: 0,
            position: 0,
        }
    }
}

impl MemoryStorage {
    fn set_len(&mut self, len: u64) -> Result<()> {
        if self.base.is_some() {
            if len < self.tail_start {
                return Err(Error::from_io(
                    ErrorKind::InvalidInput,
                    "cannot truncate the active in-memory Base",
                ));
            }
            let tail_len = usize::try_from(len - self.tail_start).map_err(|_| {
                Error::from_io(
                    ErrorKind::InvalidInput,
                    "memory storage length is too large",
                )
            })?;
            resize_bytes(&mut self.tail, tail_len)?;
            self.len = len;
            return Ok(());
        }

        if len <= DATA_START {
            resize_bytes(&mut self.header, len as usize)?;
            self.tail.clear();
            self.tail_start = DATA_START;
        } else {
            resize_bytes(&mut self.header, DATA_START as usize)?;
            self.tail_start = DATA_START;
            let tail_len = usize::try_from(len - DATA_START).map_err(|_| {
                Error::from_io(
                    ErrorKind::InvalidInput,
                    "memory storage length is too large",
                )
            })?;
            resize_bytes(&mut self.tail, tail_len)?;
        }
        self.len = len;
        Ok(())
    }

    fn load_immutable(&mut self, offset: u64, size: u64) -> Result<BaseBytes> {
        if size == 0 {
            return Err(Error::from_io(
                ErrorKind::InvalidData,
                "cannot load an empty segment",
            ));
        }
        let end = offset
            .checked_add(size)
            .filter(|end| *end <= self.len)
            .ok_or_else(|| Error::invalid_base("segment extends beyond memory storage"))?;

        if let Some(base) = &self.base {
            let base_end = base.offset + base.bytes.len() as u64;
            if offset >= base.offset && end <= base_end {
                return Ok(BaseBytes::Memory {
                    bytes: Arc::clone(&base.bytes),
                    range: (offset - base.offset) as usize..(end - base.offset) as usize,
                });
            }
        }

        if self.base.is_none() && offset == self.tail_start && end == self.len {
            let bytes = Arc::new(std::mem::take(&mut self.tail));
            self.base = Some(MemoryRegion {
                offset,
                bytes: Arc::clone(&bytes),
            });
            self.tail_start = end;
            return Ok(BaseBytes::Memory {
                range: 0..bytes.len(),
                bytes,
            });
        }

        let len = usize::try_from(size).map_err(|_| Error::invalid_base("segment is too large"))?;
        let mut bytes = Vec::new();
        bytes.try_reserve_exact(len).map_err(|_| {
            Error::from_io(ErrorKind::OutOfMemory, "could not allocate immutable bytes")
        })?;
        bytes.resize(len, 0);
        let previous = self.position;
        self.position = offset;
        let result = self.read_exact(&mut bytes);
        self.position = previous;
        result?;
        let bytes = Arc::new(bytes);
        Ok(BaseBytes::Memory {
            range: 0..bytes.len(),
            bytes,
        })
    }

    fn replace_base(&mut self, offset: u64, bytes: Arc<Vec<u8>>) -> Result<()> {
        if offset < DATA_START || bytes.is_empty() {
            return Err(Error::from_io(
                ErrorKind::InvalidInput,
                "invalid in-memory Base range",
            ));
        }
        let end = offset
            .checked_add(bytes.len() as u64)
            .ok_or_else(|| Error::invalid_base("in-memory Base range overflows"))?;
        resize_bytes(&mut self.header, DATA_START as usize)?;
        self.base = Some(MemoryRegion { offset, bytes });
        self.tail_start = end;
        self.tail.clear();
        self.len = end;
        self.position = end;
        Ok(())
    }

    fn extend_log(&mut self, additional: u64) -> Result<()> {
        self.len = self
            .len
            .checked_add(additional)
            .ok_or_else(|| Error::from_io(ErrorKind::InvalidInput, "memory log size overflow"))?;
        self.position = self.len;
        Ok(())
    }
}

fn resize_bytes(bytes: &mut Vec<u8>, len: usize) -> Result<()> {
    if len > bytes.len() {
        bytes
            .try_reserve_exact(len - bytes.len())
            .map_err(|_| Error::from_io(ErrorKind::OutOfMemory, "could not grow memory storage"))?;
    }
    bytes.resize(len, 0);
    Ok(())
}

impl Read for MemoryStorage {
    fn read(&mut self, buffer: &mut [u8]) -> io::Result<usize> {
        if buffer.is_empty() || self.position >= self.len {
            return Ok(0);
        }
        let available = ((self.len - self.position).min(buffer.len() as u64)) as usize;
        let mut written = 0usize;
        while written < available {
            let position = self.position;
            if position < self.header.len() as u64 {
                let start = position as usize;
                let len = (self.header.len() - start).min(available - written);
                buffer[written..written + len].copy_from_slice(&self.header[start..start + len]);
                self.position += len as u64;
                written += len;
                continue;
            }
            if let Some(base) = &self.base {
                let base_end = base.offset + base.bytes.len() as u64;
                if position >= base.offset && position < base_end {
                    let start = (position - base.offset) as usize;
                    let len = (base.bytes.len() - start).min(available - written);
                    buffer[written..written + len].copy_from_slice(&base.bytes[start..start + len]);
                    self.position += len as u64;
                    written += len;
                    continue;
                }
            }
            let tail_end = self.tail_start + self.tail.len() as u64;
            if position >= self.tail_start && position < tail_end {
                let start = usize::try_from(position - self.tail_start).map_err(|_| {
                    io::Error::new(ErrorKind::InvalidInput, "read position is too large")
                })?;
                let len = (self.tail.len() - start).min(available - written);
                buffer[written..written + len].copy_from_slice(&self.tail[start..start + len]);
                self.position += len as u64;
                written += len;
                continue;
            }

            let mut next = self.len;
            if let Some(base) = &self.base
                && base.offset > position
            {
                next = next.min(base.offset);
            }
            if self.tail_start > position {
                next = next.min(self.tail_start);
            }
            let len = ((next - position).min((available - written) as u64)) as usize;
            buffer[written..written + len].fill(0);
            self.position += len as u64;
            written += len;
        }
        Ok(written)
    }
}

impl Write for MemoryStorage {
    fn write(&mut self, bytes: &[u8]) -> io::Result<usize> {
        if bytes.is_empty() {
            return Ok(0);
        }
        let start = self.position;
        let end = start
            .checked_add(bytes.len() as u64)
            .ok_or_else(|| io::Error::new(ErrorKind::InvalidInput, "write range overflow"))?;
        if end <= DATA_START {
            let start = start as usize;
            let end = end as usize;
            resize_bytes(&mut self.header, end)
                .map_err(|error| io::Error::new(error.kind(), error))?;
            self.header[start..end].copy_from_slice(bytes);
        } else if start >= self.tail_start {
            let start = usize::try_from(start - self.tail_start).map_err(|_| {
                io::Error::new(ErrorKind::InvalidInput, "write offset is too large")
            })?;
            let end = start
                .checked_add(bytes.len())
                .ok_or_else(|| io::Error::new(ErrorKind::InvalidInput, "write range overflow"))?;
            resize_bytes(&mut self.tail, end)
                .map_err(|error| io::Error::new(error.kind(), error))?;
            self.tail[start..end].copy_from_slice(bytes);
        } else {
            return Err(io::Error::new(
                ErrorKind::InvalidInput,
                "cannot overwrite an immutable in-memory Base",
            ));
        }
        self.position = end;
        self.len = self.len.max(end);
        Ok(bytes.len())
    }

    fn flush(&mut self) -> io::Result<()> {
        Ok(())
    }
}

impl Seek for MemoryStorage {
    fn seek(&mut self, position: SeekFrom) -> io::Result<u64> {
        let base = match position {
            SeekFrom::Start(position) => {
                self.position = position;
                return Ok(position);
            }
            SeekFrom::End(offset) => (self.len, offset),
            SeekFrom::Current(offset) => (self.position, offset),
        };
        let position = i128::from(base.0) + i128::from(base.1);
        if !(0..=i128::from(u64::MAX)).contains(&position) {
            return Err(io::Error::new(
                ErrorKind::InvalidInput,
                "invalid seek position",
            ));
        }
        self.position = position as u64;
        Ok(self.position)
    }
}