Struct rustc_middle::mir::ClosureRegionRequirements
source · pub struct ClosureRegionRequirements<'tcx> {
pub num_external_vids: usize,
pub outlives_requirements: Vec<ClosureOutlivesRequirement<'tcx>>,
}
Expand description
After we borrow check a closure, we are left with various requirements that we have inferred between the free regions that appear in the closure’s signature or on its field types. These requirements are then verified and proved by the closure’s creating function. This struct encodes those requirements.
The requirements are listed as being between various RegionVid
. The 0th
region refers to 'static
; subsequent region vids refer to the free
regions that appear in the closure (or coroutine’s) type, in order of
appearance. (This numbering is actually defined by the UniversalRegions
struct in the NLL region checker. See for example
UniversalRegions::closure_mapping
.) Note the free regions in the
closure’s signature and captures are erased.
Example: If type check produces a closure with the closure args:
ClosureArgs = [
'a, // From the parent.
'b,
i8, // the "closure kind"
for<'x> fn(&'<erased> &'x u32) -> &'x u32, // the "closure signature"
&'<erased> String, // some upvar
]
We would “renumber” each free region to a unique vid, as follows:
ClosureArgs = [
'1, // From the parent.
'2,
i8, // the "closure kind"
for<'x> fn(&'3 &'x u32) -> &'x u32, // the "closure signature"
&'4 String, // some upvar
]
Now the code might impose a requirement like '1: '2
. When an
instance of the closure is created, the corresponding free regions
can be extracted from its type and constrained to have the given
outlives relationship.
Fields§
§num_external_vids: usize
The number of external regions defined on the closure. In our
example above, it would be 3 – one for 'static
, then '1
and '2
. This is just used for a sanity check later on, to
make sure that the number of regions we see at the callsite
matches.
outlives_requirements: Vec<ClosureOutlivesRequirement<'tcx>>
Requirements between the various free regions defined in indices.
Trait Implementations§
source§impl<'tcx> Clone for ClosureRegionRequirements<'tcx>
impl<'tcx> Clone for ClosureRegionRequirements<'tcx>
source§fn clone(&self) -> ClosureRegionRequirements<'tcx>
fn clone(&self) -> ClosureRegionRequirements<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx> Debug for ClosureRegionRequirements<'tcx>
impl<'tcx> Debug for ClosureRegionRequirements<'tcx>
source§impl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for ClosureRegionRequirements<'tcx>
impl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for ClosureRegionRequirements<'tcx>
source§impl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for ClosureRegionRequirements<'tcx>
impl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for ClosureRegionRequirements<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ClosureRegionRequirements<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ClosureRegionRequirements<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
Auto Trait Implementations§
impl<'tcx> Freeze for ClosureRegionRequirements<'tcx>
impl<'tcx> !RefUnwindSafe for ClosureRegionRequirements<'tcx>
impl<'tcx> !Send for ClosureRegionRequirements<'tcx>
impl<'tcx> !Sync for ClosureRegionRequirements<'tcx>
impl<'tcx> Unpin for ClosureRegionRequirements<'tcx>
impl<'tcx> !UnwindSafe for ClosureRegionRequirements<'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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it.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: 32 bytes