package sail

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

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

Parameters

module Ord : OrderedType

Signature

type node = Ord.t

type graph = Stdlib.Set.Make(Ord).t Stdlib.Map.Make(Ord).t

type node_set = Stdlib.Set.Make(Ord).t

val leaves : graph -> node_set

val empty : graph

val add_edge : node -> node -> graph -> graph

val add_edges : node -> node list -> graph -> graph

val children : graph -> node -> node list

val reachable : node_set -> node_set -> graph -> node_set

val prune : node_set -> node_set -> graph -> graph

val remove_self_loops : graph -> graph

val reverse : graph -> graph

exception Not_a_DAG of node * graph

val topsort : graph -> node list

val scc : ?original_order:node list -> graph -> node list list

val make_dot : 
  (node -> string) ->
  (node -> node -> string) ->
  (node -> string) ->
  Stdlib.out_channel ->
  graph ->
  unit