text stringlengths 0 601k |
|---|
type shape = | Function | Lazy | Class | Module of shape array | Value of Obj . t |
let rec init_mod_field modu i loc shape = let init = match shape with | Function -> let rec fn ( x : ' a ) = let fn ' : ' a -> ' b = Obj . obj ( Obj . field modu i ) in if fn == fn ' then raise ( Undefined_recursive_module loc ) else fn ' x in Obj . repr fn | Lazy -> let rec l = lazy ( let l ' = Obj . obj ( Obj . field... |
let [ @ inline never ] init_mod loc shape = match shape with | Module comps -> Obj . repr ( init_mod_block loc comps ) | _ -> failwith " CamlinternalMod . init_mod : not a module " |
let rec update_mod_field modu i shape n = match shape with | Function | Lazy -> Obj . set_field modu i n | Value _ -> ( ) | Class -> assert ( Obj . tag n = 0 && Obj . size n = 4 ) ; let cl = Obj . field modu i in for j = 0 to 3 do Obj . set_field cl j ( Obj . field n j ) done | Module comps -> update_mod_block comps ( ... |
let [ @ inline never ] update_mod shape o n = match shape with | Module comps -> update_mod_block comps o n | _ -> failwith " CamlinternalMod . update_mod : not a module " |
let magic x = Sys . opaque_identity ( Obj . magic x ) |
let of_repr x = Sys . opaque_identity ( Obj . obj x ) |
let set_object_field ( arr : _ array ) field new_value = Array . unsafe_set ( Sys . opaque_identity arr ) field new_value |
let get_object_field ( arr : _ array ) field = Array . unsafe_get ( Sys . opaque_identity arr ) field |
let copy o = let o = ( of_repr ( dup ( repr o ) ) ) in set_id o |
type params = { mutable compact_table : bool ; mutable copy_parent : bool ; mutable clean_when_copying : bool ; mutable retry_count : int ; mutable bucket_small_size : int } |
let params = { compact_table = true ; copy_parent = true ; clean_when_copying = true ; retry_count = 3 ; bucket_small_size = 16 } |
type item = DummyA | DummyB | DummyC of int |
let _ = [ DummyA ; DummyB ; DummyC 0 ] |
let dummy_item = ( magic ( ) : item ) |
type t = DummyA | DummyB | DummyC of int |
let _ = [ DummyA ; DummyB ; DummyC 0 ] |
type obj = t array |
let public_method_label s : tag = let accu = ref 0 in for i = 0 to String . length s - 1 do accu := 223 * ! accu + Char . code s . [ i ] done ; accu := ! accu land ( 1 lsl 31 - 1 ) ; let tag = if ! accu > 0x3FFFFFFF then ! accu - ( 1 lsl 31 ) else ! accu in magic tag |
module Vars = Map . Make ( struct type t = string let compare ( x : t ) y = compare x y end ) |
type vars = int Vars . t |
module Meths = Map . Make ( struct type t = string let compare ( x : t ) y = compare x y end ) |
type meths = label Meths . t |
module Labs = Map . Make ( struct type t = label let compare ( x : t ) y = compare x y end ) |
type labs = bool Labs . t |
type table = { mutable size : int ; mutable methods : closure array ; mutable methods_by_name : meths ; mutable methods_by_label : labs ; mutable previous_states : ( meths * labs * ( label * item ) list * vars * label list * string list ) list ; mutable hidden_meths : ( label * item ) list ; mutable vars : vars ; mutab... |
let dummy_table = { methods = [ | dummy_item ] ; | methods_by_name = Meths . empty ; methods_by_label = Labs . empty ; previous_states = [ ] ; hidden_meths = [ ] ; vars = Vars . empty ; initializers = [ ] ; size = 0 } |
let table_count = ref 0 |
let dummy_met : item = of_repr ( new_block 0 0 ) |
let rec fit_size n = if n <= 2 then n else fit_size ( ( n + 1 ) / 2 ) * 2 |
let new_table pub_labels = incr table_count ; let len = Array . length pub_labels in let methods = Array . make ( len * 2 + 2 ) dummy_met in methods . ( 0 ) <- magic len ; methods . ( 1 ) <- magic ( fit_size len * Sys . word_size / 8 - 1 ) ; for i = 0 to len - 1 do methods . ( i * 2 + 3 ) <- magic pub_labels . ( i ) do... |
let resize array new_size = let old_size = Array . length array . methods in if new_size > old_size then begin let new_buck = Array . make new_size dummy_met in Array . blit array . methods 0 new_buck 0 old_size ; array . methods <- new_buck end |
let put array label element = resize array ( label + 1 ) ; array . methods . ( label ) <- element |
let method_count = ref 0 |
let inst_var_count = ref 0 |
let new_method table = let index = Array . length table . methods in resize table ( index + 1 ) ; index |
let get_method_label table name = try Meths . find name table . methods_by_name with Not_found -> let label = new_method table in table . methods_by_name <- Meths . add name label table . methods_by_name ; table . methods_by_label <- Labs . add label true table . methods_by_label ; label |
let get_method_labels table names = Array . map ( get_method_label table ) names |
let set_method table label element = incr method_count ; if Labs . find label table . methods_by_label then put table label element else table . hidden_meths <- ( label , element ) :: table . hidden_meths |
let get_method table label = try List . assoc label table . hidden_meths with Not_found -> table . methods . ( label ) |
let to_list arr = if arr == magic 0 then [ ] else Array . to_list arr |
let narrow table vars virt_meths concr_meths = let vars = to_list vars and virt_meths = to_list virt_meths and concr_meths = to_list concr_meths in let virt_meth_labs = List . map ( get_method_label table ) virt_meths in let concr_meth_labs = List . map ( get_method_label table ) concr_meths in table . previous_states ... |
let widen table = let ( by_name , by_label , saved_hidden_meths , saved_vars , virt_meths , vars ) = List . hd table . previous_states in table . previous_states <- List . tl table . previous_states ; table . vars <- List . fold_left ( fun s v -> Vars . add v ( Vars . find v table . vars ) s ) saved_vars vars ; table .... |
let new_slot table = let index = table . size in table . size <- index + 1 ; index |
let new_variable table name = try Vars . find name table . vars with Not_found -> let index = new_slot table in if name <> " " then table . vars <- Vars . add name index table . vars ; index |
let to_array arr = if arr = magic 0 then [ ] || else arr |
let new_methods_variables table meths vals = let meths = to_array meths in let nmeths = Array . length meths and nvals = Array . length vals in let res = Array . make ( nmeths + nvals ) 0 in for i = 0 to nmeths - 1 do res . ( i ) <- get_method_label table meths . ( i ) done ; for i = 0 to nvals - 1 do res . ( i + nmeth... |
let get_variable table name = try Vars . find name table . vars with Not_found -> assert false |
let get_variables table names = Array . map ( get_variable table ) names |
let add_initializer table f = table . initializers <- f :: table . initializers |
let create_table public_methods = if public_methods == magic 0 then new_table [ ] || else let tags = Array . map public_method_label public_methods in let table = new_table tags in Array . iteri ( fun i met -> let lab = i * 2 + 2 in table . methods_by_name <- Meths . add met lab table . methods_by_name ; table . method... |
let init_class table = inst_var_count := ! inst_var_count + table . size - 1 ; table . initializers <- List . rev table . initializers ; resize table ( 3 + magic table . methods . ( 1 ) * 16 / Sys . word_size ) |
let inherits cla vals virt_meths concr_meths ( _ , super , _ , env ) top = narrow cla vals virt_meths concr_meths ; let init = if top then super cla env else repr ( super cla ) in widen cla ; Array . concat [ [ | repr init ] ; | magic ( Array . map ( get_variable cla ) ( to_array vals ) : int array ) ; Array . map ( fu... |
let make_class pub_meths class_init = let table = create_table pub_meths in let env_init = class_init table in init_class table ; ( env_init ( repr 0 ) , class_init , env_init , repr 0 ) |
type init_table = { mutable env_init : t ; mutable class_init : table -> t } |
let make_class_store pub_meths class_init init_table = let table = create_table pub_meths in let env_init = class_init table in init_class table ; init_table . class_init <- class_init ; init_table . env_init <- env_init |
let dummy_class loc = let undef = fun _ -> raise ( Undefined_recursive_module loc ) in ( magic undef , undef , undef , repr 0 ) |
let create_object table = let obj = new_block Obj . object_tag table . size in set_field obj 0 ( repr table . methods ) ; of_repr ( set_id obj ) |
let create_object_opt obj_0 table = if ( magic obj_0 : bool ) then obj_0 else begin let obj = new_block Obj . object_tag table . size in set_field obj 0 ( repr table . methods ) ; of_repr ( set_id obj ) end |
let rec iter_f obj = function [ ] -> ( ) | f :: l -> f obj ; iter_f obj l |
let run_initializers obj table = let inits = table . initializers in if inits <> [ ] then iter_f obj inits |
let run_initializers_opt obj_0 obj table = if ( magic obj_0 : bool ) then obj else begin let inits = table . initializers in if inits <> [ ] then iter_f obj inits ; obj end |
let create_object_and_run_initializers obj_0 table = if ( magic obj_0 : bool ) then obj_0 else begin let obj = create_object table in run_initializers obj table ; obj end = " caml_get_public_method " [ @@ noalloc ] |
type tables = | Empty | Cons of { key : closure ; mutable data : tables ; mutable next : tables } |
let set_data tables v = match tables with | Empty -> assert false | Cons tables -> tables . data <- v |
let set_next tables v = match tables with | Empty -> assert false | Cons tables -> tables . next <- v |
let get_key = function | Empty -> assert false | Cons tables -> tables . key |
let get_data = function | Empty -> assert false | Cons tables -> tables . data |
let get_next = function | Empty -> assert false | Cons tables -> tables . next |
let build_path n keys tables = let obj_zero = magic 0 in let res = Cons { key = obj_zero ; data = Empty ; next = Empty } in let r = ref res in for i = 0 to n do r := Cons { key = keys . ( i ) ; data = ! r ; next = Empty } done ; set_data tables ! r ; res |
let rec lookup_keys i keys tables = if i < 0 then tables else let key = keys . ( i ) in let rec lookup_key ( tables : tables ) = if get_key tables == key then match get_data tables with | Empty -> assert false | Cons _ as tables_data -> lookup_keys ( i - 1 ) keys tables_data else match get_next tables with | Cons _ as ... |
let lookup_tables root keys = match get_data root with | Cons _ as root_data -> lookup_keys ( Array . length keys - 1 ) keys root_data | Empty -> build_path ( Array . length keys - 1 ) keys root |
let get_const x = ret ( fun _obj -> x ) |
let get_var n = ret ( fun obj -> get_object_field obj n ) |
let get_env e n = ret ( fun obj -> get_object_field ( magic ( get_object_field obj e ) : obj ) n ) |
let get_meth n = ret ( fun obj -> sendself obj n ) |
let set_var n = ret ( fun obj x -> set_object_field obj n x ) |
let app_const f x = ret ( fun _obj -> f x ) |
let app_var f n = ret ( fun obj -> f ( get_object_field obj n ) ) |
let app_env f e n = ret ( fun obj -> f ( get_object_field ( magic ( get_object_field obj e ) : obj ) n ) ) |
let app_meth f n = ret ( fun obj -> f ( sendself obj n ) ) |
let app_const_const f x y = ret ( fun _obj -> f x y ) |
let app_const_var f x n = ret ( fun obj -> f x ( get_object_field obj n ) ) |
let app_const_meth f x n = ret ( fun obj -> f x ( sendself obj n ) ) |
let app_var_const f n x = ret ( fun obj -> f ( get_object_field obj n ) x ) |
let app_meth_const f n x = ret ( fun obj -> f ( sendself obj n ) x ) |
let app_const_env f x e n = ret ( fun obj -> f x ( get_object_field ( magic ( get_object_field obj e ) : obj ) n ) ) |
let app_env_const f e n x = ret ( fun obj -> f ( get_object_field ( magic ( get_object_field obj e ) : obj ) n ) x ) |
let meth_app_const n x = ret ( fun obj -> ( sendself obj n : _ -> _ ) x ) |
let meth_app_var n m = ret ( fun obj -> ( sendself obj n : _ -> _ ) ( get_object_field obj m ) ) |
let meth_app_env n e m = ret ( fun obj -> ( sendself obj n : _ -> _ ) ( get_object_field ( magic ( get_object_field obj e ) : obj ) m ) ) |
let meth_app_meth n m = ret ( fun obj -> ( sendself obj n : _ -> _ ) ( sendself obj m ) ) |
let send_const m x c = ret ( fun obj -> sendcache x m ( get_object_field obj 0 ) c ) |
let send_var m n c = ret ( fun obj -> sendcache ( magic ( get_object_field obj n ) : obj ) m ( get_object_field obj 0 ) c ) |
let send_env m e n c = ret ( fun obj -> sendcache ( magic ( get_object_field ( magic ( get_object_field obj e ) : obj ) n ) : obj ) m ( get_object_field obj 0 ) c ) |
let send_meth m n c = ret ( fun obj -> sendcache ( sendself obj n ) m ( get_object_field obj 0 ) c ) |
let new_cache table = let n = new_method table in let n = if n mod 2 = 0 || n > 2 + magic table . methods . ( 1 ) * 16 / Sys . word_size then n else new_method table in table . methods . ( n ) <- magic 0 ; n |
type impl = GetConst | GetVar | GetEnv | GetMeth | SetVar | AppConst | AppVar | AppEnv | AppMeth | AppConstConst | AppConstVar | AppConstEnv | AppConstMeth | AppVarConst | AppEnvConst | AppMethConst | MethAppConst | MethAppVar | MethAppEnv | MethAppMeth | SendConst | SendVar | SendEnv | SendMeth | Closure of closure |
let method_impl table i arr = let next ( ) = incr i ; magic arr . ( ! i ) in match next ( ) with GetConst -> let x : t = next ( ) in get_const x | GetVar -> let n = next ( ) in get_var n | GetEnv -> let e = next ( ) in let n = next ( ) in get_env e n | GetMeth -> let n = next ( ) in get_meth n | SetVar -> let n = next ... |
let set_methods table methods = let len = Array . length methods in let i = ref 0 in while ! i < len do let label = methods . ( ! i ) in let clo = method_impl table i methods in set_method table label clo ; incr i done |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.