Struct CacheKey 

pub struct CacheKey {
    pub source_hash: [u8; 32],
    pub import_graph_hash: [u8; 32],
    pub harn_version: &'static str,
    pub compiler_tag: u8,
}

Cache key components for a single pipeline source. Equality of all fields is necessary and sufficient for cache reuse.

Fields

source_hash: [u8; 32]

import_graph_hash: [u8; 32]

harn_version: &'static str

compiler_tag: u8

Compact tag for active CompilerOptions. Flipping HARN_DISABLE_OPTIMIZATIONS between runs would otherwise reuse a chunk compiled under the wrong setting.

Implementations

impl CacheKey

pub fn from_source(source_path: &Path, source: &str) -> Self

Compute the cache key for a .harn source file plus its transitive user imports. read_source is the entry-file contents; the import graph is walked from disk relative to source_path.

pub fn filename(&self) -> String

Entry-chunk filename for this key. We hash by source content alone so two invocations of the same source from different paths share a cache entry; the header’s import-graph hash still gates reuse on a per-load basis.

pub fn module_filename(&self) -> String

Module-artifact filename for this key.

Trait Implementations

impl Clone for CacheKey

fn clone(&self) -> CacheKey

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for CacheKey

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

Formats the value using the given formatter.

impl PartialEq for CacheKey

fn eq(&self, other: &CacheKey) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for CacheKey

impl StructuralPartialEq for CacheKey