Struct Sharded 

pub struct Sharded<T> { /* private fields */ }

A sharded mutex wrapper for the page caches. Each key routes to one of N independent shards (each with its own lock), so concurrent rayon workers probing different keys rarely contend on the same lock. A try_lock that fails under contention is counted as a try-lock-miss. (§5.8)

Implementations

impl<T> Sharded<T>

pub fn new(n_shards: usize, make: impl FnMut() -> T) -> Self

pub fn try_lock(&self, key: &[u8; 32]) -> Option<MutexGuard<'_, T>>

pub fn lock(&self, key: &[u8; 32]) -> MutexGuard<'_, T>

pub fn try_lock_misses(&self) -> u64

impl Sharded<PageCache>

pub fn stats(&self) -> CacheStats

pub fn reset_stats(&self)

pub fn flush_to_disk(&self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn used_bytes(&self) -> u64

Live bytes across all shards.

pub fn evict_reclaimable(&self, budget: u64) -> u64

Governor entry point (S1E-003 step 2): evict at least budget bytes across the shards (spread evenly over the remaining shards), returning the bytes actually freed.

impl Sharded<DecodedPageCache>

pub fn stats(&self) -> CacheStats

pub fn reset_stats(&self)

pub fn len(&self) -> usize

pub fn used_bytes(&self) -> u64

Live bytes across all shards.

pub fn evict_reclaimable(&self, budget: u64) -> u64

Governor entry point (S1E-003 step 2): evict at least budget bytes across the shards, returning the bytes actually freed.

Trait Implementations

impl Reclaimable for Sharded<PageCache>

fn evict_reclaimable(&self, budget: u64) -> u64

Evict at least budget bytes of reclaimable entries; returns the bytes actually freed (fewer when less was reclaimable).

fn reclaimable_bytes(&self) -> u64

Bytes currently reclaimable.

impl Reclaimable for Sharded<DecodedPageCache>

fn evict_reclaimable(&self, budget: u64) -> u64

Evict at least budget bytes of reclaimable entries; returns the bytes actually freed (fewer when less was reclaimable).

fn reclaimable_bytes(&self) -> u64

Bytes currently reclaimable.