pub struct RegionConstraintCollector<'a, 'tcx> {
    storage: &'a mut RegionConstraintStorage<'tcx>,
    undo_log: &'a mut InferCtxtUndoLogs<'tcx>,
}

Fields§

§storage: &'a mut RegionConstraintStorage<'tcx>§undo_log: &'a mut InferCtxtUndoLogs<'tcx>

Implementations§

source§

impl<'tcx> RegionConstraintCollector<'_, 'tcx>

source

pub fn leak_check( &mut self, tcx: TyCtxt<'tcx>, outer_universe: UniverseIndex, max_universe: UniverseIndex, only_consider_snapshot: Option<&CombinedSnapshot<'tcx>> ) -> RelateResult<'tcx, ()>

Searches new universes created during snapshot, looking for placeholders that may “leak” out from the universes they are contained in. If any leaking placeholders are found, then an Err is returned (typically leading to the snapshot being reversed). This algorithm only looks at placeholders which cannot be named by outer_universe, as this is the universe we’re currently checking for a leak.

The leak check used to be the only way we had to handle higher-ranked obligations. Now that we have integrated universes into the region solvers, this is no longer the case, but we retain the leak check for backwards compatibility purposes. In particular, it lets us make “early” decisions about whether a region error will be reported that are used in coherence and elsewhere – see #56105 and #59490 for more details. The eventual fate of the leak checker is not yet settled.

The leak checker works by searching for the following error patterns:

  • P1: P2, where P1 != P2
  • P1: R, where R is in some universe that cannot name P1

The idea here is that each of these patterns represents something that the region solver would eventually report as an error, so we can detect the error early. There is a fly in the ointment, though, in that this is not entirely true. In particular, in the future, we may extend the environment with implied bounds or other info about how placeholders relate to regions in outer universes. In that case, P1: R for example might become solvable.

§Summary of the implementation

The leak checks as follows. First, we construct a graph where R2: R1 implies R2 -> R1, and we compute the SCCs.

For each SCC S, we compute:

  • what placeholder P it must be equal to, if any
    • if there are multiple placeholders that must be equal, report an error because P1: P2
  • the minimum universe of its constituents

Then we walk the SCCs in dependency order and compute

  • what placeholder they must outlive transitively
    • if they must also be equal to a placeholder, report an error because P1: P2
  • minimum universe U of all SCCs they must outlive
    • if they must also be equal to a placeholder P, and U cannot name P, report an error, as that indicates P: R and R is in an incompatible universe

To improve performance and for the old trait solver caching to be sound, this takes an optional snapshot in which case we only look at region constraints added in that snapshot. If we were to not do that the leak_check during evaluation can rely on region constraints added outside of that evaluation. As that is not reflected in the cache key this would be unsound.

§Historical note

Older variants of the leak check used to report errors for these patterns, but we no longer do:

  • R: P1, even if R cannot name P1, because R = ’static is a valid sol’n
  • R: P1, R: P2, as above
source§

impl<'tcx> RegionConstraintCollector<'_, 'tcx>

source

pub fn num_region_vars(&self) -> usize

source

pub fn region_constraint_data(&self) -> &RegionConstraintData<'tcx>

source

pub fn into_infos_and_data(self) -> (VarInfos, RegionConstraintData<'tcx>)

Once all the constraints have been gathered, extract out the final data.

Not legal during a snapshot.

source

pub fn take_and_reset_data(&mut self) -> RegionConstraintData<'tcx>

Takes (and clears) the current set of constraints. Note that the set of variables remains intact, but all relationships between them are reset. This is used during NLL checking to grab the set of constraints that arose from a particular operation.

We don’t want to leak relationships between variables between points because just because (say) r1 == r2 was true at some point P in the graph doesn’t imply that it will be true at some other point Q, in NLL.

Not legal during a snapshot.

source

pub fn data(&self) -> &RegionConstraintData<'tcx>

source

pub(super) fn start_snapshot(&mut self) -> RegionSnapshot

source

pub(super) fn rollback_to(&mut self, snapshot: RegionSnapshot)

source

pub(super) fn new_region_var( &mut self, universe: UniverseIndex, origin: RegionVariableOrigin ) -> RegionVid

source

pub(super) fn var_origin(&self, vid: RegionVid) -> RegionVariableOrigin

Returns the origin for the given variable.

source

fn add_constraint( &mut self, constraint: Constraint<'tcx>, origin: SubregionOrigin<'tcx> )

source

fn add_verify(&mut self, verify: Verify<'tcx>)

source

pub(super) fn make_eqregion( &mut self, origin: SubregionOrigin<'tcx>, a: Region<'tcx>, b: Region<'tcx> )

source

pub(super) fn member_constraint( &mut self, key: OpaqueTypeKey<'tcx>, definition_span: Span, hidden_ty: Ty<'tcx>, member_region: Region<'tcx>, choice_regions: &Lrc<Vec<Region<'tcx>>> )

source

pub(super) fn make_subregion( &mut self, origin: SubregionOrigin<'tcx>, sub: Region<'tcx>, sup: Region<'tcx> )

source

pub(super) fn verify_generic_bound( &mut self, origin: SubregionOrigin<'tcx>, kind: GenericKind<'tcx>, sub: Region<'tcx>, bound: VerifyBound<'tcx> )

source

pub(super) fn lub_regions( &mut self, tcx: TyCtxt<'tcx>, origin: SubregionOrigin<'tcx>, a: Region<'tcx>, b: Region<'tcx> ) -> Region<'tcx>

source

pub(super) fn glb_regions( &mut self, tcx: TyCtxt<'tcx>, origin: SubregionOrigin<'tcx>, a: Region<'tcx>, b: Region<'tcx> ) -> Region<'tcx>

source

pub fn opportunistic_resolve_var( &mut self, tcx: TyCtxt<'tcx>, vid: RegionVid ) -> Region<'tcx>

Resolves a region var to its value in the unification table, if it exists. Otherwise, it is resolved to the root ReVar in the table.

source

pub fn probe_value( &mut self, vid: RegionVid ) -> Result<Region<'tcx>, UniverseIndex>

source

fn combine_map( &mut self, t: CombineMapType ) -> &mut FxHashMap<TwoRegions<'tcx>, RegionVid>

source

fn combine_vars( &mut self, tcx: TyCtxt<'tcx>, t: CombineMapType, a: Region<'tcx>, b: Region<'tcx>, origin: SubregionOrigin<'tcx> ) -> Region<'tcx>

source

pub fn universe(&mut self, region: Region<'tcx>) -> UniverseIndex

source

pub fn vars_since_snapshot( &self, value_count: usize ) -> (Range<RegionVid>, Vec<RegionVariableOrigin>)

source

pub fn region_constraints_added_in_snapshot( &self, mark: &Snapshot<'tcx> ) -> bool

See InferCtxt::region_constraints_added_in_snapshot.

source

fn unification_table_mut( &mut self ) -> UnificationTable<InPlace<RegionVidKey<'tcx>, &'_ mut UnificationStorage<RegionVidKey<'tcx>>, &'_ mut InferCtxtUndoLogs<'tcx>>>

Methods from Deref<Target = RegionConstraintStorage<'tcx>>§

source

pub(crate) fn with_log<'a>( &'a mut self, undo_log: &'a mut InferCtxtUndoLogs<'tcx> ) -> RegionConstraintCollector<'a, 'tcx>

source

fn rollback_undo_entry(&mut self, undo_entry: UndoLog<'tcx>)

Trait Implementations§

source§

impl<'tcx> Deref for RegionConstraintCollector<'_, 'tcx>

§

type Target = RegionConstraintStorage<'tcx>

The resulting type after dereferencing.
source§

fn deref(&self) -> &RegionConstraintStorage<'tcx>

Dereferences the value.
source§

impl<'tcx> DerefMut for RegionConstraintCollector<'_, 'tcx>

source§

fn deref_mut(&mut self) -> &mut RegionConstraintStorage<'tcx>

Mutably dereferences the value.

Auto Trait Implementations§

§

impl<'a, 'tcx> DynSend for RegionConstraintCollector<'a, 'tcx>

§

impl<'a, 'tcx> DynSync for RegionConstraintCollector<'a, 'tcx>

§

impl<'a, 'tcx> !RefUnwindSafe for RegionConstraintCollector<'a, 'tcx>

§

impl<'a, 'tcx> Send for RegionConstraintCollector<'a, 'tcx>

§

impl<'a, 'tcx> Sync for RegionConstraintCollector<'a, 'tcx>

§

impl<'a, 'tcx> Unpin for RegionConstraintCollector<'a, 'tcx>

§

impl<'a, 'tcx> !UnwindSafe for RegionConstraintCollector<'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<_>>()).

§

type Output = R

§

impl<T> Filterable for T

§

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

§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

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

Initializes a with the given initializer. Read more
§

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

Dereferences the given pointer. Read more
§

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

Mutably dereferences the given pointer. Read more
§

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<'tcx, T> ToPredicate<'tcx, T> for T

source§

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

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

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

§

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,

§

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

§

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