Struct PirGraph 

#[non_exhaustive]
pub struct PirGraph {
    pub nodes: Vec<PirNode>,
    pub edges: Vec<PirEdge>,
    pub receipt: PirReceipt,
}

A lowered PIR graph plus its receipt.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

nodes: Vec<PirNode>

PIR nodes in stable lowering order.

edges: Vec<PirEdge>

Control-flow edges.

receipt: PirReceipt

Lowering receipt describing this graph.

Implementations

impl PirGraph

pub fn is_empty(&self) -> bool

Return true when no PIR nodes were lowered.

pub fn node(&self, id: PirId) -> Option<&PirNode>

Look up a node by id.

This is O(1): lowering pushes nodes in stable index order, so nodes[k] always has id.index() == k. Lowerings must preserve that invariant — do not store nodes out of order or assign non-sequential ids.

Trait Implementations

impl Clone for PirGraph

fn clone(&self) -> PirGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PirGraph

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

Formats the value using the given formatter.

impl Eq for PirGraph

impl PartialEq for PirGraph

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl StructuralPartialEq for PirGraph