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
|
(* 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.
*)
(* Remove unused definitions from a file *)
structure MonoShake :> MONO_SHAKE = struct
open Mono
structure U = MonoUtil
structure IS = IntBinarySet
structure IM = IntBinaryMap
type free = {
con : IS.set,
exp : IS.set
}
fun shake file =
let
val usedVars = U.Exp.fold {typ = fn (c, st as (cs, es)) =>
case c of
TDatatype (n, _) => (IS.add (cs, n), es)
| _ => st,
exp = fn (e, st as (cs, es)) =>
case e of
ENamed n => (cs, IS.add (es, n))
| _ => st}
val (page_cs, page_es) =
List.foldl
(fn ((DExport (_, _, n, _, _, _), _), (page_cs, page_es)) => (page_cs, IS.add (page_es, n))
| ((DDatabase {expunge = n1, initialize = n2, ...}, _), (page_cs, page_es)) =>
(page_cs, IS.addList (page_es, [n1, n2]))
| ((DTask (e1, e2), _), st) => usedVars (usedVars st e2) e1
| ((DView (_, _, e), _), st) => usedVars st e
| ((DPolicy pol, _), st) =>
let
val e1 = case pol of
PolClient e1 => e1
| PolInsert e1 => e1
| PolDelete e1 => e1
| PolUpdate e1 => e1
| PolSequence e1 => e1
| PolEqualKnown {table = e1, ...} => e1
in
usedVars st e1
end
| (_, st) => st) (IS.empty, IS.empty) file
val (cdef, edef) = foldl (fn ((DDatatype dts, _), (cdef, edef)) =>
(foldl (fn ((_, n, xncs), cdef) => IM.insert (cdef, n, xncs)) cdef dts, edef)
| ((DVal (_, n, t, e, _), _), (cdef, edef)) =>
(cdef, IM.insert (edef, n, (t, e)))
| ((DValRec vis, _), (cdef, edef)) =>
(cdef, foldl (fn ((_, n, t, e, _), edef) => IM.insert (edef, n, (t, e))) edef vis)
| ((DExport _, _), acc) => acc
| ((DTable _, _), acc) => acc
| ((DSequence _, _), acc) => acc
| ((DView _, _), acc) => acc
| ((DDatabase _, _), acc) => acc
| ((DJavaScript _, _), acc) => acc
| ((DCookie _, _), acc) => acc
| ((DStyle _, _), acc) => acc
| ((DTask _, _), acc) => acc
| ((DPolicy _, _), acc) => acc)
(IM.empty, IM.empty) file
fun typ (c, s) =
case c of
TDatatype (n, _) =>
if IS.member (#con s, n) then
s
else
let
val s' = {exp = #exp s,
con = IS.add (#con s, n)}
in
case IM.find (cdef, n) of
NONE => s'
| SOME xncs => foldl (fn ((_, _, to), s) =>
case to of
NONE => s
| SOME t => shakeTyp s t)
s' xncs
end
| _ => s
and shakeTyp s = U.Typ.fold typ s
fun exp (e, s) =
case e of
ENamed n =>
if IS.member (#exp s, n) then
s
else
let
val s' = {exp = IS.add (#exp s, n),
con = #con s}
in
case IM.find (edef, n) of
NONE => s'
| SOME (t, e) => shakeExp s' e
end
| _ => s
and shakeExp s = U.Exp.fold {typ = typ, exp = exp} s
val s = {con = page_cs, exp = page_es}
val s = IS.foldl (fn (n, s) =>
case IM.find (cdef, n) of
NONE => raise Fail "MonoShake: Couldn't find 'datatype'"
| SOME xncs => foldl (fn ((_, _, SOME c), s) => shakeTyp s c
| _ => s) s xncs) s page_cs
val s = IS.foldl (fn (n, s) =>
case IM.find (edef, n) of
NONE => raise Fail "MonoShake: Couldn't find 'val'"
| SOME (t, e) => shakeExp s e) s page_es
in
List.filter (fn (DDatatype dts, _) => List.exists (fn (_, n, _) => IS.member (#con s, n)) dts
| (DVal (_, n, _, _, _), _) => IS.member (#exp s, n)
| (DValRec vis, _) => List.exists (fn (_, n, _, _, _) => IS.member (#exp s, n)) vis
| (DExport _, _) => true
| (DTable _, _) => true
| (DSequence _, _) => true
| (DView _, _) => true
| (DDatabase _, _) => true
| (DJavaScript _, _) => true
| (DCookie _, _) => true
| (DStyle _, _) => true
| (DTask _, _) => true
| (DPolicy _, _) => true) file
end
end
|
