Struct rustc_query_system::dep_graph::serialized::EncoderState
source · 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§
source§impl<D: Deps> EncoderState<D>
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
sourcefn encode_node(
&mut self,
node: &NodeInfo,
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.
sourcefn encode_promoted_node(
&mut self,
prev_index: SerializedDepNodeIndex,
record_graph: &Option<Lock<DepGraphQuery>>,
prev_index_to_index: &IndexVec<SerializedDepNodeIndex, Option<DepNodeIndex>>,
) -> DepNodeIndex
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 explictly provide the relevant NodeInfo
.
It expects all edges to already have a new dep node index assigned.
fn finish(self, profiler: &SelfProfilerRef) -> FileEncodeResult
Auto Trait Implementations§
impl<D> DynSend for EncoderState<D>where
D: DynSend,
impl<D> DynSync for EncoderState<D>where
D: DynSync,
impl<D> Freeze for EncoderState<D>
impl<D> !RefUnwindSafe for EncoderState<D>
impl<D> Send for EncoderState<D>where
D: Send,
impl<D> Sync for EncoderState<D>where
D: Sync,
impl<D> Unpin for EncoderState<D>where
D: Unpin,
impl<D> !UnwindSafe for EncoderState<D>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
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