adamc@23
|
1 (* Copyright (c) 2008, Adam Chlipala
|
adamc@23
|
2 * All rights reserved.
|
adamc@23
|
3 *
|
adamc@23
|
4 * Redistribution and use in source and binary forms, with or without
|
adamc@23
|
5 * modification, are permitted provided that the following conditions are met:
|
adamc@23
|
6 *
|
adamc@23
|
7 * - Redistributions of source code must retain the above copyright notice,
|
adamc@23
|
8 * this list of conditions and the following disclaimer.
|
adamc@23
|
9 * - Redistributions in binary form must reproduce the above copyright notice,
|
adamc@23
|
10 * this list of conditions and the following disclaimer in the documentation
|
adamc@23
|
11 * and/or other materials provided with the distribution.
|
adamc@23
|
12 * - The names of contributors may not be used to endorse or promote products
|
adamc@23
|
13 * derived from this software without specific prior written permission.
|
adamc@23
|
14 *
|
adamc@23
|
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
adamc@23
|
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
adamc@23
|
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
adamc@23
|
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
adamc@23
|
19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
adamc@23
|
20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
adamc@23
|
21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
adamc@23
|
22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
adamc@23
|
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
adamc@23
|
24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
adamc@23
|
25 * POSSIBILITY OF SUCH DAMAGE.
|
adamc@23
|
26 *)
|
adamc@23
|
27
|
adamc@23
|
28 (* Remove unused definitions from a file *)
|
adamc@23
|
29
|
adamc@23
|
30 structure Shake :> SHAKE = struct
|
adamc@23
|
31
|
adamc@23
|
32 open Core
|
adamc@23
|
33
|
adamc@23
|
34 structure U = CoreUtil
|
adamc@23
|
35
|
adamc@23
|
36 structure IS = IntBinarySet
|
adamc@23
|
37 structure IM = IntBinaryMap
|
adamc@23
|
38
|
adamc@23
|
39 type free = {
|
adamc@23
|
40 con : IS.set,
|
adamc@23
|
41 exp : IS.set
|
adamc@23
|
42 }
|
adamc@23
|
43
|
adamc@338
|
44 val dummyt = (TRecord (CRecord ((KType, ErrorMsg.dummySpan), []), ErrorMsg.dummySpan), ErrorMsg.dummySpan)
|
adamc@247
|
45 val dummye = (EPrim (Prim.String ""), ErrorMsg.dummySpan)
|
adamc@247
|
46
|
adamc@1060
|
47 fun tupleC cs = (CTuple cs, ErrorMsg.dummySpan)
|
adamc@1060
|
48 fun tupleE es = (ERecord (map (fn e => (dummyt, e, dummyt)) es), ErrorMsg.dummySpan)
|
adamc@1060
|
49
|
adamc@23
|
50 fun shake file =
|
adamc@100
|
51 let
|
adamc@1060
|
52 val usedVarsC = U.Con.fold {kind = fn (_, st) => st,
|
adamc@1060
|
53 con = fn (c, cs) =>
|
adamc@1060
|
54 case c of
|
adamc@1060
|
55 CNamed n => IS.add (cs, n)
|
adamc@1060
|
56 | _ => cs}
|
adamc@1060
|
57
|
adamc@704
|
58 val usedVars = U.Exp.fold {kind = fn (_, st) => st,
|
adamc@704
|
59 con = fn (c, st as (es, cs)) =>
|
adamc@704
|
60 case c of
|
adamc@704
|
61 CNamed n => (es, IS.add (cs, n))
|
adamc@704
|
62 | _ => st,
|
adamc@704
|
63 exp = fn (e, st as (es, cs)) =>
|
adamc@704
|
64 case e of
|
adamc@704
|
65 ENamed n => (IS.add (es, n), cs)
|
adamc@704
|
66 | _ => st}
|
adamc@704
|
67
|
adamc@1060
|
68 val (usedE, usedC) =
|
adamc@248
|
69 List.foldl
|
adamc@1060
|
70 (fn ((DExport (_, n), _), (usedE, usedC)) => (IS.add (usedE, n), usedE)
|
adamc@1060
|
71 | ((DTable (_, _, c, _, pe, pc, ce, cc), _), (usedE, usedC)) =>
|
adamc@704
|
72 let
|
adamc@1060
|
73 val usedC = usedVarsC usedC c
|
adamc@1060
|
74 val usedC = usedVarsC usedC pc
|
adamc@1060
|
75 val usedC = usedVarsC usedC cc
|
adamc@1060
|
76
|
adamc@707
|
77 val (usedE, usedC) = usedVars (usedE, usedC) pe
|
adamc@707
|
78 val (usedE, usedC) = usedVars (usedE, usedC) ce
|
adamc@704
|
79 in
|
adamc@1060
|
80 (usedE, usedC)
|
adamc@704
|
81 end
|
adamc@1060
|
82 | (_, acc) => acc) (IS.empty, IS.empty) file
|
adamc@23
|
83
|
adamc@163
|
84 val (cdef, edef) = foldl (fn ((DCon (_, n, _, c), _), (cdef, edef)) => (IM.insert (cdef, n, [c]), edef)
|
adamc@807
|
85 | ((DDatatype dts, _), (cdef, edef)) =>
|
adamc@807
|
86 (foldl (fn ((_, n, _, xncs), cdef) =>
|
adamc@807
|
87 IM.insert (cdef, n, List.mapPartial #3 xncs)) cdef dts, edef)
|
adamc@453
|
88 | ((DVal (_, n, t, e, _), _), (cdef, edef)) => (cdef, IM.insert (edef, n, ([], t, e)))
|
adamc@125
|
89 | ((DValRec vis, _), (cdef, edef)) =>
|
adamc@453
|
90 let
|
adamc@453
|
91 val all_ns = map (fn (_, n, _, _, _) => n) vis
|
adamc@453
|
92 in
|
adamc@453
|
93 (cdef, foldl (fn ((_, n, t, e, _), edef) =>
|
adamc@453
|
94 IM.insert (edef, n, (all_ns, t, e))) edef vis)
|
adamc@453
|
95 end
|
adamc@247
|
96 | ((DExport _, _), acc) => acc
|
adamc@1060
|
97 | ((DTable (_, n, c, _, e1, c1, e2, c2), _), (cdef, edef)) =>
|
adamc@1060
|
98 (cdef, IM.insert (edef, n, ([], tupleC [c, c1, c2], tupleE [e1, e2])))
|
adamc@338
|
99 | ((DSequence (_, n, _), _), (cdef, edef)) =>
|
adamc@453
|
100 (cdef, IM.insert (edef, n, ([], dummyt, dummye)))
|
adamc@754
|
101 | ((DView (_, n, _, _, c), _), (cdef, edef)) =>
|
adamc@754
|
102 (cdef, IM.insert (edef, n, ([], c, dummye)))
|
adamc@461
|
103 | ((DDatabase _, _), acc) => acc
|
adamc@461
|
104 | ((DCookie (_, n, c, _), _), (cdef, edef)) =>
|
adamc@718
|
105 (cdef, IM.insert (edef, n, ([], c, dummye)))
|
adamc@720
|
106 | ((DStyle (_, n, _), _), (cdef, edef)) =>
|
adamc@720
|
107 (cdef, IM.insert (edef, n, ([], dummyt, dummye))))
|
adamc@100
|
108 (IM.empty, IM.empty) file
|
adamc@23
|
109
|
adamc@100
|
110 fun kind (_, s) = s
|
adamc@23
|
111
|
adamc@100
|
112 fun con (c, s) =
|
adamc@100
|
113 case c of
|
adamc@100
|
114 CNamed n =>
|
adamc@100
|
115 if IS.member (#con s, n) then
|
adamc@100
|
116 s
|
adamc@100
|
117 else
|
adamc@100
|
118 let
|
adamc@100
|
119 val s' = {con = IS.add (#con s, n),
|
adamc@100
|
120 exp = #exp s}
|
adamc@100
|
121 in
|
adamc@100
|
122 case IM.find (cdef, n) of
|
adamc@100
|
123 NONE => s'
|
adamc@163
|
124 | SOME cs => foldl (fn (c, s') => shakeCon s' c) s' cs
|
adamc@100
|
125 end
|
adamc@100
|
126 | _ => s
|
adamc@23
|
127
|
adamc@100
|
128 and shakeCon s = U.Con.fold {kind = kind, con = con} s
|
adamc@23
|
129
|
adamc@100
|
130 fun exp (e, s) =
|
adamc@607
|
131 let
|
adamc@607
|
132 fun check n =
|
adamc@607
|
133 if IS.member (#exp s, n) then
|
adamc@607
|
134 s
|
adamc@607
|
135 else
|
adamc@607
|
136 let
|
adamc@607
|
137 val s' = {exp = IS.add (#exp s, n),
|
adamc@607
|
138 con = #con s}
|
adamc@607
|
139 in
|
adamc@607
|
140 (*print ("Need " ^ Int.toString n ^ "\n");*)
|
adamc@607
|
141 case IM.find (edef, n) of
|
adamc@607
|
142 NONE => s'
|
adamc@607
|
143 | SOME (ns, t, e) =>
|
adamc@607
|
144 let
|
adamc@607
|
145 val s' = shakeExp (shakeCon s' t) e
|
adamc@607
|
146 in
|
adamc@607
|
147 foldl (fn (n, s') => exp (ENamed n, s')) s' ns
|
adamc@607
|
148 end
|
adamc@607
|
149 end
|
adamc@607
|
150 in
|
adamc@607
|
151 case e of
|
adamc@607
|
152 ENamed n => check n
|
adamc@1020
|
153 | EServerCall (n, _, _) => check n
|
adamc@607
|
154 | _ => s
|
adamc@607
|
155 end
|
adamc@23
|
156
|
adamc@100
|
157 and shakeExp s = U.Exp.fold {kind = kind, con = con, exp = exp} s
|
adamc@100
|
158
|
adamc@704
|
159 val s = {con = usedC, exp = usedE}
|
adamc@109
|
160
|
adamc@704
|
161 val s = IS.foldl (fn (n, s) =>
|
adamc@704
|
162 case IM.find (edef, n) of
|
adamc@704
|
163 NONE => raise Fail "Shake: Couldn't find 'val'"
|
adamc@704
|
164 | SOME (ns, t, e) =>
|
adamc@704
|
165 let
|
adamc@704
|
166 val s = shakeExp (shakeCon s t) e
|
adamc@704
|
167 in
|
adamc@704
|
168 foldl (fn (n, s) => exp (ENamed n, s)) s ns
|
adamc@704
|
169 end) s usedE
|
adamc@248
|
170
|
adamc@1060
|
171 val s = IS.foldl (fn (n, s) =>
|
adamc@1060
|
172 case IM.find (cdef, n) of
|
adamc@1060
|
173 NONE => raise Fail "Shake: Couldn't find 'con'"
|
adamc@1060
|
174 | SOME cs => foldl (fn (c, s) => shakeCon s c) s cs) s usedC
|
adamc@100
|
175 in
|
adamc@100
|
176 List.filter (fn (DCon (_, n, _, _), _) => IS.member (#con s, n)
|
adamc@807
|
177 | (DDatatype dts, _) => List.exists (fn (_, n, _, _) => IS.member (#con s, n)) dts
|
adamc@109
|
178 | (DVal (_, n, _, _, _), _) => IS.member (#exp s, n)
|
adamc@125
|
179 | (DValRec vis, _) => List.exists (fn (_, n, _, _, _) => IS.member (#exp s, n)) vis
|
adamc@247
|
180 | (DExport _, _) => true
|
adamc@754
|
181 | (DView _, _) => true
|
adamc@754
|
182 | (DSequence _, _) => true
|
adamc@271
|
183 | (DTable _, _) => true
|
adamc@461
|
184 | (DDatabase _, _) => true
|
adamc@718
|
185 | (DCookie _, _) => true
|
adamc@718
|
186 | (DStyle _, _) => true) file
|
adamc@100
|
187 end
|
adamc@23
|
188
|
adamc@23
|
189 end
|