Trait move_binary_format::control_flow_graph::ControlFlowGraph

source · [−]
pub trait ControlFlowGraph {
    fn block_start(&self, block_id: BlockId) -> CodeOffset;
    fn block_end(&self, block_id: BlockId) -> CodeOffset;
    fn successors(&self, block_id: BlockId) -> &Vec<BlockId>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
    A: Allocator, ;
    fn next_block(&self, block_id: BlockId) -> Option<BlockId>;
    fn instr_indexes(
        &self, 
        block_id: BlockId
    ) -> Box<dyn Iterator<Item = CodeOffset>>;
    fn blocks(&self) -> Vec<BlockId>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
    A: Allocator, ;
    fn num_blocks(&self) -> u16;
    fn entry_block_id(&self) -> BlockId;
    fn is_loop_head(&self, block_id: BlockId) -> bool;
    fn is_back_edge(&self, cur: BlockId, next: BlockId) -> bool;
}
Expand description

A trait that specifies the basic requirements for a CFG

Required methods

Start index of the block ID in the bytecode vector

End index of the block ID in the bytecode vector

Successors of the block ID in the bytecode vector

Return the next block in traversal order

Iterator over the indexes of instructions in this block

Return an iterator over the blocks of the CFG

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

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

Checks if the block ID is a loop head

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

Implementors