Mercurial > urweb

annotate src/mono_util.sml @ 183:c0ea24dcb86f

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Optimizing 'case' in Mono_reduce
author Adam Chlipala <adamc@hcoop.net>
date Sun, 03 Aug 2008 13:30:27 -0400
parents d11754ffe252
children 8e9f97508f0d
rev   line source
adamc@26 1 (* Copyright (c) 2008, Adam Chlipala
adamc@26 2 * All rights reserved.
adamc@26 3 *
adamc@26 4 * Redistribution and use in source and binary forms, with or without
adamc@26 5 * modification, are permitted provided that the following conditions are met:
adamc@26 6 *
adamc@26 7 * - Redistributions of source code must retain the above copyright notice,
adamc@26 8 * this list of conditions and the following disclaimer.
adamc@26 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@26 10 * this list of conditions and the following disclaimer in the documentation
adamc@26 11 * and/or other materials provided with the distribution.
adamc@26 12 * - The names of contributors may not be used to endorse or promote products
adamc@26 13 * derived from this software without specific prior written permission.
adamc@26 14 *
adamc@26 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@26 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@26 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@26 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@26 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@26 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@26 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@26 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@26 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@26 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@26 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@26 26 *)
adamc@26 27
adamc@26 28 structure MonoUtil :> MONO_UTIL = struct
adamc@26 29
adamc@26 30 open Mono
adamc@26 31
adamc@26 32 structure S = Search
adamc@26 33
adamc@26 34 structure Typ = struct
adamc@26 35
adamc@109 36 fun join (o1, o2) =
adamc@109 37 case o1 of
adamc@109 38 EQUAL => o2 ()
adamc@109 39 | v => v
adamc@109 40
adamc@109 41 fun joinL f (os1, os2) =
adamc@109 42 case (os1, os2) of
adamc@109 43 (nil, nil) => EQUAL
adamc@109 44 | (nil, _) => LESS
adamc@109 45 | (h1 :: t1, h2 :: t2) =>
adamc@109 46 join (f (h1, h2), fn () => joinL f (t1, t2))
adamc@109 47 | (_ :: _, nil) => GREATER
adamc@109 48
adamc@109 49 fun compare ((t1, _), (t2, _)) =
adamc@109 50 case (t1, t2) of
adamc@109 51 (TFun (d1, r1), TFun (d2, r2)) =>
adamc@109 52 join (compare (d1, d2), fn () => compare (r1, r2))
adamc@109 53 | (TRecord xts1, TRecord xts2) =>
adamc@109 54 let
adamc@109 55 val xts1 = sortFields xts1
adamc@109 56 val xts2 = sortFields xts2
adamc@109 57 in
adamc@109 58 joinL compareFields (xts1, xts2)
adamc@109 59 end
adamc@168 60 | (TDatatype (n1, _), TDatatype (n2, _)) => Int.compare (n1, n2)
adamc@109 61 | (TFfi (m1, x1), TFfi (m2, x2)) => join (String.compare (m1, m2), fn () => String.compare (x1, x2))
adamc@109 62
adamc@109 63 | (TFun _, _) => LESS
adamc@109 64 | (_, TFun _) => GREATER
adamc@109 65
adamc@109 66 | (TRecord _, _) => LESS
adamc@109 67 | (_, TRecord _) => GREATER
adamc@109 68
adamc@168 69 | (TDatatype _, _) => LESS
adamc@168 70 | (_, TDatatype _) => GREATER
adamc@109 71
adamc@109 72 and compareFields ((x1, t1), (x2, t2)) =
adamc@109 73 join (String.compare (x1, x2),
adamc@109 74 fn () => compare (t1, t2))
adamc@109 75
adamc@109 76 and sortFields xts = ListMergeSort.sort (fn (x, y) => compareFields (x, y) = GREATER) xts
adamc@109 77
adamc@26 78 fun mapfold fc =
adamc@26 79 let
adamc@26 80 fun mft c acc =
adamc@26 81 S.bindP (mft' c acc, fc)
adamc@26 82
adamc@26 83 and mft' (cAll as (c, loc)) =
adamc@26 84 case c of
adamc@26 85 TFun (t1, t2) =>
adamc@26 86 S.bind2 (mft t1,
adamc@26 87 fn t1' =>
adamc@26 88 S.map2 (mft t2,
adamc@26 89 fn t2' =>
adamc@26 90 (TFun (t1', t2'), loc)))
adamc@26 91 | TRecord xts =>
adamc@26 92 S.map2 (ListUtil.mapfold (fn (x, t) =>
adamc@26 93 S.map2 (mft t,
adamc@26 94 fn t' =>
adamc@26 95 (x, t')))
adamc@26 96 xts,
adamc@26 97 fn xts' => (TRecord xts', loc))
adamc@168 98 | TDatatype _ => S.return2 cAll
adamc@51 99 | TFfi _ => S.return2 cAll
adamc@26 100 in
adamc@26 101 mft
adamc@26 102 end
adamc@26 103
adamc@26 104 fun map typ c =
adamc@26 105 case mapfold (fn c => fn () => S.Continue (typ c, ())) c () of
adamc@26 106 S.Return () => raise Fail "Mono_util.Typ.map"
adamc@26 107 | S.Continue (c, ()) => c
adamc@26 108
adamc@26 109 fun fold typ s c =
adamc@26 110 case mapfold (fn c => fn s => S.Continue (c, typ (c, s))) c s of
adamc@26 111 S.Continue (_, s) => s
adamc@26 112 | S.Return _ => raise Fail "MonoUtil.Typ.fold: Impossible"
adamc@26 113
adamc@26 114 fun exists typ k =
adamc@26 115 case mapfold (fn c => fn () =>
adamc@26 116 if typ c then
adamc@26 117 S.Return ()
adamc@26 118 else
adamc@26 119 S.Continue (c, ())) k () of
adamc@26 120 S.Return _ => true
adamc@26 121 | S.Continue _ => false
adamc@26 122
adamc@26 123 end
adamc@26 124
adamc@26 125 structure Exp = struct
adamc@26 126
adamc@26 127 datatype binder =
adamc@168 128 Datatype of string * int * (string * int * typ option) list
adamc@26 129 | RelE of string * typ
adamc@109 130 | NamedE of string * int * typ * exp option * string
adamc@26 131
adamc@26 132 fun mapfoldB {typ = fc, exp = fe, bind} =
adamc@26 133 let
adamc@26 134 val mft = Typ.mapfold fc
adamc@26 135
adamc@26 136 fun mfe ctx e acc =
adamc@26 137 S.bindP (mfe' ctx e acc, fe ctx)
adamc@26 138
adamc@26 139 and mfe' ctx (eAll as (e, loc)) =
adamc@26 140 case e of
adamc@26 141 EPrim _ => S.return2 eAll
adamc@26 142 | ERel _ => S.return2 eAll
adamc@26 143 | ENamed _ => S.return2 eAll
adamc@178 144 | ECon (_, NONE) => S.return2 eAll
adamc@178 145 | ECon (n, SOME e) =>
adamc@178 146 S.map2 (mfe ctx e,
adamc@178 147 fn e' =>
adamc@178 148 (ECon (n, SOME e'), loc))
adamc@51 149 | EFfi _ => S.return2 eAll
adamc@51 150 | EFfiApp (m, x, es) =>
adamc@51 151 S.map2 (ListUtil.mapfold (fn e => mfe ctx e) es,
adamc@51 152 fn es' =>
adamc@51 153 (EFfiApp (m, x, es'), loc))
adamc@26 154 | EApp (e1, e2) =>
adamc@26 155 S.bind2 (mfe ctx e1,
adamc@26 156 fn e1' =>
adamc@26 157 S.map2 (mfe ctx e2,
adamc@26 158 fn e2' =>
adamc@26 159 (EApp (e1', e2'), loc)))
adamc@26 160 | EAbs (x, dom, ran, e) =>
adamc@26 161 S.bind2 (mft dom,
adamc@26 162 fn dom' =>
adamc@26 163 S.bind2 (mft ran,
adamc@26 164 fn ran' =>
adamc@26 165 S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
adamc@26 166 fn e' =>
adamc@26 167 (EAbs (x, dom', ran', e'), loc))))
adamc@26 168
adamc@26 169 | ERecord xes =>
adamc@29 170 S.map2 (ListUtil.mapfold (fn (x, e, t) =>
adamc@29 171 S.bind2 (mfe ctx e,
adamc@26 172 fn e' =>
adamc@29 173 S.map2 (mft t,
adamc@29 174 fn t' =>
adamc@29 175 (x, e', t'))))
adamc@26 176 xes,
adamc@26 177 fn xes' =>
adamc@26 178 (ERecord xes', loc))
adamc@26 179 | EField (e, x) =>
adamc@26 180 S.map2 (mfe ctx e,
adamc@26 181 fn e' =>
adamc@26 182 (EField (e', x), loc))
adamc@94 183
adamc@182 184 | ECase (e, pes, {disc, result}) =>
adamc@178 185 S.bind2 (mfe ctx e,
adamc@178 186 fn e' =>
adamc@178 187 S.bind2 (ListUtil.mapfold (fn (p, e) =>
adamc@179 188 let
adamc@179 189 fun pb ((p, _), ctx) =
adamc@179 190 case p of
adamc@179 191 PWild => ctx
adamc@182 192 | PVar (x, t) => bind (ctx, RelE (x, t))
adamc@179 193 | PPrim _ => ctx
adamc@179 194 | PCon (_, NONE) => ctx
adamc@179 195 | PCon (_, SOME p) => pb (p, ctx)
adamc@182 196 | PRecord xps => foldl (fn ((_, p, _), ctx) =>
adamc@179 197 pb (p, ctx)) ctx xps
adamc@179 198 in
adamc@179 199 S.map2 (mfe (pb (p, ctx)) e,
adamc@179 200 fn e' => (p, e'))
adamc@179 201 end) pes,
adamc@178 202 fn pes' =>
adamc@182 203 S.bind2 (mft disc,
adamc@182 204 fn disc' =>
adamc@182 205 S.map2 (mft result,
adamc@182 206 fn result' =>
adamc@182 207 (ECase (e', pes', {disc = disc', result = result'}), loc)))))
adamc@178 208
adamc@94 209 | EStrcat (e1, e2) =>
adamc@94 210 S.bind2 (mfe ctx e1,
adamc@94 211 fn e1' =>
adamc@94 212 S.map2 (mfe ctx e2,
adamc@94 213 fn e2' =>
adamc@94 214 (EStrcat (e1', e2'), loc)))
adamc@102 215
adamc@102 216 | EWrite e =>
adamc@102 217 S.map2 (mfe ctx e,
adamc@102 218 fn e' =>
adamc@102 219 (EWrite e', loc))
adamc@106 220
adamc@106 221 | ESeq (e1, e2) =>
adamc@106 222 S.bind2 (mfe ctx e1,
adamc@106 223 fn e1' =>
adamc@106 224 S.map2 (mfe ctx e2,
adamc@106 225 fn e2' =>
adamc@106 226 (ESeq (e1', e2'), loc)))
adamc@111 227
adamc@111 228 | EClosure (n, es) =>
adamc@111 229 S.map2 (ListUtil.mapfold (mfe ctx) es,
adamc@111 230 fn es' =>
adamc@111 231 (EClosure (n, es'), loc))
adamc@26 232 in
adamc@26 233 mfe
adamc@26 234 end
adamc@26 235
adamc@26 236 fun mapfold {typ = fc, exp = fe} =
adamc@26 237 mapfoldB {typ = fc,
adamc@26 238 exp = fn () => fe,
adamc@26 239 bind = fn ((), _) => ()} ()
adamc@26 240
adamc@26 241 fun mapB {typ, exp, bind} ctx e =
adamc@26 242 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 243 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 244 bind = bind} ctx e () of
adamc@26 245 S.Continue (e, ()) => e
adamc@26 246 | S.Return _ => raise Fail "MonoUtil.Exp.mapB: Impossible"
adamc@26 247
adamc@26 248 fun map {typ, exp} e =
adamc@26 249 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 250 exp = fn e => fn () => S.Continue (exp e, ())} e () of
adamc@26 251 S.Return () => raise Fail "Mono_util.Exp.map"
adamc@26 252 | S.Continue (e, ()) => e
adamc@26 253
adamc@26 254 fun fold {typ, exp} s e =
adamc@26 255 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 256 exp = fn e => fn s => S.Continue (e, exp (e, s))} e s of
adamc@26 257 S.Continue (_, s) => s
adamc@26 258 | S.Return _ => raise Fail "MonoUtil.Exp.fold: Impossible"
adamc@26 259
adamc@26 260 fun exists {typ, exp} k =
adamc@26 261 case mapfold {typ = fn c => fn () =>
adamc@26 262 if typ c then
adamc@26 263 S.Return ()
adamc@26 264 else
adamc@26 265 S.Continue (c, ()),
adamc@26 266 exp = fn e => fn () =>
adamc@26 267 if exp e then
adamc@26 268 S.Return ()
adamc@26 269 else
adamc@26 270 S.Continue (e, ())} k () of
adamc@26 271 S.Return _ => true
adamc@26 272 | S.Continue _ => false
adamc@26 273
adamc@26 274 end
adamc@26 275
adamc@26 276 structure Decl = struct
adamc@26 277
adamc@26 278 datatype binder = datatype Exp.binder
adamc@26 279
adamc@26 280 fun mapfoldB {typ = fc, exp = fe, decl = fd, bind} =
adamc@26 281 let
adamc@26 282 val mft = Typ.mapfold fc
adamc@26 283
adamc@26 284 val mfe = Exp.mapfoldB {typ = fc, exp = fe, bind = bind}
adamc@26 285
adamc@26 286 fun mfd ctx d acc =
adamc@26 287 S.bindP (mfd' ctx d acc, fd ctx)
adamc@26 288
adamc@26 289 and mfd' ctx (dAll as (d, loc)) =
adamc@26 290 case d of
adamc@164 291 DDatatype (x, n, xncs) =>
adamc@164 292 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@164 293 case c of
adamc@164 294 NONE => S.return2 (x, n, c)
adamc@164 295 | SOME c =>
adamc@164 296 S.map2 (mft c,
adamc@164 297 fn c' => (x, n, SOME c'))) xncs,
adamc@164 298 fn xncs' =>
adamc@164 299 (DDatatype (x, n, xncs'), loc))
adamc@164 300 | DVal vi =>
adamc@126 301 S.map2 (mfvi ctx vi,
adamc@126 302 fn vi' =>
adamc@126 303 (DVal vi', loc))
adamc@126 304 | DValRec vis =>
adamc@126 305 S.map2 (ListUtil.mapfold (mfvi ctx) vis,
adamc@126 306 fn vis' =>
adamc@126 307 (DValRec vis', loc))
adamc@144 308 | DExport (ek, s, n, ts) =>
adamc@120 309 S.map2 (ListUtil.mapfold mft ts,
adamc@120 310 fn ts' =>
adamc@144 311 (DExport (ek, s, n, ts'), loc))
adamc@126 312
adamc@126 313 and mfvi ctx (x, n, t, e, s) =
adamc@126 314 S.bind2 (mft t,
adamc@126 315 fn t' =>
adamc@126 316 S.map2 (mfe ctx e,
adamc@126 317 fn e' =>
adamc@126 318 (x, n, t', e', s)))
adamc@26 319 in
adamc@26 320 mfd
adamc@26 321 end
adamc@26 322
adamc@26 323 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 324 mapfoldB {typ = fc,
adamc@26 325 exp = fn () => fe,
adamc@26 326 decl = fn () => fd,
adamc@26 327 bind = fn ((), _) => ()} ()
adamc@26 328
adamc@26 329 fun fold {typ, exp, decl} s d =
adamc@26 330 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 331 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 332 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 333 S.Continue (_, s) => s
adamc@26 334 | S.Return _ => raise Fail "MonoUtil.Decl.fold: Impossible"
adamc@26 335
adamc@26 336 end
adamc@26 337
adamc@26 338 structure File = struct
adamc@26 339
adamc@26 340 datatype binder = datatype Exp.binder
adamc@26 341
adamc@26 342 fun mapfoldB (all as {bind, ...}) =
adamc@26 343 let
adamc@26 344 val mfd = Decl.mapfoldB all
adamc@26 345
adamc@26 346 fun mff ctx ds =
adamc@26 347 case ds of
adamc@26 348 nil => S.return2 nil
adamc@26 349 | d :: ds' =>
adamc@26 350 S.bind2 (mfd ctx d,
adamc@26 351 fn d' =>
adamc@26 352 let
adamc@100 353 val ctx' =
adamc@26 354 case #1 d' of
adamc@164 355 DDatatype (x, n, xncs) =>
adamc@164 356 let
adamc@168 357 val ctx = bind (ctx, Datatype (x, n, xncs))
adamc@168 358 val t = (TDatatype (n, xncs), #2 d')
adamc@164 359 in
adamc@164 360 foldl (fn ((x, n, to), ctx) =>
adamc@164 361 let
adamc@164 362 val t = case to of
adamc@164 363 NONE => t
adamc@164 364 | SOME t' => (TFun (t', t), #2 d')
adamc@164 365 in
adamc@164 366 bind (ctx, NamedE (x, n, t, NONE, ""))
adamc@164 367 end)
adamc@164 368 ctx xncs
adamc@164 369 end
adamc@164 370 | DVal (x, n, t, e, s) => bind (ctx, NamedE (x, n, t, SOME e, s))
adamc@126 371 | DValRec vis => foldl (fn ((x, n, t, e, s), ctx) =>
adamc@126 372 bind (ctx, NamedE (x, n, t, SOME e, s))) ctx vis
adamc@109 373 | DExport _ => ctx
adamc@26 374 in
adamc@26 375 S.map2 (mff ctx' ds',
adamc@26 376 fn ds' =>
adamc@26 377 d' :: ds')
adamc@26 378 end)
adamc@26 379 in
adamc@26 380 mff
adamc@26 381 end
adamc@26 382
adamc@26 383 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 384 mapfoldB {typ = fc,
adamc@26 385 exp = fn () => fe,
adamc@26 386 decl = fn () => fd,
adamc@26 387 bind = fn ((), _) => ()} ()
adamc@26 388
adamc@26 389 fun mapB {typ, exp, decl, bind} ctx ds =
adamc@26 390 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 391 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 392 decl = fn ctx => fn d => fn () => S.Continue (decl ctx d, ()),
adamc@26 393 bind = bind} ctx ds () of
adamc@26 394 S.Continue (ds, ()) => ds
adamc@26 395 | S.Return _ => raise Fail "MonoUtil.File.mapB: Impossible"
adamc@26 396
adamc@96 397 fun map {typ, exp, decl} e =
adamc@96 398 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@96 399 exp = fn e => fn () => S.Continue (exp e, ()),
adamc@96 400 decl = fn d => fn () => S.Continue (decl d, ())} e () of
adamc@96 401 S.Return () => raise Fail "Mono_util.File.map"
adamc@96 402 | S.Continue (e, ()) => e
adamc@96 403
adamc@26 404 fun fold {typ, exp, decl} s d =
adamc@26 405 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 406 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 407 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 408 S.Continue (_, s) => s
adamc@26 409 | S.Return _ => raise Fail "MonoUtil.File.fold: Impossible"
adamc@26 410
adamc@26 411 end
adamc@26 412
adamc@26 413 end