Mercurial > urweb

annotate src/cjrize.sml @ 1604:b1af16cdc659

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
More complete account of URI determination in structure section
author Adam Chlipala <adam@chlipala.net>
date Sun, 20 Nov 2011 19:22:57 -0500
parents 78e0d56b594e
children 0577be31a435
rev   line source
adam@1348 1 (* Copyright (c) 2008-2010, 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@196 33 structure IM = IntBinaryMap
adamc@196 34
adamc@29 35 structure Sm :> sig
adamc@29 36 type t
adamc@29 37
adamc@29 38 val empty : t
adamc@29 39 val find : t * (string * L.typ) list * (string * L'.typ) list -> t * int
adamc@757 40 val findList : t * L.typ * L'.typ -> t * int
adamc@29 41
adamc@29 42 val declares : t -> (int * (string * L'.typ) list) list
adamc@453 43 val clearDeclares : t -> t
adamc@29 44 end = struct
adamc@29 45
adamc@29 46 structure FM = BinaryMapFn(struct
adamc@29 47 type ord_key = L.typ
adamc@109 48 val compare = MonoUtil.Typ.compare
adamc@29 49 end)
adamc@29 50
adamc@757 51 type t = {
adamc@757 52 count : int,
adamc@757 53 normal : int FM.map,
adamc@757 54 lists : int FM.map,
adamc@757 55 decls : (int * (string * L'.typ) list) list
adamc@757 56 }
adamc@29 57
adamc@757 58 val empty : t = {
adamc@757 59 count = 1,
adamc@757 60 normal = FM.insert (FM.empty, (L.TRecord [], ErrorMsg.dummySpan), 0),
adamc@757 61 lists = FM.empty,
adamc@757 62 decls = []
adamc@757 63 }
adamc@29 64
adamc@757 65 fun find (v as {count, normal, decls, lists}, xts, xts') =
adamc@29 66 let
adamc@29 67 val t = (L.TRecord xts, ErrorMsg.dummySpan)
adamc@29 68 in
adamc@757 69 case FM.find (normal, t) of
adamc@757 70 SOME i => (v, i)
adamc@757 71 | NONE => ({count = count+1,
adamc@757 72 normal = FM.insert (normal, t, count),
adamc@757 73 lists = lists,
adamc@757 74 decls = (count, xts') :: decls},
adamc@757 75 count)
adamc@29 76 end
adamc@29 77
adamc@757 78 fun findList (v as {count, normal, decls, lists}, t, t') =
adamc@757 79 case FM.find (lists, t) of
adamc@757 80 SOME i => (v, i)
adamc@757 81 | NONE =>
adamc@757 82 let
adamc@757 83 val xts = [("1", t), ("2", (L.TList t, #2 t))]
adamc@757 84 val xts' = [("1", t'), ("2", (L'.TList (t', count), #2 t'))]
adamc@757 85 in
adamc@757 86 ({count = count+1,
adamc@757 87 normal = FM.insert (normal, (L.TRecord xts, ErrorMsg.dummySpan), count),
adamc@757 88 lists = FM.insert (lists, t, count),
adamc@757 89 decls = (count, xts') :: decls},
adamc@757 90 count)
adamc@757 91 end
adamc@29 92
adamc@757 93 fun declares (v : t) = #decls v
adamc@757 94
adamc@757 95 fun clearDeclares (v : t) = {count = #count v,
adamc@757 96 normal = #normal v,
adamc@757 97 lists = #lists v,
adamc@757 98 decls = []}
adamc@453 99
adamc@29 100 end
adamc@29 101
adamc@196 102 fun cifyTyp x =
adamc@196 103 let
adamc@196 104 fun cify dtmap ((t, loc), sm) =
adamc@196 105 case t of
adamc@196 106 L.TFun (t1, t2) =>
adamc@196 107 let
adamc@196 108 val (t1, sm) = cify dtmap (t1, sm)
adamc@196 109 val (t2, sm) = cify dtmap (t2, sm)
adamc@196 110 in
adamc@196 111 ((L'.TFun (t1, t2), loc), sm)
adamc@196 112 end
adamc@196 113 | L.TRecord xts =>
adamc@196 114 let
adam@1314 115 val xts = MonoUtil.Typ.sortFields xts
adamc@196 116 val old_xts = xts
adamc@196 117 val (xts, sm) = ListUtil.foldlMap (fn ((x, t), sm) =>
adamc@196 118 let
adamc@196 119 val (t, sm) = cify dtmap (t, sm)
adamc@196 120 in
adamc@196 121 ((x, t), sm)
adamc@196 122 end)
adamc@196 123 sm xts
adamc@196 124 val (sm, si) = Sm.find (sm, old_xts, xts)
adamc@196 125 in
adamc@196 126 ((L'.TRecord si, loc), sm)
adamc@196 127 end
adamc@196 128 | L.TDatatype (n, ref (dk, xncs)) =>
adamc@196 129 (case IM.find (dtmap, n) of
adamc@196 130 SOME r => ((L'.TDatatype (dk, n, r), loc), sm)
adamc@196 131 | NONE =>
adamc@196 132 let
adamc@196 133 val r = ref []
adamc@196 134 val dtmap = IM.insert (dtmap, n, r)
adamc@196 135
adamc@196 136 val (xncs, sm) = ListUtil.foldlMap (fn ((x, n, to), sm) =>
adamc@196 137 case to of
adamc@196 138 NONE => ((x, n, NONE), sm)
adamc@196 139 | SOME t =>
adamc@196 140 let
adamc@196 141 val (t, sm) = cify dtmap (t, sm)
adamc@196 142 in
adamc@196 143 ((x, n, SOME t), sm)
adamc@196 144 end)
adamc@196 145 sm xncs
adamc@196 146 in
adamc@196 147 r := xncs;
adamc@196 148 ((L'.TDatatype (dk, n, r), loc), sm)
adamc@196 149 end)
adamc@196 150 | L.TFfi mx => ((L'.TFfi mx, loc), sm)
adamc@288 151 | L.TOption t =>
adamc@288 152 let
adamc@288 153 val (t, sm) = cify dtmap (t, sm)
adamc@288 154 in
adamc@288 155 ((L'.TOption t, loc), sm)
adamc@288 156 end
adamc@757 157 | L.TList t =>
adamc@757 158 let
adamc@757 159 val (t', sm) = cify dtmap (t, sm)
adamc@757 160 val (sm, si) = Sm.findList (sm, t, t')
adamc@757 161 in
adamc@757 162 ((L'.TList (t', si), loc), sm)
adamc@757 163 end
adam@1446 164 | L.TSource => ((L'.TFfi ("Basis", "source"), loc), sm)
adamc@568 165 | L.TSignal _ => raise Fail "Cjrize: TSignal remains"
adamc@196 166 in
adamc@196 167 cify IM.empty x
adamc@196 168 end
adamc@29 169
adamc@109 170 val dummye = (L'.EPrim (Prim.Int 0), ErrorMsg.dummySpan)
adamc@109 171
adamc@186 172 fun cifyPatCon (pc, sm) =
adamc@181 173 case pc of
adamc@186 174 L.PConVar n => (L'.PConVar n, sm)
adamc@186 175 | L.PConFfi {mod = m, datatyp, con, arg} =>
adamc@186 176 let
adamc@186 177 val (arg, sm) =
adamc@186 178 case arg of
adamc@186 179 NONE => (NONE, sm)
adamc@186 180 | SOME t =>
adamc@186 181 let
adamc@186 182 val (t, sm) = cifyTyp (t, sm)
adamc@186 183 in
adamc@186 184 (SOME t, sm)
adamc@186 185 end
adamc@186 186 in
adamc@186 187 (L'.PConFfi {mod = m, datatyp = datatyp, con = con, arg = arg}, sm)
adamc@186 188 end
adamc@181 189
adamc@182 190 fun cifyPat ((p, loc), sm) =
adamc@181 191 case p of
adamc@182 192 L.PWild => ((L'.PWild, loc), sm)
adamc@182 193 | L.PVar (x, t) =>
adamc@182 194 let
adamc@182 195 val (t, sm) = cifyTyp (t, sm)
adamc@182 196 in
adamc@182 197 ((L'.PVar (x, t), loc), sm)
adamc@182 198 end
adamc@182 199 | L.PPrim p => ((L'.PPrim p, loc), sm)
adamc@188 200 | L.PCon (dk, pc, NONE) =>
adamc@186 201 let
adamc@186 202 val (pc, sm) = cifyPatCon (pc, sm)
adamc@186 203 in
adamc@188 204 ((L'.PCon (dk, pc, NONE), loc), sm)
adamc@186 205 end
adamc@188 206 | L.PCon (dk, pc, SOME p) =>
adamc@182 207 let
adamc@186 208 val (pc, sm) = cifyPatCon (pc, sm)
adamc@182 209 val (p, sm) = cifyPat (p, sm)
adamc@182 210 in
adamc@188 211 ((L'.PCon (dk, pc, SOME p), loc), sm)
adamc@182 212 end
adamc@182 213 | L.PRecord xps =>
adamc@182 214 let
adamc@182 215 val (xps, sm) = ListUtil.foldlMap (fn ((x, p, t), sm) =>
adamc@182 216 let
adamc@182 217 val (p, sm) = cifyPat (p, sm)
adamc@182 218 val (t, sm) = cifyTyp (t, sm)
adamc@182 219 in
adamc@182 220 ((x, p, t), sm)
adamc@182 221 end) sm xps
adamc@182 222 in
adamc@182 223 ((L'.PRecord xps, loc), sm)
adamc@182 224 end
adamc@288 225 | L.PNone t =>
adamc@288 226 let
adamc@288 227 val (t, sm) = cifyTyp (t, sm)
adamc@288 228 in
adamc@288 229 ((L'.PNone t, loc), sm)
adamc@288 230 end
adamc@288 231 | L.PSome (t, p) =>
adamc@288 232 let
adamc@288 233 val (t, sm) = cifyTyp (t, sm)
adamc@288 234 val (p, sm) = cifyPat (p, sm)
adamc@288 235 in
adamc@288 236 ((L'.PSome (t, p), loc), sm)
adamc@288 237 end
adamc@288 238
adamc@280 239 fun cifyExp (eAll as (e, loc), sm) =
adam@1601 240 let
adam@1601 241 fun fail msg =
adam@1601 242 (ErrorMsg.errorAt loc msg;
adam@1601 243 ((L'.EPrim (Prim.String ""), loc), sm))
adam@1601 244 in
adam@1601 245 case e of
adam@1601 246 L.EPrim p => ((L'.EPrim p, loc), sm)
adam@1601 247 | L.ERel n => ((L'.ERel n, loc), sm)
adam@1601 248 | L.ENamed n => ((L'.ENamed n, loc), sm)
adam@1601 249 | L.ECon (dk, pc, eo) =>
adam@1601 250 let
adam@1601 251 val (eo, sm) =
adam@1601 252 case eo of
adam@1601 253 NONE => (NONE, sm)
adam@1601 254 | SOME e =>
adam@1601 255 let
adam@1601 256 val (e, sm) = cifyExp (e, sm)
adam@1601 257 in
adam@1601 258 (SOME e, sm)
adam@1601 259 end
adam@1601 260 val (pc, sm) = cifyPatCon (pc, sm)
adam@1601 261 in
adam@1601 262 ((L'.ECon (dk, pc, eo), loc), sm)
adam@1601 263 end
adam@1601 264 | L.ENone t =>
adam@1601 265 let
adam@1601 266 val (t, sm) = cifyTyp (t, sm)
adam@1601 267 in
adam@1601 268 ((L'.ENone t, loc), sm)
adam@1601 269 end
adam@1601 270 | L.ESome (t, e) =>
adam@1601 271 let
adam@1601 272 val (t, sm) = cifyTyp (t, sm)
adam@1601 273 val (e, sm) = cifyExp (e, sm)
adam@1601 274 in
adam@1601 275 ((L'.ESome (t, e), loc), sm)
adam@1601 276 end
adam@1601 277 | L.EFfi mx => ((L'.EFfi mx, loc), sm)
adam@1601 278 | L.EFfiApp (m, x, es) =>
adam@1601 279 let
adam@1601 280 val (es, sm) = ListUtil.foldlMap cifyExp sm es
adam@1601 281 in
adam@1601 282 ((L'.EFfiApp (m, x, es), loc), sm)
adam@1601 283 end
adam@1601 284 | L.EApp (e1, e2) =>
adam@1601 285 let
adam@1601 286 fun unravel (e, args) =
adam@1601 287 case e of
adam@1601 288 (L.EApp (e1, e2), _) => unravel (e1, e2 :: args)
adam@1601 289 | _ => (e, args)
adamc@316 290
adam@1601 291 val (f, es) = unravel (e1, [e2])
adamc@316 292
adam@1601 293 val (f, sm) = cifyExp (f, sm)
adam@1601 294 val (es, sm) = ListUtil.foldlMap cifyExp sm es
adam@1601 295 in
adam@1601 296 ((L'.EApp (f, es), loc), sm)
adam@1601 297 end
adam@1601 298 | L.EAbs _ => (ErrorMsg.errorAt loc "Anonymous function remains at code generation";
adam@1601 299 Print.prefaces' [("Function", MonoPrint.p_exp MonoEnv.empty eAll)];
adam@1601 300 (dummye, sm))
adamc@29 301
adam@1601 302 | L.EUnop (s, e1) =>
adam@1601 303 let
adam@1601 304 val (e1, sm) = cifyExp (e1, sm)
adam@1601 305 in
adam@1601 306 ((L'.EUnop (s, e1), loc), sm)
adam@1601 307 end
adam@1601 308 | L.EBinop (_, s, e1, e2) =>
adam@1601 309 let
adam@1601 310 val (e1, sm) = cifyExp (e1, sm)
adam@1601 311 val (e2, sm) = cifyExp (e2, sm)
adam@1601 312 in
adam@1601 313 ((L'.EBinop (s, e1, e2), loc), sm)
adam@1601 314 end
adamc@387 315
adam@1601 316 | L.ERecord xes =>
adam@1601 317 let
adam@1601 318 val old_xts = map (fn (x, _, t) => (x, t)) xes
adamc@29 319
adam@1601 320 val (xets, sm) = ListUtil.foldlMap (fn ((x, e, t), sm) =>
adam@1601 321 let
adam@1601 322 val (e, sm) = cifyExp (e, sm)
adam@1601 323 val (t, sm) = cifyTyp (t, sm)
adam@1601 324 in
adam@1601 325 ((x, e, t), sm)
adam@1601 326 end)
adam@1601 327 sm xes
adamc@29 328
adam@1601 329 val (sm, si) = Sm.find (sm, old_xts, map (fn (x, _, t) => (x, t)) xets)
adamc@29 330
adam@1601 331 val xes = map (fn (x, e, _) => (x, e)) xets
adam@1601 332 val xes = ListMergeSort.sort (fn ((x1, _), (x2, _)) => String.compare (x1, x2) = GREATER) xes
adam@1601 333 in
adam@1601 334 ((L'.ERecord (si, xes), loc), sm)
adam@1601 335 end
adam@1601 336 | L.EField (e, x) =>
adam@1601 337 let
adam@1601 338 val (e, sm) = cifyExp (e, sm)
adam@1601 339 in
adam@1601 340 ((L'.EField (e, x), loc), sm)
adam@1601 341 end
adamc@29 342
adam@1601 343 | L.ECase (e, pes, {disc, result}) =>
adam@1601 344 let
adamc@181 345 val (e, sm) = cifyExp (e, sm)
adamc@181 346 val (pes, sm) = ListUtil.foldlMap
adamc@181 347 (fn ((p, e), sm) =>
adamc@181 348 let
adamc@181 349 val (e, sm) = cifyExp (e, sm)
adamc@182 350 val (p, sm) = cifyPat (p, sm)
adamc@181 351 in
adamc@182 352 ((p, e), sm)
adamc@181 353 end) sm pes
adamc@182 354 val (disc, sm) = cifyTyp (disc, sm)
adamc@182 355 val (result, sm) = cifyTyp (result, sm)
adamc@181 356 in
adamc@182 357 ((L'.ECase (e, pes, {disc = disc, result = result}), loc), sm)
adamc@181 358 end
adamc@178 359
adam@1601 360 | L.EError (e, t) =>
adam@1601 361 let
adam@1601 362 val (e, sm) = cifyExp (e, sm)
adam@1601 363 val (t, sm) = cifyTyp (t, sm)
adam@1601 364 in
adam@1601 365 ((L'.EError (e, t), loc), sm)
adam@1601 366 end
adam@1601 367 | L.EReturnBlob {blob, mimeType, t} =>
adam@1601 368 let
adam@1601 369 val (blob, sm) = cifyExp (blob, sm)
adam@1601 370 val (mimeType, sm) = cifyExp (mimeType, sm)
adam@1601 371 val (t, sm) = cifyTyp (t, sm)
adam@1601 372 in
adam@1601 373 ((L'.EReturnBlob {blob = blob, mimeType = mimeType, t = t}, loc), sm)
adam@1601 374 end
adam@1601 375 | L.ERedirect (e, t) =>
adam@1601 376 let
adam@1601 377 val (e, sm) = cifyExp (e, sm)
adam@1601 378 val (t, sm) = cifyTyp (t, sm)
adam@1601 379 in
adam@1601 380 ((L'.ERedirect (e, t), loc), sm)
adam@1601 381 end
adamc@283 382
adam@1601 383 | L.EStrcat (e1, e2) =>
adam@1601 384 let
adam@1601 385 val (e1, sm) = cifyExp (e1, sm)
adam@1601 386 val (e2, sm) = cifyExp (e2, sm)
adam@1601 387 in
adam@1601 388 ((L'.EFfiApp ("Basis", "strcat", [e1, e2]), loc), sm)
adam@1601 389 end
adamc@102 390
adam@1601 391 | L.EWrite e =>
adam@1601 392 let
adam@1601 393 val (e, sm) = cifyExp (e, sm)
adam@1601 394 in
adam@1601 395 ((L'.EWrite e, loc), sm)
adam@1601 396 end
adamc@102 397
adam@1601 398 | L.ESeq (e1, e2) =>
adam@1601 399 let
adam@1601 400 val (e1, sm) = cifyExp (e1, sm)
adam@1601 401 val (e2, sm) = cifyExp (e2, sm)
adam@1601 402 in
adam@1601 403 ((L'.ESeq (e1, e2), loc), sm)
adam@1601 404 end
adamc@106 405
adam@1601 406 | L.ELet (x, t, e1, e2) =>
adam@1601 407 let
adam@1601 408 val (t, sm) = cifyTyp (t, sm)
adam@1601 409 val (e1, sm) = cifyExp (e1, sm)
adam@1601 410 val (e2, sm) = cifyExp (e2, sm)
adam@1601 411 in
adam@1601 412 ((L'.ELet (x, t, e1, e2), loc), sm)
adam@1601 413 end
adamc@251 414
adam@1601 415 | L.EClosure _ => (ErrorMsg.errorAt loc "Nested closure remains in code generation";
adam@1601 416 (dummye, sm))
adamc@111 417
adam@1601 418 | L.EQuery {exps, tables, state, query, body, initial} =>
adam@1601 419 let
adam@1601 420 val (exps', sm) = ListUtil.foldlMap (fn ((x, t), sm) =>
adam@1601 421 let
adam@1601 422 val (t, sm) = cifyTyp (t, sm)
adam@1601 423 in
adam@1601 424 ((x, t), sm)
adam@1601 425 end) sm exps
adam@1601 426 val (tables', sm) = ListUtil.foldlMap (fn ((x, xts), sm) =>
adam@1601 427 let
adam@1601 428 val (xts, sm) = ListUtil.foldlMap
adam@1601 429 (fn ((x, t), sm) =>
adam@1601 430 let
adam@1601 431 val (t, sm) = cifyTyp (t, sm)
adam@1601 432 in
adam@1601 433 ((x, t), sm)
adam@1601 434 end) sm xts
adam@1601 435 in
adam@1601 436 ((x, xts), sm)
adam@1601 437 end) sm tables
adamc@269 438
adam@1601 439 val row = exps @ map (fn (x, xts) => (x, (L.TRecord xts, loc))) tables
adam@1601 440 val row = ListMergeSort.sort (fn ((x, _), (y, _)) => String.compare (x, y) = GREATER) row
adamc@269 441
adam@1601 442 val (tableRows, sm) = ListUtil.foldlMap (fn (((x, xts), (_, xts')), sm) =>
adam@1601 443 let
adam@1601 444 val (sm, rnum) = Sm.find (sm, xts, xts')
adam@1601 445 in
adam@1601 446 ((x, rnum), sm)
adam@1601 447 end)
adam@1601 448 sm (ListPair.zip (tables, tables'))
adam@1601 449 val row' = exps' @ map (fn (x, n) => (x, (L'.TRecord n, loc))) tableRows
adam@1601 450 val row' = ListMergeSort.sort (fn ((x, _), (y, _)) => String.compare (x, y) = GREATER) row'
adamc@269 451
adam@1601 452 val (sm, rnum) = Sm.find (sm, row, row')
adamc@269 453
adam@1601 454 val (state, sm) = cifyTyp (state, sm)
adam@1601 455 val (query, sm) = cifyExp (query, sm)
adam@1601 456 val (body, sm) = cifyExp (body, sm)
adam@1601 457 val (initial, sm) = cifyExp (initial, sm)
adam@1601 458 in
adam@1601 459 ((L'.EQuery {exps = exps', tables = tables', rnum = rnum, state = state,
adam@1601 460 query = query, body = body, initial = initial, prepared = NONE}, loc), sm)
adam@1601 461 end
adamc@269 462
adam@1601 463 | L.EDml (e, mode) =>
adam@1601 464 let
adam@1601 465 val (e, sm) = cifyExp (e, sm)
adam@1601 466 in
adam@1601 467 ((L'.EDml {dml = e, prepared = NONE, mode = mode}, loc), sm)
adam@1601 468 end
adamc@307 469
adam@1601 470 | L.ENextval e =>
adam@1601 471 let
adam@1601 472 val (e, sm) = cifyExp (e, sm)
adam@1601 473 in
adam@1601 474 ((L'.ENextval {seq = e, prepared = NONE}, loc), sm)
adam@1601 475 end
adam@1601 476 | L.ESetval (e1, e2) =>
adam@1601 477 let
adam@1601 478 val (e1, sm) = cifyExp (e1, sm)
adam@1601 479 val (e2, sm) = cifyExp (e2, sm)
adam@1601 480 in
adam@1601 481 ((L'.ESetval {seq = e1, count = e2}, loc), sm)
adam@1601 482 end
adamc@338 483
adam@1601 484 | L.EUnurlify (e, t, b) =>
adam@1601 485 let
adam@1601 486 val (e, sm) = cifyExp (e, sm)
adam@1601 487 val (t, sm) = cifyTyp (t, sm)
adam@1601 488 in
adam@1601 489 ((L'.EUnurlify (e, t, b), loc), sm)
adam@1601 490 end
adamc@252 491
adam@1601 492 | L.EJavaScript _ => fail "Uncompilable JavaScript remains"
adamc@578 493
adam@1601 494 | L.ESignalReturn _ => fail "Signal monad 'return' remains in server-side code"
adam@1601 495 | L.ESignalBind _ => fail "Signal monad 'bind' remains in server-side code"
adam@1601 496 | L.ESignalSource _ => fail "Signal monad 'source' remains in server-side code"
adamc@566 497
adam@1601 498 | L.EServerCall _ => fail "RPC in server-side code"
adam@1601 499 | L.ERecv _ => fail "Message receive in server-side code"
adam@1601 500 | L.ESleep _ => fail "Sleep in server-side code"
adam@1601 501 | L.ESpawn _ => fail "Thread spawn in server-side code"
adam@1601 502 end
adamc@608 503
adamc@29 504 fun cifyDecl ((d, loc), sm) =
adamc@29 505 case d of
adamc@809 506 L.DDatatype dts =>
adamc@165 507 let
adamc@809 508 val (dts, sm) = ListUtil.foldlMap
adamc@809 509 (fn ((x, n, xncs), sm) =>
adamc@809 510 let
adamc@809 511 val dk = ElabUtil.classifyDatatype xncs
adamc@809 512 val (xncs, sm) = ListUtil.foldlMap (fn ((x, n, to), sm) =>
adamc@809 513 case to of
adamc@809 514 NONE => ((x, n, NONE), sm)
adamc@809 515 | SOME t =>
adamc@809 516 let
adamc@809 517 val (t, sm) = cifyTyp (t, sm)
adamc@809 518 in
adamc@809 519 ((x, n, SOME t), sm)
adamc@809 520 end) sm xncs
adamc@809 521 in
adamc@809 522 ((dk, x, n, xncs), sm)
adamc@809 523 end)
adamc@809 524 sm dts
adamc@165 525 in
adamc@809 526 (SOME (L'.DDatatype dts, loc), NONE, sm)
adamc@809 527 end
adamc@164 528
adamc@164 529 | L.DVal (x, n, t, e, _) =>
adamc@29 530 let
adamc@29 531 val (t, sm) = cifyTyp (t, sm)
adamc@109 532
adamc@109 533 val (d, sm) = case #1 t of
adamc@121 534 L'.TFun _ =>
adamc@121 535 let
adamc@121 536 fun unravel (tAll as (t, _), eAll as (e, _)) =
adamc@121 537 case (t, e) of
adamc@121 538 (L'.TFun (dom, ran), L.EAbs (ax, _, _, e)) =>
adamc@121 539 let
adamc@121 540 val (args, t, e) = unravel (ran, e)
adamc@121 541 in
adamc@121 542 ((ax, dom) :: args, t, e)
adamc@121 543 end
adamc@993 544 | (L'.TFun (dom, ran), _) =>
adamc@993 545 let
adamc@993 546 val e = MonoEnv.liftExpInExp 0 eAll
adamc@993 547 val e = (L.EApp (e, (L.ERel 0, loc)), loc)
adamc@993 548 val (args, t, e) = unravel (ran, e)
adamc@993 549 in
adamc@993 550 (("x", dom) :: args, t, e)
adamc@993 551 end
adamc@121 552 | _ => ([], tAll, eAll)
adamc@121 553
adamc@121 554 val (args, ran, e) = unravel (t, e)
adamc@121 555 val (e, sm) = cifyExp (e, sm)
adamc@121 556 in
adamc@121 557 (L'.DFun (x, n, args, ran, e), sm)
adamc@121 558 end
adamc@121 559
adamc@109 560 | _ =>
adamc@109 561 let
adamc@109 562 val (e, sm) = cifyExp (e, sm)
adamc@109 563 in
adamc@109 564 (L'.DVal (x, n, t, e), sm)
adamc@109 565 end
adamc@29 566 in
adamc@109 567 (SOME (d, loc), NONE, sm)
adamc@29 568 end
adamc@129 569 | L.DValRec vis =>
adamc@129 570 let
adamc@129 571 val (vis, sm) = ListUtil.foldlMap
adamc@129 572 (fn ((x, n, t, e, _), sm) =>
adamc@129 573 let
adamc@129 574 val (t, sm) = cifyTyp (t, sm)
adamc@129 575
adamc@129 576 fun unravel (tAll as (t, _), eAll as (e, _)) =
adamc@129 577 case (t, e) of
adamc@129 578 (L'.TFun (dom, ran), L.EAbs (ax, _, _, e)) =>
adamc@129 579 let
adamc@129 580 val (args, t, e) = unravel (ran, e)
adamc@129 581 in
adamc@129 582 ((ax, dom) :: args, t, e)
adamc@129 583 end
adamc@129 584 | (L'.TFun _, _) =>
adamc@129 585 (ErrorMsg.errorAt loc "Function isn't explicit at code generation";
adamc@129 586 ([], tAll, eAll))
adamc@129 587 | _ => ([], tAll, eAll)
adamc@129 588
adamc@129 589 val (args, ran, e) = unravel (t, e)
adamc@129 590 val (e, sm) = cifyExp (e, sm)
adamc@129 591 in
adamc@129 592 ((x, n, args, ran, e), sm)
adamc@129 593 end)
adamc@129 594 sm vis
adamc@129 595 in
adamc@129 596 (SOME (L'.DFunRec vis, loc), NONE, sm)
adamc@129 597 end
adamc@129 598
adamc@1104 599 | L.DExport (ek, s, n, ts, t, b) =>
adamc@120 600 let
adamc@120 601 val (ts, sm) = ListUtil.foldlMap cifyTyp sm ts
adamc@609 602 val (t, sm) = cifyTyp (t, sm)
adamc@120 603 in
adamc@1104 604 (NONE, SOME (ek, "/" ^ s, n, ts, t, L'.ServerAndPullAndPush, b), sm)
adamc@120 605 end
adamc@29 606
adamc@707 607 | L.DTable (s, xts, pe, ce) =>
adamc@273 608 let
adamc@273 609 val (xts, sm) = ListUtil.foldlMap (fn ((x, t), sm) =>
adamc@273 610 let
adamc@273 611 val (t, sm) = cifyTyp (t, sm)
adamc@273 612 in
adamc@273 613 ((x, t), sm)
adamc@273 614 end) sm xts
adamc@704 615
adamc@704 616 fun flatten e =
adamc@704 617 case #1 e of
adamc@704 618 L.ERecord [] => []
adamc@704 619 | L.ERecord [(x, (L.EPrim (Prim.String v), _), _)] => [(x, v)]
adamc@704 620 | L.EStrcat (e1, e2) => flatten e1 @ flatten e2
adamc@704 621 | _ => (ErrorMsg.errorAt loc "Constraint has not been fully determined";
adamc@704 622 Print.prefaces "Undetermined constraint"
adamc@707 623 [("e", MonoPrint.p_exp MonoEnv.empty e)];
adamc@704 624 [])
adamc@707 625
adamc@707 626 val pe = case #1 pe of
adamc@707 627 L.EPrim (Prim.String s) => s
adamc@707 628 | _ => (ErrorMsg.errorAt loc "Primary key has not been fully determined";
adamc@707 629 Print.prefaces "Undetermined constraint"
adamc@707 630 [("e", MonoPrint.p_exp MonoEnv.empty pe)];
adamc@707 631 "")
adamc@273 632 in
adamc@707 633 (SOME (L'.DTable (s, xts, pe, flatten ce), loc), NONE, sm)
adamc@273 634 end
adamc@338 635 | L.DSequence s =>
adamc@338 636 (SOME (L'.DSequence s, loc), NONE, sm)
adamc@754 637 | L.DView (s, xts, e) =>
adamc@754 638 let
adamc@754 639 val (xts, sm) = ListUtil.foldlMap (fn ((x, t), sm) =>
adamc@754 640 let
adamc@754 641 val (t, sm) = cifyTyp (t, sm)
adamc@754 642 in
adamc@754 643 ((x, t), sm)
adamc@754 644 end) sm xts
adamc@754 645
adamc@754 646 fun flatten e =
adamc@754 647 case #1 e of
adamc@754 648 L.ERecord [] => []
adamc@754 649 | L.ERecord [(x, (L.EPrim (Prim.String v), _), _)] => [(x, v)]
adamc@754 650 | L.EStrcat (e1, e2) => flatten e1 @ flatten e2
adamc@754 651 | _ => (ErrorMsg.errorAt loc "Constraint has not been fully determined";
adamc@754 652 Print.prefaces "Undetermined constraint"
adamc@754 653 [("e", MonoPrint.p_exp MonoEnv.empty e)];
adamc@754 654 [])
adamc@754 655
adamc@754 656 val e = case #1 e of
adamc@754 657 L.EPrim (Prim.String s) => s
adamc@754 658 | _ => (ErrorMsg.errorAt loc "VIEW query has not been fully determined";
adamc@754 659 Print.prefaces "Undetermined VIEW query"
adamc@754 660 [("e", MonoPrint.p_exp MonoEnv.empty e)];
adamc@754 661 "")
adamc@754 662 in
adamc@754 663 (SOME (L'.DView (s, xts, e), loc), NONE, sm)
adamc@754 664 end
adamc@271 665 | L.DDatabase s => (SOME (L'.DDatabase s, loc), NONE, sm)
adamc@569 666 | L.DJavaScript s => (SOME (L'.DJavaScript s, loc), NONE, sm)
adamc@725 667 | L.DCookie args => (SOME (L'.DCookie args, loc), NONE, sm)
adamc@718 668 | L.DStyle args => (SOME (L'.DStyle args, loc), NONE, sm)
adamc@1075 669 | L.DTask (e1, e2) =>
adamc@1075 670 (case #1 e2 of
adam@1348 671 L.EAbs (x1, _, _, (L.EAbs (x2, _, _, e), _)) =>
adamc@1073 672 let
adamc@1075 673 val tk = case #1 e1 of
adamc@1075 674 L.EFfi ("Basis", "initialize") => L'.Initialize
adam@1348 675 | L.EFfi ("Basis", "clientLeaves") => L'.ClientLeaves
adam@1349 676 | L.EFfiApp ("Basis", "periodic", [(L.EPrim (Prim.Int n), _)]) => L'.Periodic n
adamc@1075 677 | _ => (ErrorMsg.errorAt loc "Task kind not fully determined";
adamc@1075 678 L'.Initialize)
adamc@1073 679 val (e, sm) = cifyExp (e, sm)
adamc@1073 680 in
adam@1348 681 (SOME (L'.DTask (tk, x1, x2, e), loc), NONE, sm)
adamc@1073 682 end
adamc@1073 683 | _ => (ErrorMsg.errorAt loc "Initializer has not been fully determined";
adamc@1073 684 (NONE, NONE, sm)))
adamc@1199 685 | L.DPolicy _ => (NONE, NONE, sm)
adam@1294 686 | L.DOnError n => (SOME (L'.DOnError n, loc), NONE, sm)
adamc@271 687
adamc@29 688 fun cjrize ds =
adamc@29 689 let
adamc@196 690 val (dsF, ds, ps, sm) = foldl (fn (d, (dsF, ds, ps, sm)) =>
adamc@196 691 let
adamc@196 692 val (dop, pop, sm) = cifyDecl (d, sm)
adamc@453 693
adamc@640 694 val dsF = case dop of
adamc@809 695 SOME (L'.DDatatype dts, loc) =>
adamc@809 696 map (fn (dk, x, n, _) =>
adamc@809 697 (L'.DDatatypeForward (dk, x, n), loc)) dts @ dsF
adamc@640 698 | _ => dsF
adamc@640 699
adamc@640 700 val dsF = map (fn v => (L'.DStruct v, ErrorMsg.dummySpan)) (Sm.declares sm)
adamc@640 701 @ dsF
adamc@640 702
adamc@196 703 val (dsF, ds) = case dop of
adamc@196 704 NONE => (dsF, ds)
adamc@453 705 | SOME (d as (L'.DDatatype _, loc)) =>
adamc@453 706 (d :: dsF, ds)
adamc@196 707 | SOME d => (dsF, d :: ds)
adamc@453 708
adamc@196 709 val ps = case pop of
adamc@196 710 NONE => ps
adamc@196 711 | SOME p => p :: ps
adamc@196 712 in
adamc@453 713 (dsF, ds, ps, Sm.clearDeclares sm)
adamc@196 714 end)
adamc@196 715 ([], [], [], Sm.empty) ds
adamc@29 716 in
adamc@453 717 (List.revAppend (dsF, rev ds),
adamc@101 718 ps)
adamc@29 719 end
adamc@29 720
adamc@29 721 end