Struct rustc_mir::borrow_check::region_infer::values::RegionValueElements

pub(crate) struct RegionValueElements {
    statements_before_block: IndexVec<BasicBlock, usize>,
    basic_blocks: IndexVec<PointIndex, BasicBlock>,
    num_points: usize,
}

Maps between a Location and a PointIndex (and vice versa).

Fields

statements_before_block: IndexVec<BasicBlock, usize>

For each basic block, how many points are contained within?

basic_blocks: IndexVec<PointIndex, BasicBlock>

Map backward from each point to the basic block that it belongs to.

num_points: usize

Implementations

impl RegionValueElements

pub(crate) fn new(body: &Body<'_>) -> Self

pub(crate) fn num_points(&self) -> usize

Total number of point indices

pub(crate) fn point_from_location(&self, location: Location) -> PointIndex

Converts a Location into a PointIndex. O(1).

pub(crate) fn entry_point(&self, block: BasicBlock) -> PointIndex

Converts a Location into a PointIndex. O(1).

pub(crate) fn to_location(&self, index: PointIndex) -> Location

Converts a PointIndex back to a location. O(1).

pub(crate) fn point_in_range(&self, index: PointIndex) -> bool

Sometimes we get point-indices back from bitsets that may be out of range (because they round up to the nearest 2^N number of bits). Use this function to filter such points out if you like.

pub(crate) fn push_predecessors(
    &self,
    body: &Body<'_>,
    index: PointIndex,
    stack: &mut Vec<PointIndex>
)

Pushes all predecessors of index onto stack.