src/Pure/Thy/thy_info.ML
author wenzelm
Sun Sep 03 20:04:43 2000 +0200 (2000-09-03)
changeset 9822 dcf5f9886b8f
parent 9778 1f6dca5c4bbb
child 9953 035a8288310a
permissions -rw-r--r--
added pretend_use_thy_only;
berghofe@3604
     1
(*  Title:      Pure/Thy/thy_info.ML
berghofe@3604
     2
    ID:         $Id$
wenzelm@6211
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@8805
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
berghofe@3604
     5
wenzelm@6362
     6
Theory loader database, including theory and file dependencies.
wenzelm@3976
     7
*)
berghofe@3604
     8
wenzelm@5209
     9
signature BASIC_THY_INFO =
wenzelm@5209
    10
sig
wenzelm@5209
    11
  val theory: string -> theory
wenzelm@6211
    12
  val theory_of_sign: Sign.sg -> theory
wenzelm@6211
    13
  val theory_of_thm: thm -> theory
wenzelm@6241
    14
(*val use: string -> unit*)             (*exported later*)
wenzelm@6241
    15
  val time_use: string -> unit
wenzelm@6211
    16
  val touch_thy: string -> unit
wenzelm@6211
    17
  val use_thy: string -> unit
wenzelm@6211
    18
  val update_thy: string -> unit
wenzelm@6666
    19
  val remove_thy: string -> unit
wenzelm@6211
    20
  val time_use_thy: string -> unit
wenzelm@6527
    21
  val use_thy_only: string -> unit
wenzelm@7099
    22
  val update_thy_only: string -> unit
wenzelm@6211
    23
end;
wenzelm@5209
    24
berghofe@3604
    25
signature THY_INFO =
berghofe@3604
    26
sig
wenzelm@5209
    27
  include BASIC_THY_INFO
wenzelm@7099
    28
  datatype action = Update | Outdate | Remove
wenzelm@7099
    29
  val str_of_action: action -> string
wenzelm@7099
    30
  val add_hook: (action -> string -> unit) -> unit
wenzelm@6211
    31
  val names: unit -> string list
wenzelm@7910
    32
  val known_thy: string -> bool
wenzelm@7935
    33
  val check_known_thy: string -> bool
wenzelm@7935
    34
  val if_known_thy: (string -> unit) -> string -> unit
wenzelm@7288
    35
  val lookup_theory: string -> theory option
wenzelm@6211
    36
  val get_theory: string -> theory
berghofe@6654
    37
  val get_preds: string -> string list
wenzelm@7935
    38
  val loaded_files: string -> Path.T list
wenzelm@7910
    39
  val touch_child_thys: string -> unit
wenzelm@7099
    40
  val touch_all_thys: unit -> unit
wenzelm@7941
    41
  val load_file: bool -> Path.T -> unit
wenzelm@6241
    42
  val use: string -> unit
wenzelm@7952
    43
  val quiet_update_thy: bool -> string -> unit
wenzelm@9822
    44
  val pretend_use_thy_only: string -> unit
wenzelm@8805
    45
  val begin_theory: (string -> string list -> (Path.T * bool) list -> theory -> theory) ->
wenzelm@8805
    46
    bool -> string -> string list -> (Path.T * bool) list -> theory
wenzelm@6211
    47
  val end_theory: theory -> theory
wenzelm@6666
    48
  val finish: unit -> unit
wenzelm@6211
    49
  val register_theory: theory -> unit
berghofe@3604
    50
end;
berghofe@3604
    51
wenzelm@6362
    52
structure ThyInfo: THY_INFO =
wenzelm@6211
    53
struct
berghofe@3604
    54
berghofe@3604
    55
wenzelm@7099
    56
(** theory loader actions and hooks **)
wenzelm@7099
    57
wenzelm@7099
    58
datatype action = Update | Outdate | Remove;
wenzelm@7099
    59
val str_of_action = fn Update => "Update" | Outdate => "Outdate" | Remove => "Remove";
wenzelm@7099
    60
wenzelm@7099
    61
local
wenzelm@7099
    62
  val hooks = ref ([]: (action -> string -> unit) list);
wenzelm@7099
    63
in
wenzelm@7099
    64
  fun add_hook f = hooks := f :: ! hooks;
wenzelm@7191
    65
  fun perform action name = seq (fn f => (try (fn () => f action name) (); ())) (! hooks);
wenzelm@7099
    66
end;
wenzelm@7099
    67
wenzelm@7099
    68
wenzelm@7099
    69
wenzelm@6211
    70
(** thy database **)
wenzelm@6211
    71
wenzelm@6211
    72
(* messages *)
wenzelm@6211
    73
wenzelm@6211
    74
fun gen_msg txt [] = txt
wenzelm@6211
    75
  | gen_msg txt names = txt ^ " " ^ commas_quote names;
wenzelm@6211
    76
wenzelm@6211
    77
fun loader_msg txt names = gen_msg ("Theory loader: " ^ txt) names;
wenzelm@6211
    78
wenzelm@6211
    79
val show_path = space_implode " via " o map quote;
wenzelm@9332
    80
fun cycle_msg names = loader_msg ("cyclic dependency of " ^ show_path names) [];
berghofe@3604
    81
berghofe@3604
    82
wenzelm@6666
    83
(* derived graph operations *)
berghofe@3604
    84
wenzelm@9327
    85
fun add_deps name parents G = Graph.add_deps_acyclic (name, parents) G
wenzelm@9332
    86
  handle Graph.CYCLES namess => error (cat_lines (map cycle_msg namess));
berghofe@3604
    87
wenzelm@7952
    88
fun upd_deps name entry G =
wenzelm@7952
    89
  foldl (fn (H, parent) => Graph.del_edge (parent, name) H) (G, Graph.imm_preds G name)
wenzelm@7952
    90
  |> Graph.map_node name (K entry);
wenzelm@3976
    91
wenzelm@6211
    92
fun update_node name parents entry G =
wenzelm@7952
    93
  (if can (Graph.get_node G) name then upd_deps name entry G else Graph.new_node (name, entry) G)
wenzelm@7952
    94
  |> add_deps name parents;
wenzelm@7952
    95
   
berghofe@3604
    96
berghofe@3604
    97
wenzelm@6211
    98
(* thy database *)
wenzelm@6211
    99
wenzelm@6211
   100
type deps =
wenzelm@6211
   101
  {present: bool, outdated: bool,
wenzelm@7941
   102
    master: ThyLoad.master option, files: (Path.T * (Path.T * File.info) option) list};
wenzelm@6211
   103
wenzelm@6241
   104
fun make_deps present outdated master files =
wenzelm@6241
   105
  {present = present, outdated = outdated, master = master, files = files}: deps;
berghofe@3604
   106
wenzelm@7211
   107
fun init_deps master files = Some (make_deps false true master (map (rpair None) files));
wenzelm@7211
   108
wenzelm@7211
   109
wenzelm@6362
   110
type thy = deps option * theory option;
berghofe@3604
   111
wenzelm@6211
   112
local
wenzelm@6362
   113
  val database = ref (Graph.empty: thy Graph.T);
wenzelm@6211
   114
in
wenzelm@6362
   115
  fun get_thys () = ! database;
wenzelm@9137
   116
  val change_thys = Library.change database;
berghofe@3604
   117
end;
wenzelm@5209
   118
wenzelm@5209
   119
wenzelm@6211
   120
(* access thy graph *)
wenzelm@6211
   121
wenzelm@6211
   122
fun thy_graph f x = f (get_thys ()) x;
wenzelm@9417
   123
wenzelm@9417
   124
(*theory names in topological order*)
wenzelm@9417
   125
fun get_names () =
wenzelm@9417
   126
  let val G = get_thys ()
wenzelm@9417
   127
  in Graph.all_succs G (filter (Library.null o Graph.imm_preds G) (Graph.keys G)) end;
wenzelm@6211
   128
wenzelm@6211
   129
wenzelm@6211
   130
(* access thy *)
wenzelm@6211
   131
wenzelm@7935
   132
fun lookup_thy name =
wenzelm@9327
   133
  Some (thy_graph Graph.get_node name) handle Graph.UNDEF _ => None;
wenzelm@7935
   134
wenzelm@7910
   135
val known_thy = is_some o lookup_thy;
wenzelm@7935
   136
fun check_known_thy name = known_thy name orelse (warning ("Unknown theory " ^ quote name); false);
wenzelm@7935
   137
fun if_known_thy f name = if check_known_thy name then f name else ();
wenzelm@6211
   138
wenzelm@6211
   139
fun get_thy name =
wenzelm@6211
   140
  (case lookup_thy name of
wenzelm@6211
   141
    Some thy => thy
wenzelm@6211
   142
  | None => error (loader_msg "nothing known about theory" [name]));
wenzelm@6211
   143
wenzelm@6211
   144
fun change_thy name f = (get_thy name; change_thys (Graph.map_node name f));
wenzelm@6211
   145
wenzelm@6211
   146
wenzelm@6211
   147
(* access deps *)
wenzelm@6211
   148
wenzelm@6211
   149
val lookup_deps = apsome #1 o lookup_thy;
wenzelm@6211
   150
val get_deps = #1 o get_thy;
wenzelm@6211
   151
fun change_deps name f = change_thy name (fn (deps, x) => (f deps, x));
wenzelm@6211
   152
wenzelm@6666
   153
fun is_finished name = is_none (get_deps name);
wenzelm@6211
   154
fun get_files name = (case get_deps name of Some {files, ...} => files | _ => []);
wenzelm@7191
   155
wenzelm@7191
   156
fun loaded_files name =
wenzelm@7191
   157
  (case get_deps name of
wenzelm@7935
   158
    None => []
wenzelm@7910
   159
  | Some {master, files, ...} =>
wenzelm@7935
   160
      (case master of Some m => [#1 (ThyLoad.get_thy m)] | None => []) @
wenzelm@7941
   161
      (mapfilter (apsome #1 o #2) files));
wenzelm@6211
   162
berghofe@6654
   163
fun get_preds name =
wenzelm@9327
   164
  (thy_graph Graph.imm_preds name) handle Graph.UNDEF _ =>
berghofe@6654
   165
    error (loader_msg "nothing known about theory" [name]);
berghofe@6654
   166
wenzelm@6211
   167
wenzelm@6211
   168
(* access theory *)
wenzelm@6211
   169
wenzelm@7687
   170
fun lookup_theory name =
wenzelm@7687
   171
  (case lookup_thy name of
wenzelm@7687
   172
    Some (_, Some thy) => Some thy
wenzelm@7687
   173
  | _ => None);
wenzelm@7288
   174
wenzelm@6211
   175
fun get_theory name =
wenzelm@7288
   176
  (case lookup_theory name of
wenzelm@7288
   177
    (Some theory) => theory
wenzelm@6211
   178
  | _ => error (loader_msg "undefined theory entry for" [name]));
wenzelm@6211
   179
wenzelm@6211
   180
val theory_of_sign = get_theory o Sign.name_of;
wenzelm@6211
   181
val theory_of_thm = theory_of_sign o Thm.sign_of_thm;
wenzelm@6211
   182
wenzelm@7099
   183
fun put_theory name theory = change_thy name (fn (deps, _) => (deps, Some theory));
wenzelm@6211
   184
wenzelm@6211
   185
wenzelm@6211
   186
wenzelm@6211
   187
(** thy operations **)
wenzelm@6211
   188
wenzelm@6241
   189
(* maintain 'outdated' flag *)
wenzelm@6211
   190
wenzelm@7099
   191
local
wenzelm@7099
   192
wenzelm@6241
   193
fun is_outdated name =
wenzelm@6241
   194
  (case lookup_deps name of
wenzelm@6241
   195
    Some (Some {outdated, ...}) => outdated
wenzelm@6241
   196
  | _ => false);
wenzelm@6211
   197
wenzelm@6241
   198
fun outdate_thy name =
wenzelm@7099
   199
  if is_finished name orelse is_outdated name then ()
wenzelm@7099
   200
  else (change_deps name (apsome (fn {present, outdated = _, master, files} =>
wenzelm@7099
   201
    make_deps present true master files)); perform Outdate name);
wenzelm@7099
   202
wenzelm@7910
   203
fun check_unfinished name =
wenzelm@7910
   204
  if is_finished name then (warning (loader_msg "tried to touch finished theory" [name]); None)
wenzelm@7910
   205
  else Some name;
wenzelm@7910
   206
wenzelm@7099
   207
in
wenzelm@6211
   208
wenzelm@7910
   209
fun touch_thys names =
wenzelm@7910
   210
  seq outdate_thy (thy_graph Graph.all_succs (mapfilter check_unfinished names));
wenzelm@7910
   211
wenzelm@7910
   212
fun touch_thy name = touch_thys [name];
wenzelm@7910
   213
fun touch_child_thys name = touch_thys (thy_graph Graph.imm_succs name);
wenzelm@6211
   214
wenzelm@7099
   215
fun touch_all_thys () = seq outdate_thy (get_names ());
wenzelm@6211
   216
wenzelm@7099
   217
end;
wenzelm@6211
   218
wenzelm@6211
   219
wenzelm@7244
   220
(* check 'finished' state *)
wenzelm@7244
   221
wenzelm@7244
   222
fun check_unfinished fail name =
wenzelm@7910
   223
  if known_thy name andalso is_finished name then
wenzelm@7288
   224
    fail (loader_msg "cannot update finished theory" [name])
wenzelm@7244
   225
  else ();
wenzelm@7244
   226
wenzelm@7244
   227
wenzelm@7941
   228
(* load_file *)
wenzelm@6211
   229
wenzelm@7191
   230
local
wenzelm@7191
   231
wenzelm@7941
   232
fun provide path name info (deps as Some {present, outdated, master, files}) =
wenzelm@7941
   233
     (if exists (equal path o #1) files then ()
wenzelm@7941
   234
      else warning (loader_msg "undeclared dependency of theory" [name] ^
wenzelm@7941
   235
        " on file: " ^ quote (Path.pack path));
wenzelm@7941
   236
      Some (make_deps present outdated master (overwrite (files, (path, Some info)))))
wenzelm@7941
   237
  | provide _ _ _ None = None;
wenzelm@7941
   238
wenzelm@7941
   239
fun run_file path =
wenzelm@7941
   240
  (case apsome PureThy.get_name (Context.get_context ()) of
wenzelm@7941
   241
    None => (ThyLoad.load_file path; ())
wenzelm@7941
   242
  | Some name =>
wenzelm@7941
   243
      if known_thy name then change_deps name (provide path name (ThyLoad.load_file path))
wenzelm@7941
   244
      else (ThyLoad.load_file path; ()));
wenzelm@6211
   245
wenzelm@7191
   246
in
wenzelm@7191
   247
wenzelm@7941
   248
fun load_file time path =
wenzelm@7941
   249
  if time then
wenzelm@7244
   250
    let val name = Path.pack path in
wenzelm@7244
   251
      timeit (fn () =>
wenzelm@9778
   252
       (priority ("\n**** Starting file " ^ quote name ^ " ****");
wenzelm@9036
   253
        run_file path;
wenzelm@9778
   254
        priority ("**** Finished file " ^ quote name ^ " ****\n")))
wenzelm@7244
   255
    end
wenzelm@7941
   256
  else run_file path;
wenzelm@7941
   257
wenzelm@7941
   258
val use = load_file false o Path.unpack;
wenzelm@7941
   259
val time_use = load_file true o Path.unpack;
wenzelm@7191
   260
wenzelm@7191
   261
end;
wenzelm@6233
   262
wenzelm@6233
   263
wenzelm@7099
   264
(* load_thy *)
wenzelm@7099
   265
wenzelm@9490
   266
fun required_by _ [] = ""
wenzelm@9490
   267
  | required_by s initiators = s ^ "(required by " ^ show_path (rev initiators) ^ ")";
wenzelm@7099
   268
wenzelm@9822
   269
fun load_thy really ml time initiators dir name parents =
wenzelm@7099
   270
  let
wenzelm@9822
   271
    val _ =
wenzelm@9822
   272
      if really then priority ("Loading theory " ^ quote name ^ required_by " " initiators)
wenzelm@9822
   273
      else priority ("Registering theory " ^ quote name);
wenzelm@7099
   274
wenzelm@7099
   275
    val _ = touch_thy name;
wenzelm@9822
   276
    val master =
wenzelm@9822
   277
      if really then ThyLoad.load_thy dir name ml time
wenzelm@9822
   278
      else #1 (ThyLoad.deps_thy dir name ml);
wenzelm@7099
   279
wenzelm@7099
   280
    val files = get_files name;
wenzelm@7099
   281
    val missing_files = mapfilter (fn (path, None) => Some (Path.pack path) | _ => None) files;
wenzelm@7099
   282
  in
wenzelm@7099
   283
    if null missing_files then ()
wenzelm@7099
   284
    else warning (loader_msg "unresolved dependencies of theory" [name] ^
wenzelm@7223
   285
      " on file(s): " ^ commas_quote missing_files);
wenzelm@7191
   286
    change_deps name (fn _ => Some (make_deps true false (Some master) files));
wenzelm@7099
   287
    perform Update name
wenzelm@7099
   288
  end;
wenzelm@7099
   289
wenzelm@7099
   290
wenzelm@6211
   291
(* require_thy *)
wenzelm@6211
   292
wenzelm@7211
   293
local
wenzelm@6211
   294
wenzelm@7941
   295
fun load_deps ml dir name =
wenzelm@7941
   296
  let val (master, (parents, files)) = ThyLoad.deps_thy dir name ml
wenzelm@7191
   297
  in (Some (init_deps (Some master) files), parents) end;
wenzelm@6211
   298
wenzelm@6211
   299
fun file_current (_, None) = false
wenzelm@7941
   300
  | file_current (path, info) = (info = ThyLoad.check_file path);
wenzelm@6211
   301
wenzelm@7941
   302
fun current_deps ml strict dir name =
wenzelm@6211
   303
  (case lookup_deps name of
wenzelm@7941
   304
    None => (false, load_deps ml dir name)
wenzelm@6211
   305
  | Some deps =>
wenzelm@6211
   306
      let val same_deps = (None, thy_graph Graph.imm_preds name) in
wenzelm@6211
   307
        (case deps of
wenzelm@6211
   308
          None => (true, same_deps)
wenzelm@6211
   309
        | Some {present, outdated, master, files} =>
wenzelm@6211
   310
            if present andalso not strict then (true, same_deps)
wenzelm@6211
   311
            else
wenzelm@7941
   312
              let val master' = Some (ThyLoad.check_thy dir name ml) in
wenzelm@7941
   313
                if master <> master' then (false, load_deps ml dir name)
wenzelm@6211
   314
                else (not outdated andalso forall file_current files, same_deps)
wenzelm@6211
   315
              end)
wenzelm@6211
   316
      end);
wenzelm@6211
   317
wenzelm@9822
   318
fun require_thy really ml time strict keep_strict initiators prfx (visited, str) =
wenzelm@6211
   319
  let
wenzelm@7066
   320
    val path = Path.expand (Path.unpack str);
wenzelm@6484
   321
    val name = Path.pack (Path.base path);
wenzelm@7066
   322
  in
wenzelm@9332
   323
    if name mem_string initiators then error (cycle_msg initiators) else ();
wenzelm@7952
   324
    if known_thy name andalso is_finished name orelse name mem_string visited then
wenzelm@7952
   325
      (visited, (true, name))
wenzelm@7066
   326
    else
wenzelm@7066
   327
      let
wenzelm@7066
   328
        val dir = Path.append prfx (Path.dir path);
wenzelm@9822
   329
        val req_parent = require_thy true true time (strict andalso keep_strict) keep_strict
wenzelm@9822
   330
          (name :: initiators) dir;
wenzelm@6484
   331
wenzelm@7941
   332
        val (current, (new_deps, parents)) = current_deps ml strict dir name handle ERROR =>
wenzelm@7099
   333
          error (loader_msg "the error(s) above occurred while examining theory" [name] ^
wenzelm@9490
   334
            (if null initiators then "" else required_by "\n" initiators));
wenzelm@7066
   335
        val (visited', parent_results) = foldl_map req_parent (name :: visited, parents);
wenzelm@6211
   336
wenzelm@9822
   337
        val thy = if not really then Some (get_theory name) else None;
wenzelm@7066
   338
        val result =
wenzelm@7066
   339
          if current andalso forall #1 parent_results then true
wenzelm@7066
   340
          else
wenzelm@7066
   341
            ((case new_deps of
wenzelm@9822
   342
              Some deps => change_thys (update_node name parents (deps, thy))
wenzelm@7066
   343
            | None => ());
wenzelm@9822
   344
             load_thy really ml (time orelse ! Library.timing) initiators dir name parents;
wenzelm@7099
   345
             false);
wenzelm@7066
   346
      in (visited', (result, name)) end
wenzelm@7066
   347
  end;
wenzelm@6484
   348
wenzelm@7066
   349
fun gen_use_thy req s =
wenzelm@7066
   350
  let val (_, (_, name)) = req [] Path.current ([], s)
wenzelm@7066
   351
  in Context.context (get_theory name) end;
wenzelm@6241
   352
wenzelm@7244
   353
fun warn_finished f name = (check_unfinished warning name; f name);
wenzelm@7244
   354
wenzelm@7211
   355
in
wenzelm@7211
   356
wenzelm@9822
   357
val weak_use_thy        = gen_use_thy (require_thy true true false false false);
wenzelm@9822
   358
fun quiet_update_thy ml = gen_use_thy (require_thy true ml false true true);
wenzelm@7244
   359
wenzelm@9822
   360
val use_thy          = warn_finished (gen_use_thy (require_thy true true false true false));
wenzelm@9822
   361
val time_use_thy     = warn_finished (gen_use_thy (require_thy true true true true false));
wenzelm@9822
   362
val use_thy_only     = warn_finished (gen_use_thy (require_thy true false false true false));
wenzelm@9822
   363
val update_thy       = warn_finished (gen_use_thy (require_thy true true false true true));
wenzelm@9822
   364
val update_thy_only  = warn_finished (gen_use_thy (require_thy true false false true true));
wenzelm@9822
   365
val pretend_use_thy_only = warn_finished (gen_use_thy (require_thy false false false true false));
wenzelm@6211
   366
wenzelm@7211
   367
end;
wenzelm@7211
   368
wenzelm@6211
   369
wenzelm@6666
   370
(* remove_thy *)
wenzelm@6666
   371
wenzelm@6666
   372
fun remove_thy name =
wenzelm@7910
   373
  if is_finished name then error (loader_msg "cannot remove finished theory" [name])
wenzelm@6666
   374
  else
wenzelm@6666
   375
    let val succs = thy_graph Graph.all_succs [name] in
wenzelm@9778
   376
      priority (loader_msg "removing" succs);
wenzelm@7191
   377
      seq (perform Remove) succs;
wenzelm@7191
   378
      change_thys (Graph.del_nodes succs)
wenzelm@6666
   379
    end;
wenzelm@6666
   380
wenzelm@6666
   381
wenzelm@7066
   382
(* begin / end theory *)
wenzelm@6211
   383
wenzelm@8805
   384
fun begin_theory present upd name parents paths =
wenzelm@6211
   385
  let
wenzelm@8805
   386
    val assert_thy = if upd then quiet_update_thy true else weak_use_thy;
wenzelm@7244
   387
    val _ = check_unfinished error name;
wenzelm@7941
   388
    val _ = (map Path.basic parents; seq assert_thy parents);
wenzelm@6211
   389
    val theory = PureThy.begin_theory name (map get_theory parents);
wenzelm@7952
   390
    val deps =
wenzelm@7952
   391
      if known_thy name then get_deps name
wenzelm@7952
   392
      else (init_deps None (map #1 paths));   (*records additional ML files only!*)
wenzelm@6329
   393
    val use_paths = mapfilter (fn (x, true) => Some x | _ => None) paths;
wenzelm@9451
   394
wenzelm@9451
   395
    val _ = change_thys (update_node name parents (deps, Some (Theory.copy theory)));
wenzelm@8805
   396
    val theory' = theory |> present name parents paths;
wenzelm@9451
   397
    val _ = put_theory name (Theory.copy theory');
wenzelm@8805
   398
    val ((), theory'') = Context.pass_theory theory' (seq (load_file false)) use_paths;
wenzelm@9451
   399
    val _ = put_theory name (Theory.copy theory'');
wenzelm@8805
   400
  in theory'' end;
wenzelm@7244
   401
wenzelm@6211
   402
fun end_theory theory =
wenzelm@7099
   403
  let
wenzelm@7099
   404
    val theory' = PureThy.end_theory theory;
wenzelm@7099
   405
    val name = PureThy.get_name theory;
wenzelm@7099
   406
  in put_theory name theory'; theory' end;
wenzelm@6211
   407
wenzelm@6211
   408
wenzelm@6666
   409
(* finish all theories *)
wenzelm@6211
   410
wenzelm@6666
   411
fun finish () = change_thys (Graph.map_nodes (fn (_, entry) => (None, entry)));
wenzelm@6211
   412
wenzelm@6211
   413
wenzelm@6211
   414
(* register existing theories *)
wenzelm@6211
   415
wenzelm@6211
   416
fun register_theory theory =
wenzelm@6211
   417
  let
wenzelm@6211
   418
    val name = PureThy.get_name theory;
wenzelm@6211
   419
    val parents = Theory.parents_of theory;
wenzelm@6211
   420
    val parent_names = map PureThy.get_name parents;
wenzelm@6211
   421
wenzelm@6211
   422
    fun err txt bads =
wenzelm@6211
   423
      error (loader_msg txt bads ^ "\n" ^ gen_msg "cannot register theory" [name]);
wenzelm@6211
   424
wenzelm@6666
   425
    val nonfinished = filter_out is_finished parent_names;
wenzelm@6211
   426
    fun get_variant (x, y_name) =
wenzelm@6211
   427
      if Theory.eq_thy (x, get_theory y_name) then None
wenzelm@6211
   428
      else Some y_name;
wenzelm@6211
   429
    val variants = mapfilter get_variant (parents ~~ parent_names);
wenzelm@6211
   430
wenzelm@6211
   431
    fun register G =
wenzelm@6362
   432
      (Graph.new_node (name, (None, Some theory)) G
wenzelm@9327
   433
        handle Graph.DUP _ => err "duplicate theory entry" [])
wenzelm@6211
   434
      |> add_deps name parent_names;
wenzelm@6211
   435
  in
wenzelm@6666
   436
    if not (null nonfinished) then err "non-finished parent theories" nonfinished
wenzelm@6211
   437
    else if not (null variants) then err "different versions of parent theories" variants
wenzelm@7099
   438
    else (change_thys register; perform Update name)
wenzelm@6211
   439
  end;
wenzelm@6211
   440
wenzelm@6211
   441
wenzelm@6211
   442
(*final declarations of this structure*)
wenzelm@6211
   443
val theory = get_theory;
wenzelm@6211
   444
val names = get_names;
wenzelm@6211
   445
wenzelm@6211
   446
end;
wenzelm@6211
   447
wenzelm@5209
   448
structure BasicThyInfo: BASIC_THY_INFO = ThyInfo;
wenzelm@5209
   449
open BasicThyInfo;