Struct come::ir::editor::analyzer::control_flow::BindedScc

pub struct BindedScc<'a> {
    pub graph_part: CFSubGraph<'a>,
    pub top_level: bool,
}

Fields

graph_part: CFSubGraph<'a>

top_level: bool

Implementations

impl<'a> BindedScc<'a>

pub fn new( graph: &'a CFGraph, nodes: impl IntoIterator<Item = <CFGraph as GraphBase>::NodeId>, edges: impl IntoIterator<Item = <CFGraph as GraphBase>::EdgeId>, top_level: bool ) -> Self

pub fn new_top_level_from_graph(graph: &'a CFGraph) -> Self

pub fn is_trivial(&self) -> bool

pub fn contains(&self, node: usize) -> bool

pub fn edges(&self) -> Vec<(usize, usize)>

pub fn entry_edges(&self) -> Vec<(usize, usize)>

pub fn entry_nodes(&self) -> Vec<usize>

pub fn edges_into_entry_nodes(&self) -> Vec<(usize, usize)>

pub fn extern_edges_into_entry_nodes(&self) -> Vec<(usize, usize)>

pub fn reduciable(&self) -> bool

pub fn top_level_sccs(&self) -> Option<Vec<Self>>

Returns all top level sccs for a reducible subgraph. Return None if the subgraph is not reducible.

pub fn first_irreducible_sub_scc(&self) -> Option<Self>

pub fn smallest_non_trivial_scc_node_in(&self, node: usize) -> Option<Self>

Returns the smallest non trivial (ie. not a single node) scc the node is in.

Trait Implementations

impl<'a> Clone for BindedScc<'a>

fn clone(&self) -> BindedScc<'a>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a> Debug for BindedScc<'a>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> Display for BindedScc<'a>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> PartialEq for BindedScc<'a>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.