holt 0.7.3

An adaptive-radix-tree metadata storage engine for path-shaped keys, with per-blob concurrency and crash-safe persistence.
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

//! Shared route-cache validation helpers.

use crate::api::errors::Result;
use crate::engine::RouteHit;
use crate::layout::ROOT_BLOB_GUID;
use crate::store::BlobFrameRef;
use crate::store::{BufferManager, CachedBlob};
use std::sync::Arc;

use super::lookup::lookup_at;
use super::types::LookupResult;
use super::SearchKey;

pub(super) fn validate_route_edge(
    frame: BlobFrameRef<'_>,
    key: SearchKey<'_>,
    route: RouteHit,
) -> Result<bool> {
    let root_slot = frame.header().root_slot;
    match lookup_at(frame, root_slot, key, route.parent_depth)? {
        LookupResult::Crossing(crossing) => Ok(
            crossing.child_guid == route.child_guid && crossing.child_depth == route.child_depth
        ),
        LookupResult::Found(_) | LookupResult::NotFound => Ok(false),
    }
}

pub(super) fn pin_route_parent(
    bm: &BufferManager,
    root_pin: &Arc<CachedBlob>,
    route: RouteHit,
) -> Result<Arc<CachedBlob>> {
    if route.parent_guid == ROOT_BLOB_GUID {
        Ok(Arc::clone(root_pin))
    } else {
        bm.pin(route.parent_guid)
    }
}