Struct DefinitelyInitializedPlaces

pub struct DefinitelyInitializedPlaces<'a, 'tcx> {
    body: &'a Body<'tcx>,
    move_data: &'a MoveData<'tcx>,
}

DefinitelyInitializedPlaces tracks all places that are definitely 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) {                        // definite-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}

    }                                       // {          }

    c = S;                                  // {       c  }
}

To determine whether a place may be uninitialized at a particular control-flow point, one can take the set-complement of this data.

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

Fields

body: &'a Body<'tcx>

move_data: &'a MoveData<'tcx>

Implementations

impl<'a, 'tcx> DefinitelyInitializedPlaces<'a, 'tcx>

pub fn new(body: &'a Body<'tcx>, move_data: &'a MoveData<'tcx>) -> Self

impl<'a, 'tcx> DefinitelyInitializedPlaces<'a, 'tcx>

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

Trait Implementations

impl<'a, 'tcx> AnalysisDomain<'tcx> for DefinitelyInitializedPlaces<'a, 'tcx>

type Domain = Dual<BitSet<MovePathIndex>>

Use set intersection as the join operator.

const NAME: &'static str = "definite_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 DefinitelyInitializedPlaces<'_, '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. Note how the second arg differs.

fn terminator_effect<'mir>( &mut self, trans: &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 Self::Domain, _block: BasicBlock, return_places: CallReturnPlaces<'_, 'tcx>, )

See Analysis::apply_call_return_effect.

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

See Analysis::apply_before_statement_effect. Note how the second arg differs.

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

See Analysis::apply_before_terminator_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.

impl<'a, 'tcx> HasMoveData<'tcx> for DefinitelyInitializedPlaces<'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: 16 bytes