Struct rustc_query_system::dep_graph::graph::DepGraphData

struct DepGraphData<K: DepKind> {
    current: CurrentDepGraph<K>,
    previous: SerializedDepGraph<K>,
    colors: DepNodeColorMap,
    processed_side_effects: Mutex<FxHashSet<DepNodeIndex>>,
    previous_work_products: FxHashMap<WorkProductId, WorkProduct>,
    dep_node_debug: Lock<FxHashMap<DepNode<K>, String>>,
    debug_loaded_from_disk: Lock<FxHashSet<DepNode<K>>>,
}

Fields

current: CurrentDepGraph<K>

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: SerializedDepGraph<K>

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

processed_side_effects: Mutex<FxHashSet<DepNodeIndex>>

previous_work_products: FxHashMap<WorkProductId, WorkProduct>

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<K>, String>>

debug_loaded_from_disk: Lock<FxHashSet<DepNode<K>>>

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

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: 800 bytes