(************************************************************************) (* * The Rocq Prover / The Rocq Development Team *) (* v * Copyright INRIA, CNRS and contributors *) (* <O___,, * (see version control and CREDITS file for authors & dates) *) (* \VV/ **************************************************************) (* // * This file is distributed under the terms of the *) (* * GNU Lesser General Public License Version 2.1 *) (* * (see LICENSE file for the text of the license) *) (************************************************************************)
(* Created by Bruno Barras for Benjamin Grégoire as part of the
bytecode-based reduction machine, Oct 2004 *) (* Bug fix #1419 by Jean-Marc Notin, Mar 2007 *)
(* This file manages the table of global symbols for the bytecode machine *)
open Util open Names open Vmvalues open Vmemitcodes open Vmbytecodes open Declarations open Environ open Vmbytegen
(* table for structured constants and switch annotations *)
module HashMap (M : Hashtbl.HashedType) : sig type +'a t val empty : 'a t val add : M.t -> 'a -> 'a t -> 'a t valfind : M.t -> 'a t -> 'a end = struct type'a t = (M.t * 'a) list Int.Map.t let empty = Int.Map.empty let add k v m = let hash = M.hash k in try Int.Map.modify hash (fun _ l -> (k, v) :: l) m with Not_found -> Int.Map.add hash [k, v] m letfind k m = let hash = M.hash k in let l = Int.Map.find hash m in List.assoc_f M.equal k l end
module SConstTable = HashMap (struct type t = structured_constant let equal = eq_structured_constant let hash = hash_structured_constant end)
module AnnotTable = HashMap (struct type t = annot_switch let equal = eq_annot_switch let hash = hash_annot_switch end)
module GlobVal : sig type key = int type t val empty : int -> t val push : t -> values -> key * t val vm_global : t -> vm_global (** Warning: due to sharing, the resulting value can be modified by persistent operations. When calling this function one must ensure that no other context modification is performed before the value drops
out of scope. *) end = struct type key = int
type view =
| Root of values array
| DSet of int * values * view ref
type t = {
data : view ref; size : int; (** number of actual elements in the array *)
}
let empty n = {
data = ref (Root (Array.make n crazy_val)); size = 0;
}
let rec rerootk t k = match !t with
| Root _ -> k ()
| DSet (i, v, t') -> let next () = match !t' with
| Root a as n -> let v' = Array.unsafe_get a i in let () = Array.unsafe_set a i v in let () = t := n in let () = t' := DSet (i, v', t) in
k ()
| DSet _ -> assert false in
rerootk t' next
let reroot t = rerootk t (fun () -> ())
let push { data = t; size = i } v = let () = reroot t in match !t with
| DSet _ -> assert false
| Root a as n -> let len = Array.length a in let data = if i < len then let old = Array.unsafe_get a i in if old == v then t else let () = Array.unsafe_set a i v in let res = ref n in let () = t := DSet (i, old, res) in
res else let nlen = 2 * len + 1 in let nlen = min nlen Sys.max_array_length in let () = assert (i < nlen) in let a' = Array.make nlen crazy_val in let () = Array.blit a 0 a' 0 len in let () = Array.unsafe_set a' i v in let res = ref (Root a') in let () = t := DSet (i, crazy_val, res) in
res in
(i, { data; size = i + 1 })
let vm_global { data; _ } = let () = reroot data in match !data with
| DSet _ -> assert false
| Root a -> (a : vm_global)
let get_global_data table = GlobVal.vm_global table.glob_val
let set_global v rtable = let table = !rtable in let (n, glob_val) = GlobVal.push table.glob_val v in let table = { table with glob_val } in let () = rtable := table in
n
(*************************************************************) (*** Mise a jour des valeurs des variables et des constantes *) (*************************************************************)
exception NotEvaluated
let key rk = match !rk with
| None -> raise NotEvaluated
| Some k -> try CEphemeron.get k with CEphemeron.InvalidKey -> raise NotEvaluated
(************************) (* traduction des patch *)
(* slot_for_*, calcul la valeur de l'objet, la place
dans la table global, rend sa position dans la table *)
let slot_for_str_cst key table = try SConstTable.find key !table.glob_sconst with Not_found -> let n = set_global (val_of_str_const key) table in let glob_sconst = SConstTable.add key n !table.glob_sconst in let () = table := { !table with glob_sconst } in
n
let slot_for_annot key table = try AnnotTable.find key !table.glob_annot with Not_found -> let n = set_global (val_of_annot_switch key) table in let glob_annot = AnnotTable.add key n !table.glob_annot in let () = table := { !table with glob_annot } in
n
let make_static_prim table = let fold table prim = let _, v = eval_caml_prim prim in let key, table = GlobVal.push table v in
table, key in (* Keep synchronized *) let prims = [
CAML_Arraymake;
CAML_Arrayget;
CAML_Arraydefault;
CAML_Arrayset;
CAML_Arraycopy;
CAML_Arraylength;
CAML_Stringmake;
CAML_Stringlength;
CAML_Stringget;
CAML_Stringsub;
CAML_Stringcat;
CAML_Stringcompare;
] in let table, prims = CList.fold_left_map fold table prims in
table, Array.of_list prims
let slot_for_caml_prim op table =
!table.glob_prim.(fst (eval_caml_prim op))
let cache_named envcache x v = envcache.named_cache := Id.Map.add x v !(envcache.named_cache) let cache_rel envcache i v = envcache.rel_cache := Int.Map.add (i + envcache.rel_adjust) v !(envcache.rel_cache)
let envcache_of_rel i envcache = {
envcache with
rel_adjust = envcache.rel_adjust + i
}
let rec slot_for_getglobal env sigma kn envcache table = let (cb,(_,rk)) = lookup_constant_key kn env in try key rk with NotEvaluated -> (* Pp.msgnl(str"not yet evaluated");*) let pos = match cb.const_body_code with
| None -> set_global (val_of_constant kn) table
| Some code -> match code with
| BCdefined (_, index, patches) -> let code = Environ.lookup_vm_code index env in let code = (code, patches) in let v = eval_to_patch env sigma code envcache table in
set_global v table
| BCalias kn' -> slot_for_getglobal env sigma kn' envcache table
| BCconstant -> set_global (val_of_constant kn) table in (*Pp.msgnl(str"value stored at: "++int pos);*)
rk := Some (CEphemeron.create pos);
pos
and slot_for_fv env sigma fv envcache table = let val_of_rel i = val_of_rel (nb_rel env - i) in match fv with
| FVnamed id -> let nv = Id.Map.find_opt id !(envcache.named_cache) in beginmatch nv with
| None -> let v = match env |> lookup_named id |> NamedDecl.get_value with
| None -> val_of_named id
| Some c -> val_of_constr env sigma c envcache table in
cache_named envcache id v; v
| Some v -> v end
| FVrel i -> let rv = Int.Map.find_opt (i + envcache.rel_adjust) !(envcache.rel_cache) in beginmatch rv with
| None -> let v = match env |> lookup_rel i |> RelDecl.get_value with
| None -> val_of_rel i
| Some c -> val_of_constr (env_of_rel i env) sigma c (envcache_of_rel i envcache) table in
cache_rel envcache i v; v
| Some v -> v end
and eval_to_patch env sigma code envcache table = let slots = function
| Reloc_annot a -> slot_for_annot a table
| Reloc_const sc -> slot_for_str_cst sc table
| Reloc_getglobal kn -> slot_for_getglobal env sigma kn envcache table
| Reloc_caml_prim op -> slot_for_caml_prim op table in let tc, fv = patch code slots in let vm_env = (* Environment should look like a closure, so free variables start at slot 2. *) let a = Array.make (Array.length fv + 2) crazy_val in
a.(1) <- Obj.magic 2; let iter i fv = let v = slot_for_fv env sigma fv envcache table in
a.(i + 2) <- v in let () = Array.iteri iter fv in
a in let global = get_global_data !table in let v = rocq_interprete tc crazy_val (get_atom_rel ()) global (inj_env vm_env) 0 in
v
and val_of_constr env sigma c envcache table = match compile ~fail_on_error:true env sigma c with
| Some (_, code, patch) -> eval_to_patch env sigma (code, patch) envcache table
| None -> assert false
let global_table = let glob_val = GlobVal.empty 4096 in (* Register OCaml primitives statically *) let glob_val, glob_prim = make_static_prim glob_val in ref {
glob_val; glob_prim;
glob_sconst = SConstTable.empty;
glob_annot = AnnotTable.empty;
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
