Mercurial > urweb

annotate src/mono_reduce.sml @ 416:679b2fbbd4d0

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Counter demo
author Adam Chlipala <adamc@hcoop.net>
date Thu, 23 Oct 2008 11:59:48 -0400
parents ab3177746c78
children 9095a95a1bf9
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@133 37
adamc@252 38 fun impure (e, _) =
adamc@252 39 case e of
adamc@252 40 EWrite _ => true
adamc@252 41 | EQuery _ => true
adamc@307 42 | EDml _ => true
adamc@338 43 | ENextval _ => true
adamc@252 44 | EAbs _ => false
adamc@252 45
adamc@252 46 | EPrim _ => false
adamc@252 47 | ERel _ => false
adamc@252 48 | ENamed _ => false
adamc@252 49 | ECon (_, _, eo) => (case eo of NONE => false | SOME e => impure e)
adamc@297 50 | ENone _ => false
adamc@290 51 | ESome (_, e) => impure e
adamc@252 52 | EFfi _ => false
adamc@252 53 | EFfiApp _ => false
adamc@252 54 | EApp ((EFfi _, _), _) => false
adamc@252 55 | EApp _ => true
adamc@252 56
adamc@387 57 | EUnop (_, e) => impure e
adamc@387 58 | EBinop (_, e1, e2) => impure e1 orelse impure e2
adamc@387 59
adamc@252 60 | ERecord xes => List.exists (fn (_, e, _) => impure e) xes
adamc@252 61 | EField (e, _) => impure e
adamc@252 62
adamc@252 63 | ECase (e, pes, _) => impure e orelse List.exists (fn (_, e) => impure e) pes
adamc@252 64
adamc@283 65 | EError (e, _) => impure e
adamc@283 66
adamc@252 67 | EStrcat (e1, e2) => impure e1 orelse impure e2
adamc@252 68
adamc@252 69 | ESeq (e1, e2) => impure e1 orelse impure e2
adamc@252 70 | ELet (_, _, e1, e2) => impure e1 orelse impure e2
adamc@252 71
adamc@252 72 | EClosure (_, es) => List.exists impure es
adamc@252 73
adamc@252 74
adamc@252 75 val liftExpInExp = Monoize.liftExpInExp
adamc@252 76
adamc@252 77 val subExpInExp' =
adamc@133 78 U.Exp.mapB {typ = fn t => t,
adamc@133 79 exp = fn (xn, rep) => fn e =>
adamc@133 80 case e of
adamc@133 81 ERel xn' =>
adamc@133 82 (case Int.compare (xn', xn) of
adamc@133 83 EQUAL => #1 rep
adamc@133 84 | GREATER=> ERel (xn' - 1)
adamc@133 85 | LESS => e)
adamc@133 86 | _ => e,
adamc@133 87 bind = fn ((xn, rep), U.Exp.RelE _) => (xn+1, liftExpInExp 0 rep)
adamc@133 88 | (ctx, _) => ctx}
adamc@133 89
adamc@252 90 fun subExpInExp (n, e1) e2 =
adamc@252 91 let
adamc@252 92 val r = subExpInExp' (n, e1) e2
adamc@252 93 in
adamc@252 94 (*Print.prefaces "subExpInExp" [("e1", MonoPrint.p_exp MonoEnv.empty e1),
adamc@252 95 ("e2", MonoPrint.p_exp MonoEnv.empty e2),
adamc@252 96 ("r", MonoPrint.p_exp MonoEnv.empty r)];*)
adamc@252 97 r
adamc@252 98 end
adamc@133 99
adamc@133 100 fun typ c = c
adamc@133 101
adamc@316 102 val swapExpVars =
adamc@316 103 U.Exp.mapB {typ = fn t => t,
adamc@316 104 exp = fn lower => fn e =>
adamc@316 105 case e of
adamc@316 106 ERel xn =>
adamc@316 107 if xn = lower then
adamc@316 108 ERel (lower + 1)
adamc@316 109 else if xn = lower + 1 then
adamc@316 110 ERel lower
adamc@316 111 else
adamc@316 112 e
adamc@316 113 | _ => e,
adamc@316 114 bind = fn (lower, U.Exp.RelE _) => lower+1
adamc@316 115 | (lower, _) => lower}
adamc@316 116
adamc@341 117 val swapExpVarsPat =
adamc@341 118 U.Exp.mapB {typ = fn t => t,
adamc@341 119 exp = fn (lower, len) => fn e =>
adamc@341 120 case e of
adamc@341 121 ERel xn =>
adamc@341 122 if xn = lower then
adamc@341 123 ERel (lower + 1)
adamc@341 124 else if xn >= lower + 1 andalso xn < lower + 1 + len then
adamc@341 125 ERel (xn - 1)
adamc@341 126 else
adamc@341 127 e
adamc@341 128 | _ => e,
adamc@341 129 bind = fn ((lower, len), U.Exp.RelE _) => (lower+1, len)
adamc@341 130 | (st, _) => st}
adamc@341 131
adamc@258 132 datatype result = Yes of E.env | No | Maybe
adamc@258 133
adamc@183 134 fun match (env, p : pat, e : exp) =
adamc@183 135 case (#1 p, #1 e) of
adamc@258 136 (PWild, _) => Yes env
adamc@258 137 | (PVar (x, t), _) => Yes (E.pushERel env x t (SOME e))
adamc@183 138
adamc@280 139 | (PPrim (Prim.String s), EStrcat ((EPrim (Prim.String s'), _), _)) =>
adamc@280 140 if String.isPrefix s' s then
adamc@280 141 Maybe
adamc@280 142 else
adamc@280 143 No
adamc@280 144
adamc@183 145 | (PPrim p, EPrim p') =>
adamc@183 146 if Prim.equal (p, p') then
adamc@258 147 Yes env
adamc@183 148 else
adamc@258 149 No
adamc@183 150
adamc@188 151 | (PCon (_, PConVar n1, NONE), ECon (_, PConVar n2, NONE)) =>
adamc@183 152 if n1 = n2 then
adamc@258 153 Yes env
adamc@183 154 else
adamc@258 155 No
adamc@183 156
adamc@188 157 | (PCon (_, PConVar n1, SOME p), ECon (_, PConVar n2, SOME e)) =>
adamc@183 158 if n1 = n2 then
adamc@183 159 match (env, p, e)
adamc@183 160 else
adamc@258 161 No
adamc@183 162
adamc@188 163 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, NONE), ECon (_, PConFfi {mod = m2, con = con2, ...}, NONE)) =>
adamc@185 164 if m1 = m2 andalso con1 = con2 then
adamc@258 165 Yes env
adamc@185 166 else
adamc@258 167 No
adamc@185 168
adamc@188 169 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, SOME ep), ECon (_, PConFfi {mod = m2, con = con2, ...}, SOME e)) =>
adamc@185 170 if m1 = m2 andalso con1 = con2 then
adamc@185 171 match (env, p, e)
adamc@185 172 else
adamc@258 173 No
adamc@185 174
adamc@183 175 | (PRecord xps, ERecord xes) =>
adamc@183 176 let
adamc@183 177 fun consider (xps, env) =
adamc@183 178 case xps of
adamc@258 179 [] => Yes env
adamc@183 180 | (x, p, _) :: rest =>
adamc@183 181 case List.find (fn (x', _, _) => x' = x) xes of
adamc@258 182 NONE => No
adamc@183 183 | SOME (_, e, _) =>
adamc@183 184 case match (env, p, e) of
adamc@258 185 No => No
adamc@258 186 | Maybe => Maybe
adamc@258 187 | Yes env => consider (rest, env)
adamc@183 188 in
adamc@183 189 consider (xps, env)
adamc@183 190 end
adamc@183 191
adamc@258 192 | _ => Maybe
adamc@183 193
adamc@318 194 datatype event =
adamc@318 195 WritePage
adamc@318 196 | ReadDb
adamc@318 197 | WriteDb
adamc@318 198 | UseRel of int
adamc@318 199 | Unsure
adamc@318 200
adamc@318 201 fun p_event e =
adamc@318 202 let
adamc@318 203 open Print.PD
adamc@318 204 in
adamc@318 205 case e of
adamc@318 206 WritePage => string "WritePage"
adamc@318 207 | ReadDb => string "ReadDb"
adamc@318 208 | WriteDb => string "WriteDb"
adamc@318 209 | UseRel n => string ("UseRel" ^ Int.toString n)
adamc@318 210 | Unsure => string "Unsure"
adamc@318 211 end
adamc@318 212
adamc@318 213 fun patBinds (p, _) =
adamc@318 214 case p of
adamc@318 215 PWild => 0
adamc@318 216 | PVar _ => 1
adamc@318 217 | PPrim _ => 0
adamc@318 218 | PCon (_, _, NONE) => 0
adamc@318 219 | PCon (_, _, SOME p) => patBinds p
adamc@318 220 | PRecord xpts => foldl (fn ((_, p, _), n) => n + patBinds p) 0 xpts
adamc@318 221 | PNone _ => 0
adamc@318 222 | PSome (_, p) => patBinds p
adamc@318 223
adamc@318 224 fun summarize d (e, _) =
adamc@318 225 case e of
adamc@318 226 EPrim _ => []
adamc@318 227 | ERel n => if n >= d then [UseRel (n - d)] else []
adamc@318 228 | ENamed _ => []
adamc@318 229 | ECon (_, _, NONE) => []
adamc@318 230 | ECon (_, _, SOME e) => summarize d e
adamc@318 231 | ENone _ => []
adamc@318 232 | ESome (_, e) => summarize d e
adamc@318 233 | EFfi _ => []
adamc@318 234 | EFfiApp (_, _, es) => List.concat (map (summarize d) es)
adamc@319 235 | EApp ((EFfi _, _), e) => summarize d e
adamc@318 236 | EApp _ => [Unsure]
adamc@318 237 | EAbs _ => []
adamc@318 238
adamc@387 239 | EUnop (_, e) => summarize d e
adamc@387 240 | EBinop (_, e1, e2) => summarize d e1 @ summarize d e2
adamc@387 241
adamc@318 242 | ERecord xets => List.concat (map (summarize d o #2) xets)
adamc@318 243 | EField (e, _) => summarize d e
adamc@318 244
adamc@318 245 | ECase (e, pes, _) =>
adamc@318 246 let
adamc@318 247 val lss = map (fn (p, e) => summarize (d + patBinds p) e) pes
adamc@318 248 in
adamc@318 249 case lss of
adamc@318 250 [] => raise Fail "Empty pattern match"
adamc@318 251 | ls :: lss =>
adamc@318 252 if List.all (fn ls' => ls' = ls) lss then
adamc@318 253 summarize d e @ ls
adamc@318 254 else
adamc@318 255 [Unsure]
adamc@318 256 end
adamc@318 257 | EStrcat (e1, e2) => summarize d e1 @ summarize d e2
adamc@318 258
adamc@318 259 | EError (e, _) => summarize d e @ [Unsure]
adamc@318 260
adamc@318 261 | EWrite e => summarize d e @ [WritePage]
adamc@318 262
adamc@318 263 | ESeq (e1, e2) => summarize d e1 @ summarize d e2
adamc@318 264 | ELet (_, _, e1, e2) => summarize d e1 @ summarize (d + 1) e2
adamc@318 265
adamc@318 266 | EClosure (_, es) => List.concat (map (summarize d) es)
adamc@318 267
adamc@318 268 | EQuery {query, body, initial, ...} =>
adamc@318 269 List.concat [summarize d query,
adamc@319 270 summarize (d + 2) body,
adamc@318 271 summarize d initial,
adamc@318 272 [ReadDb]]
adamc@318 273
adamc@318 274 | EDml e => summarize d e @ [WriteDb]
adamc@338 275 | ENextval e => summarize d e @ [WriteDb]
adamc@318 276
adamc@133 277 fun exp env e =
adamc@398 278 let
adamc@398 279 (*val () = Print.prefaces "exp" [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan))]*)
adamc@133 280
adamc@398 281 val r =
adamc@398 282 case e of
adamc@398 283 ERel n =>
adamc@398 284 (case E.lookupERel env n of
adamc@398 285 (_, _, SOME e') => #1 e'
adamc@398 286 | _ => e)
adamc@398 287 | ENamed n =>
adamc@398 288 (case E.lookupENamed env n of
adamc@398 289 (_, _, SOME e', _) => ((*Print.prefaces "Switch" [("n", Print.PD.string (Int.toString n)),
adamc@398 290 ("e'", MonoPrint.p_exp env e')];*)
adamc@398 291 #1 e')
adamc@398 292 | _ => e)
adamc@133 293
adamc@398 294 | EApp ((EAbs (x, t, _, e1), loc), e2) =>
adamc@398 295 ((*Print.prefaces "Considering" [("e1", MonoPrint.p_exp (E.pushERel env x t NONE) e1),
adamc@398 296 ("e2", MonoPrint.p_exp env e2),
adamc@398 297 ("sub", MonoPrint.p_exp env (reduceExp env (subExpInExp (0, e2) e1)))];*)
adamc@398 298 if impure e2 then
adamc@398 299 #1 (reduceExp env (ELet (x, t, e2, e1), loc))
adamc@398 300 else
adamc@398 301 #1 (reduceExp env (subExpInExp (0, e2) e1)))
adamc@341 302
adamc@398 303 | ECase (e', pes, {disc, result}) =>
adamc@398 304 let
adamc@398 305 fun push () =
adamc@398 306 case result of
adamc@398 307 (TFun (dom, result), loc) =>
adamc@398 308 if List.all (fn (_, (EAbs _, _)) => true | _ => false) pes then
adamc@398 309 EAbs ("_", dom, result,
adamc@398 310 (ECase (liftExpInExp 0 e',
adamc@398 311 map (fn (p, (EAbs (_, _, _, e), _)) =>
adamc@398 312 (p, swapExpVarsPat (0, patBinds p) e)
adamc@398 313 | _ => raise Fail "MonoReduce ECase") pes,
adamc@398 314 {disc = disc, result = result}), loc))
adamc@398 315 else
adamc@398 316 e
adamc@398 317 | _ => e
adamc@183 318
adamc@398 319 fun search pes =
adamc@398 320 case pes of
adamc@398 321 [] => push ()
adamc@398 322 | (p, body) :: pes =>
adamc@398 323 case match (env, p, e') of
adamc@398 324 No => search pes
adamc@398 325 | Maybe => push ()
adamc@398 326 | Yes env => #1 (reduceExp env body)
adamc@398 327 in
adamc@398 328 search pes
adamc@398 329 end
adamc@252 330
adamc@398 331 | EField ((ERecord xes, _), x) =>
adamc@398 332 (case List.find (fn (x', _, _) => x' = x) xes of
adamc@398 333 SOME (_, e, _) => #1 e
adamc@398 334 | NONE => e)
adamc@316 335
adamc@398 336 | ELet (x1, t1, (ELet (x2, t2, e1, b1), loc), b2) =>
adamc@398 337 let
adamc@398 338 val e' = (ELet (x2, t2, e1,
adamc@398 339 (ELet (x1, t1, b1,
adamc@398 340 liftExpInExp 1 b2), loc)), loc)
adamc@398 341 in
adamc@398 342 (*Print.prefaces "ELet commute" [("e", MonoPrint.p_exp env (e, loc)),
adamc@398 343 ("e'", MonoPrint.p_exp env e')];*)
adamc@398 344 #1 (reduceExp env e')
adamc@398 345 end
adamc@398 346 | EApp ((ELet (x, t, e, b), loc), e') =>
adamc@398 347 #1 (reduceExp env (ELet (x, t, e,
adamc@398 348 (EApp (b, liftExpInExp 0 e'), loc)), loc))
adamc@316 349
adamc@398 350 | ELet (x, t, e, (EAbs (x', t' as (TRecord [], _), ran, e'), loc)) =>
adamc@398 351 EAbs (x', t', ran, (ELet (x, t, liftExpInExp 0 e, swapExpVars 0 e'), loc))
adamc@318 352
adamc@398 353 | ELet (x, t, e', b) =>
adamc@398 354 if impure e' then
adamc@398 355 let
adamc@398 356 val effs_e' = summarize 0 e'
adamc@398 357 val effs_b = summarize 0 b
adamc@318 358
adamc@398 359 fun does eff = List.exists (fn eff' => eff' = eff) effs_e'
adamc@398 360 val writesPage = does WritePage
adamc@398 361 val readsDb = does ReadDb
adamc@398 362 val writesDb = does WriteDb
adamc@318 363
adamc@398 364 fun verifyUnused eff =
adamc@398 365 case eff of
adamc@398 366 UseRel r => r <> 0
adamc@398 367 | Unsure => false
adamc@398 368 | _ => true
adamc@398 369
adamc@398 370 fun verifyCompatible effs =
adamc@398 371 case effs of
adamc@398 372 [] => false
adamc@398 373 | eff :: effs =>
adamc@398 374 case eff of
adamc@398 375 Unsure => false
adamc@398 376 | UseRel r =>
adamc@398 377 if r = 0 then
adamc@398 378 List.all verifyUnused effs
adamc@398 379 else
adamc@398 380 verifyCompatible effs
adamc@398 381 | WritePage => not writesPage andalso verifyCompatible effs
adamc@398 382 | ReadDb => not writesDb andalso verifyCompatible effs
adamc@398 383 | WriteDb => not writesDb andalso not readsDb andalso verifyCompatible effs
adamc@398 384 in
adamc@398 385 (*Print.prefaces "verifyCompatible"
adamc@398 386 [("e'", MonoPrint.p_exp env e'),
adamc@398 387 ("b", MonoPrint.p_exp (E.pushERel env x t NONE) b),
adamc@398 388 ("effs_e'", Print.p_list p_event effs_e'),
adamc@398 389 ("effs_b", Print.p_list p_event effs_b)];*)
adamc@398 390 if verifyCompatible effs_b then
adamc@398 391 #1 (reduceExp env (subExpInExp (0, e') b))
adamc@398 392 else
adamc@398 393 e
adamc@398 394 end
adamc@398 395 else
adamc@318 396 #1 (reduceExp env (subExpInExp (0, e') b))
adamc@252 397
adamc@398 398 | EStrcat ((EPrim (Prim.String s1), _), (EPrim (Prim.String s2), _)) =>
adamc@398 399 EPrim (Prim.String (s1 ^ s2))
adamc@268 400
adamc@398 401 | _ => e
adamc@398 402 in
adamc@398 403 (*Print.prefaces "exp'" [("r", MonoPrint.p_exp env (r, ErrorMsg.dummySpan))];*)
adamc@398 404 r
adamc@398 405 end
adamc@133 406
adamc@252 407 and bind (env, b) =
adamc@252 408 case b of
adamc@252 409 U.Decl.Datatype (x, n, xncs) => E.pushDatatype env x n xncs
adamc@252 410 | U.Decl.RelE (x, t) => E.pushERel env x t NONE
adamc@252 411 | U.Decl.NamedE (x, n, t, eo, s) => E.pushENamed env x n t (Option.map (reduceExp env) eo) s
adamc@252 412
adamc@133 413 and reduceExp env = U.Exp.mapB {typ = typ, exp = exp, bind = bind} env
adamc@133 414
adamc@133 415 fun decl env d = d
adamc@133 416
adamc@133 417 val reduce = U.File.mapB {typ = typ, exp = exp, decl = decl, bind = bind} E.empty
adamc@133 418
adamc@133 419 end