Skip to content

Use proc-macro to derive HashStable everywhere #66279

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 16 commits into from
Nov 25, 2019
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 10 additions & 10 deletions src/librustc/ich/hcx.rs
Original file line number Diff line number Diff line change
Expand Up @@ -281,7 +281,7 @@ impl<'a> ToStableHashKey<StableHashingContext<'a>> for ast::NodeId {
}
}

impl<'a> HashStable<StableHashingContext<'a>> for Span {
impl<'a> syntax_pos::StableHashingContextLike for StableHashingContext<'a> {
/// Hashes a span in a stable way. We can't directly hash the span's `BytePos`
/// fields (that would be similar to hashing pointers, since those are just
/// offsets into the `SourceMap`). Instead, we hash the (file name, line, column)
Expand All @@ -291,25 +291,25 @@ impl<'a> HashStable<StableHashingContext<'a>> for Span {
/// codepoint offsets. For the purpose of the hash that's sufficient.
/// Also, hashing filenames is expensive so we avoid doing it twice when the
/// span starts and ends in the same file, which is almost always the case.
fn hash_stable(&self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher) {
fn hash_stable_span(&mut self, span: &Span, hasher: &mut StableHasher) {
const TAG_VALID_SPAN: u8 = 0;
const TAG_INVALID_SPAN: u8 = 1;
const TAG_EXPANSION: u8 = 0;
const TAG_NO_EXPANSION: u8 = 1;

if !hcx.hash_spans {
if !self.hash_spans {
return
}

if *self == DUMMY_SP {
if *span == DUMMY_SP {
return std_hash::Hash::hash(&TAG_INVALID_SPAN, hasher);
}

// If this is not an empty or invalid span, we want to hash the last
// position that belongs to it, as opposed to hashing the first
// position past it.
let span = self.data();
let (file_lo, line_lo, col_lo) = match hcx.source_map()
let span = span.data();
let (file_lo, line_lo, col_lo) = match self.source_map()
.byte_pos_to_line_and_col(span.lo) {
Some(pos) => pos,
None => {
Expand All @@ -333,9 +333,9 @@ impl<'a> HashStable<StableHashingContext<'a>> for Span {
std_hash::Hash::hash(&line_col_len, hasher);

if span.ctxt == SyntaxContext::root() {
TAG_NO_EXPANSION.hash_stable(hcx, hasher);
TAG_NO_EXPANSION.hash_stable(self, hasher);
} else {
TAG_EXPANSION.hash_stable(hcx, hasher);
TAG_EXPANSION.hash_stable(self, hasher);

// Since the same expansion context is usually referenced many
// times, we cache a stable hash of it and hash that instead of
Expand All @@ -352,14 +352,14 @@ impl<'a> HashStable<StableHashingContext<'a>> for Span {
}

let mut hasher = StableHasher::new();
expn_id.expn_data().hash_stable(hcx, &mut hasher);
expn_id.expn_data().hash_stable(self, &mut hasher);
let sub_hash: Fingerprint = hasher.finish();
let sub_hash = sub_hash.to_smaller_hash();
cache.borrow_mut().insert(expn_id, sub_hash);
sub_hash
});

sub_hash.hash_stable(hcx, hasher);
sub_hash.hash_stable(self, hasher);
}
}
}
Expand Down
1 change: 0 additions & 1 deletion src/librustc/ich/impls_syntax.rs
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,6 @@ use crate::hir::def_id::{DefId, CrateNum, CRATE_DEF_INDEX};
use smallvec::SmallVec;
use rustc_data_structures::stable_hasher::{HashStable, StableHasher};

impl<'ctx> syntax_pos::StableHashingContextLike for StableHashingContext<'ctx> {}
impl<'ctx> syntax::StableHashingContextLike for StableHashingContext<'ctx> {}
impl<'ctx> rustc_target::StableHashingContextLike for StableHashingContext<'ctx> {}

Expand Down
14 changes: 12 additions & 2 deletions src/libsyntax_pos/lib.rs
Original file line number Diff line number Diff line change
Expand Up @@ -34,7 +34,7 @@ pub use symbol::{Symbol, sym};
mod analyze_source_file;
pub mod fatal_error;

use rustc_data_structures::stable_hasher::StableHasher;
use rustc_data_structures::stable_hasher::{HashStable, StableHasher};
use rustc_data_structures::sync::{Lrc, Lock};

use std::borrow::Cow;
Expand Down Expand Up @@ -245,6 +245,14 @@ impl Ord for Span {
}
}

impl<CTX> HashStable<CTX> for Span
where CTX: StableHashingContextLike
{
fn hash_stable(&self, ctx: &mut CTX, hasher: &mut StableHasher) {
ctx.hash_stable_span(self, hasher)
}
}

/// A collection of spans. Spans have two orthogonal attributes:
///
/// - They can be *primary spans*. In this case they are the locus of
Expand Down Expand Up @@ -1566,4 +1574,6 @@ fn lookup_line(lines: &[BytePos], pos: BytePos) -> isize {
/// 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 librustc.
pub trait StableHashingContextLike {}
pub trait StableHashingContextLike {
fn hash_stable_span(&mut self, span: &Span, hasher: &mut StableHasher);
}