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