1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479
|
(************************************************************************)
(* * The Coq Proof Assistant / The Coq 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) *)
(************************************************************************)
open Util
open Pp
(* Code to interact with ML "toplevel", in particular, handling ML
plugin loading.
We use Fl_dynload to load plugins, which can correctly track
dependencies, and manage path for us.
A bit of infrastructure is still in place to support a "legacy"
mode where Coq used to manage the OCaml include paths and directly
load .cmxs/.cma files itself.
We also place here the required code for interacting with the
Summary and Libobject, and provide an API so plugins can interact
with this loading/unloading for Coq-specific purposes adding their
own init functions, given that OCaml cannot unlink a dynamic module.
*)
(* This path is where we look for .cmo/.cmxs using the legacy method *)
let coq_mlpath_copy = ref [Sys.getcwd ()]
let keep_copy_mlpath path =
let cpath = CUnix.canonical_path_name path in
let filter path' = not (String.equal cpath path') in
coq_mlpath_copy := cpath :: List.filter filter !coq_mlpath_copy
module Fl_internals = struct
(* Check that [m] is a findlib library name *)
let validate_lib_name m = String.index_opt m '.' <> None
(* Fl_split.in_words is not exported *)
let fl_split_in_words s =
(* splits s in words separated by commas and/or whitespace *)
let l = String.length s in
let rec split i j =
if j < l then
match s.[j] with
| (' '|'\t'|'\n'|'\r'|',') ->
if i<j then (String.sub s i (j-i)) :: (split (j+1) (j+1))
else split (j+1) (j+1)
| _ ->
split i (j+1)
else
if i<j then [ String.sub s i (j-i) ] else []
in
split 0 0
(* simulate what fl_dynload does *)
let fl_find_plugins lib =
let base = Findlib.package_directory lib in
let preds = Findlib.recorded_predicates () in
let archive = try Findlib.package_property preds lib "plugin"
with Not_found ->
try fst (Findlib.package_property_2 ("plugin"::preds) lib "archive")
with Not_found -> ""
in
fl_split_in_words archive |> List.map (Findlib.resolve_path ~base)
(* We register errors at for Dynlink and Findlib, it is possible to
do so Symtable too, as we used to do in the bytecode init code.
*)
let () = CErrors.register_handler (function
| Dynlink.Error msg ->
Some (hov 0 (str "Dynlink error: " ++ str (Dynlink.error_message msg)))
| Fl_package_base.No_such_package(p,msg) ->
let paths = Findlib.search_path () in
Some (hov 0 (str "Findlib error: " ++ str p ++
str " not found in:" ++ cut () ++ v 0 (prlist_with_sep cut str paths) ++ fnl() ++ str msg))
| _ ->
None
)
end
module PluginSpec : sig
type t
(* Main constructor, takes the format used in Declare ML Module *)
val of_declare_ml_format : string -> t
(* repr/unrepr are internal and only needed for the summary and other low-level stuff *)
val repr : t -> string option * string
val unrepr : string option * string -> t
(* Load a plugin, low-level, that is to say, will directly call the
loading mechanism in OCaml/findlib *)
val load : t -> unit
(* Compute a digest, a findlib library name have more than one
plugin .cmxs, however this is not the case in Coq. Maybe we
should strengthen this invariant. *)
val digest : t -> Digest.t list
val pp : t -> string
module Set : CSet.S with type elt = t
module Map : CMap.ExtS with type key = t and module Set := Set
end = struct
type t = { file : string option; lib : string }
module Errors = struct
let plugin_name_should_contain_dot m =
CErrors.user_err
Pp.(str Format.(asprintf "%s is not a valid plugin name anymore." m) ++ spc() ++
str "Plugins should be loaded using their public name" ++ spc () ++
str "according to findlib, for example package-name.foo and not " ++
str "foo_plugin.")
let plugin_name_invalid_format m =
CErrors.user_err
Pp.(str Format.(asprintf "%s is not a valid plugin name." m) ++ spc () ++
str "It should be a public findlib name, e.g. package-name.foo," ++ spc () ++
str "or a legacy name followed by a findlib public name, e.g. "++ spc () ++
str "legacy_plugin:package-name.plugin.")
end
let legacy_mapping = Core_plugins_findlib_compat.legacy_to_findlib
let of_declare_ml_format m =
match String.split_on_char ':' m with
| [file] when List.mem_assoc file legacy_mapping ->
{ file = Some file; lib = String.concat "." ("coq-core" :: List.assoc file legacy_mapping) }
| [x] when not (Fl_internals.validate_lib_name x) ->
Errors.plugin_name_should_contain_dot m
| [ file; lib ] ->
{ file = Some file; lib }
| [ lib ] ->
{ file = None; lib }
| [] -> assert false
| _ :: _ :: _ ->
Errors.plugin_name_invalid_format m
(* Adds the corresponding extension .cmo/.cma or .cmxs. Dune and
coq_makefile byte plugins do differ in the choice of extension,
hence the probing. *)
let select_plugin_version base =
if Sys.(backend_type = Native)
then base ^ ".cmxs"
else
let name = base ^ ".cmo" in
if System.is_in_path !coq_mlpath_copy name
then name else base ^ ".cma"
let load = function
| { file = None; lib } ->
Fl_dynload.load_packages [lib]
| { file = Some file; lib } ->
let file = select_plugin_version file in
let _, gname = System.find_file_in_path ~warn:false !coq_mlpath_copy file in
Dynlink.loadfile gname;
Findlib.(record_package Record_load) lib
let digest s =
match s with
| { file = Some file; _ } ->
let file = select_plugin_version file in
let _, gname = System.find_file_in_path ~warn:false !coq_mlpath_copy file in
[Digest.file gname]
| { file = None; lib } ->
let plugins = Fl_internals.fl_find_plugins lib in
List.map Digest.file plugins
let repr { file; lib } = ( file, lib )
let unrepr ( file, lib ) = { file; lib }
let compare { lib = l1; _ } { lib = l2; _ } = String.compare l1 l2
let pp = function
| { file = None; lib } -> lib
| { file = Some file; lib } ->
let file = select_plugin_version file in
Filename.basename file ^ " (using legacy method)"
module Self = struct
type nonrec t = t
let compare = compare
end
module Set = CSet.Make(Self)
module Map = CMap.Make(Self)
end
(* If there is a toplevel under Coq *)
type toplevel =
{ load_plugin : PluginSpec.t -> unit
(** Load a findlib library, given by public name *)
; load_module : string -> unit
(** Load a cmxs / cmo module, used by the native compiler to load objects *)
; add_dir : string -> unit
(** Adds a dir to the module search path *)
; ml_loop : ?init_file:string -> unit -> unit
(** Run the OCaml toplevel with given initialisation file *)
}
(* Determines the behaviour of Coq with respect to ML files (compiled
or not) *)
type kind_load =
| WithTop of toplevel
| WithoutTop
(* Must be always initialized *)
let load = ref WithoutTop
(* Sets and initializes a toplevel (if any) *)
let set_top toplevel = load :=
WithTop toplevel;
Nativelib.load_obj := toplevel.load_module
(* Removes the toplevel (if any) *)
let remove () =
load := WithoutTop;
Nativelib.load_obj := (fun x -> () : string -> unit)
(* Tests if an Ocaml toplevel runs under Coq *)
let is_ocaml_top () =
match !load with
| WithTop _ -> true
|_ -> false
(* Tests if we can load ML files *)
let has_dynlink = Coq_config.has_natdynlink || not Sys.(backend_type = Native)
(* Runs the toplevel loop of Ocaml *)
let ocaml_toploop ?init_file () =
match !load with
| WithTop t -> t.ml_loop ?init_file ()
| _ -> ()
let ml_load p =
match !load with
| WithTop t -> t.load_plugin p
| WithoutTop ->
PluginSpec.load p
let load_module x = match !load with
| WithTop t -> t.load_module x
| WithoutTop -> ()
(* Adds a path to the ML paths *)
let add_ml_dir s =
match !load with
| WithTop t -> t.add_dir s; keep_copy_mlpath s
| WithoutTop when has_dynlink -> keep_copy_mlpath s
| _ -> ()
(** Is the ML code of the standard library placed into loadable plugins
or statically compiled into coqtop ? For the moment this choice is
made according to the presence of native dynlink : even if bytecode
coqtop could always load plugins, we prefer to have uniformity between
bytecode and native versions. *)
(* [known_loaded_module] contains the names of the loaded ML modules
* (linked or loaded with load_object). It is used not to load a
* module twice. It is NOT the list of ML modules Coq knows. *)
(* TODO: Merge known_loaded_module and known_loaded_plugins *)
let known_loaded_modules : PluginSpec.Set.t ref = ref PluginSpec.Set.empty
let add_known_module mname =
if not (PluginSpec.Set.mem mname !known_loaded_modules) then
known_loaded_modules := PluginSpec.Set.add mname !known_loaded_modules
let module_is_known mname = PluginSpec.Set.mem mname !known_loaded_modules
let plugin_is_known mname = PluginSpec.Set.mem mname !known_loaded_modules
(** Init time functions *)
let initialized_plugins = Summary.ref ~stage:Synterp ~name:"inited-plugins" PluginSpec.Set.empty
let plugin_init_functions : (unit -> unit) list PluginSpec.Map.t ref = ref PluginSpec.Map.empty
let add_init_function name f =
let name = PluginSpec.of_declare_ml_format name in
if PluginSpec.Set.mem name !initialized_plugins then CErrors.anomaly Pp.(str "Not allowed to add init function for already initialized plugin " ++ str (PluginSpec.pp name));
plugin_init_functions := PluginSpec.Map.update name (function
| None -> Some [f]
| Some g -> Some (f::g))
!plugin_init_functions
(** Registering functions to be used at caching time, that is when the Declare
ML module command is issued. *)
let cache_objs = ref PluginSpec.Map.empty
let declare_cache_obj f name =
let name = PluginSpec.of_declare_ml_format name in
let objs = try PluginSpec.Map.find name !cache_objs with Not_found -> [] in
let objs = f :: objs in
cache_objs := PluginSpec.Map.add name objs !cache_objs
let perform_cache_obj name =
let objs = try PluginSpec.Map.find name !cache_objs with Not_found -> [] in
let objs = List.rev objs in
List.iter (fun f -> f ()) objs
(** ml object = ml module or plugin *)
let dinit = CDebug.create ~name:"mltop-init" ()
let init_ml_object mname =
if PluginSpec.Set.mem mname !initialized_plugins
then dinit Pp.(fun () -> str "already initialized " ++ str (PluginSpec.pp mname))
else begin
dinit Pp.(fun () -> str "initing " ++ str (PluginSpec.pp mname));
let n = match PluginSpec.Map.find mname !plugin_init_functions with
| l -> List.iter (fun f -> f()) (List.rev l); List.length l
| exception Not_found -> 0
in
initialized_plugins := PluginSpec.Set.add mname !initialized_plugins;
dinit Pp.(fun () -> str "finished initing " ++ str (PluginSpec.pp mname) ++ str " (" ++ int n ++ str " init functions)")
end
let load_ml_object mname =
ml_load mname;
add_known_module mname;
init_ml_object mname
let add_known_module name =
let name = PluginSpec.of_declare_ml_format name in
add_known_module name
let module_is_known mname =
let mname = PluginSpec.of_declare_ml_format mname in
module_is_known mname
(* Summary of declared ML Modules *)
(* List and not String.Set because order is important: most recent first. *)
let loaded_modules = ref []
let get_loaded_modules () = List.rev !loaded_modules
(* XXX: It seems this should be part of trigger_ml_object, and
moreover we should check the guard there *)
let add_loaded_module md =
if not (List.mem md !loaded_modules) then
loaded_modules := md :: !loaded_modules
let reset_loaded_modules () = loaded_modules := []
let if_verbose_load verb f name =
if not verb then f name
else
let info = str "[Loading ML file " ++ str (PluginSpec.pp name) ++ str " ..." in
try
let path = f name in
Feedback.msg_info (info ++ str " done]");
path
with reraise ->
Feedback.msg_info (info ++ str " failed]");
raise reraise
(** Load a module for the first time (i.e. dynlink it)
or simulate its reload (i.e. doing nothing except maybe
an initialization function). *)
let trigger_ml_object ~verbose ~cache ~reinit plugin =
let () =
if plugin_is_known plugin then
(if reinit then init_ml_object plugin)
else
begin
if not has_dynlink then
CErrors.user_err
(str "Dynamic link not supported (module " ++ str (PluginSpec.pp plugin) ++ str ").")
else
if_verbose_load (verbose && not !Flags.quiet) load_ml_object plugin
end
in
add_loaded_module plugin;
if cache then perform_cache_obj plugin
let unfreeze_ml_modules x =
reset_loaded_modules ();
List.iter
(fun name ->
let name = PluginSpec.unrepr name in
trigger_ml_object ~verbose:false ~cache:false ~reinit:false name) x
let () =
Summary.declare_ml_modules_summary
{ stage = Summary.Stage.Synterp
; Summary.freeze_function = (fun () ->
get_loaded_modules () |> List.map PluginSpec.repr)
; Summary.unfreeze_function = unfreeze_ml_modules
; Summary.init_function = reset_loaded_modules }
(* Liboject entries of declared ML Modules *)
type ml_module_object =
{ mlocal : Vernacexpr.locality_flag
; mnames : PluginSpec.t list
; mdigests : Digest.t list
}
let cache_ml_objects mnames =
let iter obj = trigger_ml_object ~verbose:true ~cache:true ~reinit:true obj in
List.iter iter mnames
let load_ml_objects _ {mnames; _} =
let iter obj = trigger_ml_object ~verbose:true ~cache:false ~reinit:true obj in
List.iter iter mnames
let classify_ml_objects {mlocal=mlocal} =
if mlocal then Libobject.Dispose else Libobject.Substitute
let inMLModule : ml_module_object -> Libobject.obj =
let open Libobject in
declare_object
{(default_object "ML-MODULE") with
object_stage = Summary.Stage.Synterp;
cache_function = (fun _ -> ());
load_function = load_ml_objects;
subst_function = (fun (_,o) -> o);
classify_function = classify_ml_objects }
let declare_ml_modules local l =
let mnames = List.map PluginSpec.of_declare_ml_format l in
if Lib.sections_are_opened()
then CErrors.user_err Pp.(str "Cannot Declare ML Module while sections are opened.");
(* List.concat_map only available in 4.10 *)
let mdigests = List.map PluginSpec.digest mnames |> List.concat in
Lib.add_leaf (inMLModule {mlocal=local; mnames; mdigests});
(* We can't put this in cache_function: it may declare other
objects, and when the current module is required we want to run
the ML-MODULE object before them. *)
cache_ml_objects mnames
let print_ml_path () =
let l = !coq_mlpath_copy in
str"ML Load Path:" ++ fnl () ++ str" " ++
hv 0 (prlist_with_sep fnl str l)
(* Printing of loaded ML modules *)
let print_ml_modules () =
let l = get_loaded_modules () in
str"Loaded ML Modules: " ++ pr_vertical_list str (List.map PluginSpec.pp l)
let print_gc () =
let stat = Gc.stat () in
let msg =
str "minor words: " ++ real stat.Gc.minor_words ++ fnl () ++
str "promoted words: " ++ real stat.Gc.promoted_words ++ fnl () ++
str "major words: " ++ real stat.Gc.major_words ++ fnl () ++
str "minor_collections: " ++ int stat.Gc.minor_collections ++ fnl () ++
str "major_collections: " ++ int stat.Gc.major_collections ++ fnl () ++
str "heap_words: " ++ int stat.Gc.heap_words ++ fnl () ++
str "heap_chunks: " ++ int stat.Gc.heap_chunks ++ fnl () ++
str "live_words: " ++ int stat.Gc.live_words ++ fnl () ++
str "live_blocks: " ++ int stat.Gc.live_blocks ++ fnl () ++
str "free_words: " ++ int stat.Gc.free_words ++ fnl () ++
str "free_blocks: " ++ int stat.Gc.free_blocks ++ fnl () ++
str "largest_free: " ++ int stat.Gc.largest_free ++ fnl () ++
str "fragments: " ++ int stat.Gc.fragments ++ fnl () ++
str "compactions: " ++ int stat.Gc.compactions ++ fnl () ++
str "top_heap_words: " ++ int stat.Gc.top_heap_words ++ fnl () ++
str "stack_size: " ++ int stat.Gc.stack_size
in
hv 0 msg
|