Skip to main content

## DepGraphData

# Struct DepGraphData

Source

    pub struct DepGraphData {
        current: CurrentDepGraph,
        previous: Arc<SerializedDepGraph>,
        colors: DepNodeColorMap,
        previous_work_products: WorkProductMap,
        dep_node_debug: Lock<FxHashMap<DepNode, String>>,
        debug_loaded_from_disk: Lock<FxHashSet<DepNode>>,
    }

## Fields§

§`current: CurrentDepGraph`

The new encoding of the dependency graph, optimized for red/green tracking. The `current` field is the dependency graph of only the current compilation session: We don’t merge the previous dep-graph into current one anymore, but we do reference shared data to save space.

§`previous: Arc<SerializedDepGraph>`

The dep-graph from the previous compilation session. It contains all nodes and edges as well as all fingerprints of nodes that have them.

§`colors: DepNodeColorMap`§`previous_work_products: WorkProductMap`

When we load, there may be `.o` files, cached MIR, or other such things available to us. If we find that they are not dirty, we load the path to the file storing those work-products here into this map. We can later look for and extract that data.

§`dep_node_debug: Lock<FxHashMap<DepNode, String>>`§`debug_loaded_from_disk: Lock<FxHashSet<DepNode>>`

Used by incremental compilation tests to assert that a particular query result was decoded from disk (not just marked green)

## Implementations§

Source§

### impl DepGraphData

Source

#### pub fn with_task<'tcx, A: Debug, R>( &self, dep_node: DepNode, tcx: TyCtxt<'tcx>, task_arg: A, task_fn: fn(tcx: TyCtxt<'tcx>, task_arg: A) -> R, hash_result: Option<fn(&mut StableHashingContext<'_>, &R) -> Fingerprint>, ) -> (R, DepNodeIndex)

Starts a new dep-graph task. Dep-graph tasks are specified using a free function (`task`) and not a closure – this is intentional because we want to exercise tight control over what state they have access to. In particular, we want to prevent implicit ‘leaks’ of tracked state into the task (which could then be read without generating correct edges in the dep-graph – see the rustc dev guide for more details on the dep-graph).

Therefore, the task function takes a `TyCtxt`, plus exactly one additional argument, `task_arg`. The additional argument type can be `()` if no argument is needed, or a tuple if multiple arguments are needed.

Source

#### fn with_anon_task_inner<'tcx, OP, R>( &self, tcx: TyCtxt<'tcx>, dep_kind: DepKind, op: OP, ) -> (R, DepNodeIndex)
where OP: FnOnce() -> R,

Executes something within an “anonymous” task, that is, a task the `DepNode` of which is determined by the list of inputs it read from.

NOTE: this does not actually count as a read of the DepNode here. Using the result of this task without reading the DepNode will result in untracked dependencies which may lead to ICEs as nodes are incorrectly marked green.

FIXME: This could perhaps return a `WithDepNode` to ensure that the user of this function actually performs the read.

Source

#### fn hash_result_and_alloc_node<'tcx, R>( &self, tcx: TyCtxt<'tcx>, node: DepNode, edges: EdgesVec, result: &R, hash_result: Option<fn(&mut StableHashingContext<'_>, &R) -> Fingerprint>, ) -> DepNodeIndex

Intern the new `DepNode` with the dependencies up-to-now.

Source§

### impl DepGraphData

Source

#### fn assert_dep_node_not_yet_allocated_in_current_session<S: Display>( &self, sess: &Session, dep_node: &DepNode, msg: impl FnOnce() -> S, )

Source

#### fn node_color(&self, dep_node: &DepNode) -> DepNodeColor

Source

#### pub fn is_index_green(&self, prev_index: SerializedDepNodeIndex) -> bool

Returns true if the given node has been marked as green during the current compilation session. Used in various assertions

Source

#### pub fn prev_value_fingerprint_of( &self, prev_index: SerializedDepNodeIndex, ) -> Fingerprint

Source

#### pub(crate) fn prev_node_of( &self, prev_index: SerializedDepNodeIndex, ) -> &DepNode

Source

#### pub fn mark_debug_loaded_from_disk(&self, dep_node: DepNode)

Source

#### fn encode_side_effect<'tcx>( &self, tcx: TyCtxt<'tcx>, side_effect: QuerySideEffect, ) -> DepNodeIndex

This encodes a side effect by creating a node with an unique index and associating it with the node, for use in the next session.

Source

#### fn force_side_effect<'tcx>( &self, tcx: TyCtxt<'tcx>, prev_index: SerializedDepNodeIndex, )

This forces a side effect node green by running its side effect. `prev_index` would refer to a node created used `encode_side_effect` in the previous session.

Source

#### fn alloc_and_color_node( &self, key: DepNode, edges: EdgesVec, value_fingerprint: Option<Fingerprint>, ) -> DepNodeIndex

Source

#### fn promote_node_and_deps_to_current( &self, prev_index: SerializedDepNodeIndex, ) -> Option<DepNodeIndex>

Source§

### impl DepGraphData

Source

#### pub fn try_mark_green<'tcx>( &self, tcx: TyCtxt<'tcx>, dep_node: &DepNode, ) -> Option<(SerializedDepNodeIndex, DepNodeIndex)>

Try to mark a node index for the node dep_node.

A node will have an index, when it’s already been marked green, or when we can mark it green. This function will mark the current task as a reader of the specified node, when a node index can be found for that node.

Source

#### fn try_mark_previous_green<'tcx>( &self, tcx: TyCtxt<'tcx>, prev_dep_node_index: SerializedDepNodeIndex, frame: Option<&MarkFrame<'_>>, ) -> Option<DepNodeIndex>

Try to mark a dep-node which existed in the previous compilation session as green.

## Auto Trait Implementations§

§

### impl DynSend for DepGraphData

§

### impl DynSync for DepGraphData

§

### impl !Freeze for DepGraphData

§

### impl !RefUnwindSafe for DepGraphData

§

### impl Send for DepGraphData

§

### impl !Sync for DepGraphData

§

### impl Unpin for DepGraphData

§

### impl UnsafeUnpin for DepGraphData

§

### impl !UnwindSafe for DepGraphData

## Blanket Implementations§

Source§

### impl<T> Aligned for T

Source§

#### const ALIGN: Alignment

Alignment of `Self`.
Source§

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

Source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
Source§

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

Source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

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

Source§

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

Equivalent to `f(&iter.collect::<Vec<_>>())`.

Source§

#### type Output = R

Source§

### impl<T> From<T> for T

Source§

#### fn from(t: T) -> T

Returns the argument unchanged.

Source§

### impl<T> Instrument for T

Source§

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

Instruments this type with the provided `Span`, returning an `Instrumented` wrapper. Read more
Source§

#### fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current `Span`, returning an `Instrumented` wrapper. Read more
Source§

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

Source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

Source§

### impl<T> IntoEither for T

Source§

#### 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 more
Source§

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

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 more
Source§

### impl<K> IntoQueryKey<K> for K

Source§

#### fn into_query_key(self) -> K

Argument conversion from `Self` to `K`. This should always be a very cheap conversion, e.g. `LocalDefId::to_def_id`.
Source§

### impl<T> MaybeResult<T> for T

Source§

#### type Error = !

Source§

#### fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

Source§

#### fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

Source§

### impl<T> Pointable for T

Source§

#### const ALIGN: usize

The alignment of pointer.
Source§

#### type Init = T

The type for initializers.
Source§

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

Initializes a with the given initializer. Read more
Source§

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

Dereferences the given pointer. Read more
Source§

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

Mutably dereferences the given pointer. Read more
Source§

#### unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

### impl<T> Same for T

Source§

#### type Output = T

Should always be `Self`
Source§

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

Source§

#### type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

#### fn vzip(self) -> V

Source§

### impl<T> WithSubscriber for T

Source§

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

Attaches the provided `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

#### fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

### impl<T> ErasedDestructor for T
where 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: 632 bytes