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