Struct BackAnalysis

pub struct BackAnalysis<'a, TAnalyzer: Analyzer<'a>> {
    pub analyzer: TAnalyzer,
    /* private fields */
}

Expand description

Main analysis type that allows traversing the flow backwards.

Fields§

§analyzer: TAnalyzer

Implementations§

Creates a new BackAnalysis instance.

Gets the analysis info for the entire function.

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Calls U::from(self).

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

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

Struct BackAnalysisCopy item path

Fields§

Implementations§

impl<'a, TAnalyzer: Analyzer<'a>> BackAnalysis<'a, TAnalyzer>

pub fn new(lowered: &'a FlatLowered, analyzer: TAnalyzer) -> Self

pub fn get_root_info(&mut self) -> TAnalyzer::Info

Auto Trait Implementations§

impl<'a, TAnalyzer> Freeze for BackAnalysis<'a, TAnalyzer>where TAnalyzer: Freeze,

impl<'a, TAnalyzer> RefUnwindSafe for BackAnalysis<'a, TAnalyzer>where TAnalyzer: RefUnwindSafe, <TAnalyzer as Analyzer<'a>>::Info: RefUnwindSafe,

impl<'a, TAnalyzer> Send for BackAnalysis<'a, TAnalyzer>where TAnalyzer: Send, <TAnalyzer as Analyzer<'a>>::Info: Send,

impl<'a, TAnalyzer> Sync for BackAnalysis<'a, TAnalyzer>where TAnalyzer: Sync, <TAnalyzer as Analyzer<'a>>::Info: Sync,

impl<'a, TAnalyzer> Unpin for BackAnalysis<'a, TAnalyzer>where TAnalyzer: Unpin, <TAnalyzer as Analyzer<'a>>::Info: Unpin,

impl<'a, TAnalyzer> UnwindSafe for BackAnalysis<'a, TAnalyzer>where TAnalyzer: UnwindSafe, <TAnalyzer as Analyzer<'a>>::Info: UnwindSafe,

Blanket Implementations§

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

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

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<T0, T1, E, TRewriter> SemanticRewriter<(T0, T1), E> for TRewriterwhere TRewriter: SemanticRewriter<T0, E> + SemanticRewriter<T1, E>,

fn internal_rewrite(&mut self, value: &mut (T0, T1)) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter> SemanticRewriter<Box<T>, E> for TRewriterwhere TRewriter: SemanticRewriter<T, E>,

fn internal_rewrite(&mut self, value: &mut Box<T>) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter> SemanticRewriter<Option<T>, E> for TRewriterwhere TRewriter: SemanticRewriter<T, E>,

fn internal_rewrite( &mut self, value: &mut Option<T>, ) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, V, E, TRewriter> SemanticRewriter<OrderedHashMap<T, V>, E> for TRewriterwhere T: Clone, V: Clone, TRewriter: SemanticRewriter<V, E>,

fn internal_rewrite( &mut self, value: &mut OrderedHashMap<T, V>, ) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter, E2> SemanticRewriter<Result<T, E2>, E> for TRewriterwhere TRewriter: SemanticRewriter<T, E>,

fn internal_rewrite( &mut self, value: &mut Result<T, E2>, ) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter> SemanticRewriter<Vec<T>, E> for TRewriterwhere T: Clone, TRewriter: SemanticRewriter<T, E>,

fn internal_rewrite(&mut self, value: &mut Vec<T>) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

impl<T, E, TRewriter> SemanticRewriter<VecDeque<T>, E> for TRewriterwhere TRewriter: SemanticRewriter<T, E>,

fn internal_rewrite( &mut self, value: &mut VecDeque<T>, ) -> Result<RewriteResult, E>

fn rewrite(&mut self, value: T) -> Result<T, Error>

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

type Error = Infallible

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

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

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

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

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

fn upcast(&self) -> &T

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

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

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

fn with_current_subscriber(self) -> WithDispatch<Self>

Struct BackAnalysis

impl<'a, TAnalyzer> Freeze for BackAnalysis<'a, TAnalyzer>
where TAnalyzer: Freeze,

impl<'a, TAnalyzer> RefUnwindSafe for BackAnalysis<'a, TAnalyzer>
where TAnalyzer: RefUnwindSafe, <TAnalyzer as Analyzer<'a>>::Info: RefUnwindSafe,

impl<'a, TAnalyzer> Send for BackAnalysis<'a, TAnalyzer>
where TAnalyzer: Send, <TAnalyzer as Analyzer<'a>>::Info: Send,

impl<'a, TAnalyzer> Sync for BackAnalysis<'a, TAnalyzer>
where TAnalyzer: Sync, <TAnalyzer as Analyzer<'a>>::Info: Sync,

impl<'a, TAnalyzer> Unpin for BackAnalysis<'a, TAnalyzer>
where TAnalyzer: Unpin, <TAnalyzer as Analyzer<'a>>::Info: Unpin,

impl<'a, TAnalyzer> UnwindSafe for BackAnalysis<'a, TAnalyzer>
where TAnalyzer: UnwindSafe, <TAnalyzer as Analyzer<'a>>::Info: UnwindSafe,

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

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

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

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

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<T0, T1, E, TRewriter> SemanticRewriter<(T0, T1), E> for TRewriter
where TRewriter: SemanticRewriter<T0, E> + SemanticRewriter<T1, E>,

impl<T, E, TRewriter> SemanticRewriter<Box<T>, E> for TRewriter
where TRewriter: SemanticRewriter<T, E>,

impl<T, E, TRewriter> SemanticRewriter<Option<T>, E> for TRewriter
where TRewriter: SemanticRewriter<T, E>,

impl<T, V, E, TRewriter> SemanticRewriter<OrderedHashMap<T, V>, E> for TRewriter
where T: Clone, V: Clone, TRewriter: SemanticRewriter<V, E>,

impl<T, E, TRewriter, E2> SemanticRewriter<Result<T, E2>, E> for TRewriter
where TRewriter: SemanticRewriter<T, E>,

impl<T, E, TRewriter> SemanticRewriter<Vec<T>, E> for TRewriter
where T: Clone, TRewriter: SemanticRewriter<T, E>,

impl<T, E, TRewriter> SemanticRewriter<VecDeque<T>, E> for TRewriter
where TRewriter: SemanticRewriter<T, E>,

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

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

impl<T> Upcast<T> for T
where T: ?Sized,

impl<T> UpcastMut<T> for T
where T: ?Sized,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,