Struct RegionValues 

pub(crate) struct RegionValues<'tcx, N: Idx> {
    location_map: Rc<DenseLocationMap>,
    placeholder_indices: PlaceholderIndices<'tcx>,
    points: SparseIntervalMatrix<N, PointIndex>,
    free_regions: SparseBitMatrix<N, RegionVid>,
    placeholders: SparseBitMatrix<N, PlaceholderIndex>,
}

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

location_map: Rc<DenseLocationMap>

placeholder_indices: PlaceholderIndices<'tcx>

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

impl<'tcx, N: Idx> RegionValues<'tcx, N>

pub(crate) fn new( location_map: Rc<DenseLocationMap>, num_universal_regions: usize, placeholder_indices: PlaceholderIndices<'tcx>, ) -> 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.

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

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.

pub(crate) fn merge_liveness( &mut self, to: N, liveness: &IntervalSet<PointIndex>, )

Merge a row of liveness into our points.

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.

pub(crate) fn locations_outlived_by( &self, r: N, ) -> impl Iterator<Item = Location>

Returns the locations contained within a given region r.

pub(crate) fn universal_regions_outlived_by( &self, r: N, ) -> impl Iterator<Item = RegionVid>

Returns just the universal regions that are contained in a given region’s value.

pub(crate) fn placeholders_contained_in( &self, r: N, ) -> impl Iterator<Item = PlaceholderRegion<'tcx>>

Returns all the elements contained in a given region’s value.

pub(crate) fn elements_contained_in( &self, r: N, ) -> impl Iterator<Item = RegionElement<'tcx>>

Returns all the elements contained in a given region’s value.

pub(crate) fn region_value_str(&self, r: N) -> String

Returns a “pretty” string value of the region. Meant for debugging.

pub(crate) fn add_free_region(&mut self, scc: N, region: RegionVid)

Add a the free region with rvid region to SCC scc

pub(crate) fn add_placeholder( &mut self, scc: N, placeholder: PlaceholderRegion<'tcx>, )

pub(crate) fn contains_point(&self, scc: N, p: Location) -> bool

Determine if scc contains the CFG point p.

pub(crate) fn contains_free_region( &self, scc: N, free_region: RegionVid, ) -> bool

Determine if scc contains the free region free_region.

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