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
|
(* Copyright (c) 2009, 2014, 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 ScriptCheck :> SCRIPT_CHECK = struct
open Mono
structure SM = BinaryMapFn(struct
type ord_key = string
val compare = String.compare
end)
structure SS = BinarySetFn(struct
type ord_key = string
val compare = String.compare
end)
structure IS = IntBinarySet
val pushBasis = SS.addList (SS.empty,
["new_channel",
"self"])
datatype rpcmap =
Rpc of int (* ID of function definition *)
| Module of rpcmap SM.map
fun lookup (r : rpcmap, k : string) =
let
fun lookup' (r, ks) =
case r of
Rpc x => SOME x
| Module m =>
case ks of
[] => NONE
| k :: ks' =>
case SM.find (m, k) of
NONE => NONE
| SOME r' => lookup' (r', ks')
in
lookup' (r, String.tokens (fn ch => ch = #"/") k)
end
fun insert (r : rpcmap, k : string, v) =
let
fun insert' (r, ks) =
case r of
Rpc _ => Rpc v
| Module m =>
case ks of
[] => Rpc v
| k :: ks' =>
let
val r' = case SM.find (m, k) of
NONE => Module SM.empty
| SOME r' => r'
in
Module (SM.insert (m, k, insert' (r', ks')))
end
in
insert' (r, String.tokens (fn ch => ch = #"/") k)
end
fun dump (r : rpcmap) =
case r of
Rpc _ => print "ROOT\n"
| Module m => (print "<Module>\n";
SM.appi (fn (k, r') => (print (k ^ ":\n");
dump r')) m;
print "</Module>\n")
fun classify (ds, ps) =
let
val proto = Settings.currentProtocol ()
fun inString {needle, haystack} = String.isSubstring needle haystack
fun hasClient {basis, rpcs, funcs, push} =
MonoUtil.Exp.exists {typ = fn _ => false,
exp = fn ERecv _ => push
| EFfiApp ("Basis", x, _) => SS.member (basis, x)
| EJavaScript _ => not push
| ENamed n => IS.member (funcs, n)
| EServerCall (e, _, _, _) =>
let
fun head (e : exp) =
case #1 e of
EStrcat (e1, _) => head e1
| EPrim (Prim.String (_, s)) => SOME s
| _ => NONE
in
case head e of
NONE => true
| SOME fcall =>
case lookup (rpcs, fcall) of
NONE => true
| SOME n => IS.member (funcs, n)
end
| _ => false}
fun decl ((d, _), rpcs) =
case d of
DExport (Mono.Rpc _, fcall, n, _, _, _) =>
insert (rpcs, fcall, n)
| _ => rpcs
val rpcs = foldl decl (Module SM.empty) ds
fun decl ((d, _), (pull_ids, push_ids)) =
let
val hasClientPull = hasClient {basis = SS.empty, rpcs = rpcs, funcs = pull_ids, push = false}
val hasClientPush = hasClient {basis = pushBasis, rpcs = rpcs, funcs = push_ids, push = true}
in
case d of
DVal (_, n, _, e, _) => (if hasClientPull e then
IS.add (pull_ids, n)
else
pull_ids,
if hasClientPush e then
IS.add (push_ids, n)
else
push_ids)
| DValRec xes => (if List.exists (fn (_, _, _, e, _) => hasClientPull e) xes then
foldl (fn ((_, n, _, _, _), pull_ids) => IS.add (pull_ids, n))
pull_ids xes
else
pull_ids,
if List.exists (fn (_, _, _, e, _) => hasClientPush e) xes then
foldl (fn ((_, n, _, _, _), push_ids) => IS.add (push_ids, n))
push_ids xes
else
push_ids)
| _ => (pull_ids, push_ids)
end
val (pull_ids, push_ids) = foldl decl (IS.empty, IS.empty) ds
val foundBad = ref false
val all_ids = IS.union (pull_ids, push_ids)
val ps = map (fn n =>
(n, if IS.member (push_ids, n) then
(if not (#persistent proto) andalso not (!foundBad) then
(foundBad := true;
ErrorMsg.error ("This program needs server push, but the current protocol ("
^ #name proto ^ ") doesn't support that."))
else
();
ServerAndPullAndPush)
else if IS.member (pull_ids, n) then
ServerAndPull
else
ServerOnly, AnyDb)) (IS.listItems all_ids)
in
(ds, ps)
end
end
|
