Struct NodeRangedStore 

pub struct NodeRangedStore { /* private fields */ }

Node-side RangedStore: a per-blob view over the iroh-blobs cache.

Implementations

impl NodeRangedStore

pub const fn new(engine: CacheEngine, hash: Hash, total_bytes: u64) -> Self

Wrap engine’s view of hash (a total_bytes-byte blob) as a RangedStore. engine is cheap to clone (Arc-backed), so this holds it by value rather than behind an extra Arc.

pub const fn hash(&self) -> Hash

The blob hash this store is scoped to.

pub const fn engine(&self) -> &CacheEngine

The wrapped CacheEngine handle. Lets a node-crate wrapper (#1621 Task 10, NodeAdmitStore) reach the engine’s admit_bao_stream without duplicating the (engine, hash, total_bytes) triple it already holds.

pub fn refuses(&self) -> bool

Does a deny/blacklist/evict/quarantine gate currently refuse this hash? A pure in-memory check (CacheEngine::refuses reads in-memory sets and never awaits a store hop), so the serve encoder can fold takedown into its per-leaf presence check without a store round trip. Mirrors the guard CacheEngine::present_ranges applies before it answers presence.

Trait Implementations

impl Debug for NodeRangedStore

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl RangedStore for NodeRangedStore

fn total_bytes(&self) -> u64

The blob length in bytes the store currently works to. A backend keyed by size fixes it at construction. A backend keyed by offset reports its current bound, which becomes the proven size once a verified final chunk proves one.

fn present_ranges(&self) -> RangedFuture<'_, ChunkRanges>

Chunk ranges that verify right now.

fn missing_ranges( &self, byte_offset: u64, byte_len: u64, ) -> RangedFuture<'_, ChunkRanges>

[byte_offset, byte_offset+byte_len) (byte_len == 0 ⇒ to end) minus what is present.

fn admit(&self, range: AlignedRange, bao_bytes: Bytes) -> RangedFuture<'_, ()>

Verify the interleaved bao_bytes for range against the root in transit, write data + proof, record the range. Idempotent per range.

fn read(&self, byte_offset: u64, byte_len: u64) -> RangedFuture<'_, Bytes>

Plaintext bytes for the held [byte_offset, byte_offset+byte_len) span. The returned span is collected into Bytes, so callers (e.g. a future gap-driven driver) should request gap-sized spans rather than whole blobs to stay O(gap) in memory.

fn is_complete(&self) -> RangedFuture<'_, bool>

The whole blob is present.

fn finalize(&self) -> RangedFuture<'_, ()>

Whole-blob wrap-up: verify complete (+ promote/materialize on backends that need it). Errors Incomplete if any range is still missing.

impl ServeStore for NodeRangedStore

fn observe(&self) -> RangedFuture<'_, PresentRangeWatch>

Watch which chunk ranges are present, from now until the blob is complete.

fn encode_range( &self, byte_offset: u64, byte_len: u64, ) -> RangedFuture<'_, EncodeStream>

Re-encode the currently-present bytes of [byte_offset, byte_offset + byte_len) into header-less wire bao.