Struct GraphAssembler

struct GraphAssembler<'tcx> {
    graph: DiGraph<DepNode<'tcx, CallString>, DepEdge<CallString>>,
    nodes: FxHashMap<DepNode<'tcx, CallString>, NodeIndex>,
    control_inputs: Box<[(NodeIndex, DepEdge<CallString>)]>,
}

Fields

graph: DiGraph<DepNode<'tcx, CallString>, DepEdge<CallString>>

nodes: FxHashMap<DepNode<'tcx, CallString>, NodeIndex>

control_inputs: Box<[(NodeIndex, DepEdge<CallString>)]>

Implementations

impl<'tcx> GraphAssembler<'tcx>

fn new() -> Self

fn add_node(&mut self, node: DepNode<'tcx, CallString>) -> NodeIndex

fn with_new_ctr_inputs<'c, F, R, K>( &mut self, vis: &mut VisitDriver<'tcx, 'c, K>, new_ctrl_inputs: &[(DepNode<'tcx, OneHopLocation>, DepEdge<OneHopLocation>)], f: F, ) -> R

where F: FnOnce(&mut Self, &mut VisitDriver<'tcx, 'c, K>) -> R,

Forwarding of control flow. It is sound to replace the control inputs here rather than extend them because we are guaranteed that these new nodes are connected to the old ctrl nodes, possibly transitively.

Each node in our graph is either connected to a local control flow node or to the ones coming from the parent, which is established by the visit_partial_graph function. By induction all nodes, including these control flow sources are connected to the old ctrl inputs.

Trait Implementations

impl<'tcx, K: Hash + Eq + Clone> Visitor<'tcx, K> for GraphAssembler<'tcx>

fn visit_inlined_call( &mut self, vis: &mut VisitDriver<'tcx, '_, K>, loc: Location, inst: Instance<'tcx>, k: &K, ctrl_inputs: &[(DepNode<'tcx, OneHopLocation>, DepEdge<OneHopLocation>)], )

fn visit_edge( &mut self, vis: &mut VisitDriver<'tcx, '_, K>, src: &DepNode<'tcx, OneHopLocation>, dst: &DepNode<'tcx, OneHopLocation>, kind: &DepEdge<OneHopLocation>, )

fn visit_partial_graph( &mut self, vis: &mut VisitDriver<'tcx, '_, K>, graph: &PartialGraph<'tcx, K>, )

fn visit_node( &mut self, _vis: &mut VisitDriver<'tcx, '_, K>, _node: &DepNode<'tcx, OneHopLocation>, )