src/Pure/Thy/thy_info.ML
author wenzelm
Sun Jul 29 16:00:06 2007 +0200 (2007-07-29)
changeset 24057 f42665561801
parent 23982 e3c4c0b9ae05
child 24068 245b7e68a3bc
permissions -rw-r--r--
removed obsolete Output.ML_errors/toplevel_errors;
moved ML toplevel use commands to pure_setup.ML;
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@15801
     5
Main part of theory loader database, including handling of theory and
wenzelm@15801
     6
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 touch_thy: string -> unit
wenzelm@6666
    13
  val remove_thy: string -> unit
wenzelm@6211
    14
end;
wenzelm@5209
    15
berghofe@3604
    16
signature THY_INFO =
berghofe@3604
    17
sig
wenzelm@5209
    18
  include BASIC_THY_INFO
wenzelm@7099
    19
  datatype action = Update | Outdate | Remove
wenzelm@7099
    20
  val str_of_action: action -> string
wenzelm@7099
    21
  val add_hook: (action -> string -> unit) -> unit
wenzelm@6211
    22
  val names: unit -> string list
wenzelm@7910
    23
  val known_thy: string -> bool
wenzelm@7935
    24
  val check_known_thy: string -> bool
wenzelm@7935
    25
  val if_known_thy: (string -> unit) -> string -> unit
wenzelm@7288
    26
  val lookup_theory: string -> theory option
wenzelm@6211
    27
  val get_theory: string -> theory
wenzelm@19547
    28
  val the_theory: string -> theory -> theory
wenzelm@23871
    29
  val get_parents: string -> string list
wenzelm@7935
    30
  val loaded_files: string -> Path.T list
wenzelm@7910
    31
  val touch_child_thys: string -> unit
wenzelm@7099
    32
  val touch_all_thys: unit -> unit
wenzelm@7941
    33
  val load_file: bool -> Path.T -> unit
wenzelm@6241
    34
  val use: string -> unit
wenzelm@24057
    35
  val time_use: string -> unit
wenzelm@9822
    36
  val pretend_use_thy_only: string -> unit
wenzelm@24057
    37
  val use_thys: string list -> unit
wenzelm@24057
    38
  val use_thy: string -> unit
wenzelm@24057
    39
  val time_use_thy: string -> unit
wenzelm@24057
    40
  val update_thy: string -> unit
wenzelm@23900
    41
  val begin_theory: string -> string list -> (Path.T * bool) list -> bool -> theory
wenzelm@6211
    42
  val end_theory: theory -> theory
wenzelm@6666
    43
  val finish: unit -> unit
wenzelm@6211
    44
  val register_theory: theory -> unit
paulson@15633
    45
  val pretty_theory: theory -> Pretty.T
berghofe@3604
    46
end;
berghofe@3604
    47
wenzelm@6362
    48
structure ThyInfo: THY_INFO =
wenzelm@6211
    49
struct
berghofe@3604
    50
wenzelm@7099
    51
(** theory loader actions and hooks **)
wenzelm@7099
    52
wenzelm@7099
    53
datatype action = Update | Outdate | Remove;
wenzelm@7099
    54
val str_of_action = fn Update => "Update" | Outdate => "Outdate" | Remove => "Remove";
wenzelm@7099
    55
wenzelm@7099
    56
local
wenzelm@7099
    57
  val hooks = ref ([]: (action -> string -> unit) list);
wenzelm@7099
    58
in
wenzelm@23939
    59
  fun add_hook f = CRITICAL (fn () => change hooks (cons f));
skalberg@15570
    60
  fun perform action name = List.app (fn f => (try (fn () => f action name) (); ())) (! hooks);
wenzelm@7099
    61
end;
wenzelm@7099
    62
wenzelm@7099
    63
wenzelm@7099
    64
wenzelm@6211
    65
(** thy database **)
wenzelm@6211
    66
wenzelm@6211
    67
(* messages *)
wenzelm@6211
    68
wenzelm@23871
    69
fun loader_msg txt [] = "Theory loader: " ^ txt
wenzelm@23871
    70
  | loader_msg txt names = "Theory loader: " ^ txt ^ " " ^ commas_quote names;
wenzelm@6211
    71
wenzelm@6211
    72
val show_path = space_implode " via " o map quote;
wenzelm@9332
    73
fun cycle_msg names = loader_msg ("cyclic dependency of " ^ show_path names) [];
berghofe@3604
    74
berghofe@3604
    75
wenzelm@6666
    76
(* derived graph operations *)
berghofe@3604
    77
wenzelm@9327
    78
fun add_deps name parents G = Graph.add_deps_acyclic (name, parents) G
wenzelm@9332
    79
  handle Graph.CYCLES namess => error (cat_lines (map cycle_msg namess));
berghofe@3604
    80
wenzelm@7952
    81
fun upd_deps name entry G =
wenzelm@19473
    82
  fold (fn parent => Graph.del_edge (parent, name)) (Graph.imm_preds G name) G
wenzelm@7952
    83
  |> Graph.map_node name (K entry);
wenzelm@3976
    84
wenzelm@23967
    85
fun new_deps name parents entry G =
wenzelm@7952
    86
  (if can (Graph.get_node G) name then upd_deps name entry G else Graph.new_node (name, entry) G)
wenzelm@7952
    87
  |> add_deps name parents;
berghofe@3604
    88
berghofe@3604
    89
wenzelm@6211
    90
(* thy database *)
wenzelm@6211
    91
wenzelm@23871
    92
type master = (Path.T * File.ident) * (Path.T * File.ident) option;
wenzelm@23871
    93
wenzelm@6211
    94
type deps =
wenzelm@23910
    95
  {outdated: bool,              (*entry considered outdated*)
wenzelm@23886
    96
    master: master option,      (*master dependencies for thy + attached ML file*)
wenzelm@23893
    97
    parents: string list,       (*source specification of parents (partially qualified)*)
wenzelm@23886
    98
    files:                      (*auxiliary files: source path, physical path + identifier*)
wenzelm@23886
    99
      (Path.T * (Path.T * File.ident) option) list};
wenzelm@23886
   100
wenzelm@23910
   101
fun make_deps outdated master parents files : deps =
wenzelm@23910
   102
  {outdated = outdated, master = master, parents = parents, files = files};
wenzelm@23886
   103
wenzelm@23893
   104
fun init_deps master parents files =
wenzelm@23910
   105
  SOME (make_deps true master parents (map (rpair NONE) files));
wenzelm@23871
   106
wenzelm@23871
   107
fun master_idents (NONE: master option) = []
wenzelm@23871
   108
  | master_idents (SOME ((_, thy_id), NONE)) = [thy_id]
wenzelm@23871
   109
  | master_idents (SOME ((_, thy_id), SOME (_, ml_id))) = [thy_id, ml_id];
wenzelm@23871
   110
wenzelm@23886
   111
fun master_dir (NONE: master option) = Path.current
wenzelm@23886
   112
  | master_dir (SOME ((path, _), _)) = Path.dir path;
wenzelm@6211
   113
wenzelm@23886
   114
fun master_dir' (d: deps option) = the_default Path.current (Option.map (master_dir o #master) d);
wenzelm@23886
   115
fun master_dir'' d = the_default Path.current (Option.map master_dir' d);
berghofe@3604
   116
wenzelm@23967
   117
fun base_name s = Path.implode (Path.base (Path.explode s));
wenzelm@23967
   118
wenzelm@7211
   119
wenzelm@6362
   120
type thy = deps option * theory option;
berghofe@3604
   121
wenzelm@6211
   122
local
wenzelm@6362
   123
  val database = ref (Graph.empty: thy Graph.T);
wenzelm@6211
   124
in
wenzelm@6362
   125
  fun get_thys () = ! database;
wenzelm@23939
   126
  fun change_thys f = CRITICAL (fn () => Library.change database f);
berghofe@3604
   127
end;
wenzelm@5209
   128
wenzelm@5209
   129
wenzelm@6211
   130
(* access thy graph *)
wenzelm@6211
   131
wenzelm@6211
   132
fun thy_graph f x = f (get_thys ()) x;
wenzelm@9417
   133
wenzelm@23967
   134
fun get_names () = Graph.topological_order (get_thys ());
wenzelm@6211
   135
wenzelm@6211
   136
wenzelm@6211
   137
(* access thy *)
wenzelm@6211
   138
wenzelm@7935
   139
fun lookup_thy name =
skalberg@15531
   140
  SOME (thy_graph Graph.get_node name) handle Graph.UNDEF _ => NONE;
wenzelm@7935
   141
wenzelm@16047
   142
val known_thy = is_some o lookup_thy;
wenzelm@7935
   143
fun check_known_thy name = known_thy name orelse (warning ("Unknown theory " ^ quote name); false);
wenzelm@7935
   144
fun if_known_thy f name = if check_known_thy name then f name else ();
wenzelm@6211
   145
wenzelm@6211
   146
fun get_thy name =
wenzelm@6211
   147
  (case lookup_thy name of
skalberg@15531
   148
    SOME thy => thy
skalberg@15531
   149
  | NONE => error (loader_msg "nothing known about theory" [name]));
wenzelm@6211
   150
wenzelm@23939
   151
fun change_thy name f = CRITICAL (fn () =>
wenzelm@23939
   152
  (get_thy name; change_thys (Graph.map_node name f)));
wenzelm@6211
   153
wenzelm@6211
   154
wenzelm@6211
   155
(* access deps *)
wenzelm@6211
   156
skalberg@15570
   157
val lookup_deps = Option.map #1 o lookup_thy;
wenzelm@6211
   158
val get_deps = #1 o get_thy;
wenzelm@6211
   159
fun change_deps name f = change_thy name (fn (deps, x) => (f deps, x));
wenzelm@6211
   160
wenzelm@6666
   161
fun is_finished name = is_none (get_deps name);
skalberg@15531
   162
fun get_files name = (case get_deps name of SOME {files, ...} => files | _ => []);
wenzelm@7191
   163
wenzelm@7191
   164
fun loaded_files name =
wenzelm@7191
   165
  (case get_deps name of
skalberg@15531
   166
    NONE => []
skalberg@15531
   167
  | SOME {master, files, ...} =>
wenzelm@23871
   168
      (case master of SOME ((thy_path, _), _) => [thy_path] | NONE => []) @
wenzelm@19482
   169
      (map_filter (Option.map #1 o #2) files));
wenzelm@6211
   170
wenzelm@23871
   171
fun get_parents name =
wenzelm@23967
   172
  thy_graph Graph.imm_preds name handle Graph.UNDEF _ =>
berghofe@6654
   173
    error (loader_msg "nothing known about theory" [name]);
berghofe@6654
   174
wenzelm@6211
   175
wenzelm@16047
   176
(* pretty printing a theory *)
wenzelm@16047
   177
wenzelm@16047
   178
local
paulson@15633
   179
wenzelm@16047
   180
fun relevant_names names =
wenzelm@16047
   181
  let
wenzelm@16047
   182
    val (finished, unfinished) =
wenzelm@19305
   183
      List.filter (fn name => name = Context.draftN orelse known_thy name) names
wenzelm@19305
   184
      |> List.partition (fn name => name <> Context.draftN andalso is_finished name);
wenzelm@16047
   185
  in (if not (null finished) then [List.last finished] else []) @ unfinished end;
paulson@15633
   186
wenzelm@16047
   187
in
paulson@15633
   188
wenzelm@16454
   189
fun pretty_theory thy =
wenzelm@16454
   190
  Pretty.str_list "{" "}" (relevant_names (Context.names_of thy));
paulson@15633
   191
wenzelm@16047
   192
end;
wenzelm@16047
   193
paulson@15633
   194
wenzelm@6211
   195
(* access theory *)
wenzelm@6211
   196
wenzelm@7687
   197
fun lookup_theory name =
wenzelm@7687
   198
  (case lookup_thy name of
skalberg@15531
   199
    SOME (_, SOME thy) => SOME thy
skalberg@15531
   200
  | _ => NONE);
wenzelm@7288
   201
wenzelm@6211
   202
fun get_theory name =
wenzelm@7288
   203
  (case lookup_theory name of
wenzelm@23871
   204
    SOME theory => theory
wenzelm@6211
   205
  | _ => error (loader_msg "undefined theory entry for" [name]));
wenzelm@6211
   206
wenzelm@19547
   207
fun the_theory name thy =
wenzelm@19547
   208
  if Context.theory_name thy = name then thy
wenzelm@19547
   209
  else get_theory name;
wenzelm@19547
   210
wenzelm@22137
   211
val _ = ML_Context.value_antiq "theory"
wenzelm@22137
   212
  (Scan.lift Args.name
wenzelm@22137
   213
    >> (fn name => (name ^ "_thy", "ThyInfo.theory " ^ ML_Syntax.print_string name))
wenzelm@22148
   214
  || Scan.succeed ("thy", "ML_Context.the_context ()"));
wenzelm@22137
   215
wenzelm@6211
   216
wenzelm@6211
   217
wenzelm@6211
   218
(** thy operations **)
wenzelm@6211
   219
wenzelm@6241
   220
(* maintain 'outdated' flag *)
wenzelm@6211
   221
wenzelm@7099
   222
local
wenzelm@7099
   223
wenzelm@6241
   224
fun is_outdated name =
wenzelm@6241
   225
  (case lookup_deps name of
skalberg@15531
   226
    SOME (SOME {outdated, ...}) => outdated
wenzelm@6241
   227
  | _ => false);
wenzelm@6211
   228
wenzelm@6241
   229
fun outdate_thy name =
wenzelm@7099
   230
  if is_finished name orelse is_outdated name then ()
wenzelm@23939
   231
  else CRITICAL (fn () =>
wenzelm@23939
   232
   (change_deps name (Option.map (fn {outdated = _, master, parents, files} =>
wenzelm@23939
   233
    make_deps true master parents files)); perform Outdate name));
wenzelm@7099
   234
wenzelm@7910
   235
fun check_unfinished name =
skalberg@15531
   236
  if is_finished name then (warning (loader_msg "tried to touch finished theory" [name]); NONE)
skalberg@15531
   237
  else SOME name;
wenzelm@7910
   238
wenzelm@7099
   239
in
wenzelm@6211
   240
wenzelm@7910
   241
fun touch_thys names =
wenzelm@19482
   242
  List.app outdate_thy (thy_graph Graph.all_succs (map_filter check_unfinished names));
wenzelm@7910
   243
wenzelm@7910
   244
fun touch_thy name = touch_thys [name];
wenzelm@7910
   245
fun touch_child_thys name = touch_thys (thy_graph Graph.imm_succs name);
wenzelm@6211
   246
skalberg@15570
   247
fun touch_all_thys () = List.app outdate_thy (get_names ());
wenzelm@6211
   248
wenzelm@7099
   249
end;
wenzelm@6211
   250
wenzelm@6211
   251
wenzelm@7244
   252
(* check 'finished' state *)
wenzelm@7244
   253
wenzelm@7244
   254
fun check_unfinished fail name =
wenzelm@7910
   255
  if known_thy name andalso is_finished name then
wenzelm@7288
   256
    fail (loader_msg "cannot update finished theory" [name])
wenzelm@7244
   257
  else ();
wenzelm@7244
   258
wenzelm@7244
   259
wenzelm@7941
   260
(* load_file *)
wenzelm@6211
   261
wenzelm@7191
   262
local
wenzelm@7191
   263
wenzelm@23910
   264
fun provide path name info (deps as SOME {outdated, master, parents, files}) =
wenzelm@23871
   265
     (if AList.defined (op =) files path then ()
wenzelm@7941
   266
      else warning (loader_msg "undeclared dependency of theory" [name] ^
wenzelm@21858
   267
        " on file: " ^ quote (Path.implode path));
wenzelm@23910
   268
      SOME (make_deps outdated master parents (AList.update (op =) (path, SOME info) files)))
skalberg@15531
   269
  | provide _ _ _ NONE = NONE;
wenzelm@7941
   270
wenzelm@7941
   271
fun run_file path =
wenzelm@22095
   272
  (case Option.map (Context.theory_name o Context.the_theory) (ML_Context.get_context ()) of
wenzelm@23886
   273
    NONE => (ThyLoad.load_ml Path.current path; ())
wenzelm@23871
   274
  | SOME name =>
wenzelm@23871
   275
      (case lookup_deps name of
wenzelm@23871
   276
        SOME deps =>
wenzelm@23886
   277
          change_deps name (provide path name (ThyLoad.load_ml (master_dir' deps) path))
wenzelm@23886
   278
      | NONE => (ThyLoad.load_ml Path.current path; ())));
wenzelm@6211
   279
wenzelm@7191
   280
in
wenzelm@7191
   281
wenzelm@24057
   282
fun load_file time path =
wenzelm@7941
   283
  if time then
wenzelm@21858
   284
    let val name = Path.implode path in
wenzelm@7244
   285
      timeit (fn () =>
wenzelm@9778
   286
       (priority ("\n**** Starting file " ^ quote name ^ " ****");
wenzelm@9036
   287
        run_file path;
wenzelm@9778
   288
        priority ("**** Finished file " ^ quote name ^ " ****\n")))
wenzelm@7244
   289
    end
wenzelm@24057
   290
  else run_file path;
wenzelm@7941
   291
wenzelm@21858
   292
val use = load_file false o Path.explode;
wenzelm@21858
   293
val time_use = load_file true o Path.explode;
wenzelm@7191
   294
wenzelm@7191
   295
end;
wenzelm@6233
   296
wenzelm@6233
   297
wenzelm@7099
   298
(* load_thy *)
wenzelm@7099
   299
wenzelm@9490
   300
fun required_by _ [] = ""
wenzelm@9490
   301
  | required_by s initiators = s ^ "(required by " ^ show_path (rev initiators) ^ ")";
wenzelm@7099
   302
wenzelm@23886
   303
fun load_thy really ml time initiators dir name =
wenzelm@7099
   304
  let
wenzelm@9822
   305
    val _ =
wenzelm@9822
   306
      if really then priority ("Loading theory " ^ quote name ^ required_by " " initiators)
wenzelm@9822
   307
      else priority ("Registering theory " ^ quote name);
wenzelm@7099
   308
wenzelm@7099
   309
    val _ = touch_thy name;
wenzelm@9822
   310
    val master =
wenzelm@23967
   311
      if really then ThyLoad.load_thy dir name ml (time orelse ! Output.timing)
wenzelm@23886
   312
      else #1 (ThyLoad.deps_thy dir name ml);
wenzelm@7099
   313
wenzelm@7099
   314
    val files = get_files name;
wenzelm@21858
   315
    val missing_files = map_filter (fn (path, NONE) => SOME (Path.implode path) | _ => NONE) files;
wenzelm@7099
   316
  in
wenzelm@7099
   317
    if null missing_files then ()
wenzelm@7099
   318
    else warning (loader_msg "unresolved dependencies of theory" [name] ^
wenzelm@7223
   319
      " on file(s): " ^ commas_quote missing_files);
wenzelm@23939
   320
    CRITICAL (fn () =>
wenzelm@23939
   321
     (change_deps name
wenzelm@23939
   322
        (Option.map (fn {parents, ...} => make_deps false (SOME master) parents files));
wenzelm@23939
   323
      perform Update name))
wenzelm@7099
   324
  end;
wenzelm@7099
   325
wenzelm@7099
   326
wenzelm@23967
   327
(* require_thy -- checking database entries wrt. the file-system *)
berghofe@15065
   328
wenzelm@7211
   329
local
wenzelm@6211
   330
wenzelm@23886
   331
fun check_ml master (src_path, info) =
wenzelm@23871
   332
  let val info' =
wenzelm@23871
   333
    (case info of NONE => NONE
wenzelm@23871
   334
    | SOME (_, id) =>
wenzelm@23886
   335
        (case ThyLoad.check_ml (master_dir master) src_path of NONE => NONE
wenzelm@23871
   336
        | SOME (path', id') => if id <> id' then NONE else SOME (path', id')))
wenzelm@23886
   337
  in (src_path, info') end;
wenzelm@6211
   338
wenzelm@23886
   339
fun check_deps ml strict dir name =
wenzelm@6211
   340
  (case lookup_deps name of
wenzelm@23893
   341
    SOME NONE => (true, NONE, get_parents name)
wenzelm@23893
   342
  | NONE =>
wenzelm@23893
   343
      let val (master, (parents, files)) = ThyLoad.deps_thy dir name ml
wenzelm@23893
   344
      in (false, init_deps (SOME master) parents files, parents) end
wenzelm@23910
   345
  | SOME (deps as SOME {outdated, master, parents, files}) =>
wenzelm@23910
   346
      if not strict andalso can get_theory name then (true, deps, parents)
wenzelm@23871
   347
      else
wenzelm@23893
   348
        let val master' = SOME (ThyLoad.check_thy dir name ml) in
wenzelm@23871
   349
          if master_idents master <> master_idents master'
wenzelm@23893
   350
          then
wenzelm@23893
   351
            let val (parents', files') = #2 (ThyLoad.deps_thy dir name ml)
wenzelm@23893
   352
            in (false, init_deps master' parents' files', parents') end
wenzelm@23871
   353
          else
wenzelm@23871
   354
            let
wenzelm@23871
   355
              val checked_files = map (check_ml master') files;
wenzelm@23871
   356
              val current = not outdated andalso forall (is_some o snd) checked_files;
wenzelm@23910
   357
              val deps' = SOME (make_deps (not current) master' parents checked_files);
wenzelm@23893
   358
            in (current, deps', parents) end
wenzelm@23871
   359
        end);
wenzelm@6211
   360
wenzelm@23967
   361
in
wenzelm@23967
   362
wenzelm@23974
   363
fun require_thys really ml time strict keep_strict initiators dir strs tasks =
wenzelm@23974
   364
  fold_map (require_thy really ml time strict keep_strict initiators dir) strs tasks
wenzelm@23967
   365
  |>> forall I
wenzelm@23974
   366
and require_thy really ml time strict keep_strict initiators dir str tasks =
wenzelm@6211
   367
  let
wenzelm@21858
   368
    val path = Path.expand (Path.explode str);
wenzelm@21858
   369
    val name = Path.implode (Path.base path);
wenzelm@23893
   370
    val dir' = Path.append dir (Path.dir path);
wenzelm@23871
   371
    val _ = member (op =) initiators name andalso error (cycle_msg initiators);
wenzelm@7066
   372
  in
wenzelm@23974
   373
    (case try (Graph.get_node (fst tasks)) name of
wenzelm@23982
   374
      SOME task => (Task.is_finished task, tasks)
wenzelm@23967
   375
    | NONE =>
wenzelm@23967
   376
        let
wenzelm@23967
   377
          val (current, deps, parents) = check_deps ml strict dir' name
wenzelm@23967
   378
            handle ERROR msg => cat_error msg
wenzelm@23967
   379
              (loader_msg "the error(s) above occurred while examining theory" [name] ^
wenzelm@23967
   380
                required_by "\n" initiators);
wenzelm@23967
   381
          val parent_names = map base_name parents;
wenzelm@23871
   382
wenzelm@23974
   383
          val (parents_current, (tasks_graph', tasks_len')) =
wenzelm@23967
   384
            require_thys true true time (strict andalso keep_strict) keep_strict
wenzelm@23974
   385
              (name :: initiators) (Path.append dir (master_dir' deps)) parents tasks;
wenzelm@6211
   386
wenzelm@23967
   387
          val all_current = current andalso parents_current;
wenzelm@23967
   388
          val thy = if all_current orelse not really then SOME (get_theory name) else NONE;
wenzelm@23967
   389
          val _ = change_thys (new_deps name parent_names (deps, thy));
wenzelm@23967
   390
wenzelm@23974
   391
          val tasks_graph'' = tasks_graph' |> new_deps name parent_names
wenzelm@23982
   392
           (if all_current then Task.Finished
wenzelm@23982
   393
            else Task.Task (fn () => load_thy really ml time initiators dir' name));
wenzelm@23974
   394
          val tasks_len'' = if all_current then tasks_len' else tasks_len' + 1;
wenzelm@23974
   395
        in (all_current, (tasks_graph'', tasks_len'')) end)
wenzelm@7066
   396
  end;
wenzelm@6484
   397
wenzelm@23967
   398
end;
wenzelm@23967
   399
wenzelm@23967
   400
wenzelm@23982
   401
(* variations on use_thy -- scheduling required theories *)
wenzelm@23967
   402
wenzelm@23967
   403
local
wenzelm@23967
   404
wenzelm@23967
   405
fun schedule_seq tasks =
wenzelm@23974
   406
  Graph.topological_order tasks
wenzelm@23982
   407
  |> List.app (fn name => (case Graph.get_node tasks name of Task.Task f => f () | _ => ()));
wenzelm@23967
   408
wenzelm@23982
   409
fun next_task G =
wenzelm@23982
   410
  let
wenzelm@23982
   411
    val tasks = map (fn name => (name, Graph.get_node G name)) (Graph.minimals G);
wenzelm@23982
   412
    val finished = filter (Task.is_finished o snd) tasks;
wenzelm@23982
   413
  in
wenzelm@23982
   414
    if not (null finished) then next_task (Graph.del_nodes (map fst finished) G)
wenzelm@23982
   415
    else if null tasks then ((Task.Finished, I), G)
wenzelm@23982
   416
    else
wenzelm@23982
   417
      (case find_first (not o Task.is_running o snd) tasks of
wenzelm@23982
   418
        NONE => ((Task.Running, I), G)
wenzelm@23982
   419
      | SOME (name, task) =>
wenzelm@23982
   420
          ((task, Graph.del_nodes [name]), Graph.map_node name (K Task.Running) G))
wenzelm@23982
   421
  end;
wenzelm@23974
   422
wenzelm@23974
   423
fun schedule_tasks (tasks, n) =
wenzelm@23974
   424
  let val m = ! Multithreading.max_threads in
wenzelm@23974
   425
    if m <= 1 orelse n <= 1 then schedule_seq tasks
wenzelm@23967
   426
    else if Multithreading.self_critical () then
wenzelm@23967
   427
     (warning (loader_msg "no multithreading within critical section" []);
wenzelm@23967
   428
      schedule_seq tasks)
wenzelm@23974
   429
    else
wenzelm@23982
   430
      (case Multithreading.schedule (Int.min (m, n)) next_task tasks of
wenzelm@23974
   431
        [] => ()
wenzelm@23974
   432
      | exns => raise Exn.EXCEPTIONS (exns, ""))
wenzelm@23967
   433
  end;
wenzelm@23967
   434
wenzelm@24057
   435
fun gen_use_thy' req dir arg =
wenzelm@23974
   436
  let val (_, tasks) = req [] dir arg (Graph.empty, 0)
wenzelm@24057
   437
  in schedule_tasks tasks end;
wenzelm@6241
   438
wenzelm@23893
   439
fun gen_use_thy req str =
wenzelm@23893
   440
  let val name = base_name str in
wenzelm@23893
   441
    check_unfinished warning name;
wenzelm@23893
   442
    gen_use_thy' req Path.current str;
wenzelm@23893
   443
    ML_Context.set_context (SOME (Context.Theory (get_theory name)))
wenzelm@23893
   444
  end;
wenzelm@7244
   445
wenzelm@7211
   446
in
wenzelm@7211
   447
wenzelm@23893
   448
val quiet_update_thys    = gen_use_thy' (require_thys true true false true true);
wenzelm@23893
   449
val pretend_use_thy_only = gen_use_thy' (require_thy false false false true false) Path.current;
wenzelm@23910
   450
val use_thys             = gen_use_thy' (require_thys true true false true false) Path.current;
wenzelm@7244
   451
wenzelm@23893
   452
val use_thy              = gen_use_thy (require_thy true true false true false);
wenzelm@23893
   453
val time_use_thy         = gen_use_thy (require_thy true true true true false);
wenzelm@23893
   454
val update_thy           = gen_use_thy (require_thy true true false true true);
wenzelm@6211
   455
wenzelm@7211
   456
end;
wenzelm@7211
   457
wenzelm@6211
   458
wenzelm@6666
   459
(* remove_thy *)
wenzelm@6666
   460
wenzelm@6666
   461
fun remove_thy name =
wenzelm@7910
   462
  if is_finished name then error (loader_msg "cannot remove finished theory" [name])
wenzelm@6666
   463
  else
wenzelm@6666
   464
    let val succs = thy_graph Graph.all_succs [name] in
wenzelm@9778
   465
      priority (loader_msg "removing" succs);
wenzelm@23939
   466
      CRITICAL (fn () => (List.app (perform Remove) succs; change_thys (Graph.del_nodes succs)))
wenzelm@6666
   467
    end;
wenzelm@6666
   468
wenzelm@6666
   469
wenzelm@7066
   470
(* begin / end theory *)
wenzelm@6211
   471
wenzelm@17365
   472
fun check_uses name uses =
wenzelm@23871
   473
  let val illegal = map (fn ext => Path.ext ext (Path.basic name)) ("" :: ThyLoad.ml_exts) in
wenzelm@17365
   474
    (case find_first (member (op =) illegal o Path.base o Path.expand o #1) uses of
wenzelm@17365
   475
      NONE => ()
wenzelm@21858
   476
    | SOME (path, _) => error ("Illegal use of theory ML file: " ^ quote (Path.implode path)))
wenzelm@17365
   477
  end;
wenzelm@17365
   478
wenzelm@23900
   479
fun begin_theory name parents uses int =
wenzelm@6211
   480
  let
wenzelm@23893
   481
    val parent_names = map base_name parents;
wenzelm@23886
   482
    val dir = master_dir'' (lookup_deps name);
wenzelm@7244
   483
    val _ = check_unfinished error name;
wenzelm@23893
   484
    val _ = if int then quiet_update_thys dir parents else ();
wenzelm@23893
   485
    (* FIXME tmp *)
wenzelm@23893
   486
    val _ = ML_Context.set_context (SOME (Context.Theory (get_theory (List.last parent_names))));
wenzelm@17365
   487
    val _ = check_uses name uses;
wenzelm@17365
   488
wenzelm@23900
   489
    val theory =
wenzelm@23900
   490
      Theory.begin_theory name (map get_theory parent_names)
wenzelm@23900
   491
      |> Present.begin_theory dir uses;
wenzelm@23900
   492
wenzelm@7952
   493
    val deps =
wenzelm@7952
   494
      if known_thy name then get_deps name
wenzelm@23893
   495
      else init_deps NONE parents (map #1 uses);
wenzelm@23967
   496
    val _ = change_thys (new_deps name parent_names (deps, NONE));
wenzelm@9451
   497
wenzelm@23900
   498
    val uses_now = map_filter (fn (x, true) => SOME x | _ => NONE) uses;
wenzelm@23900
   499
    val ((), theory') =
wenzelm@23900
   500
      ML_Context.pass_context (Context.Theory theory) (List.app (load_file false)) uses_now
wenzelm@22086
   501
      ||> Context.the_theory;
wenzelm@23900
   502
  in theory' end;
wenzelm@7244
   503
wenzelm@6211
   504
fun end_theory theory =
wenzelm@7099
   505
  let
wenzelm@16454
   506
    val name = Context.theory_name theory;
wenzelm@16504
   507
    val theory' = Theory.end_theory theory;
wenzelm@23900
   508
    val _ = change_thy name (fn (deps, _) => (deps, SOME theory'));
wenzelm@23900
   509
  in theory' end;
wenzelm@6211
   510
wenzelm@6211
   511
wenzelm@6666
   512
(* finish all theories *)
wenzelm@6211
   513
skalberg@15531
   514
fun finish () = change_thys (Graph.map_nodes (fn (_, entry) => (NONE, entry)));
wenzelm@6211
   515
wenzelm@6211
   516
wenzelm@6211
   517
(* register existing theories *)
wenzelm@6211
   518
wenzelm@6211
   519
fun register_theory theory =
wenzelm@6211
   520
  let
wenzelm@16454
   521
    val name = Context.theory_name theory;
wenzelm@6211
   522
    val parents = Theory.parents_of theory;
wenzelm@16454
   523
    val parent_names = map Context.theory_name parents;
wenzelm@6211
   524
wenzelm@6211
   525
    fun err txt bads =
wenzelm@23871
   526
      error (loader_msg txt bads ^ "\ncannot register theory " ^ quote name);
wenzelm@6211
   527
wenzelm@6666
   528
    val nonfinished = filter_out is_finished parent_names;
wenzelm@6211
   529
    fun get_variant (x, y_name) =
skalberg@15531
   530
      if Theory.eq_thy (x, get_theory y_name) then NONE
skalberg@15531
   531
      else SOME y_name;
wenzelm@19482
   532
    val variants = map_filter get_variant (parents ~~ parent_names);
wenzelm@6211
   533
wenzelm@6211
   534
    fun register G =
skalberg@15531
   535
      (Graph.new_node (name, (NONE, SOME theory)) G
wenzelm@9327
   536
        handle Graph.DUP _ => err "duplicate theory entry" [])
wenzelm@6211
   537
      |> add_deps name parent_names;
wenzelm@6211
   538
  in
wenzelm@6666
   539
    if not (null nonfinished) then err "non-finished parent theories" nonfinished
wenzelm@6211
   540
    else if not (null variants) then err "different versions of parent theories" variants
wenzelm@23939
   541
    else CRITICAL (fn () => (change_thys register; perform Update name))
wenzelm@6211
   542
  end;
wenzelm@6211
   543
wenzelm@15801
   544
val _ = register_theory ProtoPure.thy;
wenzelm@15801
   545
wenzelm@6211
   546
(*final declarations of this structure*)
wenzelm@6211
   547
val theory = get_theory;
wenzelm@6211
   548
val names = get_names;
wenzelm@6211
   549
wenzelm@6211
   550
end;
wenzelm@6211
   551
wenzelm@5209
   552
structure BasicThyInfo: BASIC_THY_INFO = ThyInfo;
wenzelm@5209
   553
open BasicThyInfo;