20353
|
1 |
(* Title: Pure/Tools/codegen_names.ML
|
|
2 |
ID: $Id$
|
|
3 |
Author: Florian Haftmann, TU Muenchen
|
|
4 |
|
20386
|
5 |
Name policies for code generation: prefixing any name by corresponding theory name,
|
20855
|
6 |
conversion to alphanumeric representation, shallow name spaces.
|
|
7 |
Mappings are incrementally cached.
|
20353
|
8 |
*)
|
|
9 |
|
|
10 |
signature CODEGEN_NAMES =
|
|
11 |
sig
|
20386
|
12 |
type tyco = string
|
|
13 |
type const = string
|
20353
|
14 |
val class: theory -> class -> class
|
20697
|
15 |
val class_rev: theory -> class -> class option
|
20353
|
16 |
val tyco: theory -> tyco -> tyco
|
20697
|
17 |
val tyco_rev: theory -> tyco -> tyco option
|
20353
|
18 |
val instance: theory -> class * tyco -> string
|
20697
|
19 |
val instance_rev: theory -> string -> (class * tyco) option
|
20585
|
20 |
val const: theory -> CodegenConsts.const -> const
|
20697
|
21 |
val const_rev: theory -> const -> CodegenConsts.const option
|
20353
|
22 |
val purify_var: string -> string
|
21014
|
23 |
val check_modulename: string -> string
|
20697
|
24 |
val has_nsp: string -> string -> bool
|
|
25 |
val nsp_class: string
|
|
26 |
val nsp_tyco: string
|
|
27 |
val nsp_inst: string
|
|
28 |
val nsp_fun: string
|
|
29 |
val nsp_dtco: string
|
20353
|
30 |
end;
|
|
31 |
|
|
32 |
structure CodegenNames: CODEGEN_NAMES =
|
|
33 |
struct
|
|
34 |
|
|
35 |
|
|
36 |
(* theory data *)
|
|
37 |
|
|
38 |
type tyco = string;
|
|
39 |
type const = string;
|
|
40 |
val inst_ord = prod_ord fast_string_ord fast_string_ord;
|
|
41 |
val eq_inst = is_equal o inst_ord;
|
20386
|
42 |
structure Consttab = CodegenConsts.Consttab;
|
20353
|
43 |
|
|
44 |
structure Insttab =
|
|
45 |
TableFun(
|
|
46 |
type key = class * tyco;
|
|
47 |
val ord = inst_ord;
|
|
48 |
);
|
|
49 |
|
|
50 |
datatype names = Names of {
|
|
51 |
class: class Symtab.table * class Symtab.table,
|
|
52 |
tyco: tyco Symtab.table * tyco Symtab.table,
|
|
53 |
instance: string Insttab.table * (class * tyco) Symtab.table,
|
|
54 |
const: const Consttab.table * (string * typ list) Symtab.table
|
|
55 |
}
|
|
56 |
|
|
57 |
val empty_names = Names {
|
|
58 |
class = (Symtab.empty, Symtab.empty),
|
|
59 |
tyco = (Symtab.empty, Symtab.empty),
|
|
60 |
instance = (Insttab.empty, Symtab.empty),
|
|
61 |
const = (Consttab.empty, Symtab.empty)
|
|
62 |
};
|
|
63 |
|
|
64 |
local
|
|
65 |
fun mk_names (class, tyco, instance, const) =
|
|
66 |
Names { class = class, tyco = tyco, instance = instance, const = const};
|
|
67 |
fun map_names f (Names { class, tyco, instance, const }) =
|
|
68 |
mk_names (f (class, tyco, instance, const));
|
|
69 |
val eq_string = op = : string * string -> bool;
|
|
70 |
in
|
|
71 |
fun merge_names (Names { class = (class1, classrev1), tyco = (tyco1, tycorev1),
|
|
72 |
instance = (instance1, instancerev1), const = (const1, constrev1) },
|
|
73 |
Names { class = (class2, classrev2), tyco = (tyco2, tycorev2),
|
|
74 |
instance = (instance2, instancerev2), const = (const2, constrev2) }) =
|
|
75 |
mk_names ((Symtab.merge eq_string (class1, class2), Symtab.merge eq_string (classrev1, classrev2)),
|
|
76 |
(Symtab.merge eq_string (tyco1, tyco2), Symtab.merge eq_string (tycorev1, tycorev2)),
|
|
77 |
(Insttab.merge eq_string (instance1, instance2), Symtab.merge eq_inst (instancerev1, instancerev2)),
|
20386
|
78 |
(Consttab.merge eq_string (const1, const2), Symtab.merge CodegenConsts.eq_const (constrev1, constrev2)));
|
20353
|
79 |
fun map_class f = map_names
|
|
80 |
(fn (class, tyco, inst, const) => (f class, tyco, inst, const));
|
|
81 |
fun map_tyco f = map_names
|
|
82 |
(fn (class, tyco, inst, const) => (class, f tyco, inst, const));
|
|
83 |
fun map_inst f = map_names
|
|
84 |
(fn (class, tyco, inst, const) => (class, tyco, f inst, const));
|
|
85 |
fun map_const f = map_names
|
|
86 |
(fn (class, tyco, inst, const) => (class, tyco, inst, f const));
|
|
87 |
|
|
88 |
end; (*local*)
|
|
89 |
|
20456
|
90 |
structure CodeName = TheoryDataFun
|
20353
|
91 |
(struct
|
|
92 |
val name = "Pure/codegen_names";
|
|
93 |
type T = names ref;
|
|
94 |
val empty = ref empty_names;
|
|
95 |
fun copy (ref names) = ref names;
|
|
96 |
val extend = copy;
|
|
97 |
fun merge _ (ref names1, ref names2) = ref (merge_names (names1, names2));
|
|
98 |
fun print _ _ = ();
|
|
99 |
end);
|
|
100 |
|
20456
|
101 |
val _ = Context.add_setup CodeName.init;
|
20353
|
102 |
|
|
103 |
|
|
104 |
(* forward lookup with cache update *)
|
|
105 |
|
|
106 |
fun get thy get_tabs get upd_names upd policy x =
|
|
107 |
let
|
20456
|
108 |
val names_ref = CodeName.get thy
|
20353
|
109 |
val (Names names) = ! names_ref;
|
|
110 |
fun mk_unique used name =
|
|
111 |
let
|
|
112 |
fun mk_name 0 = name
|
|
113 |
| mk_name i = name ^ "_" ^ string_of_int i
|
|
114 |
fun find_name i =
|
|
115 |
let
|
|
116 |
val name = mk_name i
|
|
117 |
in
|
|
118 |
if used name
|
|
119 |
then find_name (i+1)
|
|
120 |
else name
|
|
121 |
end;
|
|
122 |
val name = find_name 0;
|
|
123 |
in name end;
|
|
124 |
val tabs = get_tabs names;
|
|
125 |
fun declare name =
|
|
126 |
let
|
|
127 |
val names' = upd_names (K (upd (x, name) (fst tabs),
|
|
128 |
Symtab.update_new (name, x) (snd tabs))) (Names names)
|
|
129 |
in (names_ref := names'; name) end;
|
|
130 |
in case get (fst tabs) x
|
|
131 |
of SOME name => name
|
|
132 |
| NONE => let
|
|
133 |
val used = Symtab.defined (snd tabs);
|
|
134 |
val raw_name = policy thy x;
|
|
135 |
val name = mk_unique used raw_name;
|
|
136 |
in declare name end
|
|
137 |
end;
|
|
138 |
|
|
139 |
|
|
140 |
(* backward lookup *)
|
|
141 |
|
|
142 |
fun rev thy get_tabs errname name =
|
|
143 |
let
|
20456
|
144 |
val names_ref = CodeName.get thy
|
20353
|
145 |
val (Names names) = ! names_ref;
|
|
146 |
val tab = (snd o get_tabs) names;
|
|
147 |
in case Symtab.lookup tab name
|
|
148 |
of SOME x => x
|
20389
|
149 |
| NONE => error ("No such " ^ errname ^ ": " ^ quote name)
|
20353
|
150 |
end;
|
|
151 |
|
|
152 |
|
|
153 |
(* theory name lookup *)
|
|
154 |
|
|
155 |
fun thyname_of thy f errmsg x =
|
|
156 |
let
|
|
157 |
fun thy_of thy =
|
|
158 |
if f thy x then case get_first thy_of (Theory.parents_of thy)
|
|
159 |
of NONE => SOME thy
|
|
160 |
| thy => thy
|
|
161 |
else NONE;
|
|
162 |
in case thy_of thy
|
|
163 |
of SOME thy => Context.theory_name thy
|
|
164 |
| NONE => error (errmsg x) end;
|
|
165 |
|
|
166 |
fun thyname_of_class thy =
|
|
167 |
thyname_of thy (fn thy => member (op =) (Sign.classes thy))
|
|
168 |
(fn class => "thyname_of_class: no such class: " ^ quote class);
|
|
169 |
|
|
170 |
fun thyname_of_tyco thy =
|
|
171 |
thyname_of thy Sign.declared_tyname
|
|
172 |
(fn tyco => "thyname_of_tyco: no such type constructor: " ^ quote tyco);
|
|
173 |
|
|
174 |
fun thyname_of_instance thy =
|
|
175 |
let
|
|
176 |
fun test_instance thy (class, tyco) =
|
|
177 |
can (Sorts.mg_domain (Sign.classes_of thy) tyco) [class]
|
|
178 |
in thyname_of thy test_instance
|
|
179 |
(fn (class, tyco) => "thyname_of_instance: no such instance: " ^ quote class ^ ", " ^ quote tyco)
|
|
180 |
end;
|
|
181 |
|
|
182 |
fun thyname_of_const thy =
|
|
183 |
thyname_of thy Sign.declared_const
|
|
184 |
(fn c => "thyname_of_const: no such constant: " ^ quote c);
|
|
185 |
|
|
186 |
|
|
187 |
(* purification of identifiers *)
|
|
188 |
|
|
189 |
val purify_name =
|
|
190 |
let
|
|
191 |
fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s orelse s = "'";
|
|
192 |
val is_junk = not o is_valid andf Symbol.not_eof;
|
|
193 |
val junk = Scan.any is_junk;
|
|
194 |
val scan_valids = Symbol.scanner "Malformed input"
|
|
195 |
((junk |--
|
|
196 |
(Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.any is_valid >> implode)
|
|
197 |
--| junk))
|
|
198 |
-- Scan.repeat ((Scan.any1 is_valid >> implode) --| junk) >> op ::);
|
|
199 |
in explode #> scan_valids #> space_implode "_" end;
|
|
200 |
|
|
201 |
fun purify_op "0" = "zero"
|
|
202 |
| purify_op "1" = "one"
|
|
203 |
| purify_op s =
|
|
204 |
let
|
|
205 |
fun rep_op "+" = SOME "sum"
|
|
206 |
| rep_op "-" = SOME "diff"
|
|
207 |
| rep_op "*" = SOME "prod"
|
|
208 |
| rep_op "/" = SOME "quotient"
|
|
209 |
| rep_op "&" = SOME "conj"
|
|
210 |
| rep_op "|" = SOME "disj"
|
|
211 |
| rep_op "=" = SOME "eq"
|
|
212 |
| rep_op "~" = SOME "inv"
|
|
213 |
| rep_op "@" = SOME "append"
|
|
214 |
| rep_op s = NONE;
|
|
215 |
val scan_valids = Symbol.scanner "Malformed input"
|
20386
|
216 |
(Scan.repeat (Scan.some rep_op || Scan.one Symbol.not_eof));
|
20353
|
217 |
in (explode #> scan_valids #> implode) s end;
|
|
218 |
|
21014
|
219 |
val purify_lower =
|
|
220 |
explode
|
|
221 |
#> (fn cs => (if forall Symbol.is_ascii_upper cs
|
|
222 |
then map else nth_map 0) Symbol.to_ascii_lower cs)
|
|
223 |
#> implode;
|
|
224 |
|
20353
|
225 |
val purify_upper = explode #> nth_map 0 Symbol.to_ascii_upper #> implode;
|
|
226 |
|
21014
|
227 |
fun check_modulename mn =
|
|
228 |
let
|
|
229 |
val mns = NameSpace.unpack mn;
|
|
230 |
val mns' = map purify_upper mns;
|
|
231 |
in
|
21121
|
232 |
if mns' = mns then mn else error ("Invalid module name: " ^ quote mn ^ "\n"
|
|
233 |
^ "perhaps try " ^ quote (NameSpace.pack mns'))
|
21014
|
234 |
end
|
|
235 |
|
|
236 |
|
20389
|
237 |
fun purify_var "" = "x"
|
|
238 |
| purify_var v =
|
|
239 |
if nth (explode v) 0 = "'"
|
|
240 |
then (unprefix "'" #> purify_name #> purify_lower #> prefix "'") v
|
|
241 |
else (purify_name #> purify_lower) v;
|
20353
|
242 |
|
|
243 |
val purify_idf = purify_op #> purify_name;
|
|
244 |
val purify_prefix = map (purify_idf #> purify_upper);
|
|
245 |
val purify_base = purify_idf #> purify_lower;
|
|
246 |
|
|
247 |
|
|
248 |
(* naming policies *)
|
|
249 |
|
|
250 |
fun policy thy get_basename get_thyname name =
|
|
251 |
let
|
|
252 |
val prefix = (purify_prefix o NameSpace.unpack o get_thyname thy) name;
|
|
253 |
val base = (purify_base o get_basename) name;
|
|
254 |
in NameSpace.pack (prefix @ [base]) end;
|
|
255 |
|
|
256 |
fun class_policy thy = policy thy NameSpace.base thyname_of_class;
|
|
257 |
fun tyco_policy thy = policy thy NameSpace.base thyname_of_tyco;
|
|
258 |
fun instance_policy thy = policy thy (fn (class, tyco) =>
|
|
259 |
NameSpace.base class ^ "_" ^ NameSpace.base tyco) thyname_of_instance;
|
|
260 |
|
20585
|
261 |
fun force_thyname thy (c, tys) =
|
|
262 |
case AxClass.class_of_param thy c
|
|
263 |
of SOME class => (case tys
|
|
264 |
of [Type (tyco, _)] => SOME (thyname_of_instance thy (class, tyco))
|
|
265 |
| _ => NONE)
|
|
266 |
| NONE => (case CodegenConsts.find_def thy (c, tys)
|
|
267 |
of SOME ((thyname, _), _) => SOME thyname
|
|
268 |
| NONE => NONE);
|
20386
|
269 |
|
20353
|
270 |
fun const_policy thy (c, tys) =
|
20386
|
271 |
case force_thyname thy (c, tys)
|
20353
|
272 |
of NONE => policy thy NameSpace.base thyname_of_const c
|
|
273 |
| SOME thyname => let
|
|
274 |
val prefix = (purify_prefix o NameSpace.unpack) thyname;
|
|
275 |
val tycos = map_filter (fn Type (tyco, _) => SOME tyco | _ => NONE) tys;
|
20386
|
276 |
val base = map (purify_base o NameSpace.base) (c :: tycos);
|
|
277 |
in NameSpace.pack (prefix @ [space_implode "_" base]) end;
|
20353
|
278 |
|
|
279 |
|
20697
|
280 |
(* shallow name spaces *)
|
|
281 |
|
|
282 |
val nsp_class = "class";
|
|
283 |
val nsp_tyco = "tyco";
|
|
284 |
val nsp_inst = "inst";
|
|
285 |
val nsp_fun = "fun";
|
|
286 |
val nsp_dtco = "dtco";
|
|
287 |
|
|
288 |
fun add_nsp shallow name =
|
|
289 |
name
|
|
290 |
|> NameSpace.unpack
|
|
291 |
|> split_last
|
|
292 |
|> apsnd (single #> cons shallow)
|
|
293 |
|> (op @)
|
|
294 |
|> NameSpace.pack;
|
|
295 |
|
|
296 |
fun dest_nsp nsp nspname =
|
|
297 |
let
|
|
298 |
val xs = NameSpace.unpack nspname;
|
|
299 |
val (ys, base) = split_last xs;
|
|
300 |
val (module, shallow) = split_last ys;
|
|
301 |
in
|
|
302 |
if nsp = shallow
|
|
303 |
then (SOME o NameSpace.pack) (module @ [base])
|
|
304 |
else NONE
|
|
305 |
end;
|
|
306 |
|
|
307 |
val has_nsp = is_some oo dest_nsp;
|
|
308 |
|
|
309 |
fun if_nsp nsp f idf =
|
|
310 |
Option.map f (dest_nsp nsp idf);
|
|
311 |
|
|
312 |
|
20353
|
313 |
(* external interfaces *)
|
|
314 |
|
|
315 |
fun class thy =
|
20697
|
316 |
get thy #class Symtab.lookup map_class Symtab.update class_policy
|
|
317 |
#> add_nsp nsp_class;
|
20353
|
318 |
fun tyco thy =
|
20697
|
319 |
get thy #tyco Symtab.lookup map_tyco Symtab.update tyco_policy
|
|
320 |
#> add_nsp nsp_tyco;
|
20353
|
321 |
fun instance thy =
|
20697
|
322 |
get thy #instance Insttab.lookup map_inst Insttab.update instance_policy
|
|
323 |
#> add_nsp nsp_inst;
|
|
324 |
fun const thy c_ty = case CodegenConsts.norm thy c_ty
|
|
325 |
of (c_tys as (c, tys)) => add_nsp (if (is_some o CodegenData.get_datatype_of_constr thy) c_tys
|
|
326 |
then nsp_dtco
|
|
327 |
else nsp_fun)
|
|
328 |
(get thy #const Consttab.lookup map_const Consttab.update const_policy c_tys);
|
20353
|
329 |
|
20697
|
330 |
fun class_rev thy =
|
|
331 |
dest_nsp nsp_class
|
|
332 |
#> Option.map (rev thy #class "class");
|
|
333 |
fun tyco_rev thy =
|
|
334 |
dest_nsp nsp_tyco
|
|
335 |
#> Option.map (rev thy #tyco "type constructor");
|
|
336 |
fun instance_rev thy =
|
|
337 |
dest_nsp nsp_inst
|
|
338 |
#> Option.map (rev thy #instance "instance");
|
|
339 |
fun const_rev thy nspname =
|
|
340 |
(case dest_nsp nsp_fun nspname
|
|
341 |
of name as SOME _ => name
|
|
342 |
| _ => (case dest_nsp nsp_dtco nspname
|
|
343 |
of name as SOME _ => name
|
21081
|
344 |
| _ => NONE))
|
20697
|
345 |
|> Option.map (rev thy #const "constant");
|
20353
|
346 |
|
|
347 |
end;
|