cassadilia 0.4.7

A content-addressable storage (CAS) system optimized for large blobs with read-mostly access patterns
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
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
use std::collections::BTreeMap;
use std::num::NonZeroU64;

use thiserror::Error;

use crate::index::IndexStateItem;
use crate::types::{BlobHash, HASH_SIZE, KeyBytes, WalOpRaw};

#[derive(Error, Debug)]
pub enum SerializationError {
    #[error("unexpected end of data while parsing {parsing_context}")]
    UnexpectedEof { parsing_context: &'static str },

    #[error(
        "insufficient data for {entity}: expected {expected} bytes, found {found} while parsing {parsing_context}"
    )]
    InsufficientData {
        entity: &'static str,
        expected: usize,
        found: usize,
        parsing_context: &'static str,
    },

    #[error("invalid variant tag {tag} for {enum_name} while parsing {parsing_context}")]
    InvalidVariantTag { tag: u8, enum_name: &'static str, parsing_context: &'static str },
}

#[inline]
fn take_bytes<'a>(
    bytes: &mut &'a [u8],
    len: usize,
    entity: &'static str,
    parsing_context: &'static str,
) -> Result<&'a [u8], SerializationError> {
    let (head, rest) = bytes.split_at_checked(len).ok_or(SerializationError::InsufficientData {
        entity,
        expected: len,
        found: bytes.len(),
        parsing_context,
    })?;
    *bytes = rest;
    Ok(head)
}

/// serialize `BTreeMap`<Vec<u8>, `IndexStateItem`> using hand-rolled format
/// format: [u64 `last_persisted_version`][u32 `num_entries`][[u32
/// `key_len`][key_bytes][`32_bytes_hash`][u64 `blob_size`]]...
pub(crate) fn serialize_index_state<K: KeyBytes>(
    map: &BTreeMap<K, IndexStateItem>,
    last_persisted_version: Option<NonZeroU64>,
) -> Vec<u8> {
    let mut result = Vec::new();

    // write last_persisted_version (0 means no checkpoint)
    let version = last_persisted_version.map_or(0, |v| v.get());
    result.extend_from_slice(&version.to_le_bytes());

    // write number of entries
    let num_entries = map.len() as u32;
    result.extend_from_slice(&num_entries.to_le_bytes());

    // write each entry
    for (key, item) in map {
        let key_bytes = key.to_key_bytes();
        let key_bytes = key_bytes.as_ref();

        // write key length
        let key_len = key_bytes.len() as u32;
        result.extend_from_slice(&key_len.to_le_bytes());

        // write key bytes
        result.extend_from_slice(key_bytes);

        // write hash (always 32 bytes)
        result.extend_from_slice(item.blob_hash.as_bytes());

        // write data size (8 bytes, LE)
        result.extend_from_slice(&item.blob_size.to_le_bytes());
    }

    result
}

/// deserialize `BTreeMap`<Vec<u8>, `IndexStateItem`> using hand-rolled format
pub(crate) type DecodedIndexState = (BTreeMap<Vec<u8>, IndexStateItem>, Option<NonZeroU64>);

pub(crate) fn deserialize_index_state(
    bytes: &[u8],
) -> Result<DecodedIndexState, SerializationError> {
    let mut bytes = bytes;

    // read last_persisted_version
    let version_value = read_u64(&mut bytes, "IndexState version")?;
    let last_persisted_version = NonZeroU64::new(version_value);

    // read number of entries
    let num_entries = read_u32(&mut bytes, "BTreeMap header")?;

    let mut map = BTreeMap::new();

    // read each entry
    for _ in 0..num_entries {
        // read key
        let key = read_bytes_with_len(&mut bytes, "BTreeMap key")?;

        // read hash
        let hash = read_fixed_bytes::<HASH_SIZE>(&mut bytes, "BTreeMap hash")?;
        let hash = BlobHash::from_bytes(hash);

        // read size
        let size = read_u64(&mut bytes, "BTreeMap size")?;

        map.insert(key, IndexStateItem { blob_hash: hash, blob_size: size });
    }

    Ok((map, last_persisted_version))
}

/// serialize `WalOpRaw` using hand-rolled format
/// format: [u8 `variant_tag`][variant_data]
///   Put: 0 + [u32 `key_len`][key_bytes][`32_bytes_hash`]
///   Remove: 1 + [`keys_data` bytes...]
pub(crate) fn serialize_wal_op_raw(op: &WalOpRaw) -> Result<Vec<u8>, SerializationError> {
    let mut result = Vec::new();

    match op {
        WalOpRaw::Put { key_bytes, hash, size } => {
            // variant tag
            result.push(0);

            // key length and bytes
            let key_len = key_bytes.len() as u32;
            result.extend_from_slice(&key_len.to_le_bytes());
            result.extend_from_slice(key_bytes);

            // hash
            result.extend_from_slice(hash.as_bytes());

            // size
            result.extend_from_slice(&size.to_le_bytes());
        }
        WalOpRaw::Remove { keys_bytes } => {
            // variant tag
            result.push(1);

            // serialize the keys: [num_keys][len1][key1][len2][key2]...
            let num_keys = keys_bytes.len() as u32;
            result.extend_from_slice(&num_keys.to_le_bytes());

            for key_bytes in keys_bytes {
                let key_len = key_bytes.len() as u32;
                result.extend_from_slice(&key_len.to_le_bytes());
                result.extend_from_slice(key_bytes);
            }
        }
    }

    Ok(result)
}

/// deserialize `WalOpRaw` using hand-rolled format
pub(crate) fn deserialize_wal_op_raw(bytes: &[u8]) -> Result<WalOpRaw, SerializationError> {
    let mut bytes = bytes;

    let variant_tag = read_u8(&mut bytes, "WalOpRaw variant")?;

    match variant_tag {
        0 => {
            // Put variant
            let key_bytes = read_bytes_with_len(&mut bytes, "WalOpRaw Put key")?;
            let hash = read_fixed_bytes::<HASH_SIZE>(&mut bytes, "WalOpRaw Put hash")?;
            let size = read_u64(&mut bytes, "WalOpRaw Put size")?;
            let hash = BlobHash::from_bytes(hash);
            Ok(WalOpRaw::Put { key_bytes, hash, size })
        }
        1 => {
            // Remove variant
            // deserialize the keys: [num_keys][len1][key1][len2][key2]...
            let num_keys = read_u32(&mut bytes, "Remove num_keys")? as usize;

            let mut keys_bytes = Vec::new();
            for _ in 0..num_keys {
                let key_bytes = read_bytes_with_len(&mut bytes, "Remove key")?;
                keys_bytes.push(key_bytes);
            }

            Ok(WalOpRaw::Remove { keys_bytes })
        }
        _ => Err(SerializationError::InvalidVariantTag {
            tag: variant_tag,
            enum_name: "WalOpRaw",
            parsing_context: "WalOpRaw deserialization",
        }),
    }
}

// helper functions for reading from byte slices
#[inline]
fn read_u8(bytes: &mut &[u8], parsing_context: &'static str) -> Result<u8, SerializationError> {
    let (value, rest) =
        bytes.split_first().ok_or(SerializationError::UnexpectedEof { parsing_context })?;
    *bytes = rest;
    Ok(*value)
}

#[inline]
fn read_u32(bytes: &mut &[u8], parsing_context: &'static str) -> Result<u32, SerializationError> {
    let head = take_bytes(bytes, 4, "u32", parsing_context)?;
    let mut array = [0u8; 4];
    array.copy_from_slice(head);
    Ok(u32::from_le_bytes(array))
}

#[inline]
fn read_u64(bytes: &mut &[u8], parsing_context: &'static str) -> Result<u64, SerializationError> {
    let head = take_bytes(bytes, 8, "u64", parsing_context)?;
    let mut array = [0u8; 8];
    array.copy_from_slice(head);
    Ok(u64::from_le_bytes(array))
}

#[inline]
fn read_fixed_bytes<const N: usize>(
    bytes: &mut &[u8],
    parsing_context: &'static str,
) -> Result<[u8; N], SerializationError> {
    let head = take_bytes(bytes, N, "fixed bytes", parsing_context)?;
    let mut array = [0u8; N];
    array.copy_from_slice(head);
    Ok(array)
}

#[inline]
fn read_bytes_with_len(
    bytes: &mut &[u8],
    parsing_context: &'static str,
) -> Result<Vec<u8>, SerializationError> {
    let len = read_u32(bytes, parsing_context)? as usize;
    let data = take_bytes(bytes, len, "variable-length bytes", parsing_context)?;
    Ok(data.to_vec())
}

#[cfg(test)]
mod tests {
    use std::collections::BTreeMap;

    use super::*;
    use crate::types::{BlobHash, HASH_SIZE, WalOpRaw};

    fn make_test_item(byte: u8) -> IndexStateItem {
        let mut bytes = [0u8; HASH_SIZE];
        bytes[0] = byte;
        IndexStateItem { blob_hash: BlobHash::from_bytes(bytes), blob_size: 1 }
    }

    fn deserialize_and_parse_index_state<K>(data: Vec<u8>) -> BTreeMap<K, IndexStateItem>
    where
        K: KeyBytes + Ord,
    {
        let (map, _last_version) = deserialize_index_state(&data).unwrap();
        map.into_iter().map(|(key, value)| (K::from_key_bytes(&key).unwrap(), value)).collect()
    }

    #[test]
    fn test_btreemap_serialization_empty() {
        let map: BTreeMap<[u8; 0], IndexStateItem> = BTreeMap::new();
        let serialized = serialize_index_state(&map, None);
        let deserialized = deserialize_and_parse_index_state(serialized);
        assert_eq!(map, deserialized);
    }

    #[test]
    fn test_btreemap_serialization_single_empty_key() {
        let mut map = BTreeMap::new();
        map.insert([], make_test_item(1));
        let serialized = serialize_index_state(&map, None);
        let deserialized = deserialize_and_parse_index_state(serialized);
        assert_eq!(map, deserialized);
    }

    #[test]
    fn test_btreemap_serialization_multiple_keys() {
        let mut map = BTreeMap::new();
        map.insert(vec![], make_test_item(1)); // empty key
        map.insert(vec![1, 2, 3], make_test_item(2)); // small key
        map.insert(vec![255; 1000], make_test_item(3)); // large key
        map.insert(vec![0], make_test_item(4)); // single byte key

        let serialized = serialize_index_state(&map, None);
        let deserialized = deserialize_and_parse_index_state(serialized);
        assert_eq!(map, deserialized);
    }

    #[test]
    fn test_btreemap_serialization_last_version_none() {
        let mut map: BTreeMap<Vec<u8>, IndexStateItem> = BTreeMap::new();
        map.insert(b"k1".to_vec(), make_test_item(7));
        map.insert(b"k2".to_vec(), make_test_item(8));

        let serialized = serialize_index_state(&map, None);
        let (decoded_map, last_version) = deserialize_index_state(&serialized).unwrap();

        assert_eq!(last_version, None);
        assert_eq!(map, decoded_map);
    }

    #[test]
    fn test_btreemap_serialization_last_version_some() {
        let mut map: BTreeMap<Vec<u8>, IndexStateItem> = BTreeMap::new();
        map.insert(b"k1".to_vec(), make_test_item(21));

        let expected_version = NonZeroU64::new(123_456_789);
        let serialized = serialize_index_state(&map, expected_version);
        let (decoded_map, last_version) = deserialize_index_state(&serialized).unwrap();

        assert_eq!(last_version, expected_version);
        assert_eq!(map, decoded_map);
    }

    #[test]
    fn test_wal_op_put_empty_key() {
        let IndexStateItem { blob_hash, blob_size } = make_test_item(42);
        let op = WalOpRaw::Put { key_bytes: vec![], hash: blob_hash, size: blob_size };
        let serialized = serialize_wal_op_raw(&op).unwrap();
        let deserialized = deserialize_wal_op_raw(&serialized).unwrap();

        match deserialized {
            WalOpRaw::Put { key_bytes, hash, size } => {
                assert_eq!(key_bytes, Vec::<u8>::new());
                assert_eq!(hash, blob_hash);
                assert_eq!(size, blob_size);
            }
            WalOpRaw::Remove { .. } => panic!("Wrong variant"),
        }
    }

    #[test]
    fn test_wal_op_put_large_key() {
        let large_key = vec![0xAB; 10000];
        let IndexStateItem { blob_hash, blob_size } = make_test_item(99);
        let op = WalOpRaw::Put { key_bytes: large_key.clone(), hash: blob_hash, size: blob_size };
        let serialized = serialize_wal_op_raw(&op).unwrap();
        let deserialized = deserialize_wal_op_raw(&serialized).unwrap();

        match deserialized {
            WalOpRaw::Put { key_bytes, hash, size } => {
                assert_eq!(key_bytes, large_key);
                assert_eq!(hash, blob_hash);
                assert_eq!(size, blob_size);
            }
            WalOpRaw::Remove { .. } => panic!("Wrong variant"),
        }
    }

    #[test]
    fn test_wal_op_remove_empty() {
        // empty list of keys
        let op = WalOpRaw::Remove { keys_bytes: vec![] };
        let serialized = serialize_wal_op_raw(&op).unwrap();
        let deserialized = deserialize_wal_op_raw(&serialized).unwrap();

        match deserialized {
            WalOpRaw::Remove { keys_bytes } => {
                assert_eq!(keys_bytes.len(), 0);
            }
            WalOpRaw::Put { .. } => panic!("Wrong variant"),
        }
    }

    #[test]
    fn test_wal_op_remove_single_empty_key() {
        // single empty key
        let op = WalOpRaw::Remove { keys_bytes: vec![b"".to_vec()] };
        let serialized = serialize_wal_op_raw(&op).unwrap();
        let deserialized = deserialize_wal_op_raw(&serialized).unwrap();

        match deserialized {
            WalOpRaw::Remove { keys_bytes } => {
                let [only] = keys_bytes.as_slice() else {
                    panic!("Expected a single key");
                };
                assert_eq!(only.as_slice(), b"");
            }
            WalOpRaw::Put { .. } => panic!("Wrong variant"),
        }
    }

    #[test]
    fn test_wal_op_remove_mixed_keys() {
        // multiple keys of different sizes including empty
        let large_key = vec![0xFF; 1000];
        let op = WalOpRaw::Remove {
            keys_bytes: vec![
                b"".to_vec(),      // empty key
                b"hello".to_vec(), // small key
                large_key.clone(), // large key
            ],
        };
        let serialized = serialize_wal_op_raw(&op).unwrap();
        let deserialized = deserialize_wal_op_raw(&serialized).unwrap();

        match deserialized {
            WalOpRaw::Remove { keys_bytes } => {
                let [first, second, third] = keys_bytes.as_slice() else {
                    panic!("Expected three keys");
                };
                assert_eq!(first.as_slice(), b"");
                assert_eq!(second.as_slice(), b"hello");
                assert_eq!(third, &large_key);
            }
            WalOpRaw::Put { .. } => panic!("Wrong variant"),
        }
    }

    #[test]
    fn test_btreemap_invalid_data() {
        // test with invalid data that's too short
        let invalid_data = vec![1, 2, 3]; // not enough bytes for even a header
        let result = deserialize_index_state(&invalid_data);
        assert!(result.is_err());

        // test with valid header but invalid entry
        let mut invalid_data = Vec::new();
        invalid_data.extend_from_slice(&1u32.to_le_bytes()); // 1 entry
        invalid_data.extend_from_slice(&4u32.to_le_bytes()); // key len = 4
        invalid_data.extend_from_slice(b"hi"); // but only 2 bytes provided
        let result = deserialize_index_state(&invalid_data);
        assert!(result.is_err());
    }

    #[test]
    fn test_wal_op_invalid_data() {
        // test with empty data
        let result = deserialize_wal_op_raw(&[]);
        assert!(result.is_err());

        // test with invalid variant tag
        let result = deserialize_wal_op_raw(&[99]); // invalid tag
        assert!(result.is_err());

        // test with valid tag but invalid data
        let mut invalid_data = vec![0]; // Put variant
        invalid_data.extend_from_slice(&4u32.to_le_bytes()); // key len = 4
        invalid_data.extend_from_slice(b"hi"); // but only 2 bytes
        let result = deserialize_wal_op_raw(&invalid_data);
        assert!(result.is_err());
    }

    #[test]
    fn test_helper_functions() {
        let data = [42, 1, 0, 0, 0, 5, 6, 7, 8, 9];
        let mut slice = &data[..];

        // test read_u8
        assert_eq!(read_u8(&mut slice, "test").unwrap(), 42);

        // test read_u32
        assert_eq!(read_u32(&mut slice, "test").unwrap(), 1);

        // test read_fixed_bytes
        let fixed: [u8; 3] = read_fixed_bytes(&mut slice, "test").unwrap();
        assert_eq!(fixed, [5, 6, 7]);

        // test read_bytes_with_len (remaining 2 bytes should be interpreted as len=2056 which
        // should fail)
        let result = read_bytes_with_len(&mut slice, "test");
        assert!(result.is_err());
    }

    #[test]
    fn test_helper_functions_errors() {
        // test read_u8 with empty data
        let mut empty = &[][..];
        assert!(read_u8(&mut empty, "test").is_err());

        // test read_u32 with insufficient data
        let mut short = &[1, 2][..];
        assert!(read_u32(&mut short, "test").is_err());

        // test read_fixed_bytes with insufficient data
        let mut short = &[1, 2][..];
        let result: Result<[u8; 5], _> = read_fixed_bytes(&mut short, "test");
        assert!(result.is_err());

        // test read_bytes_with_len with insufficient data
        let mut data = &[5u8, 0, 0, 0, 1, 2][..]; // len=5 but only 2 bytes follow
        assert!(read_bytes_with_len(&mut data, "test").is_err());
    }
}