Struct move_binary_format::control_flow_graph::VMControlFlowGraph

pub struct VMControlFlowGraph { /* private fields */ }

The control flow graph that we build from the bytecode.

Implementations

impl VMControlFlowGraph

pub fn new(code: &[Bytecode]) -> Self

pub fn display(&self)

pub fn reachable_from(&self, block_id: BlockId) -> Vec<BlockId>

Trait Implementations

impl ControlFlowGraph for VMControlFlowGraph

fn block_start(&self, block_id: BlockId) -> CodeOffset

Start index of the block ID in the bytecode vector

fn block_end(&self, block_id: BlockId) -> CodeOffset

End index of the block ID in the bytecode vector

fn successors(&self, block_id: BlockId) -> &Vec<BlockId>

Successors of the block ID in the bytecode vector

fn next_block(&self, block_id: BlockId) -> Option<CodeOffset>

Return the next block in traversal order

fn instr_indexes(
    &self,
    block_id: BlockId
) -> Box<dyn Iterator<Item = CodeOffset>>

Iterator over the indexes of instructions in this block

fn blocks(&self) -> Vec<BlockId>

Return an iterator over the blocks of the CFG

fn num_blocks(&self) -> u16

Return the number of blocks (vertices) in the control flow graph

fn entry_block_id(&self) -> BlockId

Return the id of the entry block for this control-flow graph Note: even a CFG with no instructions has an (empty) entry block.

fn is_loop_head(&self, block_id: BlockId) -> bool

Checks if the block ID is a loop head

fn is_back_edge(&self, cur: BlockId, next: BlockId) -> bool

Checks if the the edge from cur->next is a back edge returns false if the edge is not in the cfg