Struct CallGraph 

pub struct CallGraph {
    pub format_version: u32,
    pub project_root: String,
    pub edges: Vec<CallEdge>,
    pub file_hashes: HashMap<String, String>,
    pub file_stamps: HashMap<String, FileStamp>,
    pub skipped_files: Vec<String>,
}

Fields

format_version: u32

Missing in pre-v2 caches → 0 → rejected by load.

project_root: String

edges: Vec<CallEdge>

file_hashes: HashMap<String, String>

file_stamps: HashMap<String, FileStamp>

Size and mtime of each analyzed or skipped file when it was read, so a persisted graph is rebuilt when a file changed in place. Missing in older caches → empty → such a cache counts as stale once.

skipped_files: Vec<String>

Indexed files the build skipped because they are not UTF-8 text. They count as covered, so the cache is not rebuilt for them on every load.

Implementations

impl CallGraph

pub fn new(project_root: &str) -> Self

pub fn build_parallel( inputs: &CallGraphInputs, progress: Option<(&AtomicUsize, &AtomicUsize)>, ) -> Self

pub fn build_incremental_parallel( inputs: &CallGraphInputs, previous: &CallGraph, progress: Option<(&AtomicUsize, &AtomicUsize)>, ) -> Self

pub fn get_or_start_build( project_root: &str, inputs: Arc<CallGraphInputs>, ) -> Result<Arc<CallGraph>, BuildProgress>

Returns the cached graph immediately, or None + starts a background build.

pub fn build_status() -> BuildProgress

Returns the status of the most recently requested build without starting anything: counts only, no file or symbol of any project.

pub fn invalidate(project_root: &str)

Drop the resident graphs of project_root (in every protection state) so its next request checks the persisted graph against the files again and rebuilds what changed. Called after the project’s index was rebuilt; a build in flight is kept.

pub fn build(inputs: &CallGraphInputs) -> Self

pub fn build_incremental(inputs: &CallGraphInputs, previous: &CallGraph) -> Self

pub fn callers_of(&self, symbol: &str) -> Vec<&CallEdge>

Edges calling symbol, however the call site spells it: a query for write also finds crate::config_io::write(..) (see callee_matches).

pub fn callees_of(&self, symbol: &str) -> Vec<&CallEdge>

pub fn bfs_callers(&self, symbol: &str, max_depth: usize) -> Vec<BfsNode>

BFS callers up to max_depth hops. Returns (symbol, file, line, depth) per node.

pub fn bfs_callees(&self, symbol: &str, max_depth: usize) -> Vec<BfsNode>

BFS callees up to max_depth hops. Returns (symbol, file, line, depth) per node.

pub fn find_call_path(&self, from: &str, to: &str) -> Option<Vec<PathHop>>

Find shortest call path from from to to using BFS. Returns None if no path exists (searched up to depth 10). Find shortest call path from from to to using BFS. Returns None if no path exists (searched up to depth 10).

pub fn transitive_caller_count(&self, symbol: &str, max_depth: usize) -> usize

Count unique transitive callers up to max_depth.

pub fn save(&self) -> Result<(), String>

pub fn load(project_root: &str) -> Option<Self>

pub fn load_or_build(project_root: &str, inputs: &CallGraphInputs) -> Self

Trait Implementations

impl Clone for CallGraph

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CallGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for CallGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for CallGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.