pub(super) struct SearchGraph<I: Interner> {
    mode: SolverMode,
    stack: IndexVec<StackDepth, StackEntry<I>>,
    provisional_cache: FxHashMap<CanonicalInput<I>, ProvisionalCacheEntry<I>>,
}

Fields§

§mode: SolverMode§stack: IndexVec<StackDepth, StackEntry<I>>

The stack of goals currently being computed.

An element is deeper in the stack if its index is lower.

§provisional_cache: FxHashMap<CanonicalInput<I>, ProvisionalCacheEntry<I>>

Implementations§

source§

impl<I: Interner> SearchGraph<I>

source

pub(super) fn new(mode: SolverMode) -> SearchGraph<I>

source

pub(super) fn solver_mode(&self) -> SolverMode

source

fn pop_stack(&mut self) -> StackEntry<I>

Pops the highest goal from the stack, lazily updating the the next goal in the stack.

Directly popping from the stack instead of using this method would cause us to not track overflow and recursion depth correctly.

source

pub(super) fn is_empty(&self) -> bool

source

fn allowed_depth_for_nested( tcx: I, stack: &IndexVec<StackDepth, StackEntry<I>> ) -> Option<Limit>

Returns the remaining depth allowed for nested goals.

This is generally simply one less than the current depth. However, if we encountered overflow, we significantly reduce the remaining depth of all nested goals to prevent hangs in case there is exponential blowup.

source

fn stack_coinductive_from( tcx: I, stack: &IndexVec<StackDepth, StackEntry<I>>, head: StackDepth ) -> bool

source

fn tag_cycle_participants( stack: &mut IndexVec<StackDepth, StackEntry<I>>, usage_kind: HasBeenUsed, head: StackDepth )

source

fn clear_dependent_provisional_results( provisional_cache: &mut FxHashMap<CanonicalInput<I>, ProvisionalCacheEntry<I>>, head: StackDepth )

source§

impl<'tcx> SearchGraph<TyCtxt<'tcx>>

source

pub(super) fn global_cache( &self, tcx: TyCtxt<'tcx> ) -> &'tcx EvaluationCache<'tcx>

The trait solver behavior is different for coherence so we use a separate cache. Alternatively we could use a single cache and share it between coherence and ordinary trait solving.

source

pub(super) fn with_new_goal( &mut self, tcx: TyCtxt<'tcx>, input: CanonicalInput<TyCtxt<'tcx>>, inspect: &mut ProofTreeBuilder<TyCtxt<'tcx>>, prove_goal: impl FnMut(&mut Self, &mut ProofTreeBuilder<TyCtxt<'tcx>>) -> QueryResult<TyCtxt<'tcx>> ) -> QueryResult<TyCtxt<'tcx>>

Probably the most involved method of the whole solver.

Given some goal which is proven via the prove_goal closure, this handles caching, overflow, and coinductive cycles.

source

fn lookup_global_cache( &mut self, tcx: TyCtxt<'tcx>, input: CanonicalInput<TyCtxt<'tcx>>, available_depth: Limit, inspect: &mut ProofTreeBuilder<TyCtxt<'tcx>> ) -> Option<QueryResult<TyCtxt<'tcx>>>

Try to fetch a previously computed result from the global cache, making sure to only do so if it would match the result of reevaluating this goal.

source§

impl<'tcx> SearchGraph<TyCtxt<'tcx>>

source

fn fixpoint_step_in_task<F>( &mut self, tcx: TyCtxt<'tcx>, input: CanonicalInput<TyCtxt<'tcx>>, inspect: &mut ProofTreeBuilder<TyCtxt<'tcx>>, prove_goal: &mut F ) -> StepResult<TyCtxt<'tcx>>
where F: FnMut(&mut Self, &mut ProofTreeBuilder<TyCtxt<'tcx>>) -> QueryResult<TyCtxt<'tcx>>,

When we encounter a coinductive cycle, we have to fetch the result of that cycle while we are still computing it. Because of this we continuously recompute the cycle until the result of the previous iteration is equal to the final result, at which point we are done.

source

fn response_no_constraints( tcx: TyCtxt<'tcx>, goal: CanonicalInput<TyCtxt<'tcx>>, certainty: Certainty ) -> QueryResult<TyCtxt<'tcx>>

source§

impl<I: Interner> SearchGraph<I>

Auto Trait Implementations§

§

impl<I> DynSend for SearchGraph<I>

§

impl<I> DynSync for SearchGraph<I>

§

impl<I> Freeze for SearchGraph<I>

§

impl<I> RefUnwindSafe for SearchGraph<I>

§

impl<I> Send for SearchGraph<I>

§

impl<I> Sync for SearchGraph<I>

§

impl<I> Unpin for SearchGraph<I>

§

impl<I> UnwindSafe for SearchGraph<I>

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<_>>()).

§

type Output = R

source§

impl<T> Filterable for T

source§

fn filterable( self, filter_name: &'static str ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
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<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

§

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.
§

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

§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

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>,

§

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<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> T

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
source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for T
where T: Send + Sync,

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: 64 bytes