berghofe@3604
|
1 |
(* Title: Pure/Thy/thy_info.ML
|
berghofe@3604
|
2 |
ID: $Id$
|
wenzelm@6211
|
3 |
Author: Markus Wenzel, TU Muenchen
|
berghofe@3604
|
4 |
|
wenzelm@6362
|
5 |
Theory loader database, including theory and file dependencies.
|
wenzelm@3976
|
6 |
*)
|
berghofe@3604
|
7 |
|
wenzelm@5209
|
8 |
signature BASIC_THY_INFO =
|
wenzelm@5209
|
9 |
sig
|
wenzelm@5209
|
10 |
val theory: string -> theory
|
wenzelm@6211
|
11 |
val theory_of_sign: Sign.sg -> theory
|
wenzelm@6211
|
12 |
val theory_of_thm: thm -> theory
|
wenzelm@6241
|
13 |
(*val use: string -> unit*) (*exported later*)
|
wenzelm@6241
|
14 |
val time_use: string -> unit
|
wenzelm@6211
|
15 |
val touch_thy: string -> unit
|
wenzelm@6211
|
16 |
val use_thy: string -> unit
|
wenzelm@6211
|
17 |
val update_thy: string -> unit
|
wenzelm@6666
|
18 |
val remove_thy: string -> unit
|
wenzelm@6211
|
19 |
val time_use_thy: string -> unit
|
wenzelm@6527
|
20 |
val use_thy_only: string -> unit
|
wenzelm@7099
|
21 |
val update_thy_only: string -> unit
|
wenzelm@6211
|
22 |
end;
|
wenzelm@5209
|
23 |
|
berghofe@3604
|
24 |
signature THY_INFO =
|
berghofe@3604
|
25 |
sig
|
wenzelm@5209
|
26 |
include BASIC_THY_INFO
|
wenzelm@7099
|
27 |
datatype action = Update | Outdate | Remove
|
wenzelm@7099
|
28 |
val str_of_action: action -> string
|
wenzelm@7099
|
29 |
val add_hook: (action -> string -> unit) -> unit
|
wenzelm@6211
|
30 |
val names: unit -> string list
|
wenzelm@7910
|
31 |
val known_thy: string -> bool
|
wenzelm@7935
|
32 |
val check_known_thy: string -> bool
|
wenzelm@7935
|
33 |
val if_known_thy: (string -> unit) -> string -> unit
|
wenzelm@7288
|
34 |
val lookup_theory: string -> theory option
|
wenzelm@6211
|
35 |
val get_theory: string -> theory
|
berghofe@6654
|
36 |
val get_preds: string -> string list
|
wenzelm@7935
|
37 |
val loaded_files: string -> Path.T list
|
wenzelm@7910
|
38 |
val touch_child_thys: string -> unit
|
wenzelm@7099
|
39 |
val touch_all_thys: unit -> unit
|
wenzelm@7244
|
40 |
val may_load_file: bool -> bool -> Path.T -> unit
|
wenzelm@6329
|
41 |
val use_path: Path.T -> unit
|
wenzelm@6241
|
42 |
val use: string -> unit
|
wenzelm@7191
|
43 |
val pretend_use: string -> unit
|
wenzelm@7244
|
44 |
val quiet_update_thy: string -> unit
|
wenzelm@6329
|
45 |
val begin_theory: string -> string list -> (Path.T * bool) list -> theory
|
wenzelm@7244
|
46 |
val begin_update_theory: string -> string list -> (Path.T * bool) list -> theory
|
wenzelm@6211
|
47 |
val end_theory: theory -> theory
|
wenzelm@6666
|
48 |
val finish: unit -> unit
|
wenzelm@6211
|
49 |
val register_theory: theory -> unit
|
berghofe@3604
|
50 |
end;
|
berghofe@3604
|
51 |
|
wenzelm@6362
|
52 |
structure ThyInfo: THY_INFO =
|
berghofe@3604
|
53 |
struct
|
berghofe@3604
|
54 |
|
berghofe@3604
|
55 |
|
wenzelm@7099
|
56 |
(** theory loader actions and hooks **)
|
wenzelm@7099
|
57 |
|
wenzelm@7099
|
58 |
datatype action = Update | Outdate | Remove;
|
wenzelm@7099
|
59 |
val str_of_action = fn Update => "Update" | Outdate => "Outdate" | Remove => "Remove";
|
wenzelm@7099
|
60 |
|
wenzelm@7099
|
61 |
local
|
wenzelm@7099
|
62 |
val hooks = ref ([]: (action -> string -> unit) list);
|
wenzelm@7099
|
63 |
in
|
wenzelm@7099
|
64 |
fun add_hook f = hooks := f :: ! hooks;
|
wenzelm@7191
|
65 |
fun perform action name = seq (fn f => (try (fn () => f action name) (); ())) (! hooks);
|
wenzelm@7099
|
66 |
end;
|
wenzelm@7099
|
67 |
|
wenzelm@7099
|
68 |
|
wenzelm@7099
|
69 |
|
wenzelm@6211
|
70 |
(** thy database **)
|
wenzelm@3976
|
71 |
|
wenzelm@6211
|
72 |
(* messages *)
|
berghofe@3604
|
73 |
|
wenzelm@6211
|
74 |
fun gen_msg txt [] = txt
|
wenzelm@6211
|
75 |
| gen_msg txt names = txt ^ " " ^ commas_quote names;
|
berghofe@3604
|
76 |
|
wenzelm@6211
|
77 |
fun loader_msg txt names = gen_msg ("Theory loader: " ^ txt) names;
|
berghofe@3604
|
78 |
|
wenzelm@6211
|
79 |
val show_path = space_implode " via " o map quote;
|
wenzelm@6211
|
80 |
fun cycle_msg name names = loader_msg ("cyclic dependency of " ^ show_path (name :: names)) [];
|
berghofe@3604
|
81 |
|
berghofe@3604
|
82 |
|
wenzelm@6666
|
83 |
(* derived graph operations *)
|
berghofe@3604
|
84 |
|
wenzelm@6211
|
85 |
fun add_deps name parents G =
|
wenzelm@6211
|
86 |
foldl (fn (H, parent) => Graph.add_edge_acyclic (parent, name) H) (G, parents)
|
wenzelm@6211
|
87 |
handle Graph.CYCLES namess => error (cat_lines (map (cycle_msg name) namess));
|
berghofe@3604
|
88 |
|
wenzelm@6666
|
89 |
fun del_deps name G =
|
wenzelm@6211
|
90 |
foldl (fn (H, parent) => Graph.del_edge (parent, name) H) (G, Graph.imm_preds G name);
|
berghofe@3604
|
91 |
|
wenzelm@6211
|
92 |
fun update_node name parents entry G =
|
wenzelm@6211
|
93 |
add_deps name parents
|
wenzelm@6211
|
94 |
(if can (Graph.get_node G) name then del_deps name G else Graph.new_node (name, entry) G);
|
berghofe@3604
|
95 |
|
berghofe@3604
|
96 |
|
wenzelm@6211
|
97 |
(* thy database *)
|
berghofe@3604
|
98 |
|
wenzelm@6211
|
99 |
type deps =
|
wenzelm@6211
|
100 |
{present: bool, outdated: bool,
|
wenzelm@7267
|
101 |
master: ThyLoad.master option, files: (Path.T * ((Path.T * File.info) * bool) option) list};
|
berghofe@3604
|
102 |
|
wenzelm@6241
|
103 |
fun make_deps present outdated master files =
|
wenzelm@6241
|
104 |
{present = present, outdated = outdated, master = master, files = files}: deps;
|
berghofe@3604
|
105 |
|
wenzelm@7211
|
106 |
fun init_deps master files = Some (make_deps false true master (map (rpair None) files));
|
wenzelm@7211
|
107 |
|
wenzelm@7211
|
108 |
|
wenzelm@6362
|
109 |
type thy = deps option * theory option;
|
berghofe@3604
|
110 |
|
wenzelm@6211
|
111 |
local
|
wenzelm@6362
|
112 |
val database = ref (Graph.empty: thy Graph.T);
|
wenzelm@6211
|
113 |
in
|
wenzelm@6362
|
114 |
fun get_thys () = ! database;
|
wenzelm@6362
|
115 |
fun change_thys f = database := (f (! database));
|
berghofe@3604
|
116 |
end;
|
wenzelm@5209
|
117 |
|
wenzelm@5209
|
118 |
|
wenzelm@6211
|
119 |
(* access thy graph *)
|
wenzelm@6211
|
120 |
|
wenzelm@6211
|
121 |
fun thy_graph f x = f (get_thys ()) x;
|
wenzelm@6666
|
122 |
fun get_names () = Graph.keys (get_thys ());
|
wenzelm@6211
|
123 |
|
wenzelm@6211
|
124 |
|
wenzelm@6211
|
125 |
(* access thy *)
|
wenzelm@6211
|
126 |
|
wenzelm@7935
|
127 |
fun lookup_thy name =
|
wenzelm@7935
|
128 |
Some (thy_graph Graph.get_node name) handle Graph.UNDEFINED _ => None;
|
wenzelm@7935
|
129 |
|
wenzelm@7910
|
130 |
val known_thy = is_some o lookup_thy;
|
wenzelm@7935
|
131 |
fun check_known_thy name = known_thy name orelse (warning ("Unknown theory " ^ quote name); false);
|
wenzelm@7935
|
132 |
fun if_known_thy f name = if check_known_thy name then f name else ();
|
wenzelm@6211
|
133 |
|
wenzelm@6211
|
134 |
fun get_thy name =
|
wenzelm@6211
|
135 |
(case lookup_thy name of
|
wenzelm@6211
|
136 |
Some thy => thy
|
wenzelm@6211
|
137 |
| None => error (loader_msg "nothing known about theory" [name]));
|
wenzelm@6211
|
138 |
|
wenzelm@6211
|
139 |
fun change_thy name f = (get_thy name; change_thys (Graph.map_node name f));
|
wenzelm@6211
|
140 |
|
wenzelm@6211
|
141 |
|
wenzelm@6211
|
142 |
(* access deps *)
|
wenzelm@6211
|
143 |
|
wenzelm@6211
|
144 |
val lookup_deps = apsome #1 o lookup_thy;
|
wenzelm@6211
|
145 |
val get_deps = #1 o get_thy;
|
wenzelm@6211
|
146 |
fun change_deps name f = change_thy name (fn (deps, x) => (f deps, x));
|
wenzelm@6211
|
147 |
|
wenzelm@6666
|
148 |
fun is_finished name = is_none (get_deps name);
|
wenzelm@6211
|
149 |
fun get_files name = (case get_deps name of Some {files, ...} => files | _ => []);
|
wenzelm@7191
|
150 |
|
wenzelm@7191
|
151 |
fun loaded_files name =
|
wenzelm@7191
|
152 |
(case get_deps name of
|
wenzelm@7935
|
153 |
None => []
|
wenzelm@7910
|
154 |
| Some {master, files, ...} =>
|
wenzelm@7935
|
155 |
(case master of Some m => [#1 (ThyLoad.get_thy m)] | None => []) @
|
wenzelm@7935
|
156 |
map (#1 o #1) (mapfilter #2 files));
|
wenzelm@6211
|
157 |
|
berghofe@6654
|
158 |
fun get_preds name =
|
berghofe@6654
|
159 |
(thy_graph Graph.imm_preds name) handle Graph.UNDEFINED _ =>
|
berghofe@6654
|
160 |
error (loader_msg "nothing known about theory" [name]);
|
berghofe@6654
|
161 |
|
wenzelm@6211
|
162 |
|
wenzelm@6211
|
163 |
(* access theory *)
|
wenzelm@6211
|
164 |
|
wenzelm@7687
|
165 |
fun lookup_theory name =
|
wenzelm@7687
|
166 |
(case lookup_thy name of
|
wenzelm@7687
|
167 |
Some (_, Some thy) => Some thy
|
wenzelm@7687
|
168 |
| _ => None);
|
wenzelm@7288
|
169 |
|
wenzelm@6211
|
170 |
fun get_theory name =
|
wenzelm@7288
|
171 |
(case lookup_theory name of
|
wenzelm@7288
|
172 |
(Some theory) => theory
|
wenzelm@6211
|
173 |
| _ => error (loader_msg "undefined theory entry for" [name]));
|
wenzelm@6211
|
174 |
|
wenzelm@6211
|
175 |
val theory_of_sign = get_theory o Sign.name_of;
|
wenzelm@6211
|
176 |
val theory_of_thm = theory_of_sign o Thm.sign_of_thm;
|
wenzelm@6211
|
177 |
|
wenzelm@7099
|
178 |
fun put_theory name theory = change_thy name (fn (deps, _) => (deps, Some theory));
|
wenzelm@6211
|
179 |
|
wenzelm@6211
|
180 |
|
wenzelm@6211
|
181 |
|
wenzelm@6211
|
182 |
(** thy operations **)
|
wenzelm@6211
|
183 |
|
wenzelm@6241
|
184 |
(* maintain 'outdated' flag *)
|
wenzelm@6211
|
185 |
|
wenzelm@7099
|
186 |
local
|
wenzelm@7099
|
187 |
|
wenzelm@6241
|
188 |
fun is_outdated name =
|
wenzelm@6241
|
189 |
(case lookup_deps name of
|
wenzelm@6241
|
190 |
Some (Some {outdated, ...}) => outdated
|
wenzelm@6241
|
191 |
| _ => false);
|
wenzelm@6211
|
192 |
|
wenzelm@6241
|
193 |
fun outdate_thy name =
|
wenzelm@7099
|
194 |
if is_finished name orelse is_outdated name then ()
|
wenzelm@7099
|
195 |
else (change_deps name (apsome (fn {present, outdated = _, master, files} =>
|
wenzelm@7099
|
196 |
make_deps present true master files)); perform Outdate name);
|
wenzelm@7099
|
197 |
|
wenzelm@7910
|
198 |
fun check_unfinished name =
|
wenzelm@7910
|
199 |
if is_finished name then (warning (loader_msg "tried to touch finished theory" [name]); None)
|
wenzelm@7910
|
200 |
else Some name;
|
wenzelm@7910
|
201 |
|
wenzelm@7099
|
202 |
in
|
wenzelm@6211
|
203 |
|
wenzelm@7910
|
204 |
fun touch_thys names =
|
wenzelm@7910
|
205 |
seq outdate_thy (thy_graph Graph.all_succs (mapfilter check_unfinished names));
|
wenzelm@7910
|
206 |
|
wenzelm@7910
|
207 |
fun touch_thy name = touch_thys [name];
|
wenzelm@7910
|
208 |
fun touch_child_thys name = touch_thys (thy_graph Graph.imm_succs name);
|
wenzelm@6241
|
209 |
|
wenzelm@7099
|
210 |
fun touch_all_thys () = seq outdate_thy (get_names ());
|
wenzelm@6211
|
211 |
|
wenzelm@7099
|
212 |
end;
|
wenzelm@6211
|
213 |
|
wenzelm@6211
|
214 |
|
wenzelm@7244
|
215 |
(* check 'finished' state *)
|
wenzelm@7244
|
216 |
|
wenzelm@7244
|
217 |
fun check_unfinished fail name =
|
wenzelm@7910
|
218 |
if known_thy name andalso is_finished name then
|
wenzelm@7288
|
219 |
fail (loader_msg "cannot update finished theory" [name])
|
wenzelm@7244
|
220 |
else ();
|
wenzelm@7244
|
221 |
|
wenzelm@7244
|
222 |
|
wenzelm@7244
|
223 |
(* may_load_file *)
|
wenzelm@6211
|
224 |
|
wenzelm@7191
|
225 |
local
|
wenzelm@7191
|
226 |
|
wenzelm@7191
|
227 |
fun may_run_file really path =
|
wenzelm@6211
|
228 |
let
|
wenzelm@7191
|
229 |
val load = ThyLoad.may_load_file really;
|
wenzelm@6211
|
230 |
fun provide name info (deps as Some {present, outdated, master, files}) =
|
wenzelm@7910
|
231 |
(if exists (equal path o #1) files then ()
|
wenzelm@7910
|
232 |
else warning (loader_msg "undeclared dependency of theory" [name] ^
|
wenzelm@7910
|
233 |
" on file: " ^ quote (Path.pack path));
|
wenzelm@7267
|
234 |
Some (make_deps present outdated master
|
wenzelm@7910
|
235 |
(overwrite (files, (path, Some (info, really))))))
|
wenzelm@6211
|
236 |
| provide _ _ None = None;
|
wenzelm@6211
|
237 |
in
|
wenzelm@6211
|
238 |
(case apsome PureThy.get_name (Context.get_context ()) of
|
wenzelm@7191
|
239 |
None => (load path; ())
|
wenzelm@6211
|
240 |
| Some name =>
|
wenzelm@7910
|
241 |
if known_thy name then change_deps name (provide name (load path))
|
wenzelm@7191
|
242 |
else (load path; ()))
|
wenzelm@6211
|
243 |
end;
|
wenzelm@6211
|
244 |
|
wenzelm@7191
|
245 |
in
|
wenzelm@7191
|
246 |
|
wenzelm@7244
|
247 |
fun may_load_file really time path =
|
wenzelm@7244
|
248 |
if really andalso time then
|
wenzelm@7244
|
249 |
let val name = Path.pack path in
|
wenzelm@7244
|
250 |
timeit (fn () =>
|
wenzelm@7244
|
251 |
(writeln ("\n**** Starting file " ^ quote name ^ " ****");
|
wenzelm@7244
|
252 |
may_run_file really path;
|
wenzelm@7244
|
253 |
writeln ("**** Finished file " ^ quote name ^ " ****\n")))
|
wenzelm@7244
|
254 |
end
|
wenzelm@7244
|
255 |
else may_run_file really path;
|
wenzelm@7191
|
256 |
|
wenzelm@7191
|
257 |
end;
|
wenzelm@6233
|
258 |
|
wenzelm@7244
|
259 |
val use_path = may_load_file true false;
|
wenzelm@7244
|
260 |
val use = use_path o Path.unpack;
|
wenzelm@7244
|
261 |
val time_use = may_load_file true true o Path.unpack;
|
wenzelm@7244
|
262 |
val pretend_use = may_load_file false false o Path.unpack;
|
wenzelm@7244
|
263 |
|
wenzelm@6233
|
264 |
|
wenzelm@7099
|
265 |
(* load_thy *)
|
wenzelm@7099
|
266 |
|
wenzelm@7099
|
267 |
fun required_by [] = ""
|
wenzelm@7099
|
268 |
| required_by initiators = " (required by " ^ show_path (rev initiators) ^ ")";
|
wenzelm@7099
|
269 |
|
wenzelm@7099
|
270 |
fun load_thy ml time initiators dir name parents =
|
wenzelm@7099
|
271 |
let
|
wenzelm@7099
|
272 |
val _ = writeln ("Loading theory " ^ quote name ^ required_by initiators);
|
wenzelm@7099
|
273 |
|
wenzelm@7099
|
274 |
val _ = touch_thy name;
|
wenzelm@7099
|
275 |
val master = ThyLoad.load_thy dir name ml time;
|
wenzelm@7099
|
276 |
|
wenzelm@7099
|
277 |
val files = get_files name;
|
wenzelm@7099
|
278 |
val missing_files = mapfilter (fn (path, None) => Some (Path.pack path) | _ => None) files;
|
wenzelm@7099
|
279 |
in
|
wenzelm@7099
|
280 |
if null missing_files then ()
|
wenzelm@7099
|
281 |
else warning (loader_msg "unresolved dependencies of theory" [name] ^
|
wenzelm@7223
|
282 |
" on file(s): " ^ commas_quote missing_files);
|
wenzelm@7191
|
283 |
change_deps name (fn _ => Some (make_deps true false (Some master) files));
|
wenzelm@7099
|
284 |
perform Update name
|
wenzelm@7099
|
285 |
end;
|
wenzelm@7099
|
286 |
|
wenzelm@7099
|
287 |
|
wenzelm@6211
|
288 |
(* require_thy *)
|
wenzelm@6211
|
289 |
|
wenzelm@7211
|
290 |
local
|
wenzelm@6211
|
291 |
|
wenzelm@7191
|
292 |
fun load_deps dir name =
|
wenzelm@7191
|
293 |
let val (master, (parents, files)) = ThyLoad.deps_thy dir name
|
wenzelm@7191
|
294 |
in (Some (init_deps (Some master) files), parents) end;
|
wenzelm@6211
|
295 |
|
wenzelm@6211
|
296 |
fun file_current (_, None) = false
|
wenzelm@7267
|
297 |
| file_current (path, info) = (apsome fst info = ThyLoad.check_file path);
|
wenzelm@6211
|
298 |
|
wenzelm@7191
|
299 |
fun current_deps strict dir name =
|
wenzelm@6211
|
300 |
(case lookup_deps name of
|
wenzelm@7191
|
301 |
None => (false, load_deps dir name)
|
wenzelm@6211
|
302 |
| Some deps =>
|
wenzelm@6211
|
303 |
let val same_deps = (None, thy_graph Graph.imm_preds name) in
|
wenzelm@6211
|
304 |
(case deps of
|
wenzelm@6211
|
305 |
None => (true, same_deps)
|
wenzelm@6211
|
306 |
| Some {present, outdated, master, files} =>
|
wenzelm@6211
|
307 |
if present andalso not strict then (true, same_deps)
|
wenzelm@6211
|
308 |
else
|
wenzelm@7191
|
309 |
let val master' = Some (ThyLoad.check_thy dir name) in
|
wenzelm@7191
|
310 |
if master <> master' then (false, load_deps dir name)
|
wenzelm@6211
|
311 |
else (not outdated andalso forall file_current files, same_deps)
|
wenzelm@6211
|
312 |
end)
|
wenzelm@6211
|
313 |
end);
|
wenzelm@6211
|
314 |
|
wenzelm@7066
|
315 |
fun require_thy ml time strict keep_strict initiators prfx (visited, str) =
|
wenzelm@6211
|
316 |
let
|
wenzelm@7066
|
317 |
val path = Path.expand (Path.unpack str);
|
wenzelm@6484
|
318 |
val name = Path.pack (Path.base path);
|
wenzelm@7066
|
319 |
in
|
wenzelm@7589
|
320 |
if name mem_string initiators then error (cycle_msg name initiators) else ();
|
wenzelm@7066
|
321 |
if name mem_string visited then (visited, (true, name))
|
wenzelm@7066
|
322 |
else
|
wenzelm@7066
|
323 |
let
|
wenzelm@7066
|
324 |
val dir = Path.append prfx (Path.dir path);
|
wenzelm@7066
|
325 |
val req_parent =
|
wenzelm@7211
|
326 |
require_thy true time (strict andalso keep_strict) keep_strict (name :: initiators) dir;
|
wenzelm@6484
|
327 |
|
wenzelm@7191
|
328 |
val (current, (new_deps, parents)) = current_deps strict dir name handle ERROR =>
|
wenzelm@7099
|
329 |
error (loader_msg "the error(s) above occurred while examining theory" [name] ^
|
wenzelm@7066
|
330 |
(if null initiators then "" else "\n" ^ required_by initiators));
|
wenzelm@7066
|
331 |
val (visited', parent_results) = foldl_map req_parent (name :: visited, parents);
|
wenzelm@6211
|
332 |
|
wenzelm@7066
|
333 |
val result =
|
wenzelm@7066
|
334 |
if current andalso forall #1 parent_results then true
|
wenzelm@7066
|
335 |
else
|
wenzelm@7066
|
336 |
((case new_deps of
|
wenzelm@7099
|
337 |
Some deps => change_thys (update_node name parents (deps, None))
|
wenzelm@7066
|
338 |
| None => ());
|
wenzelm@7099
|
339 |
load_thy ml time initiators dir name parents;
|
wenzelm@7099
|
340 |
false);
|
wenzelm@7066
|
341 |
in (visited', (result, name)) end
|
wenzelm@7066
|
342 |
end;
|
wenzelm@6484
|
343 |
|
wenzelm@7066
|
344 |
fun gen_use_thy req s =
|
wenzelm@7066
|
345 |
let val (_, (_, name)) = req [] Path.current ([], s)
|
wenzelm@7066
|
346 |
in Context.context (get_theory name) end;
|
wenzelm@6211
|
347 |
|
wenzelm@7244
|
348 |
fun warn_finished f name = (check_unfinished warning name; f name);
|
wenzelm@7244
|
349 |
|
wenzelm@7211
|
350 |
in
|
wenzelm@7211
|
351 |
|
wenzelm@7244
|
352 |
val weak_use_thy = gen_use_thy (require_thy true false false false);
|
wenzelm@7244
|
353 |
val quiet_update_thy = gen_use_thy (require_thy true false true true);
|
wenzelm@7244
|
354 |
|
wenzelm@7244
|
355 |
val use_thy = warn_finished (gen_use_thy (require_thy true false true false));
|
wenzelm@7244
|
356 |
val time_use_thy = warn_finished (gen_use_thy (require_thy true true true false));
|
wenzelm@7244
|
357 |
val use_thy_only = warn_finished (gen_use_thy (require_thy false false true false));
|
wenzelm@7244
|
358 |
val update_thy = warn_finished (gen_use_thy (require_thy true false true true));
|
wenzelm@7244
|
359 |
val update_thy_only = warn_finished (gen_use_thy (require_thy false false true true));
|
wenzelm@6211
|
360 |
|
wenzelm@7211
|
361 |
end;
|
wenzelm@7211
|
362 |
|
wenzelm@6241
|
363 |
|
wenzelm@6666
|
364 |
(* remove_thy *)
|
wenzelm@6666
|
365 |
|
wenzelm@6666
|
366 |
fun remove_thy name =
|
wenzelm@7910
|
367 |
if is_finished name then error (loader_msg "cannot remove finished theory" [name])
|
wenzelm@6666
|
368 |
else
|
wenzelm@6666
|
369 |
let val succs = thy_graph Graph.all_succs [name] in
|
wenzelm@6666
|
370 |
writeln (loader_msg "removing" succs);
|
wenzelm@7191
|
371 |
seq (perform Remove) succs;
|
wenzelm@7191
|
372 |
change_thys (Graph.del_nodes succs)
|
wenzelm@6666
|
373 |
end;
|
wenzelm@6666
|
374 |
|
wenzelm@6666
|
375 |
|
wenzelm@7066
|
376 |
(* begin / end theory *)
|
wenzelm@6211
|
377 |
|
wenzelm@7244
|
378 |
fun gen_begin_theory check_thy name parents paths =
|
wenzelm@6211
|
379 |
let
|
wenzelm@7244
|
380 |
val _ = check_unfinished error name;
|
wenzelm@7244
|
381 |
val _ = (map Path.basic parents; seq check_thy parents);
|
wenzelm@6211
|
382 |
val theory = PureThy.begin_theory name (map get_theory parents);
|
wenzelm@7191
|
383 |
val _ = change_thys (update_node name parents (init_deps None [], Some theory));
|
wenzelm@6329
|
384 |
val use_paths = mapfilter (fn (x, true) => Some x | _ => None) paths;
|
wenzelm@6329
|
385 |
in Context.setmp (Some theory) (seq use_path) use_paths; theory end;
|
wenzelm@6211
|
386 |
|
wenzelm@7244
|
387 |
val begin_theory = gen_begin_theory weak_use_thy;
|
wenzelm@7244
|
388 |
val begin_update_theory = gen_begin_theory quiet_update_thy;
|
wenzelm@7244
|
389 |
|
wenzelm@6211
|
390 |
fun end_theory theory =
|
wenzelm@7099
|
391 |
let
|
wenzelm@7099
|
392 |
val theory' = PureThy.end_theory theory;
|
wenzelm@7099
|
393 |
val name = PureThy.get_name theory;
|
wenzelm@7099
|
394 |
in put_theory name theory'; theory' end;
|
wenzelm@6211
|
395 |
|
wenzelm@6211
|
396 |
|
wenzelm@6666
|
397 |
(* finish all theories *)
|
wenzelm@6211
|
398 |
|
wenzelm@6666
|
399 |
fun finish () = change_thys (Graph.map_nodes (fn (_, entry) => (None, entry)));
|
wenzelm@6211
|
400 |
|
wenzelm@6211
|
401 |
|
wenzelm@6211
|
402 |
(* register existing theories *)
|
wenzelm@6211
|
403 |
|
wenzelm@6211
|
404 |
fun register_theory theory =
|
wenzelm@6211
|
405 |
let
|
wenzelm@6211
|
406 |
val name = PureThy.get_name theory;
|
wenzelm@6211
|
407 |
val parents = Theory.parents_of theory;
|
wenzelm@6211
|
408 |
val parent_names = map PureThy.get_name parents;
|
wenzelm@6211
|
409 |
|
wenzelm@6211
|
410 |
fun err txt bads =
|
wenzelm@6211
|
411 |
error (loader_msg txt bads ^ "\n" ^ gen_msg "cannot register theory" [name]);
|
wenzelm@6211
|
412 |
|
wenzelm@6666
|
413 |
val nonfinished = filter_out is_finished parent_names;
|
wenzelm@6211
|
414 |
fun get_variant (x, y_name) =
|
wenzelm@6211
|
415 |
if Theory.eq_thy (x, get_theory y_name) then None
|
wenzelm@6211
|
416 |
else Some y_name;
|
wenzelm@6211
|
417 |
val variants = mapfilter get_variant (parents ~~ parent_names);
|
wenzelm@6211
|
418 |
|
wenzelm@6211
|
419 |
fun register G =
|
wenzelm@6362
|
420 |
(Graph.new_node (name, (None, Some theory)) G
|
wenzelm@6211
|
421 |
handle Graph.DUPLICATE _ => err "duplicate theory entry" [])
|
wenzelm@6211
|
422 |
|> add_deps name parent_names;
|
wenzelm@6211
|
423 |
in
|
wenzelm@6666
|
424 |
if not (null nonfinished) then err "non-finished parent theories" nonfinished
|
wenzelm@6211
|
425 |
else if not (null variants) then err "different versions of parent theories" variants
|
wenzelm@7099
|
426 |
else (change_thys register; perform Update name)
|
wenzelm@6211
|
427 |
end;
|
wenzelm@6211
|
428 |
|
wenzelm@6211
|
429 |
|
wenzelm@6211
|
430 |
(*final declarations of this structure*)
|
wenzelm@6211
|
431 |
val theory = get_theory;
|
wenzelm@6211
|
432 |
val names = get_names;
|
wenzelm@6211
|
433 |
|
wenzelm@6211
|
434 |
end;
|
wenzelm@6211
|
435 |
|
wenzelm@5209
|
436 |
structure BasicThyInfo: BASIC_THY_INFO = ThyInfo;
|
wenzelm@5209
|
437 |
open BasicThyInfo;
|