wenzelm@38150: (*  Title:      Pure/PIDE/document.ML
wenzelm@38150:     Author:     Makarius
wenzelm@38150: 
wenzelm@38150: Document as collection of named nodes, each consisting of an editable
wenzelm@44478: list of commands, with asynchronous read/eval/print processes.
wenzelm@38150: *)
wenzelm@38150: 
wenzelm@38150: signature DOCUMENT =
wenzelm@38150: sig
wenzelm@38363:   type id = int
wenzelm@38373:   type version_id = id
wenzelm@38363:   type command_id = id
wenzelm@38373:   type exec_id = id
wenzelm@38363:   val no_id: id
wenzelm@38419:   val new_id: unit -> id
wenzelm@38363:   val parse_id: string -> id
wenzelm@38363:   val print_id: id -> string
wenzelm@46938:   type node_header = (string * Thy_Header.header) Exn.result
wenzelm@44157:   datatype node_edit =
wenzelm@44185:     Clear |
wenzelm@44157:     Edits of (command_id option * command_id option) list |
wenzelm@44384:     Header of node_header |
wenzelm@44385:     Perspective of command_id list
wenzelm@44156:   type edit = string * node_edit
wenzelm@38418:   type state
wenzelm@38418:   val init_state: state
wenzelm@44644:   val define_command: command_id -> string -> string -> state -> state
wenzelm@47343:   val discontinue_execution: state -> unit
wenzelm@47404:   val cancel_execution: state -> unit
wenzelm@47345:   val execute: version_id -> state -> state
wenzelm@44481:   val update: version_id -> version_id -> edit list -> state ->
wenzelm@47388:     (command_id * exec_id option) list * state
wenzelm@44673:   val remove_versions: version_id list -> state -> state
wenzelm@43713:   val state: unit -> state
wenzelm@43713:   val change_state: (state -> state) -> unit
wenzelm@38150: end;
wenzelm@38150: 
wenzelm@38150: structure Document: DOCUMENT =
wenzelm@38150: struct
wenzelm@38150: 
wenzelm@38150: (* unique identifiers *)
wenzelm@38150: 
wenzelm@38363: type id = int;
wenzelm@38373: type version_id = id;
wenzelm@38363: type command_id = id;
wenzelm@38373: type exec_id = id;
wenzelm@38355: 
wenzelm@38355: val no_id = 0;
wenzelm@40449: val new_id = Synchronized.counter ();
wenzelm@38418: 
wenzelm@38414: val parse_id = Markup.parse_int;
wenzelm@38414: val print_id = Markup.print_int;
wenzelm@38150: 
wenzelm@38418: fun err_dup kind id = error ("Duplicate " ^ kind ^ ": " ^ print_id id);
wenzelm@38418: fun err_undef kind id = error ("Undefined " ^ kind ^ ": " ^ print_id id);
wenzelm@38150: 
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: (** document structure **)
wenzelm@38418: 
wenzelm@46938: type node_header = (string * Thy_Header.header) Exn.result;
wenzelm@44476: type perspective = (command_id -> bool) * command_id option; (*visible commands, last*)
wenzelm@38448: structure Entries = Linear_Set(type key = command_id val ord = int_ord);
wenzelm@38448: 
wenzelm@47341: type exec = (Toplevel.state * unit lazy) Command.memo;  (*eval/print process*)
wenzelm@47341: val no_exec = Command.memo_value (Toplevel.toplevel, Lazy.value ());
wenzelm@44674: 
wenzelm@43668: abstype node = Node of
wenzelm@44444:  {touched: bool,
wenzelm@44444:   header: node_header,
wenzelm@44386:   perspective: perspective,
wenzelm@47340:   entries: (exec_id * exec) option Entries.T,  (*command entries with excecutions*)
wenzelm@47341:   result: exec}
wenzelm@43668: and version = Version of node Graph.T  (*development graph wrt. static imports*)
wenzelm@38418: with
wenzelm@38418: 
wenzelm@47388: fun make_node (touched, header, perspective, entries, result) =
wenzelm@44444:   Node {touched = touched, header = header, perspective = perspective,
wenzelm@47388:     entries = entries, result = result};
wenzelm@43668: 
wenzelm@47388: fun map_node f (Node {touched, header, perspective, entries, result}) =
wenzelm@47388:   make_node (f (touched, header, perspective, entries, result));
wenzelm@38418: 
wenzelm@44476: fun make_perspective command_ids : perspective =
wenzelm@44476:   (Inttab.defined (Inttab.make (map (rpair ()) command_ids)), try List.last command_ids);
wenzelm@44441: 
wenzelm@44476: val no_header = Exn.Exn (ERROR "Bad theory header");
wenzelm@44441: val no_perspective = make_perspective [];
wenzelm@44386: 
wenzelm@47388: val empty_node = make_node (false, no_header, no_perspective, Entries.empty, no_exec);
wenzelm@47388: val clear_node = map_node (fn (_, header, _, _, _) =>
wenzelm@47388:   (false, header, no_perspective, Entries.empty, no_exec));
wenzelm@44386: 
wenzelm@44386: 
wenzelm@44386: (* basic components *)
wenzelm@44386: 
wenzelm@44446: fun is_touched (Node {touched, ...}) = touched;
wenzelm@44444: fun set_touched touched =
wenzelm@47388:   map_node (fn (_, header, perspective, entries, result) =>
wenzelm@47388:     (touched, header, perspective, entries, result));
wenzelm@44444: 
wenzelm@44180: fun get_header (Node {header, ...}) = header;
wenzelm@44385: fun set_header header =
wenzelm@47388:   map_node (fn (touched, _, perspective, entries, result) =>
wenzelm@47388:     (touched, header, perspective, entries, result));
wenzelm@44180: 
wenzelm@44385: fun get_perspective (Node {perspective, ...}) = perspective;
wenzelm@44441: fun set_perspective ids =
wenzelm@47388:   map_node (fn (touched, header, _, entries, result) =>
wenzelm@47388:     (touched, header, make_perspective ids, entries, result));
wenzelm@44385: 
wenzelm@47345: val visible_command = #1 o get_perspective;
wenzelm@47345: val visible_last = #2 o get_perspective;
wenzelm@47345: val visible_node = is_some o visible_last
wenzelm@47345: 
wenzelm@44444: fun map_entries f =
wenzelm@47388:   map_node (fn (touched, header, perspective, entries, result) =>
wenzelm@47388:     (touched, header, perspective, f entries, result));
wenzelm@44643: fun get_entries (Node {entries, ...}) = entries;
wenzelm@44645: 
wenzelm@44645: fun iterate_entries f = Entries.iterate NONE f o get_entries;
wenzelm@44645: fun iterate_entries_after start f (Node {entries, ...}) =
wenzelm@44645:   (case Entries.get_after entries start of
wenzelm@44645:     NONE => I
wenzelm@44645:   | SOME id => Entries.iterate (SOME id) f entries);
wenzelm@43668: 
wenzelm@47339: fun get_result (Node {result, ...}) = result;
wenzelm@44385: fun set_result result =
wenzelm@47388:   map_node (fn (touched, header, perspective, entries, _) =>
wenzelm@47388:     (touched, header, perspective, entries, result));
wenzelm@44180: 
wenzelm@44185: fun get_node nodes name = Graph.get_node nodes name handle Graph.UNDEF _ => empty_node;
wenzelm@44202: fun default_node name = Graph.default_node (name, empty_node);
wenzelm@44202: fun update_node name f = default_node name #> Graph.map_node name f;
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38448: (* node edits and associated executions *)
wenzelm@38150: 
wenzelm@44157: datatype node_edit =
wenzelm@44185:   Clear |
wenzelm@44157:   Edits of (command_id option * command_id option) list |
wenzelm@44384:   Header of node_header |
wenzelm@44385:   Perspective of command_id list;
wenzelm@44157: 
wenzelm@44156: type edit = string * node_edit;
wenzelm@38448: 
wenzelm@44482: fun after_entry (Node {entries, ...}) = Entries.get_after entries;
wenzelm@44479: 
wenzelm@44480: fun lookup_entry (Node {entries, ...}) id =
wenzelm@44480:   (case Entries.lookup entries id of
wenzelm@44480:     NONE => NONE
wenzelm@44480:   | SOME (exec, _) => exec);
wenzelm@44480: 
wenzelm@43668: fun the_entry (Node {entries, ...}) id =
wenzelm@38448:   (case Entries.lookup entries id of
wenzelm@38448:     NONE => err_undef "command entry" id
wenzelm@44476:   | SOME (exec, _) => exec);
wenzelm@38150: 
wenzelm@47341: fun the_default_entry node (SOME id) = (id, (the_default (no_id, no_exec) (the_entry node id)))
wenzelm@47341:   | the_default_entry _ NONE = (no_id, (no_id, no_exec));
wenzelm@44476: 
wenzelm@44482: fun update_entry id exec =
wenzelm@44482:   map_entries (Entries.update (id, exec));
wenzelm@44482: 
wenzelm@44482: fun reset_entry id node =
wenzelm@44482:   if is_some (lookup_entry node id) then update_entry id NONE node else node;
wenzelm@38418: 
wenzelm@38448: fun reset_after id entries =
wenzelm@38448:   (case Entries.get_after entries id of
wenzelm@38448:     NONE => entries
wenzelm@38448:   | SOME next => Entries.update (next, NONE) entries);
wenzelm@38448: 
wenzelm@43668: val edit_node = map_entries o fold
wenzelm@43668:   (fn (id, SOME id2) => Entries.insert_after id (id2, NONE)
wenzelm@43668:     | (id, NONE) => Entries.delete_after id #> reset_after id);
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: (* version operations *)
wenzelm@38418: 
wenzelm@44185: val empty_version = Version Graph.empty;
wenzelm@44185: 
wenzelm@38418: fun nodes_of (Version nodes) = nodes;
wenzelm@44185: val node_of = get_node o nodes_of;
wenzelm@38418: 
wenzelm@44444: local
wenzelm@44444: 
wenzelm@44185: fun cycle_msg names = "Cyclic dependency of " ^ space_implode " via " (map quote names);
wenzelm@44180: 
wenzelm@44444: fun touch_node name nodes =
wenzelm@44444:   fold (fn desc =>
wenzelm@44643:       update_node desc
wenzelm@44643:         (set_touched true #>
wenzelm@47341:           desc <> name ? (map_entries (reset_after NONE) #> set_result no_exec)))
wenzelm@44202:     (Graph.all_succs nodes [name]) nodes;
wenzelm@44202: 
wenzelm@44444: in
wenzelm@44444: 
wenzelm@44157: fun edit_nodes (name, node_edit) (Version nodes) =
wenzelm@44157:   Version
wenzelm@44436:     (case node_edit of
wenzelm@44436:       Clear =>
wenzelm@44436:         nodes
wenzelm@44436:         |> update_node name clear_node
wenzelm@44444:         |> touch_node name
wenzelm@44436:     | Edits edits =>
wenzelm@44436:         nodes
wenzelm@44436:         |> update_node name (edit_node edits)
wenzelm@44444:         |> touch_node name
wenzelm@44436:     | Header header =>
wenzelm@44436:         let
wenzelm@46938:           val imports = (case header of Exn.Res (_, {imports, ...}) => imports | _ => []);
wenzelm@46945:           val header' =
wenzelm@46958:             ((case header of Exn.Res (_, h) => Thy_Header.define_keywords h | _ => ()); header)
wenzelm@46945:               handle exn as ERROR _ => Exn.Exn exn;
wenzelm@44436:           val nodes1 = nodes
wenzelm@44436:             |> default_node name
wenzelm@46739:             |> fold default_node imports;
wenzelm@44436:           val nodes2 = nodes1
wenzelm@44436:             |> Graph.Keys.fold
wenzelm@44436:                 (fn dep => Graph.del_edge (dep, name)) (Graph.imm_preds nodes1 name);
wenzelm@46945:           val (header'', nodes3) =
wenzelm@46945:             (header', Graph.add_deps_acyclic (name, imports) nodes2)
wenzelm@44436:               handle Graph.CYCLES cs => (Exn.Exn (ERROR (cat_lines (map cycle_msg cs))), nodes2);
wenzelm@46945:         in Graph.map_node name (set_header header'') nodes3 end
wenzelm@44444:         |> touch_node name
wenzelm@44436:     | Perspective perspective =>
wenzelm@47342:         update_node name (set_perspective perspective #> set_touched true) nodes);
wenzelm@38418: 
wenzelm@44444: end;
wenzelm@44444: 
wenzelm@44222: fun put_node (name, node) (Version nodes) =
wenzelm@44222:   Version (update_node name (K node) nodes);
wenzelm@38418: 
wenzelm@38150: end;
wenzelm@38150: 
wenzelm@38418: 
wenzelm@38418: 
wenzelm@47389: (** main state -- document structure and execution process **)
wenzelm@38418: 
wenzelm@38418: abstype state = State of
wenzelm@40398:  {versions: version Inttab.table,  (*version_id -> document content*)
wenzelm@47335:   commands: (string * Token.T list lazy) Inttab.table,  (*command_id -> named span*)
wenzelm@47343:   execution: version_id * Future.group * bool Unsynchronized.ref}  (*current execution process*)
wenzelm@38418: with
wenzelm@38418: 
wenzelm@44674: fun make_state (versions, commands, execution) =
wenzelm@44674:   State {versions = versions, commands = commands, execution = execution};
wenzelm@38418: 
wenzelm@44674: fun map_state f (State {versions, commands, execution}) =
wenzelm@44674:   make_state (f (versions, commands, execution));
wenzelm@38418: 
wenzelm@38418: val init_state =
wenzelm@47343:   make_state (Inttab.make [(no_id, empty_version)], Inttab.empty,
wenzelm@47343:     (no_id, Future.new_group NONE, Unsynchronized.ref false));
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: (* document versions *)
wenzelm@38418: 
wenzelm@38418: fun define_version (id: version_id) version =
wenzelm@44674:   map_state (fn (versions, commands, execution) =>
wenzelm@38418:     let val versions' = Inttab.update_new (id, version) versions
wenzelm@38418:       handle Inttab.DUP dup => err_dup "document version" dup
wenzelm@44674:     in (versions', commands, execution) end);
wenzelm@38418: 
wenzelm@38418: fun the_version (State {versions, ...}) (id: version_id) =
wenzelm@38418:   (case Inttab.lookup versions id of
wenzelm@38418:     NONE => err_undef "document version" id
wenzelm@38418:   | SOME version => version);
wenzelm@38418: 
wenzelm@44673: fun delete_version (id: version_id) versions = Inttab.delete id versions
wenzelm@44673:   handle Inttab.UNDEF _ => err_undef "document version" id;
wenzelm@44673: 
wenzelm@38418: 
wenzelm@38418: (* commands *)
wenzelm@38418: 
wenzelm@44644: fun define_command (id: command_id) name text =
wenzelm@44674:   map_state (fn (versions, commands, execution) =>
wenzelm@38418:     let
wenzelm@47395:       val id_string = print_id id;
wenzelm@47395:       val span = Lazy.lazy (fn () =>
wenzelm@47395:         Position.setmp_thread_data (Position.id_only id_string)
wenzelm@47395:           (fn () =>
wenzelm@47395:             Thy_Syntax.parse_tokens
wenzelm@47395:               (#1 (Outer_Syntax.get_syntax ())) (Position.id id_string) text) ());
wenzelm@47395:       val _ =
wenzelm@47395:         Position.setmp_thread_data (Position.id_only id_string)
wenzelm@47395:           (fn () => Output.status (Markup.markup_only Isabelle_Markup.accepted)) ();
wenzelm@38418:       val commands' =
wenzelm@46945:         Inttab.update_new (id, (name, span)) commands
wenzelm@38418:           handle Inttab.DUP dup => err_dup "command" dup;
wenzelm@44674:     in (versions, commands', execution) end);
wenzelm@38418: 
wenzelm@38418: fun the_command (State {commands, ...}) (id: command_id) =
wenzelm@44660:   (case Inttab.lookup commands id of
wenzelm@38418:     NONE => err_undef "command" id
wenzelm@44644:   | SOME command => command);
wenzelm@38418: 
wenzelm@38418: 
wenzelm@41634: (* document execution *)
wenzelm@41634: 
wenzelm@47345: fun discontinue_execution (State {execution = (_, _, running), ...}) = running := false;
wenzelm@47343: 
wenzelm@47343: fun cancel_execution (State {execution = (_, group, _), ...}) = Future.cancel_group group;
wenzelm@47404: fun execution_tasks (State {execution = (_, group, _), ...}) = Future.group_tasks group;
wenzelm@41634: 
wenzelm@38418: end;
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38888: 
wenzelm@47389: (** edit operations **)
wenzelm@47389: 
wenzelm@47389: (* execute *)
wenzelm@47389: 
wenzelm@47389: local
wenzelm@47345: 
wenzelm@47345: fun finished_theory node =
wenzelm@47345:   (case Exn.capture Command.memo_result (get_result node) of
wenzelm@47345:     Exn.Res (st, _) => can (Toplevel.end_theory Position.none) st
wenzelm@47345:   | _ => false);
wenzelm@47345: 
wenzelm@47389: in
wenzelm@47389: 
wenzelm@47345: fun execute version_id state =
wenzelm@47345:   state |> map_state (fn (versions, commands, _) =>
wenzelm@47345:     let
wenzelm@47345:       val version = the_version state version_id;
wenzelm@47345: 
wenzelm@47347:       fun run node command_id exec =
wenzelm@47347:         let
wenzelm@47347:           val (_, print) = Command.memo_eval exec;
wenzelm@47347:           val _ =
wenzelm@47347:             if visible_command node command_id
wenzelm@47347:             then ignore (Lazy.future Future.default_params print)
wenzelm@47347:             else ();
wenzelm@47347:         in () end;
wenzelm@47347: 
wenzelm@47345:       val group = Future.new_group NONE;
wenzelm@47345:       val running = Unsynchronized.ref true;
wenzelm@47345: 
wenzelm@47345:       val _ =
wenzelm@47345:         nodes_of version |> Graph.schedule
wenzelm@47345:           (fn deps => fn (name, node) =>
wenzelm@47345:             if not (visible_node node) andalso finished_theory node then
wenzelm@47345:               Future.value ()
wenzelm@47345:             else
wenzelm@47345:               (singleton o Future.forks)
wenzelm@47345:                 {name = "theory:" ^ name, group = SOME (Future.new_group (SOME group)),
wenzelm@47345:                   deps = map (Future.task_of o #2) deps, pri = 1, interrupts = false}
wenzelm@47345:                 (fn () =>
wenzelm@47347:                   iterate_entries (fn ((_, id), opt_exec) => fn () =>
wenzelm@47347:                     (case opt_exec of
wenzelm@47347:                       SOME (_, exec) => if ! running then SOME (run node id exec) else NONE
wenzelm@47347:                     | NONE => NONE)) node ()));
wenzelm@47345: 
wenzelm@47345:     in (versions, commands, (version_id, group, running)) end);
wenzelm@47345: 
wenzelm@47389: end;
wenzelm@47345: 
wenzelm@47345: 
wenzelm@47346: (* update *)
wenzelm@38418: 
wenzelm@38418: local
wenzelm@38418: 
wenzelm@47389: fun stable_finished_theory node =
wenzelm@47389:   is_some (Exn.get_res (Exn.capture (fn () =>
wenzelm@47389:     fst (Command.memo_result (get_result node))
wenzelm@47389:     |> Toplevel.end_theory Position.none
wenzelm@47389:     |> Global_Theory.join_proofs) ()));
wenzelm@47389: 
wenzelm@47389: fun stable_command exec =
wenzelm@47389:   (case Exn.capture Command.memo_result exec of
wenzelm@47389:     Exn.Exn exn => not (Exn.is_interrupt exn)
wenzelm@47389:   | Exn.Res (st, _) =>
wenzelm@47389:       (case try Toplevel.theory_of st of
wenzelm@47389:         NONE => true
wenzelm@47389:       | SOME thy => is_some (Exn.get_res (Exn.capture Global_Theory.join_recent_proofs thy))));
wenzelm@47389: 
wenzelm@47335: fun make_required nodes =
wenzelm@47335:   let
wenzelm@47335:     val all_visible =
wenzelm@47345:       Graph.fold (fn (a, (node, _)) => visible_node node ? cons a) nodes []
wenzelm@47345:       |> Graph.all_preds nodes
wenzelm@47345:       |> map (rpair ()) |> Symtab.make;
wenzelm@47345: 
wenzelm@47335:     val required =
wenzelm@47345:       Symtab.fold (fn (a, ()) =>
wenzelm@47345:         exists (Symtab.defined all_visible) (Graph.immediate_succs nodes a) ?
wenzelm@47345:           Symtab.update (a, ())) all_visible Symtab.empty;
wenzelm@47335:   in Symtab.defined required end;
wenzelm@47335: 
wenzelm@47335: fun init_theory deps node =
wenzelm@47335:   let
wenzelm@47335:     (* FIXME provide files via Scala layer, not master_dir *)
wenzelm@47335:     val (dir, header) = Exn.release (get_header node);
wenzelm@47335:     val master_dir =
wenzelm@47335:       (case Url.explode dir of
wenzelm@47335:         Url.File path => path
wenzelm@47335:       | _ => Path.current);
wenzelm@47335:     val parents =
wenzelm@47335:       #imports header |> map (fn import =>
wenzelm@47335:         (case Thy_Info.lookup_theory import of  (* FIXME more robust!? *)
wenzelm@47335:           SOME thy => thy
wenzelm@47335:         | NONE =>
wenzelm@47339:             Toplevel.end_theory (Position.file_only import)
wenzelm@47342:               (fst (Command.memo_eval  (* FIXME memo_result !?! *)
wenzelm@47342:                 (get_result (snd (Future.join (the (AList.lookup (op =) deps import)))))))));
wenzelm@47335:   in Thy_Load.begin_theory master_dir header parents end;
wenzelm@47335: 
wenzelm@47335: fun check_theory nodes name =
wenzelm@47335:   is_some (Thy_Info.lookup_theory name) orelse  (* FIXME more robust!? *)
wenzelm@47335:   is_some (Exn.get_res (get_header (get_node nodes name)));
wenzelm@47335: 
wenzelm@44645: fun last_common state last_visible node0 node =
wenzelm@44482:   let
wenzelm@44645:     fun update_flags prev (visible, initial) =
wenzelm@44645:       let
wenzelm@44645:         val visible' = visible andalso prev <> last_visible;
wenzelm@44645:         val initial' = initial andalso
wenzelm@44645:           (case prev of
wenzelm@44645:             NONE => true
wenzelm@44645:           | SOME id => not (Keyword.is_theory_begin (#1 (the_command state id))));
wenzelm@44645:       in (visible', initial') end;
wenzelm@47340:     fun get_common ((prev, id), opt_exec) (found, (_, flags)) =
wenzelm@44482:       if found then NONE
wenzelm@44482:       else
wenzelm@44674:         let val found' =
wenzelm@47340:           (case opt_exec of
wenzelm@47340:             NONE => true
wenzelm@47340:           | SOME (exec_id, exec) =>
wenzelm@47389:               not (stable_command exec) orelse
wenzelm@47340:               (case lookup_entry node0 id of
wenzelm@47340:                 NONE => true
wenzelm@47340:               | SOME (exec_id0, _) => exec_id <> exec_id0));
wenzelm@44645:         in SOME (found', (prev, update_flags prev flags)) end;
wenzelm@44645:     val (found, (common, flags)) =
wenzelm@44645:       iterate_entries get_common node (false, (NONE, (true, true)));
wenzelm@44645:   in
wenzelm@44645:     if found then (common, flags)
wenzelm@44645:     else
wenzelm@44645:       let val last = Entries.get_after (get_entries node) common
wenzelm@44645:       in (last, update_flags last flags) end
wenzelm@44645:   end;
wenzelm@44645: 
wenzelm@44645: fun illegal_init () = error "Illegal theory header after end of theory";
wenzelm@44482: 
wenzelm@44674: fun new_exec state bad_init command_id' (execs, command_exec, init) =
wenzelm@44645:   if bad_init andalso is_none init then NONE
wenzelm@44645:   else
wenzelm@44645:     let
wenzelm@46945:       val (name, span) = the_command state command_id' ||> Lazy.force;
wenzelm@44645:       val (modify_init, init') =
wenzelm@44645:         if Keyword.is_theory_begin name then
wenzelm@44645:           (Toplevel.modify_init (the_default illegal_init init), NONE)
wenzelm@44645:         else (I, init);
wenzelm@44660:       val exec_id' = new_id ();
wenzelm@46876:       val exec_id'_string = print_id exec_id';
wenzelm@46876:       val tr =
wenzelm@46876:         Position.setmp_thread_data (Position.id_only exec_id'_string)
wenzelm@46876:           (fn () =>
wenzelm@46876:             #1 (Outer_Syntax.read_span (#2 (Outer_Syntax.get_syntax ())) span)
wenzelm@46876:             |> modify_init
wenzelm@46876:             |> Toplevel.put_id exec_id'_string);
wenzelm@47341:       val exec' = Command.memo (fn () =>
wenzelm@47344:         let val (st, _) = Command.memo_eval (snd (snd command_exec));  (* FIXME memo_result !?! *)
wenzelm@47341:         in Command.run_command (tr ()) st end);
wenzelm@44674:       val command_exec' = (command_id', (exec_id', exec'));
wenzelm@44674:     in SOME (command_exec' :: execs, command_exec', init') end;
wenzelm@44482: 
wenzelm@38418: in
wenzelm@38418: 
wenzelm@44481: fun update (old_id: version_id) (new_id: version_id) edits state =
wenzelm@38418:   let
wenzelm@38418:     val old_version = the_version state old_id;
wenzelm@44180:     val _ = Time.now ();  (* FIXME odd workaround for polyml-5.4.0/x86_64 *)
wenzelm@44222:     val new_version = fold edit_nodes edits old_version;
wenzelm@38418: 
wenzelm@44544:     val nodes = nodes_of new_version;
wenzelm@44544:     val is_required = make_required nodes;
wenzelm@44544: 
wenzelm@47404:     val _ = Future.join_tasks (execution_tasks state);
wenzelm@44476:     val updated =
wenzelm@44544:       nodes |> Graph.schedule
wenzelm@44199:         (fn deps => fn (name, node) =>
wenzelm@47389:           if is_touched node orelse is_required name andalso not (stable_finished_theory node) then
wenzelm@44479:             let
wenzelm@44479:               val node0 = node_of old_version name;
wenzelm@44979:               fun init () = init_theory deps node;
wenzelm@44645:               val bad_init =
wenzelm@44645:                 not (check_theory nodes name andalso forall (check_theory nodes o #1) deps);
wenzelm@44479:             in
wenzelm@44482:               (singleton o Future.forks)
wenzelm@44482:                 {name = "Document.update", group = NONE,
wenzelm@44482:                   deps = map (Future.task_of o #2) deps, pri = 0, interrupts = false}
wenzelm@44482:                 (fn () =>
wenzelm@44482:                   let
wenzelm@44544:                     val required = is_required name;
wenzelm@47345:                     val last_visible = visible_last node;
wenzelm@44645:                     val (common, (visible, initial)) = last_common state last_visible node0 node;
wenzelm@44674:                     val common_command_exec = the_default_entry node common;
wenzelm@44479: 
wenzelm@44674:                     val (execs, (command_id, (_, exec)), _) =
wenzelm@44674:                       ([], common_command_exec, if initial then SOME init else NONE) |>
wenzelm@44544:                       (visible orelse required) ?
wenzelm@44645:                         iterate_entries_after common
wenzelm@44482:                           (fn ((prev, id), _) => fn res =>
wenzelm@44544:                             if not required andalso prev = last_visible then NONE
wenzelm@44645:                             else new_exec state bad_init id res) node;
wenzelm@44479: 
wenzelm@44482:                     val no_execs =
wenzelm@44645:                       iterate_entries_after common
wenzelm@44482:                         (fn ((_, id0), exec0) => fn res =>
wenzelm@44482:                           if is_none exec0 then NONE
wenzelm@44482:                           else if exists (fn (_, (id, _)) => id0 = id) execs then SOME res
wenzelm@44482:                           else SOME (id0 :: res)) node0 [];
wenzelm@44480: 
wenzelm@44674:                     val last_exec = if command_id = no_id then NONE else SOME command_id;
wenzelm@44482:                     val result =
wenzelm@47341:                       if is_some (after_entry node last_exec) then no_exec
wenzelm@47341:                       else exec;
wenzelm@44480: 
wenzelm@44482:                     val node' = node
wenzelm@44482:                       |> fold reset_entry no_execs
wenzelm@44674:                       |> fold (fn (id, exec) => update_entry id (SOME exec)) execs
wenzelm@44482:                       |> set_result result
wenzelm@44482:                       |> set_touched false;
wenzelm@44482:                   in ((no_execs, execs, [(name, node')]), node') end)
wenzelm@47340:             end
wenzelm@47340:           else Future.value (([], [], []), node))
wenzelm@44479:       |> Future.joins |> map #1;
wenzelm@44476: 
wenzelm@44479:     val command_execs =
wenzelm@44479:       map (rpair NONE) (maps #1 updated) @
wenzelm@44674:       map (fn (command_id, (exec_id, _)) => (command_id, SOME exec_id)) (maps #2 updated);
wenzelm@44479:     val updated_nodes = maps #3 updated;
wenzelm@38418: 
wenzelm@44197:     val state' = state
wenzelm@44476:       |> define_version new_id (fold put_node updated_nodes new_version);
wenzelm@47388:   in (command_execs, state') end;
wenzelm@38418: 
wenzelm@38418: end;
wenzelm@38418: 
wenzelm@38418: 
wenzelm@44673: (* remove versions *)
wenzelm@44673: 
wenzelm@44674: fun remove_versions ids state = state |> map_state (fn (versions, _, execution) =>
wenzelm@44673:   let
wenzelm@44673:     val _ = member (op =) ids (#1 execution) andalso
wenzelm@44673:       error ("Attempt to remove execution version " ^ print_id (#1 execution));
wenzelm@44673: 
wenzelm@44673:     val versions' = fold delete_version ids versions;
wenzelm@44674:     val commands' =
wenzelm@44675:       (versions', Inttab.empty) |->
wenzelm@44673:         Inttab.fold (fn (_, version) => nodes_of version |>
wenzelm@44673:           Graph.fold (fn (_, (node, _)) => node |>
wenzelm@44674:             iterate_entries (fn ((_, id), _) =>
wenzelm@44674:               SOME o Inttab.insert (K true) (id, the_command state id))));
wenzelm@44674:   in (versions', commands', execution) end);
wenzelm@38418: 
wenzelm@43713: 
wenzelm@43713: 
wenzelm@43713: (** global state **)
wenzelm@43713: 
wenzelm@43713: val global_state = Synchronized.var "Document" init_state;
wenzelm@43713: 
wenzelm@43713: fun state () = Synchronized.value global_state;
wenzelm@43713: val change_state = Synchronized.change global_state;
wenzelm@43713: 
wenzelm@38418: end;
wenzelm@38418: