src/Pure/PIDE/document.ML
author wenzelm
Fri Jul 05 22:58:24 2013 +0200 (2013-07-05)
changeset 52536 3a35ce87a55c
parent 52534 341ae9cd4743
child 52566 52a0eacf04d1
permissions -rw-r--r--
tuned signature;
tuned comments;
wenzelm@38150
     1
(*  Title:      Pure/PIDE/document.ML
wenzelm@38150
     2
    Author:     Makarius
wenzelm@38150
     3
wenzelm@38150
     4
Document as collection of named nodes, each consisting of an editable
wenzelm@52536
     5
list of commands, associated with asynchronous execution process.
wenzelm@38150
     6
*)
wenzelm@38150
     7
wenzelm@38150
     8
signature DOCUMENT =
wenzelm@38150
     9
sig
wenzelm@48707
    10
  type node_header = string * Thy_Header.header * string list
wenzelm@44157
    11
  datatype node_edit =
wenzelm@48755
    12
    Clear |    (* FIXME unused !? *)
wenzelm@52530
    13
    Edits of (Document_ID.command option * Document_ID.command option) list |
wenzelm@48707
    14
    Deps of node_header |
wenzelm@52530
    15
    Perspective of Document_ID.command list
wenzelm@44156
    16
  type edit = string * node_edit
wenzelm@38418
    17
  type state
wenzelm@38418
    18
  val init_state: state
wenzelm@52530
    19
  val define_command: Document_ID.command -> string -> string -> state -> state
wenzelm@52530
    20
  val remove_versions: Document_ID.version list -> state -> state
wenzelm@47343
    21
  val discontinue_execution: state -> unit
wenzelm@47404
    22
  val cancel_execution: state -> unit
wenzelm@47420
    23
  val start_execution: state -> unit
wenzelm@47628
    24
  val timing: bool Unsynchronized.ref
wenzelm@52530
    25
  val update: Document_ID.version -> Document_ID.version -> edit list -> state ->
wenzelm@52530
    26
    (Document_ID.command * Document_ID.exec list) list * state
wenzelm@43713
    27
  val state: unit -> state
wenzelm@43713
    28
  val change_state: (state -> state) -> unit
wenzelm@38150
    29
end;
wenzelm@38150
    30
wenzelm@38150
    31
structure Document: DOCUMENT =
wenzelm@38150
    32
struct
wenzelm@38150
    33
wenzelm@38418
    34
(** document structure **)
wenzelm@38418
    35
wenzelm@52530
    36
fun err_dup kind id = error ("Duplicate " ^ kind ^ ": " ^ Document_ID.print id);
wenzelm@52530
    37
fun err_undef kind id = error ("Undefined " ^ kind ^ ": " ^ Document_ID.print id);
wenzelm@52530
    38
wenzelm@48707
    39
type node_header = string * Thy_Header.header * string list;
wenzelm@52530
    40
type perspective = Inttab.set * Document_ID.command option;
wenzelm@52530
    41
structure Entries = Linear_Set(type key = Document_ID.command val ord = int_ord);
wenzelm@38448
    42
wenzelm@43668
    43
abstype node = Node of
wenzelm@48707
    44
 {header: node_header,  (*master directory, theory header, errors*)
wenzelm@52508
    45
  perspective: perspective,  (*visible commands, last visible command*)
wenzelm@52532
    46
  entries: Command.exec option Entries.T * bool,  (*command entries with excecutions, stable*)
wenzelm@52526
    47
  result: Command.eval option}  (*result of last execution*)
wenzelm@50862
    48
and version = Version of node String_Graph.T  (*development graph wrt. static imports*)
wenzelm@38418
    49
with
wenzelm@38418
    50
wenzelm@47406
    51
fun make_node (header, perspective, entries, result) =
wenzelm@47406
    52
  Node {header = header, perspective = perspective, entries = entries, result = result};
wenzelm@43668
    53
wenzelm@47406
    54
fun map_node f (Node {header, perspective, entries, result}) =
wenzelm@47406
    55
  make_node (f (header, perspective, entries, result));
wenzelm@38418
    56
wenzelm@44476
    57
fun make_perspective command_ids : perspective =
wenzelm@52526
    58
  (Inttab.make_set command_ids, try List.last command_ids);
wenzelm@44441
    59
wenzelm@51294
    60
val no_header = ("", Thy_Header.make ("", Position.none) [] [], ["Bad theory header"]);
wenzelm@44441
    61
val no_perspective = make_perspective [];
wenzelm@44386
    62
wenzelm@49064
    63
val empty_node = make_node (no_header, no_perspective, (Entries.empty, true), NONE);
wenzelm@49064
    64
val clear_node =
wenzelm@49064
    65
  map_node (fn (header, _, _, _) => (header, no_perspective, (Entries.empty, true), NONE));
wenzelm@44386
    66
wenzelm@44386
    67
wenzelm@44386
    68
(* basic components *)
wenzelm@44386
    69
wenzelm@48927
    70
fun set_header header =
wenzelm@48927
    71
  map_node (fn (_, perspective, entries, result) => (header, perspective, entries, result));
wenzelm@48927
    72
wenzelm@48707
    73
fun get_header (Node {header = (master, header, errors), ...}) =
wenzelm@48707
    74
  if null errors then (master, header)
wenzelm@48707
    75
  else error (cat_lines errors);
wenzelm@48707
    76
wenzelm@48927
    77
fun read_header node span =
wenzelm@48927
    78
  let
wenzelm@51294
    79
    val (dir, {name = (name, _), imports, keywords}) = get_header node;
wenzelm@48927
    80
    val {name = (_, pos), imports = imports', ...} = Thy_Header.read_tokens span;
wenzelm@51294
    81
  in (dir, Thy_Header.make (name, pos) (map #1 imports ~~ map #2 imports') keywords) end;
wenzelm@44180
    82
wenzelm@44385
    83
fun get_perspective (Node {perspective, ...}) = perspective;
wenzelm@44441
    84
fun set_perspective ids =
wenzelm@47406
    85
  map_node (fn (header, _, entries, result) => (header, make_perspective ids, entries, result));
wenzelm@44385
    86
wenzelm@52526
    87
val visible_commands = #1 o get_perspective;
wenzelm@47345
    88
val visible_last = #2 o get_perspective;
wenzelm@47345
    89
val visible_node = is_some o visible_last
wenzelm@47345
    90
wenzelm@44444
    91
fun map_entries f =
wenzelm@49064
    92
  map_node (fn (header, perspective, (entries, stable), result) =>
wenzelm@49064
    93
    (header, perspective, (f entries, stable), result));
wenzelm@49064
    94
fun get_entries (Node {entries = (entries, _), ...}) = entries;
wenzelm@49064
    95
wenzelm@49064
    96
fun entries_stable stable =
wenzelm@49064
    97
  map_node (fn (header, perspective, (entries, _), result) =>
wenzelm@49064
    98
    (header, perspective, (entries, stable), result));
wenzelm@49064
    99
fun stable_entries (Node {entries = (_, stable), ...}) = stable;
wenzelm@44645
   100
wenzelm@44645
   101
fun iterate_entries f = Entries.iterate NONE f o get_entries;
wenzelm@49064
   102
fun iterate_entries_after start f (Node {entries = (entries, _), ...}) =
wenzelm@44645
   103
  (case Entries.get_after entries start of
wenzelm@44645
   104
    NONE => I
wenzelm@44645
   105
  | SOME id => Entries.iterate (SOME id) f entries);
wenzelm@43668
   106
wenzelm@47339
   107
fun get_result (Node {result, ...}) = result;
wenzelm@44385
   108
fun set_result result =
wenzelm@47406
   109
  map_node (fn (header, perspective, entries, _) => (header, perspective, entries, result));
wenzelm@44180
   110
wenzelm@52533
   111
fun finished_theory node =
wenzelm@52534
   112
  (case Exn.capture (Command.eval_result_state o the) (get_result node) of
wenzelm@52534
   113
    Exn.Res st => can (Toplevel.end_theory Position.none) st
wenzelm@52533
   114
  | _ => false);
wenzelm@52533
   115
wenzelm@50862
   116
fun get_node nodes name = String_Graph.get_node nodes name
wenzelm@50862
   117
  handle String_Graph.UNDEF _ => empty_node;
wenzelm@50862
   118
fun default_node name = String_Graph.default_node (name, empty_node);
wenzelm@50862
   119
fun update_node name f = default_node name #> String_Graph.map_node name f;
wenzelm@38418
   120
wenzelm@38418
   121
wenzelm@38448
   122
(* node edits and associated executions *)
wenzelm@38150
   123
wenzelm@44157
   124
datatype node_edit =
wenzelm@44185
   125
  Clear |
wenzelm@52530
   126
  Edits of (Document_ID.command option * Document_ID.command option) list |
wenzelm@48707
   127
  Deps of node_header |
wenzelm@52530
   128
  Perspective of Document_ID.command list;
wenzelm@44157
   129
wenzelm@44156
   130
type edit = string * node_edit;
wenzelm@38448
   131
wenzelm@49064
   132
val after_entry = Entries.get_after o get_entries;
wenzelm@44479
   133
wenzelm@49064
   134
fun lookup_entry node id =
wenzelm@49064
   135
  (case Entries.lookup (get_entries node) id of
wenzelm@44480
   136
    NONE => NONE
wenzelm@44480
   137
  | SOME (exec, _) => exec);
wenzelm@44480
   138
wenzelm@49064
   139
fun the_entry node id =
wenzelm@49064
   140
  (case Entries.lookup (get_entries node) id of
wenzelm@38448
   141
    NONE => err_undef "command entry" id
wenzelm@44476
   142
  | SOME (exec, _) => exec);
wenzelm@38150
   143
wenzelm@52532
   144
fun the_default_entry node (SOME id) = (id, the_default Command.no_exec (the_entry node id))
wenzelm@52532
   145
  | the_default_entry _ NONE = (Document_ID.none, Command.no_exec);
wenzelm@44476
   146
wenzelm@44482
   147
fun update_entry id exec =
wenzelm@44482
   148
  map_entries (Entries.update (id, exec));
wenzelm@44482
   149
wenzelm@44482
   150
fun reset_entry id node =
wenzelm@44482
   151
  if is_some (lookup_entry node id) then update_entry id NONE node else node;
wenzelm@38418
   152
wenzelm@38448
   153
fun reset_after id entries =
wenzelm@38448
   154
  (case Entries.get_after entries id of
wenzelm@38448
   155
    NONE => entries
wenzelm@38448
   156
  | SOME next => Entries.update (next, NONE) entries);
wenzelm@38448
   157
wenzelm@43668
   158
val edit_node = map_entries o fold
wenzelm@43668
   159
  (fn (id, SOME id2) => Entries.insert_after id (id2, NONE)
wenzelm@43668
   160
    | (id, NONE) => Entries.delete_after id #> reset_after id);
wenzelm@38418
   161
wenzelm@38418
   162
wenzelm@38418
   163
(* version operations *)
wenzelm@38418
   164
wenzelm@50862
   165
val empty_version = Version String_Graph.empty;
wenzelm@44185
   166
wenzelm@38418
   167
fun nodes_of (Version nodes) = nodes;
wenzelm@44185
   168
val node_of = get_node o nodes_of;
wenzelm@38418
   169
wenzelm@44185
   170
fun cycle_msg names = "Cyclic dependency of " ^ space_implode " via " (map quote names);
wenzelm@44180
   171
wenzelm@44157
   172
fun edit_nodes (name, node_edit) (Version nodes) =
wenzelm@44157
   173
  Version
wenzelm@44436
   174
    (case node_edit of
wenzelm@47406
   175
      Clear => update_node name clear_node nodes
wenzelm@47406
   176
    | Edits edits => update_node name (edit_node edits) nodes
wenzelm@48707
   177
    | Deps (master, header, errors) =>
wenzelm@44436
   178
        let
wenzelm@48927
   179
          val imports = map fst (#imports header);
wenzelm@48707
   180
          val errors1 =
wenzelm@48707
   181
            (Thy_Header.define_keywords header; errors)
wenzelm@48707
   182
              handle ERROR msg => errors @ [msg];
wenzelm@44436
   183
          val nodes1 = nodes
wenzelm@44436
   184
            |> default_node name
wenzelm@48927
   185
            |> fold default_node imports;
wenzelm@44436
   186
          val nodes2 = nodes1
wenzelm@50862
   187
            |> String_Graph.Keys.fold
wenzelm@50862
   188
                (fn dep => String_Graph.del_edge (dep, name)) (String_Graph.imm_preds nodes1 name);
wenzelm@48707
   189
          val (nodes3, errors2) =
wenzelm@50862
   190
            (String_Graph.add_deps_acyclic (name, imports) nodes2, errors1)
wenzelm@50862
   191
              handle String_Graph.CYCLES cs => (nodes2, errors1 @ map cycle_msg cs);
wenzelm@50862
   192
        in String_Graph.map_node name (set_header (master, header, errors2)) nodes3 end
wenzelm@47406
   193
    | Perspective perspective => update_node name (set_perspective perspective) nodes);
wenzelm@44444
   194
wenzelm@44222
   195
fun put_node (name, node) (Version nodes) =
wenzelm@44222
   196
  Version (update_node name (K node) nodes);
wenzelm@38418
   197
wenzelm@38150
   198
end;
wenzelm@38150
   199
wenzelm@38418
   200
wenzelm@38418
   201
wenzelm@47389
   202
(** main state -- document structure and execution process **)
wenzelm@38418
   203
wenzelm@52536
   204
type execution =
wenzelm@52536
   205
 {version_id: Document_ID.version,
wenzelm@52536
   206
  group: Future.group,
wenzelm@52536
   207
  running: bool Unsynchronized.ref};
wenzelm@52536
   208
wenzelm@52536
   209
val no_execution =
wenzelm@52536
   210
 {version_id = Document_ID.none,
wenzelm@52536
   211
  group = Future.new_group NONE,
wenzelm@52536
   212
  running = Unsynchronized.ref false};
wenzelm@52536
   213
wenzelm@38418
   214
abstype state = State of
wenzelm@52536
   215
 {versions: version Inttab.table,  (*version id -> document content*)
wenzelm@52536
   216
  commands: (string * Token.T list lazy) Inttab.table,  (*command id -> named span*)
wenzelm@52536
   217
  execution: execution}  (*current execution process*)
wenzelm@38418
   218
with
wenzelm@38418
   219
wenzelm@44674
   220
fun make_state (versions, commands, execution) =
wenzelm@44674
   221
  State {versions = versions, commands = commands, execution = execution};
wenzelm@38418
   222
wenzelm@44674
   223
fun map_state f (State {versions, commands, execution}) =
wenzelm@44674
   224
  make_state (f (versions, commands, execution));
wenzelm@38418
   225
wenzelm@38418
   226
val init_state =
wenzelm@52536
   227
  make_state (Inttab.make [(Document_ID.none, empty_version)], Inttab.empty, no_execution);
wenzelm@38418
   228
wenzelm@47420
   229
fun execution_of (State {execution, ...}) = execution;
wenzelm@47420
   230
wenzelm@38418
   231
wenzelm@38418
   232
(* document versions *)
wenzelm@38418
   233
wenzelm@52536
   234
fun define_version version_id version =
wenzelm@47420
   235
  map_state (fn (versions, commands, _) =>
wenzelm@47420
   236
    let
wenzelm@52536
   237
      val versions' = Inttab.update_new (version_id, version) versions
wenzelm@47420
   238
        handle Inttab.DUP dup => err_dup "document version" dup;
wenzelm@52536
   239
      val execution' =
wenzelm@52536
   240
       {version_id = version_id,
wenzelm@52536
   241
        group = Future.new_group NONE,
wenzelm@52536
   242
        running = Unsynchronized.ref true};
wenzelm@47420
   243
    in (versions', commands, execution') end);
wenzelm@38418
   244
wenzelm@52536
   245
fun the_version (State {versions, ...}) version_id =
wenzelm@52536
   246
  (case Inttab.lookup versions version_id of
wenzelm@52536
   247
    NONE => err_undef "document version" version_id
wenzelm@38418
   248
  | SOME version => version);
wenzelm@38418
   249
wenzelm@52536
   250
fun delete_version version_id versions =
wenzelm@52536
   251
  Inttab.delete version_id versions
wenzelm@52536
   252
    handle Inttab.UNDEF _ => err_undef "document version" version_id;
wenzelm@44673
   253
wenzelm@38418
   254
wenzelm@38418
   255
(* commands *)
wenzelm@38418
   256
wenzelm@52536
   257
fun define_command command_id name text =
wenzelm@44674
   258
  map_state (fn (versions, commands, execution) =>
wenzelm@38418
   259
    let
wenzelm@52536
   260
      val id = Document_ID.print command_id;
wenzelm@52536
   261
      val span =
wenzelm@52536
   262
        Lazy.lazy (fn () =>
wenzelm@52536
   263
          Position.setmp_thread_data (Position.id_only id)
wenzelm@52536
   264
            (fn () => Thy_Syntax.parse_tokens (Keyword.get_lexicons ()) (Position.id id) text) ());
wenzelm@47395
   265
      val _ =
wenzelm@52536
   266
        Position.setmp_thread_data (Position.id_only id)
wenzelm@50201
   267
          (fn () => Output.status (Markup.markup_only Markup.accepted)) ();
wenzelm@38418
   268
      val commands' =
wenzelm@52536
   269
        Inttab.update_new (command_id, (name, span)) commands
wenzelm@38418
   270
          handle Inttab.DUP dup => err_dup "command" dup;
wenzelm@44674
   271
    in (versions, commands', execution) end);
wenzelm@38418
   272
wenzelm@52536
   273
fun the_command (State {commands, ...}) command_id =
wenzelm@52536
   274
  (case Inttab.lookup commands command_id of
wenzelm@52536
   275
    NONE => err_undef "command" command_id
wenzelm@44644
   276
  | SOME command => command);
wenzelm@38418
   277
wenzelm@47420
   278
end;
wenzelm@38418
   279
wenzelm@52536
   280
fun remove_versions version_ids state = state |> map_state (fn (versions, _, execution) =>
wenzelm@47420
   281
  let
wenzelm@52536
   282
    val _ =
wenzelm@52536
   283
      member (op =) version_ids (#version_id execution) andalso
wenzelm@52536
   284
        error ("Attempt to remove execution version " ^ Document_ID.print (#version_id execution));
wenzelm@47343
   285
wenzelm@52536
   286
    val versions' = fold delete_version version_ids versions;
wenzelm@47420
   287
    val commands' =
wenzelm@47420
   288
      (versions', Inttab.empty) |->
wenzelm@47420
   289
        Inttab.fold (fn (_, version) => nodes_of version |>
wenzelm@50862
   290
          String_Graph.fold (fn (_, (node, _)) => node |>
wenzelm@52536
   291
            iterate_entries (fn ((_, command_id), _) =>
wenzelm@52536
   292
              SOME o Inttab.insert (K true) (command_id, the_command state command_id))));
wenzelm@47420
   293
  in (versions', commands', execution) end);
wenzelm@38418
   294
wenzelm@38418
   295
wenzelm@38888
   296
wenzelm@47420
   297
(** document execution **)
wenzelm@47389
   298
wenzelm@52536
   299
val discontinue_execution = execution_of #> (fn {running, ...} => running := false);
wenzelm@52536
   300
val cancel_execution = execution_of #> (fn {group, ...} => Future.cancel_group group);
wenzelm@52536
   301
val terminate_execution = execution_of #> (fn {group, ...} => Future.terminate group);
wenzelm@47345
   302
wenzelm@47420
   303
fun start_execution state =
wenzelm@47420
   304
  let
wenzelm@52536
   305
    val {version_id, group, running} = execution_of state;
wenzelm@47420
   306
    val _ =
wenzelm@47633
   307
      (singleton o Future.forks)
wenzelm@52508
   308
        {name = "Document.execution", group = SOME group, deps = [], pri = ~2, interrupts = true}
wenzelm@47633
   309
        (fn () =>
wenzelm@47633
   310
         (OS.Process.sleep (seconds 0.02);
wenzelm@50862
   311
          nodes_of (the_version state version_id) |> String_Graph.schedule
wenzelm@47633
   312
            (fn deps => fn (name, node) =>
wenzelm@47633
   313
              if not (visible_node node) andalso finished_theory node then
wenzelm@47633
   314
                Future.value ()
wenzelm@47633
   315
              else
wenzelm@47633
   316
                (singleton o Future.forks)
wenzelm@47633
   317
                  {name = "theory:" ^ name, group = SOME (Future.new_group (SOME group)),
wenzelm@47633
   318
                    deps = map (Future.task_of o #2) deps, pri = ~2, interrupts = false}
wenzelm@47633
   319
                  (fn () =>
wenzelm@52515
   320
                    iterate_entries (fn (_, opt_exec) => fn () =>
wenzelm@47633
   321
                      (case opt_exec of
wenzelm@52536
   322
                        SOME exec => if ! running then SOME (Command.execute exec) else NONE
wenzelm@47633
   323
                      | NONE => NONE)) node ()))));
wenzelm@47420
   324
  in () end;
wenzelm@47345
   325
wenzelm@47345
   326
wenzelm@47420
   327
wenzelm@47420
   328
(** document update **)
wenzelm@38418
   329
wenzelm@47628
   330
val timing = Unsynchronized.ref false;
wenzelm@47628
   331
fun timeit msg e = cond_timeit (! timing) msg e;
wenzelm@47628
   332
wenzelm@38418
   333
local
wenzelm@38418
   334
wenzelm@47335
   335
fun make_required nodes =
wenzelm@47335
   336
  let
wenzelm@47335
   337
    val all_visible =
wenzelm@50862
   338
      String_Graph.fold (fn (a, (node, _)) => visible_node node ? cons a) nodes []
wenzelm@50862
   339
      |> String_Graph.all_preds nodes
wenzelm@47345
   340
      |> map (rpair ()) |> Symtab.make;
wenzelm@47345
   341
wenzelm@47335
   342
    val required =
wenzelm@47345
   343
      Symtab.fold (fn (a, ()) =>
wenzelm@50862
   344
        exists (Symtab.defined all_visible) (String_Graph.immediate_succs nodes a) ?
wenzelm@47345
   345
          Symtab.update (a, ())) all_visible Symtab.empty;
wenzelm@47335
   346
  in Symtab.defined required end;
wenzelm@47335
   347
wenzelm@48927
   348
fun init_theory deps node span =
wenzelm@47335
   349
  let
wenzelm@49173
   350
    (* FIXME provide files via Isabelle/Scala, not master_dir *)
wenzelm@48927
   351
    val (dir, header) = read_header node span;
wenzelm@47335
   352
    val master_dir =
wenzelm@48735
   353
      (case try Url.explode dir of
wenzelm@48735
   354
        SOME (Url.File path) => path
wenzelm@47335
   355
      | _ => Path.current);
wenzelm@48927
   356
    val imports = #imports header;
wenzelm@47335
   357
    val parents =
wenzelm@48927
   358
      imports |> map (fn (import, _) =>
wenzelm@47407
   359
        (case Thy_Info.lookup_theory import of
wenzelm@47335
   360
          SOME thy => thy
wenzelm@47335
   361
        | NONE =>
wenzelm@47339
   362
            Toplevel.end_theory (Position.file_only import)
wenzelm@52536
   363
              (case get_result (snd (the (AList.lookup (op =) deps import))) of
wenzelm@52536
   364
                NONE => Toplevel.toplevel
wenzelm@52536
   365
              | SOME eval => Command.eval_result_state eval)));
wenzelm@48927
   366
    val _ = Position.reports (map #2 imports ~~ map Theory.get_markup parents);
wenzelm@47335
   367
  in Thy_Load.begin_theory master_dir header parents end;
wenzelm@47335
   368
wenzelm@47407
   369
fun check_theory full name node =
wenzelm@47407
   370
  is_some (Thy_Info.lookup_theory name) orelse
wenzelm@48707
   371
  can get_header node andalso (not full orelse is_some (get_result node));
wenzelm@47335
   372
wenzelm@44645
   373
fun last_common state last_visible node0 node =
wenzelm@44482
   374
  let
wenzelm@44645
   375
    fun update_flags prev (visible, initial) =
wenzelm@44645
   376
      let
wenzelm@44645
   377
        val visible' = visible andalso prev <> last_visible;
wenzelm@44645
   378
        val initial' = initial andalso
wenzelm@44645
   379
          (case prev of
wenzelm@44645
   380
            NONE => true
wenzelm@44645
   381
          | SOME id => not (Keyword.is_theory_begin (#1 (the_command state id))));
wenzelm@44645
   382
      in (visible', initial') end;
wenzelm@47630
   383
    fun get_common ((prev, id), opt_exec) (same, (_, flags)) =
wenzelm@47630
   384
      if same then
wenzelm@47630
   385
        let
wenzelm@47630
   386
          val flags' = update_flags prev flags;
wenzelm@47630
   387
          val same' =
wenzelm@47630
   388
            (case opt_exec of
wenzelm@47630
   389
              NONE => false
wenzelm@52533
   390
            | SOME (eval, _) =>
wenzelm@47630
   391
                (case lookup_entry node0 id of
wenzelm@47630
   392
                  NONE => false
wenzelm@52533
   393
                | SOME (eval0, _) =>
wenzelm@52533
   394
                    #exec_id eval = #exec_id eval0 andalso Command.stable_eval eval));
wenzelm@47630
   395
        in SOME (same', (prev, flags')) end
wenzelm@47630
   396
      else NONE;
wenzelm@47630
   397
    val (same, (common, flags)) =
wenzelm@47630
   398
      iterate_entries get_common node (true, (NONE, (true, true)));
wenzelm@44645
   399
  in
wenzelm@47630
   400
    if same then
wenzelm@44645
   401
      let val last = Entries.get_after (get_entries node) common
wenzelm@44645
   402
      in (last, update_flags last flags) end
wenzelm@47630
   403
    else (common, flags)
wenzelm@44645
   404
  end;
wenzelm@44645
   405
wenzelm@52534
   406
fun illegal_init _ = error "Illegal theory header after end of theory";
wenzelm@52534
   407
wenzelm@52515
   408
fun new_exec state proper_init command_visible command_id' (execs, command_exec, init) =
wenzelm@47407
   409
  if not proper_init andalso is_none init then NONE
wenzelm@44645
   410
  else
wenzelm@44645
   411
    let
wenzelm@52534
   412
      val (_, (eval, _)) = command_exec;
wenzelm@52527
   413
      val (command_name, span) = the_command state command_id' ||> Lazy.force;
wenzelm@52534
   414
      val init' = if Keyword.is_theory_begin command_name then NONE else init;
wenzelm@52534
   415
      val eval' = Command.eval (fn () => the_default illegal_init init span) span eval;
wenzelm@52530
   416
      val prints' = if command_visible then Command.print command_name eval' else [];
wenzelm@52533
   417
      val command_exec' = (command_id', (eval', prints'));
wenzelm@44674
   418
    in SOME (command_exec' :: execs, command_exec', init') end;
wenzelm@44482
   419
wenzelm@52527
   420
fun update_prints state node command_id =
wenzelm@52527
   421
  (case the_entry node command_id of
wenzelm@52533
   422
    SOME (eval, prints) =>
wenzelm@52527
   423
      let
wenzelm@52527
   424
        val (command_name, _) = the_command state command_id;
wenzelm@52530
   425
        val new_prints = Command.print command_name eval;
wenzelm@52527
   426
        val prints' =
wenzelm@52527
   427
          new_prints |> map (fn new_print =>
wenzelm@52527
   428
            (case find_first (fn {name, ...} => name = #name new_print) prints of
wenzelm@52532
   429
              SOME print => if Command.stable_print print then print else new_print
wenzelm@52527
   430
            | NONE => new_print));
wenzelm@52527
   431
      in
wenzelm@52527
   432
        if eq_list (op = o pairself #exec_id) (prints, prints') then NONE
wenzelm@52533
   433
        else SOME (command_id, (eval, prints'))
wenzelm@52527
   434
      end
wenzelm@52527
   435
  | NONE => NONE);
wenzelm@52527
   436
wenzelm@38418
   437
in
wenzelm@38418
   438
wenzelm@52536
   439
fun update old_version_id new_version_id edits state =
wenzelm@38418
   440
  let
wenzelm@52536
   441
    val old_version = the_version state old_version_id;
wenzelm@47628
   442
    val new_version = timeit "Document.edit_nodes" (fn () => fold edit_nodes edits old_version);
wenzelm@38418
   443
wenzelm@44544
   444
    val nodes = nodes_of new_version;
wenzelm@44544
   445
    val is_required = make_required nodes;
wenzelm@44544
   446
wenzelm@47628
   447
    val _ = timeit "Document.terminate_execution" (fn () => terminate_execution state);
wenzelm@47628
   448
    val updated = timeit "Document.update" (fn () =>
wenzelm@50862
   449
      nodes |> String_Graph.schedule
wenzelm@44199
   450
        (fn deps => fn (name, node) =>
wenzelm@47406
   451
          (singleton o Future.forks)
wenzelm@47406
   452
            {name = "Document.update", group = NONE,
wenzelm@47406
   453
              deps = map (Future.task_of o #2) deps, pri = 0, interrupts = false}
wenzelm@47406
   454
            (fn () =>
wenzelm@47406
   455
              let
wenzelm@47406
   456
                val imports = map (apsnd Future.join) deps;
wenzelm@52527
   457
                val changed_imports = exists (#4 o #1 o #2) imports;
wenzelm@52514
   458
                val node_required = is_required name;
wenzelm@47406
   459
              in
wenzelm@52527
   460
                if changed_imports orelse AList.defined (op =) edits name orelse
wenzelm@49064
   461
                  not (stable_entries node) orelse not (finished_theory node)
wenzelm@47406
   462
                then
wenzelm@44482
   463
                  let
wenzelm@47406
   464
                    val node0 = node_of old_version name;
wenzelm@48927
   465
                    val init = init_theory imports node;
wenzelm@47407
   466
                    val proper_init =
wenzelm@47407
   467
                      check_theory false name node andalso
wenzelm@47407
   468
                      forall (fn (name, (_, node)) => check_theory true name node) imports;
wenzelm@47406
   469
wenzelm@52527
   470
                    val visible_commands = visible_commands node;
wenzelm@52527
   471
                    val visible_command = Inttab.defined visible_commands;
wenzelm@47345
   472
                    val last_visible = visible_last node;
wenzelm@52527
   473
wenzelm@52514
   474
                    val (common, (still_visible, initial)) =
wenzelm@52527
   475
                      if changed_imports then (NONE, (true, true))
wenzelm@47406
   476
                      else last_common state last_visible node0 node;
wenzelm@44674
   477
                    val common_command_exec = the_default_entry node common;
wenzelm@44479
   478
wenzelm@52533
   479
                    val (new_execs, (command_id', (eval', _)), _) =
wenzelm@44674
   480
                      ([], common_command_exec, if initial then SOME init else NONE) |>
wenzelm@52514
   481
                      (still_visible orelse node_required) ?
wenzelm@44645
   482
                        iterate_entries_after common
wenzelm@44482
   483
                          (fn ((prev, id), _) => fn res =>
wenzelm@52514
   484
                            if not node_required andalso prev = last_visible then NONE
wenzelm@52527
   485
                            else new_exec state proper_init (visible_command id) id res) node;
wenzelm@52527
   486
wenzelm@52527
   487
                    val updated_execs =
wenzelm@52527
   488
                      (visible_commands, new_execs) |-> Inttab.fold (fn (id, ()) =>
wenzelm@52533
   489
                        if exists (fn (_, ({exec_id = id', ...}, _)) => id = id') new_execs then I
wenzelm@52527
   490
                        else append (the_list (update_prints state node id)));
wenzelm@44479
   491
wenzelm@44482
   492
                    val no_execs =
wenzelm@44645
   493
                      iterate_entries_after common
wenzelm@44482
   494
                        (fn ((_, id0), exec0) => fn res =>
wenzelm@44482
   495
                          if is_none exec0 then NONE
wenzelm@52533
   496
                          else if exists (fn (_, ({exec_id = id, ...}, _)) => id0 = id) updated_execs
wenzelm@52526
   497
                          then SOME res
wenzelm@44482
   498
                          else SOME (id0 :: res)) node0 [];
wenzelm@44480
   499
wenzelm@52530
   500
                    val last_exec =
wenzelm@52530
   501
                      if command_id' = Document_ID.none then NONE else SOME command_id';
wenzelm@44482
   502
                    val result =
wenzelm@47407
   503
                      if is_some (after_entry node last_exec) then NONE
wenzelm@52526
   504
                      else SOME eval';
wenzelm@44480
   505
wenzelm@44482
   506
                    val node' = node
wenzelm@44482
   507
                      |> fold reset_entry no_execs
wenzelm@52527
   508
                      |> fold (fn (id, exec) => update_entry id (SOME exec)) updated_execs
wenzelm@52527
   509
                      |> entries_stable (null updated_execs)
wenzelm@47406
   510
                      |> set_result result;
wenzelm@47406
   511
                    val updated_node =
wenzelm@52527
   512
                      if null no_execs andalso null updated_execs then NONE
wenzelm@47406
   513
                      else SOME (name, node');
wenzelm@52527
   514
                    val changed_result = not (null no_execs) orelse not (null new_execs);
wenzelm@52527
   515
                  in ((no_execs, updated_execs, updated_node, changed_result), node') end
wenzelm@52527
   516
                else (([], [], NONE, false), node)
wenzelm@47406
   517
              end))
wenzelm@47628
   518
      |> Future.joins |> map #1);
wenzelm@44476
   519
wenzelm@44479
   520
    val command_execs =
wenzelm@52527
   521
      map (rpair []) (maps #1 updated) @
wenzelm@52532
   522
      map (fn (command_id, exec) => (command_id, Command.exec_ids exec)) (maps #2 updated);
wenzelm@47406
   523
    val updated_nodes = map_filter #3 updated;
wenzelm@38418
   524
wenzelm@44197
   525
    val state' = state
wenzelm@52536
   526
      |> define_version new_version_id (fold put_node updated_nodes new_version);
wenzelm@47388
   527
  in (command_execs, state') end;
wenzelm@38418
   528
wenzelm@38418
   529
end;
wenzelm@38418
   530
wenzelm@38418
   531
wenzelm@43713
   532
wenzelm@43713
   533
(** global state **)
wenzelm@43713
   534
wenzelm@52508
   535
val global_state = Synchronized.var "Document.global_state" init_state;
wenzelm@43713
   536
wenzelm@43713
   537
fun state () = Synchronized.value global_state;
wenzelm@43713
   538
val change_state = Synchronized.change global_state;
wenzelm@43713
   539
wenzelm@38418
   540
end;
wenzelm@38418
   541