Struct quil_rs::program::analysis::ControlFlowGraph

pub struct ControlFlowGraph<'p> { /* private fields */ }

A control flow graph (CFG) is a representation of a program’s control flow as a directed graph. Each node in the graph is a basic block, a sequence of instructions with a single entry point and a single exit point. The edges in the graph represent control flow between basic blocks.

Implementations

impl<'p> ControlFlowGraph<'p>

pub fn has_dynamic_control_flow(&self) -> bool

Returns true if the program contains dynamic control flow, i.e. JUMP-WHEN or JUMP-UNLESS

pub fn into_blocks(self) -> Vec<BasicBlock<'p>>

Returns the basic blocks in the control flow graph.

Trait Implementations

impl<'p> Clone for ControlFlowGraph<'p>

fn clone(&self) -> ControlFlowGraph<'p>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'p> Debug for ControlFlowGraph<'p>

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

Formats the value using the given formatter.

impl<'p> Default for ControlFlowGraph<'p>

fn default() -> ControlFlowGraph<'p>

Returns the “default value” for a type.

impl<'p> From<&'p ControlFlowGraphOwned> for ControlFlowGraph<'p>

fn from(value: &'p ControlFlowGraphOwned) -> Self

Converts to this type from the input type.

impl<'p> From<&'p Program> for ControlFlowGraph<'p>

fn from(value: &'p Program) -> Self

Converts to this type from the input type.

impl From<ControlFlowGraph<'_>> for ControlFlowGraphOwned

fn from(value: ControlFlowGraph<'_>) -> Self

Converts to this type from the input type.