Mercurial > urweb

annotate src/mono_reduce.sml @ 690:01b6f2ee2ef0

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Redo signal implementation to avoid memory leaks
author Adam Chlipala <adamc@hcoop.net>
date Thu, 02 Apr 2009 15:12:06 -0400
parents f73913d97a40
children 7ea0df9e56b6
rev   line source
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@252 64 | EFfiApp _ => false
adamc@252 65 | EApp ((EFfi _, _), _) => false
adamc@252 66 | EApp _ => true
adamc@252 67
adamc@387 68 | EUnop (_, e) => impure e
adamc@387 69 | EBinop (_, e1, e2) => impure e1 orelse impure e2
adamc@387 70
adamc@252 71 | ERecord xes => List.exists (fn (_, e, _) => impure e) xes
adamc@252 72 | EField (e, _) => impure e
adamc@252 73
adamc@252 74 | ECase (e, pes, _) => impure e orelse List.exists (fn (_, e) => impure e) pes
adamc@252 75
adamc@283 76 | EError (e, _) => impure e
adamc@283 77
adamc@252 78 | EStrcat (e1, e2) => impure e1 orelse impure e2
adamc@252 79
adamc@252 80 | ESeq (e1, e2) => impure e1 orelse impure e2
adamc@252 81 | ELet (_, _, e1, e2) => impure e1 orelse impure e2
adamc@252 82
adamc@252 83 | EClosure (_, es) => List.exists impure es
adamc@578 84 | EJavaScript (_, e, _) => impure e
adamc@568 85 | ESignalReturn e => impure e
adamc@572 86 | ESignalBind (e1, e2) => impure e1 orelse impure e2
adamc@574 87 | ESignalSource e => impure e
adamc@608 88 | EServerCall _ => true
adamc@670 89 | ERecv _ => true
adamc@252 90
adamc@252 91
adamc@252 92 val liftExpInExp = Monoize.liftExpInExp
adamc@252 93
adamc@252 94 val subExpInExp' =
adamc@133 95 U.Exp.mapB {typ = fn t => t,
adamc@133 96 exp = fn (xn, rep) => fn e =>
adamc@133 97 case e of
adamc@133 98 ERel xn' =>
adamc@133 99 (case Int.compare (xn', xn) of
adamc@133 100 EQUAL => #1 rep
adamc@133 101 | GREATER=> ERel (xn' - 1)
adamc@133 102 | LESS => e)
adamc@133 103 | _ => e,
adamc@133 104 bind = fn ((xn, rep), U.Exp.RelE _) => (xn+1, liftExpInExp 0 rep)
adamc@133 105 | (ctx, _) => ctx}
adamc@133 106
adamc@252 107 fun subExpInExp (n, e1) e2 =
adamc@252 108 let
adamc@252 109 val r = subExpInExp' (n, e1) e2
adamc@252 110 in
adamc@252 111 (*Print.prefaces "subExpInExp" [("e1", MonoPrint.p_exp MonoEnv.empty e1),
adamc@252 112 ("e2", MonoPrint.p_exp MonoEnv.empty e2),
adamc@252 113 ("r", MonoPrint.p_exp MonoEnv.empty r)];*)
adamc@252 114 r
adamc@252 115 end
adamc@133 116
adamc@133 117 fun typ c = c
adamc@133 118
adamc@316 119 val swapExpVars =
adamc@316 120 U.Exp.mapB {typ = fn t => t,
adamc@316 121 exp = fn lower => fn e =>
adamc@316 122 case e of
adamc@316 123 ERel xn =>
adamc@316 124 if xn = lower then
adamc@316 125 ERel (lower + 1)
adamc@316 126 else if xn = lower + 1 then
adamc@316 127 ERel lower
adamc@316 128 else
adamc@316 129 e
adamc@316 130 | _ => e,
adamc@316 131 bind = fn (lower, U.Exp.RelE _) => lower+1
adamc@316 132 | (lower, _) => lower}
adamc@316 133
adamc@341 134 val swapExpVarsPat =
adamc@341 135 U.Exp.mapB {typ = fn t => t,
adamc@341 136 exp = fn (lower, len) => fn e =>
adamc@341 137 case e of
adamc@341 138 ERel xn =>
adamc@341 139 if xn = lower then
adamc@341 140 ERel (lower + 1)
adamc@341 141 else if xn >= lower + 1 andalso xn < lower + 1 + len then
adamc@341 142 ERel (xn - 1)
adamc@341 143 else
adamc@341 144 e
adamc@341 145 | _ => e,
adamc@341 146 bind = fn ((lower, len), U.Exp.RelE _) => (lower+1, len)
adamc@341 147 | (st, _) => st}
adamc@341 148
adamc@258 149 datatype result = Yes of E.env | No | Maybe
adamc@258 150
adamc@183 151 fun match (env, p : pat, e : exp) =
adamc@183 152 case (#1 p, #1 e) of
adamc@258 153 (PWild, _) => Yes env
adamc@258 154 | (PVar (x, t), _) => Yes (E.pushERel env x t (SOME e))
adamc@183 155
adamc@280 156 | (PPrim (Prim.String s), EStrcat ((EPrim (Prim.String s'), _), _)) =>
adamc@280 157 if String.isPrefix s' s then
adamc@280 158 Maybe
adamc@280 159 else
adamc@280 160 No
adamc@280 161
adamc@183 162 | (PPrim p, EPrim p') =>
adamc@183 163 if Prim.equal (p, p') then
adamc@258 164 Yes env
adamc@183 165 else
adamc@258 166 No
adamc@183 167
adamc@188 168 | (PCon (_, PConVar n1, NONE), ECon (_, PConVar n2, NONE)) =>
adamc@183 169 if n1 = n2 then
adamc@258 170 Yes env
adamc@183 171 else
adamc@258 172 No
adamc@183 173
adamc@188 174 | (PCon (_, PConVar n1, SOME p), ECon (_, PConVar n2, SOME e)) =>
adamc@183 175 if n1 = n2 then
adamc@183 176 match (env, p, e)
adamc@183 177 else
adamc@258 178 No
adamc@183 179
adamc@188 180 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, NONE), ECon (_, PConFfi {mod = m2, con = con2, ...}, NONE)) =>
adamc@185 181 if m1 = m2 andalso con1 = con2 then
adamc@258 182 Yes env
adamc@185 183 else
adamc@258 184 No
adamc@185 185
adamc@188 186 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, SOME ep), ECon (_, PConFfi {mod = m2, con = con2, ...}, SOME e)) =>
adamc@185 187 if m1 = m2 andalso con1 = con2 then
adamc@185 188 match (env, p, e)
adamc@185 189 else
adamc@258 190 No
adamc@185 191
adamc@183 192 | (PRecord xps, ERecord xes) =>
adamc@183 193 let
adamc@183 194 fun consider (xps, env) =
adamc@183 195 case xps of
adamc@258 196 [] => Yes env
adamc@183 197 | (x, p, _) :: rest =>
adamc@183 198 case List.find (fn (x', _, _) => x' = x) xes of
adamc@258 199 NONE => No
adamc@183 200 | SOME (_, e, _) =>
adamc@183 201 case match (env, p, e) of
adamc@258 202 No => No
adamc@258 203 | Maybe => Maybe
adamc@258 204 | Yes env => consider (rest, env)
adamc@183 205 in
adamc@183 206 consider (xps, env)
adamc@183 207 end
adamc@183 208
adamc@258 209 | _ => Maybe
adamc@183 210
adamc@318 211 datatype event =
adamc@318 212 WritePage
adamc@318 213 | ReadDb
adamc@318 214 | WriteDb
adamc@481 215 | UseRel
adamc@318 216 | Unsure
adamc@318 217
adamc@318 218 fun p_event e =
adamc@318 219 let
adamc@318 220 open Print.PD
adamc@318 221 in
adamc@318 222 case e of
adamc@318 223 WritePage => string "WritePage"
adamc@318 224 | ReadDb => string "ReadDb"
adamc@318 225 | WriteDb => string "WriteDb"
adamc@481 226 | UseRel => string "UseRel"
adamc@318 227 | Unsure => string "Unsure"
adamc@318 228 end
adamc@318 229
adamc@470 230 val p_events = Print.p_list p_event
adamc@470 231
adamc@318 232 fun patBinds (p, _) =
adamc@318 233 case p of
adamc@318 234 PWild => 0
adamc@318 235 | PVar _ => 1
adamc@318 236 | PPrim _ => 0
adamc@318 237 | PCon (_, _, NONE) => 0
adamc@318 238 | PCon (_, _, SOME p) => patBinds p
adamc@318 239 | PRecord xpts => foldl (fn ((_, p, _), n) => n + patBinds p) 0 xpts
adamc@318 240 | PNone _ => 0
adamc@318 241 | PSome (_, p) => patBinds p
adamc@318 242
adamc@470 243 fun reduce file =
adamc@470 244 let
adamc@470 245 fun countAbs (e, _) =
adamc@470 246 case e of
adamc@470 247 EAbs (_, _, _, e) => 1 + countAbs e
adamc@470 248 | _ => 0
adamc@318 249
adamc@470 250 val absCounts =
adamc@470 251 foldl (fn ((d, _), absCounts) =>
adamc@470 252 case d of
adamc@470 253 DVal (_, n, _, e, _) =>
adamc@470 254 IM.insert (absCounts, n, countAbs e)
adamc@470 255 | DValRec vis =>
adamc@470 256 foldl (fn ((_, n, _, e, _), absCounts) =>
adamc@470 257 IM.insert (absCounts, n, countAbs e))
adamc@470 258 absCounts vis
adamc@470 259 | _ => absCounts)
adamc@470 260 IM.empty file
adamc@387 261
adamc@470 262 fun summarize d (e, _) =
adamc@579 263 let
adamc@668 264 fun ffi es = List.concat (map (summarize d) es) @ [Unsure]
adamc@668 265
adamc@579 266 val s =
adamc@579 267 case e of
adamc@579 268 EPrim _ => []
adamc@579 269 | ERel n => if n = d then [UseRel] else []
adamc@579 270 | ENamed _ => []
adamc@579 271 | ECon (_, _, NONE) => []
adamc@579 272 | ECon (_, _, SOME e) => summarize d e
adamc@579 273 | ENone _ => []
adamc@579 274 | ESome (_, e) => summarize d e
adamc@579 275 | EFfi _ => []
adamc@668 276 | EFfiApp ("Basis", "set_cookie", es) => ffi es
adamc@668 277 | EFfiApp ("Basis", "new_client_source", es) => ffi es
adamc@690 278 | EFfiApp ("Basis", "get_client_source", es) => ffi es
adamc@668 279 | EFfiApp ("Basis", "set_client_source", es) => ffi es
adamc@668 280 | EFfiApp ("Basis", "alert", es) => ffi es
adamc@668 281 | EFfiApp ("Basis", "new_channel", es) => ffi es
adamc@668 282 | EFfiApp ("Basis", "subscribe", es) => ffi es
adamc@668 283 | EFfiApp ("Basis", "send", es) => ffi es
adamc@579 284 | EFfiApp (_, _, es) => List.concat (map (summarize d) es)
adamc@579 285 | EApp ((EFfi _, _), e) => summarize d e
adamc@579 286 | EApp _ =>
adamc@579 287 let
adamc@579 288 fun unravel (e, ls) =
adamc@579 289 case e of
adamc@579 290 ENamed n =>
adamc@579 291 let
adamc@579 292 val ls = rev ls
adamc@579 293 in
adamc@579 294 case IM.find (absCounts, n) of
adamc@579 295 NONE => [Unsure]
adamc@579 296 | SOME len =>
adamc@579 297 if length ls < len then
adamc@579 298 ls
adamc@579 299 else
adamc@579 300 [Unsure]
adamc@579 301 end
adamc@579 302 | ERel n => List.revAppend (ls,
adamc@579 303 if n = d then
adamc@579 304 [UseRel, Unsure]
adamc@579 305 else
adamc@579 306 [Unsure])
adamc@579 307 | EApp (f, x) =>
adamc@579 308 unravel (#1 f, summarize d x @ ls)
adamc@579 309 | _ => [Unsure]
adamc@579 310 in
adamc@579 311 unravel (e, [])
adamc@579 312 end
adamc@252 313
adamc@579 314 | EAbs (_, _, _, e) => List.filter (fn UseRel => true
adamc@579 315 | _ => false) (summarize (d + 1) e)
adamc@316 316
adamc@579 317 | EUnop (_, e) => summarize d e
adamc@579 318 | EBinop (_, e1, e2) => summarize d e1 @ summarize d e2
adamc@470 319
adamc@579 320 | ERecord xets => List.concat (map (summarize d o #2) xets)
adamc@579 321 | EField (e, _) => summarize d e
adamc@470 322
adamc@579 323 | ECase (e, pes, _) =>
adamc@579 324 let
adamc@579 325 val lss = map (fn (p, e) => summarize (d + patBinds p) e) pes
adamc@579 326 in
adamc@579 327 case lss of
adamc@579 328 [] => raise Fail "Empty pattern match"
adamc@579 329 | ls :: lss =>
adamc@579 330 if List.all (fn ls' => ls' = ls) lss then
adamc@579 331 summarize d e @ ls
adamc@579 332 else
adamc@579 333 [Unsure]
adamc@579 334 end
adamc@579 335 | EStrcat (e1, e2) => summarize d e1 @ summarize d e2
adamc@316 336
adamc@579 337 | EError (e, _) => summarize d e @ [Unsure]
adamc@318 338
adamc@579 339 | EWrite e => summarize d e @ [WritePage]
adamc@579 340
adamc@579 341 | ESeq (e1, e2) => summarize d e1 @ summarize d e2
adamc@579 342 | ELet (_, _, e1, e2) => summarize d e1 @ summarize (d + 1) e2
adamc@456 343
adamc@579 344 | EClosure (_, es) => List.concat (map (summarize d) es)
adamc@470 345
adamc@579 346 | EQuery {query, body, initial, ...} =>
adamc@579 347 List.concat [summarize d query,
adamc@579 348 summarize (d + 2) body,
adamc@579 349 summarize d initial,
adamc@579 350 [ReadDb]]
adamc@470 351
adamc@579 352 | EDml e => summarize d e @ [WriteDb]
adamc@579 353 | ENextval e => summarize d e @ [WriteDb]
adamc@579 354 | EUnurlify (e, _) => summarize d e
adamc@579 355 | EJavaScript (_, e, _) => summarize d e
adamc@579 356 | ESignalReturn e => summarize d e
adamc@579 357 | ESignalBind (e1, e2) => summarize d e1 @ summarize d e2
adamc@579 358 | ESignalSource e => summarize d e
adamc@608 359
adamc@614 360 | EServerCall (e, ek, _) => summarize d e @ summarize d ek @ [Unsure]
adamc@670 361 | ERecv (e, ek, _) => summarize d e @ summarize d ek @ [Unsure]
adamc@579 362 in
adamc@579 363 (*Print.prefaces "Summarize"
adamc@579 364 [("e", MonoPrint.p_exp MonoEnv.empty (e, ErrorMsg.dummySpan)),
adamc@579 365 ("d", Print.PD.string (Int.toString d)),
adamc@579 366 ("s", p_events s)];*)
adamc@579 367 s
adamc@579 368 end
adamc@470 369
adamc@470 370 fun exp env e =
adamc@470 371 let
adamc@470 372 (*val () = Print.prefaces "exp" [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan))]*)
adamc@470 373
adamc@470 374 val r =
adamc@470 375 case e of
adamc@470 376 ERel n =>
adamc@470 377 (case E.lookupERel env n of
adamc@470 378 (_, _, SOME e') => #1 e'
adamc@470 379 | _ => e)
adamc@470 380 | ENamed n =>
adamc@470 381 (case E.lookupENamed env n of
adamc@470 382 (_, _, SOME e', _) => ((*Print.prefaces "Switch" [("n", Print.PD.string (Int.toString n)),
adamc@470 383 ("e'", MonoPrint.p_exp env e')];*)
adamc@470 384 #1 e')
adamc@470 385 | _ => e)
adamc@470 386
adamc@470 387 | EApp ((EAbs (x, t, _, e1), loc), e2) =>
adamc@470 388 ((*Print.prefaces "Considering" [("e1", MonoPrint.p_exp (E.pushERel env x t NONE) e1),
adamc@470 389 ("e2", MonoPrint.p_exp env e2),
adamc@470 390 ("sub", MonoPrint.p_exp env (reduceExp env (subExpInExp (0, e2) e1)))];*)
adamc@470 391 if impure e2 then
adamc@470 392 #1 (reduceExp env (ELet (x, t, e2, e1), loc))
adamc@470 393 else
adamc@470 394 #1 (reduceExp env (subExpInExp (0, e2) e1)))
adamc@470 395
adamc@470 396 | ECase (e', pes, {disc, result}) =>
adamc@442 397 let
adamc@470 398 fun push () =
adamc@470 399 case result of
adamc@470 400 (TFun (dom, result), loc) =>
adamc@470 401 if List.all (fn (_, (EAbs _, _)) => true | _ => false) pes then
adamc@470 402 EAbs ("_", dom, result,
adamc@470 403 (ECase (liftExpInExp 0 e',
adamc@470 404 map (fn (p, (EAbs (_, _, _, e), _)) =>
adamc@470 405 (p, swapExpVarsPat (0, patBinds p) e)
adamc@470 406 | _ => raise Fail "MonoReduce ECase") pes,
adamc@470 407 {disc = disc, result = result}), loc))
adamc@470 408 else
adamc@470 409 e
adamc@470 410 | _ => e
adamc@318 411
adamc@470 412 fun search pes =
adamc@470 413 case pes of
adamc@470 414 [] => push ()
adamc@470 415 | (p, body) :: pes =>
adamc@470 416 case match (env, p, e') of
adamc@470 417 No => search pes
adamc@470 418 | Maybe => push ()
adamc@470 419 | Yes env => #1 (reduceExp env body)
adamc@470 420 in
adamc@470 421 search pes
adamc@470 422 end
adamc@318 423
adamc@470 424 | EField ((ERecord xes, _), x) =>
adamc@470 425 (case List.find (fn (x', _, _) => x' = x) xes of
adamc@470 426 SOME (_, e, _) => #1 e
adamc@470 427 | NONE => e)
adamc@398 428
adamc@470 429 | ELet (x1, t1, (ELet (x2, t2, e1, b1), loc), b2) =>
adamc@470 430 let
adamc@470 431 val e' = (ELet (x2, t2, e1,
adamc@470 432 (ELet (x1, t1, b1,
adamc@470 433 liftExpInExp 1 b2), loc)), loc)
adamc@442 434 in
adamc@470 435 (*Print.prefaces "ELet commute" [("e", MonoPrint.p_exp env (e, loc)),
adamc@470 436 ("e'", MonoPrint.p_exp env e')];*)
adamc@470 437 #1 (reduceExp env e')
adamc@470 438 end
adamc@470 439 | EApp ((ELet (x, t, e, b), loc), e') =>
adamc@470 440 #1 (reduceExp env (ELet (x, t, e,
adamc@470 441 (EApp (b, liftExpInExp 0 e'), loc)), loc))
adamc@470 442
adamc@470 443 | ELet (x, t, e', (EAbs (x', t' as (TRecord [], _), ran, e''), loc)) =>
adamc@470 444 (*if impure e' then
adamc@470 445 e
adamc@470 446 else*)
adamc@470 447 (* Seems unsound in general without the check... should revisit later *)
adamc@470 448 EAbs (x', t', ran, (ELet (x, t, liftExpInExp 0 e', swapExpVars 0 e''), loc))
adamc@470 449
adamc@470 450 | ELet (x, t, e', b) =>
adamc@470 451 let
adamc@470 452 fun doSub () =
adamc@470 453 #1 (reduceExp env (subExpInExp (0, e') b))
adamc@470 454
adamc@470 455 fun trySub () =
adamc@470 456 case t of
adamc@470 457 (TFfi ("Basis", "string"), _) => doSub ()
adamc@568 458 | (TSignal _, _) => e
adamc@470 459 | _ =>
adamc@470 460 case e' of
adamc@470 461 (ECase _, _) => e
adamc@470 462 | _ => doSub ()
adamc@470 463 in
adamc@470 464 if impure e' then
adamc@470 465 let
adamc@470 466 val effs_e' = summarize 0 e'
adamc@489 467 val effs_e' = List.filter (fn x => x <> UseRel) effs_e'
adamc@470 468 val effs_b = summarize 0 b
adamc@470 469
adamc@470 470 (*val () = Print.prefaces "Try"
adamc@489 471 [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan)),
adamc@489 472 ("e'", p_events effs_e'),
adamc@489 473 ("b", p_events effs_b)]*)
adamc@470 474
adamc@470 475 fun does eff = List.exists (fn eff' => eff' = eff) effs_e'
adamc@470 476 val writesPage = does WritePage
adamc@470 477 val readsDb = does ReadDb
adamc@470 478 val writesDb = does WriteDb
adamc@470 479
adamc@470 480 fun verifyUnused eff =
adamc@470 481 case eff of
adamc@481 482 UseRel => false
adamc@470 483 | _ => true
adamc@470 484
adamc@470 485 fun verifyCompatible effs =
adamc@470 486 case effs of
adamc@470 487 [] => false
adamc@470 488 | eff :: effs =>
adamc@470 489 case eff of
adamc@470 490 Unsure => false
adamc@481 491 | UseRel => List.all verifyUnused effs
adamc@470 492 | WritePage => not writesPage andalso verifyCompatible effs
adamc@470 493 | ReadDb => not writesDb andalso verifyCompatible effs
adamc@470 494 | WriteDb => not writesDb andalso not readsDb andalso verifyCompatible effs
adamc@470 495 in
adamc@470 496 (*Print.prefaces "verifyCompatible"
adamc@601 497 [("e'", MonoPrint.p_exp env e'),
adamc@601 498 ("b", MonoPrint.p_exp (E.pushERel env x t NONE) b),
adamc@601 499 ("effs_e'", Print.p_list p_event effs_e'),
adamc@601 500 ("effs_b", Print.p_list p_event effs_b)];*)
adamc@601 501 if List.null effs_e' orelse (List.all (fn eff => eff <> Unsure) effs_e'
adamc@601 502 andalso verifyCompatible effs_b) then
adamc@470 503 trySub ()
adamc@470 504 else
adamc@470 505 e
adamc@470 506 end
adamc@470 507 else
adamc@442 508 trySub ()
adamc@442 509 end
adamc@252 510
adamc@470 511 | EStrcat ((EPrim (Prim.String s1), _), (EPrim (Prim.String s2), _)) =>
adamc@470 512 EPrim (Prim.String (s1 ^ s2))
adamc@268 513
adamc@572 514 | ESignalBind ((ESignalReturn e1, loc), e2) =>
adamc@572 515 #1 (reduceExp env (EApp (e2, e1), loc))
adamc@572 516
adamc@470 517 | _ => e
adamc@470 518 in
adamc@470 519 (*Print.prefaces "exp'" [("r", MonoPrint.p_exp env (r, ErrorMsg.dummySpan))];*)
adamc@470 520 r
adamc@470 521 end
adamc@470 522
adamc@470 523 and bind (env, b) =
adamc@470 524 case b of
adamc@470 525 U.Decl.Datatype (x, n, xncs) => E.pushDatatype env x n xncs
adamc@470 526 | U.Decl.RelE (x, t) => E.pushERel env x t NONE
adamc@470 527 | U.Decl.NamedE (x, n, t, eo, s) => E.pushENamed env x n t (Option.map (reduceExp env) eo) s
adamc@470 528
adamc@470 529 and reduceExp env = U.Exp.mapB {typ = typ, exp = exp, bind = bind} env
adamc@470 530
adamc@470 531 fun decl env d = d
adamc@398 532 in
adamc@470 533 U.File.mapB {typ = typ, exp = exp, decl = decl, bind = bind} E.empty file
adamc@398 534 end
adamc@133 535
adamc@133 536 end