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
|
(* 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 Defunc :> DEFUNC = struct
open Core
structure E = CoreEnv
structure U = CoreUtil
structure IS = IntBinarySet
val functionInside = U.Con.exists {kind = fn _ => false,
con = fn TFun _ => true
| CFfi ("Basis", "transaction") => true
| _ => false}
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
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 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
fun default (_, x, st) = (x, st)
datatype 'a search =
Yes
| No
| Maybe of 'a
structure EK = struct
type ord_key = exp
val compare = U.Exp.compare
end
structure EM = BinaryMapFn(EK)
type state = {
maxName : int,
funcs : int EM.map,
vis : (string * int * con * exp * string) list
}
fun exp (env, e, st) =
case e of
ERecord xes =>
let
val (xes, st) =
ListUtil.foldlMap
(fn (tup as (fnam as (CName x, loc), e, xt), st) =>
if (x <> "Link" andalso x <> "Action")
orelse case #1 e of
ENamed _ => true
| _ => false then
(tup, st)
else
let
fun needsAttention (e, _) =
case e of
ENamed f => Maybe (#2 (E.lookupENamed env f))
| EApp (f, _) =>
(case needsAttention f of
No => No
| Yes => Yes
| Maybe t =>
case t of
(TFun (dom, _), _) =>
if functionInside dom then
Yes
else
No
| _ => No)
| _ => No
fun headSymbol (e, _) =
case e of
ENamed f => f
| EApp (e, _) => headSymbol e
| _ => raise Fail "Defunc: headSymbol"
fun rtype (e, _) =
case e of
ENamed f => #2 (E.lookupENamed env f)
| EApp (f, _) =>
(case rtype f of
(TFun (_, ran), _) => ran
| _ => raise Fail "Defunc: rtype [1]")
| _ => raise Fail "Defunc: rtype [2]"
in
(*Print.prefaces "Found one!"
[("e", CorePrint.p_exp env e)];*)
case needsAttention e of
Yes =>
let
(*val () = print "Yes\n"*)
val f = headSymbol e
val fvs = IS.listItems (freeVars e)
val e = squish fvs e
val (e, t) = foldl (fn (n, (e, t)) =>
let
val (x, xt) = E.lookupERel env n
in
((EAbs (x, xt, t, e), loc),
(TFun (xt, t), loc))
end)
(e, rtype e) fvs
val (f', st) =
case EM.find (#funcs st, e) of
SOME f' => (f', st)
| NONE =>
let
val (fx, _, _, tag) = E.lookupENamed env f
val f' = #maxName st
val vi = (fx, f', t, e, tag)
in
(f', {maxName = f' + 1,
funcs = EM.insert (#funcs st, e, f'),
vis = vi :: #vis st})
end
val e = foldr (fn (n, e) =>
(EApp (e, (ERel n, loc)), loc))
(ENamed f', loc) fvs
in
(*app (fn n => Print.prefaces
"Free"
[("n", CorePrint.p_exp env (ERel n, ErrorMsg.dummySpan))])
fvs;
Print.prefaces "Squished"
[("e", CorePrint.p_exp CoreEnv.empty e)];*)
((fnam, e, xt), st)
end
| _ => (tup, st)
end
| (tup, st) => (tup, st))
st xes
in
(ERecord xes, st)
end
| _ => (e, st)
fun bind (env, b) =
case b of
U.Decl.RelC (x, k) => E.pushCRel env x k
| U.Decl.NamedC (x, n, k, co) => E.pushCNamed env x n k co
| U.Decl.RelE (x, t) => E.pushERel env x t
| U.Decl.NamedE (x, n, t, eo, s) => E.pushENamed env x n t eo s
fun doDecl env = U.Decl.foldMapB {kind = fn x => x,
con = default,
exp = exp,
decl = default,
bind = bind}
env
fun defunc file =
let
fun doDecl' (d, (env, st)) =
let
val env = E.declBinds env d
val (d, st) = doDecl env st d
val ds =
case #vis st of
[] => [d]
| vis =>
case d of
(DValRec vis', loc) => [(DValRec (vis' @ vis), loc)]
| _ => [(DValRec vis, #2 d), d]
in
(ds,
(env,
{maxName = #maxName st,
funcs = #funcs st,
vis = []}))
end
val (file, _) = ListUtil.foldlMapConcat doDecl'
(E.empty,
{maxName = U.File.maxName file + 1,
funcs = EM.empty,
vis = []})
file
in
file
end
end
|