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@721
|
49 (EApp (
|
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@721
|
57 (ECApp (
|
adamc@721
|
58 (EFfi ("Basis", "tag"),
|
adamc@721
|
59 loc), given), _), absent), _), outer), _), inner), _),
|
adamc@721
|
60 useOuter), _), useInner), _), bindOuter), _), bindInner), _),
|
adamc@721
|
61 class), _),
|
adamc@110
|
62 attrs), _),
|
adamc@110
|
63 tag), _),
|
adamc@110
|
64 xml) =>
|
adamc@110
|
65 (case attrs of
|
adamc@110
|
66 (ERecord xets, _) =>
|
adamc@110
|
67 let
|
adamc@110
|
68 val (xets, s) =
|
adamc@112
|
69 ListUtil.foldlMap (fn ((x, e, t), (count, tags, byTag, newTags)) =>
|
adamc@143
|
70 let
|
adamc@144
|
71 fun tagIt (ek, newAttr) =
|
adamc@143
|
72 let
|
adamc@143
|
73 fun unravel (e, _) =
|
adamc@143
|
74 case e of
|
adamc@143
|
75 ENamed n => (n, [])
|
adamc@143
|
76 | EApp (e1, e2) =>
|
adamc@143
|
77 let
|
adamc@143
|
78 val (n, es) = unravel e1
|
adamc@143
|
79 in
|
adamc@143
|
80 (n, es @ [e2])
|
adamc@143
|
81 end
|
adamc@143
|
82 | _ => (ErrorMsg.errorAt loc "Invalid link expression";
|
adamc@143
|
83 (0, []))
|
adamc@110
|
84
|
adamc@143
|
85 val (f, args) = unravel e
|
adamc@112
|
86
|
adamc@143
|
87 val (cn, count, tags, newTags) =
|
adamc@143
|
88 case IM.find (tags, f) of
|
adamc@143
|
89 NONE =>
|
adamc@143
|
90 (count, count + 1, IM.insert (tags, f, count),
|
adamc@144
|
91 (ek, f, count) :: newTags)
|
adamc@143
|
92 | SOME cn => (cn, count, tags, newTags)
|
adamc@143
|
93
|
adamc@143
|
94 val (_, _, _, s) = E.lookupENamed env f
|
adamc@112
|
95
|
adamc@143
|
96 val byTag = case SM.find (byTag, s) of
|
adamc@144
|
97 NONE => SM.insert (byTag, s, (ek, f))
|
adamc@144
|
98 | SOME (ek', f') =>
|
adamc@143
|
99 (if f = f' then
|
adamc@143
|
100 ()
|
adamc@143
|
101 else
|
adamc@143
|
102 ErrorMsg.errorAt loc
|
adamc@143
|
103 ("Duplicate HTTP tag "
|
adamc@143
|
104 ^ s);
|
adamc@144
|
105 if ek = ek' then
|
adamc@144
|
106 ()
|
adamc@144
|
107 else
|
adamc@144
|
108 ErrorMsg.errorAt loc
|
adamc@144
|
109 "Function needed as both a link and a form ";
|
adamc@143
|
110 byTag)
|
adamc@143
|
111
|
adamc@143
|
112 val e = (EClosure (cn, args), loc)
|
adamc@143
|
113 val t = (CFfi ("Basis", "string"), loc)
|
adamc@143
|
114 in
|
adamc@143
|
115 (((CName newAttr, loc), e, t),
|
adamc@143
|
116 (count, tags, byTag, newTags))
|
adamc@143
|
117 end
|
adamc@143
|
118 in
|
adamc@143
|
119 case x of
|
adamc@907
|
120 (CName "Link", _) => tagIt (Link, "Link")
|
adamc@731
|
121 | (CName "Action", _) => tagIt (Action ReadWrite, "Action")
|
adamc@143
|
122 | _ => ((x, e, t), (count, tags, byTag, newTags))
|
adamc@143
|
123 end)
|
adamc@110
|
124 s xets
|
adamc@110
|
125 in
|
adamc@110
|
126 (EApp (
|
adamc@110
|
127 (EApp (
|
adamc@110
|
128 (EApp (
|
adamc@721
|
129 (EApp (
|
adamc@110
|
130 (ECApp (
|
adamc@110
|
131 (ECApp (
|
adamc@110
|
132 (ECApp (
|
adamc@140
|
133 (ECApp (
|
adamc@140
|
134 (ECApp (
|
adamc@140
|
135 (ECApp (
|
adamc@140
|
136 (ECApp (
|
adamc@721
|
137 (ECApp (
|
adamc@721
|
138 (EFfi ("Basis", "tag"),
|
adamc@721
|
139 loc), given), loc), absent), loc), outer), loc), inner), loc),
|
adamc@721
|
140 useOuter), loc), useInner), loc), bindOuter), loc), bindInner), loc),
|
adamc@721
|
141 class), loc),
|
adamc@110
|
142 (ERecord xets, loc)), loc),
|
adamc@110
|
143 tag), loc),
|
adamc@110
|
144 xml), s)
|
adamc@110
|
145 end
|
adamc@110
|
146 | _ => (ErrorMsg.errorAt loc "Attribute record is too complex";
|
adamc@110
|
147 (e, s)))
|
adamc@110
|
148
|
adamc@110
|
149 | _ => (e, s)
|
adamc@110
|
150
|
adamc@110
|
151 fun decl (d, s) = (d, s)
|
adamc@110
|
152
|
adamc@110
|
153 fun tag file =
|
adamc@110
|
154 let
|
adamc@179
|
155 val count = U.File.maxName file
|
adamc@110
|
156
|
adamc@112
|
157 fun doDecl (d as (d', loc), (env, count, tags, byTag)) =
|
adamc@112
|
158 case d' of
|
adamc@144
|
159 DExport (ek, n) =>
|
adamc@112
|
160 let
|
adamc@112
|
161 val (_, _, _, s) = E.lookupENamed env n
|
adamc@112
|
162 in
|
adamc@112
|
163 case SM.find (byTag, s) of
|
adamc@112
|
164 NONE => ([d], (env, count, tags, byTag))
|
adamc@144
|
165 | SOME (ek', n') =>
|
adamc@144
|
166 (if ek = ek' then
|
adamc@144
|
167 ()
|
adamc@144
|
168 else
|
adamc@144
|
169 ErrorMsg.errorAt loc "Function needed for both a link and a form";
|
adamc@144
|
170 ([], (env, count, tags, byTag)))
|
adamc@112
|
171 end
|
adamc@112
|
172 | _ =>
|
adamc@112
|
173 let
|
adamc@126
|
174 val env' = E.declBinds env d
|
adamc@126
|
175 val env'' = case d' of
|
adamc@126
|
176 DValRec _ => env'
|
adamc@126
|
177 | _ => env
|
adamc@126
|
178
|
adamc@112
|
179 val (d, (count, tags, byTag, newTags)) =
|
adamc@112
|
180 U.Decl.foldMap {kind = kind,
|
adamc@112
|
181 con = con,
|
adamc@126
|
182 exp = exp env'',
|
adamc@112
|
183 decl = decl}
|
adamc@112
|
184 (count, tags, byTag, []) d
|
adamc@110
|
185
|
adamc@126
|
186 val env = env'
|
adamc@110
|
187
|
adamc@126
|
188 val newDs = map
|
adamc@144
|
189 (fn (ek, f, cn) =>
|
adamc@112
|
190 let
|
adamc@492
|
191 val unit = (TRecord (CRecord ((KType, loc), []), loc), loc)
|
adamc@492
|
192
|
adamc@112
|
193 fun unravel (all as (t, _)) =
|
adamc@112
|
194 case t of
|
adamc@112
|
195 TFun (dom, ran) =>
|
adamc@112
|
196 let
|
adamc@112
|
197 val (args, result) = unravel ran
|
adamc@112
|
198 in
|
adamc@112
|
199 (dom :: args, result)
|
adamc@112
|
200 end
|
adamc@112
|
201 | _ => ([], all)
|
adamc@110
|
202
|
adamc@112
|
203 val (fnam, t, _, tag) = E.lookupENamed env f
|
adamc@112
|
204 val (args, result) = unravel t
|
adamc@110
|
205
|
adamc@119
|
206 val (abs, t) =
|
adamc@119
|
207 case args of
|
adamc@119
|
208 [] =>
|
adamc@119
|
209 let
|
adamc@492
|
210 val app = (EApp ((ENamed f, loc), (ERecord [], loc)), loc)
|
adamc@492
|
211 val body = (EWrite app, loc)
|
adamc@119
|
212 in
|
adamc@492
|
213 (body,
|
adamc@119
|
214 (TFun (unit, unit), loc))
|
adamc@119
|
215 end
|
adamc@119
|
216 | _ =>
|
adamc@119
|
217 let
|
adamc@119
|
218 val (app, _) = foldl (fn (t, (app, n)) =>
|
adamc@119
|
219 ((EApp (app, (ERel n, loc)), loc),
|
adamc@119
|
220 n - 1))
|
adamc@119
|
221 ((ENamed f, loc), length args - 1) args
|
adamc@280
|
222 val app = (EApp (app, (ERecord [], loc)), loc)
|
adamc@119
|
223 val body = (EWrite app, loc)
|
adamc@280
|
224 val t = (TFun (unit, unit), loc)
|
adamc@119
|
225 val (abs, _, t) = foldr (fn (t, (abs, n, rest)) =>
|
adamc@119
|
226 ((EAbs ("x" ^ Int.toString n,
|
adamc@119
|
227 t,
|
adamc@119
|
228 rest,
|
adamc@119
|
229 abs), loc),
|
adamc@119
|
230 n + 1,
|
adamc@119
|
231 (TFun (t, rest), loc)))
|
adamc@280
|
232 (body, 0, t) args
|
adamc@119
|
233 in
|
adamc@119
|
234 (abs, t)
|
adamc@119
|
235 end
|
adamc@112
|
236 in
|
adamc@126
|
237 (("wrap_" ^ fnam, cn, t, abs, tag),
|
adamc@144
|
238 (DExport (ek, cn), loc))
|
adamc@112
|
239 end) newTags
|
adamc@126
|
240
|
adamc@126
|
241 val (newVals, newExports) = ListPair.unzip newDs
|
adamc@126
|
242
|
adamc@126
|
243 val ds = case d of
|
adamc@126
|
244 (DValRec vis, _) => [(DValRec (vis @ newVals), loc)]
|
adamc@126
|
245 | _ => map (fn vi => (DVal vi, loc)) newVals @ [d]
|
adamc@112
|
246 in
|
adamc@126
|
247 (ds @ newExports, (env, count, tags, byTag))
|
adamc@112
|
248 end
|
adamc@110
|
249
|
adamc@112
|
250 val (file, _) = ListUtil.foldlMapConcat doDecl (CoreEnv.empty, count+1, IM.empty, SM.empty) file
|
adamc@110
|
251 in
|
adamc@110
|
252 file
|
adamc@110
|
253 end
|
adamc@110
|
254
|
adamc@110
|
255 end
|