Struct MaybeRequiresStorage

pub struct MaybeRequiresStorage<'mir, 'tcx> {
    borrowed_locals: ResultsCursor<'mir, 'tcx, MaybeBorrowedLocals>,
}

Dataflow analysis that determines whether each local requires storage at a given location; i.e. whether its storage can go away without being observed.

Fields

borrowed_locals: ResultsCursor<'mir, 'tcx, MaybeBorrowedLocals>

Implementations

impl<'mir, 'tcx> MaybeRequiresStorage<'mir, 'tcx>

pub fn new( borrowed_locals: ResultsCursor<'mir, 'tcx, MaybeBorrowedLocals>, ) -> Self

impl<'tcx> MaybeRequiresStorage<'_, 'tcx>

fn check_for_move(&mut self, state: &mut BitSet<Local>, loc: Location)

Kill locals that are fully moved and have not been borrowed.

Trait Implementations

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

const NAME: &'static str = "requires_storage"

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

type Domain = BitSet<Local>

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

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

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

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

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

fn apply_early_statement_effect( &mut self, state: &mut Self::Domain, stmt: &Statement<'tcx>, loc: Location, )

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

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

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

fn apply_early_terminator_effect( &mut self, state: &mut Self::Domain, terminator: &Terminator<'tcx>, loc: Location, )

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

fn apply_primary_terminator_effect<'t>( &mut self, state: &mut Self::Domain, terminator: &'t Terminator<'tcx>, loc: Location, ) -> TerminatorEdges<'t, '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.

type Direction = Forward

The direction of this analysis. Either Forward or Backward.

fn apply_switch_int_edge_effects( &mut self, _block: BasicBlock, _discr: &Operand<'tcx>, _apply_edge_effects: &mut impl SwitchIntEdgeEffects<Self::Domain>, )

Updates the current dataflow state with the effect of taking a particular branch in a SwitchInt terminator.

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

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

Finds the fixpoint for this dataflow problem.

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