pub struct Results<'tcx, A>where
    A: Analysis<'tcx>,
{ pub analysis: A, pub(super) entry_sets: IndexVec<BasicBlock, A::Domain>, }
Expand description

A dataflow analysis that has converged to fixpoint.

Fields§

§analysis: A§entry_sets: IndexVec<BasicBlock, A::Domain>

Implementations§

source§

impl<'tcx, A> Results<'tcx, A>where
    A: Analysis<'tcx>,

source

pub fn into_results_cursor<'mir>(
    self,
    body: &'mir Body<'tcx>
) -> ResultsCursor<'mir, 'tcx, A>

Creates a ResultsCursor that can inspect these Results.

source

pub fn entry_set_for_block(&self, block: BasicBlock) -> &A::Domain

Gets the dataflow state for the given block.

source

pub fn visit_with<'mir>(
    &self,
    body: &'mir Body<'tcx>,
    blocks: impl IntoIterator<Item = BasicBlock>,
    vis: &mut impl ResultsVisitor<'mir, 'tcx, FlowState = A::Domain>
)

source

pub fn visit_reachable_with<'mir>(
    &self,
    body: &'mir Body<'tcx>,
    vis: &mut impl ResultsVisitor<'mir, 'tcx, FlowState = A::Domain>
)

Trait Implementations§

source§

impl<'tcx, A> ResultsVisitable<'tcx> for Results<'tcx, A>where
    A: Analysis<'tcx>,

§

type FlowState = <A as AnalysisDomain<'tcx>>::Domain

§

type Direction = <A as AnalysisDomain<'tcx>>::Direction

source§

fn new_flow_state(&self, body: &Body<'tcx>) -> Self::FlowState

Creates an empty FlowState to hold the transient state for these dataflow results. Read more
source§

fn reset_to_block_entry(&self, state: &mut Self::FlowState, block: BasicBlock)

source§

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

source§

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

source§

fn reconstruct_before_terminator_effect(
    &self,
    state: &mut Self::FlowState,
    term: &Terminator<'tcx>,
    loc: Location
)

source§

fn reconstruct_terminator_effect(
    &self,
    state: &mut Self::FlowState,
    term: &Terminator<'tcx>,
    loc: Location
)

Auto Trait Implementations§

§

impl<'tcx, A> RefUnwindSafe for Results<'tcx, A>where
    A: RefUnwindSafe,
    <A as AnalysisDomain<'tcx>>::Domain: RefUnwindSafe,

§

impl<'tcx, A> Send for Results<'tcx, A>where
    A: Send,
    <A as AnalysisDomain<'tcx>>::Domain: Send,

§

impl<'tcx, A> Sync for Results<'tcx, A>where
    A: Sync,
    <A as AnalysisDomain<'tcx>>::Domain: Sync,

§

impl<'tcx, A> Unpin for Results<'tcx, A>where
    A: Unpin,
    <A as AnalysisDomain<'tcx>>::Domain: Unpin,

§

impl<'tcx, A> UnwindSafe for Results<'tcx, A>where
    A: UnwindSafe,
    <A as AnalysisDomain<'tcx>>::Domain: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere
    T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere
    T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere
    T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere
    U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for Twhere
    U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere
    U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.