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