Function intersect

src/analysis/postdom/mod.rs:188–215

(
    post_order_rank: &IndexVec<Node, usize>,
    immediate_post_dominators: &IndexVec<Node, ExtNode<Node>>,
    end_nodes: &[Node],
    mut node1: Node,
    mut node2: Node,
)

}

fn intersect<Node: Idx>(
    post_order_rank: &IndexVec<Node, usize>,
    immediate_post_dominators: &IndexVec<Node, ExtNode<Node>>,
    end_nodes: &[Node],
    mut node1: Node,
    mut node2: Node,
) -> ExtNode<Node> {
    while node1 != node2 {
        if end_nodes.contains(&node1) && end_nodes.contains(&node2) {
            return ExtNode::Fake;
        }
        while post_order_rank[node1] < post_order_rank[node2] {
            match immediate_post_dominators[node1] {
                ExtNode::Real(Some(n)) => node1 = n,
                ExtNode::Real(None) | ExtNode::Fake => break,
            };
        }

        while post_order_rank[node2] < post_order_rank[node1] {
            match immediate_post_dominators[node2] {
                ExtNode::Real(Some(n)) => node2 = n,
                ExtNode::Real(None) | ExtNode::Fake => break,
            };
        }
    }

    ExtNode::Real(Some(node1))
}

#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum ExtNode<N: Idx> {