Mercurial > urweb

annotate src/especialize.sml @ 628:12b73f3c108e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Switch to TDisjoint from CDisjoint; still need to implement obligation generation at EDisjoint uses
author Adam Chlipala <adamc@hcoop.net>
date Tue, 24 Feb 2009 12:01:24 -0500
parents 230654093b51
children 9864b64b1700
rev   line source
adamc@443 1 (* Copyright (c) 2008, Adam Chlipala
adamc@443 2 * All rights reserved.
adamc@443 3 *
adamc@443 4 * Redistribution and use in source and binary forms, with or without
adamc@443 5 * modification, are permitted provided that the following conditions are met:
adamc@443 6 *
adamc@443 7 * - Redistributions of source code must retain the above copyright notice,
adamc@443 8 * this list of conditions and the following disclaimer.
adamc@443 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@443 10 * this list of conditions and the following disclaimer in the documentation
adamc@443 11 * and/or other materials provided with the distribution.
adamc@443 12 * - The names of contributors may not be used to endorse or promote products
adamc@443 13 * derived from this software without specific prior written permission.
adamc@443 14 *
adamc@443 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@443 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@443 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@443 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@443 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@443 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@443 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@443 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@443 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@443 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@443 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@443 26 *)
adamc@443 27
adamc@443 28 structure ESpecialize :> ESPECIALIZE = struct
adamc@443 29
adamc@443 30 open Core
adamc@443 31
adamc@443 32 structure E = CoreEnv
adamc@443 33 structure U = CoreUtil
adamc@443 34
adamc@479 35 type skey = exp
adamc@453 36
adamc@453 37 structure K = struct
adamc@479 38 type ord_key = exp list
adamc@479 39 val compare = Order.joinL U.Exp.compare
adamc@443 40 end
adamc@443 41
adamc@453 42 structure KM = BinaryMapFn(K)
adamc@443 43 structure IM = IntBinaryMap
adamc@482 44 structure IS = IntBinarySet
adamc@443 45
adamc@626 46 val freeVars = U.Exp.foldB {kind = fn (_, _, xs) => xs,
adamc@488 47 con = fn (_, _, xs) => xs,
adamc@488 48 exp = fn (bound, e, xs) =>
adamc@488 49 case e of
adamc@488 50 ERel x =>
adamc@488 51 if x >= bound then
adamc@488 52 IS.add (xs, x - bound)
adamc@488 53 else
adamc@488 54 xs
adamc@488 55 | _ => xs,
adamc@488 56 bind = fn (bound, b) =>
adamc@488 57 case b of
adamc@488 58 U.Exp.RelE _ => bound + 1
adamc@488 59 | _ => bound}
adamc@488 60 0 IS.empty
adamc@479 61
adamc@522 62 val isPoly = U.Decl.exists {kind = fn _ => false,
adamc@522 63 con = fn _ => false,
adamc@522 64 exp = fn ECAbs _ => true
adamc@522 65 | _ => false,
adamc@522 66 decl = fn _ => false}
adamc@522 67
adamc@488 68 fun positionOf (v : int, ls) =
adamc@488 69 let
adamc@488 70 fun pof (pos, ls) =
adamc@488 71 case ls of
adamc@488 72 [] => raise Fail "Defunc.positionOf"
adamc@488 73 | v' :: ls' =>
adamc@488 74 if v = v' then
adamc@488 75 pos
adamc@488 76 else
adamc@488 77 pof (pos + 1, ls')
adamc@488 78 in
adamc@488 79 pof (0, ls)
adamc@488 80 end
adamc@488 81
adamc@488 82 fun squish fvs =
adamc@626 83 U.Exp.mapB {kind = fn _ => fn k => k,
adamc@488 84 con = fn _ => fn c => c,
adamc@488 85 exp = fn bound => fn e =>
adamc@479 86 case e of
adamc@488 87 ERel x =>
adamc@488 88 if x >= bound then
adamc@488 89 ERel (positionOf (x - bound, fvs) + bound)
adamc@488 90 else
adamc@488 91 e
adamc@488 92 | _ => e,
adamc@488 93 bind = fn (bound, b) =>
adamc@488 94 case b of
adamc@488 95 U.Exp.RelE _ => bound + 1
adamc@488 96 | _ => bound}
adamc@488 97 0
adamc@453 98
adamc@443 99 type func = {
adamc@443 100 name : string,
adamc@453 101 args : int KM.map,
adamc@443 102 body : exp,
adamc@443 103 typ : con,
adamc@443 104 tag : string
adamc@443 105 }
adamc@443 106
adamc@443 107 type state = {
adamc@443 108 maxName : int,
adamc@443 109 funcs : func IM.map,
adamc@443 110 decls : (string * int * con * exp * string) list
adamc@443 111 }
adamc@443 112
adamc@488 113 fun default (_, x, st) = (x, st)
adamc@443 114
adamc@453 115 fun specialize' file =
adamc@443 116 let
adamc@488 117 fun default' (_, fs) = fs
adamc@482 118
adamc@482 119 fun actionableExp (e, fs) =
adamc@482 120 case e of
adamc@482 121 ERecord xes =>
adamc@482 122 foldl (fn (((CName s, _), e, _), fs) =>
adamc@482 123 if s = "Action" orelse s = "Link" then
adamc@482 124 let
adamc@482 125 fun findHead (e, _) =
adamc@482 126 case e of
adamc@482 127 ENamed n => IS.add (fs, n)
adamc@482 128 | EApp (e, _) => findHead e
adamc@482 129 | _ => fs
adamc@482 130 in
adamc@482 131 findHead e
adamc@482 132 end
adamc@482 133 else
adamc@482 134 fs
adamc@482 135 | (_, fs) => fs)
adamc@482 136 fs xes
adamc@482 137 | _ => fs
adamc@482 138
adamc@482 139 val actionable =
adamc@488 140 U.File.fold {kind = default',
adamc@488 141 con = default',
adamc@482 142 exp = actionableExp,
adamc@488 143 decl = default'}
adamc@482 144 IS.empty file
adamc@482 145
adamc@488 146 fun bind (env, b) =
adamc@488 147 case b of
adamc@521 148 U.Decl.RelE xt => xt :: env
adamc@521 149 | _ => env
adamc@488 150
adamc@488 151 fun exp (env, e, st : state) =
adamc@482 152 let
adamc@488 153 fun getApp e =
adamc@482 154 case e of
adamc@488 155 ENamed f => SOME (f, [])
adamc@482 156 | EApp (e1, e2) =>
adamc@488 157 (case getApp (#1 e1) of
adamc@482 158 NONE => NONE
adamc@488 159 | SOME (f, xs) => SOME (f, xs @ [e2]))
adamc@482 160 | _ => NONE
adamc@482 161 in
adamc@482 162 case getApp e of
adamc@482 163 NONE => (e, st)
adamc@488 164 | SOME (f, xs) =>
adamc@485 165 case IM.find (#funcs st, f) of
adamc@485 166 NONE => (e, st)
adamc@485 167 | SOME {name, args, body, typ, tag} =>
adamc@488 168 let
adamc@488 169 val functionInside = U.Con.exists {kind = fn _ => false,
adamc@488 170 con = fn TFun _ => true
adamc@488 171 | CFfi ("Basis", "transaction") => true
adamc@488 172 | _ => false}
adamc@488 173 val loc = ErrorMsg.dummySpan
adamc@488 174
adamc@488 175 fun findSplit (xs, typ, fxs, fvs) =
adamc@488 176 case (#1 typ, xs) of
adamc@488 177 (TFun (dom, ran), e :: xs') =>
adamc@488 178 if functionInside dom then
adamc@488 179 findSplit (xs',
adamc@488 180 ran,
adamc@488 181 e :: fxs,
adamc@488 182 IS.union (fvs, freeVars e))
adamc@488 183 else
adamc@488 184 (rev fxs, xs, fvs)
adamc@488 185 | _ => (rev fxs, xs, fvs)
adamc@488 186
adamc@488 187 val (fxs, xs, fvs) = findSplit (xs, typ, [], IS.empty)
adamc@488 188
adamc@488 189 val fxs' = map (squish (IS.listItems fvs)) fxs
adamc@488 190
adamc@488 191 fun firstRel () =
adamc@488 192 case fxs' of
adamc@488 193 (ERel _, _) :: _ => true
adamc@488 194 | _ => false
adamc@488 195 in
adamc@488 196 if firstRel ()
adamc@488 197 orelse List.all (fn (ERel _, _) => true
adamc@488 198 | _ => false) fxs' then
adamc@488 199 (e, st)
adamc@488 200 else
adamc@488 201 case KM.find (args, fxs') of
adamc@488 202 SOME f' =>
adamc@485 203 let
adamc@488 204 val e = (ENamed f', loc)
adamc@488 205 val e = IS.foldr (fn (arg, e) => (EApp (e, (ERel arg, loc)), loc))
adamc@488 206 e fvs
adamc@488 207 val e = foldl (fn (arg, e) => (EApp (e, arg), loc))
adamc@488 208 e xs
adamc@488 209 in
adamc@488 210 (*Print.prefaces "Brand new (reuse)"
adamc@488 211 [("e'", CorePrint.p_exp env e)];*)
adamc@488 212 (#1 e, st)
adamc@488 213 end
adamc@488 214 | NONE =>
adamc@488 215 let
adamc@488 216 fun subBody (body, typ, fxs') =
adamc@488 217 case (#1 body, #1 typ, fxs') of
adamc@488 218 (_, _, []) => SOME (body, typ)
adamc@488 219 | (EAbs (_, _, _, body'), TFun (_, typ'), x :: fxs'') =>
adamc@488 220 let
adamc@488 221 val body'' = E.subExpInExp (0, x) body'
adamc@488 222 in
adamc@488 223 subBody (body'',
adamc@488 224 typ',
adamc@488 225 fxs'')
adamc@488 226 end
adamc@488 227 | _ => NONE
adamc@488 228 in
adamc@488 229 case subBody (body, typ, fxs') of
adamc@488 230 NONE => (e, st)
adamc@488 231 | SOME (body', typ') =>
adamc@488 232 let
adamc@488 233 val f' = #maxName st
adamc@488 234 val args = KM.insert (args, fxs', f')
adamc@488 235 val funcs = IM.insert (#funcs st, f, {name = name,
adamc@488 236 args = args,
adamc@488 237 body = body,
adamc@488 238 typ = typ,
adamc@488 239 tag = tag})
adamc@488 240 val st = {
adamc@488 241 maxName = f' + 1,
adamc@488 242 funcs = funcs,
adamc@488 243 decls = #decls st
adamc@488 244 }
adamc@487 245
adamc@488 246 (*val () = Print.prefaces "specExp"
adamc@488 247 [("f", CorePrint.p_exp env (ENamed f, loc)),
adamc@488 248 ("f'", CorePrint.p_exp env (ENamed f', loc)),
adamc@488 249 ("xs", Print.p_list (CorePrint.p_exp env) xs),
adamc@488 250 ("fxs'", Print.p_list
adamc@488 251 (CorePrint.p_exp E.empty) fxs'),
adamc@488 252 ("e", CorePrint.p_exp env (e, loc))]*)
adamc@488 253 val (body', typ') = IS.foldl (fn (n, (body', typ')) =>
adamc@488 254 let
adamc@521 255 val (x, xt) = List.nth (env, n)
adamc@488 256 in
adamc@488 257 ((EAbs (x, xt, typ', body'),
adamc@488 258 loc),
adamc@488 259 (TFun (xt, typ'), loc))
adamc@488 260 end)
adamc@488 261 (body', typ') fvs
adamc@488 262 val (body', st) = specExp env st body'
adamc@482 263
adamc@488 264 val e' = (ENamed f', loc)
adamc@488 265 val e' = IS.foldr (fn (arg, e) => (EApp (e, (ERel arg, loc)), loc))
adamc@488 266 e' fvs
adamc@488 267 val e' = foldl (fn (arg, e) => (EApp (e, arg), loc))
adamc@488 268 e' xs
adamc@488 269 (*val () = Print.prefaces "Brand new"
adamc@488 270 [("e'", CorePrint.p_exp env e'),
adamc@488 271 ("e", CorePrint.p_exp env (e, loc)),
adamc@488 272 ("body'", CorePrint.p_exp env body')]*)
adamc@488 273 in
adamc@488 274 (#1 e',
adamc@488 275 {maxName = #maxName st,
adamc@488 276 funcs = #funcs st,
adamc@488 277 decls = (name, f', typ', body', tag) :: #decls st})
adamc@488 278 end
adamc@485 279 end
adamc@488 280 end
adamc@485 281 end
adamc@482 282
adamc@626 283 and specExp env = U.Exp.foldMapB {kind = default, con = default, exp = exp, bind = bind} env
adamc@482 284
adamc@626 285 val specDecl = U.Decl.foldMapB {kind = default, con = default, exp = exp, decl = default, bind = bind}
adamc@482 286
adamc@521 287 fun doDecl (d, (st : state, changed)) =
adamc@488 288 let
adamc@521 289 (*val befor = Time.now ()*)
adamc@482 290
adamc@453 291 val funcs = #funcs st
adamc@453 292 val funcs =
adamc@453 293 case #1 d of
adamc@453 294 DValRec vis =>
adamc@453 295 foldl (fn ((x, n, c, e, tag), funcs) =>
adamc@453 296 IM.insert (funcs, n, {name = x,
adamc@453 297 args = KM.empty,
adamc@453 298 body = e,
adamc@453 299 typ = c,
adamc@453 300 tag = tag}))
adamc@453 301 funcs vis
adamc@453 302 | _ => funcs
adamc@453 303
adamc@453 304 val st = {maxName = #maxName st,
adamc@453 305 funcs = funcs,
adamc@453 306 decls = []}
adamc@453 307
adamc@482 308 (*val () = Print.prefaces "decl" [("d", CorePrint.p_decl CoreEnv.empty d)]*)
adamc@521 309
adamc@522 310 val (d', st) =
adamc@522 311 if isPoly d then
adamc@522 312 (d, st)
adamc@522 313 else
adamc@522 314 specDecl [] st d
adamc@521 315
adamc@482 316 (*val () = print "/decl\n"*)
adamc@443 317
adamc@443 318 val funcs = #funcs st
adamc@443 319 val funcs =
adamc@443 320 case #1 d of
adamc@443 321 DVal (x, n, c, e as (EAbs _, _), tag) =>
adamc@443 322 IM.insert (funcs, n, {name = x,
adamc@453 323 args = KM.empty,
adamc@443 324 body = e,
adamc@443 325 typ = c,
adamc@443 326 tag = tag})
adamc@469 327 | DVal (_, n, _, (ENamed n', _), _) =>
adamc@469 328 (case IM.find (funcs, n') of
adamc@469 329 NONE => funcs
adamc@469 330 | SOME v => IM.insert (funcs, n, v))
adamc@443 331 | _ => funcs
adamc@443 332
adamc@453 333 val (changed, ds) =
adamc@443 334 case #decls st of
adamc@453 335 [] => (changed, [d'])
adamc@453 336 | vis =>
adamc@453 337 (true, case d' of
adamc@453 338 (DValRec vis', _) => [(DValRec (vis @ vis'), ErrorMsg.dummySpan)]
adamc@453 339 | _ => [(DValRec vis, ErrorMsg.dummySpan), d'])
adamc@443 340 in
adamc@521 341 (*Print.prefaces "doDecl" [("d", CorePrint.p_decl E.empty d),
adamc@521 342 ("t", Print.PD.string (Real.toString (Time.toReal
adamc@521 343 (Time.- (Time.now (), befor)))))];*)
adamc@521 344 (ds, ({maxName = #maxName st,
adamc@453 345 funcs = funcs,
adamc@453 346 decls = []}, changed))
adamc@443 347 end
adamc@443 348
adamc@521 349 val (ds, (_, changed)) = ListUtil.foldlMapConcat doDecl
adamc@521 350 ({maxName = U.File.maxName file + 1,
adamc@488 351 funcs = IM.empty,
adamc@488 352 decls = []},
adamc@488 353 false)
adamc@488 354 file
adamc@443 355 in
adamc@453 356 (changed, ds)
adamc@443 357 end
adamc@443 358
adamc@453 359 fun specialize file =
adamc@453 360 let
adamc@487 361 (*val () = Print.prefaces "Intermediate" [("file", CorePrint.p_file CoreEnv.empty file)];*)
adamc@520 362 (*val file = ReduceLocal.reduce file*)
adamc@453 363 val (changed, file) = specialize' file
adamc@520 364 (*val file = ReduceLocal.reduce file
adamc@520 365 val file = CoreUntangle.untangle file
adamc@488 366 val file = Shake.shake file*)
adamc@453 367 in
adamc@488 368 (*print "Round over\n";*)
adamc@453 369 if changed then
adamc@520 370 let
adamc@520 371 val file = ReduceLocal.reduce file
adamc@520 372 val file = CoreUntangle.untangle file
adamc@520 373 val file = Shake.shake file
adamc@520 374 in
adamc@520 375 (*print "Again!\n";*)
adamc@520 376 specialize file
adamc@520 377 end
adamc@453 378 else
adamc@453 379 file
adamc@453 380 end
adamc@453 381
adamc@443 382 end