Skip to main content

LiveVariables

Struct LiveVariables 

pub struct LiveVariables { /* private fields */ }
Expand description

Data flow analysis types.

Generic data flow analysis framework including reaching definitions, live variables, and constant propagation. Provides lattice-based analysis with configurable direction. Live variable analysis.

Computes which variables are live at each program point. A variable is live if its value may be used on some path from that point forward.

§Example

use analyssa::{
    analysis::{
        dataflow::{DataFlowSolver, LiveVariables},
        SsaCfg,
    },
    ir::SsaVarId,
    testing,
};

// Block 1 defines the loop counter phi; block 2 returns it.
let ssa = testing::loop_counter_fixture();
let graph = SsaCfg::from_ssa(&ssa);

let analysis = LiveVariables::new(&ssa);
let solver = DataFlowSolver::new(analysis);
let results = solver.solve(&ssa, &graph);

// The counter is live on entry to block 2, because block 2 returns it.
let counter = SsaVarId::from_index(1);
let live_in = results.in_state(2).unwrap();
assert!(live_in.variables().any(|var| var == counter));

// Nothing is live after the return terminator.
assert_eq!(results.out_state(2).unwrap().variables().count(), 0);

Implementations§

Source§

impl LiveVariables

Source

pub fn new<T>(ssa: &SsaFunction<T>) -> LiveVariables
where T: Target,

Creates a new live variables analysis for the given SSA function.

Source

pub fn live_out( &self, block: usize, out_state: &LivenessResult, ) -> LivenessResult

Returns the values live on block’s outgoing edges.

Use this rather than the solver’s raw out_state. out_state is the meet of the successors’ IN sets, and a value consumed only by a successor’s phi never appears there: phi-operand uses are relocated into the predecessor’s USE set, which feeds IN[pred], not OUT[pred]. The value is genuinely live across the edge — the phi copy reads it — so raw out_state under-approximates liveness, which is the unsafe direction for a may-analysis and would let a register allocator reuse a live register.

This computes OUT[B] = out_state(B) ∪ PhiUses(B), where PhiUses(B) is every value some successor reads as a phi operand on an edge from B.

Source

pub fn phi_out_set(&self, block: usize) -> Option<&BitSet>

Returns the values a successor’s phi reads on block’s outgoing edges.

Source

pub const fn num_variables(&self) -> usize

Returns the number of variables being tracked.

Source

pub fn use_set(&self, block: usize) -> Option<&BitSet>

Returns the USE set for a block.

Source

pub fn def_set(&self, block: usize) -> Option<&BitSet>

Returns the DEF set for a block.

Trait Implementations§

Source§

impl<T> DataFlowAnalysis<T> for LiveVariables
where T: Target,

Source§

const DIRECTION: Direction = Direction::Backward

The direction of this analysis.
Source§

type Lattice = LivenessResult

The lattice type for this analysis.
Source§

fn boundary( &self, _ssa: &SsaFunction<T>, ) -> <LiveVariables as DataFlowAnalysis<T>>::Lattice

Returns the initial value at the boundary of the function. Read more
Source§

fn initial( &self, _ssa: &SsaFunction<T>, ) -> <LiveVariables as DataFlowAnalysis<T>>::Lattice

Returns the initial value for interior blocks (typically the lattice’s top).
Source§

fn transfer( &self, block_id: usize, _block: &SsaBlock<T>, output: &<LiveVariables as DataFlowAnalysis<T>>::Lattice, _ssa: &SsaFunction<T>, ) -> <LiveVariables as DataFlowAnalysis<T>>::Lattice

Computes the transfer function for a basic block. Given the input state to a block, returns the output state after flowing through the block.
Source§

fn widen( &self, _block_id: usize, _previous: &Self::Lattice, next: Self::Lattice, _visit: usize, ) -> Self::Lattice

Widens next against the value a block previously held, once it has been revisited enough times to look loop-carried. Read more
Source§

fn finalize( &mut self, _in_states: &[Self::Lattice], _out_states: &[Self::Lattice], _ssa: &SsaFunction<T>, )

Called when analysis is complete. Default: no post-processing.

Auto Trait Implementations§

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> AsAny for T
where T: Any,

Source§

fn as_any(&self) -> &(dyn Any + 'static)

Source§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Source§

fn type_name(&self) -> &'static str

Gets the type name of self
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> Downcast for T
where T: AsAny + ?Sized,

Source§

fn is<T>(&self) -> bool
where T: AsAny,

Returns true if the boxed type is the same as T. Read more
Source§

fn downcast_ref<T>(&self) -> Option<&T>
where T: AsAny,

Forward to the method defined on the type Any.
Source§

fn downcast_mut<T>(&mut self) -> Option<&mut T>
where T: AsAny,

Forward to the method defined on the type Any.
Source§

impl<T> ErasedDestructor for T
where T: 'static,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

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

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

fn in_current_span(self) -> Instrumented<Self>

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

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

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, A> IntoAst<A> for T
where T: Into<A>, A: Ast,

Source§

fn into_ast(self, _a: &A) -> A

Source§

impl<T> IntoEither for T

Source§

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

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
Source§

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

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
Source§

impl<F, T> IntoSample<T> for F
where T: FromSample<F>,

Source§

fn into_sample(self) -> T

Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

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

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

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

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

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

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

fn with_current_subscriber(self) -> WithDispatch<Self>

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