package sail

You can search for identifiers within the package.

in-package search v0.2.0

package sail

sail
- Anf
- Ast
- Ast_util
  - BE
  - BESet
  - Bindings
  - Id
  - IdSet
  - KBindings
  - KOpt
  - KOptMap
  - KOptSet
  - Kid
  - KidSet
  - Kind
  - NC
  - NCMap
  - Nexp
  - NexpMap
  - NexpSet
  - Typ
  - TypMap
- Bitfield
- C_backend
- Cgen_backend
- Constant_fold
  - StringMap
- Constant_propagation
- Constant_propagation_mutrec
- Constraint
- Elf_loader
- Error_format
- Graph
  - Make
    
    Ord
  - OrderedType
  - S
- Initial_check
- Interactive
- Interpreter
- Jib
- Jib_compile
  - Config
  - Make
    
    C
- Jib_interactive
- Jib_ir
  - Flat_ir_config
  - Flat_ir_formatter
  - Ir_formatter
    
    Config
    
    Make
    
    C
  - StringMap
- Jib_optimize
- Jib_smt
  - EventMap
  - IntSet
  - Make_optimizer
    
    S
  - Sequence
- Jib_ssa
  - IntSet
- Jib_util
  - CT
  - CTMap
  - CTSet
  - Name
  - NameCT
  - NameCTMap
  - NameCTSet
  - NameMap
  - NameSet
  - UBindings
  - UId
- Latex
  - StringSet
- Lexer
  - M
- Manifest
- Monomorphise
- Nl_flow
- Ocaml_backend
- Optimize
- Parse_ast
- Parser
- Parser_combinators
- Pattern_completeness
- Pretty_print
- Pretty_print_common
- Pretty_print_coq
  - StringSet
- Pretty_print_lem
  - StringSet
- Pretty_print_sail
- Process_file
- Profile
- Property
  - Event
- Reporting
- Rewriter
- Rewrites
- Sail2_values
- Sail_lib
  - BitType
  - Mem
- Scattered
- Smtlib
- Spec_analysis
- Specialize
- State
- ToFromInterp_backend
- ToFromInterp_lib_bitlist
  - Make
    
    BitT
- ToFromInterp_lib_mword
- Type_check
  - Env
- Type_error
- Util
- Value
  - StringMap

Legend:
Library
Module
Module type
Parameter
Class
Class type

type 'a array_graph

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

module IntSet : sig ... end

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

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

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

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

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

exception Not_a_DAG of int

val topsort : 'a array_graph -> int list

type terminator =

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

type 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

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

val immediate_dominators : 'a array_graph -> int -> int array

type ssa_elem =

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

val ssa : Jib.instr list -> int * (ssa_elem list * cf_node) array_graph

val make_dot : 
  Stdlib.out_channel ->
  (ssa_elem list * cf_node) array_graph ->
  unit

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