Mercurial > urweb

annotate src/mono_util.sml @ 188:8e9f97508f0d

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Datatype representation optimization
author Adam Chlipala <adamc@hcoop.net>
date Sun, 03 Aug 2008 19:49:21 -0400
parents d11754ffe252
children 8a70e2919e86
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@188 32 fun classifyDatatype xncs =
adamc@188 33 if List.all (fn (_, _, NONE) => true | _ => false) xncs then
adamc@188 34 Enum
adamc@188 35 else
adamc@188 36 Default
adamc@188 37
adamc@26 38 structure S = Search
adamc@26 39
adamc@26 40 structure Typ = struct
adamc@26 41
adamc@109 42 fun join (o1, o2) =
adamc@109 43 case o1 of
adamc@109 44 EQUAL => o2 ()
adamc@109 45 | v => v
adamc@109 46
adamc@109 47 fun joinL f (os1, os2) =
adamc@109 48 case (os1, os2) of
adamc@109 49 (nil, nil) => EQUAL
adamc@109 50 | (nil, _) => LESS
adamc@109 51 | (h1 :: t1, h2 :: t2) =>
adamc@109 52 join (f (h1, h2), fn () => joinL f (t1, t2))
adamc@109 53 | (_ :: _, nil) => GREATER
adamc@109 54
adamc@109 55 fun compare ((t1, _), (t2, _)) =
adamc@109 56 case (t1, t2) of
adamc@109 57 (TFun (d1, r1), TFun (d2, r2)) =>
adamc@109 58 join (compare (d1, d2), fn () => compare (r1, r2))
adamc@109 59 | (TRecord xts1, TRecord xts2) =>
adamc@109 60 let
adamc@109 61 val xts1 = sortFields xts1
adamc@109 62 val xts2 = sortFields xts2
adamc@109 63 in
adamc@109 64 joinL compareFields (xts1, xts2)
adamc@109 65 end
adamc@188 66 | (TDatatype (_, n1, _), TDatatype (_, n2, _)) => Int.compare (n1, n2)
adamc@109 67 | (TFfi (m1, x1), TFfi (m2, x2)) => join (String.compare (m1, m2), fn () => String.compare (x1, x2))
adamc@109 68
adamc@109 69 | (TFun _, _) => LESS
adamc@109 70 | (_, TFun _) => GREATER
adamc@109 71
adamc@109 72 | (TRecord _, _) => LESS
adamc@109 73 | (_, TRecord _) => GREATER
adamc@109 74
adamc@168 75 | (TDatatype _, _) => LESS
adamc@168 76 | (_, TDatatype _) => GREATER
adamc@109 77
adamc@109 78 and compareFields ((x1, t1), (x2, t2)) =
adamc@109 79 join (String.compare (x1, x2),
adamc@109 80 fn () => compare (t1, t2))
adamc@109 81
adamc@109 82 and sortFields xts = ListMergeSort.sort (fn (x, y) => compareFields (x, y) = GREATER) xts
adamc@109 83
adamc@26 84 fun mapfold fc =
adamc@26 85 let
adamc@26 86 fun mft c acc =
adamc@26 87 S.bindP (mft' c acc, fc)
adamc@26 88
adamc@26 89 and mft' (cAll as (c, loc)) =
adamc@26 90 case c of
adamc@26 91 TFun (t1, t2) =>
adamc@26 92 S.bind2 (mft t1,
adamc@26 93 fn t1' =>
adamc@26 94 S.map2 (mft t2,
adamc@26 95 fn t2' =>
adamc@26 96 (TFun (t1', t2'), loc)))
adamc@26 97 | TRecord xts =>
adamc@26 98 S.map2 (ListUtil.mapfold (fn (x, t) =>
adamc@26 99 S.map2 (mft t,
adamc@26 100 fn t' =>
adamc@26 101 (x, t')))
adamc@26 102 xts,
adamc@26 103 fn xts' => (TRecord xts', loc))
adamc@168 104 | TDatatype _ => S.return2 cAll
adamc@51 105 | TFfi _ => S.return2 cAll
adamc@26 106 in
adamc@26 107 mft
adamc@26 108 end
adamc@26 109
adamc@26 110 fun map typ c =
adamc@26 111 case mapfold (fn c => fn () => S.Continue (typ c, ())) c () of
adamc@26 112 S.Return () => raise Fail "Mono_util.Typ.map"
adamc@26 113 | S.Continue (c, ()) => c
adamc@26 114
adamc@26 115 fun fold typ s c =
adamc@26 116 case mapfold (fn c => fn s => S.Continue (c, typ (c, s))) c s of
adamc@26 117 S.Continue (_, s) => s
adamc@26 118 | S.Return _ => raise Fail "MonoUtil.Typ.fold: Impossible"
adamc@26 119
adamc@26 120 fun exists typ k =
adamc@26 121 case mapfold (fn c => fn () =>
adamc@26 122 if typ c then
adamc@26 123 S.Return ()
adamc@26 124 else
adamc@26 125 S.Continue (c, ())) k () of
adamc@26 126 S.Return _ => true
adamc@26 127 | S.Continue _ => false
adamc@26 128
adamc@26 129 end
adamc@26 130
adamc@26 131 structure Exp = struct
adamc@26 132
adamc@26 133 datatype binder =
adamc@168 134 Datatype of string * int * (string * int * typ option) list
adamc@26 135 | RelE of string * typ
adamc@109 136 | NamedE of string * int * typ * exp option * string
adamc@26 137
adamc@26 138 fun mapfoldB {typ = fc, exp = fe, bind} =
adamc@26 139 let
adamc@26 140 val mft = Typ.mapfold fc
adamc@26 141
adamc@26 142 fun mfe ctx e acc =
adamc@26 143 S.bindP (mfe' ctx e acc, fe ctx)
adamc@26 144
adamc@26 145 and mfe' ctx (eAll as (e, loc)) =
adamc@26 146 case e of
adamc@26 147 EPrim _ => S.return2 eAll
adamc@26 148 | ERel _ => S.return2 eAll
adamc@26 149 | ENamed _ => S.return2 eAll
adamc@188 150 | ECon (_, _, NONE) => S.return2 eAll
adamc@188 151 | ECon (dk, n, SOME e) =>
adamc@178 152 S.map2 (mfe ctx e,
adamc@178 153 fn e' =>
adamc@188 154 (ECon (dk, n, SOME e'), loc))
adamc@51 155 | EFfi _ => S.return2 eAll
adamc@51 156 | EFfiApp (m, x, es) =>
adamc@51 157 S.map2 (ListUtil.mapfold (fn e => mfe ctx e) es,
adamc@51 158 fn es' =>
adamc@51 159 (EFfiApp (m, x, es'), loc))
adamc@26 160 | EApp (e1, e2) =>
adamc@26 161 S.bind2 (mfe ctx e1,
adamc@26 162 fn e1' =>
adamc@26 163 S.map2 (mfe ctx e2,
adamc@26 164 fn e2' =>
adamc@26 165 (EApp (e1', e2'), loc)))
adamc@26 166 | EAbs (x, dom, ran, e) =>
adamc@26 167 S.bind2 (mft dom,
adamc@26 168 fn dom' =>
adamc@26 169 S.bind2 (mft ran,
adamc@26 170 fn ran' =>
adamc@26 171 S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
adamc@26 172 fn e' =>
adamc@26 173 (EAbs (x, dom', ran', e'), loc))))
adamc@26 174
adamc@26 175 | ERecord xes =>
adamc@29 176 S.map2 (ListUtil.mapfold (fn (x, e, t) =>
adamc@29 177 S.bind2 (mfe ctx e,
adamc@26 178 fn e' =>
adamc@29 179 S.map2 (mft t,
adamc@29 180 fn t' =>
adamc@29 181 (x, e', t'))))
adamc@26 182 xes,
adamc@26 183 fn xes' =>
adamc@26 184 (ERecord xes', loc))
adamc@26 185 | EField (e, x) =>
adamc@26 186 S.map2 (mfe ctx e,
adamc@26 187 fn e' =>
adamc@26 188 (EField (e', x), loc))
adamc@94 189
adamc@182 190 | ECase (e, pes, {disc, result}) =>
adamc@178 191 S.bind2 (mfe ctx e,
adamc@178 192 fn e' =>
adamc@178 193 S.bind2 (ListUtil.mapfold (fn (p, e) =>
adamc@179 194 let
adamc@179 195 fun pb ((p, _), ctx) =
adamc@179 196 case p of
adamc@179 197 PWild => ctx
adamc@182 198 | PVar (x, t) => bind (ctx, RelE (x, t))
adamc@179 199 | PPrim _ => ctx
adamc@188 200 | PCon (_, _, NONE) => ctx
adamc@188 201 | PCon (_, _, SOME p) => pb (p, ctx)
adamc@182 202 | PRecord xps => foldl (fn ((_, p, _), ctx) =>
adamc@179 203 pb (p, ctx)) ctx xps
adamc@179 204 in
adamc@179 205 S.map2 (mfe (pb (p, ctx)) e,
adamc@179 206 fn e' => (p, e'))
adamc@179 207 end) pes,
adamc@178 208 fn pes' =>
adamc@182 209 S.bind2 (mft disc,
adamc@182 210 fn disc' =>
adamc@182 211 S.map2 (mft result,
adamc@182 212 fn result' =>
adamc@182 213 (ECase (e', pes', {disc = disc', result = result'}), loc)))))
adamc@178 214
adamc@94 215 | EStrcat (e1, e2) =>
adamc@94 216 S.bind2 (mfe ctx e1,
adamc@94 217 fn e1' =>
adamc@94 218 S.map2 (mfe ctx e2,
adamc@94 219 fn e2' =>
adamc@94 220 (EStrcat (e1', e2'), loc)))
adamc@102 221
adamc@102 222 | EWrite e =>
adamc@102 223 S.map2 (mfe ctx e,
adamc@102 224 fn e' =>
adamc@102 225 (EWrite e', loc))
adamc@106 226
adamc@106 227 | ESeq (e1, e2) =>
adamc@106 228 S.bind2 (mfe ctx e1,
adamc@106 229 fn e1' =>
adamc@106 230 S.map2 (mfe ctx e2,
adamc@106 231 fn e2' =>
adamc@106 232 (ESeq (e1', e2'), loc)))
adamc@111 233
adamc@111 234 | EClosure (n, es) =>
adamc@111 235 S.map2 (ListUtil.mapfold (mfe ctx) es,
adamc@111 236 fn es' =>
adamc@111 237 (EClosure (n, es'), loc))
adamc@26 238 in
adamc@26 239 mfe
adamc@26 240 end
adamc@26 241
adamc@26 242 fun mapfold {typ = fc, exp = fe} =
adamc@26 243 mapfoldB {typ = fc,
adamc@26 244 exp = fn () => fe,
adamc@26 245 bind = fn ((), _) => ()} ()
adamc@26 246
adamc@26 247 fun mapB {typ, exp, bind} ctx e =
adamc@26 248 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 249 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 250 bind = bind} ctx e () of
adamc@26 251 S.Continue (e, ()) => e
adamc@26 252 | S.Return _ => raise Fail "MonoUtil.Exp.mapB: Impossible"
adamc@26 253
adamc@26 254 fun map {typ, exp} e =
adamc@26 255 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 256 exp = fn e => fn () => S.Continue (exp e, ())} e () of
adamc@26 257 S.Return () => raise Fail "Mono_util.Exp.map"
adamc@26 258 | S.Continue (e, ()) => e
adamc@26 259
adamc@26 260 fun fold {typ, exp} s e =
adamc@26 261 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 262 exp = fn e => fn s => S.Continue (e, exp (e, s))} e s of
adamc@26 263 S.Continue (_, s) => s
adamc@26 264 | S.Return _ => raise Fail "MonoUtil.Exp.fold: Impossible"
adamc@26 265
adamc@26 266 fun exists {typ, exp} k =
adamc@26 267 case mapfold {typ = fn c => fn () =>
adamc@26 268 if typ c then
adamc@26 269 S.Return ()
adamc@26 270 else
adamc@26 271 S.Continue (c, ()),
adamc@26 272 exp = fn e => fn () =>
adamc@26 273 if exp e then
adamc@26 274 S.Return ()
adamc@26 275 else
adamc@26 276 S.Continue (e, ())} k () of
adamc@26 277 S.Return _ => true
adamc@26 278 | S.Continue _ => false
adamc@26 279
adamc@26 280 end
adamc@26 281
adamc@26 282 structure Decl = struct
adamc@26 283
adamc@26 284 datatype binder = datatype Exp.binder
adamc@26 285
adamc@26 286 fun mapfoldB {typ = fc, exp = fe, decl = fd, bind} =
adamc@26 287 let
adamc@26 288 val mft = Typ.mapfold fc
adamc@26 289
adamc@26 290 val mfe = Exp.mapfoldB {typ = fc, exp = fe, bind = bind}
adamc@26 291
adamc@26 292 fun mfd ctx d acc =
adamc@26 293 S.bindP (mfd' ctx d acc, fd ctx)
adamc@26 294
adamc@26 295 and mfd' ctx (dAll as (d, loc)) =
adamc@26 296 case d of
adamc@164 297 DDatatype (x, n, xncs) =>
adamc@164 298 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@164 299 case c of
adamc@164 300 NONE => S.return2 (x, n, c)
adamc@164 301 | SOME c =>
adamc@164 302 S.map2 (mft c,
adamc@164 303 fn c' => (x, n, SOME c'))) xncs,
adamc@164 304 fn xncs' =>
adamc@164 305 (DDatatype (x, n, xncs'), loc))
adamc@164 306 | DVal vi =>
adamc@126 307 S.map2 (mfvi ctx vi,
adamc@126 308 fn vi' =>
adamc@126 309 (DVal vi', loc))
adamc@126 310 | DValRec vis =>
adamc@126 311 S.map2 (ListUtil.mapfold (mfvi ctx) vis,
adamc@126 312 fn vis' =>
adamc@126 313 (DValRec vis', loc))
adamc@144 314 | DExport (ek, s, n, ts) =>
adamc@120 315 S.map2 (ListUtil.mapfold mft ts,
adamc@120 316 fn ts' =>
adamc@144 317 (DExport (ek, s, n, ts'), loc))
adamc@126 318
adamc@126 319 and mfvi ctx (x, n, t, e, s) =
adamc@126 320 S.bind2 (mft t,
adamc@126 321 fn t' =>
adamc@126 322 S.map2 (mfe ctx e,
adamc@126 323 fn e' =>
adamc@126 324 (x, n, t', e', s)))
adamc@26 325 in
adamc@26 326 mfd
adamc@26 327 end
adamc@26 328
adamc@26 329 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 330 mapfoldB {typ = fc,
adamc@26 331 exp = fn () => fe,
adamc@26 332 decl = fn () => fd,
adamc@26 333 bind = fn ((), _) => ()} ()
adamc@26 334
adamc@26 335 fun fold {typ, exp, decl} s d =
adamc@26 336 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 337 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 338 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 339 S.Continue (_, s) => s
adamc@26 340 | S.Return _ => raise Fail "MonoUtil.Decl.fold: Impossible"
adamc@26 341
adamc@26 342 end
adamc@26 343
adamc@26 344 structure File = struct
adamc@26 345
adamc@26 346 datatype binder = datatype Exp.binder
adamc@26 347
adamc@26 348 fun mapfoldB (all as {bind, ...}) =
adamc@26 349 let
adamc@26 350 val mfd = Decl.mapfoldB all
adamc@26 351
adamc@26 352 fun mff ctx ds =
adamc@26 353 case ds of
adamc@26 354 nil => S.return2 nil
adamc@26 355 | d :: ds' =>
adamc@26 356 S.bind2 (mfd ctx d,
adamc@26 357 fn d' =>
adamc@26 358 let
adamc@100 359 val ctx' =
adamc@26 360 case #1 d' of
adamc@164 361 DDatatype (x, n, xncs) =>
adamc@164 362 let
adamc@168 363 val ctx = bind (ctx, Datatype (x, n, xncs))
adamc@188 364 val t = (TDatatype (classifyDatatype xncs, n, xncs), #2 d')
adamc@164 365 in
adamc@164 366 foldl (fn ((x, n, to), ctx) =>
adamc@164 367 let
adamc@164 368 val t = case to of
adamc@164 369 NONE => t
adamc@164 370 | SOME t' => (TFun (t', t), #2 d')
adamc@164 371 in
adamc@164 372 bind (ctx, NamedE (x, n, t, NONE, ""))
adamc@164 373 end)
adamc@164 374 ctx xncs
adamc@164 375 end
adamc@164 376 | DVal (x, n, t, e, s) => bind (ctx, NamedE (x, n, t, SOME e, s))
adamc@126 377 | DValRec vis => foldl (fn ((x, n, t, e, s), ctx) =>
adamc@126 378 bind (ctx, NamedE (x, n, t, SOME e, s))) ctx vis
adamc@109 379 | DExport _ => ctx
adamc@26 380 in
adamc@26 381 S.map2 (mff ctx' ds',
adamc@26 382 fn ds' =>
adamc@26 383 d' :: ds')
adamc@26 384 end)
adamc@26 385 in
adamc@26 386 mff
adamc@26 387 end
adamc@26 388
adamc@26 389 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 390 mapfoldB {typ = fc,
adamc@26 391 exp = fn () => fe,
adamc@26 392 decl = fn () => fd,
adamc@26 393 bind = fn ((), _) => ()} ()
adamc@26 394
adamc@26 395 fun mapB {typ, exp, decl, bind} ctx ds =
adamc@26 396 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 397 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 398 decl = fn ctx => fn d => fn () => S.Continue (decl ctx d, ()),
adamc@26 399 bind = bind} ctx ds () of
adamc@26 400 S.Continue (ds, ()) => ds
adamc@26 401 | S.Return _ => raise Fail "MonoUtil.File.mapB: Impossible"
adamc@26 402
adamc@96 403 fun map {typ, exp, decl} e =
adamc@96 404 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@96 405 exp = fn e => fn () => S.Continue (exp e, ()),
adamc@96 406 decl = fn d => fn () => S.Continue (decl d, ())} e () of
adamc@96 407 S.Return () => raise Fail "Mono_util.File.map"
adamc@96 408 | S.Continue (e, ()) => e
adamc@96 409
adamc@26 410 fun fold {typ, exp, decl} s d =
adamc@26 411 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 412 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 413 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 414 S.Continue (_, s) => s
adamc@26 415 | S.Return _ => raise Fail "MonoUtil.File.fold: Impossible"
adamc@26 416
adamc@26 417 end
adamc@26 418
adamc@26 419 end