Mercurial > urweb

annotate src/mono_reduce.sml @ 1820:3c56aa6a0f55

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