Struct GraphEncoder 

pub(crate) struct GraphEncoder<D: Deps> {
    profiler: SelfProfilerRef,
    status: EncoderState<D>,
    record_graph: Option<Lock<DepGraphQuery>>,
}

Fields

profiler: SelfProfilerRef

status: EncoderState<D>

record_graph: Option<Lock<DepGraphQuery>>

Implementations

impl<D: Deps> GraphEncoder<D>

pub(crate) fn new( sess: &Session, encoder: FileEncoder, prev_node_count: usize, previous: Arc<SerializedDepGraph>, ) -> Self

pub(crate) fn with_query(&self, f: impl Fn(&DepGraphQuery))

pub(crate) fn send_new( &self, node: DepNode, fingerprint: Fingerprint, edges: EdgesVec, ) -> DepNodeIndex

Encodes a node that does not exists in the previous graph.

pub(crate) fn send_and_color( &self, prev_index: SerializedDepNodeIndex, colors: &DepNodeColorMap, node: DepNode, fingerprint: Fingerprint, edges: EdgesVec, is_green: bool, ) -> DepNodeIndex

Encodes a node that exists in the previous graph, but was re-executed.

This will also ensure the dep node is colored either red or green.

pub(crate) fn send_promoted( &self, prev_index: SerializedDepNodeIndex, colors: &DepNodeColorMap, ) -> DepNodeIndex

Encodes a node that was promoted from the previous graph. It reads the information directly from the previous dep graph and expects all edges to already have a new dep node index assigned.

This will also ensure the dep node is marked green.

pub(crate) fn finish(&self, current: &CurrentDepGraph<D>) -> FileEncodeResult

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