Struct rustc_trait_selection::solve::search_graph::StackEntry

source ·

struct StackEntry<'tcx> {
    input: CanonicalInput<'tcx>,
    available_depth: Limit,
    reached_depth: StackDepth,
    non_root_cycle_participant: Option<StackDepth>,
    encountered_overflow: bool,
    has_been_used: HasBeenUsed,
    provisional_result: Option<QueryResult<'tcx>>,
}

Fields§

§input: CanonicalInput<'tcx>§available_depth: Limit§reached_depth: StackDepth

The maximum depth reached by this stack entry, only up-to date for the top of the stack and lazily updated for the rest.

§non_root_cycle_participant: Option<StackDepth>

Whether this entry is a non-root cycle participant.

We must not move the result of non-root cycle participants to the global cache. See SearchGraph::cycle_participants for more details. We store the highest stack depth of a head of a cycle this goal is involved in. This necessary to soundly cache its provisional result.

§encountered_overflow: bool§has_been_used: HasBeenUsed§provisional_result: Option<QueryResult<'tcx>>

Starts out as None and gets set when rerunning this goal in case we encounter a cycle.

Struct rustc_trait_selection::solve::search_graph::StackEntry

Fields§

Trait Implementations§

impl<'tcx> Debug for StackEntry<'tcx>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Auto Trait Implementations§

impl<'tcx> DynSend for StackEntry<'tcx>

impl<'tcx> DynSync for StackEntry<'tcx>

impl<'tcx> Freeze for StackEntry<'tcx>

impl<'tcx> !RefUnwindSafe for StackEntry<'tcx>

impl<'tcx> Send for StackEntry<'tcx>

impl<'tcx> Sync for StackEntry<'tcx>

impl<'tcx> Unpin for StackEntry<'tcx>

impl<'tcx> !UnwindSafe for StackEntry<'tcx>

Blanket Implementations§

impl<T> Aligned for T

const ALIGN: Alignment = _

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T, R> CollectAndApply<T, R> for T

fn collect_and_apply<I, F>(iter: I, f: F) -> Rwhere I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

type Output = R

impl<T> Filterable for T

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

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<P> IntoQueryParam<P> for P

fn into_query_param(self) -> P

impl<T> MaybeResult<T> for T

type Error = !

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

impl<T> Pointable for T

const ALIGN: usize = _

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> Same for T

type Output = T

impl<'tcx, T> ToPredicate<'tcx, T> for T

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

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

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

fn vzip(self) -> V

impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,

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

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

fn with_current_subscriber(self) -> WithDispatch<Self>

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

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

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

Layout§

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

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

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

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

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

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

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

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