Struct IrCache 

pub struct IrCache { /* private fields */ }

One runtime’s lowered-IR cache.

Implementations

impl IrCache

pub fn new() -> Self

Create an empty cache. One runtime’s Tiers owns exactly one.

pub fn get(&self, id: u64) -> Option<Arc<IrFunction>>

Look up a cached IR function by arity ID, refreshing its last-access time. None if not cached or if lowering previously failed.

This is the hot path — uses a read lock so concurrent callers don’t block (the access timestamp is a relaxed atomic store under it).

pub fn should_attempt(&self, id: u64) -> bool

Check if lowering should be attempted for this arity. true if the entry is NotAttempted (or absent).

pub fn store(&self, id: u64, ir: Arc<IrFunction>)

Store a successful IR compilation result.

pub fn store_unsupported(&self, id: u64)

Mark an arity as unsupported (lowering failed; don’t retry).

pub fn invalidate(&self, id: u64)

Drop the cache entry for an arity entirely (back to NotAttempted), so a later Self::should_attempt returns true and the arity can be re-lowered.

Used by cross-defn invalidation: a lowering that specialized against another defn is stale once that defn is rebound.

pub fn sweep( &self, now: u64, ttl_secs: u64, pinned: impl Fn(u64) -> bool, ) -> Vec<u64>

Evict cached entries idle longer than ttl_secs, skipping any arity pinned reports as still needed (published native code or an in-flight compile: the IR is the deoptimization fallback).

Returns the evicted arity ids so the caller can drop their JIT bookkeeping too; see Tiers::sweep.

Trait Implementations

impl Default for IrCache

fn default() -> Self

Returns the “default value” for a type.