Struct rustc_borrowck::region_infer::values::RegionValues
source · pub(crate) struct RegionValues<N: Idx> {
elements: Rc<DenseLocationMap>,
placeholder_indices: Rc<PlaceholderIndices>,
points: SparseIntervalMatrix<N, PointIndex>,
free_regions: SparseBitMatrix<N, RegionVid>,
placeholders: SparseBitMatrix<N, PlaceholderIndex>,
}
Expand description
Stores the full values for a set of regions (in contrast to
LivenessValues
, which only stores those points in the where a
region is live). The full value for a region may contain points in
the CFG, but also free regions as well as bound universe
placeholders.
Example:
fn foo(x: &'a u32) -> &'a u32 {
let y: &'0 u32 = x; // let's call this `'0`
y
}
Here, the variable '0
would contain the free region 'a
,
because (since it is returned) it must live for at least 'a
. But
it would also contain various points from within the function.
Fields§
§elements: Rc<DenseLocationMap>
§placeholder_indices: Rc<PlaceholderIndices>
§points: SparseIntervalMatrix<N, PointIndex>
§free_regions: SparseBitMatrix<N, RegionVid>
§placeholders: SparseBitMatrix<N, PlaceholderIndex>
Placeholders represent bound regions – so something like 'a
in for<'a> fn(&'a u32)
.
Implementations§
source§impl<N: Idx> RegionValues<N>
impl<N: Idx> RegionValues<N>
sourcepub(crate) fn new(
elements: &Rc<DenseLocationMap>,
num_universal_regions: usize,
placeholder_indices: &Rc<PlaceholderIndices>,
) -> Self
pub(crate) fn new( elements: &Rc<DenseLocationMap>, num_universal_regions: usize, placeholder_indices: &Rc<PlaceholderIndices>, ) -> Self
Creates a new set of “region values” that tracks causal information. Each of the regions in num_region_variables will be initialized with an empty set of points and no causal information.
sourcepub(crate) fn add_element(&mut self, r: N, elem: impl ToElementIndex) -> bool
pub(crate) fn add_element(&mut self, r: N, elem: impl ToElementIndex) -> bool
Adds the given element to the value for the given region. Returns whether the element is newly added (i.e., was not already present).
sourcepub(crate) fn add_all_points(&mut self, r: N)
pub(crate) fn add_all_points(&mut self, r: N)
Adds all the control-flow points to the values for r
.
sourcepub(crate) fn add_region(&mut self, r_to: N, r_from: N) -> bool
pub(crate) fn add_region(&mut self, r_to: N, r_from: N) -> bool
Adds all elements in r_from
to r_to
(because e.g., r_to: r_from
).
sourcepub(crate) fn contains(&self, r: N, elem: impl ToElementIndex) -> bool
pub(crate) fn contains(&self, r: N, elem: impl ToElementIndex) -> bool
Returns true
if the region r
contains the given element.
sourcepub(crate) fn first_non_contained_inclusive(
&self,
r: N,
block: BasicBlock,
start: usize,
end: usize,
) -> Option<usize>
pub(crate) fn first_non_contained_inclusive( &self, r: N, block: BasicBlock, start: usize, end: usize, ) -> Option<usize>
Returns the lowest statement index in start..=end
which is not contained by r
.
sourcepub(crate) fn merge_liveness(
&mut self,
to: N,
from: RegionVid,
values: &LivenessValues,
)
pub(crate) fn merge_liveness( &mut self, to: N, from: RegionVid, values: &LivenessValues, )
self[to] |= values[from]
, essentially: that is, take all the
elements for the region from
from values
and add them to
the region to
in self
.
sourcepub(crate) fn contains_points(&self, sup_region: N, sub_region: N) -> bool
pub(crate) fn contains_points(&self, sup_region: N, sub_region: N) -> bool
Returns true
if sup_region
contains all the CFG points that
sub_region
contains. Ignores universal regions.
sourcepub(crate) fn locations_outlived_by<'a>(
&'a self,
r: N,
) -> impl Iterator<Item = Location> + 'a
pub(crate) fn locations_outlived_by<'a>( &'a self, r: N, ) -> impl Iterator<Item = Location> + 'a
Returns the locations contained within a given region r
.
sourcepub(crate) fn universal_regions_outlived_by<'a>(
&'a self,
r: N,
) -> impl Iterator<Item = RegionVid> + 'a
pub(crate) fn universal_regions_outlived_by<'a>( &'a self, r: N, ) -> impl Iterator<Item = RegionVid> + 'a
Returns just the universal regions that are contained in a given region’s value.
sourcepub(crate) fn placeholders_contained_in<'a>(
&'a self,
r: N,
) -> impl Iterator<Item = PlaceholderRegion> + 'a
pub(crate) fn placeholders_contained_in<'a>( &'a self, r: N, ) -> impl Iterator<Item = PlaceholderRegion> + 'a
Returns all the elements contained in a given region’s value.
sourcepub(crate) fn elements_contained_in<'a>(
&'a self,
r: N,
) -> impl Iterator<Item = RegionElement> + 'a
pub(crate) fn elements_contained_in<'a>( &'a self, r: N, ) -> impl Iterator<Item = RegionElement> + 'a
Returns all the elements contained in a given region’s value.
sourcepub(crate) fn region_value_str(&self, r: N) -> String
pub(crate) fn region_value_str(&self, r: N) -> String
Returns a “pretty” string value of the region. Meant for debugging.
Trait Implementations§
source§impl<N: Clone + Idx> Clone for RegionValues<N>
impl<N: Clone + Idx> Clone for RegionValues<N>
source§fn clone(&self) -> RegionValues<N>
fn clone(&self) -> RegionValues<N>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreAuto Trait Implementations§
impl<N> !DynSend for RegionValues<N>
impl<N> !DynSync for RegionValues<N>
impl<N> Freeze for RegionValues<N>
impl<N> RefUnwindSafe for RegionValues<N>
impl<N> !Send for RegionValues<N>
impl<N> !Sync for RegionValues<N>
impl<N> Unpin for RegionValues<N>
impl<N> UnwindSafe for RegionValues<N>
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<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<T> Pointable for T
impl<T> Pointable 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,
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: 112 bytes