Struct MiniGraph

struct MiniGraph<'tcx> {
    nodes: FxIndexMap<Region<'tcx>, LeakCheckNode>,
    sccs: Sccs<LeakCheckNode, LeakCheckScc>,
}

Represents the graph of constraints. For each R1: R2 constraint we create an edge R1 -> R2 in the graph.

Fields

nodes: FxIndexMap<Region<'tcx>, LeakCheckNode>

Map from a region to the index of the node in the graph.

sccs: Sccs<LeakCheckNode, LeakCheckScc>

Map from node index to SCC, and stores the successors of each SCC. All the regions in the same SCC are equal to one another, and if S1 -> S2, then S1: S2.

Implementations

impl<'tcx> MiniGraph<'tcx>

fn new( tcx: TyCtxt<'tcx>, region_constraints: &RegionConstraintCollector<'_, 'tcx>, only_consider_snapshot: Option<&CombinedSnapshot<'tcx>>, ) -> Self

fn iterate_region_constraints( tcx: TyCtxt<'tcx>, region_constraints: &RegionConstraintCollector<'_, 'tcx>, only_consider_snapshot: Option<&CombinedSnapshot<'tcx>>, each_edge: impl FnMut(Region<'tcx>, Region<'tcx>), )

Invokes each_edge(R1, R2) for each edge where R2: R1

fn add_node( nodes: &mut FxIndexMap<Region<'tcx>, LeakCheckNode>, r: Region<'tcx>, ) -> LeakCheckNode

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 128 bytes