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
|
(* Copyright (c) 2009, 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 MarshalCheck :> MARSHAL_CHECK = struct
open Core
structure U = CoreUtil
structure E = ErrorMsg
structure PK = struct
open Order
type ord_key = string * string
fun compare ((m1, x1), (m2, x2)) =
join (String.compare (m1, m2),
fn () => String.compare (x1, x2))
end
structure PS = BinarySetFn(PK)
structure PS = struct
open PS
fun toString' (m, x) = m ^ "." ^ x
fun toString set =
case PS.listItems set of
[] => "{}"
| [x] => toString' x
| x :: xs => List.foldl (fn (x, s) => s ^ ", " ^ toString' x) (toString' x) xs
end
structure IM = IntBinaryMap
val clientToServer = [("Basis", "int"),
("Basis", "float"),
("Basis", "string"),
("Basis", "time"),
("Basis", "unit"),
("Basis", "option"),
("Basis", "bool")]
val clientToServer = PS.addList (PS.empty, clientToServer)
fun check file =
let
fun kind (_, st) = st
fun con cmap (c, st) =
case c of
CFfi mx =>
if PS.member (clientToServer, mx) then
st
else
PS.add (st, mx)
| CNamed n =>
(case IM.find (cmap, n) of
NONE => st
| SOME st' => PS.union (st, st'))
| _ => st
fun sins cmap = U.Con.fold {kind = kind, con = con cmap} PS.empty
in
ignore (foldl (fn ((d, _), (cmap, emap)) =>
case d of
DCon (_, n, _, c) => (IM.insert (cmap, n, sins cmap c), emap)
| DDatatype (_, n, _, xncs) =>
(IM.insert (cmap, n, foldl (fn ((_, _, co), s) =>
case co of
NONE => s
| SOME c => PS.union (s, sins cmap c))
PS.empty xncs),
emap)
| DVal (_, n, t, _, tag) => (cmap, IM.insert (emap, n, (t, tag)))
| DValRec vis => (cmap,
foldl (fn ((_, n, t, _, tag), emap) => IM.insert (emap, n, (t, tag)))
emap vis)
| DExport (_, n) =>
(case IM.find (emap, n) of
NONE => raise Fail "MarshalCheck: Unknown export"
| SOME (t, tag) =>
let
fun makeS (t, _) =
case t of
TFun (dom, ran) => PS.union (sins cmap dom, makeS ran)
| _ => PS.empty
val s = makeS t
in
if PS.isEmpty s then
()
else
E.error ("Input to exported function '"
^ tag ^ "' involves one or more disallowed types: "
^ PS.toString s);
(cmap, emap)
end)
| DCookie (_, _, t, tag) =>
let
val s = sins cmap t
in
if PS.isEmpty s then
()
else
E.error ("Cookie '" ^ tag ^ "' includes one or more disallowed types: "
^ PS.toString s);
(cmap, emap)
end
| _ => (cmap, emap))
(IM.empty, IM.empty) file)
end
end
|
