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
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
|
(* 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 ESpecialize :> ESPECIALIZE = struct
open Core
structure E = CoreEnv
structure U = CoreUtil
type skey = exp
structure K = struct
type ord_key = exp list
val compare = Order.joinL U.Exp.compare
end
structure KM = BinaryMapFn(K)
structure IM = IntBinaryMap
structure IS = IntBinarySet
val freeVars = U.Exp.foldB {kind = fn (_, _, xs) => xs,
con = fn (_, _, xs) => xs,
exp = fn (bound, e, xs) =>
case e of
ERel x =>
if x >= bound then
IS.add (xs, x - bound)
else
xs
| _ => xs,
bind = fn (bound, b) =>
case b of
U.Exp.RelE _ => bound + 1
| _ => bound}
0 IS.empty
val isPoly = U.Decl.exists {kind = fn _ => false,
con = fn _ => false,
exp = fn ECAbs _ => true
| _ => false,
decl = fn _ => false}
fun positionOf (v : int, ls) =
let
fun pof (pos, ls) =
case ls of
[] => raise Fail "Defunc.positionOf"
| v' :: ls' =>
if v = v' then
pos
else
pof (pos + 1, ls')
in
pof (0, ls)
end
fun squish fvs =
U.Exp.mapB {kind = fn _ => fn k => k,
con = fn _ => fn c => c,
exp = fn bound => fn e =>
case e of
ERel x =>
if x >= bound then
ERel (positionOf (x - bound, fvs) + bound)
else
e
| _ => e,
bind = fn (bound, b) =>
case b of
U.Exp.RelE _ => bound + 1
| _ => bound}
0
type func = {
name : string,
args : int KM.map,
body : exp,
typ : con,
tag : string
}
type state = {
maxName : int,
funcs : func IM.map,
decls : (string * int * con * exp * string) list,
specialized : bool IM.map
}
fun default (_, x, st) = (x, st)
structure SS = BinarySetFn(struct
type ord_key = string
val compare = String.compare
end)
val mayNotSpec = ref SS.empty
fun specialize' specialized file =
let
fun bind (env, b) =
case b of
U.Decl.RelE xt => xt :: env
| _ => env
fun exp (env, e, st : state) =
let
(*val () = Print.prefaces "exp" [("e", CorePrint.p_exp CoreEnv.empty
(e, ErrorMsg.dummySpan))]*)
fun getApp e =
case e of
ENamed f => SOME (f, [])
| EApp (e1, e2) =>
(case getApp (#1 e1) of
NONE => NONE
| SOME (f, xs) => SOME (f, xs @ [e2]))
| _ => NONE
in
case getApp e of
NONE => ((*Print.prefaces "No" [("e", CorePrint.p_exp CoreEnv.empty
(e, ErrorMsg.dummySpan))];*)
(e, st))
| SOME (f, xs) =>
case IM.find (#funcs st, f) of
NONE => (e, st)
| SOME {name, args, body, typ, tag} =>
let
(*val () = Print.prefaces "Consider" [("e", CorePrint.p_exp CoreEnv.empty
(e, ErrorMsg.dummySpan))]*)
val functionInside = U.Con.exists {kind = fn _ => false,
con = fn TFun _ => true
| CFfi ("Basis", "transaction") => true
| CFfi ("Basis", "eq") => true
| CFfi ("Basis", "num") => true
| CFfi ("Basis", "ord") => true
| CFfi ("Basis", "show") => true
| CFfi ("Basis", "read") => true
| CFfi ("Basis", "sql_injectable_prim") => true
| CFfi ("Basis", "sql_injectable") => true
| _ => false}
val loc = ErrorMsg.dummySpan
fun findSplit av (xs, typ, fxs, fvs) =
case (#1 typ, xs) of
(TFun (dom, ran), e :: xs') =>
let
val av = case #1 e of
ERel _ => av
| _ => false
in
if functionInside dom orelse (av andalso case #1 e of
ERel _ => true
| _ => false) then
findSplit av (xs',
ran,
e :: fxs,
IS.union (fvs, freeVars e))
else
(rev fxs, xs, fvs)
end
| _ => (rev fxs, xs, fvs)
val (fxs, xs, fvs) = findSplit true (xs, typ, [], IS.empty)
val fxs' = map (squish (IS.listItems fvs)) fxs
in
(*Print.preface ("fxs'", Print.p_list (CorePrint.p_exp CoreEnv.empty) fxs');*)
if List.all (fn (ERel _, _) => true
| _ => false) fxs'
orelse (IS.numItems fvs >= length fxs
andalso IS.exists (fn n => functionInside (#2 (List.nth (env, n)))) fvs) then
(e, st)
else
case (KM.find (args, fxs'),
SS.member (!mayNotSpec, name) orelse IM.find (#specialized st, f) = SOME true) of
(SOME f', _) =>
let
val e = (ENamed f', loc)
val e = IS.foldr (fn (arg, e) => (EApp (e, (ERel arg, loc)), loc))
e fvs
val e = foldl (fn (arg, e) => (EApp (e, arg), loc))
e xs
in
(*Print.prefaces "Brand new (reuse)"
[("e'", CorePrint.p_exp CoreEnv.empty e)];*)
(#1 e, st)
end
| (_, true) => ((*Print.prefaces ("No(" ^ name ^ ")")
[("fxs'",
Print.p_list (CorePrint.p_exp CoreEnv.empty) fxs')];*)
(e, st))
| (NONE, false) =>
let
(*val () = Print.prefaces "New one"
[("f", Print.PD.string (Int.toString f)),
("mns", Print.p_list Print.PD.string
(SS.listItems (!mayNotSpec)))]*)
(*val () = Print.prefaces ("Yes(" ^ name ^ ")")
[("fxs'",
Print.p_list (CorePrint.p_exp CoreEnv.empty) fxs')]*)
fun subBody (body, typ, fxs') =
case (#1 body, #1 typ, fxs') of
(_, _, []) => SOME (body, typ)
| (EAbs (_, _, _, body'), TFun (_, typ'), x :: fxs'') =>
let
val body'' = E.subExpInExp (0, x) body'
in
subBody (body'',
typ',
fxs'')
end
| _ => NONE
in
case subBody (body, typ, fxs') of
NONE => (e, st)
| SOME (body', typ') =>
let
val f' = #maxName st
val args = KM.insert (args, fxs', f')
val funcs = IM.insert (#funcs st, f, {name = name,
args = args,
body = body,
typ = typ,
tag = tag})
val specialized = IM.insert (#specialized st, f', false)
val specialized = case IM.find (specialized, f) of
NONE => specialized
| SOME _ => IM.insert (specialized, f, true)
val st = {
maxName = f' + 1,
funcs = funcs,
decls = #decls st,
specialized = specialized
}
(*val () = Print.prefaces "specExp"
[("f", CorePrint.p_exp env (ENamed f, loc)),
("f'", CorePrint.p_exp env (ENamed f', loc)),
("xs", Print.p_list (CorePrint.p_exp env) xs),
("fxs'", Print.p_list
(CorePrint.p_exp E.empty) fxs'),
("e", CorePrint.p_exp env (e, loc))]*)
val (body', typ') = IS.foldl (fn (n, (body', typ')) =>
let
val (x, xt) = List.nth (env, n)
in
((EAbs (x, xt, typ', body'),
loc),
(TFun (xt, typ'), loc))
end)
(body', typ') fvs
val mns = !mayNotSpec
val () = mayNotSpec := SS.add (mns, name)
(*val () = Print.preface ("body'", CorePrint.p_exp CoreEnv.empty body')*)
val (body', st) = specExp env st body'
val () = mayNotSpec := mns
val e' = (ENamed f', loc)
val e' = IS.foldr (fn (arg, e) => (EApp (e, (ERel arg, loc)), loc))
e' fvs
val e' = foldl (fn (arg, e) => (EApp (e, arg), loc))
e' xs
(*val () = Print.prefaces "Brand new"
[("e'", CorePrint.p_exp CoreEnv.empty e'),
("e", CorePrint.p_exp CoreEnv.empty (e, loc)),
("body'", CorePrint.p_exp CoreEnv.empty body')]*)
in
(#1 e',
{maxName = #maxName st,
funcs = #funcs st,
decls = (name, f', typ', body', tag) :: #decls st,
specialized = #specialized st})
end
end
end
end
and specExp env = U.Exp.foldMapB {kind = default, con = default, exp = exp, bind = bind} env
val specDecl = U.Decl.foldMapB {kind = default, con = default, exp = exp, decl = default, bind = bind}
fun doDecl (d, (st : state, changed)) =
let
(*val befor = Time.now ()*)
val funcs = #funcs st
val funcs =
case #1 d of
DValRec vis =>
foldl (fn ((x, n, c, e, tag), funcs) =>
IM.insert (funcs, n, {name = x,
args = KM.empty,
body = e,
typ = c,
tag = tag}))
funcs vis
| _ => funcs
val st = {maxName = #maxName st,
funcs = funcs,
decls = [],
specialized = #specialized st}
(*val () = Print.prefaces "decl" [("d", CorePrint.p_decl CoreEnv.empty d)]*)
val (d', st) =
if isPoly d then
(d, st)
else
(mayNotSpec := SS.empty(*(case #1 d of
DValRec vis => foldl (fn ((x, _, _, _, _), mns) =>
SS.add (mns, x)) SS.empty vis
| DVal (x, _, _, _, _) => SS.singleton x
| _ => SS.empty)*);
specDecl [] st d
before mayNotSpec := SS.empty)
(*val () = print "/decl\n"*)
val funcs = #funcs st
val funcs =
case #1 d of
DVal (x, n, c, e as (EAbs _, _), tag) =>
IM.insert (funcs, n, {name = x,
args = KM.empty,
body = e,
typ = c,
tag = tag})
| DVal (_, n, _, (ENamed n', _), _) =>
(case IM.find (funcs, n') of
NONE => funcs
| SOME v => IM.insert (funcs, n, v))
| _ => funcs
val (changed, ds) =
case #decls st of
[] => (changed, [d'])
| vis =>
(true, case d' of
(DValRec vis', _) => [(DValRec (vis @ vis'), ErrorMsg.dummySpan)]
| _ => [(DValRec vis, ErrorMsg.dummySpan), d'])
in
(*Print.prefaces "doDecl" [("d", CorePrint.p_decl E.empty d),
("d'", CorePrint.p_decl E.empty d')];*)
(ds, ({maxName = #maxName st,
funcs = funcs,
decls = [],
specialized = #specialized st}, changed))
end
val (ds, (st, changed)) = ListUtil.foldlMapConcat doDecl
({maxName = U.File.maxName file + 1,
funcs = IM.empty,
decls = [],
specialized = specialized},
false)
file
in
(changed, ds, #specialized st)
end
fun specializeL specialized file =
let
val file = ReduceLocal.reduce file
(*val () = Print.prefaces "Intermediate" [("file", CorePrint.p_file CoreEnv.empty file)]*)
(*val file = ReduceLocal.reduce file*)
val (changed, file, specialized) = specialize' specialized file
(*val file = ReduceLocal.reduce file
val file = CoreUntangle.untangle file
val file = Shake.shake file*)
in
(*print "Round over\n";*)
if changed then
let
(*val file = ReduceLocal.reduce file*)
(*val () = Print.prefaces "Pre-untangle" [("file", CorePrint.p_file CoreEnv.empty file)]*)
val file = CoreUntangle.untangle file
(*val () = Print.prefaces "Post-untangle" [("file", CorePrint.p_file CoreEnv.empty file)]*)
val file = Shake.shake file
in
(*print "Again!\n";*)
specializeL specialized file
end
else
file
end
val specialize = specializeL IM.empty
end
|