Struct rustc_mir_dataflow::impls::MaybeInitializedPlaces

pub struct MaybeInitializedPlaces<'a, 'tcx> {
    tcx: TyCtxt<'tcx>,
    body: &'a Body<'tcx>,
    mdpe: &'a MoveDataParamEnv<'tcx>,
    skip_unreachable_unwind: bool,
}

MaybeInitializedPlaces tracks all places that might be initialized upon reaching a particular point in the control flow for a function.

For example, in code like the following, we have corresponding dataflow information shown in the right-hand comments.

struct S;
fn foo(pred: bool) {                        // maybe-init:
                                            // {}
    let a = S; let mut b = S; let c; let d; // {a, b}

    if pred {
        drop(a);                            // {   b}
        b = S;                              // {   b}

    } else {
        drop(b);                            // {a}
        d = S;                              // {a,       d}

    }                                       // {a, b,    d}

    c = S;                                  // {a, b, c, d}
}

To determine whether a place must be initialized at a particular control-flow point, one can take the set-difference between this data and the data from MaybeUninitializedPlaces at the corresponding control-flow point.

Similarly, at a given drop statement, the set-intersection between this data and MaybeUninitializedPlaces yields the set of places that would require a dynamic drop-flag at that statement.

Fields

tcx: TyCtxt<'tcx>

body: &'a Body<'tcx>

mdpe: &'a MoveDataParamEnv<'tcx>

skip_unreachable_unwind: bool

Implementations

impl<'a, 'tcx> MaybeInitializedPlaces<'a, 'tcx>

pub fn new( tcx: TyCtxt<'tcx>, body: &'a Body<'tcx>, mdpe: &'a MoveDataParamEnv<'tcx> ) -> Self

pub fn skipping_unreachable_unwind(self) -> Self

pub fn is_unwind_dead( &self, place: Place<'tcx>, state: &MaybeReachable<ChunkedBitSet<MovePathIndex>> ) -> bool

impl<'a, 'tcx> MaybeInitializedPlaces<'a, 'tcx>

fn update_bits( trans: &mut impl GenKill<MovePathIndex>, path: MovePathIndex, state: DropFlagState )

Trait Implementations

impl<'tcx> AnalysisDomain<'tcx> for MaybeInitializedPlaces<'_, 'tcx>

type Domain = MaybeReachable<ChunkedBitSet<MovePathIndex>>

The type that holds the dataflow state at any given point in the program.

const NAME: &'static str = "maybe_init"

A descriptive name for this analysis. Used only for debugging.

fn bottom_value(&self, _: &Body<'tcx>) -> Self::Domain

Returns the initial value of the dataflow state upon entry to each basic block.

fn initialize_start_block(&self, _: &Body<'tcx>, state: &mut Self::Domain)

Mutates the initial value of the dataflow state upon entry to the START_BLOCK.

type Direction = Forward

The direction of this analysis. Either Forward or Backward.

impl<'tcx> GenKillAnalysis<'tcx> for MaybeInitializedPlaces<'_, 'tcx>

type Idx = MovePathIndex

fn domain_size(&self, _: &Body<'tcx>) -> usize

fn statement_effect( &mut self, trans: &mut impl GenKill<Self::Idx>, statement: &Statement<'tcx>, location: Location )

See Analysis::apply_statement_effect.

fn terminator_effect<'mir>( &mut self, state: &mut Self::Domain, terminator: &'mir Terminator<'tcx>, location: Location ) -> TerminatorEdges<'mir, 'tcx>

See Analysis::apply_terminator_effect.

fn call_return_effect( &mut self, trans: &mut impl GenKill<Self::Idx>, _block: BasicBlock, return_places: CallReturnPlaces<'_, 'tcx> )

See Analysis::apply_call_return_effect.

fn switch_int_edge_effects<G: GenKill<Self::Idx>>( &mut self, block: BasicBlock, discr: &Operand<'tcx>, edge_effects: &mut impl SwitchIntEdgeEffects<G> )

See Analysis::apply_switch_int_edge_effects.

fn before_statement_effect( &mut self, _trans: &mut impl GenKill<Self::Idx>, _statement: &Statement<'tcx>, _location: Location )

See Analysis::apply_before_statement_effect.

fn before_terminator_effect( &mut self, _trans: &mut impl GenKill<Self::Idx>, _terminator: &Terminator<'tcx>, _location: Location )

See Analysis::apply_before_terminator_effect.

impl<'a, 'tcx> HasMoveData<'tcx> for MaybeInitializedPlaces<'a, 'tcx>

fn move_data(&self) -> &MoveData<'tcx>

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