Method compute_postorder

cranelift/codegen/src/dominator_tree/simple.rs:249–253

Reset all internal data structures and compute a post-order of the control flow graph. This leaves `rpo_number == 1` for all reachable blocks, 0 for unreachable ones.

(&mut self, func: &Function)

    ///
    /// This leaves `rpo_number == 1` for all reachable blocks, 0 for unreachable ones.
    fn compute_postorder(&mut self, func: &Function) {
        self.clear();
        self.nodes.resize(func.dfg.num_blocks());
        self.postorder.extend(self.dfs.post_order_iter(func));
    }

    /// Build a dominator tree from a control flow graph using Keith D. Cooper's
    /// "Simple, Fast Dominator Algorithm."