src/Pure/PIDE/document.ML
author wenzelm
Mon May 14 22:22:47 2018 +0200 (13 months ago)
changeset 68184 6c693b2700b3
parent 67500 dfde99d59f6e
child 68197 7857817403e4
permissions -rw-r--r--
support for dynamic document output while editing;
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@52796
    10
  val timing: bool Unsynchronized.ref
wenzelm@59715
    11
  type node_header = {master: string, header: Thy_Header.header, errors: string list}
wenzelm@52862
    12
  type overlay = Document_ID.command * (string * string list)
wenzelm@44157
    13
  datatype node_edit =
wenzelm@52530
    14
    Edits of (Document_ID.command option * Document_ID.command option) list |
wenzelm@48707
    15
    Deps of node_header |
wenzelm@52849
    16
    Perspective of bool * Document_ID.command list * overlay list
wenzelm@44156
    17
  type edit = string * node_edit
wenzelm@38418
    18
  type state
wenzelm@38418
    19
  val init_state: state
wenzelm@54519
    20
  val define_blob: string -> string -> state -> state
wenzelm@56458
    21
  type blob_digest = (string * string option) Exn.result
wenzelm@59685
    22
  val define_command: Document_ID.command -> string -> blob_digest list -> int ->
wenzelm@59085
    23
    ((int * int) * string) list -> state -> state
wenzelm@60880
    24
  val command_exec: state -> string -> Document_ID.command -> Command.exec option
wenzelm@52530
    25
  val remove_versions: Document_ID.version list -> state -> state
wenzelm@52774
    26
  val start_execution: state -> state
wenzelm@66379
    27
  val consolidate_execution: state -> unit
wenzelm@52530
    28
  val update: Document_ID.version -> Document_ID.version -> edit list -> state ->
wenzelm@52655
    29
    Document_ID.exec list * (Document_ID.command * Document_ID.exec list) list * state
wenzelm@43713
    30
  val state: unit -> state
wenzelm@43713
    31
  val change_state: (state -> state) -> unit
wenzelm@38150
    32
end;
wenzelm@38150
    33
wenzelm@38150
    34
structure Document: DOCUMENT =
wenzelm@38150
    35
struct
wenzelm@38150
    36
wenzelm@52796
    37
val timing = Unsynchronized.ref false;
wenzelm@52796
    38
fun timeit msg e = cond_timeit (! timing) msg e;
wenzelm@52796
    39
wenzelm@52796
    40
wenzelm@52796
    41
wenzelm@38418
    42
(** document structure **)
wenzelm@38418
    43
wenzelm@52530
    44
fun err_dup kind id = error ("Duplicate " ^ kind ^ ": " ^ Document_ID.print id);
wenzelm@52530
    45
fun err_undef kind id = error ("Undefined " ^ kind ^ ": " ^ Document_ID.print id);
wenzelm@52530
    46
wenzelm@59715
    47
type node_header =
wenzelm@59715
    48
  {master: string, header: Thy_Header.header, errors: string list};
wenzelm@52849
    49
wenzelm@52849
    50
type perspective =
wenzelm@52849
    51
 {required: bool,  (*required node*)
wenzelm@52849
    52
  visible: Inttab.set,  (*visible commands*)
wenzelm@52849
    53
  visible_last: Document_ID.command option,  (*last visible command*)
wenzelm@57874
    54
  overlays: (string * string list) list Inttab.table};  (*command id -> print functions with args*)
wenzelm@52849
    55
wenzelm@52530
    56
structure Entries = Linear_Set(type key = Document_ID.command val ord = int_ord);
wenzelm@38448
    57
wenzelm@43668
    58
abstype node = Node of
wenzelm@48707
    59
 {header: node_header,  (*master directory, theory header, errors*)
wenzelm@59086
    60
  keywords: Keyword.keywords option,  (*outer syntax keywords*)
wenzelm@52849
    61
  perspective: perspective,  (*command perspective*)
wenzelm@66369
    62
  entries: Command.exec option Entries.T,  (*command entries with executions*)
wenzelm@66379
    63
  result: Command.eval option,  (*result of last execution*)
wenzelm@66379
    64
  consolidated: unit lazy}  (*consolidation status of eval forks*)
wenzelm@50862
    65
and version = Version of node String_Graph.T  (*development graph wrt. static imports*)
wenzelm@38418
    66
with
wenzelm@38418
    67
wenzelm@66379
    68
fun make_node (header, keywords, perspective, entries, result, consolidated) =
wenzelm@59086
    69
  Node {header = header, keywords = keywords, perspective = perspective,
wenzelm@66379
    70
    entries = entries, result = result, consolidated = consolidated};
wenzelm@43668
    71
wenzelm@66379
    72
fun map_node f (Node {header, keywords, perspective, entries, result, consolidated}) =
wenzelm@66379
    73
  make_node (f (header, keywords, perspective, entries, result, consolidated));
wenzelm@38418
    74
wenzelm@52849
    75
fun make_perspective (required, command_ids, overlays) : perspective =
wenzelm@52849
    76
 {required = required,
wenzelm@52849
    77
  visible = Inttab.make_set command_ids,
wenzelm@52849
    78
  visible_last = try List.last command_ids,
wenzelm@52862
    79
  overlays = Inttab.make_list overlays};
wenzelm@44441
    80
wenzelm@59715
    81
val no_header: node_header =
wenzelm@59715
    82
  {master = "", header = Thy_Header.make ("", Position.none) [] [], errors = []};
wenzelm@52849
    83
val no_perspective = make_perspective (false, [], []);
wenzelm@44386
    84
wenzelm@66379
    85
val empty_node = make_node (no_header, NONE, no_perspective, Entries.empty, NONE, Lazy.value ());
wenzelm@44386
    86
wenzelm@57615
    87
fun is_no_perspective ({required, visible, visible_last, overlays}: perspective) =
wenzelm@57615
    88
  not required andalso
wenzelm@57615
    89
  Inttab.is_empty visible andalso
wenzelm@57615
    90
  is_none visible_last andalso
wenzelm@57615
    91
  Inttab.is_empty overlays;
wenzelm@57615
    92
wenzelm@66379
    93
fun is_empty_node (Node {header, keywords, perspective, entries, result, consolidated}) =
wenzelm@57615
    94
  header = no_header andalso
wenzelm@59086
    95
  is_none keywords andalso
wenzelm@57615
    96
  is_no_perspective perspective andalso
wenzelm@57615
    97
  Entries.is_empty entries andalso
wenzelm@66379
    98
  is_none result andalso
wenzelm@66379
    99
  Lazy.is_finished consolidated;
wenzelm@57615
   100
wenzelm@44386
   101
wenzelm@44386
   102
(* basic components *)
wenzelm@44386
   103
wenzelm@59715
   104
fun master_directory (Node {header = {master, ...}, ...}) =
wenzelm@54558
   105
  (case try Url.explode master of
wenzelm@54558
   106
    SOME (Url.File path) => path
wenzelm@54558
   107
  | _ => Path.current);
wenzelm@54558
   108
wenzelm@59715
   109
fun set_header master header errors =
wenzelm@66379
   110
  map_node (fn (_, keywords, perspective, entries, result, consolidated) =>
wenzelm@66379
   111
    ({master = master, header = header, errors = errors},
wenzelm@66379
   112
      keywords, perspective, entries, result, consolidated));
wenzelm@59086
   113
wenzelm@59715
   114
fun get_header (Node {header, ...}) = header;
wenzelm@48707
   115
wenzelm@59086
   116
fun set_keywords keywords =
wenzelm@66379
   117
  map_node (fn (header, _, perspective, entries, result, consolidated) =>
wenzelm@66379
   118
    (header, keywords, perspective, entries, result, consolidated));
wenzelm@59086
   119
wenzelm@59086
   120
fun get_keywords (Node {keywords, ...}) = keywords;
wenzelm@59086
   121
wenzelm@48927
   122
fun read_header node span =
wenzelm@48927
   123
  let
wenzelm@59715
   124
    val {header, errors, ...} = get_header node;
wenzelm@59715
   125
    val _ =
wenzelm@59715
   126
      if null errors then ()
wenzelm@59715
   127
      else
wenzelm@59715
   128
        cat_lines errors |>
wenzelm@59715
   129
        (case Position.get_id (Position.thread_data ()) of
wenzelm@59715
   130
          NONE => I
wenzelm@59715
   131
        | SOME id => Protocol_Message.command_positions_yxml id)
wenzelm@59715
   132
        |> error;
wenzelm@59934
   133
    val {name = (name, _), imports, ...} = header;
wenzelm@67500
   134
    val {name = (_, pos), imports = imports', keywords} =
wenzelm@67500
   135
      Thy_Header.read_tokens Position.none span;
wenzelm@63022
   136
    val imports'' = (map #1 imports ~~ map #2 imports') handle ListPair.UnequalLengths => imports;
wenzelm@63022
   137
  in Thy_Header.make (name, pos) imports'' keywords end;
wenzelm@54526
   138
wenzelm@44385
   139
fun get_perspective (Node {perspective, ...}) = perspective;
wenzelm@59086
   140
wenzelm@52808
   141
fun set_perspective args =
wenzelm@66379
   142
  map_node (fn (header, keywords, _, entries, result, consolidated) =>
wenzelm@66379
   143
    (header, keywords, make_perspective args, entries, result, consolidated));
wenzelm@44385
   144
wenzelm@52849
   145
val required_node = #required o get_perspective;
wenzelm@52849
   146
val visible_command = Inttab.defined o #visible o get_perspective;
wenzelm@52849
   147
val visible_last = #visible_last o get_perspective;
wenzelm@47345
   148
val visible_node = is_some o visible_last
wenzelm@52850
   149
val overlays = Inttab.lookup_list o #overlays o get_perspective;
wenzelm@47345
   150
wenzelm@44444
   151
fun map_entries f =
wenzelm@66379
   152
  map_node (fn (header, keywords, perspective, entries, result, consolidated) =>
wenzelm@66379
   153
    (header, keywords, perspective, f entries, result, consolidated));
wenzelm@59086
   154
wenzelm@52761
   155
fun get_entries (Node {entries, ...}) = entries;
wenzelm@44645
   156
wenzelm@44645
   157
fun iterate_entries f = Entries.iterate NONE f o get_entries;
wenzelm@52761
   158
fun iterate_entries_after start f (Node {entries, ...}) =
wenzelm@44645
   159
  (case Entries.get_after entries start of
wenzelm@44645
   160
    NONE => I
wenzelm@44645
   161
  | SOME id => Entries.iterate (SOME id) f entries);
wenzelm@43668
   162
wenzelm@47339
   163
fun get_result (Node {result, ...}) = result;
wenzelm@59086
   164
wenzelm@44385
   165
fun set_result result =
wenzelm@66379
   166
  map_node (fn (header, keywords, perspective, entries, _, consolidated) =>
wenzelm@66379
   167
    (header, keywords, perspective, entries, result, consolidated));
wenzelm@52566
   168
wenzelm@52772
   169
fun pending_result node =
wenzelm@52772
   170
  (case get_result node of
wenzelm@52772
   171
    SOME eval => not (Command.eval_finished eval)
wenzelm@52772
   172
  | NONE => false);
wenzelm@52533
   173
wenzelm@59198
   174
fun finished_result node =
wenzelm@59198
   175
  (case get_result node of
wenzelm@59198
   176
    SOME eval => Command.eval_finished eval
wenzelm@59198
   177
  | NONE => false);
wenzelm@59198
   178
wenzelm@66379
   179
fun finished_result_theory node =
wenzelm@68184
   180
  if finished_result node then
wenzelm@66379
   181
    let val st = Command.eval_result_state (the (get_result node))
wenzelm@68184
   182
    in SOME (Toplevel.end_theory Position.none st) handle ERROR _ => NONE end
wenzelm@68184
   183
  else NONE;
wenzelm@66379
   184
wenzelm@66379
   185
val reset_consolidated =
wenzelm@66379
   186
  map_node (fn (header, keywords, perspective, entries, result, _) =>
wenzelm@66379
   187
    (header, keywords, perspective, entries, result, Lazy.lazy I));
wenzelm@66379
   188
wenzelm@68184
   189
fun get_consolidated (Node {consolidated, ...}) = consolidated;
wenzelm@66379
   190
wenzelm@50862
   191
fun get_node nodes name = String_Graph.get_node nodes name
wenzelm@50862
   192
  handle String_Graph.UNDEF _ => empty_node;
wenzelm@50862
   193
fun default_node name = String_Graph.default_node (name, empty_node);
wenzelm@50862
   194
fun update_node name f = default_node name #> String_Graph.map_node name f;
wenzelm@38418
   195
wenzelm@38418
   196
wenzelm@38448
   197
(* node edits and associated executions *)
wenzelm@38150
   198
wenzelm@52862
   199
type overlay = Document_ID.command * (string * string list);
wenzelm@52849
   200
wenzelm@44157
   201
datatype node_edit =
wenzelm@52530
   202
  Edits of (Document_ID.command option * Document_ID.command option) list |
wenzelm@48707
   203
  Deps of node_header |
wenzelm@52849
   204
  Perspective of bool * Document_ID.command list * overlay list;
wenzelm@44157
   205
wenzelm@44156
   206
type edit = string * node_edit;
wenzelm@38448
   207
wenzelm@49064
   208
val after_entry = Entries.get_after o get_entries;
wenzelm@44479
   209
wenzelm@49064
   210
fun lookup_entry node id =
wenzelm@49064
   211
  (case Entries.lookup (get_entries node) id of
wenzelm@44480
   212
    NONE => NONE
wenzelm@44480
   213
  | SOME (exec, _) => exec);
wenzelm@44480
   214
wenzelm@49064
   215
fun the_entry node id =
wenzelm@49064
   216
  (case Entries.lookup (get_entries node) id of
wenzelm@38448
   217
    NONE => err_undef "command entry" id
wenzelm@44476
   218
  | SOME (exec, _) => exec);
wenzelm@38150
   219
wenzelm@52566
   220
fun assign_entry (command_id, exec) node =
wenzelm@52566
   221
  if is_none (Entries.lookup (get_entries node) command_id) then node
wenzelm@52566
   222
  else map_entries (Entries.update (command_id, exec)) node;
wenzelm@38418
   223
wenzelm@38448
   224
fun reset_after id entries =
wenzelm@38448
   225
  (case Entries.get_after entries id of
wenzelm@38448
   226
    NONE => entries
wenzelm@38448
   227
  | SOME next => Entries.update (next, NONE) entries);
wenzelm@38448
   228
wenzelm@43668
   229
val edit_node = map_entries o fold
wenzelm@43668
   230
  (fn (id, SOME id2) => Entries.insert_after id (id2, NONE)
wenzelm@43668
   231
    | (id, NONE) => Entries.delete_after id #> reset_after id);
wenzelm@38418
   232
wenzelm@38418
   233
wenzelm@38418
   234
(* version operations *)
wenzelm@38418
   235
wenzelm@50862
   236
val empty_version = Version String_Graph.empty;
wenzelm@44185
   237
wenzelm@38418
   238
fun nodes_of (Version nodes) = nodes;
wenzelm@44185
   239
val node_of = get_node o nodes_of;
wenzelm@38418
   240
wenzelm@44185
   241
fun cycle_msg names = "Cyclic dependency of " ^ space_implode " via " (map quote names);
wenzelm@44180
   242
wenzelm@44157
   243
fun edit_nodes (name, node_edit) (Version nodes) =
wenzelm@44157
   244
  Version
wenzelm@44436
   245
    (case node_edit of
wenzelm@54562
   246
      Edits edits => update_node name (edit_node edits) nodes
wenzelm@59715
   247
    | Deps {master, header, errors} =>
wenzelm@44436
   248
        let
wenzelm@48927
   249
          val imports = map fst (#imports header);
wenzelm@44436
   250
          val nodes1 = nodes
wenzelm@44436
   251
            |> default_node name
wenzelm@48927
   252
            |> fold default_node imports;
wenzelm@44436
   253
          val nodes2 = nodes1
wenzelm@50862
   254
            |> String_Graph.Keys.fold
wenzelm@50862
   255
                (fn dep => String_Graph.del_edge (dep, name)) (String_Graph.imm_preds nodes1 name);
wenzelm@59086
   256
          val (nodes3, errors1) =
wenzelm@59086
   257
            (String_Graph.add_deps_acyclic (name, imports) nodes2, errors)
wenzelm@59086
   258
              handle String_Graph.CYCLES cs => (nodes2, errors @ map cycle_msg cs);
wenzelm@59715
   259
        in String_Graph.map_node name (set_header master header errors1) nodes3 end
wenzelm@47406
   260
    | Perspective perspective => update_node name (set_perspective perspective) nodes);
wenzelm@44444
   261
wenzelm@59086
   262
fun update_keywords name nodes =
wenzelm@59086
   263
  nodes |> String_Graph.map_node name (fn node =>
wenzelm@59086
   264
    if is_empty_node node then node
wenzelm@59086
   265
    else
wenzelm@59086
   266
      let
wenzelm@59715
   267
        val {master, header, errors} = get_header node;
wenzelm@59086
   268
        val imports_keywords = map_filter (get_keywords o get_node nodes o #1) (#imports header);
wenzelm@59086
   269
        val keywords =
wenzelm@59086
   270
          Library.foldl Keyword.merge_keywords (Session.get_keywords (), imports_keywords);
wenzelm@59086
   271
        val (keywords', errors') =
wenzelm@59086
   272
          (Keyword.add_keywords (#keywords header) keywords, errors)
wenzelm@59086
   273
            handle ERROR msg =>
wenzelm@59086
   274
              (keywords, if member (op =) errors msg then errors else errors @ [msg]);
wenzelm@59086
   275
      in
wenzelm@59086
   276
        node
wenzelm@59715
   277
        |> set_header master header errors'
wenzelm@59086
   278
        |> set_keywords (SOME keywords')
wenzelm@59086
   279
      end);
wenzelm@59086
   280
wenzelm@59086
   281
fun edit_keywords edits (Version nodes) =
wenzelm@59086
   282
  Version
wenzelm@59086
   283
    (fold update_keywords
wenzelm@59086
   284
      (String_Graph.all_succs nodes (map_filter (fn (a, Deps _) => SOME a | _ => NONE) edits))
wenzelm@59086
   285
      nodes);
wenzelm@59086
   286
wenzelm@44222
   287
fun put_node (name, node) (Version nodes) =
wenzelm@57616
   288
  let
wenzelm@57616
   289
    val nodes1 = update_node name (K node) nodes;
wenzelm@57616
   290
    val nodes2 =
wenzelm@57616
   291
      if String_Graph.is_maximal nodes1 name andalso is_empty_node node
wenzelm@57616
   292
      then String_Graph.del_node name nodes1
wenzelm@57616
   293
      else nodes1;
wenzelm@57616
   294
  in Version nodes2 end;
wenzelm@38418
   295
wenzelm@38150
   296
end;
wenzelm@38150
   297
wenzelm@38418
   298
wenzelm@52595
   299
wenzelm@52595
   300
(** main state -- document structure and execution process **)
wenzelm@52536
   301
wenzelm@56458
   302
type blob_digest = (string * string option) Exn.result;  (*file node name, raw digest*)
wenzelm@55798
   303
wenzelm@52774
   304
type execution =
wenzelm@52774
   305
 {version_id: Document_ID.version,  (*static version id*)
wenzelm@52774
   306
  execution_id: Document_ID.execution,  (*dynamic execution id*)
wenzelm@59193
   307
  delay_request: unit future};  (*pending event timer request*)
wenzelm@52604
   308
wenzelm@52774
   309
val no_execution: execution =
wenzelm@59193
   310
  {version_id = Document_ID.none,
wenzelm@59193
   311
   execution_id = Document_ID.none,
wenzelm@59193
   312
   delay_request = Future.value ()};
wenzelm@52774
   313
wenzelm@59193
   314
fun new_execution version_id delay_request : execution =
wenzelm@59193
   315
  {version_id = version_id,
wenzelm@59193
   316
   execution_id = Execution.start (),
wenzelm@59193
   317
   delay_request = delay_request};
wenzelm@52604
   318
wenzelm@38418
   319
abstype state = State of
wenzelm@52536
   320
 {versions: version Inttab.table,  (*version id -> document content*)
wenzelm@55798
   321
  blobs: (SHA1.digest * string list) Symtab.table,  (*raw digest -> digest, lines*)
wenzelm@59689
   322
  commands: (string * blob_digest list * int * Token.T list lazy) Inttab.table,
wenzelm@59689
   323
    (*command id -> name, inlined files, token index of files, command span*)
wenzelm@52536
   324
  execution: execution}  (*current execution process*)
wenzelm@38418
   325
with
wenzelm@38418
   326
wenzelm@54519
   327
fun make_state (versions, blobs, commands, execution) =
wenzelm@54519
   328
  State {versions = versions, blobs = blobs, commands = commands, execution = execution};
wenzelm@38418
   329
wenzelm@54519
   330
fun map_state f (State {versions, blobs, commands, execution}) =
wenzelm@54519
   331
  make_state (f (versions, blobs, commands, execution));
wenzelm@38418
   332
wenzelm@38418
   333
val init_state =
wenzelm@54519
   334
  make_state (Inttab.make [(Document_ID.none, empty_version)],
wenzelm@54519
   335
    Symtab.empty, Inttab.empty, no_execution);
wenzelm@38418
   336
wenzelm@38418
   337
wenzelm@38418
   338
(* document versions *)
wenzelm@38418
   339
wenzelm@52536
   340
fun define_version version_id version =
wenzelm@59193
   341
  map_state (fn (versions, blobs, commands, {delay_request, ...}) =>
wenzelm@47420
   342
    let
wenzelm@52536
   343
      val versions' = Inttab.update_new (version_id, version) versions
wenzelm@47420
   344
        handle Inttab.DUP dup => err_dup "document version" dup;
wenzelm@59193
   345
      val execution' = new_execution version_id delay_request;
wenzelm@54519
   346
    in (versions', blobs, commands, execution') end);
wenzelm@38418
   347
wenzelm@52536
   348
fun the_version (State {versions, ...}) version_id =
wenzelm@52536
   349
  (case Inttab.lookup versions version_id of
wenzelm@52536
   350
    NONE => err_undef "document version" version_id
wenzelm@38418
   351
  | SOME version => version);
wenzelm@38418
   352
wenzelm@52536
   353
fun delete_version version_id versions =
wenzelm@52536
   354
  Inttab.delete version_id versions
wenzelm@52536
   355
    handle Inttab.UNDEF _ => err_undef "document version" version_id;
wenzelm@44673
   356
wenzelm@38418
   357
wenzelm@54519
   358
(* inlined files *)
wenzelm@54519
   359
wenzelm@54519
   360
fun define_blob digest text =
wenzelm@54519
   361
  map_state (fn (versions, blobs, commands, execution) =>
wenzelm@57638
   362
    let val blobs' = Symtab.update (digest, (SHA1.fake digest, split_lines text)) blobs
wenzelm@54519
   363
    in (versions, blobs', commands, execution) end);
wenzelm@54519
   364
wenzelm@54519
   365
fun the_blob (State {blobs, ...}) digest =
wenzelm@54519
   366
  (case Symtab.lookup blobs digest of
wenzelm@54519
   367
    NONE => error ("Undefined blob: " ^ digest)
wenzelm@55788
   368
  | SOME content => content);
wenzelm@54519
   369
wenzelm@56447
   370
fun resolve_blob state (blob_digest: blob_digest) =
wenzelm@61077
   371
  blob_digest |> Exn.map_res (fn (file_node, raw_digest) =>
wenzelm@56458
   372
    (file_node, Option.map (the_blob state) raw_digest));
wenzelm@56447
   373
wenzelm@59685
   374
fun blob_reports pos (blob_digest: blob_digest) =
wenzelm@59685
   375
  (case blob_digest of Exn.Res (file_node, _) => [(pos, Markup.path file_node)] | _ => []);
wenzelm@59685
   376
wenzelm@54519
   377
wenzelm@38418
   378
(* commands *)
wenzelm@38418
   379
wenzelm@59702
   380
fun define_command command_id name blobs_digests blobs_index toks =
wenzelm@54519
   381
  map_state (fn (versions, blobs, commands, execution) =>
wenzelm@38418
   382
    let
wenzelm@52536
   383
      val id = Document_ID.print command_id;
wenzelm@52536
   384
      val span =
wenzelm@66167
   385
        Lazy.lazy_name "Document.define_command" (fn () =>
wenzelm@52536
   386
          Position.setmp_thread_data (Position.id_only id)
wenzelm@59685
   387
            (fn () =>
wenzelm@59685
   388
              let
wenzelm@59685
   389
                val (tokens, _) = fold_map Token.make toks (Position.id id);
wenzelm@59685
   390
                val _ =
wenzelm@59702
   391
                  if blobs_index < 0
wenzelm@59702
   392
                  then (*inlined errors*)
wenzelm@59702
   393
                    map_filter Exn.get_exn blobs_digests
wenzelm@59702
   394
                    |> List.app (Output.error_message o Runtime.exn_message)
wenzelm@59702
   395
                  else (*auxiliary files*)
wenzelm@60027
   396
                    let val pos = Token.pos_of (nth tokens blobs_index)
wenzelm@60027
   397
                    in Position.reports (maps (blob_reports pos) blobs_digests) end;
wenzelm@59685
   398
              in tokens end) ());
wenzelm@59685
   399
      val commands' =
wenzelm@59702
   400
        Inttab.update_new (command_id, (name, blobs_digests, blobs_index, span)) commands
wenzelm@59685
   401
          handle Inttab.DUP dup => err_dup "command" dup;
wenzelm@47395
   402
      val _ =
wenzelm@52536
   403
        Position.setmp_thread_data (Position.id_only id)
wenzelm@50201
   404
          (fn () => Output.status (Markup.markup_only Markup.accepted)) ();
wenzelm@54519
   405
    in (versions, blobs, commands', execution) end);
wenzelm@38418
   406
wenzelm@52536
   407
fun the_command (State {commands, ...}) command_id =
wenzelm@52536
   408
  (case Inttab.lookup commands command_id of
wenzelm@52536
   409
    NONE => err_undef "command" command_id
wenzelm@44644
   410
  | SOME command => command);
wenzelm@38418
   411
wenzelm@52569
   412
val the_command_name = #1 oo the_command;
wenzelm@52569
   413
wenzelm@68184
   414
fun force_command_span state =
wenzelm@68184
   415
  Outer_Syntax.make_span o Lazy.force o #4 o the_command state;
wenzelm@68184
   416
wenzelm@66379
   417
wenzelm@66379
   418
(* execution *)
wenzelm@66379
   419
wenzelm@66379
   420
fun get_execution (State {execution, ...}) = execution;
wenzelm@66379
   421
fun get_execution_version state = the_version state (#version_id (get_execution state));
wenzelm@66379
   422
wenzelm@60880
   423
fun command_exec state node_name command_id =
wenzelm@60880
   424
  let
wenzelm@66379
   425
    val version = get_execution_version state;
wenzelm@66379
   426
    val node = get_node (nodes_of version) node_name;
wenzelm@60880
   427
  in the_entry node command_id end;
wenzelm@60880
   428
wenzelm@47420
   429
end;
wenzelm@38418
   430
wenzelm@52566
   431
wenzelm@52566
   432
(* remove_versions *)
wenzelm@52566
   433
wenzelm@54519
   434
fun remove_versions version_ids state = state |> map_state (fn (versions, _, _, execution) =>
wenzelm@47420
   435
  let
wenzelm@52536
   436
    val _ =
wenzelm@52536
   437
      member (op =) version_ids (#version_id execution) andalso
wenzelm@52536
   438
        error ("Attempt to remove execution version " ^ Document_ID.print (#version_id execution));
wenzelm@47343
   439
wenzelm@52536
   440
    val versions' = fold delete_version version_ids versions;
wenzelm@47420
   441
    val commands' =
wenzelm@47420
   442
      (versions', Inttab.empty) |->
wenzelm@47420
   443
        Inttab.fold (fn (_, version) => nodes_of version |>
wenzelm@50862
   444
          String_Graph.fold (fn (_, (node, _)) => node |>
wenzelm@52536
   445
            iterate_entries (fn ((_, command_id), _) =>
wenzelm@52536
   446
              SOME o Inttab.insert (K true) (command_id, the_command state command_id))));
wenzelm@54519
   447
    val blobs' =
wenzelm@54519
   448
      (commands', Symtab.empty) |->
wenzelm@59689
   449
        Inttab.fold (fn (_, (_, blobs, _, _)) => blobs |>
wenzelm@56458
   450
          fold (fn Exn.Res (_, SOME b) => Symtab.update (b, the_blob state b) | _ => I));
wenzelm@54519
   451
wenzelm@54519
   452
  in (versions', blobs', commands', execution) end);
wenzelm@38418
   453
wenzelm@38418
   454
wenzelm@52604
   455
(* document execution *)
wenzelm@47389
   456
wenzelm@60198
   457
fun make_required nodes =
wenzelm@60198
   458
  let
wenzelm@60198
   459
    fun all_preds P =
wenzelm@60198
   460
      String_Graph.fold (fn (a, (node, _)) => P node ? cons a) nodes []
wenzelm@60198
   461
      |> String_Graph.all_preds nodes
wenzelm@60198
   462
      |> Symtab.make_set;
wenzelm@60198
   463
wenzelm@60198
   464
    val all_visible = all_preds visible_node;
wenzelm@60198
   465
    val all_required = all_preds required_node;
wenzelm@60198
   466
  in
wenzelm@60198
   467
    Symtab.fold (fn (a, ()) =>
wenzelm@60198
   468
      exists (Symtab.defined all_visible) (String_Graph.immediate_succs nodes a) ?
wenzelm@60198
   469
        Symtab.update (a, ())) all_visible all_required
wenzelm@60198
   470
  end;
wenzelm@60198
   471
wenzelm@54519
   472
fun start_execution state = state |> map_state (fn (versions, blobs, commands, execution) =>
wenzelm@52796
   473
  timeit "Document.start_execution" (fn () =>
wenzelm@52796
   474
    let
wenzelm@59193
   475
      val {version_id, execution_id, delay_request} = execution;
wenzelm@52798
   476
wenzelm@52798
   477
      val delay = seconds (Options.default_real "editor_execution_delay");
wenzelm@52774
   478
wenzelm@52798
   479
      val _ = Future.cancel delay_request;
wenzelm@62826
   480
      val delay_request' = Event_Timer.future (Time.now () + delay);
wenzelm@52798
   481
wenzelm@59198
   482
      fun finished_import (name, (node, _)) =
wenzelm@65445
   483
        finished_result node orelse is_some (Thy_Info.lookup_theory name);
wenzelm@60198
   484
wenzelm@60198
   485
      val nodes = nodes_of (the_version state version_id);
wenzelm@60198
   486
      val required = make_required nodes;
wenzelm@59193
   487
      val _ =
wenzelm@60198
   488
        nodes |> String_Graph.schedule
wenzelm@52573
   489
          (fn deps => fn (name, node) =>
wenzelm@60198
   490
            if Symtab.defined required name orelse visible_node node orelse pending_result node then
wenzelm@52774
   491
              let
wenzelm@52775
   492
                fun body () =
wenzelm@59347
   493
                  (if forall finished_import deps then
wenzelm@59198
   494
                    iterate_entries (fn (_, opt_exec) => fn () =>
wenzelm@59198
   495
                      (case opt_exec of
wenzelm@59198
   496
                        SOME exec =>
wenzelm@59198
   497
                          if Execution.is_running execution_id
wenzelm@59198
   498
                          then SOME (Command.exec execution_id exec)
wenzelm@59198
   499
                          else NONE
wenzelm@59198
   500
                      | NONE => NONE)) node ()
wenzelm@59347
   501
                   else ())
wenzelm@62505
   502
                   handle exn => (Output.system_message (Runtime.exn_message exn); Exn.reraise exn);
wenzelm@52774
   503
                val future =
wenzelm@52774
   504
                  (singleton o Future.forks)
wenzelm@59193
   505
                   {name = "theory:" ^ name,
wenzelm@59193
   506
                    group = SOME (Future.new_group NONE),
wenzelm@59198
   507
                    deps = Future.task_of delay_request' :: maps (the_list o #2 o #2) deps,
wenzelm@59193
   508
                    pri = 0, interrupts = false} body;
wenzelm@59198
   509
              in (node, SOME (Future.task_of future)) end
wenzelm@59198
   510
            else (node, NONE));
wenzelm@52798
   511
      val execution' =
wenzelm@59193
   512
        {version_id = version_id, execution_id = execution_id, delay_request = delay_request'};
wenzelm@54519
   513
    in (versions, blobs, commands, execution') end));
wenzelm@47345
   514
wenzelm@66379
   515
fun consolidate_execution state =
wenzelm@68184
   516
  let
wenzelm@68184
   517
    fun check_consolidated node_name node =
wenzelm@68184
   518
      if Lazy.is_finished (get_consolidated node) then ()
wenzelm@68184
   519
      else
wenzelm@68184
   520
        (case finished_result_theory node of
wenzelm@68184
   521
          NONE => ()
wenzelm@68184
   522
        | SOME thy =>
wenzelm@68184
   523
            let
wenzelm@68184
   524
              val result_id = Command.eval_exec_id (the (get_result node));
wenzelm@68184
   525
              val eval_ids =
wenzelm@68184
   526
                iterate_entries (fn (_, opt_exec) => fn eval_ids =>
wenzelm@68184
   527
                  (case opt_exec of
wenzelm@68184
   528
                    SOME (eval, _) => SOME (cons (Command.eval_exec_id eval) eval_ids)
wenzelm@68184
   529
                  | NONE => NONE)) node [];
wenzelm@68184
   530
            in
wenzelm@68184
   531
              (case Execution.snapshot eval_ids of
wenzelm@68184
   532
                [] =>
wenzelm@68184
   533
                  let
wenzelm@68184
   534
                    val (_, offsets, rev_segments) =
wenzelm@68184
   535
                      iterate_entries (fn (_, opt_exec) => fn (offset, offsets, segments) =>
wenzelm@68184
   536
                        (case opt_exec of
wenzelm@68184
   537
                          SOME (eval, _) =>
wenzelm@68184
   538
                            let
wenzelm@68184
   539
                              val command_id = Command.eval_command_id eval;
wenzelm@68184
   540
                              val span = force_command_span state command_id;
wenzelm@68184
   541
wenzelm@68184
   542
                              val exec_id = Command.eval_exec_id eval;
wenzelm@68184
   543
                              val tr = Command.eval_result_command eval;
wenzelm@68184
   544
                              val st' = Command.eval_result_state eval;
wenzelm@68184
   545
wenzelm@68184
   546
                              val offset' = offset + the_default 0 (Command_Span.symbol_length span);
wenzelm@68184
   547
                              val offsets' = offsets
wenzelm@68184
   548
                                |> Inttab.update (command_id, offset)
wenzelm@68184
   549
                                |> Inttab.update (exec_id, offset);
wenzelm@68184
   550
                              val segments' = (span, tr, st') :: segments;
wenzelm@68184
   551
                            in SOME (offset', offsets', segments') end
wenzelm@68184
   552
                        | NONE => NONE)) node (0, Inttab.empty, []);
wenzelm@68184
   553
wenzelm@68184
   554
                    val adjust = Inttab.lookup offsets;
wenzelm@68184
   555
                    val adjust_pos = Position.adjust_offsets adjust;
wenzelm@68184
   556
                    val adjust_token = Token.adjust_offsets adjust;
wenzelm@68184
   557
                    val segments =
wenzelm@68184
   558
                      rev rev_segments |> map (fn (span, tr, st') =>
wenzelm@68184
   559
                        {span = Command_Span.adjust_offsets adjust span, command = tr, state = st'});
wenzelm@68184
   560
wenzelm@68184
   561
                    val presentation_context: Thy_Info.presentation_context =
wenzelm@68184
   562
                     {options = Options.default (),
wenzelm@68184
   563
                      file_pos = Position.file node_name,
wenzelm@68184
   564
                      adjust_pos = adjust_pos,
wenzelm@68184
   565
                      segments = segments};
wenzelm@68184
   566
wenzelm@68184
   567
                    val _ = Lazy.force (get_consolidated node);
wenzelm@68184
   568
                    val _ =
wenzelm@68184
   569
                      Position.setmp_thread_data (Position.id_only (Document_ID.print result_id))
wenzelm@68184
   570
                        (fn () =>
wenzelm@68184
   571
                          (if Options.default_bool "editor_document_output" then
wenzelm@68184
   572
                            Thy_Info.apply_presentation presentation_context thy (* FIXME errors!? *)
wenzelm@68184
   573
                           else ();
wenzelm@68184
   574
                           Output.status (Markup.markup_only Markup.consolidated))) ();
wenzelm@68184
   575
                  in () end
wenzelm@68184
   576
              | _ => ())
wenzelm@68184
   577
            end);
wenzelm@68184
   578
      in
wenzelm@68184
   579
        String_Graph.fold (fn (node_name, (node, _)) => fn () => check_consolidated node_name node)
wenzelm@68184
   580
          (nodes_of (get_execution_version state)) ()
wenzelm@68184
   581
      end;
wenzelm@66379
   582
wenzelm@47345
   583
wenzelm@47420
   584
wenzelm@47420
   585
(** document update **)
wenzelm@38418
   586
wenzelm@52566
   587
(* exec state assignment *)
wenzelm@52566
   588
wenzelm@52566
   589
type assign_update = Command.exec option Inttab.table;  (*command id -> exec*)
wenzelm@52566
   590
wenzelm@52566
   591
val assign_update_empty: assign_update = Inttab.empty;
wenzelm@52566
   592
fun assign_update_defined (tab: assign_update) command_id = Inttab.defined tab command_id;
wenzelm@52566
   593
fun assign_update_apply (tab: assign_update) node = Inttab.fold assign_entry tab node;
wenzelm@52566
   594
wenzelm@52566
   595
fun assign_update_new upd (tab: assign_update) =
wenzelm@52566
   596
  Inttab.update_new upd tab
wenzelm@52566
   597
    handle Inttab.DUP dup => err_dup "exec state assignment" dup;
wenzelm@52566
   598
wenzelm@52566
   599
fun assign_update_result (tab: assign_update) =
wenzelm@52566
   600
  Inttab.fold (fn (command_id, exec) => cons (command_id, Command.exec_ids exec)) tab [];
wenzelm@52566
   601
wenzelm@52566
   602
wenzelm@52566
   603
(* update *)
wenzelm@52566
   604
wenzelm@38418
   605
local
wenzelm@38418
   606
wenzelm@48927
   607
fun init_theory deps node span =
wenzelm@47335
   608
  let
wenzelm@54526
   609
    val master_dir = master_directory node;
wenzelm@54526
   610
    val header = read_header node span;
wenzelm@48927
   611
    val imports = #imports header;
wenzelm@59716
   612
wenzelm@59716
   613
    fun maybe_end_theory pos st =
wenzelm@59716
   614
      SOME (Toplevel.end_theory pos st)
wenzelm@59716
   615
        handle ERROR msg => (Output.error_message msg; NONE);
wenzelm@59716
   616
    val parents_reports =
wenzelm@59716
   617
      imports |> map_filter (fn (import, pos) =>
wenzelm@65445
   618
        (case Thy_Info.lookup_theory import of
wenzelm@59716
   619
          NONE =>
wenzelm@59716
   620
            maybe_end_theory pos
wenzelm@52536
   621
              (case get_result (snd (the (AList.lookup (op =) deps import))) of
wenzelm@52536
   622
                NONE => Toplevel.toplevel
wenzelm@59716
   623
              | SOME eval => Command.eval_result_state eval)
wenzelm@59716
   624
        | some => some)
wenzelm@59716
   625
        |> Option.map (fn thy => (thy, (pos, Theory.get_markup thy))));
wenzelm@59716
   626
wenzelm@59716
   627
    val parents =
wenzelm@67380
   628
      if null parents_reports then [Theory.get_pure ()] else map #1 parents_reports;
wenzelm@59716
   629
    val _ = Position.reports (map #2 parents_reports);
wenzelm@56208
   630
  in Resources.begin_theory master_dir header parents end;
wenzelm@47335
   631
wenzelm@67215
   632
fun check_root_theory node =
wenzelm@67215
   633
  let
wenzelm@67215
   634
    val master_dir = master_directory node;
wenzelm@67215
   635
    val header = #header (get_header node);
wenzelm@67215
   636
    val header_name = #1 (#name header);
wenzelm@67215
   637
    val parent =
wenzelm@67215
   638
      if header_name = Sessions.root_name then
wenzelm@67215
   639
        SOME (Thy_Info.get_theory Sessions.theory_name)
wenzelm@67215
   640
      else if member (op =) Thy_Header.ml_roots header_name then
wenzelm@67215
   641
        SOME (Thy_Info.get_theory Thy_Header.ml_bootstrapN)
wenzelm@67215
   642
      else NONE;
wenzelm@67215
   643
  in parent |> Option.map (fn thy => Resources.begin_theory master_dir header [thy]) end;
wenzelm@62895
   644
wenzelm@47407
   645
fun check_theory full name node =
wenzelm@65445
   646
  is_some (Thy_Info.lookup_theory name) orelse
wenzelm@59715
   647
  null (#errors (get_header node)) andalso (not full orelse is_some (get_result node));
wenzelm@47335
   648
wenzelm@58923
   649
fun last_common keywords state node_required node0 node =
wenzelm@44482
   650
  let
wenzelm@44645
   651
    fun update_flags prev (visible, initial) =
wenzelm@44645
   652
      let
wenzelm@52569
   653
        val visible' = visible andalso prev <> visible_last node;
wenzelm@44645
   654
        val initial' = initial andalso
wenzelm@44645
   655
          (case prev of
wenzelm@44645
   656
            NONE => true
wenzelm@59735
   657
          | SOME command_id => the_command_name state command_id <> Thy_Header.theoryN);
wenzelm@44645
   658
      in (visible', initial') end;
wenzelm@52569
   659
wenzelm@52784
   660
    fun get_common ((prev, command_id), opt_exec) (_, ok, flags, assign_update) =
wenzelm@52784
   661
      if ok then
wenzelm@47630
   662
        let
wenzelm@52784
   663
          val flags' as (visible', _) = update_flags prev flags;
wenzelm@52784
   664
          val ok' =
wenzelm@52586
   665
            (case (lookup_entry node0 command_id, opt_exec) of
wenzelm@52784
   666
              (SOME (eval0, _), SOME (eval, _)) =>
wenzelm@52784
   667
                Command.eval_eq (eval0, eval) andalso
wenzelm@52784
   668
                  (visible' orelse node_required orelse Command.eval_running eval)
wenzelm@52586
   669
            | _ => false);
wenzelm@52784
   670
          val assign_update' = assign_update |> ok' ?
wenzelm@52569
   671
            (case opt_exec of
wenzelm@52569
   672
              SOME (eval, prints) =>
wenzelm@52569
   673
                let
wenzelm@52569
   674
                  val command_visible = visible_command node command_id;
wenzelm@52850
   675
                  val command_overlays = overlays node command_id;
wenzelm@52569
   676
                  val command_name = the_command_name state command_id;
wenzelm@52569
   677
                in
wenzelm@58923
   678
                  (case
wenzelm@58923
   679
                    Command.print command_visible command_overlays keywords command_name eval prints
wenzelm@58923
   680
                   of
wenzelm@52569
   681
                    SOME prints' => assign_update_new (command_id, SOME (eval, prints'))
wenzelm@52569
   682
                  | NONE => I)
wenzelm@52569
   683
                end
wenzelm@52569
   684
            | NONE => I);
wenzelm@52784
   685
        in SOME (prev, ok', flags', assign_update') end
wenzelm@47630
   686
      else NONE;
wenzelm@52784
   687
    val (common, ok, flags, assign_update') =
wenzelm@52569
   688
      iterate_entries get_common node (NONE, true, (true, true), assign_update_empty);
wenzelm@52569
   689
    val (common', flags') =
wenzelm@52784
   690
      if ok then
wenzelm@52569
   691
        let val last = Entries.get_after (get_entries node) common
wenzelm@52569
   692
        in (last, update_flags last flags) end
wenzelm@52569
   693
      else (common, flags);
wenzelm@52569
   694
  in (assign_update', common', flags') end;
wenzelm@44645
   695
wenzelm@62895
   696
fun illegal_init _ = error "Illegal theory header";
wenzelm@52534
   697
wenzelm@58923
   698
fun new_exec keywords state node proper_init command_id' (assign_update, command_exec, init) =
wenzelm@47407
   699
  if not proper_init andalso is_none init then NONE
wenzelm@44645
   700
  else
wenzelm@44645
   701
    let
wenzelm@52850
   702
      val command_visible = visible_command node command_id';
wenzelm@52850
   703
      val command_overlays = overlays node command_id';
wenzelm@59689
   704
      val (command_name, blob_digests, blobs_index, span0) = the_command state command_id';
wenzelm@56447
   705
      val blobs = map (resolve_blob state) blob_digests;
wenzelm@54519
   706
      val span = Lazy.force span0;
wenzelm@52566
   707
wenzelm@54519
   708
      val eval' =
wenzelm@66367
   709
        Command.eval keywords (master_directory node) (fn () => the_default illegal_init init span)
wenzelm@68184
   710
          (blobs, blobs_index) command_id' span (#1 (#2 command_exec));
wenzelm@58923
   711
      val prints' =
wenzelm@58923
   712
        perhaps (Command.print command_visible command_overlays keywords command_name eval') [];
wenzelm@52566
   713
      val exec' = (eval', prints');
wenzelm@44482
   714
wenzelm@52566
   715
      val assign_update' = assign_update_new (command_id', SOME exec') assign_update;
wenzelm@59735
   716
      val init' = if command_name = Thy_Header.theoryN then NONE else init;
wenzelm@66367
   717
    in SOME (assign_update', (command_id', exec'), init') end;
wenzelm@52602
   718
wenzelm@52655
   719
fun removed_execs node0 (command_id, exec_ids) =
wenzelm@52655
   720
  subtract (op =) exec_ids (Command.exec_ids (lookup_entry node0 command_id));
wenzelm@52602
   721
wenzelm@38418
   722
in
wenzelm@38418
   723
wenzelm@59056
   724
fun update old_version_id new_version_id edits state = Runtime.exn_trace_system (fn () =>
wenzelm@38418
   725
  let
wenzelm@52536
   726
    val old_version = the_version state old_version_id;
wenzelm@59086
   727
    val new_version =
wenzelm@59086
   728
      timeit "Document.edit_nodes"
wenzelm@59086
   729
        (fn () => old_version |> fold edit_nodes edits |> edit_keywords edits);
wenzelm@38418
   730
wenzelm@44544
   731
    val nodes = nodes_of new_version;
wenzelm@52776
   732
    val required = make_required nodes;
wenzelm@52776
   733
    val required0 = make_required (nodes_of old_version);
wenzelm@52772
   734
    val edited = fold (fn (name, _) => Symtab.update (name, ())) edits Symtab.empty;
wenzelm@44544
   735
wenzelm@47628
   736
    val updated = timeit "Document.update" (fn () =>
wenzelm@50862
   737
      nodes |> String_Graph.schedule
wenzelm@44199
   738
        (fn deps => fn (name, node) =>
wenzelm@47406
   739
          (singleton o Future.forks)
wenzelm@47406
   740
            {name = "Document.update", group = NONE,
wenzelm@52716
   741
              deps = map (Future.task_of o #2) deps, pri = 1, interrupts = false}
wenzelm@59056
   742
            (fn () =>
wenzelm@59056
   743
              timeit ("Document.update " ^ name) (fn () =>
wenzelm@59056
   744
                Runtime.exn_trace_system (fn () =>
wenzelm@44482
   745
                  let
wenzelm@67215
   746
                    val root_theory = check_root_theory node;
wenzelm@59086
   747
                    val keywords = the_default (Session.get_keywords ()) (get_keywords node);
wenzelm@59056
   748
                    val imports = map (apsnd Future.join) deps;
wenzelm@59056
   749
                    val imports_result_changed = exists (#4 o #1 o #2) imports;
wenzelm@59056
   750
                    val node_required = Symtab.defined required name;
wenzelm@59056
   751
                  in
wenzelm@59056
   752
                    if Symtab.defined edited name orelse visible_node node orelse
wenzelm@59056
   753
                      imports_result_changed orelse Symtab.defined required0 name <> node_required
wenzelm@59056
   754
                    then
wenzelm@59056
   755
                      let
wenzelm@59056
   756
                        val node0 = node_of old_version name;
wenzelm@59056
   757
                        val init = init_theory imports node;
wenzelm@59056
   758
                        val proper_init =
wenzelm@67215
   759
                          is_some root_theory orelse
wenzelm@62895
   760
                            check_theory false name node andalso
wenzelm@62895
   761
                            forall (fn (name, (_, node)) => check_theory true name node) imports;
wenzelm@47406
   762
wenzelm@59056
   763
                        val (print_execs, common, (still_visible, initial)) =
wenzelm@59056
   764
                          if imports_result_changed then (assign_update_empty, NONE, (true, true))
wenzelm@59056
   765
                          else last_common keywords state node_required node0 node;
wenzelm@62895
   766
wenzelm@62895
   767
                        val common_command_exec =
wenzelm@62895
   768
                          (case common of
wenzelm@62895
   769
                            SOME id => (id, the_default Command.no_exec (the_entry node id))
wenzelm@67215
   770
                          | NONE => (Document_ID.none, Command.init_exec root_theory));
wenzelm@44479
   771
wenzelm@66367
   772
                        val (updated_execs, (command_id', exec'), _) =
wenzelm@59056
   773
                          (print_execs, common_command_exec, if initial then SOME init else NONE)
wenzelm@59056
   774
                          |> (still_visible orelse node_required) ?
wenzelm@59056
   775
                            iterate_entries_after common
wenzelm@59056
   776
                              (fn ((prev, id), _) => fn res =>
wenzelm@59056
   777
                                if not node_required andalso prev = visible_last node then NONE
wenzelm@59056
   778
                                else new_exec keywords state node proper_init id res) node;
wenzelm@44479
   779
wenzelm@59056
   780
                        val assigned_execs =
wenzelm@59056
   781
                          (node0, updated_execs) |-> iterate_entries_after common
wenzelm@59056
   782
                            (fn ((_, command_id0), exec0) => fn res =>
wenzelm@59056
   783
                              if is_none exec0 then NONE
wenzelm@59056
   784
                              else if assign_update_defined updated_execs command_id0 then SOME res
wenzelm@59056
   785
                              else SOME (assign_update_new (command_id0, NONE) res));
wenzelm@44480
   786
wenzelm@59056
   787
                        val last_exec =
wenzelm@59056
   788
                          if command_id' = Document_ID.none then NONE else SOME command_id';
wenzelm@59056
   789
                        val result =
wenzelm@59056
   790
                          if is_none last_exec orelse is_some (after_entry node last_exec) then NONE
wenzelm@66367
   791
                          else SOME (#1 exec');
wenzelm@44480
   792
wenzelm@59056
   793
                        val assign_update = assign_update_result assigned_execs;
wenzelm@59056
   794
                        val removed = maps (removed_execs node0) assign_update;
wenzelm@59056
   795
                        val _ = List.app Execution.cancel removed;
wenzelm@52602
   796
wenzelm@66379
   797
                        val result_changed =
wenzelm@66379
   798
                          not (eq_option Command.eval_eq (get_result node0, result));
wenzelm@59056
   799
                        val node' = node
wenzelm@59056
   800
                          |> assign_update_apply assigned_execs
wenzelm@66379
   801
                          |> set_result result
wenzelm@66379
   802
                          |> result_changed ? reset_consolidated;
wenzelm@59056
   803
                        val assigned_node = SOME (name, node');
wenzelm@59056
   804
                      in ((removed, assign_update, assigned_node, result_changed), node') end
wenzelm@59056
   805
                    else (([], [], NONE, false), node)
wenzelm@59056
   806
                  end))))
wenzelm@47628
   807
      |> Future.joins |> map #1);
wenzelm@44476
   808
wenzelm@52655
   809
    val removed = maps #1 updated;
wenzelm@52655
   810
    val assign_update = maps #2 updated;
wenzelm@52602
   811
    val assigned_nodes = map_filter #3 updated;
wenzelm@52602
   812
wenzelm@44197
   813
    val state' = state
wenzelm@52602
   814
      |> define_version new_version_id (fold put_node assigned_nodes new_version);
wenzelm@52602
   815
wenzelm@59056
   816
  in (removed, assign_update, state') end);
wenzelm@38418
   817
wenzelm@38418
   818
end;
wenzelm@38418
   819
wenzelm@38418
   820
wenzelm@43713
   821
wenzelm@43713
   822
(** global state **)
wenzelm@43713
   823
wenzelm@52508
   824
val global_state = Synchronized.var "Document.global_state" init_state;
wenzelm@43713
   825
wenzelm@43713
   826
fun state () = Synchronized.value global_state;
wenzelm@43713
   827
val change_state = Synchronized.change global_state;
wenzelm@43713
   828
wenzelm@38418
   829
end;