pub struct EverInitializedPlaces<'a, 'tcx> {
body: &'a Body<'tcx>,
mdpe: &'a MoveDataParamEnv<'tcx>,
}
Expand description
EverInitializedPlaces
tracks all places that might have ever been
initialized upon reaching a particular point in the control flow
for a function, without an intervening StorageDead
.
This dataflow is used to determine if an immutable local variable may be assigned to.
For example, in code like the following, we have corresponding dataflow information shown in the right-hand comments.
struct S;
fn foo(pred: bool) { // ever-init:
// { }
let a = S; let mut b = S; let c; let d; // {a, b }
if pred {
drop(a); // {a, b, }
b = S; // {a, b, }
} else {
drop(b); // {a, b, }
d = S; // {a, b, d }
} // {a, b, d }
c = S; // {a, b, c, d }
}
Fields§
§body: &'a Body<'tcx>
§mdpe: &'a MoveDataParamEnv<'tcx>
Implementations§
source§impl<'a, 'tcx> EverInitializedPlaces<'a, 'tcx>
impl<'a, 'tcx> EverInitializedPlaces<'a, 'tcx>
pub fn new(body: &'a Body<'tcx>, mdpe: &'a MoveDataParamEnv<'tcx>) -> Self
Trait Implementations§
source§impl<'tcx> AnalysisDomain<'tcx> for EverInitializedPlaces<'_, 'tcx>
impl<'tcx> AnalysisDomain<'tcx> for EverInitializedPlaces<'_, 'tcx>
§type Domain = ChunkedBitSet<InitIndex>
type Domain = ChunkedBitSet<InitIndex>
There can be many more InitIndex
than there are locals in a MIR body.
We use a chunked bitset to avoid paying too high a memory footprint.
source§const NAME: &'static str = "ever_init"
const NAME: &'static str = "ever_init"
source§fn bottom_value(&self, _: &Body<'tcx>) -> Self::Domain
fn bottom_value(&self, _: &Body<'tcx>) -> Self::Domain
source§impl<'tcx> GenKillAnalysis<'tcx> for EverInitializedPlaces<'_, 'tcx>
impl<'tcx> GenKillAnalysis<'tcx> for EverInitializedPlaces<'_, 'tcx>
type Idx = InitIndex
fn domain_size(&self, _: &Body<'tcx>) -> usize
source§fn statement_effect(
&mut self,
trans: &mut impl GenKill<Self::Idx>,
stmt: &Statement<'tcx>,
location: Location
)
fn statement_effect( &mut self, trans: &mut impl GenKill<Self::Idx>, stmt: &Statement<'tcx>, location: Location )
Analysis::apply_statement_effect
. Note how the second arg differs.source§fn terminator_effect<'mir>(
&mut self,
trans: &mut Self::Domain,
terminator: &'mir Terminator<'tcx>,
location: Location
) -> TerminatorEdges<'mir, 'tcx>
fn terminator_effect<'mir>( &mut self, trans: &mut Self::Domain, terminator: &'mir Terminator<'tcx>, location: Location ) -> TerminatorEdges<'mir, 'tcx>
Analysis::apply_terminator_effect
.source§fn call_return_effect(
&mut self,
trans: &mut Self::Domain,
block: BasicBlock,
_return_places: CallReturnPlaces<'_, 'tcx>
)
fn call_return_effect( &mut self, trans: &mut Self::Domain, block: BasicBlock, _return_places: CallReturnPlaces<'_, 'tcx> )
Analysis::apply_call_return_effect
.source§fn before_statement_effect(
&mut self,
_trans: &mut impl GenKill<Self::Idx>,
_statement: &Statement<'tcx>,
_location: Location
)
fn before_statement_effect( &mut self, _trans: &mut impl GenKill<Self::Idx>, _statement: &Statement<'tcx>, _location: Location )
Analysis::apply_before_statement_effect
. Note how the second arg
differs.source§fn before_terminator_effect(
&mut self,
_trans: &mut Self::Domain,
_terminator: &Terminator<'tcx>,
_location: Location
)
fn before_terminator_effect( &mut self, _trans: &mut Self::Domain, _terminator: &Terminator<'tcx>, _location: Location )
Analysis::apply_before_terminator_effect
.source§fn switch_int_edge_effects<G: GenKill<Self::Idx>>(
&mut self,
_block: BasicBlock,
_discr: &Operand<'tcx>,
_edge_effects: &mut impl SwitchIntEdgeEffects<G>
)
fn switch_int_edge_effects<G: GenKill<Self::Idx>>( &mut self, _block: BasicBlock, _discr: &Operand<'tcx>, _edge_effects: &mut impl SwitchIntEdgeEffects<G> )
Analysis::apply_switch_int_edge_effects
.source§impl<'a, 'tcx> HasMoveData<'tcx> for EverInitializedPlaces<'a, 'tcx>
impl<'a, 'tcx> HasMoveData<'tcx> for EverInitializedPlaces<'a, 'tcx>
Auto Trait Implementations§
impl<'a, 'tcx> DynSend for EverInitializedPlaces<'a, 'tcx>
impl<'a, 'tcx> DynSync for EverInitializedPlaces<'a, 'tcx>
impl<'a, 'tcx> Freeze for EverInitializedPlaces<'a, 'tcx>
impl<'a, 'tcx> !RefUnwindSafe for EverInitializedPlaces<'a, 'tcx>
impl<'a, 'tcx> Send for EverInitializedPlaces<'a, 'tcx>
impl<'a, 'tcx> Sync for EverInitializedPlaces<'a, 'tcx>
impl<'a, 'tcx> Unpin for EverInitializedPlaces<'a, 'tcx>
impl<'a, 'tcx> !UnwindSafe for EverInitializedPlaces<'a, '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, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
§impl<T> Filterable for T
impl<T> Filterable for T
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<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
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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: 16 bytes