adamc@133
|
1 (* Copyright (c) 2008, Adam Chlipala
|
adamc@133
|
2 * All rights reserved.
|
adamc@133
|
3 *
|
adamc@133
|
4 * Redistribution and use in source and binary forms, with or without
|
adamc@133
|
5 * modification, are permitted provided that the following conditions are met:
|
adamc@133
|
6 *
|
adamc@133
|
7 * - Redistributions of source code must retain the above copyright notice,
|
adamc@133
|
8 * this list of conditions and the following disclaimer.
|
adamc@133
|
9 * - Redistributions in binary form must reproduce the above copyright notice,
|
adamc@133
|
10 * this list of conditions and the following disclaimer in the documentation
|
adamc@133
|
11 * and/or other materials provided with the distribution.
|
adamc@133
|
12 * - The names of contributors may not be used to endorse or promote products
|
adamc@133
|
13 * derived from this software without specific prior written permission.
|
adamc@133
|
14 *
|
adamc@133
|
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
adamc@133
|
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
adamc@133
|
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
adamc@133
|
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
adamc@133
|
19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
adamc@133
|
20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
adamc@133
|
21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
adamc@133
|
22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
adamc@133
|
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
adamc@133
|
24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
adamc@133
|
25 * POSSIBILITY OF SUCH DAMAGE.
|
adamc@133
|
26 *)
|
adamc@133
|
27
|
adamc@133
|
28 (* Simplify a Mono program algebraically *)
|
adamc@133
|
29
|
adamc@133
|
30 structure MonoReduce :> MONO_REDUCE = struct
|
adamc@133
|
31
|
adamc@133
|
32 open Mono
|
adamc@133
|
33
|
adamc@133
|
34 structure E = MonoEnv
|
adamc@133
|
35 structure U = MonoUtil
|
adamc@133
|
36
|
adamc@470
|
37 structure IM = IntBinaryMap
|
adamc@470
|
38
|
adamc@133
|
39
|
adamc@252
|
40 fun impure (e, _) =
|
adamc@252
|
41 case e of
|
adamc@252
|
42 EWrite _ => true
|
adamc@252
|
43 | EQuery _ => true
|
adamc@307
|
44 | EDml _ => true
|
adamc@338
|
45 | ENextval _ => true
|
adamc@463
|
46 | EUnurlify _ => true
|
adamc@252
|
47 | EAbs _ => false
|
adamc@252
|
48
|
adamc@252
|
49 | EPrim _ => false
|
adamc@252
|
50 | ERel _ => false
|
adamc@252
|
51 | ENamed _ => false
|
adamc@252
|
52 | ECon (_, _, eo) => (case eo of NONE => false | SOME e => impure e)
|
adamc@297
|
53 | ENone _ => false
|
adamc@290
|
54 | ESome (_, e) => impure e
|
adamc@252
|
55 | EFfi _ => false
|
adamc@462
|
56 | EFfiApp ("Basis", "set_cookie", _) => true
|
adamc@565
|
57 | EFfiApp ("Basis", "new_client_source", _) => true
|
adamc@690
|
58 | EFfiApp ("Basis", "get_client_source", _) => true
|
adamc@577
|
59 | EFfiApp ("Basis", "set_client_source", _) => true
|
adamc@579
|
60 | EFfiApp ("Basis", "alert", _) => true
|
adamc@668
|
61 | EFfiApp ("Basis", "new_channel", _) => true
|
adamc@668
|
62 | EFfiApp ("Basis", "subscribe", _) => true
|
adamc@668
|
63 | EFfiApp ("Basis", "send", _) => true
|
adamc@726
|
64 | EFfiApp ("Basis", "onError", _) => true
|
adamc@729
|
65 | EFfiApp ("Basis", "onFail", _) => true
|
adamc@729
|
66 | EFfiApp ("Basis", "onConnectFail", _) => true
|
adamc@729
|
67 | EFfiApp ("Basis", "onDisconnect", _) => true
|
adamc@729
|
68 | EFfiApp ("Basis", "onServerError", _) => true
|
adamc@252
|
69 | EFfiApp _ => false
|
adamc@252
|
70 | EApp ((EFfi _, _), _) => false
|
adamc@252
|
71 | EApp _ => true
|
adamc@252
|
72
|
adamc@387
|
73 | EUnop (_, e) => impure e
|
adamc@387
|
74 | EBinop (_, e1, e2) => impure e1 orelse impure e2
|
adamc@387
|
75
|
adamc@252
|
76 | ERecord xes => List.exists (fn (_, e, _) => impure e) xes
|
adamc@252
|
77 | EField (e, _) => impure e
|
adamc@252
|
78
|
adamc@252
|
79 | ECase (e, pes, _) => impure e orelse List.exists (fn (_, e) => impure e) pes
|
adamc@252
|
80
|
adamc@283
|
81 | EError (e, _) => impure e
|
adamc@283
|
82
|
adamc@252
|
83 | EStrcat (e1, e2) => impure e1 orelse impure e2
|
adamc@252
|
84
|
adamc@252
|
85 | ESeq (e1, e2) => impure e1 orelse impure e2
|
adamc@252
|
86 | ELet (_, _, e1, e2) => impure e1 orelse impure e2
|
adamc@252
|
87
|
adamc@252
|
88 | EClosure (_, es) => List.exists impure es
|
adamc@578
|
89 | EJavaScript (_, e, _) => impure e
|
adamc@568
|
90 | ESignalReturn e => impure e
|
adamc@572
|
91 | ESignalBind (e1, e2) => impure e1 orelse impure e2
|
adamc@574
|
92 | ESignalSource e => impure e
|
adamc@608
|
93 | EServerCall _ => true
|
adamc@670
|
94 | ERecv _ => true
|
adamc@695
|
95 | ESleep _ => true
|
adamc@252
|
96
|
adamc@252
|
97
|
adamc@252
|
98 val liftExpInExp = Monoize.liftExpInExp
|
adamc@252
|
99
|
adamc@252
|
100 val subExpInExp' =
|
adamc@133
|
101 U.Exp.mapB {typ = fn t => t,
|
adamc@133
|
102 exp = fn (xn, rep) => fn e =>
|
adamc@133
|
103 case e of
|
adamc@133
|
104 ERel xn' =>
|
adamc@133
|
105 (case Int.compare (xn', xn) of
|
adamc@133
|
106 EQUAL => #1 rep
|
adamc@133
|
107 | GREATER=> ERel (xn' - 1)
|
adamc@133
|
108 | LESS => e)
|
adamc@133
|
109 | _ => e,
|
adamc@133
|
110 bind = fn ((xn, rep), U.Exp.RelE _) => (xn+1, liftExpInExp 0 rep)
|
adamc@133
|
111 | (ctx, _) => ctx}
|
adamc@133
|
112
|
adamc@252
|
113 fun subExpInExp (n, e1) e2 =
|
adamc@252
|
114 let
|
adamc@252
|
115 val r = subExpInExp' (n, e1) e2
|
adamc@252
|
116 in
|
adamc@252
|
117 (*Print.prefaces "subExpInExp" [("e1", MonoPrint.p_exp MonoEnv.empty e1),
|
adamc@252
|
118 ("e2", MonoPrint.p_exp MonoEnv.empty e2),
|
adamc@252
|
119 ("r", MonoPrint.p_exp MonoEnv.empty r)];*)
|
adamc@252
|
120 r
|
adamc@252
|
121 end
|
adamc@133
|
122
|
adamc@133
|
123 fun typ c = c
|
adamc@133
|
124
|
adamc@316
|
125 val swapExpVars =
|
adamc@316
|
126 U.Exp.mapB {typ = fn t => t,
|
adamc@316
|
127 exp = fn lower => fn e =>
|
adamc@316
|
128 case e of
|
adamc@316
|
129 ERel xn =>
|
adamc@316
|
130 if xn = lower then
|
adamc@316
|
131 ERel (lower + 1)
|
adamc@316
|
132 else if xn = lower + 1 then
|
adamc@316
|
133 ERel lower
|
adamc@316
|
134 else
|
adamc@316
|
135 e
|
adamc@316
|
136 | _ => e,
|
adamc@316
|
137 bind = fn (lower, U.Exp.RelE _) => lower+1
|
adamc@316
|
138 | (lower, _) => lower}
|
adamc@316
|
139
|
adamc@341
|
140 val swapExpVarsPat =
|
adamc@341
|
141 U.Exp.mapB {typ = fn t => t,
|
adamc@341
|
142 exp = fn (lower, len) => fn e =>
|
adamc@341
|
143 case e of
|
adamc@341
|
144 ERel xn =>
|
adamc@341
|
145 if xn = lower then
|
adamc@341
|
146 ERel (lower + 1)
|
adamc@341
|
147 else if xn >= lower + 1 andalso xn < lower + 1 + len then
|
adamc@341
|
148 ERel (xn - 1)
|
adamc@341
|
149 else
|
adamc@341
|
150 e
|
adamc@341
|
151 | _ => e,
|
adamc@341
|
152 bind = fn ((lower, len), U.Exp.RelE _) => (lower+1, len)
|
adamc@341
|
153 | (st, _) => st}
|
adamc@341
|
154
|
adamc@258
|
155 datatype result = Yes of E.env | No | Maybe
|
adamc@258
|
156
|
adamc@183
|
157 fun match (env, p : pat, e : exp) =
|
adamc@183
|
158 case (#1 p, #1 e) of
|
adamc@258
|
159 (PWild, _) => Yes env
|
adamc@258
|
160 | (PVar (x, t), _) => Yes (E.pushERel env x t (SOME e))
|
adamc@183
|
161
|
adamc@280
|
162 | (PPrim (Prim.String s), EStrcat ((EPrim (Prim.String s'), _), _)) =>
|
adamc@280
|
163 if String.isPrefix s' s then
|
adamc@280
|
164 Maybe
|
adamc@280
|
165 else
|
adamc@280
|
166 No
|
adamc@280
|
167
|
adamc@183
|
168 | (PPrim p, EPrim p') =>
|
adamc@183
|
169 if Prim.equal (p, p') then
|
adamc@258
|
170 Yes env
|
adamc@183
|
171 else
|
adamc@258
|
172 No
|
adamc@183
|
173
|
adamc@188
|
174 | (PCon (_, PConVar n1, NONE), ECon (_, PConVar n2, NONE)) =>
|
adamc@183
|
175 if n1 = n2 then
|
adamc@258
|
176 Yes env
|
adamc@183
|
177 else
|
adamc@258
|
178 No
|
adamc@183
|
179
|
adamc@188
|
180 | (PCon (_, PConVar n1, SOME p), ECon (_, PConVar n2, SOME e)) =>
|
adamc@183
|
181 if n1 = n2 then
|
adamc@183
|
182 match (env, p, e)
|
adamc@183
|
183 else
|
adamc@258
|
184 No
|
adamc@183
|
185
|
adamc@188
|
186 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, NONE), ECon (_, PConFfi {mod = m2, con = con2, ...}, NONE)) =>
|
adamc@185
|
187 if m1 = m2 andalso con1 = con2 then
|
adamc@258
|
188 Yes env
|
adamc@185
|
189 else
|
adamc@258
|
190 No
|
adamc@185
|
191
|
adamc@188
|
192 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, SOME ep), ECon (_, PConFfi {mod = m2, con = con2, ...}, SOME e)) =>
|
adamc@185
|
193 if m1 = m2 andalso con1 = con2 then
|
adamc@185
|
194 match (env, p, e)
|
adamc@185
|
195 else
|
adamc@258
|
196 No
|
adamc@185
|
197
|
adamc@183
|
198 | (PRecord xps, ERecord xes) =>
|
adamc@183
|
199 let
|
adamc@183
|
200 fun consider (xps, env) =
|
adamc@183
|
201 case xps of
|
adamc@258
|
202 [] => Yes env
|
adamc@183
|
203 | (x, p, _) :: rest =>
|
adamc@183
|
204 case List.find (fn (x', _, _) => x' = x) xes of
|
adamc@258
|
205 NONE => No
|
adamc@183
|
206 | SOME (_, e, _) =>
|
adamc@183
|
207 case match (env, p, e) of
|
adamc@258
|
208 No => No
|
adamc@258
|
209 | Maybe => Maybe
|
adamc@258
|
210 | Yes env => consider (rest, env)
|
adamc@183
|
211 in
|
adamc@183
|
212 consider (xps, env)
|
adamc@183
|
213 end
|
adamc@183
|
214
|
adamc@726
|
215 | (PNone _, ENone _) => Yes env
|
adamc@726
|
216 | (PSome (_, p), ESome (_, e)) => match (env, p, e)
|
adamc@726
|
217
|
adamc@258
|
218 | _ => Maybe
|
adamc@183
|
219
|
adamc@318
|
220 datatype event =
|
adamc@318
|
221 WritePage
|
adamc@318
|
222 | ReadDb
|
adamc@318
|
223 | WriteDb
|
adamc@481
|
224 | UseRel
|
adamc@318
|
225 | Unsure
|
adamc@318
|
226
|
adamc@318
|
227 fun p_event e =
|
adamc@318
|
228 let
|
adamc@318
|
229 open Print.PD
|
adamc@318
|
230 in
|
adamc@318
|
231 case e of
|
adamc@318
|
232 WritePage => string "WritePage"
|
adamc@318
|
233 | ReadDb => string "ReadDb"
|
adamc@318
|
234 | WriteDb => string "WriteDb"
|
adamc@481
|
235 | UseRel => string "UseRel"
|
adamc@318
|
236 | Unsure => string "Unsure"
|
adamc@318
|
237 end
|
adamc@318
|
238
|
adamc@470
|
239 val p_events = Print.p_list p_event
|
adamc@470
|
240
|
adamc@318
|
241 fun patBinds (p, _) =
|
adamc@318
|
242 case p of
|
adamc@318
|
243 PWild => 0
|
adamc@318
|
244 | PVar _ => 1
|
adamc@318
|
245 | PPrim _ => 0
|
adamc@318
|
246 | PCon (_, _, NONE) => 0
|
adamc@318
|
247 | PCon (_, _, SOME p) => patBinds p
|
adamc@318
|
248 | PRecord xpts => foldl (fn ((_, p, _), n) => n + patBinds p) 0 xpts
|
adamc@318
|
249 | PNone _ => 0
|
adamc@318
|
250 | PSome (_, p) => patBinds p
|
adamc@318
|
251
|
adamc@470
|
252 fun reduce file =
|
adamc@470
|
253 let
|
adamc@470
|
254 fun countAbs (e, _) =
|
adamc@470
|
255 case e of
|
adamc@470
|
256 EAbs (_, _, _, e) => 1 + countAbs e
|
adamc@470
|
257 | _ => 0
|
adamc@318
|
258
|
adamc@470
|
259 val absCounts =
|
adamc@470
|
260 foldl (fn ((d, _), absCounts) =>
|
adamc@470
|
261 case d of
|
adamc@470
|
262 DVal (_, n, _, e, _) =>
|
adamc@470
|
263 IM.insert (absCounts, n, countAbs e)
|
adamc@470
|
264 | DValRec vis =>
|
adamc@470
|
265 foldl (fn ((_, n, _, e, _), absCounts) =>
|
adamc@470
|
266 IM.insert (absCounts, n, countAbs e))
|
adamc@470
|
267 absCounts vis
|
adamc@470
|
268 | _ => absCounts)
|
adamc@470
|
269 IM.empty file
|
adamc@387
|
270
|
adamc@470
|
271 fun summarize d (e, _) =
|
adamc@579
|
272 let
|
adamc@668
|
273 fun ffi es = List.concat (map (summarize d) es) @ [Unsure]
|
adamc@668
|
274
|
adamc@579
|
275 val s =
|
adamc@579
|
276 case e of
|
adamc@579
|
277 EPrim _ => []
|
adamc@579
|
278 | ERel n => if n = d then [UseRel] else []
|
adamc@579
|
279 | ENamed _ => []
|
adamc@579
|
280 | ECon (_, _, NONE) => []
|
adamc@579
|
281 | ECon (_, _, SOME e) => summarize d e
|
adamc@579
|
282 | ENone _ => []
|
adamc@579
|
283 | ESome (_, e) => summarize d e
|
adamc@579
|
284 | EFfi _ => []
|
adamc@668
|
285 | EFfiApp ("Basis", "set_cookie", es) => ffi es
|
adamc@668
|
286 | EFfiApp ("Basis", "new_client_source", es) => ffi es
|
adamc@690
|
287 | EFfiApp ("Basis", "get_client_source", es) => ffi es
|
adamc@668
|
288 | EFfiApp ("Basis", "set_client_source", es) => ffi es
|
adamc@668
|
289 | EFfiApp ("Basis", "alert", es) => ffi es
|
adamc@668
|
290 | EFfiApp ("Basis", "new_channel", es) => ffi es
|
adamc@668
|
291 | EFfiApp ("Basis", "subscribe", es) => ffi es
|
adamc@668
|
292 | EFfiApp ("Basis", "send", es) => ffi es
|
adamc@726
|
293 | EFfiApp ("Basis", "onError", es) => ffi es
|
adamc@729
|
294 | EFfiApp ("Basis", "onFail", es) => ffi es
|
adamc@729
|
295 | EFfiApp ("Basis", "onConnectFail", es) => ffi es
|
adamc@729
|
296 | EFfiApp ("Basis", "onDisconnect", es) => ffi es
|
adamc@729
|
297 | EFfiApp ("Basis", "onServerError", es) => ffi es
|
adamc@579
|
298 | EFfiApp (_, _, es) => List.concat (map (summarize d) es)
|
adamc@579
|
299 | EApp ((EFfi _, _), e) => summarize d e
|
adamc@579
|
300 | EApp _ =>
|
adamc@579
|
301 let
|
adamc@694
|
302 fun unravel (e, passed, ls) =
|
adamc@579
|
303 case e of
|
adamc@579
|
304 ENamed n =>
|
adamc@579
|
305 let
|
adamc@579
|
306 val ls = rev ls
|
adamc@579
|
307 in
|
adamc@579
|
308 case IM.find (absCounts, n) of
|
adamc@579
|
309 NONE => [Unsure]
|
adamc@579
|
310 | SOME len =>
|
adamc@694
|
311 if passed < len then
|
adamc@579
|
312 ls
|
adamc@579
|
313 else
|
adamc@694
|
314 ls @ [Unsure]
|
adamc@579
|
315 end
|
adamc@579
|
316 | ERel n => List.revAppend (ls,
|
adamc@579
|
317 if n = d then
|
adamc@579
|
318 [UseRel, Unsure]
|
adamc@579
|
319 else
|
adamc@579
|
320 [Unsure])
|
adamc@579
|
321 | EApp (f, x) =>
|
adamc@694
|
322 unravel (#1 f, passed + 1, summarize d x @ ls)
|
adamc@579
|
323 | _ => [Unsure]
|
adamc@579
|
324 in
|
adamc@694
|
325 unravel (e, 0, [])
|
adamc@579
|
326 end
|
adamc@252
|
327
|
adamc@579
|
328 | EAbs (_, _, _, e) => List.filter (fn UseRel => true
|
adamc@579
|
329 | _ => false) (summarize (d + 1) e)
|
adamc@316
|
330
|
adamc@579
|
331 | EUnop (_, e) => summarize d e
|
adamc@579
|
332 | EBinop (_, e1, e2) => summarize d e1 @ summarize d e2
|
adamc@470
|
333
|
adamc@579
|
334 | ERecord xets => List.concat (map (summarize d o #2) xets)
|
adamc@579
|
335 | EField (e, _) => summarize d e
|
adamc@470
|
336
|
adamc@579
|
337 | ECase (e, pes, _) =>
|
adamc@579
|
338 let
|
adamc@579
|
339 val lss = map (fn (p, e) => summarize (d + patBinds p) e) pes
|
adamc@579
|
340 in
|
adamc@579
|
341 case lss of
|
adamc@579
|
342 [] => raise Fail "Empty pattern match"
|
adamc@579
|
343 | ls :: lss =>
|
adamc@579
|
344 if List.all (fn ls' => ls' = ls) lss then
|
adamc@579
|
345 summarize d e @ ls
|
adamc@579
|
346 else
|
adamc@579
|
347 [Unsure]
|
adamc@579
|
348 end
|
adamc@579
|
349 | EStrcat (e1, e2) => summarize d e1 @ summarize d e2
|
adamc@316
|
350
|
adamc@579
|
351 | EError (e, _) => summarize d e @ [Unsure]
|
adamc@318
|
352
|
adamc@579
|
353 | EWrite e => summarize d e @ [WritePage]
|
adamc@579
|
354
|
adamc@579
|
355 | ESeq (e1, e2) => summarize d e1 @ summarize d e2
|
adamc@579
|
356 | ELet (_, _, e1, e2) => summarize d e1 @ summarize (d + 1) e2
|
adamc@456
|
357
|
adamc@579
|
358 | EClosure (_, es) => List.concat (map (summarize d) es)
|
adamc@470
|
359
|
adamc@579
|
360 | EQuery {query, body, initial, ...} =>
|
adamc@579
|
361 List.concat [summarize d query,
|
adamc@579
|
362 summarize (d + 2) body,
|
adamc@579
|
363 summarize d initial,
|
adamc@579
|
364 [ReadDb]]
|
adamc@470
|
365
|
adamc@579
|
366 | EDml e => summarize d e @ [WriteDb]
|
adamc@579
|
367 | ENextval e => summarize d e @ [WriteDb]
|
adamc@579
|
368 | EUnurlify (e, _) => summarize d e
|
adamc@579
|
369 | EJavaScript (_, e, _) => summarize d e
|
adamc@579
|
370 | ESignalReturn e => summarize d e
|
adamc@579
|
371 | ESignalBind (e1, e2) => summarize d e1 @ summarize d e2
|
adamc@579
|
372 | ESignalSource e => summarize d e
|
adamc@608
|
373
|
adamc@614
|
374 | EServerCall (e, ek, _) => summarize d e @ summarize d ek @ [Unsure]
|
adamc@670
|
375 | ERecv (e, ek, _) => summarize d e @ summarize d ek @ [Unsure]
|
adamc@695
|
376 | ESleep (e, ek) => summarize d e @ summarize d ek @ [Unsure]
|
adamc@579
|
377 in
|
adamc@579
|
378 (*Print.prefaces "Summarize"
|
adamc@579
|
379 [("e", MonoPrint.p_exp MonoEnv.empty (e, ErrorMsg.dummySpan)),
|
adamc@579
|
380 ("d", Print.PD.string (Int.toString d)),
|
adamc@579
|
381 ("s", p_events s)];*)
|
adamc@579
|
382 s
|
adamc@579
|
383 end
|
adamc@470
|
384
|
adamc@470
|
385 fun exp env e =
|
adamc@470
|
386 let
|
adamc@470
|
387 (*val () = Print.prefaces "exp" [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan))]*)
|
adamc@470
|
388
|
adamc@470
|
389 val r =
|
adamc@470
|
390 case e of
|
adamc@470
|
391 ERel n =>
|
adamc@470
|
392 (case E.lookupERel env n of
|
adamc@470
|
393 (_, _, SOME e') => #1 e'
|
adamc@470
|
394 | _ => e)
|
adamc@470
|
395 | ENamed n =>
|
adamc@470
|
396 (case E.lookupENamed env n of
|
adamc@470
|
397 (_, _, SOME e', _) => ((*Print.prefaces "Switch" [("n", Print.PD.string (Int.toString n)),
|
adamc@470
|
398 ("e'", MonoPrint.p_exp env e')];*)
|
adamc@470
|
399 #1 e')
|
adamc@470
|
400 | _ => e)
|
adamc@470
|
401
|
adamc@470
|
402 | EApp ((EAbs (x, t, _, e1), loc), e2) =>
|
adamc@470
|
403 ((*Print.prefaces "Considering" [("e1", MonoPrint.p_exp (E.pushERel env x t NONE) e1),
|
adamc@694
|
404 ("e2", MonoPrint.p_exp env e2),
|
adamc@694
|
405 ("sub", MonoPrint.p_exp env (reduceExp env (subExpInExp (0, e2) e1)))];*)
|
adamc@470
|
406 if impure e2 then
|
adamc@470
|
407 #1 (reduceExp env (ELet (x, t, e2, e1), loc))
|
adamc@470
|
408 else
|
adamc@470
|
409 #1 (reduceExp env (subExpInExp (0, e2) e1)))
|
adamc@470
|
410
|
adamc@470
|
411 | ECase (e', pes, {disc, result}) =>
|
adamc@442
|
412 let
|
adamc@470
|
413 fun push () =
|
adamc@470
|
414 case result of
|
adamc@470
|
415 (TFun (dom, result), loc) =>
|
adamc@470
|
416 if List.all (fn (_, (EAbs _, _)) => true | _ => false) pes then
|
adamc@470
|
417 EAbs ("_", dom, result,
|
adamc@470
|
418 (ECase (liftExpInExp 0 e',
|
adamc@470
|
419 map (fn (p, (EAbs (_, _, _, e), _)) =>
|
adamc@470
|
420 (p, swapExpVarsPat (0, patBinds p) e)
|
adamc@470
|
421 | _ => raise Fail "MonoReduce ECase") pes,
|
adamc@470
|
422 {disc = disc, result = result}), loc))
|
adamc@470
|
423 else
|
adamc@470
|
424 e
|
adamc@470
|
425 | _ => e
|
adamc@318
|
426
|
adamc@470
|
427 fun search pes =
|
adamc@470
|
428 case pes of
|
adamc@470
|
429 [] => push ()
|
adamc@470
|
430 | (p, body) :: pes =>
|
adamc@470
|
431 case match (env, p, e') of
|
adamc@470
|
432 No => search pes
|
adamc@470
|
433 | Maybe => push ()
|
adamc@470
|
434 | Yes env => #1 (reduceExp env body)
|
adamc@470
|
435 in
|
adamc@470
|
436 search pes
|
adamc@470
|
437 end
|
adamc@318
|
438
|
adamc@470
|
439 | EField ((ERecord xes, _), x) =>
|
adamc@470
|
440 (case List.find (fn (x', _, _) => x' = x) xes of
|
adamc@470
|
441 SOME (_, e, _) => #1 e
|
adamc@470
|
442 | NONE => e)
|
adamc@398
|
443
|
adamc@470
|
444 | ELet (x1, t1, (ELet (x2, t2, e1, b1), loc), b2) =>
|
adamc@470
|
445 let
|
adamc@470
|
446 val e' = (ELet (x2, t2, e1,
|
adamc@470
|
447 (ELet (x1, t1, b1,
|
adamc@470
|
448 liftExpInExp 1 b2), loc)), loc)
|
adamc@442
|
449 in
|
adamc@470
|
450 (*Print.prefaces "ELet commute" [("e", MonoPrint.p_exp env (e, loc)),
|
adamc@470
|
451 ("e'", MonoPrint.p_exp env e')];*)
|
adamc@470
|
452 #1 (reduceExp env e')
|
adamc@470
|
453 end
|
adamc@470
|
454 | EApp ((ELet (x, t, e, b), loc), e') =>
|
adamc@470
|
455 #1 (reduceExp env (ELet (x, t, e,
|
adamc@470
|
456 (EApp (b, liftExpInExp 0 e'), loc)), loc))
|
adamc@470
|
457
|
adamc@470
|
458 | ELet (x, t, e', (EAbs (x', t' as (TRecord [], _), ran, e''), loc)) =>
|
adamc@470
|
459 (*if impure e' then
|
adamc@470
|
460 e
|
adamc@470
|
461 else*)
|
adamc@470
|
462 (* Seems unsound in general without the check... should revisit later *)
|
adamc@470
|
463 EAbs (x', t', ran, (ELet (x, t, liftExpInExp 0 e', swapExpVars 0 e''), loc))
|
adamc@470
|
464
|
adamc@470
|
465 | ELet (x, t, e', b) =>
|
adamc@470
|
466 let
|
adamc@470
|
467 fun doSub () =
|
adamc@470
|
468 #1 (reduceExp env (subExpInExp (0, e') b))
|
adamc@470
|
469
|
adamc@470
|
470 fun trySub () =
|
adamc@470
|
471 case t of
|
adamc@470
|
472 (TFfi ("Basis", "string"), _) => doSub ()
|
adamc@568
|
473 | (TSignal _, _) => e
|
adamc@470
|
474 | _ =>
|
adamc@470
|
475 case e' of
|
adamc@470
|
476 (ECase _, _) => e
|
adamc@470
|
477 | _ => doSub ()
|
adamc@470
|
478 in
|
adamc@470
|
479 if impure e' then
|
adamc@470
|
480 let
|
adamc@470
|
481 val effs_e' = summarize 0 e'
|
adamc@489
|
482 val effs_e' = List.filter (fn x => x <> UseRel) effs_e'
|
adamc@470
|
483 val effs_b = summarize 0 b
|
adamc@470
|
484
|
adamc@470
|
485 (*val () = Print.prefaces "Try"
|
adamc@489
|
486 [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan)),
|
adamc@489
|
487 ("e'", p_events effs_e'),
|
adamc@489
|
488 ("b", p_events effs_b)]*)
|
adamc@470
|
489
|
adamc@470
|
490 fun does eff = List.exists (fn eff' => eff' = eff) effs_e'
|
adamc@470
|
491 val writesPage = does WritePage
|
adamc@470
|
492 val readsDb = does ReadDb
|
adamc@470
|
493 val writesDb = does WriteDb
|
adamc@470
|
494
|
adamc@470
|
495 fun verifyUnused eff =
|
adamc@470
|
496 case eff of
|
adamc@481
|
497 UseRel => false
|
adamc@470
|
498 | _ => true
|
adamc@470
|
499
|
adamc@470
|
500 fun verifyCompatible effs =
|
adamc@470
|
501 case effs of
|
adamc@470
|
502 [] => false
|
adamc@470
|
503 | eff :: effs =>
|
adamc@470
|
504 case eff of
|
adamc@470
|
505 Unsure => false
|
adamc@481
|
506 | UseRel => List.all verifyUnused effs
|
adamc@470
|
507 | WritePage => not writesPage andalso verifyCompatible effs
|
adamc@470
|
508 | ReadDb => not writesDb andalso verifyCompatible effs
|
adamc@470
|
509 | WriteDb => not writesDb andalso not readsDb andalso verifyCompatible effs
|
adamc@470
|
510 in
|
adamc@470
|
511 (*Print.prefaces "verifyCompatible"
|
adamc@601
|
512 [("e'", MonoPrint.p_exp env e'),
|
adamc@601
|
513 ("b", MonoPrint.p_exp (E.pushERel env x t NONE) b),
|
adamc@601
|
514 ("effs_e'", Print.p_list p_event effs_e'),
|
adamc@601
|
515 ("effs_b", Print.p_list p_event effs_b)];*)
|
adamc@601
|
516 if List.null effs_e' orelse (List.all (fn eff => eff <> Unsure) effs_e'
|
adamc@601
|
517 andalso verifyCompatible effs_b) then
|
adamc@470
|
518 trySub ()
|
adamc@470
|
519 else
|
adamc@470
|
520 e
|
adamc@470
|
521 end
|
adamc@470
|
522 else
|
adamc@442
|
523 trySub ()
|
adamc@442
|
524 end
|
adamc@252
|
525
|
adamc@470
|
526 | EStrcat ((EPrim (Prim.String s1), _), (EPrim (Prim.String s2), _)) =>
|
adamc@470
|
527 EPrim (Prim.String (s1 ^ s2))
|
adamc@268
|
528
|
adamc@572
|
529 | ESignalBind ((ESignalReturn e1, loc), e2) =>
|
adamc@572
|
530 #1 (reduceExp env (EApp (e2, e1), loc))
|
adamc@572
|
531
|
adamc@470
|
532 | _ => e
|
adamc@470
|
533 in
|
adamc@470
|
534 (*Print.prefaces "exp'" [("r", MonoPrint.p_exp env (r, ErrorMsg.dummySpan))];*)
|
adamc@470
|
535 r
|
adamc@470
|
536 end
|
adamc@470
|
537
|
adamc@470
|
538 and bind (env, b) =
|
adamc@470
|
539 case b of
|
adamc@470
|
540 U.Decl.Datatype (x, n, xncs) => E.pushDatatype env x n xncs
|
adamc@470
|
541 | U.Decl.RelE (x, t) => E.pushERel env x t NONE
|
adamc@470
|
542 | U.Decl.NamedE (x, n, t, eo, s) => E.pushENamed env x n t (Option.map (reduceExp env) eo) s
|
adamc@470
|
543
|
adamc@470
|
544 and reduceExp env = U.Exp.mapB {typ = typ, exp = exp, bind = bind} env
|
adamc@470
|
545
|
adamc@470
|
546 fun decl env d = d
|
adamc@398
|
547 in
|
adamc@470
|
548 U.File.mapB {typ = typ, exp = exp, decl = decl, bind = bind} E.empty file
|
adamc@398
|
549 end
|
adamc@133
|
550
|
adamc@133
|
551 end
|