package arrayjit

You can search for identifiers within the package.

in-package search v0.2.0

package arrayjit

arrayjit
- Arrayjit
  - Assignments
  - Backends
    
    Backend
    
    Cuda_backend
    
    Gccjit_backend
    
    Gccjit_device
    
    Multicore_backend
    
    Backend
    
    No_device_backend
  - Cuda_backend
  - Gccjit_backend
    
    Variants_of_mem_properties
  - Indexing
    
    CompareSymbol
    
    Symbol
    
    Variants_of_axis_index
    
    Variants_of_symbol
  - Low_level
    
    Scope_id
    
    Variants_of_visits
  - Ndarray
  - Ops
  - Rand
    
    Lib
    
    Random
    
    Random_for_tests
  - Tnode
    
    Registry
  - Utils
    
    Debug_runtime
    
    Lazy
    
    Set_O
arrayjit.ppx_arrayjit
- Ppx_arrayjit
  - Ppx_helper

Legend:
Library
Module
Module type
Parameter
Class
Class type

The code for operating on n-dimensional arrays.

module Lazy = Utils.Lazy

module Tn = Tnode

module Debug_runtime = Utils.Debug_runtime

type fetch_op =

| Constant of Base.float
| Imported of Ops.global_identifier
| Slice of {
1. batch_idx : Indexing.static_symbol;
2. sliced : Tn.t;
}
| Embed_symbol of Indexing.static_symbol

Resets a array by performing the specified computation or data fetching.

and t =

| Noop
| Seq of t * t
| Block_comment of Base.string * t
(*
Same as the given code, with a comment.
*)
| Accum_binop of {
1. initialize_neutral : Base.bool;
2. accum : Ops.binop;
3. op : Ops.binop;
4. lhs : Tn.t;
5. rhs1 : Tn.t;
6. rhs2 : Tn.t;
7. projections : Indexing.projections Lazy.t;
}
| Accum_unop of {
1. initialize_neutral : Base.bool;
2. accum : Ops.binop;
3. op : Ops.unop;
4. lhs : Tn.t;
5. rhs : Tn.t;
6. projections : Indexing.projections Lazy.t;
}
| Fetch of {
1. array : Tn.t;
2. fetch_op : fetch_op;
3. dims : Base.int Base.array Lazy.t;
}

val sexp_of_fetch_op : fetch_op -> Sexplib0.Sexp.t

val sexp_of_t : t -> Sexplib0.Sexp.t

val is_noop : t -> bool

val get_name_exn : t -> Base.String.t

val recurrent_nodes : t -> (Tn.t, Tn.comparator_witness) Base.Set.t

val remove_updates : Tn.t -> t -> t

val sequential : t Base.List.t -> t

val to_low_level : t -> Low_level.t

val flatten : t -> t Base__List.t

val fprint_hum : 
  ?ident_style:
    [< `Heuristic_ocannl | `Name_and_label | `Name_only Heuristic_ocannl ] ->
  ?name:string ->
  ?static_indices:Indexing.static_symbol list ->
  unit ->
  Stdlib.Format.formatter ->
  t ->
  unit

val compile_proc : 
  unoptim_ll_source:Stdlib.Format.formatter Base.Option.t ->
  ll_source:Stdlib.Format.formatter Base.Option.t ->
  cd_source:Stdlib.Format.formatter option ->
  name:Base.string ->
  Indexing.static_symbol Base.list ->
  t ->
  (Tn.t, Low_level.traced_array) Base.Hashtbl.t * Low_level.t