Struct rustc_query_system::dep_graph::serialized::EncoderState

struct EncoderState<D: Deps> {
    previous: Arc<SerializedDepGraph>,
    encoder: FileEncoder,
    total_node_count: usize,
    total_edge_count: usize,
    stats: Option<FxHashMap<DepKind, Stat>>,
    kind_stats: Vec<u32>,
    marker: PhantomData<D>,
}

Fields

previous: Arc<SerializedDepGraph>

encoder: FileEncoder

total_node_count: usize

total_edge_count: usize

stats: Option<FxHashMap<DepKind, Stat>>

kind_stats: Vec<u32>

Stores the number of times we’ve encoded each dep kind.

marker: PhantomData<D>

Implementations

impl<D: Deps> EncoderState<D>

fn new( encoder: FileEncoder, record_stats: bool, previous: Arc<SerializedDepGraph>, ) -> Self

fn record( &mut self, node: DepNode, edge_count: usize, edges: impl FnOnce(&mut Self) -> Vec<DepNodeIndex>, record_graph: &Option<Lock<DepGraphQuery>>, ) -> DepNodeIndex

fn encode_node( &mut self, node: &NodeInfo, record_graph: &Option<Lock<DepGraphQuery>>, ) -> DepNodeIndex

Encodes a node to the current graph.

fn encode_promoted_node( &mut self, prev_index: SerializedDepNodeIndex, record_graph: &Option<Lock<DepGraphQuery>>, prev_index_to_index: &IndexVec<SerializedDepNodeIndex, Option<DepNodeIndex>>, ) -> DepNodeIndex

Encodes a node that was promoted from the previous graph. It reads the information directly from the previous dep graph for performance reasons.

This differs from encode_node where you have to explicitly provide the relevant NodeInfo.

It expects all edges to already have a new dep node index assigned.

fn finish(self, profiler: &SelfProfilerRef) -> 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: 144 bytes