rustc_query_system::dep_graph::serialized

Struct SerializedDepGraph

pub struct SerializedDepGraph {
    nodes: IndexVec<SerializedDepNodeIndex, DepNode>,
    fingerprints: IndexVec<SerializedDepNodeIndex, Fingerprint>,
    edge_list_indices: IndexVec<SerializedDepNodeIndex, EdgeHeader>,
    edge_list_data: Vec<u8>,
    index: Vec<UnhashMap<PackedFingerprint, SerializedDepNodeIndex>>,
}

Expand description

Data for use when recompiling the current crate.

Fields§

§nodes: IndexVec<SerializedDepNodeIndex, DepNode>

The set of all DepNodes in the graph

§fingerprints: IndexVec<SerializedDepNodeIndex, Fingerprint>

The set of all Fingerprints in the graph. Each Fingerprint corresponds to the DepNode at the same index in the nodes vector.

§edge_list_indices: IndexVec<SerializedDepNodeIndex, EdgeHeader>

For each DepNode, stores the list of edges originating from that DepNode. Encoded as a [start, end) pair indexing into edge_list_data, which holds the actual DepNodeIndices of the target nodes.

§edge_list_data: Vec<u8>

A flattened list of all edge targets in the graph, stored in the same varint encoding that we use on disk. Edge sources are implicit in edge_list_indices.

§index: Vec<UnhashMap<PackedFingerprint, SerializedDepNodeIndex>>

Stores a map from fingerprints to nodes per dep node kind. This is the reciprocal of nodes.

Struct SerializedDepGraphCopy item path

Fields§

Implementations§

impl SerializedDepGraph

pub fn edge_targets_from( &self, source: SerializedDepNodeIndex, ) -> impl Iterator<Item = SerializedDepNodeIndex> + Clone + '_

pub fn index_to_node(&self, dep_node_index: SerializedDepNodeIndex) -> DepNode

pub fn node_to_index_opt( &self, dep_node: &DepNode, ) -> Option<SerializedDepNodeIndex>

pub fn fingerprint_by_index( &self, dep_node_index: SerializedDepNodeIndex, ) -> Fingerprint

pub fn node_count(&self) -> usize

impl SerializedDepGraph

pub fn decode<D: Deps>(d: &mut MemDecoder<'_>) -> Arc<SerializedDepGraph>

Trait Implementations§

impl Debug for SerializedDepGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl Default for SerializedDepGraph

fn default() -> SerializedDepGraph

Auto Trait Implementations§

impl DynSend for SerializedDepGraph

impl DynSync for SerializedDepGraph

impl Freeze for SerializedDepGraph

impl RefUnwindSafe for SerializedDepGraph

impl Send for SerializedDepGraph

impl Sync for SerializedDepGraph

impl Unpin for SerializedDepGraph

impl UnwindSafe for SerializedDepGraph

Blanket Implementations§

impl<T> Aligned for T

const ALIGN: Alignment = _

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T, R> CollectAndApply<T, R> for T

fn collect_and_apply<I, F>(iter: I, f: F) -> Rwhere I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

type Output = R

impl<T> Filterable for T

fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<T> Pointable for T

const ALIGN: usize = _

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> Same for T

type Output = T

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<I, T, U> Upcast<I, U> for Twhere U: UpcastFrom<I, T>,

fn upcast(self, interner: I) -> U

impl<I, T> UpcastFrom<I, T> for T

fn upcast_from(from: T, _tcx: I) -> T

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

fn vzip(self) -> V

impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

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 Twhere T: Send + Sync,

Layout§

Struct SerializedDepGraph

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

impl<T, U> Into<U> for T
where U: From<T>,

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

impl<'a, T> Captures<'a> for T
where T: ?Sized,

impl<T> ErasedDestructor for T
where T: 'static,

impl<T> MaybeSendSync for T
where T: Send + Sync,