src/Pure/Thy/thy_info.ML
author berghofe
Mon Aug 23 18:33:55 2004 +0200 (2004-08-23)
changeset 15158 2281784015a5
parent 15065 9feac0b7f935
child 15531 08c8dad8e399
permissions -rw-r--r--
Fixed several bugs related to path specifications in theory names.
berghofe@3604
     1
(*  Title:      Pure/Thy/thy_info.ML
berghofe@3604
     2
    ID:         $Id$
wenzelm@6211
     3
    Author:     Markus Wenzel, TU Muenchen
berghofe@3604
     4
wenzelm@6362
     5
Theory loader database, including theory and file dependencies.
wenzelm@3976
     6
*)
berghofe@3604
     7
wenzelm@5209
     8
signature BASIC_THY_INFO =
wenzelm@5209
     9
sig
wenzelm@5209
    10
  val theory: string -> theory
wenzelm@6211
    11
  val theory_of_sign: Sign.sg -> theory
wenzelm@6211
    12
  val theory_of_thm: thm -> theory
wenzelm@6241
    13
(*val use: string -> unit*)             (*exported later*)
wenzelm@6241
    14
  val time_use: string -> unit
wenzelm@6211
    15
  val touch_thy: string -> unit
wenzelm@6211
    16
  val use_thy: string -> unit
wenzelm@6211
    17
  val update_thy: string -> unit
wenzelm@6666
    18
  val remove_thy: string -> unit
wenzelm@6211
    19
  val time_use_thy: string -> unit
wenzelm@6527
    20
  val use_thy_only: string -> unit
wenzelm@7099
    21
  val update_thy_only: string -> unit
wenzelm@6211
    22
end;
wenzelm@5209
    23
berghofe@3604
    24
signature THY_INFO =
berghofe@3604
    25
sig
wenzelm@5209
    26
  include BASIC_THY_INFO
wenzelm@7099
    27
  datatype action = Update | Outdate | Remove
wenzelm@7099
    28
  val str_of_action: action -> string
wenzelm@7099
    29
  val add_hook: (action -> string -> unit) -> unit
wenzelm@6211
    30
  val names: unit -> string list
wenzelm@7910
    31
  val known_thy: string -> bool
wenzelm@7935
    32
  val check_known_thy: string -> bool
wenzelm@7935
    33
  val if_known_thy: (string -> unit) -> string -> unit
wenzelm@7288
    34
  val lookup_theory: string -> theory option
wenzelm@6211
    35
  val get_theory: string -> theory
berghofe@6654
    36
  val get_preds: string -> string list
wenzelm@7935
    37
  val loaded_files: string -> Path.T list
wenzelm@7910
    38
  val touch_child_thys: string -> unit
wenzelm@7099
    39
  val touch_all_thys: unit -> unit
wenzelm@7941
    40
  val load_file: bool -> Path.T -> unit
wenzelm@6241
    41
  val use: string -> unit
wenzelm@7952
    42
  val quiet_update_thy: bool -> string -> unit
wenzelm@9822
    43
  val pretend_use_thy_only: string -> unit
berghofe@15158
    44
  val begin_theory: (Path.T option -> string -> string list ->
berghofe@15158
    45
      (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@14774
   127
  in Graph.all_succs G (Graph.minimals 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
berghofe@15158
   230
val opt_path = apsome (Path.dir o fst o ThyLoad.get_thy);
berghofe@15158
   231
fun opt_path' (d : deps option) = if_none (apsome (opt_path o #master) d) None;
berghofe@15158
   232
fun opt_path'' d = if_none (apsome opt_path' d) None;
berghofe@15158
   233
wenzelm@7191
   234
local
wenzelm@7191
   235
wenzelm@7941
   236
fun provide path name info (deps as Some {present, outdated, master, files}) =
wenzelm@7941
   237
     (if exists (equal path o #1) files then ()
wenzelm@7941
   238
      else warning (loader_msg "undeclared dependency of theory" [name] ^
wenzelm@7941
   239
        " on file: " ^ quote (Path.pack path));
wenzelm@7941
   240
      Some (make_deps present outdated master (overwrite (files, (path, Some info)))))
wenzelm@7941
   241
  | provide _ _ _ None = None;
wenzelm@7941
   242
wenzelm@7941
   243
fun run_file path =
wenzelm@7941
   244
  (case apsome PureThy.get_name (Context.get_context ()) of
berghofe@15158
   245
    None => (ThyLoad.load_file None path; ())
berghofe@15158
   246
  | Some name => (case lookup_deps name of
berghofe@15158
   247
      Some deps => change_deps name (provide path name
berghofe@15158
   248
        (ThyLoad.load_file (opt_path' deps) path))
berghofe@15158
   249
    | None => (ThyLoad.load_file None path; ())));
wenzelm@6211
   250
wenzelm@7191
   251
in
wenzelm@7191
   252
wenzelm@7941
   253
fun load_file time path =
wenzelm@7941
   254
  if time then
wenzelm@7244
   255
    let val name = Path.pack path in
wenzelm@7244
   256
      timeit (fn () =>
wenzelm@9778
   257
       (priority ("\n**** Starting file " ^ quote name ^ " ****");
wenzelm@9036
   258
        run_file path;
wenzelm@9778
   259
        priority ("**** Finished file " ^ quote name ^ " ****\n")))
wenzelm@7244
   260
    end
wenzelm@7941
   261
  else run_file path;
wenzelm@7941
   262
wenzelm@7941
   263
val use = load_file false o Path.unpack;
wenzelm@7941
   264
val time_use = load_file true o Path.unpack;
wenzelm@7191
   265
wenzelm@7191
   266
end;
wenzelm@6233
   267
wenzelm@6233
   268
wenzelm@7099
   269
(* load_thy *)
wenzelm@7099
   270
wenzelm@9490
   271
fun required_by _ [] = ""
wenzelm@9490
   272
  | required_by s initiators = s ^ "(required by " ^ show_path (rev initiators) ^ ")";
wenzelm@7099
   273
berghofe@15065
   274
fun load_thy really ml time initiators dir name =
wenzelm@7099
   275
  let
wenzelm@9822
   276
    val _ =
wenzelm@9822
   277
      if really then priority ("Loading theory " ^ quote name ^ required_by " " initiators)
wenzelm@9822
   278
      else priority ("Registering theory " ^ quote name);
wenzelm@7099
   279
wenzelm@7099
   280
    val _ = touch_thy name;
wenzelm@9822
   281
    val master =
wenzelm@9822
   282
      if really then ThyLoad.load_thy dir name ml time
wenzelm@9822
   283
      else #1 (ThyLoad.deps_thy dir name ml);
wenzelm@7099
   284
wenzelm@7099
   285
    val files = get_files name;
wenzelm@7099
   286
    val missing_files = mapfilter (fn (path, None) => Some (Path.pack path) | _ => None) files;
wenzelm@7099
   287
  in
wenzelm@7099
   288
    if null missing_files then ()
wenzelm@7099
   289
    else warning (loader_msg "unresolved dependencies of theory" [name] ^
wenzelm@7223
   290
      " on file(s): " ^ commas_quote missing_files);
wenzelm@7191
   291
    change_deps name (fn _ => Some (make_deps true false (Some master) files));
wenzelm@7099
   292
    perform Update name
wenzelm@7099
   293
  end;
wenzelm@7099
   294
wenzelm@7099
   295
wenzelm@6211
   296
(* require_thy *)
wenzelm@6211
   297
berghofe@15065
   298
fun base_of_path s = Path.pack (Path.base (Path.unpack s));
berghofe@15065
   299
wenzelm@7211
   300
local
wenzelm@6211
   301
wenzelm@7941
   302
fun load_deps ml dir name =
wenzelm@7941
   303
  let val (master, (parents, files)) = ThyLoad.deps_thy dir name ml
wenzelm@7191
   304
  in (Some (init_deps (Some master) files), parents) end;
wenzelm@6211
   305
berghofe@15158
   306
fun file_current master (_, None) = false
berghofe@15158
   307
  | file_current master (path, info) =
berghofe@15158
   308
      (info = ThyLoad.check_file (opt_path master) path);
wenzelm@6211
   309
wenzelm@7941
   310
fun current_deps ml strict dir name =
wenzelm@6211
   311
  (case lookup_deps name of
wenzelm@7941
   312
    None => (false, load_deps ml dir name)
wenzelm@6211
   313
  | Some deps =>
berghofe@15158
   314
      let
berghofe@15158
   315
        fun get_name s = (case opt_path'' (lookup_deps s) of None => s
berghofe@15158
   316
          | Some p => Path.pack (Path.append p (Path.basic s)));
berghofe@15158
   317
        val same_deps = (None, map get_name (thy_graph Graph.imm_preds name))
berghofe@15158
   318
      in
wenzelm@6211
   319
        (case deps of
wenzelm@6211
   320
          None => (true, same_deps)
wenzelm@6211
   321
        | Some {present, outdated, master, files} =>
wenzelm@6211
   322
            if present andalso not strict then (true, same_deps)
wenzelm@6211
   323
            else
wenzelm@7941
   324
              let val master' = Some (ThyLoad.check_thy dir name ml) in
wenzelm@7941
   325
                if master <> master' then (false, load_deps ml dir name)
berghofe@15158
   326
                else (not outdated andalso forall (file_current master') files, same_deps)
wenzelm@6211
   327
              end)
wenzelm@6211
   328
      end);
wenzelm@6211
   329
wenzelm@9822
   330
fun require_thy really ml time strict keep_strict initiators prfx (visited, str) =
wenzelm@6211
   331
  let
wenzelm@7066
   332
    val path = Path.expand (Path.unpack str);
wenzelm@6484
   333
    val name = Path.pack (Path.base path);
wenzelm@7066
   334
  in
wenzelm@9332
   335
    if name mem_string initiators then error (cycle_msg initiators) else ();
wenzelm@7952
   336
    if known_thy name andalso is_finished name orelse name mem_string visited then
wenzelm@7952
   337
      (visited, (true, name))
wenzelm@7066
   338
    else
wenzelm@7066
   339
      let
wenzelm@7066
   340
        val dir = Path.append prfx (Path.dir path);
wenzelm@9822
   341
        val req_parent = require_thy true true time (strict andalso keep_strict) keep_strict
berghofe@15065
   342
          (name :: initiators);
wenzelm@6484
   343
wenzelm@7941
   344
        val (current, (new_deps, parents)) = current_deps ml strict dir name handle ERROR =>
wenzelm@7099
   345
          error (loader_msg "the error(s) above occurred while examining theory" [name] ^
wenzelm@9490
   346
            (if null initiators then "" else required_by "\n" initiators));
berghofe@15158
   347
        val dir' = if_none (opt_path'' new_deps) dir;
berghofe@15065
   348
        val (visited', parent_results) = foldl_map (req_parent dir') (name :: visited, parents);
wenzelm@6211
   349
wenzelm@9822
   350
        val thy = if not really then Some (get_theory name) else None;
wenzelm@7066
   351
        val result =
wenzelm@7066
   352
          if current andalso forall #1 parent_results then true
wenzelm@7066
   353
          else
wenzelm@7066
   354
            ((case new_deps of
berghofe@15065
   355
              Some deps => change_thys (update_node name (map base_of_path parents) (deps, thy))
wenzelm@7066
   356
            | None => ());
berghofe@15065
   357
             load_thy really ml (time orelse ! Output.timing) initiators dir name;
wenzelm@7099
   358
             false);
wenzelm@7066
   359
      in (visited', (result, name)) end
wenzelm@7066
   360
  end;
wenzelm@6484
   361
berghofe@15158
   362
fun gen_use_thy' req prfx s =
berghofe@15158
   363
  let val (_, (_, name)) = req [] prfx ([], s)
wenzelm@7066
   364
  in Context.context (get_theory name) end;
wenzelm@6241
   365
berghofe@15158
   366
fun gen_use_thy req = gen_use_thy' req Path.current;
berghofe@15158
   367
wenzelm@7244
   368
fun warn_finished f name = (check_unfinished warning name; f name);
wenzelm@7244
   369
wenzelm@7211
   370
in
wenzelm@7211
   371
berghofe@15158
   372
val weak_use_thy         = gen_use_thy' (require_thy true true false false false);
berghofe@15158
   373
fun quiet_update_thy' ml = gen_use_thy' (require_thy true ml false true true);
berghofe@15158
   374
fun quiet_update_thy ml  = gen_use_thy (require_thy true ml false true true);
wenzelm@7244
   375
wenzelm@9822
   376
val use_thy          = warn_finished (gen_use_thy (require_thy true true false true false));
wenzelm@9822
   377
val time_use_thy     = warn_finished (gen_use_thy (require_thy true true true true false));
wenzelm@9822
   378
val use_thy_only     = warn_finished (gen_use_thy (require_thy true false false true false));
wenzelm@9822
   379
val update_thy       = warn_finished (gen_use_thy (require_thy true true false true true));
wenzelm@9822
   380
val update_thy_only  = warn_finished (gen_use_thy (require_thy true false false true true));
wenzelm@9822
   381
val pretend_use_thy_only = warn_finished (gen_use_thy (require_thy false false false true false));
wenzelm@6211
   382
wenzelm@7211
   383
end;
wenzelm@7211
   384
wenzelm@6211
   385
wenzelm@6666
   386
(* remove_thy *)
wenzelm@6666
   387
wenzelm@6666
   388
fun remove_thy name =
wenzelm@7910
   389
  if is_finished name then error (loader_msg "cannot remove finished theory" [name])
wenzelm@6666
   390
  else
wenzelm@6666
   391
    let val succs = thy_graph Graph.all_succs [name] in
wenzelm@9778
   392
      priority (loader_msg "removing" succs);
wenzelm@7191
   393
      seq (perform Remove) succs;
wenzelm@7191
   394
      change_thys (Graph.del_nodes succs)
wenzelm@6666
   395
    end;
wenzelm@6666
   396
wenzelm@6666
   397
wenzelm@7066
   398
(* begin / end theory *)
wenzelm@6211
   399
wenzelm@8805
   400
fun begin_theory present upd name parents paths =
wenzelm@6211
   401
  let
berghofe@15065
   402
    val bparents = map base_of_path parents;
berghofe@15158
   403
    val dir' = opt_path'' (lookup_deps name);
berghofe@15158
   404
    val dir = if_none dir' Path.current;
berghofe@15158
   405
    val assert_thy = if upd then quiet_update_thy' true dir else weak_use_thy dir;
wenzelm@7244
   406
    val _ = check_unfinished error name;
berghofe@15065
   407
    val _ = seq assert_thy parents;
berghofe@15065
   408
    val theory = PureThy.begin_theory name (map get_theory bparents);
wenzelm@7952
   409
    val deps =
wenzelm@7952
   410
      if known_thy name then get_deps name
wenzelm@7952
   411
      else (init_deps None (map #1 paths));   (*records additional ML files only!*)
wenzelm@6329
   412
    val use_paths = mapfilter (fn (x, true) => Some x | _ => None) paths;
wenzelm@9451
   413
berghofe@15065
   414
    val _ = change_thys (update_node name bparents (deps, Some (Theory.copy theory)));
berghofe@15158
   415
    val theory' = theory |> present dir' name bparents paths;
wenzelm@9451
   416
    val _ = put_theory name (Theory.copy theory');
wenzelm@8805
   417
    val ((), theory'') = Context.pass_theory theory' (seq (load_file false)) use_paths;
wenzelm@9451
   418
    val _ = put_theory name (Theory.copy theory'');
wenzelm@8805
   419
  in theory'' end;
wenzelm@7244
   420
wenzelm@6211
   421
fun end_theory theory =
wenzelm@7099
   422
  let
wenzelm@7099
   423
    val theory' = PureThy.end_theory theory;
wenzelm@7099
   424
    val name = PureThy.get_name theory;
wenzelm@7099
   425
  in put_theory name theory'; theory' end;
wenzelm@6211
   426
wenzelm@6211
   427
wenzelm@6666
   428
(* finish all theories *)
wenzelm@6211
   429
wenzelm@6666
   430
fun finish () = change_thys (Graph.map_nodes (fn (_, entry) => (None, entry)));
wenzelm@6211
   431
wenzelm@6211
   432
wenzelm@6211
   433
(* register existing theories *)
wenzelm@6211
   434
wenzelm@6211
   435
fun register_theory theory =
wenzelm@6211
   436
  let
wenzelm@6211
   437
    val name = PureThy.get_name theory;
wenzelm@6211
   438
    val parents = Theory.parents_of theory;
wenzelm@6211
   439
    val parent_names = map PureThy.get_name parents;
wenzelm@6211
   440
wenzelm@6211
   441
    fun err txt bads =
wenzelm@6211
   442
      error (loader_msg txt bads ^ "\n" ^ gen_msg "cannot register theory" [name]);
wenzelm@6211
   443
wenzelm@6666
   444
    val nonfinished = filter_out is_finished parent_names;
wenzelm@6211
   445
    fun get_variant (x, y_name) =
wenzelm@6211
   446
      if Theory.eq_thy (x, get_theory y_name) then None
wenzelm@6211
   447
      else Some y_name;
wenzelm@6211
   448
    val variants = mapfilter get_variant (parents ~~ parent_names);
wenzelm@6211
   449
wenzelm@6211
   450
    fun register G =
wenzelm@6362
   451
      (Graph.new_node (name, (None, Some theory)) G
wenzelm@9327
   452
        handle Graph.DUP _ => err "duplicate theory entry" [])
wenzelm@6211
   453
      |> add_deps name parent_names;
wenzelm@6211
   454
  in
wenzelm@6666
   455
    if not (null nonfinished) then err "non-finished parent theories" nonfinished
wenzelm@6211
   456
    else if not (null variants) then err "different versions of parent theories" variants
wenzelm@7099
   457
    else (change_thys register; perform Update name)
wenzelm@6211
   458
  end;
wenzelm@6211
   459
wenzelm@6211
   460
wenzelm@6211
   461
(*final declarations of this structure*)
wenzelm@6211
   462
val theory = get_theory;
wenzelm@6211
   463
val names = get_names;
wenzelm@6211
   464
wenzelm@6211
   465
end;
wenzelm@6211
   466
wenzelm@5209
   467
structure BasicThyInfo: BASIC_THY_INFO = ThyInfo;
wenzelm@5209
   468
open BasicThyInfo;