1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
|
(* Copyright (c) 2008, Adam Chlipala
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - The names of contributors may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*)
structure Cjrize :> CJRIZE = struct
structure L = Mono
structure L' = Cjr
structure IM = IntBinaryMap
structure Sm :> sig
type t
val empty : t
val find : t * (string * L.typ) list * (string * L'.typ) list -> t * int
val declares : t -> (int * (string * L'.typ) list) list
end = struct
structure FM = BinaryMapFn(struct
type ord_key = L.typ
val compare = MonoUtil.Typ.compare
end)
type t = int * int FM.map * (int * (string * L'.typ) list) list
val empty : t = (1, FM.insert (FM.empty, (L.TRecord [], ErrorMsg.dummySpan), 0), [])
fun find ((n, m, ds), xts, xts') =
let
val t = (L.TRecord xts, ErrorMsg.dummySpan)
in
case FM.find (m, t) of
NONE => ((n+1, FM.insert (m, t, n), (n, xts') :: ds), n)
| SOME i => ((n, m, ds), i)
end
fun declares (_, _, ds) = ds
end
fun cifyTyp x =
let
fun cify dtmap ((t, loc), sm) =
case t of
L.TFun (t1, t2) =>
let
val (t1, sm) = cify dtmap (t1, sm)
val (t2, sm) = cify dtmap (t2, sm)
in
((L'.TFun (t1, t2), loc), sm)
end
| L.TRecord xts =>
let
val old_xts = xts
val (xts, sm) = ListUtil.foldlMap (fn ((x, t), sm) =>
let
val (t, sm) = cify dtmap (t, sm)
in
((x, t), sm)
end)
sm xts
val (sm, si) = Sm.find (sm, old_xts, xts)
in
((L'.TRecord si, loc), sm)
end
| L.TDatatype (n, ref (dk, xncs)) =>
(case IM.find (dtmap, n) of
SOME r => ((L'.TDatatype (dk, n, r), loc), sm)
| NONE =>
let
val r = ref []
val dtmap = IM.insert (dtmap, n, r)
val (xncs, sm) = ListUtil.foldlMap (fn ((x, n, to), sm) =>
case to of
NONE => ((x, n, NONE), sm)
| SOME t =>
let
val (t, sm) = cify dtmap (t, sm)
in
((x, n, SOME t), sm)
end)
sm xncs
in
r := xncs;
((L'.TDatatype (dk, n, r), loc), sm)
end)
| L.TFfi mx => ((L'.TFfi mx, loc), sm)
in
cify IM.empty x
end
val dummye = (L'.EPrim (Prim.Int 0), ErrorMsg.dummySpan)
fun cifyPatCon (pc, sm) =
case pc of
L.PConVar n => (L'.PConVar n, sm)
| L.PConFfi {mod = m, datatyp, con, arg} =>
let
val (arg, sm) =
case arg of
NONE => (NONE, sm)
| SOME t =>
let
val (t, sm) = cifyTyp (t, sm)
in
(SOME t, sm)
end
in
(L'.PConFfi {mod = m, datatyp = datatyp, con = con, arg = arg}, sm)
end
fun cifyPat ((p, loc), sm) =
case p of
L.PWild => ((L'.PWild, loc), sm)
| L.PVar (x, t) =>
let
val (t, sm) = cifyTyp (t, sm)
in
((L'.PVar (x, t), loc), sm)
end
| L.PPrim p => ((L'.PPrim p, loc), sm)
| L.PCon (dk, pc, NONE) =>
let
val (pc, sm) = cifyPatCon (pc, sm)
in
((L'.PCon (dk, pc, NONE), loc), sm)
end
| L.PCon (dk, pc, SOME p) =>
let
val (pc, sm) = cifyPatCon (pc, sm)
val (p, sm) = cifyPat (p, sm)
in
((L'.PCon (dk, pc, SOME p), loc), sm)
end
| L.PRecord xps =>
let
val (xps, sm) = ListUtil.foldlMap (fn ((x, p, t), sm) =>
let
val (p, sm) = cifyPat (p, sm)
val (t, sm) = cifyTyp (t, sm)
in
((x, p, t), sm)
end) sm xps
in
((L'.PRecord xps, loc), sm)
end
fun cifyExp ((e, loc), sm) =
case e of
L.EPrim p => ((L'.EPrim p, loc), sm)
| L.ERel n => ((L'.ERel n, loc), sm)
| L.ENamed n => ((L'.ENamed n, loc), sm)
| L.ECon (dk, pc, eo) =>
let
val (eo, sm) =
case eo of
NONE => (NONE, sm)
| SOME e =>
let
val (e, sm) = cifyExp (e, sm)
in
(SOME e, sm)
end
val (pc, sm) = cifyPatCon (pc, sm)
in
((L'.ECon (dk, pc, eo), loc), sm)
end
| L.EFfi mx => ((L'.EFfi mx, loc), sm)
| L.EFfiApp (m, x, es) =>
let
val (es, sm) = ListUtil.foldlMap cifyExp sm es
in
((L'.EFfiApp (m, x, es), loc), sm)
end
| L.EApp (e1, e2) =>
let
val (e1, sm) = cifyExp (e1, sm)
val (e2, sm) = cifyExp (e2, sm)
in
((L'.EApp (e1, e2), loc), sm)
end
| L.EAbs _ => (ErrorMsg.errorAt loc "Anonymous function remains at code generation";
(dummye, sm))
| L.ERecord xes =>
let
val old_xts = map (fn (x, _, t) => (x, t)) xes
val (xets, sm) = ListUtil.foldlMap (fn ((x, e, t), sm) =>
let
val (e, sm) = cifyExp (e, sm)
val (t, sm) = cifyTyp (t, sm)
in
((x, e, t), sm)
end)
sm xes
val (sm, si) = Sm.find (sm, old_xts, map (fn (x, _, t) => (x, t)) xets)
val xes = map (fn (x, e, _) => (x, e)) xets
val xes = ListMergeSort.sort (fn ((x1, _), (x2, _)) => String.compare (x1, x2) = GREATER) xes
in
((L'.ERecord (si, xes), loc), sm)
end
| L.EField (e, x) =>
let
val (e, sm) = cifyExp (e, sm)
in
((L'.EField (e, x), loc), sm)
end
| L.ECase (e, pes, {disc, result}) =>
let
val (e, sm) = cifyExp (e, sm)
val (pes, sm) = ListUtil.foldlMap
(fn ((p, e), sm) =>
let
val (e, sm) = cifyExp (e, sm)
val (p, sm) = cifyPat (p, sm)
in
((p, e), sm)
end) sm pes
val (disc, sm) = cifyTyp (disc, sm)
val (result, sm) = cifyTyp (result, sm)
in
((L'.ECase (e, pes, {disc = disc, result = result}), loc), sm)
end
| L.EStrcat (e1, e2) =>
let
val (e1, sm) = cifyExp (e1, sm)
val (e2, sm) = cifyExp (e2, sm)
in
((L'.EFfiApp ("Basis", "strcat", [e1, e2]), loc), sm)
end
| L.EWrite e =>
let
val (e, sm) = cifyExp (e, sm)
in
((L'.EWrite e, loc), sm)
end
| L.ESeq (e1, e2) =>
let
val (e1, sm) = cifyExp (e1, sm)
val (e2, sm) = cifyExp (e2, sm)
in
((L'.ESeq (e1, e2), loc), sm)
end
| L.ELet _ => raise Fail "Cjrize ELet"
| L.EClosure _ => (ErrorMsg.errorAt loc "Nested closure remains in code generation";
(dummye, sm))
| L.EQuery _ => raise Fail "Cjrize EQuery"
fun cifyDecl ((d, loc), sm) =
case d of
L.DDatatype (x, n, xncs) =>
let
val dk = ElabUtil.classifyDatatype xncs
val (xncs, sm) = ListUtil.foldlMap (fn ((x, n, to), sm) =>
case to of
NONE => ((x, n, NONE), sm)
| SOME t =>
let
val (t, sm) = cifyTyp (t, sm)
in
((x, n, SOME t), sm)
end) sm xncs
in
(SOME (L'.DDatatype (dk, x, n, xncs), loc), NONE, sm)
end
| L.DVal (x, n, t, e, _) =>
let
val (t, sm) = cifyTyp (t, sm)
val (d, sm) = case #1 t of
L'.TFun _ =>
let
fun unravel (tAll as (t, _), eAll as (e, _)) =
case (t, e) of
(L'.TFun (dom, ran), L.EAbs (ax, _, _, e)) =>
let
val (args, t, e) = unravel (ran, e)
in
((ax, dom) :: args, t, e)
end
| (L'.TFun _, _) =>
(ErrorMsg.errorAt loc "Function isn't explicit at code generation";
([], tAll, eAll))
| _ => ([], tAll, eAll)
val (args, ran, e) = unravel (t, e)
val (e, sm) = cifyExp (e, sm)
in
(L'.DFun (x, n, args, ran, e), sm)
end
| _ =>
let
val (e, sm) = cifyExp (e, sm)
in
(L'.DVal (x, n, t, e), sm)
end
in
(SOME (d, loc), NONE, sm)
end
| L.DValRec vis =>
let
val (vis, sm) = ListUtil.foldlMap
(fn ((x, n, t, e, _), sm) =>
let
val (t, sm) = cifyTyp (t, sm)
fun unravel (tAll as (t, _), eAll as (e, _)) =
case (t, e) of
(L'.TFun (dom, ran), L.EAbs (ax, _, _, e)) =>
let
val (args, t, e) = unravel (ran, e)
in
((ax, dom) :: args, t, e)
end
| (L'.TFun _, _) =>
(ErrorMsg.errorAt loc "Function isn't explicit at code generation";
([], tAll, eAll))
| _ => ([], tAll, eAll)
val (args, ran, e) = unravel (t, e)
val (e, sm) = cifyExp (e, sm)
in
((x, n, args, ran, e), sm)
end)
sm vis
in
(SOME (L'.DFunRec vis, loc), NONE, sm)
end
| L.DExport (ek, s, n, ts) =>
let
val (ts, sm) = ListUtil.foldlMap cifyTyp sm ts
in
(NONE, SOME (ek, "/" ^ s, n, ts), sm)
end
fun cjrize ds =
let
val (dsF, ds, ps, sm) = foldl (fn (d, (dsF, ds, ps, sm)) =>
let
val (dop, pop, sm) = cifyDecl (d, sm)
val (dsF, ds) = case dop of
NONE => (dsF, ds)
| SOME (d as (L'.DDatatype (dk, x, n, _), loc)) =>
((L'.DDatatypeForward (dk, x, n), loc) :: dsF,
d :: ds)
| SOME d => (dsF, d :: ds)
val ps = case pop of
NONE => ps
| SOME p => p :: ps
in
(dsF, ds, ps, sm)
end)
([], [], [], Sm.empty) ds
in
(List.revAppend (dsF,
List.revAppend (map (fn v => (L'.DStruct v, ErrorMsg.dummySpan)) (Sm.declares sm),
rev ds)),
ps)
end
end
|
