Struct MaybeUninitializedPlaces 

pub struct MaybeUninitializedPlaces<'a, 'tcx> {
    tcx: TyCtxt<'tcx>,
    body: &'a Body<'tcx>,
    move_data: &'a MoveData<'tcx>,
    mark_inactive_variants_as_uninit: bool,
    include_inactive_in_otherwise: bool,
    skip_unreachable_unwind: DenseBitSet<BasicBlock>,
}

MaybeUninitializedPlaces tracks all places that might be uninitialized 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;
#[rustfmt::skip]
fn foo(pred: bool) {                        // maybe-uninit:
                                            // {a, b, c, d}
    let a = S; let mut b = S; let c; let d; // {      c, d}

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

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

    }                                       // {a, b, c, d}

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

To determine whether a place is definitely uninitialized at a particular control-flow point, one can take the set-complement of the data from MaybeInitializedPlaces at the corresponding control-flow point.

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

Fields

tcx: TyCtxt<'tcx>

body: &'a Body<'tcx>

move_data: &'a MoveData<'tcx>

mark_inactive_variants_as_uninit: bool

include_inactive_in_otherwise: bool

skip_unreachable_unwind: DenseBitSet<BasicBlock>

Implementations

impl<'a, 'tcx> MaybeUninitializedPlaces<'a, 'tcx>

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

pub fn mark_inactive_variants_as_uninit(self) -> Self

Causes inactive enum variants to be marked as “maybe uninitialized” after a switch on an enum discriminant.

This is correct in a vacuum but is not the default because it causes problems in the borrow checker, where this information gets propagated along FakeEdges.

pub fn include_inactive_in_otherwise(self) -> Self

Ensures definitely inactive variants are included in the set of uninitialized places for blocks reached through an otherwise edge.

pub fn skipping_unreachable_unwind( self, unreachable_unwind: DenseBitSet<BasicBlock>, ) -> Self

impl<'tcx> MaybeUninitializedPlaces<'_, 'tcx>

fn update_bits( state: &mut MixedBitSet<MovePathIndex>, path: MovePathIndex, dfstate: DropFlagState, )

Trait Implementations

impl<'tcx> Analysis<'tcx> for MaybeUninitializedPlaces<'_, 'tcx>

const NAME: &'static str = "maybe_uninit"

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

type Domain = MixedBitSet<MovePathIndex>

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

type SwitchIntData = MaybePlacesSwitchIntData<'tcx>

Auxiliary data used for analyzing SwitchInt terminators, if necessary.

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.

fn apply_primary_statement_effect( &mut self, state: &mut Self::Domain, _statement: &Statement<'tcx>, location: Location, )

Updates the current dataflow state with the effect of evaluating a statement.

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

Updates the current dataflow state with the effect of evaluating a terminator.

fn apply_call_return_effect( &mut self, state: &mut Self::Domain, _block: BasicBlock, return_places: CallReturnPlaces<'_, 'tcx>, )

Updates the current dataflow state with the effect of a successful return from a Call terminator.

fn get_switch_int_data( &mut self, block: BasicBlock, discr: &Operand<'tcx>, ) -> Option<Self::SwitchIntData>

Used to update the current dataflow state with the effect of taking a particular branch in a SwitchInt terminator.

fn apply_switch_int_edge_effect( &mut self, data: &mut Self::SwitchIntData, state: &mut Self::Domain, value: SwitchTargetValue, targets: &SwitchTargets, )

See comments on get_switch_int_data.

type Direction = Forward

The direction of this analysis. Either Forward or Backward.

fn apply_early_statement_effect( &mut self, _state: &mut Self::Domain, _statement: &Statement<'tcx>, _location: Location, )

Updates the current dataflow state with an “early” effect, i.e. one that occurs immediately before the given statement.

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

Updates the current dataflow state with an effect that occurs immediately before the given terminator.

fn iterate_to_fixpoint<'mir>( self, tcx: TyCtxt<'tcx>, body: &'mir Body<'tcx>, pass_name: Option<&'static str>, ) -> AnalysisAndResults<'tcx, Self>

where Self: Sized, Self::Domain: DebugWithContext<Self>,

Finds the fixpoint for this dataflow problem.

impl<'tcx> HasMoveData<'tcx> for MaybeUninitializedPlaces<'_, '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: 64 bytes