pub(crate) struct LocalUseMap {
first_def_at: IndexVec<Local, Option<AppearanceIndex>>,
first_use_at: IndexVec<Local, Option<AppearanceIndex>>,
first_drop_at: IndexVec<Local, Option<AppearanceIndex>>,
appearances: IndexVec<AppearanceIndex, Appearance>,
}
Expand description
A map that cross references each local with the locations where it is defined (assigned), used, or dropped. Used during liveness computation.
We keep track only of Local
s we’ll do the liveness analysis later,
this means that our internal IndexVec
s will only be sparsely populated.
In the time-memory trade-off between keeping compact vectors with new
indexes (and needing to continuously map the Local
index to its compact
counterpart) and having IndexVec
s that we only use a fraction of, time
(and code simplicity) was favored. The rationale is that we only keep
a small number of IndexVec
s throughout the entire analysis while, in
contrast, we’re accessing each Local
many times.
Fields§
§first_def_at: IndexVec<Local, Option<AppearanceIndex>>
Head of a linked list of definitions of each variable –
definition in this context means assignment, e.g., x
is
defined in x = y
but not y
; that first def is the head of
a linked list that lets you enumerate all places the variable
is assigned.
first_use_at: IndexVec<Local, Option<AppearanceIndex>>
Head of a linked list of uses of each variable – use in
this context means that the existing value of the variable is
read or modified. e.g., y
is used in x = y
but not x
.
Note that DROP(x)
terminators are excluded from this list.
first_drop_at: IndexVec<Local, Option<AppearanceIndex>>
Head of a linked list of drops of each variable – these are a special category of uses corresponding to the drop that we add for each local variable.
appearances: IndexVec<AppearanceIndex, Appearance>
Implementations§
Source§impl LocalUseMap
impl LocalUseMap
pub(crate) fn build( live_locals: &[Local], location_map: &DenseLocationMap, body: &Body<'_>, ) -> Self
pub(crate) fn defs(&self, local: Local) -> impl Iterator<Item = PointIndex> + '_
pub(crate) fn uses(&self, local: Local) -> impl Iterator<Item = PointIndex> + '_
pub(crate) fn drops( &self, local: Local, ) -> impl Iterator<Item = PointIndex> + '_
Auto Trait Implementations§
impl DynSend for LocalUseMap
impl DynSync for LocalUseMap
impl Freeze for LocalUseMap
impl RefUnwindSafe for LocalUseMap
impl Send for LocalUseMap
impl Sync for LocalUseMap
impl Unpin for LocalUseMap
impl UnwindSafe for LocalUseMap
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, 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,
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: 96 bytes