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