1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
|
(* Copyright (c) 2008, Adam Chlipala
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - The names of contributors may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*)
structure Tag :> TAG = struct
open Core
structure U = CoreUtil
structure E = CoreEnv
structure IM = IntBinaryMap
structure SM = BinaryMapFn(struct
type ord_key = string
val compare = String.compare
end)
fun kind (k, s) = (k, s)
fun con (c, s) = (c, s)
fun both (loc, f) = (ErrorMsg.errorAt loc ("Function " ^ f ^ " needed for both a link and a form");
TextIO.output (TextIO.stdErr,
"Make sure that the signature of the containing module hides any form handlers.\n"))
fun exp env (e, s) =
let
fun tagIt (e, ek : export_kind, newAttr, (count, tags, byTag, newTags)) =
let
val loc = #2 e
val eOrig = e
fun unravel (e, _) =
case e of
ENamed n => (n, [])
| EApp (e1, e2) =>
let
val (n, es) = unravel e1
in
(n, es @ [e2])
end
| _ => (ErrorMsg.errorAt loc ("Invalid " ^ newAttr
^ " expression");
Print.epreface ("Expression",
CorePrint.p_exp env eOrig);
(0, []))
val (f, args) = unravel e
in
if f = 0 then
(e, (count, tags, byTag, newTags))
else
let
val (cn, count, tags, newTags) =
case IM.find (tags, f) of
NONE =>
(count, count + 1, IM.insert (tags, f, count),
(ek, f, count) :: newTags)
| SOME cn => (cn, count, tags, newTags)
val (_, _, _, s) = E.lookupENamed env f
val byTag = case SM.find (byTag, s) of
NONE => SM.insert (byTag, s, (ek, f))
| SOME (ek', f') =>
(if f = f' then
()
else
ErrorMsg.errorAt loc
("Duplicate HTTP tag "
^ s);
if ek = ek' then
()
else
both (loc, s);
byTag)
val e = (EClosure (cn, args), loc)
in
(e, (count, tags, byTag, newTags))
end
end
in
case e of
EApp (
(EApp (
(EApp (
(EApp (
(EApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(EFfi ("Basis", "tag"),
loc), given), _), absent), _), outer), _), inner), _),
useOuter), _), useInner), _), bindOuter), _), bindInner), _),
class), _),
dynClass), _),
attrs), _),
tag), _),
xml) =>
(case attrs of
(ERecord xets, _) =>
let
val (xets, s) =
ListUtil.foldlMap (fn ((x, e, t), s) =>
let
fun tagIt' (ek, newAttr) =
let
val (e', s) = tagIt (e, ek, newAttr, s)
val t = (CFfi ("Basis", "string"), loc)
in
(((CName newAttr, loc), e', t), s)
end
in
case x of
(CName "Link", _) => tagIt' (Link, "Link")
| (CName "Action", _) => tagIt' (Action ReadWrite, "Action")
| _ => ((x, e, t), s)
end)
s xets
in
(EApp (
(EApp (
(EApp (
(EApp (
(EApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(ECApp (
(EFfi ("Basis", "tag"),
loc), given), loc), absent), loc), outer), loc), inner), loc),
useOuter), loc), useInner), loc), bindOuter), loc), bindInner), loc),
class), loc), dynClass), loc),
(ERecord xets, loc)), loc),
tag), loc),
xml), s)
end
| _ => (e, s))
| EFfiApp ("Basis", "url", [(ERel 0, _)]) => (e, s)
| EFfiApp ("Basis", "url", [e]) =>
let
val (e, s) = tagIt (e, Link, "Url", s)
in
(EFfiApp ("Basis", "url", [e]), s)
end
| EFfiApp ("Basis", "effectfulUrl", [(ERel 0, _)]) => (e, s)
| EFfiApp ("Basis", "effectfulUrl", [e]) =>
let
val (e, s) = tagIt (e, Extern ReadCookieWrite, "Url", s)
in
(EFfiApp ("Basis", "url", [e]), s)
end
| EApp ((ENamed n, _), e') =>
let
val (_, _, eo, _) = E.lookupENamed env n
in
case eo of
SOME (EAbs (_, _, _, (EFfiApp ("Basis", "url", [(ERel 0, _)]), _)), _) =>
let
val (e, s) = tagIt (e', Link, "Url", s)
in
(EFfiApp ("Basis", "url", [e]), s)
end
| _ => (e, s)
end
| _ => (e, s)
end
fun decl (d, s) = (d, s)
fun tag file =
let
val count = U.File.maxName file
fun doDecl (d as (d', loc), (env, count, tags, byTag)) =
case d' of
DExport (ek, n, _) =>
let
val (_, _, _, s) = E.lookupENamed env n
in
case SM.find (byTag, s) of
NONE => ([d], (env, count, tags, byTag))
| SOME (ek', n') =>
(if ek = ek' then
()
else
both (loc, s);
([], (env, count, tags, byTag)))
end
| _ =>
let
val env' = E.declBinds env d
val env'' = case d' of
DValRec _ => env'
| _ => env
val (d, (count, tags, byTag, newTags)) =
U.Decl.foldMap {kind = kind,
con = con,
exp = exp env'',
decl = decl}
(count, tags, byTag, []) d
val env = env'
val newDs = map
(fn (ek, f, cn) =>
let
val unit = (TRecord (CRecord ((KType, loc), []), loc), loc)
fun unravel (all as (t, _)) =
case t of
TFun (dom, ran) =>
let
val (args, result) = unravel ran
in
(dom :: args, result)
end
| _ => ([], all)
val (fnam, t, _, tag) = E.lookupENamed env f
val (args, result) = unravel t
val (abs, t) =
case args of
[] =>
let
val app = (EApp ((ENamed f, loc), (ERecord [], loc)), loc)
val body = (EWrite app, loc)
in
(body,
(TFun (unit, unit), loc))
end
| _ =>
let
val (app, _) = foldl (fn (t, (app, n)) =>
((EApp (app, (ERel n, loc)), loc),
n - 1))
((ENamed f, loc), length args - 1) args
val app = (EApp (app, (ERecord [], loc)), loc)
val body = (EWrite app, loc)
val t = (TFun (unit, unit), loc)
val (abs, _, t) = foldr (fn (t, (abs, n, rest)) =>
((EAbs ("x" ^ Int.toString n,
t,
rest,
abs), loc),
n + 1,
(TFun (t, rest), loc)))
(body, 0, t) args
in
(abs, t)
end
in
(("wrap_" ^ fnam, cn, t, abs, tag),
(DExport (ek, cn, false), loc))
end) newTags
val (newVals, newExports) = ListPair.unzip newDs
val ds = case d of
(DValRec vis, _) => [(DValRec (vis @ newVals), loc)]
| _ => map (fn vi => (DVal vi, loc)) newVals @ [d]
in
(ds @ newExports, (env, count, tags, byTag))
end
val (file, _) = ListUtil.foldlMapConcat doDecl (CoreEnv.empty, count+1, IM.empty, SM.empty) file
in
file
end
end
|