Struct BlocksInfo

struct BlocksInfo {
    succs: BTreeSet<OrdBlockId>,
    best_inter_succs: BTreeSet<OrdBlockId>,
}

Information used to compute the switch exits. We compute this information for every block in the graph. Note that we make sure to use immutable sets because we rely a lot on cloning.

Fields

succs: BTreeSet<OrdBlockId>

All the successors of the block

best_inter_succs: BTreeSet<OrdBlockId>

The “best” intersection between the successors of the different direct children of the block. We use this to find switch exits candidates: if the intersection is non-empty and because the elements are topologically sorted, the first block in the set should be the exit. Note that we can ignore children when computing the intersection, which is why we call it the “best” intersection. For instance, in the following:

switch i {
  0 => x = 1,
  1 => x = 2,
  _ => panic,
}

The branches 0 and 1 have successors which intersect, but the branch 2 doesn’t because it terminates: we thus ignore it.

Trait Implementations

impl Clone for BlocksInfo

fn clone(&self) -> BlocksInfo

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BlocksInfo

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

Formats the value using the given formatter.