ProjectionCache in rustc_infer::traits::project - Rust
Description: The projection cache. Unlike the standard caches, this can include infcx-dependent type variables, therefore we have to roll the cache back each time we roll a snapshot back, to avoid assumptions on yet-unresolved inference variables. Types with placeholder regions also have to be removed when the respective snapshot ends.

Skip to main content

## ProjectionCache

# Struct ProjectionCache

Source

    pub struct ProjectionCache<'a, 'tcx> {
        map: &'a mut SnapshotMapStorage<ProjectionCacheKey<'tcx>, ProjectionCacheEntry<'tcx>>,
        undo_log: &'a mut InferCtxtUndoLogs<'tcx>,
    }

Expand description

The projection cache. Unlike the standard caches, this can include infcx-dependent type variables, therefore we have to roll the cache back each time we roll a snapshot back, to avoid assumptions on yet-unresolved inference variables. Types with placeholder regions also have to be removed when the respective snapshot ends.

Because of that, projection cache entries can be “stranded” and left inaccessible when type variables inside the key are resolved. We make no attempt to recover or remove “stranded” entries, but rather let them be (for the lifetime of the infcx).

Entries in the projection cache might contain inference variables that will be resolved by obligations on the projection cache entry (e.g., when a type parameter in the associated type is constrained through an “RFC 447” projection on the impl).

When working with a fulfillment context, the derived obligations of each projection cache entry will be registered on the fulfillcx, so any users that can wait for a fulfillcx fixed point need not care about this. However, users that don’t wait for a fixed point (e.g., trait evaluation) have to resolve the obligations themselves to make sure the projected result is ok and avoid issues like #43132.

If that is done, after evaluation the obligations, it is a good idea to call `ProjectionCache::complete` to make sure the obligations won’t be re-evaluated and avoid an exponential worst-case.

## Fields§

§`map: &'a mut SnapshotMapStorage<ProjectionCacheKey<'tcx>, ProjectionCacheEntry<'tcx>>`§`undo_log: &'a mut InferCtxtUndoLogs<'tcx>`

## Implementations§

Source§

### impl<'tcx> ProjectionCache<'_, 'tcx>

Source

#### fn map( &mut self, ) -> SnapshotMapRef<'_, ProjectionCacheKey<'tcx>, ProjectionCacheEntry<'tcx>, InferCtxtUndoLogs<'tcx>>

Source

#### pub fn clear(&mut self)

Source

#### pub fn try_start( &mut self, key: ProjectionCacheKey<'tcx>, ) -> Result<(), ProjectionCacheEntry<'tcx>>

Try to start normalize `key`; returns an error if normalization already occurred (this error corresponds to a cache hit, so it’s actually a good thing).

Source

#### pub fn insert_term( &mut self, key: ProjectionCacheKey<'tcx>, value: NormalizedTerm<'tcx>, )

Indicates that `key` was normalized to `value`.

Source

#### pub fn complete( &mut self, key: ProjectionCacheKey<'tcx>, result: EvaluationResult, )

Mark the relevant projection cache key as having its derived obligations complete, so they won’t have to be re-computed (this is OK to do in a snapshot - if the snapshot is rolled back, the obligations will be marked as incomplete again).

Source

#### pub fn is_complete( &mut self, key: ProjectionCacheKey<'tcx>, ) -> Option<EvaluationResult>

Source

#### pub fn ambiguous(&mut self, key: ProjectionCacheKey<'tcx>)

Indicates that trying to normalize `key` resulted in ambiguity. No point in trying it again then until we gain more type information (in which case, the “fully resolved” key will be different).

Source

#### pub fn recur(&mut self, key: ProjectionCacheKey<'tcx>)

Indicates that while trying to normalize `key`, `key` was required to be normalized again. Selection or evaluation should eventually report an error here.

Source

#### pub fn error(&mut self, key: ProjectionCacheKey<'tcx>)

Indicates that trying to normalize `key` resulted in error.

## Auto Trait Implementations§

§

### impl<'a, 'tcx> !RefUnwindSafe for ProjectionCache<'a, 'tcx>

§

### impl<'a, 'tcx> !UnwindSafe for ProjectionCache<'a, 'tcx>

§

### impl<'a, 'tcx> DynSend for ProjectionCache<'a, 'tcx>

§

### impl<'a, 'tcx> DynSync for ProjectionCache<'a, 'tcx>

§

### impl<'a, 'tcx> Freeze for ProjectionCache<'a, 'tcx>

§

### impl<'a, 'tcx> Send for ProjectionCache<'a, 'tcx>

§

### impl<'a, 'tcx> Sync for ProjectionCache<'a, 'tcx>

§

### impl<'a, 'tcx> Unpin for ProjectionCache<'a, 'tcx>

§

### impl<'a, 'tcx> UnsafeUnpin for ProjectionCache<'a, 'tcx>

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