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