Mercurial > urweb

annotate src/cjrize.sml @ 165:e52dfb1e6b19

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Datatypes through cjrize, modulo decoding
author Adam Chlipala <adamc@hcoop.net>
date Tue, 29 Jul 2008 13:50:53 -0400
parents 6847741e1f5f
children a991431b77eb
rev   line source
adamc@29 1 (* Copyright (c) 2008, Adam Chlipala
adamc@29 2 * All rights reserved.
adamc@29 3 *
adamc@29 4 * Redistribution and use in source and binary forms, with or without
adamc@29 5 * modification, are permitted provided that the following conditions are met:
adamc@29 6 *
adamc@29 7 * - Redistributions of source code must retain the above copyright notice,
adamc@29 8 * this list of conditions and the following disclaimer.
adamc@29 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@29 10 * this list of conditions and the following disclaimer in the documentation
adamc@29 11 * and/or other materials provided with the distribution.
adamc@29 12 * - The names of contributors may not be used to endorse or promote products
adamc@29 13 * derived from this software without specific prior written permission.
adamc@29 14 *
adamc@29 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@29 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@29 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@29 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@29 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@29 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@29 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@29 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@29 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@29 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@29 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@29 26 *)
adamc@29 27
adamc@29 28 structure Cjrize :> CJRIZE = struct
adamc@29 29
adamc@109 30 structure L = Mono
adamc@29 31 structure L' = Cjr
adamc@29 32
adamc@29 33 structure Sm :> sig
adamc@29 34 type t
adamc@29 35
adamc@29 36 val empty : t
adamc@29 37 val find : t * (string * L.typ) list * (string * L'.typ) list -> t * int
adamc@29 38
adamc@29 39 val declares : t -> (int * (string * L'.typ) list) list
adamc@29 40 end = struct
adamc@29 41
adamc@29 42 structure FM = BinaryMapFn(struct
adamc@29 43 type ord_key = L.typ
adamc@109 44 val compare = MonoUtil.Typ.compare
adamc@29 45 end)
adamc@29 46
adamc@29 47 type t = int * int FM.map * (int * (string * L'.typ) list) list
adamc@29 48
adamc@102 49 val empty : t = (1, FM.insert (FM.empty, (L.TRecord [], ErrorMsg.dummySpan), 0), [])
adamc@29 50
adamc@29 51 fun find ((n, m, ds), xts, xts') =
adamc@29 52 let
adamc@29 53 val t = (L.TRecord xts, ErrorMsg.dummySpan)
adamc@29 54 in
adamc@29 55 case FM.find (m, t) of
adamc@29 56 NONE => ((n+1, FM.insert (m, t, n), (n, xts') :: ds), n)
adamc@29 57 | SOME i => ((n, m, ds), i)
adamc@29 58 end
adamc@29 59
adamc@29 60 fun declares (_, _, ds) = ds
adamc@29 61
adamc@29 62 end
adamc@29 63
adamc@29 64 fun cifyTyp ((t, loc), sm) =
adamc@29 65 case t of
adamc@109 66 L.TFun (t1, t2) =>
adamc@29 67 let
adamc@29 68 val (t1, sm) = cifyTyp (t1, sm)
adamc@29 69 val (t2, sm) = cifyTyp (t2, sm)
adamc@29 70 in
adamc@109 71 ((L'.TFun (t1, t2), loc), sm)
adamc@29 72 end
adamc@29 73 | L.TRecord xts =>
adamc@29 74 let
adamc@29 75 val old_xts = xts
adamc@29 76 val (xts, sm) = ListUtil.foldlMap (fn ((x, t), sm) =>
adamc@29 77 let
adamc@29 78 val (t, sm) = cifyTyp (t, sm)
adamc@29 79 in
adamc@29 80 ((x, t), sm)
adamc@29 81 end)
adamc@29 82 sm xts
adamc@29 83 val (sm, si) = Sm.find (sm, old_xts, xts)
adamc@29 84 in
adamc@29 85 ((L'.TRecord si, loc), sm)
adamc@29 86 end
adamc@29 87 | L.TNamed n => ((L'.TNamed n, loc), sm)
adamc@53 88 | L.TFfi mx => ((L'.TFfi mx, loc), sm)
adamc@29 89
adamc@109 90 val dummye = (L'.EPrim (Prim.Int 0), ErrorMsg.dummySpan)
adamc@109 91
adamc@29 92 fun cifyExp ((e, loc), sm) =
adamc@29 93 case e of
adamc@29 94 L.EPrim p => ((L'.EPrim p, loc), sm)
adamc@29 95 | L.ERel n => ((L'.ERel n, loc), sm)
adamc@29 96 | L.ENamed n => ((L'.ENamed n, loc), sm)
adamc@53 97 | L.EFfi mx => ((L'.EFfi mx, loc), sm)
adamc@53 98 | L.EFfiApp (m, x, es) =>
adamc@53 99 let
adamc@53 100 val (es, sm) = ListUtil.foldlMap cifyExp sm es
adamc@53 101 in
adamc@53 102 ((L'.EFfiApp (m, x, es), loc), sm)
adamc@53 103 end
adamc@29 104 | L.EApp (e1, e2) =>
adamc@29 105 let
adamc@29 106 val (e1, sm) = cifyExp (e1, sm)
adamc@29 107 val (e2, sm) = cifyExp (e2, sm)
adamc@29 108 in
adamc@29 109 ((L'.EApp (e1, e2), loc), sm)
adamc@29 110 end
adamc@109 111 | L.EAbs _ => (ErrorMsg.errorAt loc "Anonymous function remains at code generation";
adamc@109 112 (dummye, sm))
adamc@29 113
adamc@29 114 | L.ERecord xes =>
adamc@29 115 let
adamc@29 116 val old_xts = map (fn (x, _, t) => (x, t)) xes
adamc@29 117
adamc@29 118 val (xets, sm) = ListUtil.foldlMap (fn ((x, e, t), sm) =>
adamc@29 119 let
adamc@29 120 val (e, sm) = cifyExp (e, sm)
adamc@29 121 val (t, sm) = cifyTyp (t, sm)
adamc@29 122 in
adamc@29 123 ((x, e, t), sm)
adamc@29 124 end)
adamc@29 125 sm xes
adamc@29 126
adamc@29 127 val (sm, si) = Sm.find (sm, old_xts, map (fn (x, _, t) => (x, t)) xets)
adamc@29 128
adamc@29 129 val xes = map (fn (x, e, _) => (x, e)) xets
adamc@29 130 val xes = ListMergeSort.sort (fn ((x1, _), (x2, _)) => String.compare (x1, x2) = GREATER) xes
adamc@29 131 in
adamc@29 132 ((L'.ERecord (si, xes), loc), sm)
adamc@29 133 end
adamc@29 134 | L.EField (e, x) =>
adamc@29 135 let
adamc@29 136 val (e, sm) = cifyExp (e, sm)
adamc@29 137 in
adamc@29 138 ((L'.EField (e, x), loc), sm)
adamc@29 139 end
adamc@29 140
adamc@102 141 | L.EStrcat _ => raise Fail "Cjrize EStrcat"
adamc@102 142
adamc@102 143 | L.EWrite e =>
adamc@102 144 let
adamc@102 145 val (e, sm) = cifyExp (e, sm)
adamc@102 146 in
adamc@102 147 ((L'.EWrite e, loc), sm)
adamc@102 148 end
adamc@102 149
adamc@106 150 | L.ESeq (e1, e2) =>
adamc@106 151 let
adamc@106 152 val (e1, sm) = cifyExp (e1, sm)
adamc@106 153 val (e2, sm) = cifyExp (e2, sm)
adamc@106 154 in
adamc@106 155 ((L'.ESeq (e1, e2), loc), sm)
adamc@106 156 end
adamc@106 157
adamc@111 158 | L.EClosure _ => (ErrorMsg.errorAt loc "Nested closure remains in code generation";
adamc@111 159 (dummye, sm))
adamc@111 160
adamc@29 161 fun cifyDecl ((d, loc), sm) =
adamc@29 162 case d of
adamc@165 163 L.DDatatype (x, n, xncs) =>
adamc@165 164 let
adamc@165 165 val (xncs, sm) = ListUtil.foldlMap (fn ((x, n, to), sm) =>
adamc@165 166 case to of
adamc@165 167 NONE => ((x, n, NONE), sm)
adamc@165 168 | SOME t =>
adamc@165 169 let
adamc@165 170 val (t, sm) = cifyTyp (t, sm)
adamc@165 171 in
adamc@165 172 ((x, n, SOME t), sm)
adamc@165 173 end) sm xncs
adamc@165 174 in
adamc@165 175 (SOME (L'.DDatatype (x, n, xncs), loc), NONE, sm)
adamc@165 176 end
adamc@164 177
adamc@164 178 | L.DVal (x, n, t, e, _) =>
adamc@29 179 let
adamc@29 180 val (t, sm) = cifyTyp (t, sm)
adamc@109 181
adamc@109 182 val (d, sm) = case #1 t of
adamc@121 183 L'.TFun _ =>
adamc@121 184 let
adamc@121 185 fun unravel (tAll as (t, _), eAll as (e, _)) =
adamc@121 186 case (t, e) of
adamc@121 187 (L'.TFun (dom, ran), L.EAbs (ax, _, _, e)) =>
adamc@121 188 let
adamc@121 189 val (args, t, e) = unravel (ran, e)
adamc@121 190 in
adamc@121 191 ((ax, dom) :: args, t, e)
adamc@121 192 end
adamc@121 193 | (L'.TFun _, _) =>
adamc@121 194 (ErrorMsg.errorAt loc "Function isn't explicit at code generation";
adamc@121 195 ([], tAll, eAll))
adamc@121 196 | _ => ([], tAll, eAll)
adamc@121 197
adamc@121 198 val (args, ran, e) = unravel (t, e)
adamc@121 199 val (e, sm) = cifyExp (e, sm)
adamc@121 200 in
adamc@121 201 (L'.DFun (x, n, args, ran, e), sm)
adamc@121 202 end
adamc@121 203
adamc@109 204 | _ =>
adamc@109 205 let
adamc@109 206 val (e, sm) = cifyExp (e, sm)
adamc@109 207 in
adamc@109 208 (L'.DVal (x, n, t, e), sm)
adamc@109 209 end
adamc@29 210 in
adamc@109 211 (SOME (d, loc), NONE, sm)
adamc@29 212 end
adamc@129 213 | L.DValRec vis =>
adamc@129 214 let
adamc@129 215 val (vis, sm) = ListUtil.foldlMap
adamc@129 216 (fn ((x, n, t, e, _), sm) =>
adamc@129 217 let
adamc@129 218 val (t, sm) = cifyTyp (t, sm)
adamc@129 219
adamc@129 220 fun unravel (tAll as (t, _), eAll as (e, _)) =
adamc@129 221 case (t, e) of
adamc@129 222 (L'.TFun (dom, ran), L.EAbs (ax, _, _, e)) =>
adamc@129 223 let
adamc@129 224 val (args, t, e) = unravel (ran, e)
adamc@129 225 in
adamc@129 226 ((ax, dom) :: args, t, e)
adamc@129 227 end
adamc@129 228 | (L'.TFun _, _) =>
adamc@129 229 (ErrorMsg.errorAt loc "Function isn't explicit at code generation";
adamc@129 230 ([], tAll, eAll))
adamc@129 231 | _ => ([], tAll, eAll)
adamc@129 232
adamc@129 233 val (args, ran, e) = unravel (t, e)
adamc@129 234 val (e, sm) = cifyExp (e, sm)
adamc@129 235 in
adamc@129 236 ((x, n, args, ran, e), sm)
adamc@129 237 end)
adamc@129 238 sm vis
adamc@129 239 in
adamc@129 240 (SOME (L'.DFunRec vis, loc), NONE, sm)
adamc@129 241 end
adamc@129 242
adamc@144 243 | L.DExport (ek, s, n, ts) =>
adamc@120 244 let
adamc@120 245 val (ts, sm) = ListUtil.foldlMap cifyTyp sm ts
adamc@120 246 in
adamc@144 247 (NONE, SOME (ek, "/" ^ s, n, ts), sm)
adamc@120 248 end
adamc@29 249
adamc@29 250 fun cjrize ds =
adamc@29 251 let
adamc@101 252 val (ds, ps, sm) = foldl (fn (d, (ds, ps, sm)) =>
adamc@101 253 let
adamc@101 254 val (dop, pop, sm) = cifyDecl (d, sm)
adamc@101 255 val ds = case dop of
adamc@101 256 NONE => ds
adamc@101 257 | SOME d => d :: ds
adamc@101 258 val ps = case pop of
adamc@101 259 NONE => ps
adamc@101 260 | SOME p => p :: ps
adamc@101 261 in
adamc@101 262 (ds, ps, sm)
adamc@101 263 end)
adamc@101 264 ([], [], Sm.empty) ds
adamc@29 265 in
adamc@101 266 (List.revAppend (map (fn v => (L'.DStruct v, ErrorMsg.dummySpan)) (Sm.declares sm),
adamc@101 267 rev ds),
adamc@101 268 ps)
adamc@29 269 end
adamc@29 270
adamc@29 271 end