llvmgraph 0.1 · OCaml Package

Do not compute the Dom graph, it will fail. Using compute_all is fine, as long as you don't use the dom_graph closure.

module S : sig ... end

type idom = Llvm.llbasicblock -> Llvm.llbasicblock

type idoms = Llvm.llbasicblock -> Llvm.llbasicblock -> bool

type dom_tree = Llvm.llbasicblock -> Llvm.llbasicblock list

type dominators = Llvm.llbasicblock -> Llvm.llbasicblock list

type dom = Llvm.llbasicblock -> Llvm.llbasicblock -> bool

type sdom = Llvm.llbasicblock -> Llvm.llbasicblock -> bool

type dom_frontier = Llvm.llbasicblock -> Llvm.llbasicblock list

type dom_graph = unit -> Llvm.llvalue

type dom_functions = {

}

val compute_idom : 
  Llvm.llvalue ->
  Llvm.llbasicblock ->
  Llvm.llbasicblock ->
  Llvm.llbasicblock

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

val dominators_to_sdom : 
  (Llvm.llbasicblock -> S.t) ->
  S.elt ->
  Llvm.llbasicblock ->
  bool

val dom_to_sdom : 
  (Llvm.llbasicblock -> Llvm.llbasicblock -> bool) ->
  Llvm.llbasicblock ->
  Llvm.llbasicblock ->
  bool

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

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

val dominators_to_dom_tree : 
  Llvm.llvalue ->
  ?pred:(Llvm.llvalue -> S.elt -> S.elt list) ->
  (S.elt -> S.t) ->
  S.elt ->
  S.t

val idom_to_dom_tree : 
  Llvm.llvalue ->
  (Llvm.llbasicblock -> Llvm.llbasicblock) ->
  Llvm.llbasicblock ->
  Llvm.llbasicblock list

val idom_to_idoms : idom -> Llvm.llbasicblock -> Llvm.llbasicblock -> bool

val compute_dom_frontier : 
  Llvm.llvalue ->
  dom_tree ->
  idom ->
  Llvm.llbasicblock ->
  Llvm.llbasicblock list

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

val idom_to_dom : 
  (Llvm.llbasicblock -> Llvm.llbasicblock) ->
  Llvm.llbasicblock ->
  Llvm.llbasicblock ->
  bool

val compute_dom_graph : Llvm.llvalue -> dom_tree -> Llvm.llvalue

val compute_all : Llvm.llvalue -> Llvm.llbasicblock -> dom_functions

package llvmgraph