Struct rustc_middle::traits::solve::EvaluationCache
source · pub struct EvaluationCache<'tcx> {
map: Lock<FxHashMap<CanonicalInput<'tcx>, CacheEntry<'tcx>>>,
}
Expand description
The trait solver cache used by -Ztrait-solver=next
.
FIXME(@lcnr): link to some official documentation of how this works.
Fields§
§map: Lock<FxHashMap<CanonicalInput<'tcx>, CacheEntry<'tcx>>>
Implementations§
source§impl<'tcx> EvaluationCache<'tcx>
impl<'tcx> EvaluationCache<'tcx>
sourcepub fn insert(
&self,
key: CanonicalInput<'tcx>,
reached_depth: usize,
did_overflow: bool,
cycle_participants: FxHashSet<CanonicalInput<'tcx>>,
dep_node: DepNodeIndex,
result: QueryResult<'tcx>
)
pub fn insert( &self, key: CanonicalInput<'tcx>, reached_depth: usize, did_overflow: bool, cycle_participants: FxHashSet<CanonicalInput<'tcx>>, dep_node: DepNodeIndex, result: QueryResult<'tcx> )
Insert a final result into the global cache.
sourcepub fn get(
&self,
tcx: TyCtxt<'tcx>,
key: CanonicalInput<'tcx>,
cycle_participant_in_stack: impl FnOnce(&FxHashSet<CanonicalInput<'tcx>>) -> bool,
available_depth: Limit
) -> Option<CacheData<'tcx>>
pub fn get( &self, tcx: TyCtxt<'tcx>, key: CanonicalInput<'tcx>, cycle_participant_in_stack: impl FnOnce(&FxHashSet<CanonicalInput<'tcx>>) -> bool, available_depth: Limit ) -> Option<CacheData<'tcx>>
Try to fetch a cached result, checking the recursion limit and handling root goals of coinductive cycles.
If this returns Some
the cache result can be used.
Trait Implementations§
source§impl<'tcx> Default for EvaluationCache<'tcx>
impl<'tcx> Default for EvaluationCache<'tcx>
source§fn default() -> EvaluationCache<'tcx>
fn default() -> EvaluationCache<'tcx>
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for EvaluationCache<'tcx>
impl<'tcx> !Send for EvaluationCache<'tcx>
impl<'tcx> !Sync for EvaluationCache<'tcx>
impl<'tcx> Unpin for EvaluationCache<'tcx>
impl<'tcx> !UnwindSafe for EvaluationCache<'tcx>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle: &[QueryInfo], _guar: ErrorGuaranteed ) -> T
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: 40 bytes