backhopper-xref-graph 0.31.0

Whole-program call-graph primitives for backhopper-xref: vertices, relations, set algebra, transitive closure
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

// Copyright (C) 2026 Michael S. Klishin and Contributors
// SPDX-License-Identifier: Apache-2.0 OR MIT
// See LICENSE-APACHE and LICENSE-MIT for details.

//! Whole-program call-graph primitives for `backhopper-xref`.
//!
//! This crate has no Erlang knowledge. It provides:
//!
//! * [`Vertex`] and [`FunctionRef`]: entities the graph tracks
//! * [`VertexSet`] and [`Relation`]: finite sets and binary relations with
//!   the operators a call-graph analysis needs (`union`, `intersection`,
//!   `compose`, `image`, `transitive_closure`, …)
//! * [`CallGraph`]: the aggregate, parameterised on a mode marker
//!   ([`Functions`] vs [`Modules`]) and a phase marker ([`Building`]
//!   vs [`Built`]) so misuses become compile errors

pub mod call;
pub mod errors;
pub mod graph;
pub mod loc;
pub mod relation;
pub mod state;
pub mod vertex;

pub use call::{
    CallKind, CallTarget, FunctionRef, FunctionSig, LocalFunctionRef, UnresolvedCallSite,
};
pub use errors::GraphError;
pub use graph::{CallGraph, Deprecation, DeprecationTier, ModuleSummary};
pub use loc::{Loc, PathId, PathInterner, Position};
pub use relation::{Relation, VertexSet};
pub use state::{Building, Built, Functions, Mode, Modules, Phase};
pub use vertex::Vertex;