struct EncoderState<D: Deps> {
    next_node_index: AtomicU64,
    previous: Arc<SerializedDepGraph>,
    file: Lock<Option<FileEncoder>>,
    local: WorkerLocal<RefCell<LocalEncoderState>>,
    stats: Option<Lock<FxHashMap<DepKind, Stat>>>,
    marker: PhantomData<D>,
}Fields§
§next_node_index: AtomicU64§previous: Arc<SerializedDepGraph>§file: Lock<Option<FileEncoder>>§local: WorkerLocal<RefCell<LocalEncoderState>>§stats: Option<Lock<FxHashMap<DepKind, Stat>>>§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 next_index(&self, local: &mut LocalEncoderState) -> DepNodeIndex
Sourcefn bump_index(&self, local: &mut LocalEncoderState)
 
fn bump_index(&self, local: &mut LocalEncoderState)
Marks the index previously returned by next_index as used.
fn record( &self, node: DepNode, index: DepNodeIndex, edge_count: usize, edges: impl FnOnce(&Self) -> Vec<DepNodeIndex>, record_graph: &Option<Lock<DepGraphQuery>>, local: &mut LocalEncoderState, )
fn flush_mem_encoder(&self, local: &mut LocalEncoderState)
Sourcefn encode_node(
    &self,
    index: DepNodeIndex,
    node: &NodeInfo,
    record_graph: &Option<Lock<DepGraphQuery>>,
    local: &mut LocalEncoderState,
)
 
fn encode_node( &self, index: DepNodeIndex, node: &NodeInfo, record_graph: &Option<Lock<DepGraphQuery>>, local: &mut LocalEncoderState, )
Encodes a node to the current graph.
Sourcefn encode_promoted_node(
    &self,
    index: DepNodeIndex,
    prev_index: SerializedDepNodeIndex,
    record_graph: &Option<Lock<DepGraphQuery>>,
    colors: &DepNodeColorMap,
    local: &mut LocalEncoderState,
)
 
fn encode_promoted_node( &self, index: DepNodeIndex, prev_index: SerializedDepNodeIndex, record_graph: &Option<Lock<DepGraphQuery>>, colors: &DepNodeColorMap, local: &mut LocalEncoderState, )
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, current: &CurrentDepGraph<D>, ) -> FileEncodeResult
fn print_incremental_info( &self, current: &CurrentDepGraph<D>, total_node_count: usize, total_edge_count: usize, )
Auto Trait Implementations§
impl<D> DynSend for EncoderState<D>where
    D: DynSend,
impl<D> DynSync for EncoderState<D>
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>
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<T> ErasedDestructor for Twhere
    T: 'static,
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: 152 bytes