Struct rustc_trait_selection::traits::fulfill::FulfillProcessor
source · struct FulfillProcessor<'a, 'tcx> {
selcx: SelectionContext<'a, 'tcx>,
}
Fields§
§selcx: SelectionContext<'a, 'tcx>
Implementations§
source§impl<'a, 'tcx> FulfillProcessor<'a, 'tcx>
impl<'a, 'tcx> FulfillProcessor<'a, 'tcx>
fn process_trait_obligation( &mut self, obligation: &PredicateObligation<'tcx>, trait_obligation: PolyTraitObligation<'tcx>, stalled_on: &mut Vec<TyOrConstInferVar>, ) -> ProcessResult<PendingPredicateObligation<'tcx>, FulfillmentErrorCode<'tcx>>
fn process_projection_obligation( &mut self, obligation: &PredicateObligation<'tcx>, project_obligation: PolyProjectionObligation<'tcx>, stalled_on: &mut Vec<TyOrConstInferVar>, ) -> ProcessResult<PendingPredicateObligation<'tcx>, FulfillmentErrorCode<'tcx>>
Trait Implementations§
source§impl<'a, 'tcx> ObligationProcessor for FulfillProcessor<'a, 'tcx>
impl<'a, 'tcx> ObligationProcessor for FulfillProcessor<'a, 'tcx>
source§fn skippable_obligations<'b>(
&'b self,
it: impl Iterator<Item = &'b Self::Obligation>,
) -> usize
fn skippable_obligations<'b>( &'b self, it: impl Iterator<Item = &'b Self::Obligation>, ) -> usize
Compared to needs_process_obligation
this and its callees
contain some optimizations that come at the price of false negatives.
They
- reduce branching by covering only the most common case
- take a read-only view of the unification tables which allows skipping undo_log construction.
- bail out on value-cache misses in ena to avoid pointer chasing
- hoist RefCell locking out of the loop
source§fn needs_process_obligation(
&self,
pending_obligation: &Self::Obligation,
) -> bool
fn needs_process_obligation( &self, pending_obligation: &Self::Obligation, ) -> bool
Identifies whether a predicate obligation needs processing.
This is always inlined because it has a single callsite and it is called very frequently. Be careful modifying this code! Several compile-time benchmarks are very sensitive to even small changes.
source§fn process_obligation(
&mut self,
pending_obligation: &mut PendingPredicateObligation<'tcx>,
) -> ProcessResult<PendingPredicateObligation<'tcx>, FulfillmentErrorCode<'tcx>>
fn process_obligation( &mut self, pending_obligation: &mut PendingPredicateObligation<'tcx>, ) -> ProcessResult<PendingPredicateObligation<'tcx>, FulfillmentErrorCode<'tcx>>
Processes a predicate obligation and returns either:
Changed(v)
if the predicate is true, presuming thatv
are also trueUnchanged
if we don’t have enough info to be sureError(e)
if the predicate does not hold
This is called much less often than needs_process_obligation
, so we
never inline it.
type Obligation = PendingPredicateObligation<'tcx>
type Error = FulfillmentErrorCode<'tcx>
type OUT = Outcome<PendingPredicateObligation<'tcx>, FulfillmentErrorCode<'tcx>>
source§fn process_backedge<'c, I>(
&mut self,
cycle: I,
_marker: PhantomData<&'c PendingPredicateObligation<'tcx>>,
) -> Result<(), FulfillmentErrorCode<'tcx>>
fn process_backedge<'c, I>( &mut self, cycle: I, _marker: PhantomData<&'c PendingPredicateObligation<'tcx>>, ) -> Result<(), FulfillmentErrorCode<'tcx>>
cycle
is an iterator that starts
at the start of the cycle in the stack and walks toward the
top. Read moreAuto Trait Implementations§
impl<'a, 'tcx> Freeze for FulfillProcessor<'a, 'tcx>
impl<'a, 'tcx> !RefUnwindSafe for FulfillProcessor<'a, 'tcx>
impl<'a, 'tcx> !Send for FulfillProcessor<'a, 'tcx>
impl<'a, 'tcx> !Sync for FulfillProcessor<'a, 'tcx>
impl<'a, 'tcx> Unpin for FulfillProcessor<'a, 'tcx>
impl<'a, 'tcx> !UnwindSafe for FulfillProcessor<'a, '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
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moresource§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<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> 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_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
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 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: 152 bytes