Struct LocalizedConstraintGraph

struct LocalizedConstraintGraph {
    edges: FxHashMap<LocalizedNode, FxIndexSet<LocalizedNode>>,
    logical_edges: FxHashMap<RegionVid, FxIndexSet<RegionVid>>,
}

The localized constraint graph indexes the physical and logical edges to compute a given node’s successors during traversal.

Fields

edges: FxHashMap<LocalizedNode, FxIndexSet<LocalizedNode>>

The actual, physical, edges we have recorded for a given node.

logical_edges: FxHashMap<RegionVid, FxIndexSet<RegionVid>>

The logical edges representing the outlives constraints that hold at all points in the CFG, which we don’t localize to avoid creating a lot of unnecessary edges in the graph. Some CFGs can be big, and we don’t need to create such a physical edge for every point in the CFG.

Implementations

impl LocalizedConstraintGraph

fn new<'tcx>( constraints: &LocalizedOutlivesConstraintSet, logical_constraints: impl Iterator<Item = OutlivesConstraint<'tcx>>, ) -> Self

Traverses the constraints and returns the indexed graph of edges per node.

fn outgoing_edges( &self, node: LocalizedNode, ) -> impl Iterator<Item = LocalizedNode> + use<'_>

Returns the outgoing edges of a given node, not its transitive closure.

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: 64 bytes