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