26 use crate::ir::{Block, Function, Inst};
34     pub block: Block,
41     pub fn new(block: Block, inst: Inst) -> Self {  in new()  argument
61     pub predecessors: bforest::Map<Inst, Block>,
65     pub successors: bforest::Set<Block>,
72     data: SecondaryMap<Block, CFGNode>,
73     pred_forest: bforest::MapForest<Inst, Block>,
74     succ_forest: bforest::SetForest<Block>,
119     fn compute_block(&mut self, func: &Function, block: Block) {  in compute_block()  argument
125     fn invalidate_block_successors(&mut self, block: Block) {  in invalidate_block_successors()  argument
144     pub fn recompute_block(&mut self, func: &Function, block: Block) {  in recompute_block()  argument
150     fn add_edge(&mut self, from: Block, from_inst: Inst, to: Block) {  in add_edge()  argument
160     pub fn pred_iter(&self, block: Block) -> PredIter<'_> {  in pred_iter()
165     pub fn succ_iter(&self, block: Block) -> SuccIter<'_> {  in succ_iter()
183 pub struct PredIter<'a>(bforest::MapIter<'a, Inst, Block>);
194 pub type SuccIter<'a> = bforest::SetIter<'a, Block>;