Module `Libsail.Jib_ssa`Source

Sourceval ssa_name : int -> Jib.name -> Jib.name

Sourceval unssa_name : Jib.name -> Jib.name * int

Sourcetype 'a array_graph

A mutable array based graph type, with nodes indexed by integers.

Sourceval make : initial_size:int -> unit -> 'a array_graph

Create an empty array_graph, specifying the initial size of the underlying array.

Sourcemodule IntSet = Util.IntSet

Sourceval get_cond : 'a array_graph -> int -> Jib.cval

Sourceval get_vertex : 'a array_graph -> int -> ('a * IntSet.t * IntSet.t) option

Sourceval iter_graph : ('a -> IntSet.t -> IntSet.t -> unit) -> 'a array_graph -> unit

Sourceval add_vertex : 'a -> 'a array_graph -> int

Add 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.

Sourceval add_edge : int -> int -> 'a array_graph -> unit

Add an edge between two existing vertices. Raises Invalid_argument if either of the vertices do not exist.

Sourceexception Not_a_DAG of int

Sourceval topsort : 'a array_graph -> int list

Sourcetype terminator =

| T_undefined of Jib.ctyp
| T_exit of string
| T_end of Jib.name
| T_goto of string
| T_jump of int * string
| T_label of string
| T_none

Sourcetype 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_end

Source

val control_flow_graph : 
  Jib.instr list ->
  int * int * ('a list * cf_node) array_graph

Sourceval immediate_dominators : ?post:bool -> 'a array_graph -> int -> int array

immediate_dominators graph root will calculate the immediate dominators for a control flow graph with a specified root node.

Sourcetype ssa_elem =

| Phi of Jib.name * Jib.ctyp * Jib.name list
| Pi of Jib.cval list

Sourcemodule NameGraph : sig ... end

Source

val phi_dependencies : 
  (ssa_elem list * cf_node) array_graph ->
  NameGraph.graph * int Jib_util.NameMap.t

Source

val ssa : 
  ?globals:Jib_util.NameSet.t ->
  ?debug_prefix:string ->
  Jib.instr list ->
  int * int * (ssa_elem list * cf_node) array_graph

Convert a list of instructions into SSA form

Sourceval make_dot : out_channel -> (ssa_elem list * cf_node) array_graph -> unit

Output 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.

Source

val make_dominators_dot : 
  out_channel ->
  int array ->
  (ssa_elem list * cf_node) array_graph ->
  unit

package libsail

Module Libsail.Jib_ssaSource

Module `Libsail.Jib_ssa`Source