1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125
// Copyright 2014 The Rust Project Developers. See the COPYRIGHT // file at the top-level directory of this distribution and at // http://rust-lang.org/COPYRIGHT. // // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your // option. This file may not be copied, modified, or distributed // except according to those terms. //! The data that we will serialize and deserialize. use rustc::dep_graph::{DepNode, WorkProduct, WorkProductId}; use rustc::hir::def_id::DefIndex; use std::sync::Arc; use rustc_data_structures::fx::FxHashMap; use ich::Fingerprint; use super::directory::DefPathIndex; /// Data for use when recompiling the **current crate**. #[derive(Debug, RustcEncodable, RustcDecodable)] pub struct SerializedDepGraph { pub edges: Vec<SerializedEdgeSet>, /// These are output nodes that have no incoming edges. We track /// these separately so that when we reload all edges, we don't /// lose track of these nodes. pub bootstrap_outputs: Vec<DepNode<DefPathIndex>>, /// These are hashes of two things: /// - the HIR nodes in this crate /// - the metadata nodes from dependent crates we use /// /// In each case, we store a hash summarizing the contents of /// those items as they were at the time we did this compilation. /// In the case of HIR nodes, this hash is derived by walking the /// HIR itself. In the case of metadata nodes, the hash is loaded /// from saved state. /// /// When we do the next compile, we will load these back up and /// compare them against the hashes we see at that time, which /// will tell us what has changed, either in this crate or in some /// crate that we depend on. /// /// Because they will be reloaded, we don't store the DefId (which /// will be different when we next compile) related to each node, /// but rather the `DefPathIndex`. This can then be retraced /// to find the current def-id. pub hashes: Vec<SerializedHash>, } /// Represents a set of "reduced" dependency edge. We group the /// outgoing edges from a single source together. #[derive(Debug, RustcEncodable, RustcDecodable)] pub struct SerializedEdgeSet { pub source: DepNode<DefPathIndex>, pub targets: Vec<DepNode<DefPathIndex>> } #[derive(Debug, RustcEncodable, RustcDecodable)] pub struct SerializedHash { /// def-id of thing being hashed pub dep_node: DepNode<DefPathIndex>, /// the hash as of previous compilation, computed by code in /// `hash` module pub hash: Fingerprint, } #[derive(Debug, RustcEncodable, RustcDecodable)] pub struct SerializedWorkProduct { /// node that produced the work-product pub id: Arc<WorkProductId>, /// work-product data itself pub work_product: WorkProduct, } /// Data for use when downstream crates get recompiled. #[derive(Debug, RustcEncodable, RustcDecodable)] pub struct SerializedMetadataHashes { /// For each def-id defined in this crate that appears in the /// metadata, we hash all the inputs that were used when producing /// the metadata. We save this after compilation is done. Then, /// when some downstream crate is being recompiled, it can compare /// the hashes we saved against the hashes that it saw from /// before; this will tell it which of the items in this crate /// changed, which in turn implies what items in the downstream /// crate need to be recompiled. /// /// Note that we store the def-ids here. This is because we don't /// reload this file when we recompile this crate, we will just /// regenerate it completely with the current hashes and new def-ids. /// /// Then downstream creates will load up their /// `SerializedDepGraph`, which may contain `MetaData(X)` nodes /// where `X` refers to some item in this crate. That `X` will be /// a `DefPathIndex` that gets retracted to the current `DefId` /// (matching the one found in this structure). pub hashes: Vec<SerializedMetadataHash>, /// For each DefIndex (as it occurs in SerializedMetadataHash), this /// map stores the DefPathIndex (as it occurs in DefIdDirectory), so /// that we can find the new DefId for a SerializedMetadataHash in a /// subsequent compilation session. /// /// This map is only needed for running auto-tests using the /// #[rustc_metadata_dirty] and #[rustc_metadata_clean] attributes, and /// is only populated if -Z query-dep-graph is specified. It will be /// empty otherwise. Importing crates are perfectly happy with just having /// the DefIndex. pub index_map: FxHashMap<DefIndex, DefPathIndex> } /// The hash for some metadata that (when saving) will be exported /// from this crate, or which (when importing) was exported by an /// upstream crate. #[derive(Debug, RustcEncodable, RustcDecodable)] pub struct SerializedMetadataHash { pub def_index: DefIndex, /// the hash itself, computed by `calculate_item_hash` pub hash: Fingerprint, }