val make : initial_size:int -> unit -> 'a array_graphCreate an empty array_graph, specifying the initial size of the underlying array.
module IntSet = Util.IntSetval get_cond : 'a array_graph -> int -> Jib.cvalval get_vertex : 'a array_graph -> int -> ('a * IntSet.t * IntSet.t) optionval iter_graph : ('a -> IntSet.t -> IntSet.t -> unit) -> 'a array_graph -> unitval add_vertex : 'a -> 'a array_graph -> intAdd a vertex to a graph, returning the index of the inserted vertex. If the number of vertices exceeds the size of the underlying array, then it is dynamically resized.
val add_edge : int -> int -> 'a array_graph -> unitAdd an edge between two existing vertices. Raises Invalid_argument if either of the vertices do not exist.
val topsort : 'a array_graph -> int listtype cf_node = | CF_label of string| CF_block of Jib.instr list * terminator| CF_guard of int| CF_start of Jib.ctyp Jib_util.NameMap.t| CF_endval control_flow_graph :
Jib.instr list ->
int * int * ('a list * cf_node) array_graphval immediate_dominators : ?post:bool -> 'a array_graph -> int -> int arrayimmediate_dominators graph root will calculate the immediate dominators for a control flow graph with a specified root node.
module NameGraph : sig ... endval phi_dependencies :
(ssa_elem list * cf_node) array_graph ->
NameGraph.graph * int Jib_util.NameMap.tval ssa :
?globals:Jib_util.NameSet.t ->
?debug_prefix:string ->
Jib.instr list ->
int * int * (ssa_elem list * cf_node) array_graphConvert a list of instructions into SSA form
val make_dot :
Stdlib.out_channel ->
(ssa_elem list * cf_node) array_graph ->
unitOutput the control-flow graph in graphviz format for debugging. Can use 'dot -Tpng X.gv -o X.png' to generate a png image of the graph.
val make_dominators_dot :
Stdlib.out_channel ->
int array ->
(ssa_elem list * cf_node) array_graph ->
unit