author | wenzelm |
Thu, 12 Sep 2019 13:33:09 +0200 | |
changeset 70683 | 8c7706b053c7 |
parent 70674 | 29bb1ebb188f |
child 70697 | 43bdcf778cfe |
permissions | -rw-r--r-- |
69012 | 1 |
/* Title: Pure/PIDE/headless.scala |
67054 | 2 |
Author: Makarius |
3 |
||
69012 | 4 |
Headless PIDE session and resources from file-system. |
67054 | 5 |
*/ |
6 |
||
7 |
package isabelle |
|
8 |
||
9 |
||
67925 | 10 |
import java.io.{File => JFile} |
11 |
||
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
12 |
import scala.annotation.tailrec |
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
13 |
import scala.collection.mutable |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
14 |
|
67925 | 15 |
|
69012 | 16 |
object Headless |
67054 | 17 |
{ |
69012 | 18 |
/** session **/ |
67061
2efa25302f34
synchronous session start (similar to isabelle.vscode.Server);
wenzelm
parents:
67059
diff
changeset
|
19 |
|
68916 | 20 |
private def stable_snapshot( |
21 |
state: Document.State, version: Document.Version, name: Document.Node.Name): Document.Snapshot = |
|
22 |
{ |
|
23 |
val snapshot = state.snapshot(name) |
|
24 |
assert(version.id == snapshot.version.id) |
|
25 |
snapshot |
|
26 |
} |
|
27 |
||
69013 | 28 |
class Use_Theories_Result private[Headless]( |
67883 | 29 |
val state: Document.State, |
67889 | 30 |
val version: Document.Version, |
68925 | 31 |
val nodes: List[(Document.Node.Name, Document_Status.Node_Status)], |
32 |
val nodes_committed: List[(Document.Node.Name, Document_Status.Node_Status)]) |
|
67879 | 33 |
{ |
69032
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
34 |
def nodes_pending: List[(Document.Node.Name, Document_Status.Node_Status)] = |
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
35 |
{ |
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
36 |
val committed = nodes_committed.iterator.map(_._1).toSet |
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
37 |
nodes.filter(p => !committed(p._1)) |
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
38 |
} |
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
39 |
|
68925 | 40 |
def snapshot(name: Document.Node.Name): Document.Snapshot = |
41 |
stable_snapshot(state, version, name) |
|
42 |
||
43 |
def ok: Boolean = |
|
44 |
(nodes.iterator ++ nodes_committed.iterator).forall({ case (_, st) => st.ok }) |
|
67879 | 45 |
} |
46 |
||
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
47 |
private object Checkpoints_State |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
48 |
{ |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
49 |
object Status extends Enumeration |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
50 |
{ |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
51 |
val INIT, LOADED, LOADED_DESCENDANTS = Value |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
52 |
} |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
53 |
|
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
54 |
def init(nodes: List[Document.Node.Name]): Checkpoints_State = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
55 |
Checkpoints_State(Status.INIT, nodes) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
56 |
|
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
57 |
val last: Checkpoints_State = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
58 |
Checkpoints_State(Status.LOADED_DESCENDANTS, Nil) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
59 |
} |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
60 |
|
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
61 |
private sealed case class Checkpoints_State( |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
62 |
status: Checkpoints_State.Status.Value, |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
63 |
nodes: List[Document.Node.Name]) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
64 |
{ |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
65 |
def next( |
70674
29bb1ebb188f
clarified signature: proper Document.Node.Ordering conforming to equality (e.g. required in situations where theory names are ambiguous due to overlapping session directories);
wenzelm
parents:
70657
diff
changeset
|
66 |
dep_graph: Document.Node.Name.Graph[Unit], |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
67 |
finished: Document.Node.Name => Boolean): (List[Document.Node.Name], Checkpoints_State) = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
68 |
{ |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
69 |
import Checkpoints_State.Status |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
70 |
|
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
71 |
def descendants: List[Document.Node.Name] = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
72 |
nodes match { |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
73 |
case Nil => dep_graph.topological_order |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
74 |
case current :: rest => |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
75 |
val dep_graph1 = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
76 |
if (rest.isEmpty) dep_graph |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
77 |
else { |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
78 |
val exclude = dep_graph.all_succs(rest).toSet |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
79 |
dep_graph.restrict(name => !exclude(name)) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
80 |
} |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
81 |
dep_graph1.all_succs(List(current)) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
82 |
} |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
83 |
|
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
84 |
def requirements: List[Document.Node.Name] = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
85 |
dep_graph.all_preds(nodes.headOption.toList).reverse |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
86 |
|
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
87 |
val (load_theories, st1) = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
88 |
(status, nodes) match { |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
89 |
case (Status.INIT, Nil) => |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
90 |
(descendants, Checkpoints_State.last) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
91 |
case (Status.INIT, current :: _) => |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
92 |
(requirements, copy(status = Status.LOADED)) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
93 |
case (Status.LOADED, current :: rest) if finished(current) => |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
94 |
(descendants, copy(status = Status.LOADED_DESCENDANTS)) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
95 |
case (Status.LOADED_DESCENDANTS, _ :: rest) if descendants.forall(finished) => |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
96 |
Checkpoints_State.init(rest).next(dep_graph, finished) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
97 |
case _ => (Nil, this) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
98 |
} |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
99 |
(load_theories.filterNot(finished), st1) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
100 |
} |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
101 |
} |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
102 |
|
69520 | 103 |
class Session private[Headless]( |
104 |
session_name: String, |
|
105 |
_session_options: => Options, |
|
106 |
override val resources: Resources) extends isabelle.Session(_session_options, resources) |
|
107 |
{ |
|
108 |
session => |
|
68694
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
109 |
|
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
110 |
|
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
111 |
private def loaded_theory(name: Document.Node.Name): Boolean = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
112 |
resources.session_base.loaded_theory(name.theory) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
113 |
|
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
114 |
|
69520 | 115 |
/* options */ |
116 |
||
117 |
def default_check_delay: Time = session_options.seconds("headless_check_delay") |
|
118 |
def default_check_limit: Int = session_options.int("headless_check_limit") |
|
119 |
def default_nodes_status_delay: Time = session_options.seconds("headless_nodes_status_delay") |
|
120 |
def default_watchdog_timeout: Time = session_options.seconds("headless_watchdog_timeout") |
|
121 |
def default_commit_cleanup_delay: Time = session_options.seconds("headless_commit_cleanup_delay") |
|
67063 | 122 |
|
68922 | 123 |
|
124 |
/* temporary directory */ |
|
125 |
||
67925 | 126 |
val tmp_dir: JFile = Isabelle_System.tmp_dir("server_session") |
67946 | 127 |
val tmp_dir_name: String = File.path(tmp_dir).implode |
67925 | 128 |
|
68923 | 129 |
def master_directory(master_dir: String): String = |
130 |
proper_string(master_dir) getOrElse tmp_dir_name |
|
131 |
||
67945 | 132 |
override def toString: String = session_name |
133 |
||
67925 | 134 |
override def stop(): Process_Result = |
135 |
{ |
|
136 |
try { super.stop() } |
|
137 |
finally { Isabelle_System.rm_tree(tmp_dir) } |
|
138 |
} |
|
139 |
||
67936 | 140 |
|
141 |
/* theories */ |
|
142 |
||
68914 | 143 |
private sealed case class Use_Theories_State( |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
144 |
dependencies: resources.Dependencies[Unit], |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
145 |
checkpoints_state: Checkpoints_State, |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
146 |
watchdog_timeout: Time, |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
147 |
commit: Option[(Document.Snapshot, Document_Status.Node_Status) => Unit], |
68914 | 148 |
last_update: Time = Time.now(), |
149 |
nodes_status: Document_Status.Nodes_Status = Document_Status.Nodes_Status.empty, |
|
68925 | 150 |
already_committed: Map[Document.Node.Name, Document_Status.Node_Status] = Map.empty, |
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
151 |
result: Option[Exn.Result[Use_Theories_Result]] = None) |
68914 | 152 |
{ |
70674
29bb1ebb188f
clarified signature: proper Document.Node.Ordering conforming to equality (e.g. required in situations where theory names are ambiguous due to overlapping session directories);
wenzelm
parents:
70657
diff
changeset
|
153 |
def dep_graph: Document.Node.Name.Graph[Unit] = dependencies.theory_graph |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
154 |
|
68914 | 155 |
def update(new_nodes_status: Document_Status.Nodes_Status): Use_Theories_State = |
156 |
copy(last_update = Time.now(), nodes_status = new_nodes_status) |
|
157 |
||
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
158 |
def watchdog: Boolean = |
68914 | 159 |
watchdog_timeout > Time.zero && Time.now() - last_update > watchdog_timeout |
160 |
||
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
161 |
def finished_result: Boolean = result.isDefined |
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
162 |
|
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
163 |
def join_result: Option[(Exn.Result[Use_Theories_Result], Use_Theories_State)] = |
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
164 |
if (finished_result) Some((result.get, this)) else None |
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
165 |
|
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
166 |
def cancel_result: Use_Theories_State = |
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
167 |
if (finished_result) this else copy(result = Some(Exn.Exn(Exn.Interrupt()))) |
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
168 |
|
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
169 |
def clean: Set[Document.Node.Name] = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
170 |
already_committed.keySet -- checkpoints_state.nodes |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
171 |
|
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
172 |
def check(state: Document.State, version: Document.Version, beyond_limit: Boolean) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
173 |
: (List[Document.Node.Name], Use_Theories_State) = |
68916 | 174 |
{ |
69035 | 175 |
val already_committed1 = |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
176 |
commit match { |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
177 |
case None => already_committed |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
178 |
case Some(commit_fn) => |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
179 |
(already_committed /: dep_graph.topological_order)( |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
180 |
{ case (committed, name) => |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
181 |
def parents_committed: Boolean = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
182 |
version.nodes(name).header.imports.forall(parent => |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
183 |
loaded_theory(parent) || committed.isDefinedAt(parent)) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
184 |
if (!committed.isDefinedAt(name) && parents_committed && |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
185 |
state.node_consolidated(version, name)) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
186 |
{ |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
187 |
val snapshot = stable_snapshot(state, version, name) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
188 |
val status = Document_Status.Node_Status.make(state, version, name) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
189 |
commit_fn(snapshot, status) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
190 |
committed + (name -> status) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
191 |
} |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
192 |
else committed |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
193 |
}) |
68916 | 194 |
} |
195 |
||
70657 | 196 |
def finished_theory(name: Document.Node.Name): Boolean = |
197 |
loaded_theory(name) || |
|
198 |
already_committed1.isDefinedAt(name) || |
|
199 |
state.node_consolidated(version, name) |
|
200 |
||
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
201 |
val result1 = |
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
202 |
if (!finished_result && |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
203 |
(beyond_limit || watchdog || |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
204 |
dep_graph.keys_iterator.forall(name => |
70657 | 205 |
finished_theory(name) || nodes_status.quasi_consolidated(name)))) |
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
206 |
{ |
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
207 |
val nodes = |
70657 | 208 |
(for { |
209 |
name <- dep_graph.keys_iterator |
|
210 |
if !loaded_theory(name) |
|
211 |
} yield { (name -> Document_Status.Node_Status.make(state, version, name)) }).toList |
|
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
212 |
val nodes_committed = |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
213 |
(for { |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
214 |
name <- dep_graph.keys_iterator |
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
215 |
status <- already_committed1.get(name) |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
216 |
} yield (name -> status)).toList |
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
217 |
Some(Exn.Res(new Use_Theories_Result(state, version, nodes, nodes_committed))) |
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
218 |
} |
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
219 |
else result |
68925 | 220 |
|
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
221 |
val (load_theories, checkpoints_state1) = |
70657 | 222 |
checkpoints_state.next(dep_graph, finished_theory(_)) |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
223 |
|
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
224 |
(load_theories, |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
225 |
copy(already_committed = already_committed1, result = result1, |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
226 |
checkpoints_state = checkpoints_state1)) |
68916 | 227 |
} |
68914 | 228 |
} |
229 |
||
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
230 |
def use_theories( |
67940
b4e80f062fbf
clarified signature -- eliminated somewhat pointless positions;
wenzelm
parents:
67939
diff
changeset
|
231 |
theories: List[String], |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
232 |
qualifier: String = Sessions.DRAFT, |
67881 | 233 |
master_dir: String = "", |
69920 | 234 |
unicode_symbols: Boolean = false, |
68943 | 235 |
check_delay: Time = default_check_delay, |
69520 | 236 |
check_limit: Int = default_check_limit, |
68947 | 237 |
watchdog_timeout: Time = default_watchdog_timeout, |
68943 | 238 |
nodes_status_delay: Time = default_nodes_status_delay, |
69458 | 239 |
id: UUID.T = UUID.random(), |
70625
1ae987cc052f
support for share_common_data after define_command and before actual update: this affects string particles of command tokens;
wenzelm
parents:
69920
diff
changeset
|
240 |
share_common_data: Boolean = false, |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
241 |
checkpoints: Set[Document.Node.Name] = Set.empty, |
68916 | 242 |
// commit: must not block, must not fail |
243 |
commit: Option[(Document.Snapshot, Document_Status.Node_Status) => Unit] = None, |
|
68981 | 244 |
commit_cleanup_delay: Time = default_commit_cleanup_delay, |
69013 | 245 |
progress: Progress = No_Progress): Use_Theories_Result = |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
246 |
{ |
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
247 |
val dependencies = |
68894
1dbdad1b57a5
more robust: load_theories after consumer is installed;
wenzelm
parents:
68888
diff
changeset
|
248 |
{ |
1dbdad1b57a5
more robust: load_theories after consumer is installed;
wenzelm
parents:
68888
diff
changeset
|
249 |
val import_names = |
68923 | 250 |
theories.map(thy => |
251 |
resources.import_name(qualifier, master_directory(master_dir), thy) -> Position.none) |
|
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
252 |
resources.dependencies(import_names, progress = progress).check_errors |
68894
1dbdad1b57a5
more robust: load_theories after consumer is installed;
wenzelm
parents:
68888
diff
changeset
|
253 |
} |
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
254 |
val dep_theories = dependencies.theories |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
255 |
val dep_theories_set = dep_theories.toSet |
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
256 |
val dep_files = |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
257 |
dependencies.loaded_files(false).flatMap(_._2). |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
258 |
map(path => Document.Node.Name(resources.append("", path))) |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
259 |
|
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
260 |
val use_theories_state = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
261 |
{ |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
262 |
val checkpoints_state = |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
263 |
Checkpoints_State.init( |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
264 |
if (checkpoints.isEmpty) Nil |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
265 |
else dependencies.theory_graph.topological_order.filter(checkpoints(_))) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
266 |
Synchronized(Use_Theories_State(dependencies, checkpoints_state, watchdog_timeout, commit)) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
267 |
} |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
268 |
|
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
269 |
def check_state(beyond_limit: Boolean = false) |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
270 |
{ |
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
271 |
val state = session.current_state() |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
272 |
for (version <- state.stable_tip_version) { |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
273 |
val load_theories = use_theories_state.change_result(_.check(state, version, beyond_limit)) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
274 |
if (load_theories.nonEmpty) { |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
275 |
resources.load_theories( |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
276 |
session, id, load_theories, dep_files, unicode_symbols, share_common_data, progress) |
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
277 |
} |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
278 |
} |
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
279 |
} |
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
280 |
|
67894
fee080c4045f
more robust check_state loop, even without session activity (e.g. idempotent use_theories);
wenzelm
parents:
67893
diff
changeset
|
281 |
val check_progress = |
68694
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
282 |
{ |
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
283 |
var check_count = 0 |
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
284 |
Event_Timer.request(Time.now(), repeat = Some(check_delay)) |
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
285 |
{ |
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
286 |
if (progress.stopped) use_theories_state.change(_.cancel_result) |
68694
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
287 |
else { |
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
288 |
check_count += 1 |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
289 |
check_state(check_limit > 0 && check_count > check_limit) |
68694
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
290 |
} |
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
291 |
} |
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
292 |
} |
67894
fee080c4045f
more robust check_state loop, even without session activity (e.g. idempotent use_theories);
wenzelm
parents:
67893
diff
changeset
|
293 |
|
68906 | 294 |
val consumer = |
295 |
{ |
|
296 |
val delay_nodes_status = |
|
297 |
Standard_Thread.delay_first(nodes_status_delay max Time.zero) { |
|
69818
60d0ee8f2ddb
more robust: avoid potentially unrelated snapshot for the sake of is_suppressed;
wenzelm
parents:
69817
diff
changeset
|
298 |
progress.nodes_status(use_theories_state.value.nodes_status) |
68906 | 299 |
} |
68770
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
300 |
|
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
301 |
val delay_commit_clean = |
68981 | 302 |
Standard_Thread.delay_first(commit_cleanup_delay max Time.zero) { |
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
303 |
resources.clean_theories(session, id, use_theories_state.value.clean) |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
304 |
} |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
305 |
|
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
306 |
Session.Consumer[Session.Commands_Changed](getClass.getName) { |
68330 | 307 |
case changed => |
68770
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
308 |
if (changed.nodes.exists(dep_theories_set)) { |
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
309 |
val snapshot = session.snapshot() |
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
310 |
val state = snapshot.state |
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
311 |
val version = snapshot.version |
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
312 |
|
68957 | 313 |
val theory_progress = |
68914 | 314 |
use_theories_state.change_result(st => |
68903 | 315 |
{ |
68883
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
wenzelm
parents:
68771
diff
changeset
|
316 |
val domain = |
68914 | 317 |
if (st.nodes_status.is_empty) dep_theories_set |
68883
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
wenzelm
parents:
68771
diff
changeset
|
318 |
else changed.nodes.iterator.filter(dep_theories_set).toSet |
68899 | 319 |
|
68903 | 320 |
val (nodes_status_changed, nodes_status1) = |
69255
800b1ce96fce
more general support for Isabelle/PIDE file formats -- less hardwired Bibtex operations;
wenzelm
parents:
69035
diff
changeset
|
321 |
st.nodes_status.update(resources, state, version, |
68903 | 322 |
domain = Some(domain), trim = changed.assignment) |
68899 | 323 |
|
68903 | 324 |
if (nodes_status_delay >= Time.zero && nodes_status_changed) { |
68883
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
wenzelm
parents:
68771
diff
changeset
|
325 |
delay_nodes_status.invoke |
68899 | 326 |
} |
68883
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
wenzelm
parents:
68771
diff
changeset
|
327 |
|
68957 | 328 |
val theory_progress = |
68905 | 329 |
(for { |
69818
60d0ee8f2ddb
more robust: avoid potentially unrelated snapshot for the sake of is_suppressed;
wenzelm
parents:
69817
diff
changeset
|
330 |
(name, node_status) <- nodes_status1.present.iterator |
68959 | 331 |
if changed.nodes.contains(name) && !st.already_committed.isDefinedAt(name) |
68962 | 332 |
p1 = node_status.percentage |
333 |
if p1 > 0 && Some(p1) != st.nodes_status.get(name).map(_.percentage) |
|
334 |
} yield Progress.Theory(name.theory, percentage = Some(p1))).toList |
|
68903 | 335 |
|
68957 | 336 |
(theory_progress, st.update(nodes_status1)) |
68903 | 337 |
}) |
68330 | 338 |
|
68957 | 339 |
theory_progress.foreach(progress.theory(_)) |
68903 | 340 |
|
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
341 |
check_state() |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
342 |
|
68981 | 343 |
if (commit.isDefined && commit_cleanup_delay > Time.zero) { |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
344 |
if (use_theories_state.value.finished_result) |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
345 |
delay_commit_clean.revoke |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
346 |
else delay_commit_clean.invoke |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
347 |
} |
68330 | 348 |
} |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
349 |
} |
68906 | 350 |
} |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
351 |
|
67892 | 352 |
try { |
353 |
session.commands_changed += consumer |
|
70653
f7c5b30fc432
load theories in stages, to reduce ML heap requirements;
wenzelm
parents:
70649
diff
changeset
|
354 |
check_state() |
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
355 |
use_theories_state.guarded_access(_.join_result) |
67894
fee080c4045f
more robust check_state loop, even without session activity (e.g. idempotent use_theories);
wenzelm
parents:
67893
diff
changeset
|
356 |
check_progress.cancel |
67892 | 357 |
} |
358 |
finally { |
|
68907 | 359 |
session.commands_changed -= consumer |
67892 | 360 |
resources.unload_theories(session, id, dep_theories) |
361 |
} |
|
67884
43af581d7d8e
unload_theories after consolidation -- reset node_required;
wenzelm
parents:
67883
diff
changeset
|
362 |
|
70644
b23a6dfcfd57
clarified state variable: avoid extra mutability via Promise;
wenzelm
parents:
70640
diff
changeset
|
363 |
Exn.release(use_theories_state.guarded_access(_.join_result)) |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
364 |
} |
67936 | 365 |
|
67939 | 366 |
def purge_theories( |
68915 | 367 |
theories: List[String], |
368 |
qualifier: String = Sessions.DRAFT, |
|
369 |
master_dir: String = "", |
|
370 |
all: Boolean = false): (List[Document.Node.Name], List[Document.Node.Name]) = |
|
371 |
{ |
|
68923 | 372 |
val nodes = |
373 |
if (all) None |
|
374 |
else Some(theories.map(resources.import_name(qualifier, master_directory(master_dir), _))) |
|
68915 | 375 |
resources.purge_theories(session, nodes) |
376 |
} |
|
67063 | 377 |
} |
378 |
||
67061
2efa25302f34
synchronous session start (similar to isabelle.vscode.Server);
wenzelm
parents:
67059
diff
changeset
|
379 |
|
67054 | 380 |
|
69012 | 381 |
/** resources **/ |
68922 | 382 |
|
69012 | 383 |
object Resources |
384 |
{ |
|
69536 | 385 |
def apply(base_info: Sessions.Base_Info, log: Logger = No_Logger): Resources = |
386 |
new Resources(base_info, log = log) |
|
387 |
||
388 |
def make( |
|
389 |
options: Options, |
|
390 |
session_name: String, |
|
391 |
session_dirs: List[Path] = Nil, |
|
392 |
include_sessions: List[String] = Nil, |
|
393 |
progress: Progress = No_Progress, |
|
394 |
log: Logger = No_Logger): Resources = |
|
395 |
{ |
|
396 |
val base_info = |
|
397 |
Sessions.base_info(options, session_name, dirs = session_dirs, |
|
398 |
include_sessions = include_sessions, progress = progress) |
|
399 |
apply(base_info, log = log) |
|
400 |
} |
|
401 |
||
69012 | 402 |
final class Theory private[Headless]( |
403 |
val node_name: Document.Node.Name, |
|
404 |
val node_header: Document.Node.Header, |
|
405 |
val text: String, |
|
406 |
val node_required: Boolean) |
|
68922 | 407 |
{ |
69012 | 408 |
override def toString: String = node_name.toString |
68922 | 409 |
|
69012 | 410 |
def node_perspective: Document.Node.Perspective_Text = |
411 |
Document.Node.Perspective(node_required, Text.Perspective.empty, Document.Node.Overlays.empty) |
|
68922 | 412 |
|
69012 | 413 |
def make_edits(text_edits: List[Text.Edit]): List[Document.Edit_Text] = |
414 |
List(node_name -> Document.Node.Deps(node_header), |
|
415 |
node_name -> Document.Node.Edits(text_edits), |
|
416 |
node_name -> node_perspective) |
|
68922 | 417 |
|
69012 | 418 |
def node_edits(old: Option[Theory]): List[Document.Edit_Text] = |
419 |
{ |
|
420 |
val (text_edits, old_required) = |
|
421 |
if (old.isEmpty) (Text.Edit.inserts(0, text), false) |
|
422 |
else (Text.Edit.replace(0, old.get.text, text), old.get.node_required) |
|
67887
a4d5342898b1
unload_theories: actually observe required state;
wenzelm
parents:
67885
diff
changeset
|
423 |
|
69012 | 424 |
if (text_edits.isEmpty && node_required == old_required) Nil |
425 |
else make_edits(text_edits) |
|
426 |
} |
|
67887
a4d5342898b1
unload_theories: actually observe required state;
wenzelm
parents:
67885
diff
changeset
|
427 |
|
69012 | 428 |
def purge_edits: List[Document.Edit_Text] = |
429 |
make_edits(Text.Edit.removes(0, text)) |
|
67936 | 430 |
|
69012 | 431 |
def required(required: Boolean): Theory = |
432 |
if (required == node_required) this |
|
433 |
else new Theory(node_name, node_header, text, required) |
|
67936 | 434 |
} |
435 |
||
69012 | 436 |
sealed case class State( |
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
437 |
blobs: Map[Document.Node.Name, Document.Blob] = Map.empty, |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
438 |
theories: Map[Document.Node.Name, Theory] = Map.empty, |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
439 |
required: Multi_Map[Document.Node.Name, UUID.T] = Multi_Map.empty) |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
440 |
{ |
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
441 |
/* blobs */ |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
442 |
|
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
443 |
def doc_blobs: Document.Blobs = Document.Blobs(blobs) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
444 |
|
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
445 |
def update_blobs(names: List[Document.Node.Name]): (Document.Blobs, State) = |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
446 |
{ |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
447 |
val new_blobs = |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
448 |
names.flatMap(name => |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
449 |
{ |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
450 |
val bytes = Bytes.read(name.path) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
451 |
def new_blob: Document.Blob = |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
452 |
{ |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
453 |
val text = bytes.text |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
454 |
Document.Blob(bytes, text, Symbol.Text_Chunk(text), changed = true) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
455 |
} |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
456 |
blobs.get(name) match { |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
457 |
case Some(blob) => if (blob.bytes == bytes) None else Some(name -> new_blob) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
458 |
case None => Some(name -> new_blob) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
459 |
} |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
460 |
}) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
461 |
val blobs1 = (blobs /: new_blobs)(_ + _) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
462 |
val blobs2 = (blobs /: new_blobs)({ case (map, (a, b)) => map + (a -> b.unchanged) }) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
463 |
(Document.Blobs(blobs1), copy(blobs = blobs2)) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
464 |
} |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
465 |
|
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
466 |
def blob_edits(name: Document.Node.Name, old_blob: Option[Document.Blob]) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
467 |
: List[Document.Edit_Text] = |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
468 |
{ |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
469 |
val blob = blobs.getOrElse(name, error("Missing blob " + quote(name.toString))) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
470 |
val text_edits = |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
471 |
old_blob match { |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
472 |
case None => List(Text.Edit.insert(0, blob.source)) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
473 |
case Some(blob0) => Text.Edit.replace(0, blob0.source, blob.source) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
474 |
} |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
475 |
if (text_edits.isEmpty) Nil |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
476 |
else List(name -> Document.Node.Blob(blob), name -> Document.Node.Edits(text_edits)) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
477 |
} |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
478 |
|
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
479 |
|
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
480 |
/* theories */ |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
481 |
|
70674
29bb1ebb188f
clarified signature: proper Document.Node.Ordering conforming to equality (e.g. required in situations where theory names are ambiguous due to overlapping session directories);
wenzelm
parents:
70657
diff
changeset
|
482 |
lazy val theory_graph: Document.Node.Name.Graph[Unit] = |
29bb1ebb188f
clarified signature: proper Document.Node.Ordering conforming to equality (e.g. required in situations where theory names are ambiguous due to overlapping session directories);
wenzelm
parents:
70657
diff
changeset
|
483 |
Document.Node.Name.make_graph( |
69012 | 484 |
for ((name, theory) <- theories.toList) |
70647 | 485 |
yield ((name, ()), theory.node_header.imports.filter(theories.isDefinedAt(_)))) |
67056 | 486 |
|
69012 | 487 |
def is_required(name: Document.Node.Name): Boolean = required.isDefinedAt(name) |
488 |
||
69458 | 489 |
def insert_required(id: UUID.T, names: List[Document.Node.Name]): State = |
69012 | 490 |
copy(required = (required /: names)(_.insert(_, id))) |
491 |
||
69458 | 492 |
def remove_required(id: UUID.T, names: List[Document.Node.Name]): State = |
69012 | 493 |
copy(required = (required /: names)(_.remove(_, id))) |
68958 | 494 |
|
69012 | 495 |
def update_theories(update: List[(Document.Node.Name, Theory)]): State = |
496 |
copy(theories = |
|
497 |
(theories /: update)({ case (thys, (name, thy)) => |
|
498 |
thys.get(name) match { |
|
499 |
case Some(thy1) if thy1 == thy => thys |
|
500 |
case _ => thys + (name -> thy) |
|
501 |
} |
|
502 |
})) |
|
503 |
||
504 |
def remove_theories(remove: List[Document.Node.Name]): State = |
|
67893 | 505 |
{ |
69012 | 506 |
require(remove.forall(name => !is_required(name))) |
507 |
copy(theories = theories -- remove) |
|
508 |
} |
|
509 |
||
70649 | 510 |
def unload_theories(session: Session, id: UUID.T, theories: List[Document.Node.Name]) |
69458 | 511 |
: State = |
69012 | 512 |
{ |
70649 | 513 |
val st1 = remove_required(id, theories) |
67893 | 514 |
val theory_edits = |
69012 | 515 |
for { |
70649 | 516 |
node_name <- theories |
69012 | 517 |
theory <- st1.theories.get(node_name) |
518 |
} |
|
67893 | 519 |
yield { |
520 |
val theory1 = theory.required(st1.is_required(node_name)) |
|
69012 | 521 |
val edits = theory1.node_edits(Some(theory)) |
67893 | 522 |
(edits, (node_name, theory1)) |
523 |
} |
|
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
524 |
session.update(doc_blobs, theory_edits.flatMap(_._1)) |
67893 | 525 |
st1.update_theories(theory_edits.map(_._2)) |
69012 | 526 |
} |
527 |
||
528 |
def purge_theories(session: Session, nodes: List[Document.Node.Name]) |
|
529 |
: ((List[Document.Node.Name], List[Document.Node.Name]), State) = |
|
530 |
{ |
|
531 |
val all_nodes = theory_graph.topological_order |
|
532 |
val purge = nodes.filterNot(is_required(_)).toSet |
|
533 |
||
534 |
val retain = theory_graph.all_preds(all_nodes.filterNot(purge)).toSet |
|
535 |
val (retained, purged) = all_nodes.partition(retain) |
|
536 |
||
537 |
val purge_edits = purged.flatMap(name => theories(name).purge_edits) |
|
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
538 |
session.update(doc_blobs, purge_edits) |
69012 | 539 |
|
540 |
((purged, retained), remove_theories(purged)) |
|
541 |
} |
|
67884
43af581d7d8e
unload_theories after consolidation -- reset node_required;
wenzelm
parents:
67883
diff
changeset
|
542 |
|
69012 | 543 |
def frontier_theories(clean: Set[Document.Node.Name]): Set[Document.Node.Name] = |
544 |
{ |
|
545 |
@tailrec def frontier(base: List[Document.Node.Name], front: Set[Document.Node.Name]) |
|
546 |
: Set[Document.Node.Name] = |
|
547 |
{ |
|
548 |
val add = base.filter(b => theory_graph.imm_succs(b).forall(front)) |
|
549 |
if (add.isEmpty) front |
|
550 |
else { |
|
551 |
val pre_add = add.map(theory_graph.imm_preds) |
|
552 |
val base1 = (pre_add.head /: pre_add.tail)(_ ++ _).toList.filter(clean) |
|
553 |
frontier(base1, front ++ add) |
|
554 |
} |
|
555 |
} |
|
70648 | 556 |
if (clean.isEmpty) Set.empty |
557 |
else frontier(theory_graph.maximals.filter(clean), Set.empty) |
|
69012 | 558 |
} |
559 |
} |
|
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
560 |
} |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
561 |
|
69536 | 562 |
class Resources private[Headless]( |
563 |
val session_base_info: Sessions.Base_Info, |
|
564 |
log: Logger = No_Logger) |
|
70683
8c7706b053c7
find theory files via session structure: much faster Prover IDE startup;
wenzelm
parents:
70674
diff
changeset
|
565 |
extends isabelle.Resources( |
8c7706b053c7
find theory files via session structure: much faster Prover IDE startup;
wenzelm
parents:
70674
diff
changeset
|
566 |
session_base_info.sessions_structure, session_base_info.check_base, log = log) |
67884
43af581d7d8e
unload_theories after consolidation -- reset node_required;
wenzelm
parents:
67883
diff
changeset
|
567 |
{ |
69012 | 568 |
resources => |
569 |
||
69538
faf547d2834c
clarified signature, notably cascade of dump_options, deps, resources, session;
wenzelm
parents:
69536
diff
changeset
|
570 |
def options: Options = session_base_info.options |
faf547d2834c
clarified signature, notably cascade of dump_options, deps, resources, session;
wenzelm
parents:
69536
diff
changeset
|
571 |
|
69536 | 572 |
|
573 |
/* session */ |
|
574 |
||
575 |
def start_session(print_mode: List[String] = Nil, progress: Progress = No_Progress): Session = |
|
576 |
{ |
|
577 |
val session = new Session(session_base_info.session, options, resources) |
|
578 |
||
579 |
val session_error = Future.promise[String] |
|
580 |
var session_phase: Session.Consumer[Session.Phase] = null |
|
581 |
session_phase = |
|
582 |
Session.Consumer(getClass.getName) { |
|
583 |
case Session.Ready => |
|
584 |
session.phase_changed -= session_phase |
|
585 |
session_error.fulfill("") |
|
586 |
case Session.Terminated(result) if !result.ok => |
|
587 |
session.phase_changed -= session_phase |
|
588 |
session_error.fulfill("Session start failed: return code " + result.rc) |
|
589 |
case _ => |
|
590 |
} |
|
591 |
session.phase_changed += session_phase |
|
592 |
||
593 |
progress.echo("Starting session " + session_base_info.session + " ...") |
|
594 |
Isabelle_Process.start(session, options, |
|
595 |
logic = session_base_info.session, dirs = session_base_info.dirs, modes = print_mode) |
|
596 |
||
597 |
session_error.join match { |
|
598 |
case "" => session |
|
599 |
case msg => session.stop(); error(msg) |
|
600 |
} |
|
601 |
} |
|
602 |
||
603 |
||
604 |
/* theories */ |
|
605 |
||
69012 | 606 |
private val state = Synchronized(Resources.State()) |
607 |
||
608 |
def load_theories( |
|
609 |
session: Session, |
|
69458 | 610 |
id: UUID.T, |
70649 | 611 |
theories: List[Document.Node.Name], |
612 |
files: List[Document.Node.Name], |
|
69920 | 613 |
unicode_symbols: Boolean, |
70625
1ae987cc052f
support for share_common_data after define_command and before actual update: this affects string particles of command tokens;
wenzelm
parents:
69920
diff
changeset
|
614 |
share_common_data: Boolean, |
69012 | 615 |
progress: Progress) |
616 |
{ |
|
617 |
val loaded_theories = |
|
70649 | 618 |
for (node_name <- theories) |
69012 | 619 |
yield { |
620 |
val path = node_name.path |
|
621 |
if (!node_name.is_theory) error("Not a theory file: " + path) |
|
622 |
||
623 |
progress.expose_interrupt() |
|
69920 | 624 |
val text0 = File.read(path) |
625 |
val text = if (unicode_symbols) Symbol.decode(text0) else text0 |
|
69012 | 626 |
val node_header = resources.check_thy_reader(node_name, Scan.char_reader(text)) |
627 |
new Resources.Theory(node_name, node_header, text, true) |
|
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
628 |
} |
69012 | 629 |
|
630 |
val loaded = loaded_theories.length |
|
631 |
if (loaded > 1) progress.echo("Loading " + loaded + " theories ...") |
|
632 |
||
633 |
state.change(st => |
|
634 |
{ |
|
70649 | 635 |
val (doc_blobs1, st1) = st.insert_required(id, theories).update_blobs(files) |
69012 | 636 |
val theory_edits = |
637 |
for (theory <- loaded_theories) |
|
638 |
yield { |
|
639 |
val node_name = theory.node_name |
|
640 |
val theory1 = theory.required(st1.is_required(node_name)) |
|
641 |
val edits = theory1.node_edits(st1.theories.get(node_name)) |
|
642 |
(edits, (node_name, theory1)) |
|
643 |
} |
|
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
644 |
val file_edits = |
70649 | 645 |
for { node_name <- files if doc_blobs1.changed(node_name) } |
69562
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
646 |
yield st1.blob_edits(node_name, st.blobs.get(node_name)) |
636b3c03a61a
include loaded_files as doc_blobs (without purging);
wenzelm
parents:
69538
diff
changeset
|
647 |
|
70625
1ae987cc052f
support for share_common_data after define_command and before actual update: this affects string particles of command tokens;
wenzelm
parents:
69920
diff
changeset
|
648 |
session.update(doc_blobs1, theory_edits.flatMap(_._1) ::: file_edits.flatten, |
1ae987cc052f
support for share_common_data after define_command and before actual update: this affects string particles of command tokens;
wenzelm
parents:
69920
diff
changeset
|
649 |
share_common_data = share_common_data) |
69012 | 650 |
st1.update_theories(theory_edits.map(_._2)) |
651 |
}) |
|
652 |
} |
|
67936 | 653 |
|
70649 | 654 |
def unload_theories(session: Session, id: UUID.T, theories: List[Document.Node.Name]) |
69012 | 655 |
{ |
70649 | 656 |
state.change(_.unload_theories(session, id, theories)) |
69012 | 657 |
} |
658 |
||
69458 | 659 |
def clean_theories(session: Session, id: UUID.T, clean: Set[Document.Node.Name]) |
69012 | 660 |
{ |
661 |
state.change(st => |
|
662 |
{ |
|
663 |
val frontier = st.frontier_theories(clean).toList |
|
664 |
if (frontier.isEmpty) st |
|
665 |
else { |
|
666 |
val st1 = st.unload_theories(session, id, frontier) |
|
667 |
val (_, st2) = st1.purge_theories(session, frontier) |
|
668 |
st2 |
|
669 |
} |
|
670 |
}) |
|
671 |
} |
|
672 |
||
673 |
def purge_theories(session: Session, nodes: Option[List[Document.Node.Name]]) |
|
674 |
: (List[Document.Node.Name], List[Document.Node.Name]) = |
|
675 |
{ |
|
676 |
state.change_result(st => st.purge_theories(session, nodes getOrElse st.theory_graph.keys)) |
|
677 |
} |
|
67936 | 678 |
} |
67054 | 679 |
} |