# Functor Dominator.Make

    module Make: functor (G : G) -> sig .. end

Parameters:

`G` | : | `G`

    module S: Set.S  with type elt = G.V.t

    type idom = G.V.t -> G.V.t

function from `n` to `n`'s immediate dominator

    type idoms = G.V.t -> G.V.t -> bool

`idoms x y` is true when `x` is `y`'s immediate dominator

    type dom_tree = G.V.t -> G.V.t list

function from `x` to a list of nodes immediately dominated by `x`

    type dominators = G.V.t -> G.V.t list

function from node to a list of nodes that dominate it.

    type dom = G.V.t -> G.V.t -> bool

`dom x y` returns true iff `x` dominates `y`

    type sdom = G.V.t -> G.V.t -> bool

`sdom x y` returns true iff `x` strictly dominates `y`.

    type dom_frontier = G.V.t -> G.V.t list

function from `x` to a list of nodes not dominated by `x`, but with predecessors which are dominated by `x`

    type dom_graph = unit -> Dominator.G.t

`type ``dom_functions = {`

`` | `idom : `idom`;`
`` | `idoms : `idoms`;`
`` | `dom_tree : `dom_tree`;`
`` | `dominators : `dominators`;`
`` | `dom : `dom`;`
`` | `sdom : `sdom`;`
`` | `dom_frontier : `dom_frontier`;`
`` | `dom_graph : `dom_graph`;`

}

    val compute_idom : Dominator.G.t -> G.V.t -> G.V.t -> G.V.t

Computes the dominator tree, using the Lengauer-Tarjan algorithm. `compute_idom cfg s0` returns a function `idom : V.t -> V.t` s.t. `idom x` returns the immediate dominator of `x`

    val dominators_to_dom : ('a -> S.t) -> S.elt -> 'a -> bool

Given a function from a node to it's dominators, returns a function `dom : V.t -> V.t -> bool` s.t. `dom x y` returns true when `x` dominates `y`

    val dominators_to_sdom : (G.V.t -> S.t) -> S.elt -> G.V.t -> bool

Given a function from a node to it's dominators, returns a function `sdom : V.t -> V.t -> bool` s.t. `sdom x y` returns true when `x` strictly dominates `y`

    val dom_to_sdom : (G.V.t -> G.V.t -> bool) -> G.V.t -> G.V.t -> bool

    val dominators_to_sdominators : (S.elt -> S.t) ->
           S.elt -> S.t

Given a a function from a node to it's dominators, returns a function from a node to it's strict dominators.

    val dominators_to_idoms : (S.elt -> S.t) ->
           S.elt -> S.elt -> bool

Given a function from a node to it's dominators, returns a function `idoms : G.V.t -> G.V.t -> bool` s.t. `idoms x y` returns true when `x` is the immediate dominator of `y`.

    val dominators_to_dom_tree : Dominator.G.t ->
           ?pred:(Dominator.G.t -> S.elt -> S.elt list) ->
           (S.elt -> S.t) ->
           S.elt -> S.t

Computes a dominator tree (function from x to a list of nodes immediately dominated by x) for the given CFG and dominator function. Note: The dominator tree is also called `IDom` by Muchnick. Note: If you are computing a post-dominator tree, then the optional argument pred should be G.succ.

    val idom_to_dom_tree : Dominator.G.t -> (G.V.t -> G.V.t) -> G.V.t -> G.V.t list

Computes a dominator tree (function from x to a list of nodes immediately dominated by x) for the given CFG and idom function.

    val idom_to_idoms : idom -> G.V.t -> G.V.t -> bool

    val compute_dom_frontier : Dominator.G.t ->
           dom_tree -> idom -> G.V.t -> G.V.t list

Computes the dominance frontier. As specified in section 19.1 of Modern Compiler Implementation in ML by Andrew Appel.

    val idom_to_dominators : ('a -> 'a) -> 'a -> 'a list

    val idom_to_dom : (G.V.t -> G.V.t) -> G.V.t -> G.V.t -> bool

    val compute_dom_graph : Dominator.G.t -> dom_tree -> Dominator.G.t

    val compute_all : Dominator.G.t -> G.V.t -> dom_functions

Computes all dominance functions.

This function computes some things eagerly and some lazily, so don't worry about it doing extra work to compute functions you don't need, but also don't call it if you aren't going to use anything it returns.
Returns a record containing all dominance functions for the given graph and entry node.