Mercurial > urweb

annotate src/mono_reduce.sml @ 1068:757dbac0454d

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Checked-ness of radio options; Option.get
author Adam Chlipala <adamc@hcoop.net>
date Sat, 12 Dec 2009 11:02:20 -0500
parents 217eb87dde31
children 757397bb9609
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@916 38 structure IS = IntBinarySet
adamc@470 39
adamc@133 40
adamc@948 41 fun simpleTypeImpure tsyms =
adamc@919 42 U.Typ.exists (fn TFun _ => true
adamc@948 43 | TDatatype (n, _) => IS.member (tsyms, n)
adamc@919 44 | _ => false)
adamc@919 45
adamc@948 46 fun simpleImpure (tsyms, syms) =
adamc@919 47 U.Exp.existsB {typ = fn _ => false,
adamc@919 48 exp = fn (env, e) =>
adamc@919 49 case e of
adamc@919 50 EWrite _ => true
adamc@919 51 | EQuery _ => true
adamc@919 52 | EDml _ => true
adamc@919 53 | ENextval _ => true
adamc@919 54 | EFfiApp (m, x, _) => Settings.isEffectful (m, x)
adamc@919 55 | EServerCall _ => true
adamc@919 56 | ERecv _ => true
adamc@919 57 | ESleep _ => true
adamc@919 58 | ENamed n => IS.member (syms, n)
adamc@919 59 | ERel n =>
adamc@919 60 let
adamc@919 61 val (_, t, _) = E.lookupERel env n
adamc@919 62 in
adamc@948 63 simpleTypeImpure tsyms t
adamc@919 64 end
adamc@919 65 | _ => false,
adamc@919 66 bind = fn (env, b) =>
adamc@919 67 case b of
adamc@919 68 U.Exp.RelE (x, t) => E.pushERel env x t NONE
adamc@919 69 | _ => env}
adamc@916 70
adamc@252 71 fun impure (e, _) =
adamc@252 72 case e of
adamc@252 73 EWrite _ => true
adamc@252 74 | EQuery _ => true
adamc@307 75 | EDml _ => true
adamc@338 76 | ENextval _ => true
adamc@463 77 | EUnurlify _ => true
adamc@252 78 | EAbs _ => false
adamc@252 79
adamc@252 80 | EPrim _ => false
adamc@252 81 | ERel _ => false
adamc@252 82 | ENamed _ => false
adamc@252 83 | ECon (_, _, eo) => (case eo of NONE => false | SOME e => impure e)
adamc@297 84 | ENone _ => false
adamc@290 85 | ESome (_, e) => impure e
adamc@252 86 | EFfi _ => false
adamc@765 87 | EFfiApp (m, x, _) => Settings.isEffectful (m, x)
adamc@252 88 | EApp ((EFfi _, _), _) => false
adamc@252 89 | EApp _ => true
adamc@252 90
adamc@387 91 | EUnop (_, e) => impure e
adamc@387 92 | EBinop (_, e1, e2) => impure e1 orelse impure e2
adamc@387 93
adamc@252 94 | ERecord xes => List.exists (fn (_, e, _) => impure e) xes
adamc@252 95 | EField (e, _) => impure e
adamc@252 96
adamc@252 97 | ECase (e, pes, _) => impure e orelse List.exists (fn (_, e) => impure e) pes
adamc@252 98
adamc@283 99 | EError (e, _) => impure e
adamc@741 100 | EReturnBlob {blob = e1, mimeType = e2, ...} => impure e1 orelse impure e2
adamc@1065 101 | ERedirect (e, _) => impure e
adamc@283 102
adamc@252 103 | EStrcat (e1, e2) => impure e1 orelse impure e2
adamc@252 104
adamc@252 105 | ESeq (e1, e2) => impure e1 orelse impure e2
adamc@252 106 | ELet (_, _, e1, e2) => impure e1 orelse impure e2
adamc@252 107
adamc@252 108 | EClosure (_, es) => List.exists impure es
adamc@815 109 | EJavaScript (_, e) => impure e
adamc@568 110 | ESignalReturn e => impure e
adamc@572 111 | ESignalBind (e1, e2) => impure e1 orelse impure e2
adamc@574 112 | ESignalSource e => impure e
adamc@608 113 | EServerCall _ => true
adamc@670 114 | ERecv _ => true
adamc@695 115 | ESleep _ => true
adamc@1021 116 | ESpawn _ => true
adamc@252 117
adamc@252 118 val liftExpInExp = Monoize.liftExpInExp
adamc@252 119
adamc@829 120 fun multiLift n e =
adamc@829 121 case n of
adamc@829 122 0 => e
adamc@829 123 | _ => multiLift (n - 1) (liftExpInExp 0 e)
adamc@829 124
adamc@252 125 val subExpInExp' =
adamc@133 126 U.Exp.mapB {typ = fn t => t,
adamc@133 127 exp = fn (xn, rep) => fn e =>
adamc@133 128 case e of
adamc@133 129 ERel xn' =>
adamc@133 130 (case Int.compare (xn', xn) of
adamc@133 131 EQUAL => #1 rep
adamc@133 132 | GREATER=> ERel (xn' - 1)
adamc@133 133 | LESS => e)
adamc@133 134 | _ => e,
adamc@133 135 bind = fn ((xn, rep), U.Exp.RelE _) => (xn+1, liftExpInExp 0 rep)
adamc@133 136 | (ctx, _) => ctx}
adamc@133 137
adamc@252 138 fun subExpInExp (n, e1) e2 =
adamc@252 139 let
adamc@252 140 val r = subExpInExp' (n, e1) e2
adamc@252 141 in
adamc@252 142 (*Print.prefaces "subExpInExp" [("e1", MonoPrint.p_exp MonoEnv.empty e1),
adamc@252 143 ("e2", MonoPrint.p_exp MonoEnv.empty e2),
adamc@252 144 ("r", MonoPrint.p_exp MonoEnv.empty r)];*)
adamc@252 145 r
adamc@252 146 end
adamc@133 147
adamc@133 148 fun typ c = c
adamc@133 149
adamc@316 150 val swapExpVars =
adamc@316 151 U.Exp.mapB {typ = fn t => t,
adamc@316 152 exp = fn lower => fn e =>
adamc@316 153 case e of
adamc@316 154 ERel xn =>
adamc@316 155 if xn = lower then
adamc@316 156 ERel (lower + 1)
adamc@316 157 else if xn = lower + 1 then
adamc@316 158 ERel lower
adamc@316 159 else
adamc@316 160 e
adamc@316 161 | _ => e,
adamc@316 162 bind = fn (lower, U.Exp.RelE _) => lower+1
adamc@316 163 | (lower, _) => lower}
adamc@316 164
adamc@341 165 val swapExpVarsPat =
adamc@341 166 U.Exp.mapB {typ = fn t => t,
adamc@341 167 exp = fn (lower, len) => fn e =>
adamc@341 168 case e of
adamc@341 169 ERel xn =>
adamc@341 170 if xn = lower then
adamc@827 171 ERel (lower + len)
adamc@341 172 else if xn >= lower + 1 andalso xn < lower + 1 + len then
adamc@341 173 ERel (xn - 1)
adamc@341 174 else
adamc@341 175 e
adamc@341 176 | _ => e,
adamc@341 177 bind = fn ((lower, len), U.Exp.RelE _) => (lower+1, len)
adamc@341 178 | (st, _) => st}
adamc@341 179
adamc@814 180 datatype result = Yes of exp list | No | Maybe
adamc@258 181
adamc@183 182 fun match (env, p : pat, e : exp) =
adamc@183 183 case (#1 p, #1 e) of
adamc@258 184 (PWild, _) => Yes env
adamc@814 185 | (PVar (x, t), _) => Yes (e :: env)
adamc@183 186
adamc@280 187 | (PPrim (Prim.String s), EStrcat ((EPrim (Prim.String s'), _), _)) =>
adamc@280 188 if String.isPrefix s' s then
adamc@280 189 Maybe
adamc@280 190 else
adamc@280 191 No
adamc@280 192
adamc@183 193 | (PPrim p, EPrim p') =>
adamc@183 194 if Prim.equal (p, p') then
adamc@258 195 Yes env
adamc@183 196 else
adamc@258 197 No
adamc@183 198
adamc@188 199 | (PCon (_, PConVar n1, NONE), ECon (_, PConVar n2, NONE)) =>
adamc@183 200 if n1 = n2 then
adamc@258 201 Yes env
adamc@183 202 else
adamc@258 203 No
adamc@183 204
adamc@188 205 | (PCon (_, PConVar n1, SOME p), ECon (_, PConVar n2, SOME e)) =>
adamc@183 206 if n1 = n2 then
adamc@183 207 match (env, p, e)
adamc@183 208 else
adamc@258 209 No
adamc@183 210
adamc@188 211 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, NONE), ECon (_, PConFfi {mod = m2, con = con2, ...}, NONE)) =>
adamc@185 212 if m1 = m2 andalso con1 = con2 then
adamc@258 213 Yes env
adamc@185 214 else
adamc@258 215 No
adamc@185 216
adamc@188 217 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, SOME ep), ECon (_, PConFfi {mod = m2, con = con2, ...}, SOME e)) =>
adamc@185 218 if m1 = m2 andalso con1 = con2 then
adamc@185 219 match (env, p, e)
adamc@185 220 else
adamc@258 221 No
adamc@185 222
adamc@183 223 | (PRecord xps, ERecord xes) =>
adamc@183 224 let
adamc@183 225 fun consider (xps, env) =
adamc@183 226 case xps of
adamc@258 227 [] => Yes env
adamc@183 228 | (x, p, _) :: rest =>
adamc@183 229 case List.find (fn (x', _, _) => x' = x) xes of
adamc@258 230 NONE => No
adamc@183 231 | SOME (_, e, _) =>
adamc@183 232 case match (env, p, e) of
adamc@258 233 No => No
adamc@258 234 | Maybe => Maybe
adamc@258 235 | Yes env => consider (rest, env)
adamc@183 236 in
adamc@183 237 consider (xps, env)
adamc@183 238 end
adamc@183 239
adamc@726 240 | (PNone _, ENone _) => Yes env
adamc@921 241 | (PNone _, ESome _) => No
adamc@726 242 | (PSome (_, p), ESome (_, e)) => match (env, p, e)
adamc@921 243 | (PSome _, ENone _) => No
adamc@726 244
adamc@258 245 | _ => Maybe
adamc@183 246
adamc@318 247 datatype event =
adamc@318 248 WritePage
adamc@318 249 | ReadDb
adamc@318 250 | WriteDb
adamc@481 251 | UseRel
adamc@318 252 | Unsure
adamc@318 253
adamc@318 254 fun p_event e =
adamc@318 255 let
adamc@318 256 open Print.PD
adamc@318 257 in
adamc@318 258 case e of
adamc@318 259 WritePage => string "WritePage"
adamc@318 260 | ReadDb => string "ReadDb"
adamc@318 261 | WriteDb => string "WriteDb"
adamc@481 262 | UseRel => string "UseRel"
adamc@318 263 | Unsure => string "Unsure"
adamc@318 264 end
adamc@318 265
adamc@470 266 val p_events = Print.p_list p_event
adamc@470 267
adamc@318 268 fun patBinds (p, _) =
adamc@318 269 case p of
adamc@318 270 PWild => 0
adamc@318 271 | PVar _ => 1
adamc@318 272 | PPrim _ => 0
adamc@318 273 | PCon (_, _, NONE) => 0
adamc@318 274 | PCon (_, _, SOME p) => patBinds p
adamc@318 275 | PRecord xpts => foldl (fn ((_, p, _), n) => n + patBinds p) 0 xpts
adamc@318 276 | PNone _ => 0
adamc@318 277 | PSome (_, p) => patBinds p
adamc@318 278
adamc@932 279 val countFree = U.Exp.foldB {typ = fn (_, n) => n,
adamc@932 280 exp = fn (x, e, n) =>
adamc@932 281 case e of
adamc@932 282 ERel x' => if x = x' then n + 1 else n
adamc@932 283 | _ => n,
adamc@932 284 bind = fn (n, b) =>
adamc@932 285 case b of
adamc@932 286 U.Exp.RelE _ => n + 1
adamc@975 287 | _ => n}
adamc@975 288
adamc@975 289 val freeInAbs = U.Exp.existsB {typ = fn _ => false,
adamc@975 290 exp = fn (n, e) =>
adamc@975 291 case e of
adamc@975 292 EAbs (_, _, _, b) => countFree n 0 b > 0
adamc@975 293 | EJavaScript (_, b) => countFree n 0 b > 0
adamc@975 294 | _ => false,
adamc@975 295 bind = fn (n, b) =>
adamc@975 296 case b of
adamc@975 297 U.Exp.RelE _ => n + 1
adamc@975 298 | _ => n} 0
adamc@932 299
adamc@470 300 fun reduce file =
adamc@470 301 let
adamc@948 302 val (timpures, impures, absCounts) =
adamc@948 303 foldl (fn ((d, _), (timpures, impures, absCounts)) =>
adamc@916 304 let
adamc@916 305 fun countAbs (e, _) =
adamc@916 306 case e of
adamc@916 307 EAbs (_, _, _, e) => 1 + countAbs e
adamc@916 308 | _ => 0
adamc@916 309 in
adamc@916 310 case d of
adamc@948 311 DDatatype dts =>
adamc@948 312 (if List.exists (fn (_, _, cs) =>
adamc@948 313 List.exists (fn (_, _, NONE) => false
adamc@948 314 | (_, _, SOME t) => simpleTypeImpure timpures t) cs)
adamc@948 315 dts then
adamc@948 316 IS.addList (timpures, map #2 dts)
adamc@948 317 else
adamc@948 318 timpures,
adamc@948 319 impures,
adamc@948 320 absCounts)
adamc@948 321 | DVal (_, n, _, e, _) =>
adamc@948 322 (timpures,
adamc@948 323 if simpleImpure (timpures, impures) E.empty e then
adamc@916 324 IS.add (impures, n)
adamc@916 325 else
adamc@916 326 impures,
adamc@916 327 IM.insert (absCounts, n, countAbs e))
adamc@916 328 | DValRec vis =>
adamc@948 329 (timpures,
adamc@948 330 if List.exists (fn (_, _, _, e, _) => simpleImpure (timpures, impures) E.empty e) vis then
adamc@916 331 foldl (fn ((_, n, _, _, _), impures) =>
adamc@916 332 IS.add (impures, n)) impures vis
adamc@916 333 else
adamc@916 334 impures,
adamc@916 335 foldl (fn ((x, n, _, e, _), absCounts) =>
adamc@916 336 IM.insert (absCounts, n, countAbs e))
adamc@916 337 absCounts vis)
adamc@948 338 | _ => (timpures, impures, absCounts)
adamc@916 339 end)
adamc@948 340 (IS.empty, IS.empty, IM.empty) file
adamc@387 341
adamc@1017 342 val uses = U.File.fold {typ = fn (_, m) => m,
adamc@1017 343 exp = fn (e, m) =>
adamc@1017 344 case e of
adamc@1017 345 ENamed n => IM.insert (m, n, 1 + Option.getOpt (IM.find (m, n), 0))
adamc@1017 346 | _ => m,
adamc@1017 347 decl = fn (_, m) => m}
adamc@1017 348 IM.empty file
adamc@1017 349
adamc@1017 350 val size = U.Exp.fold {typ = fn (_, n) => n,
adamc@1017 351 exp = fn (_, n) => n + 1} 0
adamc@1017 352
adamc@1017 353 fun mayInline (n, e) =
adamc@1017 354 case IM.find (uses, n) of
adamc@1017 355 NONE => false
adamc@1017 356 | SOME count => count <= 1
adamc@1017 357 orelse size e <= Settings.getMonoInline ()
adamc@1017 358
adamc@470 359 fun summarize d (e, _) =
adamc@579 360 let
adamc@579 361 val s =
adamc@579 362 case e of
adamc@579 363 EPrim _ => []
adamc@579 364 | ERel n => if n = d then [UseRel] else []
adamc@579 365 | ENamed _ => []
adamc@579 366 | ECon (_, _, NONE) => []
adamc@579 367 | ECon (_, _, SOME e) => summarize d e
adamc@579 368 | ENone _ => []
adamc@579 369 | ESome (_, e) => summarize d e
adamc@579 370 | EFfi _ => []
adamc@765 371 | EFfiApp (m, x, es) =>
adamc@765 372 if Settings.isEffectful (m, x) then
adamc@765 373 List.concat (map (summarize d) es) @ [Unsure]
adamc@765 374 else
adamc@765 375 List.concat (map (summarize d) es)
adamc@579 376 | EApp ((EFfi _, _), e) => summarize d e
adamc@579 377 | EApp _ =>
adamc@579 378 let
adamc@694 379 fun unravel (e, passed, ls) =
adamc@579 380 case e of
adamc@579 381 ENamed n =>
adamc@579 382 let
adamc@579 383 val ls = rev ls
adamc@579 384 in
adamc@948 385 if IS.member (impures, n) then
adamc@948 386 case IM.find (absCounts, n) of
adamc@948 387 NONE => [Unsure]
adamc@948 388 | SOME len =>
adamc@948 389 if passed < len then
adamc@948 390 ls
adamc@948 391 else
adamc@948 392 ls @ [Unsure]
adamc@948 393 else
adamc@948 394 ls
adamc@579 395 end
adamc@579 396 | ERel n => List.revAppend (ls,
adamc@579 397 if n = d then
adamc@579 398 [UseRel, Unsure]
adamc@579 399 else
adamc@579 400 [Unsure])
adamc@579 401 | EApp (f, x) =>
adamc@995 402 unravel (#1 f, passed + 1, List.revAppend (summarize d x,
adamc@995 403 ls))
adamc@579 404 | _ => [Unsure]
adamc@579 405 in
adamc@694 406 unravel (e, 0, [])
adamc@579 407 end
adamc@252 408
adamc@941 409 | EAbs _ => []
adamc@316 410
adamc@579 411 | EUnop (_, e) => summarize d e
adamc@579 412 | EBinop (_, e1, e2) => summarize d e1 @ summarize d e2
adamc@470 413
adamc@579 414 | ERecord xets => List.concat (map (summarize d o #2) xets)
adamc@579 415 | EField (e, _) => summarize d e
adamc@470 416
adamc@941 417 | ECase (e, pes, _) => summarize d e @ [Unsure]
adamc@941 418 (*let
adamc@579 419 val lss = map (fn (p, e) => summarize (d + patBinds p) e) pes
adamc@579 420 in
adamc@579 421 case lss of
adamc@579 422 [] => raise Fail "Empty pattern match"
adamc@579 423 | ls :: lss =>
adamc@579 424 if List.all (fn ls' => ls' = ls) lss then
adamc@579 425 summarize d e @ ls
adamc@579 426 else
adamc@579 427 [Unsure]
adamc@941 428 end*)
adamc@579 429 | EStrcat (e1, e2) => summarize d e1 @ summarize d e2
adamc@316 430
adamc@579 431 | EError (e, _) => summarize d e @ [Unsure]
adamc@741 432 | EReturnBlob {blob = e1, mimeType = e2, ...} => summarize d e1 @ summarize d e2 @ [Unsure]
adamc@1065 433 | ERedirect (e, _) => summarize d e @ [Unsure]
adamc@318 434
adamc@579 435 | EWrite e => summarize d e @ [WritePage]
adamc@579 436
adamc@579 437 | ESeq (e1, e2) => summarize d e1 @ summarize d e2
adamc@579 438 | ELet (_, _, e1, e2) => summarize d e1 @ summarize (d + 1) e2
adamc@456 439
adamc@579 440 | EClosure (_, es) => List.concat (map (summarize d) es)
adamc@470 441
adamc@579 442 | EQuery {query, body, initial, ...} =>
adamc@579 443 List.concat [summarize d query,
adamc@579 444 summarize d initial,
adamc@941 445 [ReadDb],
adamc@941 446 summarize (d + 2) body]
adamc@470 447
adamc@579 448 | EDml e => summarize d e @ [WriteDb]
adamc@579 449 | ENextval e => summarize d e @ [WriteDb]
adamc@579 450 | EUnurlify (e, _) => summarize d e
adamc@815 451 | EJavaScript (_, e) => summarize d e
adamc@579 452 | ESignalReturn e => summarize d e
adamc@579 453 | ESignalBind (e1, e2) => summarize d e1 @ summarize d e2
adamc@579 454 | ESignalSource e => summarize d e
adamc@608 455
adamc@1020 456 | EServerCall (e, _, _) => summarize d e @ [Unsure]
adamc@1021 457 | ERecv (e, _) => summarize d e @ [Unsure]
adamc@1021 458 | ESleep e => summarize d e @ [Unsure]
adamc@1021 459 | ESpawn e => summarize d e @ [Unsure]
adamc@579 460 in
adamc@579 461 (*Print.prefaces "Summarize"
adamc@579 462 [("e", MonoPrint.p_exp MonoEnv.empty (e, ErrorMsg.dummySpan)),
adamc@579 463 ("d", Print.PD.string (Int.toString d)),
adamc@579 464 ("s", p_events s)];*)
adamc@579 465 s
adamc@579 466 end
adamc@470 467
adamc@919 468 val impure = fn env => fn e =>
adamc@948 469 simpleImpure (timpures, impures) env e andalso impure e
adamc@916 470 andalso not (List.null (summarize ~1 e))
adamc@916 471
adamc@470 472 fun exp env e =
adamc@470 473 let
adamc@470 474 (*val () = Print.prefaces "exp" [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan))]*)
adamc@470 475
adamc@1017 476 fun doLet (x, t, e', b) =
adamc@1017 477 let
adamc@1017 478 fun doSub () =
adamc@1017 479 let
adamc@1017 480 val r = subExpInExp (0, e') b
adamc@1017 481 in
adamc@1017 482 (*Print.prefaces "doSub" [("e'", MonoPrint.p_exp env e'),
adamc@1017 483 ("b", MonoPrint.p_exp (E.pushERel env x t NONE) b),
adamc@1017 484 ("r", MonoPrint.p_exp env r)];*)
adamc@1017 485 #1 (reduceExp env r)
adamc@1017 486 end
adamc@1017 487
adamc@1017 488 fun trySub () =
adamc@1017 489 ((*Print.prefaces "trySub"
adamc@1017 490 [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan))];*)
adamc@1017 491 case t of
adamc@1017 492 (TFfi ("Basis", "string"), _) => doSub ()
adamc@1017 493 | (TSignal _, _) => e
adamc@1017 494 | _ =>
adamc@1017 495 case e' of
adamc@1017 496 (ECase _, _) => e
adamc@1017 497 | _ => doSub ())
adamc@1017 498 in
adamc@1017 499 if impure env e' then
adamc@1017 500 let
adamc@1017 501 val effs_e' = summarize 0 e'
adamc@1017 502 val effs_e' = List.filter (fn x => x <> UseRel) effs_e'
adamc@1017 503 val effs_b = summarize 0 b
adamc@1017 504
adamc@1017 505 (*val () = Print.prefaces "Try"
adamc@1017 506 [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan)),
adamc@1017 507 ("e'", MonoPrint.p_exp env e'),
adamc@1017 508 ("b", MonoPrint.p_exp (E.pushERel env x t NONE) b),
adamc@1017 509 ("e'_eff", p_events effs_e'),
adamc@1017 510 ("b_eff", p_events effs_b)]*)
adamc@1017 511
adamc@1017 512 fun does eff = List.exists (fn eff' => eff' = eff) effs_e'
adamc@1017 513 val writesPage = does WritePage
adamc@1017 514 val readsDb = does ReadDb
adamc@1017 515 val writesDb = does WriteDb
adamc@1017 516
adamc@1017 517 fun verifyUnused eff =
adamc@1017 518 case eff of
adamc@1017 519 UseRel => false
adamc@1017 520 | _ => true
adamc@1017 521
adamc@1017 522 fun verifyCompatible effs =
adamc@1017 523 case effs of
adamc@1017 524 [] => false
adamc@1017 525 | eff :: effs =>
adamc@1017 526 case eff of
adamc@1017 527 Unsure => false
adamc@1017 528 | UseRel => List.all verifyUnused effs
adamc@1017 529 | WritePage => not writesPage andalso verifyCompatible effs
adamc@1017 530 | ReadDb => not writesDb andalso verifyCompatible effs
adamc@1017 531 | WriteDb => not writesDb andalso not readsDb andalso verifyCompatible effs
adamc@1017 532 in
adamc@1017 533 (*Print.prefaces "verifyCompatible"
adamc@1017 534 [("e'", MonoPrint.p_exp env e'),
adamc@1017 535 ("b", MonoPrint.p_exp (E.pushERel env x t NONE) b),
adamc@1017 536 ("effs_e'", Print.p_list p_event effs_e'),
adamc@1017 537 ("effs_b", Print.p_list p_event effs_b)];*)
adamc@1017 538 if (List.null effs_e'
adamc@1017 539 orelse (List.all (fn eff => eff <> Unsure) effs_e'
adamc@1017 540 andalso verifyCompatible effs_b)
adamc@1017 541 orelse (case effs_b of
adamc@1017 542 UseRel :: effs => List.all verifyUnused effs
adamc@1017 543 | _ => false))
adamc@1017 544 andalso countFree 0 0 b = 1
adamc@1017 545 andalso not (freeInAbs b) then
adamc@1017 546 trySub ()
adamc@1017 547 else
adamc@1017 548 e
adamc@1017 549 end
adamc@1017 550 else
adamc@1017 551 trySub ()
adamc@1017 552 end
adamc@1017 553
adamc@470 554 val r =
adamc@470 555 case e of
adamc@470 556 ERel n =>
adamc@470 557 (case E.lookupERel env n of
adamc@470 558 (_, _, SOME e') => #1 e'
adamc@470 559 | _ => e)
adamc@470 560 | ENamed n =>
adamc@470 561 (case E.lookupENamed env n of
adamc@470 562 (_, _, SOME e', _) => ((*Print.prefaces "Switch" [("n", Print.PD.string (Int.toString n)),
adamc@470 563 ("e'", MonoPrint.p_exp env e')];*)
adamc@470 564 #1 e')
adamc@470 565 | _ => e)
adamc@470 566
adamc@470 567 | EApp ((EAbs (x, t, _, e1), loc), e2) =>
adamc@470 568 ((*Print.prefaces "Considering" [("e1", MonoPrint.p_exp (E.pushERel env x t NONE) e1),
adamc@694 569 ("e2", MonoPrint.p_exp env e2),
adamc@694 570 ("sub", MonoPrint.p_exp env (reduceExp env (subExpInExp (0, e2) e1)))];*)
adamc@975 571 if impure env e2 orelse countFree 0 0 e1 > 1 then
adamc@470 572 #1 (reduceExp env (ELet (x, t, e2, e1), loc))
adamc@470 573 else
adamc@470 574 #1 (reduceExp env (subExpInExp (0, e2) e1)))
adamc@470 575
adamc@470 576 | ECase (e', pes, {disc, result}) =>
adamc@442 577 let
adamc@470 578 fun push () =
adamc@470 579 case result of
adamc@470 580 (TFun (dom, result), loc) =>
adamc@470 581 if List.all (fn (_, (EAbs _, _)) => true | _ => false) pes then
adamc@827 582 let
adamc@827 583 val r =
adamc@827 584 EAbs ("y", dom, result,
adamc@827 585 (ECase (liftExpInExp 0 e',
adamc@827 586 map (fn (p, (EAbs (_, _, _, e), _)) =>
adamc@827 587 (p, swapExpVarsPat (0, patBinds p) e)
adamc@827 588 | _ => raise Fail "MonoReduce ECase") pes,
adamc@827 589 {disc = disc, result = result}), loc))
adamc@827 590 in
adamc@827 591 (*Print.prefaces "Swapped"
adamc@827 592 [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan)),
adamc@827 593 ("r", MonoPrint.p_exp env (r, ErrorMsg.dummySpan))];*)
adamc@827 594 r
adamc@827 595 end
adamc@470 596 else
adamc@470 597 e
adamc@470 598 | _ => e
adamc@318 599
adamc@470 600 fun search pes =
adamc@470 601 case pes of
adamc@470 602 [] => push ()
adamc@470 603 | (p, body) :: pes =>
adamc@814 604 case match ([], p, e') of
adamc@470 605 No => search pes
adamc@470 606 | Maybe => push ()
adamc@814 607 | Yes subs =>
adamc@800 608 let
adamc@829 609 val (body, remaining) =
adamc@829 610 foldl (fn (e, (body, remaining)) =>
adamc@829 611 (subExpInExp (0, multiLift remaining e) body, remaining - 1))
adamc@829 612 (body, length subs - 1) subs
adamc@920 613 val r = reduceExp (E.patBinds env p) body
adamc@800 614 in
adamc@829 615 (*Print.preface ("subs", Print.p_list (MonoPrint.p_exp env) subs);*)
adamc@800 616 (*Print.prefaces "ECase"
adamc@829 617 [("old", MonoPrint.p_exp env body),
adamc@829 618 ("body", MonoPrint.p_exp env body),
adamc@800 619 ("r", MonoPrint.p_exp env r)];*)
adamc@800 620 #1 r
adamc@800 621 end
adamc@470 622 in
adamc@941 623 if impure env e' then
adamc@941 624 e
adamc@941 625 else
adamc@941 626 search pes
adamc@470 627 end
adamc@318 628
adamc@470 629 | EField ((ERecord xes, _), x) =>
adamc@470 630 (case List.find (fn (x', _, _) => x' = x) xes of
adamc@470 631 SOME (_, e, _) => #1 e
adamc@470 632 | NONE => e)
adamc@398 633
adamc@470 634 | ELet (x1, t1, (ELet (x2, t2, e1, b1), loc), b2) =>
adamc@470 635 let
adamc@470 636 val e' = (ELet (x2, t2, e1,
adamc@470 637 (ELet (x1, t1, b1,
adamc@470 638 liftExpInExp 1 b2), loc)), loc)
adamc@442 639 in
adamc@470 640 (*Print.prefaces "ELet commute" [("e", MonoPrint.p_exp env (e, loc)),
adamc@470 641 ("e'", MonoPrint.p_exp env e')];*)
adamc@470 642 #1 (reduceExp env e')
adamc@470 643 end
adamc@470 644 | EApp ((ELet (x, t, e, b), loc), e') =>
adamc@470 645 #1 (reduceExp env (ELet (x, t, e,
adamc@470 646 (EApp (b, liftExpInExp 0 e'), loc)), loc))
adamc@470 647
adamc@1017 648 | ELet (x, t, e', b as (EAbs (x', t' as (TRecord [], _), ran, e''), loc)) =>
adamc@919 649 if impure env e' then
adamc@1017 650 doLet (x, t, e', b)
adamc@848 651 else
adamc@920 652 EAbs (x', t', ran, reduceExp (E.pushERel env x' t' NONE)
adamc@920 653 (ELet (x, t, liftExpInExp 0 e', swapExpVars 0 e''), loc))
adamc@470 654
adamc@1017 655 | ELet (x, t, e', b) => doLet (x, t, e', b)
adamc@252 656
adamc@470 657 | EStrcat ((EPrim (Prim.String s1), _), (EPrim (Prim.String s2), _)) =>
adamc@470 658 EPrim (Prim.String (s1 ^ s2))
adamc@268 659
adamc@572 660 | ESignalBind ((ESignalReturn e1, loc), e2) =>
adamc@572 661 #1 (reduceExp env (EApp (e2, e1), loc))
adamc@572 662
adamc@470 663 | _ => e
adamc@470 664 in
adamc@829 665 (*Print.prefaces "exp'" [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan)),
adamc@829 666 ("r", MonoPrint.p_exp env (r, ErrorMsg.dummySpan))];*)
adamc@470 667 r
adamc@470 668 end
adamc@470 669
adamc@470 670 and bind (env, b) =
adamc@470 671 case b of
adamc@470 672 U.Decl.Datatype (x, n, xncs) => E.pushDatatype env x n xncs
adamc@470 673 | U.Decl.RelE (x, t) => E.pushERel env x t NONE
adamc@1017 674 | U.Decl.NamedE (x, n, t, eo, s) =>
adamc@1017 675 let
adamc@1017 676 val eo = case eo of
adamc@1017 677 NONE => NONE
adamc@1017 678 | SOME e => if mayInline (n, e) then
adamc@1017 679 SOME e
adamc@1017 680 else
adamc@1017 681 NONE
adamc@1017 682 in
adamc@1017 683 E.pushENamed env x n t (Option.map (reduceExp env) eo) s
adamc@1017 684 end
adamc@470 685
adamc@470 686 and reduceExp env = U.Exp.mapB {typ = typ, exp = exp, bind = bind} env
adamc@470 687
adamc@801 688 fun decl env d = ((*Print.preface ("d", MonoPrint.p_decl env (d, ErrorMsg.dummySpan));*)
adamc@801 689 d)
adamc@398 690 in
adamc@470 691 U.File.mapB {typ = typ, exp = exp, decl = decl, bind = bind} E.empty file
adamc@398 692 end
adamc@133 693
adamc@133 694 end