The crate hash is needed: - if debug assertions are enabled, or - if incr. comp. is enabled, or - if metadata is being generated, or - if `-C instrumentation-coverage` is enabled. This commit avoids computing the crate hash when these conditions are all false, such as when doing a release build of a binary crate. It uses `Option` to store the hashes when needed, rather than computing them on demand, because some of them are needed in multiple places and computing them on demand would make compilation slower. The commit also removes `Owner::hash_without_bodies`. There is no benefit to pre-computing that one, it can just be done in the normal fashion.
123 lines
4.4 KiB
Rust
123 lines
4.4 KiB
Rust
use rustc_data_structures::stable_hasher::{HashStable, StableHasher, ToStableHashKey};
|
|
|
|
use crate::hir::{
|
|
AttributeMap, BodyId, Crate, ForeignItemId, ImplItemId, ItemId, OwnerNodes, TraitItemId,
|
|
};
|
|
use crate::hir_id::{HirId, ItemLocalId};
|
|
use rustc_span::def_id::DefPathHash;
|
|
|
|
/// Requirements for a `StableHashingContext` to be used in this crate.
|
|
/// This is a hack to allow using the `HashStable_Generic` derive macro
|
|
/// instead of implementing everything in `rustc_middle`.
|
|
pub trait HashStableContext:
|
|
rustc_ast::HashStableContext + rustc_target::HashStableContext
|
|
{
|
|
fn hash_body_id(&mut self, _: BodyId, hasher: &mut StableHasher);
|
|
}
|
|
|
|
impl<HirCtx: crate::HashStableContext> ToStableHashKey<HirCtx> for HirId {
|
|
type KeyType = (DefPathHash, ItemLocalId);
|
|
|
|
#[inline]
|
|
fn to_stable_hash_key(&self, hcx: &HirCtx) -> (DefPathHash, ItemLocalId) {
|
|
let def_path_hash = self.owner.def_id.to_stable_hash_key(hcx);
|
|
(def_path_hash, self.local_id)
|
|
}
|
|
}
|
|
|
|
impl<HirCtx: crate::HashStableContext> ToStableHashKey<HirCtx> for ItemLocalId {
|
|
type KeyType = ItemLocalId;
|
|
|
|
#[inline]
|
|
fn to_stable_hash_key(&self, _: &HirCtx) -> ItemLocalId {
|
|
*self
|
|
}
|
|
}
|
|
|
|
impl<HirCtx: crate::HashStableContext> ToStableHashKey<HirCtx> for BodyId {
|
|
type KeyType = (DefPathHash, ItemLocalId);
|
|
|
|
#[inline]
|
|
fn to_stable_hash_key(&self, hcx: &HirCtx) -> (DefPathHash, ItemLocalId) {
|
|
let BodyId { hir_id } = *self;
|
|
hir_id.to_stable_hash_key(hcx)
|
|
}
|
|
}
|
|
|
|
impl<HirCtx: crate::HashStableContext> ToStableHashKey<HirCtx> for ItemId {
|
|
type KeyType = DefPathHash;
|
|
|
|
#[inline]
|
|
fn to_stable_hash_key(&self, hcx: &HirCtx) -> DefPathHash {
|
|
self.owner_id.def_id.to_stable_hash_key(hcx)
|
|
}
|
|
}
|
|
|
|
impl<HirCtx: crate::HashStableContext> ToStableHashKey<HirCtx> for TraitItemId {
|
|
type KeyType = DefPathHash;
|
|
|
|
#[inline]
|
|
fn to_stable_hash_key(&self, hcx: &HirCtx) -> DefPathHash {
|
|
self.owner_id.def_id.to_stable_hash_key(hcx)
|
|
}
|
|
}
|
|
|
|
impl<HirCtx: crate::HashStableContext> ToStableHashKey<HirCtx> for ImplItemId {
|
|
type KeyType = DefPathHash;
|
|
|
|
#[inline]
|
|
fn to_stable_hash_key(&self, hcx: &HirCtx) -> DefPathHash {
|
|
self.owner_id.def_id.to_stable_hash_key(hcx)
|
|
}
|
|
}
|
|
|
|
impl<HirCtx: crate::HashStableContext> ToStableHashKey<HirCtx> for ForeignItemId {
|
|
type KeyType = DefPathHash;
|
|
|
|
#[inline]
|
|
fn to_stable_hash_key(&self, hcx: &HirCtx) -> DefPathHash {
|
|
self.owner_id.def_id.to_stable_hash_key(hcx)
|
|
}
|
|
}
|
|
|
|
impl<HirCtx: crate::HashStableContext> HashStable<HirCtx> for BodyId {
|
|
fn hash_stable(&self, hcx: &mut HirCtx, hasher: &mut StableHasher) {
|
|
hcx.hash_body_id(*self, hasher)
|
|
}
|
|
}
|
|
|
|
// The following implementations of HashStable for `ItemId`, `TraitItemId`, and
|
|
// `ImplItemId` deserve special attention. Normally we do not hash `NodeId`s within
|
|
// the HIR, since they just signify a HIR nodes own path. But `ItemId` et al
|
|
// are used when another item in the HIR is *referenced* and we certainly
|
|
// want to pick up on a reference changing its target, so we hash the NodeIds
|
|
// in "DefPath Mode".
|
|
|
|
impl<'tcx, HirCtx: crate::HashStableContext> HashStable<HirCtx> for OwnerNodes<'tcx> {
|
|
fn hash_stable(&self, hcx: &mut HirCtx, hasher: &mut StableHasher) {
|
|
// We ignore the `nodes` and `bodies` fields since these refer to information included in
|
|
// `hash` which is hashed in the collector and used for the crate hash.
|
|
// `local_id_to_def_id` is also ignored because is dependent on the body, then just hashing
|
|
// the body satisfies the condition of two nodes being different have different
|
|
// `hash_stable` results.
|
|
let OwnerNodes { opt_hash_including_bodies, nodes: _, bodies: _ } = *self;
|
|
opt_hash_including_bodies.unwrap().hash_stable(hcx, hasher);
|
|
}
|
|
}
|
|
|
|
impl<'tcx, HirCtx: crate::HashStableContext> HashStable<HirCtx> for AttributeMap<'tcx> {
|
|
fn hash_stable(&self, hcx: &mut HirCtx, hasher: &mut StableHasher) {
|
|
// We ignore the `map` since it refers to information included in `opt_hash` which is
|
|
// hashed in the collector and used for the crate hash.
|
|
let AttributeMap { opt_hash, map: _ } = *self;
|
|
opt_hash.unwrap().hash_stable(hcx, hasher);
|
|
}
|
|
}
|
|
|
|
impl<HirCtx: crate::HashStableContext> HashStable<HirCtx> for Crate<'_> {
|
|
fn hash_stable(&self, hcx: &mut HirCtx, hasher: &mut StableHasher) {
|
|
let Crate { owners: _, opt_hir_hash } = self;
|
|
opt_hir_hash.unwrap().hash_stable(hcx, hasher)
|
|
}
|
|
}
|