Mercurial > urweb

annotate src/especialize.sml @ 483:a0f47540d8ad

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Remove an extra line
author Adam Chlipala <adamc@hcoop.net>
date Sun, 09 Nov 2008 12:41:34 -0500
parents 9117a7bf229c
children 3ce20b0b6914
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@479 46 val sizeOf = U.Exp.fold {kind = fn (_, n) => n,
adamc@479 47 con = fn (_, n) => n,
adamc@479 48 exp = fn (_, n) => n + 1}
adamc@479 49 0
adamc@479 50
adamc@479 51 val isOpen = U.Exp.existsB {kind = fn _ => false,
adamc@479 52 con = fn ((nc, _), c) =>
adamc@479 53 case c of
adamc@479 54 CRel n => n >= nc
adamc@479 55 | _ => false,
adamc@479 56 exp = fn ((_, ne), e) =>
adamc@479 57 case e of
adamc@479 58 ERel n => n >= ne
adamc@479 59 | _ => false,
adamc@479 60 bind = fn ((nc, ne), b) =>
adamc@479 61 case b of
adamc@479 62 U.Exp.RelC _ => (nc + 1, ne)
adamc@479 63 | U.Exp.RelE _ => (nc, ne + 1)
adamc@479 64 | _ => (nc, ne)}
adamc@479 65 (0, 0)
adamc@479 66
adamc@479 67 fun baseBad (e, _) =
adamc@453 68 case e of
adamc@479 69 EAbs (_, _, _, e) => sizeOf e > 20
adamc@479 70 | ENamed _ => false
adamc@479 71 | _ => true
adamc@453 72
adamc@479 73 fun isBad e =
adamc@479 74 case e of
adamc@479 75 (ERecord xes, _) =>
adamc@479 76 length xes > 10
adamc@479 77 orelse List.exists (fn (_, e, _) => baseBad e) xes
adamc@479 78 | _ => baseBad e
adamc@479 79
adamc@479 80 fun skeyIn e =
adamc@479 81 if isBad e orelse isOpen e then
adamc@479 82 NONE
adamc@479 83 else
adamc@479 84 SOME e
adamc@479 85
adamc@479 86 fun skeyOut e = e
adamc@453 87
adamc@443 88 type func = {
adamc@443 89 name : string,
adamc@453 90 args : int KM.map,
adamc@443 91 body : exp,
adamc@443 92 typ : con,
adamc@443 93 tag : string
adamc@443 94 }
adamc@443 95
adamc@443 96 type state = {
adamc@443 97 maxName : int,
adamc@443 98 funcs : func IM.map,
adamc@443 99 decls : (string * int * con * exp * string) list
adamc@443 100 }
adamc@443 101
adamc@443 102 fun kind (k, st) = (k, st)
adamc@443 103 fun con (c, st) = (c, st)
adamc@443 104
adamc@453 105 fun specialize' file =
adamc@443 106 let
adamc@482 107 fun default (_, fs) = fs
adamc@482 108
adamc@482 109 fun actionableExp (e, fs) =
adamc@482 110 case e of
adamc@482 111 ERecord xes =>
adamc@482 112 foldl (fn (((CName s, _), e, _), fs) =>
adamc@482 113 if s = "Action" orelse s = "Link" then
adamc@482 114 let
adamc@482 115 fun findHead (e, _) =
adamc@482 116 case e of
adamc@482 117 ENamed n => IS.add (fs, n)
adamc@482 118 | EApp (e, _) => findHead e
adamc@482 119 | _ => fs
adamc@482 120 in
adamc@482 121 findHead e
adamc@482 122 end
adamc@482 123 else
adamc@482 124 fs
adamc@482 125 | (_, fs) => fs)
adamc@482 126 fs xes
adamc@482 127 | _ => fs
adamc@482 128
adamc@482 129 val actionable =
adamc@482 130 U.File.fold {kind = default,
adamc@482 131 con = default,
adamc@482 132 exp = actionableExp,
adamc@482 133 decl = default}
adamc@482 134 IS.empty file
adamc@482 135
adamc@482 136 fun exp (e, st : state) =
adamc@482 137 let
adamc@482 138 fun getApp e =
adamc@482 139 case e of
adamc@482 140 ENamed f => SOME (f, [], [])
adamc@482 141 | EApp (e1, e2) =>
adamc@482 142 (case getApp (#1 e1) of
adamc@482 143 NONE => NONE
adamc@482 144 | SOME (f, xs, xs') =>
adamc@482 145 let
adamc@482 146 val k =
adamc@482 147 if List.null xs' then
adamc@482 148 skeyIn e2
adamc@482 149 else
adamc@482 150 NONE
adamc@482 151 in
adamc@482 152 case k of
adamc@482 153 NONE => SOME (f, xs, xs' @ [e2])
adamc@482 154 | SOME k => SOME (f, xs @ [k], xs')
adamc@482 155 end)
adamc@482 156 | _ => NONE
adamc@482 157 in
adamc@482 158 case getApp e of
adamc@482 159 NONE => (e, st)
adamc@482 160 | SOME (f, [], []) => (e, st)
adamc@482 161 | SOME (f, [], xs') =>
adamc@482 162 (case IM.find (#funcs st, f) of
adamc@482 163 NONE => (e, st)
adamc@482 164 | SOME {typ, body, ...} =>
adamc@482 165 let
adamc@482 166 val functionInside = U.Con.exists {kind = fn _ => false,
adamc@482 167 con = fn TFun _ => true
adamc@482 168 | CFfi ("Basis", "transaction") => true
adamc@482 169 | _ => false}
adamc@482 170
adamc@482 171 fun hasFunarg (t, xs) =
adamc@482 172 case (t, xs) of
adamc@482 173 ((TFun (dom, ran), _), _ :: xs) =>
adamc@482 174 functionInside dom
adamc@482 175 orelse hasFunarg (ran, xs)
adamc@482 176 | _ => false
adamc@482 177 in
adamc@482 178 if List.all (fn (ERel _, _) => false | _ => true) xs'
adamc@482 179 andalso not (IS.member (actionable, f))
adamc@482 180 andalso hasFunarg (typ, xs') then
adamc@482 181 (#1 (foldl (fn (arg, e) => (EApp (e, arg), ErrorMsg.dummySpan))
adamc@482 182 body xs'),
adamc@482 183 st)
adamc@482 184 else
adamc@482 185 (e, st)
adamc@482 186 end)
adamc@482 187 | SOME (f, xs, xs') =>
adamc@482 188 case IM.find (#funcs st, f) of
adamc@482 189 NONE => (e, st)
adamc@482 190 | SOME {name, args, body, typ, tag} =>
adamc@482 191 case KM.find (args, xs) of
adamc@482 192 SOME f' => (#1 (foldl (fn (arg, e) => (EApp (e, arg), ErrorMsg.dummySpan))
adamc@482 193 (ENamed f', ErrorMsg.dummySpan) xs'),
adamc@482 194 st)
adamc@482 195 | NONE =>
adamc@482 196 let
adamc@482 197 fun subBody (body, typ, xs) =
adamc@482 198 case (#1 body, #1 typ, xs) of
adamc@482 199 (_, _, []) => SOME (body, typ)
adamc@482 200 | (EAbs (_, _, _, body'), TFun (_, typ'), x :: xs) =>
adamc@482 201 let
adamc@482 202 val body'' = E.subExpInExp (0, skeyOut x) body'
adamc@482 203 in
adamc@482 204 subBody (body'',
adamc@482 205 typ',
adamc@482 206 xs)
adamc@482 207 end
adamc@482 208 | _ => NONE
adamc@482 209 in
adamc@482 210 case subBody (body, typ, xs) of
adamc@482 211 NONE => (e, st)
adamc@482 212 | SOME (body', typ') =>
adamc@482 213 let
adamc@482 214 val f' = #maxName st
adamc@482 215 val funcs = IM.insert (#funcs st, f, {name = name,
adamc@482 216 args = KM.insert (args,
adamc@482 217 xs, f'),
adamc@482 218 body = body,
adamc@482 219 typ = typ,
adamc@482 220 tag = tag})
adamc@482 221 val st = {
adamc@482 222 maxName = f' + 1,
adamc@482 223 funcs = funcs,
adamc@482 224 decls = #decls st
adamc@482 225 }
adamc@482 226
adamc@482 227 val (body', st) = specExp st body'
adamc@482 228 val e' = foldl (fn (arg, e) => (EApp (e, arg), ErrorMsg.dummySpan))
adamc@482 229 (ENamed f', ErrorMsg.dummySpan) xs'
adamc@482 230 in
adamc@482 231 (#1 e',
adamc@482 232 {maxName = #maxName st,
adamc@482 233 funcs = #funcs st,
adamc@482 234 decls = (name, f', typ', body', tag) :: #decls st})
adamc@482 235 end
adamc@482 236 end
adamc@482 237 end
adamc@482 238
adamc@482 239 and specExp st = U.Exp.foldMap {kind = kind, con = con, exp = exp} st
adamc@482 240
adamc@482 241 fun decl (d, st) = (d, st)
adamc@482 242
adamc@482 243 val specDecl = U.Decl.foldMap {kind = kind, con = con, exp = exp, decl = decl}
adamc@482 244
adamc@482 245
adamc@482 246
adamc@453 247 fun doDecl (d, (st : state, changed)) =
adamc@443 248 let
adamc@453 249 val funcs = #funcs st
adamc@453 250 val funcs =
adamc@453 251 case #1 d of
adamc@453 252 DValRec vis =>
adamc@453 253 foldl (fn ((x, n, c, e, tag), funcs) =>
adamc@453 254 IM.insert (funcs, n, {name = x,
adamc@453 255 args = KM.empty,
adamc@453 256 body = e,
adamc@453 257 typ = c,
adamc@453 258 tag = tag}))
adamc@453 259 funcs vis
adamc@453 260 | _ => funcs
adamc@453 261
adamc@453 262 val st = {maxName = #maxName st,
adamc@453 263 funcs = funcs,
adamc@453 264 decls = []}
adamc@453 265
adamc@482 266 (*val () = Print.prefaces "decl" [("d", CorePrint.p_decl CoreEnv.empty d)]*)
adamc@443 267 val (d', st) = specDecl st d
adamc@482 268 (*val () = print "/decl\n"*)
adamc@443 269
adamc@443 270 val funcs = #funcs st
adamc@443 271 val funcs =
adamc@443 272 case #1 d of
adamc@443 273 DVal (x, n, c, e as (EAbs _, _), tag) =>
adamc@443 274 IM.insert (funcs, n, {name = x,
adamc@453 275 args = KM.empty,
adamc@443 276 body = e,
adamc@443 277 typ = c,
adamc@443 278 tag = tag})
adamc@469 279 | DVal (_, n, _, (ENamed n', _), _) =>
adamc@469 280 (case IM.find (funcs, n') of
adamc@469 281 NONE => funcs
adamc@469 282 | SOME v => IM.insert (funcs, n, v))
adamc@443 283 | _ => funcs
adamc@443 284
adamc@453 285 val (changed, ds) =
adamc@443 286 case #decls st of
adamc@453 287 [] => (changed, [d'])
adamc@453 288 | vis =>
adamc@453 289 (true, case d' of
adamc@453 290 (DValRec vis', _) => [(DValRec (vis @ vis'), ErrorMsg.dummySpan)]
adamc@453 291 | _ => [(DValRec vis, ErrorMsg.dummySpan), d'])
adamc@443 292 in
adamc@453 293 (ds, ({maxName = #maxName st,
adamc@453 294 funcs = funcs,
adamc@453 295 decls = []}, changed))
adamc@443 296 end
adamc@443 297
adamc@453 298 val (ds, (_, changed)) = ListUtil.foldlMapConcat doDecl
adamc@453 299 ({maxName = U.File.maxName file + 1,
adamc@453 300 funcs = IM.empty,
adamc@453 301 decls = []}, false)
adamc@453 302 file
adamc@443 303 in
adamc@453 304 (changed, ds)
adamc@443 305 end
adamc@443 306
adamc@453 307 fun specialize file =
adamc@453 308 let
adamc@453 309 val (changed, file) = specialize' file
adamc@453 310 in
adamc@453 311 if changed then
adamc@482 312 specialize (ReduceLocal.reduce file)
adamc@453 313 else
adamc@453 314 file
adamc@453 315 end
adamc@453 316
adamc@443 317 end