Skip to main content

## StableHashState

# Struct StableHashState

Source

    pub struct StableHashState<'a> {
        untracked: &'a Untracked,
        incremental_ignore_spans: bool,
        caching_source_map: CachingSourceMap<'a>,
        stable_hash_controls: StableHashControls,
    }

Expand description

This is the context state available during incr. comp. hashing. It contains enough information to transform `DefId`s and `HirId`s into stable `DefPath`s (i.e., a reference to the `TyCtxt`) and it holds a few caches for speeding up various things (e.g., each `DefId`/`DefPath` is only hashed once).

## Fields§

§`untracked: &'a Untracked`§`incremental_ignore_spans: bool`§`caching_source_map: CachingSourceMap<'a>`§`stable_hash_controls: StableHashControls`

## Implementations§

Source§

### impl<'a> StableHashState<'a>

Source

#### pub fn new(sess: &'a Session, untracked: &'a Untracked) -> Self

Source

#### pub fn while_hashing_spans<F: FnOnce(&mut Self)>( &mut self, hash_spans: bool, f: F, )

Source

#### fn source_map(&mut self) -> &mut CachingSourceMapView<'a>

Source

#### fn def_span(&self, def_id: LocalDefId) -> Span

Source

#### pub fn stable_hash_controls(&self) -> StableHashControls

## Trait Implementations§

Source§

### impl<'a> StableHashCtxt for StableHashState<'a>

Source§

#### fn stable_hash_span(&mut self, raw_span: RawSpan, hasher: &mut StableHasher)

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) triple, which stays the same even if the containing `SourceFile` has moved within the `SourceMap`.

Also note that we are hashing byte offsets for the column, not unicode 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.

IMPORTANT: changes to this method should be reflected in implementations of `SpanEncoder`.

Source§

#### fn assert_default_stable_hash_controls(&self, msg: &str)

Assert that the provided `StableHashCtxt` is configured with the default `StableHashControls`. We should always have bailed out before getting to here with a non-default mode. With this check in place, we can avoid the need to maintain separate versions of `ExpnData` hashes for each permutation of `StableHashControls` settings.

Source§

#### fn def_path_hash(&self, raw_def_id: RawDefId) -> RawDefPathHash

Compute a `DefPathHash`.
Source§

#### fn stable_hash_controls(&self) -> StableHashControls

Get the stable hash controls.

## Auto Trait Implementations§

§

### impl<'a> !RefUnwindSafe for StableHashState<'a>

§

### impl<'a> !Send for StableHashState<'a>

§

### impl<'a> !Sync for StableHashState<'a>

§

### impl<'a> !UnwindSafe for StableHashState<'a>

§

### impl<'a> DynSend for StableHashState<'a>

§

### impl<'a> DynSync for StableHashState<'a>

§

### impl<'a> Freeze for StableHashState<'a>

§

### impl<'a> Unpin for StableHashState<'a>

§

### impl<'a> UnsafeUnpin for StableHashState<'a>

## 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> ErasedDestructor for T
where T: 'static,

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

## 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: 48 bytes