Mercurial > urweb

annotate src/tag.sml @ 140:f214c535d253

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
A simpler context encoding
author Adam Chlipala <adamc@hcoop.net>
date Sun, 20 Jul 2008 10:40:25 -0400
parents 76a4d69719d8
children 4b9c2bd6157c
rev   line source
adamc@110 1 (* Copyright (c) 2008, Adam Chlipala
adamc@110 2 * All rights reserved.
adamc@110 3 *
adamc@110 4 * Redistribution and use in source and binary forms, with or without
adamc@110 5 * modification, are permitted provided that the following conditions are met:
adamc@110 6 *
adamc@110 7 * - Redistributions of source code must retain the above copyright notice,
adamc@110 8 * this list of conditions and the following disclaimer.
adamc@110 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@110 10 * this list of conditions and the following disclaimer in the documentation
adamc@110 11 * and/or other materials provided with the distribution.
adamc@110 12 * - The names of contributors may not be used to endorse or promote products
adamc@110 13 * derived from this software without specific prior written permission.
adamc@110 14 *
adamc@110 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@110 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@110 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@110 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@110 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@110 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@110 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@110 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@110 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@110 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@110 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@110 26 *)
adamc@110 27
adamc@110 28 structure Tag :> TAG = struct
adamc@110 29
adamc@110 30 open Core
adamc@110 31
adamc@110 32 structure U = CoreUtil
adamc@110 33 structure E = CoreEnv
adamc@110 34
adamc@110 35 structure IM = IntBinaryMap
adamc@112 36 structure SM = BinaryMapFn(struct
adamc@112 37 type ord_key = string
adamc@112 38 val compare = String.compare
adamc@112 39 end)
adamc@110 40
adamc@110 41 fun kind (k, s) = (k, s)
adamc@110 42 fun con (c, s) = (c, s)
adamc@110 43
adamc@112 44 fun exp env (e, s) =
adamc@110 45 case e of
adamc@110 46 EApp (
adamc@110 47 (EApp (
adamc@110 48 (EApp (
adamc@110 49 (ECApp (
adamc@110 50 (ECApp (
adamc@110 51 (ECApp (
adamc@110 52 (ECApp (
adamc@140 53 (ECApp (
adamc@140 54 (ECApp (
adamc@140 55 (ECApp (
adamc@140 56 (ECApp (
adamc@140 57 (EFfi ("Basis", "tag"),
adamc@140 58 loc), given), _), absent), _), outer), _), inner), _),
adamc@140 59 useOuter), _), useInner), _), bindOuter), _), bindInner), _),
adamc@110 60 attrs), _),
adamc@110 61 tag), _),
adamc@110 62 xml) =>
adamc@110 63 (case attrs of
adamc@110 64 (ERecord xets, _) =>
adamc@110 65 let
adamc@110 66 val (xets, s) =
adamc@112 67 ListUtil.foldlMap (fn ((x, e, t), (count, tags, byTag, newTags)) =>
adamc@110 68 case x of
adamc@110 69 (CName "Link", _) =>
adamc@110 70 let
adamc@110 71 fun unravel (e, _) =
adamc@110 72 case e of
adamc@110 73 ENamed n => (n, [])
adamc@110 74 | EApp (e1, e2) =>
adamc@110 75 let
adamc@110 76 val (n, es) = unravel e1
adamc@110 77 in
adamc@110 78 (n, es @ [e2])
adamc@110 79 end
adamc@110 80 | _ => (ErrorMsg.errorAt loc "Invalid link expression";
adamc@110 81 (0, []))
adamc@110 82
adamc@110 83 val (f, args) = unravel e
adamc@110 84
adamc@110 85 val (cn, count, tags, newTags) =
adamc@110 86 case IM.find (tags, f) of
adamc@110 87 NONE =>
adamc@110 88 (count, count + 1, IM.insert (tags, f, count),
adamc@110 89 (f, count) :: newTags)
adamc@110 90 | SOME cn => (cn, count, tags, newTags)
adamc@110 91
adamc@112 92 val (_, _, _, s) = E.lookupENamed env f
adamc@112 93
adamc@112 94 val byTag = case SM.find (byTag, s) of
adamc@112 95 NONE => SM.insert (byTag, s, f)
adamc@112 96 | SOME f' =>
adamc@112 97 (if f = f' then
adamc@112 98 ()
adamc@112 99 else
adamc@112 100 ErrorMsg.errorAt loc
adamc@112 101 ("Duplicate HTTP tag "
adamc@112 102 ^ s);
adamc@112 103 byTag)
adamc@112 104
adamc@110 105 val e = (EClosure (cn, args), loc)
adamc@110 106 val t = (CFfi ("Basis", "string"), loc)
adamc@110 107 in
adamc@117 108 (((CName "href", loc), e, t),
adamc@112 109 (count, tags, byTag, newTags))
adamc@110 110 end
adamc@112 111 | _ => ((x, e, t), (count, tags, byTag, newTags)))
adamc@110 112 s xets
adamc@110 113 in
adamc@110 114 (EApp (
adamc@110 115 (EApp (
adamc@110 116 (EApp (
adamc@110 117 (ECApp (
adamc@110 118 (ECApp (
adamc@110 119 (ECApp (
adamc@110 120 (ECApp (
adamc@140 121 (ECApp (
adamc@140 122 (ECApp (
adamc@140 123 (ECApp (
adamc@140 124 (ECApp (
adamc@140 125 (EFfi ("Basis", "tag"),
adamc@140 126 loc), given), loc), absent), loc), outer), loc), inner), loc),
adamc@140 127 useOuter), loc), useInner), loc), bindOuter), loc), bindInner), loc),
adamc@110 128 (ERecord xets, loc)), loc),
adamc@110 129 tag), loc),
adamc@110 130 xml), s)
adamc@110 131 end
adamc@110 132 | _ => (ErrorMsg.errorAt loc "Attribute record is too complex";
adamc@110 133 (e, s)))
adamc@110 134
adamc@110 135 | _ => (e, s)
adamc@110 136
adamc@110 137 fun decl (d, s) = (d, s)
adamc@110 138
adamc@110 139 fun tag file =
adamc@110 140 let
adamc@110 141 val count = foldl (fn ((d, _), count) =>
adamc@110 142 case d of
adamc@110 143 DCon (_, n, _, _) => Int.max (n, count)
adamc@110 144 | DVal (_, n, _, _, _) => Int.max (n, count)
adamc@125 145 | DValRec vis => foldl (fn ((_, n, _, _, _), count) => Int.max (n, count)) count vis
adamc@110 146 | DExport _ => count) 0 file
adamc@110 147
adamc@112 148 fun doDecl (d as (d', loc), (env, count, tags, byTag)) =
adamc@112 149 case d' of
adamc@112 150 DExport n =>
adamc@112 151 let
adamc@112 152 val (_, _, _, s) = E.lookupENamed env n
adamc@112 153 in
adamc@112 154 case SM.find (byTag, s) of
adamc@112 155 NONE => ([d], (env, count, tags, byTag))
adamc@112 156 | SOME n' => ([], (env, count, tags, byTag))
adamc@112 157 end
adamc@112 158 | _ =>
adamc@112 159 let
adamc@126 160 val env' = E.declBinds env d
adamc@126 161 val env'' = case d' of
adamc@126 162 DValRec _ => env'
adamc@126 163 | _ => env
adamc@126 164
adamc@112 165 val (d, (count, tags, byTag, newTags)) =
adamc@112 166 U.Decl.foldMap {kind = kind,
adamc@112 167 con = con,
adamc@126 168 exp = exp env'',
adamc@112 169 decl = decl}
adamc@112 170 (count, tags, byTag, []) d
adamc@110 171
adamc@126 172 val env = env'
adamc@110 173
adamc@126 174 val newDs = map
adamc@112 175 (fn (f, cn) =>
adamc@112 176 let
adamc@112 177 fun unravel (all as (t, _)) =
adamc@112 178 case t of
adamc@112 179 TFun (dom, ran) =>
adamc@112 180 let
adamc@112 181 val (args, result) = unravel ran
adamc@112 182 in
adamc@112 183 (dom :: args, result)
adamc@112 184 end
adamc@112 185 | _ => ([], all)
adamc@110 186
adamc@112 187 val (fnam, t, _, tag) = E.lookupENamed env f
adamc@112 188 val (args, result) = unravel t
adamc@110 189
adamc@112 190 val unit = (TRecord (CRecord ((KType, loc), []), loc), loc)
adamc@119 191
adamc@119 192 val (abs, t) =
adamc@119 193 case args of
adamc@119 194 [] =>
adamc@119 195 let
adamc@119 196 val body = (EWrite (ENamed f, loc), loc)
adamc@119 197 in
adamc@119 198 ((EAbs ("x", unit, unit, body), loc),
adamc@119 199 (TFun (unit, unit), loc))
adamc@119 200 end
adamc@119 201 | _ =>
adamc@119 202 let
adamc@119 203 val (app, _) = foldl (fn (t, (app, n)) =>
adamc@119 204 ((EApp (app, (ERel n, loc)), loc),
adamc@119 205 n - 1))
adamc@119 206 ((ENamed f, loc), length args - 1) args
adamc@119 207 val body = (EWrite app, loc)
adamc@119 208 val (abs, _, t) = foldr (fn (t, (abs, n, rest)) =>
adamc@119 209 ((EAbs ("x" ^ Int.toString n,
adamc@119 210 t,
adamc@119 211 rest,
adamc@119 212 abs), loc),
adamc@119 213 n + 1,
adamc@119 214 (TFun (t, rest), loc)))
adamc@119 215 (body, 0, unit) args
adamc@119 216 in
adamc@119 217 (abs, t)
adamc@119 218 end
adamc@112 219 in
adamc@126 220 (("wrap_" ^ fnam, cn, t, abs, tag),
adamc@126 221 (DExport cn, loc))
adamc@112 222 end) newTags
adamc@126 223
adamc@126 224 val (newVals, newExports) = ListPair.unzip newDs
adamc@126 225
adamc@126 226 val ds = case d of
adamc@126 227 (DValRec vis, _) => [(DValRec (vis @ newVals), loc)]
adamc@126 228 | _ => map (fn vi => (DVal vi, loc)) newVals @ [d]
adamc@112 229 in
adamc@126 230 (ds @ newExports, (env, count, tags, byTag))
adamc@112 231 end
adamc@110 232
adamc@112 233 val (file, _) = ListUtil.foldlMapConcat doDecl (CoreEnv.empty, count+1, IM.empty, SM.empty) file
adamc@110 234 in
adamc@110 235 file
adamc@110 236 end
adamc@110 237
adamc@110 238 end