berghofe@11520
|
1 |
(* Title: Pure/codegen.ML
|
wenzelm@11539
|
2 |
Author: Stefan Berghofer, TU Muenchen
|
berghofe@11520
|
3 |
|
wenzelm@11539
|
4 |
Generic code generator.
|
berghofe@11520
|
5 |
*)
|
berghofe@11520
|
6 |
|
berghofe@11520
|
7 |
signature CODEGEN =
|
berghofe@11520
|
8 |
sig
|
wenzelm@32738
|
9 |
val quiet_mode : bool Unsynchronized.ref
|
berghofe@11520
|
10 |
val message : string -> unit
|
wenzelm@32738
|
11 |
val mode : string list Unsynchronized.ref
|
wenzelm@32738
|
12 |
val margin : int Unsynchronized.ref
|
berghofe@26974
|
13 |
val string_of : Pretty.T -> string
|
berghofe@26974
|
14 |
val str : string -> Pretty.T
|
berghofe@11520
|
15 |
|
berghofe@12452
|
16 |
datatype 'a mixfix =
|
berghofe@11520
|
17 |
Arg
|
berghofe@11520
|
18 |
| Ignore
|
berghofe@16769
|
19 |
| Module
|
berghofe@11520
|
20 |
| Pretty of Pretty.T
|
berghofe@12452
|
21 |
| Quote of 'a;
|
berghofe@11520
|
22 |
|
berghofe@16649
|
23 |
type deftab
|
berghofe@17144
|
24 |
type node
|
berghofe@16649
|
25 |
type codegr
|
berghofe@12452
|
26 |
type 'a codegen
|
berghofe@12452
|
27 |
|
berghofe@12452
|
28 |
val add_codegen: string -> term codegen -> theory -> theory
|
berghofe@12452
|
29 |
val add_tycodegen: string -> typ codegen -> theory -> theory
|
berghofe@15261
|
30 |
val add_preprocessor: (theory -> thm list -> thm list) -> theory -> theory
|
berghofe@15261
|
31 |
val preprocess: theory -> thm list -> thm list
|
berghofe@17549
|
32 |
val preprocess_term: theory -> term -> term
|
berghofe@11520
|
33 |
val print_codegens: theory -> unit
|
berghofe@17144
|
34 |
val generate_code: theory -> string list -> string -> (string * string) list ->
|
berghofe@17144
|
35 |
(string * string) list * codegr
|
berghofe@17144
|
36 |
val generate_code_i: theory -> string list -> string -> (string * term) list ->
|
berghofe@17144
|
37 |
(string * string) list * codegr
|
haftmann@22921
|
38 |
val assoc_const: string * (term mixfix list *
|
haftmann@22921
|
39 |
(string * string) list) -> theory -> theory
|
haftmann@22921
|
40 |
val assoc_const_i: (string * typ) * (term mixfix list *
|
haftmann@22921
|
41 |
(string * string) list) -> theory -> theory
|
haftmann@22921
|
42 |
val assoc_type: xstring * (typ mixfix list *
|
haftmann@22921
|
43 |
(string * string) list) -> theory -> theory
|
haftmann@22921
|
44 |
val get_assoc_code: theory -> string * typ ->
|
berghofe@16769
|
45 |
(term mixfix list * (string * string) list) option
|
berghofe@16769
|
46 |
val get_assoc_type: theory -> string ->
|
berghofe@16769
|
47 |
(typ mixfix list * (string * string) list) option
|
berghofe@17144
|
48 |
val codegen_error: codegr -> string -> string -> 'a
|
berghofe@16649
|
49 |
val invoke_codegen: theory -> deftab -> string -> string -> bool ->
|
haftmann@28537
|
50 |
term -> codegr -> Pretty.T * codegr
|
berghofe@16649
|
51 |
val invoke_tycodegen: theory -> deftab -> string -> string -> bool ->
|
haftmann@28537
|
52 |
typ -> codegr -> Pretty.T * codegr
|
berghofe@14858
|
53 |
val mk_id: string -> string
|
berghofe@17144
|
54 |
val mk_qual_id: string -> string * string -> string
|
haftmann@28537
|
55 |
val mk_const_id: string -> string -> codegr -> (string * string) * codegr
|
haftmann@28537
|
56 |
val get_const_id: codegr -> string -> string * string
|
haftmann@28537
|
57 |
val mk_type_id: string -> string -> codegr -> (string * string) * codegr
|
haftmann@28537
|
58 |
val get_type_id: codegr -> string -> string * string
|
haftmann@27398
|
59 |
val thyname_of_type: theory -> string -> string
|
haftmann@27398
|
60 |
val thyname_of_const: theory -> string -> string
|
berghofe@16649
|
61 |
val rename_terms: term list -> term list
|
berghofe@11520
|
62 |
val rename_term: term -> term
|
berghofe@15398
|
63 |
val new_names: term -> string list -> string list
|
berghofe@15398
|
64 |
val new_name: term -> string -> string
|
berghofe@17144
|
65 |
val if_library: 'a -> 'a -> 'a
|
berghofe@16649
|
66 |
val get_defn: theory -> deftab -> string -> typ ->
|
haftmann@32084
|
67 |
((typ * (string * thm)) * int option) option
|
wenzelm@24908
|
68 |
val is_instance: typ -> typ -> bool
|
berghofe@11520
|
69 |
val parens: Pretty.T -> Pretty.T
|
berghofe@11520
|
70 |
val mk_app: bool -> Pretty.T -> Pretty.T list -> Pretty.T
|
berghofe@25892
|
71 |
val mk_tuple: Pretty.T list -> Pretty.T
|
berghofe@25892
|
72 |
val mk_let: (Pretty.T * Pretty.T) list -> Pretty.T -> Pretty.T
|
berghofe@11520
|
73 |
val eta_expand: term -> term list -> int -> term
|
berghofe@14105
|
74 |
val strip_tname: string -> string
|
berghofe@13753
|
75 |
val mk_type: bool -> typ -> Pretty.T
|
berghofe@17144
|
76 |
val mk_term_of: codegr -> string -> bool -> typ -> Pretty.T
|
berghofe@17144
|
77 |
val mk_gen: codegr -> string -> bool -> string list -> string -> typ -> Pretty.T
|
wenzelm@32738
|
78 |
val test_fn: (int -> term list option) Unsynchronized.ref
|
bulwahn@35378
|
79 |
val test_term: Proof.context -> bool -> term -> int -> term list option * (bool list * bool)
|
wenzelm@32738
|
80 |
val eval_result: (unit -> term) Unsynchronized.ref
|
berghofe@17549
|
81 |
val eval_term: theory -> term -> term
|
haftmann@20599
|
82 |
val evaluation_conv: cterm -> thm
|
berghofe@12452
|
83 |
val parse_mixfix: (string -> 'a) -> string -> 'a mixfix list
|
haftmann@18102
|
84 |
val quotes_of: 'a mixfix list -> 'a list
|
haftmann@18281
|
85 |
val num_args_of: 'a mixfix list -> int
|
haftmann@18102
|
86 |
val replace_quotes: 'b list -> 'a mixfix list -> 'b mixfix list
|
berghofe@16649
|
87 |
val mk_deftab: theory -> deftab
|
haftmann@32063
|
88 |
val map_unfold: (simpset -> simpset) -> theory -> theory
|
haftmann@19341
|
89 |
val add_unfold: thm -> theory -> theory
|
haftmann@32063
|
90 |
val del_unfold: thm -> theory -> theory
|
berghofe@17549
|
91 |
|
berghofe@17144
|
92 |
val get_node: codegr -> string -> node
|
berghofe@17144
|
93 |
val add_edge: string * string -> codegr -> codegr
|
berghofe@17144
|
94 |
val add_edge_acyclic: string * string -> codegr -> codegr
|
berghofe@17144
|
95 |
val del_nodes: string list -> codegr -> codegr
|
berghofe@17144
|
96 |
val map_node: string -> (node -> node) -> codegr -> codegr
|
berghofe@17144
|
97 |
val new_node: string * node -> codegr -> codegr
|
haftmann@28227
|
98 |
|
haftmann@28227
|
99 |
val setup: theory -> theory
|
berghofe@11520
|
100 |
end;
|
berghofe@11520
|
101 |
|
berghofe@11520
|
102 |
structure Codegen : CODEGEN =
|
berghofe@11520
|
103 |
struct
|
berghofe@11520
|
104 |
|
wenzelm@32738
|
105 |
val quiet_mode = Unsynchronized.ref true;
|
berghofe@11520
|
106 |
fun message s = if !quiet_mode then () else writeln s;
|
berghofe@11520
|
107 |
|
wenzelm@33233
|
108 |
val mode = Unsynchronized.ref ([] : string list); (* FIXME proper functional argument *)
|
berghofe@13753
|
109 |
|
wenzelm@32738
|
110 |
val margin = Unsynchronized.ref 80;
|
berghofe@13886
|
111 |
|
wenzelm@37154
|
112 |
fun string_of p = Print_Mode.setmp [] (Pretty.string_of_margin (!margin)) p;
|
berghofe@26974
|
113 |
|
wenzelm@37154
|
114 |
val str = Print_Mode.setmp [] Pretty.str;
|
berghofe@26974
|
115 |
|
berghofe@11520
|
116 |
(**** Mixfix syntax ****)
|
berghofe@11520
|
117 |
|
berghofe@12452
|
118 |
datatype 'a mixfix =
|
berghofe@11520
|
119 |
Arg
|
berghofe@11520
|
120 |
| Ignore
|
berghofe@16769
|
121 |
| Module
|
berghofe@11520
|
122 |
| Pretty of Pretty.T
|
berghofe@12452
|
123 |
| Quote of 'a;
|
berghofe@11520
|
124 |
|
berghofe@11520
|
125 |
fun is_arg Arg = true
|
berghofe@11520
|
126 |
| is_arg Ignore = true
|
berghofe@11520
|
127 |
| is_arg _ = false;
|
berghofe@11520
|
128 |
|
berghofe@12452
|
129 |
fun quotes_of [] = []
|
berghofe@12452
|
130 |
| quotes_of (Quote q :: ms) = q :: quotes_of ms
|
berghofe@12452
|
131 |
| quotes_of (_ :: ms) = quotes_of ms;
|
berghofe@12452
|
132 |
|
berghofe@12452
|
133 |
fun args_of [] xs = ([], xs)
|
berghofe@12452
|
134 |
| args_of (Arg :: ms) (x :: xs) = apfst (cons x) (args_of ms xs)
|
berghofe@12452
|
135 |
| args_of (Ignore :: ms) (_ :: xs) = args_of ms xs
|
berghofe@12452
|
136 |
| args_of (_ :: ms) xs = args_of ms xs;
|
berghofe@11520
|
137 |
|
wenzelm@33325
|
138 |
fun num_args_of x = length (filter is_arg x);
|
berghofe@11520
|
139 |
|
berghofe@11520
|
140 |
|
berghofe@11520
|
141 |
(**** theory data ****)
|
berghofe@11520
|
142 |
|
berghofe@16649
|
143 |
(* preprocessed definition table *)
|
berghofe@16649
|
144 |
|
berghofe@16649
|
145 |
type deftab =
|
berghofe@16649
|
146 |
(typ * (* type of constant *)
|
berghofe@16649
|
147 |
(string * (* name of theory containing definition of constant *)
|
haftmann@32084
|
148 |
thm)) (* definition theorem *)
|
berghofe@16649
|
149 |
list Symtab.table;
|
berghofe@16649
|
150 |
|
berghofe@16649
|
151 |
(* code dependency graph *)
|
berghofe@16649
|
152 |
|
berghofe@17144
|
153 |
type nametab = (string * string) Symtab.table * unit Symtab.table;
|
berghofe@17144
|
154 |
|
haftmann@28227
|
155 |
fun merge_nametabs ((tab, used) : nametab, (tab', used')) =
|
berghofe@17144
|
156 |
(Symtab.merge op = (tab, tab'), Symtab.merge op = (used, used'));
|
berghofe@17144
|
157 |
|
berghofe@17144
|
158 |
type node =
|
berghofe@16649
|
159 |
(exn option * (* slot for arbitrary data *)
|
berghofe@16649
|
160 |
string * (* name of structure containing piece of code *)
|
berghofe@17144
|
161 |
string); (* piece of code *)
|
berghofe@17144
|
162 |
|
berghofe@17144
|
163 |
type codegr =
|
berghofe@17144
|
164 |
node Graph.T *
|
berghofe@17144
|
165 |
(nametab * (* table for assigned constant names *)
|
berghofe@17144
|
166 |
nametab); (* table for assigned type names *)
|
berghofe@17144
|
167 |
|
berghofe@17144
|
168 |
val emptygr : codegr = (Graph.empty,
|
berghofe@17144
|
169 |
((Symtab.empty, Symtab.empty), (Symtab.empty, Symtab.empty)));
|
berghofe@16649
|
170 |
|
berghofe@14105
|
171 |
(* type of code generators *)
|
berghofe@11520
|
172 |
|
berghofe@16649
|
173 |
type 'a codegen =
|
berghofe@16649
|
174 |
theory -> (* theory in which generate_code was called *)
|
berghofe@16649
|
175 |
deftab -> (* definition table (for efficiency) *)
|
berghofe@16649
|
176 |
string -> (* node name of caller (for recording dependencies) *)
|
berghofe@17144
|
177 |
string -> (* module name of caller (for modular code generation) *)
|
berghofe@16649
|
178 |
bool -> (* whether to parenthesize generated expression *)
|
berghofe@16649
|
179 |
'a -> (* item to generate code from *)
|
haftmann@28537
|
180 |
codegr -> (* code dependency graph *)
|
haftmann@28537
|
181 |
(Pretty.T * codegr) option;
|
berghofe@12452
|
182 |
|
wenzelm@22846
|
183 |
|
wenzelm@22846
|
184 |
(* theory data *)
|
wenzelm@16458
|
185 |
|
wenzelm@33522
|
186 |
structure CodegenData = Theory_Data
|
wenzelm@22846
|
187 |
(
|
berghofe@11520
|
188 |
type T =
|
berghofe@12452
|
189 |
{codegens : (string * term codegen) list,
|
berghofe@12452
|
190 |
tycodegens : (string * typ codegen) list,
|
berghofe@16769
|
191 |
consts : ((string * typ) * (term mixfix list * (string * string) list)) list,
|
berghofe@16769
|
192 |
types : (string * (typ mixfix list * (string * string) list)) list,
|
berghofe@15261
|
193 |
preprocs: (stamp * (theory -> thm list -> thm list)) list,
|
berghofe@28640
|
194 |
modules: codegr Symtab.table};
|
berghofe@11520
|
195 |
|
berghofe@12555
|
196 |
val empty =
|
haftmann@24219
|
197 |
{codegens = [], tycodegens = [], consts = [], types = [],
|
berghofe@28640
|
198 |
preprocs = [], modules = Symtab.empty};
|
wenzelm@16458
|
199 |
val extend = I;
|
berghofe@11520
|
200 |
|
wenzelm@33522
|
201 |
fun merge
|
berghofe@12555
|
202 |
({codegens = codegens1, tycodegens = tycodegens1,
|
haftmann@24219
|
203 |
consts = consts1, types = types1,
|
berghofe@28640
|
204 |
preprocs = preprocs1, modules = modules1} : T,
|
berghofe@12555
|
205 |
{codegens = codegens2, tycodegens = tycodegens2,
|
haftmann@24219
|
206 |
consts = consts2, types = types2,
|
wenzelm@33522
|
207 |
preprocs = preprocs2, modules = modules2}) : T =
|
haftmann@19119
|
208 |
{codegens = AList.merge (op =) (K true) (codegens1, codegens2),
|
haftmann@19119
|
209 |
tycodegens = AList.merge (op =) (K true) (tycodegens1, tycodegens2),
|
haftmann@21098
|
210 |
consts = AList.merge (op =) (K true) (consts1, consts2),
|
haftmann@21098
|
211 |
types = AList.merge (op =) (K true) (types1, types2),
|
haftmann@19119
|
212 |
preprocs = AList.merge (op =) (K true) (preprocs1, preprocs2),
|
berghofe@28640
|
213 |
modules = Symtab.merge (K true) (modules1, modules2)};
|
wenzelm@22846
|
214 |
);
|
berghofe@11520
|
215 |
|
wenzelm@22846
|
216 |
fun print_codegens thy =
|
wenzelm@22846
|
217 |
let val {codegens, tycodegens, ...} = CodegenData.get thy in
|
berghofe@12452
|
218 |
Pretty.writeln (Pretty.chunks
|
berghofe@12452
|
219 |
[Pretty.strs ("term code generators:" :: map fst codegens),
|
wenzelm@22846
|
220 |
Pretty.strs ("type code generators:" :: map fst tycodegens)])
|
wenzelm@22846
|
221 |
end;
|
berghofe@11520
|
222 |
|
berghofe@11520
|
223 |
|
berghofe@11520
|
224 |
|
berghofe@17144
|
225 |
(**** access modules ****)
|
berghofe@17144
|
226 |
|
berghofe@17144
|
227 |
fun get_modules thy = #modules (CodegenData.get thy);
|
berghofe@17144
|
228 |
|
berghofe@17144
|
229 |
fun map_modules f thy =
|
berghofe@28640
|
230 |
let val {codegens, tycodegens, consts, types, preprocs, modules} =
|
berghofe@17144
|
231 |
CodegenData.get thy;
|
berghofe@17144
|
232 |
in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
|
haftmann@24219
|
233 |
consts = consts, types = types, preprocs = preprocs,
|
berghofe@28640
|
234 |
modules = f modules} thy
|
berghofe@14105
|
235 |
end;
|
berghofe@14105
|
236 |
|
berghofe@14105
|
237 |
|
berghofe@12452
|
238 |
(**** add new code generators to theory ****)
|
berghofe@11520
|
239 |
|
berghofe@11520
|
240 |
fun add_codegen name f thy =
|
berghofe@28640
|
241 |
let val {codegens, tycodegens, consts, types, preprocs, modules} =
|
berghofe@14105
|
242 |
CodegenData.get thy
|
haftmann@17521
|
243 |
in (case AList.lookup (op =) codegens name of
|
skalberg@15531
|
244 |
NONE => CodegenData.put {codegens = (name, f) :: codegens,
|
berghofe@12555
|
245 |
tycodegens = tycodegens, consts = consts, types = types,
|
berghofe@28640
|
246 |
preprocs = preprocs, modules = modules} thy
|
skalberg@15531
|
247 |
| SOME _ => error ("Code generator " ^ name ^ " already declared"))
|
berghofe@12452
|
248 |
end;
|
berghofe@12452
|
249 |
|
berghofe@12452
|
250 |
fun add_tycodegen name f thy =
|
berghofe@28640
|
251 |
let val {codegens, tycodegens, consts, types, preprocs, modules} =
|
berghofe@14105
|
252 |
CodegenData.get thy
|
haftmann@17521
|
253 |
in (case AList.lookup (op =) tycodegens name of
|
skalberg@15531
|
254 |
NONE => CodegenData.put {tycodegens = (name, f) :: tycodegens,
|
berghofe@12555
|
255 |
codegens = codegens, consts = consts, types = types,
|
berghofe@28640
|
256 |
preprocs = preprocs, modules = modules} thy
|
skalberg@15531
|
257 |
| SOME _ => error ("Code generator " ^ name ^ " already declared"))
|
berghofe@11520
|
258 |
end;
|
berghofe@11520
|
259 |
|
berghofe@11520
|
260 |
|
berghofe@15261
|
261 |
(**** preprocessors ****)
|
berghofe@15261
|
262 |
|
berghofe@15261
|
263 |
fun add_preprocessor p thy =
|
berghofe@28640
|
264 |
let val {codegens, tycodegens, consts, types, preprocs, modules} =
|
berghofe@15261
|
265 |
CodegenData.get thy
|
berghofe@15261
|
266 |
in CodegenData.put {tycodegens = tycodegens,
|
berghofe@15261
|
267 |
codegens = codegens, consts = consts, types = types,
|
haftmann@24219
|
268 |
preprocs = (stamp (), p) :: preprocs,
|
berghofe@28640
|
269 |
modules = modules} thy
|
berghofe@15261
|
270 |
end;
|
berghofe@15261
|
271 |
|
haftmann@21836
|
272 |
fun preprocess thy =
|
berghofe@15261
|
273 |
let val {preprocs, ...} = CodegenData.get thy
|
haftmann@21836
|
274 |
in fold (fn (_, f) => f thy) preprocs end;
|
berghofe@15261
|
275 |
|
berghofe@17549
|
276 |
fun preprocess_term thy t =
|
berghofe@17549
|
277 |
let
|
wenzelm@29270
|
278 |
val x = Free (Name.variant (OldTerm.add_term_names (t, [])) "x", fastype_of t);
|
berghofe@17549
|
279 |
(* fake definition *)
|
wenzelm@32970
|
280 |
val eq = Skip_Proof.make_thm thy (Logic.mk_equals (x, t));
|
berghofe@17549
|
281 |
fun err () = error "preprocess_term: bad preprocessor"
|
berghofe@17549
|
282 |
in case map prop_of (preprocess thy [eq]) of
|
berghofe@17549
|
283 |
[Const ("==", _) $ x' $ t'] => if x = x' then t' else err ()
|
berghofe@17549
|
284 |
| _ => err ()
|
berghofe@17549
|
285 |
end;
|
haftmann@18281
|
286 |
|
wenzelm@33522
|
287 |
structure UnfoldData = Theory_Data
|
berghofe@28640
|
288 |
(
|
berghofe@28640
|
289 |
type T = simpset;
|
berghofe@28640
|
290 |
val empty = empty_ss;
|
berghofe@28640
|
291 |
val extend = I;
|
wenzelm@33522
|
292 |
val merge = merge_ss;
|
berghofe@28640
|
293 |
);
|
berghofe@28640
|
294 |
|
haftmann@32063
|
295 |
val map_unfold = UnfoldData.map;
|
haftmann@32063
|
296 |
val add_unfold = map_unfold o MetaSimplifier.add_simp;
|
haftmann@32063
|
297 |
val del_unfold = map_unfold o MetaSimplifier.del_simp;
|
berghofe@28640
|
298 |
|
berghofe@28640
|
299 |
fun unfold_preprocessor thy =
|
wenzelm@35232
|
300 |
let val ss = Simplifier.global_context thy (UnfoldData.get thy)
|
berghofe@28640
|
301 |
in map (Thm.transfer thy #> Simplifier.full_simplify ss) end;
|
berghofe@15261
|
302 |
|
berghofe@15261
|
303 |
|
berghofe@11520
|
304 |
(**** associate constants with target language code ****)
|
berghofe@11520
|
305 |
|
haftmann@22921
|
306 |
fun gen_assoc_const prep_const (raw_const, syn) thy =
|
berghofe@11520
|
307 |
let
|
berghofe@28640
|
308 |
val {codegens, tycodegens, consts, types, preprocs, modules} =
|
berghofe@14105
|
309 |
CodegenData.get thy;
|
haftmann@22921
|
310 |
val (cname, T) = prep_const thy raw_const;
|
berghofe@11520
|
311 |
in
|
haftmann@22921
|
312 |
if num_args_of (fst syn) > length (binder_types T) then
|
haftmann@22921
|
313 |
error ("More arguments than in corresponding type of " ^ cname)
|
haftmann@22921
|
314 |
else case AList.lookup (op =) consts (cname, T) of
|
haftmann@22921
|
315 |
NONE => CodegenData.put {codegens = codegens,
|
haftmann@22921
|
316 |
tycodegens = tycodegens,
|
haftmann@22921
|
317 |
consts = ((cname, T), syn) :: consts,
|
haftmann@24219
|
318 |
types = types, preprocs = preprocs,
|
berghofe@28640
|
319 |
modules = modules} thy
|
haftmann@22921
|
320 |
| SOME _ => error ("Constant " ^ cname ^ " already associated with code")
|
haftmann@22921
|
321 |
end;
|
berghofe@11520
|
322 |
|
haftmann@22921
|
323 |
val assoc_const_i = gen_assoc_const (K I);
|
haftmann@31153
|
324 |
val assoc_const = gen_assoc_const Code.read_bare_const;
|
berghofe@11520
|
325 |
|
wenzelm@15801
|
326 |
|
berghofe@11520
|
327 |
(**** associate types with target language types ****)
|
berghofe@11520
|
328 |
|
haftmann@22921
|
329 |
fun assoc_type (s, syn) thy =
|
berghofe@11520
|
330 |
let
|
berghofe@28640
|
331 |
val {codegens, tycodegens, consts, types, preprocs, modules} =
|
berghofe@14105
|
332 |
CodegenData.get thy;
|
haftmann@22921
|
333 |
val tc = Sign.intern_type thy s;
|
berghofe@11520
|
334 |
in
|
berghofe@18320
|
335 |
case Symtab.lookup (snd (#types (Type.rep_tsig (Sign.tsig_of thy)))) tc of
|
wenzelm@33173
|
336 |
SOME (Type.LogicalType i) =>
|
berghofe@18320
|
337 |
if num_args_of (fst syn) > i then
|
berghofe@18320
|
338 |
error ("More arguments than corresponding type constructor " ^ s)
|
wenzelm@33097
|
339 |
else
|
wenzelm@33097
|
340 |
(case AList.lookup (op =) types tc of
|
wenzelm@33097
|
341 |
NONE => CodegenData.put {codegens = codegens,
|
wenzelm@33097
|
342 |
tycodegens = tycodegens, consts = consts,
|
wenzelm@33097
|
343 |
types = (tc, syn) :: types,
|
wenzelm@33097
|
344 |
preprocs = preprocs, modules = modules} thy
|
wenzelm@33097
|
345 |
| SOME _ => error ("Type " ^ tc ^ " already associated with code"))
|
berghofe@18320
|
346 |
| _ => error ("Not a type constructor: " ^ s)
|
haftmann@22921
|
347 |
end;
|
berghofe@11520
|
348 |
|
haftmann@21098
|
349 |
fun get_assoc_type thy = AList.lookup (op =) ((#types o CodegenData.get) thy);
|
wenzelm@11546
|
350 |
|
berghofe@11520
|
351 |
|
berghofe@11520
|
352 |
(**** make valid ML identifiers ****)
|
berghofe@11520
|
353 |
|
berghofe@14858
|
354 |
fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse
|
berghofe@14858
|
355 |
Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x;
|
berghofe@14858
|
356 |
|
wenzelm@28375
|
357 |
fun dest_sym s = (case split_last (snd (take_prefix (fn c => c = "\\") (explode s))) of
|
berghofe@14858
|
358 |
("<" :: "^" :: xs, ">") => (true, implode xs)
|
berghofe@14858
|
359 |
| ("<" :: xs, ">") => (false, implode xs)
|
berghofe@14858
|
360 |
| _ => sys_error "dest_sym");
|
wenzelm@16458
|
361 |
|
berghofe@14858
|
362 |
fun mk_id s = if s = "" then "" else
|
berghofe@11520
|
363 |
let
|
berghofe@14858
|
364 |
fun check_str [] = []
|
berghofe@14858
|
365 |
| check_str xs = (case take_prefix is_ascii_letdig xs of
|
berghofe@14858
|
366 |
([], " " :: zs) => check_str zs
|
berghofe@14858
|
367 |
| ([], z :: zs) =>
|
berghofe@14858
|
368 |
if size z = 1 then string_of_int (ord z) :: check_str zs
|
berghofe@14858
|
369 |
else (case dest_sym z of
|
berghofe@14858
|
370 |
(true, "isub") => check_str zs
|
berghofe@14858
|
371 |
| (true, "isup") => "" :: check_str zs
|
berghofe@14858
|
372 |
| (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs)
|
berghofe@14858
|
373 |
| (ys, zs) => implode ys :: check_str zs);
|
wenzelm@30364
|
374 |
val s' = space_implode "_" (maps (check_str o Symbol.explode) (Long_Name.explode s))
|
berghofe@11520
|
375 |
in
|
berghofe@14858
|
376 |
if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s'
|
berghofe@11520
|
377 |
end;
|
berghofe@11520
|
378 |
|
berghofe@17144
|
379 |
fun mk_long_id (p as (tab, used)) module s =
|
berghofe@16649
|
380 |
let
|
berghofe@17144
|
381 |
fun find_name [] = sys_error "mk_long_id"
|
berghofe@17144
|
382 |
| find_name (ys :: yss) =
|
berghofe@17144
|
383 |
let
|
wenzelm@30364
|
384 |
val s' = Long_Name.implode ys
|
wenzelm@30364
|
385 |
val s'' = Long_Name.append module s'
|
wenzelm@17412
|
386 |
in case Symtab.lookup used s'' of
|
wenzelm@17261
|
387 |
NONE => ((module, s'),
|
wenzelm@17412
|
388 |
(Symtab.update_new (s, (module, s')) tab,
|
wenzelm@17412
|
389 |
Symtab.update_new (s'', ()) used))
|
berghofe@17144
|
390 |
| SOME _ => find_name yss
|
berghofe@17144
|
391 |
end
|
wenzelm@17412
|
392 |
in case Symtab.lookup tab s of
|
wenzelm@30364
|
393 |
NONE => find_name (Library.suffixes1 (Long_Name.explode s))
|
berghofe@17144
|
394 |
| SOME name => (name, p)
|
berghofe@16649
|
395 |
end;
|
berghofe@13073
|
396 |
|
berghofe@17144
|
397 |
(* module: module name for caller *)
|
berghofe@17144
|
398 |
(* module': module name for callee *)
|
berghofe@17144
|
399 |
(* if caller and callee reside in different modules, use qualified access *)
|
berghofe@16649
|
400 |
|
berghofe@17144
|
401 |
fun mk_qual_id module (module', s) =
|
berghofe@17144
|
402 |
if module = module' orelse module' = "" then s else module' ^ "." ^ s;
|
berghofe@17144
|
403 |
|
berghofe@17144
|
404 |
fun mk_const_id module cname (gr, (tab1, tab2)) =
|
berghofe@16649
|
405 |
let
|
berghofe@17144
|
406 |
val ((module, s), tab1') = mk_long_id tab1 module cname
|
berghofe@17144
|
407 |
val s' = mk_id s;
|
wenzelm@21478
|
408 |
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
|
haftmann@28537
|
409 |
in (((module, s'')), (gr, (tab1', tab2))) end;
|
berghofe@16649
|
410 |
|
haftmann@28537
|
411 |
fun get_const_id (gr, (tab1, tab2)) cname =
|
wenzelm@17412
|
412 |
case Symtab.lookup (fst tab1) cname of
|
berghofe@17144
|
413 |
NONE => error ("get_const_id: no such constant: " ^ quote cname)
|
berghofe@17144
|
414 |
| SOME (module, s) =>
|
berghofe@17144
|
415 |
let
|
berghofe@17144
|
416 |
val s' = mk_id s;
|
wenzelm@21478
|
417 |
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
|
berghofe@17144
|
418 |
in (module, s'') end;
|
berghofe@17144
|
419 |
|
berghofe@17144
|
420 |
fun mk_type_id module tyname (gr, (tab1, tab2)) =
|
berghofe@16649
|
421 |
let
|
berghofe@17144
|
422 |
val ((module, s), tab2') = mk_long_id tab2 module tyname
|
berghofe@17144
|
423 |
val s' = mk_id s;
|
wenzelm@21478
|
424 |
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
|
haftmann@28537
|
425 |
in ((module, s''), (gr, (tab1, tab2'))) end;
|
berghofe@16649
|
426 |
|
haftmann@28537
|
427 |
fun get_type_id (gr, (tab1, tab2)) tyname =
|
wenzelm@17412
|
428 |
case Symtab.lookup (fst tab2) tyname of
|
berghofe@17144
|
429 |
NONE => error ("get_type_id: no such type: " ^ quote tyname)
|
berghofe@17144
|
430 |
| SOME (module, s) =>
|
berghofe@17144
|
431 |
let
|
berghofe@17144
|
432 |
val s' = mk_id s;
|
wenzelm@21478
|
433 |
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
|
berghofe@17144
|
434 |
in (module, s'') end;
|
berghofe@17144
|
435 |
|
haftmann@28537
|
436 |
fun get_type_id' f tab tyname = apsnd f (get_type_id tab tyname);
|
berghofe@17144
|
437 |
|
berghofe@17144
|
438 |
fun get_node (gr, x) k = Graph.get_node gr k;
|
berghofe@17144
|
439 |
fun add_edge e (gr, x) = (Graph.add_edge e gr, x);
|
berghofe@17144
|
440 |
fun add_edge_acyclic e (gr, x) = (Graph.add_edge_acyclic e gr, x);
|
berghofe@17144
|
441 |
fun del_nodes ks (gr, x) = (Graph.del_nodes ks gr, x);
|
berghofe@17144
|
442 |
fun map_node k f (gr, x) = (Graph.map_node k f gr, x);
|
berghofe@17144
|
443 |
fun new_node p (gr, x) = (Graph.new_node p gr, x);
|
berghofe@16649
|
444 |
|
wenzelm@33172
|
445 |
fun thyname_of_type thy = #theory_name o Name_Space.the_entry (Sign.type_space thy);
|
wenzelm@33172
|
446 |
fun thyname_of_const thy = #theory_name o Name_Space.the_entry (Sign.const_space thy);
|
berghofe@11520
|
447 |
|
berghofe@13731
|
448 |
fun rename_terms ts =
|
berghofe@11520
|
449 |
let
|
wenzelm@29270
|
450 |
val names = List.foldr OldTerm.add_term_names
|
wenzelm@20286
|
451 |
(map (fst o fst) (rev (fold Term.add_vars ts []))) ts;
|
wenzelm@21478
|
452 |
val reserved = filter ML_Syntax.is_reserved names;
|
wenzelm@19482
|
453 |
val (illegal, alt_names) = split_list (map_filter (fn s =>
|
skalberg@15531
|
454 |
let val s' = mk_id s in if s = s' then NONE else SOME (s, s') end) names)
|
berghofe@14858
|
455 |
val ps = (reserved @ illegal) ~~
|
wenzelm@20071
|
456 |
Name.variant_list names (map (suffix "'") reserved @ alt_names);
|
berghofe@11520
|
457 |
|
haftmann@17521
|
458 |
fun rename_id s = AList.lookup (op =) ps s |> the_default s;
|
berghofe@14858
|
459 |
|
berghofe@14858
|
460 |
fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T)
|
berghofe@14858
|
461 |
| rename (Free (a, T)) = Free (rename_id a, T)
|
berghofe@11520
|
462 |
| rename (Abs (s, T, t)) = Abs (s, T, rename t)
|
berghofe@11520
|
463 |
| rename (t $ u) = rename t $ rename u
|
berghofe@11520
|
464 |
| rename t = t;
|
berghofe@11520
|
465 |
in
|
berghofe@13731
|
466 |
map rename ts
|
berghofe@13731
|
467 |
end;
|
berghofe@13731
|
468 |
|
berghofe@13731
|
469 |
val rename_term = hd o rename_terms o single;
|
berghofe@13731
|
470 |
|
berghofe@13731
|
471 |
|
berghofe@13731
|
472 |
(**** retrieve definition of constant ****)
|
berghofe@13731
|
473 |
|
wenzelm@24908
|
474 |
fun is_instance T1 T2 =
|
wenzelm@35845
|
475 |
Type.raw_instance (T1, if null (OldTerm.typ_tfrees T2) then T2 else Logic.varifyT_global T2);
|
berghofe@13731
|
476 |
|
haftmann@22921
|
477 |
fun get_assoc_code thy (s, T) = Option.map snd (find_first (fn ((s', T'), _) =>
|
wenzelm@24908
|
478 |
s = s' andalso is_instance T T') (#consts (CodegenData.get thy)));
|
berghofe@13731
|
479 |
|
wenzelm@19482
|
480 |
fun get_aux_code xs = map_filter (fn (m, code) =>
|
wenzelm@20665
|
481 |
if m = "" orelse member (op =) (!mode) m then SOME code else NONE) xs;
|
berghofe@16769
|
482 |
|
haftmann@32084
|
483 |
fun dest_prim_def t =
|
haftmann@32084
|
484 |
let
|
haftmann@32084
|
485 |
val (lhs, rhs) = Logic.dest_equals t;
|
haftmann@32084
|
486 |
val (c, args) = strip_comb lhs;
|
haftmann@32084
|
487 |
val (s, T) = dest_Const c
|
haftmann@32084
|
488 |
in if forall is_Var args then SOME (s, (T, (args, rhs))) else NONE
|
haftmann@32084
|
489 |
end handle TERM _ => NONE;
|
haftmann@32084
|
490 |
|
berghofe@16649
|
491 |
fun mk_deftab thy =
|
berghofe@13731
|
492 |
let
|
wenzelm@22680
|
493 |
val axmss = map (fn thy' => (Context.theory_name thy', Theory.axiom_table thy'))
|
berghofe@16649
|
494 |
(thy :: Theory.ancestors_of thy);
|
haftmann@32084
|
495 |
fun add_def thyname (name, t) = (case dest_prim_def t of
|
haftmann@21056
|
496 |
NONE => I
|
haftmann@32084
|
497 |
| SOME (s, (T, _)) => Symtab.map_default (s, [])
|
haftmann@32084
|
498 |
(cons (T, (thyname, Thm.axiom thy name))));
|
berghofe@13731
|
499 |
in
|
haftmann@21056
|
500 |
fold (fn (thyname, axms) => Symtab.fold (add_def thyname) axms) axmss Symtab.empty
|
berghofe@11520
|
501 |
end;
|
berghofe@11520
|
502 |
|
haftmann@32084
|
503 |
fun prep_prim_def thy thm =
|
haftmann@32084
|
504 |
let
|
haftmann@32084
|
505 |
val prop = case preprocess thy [thm]
|
haftmann@32084
|
506 |
of [thm'] => Thm.prop_of thm'
|
haftmann@32084
|
507 |
| _ => error "mk_deftab: bad preprocessor"
|
haftmann@32084
|
508 |
in ((Option.map o apsnd o apsnd)
|
haftmann@32084
|
509 |
(fn (args, rhs) => split_last (rename_terms (args @ [rhs]))) o dest_prim_def) prop
|
haftmann@32084
|
510 |
end;
|
haftmann@32084
|
511 |
|
wenzelm@17412
|
512 |
fun get_defn thy defs s T = (case Symtab.lookup defs s of
|
berghofe@16649
|
513 |
NONE => NONE
|
berghofe@16649
|
514 |
| SOME ds =>
|
wenzelm@24908
|
515 |
let val i = find_index (is_instance T o fst) ds
|
berghofe@16649
|
516 |
in if i >= 0 then
|
haftmann@32084
|
517 |
SOME (nth ds i, if length ds = 1 then NONE else SOME i)
|
berghofe@16649
|
518 |
else NONE
|
berghofe@16649
|
519 |
end);
|
berghofe@16649
|
520 |
|
berghofe@11520
|
521 |
|
berghofe@12452
|
522 |
(**** invoke suitable code generator for term / type ****)
|
berghofe@11520
|
523 |
|
berghofe@17144
|
524 |
fun codegen_error (gr, _) dep s =
|
berghofe@17144
|
525 |
error (s ^ "\nrequired by:\n" ^ commas (Graph.all_succs gr [dep]));
|
berghofe@17144
|
526 |
|
haftmann@28537
|
527 |
fun invoke_codegen thy defs dep module brack t gr = (case get_first
|
haftmann@28537
|
528 |
(fn (_, f) => f thy defs dep module brack t gr) (#codegens (CodegenData.get thy)) of
|
berghofe@17144
|
529 |
NONE => codegen_error gr dep ("Unable to generate code for term:\n" ^
|
wenzelm@26939
|
530 |
Syntax.string_of_term_global thy t)
|
skalberg@15531
|
531 |
| SOME x => x);
|
berghofe@12452
|
532 |
|
haftmann@28537
|
533 |
fun invoke_tycodegen thy defs dep module brack T gr = (case get_first
|
haftmann@28537
|
534 |
(fn (_, f) => f thy defs dep module brack T gr ) (#tycodegens (CodegenData.get thy)) of
|
berghofe@17144
|
535 |
NONE => codegen_error gr dep ("Unable to generate code for type:\n" ^
|
wenzelm@26939
|
536 |
Syntax.string_of_typ_global thy T)
|
skalberg@15531
|
537 |
| SOME x => x);
|
berghofe@11520
|
538 |
|
berghofe@11520
|
539 |
|
berghofe@11520
|
540 |
(**** code generator for mixfix expressions ****)
|
berghofe@11520
|
541 |
|
berghofe@26974
|
542 |
fun parens p = Pretty.block [str "(", p, str ")"];
|
berghofe@11520
|
543 |
|
berghofe@11520
|
544 |
fun pretty_fn [] p = [p]
|
berghofe@26974
|
545 |
| pretty_fn (x::xs) p = str ("fn " ^ x ^ " =>") ::
|
berghofe@11520
|
546 |
Pretty.brk 1 :: pretty_fn xs p;
|
berghofe@11520
|
547 |
|
berghofe@16769
|
548 |
fun pretty_mixfix _ _ [] [] _ = []
|
berghofe@16769
|
549 |
| pretty_mixfix module module' (Arg :: ms) (p :: ps) qs =
|
berghofe@16769
|
550 |
p :: pretty_mixfix module module' ms ps qs
|
berghofe@16769
|
551 |
| pretty_mixfix module module' (Ignore :: ms) ps qs =
|
berghofe@16769
|
552 |
pretty_mixfix module module' ms ps qs
|
berghofe@16769
|
553 |
| pretty_mixfix module module' (Module :: ms) ps qs =
|
berghofe@17144
|
554 |
(if module <> module'
|
berghofe@26974
|
555 |
then cons (str (module' ^ ".")) else I)
|
berghofe@16769
|
556 |
(pretty_mixfix module module' ms ps qs)
|
berghofe@16769
|
557 |
| pretty_mixfix module module' (Pretty p :: ms) ps qs =
|
berghofe@16769
|
558 |
p :: pretty_mixfix module module' ms ps qs
|
berghofe@16769
|
559 |
| pretty_mixfix module module' (Quote _ :: ms) ps (q :: qs) =
|
berghofe@16769
|
560 |
q :: pretty_mixfix module module' ms ps qs;
|
berghofe@11520
|
561 |
|
haftmann@18102
|
562 |
fun replace_quotes [] [] = []
|
haftmann@18102
|
563 |
| replace_quotes xs (Arg :: ms) =
|
haftmann@18102
|
564 |
Arg :: replace_quotes xs ms
|
haftmann@18102
|
565 |
| replace_quotes xs (Ignore :: ms) =
|
haftmann@18102
|
566 |
Ignore :: replace_quotes xs ms
|
haftmann@18102
|
567 |
| replace_quotes xs (Module :: ms) =
|
haftmann@18102
|
568 |
Module :: replace_quotes xs ms
|
haftmann@18102
|
569 |
| replace_quotes xs (Pretty p :: ms) =
|
haftmann@18102
|
570 |
Pretty p :: replace_quotes xs ms
|
haftmann@18102
|
571 |
| replace_quotes (x::xs) (Quote _ :: ms) =
|
haftmann@18102
|
572 |
Quote x :: replace_quotes xs ms;
|
haftmann@18102
|
573 |
|
berghofe@11520
|
574 |
|
berghofe@12452
|
575 |
(**** default code generators ****)
|
berghofe@11520
|
576 |
|
berghofe@11520
|
577 |
fun eta_expand t ts i =
|
berghofe@11520
|
578 |
let
|
berghofe@24456
|
579 |
val k = length ts;
|
haftmann@33956
|
580 |
val Ts = drop k (binder_types (fastype_of t));
|
berghofe@24456
|
581 |
val j = i - k
|
berghofe@11520
|
582 |
in
|
wenzelm@23178
|
583 |
List.foldr (fn (T, t) => Abs ("x", T, t))
|
haftmann@33956
|
584 |
(list_comb (t, ts @ map Bound (j-1 downto 0))) (take j Ts)
|
berghofe@11520
|
585 |
end;
|
berghofe@11520
|
586 |
|
berghofe@11520
|
587 |
fun mk_app _ p [] = p
|
berghofe@11520
|
588 |
| mk_app brack p ps = if brack then
|
berghofe@26974
|
589 |
Pretty.block (str "(" ::
|
berghofe@26974
|
590 |
separate (Pretty.brk 1) (p :: ps) @ [str ")"])
|
berghofe@11520
|
591 |
else Pretty.block (separate (Pretty.brk 1) (p :: ps));
|
berghofe@11520
|
592 |
|
wenzelm@20071
|
593 |
fun new_names t xs = Name.variant_list
|
haftmann@33042
|
594 |
(union (op =) (map (fst o fst o dest_Var) (OldTerm.term_vars t))
|
haftmann@33042
|
595 |
(OldTerm.add_term_names (t, ML_Syntax.reserved_names))) (map mk_id xs);
|
berghofe@11520
|
596 |
|
berghofe@11520
|
597 |
fun new_name t x = hd (new_names t [x]);
|
berghofe@11520
|
598 |
|
wenzelm@20665
|
599 |
fun if_library x y = if member (op =) (!mode) "library" then x else y;
|
berghofe@17144
|
600 |
|
haftmann@28537
|
601 |
fun default_codegen thy defs dep module brack t gr =
|
berghofe@11520
|
602 |
let
|
berghofe@11520
|
603 |
val (u, ts) = strip_comb t;
|
haftmann@28537
|
604 |
fun codegens brack = fold_map (invoke_codegen thy defs dep module brack)
|
berghofe@11520
|
605 |
in (case u of
|
berghofe@14105
|
606 |
Var ((s, i), T) =>
|
berghofe@14105
|
607 |
let
|
haftmann@28537
|
608 |
val (ps, gr') = codegens true ts gr;
|
haftmann@28537
|
609 |
val (_, gr'') = invoke_tycodegen thy defs dep module false T gr'
|
haftmann@28537
|
610 |
in SOME (mk_app brack (str (s ^
|
haftmann@28537
|
611 |
(if i=0 then "" else string_of_int i))) ps, gr'')
|
berghofe@11520
|
612 |
end
|
berghofe@11520
|
613 |
|
berghofe@14105
|
614 |
| Free (s, T) =>
|
berghofe@14105
|
615 |
let
|
haftmann@28537
|
616 |
val (ps, gr') = codegens true ts gr;
|
haftmann@28537
|
617 |
val (_, gr'') = invoke_tycodegen thy defs dep module false T gr'
|
haftmann@28537
|
618 |
in SOME (mk_app brack (str s) ps, gr'') end
|
berghofe@11520
|
619 |
|
berghofe@11520
|
620 |
| Const (s, T) =>
|
haftmann@22921
|
621 |
(case get_assoc_code thy (s, T) of
|
berghofe@16769
|
622 |
SOME (ms, aux) =>
|
haftmann@18281
|
623 |
let val i = num_args_of ms
|
berghofe@11520
|
624 |
in if length ts < i then
|
haftmann@28537
|
625 |
default_codegen thy defs dep module brack (eta_expand u ts i) gr
|
berghofe@11520
|
626 |
else
|
berghofe@11520
|
627 |
let
|
berghofe@12452
|
628 |
val (ts1, ts2) = args_of ms ts;
|
haftmann@28537
|
629 |
val (ps1, gr1) = codegens false ts1 gr;
|
haftmann@28537
|
630 |
val (ps2, gr2) = codegens true ts2 gr1;
|
haftmann@28537
|
631 |
val (ps3, gr3) = codegens false (quotes_of ms) gr2;
|
haftmann@28537
|
632 |
val (_, gr4) = invoke_tycodegen thy defs dep module false
|
haftmann@28537
|
633 |
(funpow (length ts) (hd o tl o snd o dest_Type) T) gr3;
|
berghofe@17144
|
634 |
val (module', suffix) = (case get_defn thy defs s T of
|
haftmann@27398
|
635 |
NONE => (if_library (thyname_of_const thy s) module, "")
|
berghofe@17144
|
636 |
| SOME ((U, (module', _)), NONE) =>
|
berghofe@17144
|
637 |
(if_library module' module, "")
|
berghofe@17144
|
638 |
| SOME ((U, (module', _)), SOME i) =>
|
berghofe@17144
|
639 |
(if_library module' module, " def" ^ string_of_int i));
|
berghofe@16769
|
640 |
val node_id = s ^ suffix;
|
berghofe@17144
|
641 |
fun p module' = mk_app brack (Pretty.block
|
berghofe@17144
|
642 |
(pretty_mixfix module module' ms ps1 ps3)) ps2
|
berghofe@17549
|
643 |
in SOME (case try (get_node gr4) node_id of
|
berghofe@16769
|
644 |
NONE => (case get_aux_code aux of
|
haftmann@28537
|
645 |
[] => (p module, gr4)
|
haftmann@28537
|
646 |
| xs => (p module', add_edge (node_id, dep) (new_node
|
haftmann@28537
|
647 |
(node_id, (NONE, module', cat_lines xs ^ "\n")) gr4)))
|
berghofe@17144
|
648 |
| SOME (_, module'', _) =>
|
haftmann@28537
|
649 |
(p module'', add_edge (node_id, dep) gr4))
|
berghofe@11520
|
650 |
end
|
berghofe@11520
|
651 |
end
|
berghofe@16649
|
652 |
| NONE => (case get_defn thy defs s T of
|
skalberg@15531
|
653 |
NONE => NONE
|
haftmann@32084
|
654 |
| SOME ((U, (thyname, thm)), k) => (case prep_prim_def thy thm
|
haftmann@32084
|
655 |
of SOME (_, (_, (args, rhs))) => let
|
berghofe@17144
|
656 |
val module' = if_library thyname module;
|
berghofe@17144
|
657 |
val suffix = (case k of NONE => "" | SOME i => " def" ^ string_of_int i);
|
berghofe@16649
|
658 |
val node_id = s ^ suffix;
|
haftmann@28537
|
659 |
val ((ps, def_id), gr') = gr |> codegens true ts
|
haftmann@28537
|
660 |
||>> mk_const_id module' (s ^ suffix);
|
berghofe@26974
|
661 |
val p = mk_app brack (str (mk_qual_id module def_id)) ps
|
berghofe@17144
|
662 |
in SOME (case try (get_node gr') node_id of
|
berghofe@17144
|
663 |
NONE =>
|
berghofe@17144
|
664 |
let
|
berghofe@17144
|
665 |
val _ = message ("expanding definition of " ^ s);
|
berghofe@18788
|
666 |
val (Ts, _) = strip_type U;
|
berghofe@17144
|
667 |
val (args', rhs') =
|
berghofe@17144
|
668 |
if not (null args) orelse null Ts then (args, rhs) else
|
berghofe@17144
|
669 |
let val v = Free (new_name rhs "x", hd Ts)
|
berghofe@17144
|
670 |
in ([v], betapply (rhs, v)) end;
|
haftmann@28537
|
671 |
val (p', gr1) = invoke_codegen thy defs node_id module' false
|
haftmann@28537
|
672 |
rhs' (add_edge (node_id, dep)
|
haftmann@28537
|
673 |
(new_node (node_id, (NONE, "", "")) gr'));
|
haftmann@28537
|
674 |
val (xs, gr2) = codegens false args' gr1;
|
haftmann@28537
|
675 |
val (_, gr3) = invoke_tycodegen thy defs dep module false T gr2;
|
haftmann@28537
|
676 |
val (ty, gr4) = invoke_tycodegen thy defs node_id module' false U gr3;
|
haftmann@28537
|
677 |
in (p, map_node node_id (K (NONE, module', string_of
|
berghofe@17144
|
678 |
(Pretty.block (separate (Pretty.brk 1)
|
berghofe@17144
|
679 |
(if null args' then
|
berghofe@26974
|
680 |
[str ("val " ^ snd def_id ^ " :"), ty]
|
berghofe@26974
|
681 |
else str ("fun " ^ snd def_id) :: xs) @
|
haftmann@28537
|
682 |
[str " =", Pretty.brk 1, p', str ";"])) ^ "\n\n")) gr4)
|
berghofe@17144
|
683 |
end
|
haftmann@28537
|
684 |
| SOME _ => (p, add_edge (node_id, dep) gr'))
|
haftmann@32084
|
685 |
end
|
haftmann@32084
|
686 |
| NONE => NONE)))
|
berghofe@11520
|
687 |
|
berghofe@11520
|
688 |
| Abs _ =>
|
berghofe@11520
|
689 |
let
|
berghofe@11520
|
690 |
val (bs, Ts) = ListPair.unzip (strip_abs_vars u);
|
berghofe@11520
|
691 |
val t = strip_abs_body u
|
berghofe@11520
|
692 |
val bs' = new_names t bs;
|
haftmann@28537
|
693 |
val (ps, gr1) = codegens true ts gr;
|
haftmann@28537
|
694 |
val (p, gr2) = invoke_codegen thy defs dep module false
|
haftmann@28537
|
695 |
(subst_bounds (map Free (rev (bs' ~~ Ts)), t)) gr1;
|
berghofe@11520
|
696 |
in
|
haftmann@28537
|
697 |
SOME (mk_app brack (Pretty.block (str "(" :: pretty_fn bs' p @
|
haftmann@28537
|
698 |
[str ")"])) ps, gr2)
|
berghofe@11520
|
699 |
end
|
berghofe@11520
|
700 |
|
skalberg@15531
|
701 |
| _ => NONE)
|
berghofe@11520
|
702 |
end;
|
berghofe@11520
|
703 |
|
haftmann@28537
|
704 |
fun default_tycodegen thy defs dep module brack (TVar ((s, i), _)) gr =
|
haftmann@28537
|
705 |
SOME (str (s ^ (if i = 0 then "" else string_of_int i)), gr)
|
haftmann@28537
|
706 |
| default_tycodegen thy defs dep module brack (TFree (s, _)) gr =
|
haftmann@28537
|
707 |
SOME (str s, gr)
|
haftmann@28537
|
708 |
| default_tycodegen thy defs dep module brack (Type (s, Ts)) gr =
|
haftmann@17521
|
709 |
(case AList.lookup (op =) ((#types o CodegenData.get) thy) s of
|
skalberg@15531
|
710 |
NONE => NONE
|
berghofe@16769
|
711 |
| SOME (ms, aux) =>
|
berghofe@12452
|
712 |
let
|
haftmann@28537
|
713 |
val (ps, gr') = fold_map
|
berghofe@17144
|
714 |
(invoke_tycodegen thy defs dep module false)
|
haftmann@28537
|
715 |
(fst (args_of ms Ts)) gr;
|
haftmann@28537
|
716 |
val (qs, gr'') = fold_map
|
berghofe@17144
|
717 |
(invoke_tycodegen thy defs dep module false)
|
haftmann@28537
|
718 |
(quotes_of ms) gr';
|
haftmann@27398
|
719 |
val module' = if_library (thyname_of_type thy s) module;
|
berghofe@16769
|
720 |
val node_id = s ^ " (type)";
|
berghofe@17144
|
721 |
fun p module' = Pretty.block (pretty_mixfix module module' ms ps qs)
|
berghofe@17144
|
722 |
in SOME (case try (get_node gr'') node_id of
|
berghofe@16769
|
723 |
NONE => (case get_aux_code aux of
|
haftmann@28537
|
724 |
[] => (p module', gr'')
|
haftmann@28537
|
725 |
| xs => (p module', snd (mk_type_id module' s
|
berghofe@17144
|
726 |
(add_edge (node_id, dep) (new_node (node_id,
|
haftmann@28537
|
727 |
(NONE, module', cat_lines xs ^ "\n")) gr'')))))
|
berghofe@17144
|
728 |
| SOME (_, module'', _) =>
|
haftmann@28537
|
729 |
(p module'', add_edge (node_id, dep) gr''))
|
berghofe@16769
|
730 |
end);
|
berghofe@12452
|
731 |
|
berghofe@25892
|
732 |
fun mk_tuple [p] = p
|
berghofe@26974
|
733 |
| mk_tuple ps = Pretty.block (str "(" ::
|
wenzelm@32952
|
734 |
flat (separate [str ",", Pretty.brk 1] (map single ps)) @ [str ")"]);
|
berghofe@25892
|
735 |
|
berghofe@25892
|
736 |
fun mk_let bindings body =
|
berghofe@26974
|
737 |
Pretty.blk (0, [str "let", Pretty.brk 1,
|
berghofe@25892
|
738 |
Pretty.blk (0, separate Pretty.fbrk (map (fn (pat, rhs) =>
|
berghofe@26974
|
739 |
Pretty.block [str "val ", pat, str " =", Pretty.brk 1,
|
berghofe@26974
|
740 |
rhs, str ";"]) bindings)),
|
berghofe@26974
|
741 |
Pretty.brk 1, str "in", Pretty.brk 1, body,
|
berghofe@26974
|
742 |
Pretty.brk 1, str "end"]);
|
berghofe@25892
|
743 |
|
berghofe@16649
|
744 |
fun mk_struct name s = "structure " ^ name ^ " =\nstruct\n\n" ^ s ^ "end;\n";
|
berghofe@16649
|
745 |
|
haftmann@28227
|
746 |
fun add_to_module name s = AList.map_entry (op =) (name : string) (suffix s);
|
berghofe@16649
|
747 |
|
berghofe@17144
|
748 |
fun output_code gr module xs =
|
berghofe@16649
|
749 |
let
|
wenzelm@19482
|
750 |
val code = map_filter (fn s =>
|
berghofe@17144
|
751 |
let val c as (_, module', _) = Graph.get_node gr s
|
berghofe@17144
|
752 |
in if module = "" orelse module = module' then SOME (s, c) else NONE end)
|
berghofe@17144
|
753 |
(rev (Graph.all_preds gr xs));
|
berghofe@16649
|
754 |
fun string_of_cycle (a :: b :: cs) =
|
berghofe@16649
|
755 |
let val SOME (x, y) = get_first (fn (x, (_, a', _)) =>
|
berghofe@16649
|
756 |
if a = a' then Option.map (pair x)
|
wenzelm@28375
|
757 |
(find_first ((fn (_, b', _) => b' = b) o Graph.get_node gr)
|
berghofe@16649
|
758 |
(Graph.imm_succs gr x))
|
berghofe@16649
|
759 |
else NONE) code
|
berghofe@16649
|
760 |
in x ^ " called by " ^ y ^ "\n" ^ string_of_cycle (b :: cs) end
|
berghofe@16649
|
761 |
| string_of_cycle _ = ""
|
berghofe@16649
|
762 |
in
|
berghofe@17144
|
763 |
if module = "" then
|
berghofe@16649
|
764 |
let
|
wenzelm@19046
|
765 |
val modules = distinct (op =) (map (#2 o snd) code);
|
wenzelm@23178
|
766 |
val mod_gr = fold_rev Graph.add_edge_acyclic
|
wenzelm@19482
|
767 |
(maps (fn (s, (_, module, _)) => map (pair module)
|
wenzelm@28375
|
768 |
(filter_out (fn s => s = module) (map (#2 o Graph.get_node gr)
|
wenzelm@23178
|
769 |
(Graph.imm_succs gr s)))) code)
|
wenzelm@23178
|
770 |
(fold_rev (Graph.new_node o rpair ()) modules Graph.empty);
|
berghofe@16649
|
771 |
val modules' =
|
berghofe@16649
|
772 |
rev (Graph.all_preds mod_gr (map (#2 o Graph.get_node gr) xs))
|
berghofe@16649
|
773 |
in
|
wenzelm@23178
|
774 |
List.foldl (fn ((_, (_, module, s)), ms) => add_to_module module s ms)
|
berghofe@16649
|
775 |
(map (rpair "") modules') code
|
berghofe@16649
|
776 |
end handle Graph.CYCLES (cs :: _) =>
|
berghofe@16649
|
777 |
error ("Cyclic dependency of modules:\n" ^ commas cs ^
|
berghofe@16649
|
778 |
"\n" ^ string_of_cycle cs)
|
berghofe@17144
|
779 |
else [(module, implode (map (#3 o snd) code))]
|
berghofe@16649
|
780 |
end;
|
berghofe@11520
|
781 |
|
berghofe@26974
|
782 |
fun gen_generate_code prep_term thy modules module xs =
|
berghofe@11520
|
783 |
let
|
wenzelm@21858
|
784 |
val _ = (module <> "" orelse
|
wenzelm@28375
|
785 |
member (op =) (!mode) "library" andalso forall (fn (s, _) => s = "") xs)
|
wenzelm@21858
|
786 |
orelse error "missing module name";
|
berghofe@17144
|
787 |
val graphs = get_modules thy;
|
berghofe@16649
|
788 |
val defs = mk_deftab thy;
|
berghofe@17144
|
789 |
val gr = new_node ("<Top>", (NONE, module, ""))
|
wenzelm@23178
|
790 |
(List.foldl (fn ((gr, (tab1, tab2)), (gr', (tab1', tab2'))) =>
|
berghofe@17144
|
791 |
(Graph.merge (fn ((_, module, _), (_, module', _)) =>
|
berghofe@17144
|
792 |
module = module') (gr, gr'),
|
berghofe@17144
|
793 |
(merge_nametabs (tab1, tab1'), merge_nametabs (tab2, tab2')))) emptygr
|
wenzelm@17412
|
794 |
(map (fn s => case Symtab.lookup graphs s of
|
berghofe@17144
|
795 |
NONE => error ("Undefined code module: " ^ s)
|
berghofe@17144
|
796 |
| SOME gr => gr) modules))
|
wenzelm@23655
|
797 |
handle Graph.DUP k => error ("Duplicate code for " ^ k);
|
berghofe@16649
|
798 |
fun expand (t as Abs _) = t
|
berghofe@16649
|
799 |
| expand t = (case fastype_of t of
|
berghofe@16649
|
800 |
Type ("fun", [T, U]) => Abs ("x", T, t $ Bound 0) | _ => t);
|
haftmann@28537
|
801 |
val (ps, gr') = fold_map (fn (s, t) => fn gr => apfst (pair s)
|
haftmann@28537
|
802 |
(invoke_codegen thy defs "<Top>" module false t gr))
|
haftmann@28537
|
803 |
(map (apsnd (expand o preprocess_term thy o prep_term thy)) xs) gr;
|
wenzelm@19482
|
804 |
val code = map_filter
|
berghofe@17144
|
805 |
(fn ("", _) => NONE
|
berghofe@26974
|
806 |
| (s', p) => SOME (string_of (Pretty.block
|
berghofe@26974
|
807 |
[str ("val " ^ s' ^ " ="), Pretty.brk 1, p, str ";"]))) ps;
|
berghofe@17144
|
808 |
val code' = space_implode "\n\n" code ^ "\n\n";
|
berghofe@17144
|
809 |
val code'' =
|
wenzelm@19482
|
810 |
map_filter (fn (name, s) =>
|
wenzelm@20665
|
811 |
if member (op =) (!mode) "library" andalso name = module andalso null code
|
berghofe@17144
|
812 |
then NONE
|
berghofe@17144
|
813 |
else SOME (name, mk_struct name s))
|
berghofe@17144
|
814 |
((if null code then I
|
berghofe@17144
|
815 |
else add_to_module module code')
|
berghofe@17144
|
816 |
(output_code (fst gr') (if_library "" module) ["<Top>"]))
|
berghofe@16649
|
817 |
in
|
berghofe@17144
|
818 |
(code'', del_nodes ["<Top>"] gr')
|
berghofe@26974
|
819 |
end;
|
berghofe@11520
|
820 |
|
wenzelm@22680
|
821 |
val generate_code_i = gen_generate_code Sign.cert_term;
|
wenzelm@32182
|
822 |
val generate_code =
|
wenzelm@36633
|
823 |
gen_generate_code (Syntax.read_term o ProofContext.allow_dummies o ProofContext.init_global);
|
berghofe@11520
|
824 |
|
berghofe@12452
|
825 |
|
berghofe@13753
|
826 |
(**** Reflection ****)
|
berghofe@13753
|
827 |
|
berghofe@13753
|
828 |
val strip_tname = implode o tl o explode;
|
berghofe@13753
|
829 |
|
berghofe@26974
|
830 |
fun pretty_list xs = Pretty.block (str "[" ::
|
berghofe@26974
|
831 |
flat (separate [str ",", Pretty.brk 1] (map single xs)) @
|
berghofe@26974
|
832 |
[str "]"]);
|
berghofe@13753
|
833 |
|
berghofe@26974
|
834 |
fun mk_type p (TVar ((s, i), _)) = str
|
berghofe@13753
|
835 |
(strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T")
|
berghofe@26974
|
836 |
| mk_type p (TFree (s, _)) = str (strip_tname s ^ "T")
|
berghofe@13753
|
837 |
| mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
|
berghofe@26974
|
838 |
[str "Type", Pretty.brk 1, str ("(\"" ^ s ^ "\","),
|
berghofe@26974
|
839 |
Pretty.brk 1, pretty_list (map (mk_type false) Ts), str ")"]);
|
berghofe@13753
|
840 |
|
berghofe@26974
|
841 |
fun mk_term_of gr module p (TVar ((s, i), _)) = str
|
berghofe@13753
|
842 |
(strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F")
|
berghofe@26974
|
843 |
| mk_term_of gr module p (TFree (s, _)) = str (strip_tname s ^ "F")
|
berghofe@17144
|
844 |
| mk_term_of gr module p (Type (s, Ts)) = (if p then parens else I)
|
berghofe@16649
|
845 |
(Pretty.block (separate (Pretty.brk 1)
|
berghofe@26974
|
846 |
(str (mk_qual_id module
|
haftmann@28537
|
847 |
(get_type_id' (fn s' => "term_of_" ^ s') gr s)) ::
|
wenzelm@19482
|
848 |
maps (fn T =>
|
wenzelm@19482
|
849 |
[mk_term_of gr module true T, mk_type true T]) Ts)));
|
berghofe@13753
|
850 |
|
berghofe@13753
|
851 |
|
berghofe@14105
|
852 |
(**** Test data generators ****)
|
berghofe@14105
|
853 |
|
berghofe@26974
|
854 |
fun mk_gen gr module p xs a (TVar ((s, i), _)) = str
|
berghofe@14105
|
855 |
(strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G")
|
berghofe@26974
|
856 |
| mk_gen gr module p xs a (TFree (s, _)) = str (strip_tname s ^ "G")
|
berghofe@25892
|
857 |
| mk_gen gr module p xs a (Type (tyc as (s, Ts))) = (if p then parens else I)
|
berghofe@16649
|
858 |
(Pretty.block (separate (Pretty.brk 1)
|
haftmann@28537
|
859 |
(str (mk_qual_id module (get_type_id' (fn s' => "gen_" ^ s') gr s) ^
|
wenzelm@20665
|
860 |
(if member (op =) xs s then "'" else "")) ::
|
berghofe@25892
|
861 |
(case tyc of
|
berghofe@25892
|
862 |
("fun", [T, U]) =>
|
berghofe@25892
|
863 |
[mk_term_of gr module true T, mk_type true T,
|
berghofe@25892
|
864 |
mk_gen gr module true xs a U, mk_type true U]
|
berghofe@25892
|
865 |
| _ => maps (fn T =>
|
berghofe@25892
|
866 |
[mk_gen gr module true xs a T, mk_type true T]) Ts) @
|
berghofe@26974
|
867 |
(if member (op =) xs s then [str a] else []))));
|
berghofe@14105
|
868 |
|
wenzelm@32738
|
869 |
val test_fn : (int -> term list option) Unsynchronized.ref =
|
wenzelm@32738
|
870 |
Unsynchronized.ref (fn _ => NONE);
|
berghofe@14105
|
871 |
|
bulwahn@35378
|
872 |
fun test_term ctxt report t =
|
haftmann@28309
|
873 |
let
|
haftmann@28309
|
874 |
val thy = ProofContext.theory_of ctxt;
|
wenzelm@32966
|
875 |
val (code, gr) = setmp_CRITICAL mode ["term_of", "test"]
|
haftmann@28309
|
876 |
(generate_code_i thy [] "Generated") [("testf", t)];
|
berghofe@31145
|
877 |
val Ts = map snd (fst (strip_abs t));
|
berghofe@31145
|
878 |
val args = map_index (fn (i, T) => ("arg" ^ string_of_int i, T)) Ts;
|
haftmann@28309
|
879 |
val s = "structure TestTerm =\nstruct\n\n" ^
|
haftmann@28309
|
880 |
cat_lines (map snd code) ^
|
haftmann@28309
|
881 |
"\nopen Generated;\n\n" ^ string_of
|
haftmann@28309
|
882 |
(Pretty.block [str "val () = Codegen.test_fn :=",
|
haftmann@28309
|
883 |
Pretty.brk 1, str ("(fn i =>"), Pretty.brk 1,
|
berghofe@31145
|
884 |
mk_let (map (fn (s, T) =>
|
berghofe@31145
|
885 |
(mk_tuple [str s, str (s ^ "_t")],
|
haftmann@28309
|
886 |
Pretty.block [mk_gen gr "Generated" false [] "" T, Pretty.brk 1,
|
berghofe@31145
|
887 |
str "i"])) args)
|
haftmann@28309
|
888 |
(Pretty.block [str "if ",
|
berghofe@31145
|
889 |
mk_app false (str "testf") (map (str o fst) args),
|
haftmann@28309
|
890 |
Pretty.brk 1, str "then NONE",
|
haftmann@28309
|
891 |
Pretty.brk 1, str "else ",
|
wenzelm@38588
|
892 |
Pretty.block [str "SOME ",
|
wenzelm@38588
|
893 |
Pretty.enum "," "[" "]" (map (fn (s, _) => str (s ^ "_t ()")) args)]]),
|
haftmann@28309
|
894 |
str ");"]) ^
|
haftmann@28309
|
895 |
"\n\nend;\n";
|
wenzelm@37199
|
896 |
val _ = ML_Context.eval_text_in (SOME ctxt) false Position.none s;
|
bulwahn@35378
|
897 |
val dummy_report = ([], false)
|
bulwahn@35378
|
898 |
in (fn size => (! test_fn size, dummy_report)) end;
|
haftmann@28309
|
899 |
|
berghofe@24456
|
900 |
|
berghofe@14105
|
901 |
|
berghofe@17549
|
902 |
(**** Evaluator for terms ****)
|
berghofe@17549
|
903 |
|
wenzelm@32738
|
904 |
val eval_result = Unsynchronized.ref (fn () => Bound 0);
|
berghofe@17549
|
905 |
|
wenzelm@25009
|
906 |
fun eval_term thy t =
|
wenzelm@28271
|
907 |
let
|
wenzelm@36633
|
908 |
val ctxt = ProofContext.init_global thy;
|
wenzelm@28271
|
909 |
val e =
|
wenzelm@28271
|
910 |
let
|
wenzelm@29266
|
911 |
val _ = (null (Term.add_tvars t []) andalso null (Term.add_tfrees t [])) orelse
|
wenzelm@28271
|
912 |
error "Term to be evaluated contains type variables";
|
wenzelm@29266
|
913 |
val _ = (null (Term.add_vars t []) andalso null (Term.add_frees t [])) orelse
|
wenzelm@28271
|
914 |
error "Term to be evaluated contains variables";
|
wenzelm@32966
|
915 |
val (code, gr) = setmp_CRITICAL mode ["term_of"]
|
wenzelm@28271
|
916 |
(generate_code_i thy [] "Generated")
|
wenzelm@28271
|
917 |
[("result", Abs ("x", TFree ("'a", []), t))];
|
wenzelm@28271
|
918 |
val s = "structure EvalTerm =\nstruct\n\n" ^
|
wenzelm@28271
|
919 |
cat_lines (map snd code) ^
|
wenzelm@28271
|
920 |
"\nopen Generated;\n\n" ^ string_of
|
wenzelm@28271
|
921 |
(Pretty.block [str "val () = Codegen.eval_result := (fn () =>",
|
wenzelm@28271
|
922 |
Pretty.brk 1,
|
wenzelm@28271
|
923 |
mk_app false (mk_term_of gr "Generated" false (fastype_of t))
|
wenzelm@28271
|
924 |
[str "(result ())"],
|
wenzelm@28271
|
925 |
str ");"]) ^
|
wenzelm@28271
|
926 |
"\n\nend;\n";
|
wenzelm@33233
|
927 |
val _ = NAMED_CRITICAL "codegen" (fn () => (* FIXME ??? *)
|
wenzelm@37199
|
928 |
ML_Context.eval_text_in (SOME ctxt) false Position.none s);
|
wenzelm@28271
|
929 |
in !eval_result end;
|
wenzelm@25009
|
930 |
in e () end;
|
berghofe@17549
|
931 |
|
wenzelm@28293
|
932 |
val (_, evaluation_conv) = Context.>>> (Context.map_theory_result
|
wenzelm@30288
|
933 |
(Thm.add_oracle (Binding.name "evaluation", fn ct =>
|
wenzelm@28293
|
934 |
let
|
wenzelm@28293
|
935 |
val thy = Thm.theory_of_cterm ct;
|
wenzelm@28293
|
936 |
val t = Thm.term_of ct;
|
wenzelm@28293
|
937 |
in Thm.cterm_of thy (Logic.mk_equals (t, eval_term thy t)) end)));
|
haftmann@20599
|
938 |
|
berghofe@17549
|
939 |
|
berghofe@12452
|
940 |
(**** Interface ****)
|
berghofe@12452
|
941 |
|
berghofe@11520
|
942 |
fun parse_mixfix rd s =
|
berghofe@11520
|
943 |
(case Scan.finite Symbol.stopper (Scan.repeat
|
berghofe@11520
|
944 |
( $$ "_" >> K Arg
|
berghofe@11520
|
945 |
|| $$ "?" >> K Ignore
|
berghofe@16769
|
946 |
|| $$ "\\<module>" >> K Module
|
berghofe@11520
|
947 |
|| $$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)
|
berghofe@11520
|
948 |
|| $$ "{" |-- $$ "*" |-- Scan.repeat1
|
wenzelm@23784
|
949 |
( $$ "'" |-- Scan.one Symbol.is_regular
|
wenzelm@23784
|
950 |
|| Scan.unless ($$ "*" -- $$ "}") (Scan.one Symbol.is_regular)) --|
|
berghofe@12452
|
951 |
$$ "*" --| $$ "}" >> (Quote o rd o implode)
|
berghofe@11520
|
952 |
|| Scan.repeat1
|
wenzelm@23784
|
953 |
( $$ "'" |-- Scan.one Symbol.is_regular
|
berghofe@16769
|
954 |
|| Scan.unless ($$ "_" || $$ "?" || $$ "\\<module>" || $$ "/" || $$ "{" |-- $$ "*")
|
wenzelm@23784
|
955 |
(Scan.one Symbol.is_regular)) >> (Pretty o str o implode)))
|
berghofe@11520
|
956 |
(Symbol.explode s) of
|
berghofe@11520
|
957 |
(p, []) => p
|
berghofe@11520
|
958 |
| _ => error ("Malformed annotation: " ^ quote s));
|
berghofe@11520
|
959 |
|
wenzelm@15801
|
960 |
|
wenzelm@36950
|
961 |
val _ = List.app Keyword.keyword ["attach", "file", "contains"];
|
wenzelm@24867
|
962 |
|
wenzelm@28375
|
963 |
fun strip_whitespace s = implode (fst (take_suffix (fn c => c = "\n" orelse c = " ")
|
wenzelm@28375
|
964 |
(snd (take_prefix (fn c => c = "\n" orelse c = " ") (explode s))))) ^ "\n";
|
berghofe@16769
|
965 |
|
wenzelm@36950
|
966 |
val parse_attach = Scan.repeat (Parse.$$$ "attach" |--
|
wenzelm@36950
|
967 |
Scan.optional (Parse.$$$ "(" |-- Parse.xname --| Parse.$$$ ")") "" --
|
wenzelm@36950
|
968 |
(Parse.verbatim >> strip_whitespace));
|
berghofe@16769
|
969 |
|
wenzelm@24867
|
970 |
val _ =
|
wenzelm@36953
|
971 |
Outer_Syntax.command "types_code"
|
wenzelm@36950
|
972 |
"associate types with target language types" Keyword.thy_decl
|
wenzelm@36950
|
973 |
(Scan.repeat1 (Parse.xname --| Parse.$$$ "(" -- Parse.string --| Parse.$$$ ")" -- parse_attach) >>
|
haftmann@22921
|
974 |
(fn xs => Toplevel.theory (fn thy => fold (assoc_type o
|
haftmann@22921
|
975 |
(fn ((name, mfx), aux) => (name, (parse_mixfix
|
wenzelm@24707
|
976 |
(Syntax.read_typ_global thy) mfx, aux)))) xs thy)));
|
berghofe@11520
|
977 |
|
wenzelm@24867
|
978 |
val _ =
|
wenzelm@36953
|
979 |
Outer_Syntax.command "consts_code"
|
wenzelm@36950
|
980 |
"associate constants with target language code" Keyword.thy_decl
|
berghofe@11520
|
981 |
(Scan.repeat1
|
wenzelm@36950
|
982 |
(Parse.term --|
|
wenzelm@36950
|
983 |
Parse.$$$ "(" -- Parse.string --| Parse.$$$ ")" -- parse_attach) >>
|
wenzelm@25376
|
984 |
(fn xs => Toplevel.theory (fn thy => fold (assoc_const o
|
haftmann@22921
|
985 |
(fn ((const, mfx), aux) =>
|
berghofe@28640
|
986 |
(const, (parse_mixfix (Syntax.read_term_global thy) mfx, aux)))) xs thy)));
|
berghofe@11520
|
987 |
|
berghofe@17144
|
988 |
fun parse_code lib =
|
wenzelm@36950
|
989 |
Scan.optional (Parse.$$$ "(" |-- Parse.enum "," Parse.xname --| Parse.$$$ ")") (!mode) --
|
wenzelm@36950
|
990 |
(if lib then Scan.optional Parse.name "" else Parse.name) --
|
wenzelm@36950
|
991 |
Scan.option (Parse.$$$ "file" |-- Parse.name) --
|
berghofe@17144
|
992 |
(if lib then Scan.succeed []
|
wenzelm@36950
|
993 |
else Scan.optional (Parse.$$$ "imports" |-- Scan.repeat1 Parse.name) []) --|
|
wenzelm@36950
|
994 |
Parse.$$$ "contains" --
|
wenzelm@36950
|
995 |
( Scan.repeat1 (Parse.name --| Parse.$$$ "=" -- Parse.term)
|
wenzelm@36950
|
996 |
|| Scan.repeat1 (Parse.term >> pair "")) >>
|
berghofe@17144
|
997 |
(fn ((((mode', module), opt_fname), modules), xs) => Toplevel.theory (fn thy =>
|
wenzelm@28271
|
998 |
let
|
wenzelm@28271
|
999 |
val mode'' = (if lib then insert (op =) "library" else I) (remove (op =) "library" mode');
|
wenzelm@32966
|
1000 |
val (code, gr) = setmp_CRITICAL mode mode'' (generate_code thy modules module) xs;
|
wenzelm@28271
|
1001 |
val thy' = thy |> Context.theory_map (ML_Context.exec (fn () =>
|
wenzelm@28271
|
1002 |
(case opt_fname of
|
wenzelm@37199
|
1003 |
NONE => ML_Context.eval_text false Position.none (cat_lines (map snd code))
|
wenzelm@28271
|
1004 |
| SOME fname =>
|
wenzelm@28271
|
1005 |
if lib then app (fn (name, s) => File.write
|
wenzelm@28271
|
1006 |
(Path.append (Path.explode fname) (Path.basic (name ^ ".ML"))) s)
|
wenzelm@28271
|
1007 |
(("ROOT", implode (map (fn (name, _) =>
|
wenzelm@28271
|
1008 |
"use \"" ^ name ^ ".ML\";\n") code)) :: code)
|
wenzelm@28271
|
1009 |
else File.write (Path.explode fname) (snd (hd code)))));
|
wenzelm@28271
|
1010 |
in
|
wenzelm@28271
|
1011 |
if lib then thy'
|
wenzelm@28271
|
1012 |
else map_modules (Symtab.update (module, gr)) thy'
|
wenzelm@28271
|
1013 |
end));
|
berghofe@17144
|
1014 |
|
haftmann@28227
|
1015 |
val setup = add_codegen "default" default_codegen
|
haftmann@28227
|
1016 |
#> add_tycodegen "default" default_tycodegen
|
berghofe@28640
|
1017 |
#> add_preprocessor unfold_preprocessor;
|
haftmann@28227
|
1018 |
|
wenzelm@24867
|
1019 |
val _ =
|
wenzelm@36953
|
1020 |
Outer_Syntax.command "code_library"
|
wenzelm@38193
|
1021 |
"generate code for terms (one structure for each theory)" Keyword.thy_decl
|
berghofe@17144
|
1022 |
(parse_code true);
|
berghofe@17144
|
1023 |
|
wenzelm@24867
|
1024 |
val _ =
|
wenzelm@36953
|
1025 |
Outer_Syntax.command "code_module"
|
wenzelm@38193
|
1026 |
"generate code for terms (single structure, incremental)" Keyword.thy_decl
|
berghofe@17144
|
1027 |
(parse_code false);
|
berghofe@11520
|
1028 |
|
berghofe@11520
|
1029 |
end;
|