Struct rustc_query_system::dep_graph::serialized::GraphEncoder

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

Fields

profiler: SelfProfilerRef

status: Lock<Option<EncoderState<D>>>

record_graph: Option<Lock<DepGraphQuery>>

Implementations

impl<D: Deps> GraphEncoder<D>

pub fn new( encoder: FileEncoder, prev_node_count: usize, record_graph: bool, record_stats: bool, profiler: &SelfProfilerRef, previous: Arc<SerializedDepGraph>, ) -> Self

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

pub(crate) fn print_incremental_info( &self, total_read_count: u64, total_duplicate_read_count: u64, )

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

pub(crate) fn send_promoted( &self, prev_index: SerializedDepNodeIndex, 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 and expects all edges to already have a new dep node index assigned.

pub fn finish(&self) -> 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