author | wenzelm |
Sat, 29 Dec 2018 16:11:24 +0100 | |
changeset 69536 | 892b68f932f9 |
parent 69520 | 16779868de1f |
child 69538 | faf547d2834c |
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 |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
13 |
|
67925 | 14 |
|
69012 | 15 |
object Headless |
67054 | 16 |
{ |
69012 | 17 |
/** session **/ |
67061
2efa25302f34
synchronous session start (similar to isabelle.vscode.Server);
wenzelm
parents:
67059
diff
changeset
|
18 |
|
68916 | 19 |
private def stable_snapshot( |
20 |
state: Document.State, version: Document.Version, name: Document.Node.Name): Document.Snapshot = |
|
21 |
{ |
|
22 |
val snapshot = state.snapshot(name) |
|
23 |
assert(version.id == snapshot.version.id) |
|
24 |
snapshot |
|
25 |
} |
|
26 |
||
69013 | 27 |
class Use_Theories_Result private[Headless]( |
67883 | 28 |
val state: Document.State, |
67889 | 29 |
val version: Document.Version, |
68925 | 30 |
val nodes: List[(Document.Node.Name, Document_Status.Node_Status)], |
31 |
val nodes_committed: List[(Document.Node.Name, Document_Status.Node_Status)]) |
|
67879 | 32 |
{ |
69032
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
33 |
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
|
34 |
{ |
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
35 |
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
|
36 |
nodes.filter(p => !committed(p._1)) |
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
37 |
} |
90bb4cabe1e8
clarified errors: no result from forced session.stop, check pending theories;
wenzelm
parents:
69013
diff
changeset
|
38 |
|
68925 | 39 |
def snapshot(name: Document.Node.Name): Document.Snapshot = |
40 |
stable_snapshot(state, version, name) |
|
41 |
||
42 |
def ok: Boolean = |
|
43 |
(nodes.iterator ++ nodes_committed.iterator).forall({ case (_, st) => st.ok }) |
|
67879 | 44 |
} |
45 |
||
69520 | 46 |
class Session private[Headless]( |
47 |
session_name: String, |
|
48 |
_session_options: => Options, |
|
49 |
override val resources: Resources) extends isabelle.Session(_session_options, resources) |
|
50 |
{ |
|
51 |
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
|
52 |
|
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
53 |
|
69520 | 54 |
/* options */ |
55 |
||
56 |
def default_check_delay: Time = session_options.seconds("headless_check_delay") |
|
57 |
def default_check_limit: Int = session_options.int("headless_check_limit") |
|
58 |
def default_nodes_status_delay: Time = session_options.seconds("headless_nodes_status_delay") |
|
59 |
def default_watchdog_timeout: Time = session_options.seconds("headless_watchdog_timeout") |
|
60 |
def default_commit_cleanup_delay: Time = session_options.seconds("headless_commit_cleanup_delay") |
|
67063 | 61 |
|
68922 | 62 |
|
63 |
/* temporary directory */ |
|
64 |
||
67925 | 65 |
val tmp_dir: JFile = Isabelle_System.tmp_dir("server_session") |
67946 | 66 |
val tmp_dir_name: String = File.path(tmp_dir).implode |
67925 | 67 |
|
68923 | 68 |
def master_directory(master_dir: String): String = |
69 |
proper_string(master_dir) getOrElse tmp_dir_name |
|
70 |
||
67945 | 71 |
override def toString: String = session_name |
72 |
||
67925 | 73 |
override def stop(): Process_Result = |
74 |
{ |
|
75 |
try { super.stop() } |
|
76 |
finally { Isabelle_System.rm_tree(tmp_dir) } |
|
77 |
} |
|
78 |
||
67936 | 79 |
|
80 |
/* theories */ |
|
81 |
||
68914 | 82 |
private sealed case class Use_Theories_State( |
83 |
last_update: Time = Time.now(), |
|
84 |
nodes_status: Document_Status.Nodes_Status = Document_Status.Nodes_Status.empty, |
|
68925 | 85 |
already_committed: Map[Document.Node.Name, Document_Status.Node_Status] = Map.empty, |
69013 | 86 |
result: Promise[Use_Theories_Result] = Future.promise[Use_Theories_Result]) |
68914 | 87 |
{ |
88 |
def update(new_nodes_status: Document_Status.Nodes_Status): Use_Theories_State = |
|
89 |
copy(last_update = Time.now(), nodes_status = new_nodes_status) |
|
90 |
||
91 |
def watchdog(watchdog_timeout: Time): Boolean = |
|
92 |
watchdog_timeout > Time.zero && Time.now() - last_update > watchdog_timeout |
|
93 |
||
68916 | 94 |
def cancel_result { result.cancel } |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
95 |
def finished_result: Boolean = result.is_finished |
68916 | 96 |
def await_result { result.join_result } |
69013 | 97 |
def join_result: Use_Theories_Result = result.join |
68916 | 98 |
def check_result( |
99 |
state: Document.State, |
|
100 |
version: Document.Version, |
|
68925 | 101 |
dep_theories: List[Document.Node.Name], |
68916 | 102 |
beyond_limit: Boolean, |
103 |
watchdog_timeout: Time, |
|
104 |
commit: Option[(Document.Snapshot, Document_Status.Node_Status) => Unit]) |
|
105 |
: Use_Theories_State = |
|
106 |
{ |
|
69035 | 107 |
val already_committed1 = |
68916 | 108 |
if (commit.isDefined) { |
69035 | 109 |
(already_committed /: dep_theories)({ case (committed, name) => |
110 |
def parents_committed: Boolean = |
|
111 |
version.nodes(name).header.imports.forall({ case (parent, _) => |
|
112 |
Sessions.is_pure(parent.theory) || committed.isDefinedAt(parent) |
|
113 |
}) |
|
114 |
if (!committed.isDefinedAt(name) && parents_committed && |
|
115 |
state.node_consolidated(version, name)) |
|
116 |
{ |
|
117 |
val snapshot = stable_snapshot(state, version, name) |
|
118 |
val status = Document_Status.Node_Status.make(state, version, name) |
|
119 |
commit.get.apply(snapshot, status) |
|
120 |
committed + (name -> status) |
|
121 |
} |
|
122 |
else committed |
|
123 |
}) |
|
68916 | 124 |
} |
69035 | 125 |
else already_committed |
68916 | 126 |
|
127 |
if (beyond_limit || watchdog(watchdog_timeout) || |
|
68925 | 128 |
dep_theories.forall(name => |
69035 | 129 |
already_committed1.isDefinedAt(name) || |
68916 | 130 |
state.node_consolidated(version, name) || |
131 |
nodes_status.quasi_consolidated(name))) |
|
132 |
{ |
|
133 |
val nodes = |
|
68925 | 134 |
for (name <- dep_theories) |
68916 | 135 |
yield { (name -> Document_Status.Node_Status.make(state, version, name)) } |
68925 | 136 |
val nodes_committed = |
137 |
for { |
|
138 |
name <- dep_theories |
|
69035 | 139 |
status <- already_committed1.get(name) |
68925 | 140 |
} yield (name -> status) |
141 |
||
69013 | 142 |
try { result.fulfill(new Use_Theories_Result(state, version, nodes, nodes_committed)) } |
68916 | 143 |
catch { case _: IllegalStateException => } |
144 |
} |
|
145 |
||
69035 | 146 |
copy(already_committed = already_committed1) |
68916 | 147 |
} |
68914 | 148 |
} |
149 |
||
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
150 |
def use_theories( |
67940
b4e80f062fbf
clarified signature -- eliminated somewhat pointless positions;
wenzelm
parents:
67939
diff
changeset
|
151 |
theories: List[String], |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
152 |
qualifier: String = Sessions.DRAFT, |
67881 | 153 |
master_dir: String = "", |
68943 | 154 |
check_delay: Time = default_check_delay, |
69520 | 155 |
check_limit: Int = default_check_limit, |
68947 | 156 |
watchdog_timeout: Time = default_watchdog_timeout, |
68943 | 157 |
nodes_status_delay: Time = default_nodes_status_delay, |
69458 | 158 |
id: UUID.T = UUID.random(), |
68916 | 159 |
// commit: must not block, must not fail |
160 |
commit: Option[(Document.Snapshot, Document_Status.Node_Status) => Unit] = None, |
|
68981 | 161 |
commit_cleanup_delay: Time = default_commit_cleanup_delay, |
69013 | 162 |
progress: Progress = No_Progress): Use_Theories_Result = |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
163 |
{ |
67887
a4d5342898b1
unload_theories: actually observe required state;
wenzelm
parents:
67885
diff
changeset
|
164 |
val dep_theories = |
68894
1dbdad1b57a5
more robust: load_theories after consumer is installed;
wenzelm
parents:
68888
diff
changeset
|
165 |
{ |
1dbdad1b57a5
more robust: load_theories after consumer is installed;
wenzelm
parents:
68888
diff
changeset
|
166 |
val import_names = |
68923 | 167 |
theories.map(thy => |
168 |
resources.import_name(qualifier, master_directory(master_dir), thy) -> Position.none) |
|
68894
1dbdad1b57a5
more robust: load_theories after consumer is installed;
wenzelm
parents:
68888
diff
changeset
|
169 |
resources.dependencies(import_names, progress = progress).check_errors.theories |
1dbdad1b57a5
more robust: load_theories after consumer is installed;
wenzelm
parents:
68888
diff
changeset
|
170 |
} |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
171 |
|
68914 | 172 |
val use_theories_state = Synchronized(Use_Theories_State()) |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
173 |
|
68916 | 174 |
def check_result(beyond_limit: Boolean = false) |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
175 |
{ |
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
176 |
val state = session.current_state() |
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
177 |
state.stable_tip_version match { |
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
|
178 |
case Some(version) => |
68916 | 179 |
use_theories_state.change( |
180 |
_.check_result(state, version, dep_theories, beyond_limit, watchdog_timeout, commit)) |
|
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
|
181 |
case None => |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
182 |
} |
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
183 |
} |
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
184 |
|
67894
fee080c4045f
more robust check_state loop, even without session activity (e.g. idempotent use_theories);
wenzelm
parents:
67893
diff
changeset
|
185 |
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
|
186 |
{ |
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
187 |
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
|
188 |
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
|
189 |
{ |
68916 | 190 |
if (progress.stopped) use_theories_state.value.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
|
191 |
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
|
192 |
check_count += 1 |
68916 | 193 |
check_result(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
|
194 |
} |
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
195 |
} |
03e104be99af
added check_delay / check_limit for more robust treatment of structurally broken theory sources (or genuine non-termination);
wenzelm
parents:
68365
diff
changeset
|
196 |
} |
67894
fee080c4045f
more robust check_state loop, even without session activity (e.g. idempotent use_theories);
wenzelm
parents:
67893
diff
changeset
|
197 |
|
68906 | 198 |
val consumer = |
199 |
{ |
|
200 |
val delay_nodes_status = |
|
201 |
Standard_Thread.delay_first(nodes_status_delay max Time.zero) { |
|
68914 | 202 |
progress.nodes_status(use_theories_state.value.nodes_status) |
68906 | 203 |
} |
68770
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
204 |
|
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
205 |
val delay_commit_clean = |
68981 | 206 |
Standard_Thread.delay_first(commit_cleanup_delay max Time.zero) { |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
207 |
val clean = use_theories_state.value.already_committed.keySet |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
208 |
resources.clean_theories(session, id, clean) |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
209 |
} |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
210 |
|
68952 | 211 |
val dep_theories_set = dep_theories.toSet |
212 |
||
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
213 |
Session.Consumer[Session.Commands_Changed](getClass.getName) { |
68330 | 214 |
case changed => |
68770
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
215 |
if (changed.nodes.exists(dep_theories_set)) { |
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
216 |
val snapshot = session.snapshot() |
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
217 |
val state = snapshot.state |
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
218 |
val version = snapshot.version |
add44e2b8cb0
optional notification of nodes_status (via progress);
wenzelm
parents:
68758
diff
changeset
|
219 |
|
68957 | 220 |
val theory_progress = |
68914 | 221 |
use_theories_state.change_result(st => |
68903 | 222 |
{ |
68883
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
wenzelm
parents:
68771
diff
changeset
|
223 |
val domain = |
68914 | 224 |
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
|
225 |
else changed.nodes.iterator.filter(dep_theories_set).toSet |
68899 | 226 |
|
68903 | 227 |
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
|
228 |
st.nodes_status.update(resources, state, version, |
68903 | 229 |
domain = Some(domain), trim = changed.assignment) |
68899 | 230 |
|
68903 | 231 |
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
|
232 |
delay_nodes_status.invoke |
68899 | 233 |
} |
68883
3653b3ad729e
clarified Thy_Resources.Session.use_theories: "terminated" node status is sufficient;
wenzelm
parents:
68771
diff
changeset
|
234 |
|
68957 | 235 |
val theory_progress = |
68905 | 236 |
(for { |
68904 | 237 |
(name, node_status) <- nodes_status1.present.iterator |
68959 | 238 |
if changed.nodes.contains(name) && !st.already_committed.isDefinedAt(name) |
68962 | 239 |
p1 = node_status.percentage |
240 |
if p1 > 0 && Some(p1) != st.nodes_status.get(name).map(_.percentage) |
|
241 |
} yield Progress.Theory(name.theory, percentage = Some(p1))).toList |
|
68903 | 242 |
|
68957 | 243 |
(theory_progress, st.update(nodes_status1)) |
68903 | 244 |
}) |
68330 | 245 |
|
68957 | 246 |
theory_progress.foreach(progress.theory(_)) |
68903 | 247 |
|
68916 | 248 |
check_result() |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
249 |
|
68981 | 250 |
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
|
251 |
if (use_theories_state.value.finished_result) |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
252 |
delay_commit_clean.revoke |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
253 |
else delay_commit_clean.invoke |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
254 |
} |
68330 | 255 |
} |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
256 |
} |
68906 | 257 |
} |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
258 |
|
67892 | 259 |
try { |
260 |
session.commands_changed += consumer |
|
68894
1dbdad1b57a5
more robust: load_theories after consumer is installed;
wenzelm
parents:
68888
diff
changeset
|
261 |
resources.load_theories(session, id, dep_theories, progress) |
68916 | 262 |
use_theories_state.value.await_result |
67894
fee080c4045f
more robust check_state loop, even without session activity (e.g. idempotent use_theories);
wenzelm
parents:
67893
diff
changeset
|
263 |
check_progress.cancel |
67892 | 264 |
} |
265 |
finally { |
|
68907 | 266 |
session.commands_changed -= consumer |
67892 | 267 |
resources.unload_theories(session, id, dep_theories) |
268 |
} |
|
67884
43af581d7d8e
unload_theories after consolidation -- reset node_required;
wenzelm
parents:
67883
diff
changeset
|
269 |
|
68916 | 270 |
use_theories_state.value.join_result |
67064
fb487246ef4f
synchronous use_theories, based on consolidated_state;
wenzelm
parents:
67063
diff
changeset
|
271 |
} |
67936 | 272 |
|
67939 | 273 |
def purge_theories( |
68915 | 274 |
theories: List[String], |
275 |
qualifier: String = Sessions.DRAFT, |
|
276 |
master_dir: String = "", |
|
277 |
all: Boolean = false): (List[Document.Node.Name], List[Document.Node.Name]) = |
|
278 |
{ |
|
68923 | 279 |
val nodes = |
280 |
if (all) None |
|
281 |
else Some(theories.map(resources.import_name(qualifier, master_directory(master_dir), _))) |
|
68915 | 282 |
resources.purge_theories(session, nodes) |
283 |
} |
|
67063 | 284 |
} |
285 |
||
67061
2efa25302f34
synchronous session start (similar to isabelle.vscode.Server);
wenzelm
parents:
67059
diff
changeset
|
286 |
|
67054 | 287 |
|
69012 | 288 |
/** resources **/ |
68922 | 289 |
|
69012 | 290 |
object Resources |
291 |
{ |
|
69536 | 292 |
def apply(base_info: Sessions.Base_Info, log: Logger = No_Logger): Resources = |
293 |
new Resources(base_info, log = log) |
|
294 |
||
295 |
def make( |
|
296 |
options: Options, |
|
297 |
session_name: String, |
|
298 |
session_dirs: List[Path] = Nil, |
|
299 |
include_sessions: List[String] = Nil, |
|
300 |
progress: Progress = No_Progress, |
|
301 |
log: Logger = No_Logger): Resources = |
|
302 |
{ |
|
303 |
val base_info = |
|
304 |
Sessions.base_info(options, session_name, dirs = session_dirs, |
|
305 |
include_sessions = include_sessions, progress = progress) |
|
306 |
apply(base_info, log = log) |
|
307 |
} |
|
308 |
||
69012 | 309 |
final class Theory private[Headless]( |
310 |
val node_name: Document.Node.Name, |
|
311 |
val node_header: Document.Node.Header, |
|
312 |
val text: String, |
|
313 |
val node_required: Boolean) |
|
68922 | 314 |
{ |
69012 | 315 |
override def toString: String = node_name.toString |
68922 | 316 |
|
69012 | 317 |
def node_perspective: Document.Node.Perspective_Text = |
318 |
Document.Node.Perspective(node_required, Text.Perspective.empty, Document.Node.Overlays.empty) |
|
68922 | 319 |
|
69012 | 320 |
def make_edits(text_edits: List[Text.Edit]): List[Document.Edit_Text] = |
321 |
List(node_name -> Document.Node.Deps(node_header), |
|
322 |
node_name -> Document.Node.Edits(text_edits), |
|
323 |
node_name -> node_perspective) |
|
68922 | 324 |
|
69012 | 325 |
def node_edits(old: Option[Theory]): List[Document.Edit_Text] = |
326 |
{ |
|
327 |
val (text_edits, old_required) = |
|
328 |
if (old.isEmpty) (Text.Edit.inserts(0, text), false) |
|
329 |
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
|
330 |
|
69012 | 331 |
if (text_edits.isEmpty && node_required == old_required) Nil |
332 |
else make_edits(text_edits) |
|
333 |
} |
|
67887
a4d5342898b1
unload_theories: actually observe required state;
wenzelm
parents:
67885
diff
changeset
|
334 |
|
69012 | 335 |
def purge_edits: List[Document.Edit_Text] = |
336 |
make_edits(Text.Edit.removes(0, text)) |
|
67936 | 337 |
|
69012 | 338 |
def required(required: Boolean): Theory = |
339 |
if (required == node_required) this |
|
340 |
else new Theory(node_name, node_header, text, required) |
|
67936 | 341 |
} |
342 |
||
69012 | 343 |
sealed case class State( |
69458 | 344 |
required: Multi_Map[Document.Node.Name, UUID.T] = Multi_Map.empty, |
69012 | 345 |
theories: Map[Document.Node.Name, Theory] = Map.empty) |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
346 |
{ |
69012 | 347 |
lazy val theory_graph: Graph[Document.Node.Name, Unit] = |
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
348 |
{ |
69012 | 349 |
val entries = |
350 |
for ((name, theory) <- theories.toList) |
|
351 |
yield ((name, ()), theory.node_header.imports.map(_._1).filter(theories.isDefinedAt(_))) |
|
352 |
Graph.make(entries, symmetric = true)(Document.Node.Name.Ordering) |
|
67888 | 353 |
} |
67056 | 354 |
|
69012 | 355 |
def is_required(name: Document.Node.Name): Boolean = required.isDefinedAt(name) |
356 |
||
69458 | 357 |
def insert_required(id: UUID.T, names: List[Document.Node.Name]): State = |
69012 | 358 |
copy(required = (required /: names)(_.insert(_, id))) |
359 |
||
69458 | 360 |
def remove_required(id: UUID.T, names: List[Document.Node.Name]): State = |
69012 | 361 |
copy(required = (required /: names)(_.remove(_, id))) |
68958 | 362 |
|
69012 | 363 |
def update_theories(update: List[(Document.Node.Name, Theory)]): State = |
364 |
copy(theories = |
|
365 |
(theories /: update)({ case (thys, (name, thy)) => |
|
366 |
thys.get(name) match { |
|
367 |
case Some(thy1) if thy1 == thy => thys |
|
368 |
case _ => thys + (name -> thy) |
|
369 |
} |
|
370 |
})) |
|
371 |
||
372 |
def remove_theories(remove: List[Document.Node.Name]): State = |
|
67893 | 373 |
{ |
69012 | 374 |
require(remove.forall(name => !is_required(name))) |
375 |
copy(theories = theories -- remove) |
|
376 |
} |
|
377 |
||
69458 | 378 |
def unload_theories(session: Session, id: UUID.T, dep_theories: List[Document.Node.Name]) |
379 |
: State = |
|
69012 | 380 |
{ |
381 |
val st1 = remove_required(id, dep_theories) |
|
67893 | 382 |
val theory_edits = |
69012 | 383 |
for { |
384 |
node_name <- dep_theories |
|
385 |
theory <- st1.theories.get(node_name) |
|
386 |
} |
|
67893 | 387 |
yield { |
388 |
val theory1 = theory.required(st1.is_required(node_name)) |
|
69012 | 389 |
val edits = theory1.node_edits(Some(theory)) |
67893 | 390 |
(edits, (node_name, theory1)) |
391 |
} |
|
392 |
session.update(Document.Blobs.empty, theory_edits.flatMap(_._1)) |
|
393 |
st1.update_theories(theory_edits.map(_._2)) |
|
69012 | 394 |
} |
395 |
||
396 |
def purge_theories(session: Session, nodes: List[Document.Node.Name]) |
|
397 |
: ((List[Document.Node.Name], List[Document.Node.Name]), State) = |
|
398 |
{ |
|
399 |
val all_nodes = theory_graph.topological_order |
|
400 |
val purge = nodes.filterNot(is_required(_)).toSet |
|
401 |
||
402 |
val retain = theory_graph.all_preds(all_nodes.filterNot(purge)).toSet |
|
403 |
val (retained, purged) = all_nodes.partition(retain) |
|
404 |
||
405 |
val purge_edits = purged.flatMap(name => theories(name).purge_edits) |
|
406 |
session.update(Document.Blobs.empty, purge_edits) |
|
407 |
||
408 |
((purged, retained), remove_theories(purged)) |
|
409 |
} |
|
67884
43af581d7d8e
unload_theories after consolidation -- reset node_required;
wenzelm
parents:
67883
diff
changeset
|
410 |
|
69012 | 411 |
def frontier_theories(clean: Set[Document.Node.Name]): Set[Document.Node.Name] = |
412 |
{ |
|
413 |
@tailrec def frontier(base: List[Document.Node.Name], front: Set[Document.Node.Name]) |
|
414 |
: Set[Document.Node.Name] = |
|
415 |
{ |
|
416 |
val add = base.filter(b => theory_graph.imm_succs(b).forall(front)) |
|
417 |
if (add.isEmpty) front |
|
418 |
else { |
|
419 |
val pre_add = add.map(theory_graph.imm_preds) |
|
420 |
val base1 = (pre_add.head /: pre_add.tail)(_ ++ _).toList.filter(clean) |
|
421 |
frontier(base1, front ++ add) |
|
422 |
} |
|
423 |
} |
|
424 |
frontier(theory_graph.maximals.filter(clean), Set.empty) |
|
425 |
} |
|
426 |
} |
|
68936
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
427 |
} |
90c08c7bab9c
continuously clean frontier of already committed theories: much less resource requirements;
wenzelm
parents:
68935
diff
changeset
|
428 |
|
69536 | 429 |
class Resources private[Headless]( |
430 |
val session_base_info: Sessions.Base_Info, |
|
431 |
log: Logger = No_Logger) |
|
432 |
extends isabelle.Resources(session_base_info.check_base, log = log) |
|
67884
43af581d7d8e
unload_theories after consolidation -- reset node_required;
wenzelm
parents:
67883
diff
changeset
|
433 |
{ |
69012 | 434 |
resources => |
435 |
||
69536 | 436 |
|
437 |
/* session */ |
|
438 |
||
439 |
def start_session(print_mode: List[String] = Nil, progress: Progress = No_Progress): Session = |
|
440 |
{ |
|
441 |
val options = session_base_info.options |
|
442 |
val session = new Session(session_base_info.session, options, resources) |
|
443 |
||
444 |
val session_error = Future.promise[String] |
|
445 |
var session_phase: Session.Consumer[Session.Phase] = null |
|
446 |
session_phase = |
|
447 |
Session.Consumer(getClass.getName) { |
|
448 |
case Session.Ready => |
|
449 |
session.phase_changed -= session_phase |
|
450 |
session_error.fulfill("") |
|
451 |
case Session.Terminated(result) if !result.ok => |
|
452 |
session.phase_changed -= session_phase |
|
453 |
session_error.fulfill("Session start failed: return code " + result.rc) |
|
454 |
case _ => |
|
455 |
} |
|
456 |
session.phase_changed += session_phase |
|
457 |
||
458 |
progress.echo("Starting session " + session_base_info.session + " ...") |
|
459 |
Isabelle_Process.start(session, options, |
|
460 |
logic = session_base_info.session, dirs = session_base_info.dirs, modes = print_mode) |
|
461 |
||
462 |
session_error.join match { |
|
463 |
case "" => session |
|
464 |
case msg => session.stop(); error(msg) |
|
465 |
} |
|
466 |
} |
|
467 |
||
468 |
||
469 |
/* theories */ |
|
470 |
||
69012 | 471 |
private val state = Synchronized(Resources.State()) |
472 |
||
473 |
def load_theories( |
|
474 |
session: Session, |
|
69458 | 475 |
id: UUID.T, |
69012 | 476 |
dep_theories: List[Document.Node.Name], |
477 |
progress: Progress) |
|
478 |
{ |
|
479 |
val loaded_theories = |
|
480 |
for (node_name <- dep_theories) |
|
481 |
yield { |
|
482 |
val path = node_name.path |
|
483 |
if (!node_name.is_theory) error("Not a theory file: " + path) |
|
484 |
||
485 |
progress.expose_interrupt() |
|
486 |
val text = File.read(path) |
|
487 |
val node_header = resources.check_thy_reader(node_name, Scan.char_reader(text)) |
|
488 |
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
|
489 |
} |
69012 | 490 |
|
491 |
val loaded = loaded_theories.length |
|
492 |
if (loaded > 1) progress.echo("Loading " + loaded + " theories ...") |
|
493 |
||
494 |
state.change(st => |
|
495 |
{ |
|
496 |
val st1 = st.insert_required(id, dep_theories) |
|
497 |
val theory_edits = |
|
498 |
for (theory <- loaded_theories) |
|
499 |
yield { |
|
500 |
val node_name = theory.node_name |
|
501 |
val theory1 = theory.required(st1.is_required(node_name)) |
|
502 |
val edits = theory1.node_edits(st1.theories.get(node_name)) |
|
503 |
(edits, (node_name, theory1)) |
|
504 |
} |
|
505 |
session.update(Document.Blobs.empty, theory_edits.flatMap(_._1)) |
|
506 |
st1.update_theories(theory_edits.map(_._2)) |
|
507 |
}) |
|
508 |
} |
|
67936 | 509 |
|
69458 | 510 |
def unload_theories(session: Session, id: UUID.T, dep_theories: List[Document.Node.Name]) |
69012 | 511 |
{ |
512 |
state.change(_.unload_theories(session, id, dep_theories)) |
|
513 |
} |
|
514 |
||
69458 | 515 |
def clean_theories(session: Session, id: UUID.T, clean: Set[Document.Node.Name]) |
69012 | 516 |
{ |
517 |
state.change(st => |
|
518 |
{ |
|
519 |
val frontier = st.frontier_theories(clean).toList |
|
520 |
if (frontier.isEmpty) st |
|
521 |
else { |
|
522 |
val st1 = st.unload_theories(session, id, frontier) |
|
523 |
val (_, st2) = st1.purge_theories(session, frontier) |
|
524 |
st2 |
|
525 |
} |
|
526 |
}) |
|
527 |
} |
|
528 |
||
529 |
def purge_theories(session: Session, nodes: Option[List[Document.Node.Name]]) |
|
530 |
: (List[Document.Node.Name], List[Document.Node.Name]) = |
|
531 |
{ |
|
532 |
state.change_result(st => st.purge_theories(session, nodes getOrElse st.theory_graph.keys)) |
|
533 |
} |
|
67936 | 534 |
} |
67054 | 535 |
} |