text
stringlengths 12
786k
|
|---|
let to_int32 x = Constant . to_int32 x |
let zero w = Bits0 . create w |
let pp fmt t = Caml . Format . fprintf fmt " % s " ( to_bstr t ) |
module _ = Pretty_printer . Register ( struct type nonrec t = Bits0 . t let module_name = " Hardcaml . Bits " let to_string = to_bstr end ) |
module T = struct open Bin_prot . Std module For_sexp = struct type t = { width : int ; data : bytes } [ @@ deriving sexp ] end type t = bytes [ @@ deriving compare , bin_io ] let width t = Int64 . to_int_trunc ( Bytes . unsafe_get_int64 t 0 ) let offset_for_data = 8 let sexp_of_t ( t : t ) = For_sexp . sexp_of_t { width = Int64 . to_int_trunc ( Bytes . unsafe_get_int64 t 0 ) ; data = Bytes . subo ~ pos : offset_for_data t } ; ; let t_of_sexp sexp = let for_sexp = For_sexp . t_of_sexp sexp in let t = Caml . Bytes . make ( Bytes . length for_sexp . data ) ' \ 000 ' in Bytes . unsafe_set_int64 t 0 ( Int64 . of_int for_sexp . width ) ; Bytes . blito ~ src : for_sexp . data ~ dst : t ~ dst_pos : offset_for_data ( ) ; t ; ; end |
module Comparable = Comparable . Make ( T ) |
let words_of_width width = ( width + bits_per_word - 1 ) lsr log_bits_per_word |
let bytes_of_width width = words_of_width width lsl shift_bytes_to_words |
let words t = words_of_width ( width t ) |
let number_of_data_bytes t = Bytes . length t - 8 |
let create width = let bytes = Bytes . make ( ( words_of_width width + 1 ) lsl shift_bytes_to_words ) ' \ 000 ' in Bytes . unsafe_set_int64 bytes 0 ( Int64 . of_int width ) ; bytes ; ; |
let empty = create 0 |
let unsafe_get_byte ( t : t ) i = Bytes . unsafe_get t ( offset_for_data + i ) |
let unsafe_get_int64 ( t : t ) i = Bytes . unsafe_get_int64 t ( ( i lsl shift_bytes_to_words ) + offset_for_data ) ; ; |
let unsafe_set_int64 ( t : t ) i x = Bytes . unsafe_set_int64 t ( ( i lsl shift_bytes_to_words ) + offset_for_data ) x ; ; |
let mask ( t : t ) = let width = width t in let bits = width land width_mask in if bits <> 0 then ( let mask = Int64 . ( lsr ) ( - 1L ) ( 64 - bits ) in let word_pos = ( width - 1 ) lsr log_bits_per_word in let x = Int64 . ( land ) ( unsafe_get_int64 t word_pos ) mask in unsafe_set_int64 t word_pos x ) ; ; |
let init_byte ~ width ~ f = let t = create width in let num_bytes = words_of_width width lsl shift_bytes_to_words in for i = 0 to num_bytes - 1 do Bytes . unsafe_set t ( i + offset_for_data ) ( f i ) done ; mask t ; t ; ; |
let init_int64 ~ width ~ f = let t = create width in let num_words = words_of_width width in for i = 0 to num_words - 1 do unsafe_set_int64 t i ( f i ) done ; mask t ; t ; ; |
module type Bits = sig type t [ @@ deriving compare , sexp_of ] include Comb . S with type t := t include Comparator . S with type t := t val number_of_data_bytes : t -> int val unsafe_get_int64 : t -> int -> int64 val unsafe_set_int64 : t -> int -> int64 -> unit module Expert : sig val unsafe_underlying_repr : t -> bytes val offset_for_data : int end module Mutable : sig type bits type t = private bytes val empty : t val width : t -> int val to_string : t -> string val create : int -> t val copy : src : t -> dst : t -> unit val copy_bits : src : bits -> dst : t -> unit val num_words : t -> int val unsafe_get_int64 : t -> int -> int64 val unsafe_set_int64 : t -> int -> int64 -> unit val to_bits : t -> bits val of_constant : Constant . t -> t val to_constant : t -> Constant . t val vdd : t val gnd : t val wire : int -> t val ( -- ) : t -> string -> t val ( &: ) : t -> t -> t -> unit val ( |: ) : t -> t -> t -> unit val ( ^: ) : t -> t -> t -> unit val ( ~: ) : t -> t -> unit val ( +: ) : t -> t -> t -> unit val ( -: ) : t -> t -> t -> unit val ( ==: ) : t -> t -> t -> unit val ( <>: ) : t -> t -> t -> unit val ( <: ) : t -> t -> t -> unit val mux : t -> t -> t list -> unit val concat : t -> t list -> unit val concat_rev_array : t -> t array -> unit val select : t -> t -> int -> int -> unit val ( *: ) : t -> t -> t -> unit val ( *+ ) : t -> t -> t -> unit val mask : t -> unit module Comb : Comb . S with type t = t end with type bits := t val pp : Formatter . t -> t -> unit end |
let ( mod ) = Caml . ( mod ) |
let nbits = Int . num_bits - 1 |
let words bits = ( bits + nbits - 1 ) / nbits |
let word_index bit = bit / nbits |
let m = - 1 lsr 1 |
let mask_bits n = if n = 0 then m else m lsr ( nbits - n ) |
let mask_bit n = 1 lsl n |
let bo2 = nbits / 2 |
let mask_lo = mask_bits bo2 |
let mask_hi = mask_bits bo2 lsl bo2 |
let half_lo x = x land mask_lo |
let half_hi x = ( x land mask_hi ) lsr bo2 |
let cbit = mask_bit bo2 |
let create_words bits = Array . create ~ len ( : words bits ) 0 |
let words_of_int bits i = let b = create_words bits in b . ( 0 ) <- i land m ; b ; ; |
let get_word a n = a . ( n ) |
let set_word a n w = a . ( n ) <- w land m |
module type Integer = sig include Int . S val nbits : int end |
let convert_abits_and_string ( type t ) ( module X : Integer with type t = t ) = let ( . | ) = X . ( lor ) in let ( . & ) = X . ( land ) in let ( . << ) = X . shift_left in let one = X . of_int_exn 1 in let of_bstr b = let width = String . length b in let words = ( width + X . nbits - 1 ) / X . nbits in let a = Array . create ~ len : words X . zero in let rec build n = let word = n / X . nbits in let bit = n mod X . nbits in if Char . equal b . [ width - n - 1 ] ' 1 ' then a . ( word ) <- a . ( word ) . | ( one . << bit ) ; if n <> 0 then build ( n - 1 ) in build ( width - 1 ) ; a in let to_bstr ~ width a = if width = 0 then " " else ( let b = Bytes . make width ' 0 ' in let rec build n = let word = n / X . nbits in let bit = n mod X . nbits in if not ( X . equal ( a . ( word ) . & ( one . << bit ) ) X . zero ) then Bytes . set b ( width - n - 1 ) ' 1 ' ; if n <> 0 then build ( n - 1 ) in build ( width - 1 ) ; Bytes . to_string b ) in of_bstr , to_bstr ; ; |
module XInt = struct include Int let nbits = num_bits - 1 end |
let abits_int_of_bstr , bstr_of_abits_int = convert_abits_and_string ( module XInt ) |
module T = struct type t = int array * int [ @@ deriving compare ] let equal = [ % compare . equal : t ] let empty = create_words 0 , 0 let width = snd let is_empty ( _ , width ) = width = 0 let to_string x = bstr_of_abits_int ~ width ( : width x ) ( fst x ) let to_int ( data , width ) = if width <= nbits then data . ( 0 ) else data . ( 0 ) lor ( data . ( 1 ) lsl nbits ) ; ; let to_bstr x = bstr_of_abits_int ~ width ( : width x ) ( fst x ) let sexp_of_t s = [ % sexp ( to_bstr s : string ) ] let mask s = let width = width s in let top_word = word_index ( width - 1 ) in let s = fst s in let mask = mask_bits ( width mod nbits ) in set_word s top_word ( get_word s top_word land mask ) ; s , width ; ; let of_constant c = Constant . to_binary_string c |> abits_int_of_bstr , Constant . width c let to_constant ( b , width ) = bstr_of_abits_int ~ width b |> Constant . of_binary_string let ( -- ) a _ = a let vdd = let c = create_words 1 in set_word c 0 ( mask_bit 0 ) ; c , 1 ; ; let gnd = create_words 1 , 1 let op2 op a b = let width = width a in let words = words width in let a = fst a in let b = fst b in let c = create_words width in for i = 0 to words - 1 do set_word c i ( op ( get_word a i ) ( get_word b i ) ) done ; mask ( c , width ) ; ; let ( &: ) = op2 ( land ) let ( |: ) = op2 ( lor ) let ( ^: ) = op2 ( lxor ) let ( ~: ) a = let width = width a in let words = words width in let a = fst a in let c = create_words width in for i = 0 to words - 1 do set_word c i ( lnot ( get_word a i ) ) done ; mask ( c , width ) ; ; let ( +: ) a b = let carry = ref zero in let set_carry x = if not ( x land cbit = 0 ) then carry := 1 else carry := 0 in op2 ( fun a b -> let a ' = half_lo a in let b ' = half_lo b in let c_lo = a ' + b ' + ! carry in set_carry c_lo ; let a ' = half_hi a in let b ' = half_hi b in let c_hi = a ' + b ' + ! carry in set_carry c_hi ; ( c_hi lsl bo2 ) lor half_lo c_lo ) a b ; ; let ( -: ) a b = let borrow = ref zero in let set_borrow x = if not ( x land cbit = 0 ) then borrow := 1 else borrow := 0 in op2 ( fun a b -> let a ' = half_lo a in let b ' = half_lo b in let c_lo = a ' - b ' - ! borrow in set_borrow c_lo ; let a ' = half_hi a in let b ' = half_hi b in let c_hi = a ' - b ' - ! borrow in set_borrow c_hi ; ( c_hi lsl bo2 ) lor half_lo c_lo ) a b ; ; let iterback op a b = let words = words ( width a ) in let a = fst a in let b = fst b in for i = words - 1 downto 0 do op ( get_word a i ) ( get_word b i ) done ; ; let ( ==: ) a b = let eq = ref true in iterback ( fun a b -> if not ( a = b ) then eq := false ) a b ; if ! eq then vdd else gnd ; ; let ( <: ) a b = let cmp = ref 0 in let set_cmp a b = if ! cmp = 0 then if Int . compare a b > 0 then cmp := 1 else if Int . compare a b < 0 then cmp := - 1 in iterback ( fun a b -> let a ' = half_hi a in let b ' = half_hi b in set_cmp a ' b ' ; let a ' = half_lo a in let b ' = half_lo b in set_cmp a ' b ' ) a b ; if ! cmp = - 1 then vdd else gnd ; ; let mux sel l = let len = List . length l in let idx = to_int sel in let idx = if idx >= len then len - 1 else idx in List . nth_exn l idx ; ; let concat_msb l = let c_width = List . fold l ~ init : 0 ~ f ( : fun a b -> a + width b ) in let c_words = words c_width in let c = create_words c_width in let cat a b = let a_width , a_words = width a , words ( width a ) in let b_width , b_words = width b , words ( width b ) in let a_bits = a_width mod nbits in let a , b = fst a , fst b in if a_bits = 0 then for i = 0 to b_words - 1 do set_word a ( a_words + i ) ( get_word b i ) done else ( let merge x y = x lor ( y lsl a_bits ) , y lsr ( nbits - a_bits ) in for i = 0 to b_words - 1 do let x , y = merge ( get_word a ( a_words - 1 + i ) ) ( get_word b i ) in set_word a ( a_words - 1 + i ) x ; if a_words + i < c_words then set_word a ( a_words + i ) y done ) ; c , a_width + b_width in let l = List . rev l in if List . is_empty l then empty else ( let c = cat ( c , 0 ) ( List . hd_exn l ) in List . fold ( List . tl_exn l ) ~ init : c ~ f ( : fun c a -> cat c a ) ) ; ; let select s h l = let c_width = h - l + 1 in let c_words = words c_width in let s_bits = l mod nbits in let c = create_words c_width in let lo_word = word_index l in let hi_word = word_index h in let s = fst s in let merge i = let a = get_word s i in let b = if i >= hi_word then zero else get_word s ( i + 1 ) in ( a lsr s_bits ) lor ( b lsl ( nbits - s_bits ) ) in if s_bits = 0 then for i = 0 to c_words - 1 do set_word c i ( get_word s ( lo_word + i ) ) done else for i = 0 to c_words - 1 do set_word c i ( merge ( lo_word + i ) ) done ; mask ( c , h - l + 1 ) ; ; let ( @: ) a b = concat_msb [ a ; b ] let of_int bits n = words_of_int bits n , bits let zero n = of_int n 0 let uresize x w = if width x = w then x else if width x > w then select x ( w - 1 ) 0 else zero ( w - width x ) @: x ; ; let msb a = let n = width a - 1 in select a n n ; ; let negate x = zero ( width x ) -: x let se a = msb a @: a let umul n a b = let wc = width a + width b in let ( +: ) a b = let w = max ( width a ) ( width b ) + 1 in let a , b = uresize a w , uresize b w in a +: b in let rec split s = if width s <= n then [ s ] else select s ( n - 1 ) 0 :: split ( select s ( width s - 1 ) n ) in let a , b = split a , split b in let sums = let ( * ) a b = of_int ( n * 2 ) ( to_int a * to_int b ) in let rec map2 f a b = match a , b with | a ' :: a ' ' , b ' :: b ' ' -> f a ' b ' :: map2 f a ' ' b ' ' | [ ] , _ -> b | _ , [ ] -> a in let rec prod_a a b = match a with | a ' :: a ' ' -> ( a ' * b ) :: prod_a a ' ' b | [ ] -> [ ] in let rec prod_b a b prev = match b with | b ' :: b ' ' -> let a ' = prod_a a b ' in let a ' = map2 ( +: ) a ' prev in List . hd_exn a ' :: prod_b a b ' ' ( List . tl_exn a ' ) | [ ] -> prev in prod_b a b [ ] in let scale s n = if n = 0 then s else s @: zero n in let c , _ = List . fold sums ~ init ( : gnd , 0 ) ~ f ( : fun ( acc , scl ) e -> acc +: scale e scl , scl + n ) in let c = select c ( wc - 1 ) 0 in c ; ; let smul n a b = let to_bool x = to_int x <> 0 in let wa , wb = width a , width b in let na , nb = to_bool ( msb a ) , to_bool ( msb b ) in let a = if na then negate ( se a ) else a in let b = if nb then negate ( se b ) else b in let c = umul n a b in let c = if Bool . equal na nb then c else negate c in select c ( wa + wb - 1 ) 0 ; ; let ( *: ) = umul 15 let ( *+ ) = smul 15 end |
module Mutable = struct module T = struct type t = T . t [ @@ deriving compare ] let equal = T . equal let empty = T . empty let is_empty = T . is_empty let width = T . width let data s = fst s let to_string = T . to_string let to_int = T . to_int let to_bstr = T . to_bstr let mask s = let width = width s in let top_word = word_index ( width - 1 ) in let mask = mask_bits ( width mod nbits ) in set_word ( data s ) top_word ( get_word ( data s ) top_word land mask ) ; ; let create w = create_words w , w let copy ~ src ~ dst = assert ( width src = width dst ) ; for i = 0 to words ( width src ) - 1 do set_word ( data dst ) i ( get_word ( data src ) i ) done ; ; let copy_bits = copy let to_bits t = let result = create ( width t ) in copy ~ src : t ~ dst : result ; result ; ; let wire _ = empty let ( -- ) a _ = a let vdd = of_bit_string " 1 " let gnd = of_bit_string " 0 " let op2 op c a b = let width = width a in let words = words width in for i = 0 to words - 1 do set_word ( data c ) i ( op ( get_word ( data a ) i ) ( get_word ( data b ) i ) ) done ; mask c ; ; let ( &: ) = op2 ( land ) let ( |: ) = op2 ( lor ) let ( ^: ) = op2 ( lxor ) let ( ~: ) c a = let width = width a in let words = words width in let a = data a in for i = 0 to words - 1 do set_word ( data c ) i ( lnot ( get_word a i ) ) done ; mask c ; ; let ( +: ) c a b = let carry = ref 0 in let set_carry x = if not ( x land cbit = 0 ) then carry := 1 else carry := 0 in op2 ( fun a b -> let a ' = half_lo a in let b ' = half_lo b in let c_lo = a ' + b ' + ! carry in set_carry c_lo ; let a ' = half_hi a in let b ' = half_hi b in let c_hi = a ' + b ' + ! carry in set_carry c_hi ; ( c_hi lsl bo2 ) lor half_lo c_lo ) c a b ; ; let ( -: ) c a b = let borrow = ref 0 in let set_borrow x = if not ( x land cbit = 0 ) then borrow := 1 else borrow := 0 in op2 ( fun a b -> let a ' = half_lo a in let b ' = half_lo b in let c_lo = a ' - b ' - ! borrow in set_borrow c_lo ; let a ' = half_hi a in let b ' = half_hi b in let c_hi = a ' - b ' - ! borrow in set_borrow c_hi ; ( c_hi lsl bo2 ) lor half_lo c_lo ) c a b ; ; let iterback op a b = let words = words ( width a ) in let a = data a in let b = data b in for i = words - 1 downto 0 do op ( get_word a i ) ( get_word b i ) done ; ; let ( ==: ) c a b = let eq = ref true in iterback ( fun a b -> if not ( a = b ) then eq := false ) a b ; if ! eq then copy ~ dst : c ~ src : vdd else copy ~ dst : c ~ src : gnd ; ; let ( <>: ) c a b = let neq = ref false in iterback ( fun a b -> if not ( a = b ) then neq := true ) a b ; if ! neq then copy ~ dst : c ~ src : vdd else copy ~ dst : c ~ src : gnd ; ; let ( <: ) c a b = let cmp = ref 0 in let set_cmp a b = if ! cmp = 0 then if Int . compare a b > 0 then cmp := 1 else if Int . compare a b < 0 then cmp := - 1 in iterback ( fun a b -> let a ' = half_hi a in let b ' = half_hi b in set_cmp a ' b ' ; let a ' = half_lo a in let b ' = half_lo b in set_cmp a ' b ' ) a b ; if ! cmp = - 1 then copy ~ dst : c ~ src : vdd else copy ~ dst : c ~ src : gnd ; ; let mux c sel l = let len = List . length l in let idx = to_int sel in let idx = if idx >= len then len - 1 else idx in copy ~ dst : c ~ src ( : List . nth_exn l idx ) ; ; let concat c l = let c_width = List . fold l ~ init : 0 ~ f ( : fun a b -> a + width b ) in assert ( c_width = width c ) ; let c_words = words c_width in let c_with l = data c , l in let cat a b = let a_width , a_words = width a , words ( width a ) in let b_width , b_words = width b , words ( width b ) in let a_bits = a_width mod nbits in let a , b = data a , data b in if a_bits = 0 then for i = 0 to b_words - 1 do set_word a ( a_words + i ) ( get_word b i ) done else ( let merge x y = x lor ( y lsl a_bits ) , y lsr ( nbits - a_bits ) in for i = 0 to b_words - 1 do let x , y = merge ( get_word a ( a_words - 1 + i ) ) ( get_word b i ) in set_word a ( a_words - 1 + i ) x ; if a_words + i < c_words then set_word a ( a_words + i ) y done ) ; c_with ( a_width + b_width ) in let l = List . rev l in if List . is_empty l then ( ) else ( let c = cat ( c_with 0 ) ( List . hd_exn l ) in ignore ( List . fold ( List . tl_exn l ) ~ init : c ~ f ( : fun c a -> cat c a ) : t ) ) ; ; let select c s h l = let c_width = h - l + 1 in assert ( c_width = width c ) ; let c_words = words c_width in let s_bits = l mod nbits in let lo_word = word_index l in let hi_word = word_index h in let s = data s in let merge i = let a = get_word s i in let b = if i >= hi_word then 0 else get_word s ( i + 1 ) in ( a lsr s_bits ) lor ( b lsl ( nbits - s_bits ) ) in if s_bits = 0 then for i = 0 to c_words - 1 do set_word ( data c ) i ( get_word s ( lo_word + i ) ) done else for i = 0 to c_words - 1 do set_word ( data c ) i ( merge ( lo_word + i ) ) done ; mask c ; ; let ( *: ) c a b = let d = T . ( a *: b ) in copy ~ dst : c ~ src : d ; ; let ( *+ ) c a b = let d = T . ( a *+ b ) in copy ~ dst : c ~ src : d ; ; let num_words t = words ( width t ) let get_word ( t , _ ) i = get_word t i let set_word ( t , _ ) i w = set_word t i w end include T module Comb = Comb . Make ( struct type t = T . t let equal = T . equal let mk1 w f a = let x = T . create w in f x a ; x ; ; let mk2 w f a b = let x = T . create w in f x a b ; x ; ; let mk3 w f a b c = let x = T . create w in f x a b c ; x ; ; let empty = T . empty let is_empty = T . is_empty let width = T . width let of_constant c = Constant . to_binary_string c |> abits_int_of_bstr , Constant . width c let to_constant ( b , width ) = bstr_of_abits_int ~ width b |> Constant . of_binary_string let concat_msb l = let w = List . fold l ~ init : 0 ~ f ( : fun w y -> w + width y ) in mk1 w T . concat l ; ; let mux s l = let w = width ( List . hd_exn l ) in mk2 w T . mux s l ; ; let select s h l = let w = h - l + 1 in mk3 w T . select s h l ; ; let ( -- ) = T . ( -- ) let ( &: ) a = mk2 ( width a ) T . ( &: ) a let ( |: ) a = mk2 ( width a ) T . ( |: ) a let ( ^: ) a = mk2 ( width a ) T . ( ^: ) a let ( ~: ) a = mk1 ( width a ) T . ( ~: ) a let ( +: ) a = mk2 ( width a ) T . ( +: ) a let ( -: ) a = mk2 ( width a ) T . ( -: ) a let ( *: ) a b = mk2 ( width a + width b ) T . ( *: ) a b let ( *+ ) a b = mk2 ( width a + width b ) T . ( *+ ) a b let ( ==: ) = mk2 1 T . ( ==: ) let ( <: ) = mk2 1 T . ( <: ) let to_string = T . to_string let sexp_of_t s = [ % sexp ( to_constant s |> Constant . to_binary_string : string ) ] end ) end |
let pp fmt t = Caml . Format . fprintf fmt " % s " ( to_bstr t ) |
module PP = Pretty_printer . Register ( struct type nonrec t = t let module_name = " Hardcaml . Bits " let to_string = to_bstr end ) |
type t = { mutable vhd : IO . fd Vhd_format . F . Vhd . t option ; info : info ; id : string ; } |
let connect path = Lwt_unix . LargeFile . stat path >>= fun _ -> Lwt . catch ( fun ( ) -> Lwt_unix . access path [ Lwt_unix . W_OK ] >>= fun ( ) -> return true ) ( fun _ -> return false ) >>= fun read_write -> Vhd_IO . openchain path read_write >>= fun vhd -> let open Vhd_format . F in let sector_size = 512 in let size_sectors = Int64 . div vhd . Vhd . footer . Footer . current_size 512L in let info = Mirage_block . { read_write ; sector_size ; size_sectors } in let id = path in return ( { vhd = Some vhd ; info ; id } ) |
let disconnect t = match t . vhd with | None -> return ( ) | Some vhd -> Vhd_IO . close vhd >>= fun ( ) -> t . vhd <- None ; return ( ) |
let get_info t = return t . info |
let to_sectors bufs = let rec loop acc remaining = if Cstruct . len remaining = 0 then List . rev acc else let available = min 512 ( Cstruct . len remaining ) in loop ( Cstruct . sub remaining 0 available :: acc ) ( Cstruct . shift remaining available ) in List . concat ( List . map ( loop [ ] ) bufs ) |
let forall_sectors f offset bufs = let rec one offset = function | [ ] -> return ( ) | b :: bs -> f offset b >>= fun ( ) -> one ( Int64 . succ offset ) bs in one offset ( to_sectors bufs ) |
let zero = let buf = Cstruct . create 512 in for i = 0 to Cstruct . len buf - 1 do Cstruct . set_uint8 buf i 0 done ; buf |
let read t offset bufs = match t . vhd with | None -> return ( Rresult . R . error ` Disconnected ) | Some vhd -> forall_sectors ( fun offset sector -> ( Vhd_IO . read_sector vhd offset sector >>= function | false -> Cstruct . blit zero 0 sector 0 512 ; return ( ) | true -> return ( ) ) >>= fun ( ) -> return ( ) ) offset bufs >>= fun ( ) -> return ( Rresult . R . ok ( ) ) |
let write t offset bufs = match t . vhd with | None -> return ( Rresult . R . error ` Disconnected ) | Some vhd -> Vhd_IO . write vhd offset bufs >>= fun ( ) -> return ( Rresult . R . ok ( ) ) |
let mk_bmd_concept_with_loc desc loc = { concept_desc = desc ; concept_loc = loc ; } |
let mk_bmd_concept cname1 cname2 ctype = mk_bmd_concept_with_loc ( cname1 , cname2 , ctype ) ( Parsing . symbol_start_pos ( ) , Parsing . symbol_end_pos ( ) ) |
let mk_bmd_type_with_loc desc loc = { type_desc = desc ; type_loc = loc ; } |
let mk_bmd_type desc = mk_bmd_type_with_loc desc ( Parsing . symbol_start_pos ( ) , Parsing . symbol_end_pos ( ) ) |
let mk_bmd_string ( ) = mk_bmd_type BT_string |
let mk_bmd_int ( ) = mk_bmd_type BT_int |
let mk_bmd_real ( ) = mk_bmd_type BT_real |
let mk_bmd_boolean ( ) = mk_bmd_type BT_boolean |
let mk_bmd_date ( ) = mk_bmd_type BT_date |
let mk_bmd_duration ( ) = mk_bmd_type BT_duration |
let mk_bmd_rec fields = mk_bmd_type ( BT_rec fields ) |
let mk_bmd_enum values = mk_bmd_type ( BT_enum values ) |
let mk_bmd_ref cname = mk_bmd_type ( BT_ref cname ) |
let mk_bmd_schema_with_loc desc loc = { schema_desc = desc ; schema_loc = loc } |
let mk_bmd_schema desc = mk_bmd_schema_with_loc desc ( Parsing . symbol_start_pos ( ) , Parsing . symbol_end_pos ( ) ) |
let airplane = mk_bmd_concept " airplane " ( Some " business entity " ) ( mk_bmd_rec [ ( " airplane id " , mk_bmd_string ( ) ) ; ( " average engine pressure ratio " , mk_bmd_int ( ) ) ; ( " average engine rpm " , mk_bmd_int ( ) ) ; ( " engine warnings " , mk_bmd_int ( ) ) ; ] ) |
let airplane_event = mk_bmd_concept " airplane event " ( Some " business event " ) ( mk_bmd_rec [ ( " aircraft id " , mk_bmd_string ( ) ) ; ( " engine " , mk_bmd_ref " engine " ) ; ] ) |
let engine = mk_bmd_concept " engine " None ( mk_bmd_rec [ ( " pressure ratio " , mk_bmd_int ( ) ) ; ( " rpm " , mk_bmd_int ( ) ) ; ] ) |
let airline_schema = mk_bmd_schema [ airplane ; airplane_event ; engine ; ] |
let account_concept = mk_bmd_concept " account " ( Some " business entity " ) ( mk_bmd_rec [ ( " id " , mk_bmd_string ( ) ) ; ( " status " , mk_bmd_ref " account status " ) ; ] ) |
let account_status_concept = mk_bmd_concept " account status " None ( mk_bmd_enum [ " Excellent " ; " Good " ; " Fair " ; " Poor " ; " Risky " ; ] ) |
let transaction_concept = mk_bmd_concept " transaction " ( Some " business event " ) ( mk_bmd_rec [ ( " acount " , mk_bmd_ref " account " ) ; ( " amount " , mk_bmd_real ( ) ) ; ( " country code " , mk_bmd_string ( ) ) ; ] ) |
let authorization_response_concept = mk_bmd_concept " authorization response " ( Some " business event " ) ( mk_bmd_rec [ ( " account " , mk_bmd_ref " account " ) ; ( " message " , mk_bmd_string ( ) ) ; ( " transaction " , mk_bmd_string ( ) ) ; ] ) |
let creditcard_schema = mk_bmd_schema [ account_concept ; account_status_concept ; transaction_concept ; authorization_response_concept ; ] |
let rec find_fields cname spec = begin match spec with | [ ] | BC_concept _ :: _ | BC_enum _ :: _ -> [ ] | BC_field ( cname ' , fname , btype ) :: spec -> if ( cname ' = cname ) then ( fname , btype ) :: ( find_fields cname spec ) else ( find_fields cname spec ) end |
let bmd_rec_of_fields fields = mk_bmd_rec fields |
let bmd_concept_of_concept spec cname1 cname2 = let fields = find_fields cname1 spec in mk_bmd_concept cname1 cname2 ( bmd_rec_of_fields fields ) |
let bmd_concept_of_enum cname enumlist = mk_bmd_concept cname None ( mk_bmd_enum enumlist ) |
let rec bmd_concepts_of_spec spec = begin match spec with | [ ] -> [ ] | BC_concept ( cname1 , cname2 ) :: spec -> ( bmd_concept_of_concept spec cname1 cname2 ) :: ( bmd_concepts_of_spec spec ) | BC_enum ( cname , enumlist ) :: spec -> ( bmd_concept_of_enum cname enumlist ) :: ( bmd_concepts_of_spec spec ) | BC_field _ :: spec -> bmd_concepts_of_spec spec end |
let bmd_schema_of_spec spec = mk_bmd_schema ( bmd_concepts_of_spec spec ) |
let entity_value_of_bmd c = let ( en , clean_en ) = c in let syns = [ clean_en ; " the " ^ clean_en ] in { e_val_value = en ; e_val_metadata = None ; e_val_synonyms = syns ; e_val_created = None ; e_val_updated = None ; } |
let process_bmd_fields_from_type btype = begin match btype with | BT_rec rtype -> List . map fst rtype | BT_string | BT_int | BT_real | BT_boolean | BT_date | BT_duration | BT_enum _ | BT_ref _ -> [ ] end |
let process_bmd_enums_from_type btype = begin match btype with | BT_enum encontent -> encontent | BT_rec _ | BT_string | BT_int | BT_real | BT_boolean | BT_date | BT_duration | BT_ref _ -> [ ] end |
let bmd_type_of_concept c = let ( _ , _ , bt ) = c . concept_desc in bt |
let bmd_name_of_concept c = let ( bn , _ , _ ) = c . concept_desc in bn |
let process_bmd_fields bmd = let fields = List . concat ( List . map ( fun x -> process_bmd_fields_from_type ( bmd_type_of_concept x ) . type_desc ) bmd ) in process_entities fields |
let process_bmd_enums bmd = let fields = List . concat ( List . map ( fun x -> process_bmd_enums_from_type ( bmd_type_of_concept x ) . type_desc ) bmd ) in process_entities fields |
let process_bmd_entities bmd = let entities = List . map bmd_name_of_concept bmd in process_entities entities |
let entity_values_of_bmd bmd = List . map entity_value_of_bmd bmd |
let entities_of_bmd ( bmd : bmd_schema ) = let entity_of_bmd_entity = { e_def_entity = " entity " ; e_def_description = None ; e_def_source = None ; e_def_open_list = None ; e_def_values = entity_values_of_bmd ( process_bmd_entities bmd . schema_desc ) ; e_def_created = None ; e_def_metadata = None ; e_def_updated = None ; e_def_fuzzy_match = None ; } in let field_of_bmd_entity = { e_def_entity = " field " ; e_def_description = None ; e_def_source = None ; e_def_open_list = None ; e_def_values = entity_values_of_bmd ( process_bmd_fields bmd . schema_desc ) ; e_def_created = None ; e_def_metadata = None ; e_def_updated = None ; e_def_fuzzy_match = None ; } in let enum_of_bmd_entity = { e_def_entity = " enum " ; e_def_description = None ; e_def_source = None ; e_def_open_list = None ; e_def_values = entity_values_of_bmd ( process_bmd_enums bmd . schema_desc ) ; e_def_created = None ; e_def_metadata = None ; e_def_updated = None ; e_def_fuzzy_match = None ; } in [ entity_of_bmd_entity ; field_of_bmd_entity ; enum_of_bmd_entity ] |
let patch_workspace_with_bmd ws bmd = { ws with ws_entities = entities_of_bmd bmd ; } |
let patch_io_in workspace obmd = begin match obmd with | None -> workspace | Some bmd -> patch_workspace_with_bmd workspace bmd end |
let patch_wcs_workspace wcs_cred ws_id ws_name bmd = let ws = Wcs . workspace ws_name ~ entities ( : entities_of_bmd bmd ) ( ) in Wcs_call . update_workspace wcs_cred ws_id ws |
let bmd_find_entity entity_def_list entity_name = List . find ( fun x -> x . e_def_entity = entity_name ) entity_def_list |
let bmd_getentity_values bmd entity_name = try List . map ( fun ( x : Wcs_j . entity_value ) -> x . e_val_value ) ( ( bmd_find_entity ( entities_of_bmd bmd ) entity_name ) . e_def_values ) with Not_found -> [ ] |
type t = string list |
let is_empty = function [ ] -> true | _ -> false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.