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@23
|
47 fun shake file =
|
adamc@100
|
48 let
|
adamc@704
|
49 val usedVars = U.Exp.fold {kind = fn (_, st) => st,
|
adamc@704
|
50 con = fn (c, st as (es, cs)) =>
|
adamc@704
|
51 case c of
|
adamc@704
|
52 CNamed n => (es, IS.add (cs, n))
|
adamc@704
|
53 | _ => st,
|
adamc@704
|
54 exp = fn (e, st as (es, cs)) =>
|
adamc@704
|
55 case e of
|
adamc@704
|
56 ENamed n => (IS.add (es, n), cs)
|
adamc@704
|
57 | _ => st}
|
adamc@704
|
58
|
adamc@704
|
59 val (usedE, usedC, table_cs) =
|
adamc@248
|
60 List.foldl
|
adamc@704
|
61 (fn ((DExport (_, n), _), (usedE, usedC, table_cs)) => (IS.add (usedE, n), usedE, table_cs)
|
adamc@707
|
62 | ((DTable (_, _, c, _, pe, _, ce, _), _), (usedE, usedC, table_cs)) =>
|
adamc@704
|
63 let
|
adamc@707
|
64 val (usedE, usedC) = usedVars (usedE, usedC) pe
|
adamc@707
|
65 val (usedE, usedC) = usedVars (usedE, usedC) ce
|
adamc@704
|
66 in
|
adamc@704
|
67 (usedE, usedC, c :: table_cs)
|
adamc@704
|
68 end
|
adamc@704
|
69 | (_, acc) => acc) (IS.empty, IS.empty, []) file
|
adamc@23
|
70
|
adamc@163
|
71 val (cdef, edef) = foldl (fn ((DCon (_, n, _, c), _), (cdef, edef)) => (IM.insert (cdef, n, [c]), edef)
|
adamc@807
|
72 | ((DDatatype dts, _), (cdef, edef)) =>
|
adamc@807
|
73 (foldl (fn ((_, n, _, xncs), cdef) =>
|
adamc@807
|
74 IM.insert (cdef, n, List.mapPartial #3 xncs)) cdef dts, edef)
|
adamc@453
|
75 | ((DVal (_, n, t, e, _), _), (cdef, edef)) => (cdef, IM.insert (edef, n, ([], t, e)))
|
adamc@125
|
76 | ((DValRec vis, _), (cdef, edef)) =>
|
adamc@453
|
77 let
|
adamc@453
|
78 val all_ns = map (fn (_, n, _, _, _) => n) vis
|
adamc@453
|
79 in
|
adamc@453
|
80 (cdef, foldl (fn ((_, n, t, e, _), edef) =>
|
adamc@453
|
81 IM.insert (edef, n, (all_ns, t, e))) edef vis)
|
adamc@453
|
82 end
|
adamc@247
|
83 | ((DExport _, _), acc) => acc
|
adamc@707
|
84 | ((DTable (_, n, c, _, _, _, _, _), _), (cdef, edef)) =>
|
adamc@453
|
85 (cdef, IM.insert (edef, n, ([], c, dummye)))
|
adamc@338
|
86 | ((DSequence (_, n, _), _), (cdef, edef)) =>
|
adamc@453
|
87 (cdef, IM.insert (edef, n, ([], dummyt, dummye)))
|
adamc@754
|
88 | ((DView (_, n, _, _, c), _), (cdef, edef)) =>
|
adamc@754
|
89 (cdef, IM.insert (edef, n, ([], c, dummye)))
|
adamc@461
|
90 | ((DDatabase _, _), acc) => acc
|
adamc@461
|
91 | ((DCookie (_, n, c, _), _), (cdef, edef)) =>
|
adamc@718
|
92 (cdef, IM.insert (edef, n, ([], c, dummye)))
|
adamc@720
|
93 | ((DStyle (_, n, _), _), (cdef, edef)) =>
|
adamc@720
|
94 (cdef, IM.insert (edef, n, ([], dummyt, dummye))))
|
adamc@100
|
95 (IM.empty, IM.empty) file
|
adamc@23
|
96
|
adamc@100
|
97 fun kind (_, s) = s
|
adamc@23
|
98
|
adamc@100
|
99 fun con (c, s) =
|
adamc@100
|
100 case c of
|
adamc@100
|
101 CNamed n =>
|
adamc@100
|
102 if IS.member (#con s, n) then
|
adamc@100
|
103 s
|
adamc@100
|
104 else
|
adamc@100
|
105 let
|
adamc@100
|
106 val s' = {con = IS.add (#con s, n),
|
adamc@100
|
107 exp = #exp s}
|
adamc@100
|
108 in
|
adamc@100
|
109 case IM.find (cdef, n) of
|
adamc@100
|
110 NONE => s'
|
adamc@163
|
111 | SOME cs => foldl (fn (c, s') => shakeCon s' c) s' cs
|
adamc@100
|
112 end
|
adamc@100
|
113 | _ => s
|
adamc@23
|
114
|
adamc@100
|
115 and shakeCon s = U.Con.fold {kind = kind, con = con} s
|
adamc@23
|
116
|
adamc@100
|
117 fun exp (e, s) =
|
adamc@607
|
118 let
|
adamc@607
|
119 fun check n =
|
adamc@607
|
120 if IS.member (#exp s, n) then
|
adamc@607
|
121 s
|
adamc@607
|
122 else
|
adamc@607
|
123 let
|
adamc@607
|
124 val s' = {exp = IS.add (#exp s, n),
|
adamc@607
|
125 con = #con s}
|
adamc@607
|
126 in
|
adamc@607
|
127 (*print ("Need " ^ Int.toString n ^ "\n");*)
|
adamc@607
|
128 case IM.find (edef, n) of
|
adamc@607
|
129 NONE => s'
|
adamc@607
|
130 | SOME (ns, t, e) =>
|
adamc@607
|
131 let
|
adamc@607
|
132 val s' = shakeExp (shakeCon s' t) e
|
adamc@607
|
133 in
|
adamc@607
|
134 foldl (fn (n, s') => exp (ENamed n, s')) s' ns
|
adamc@607
|
135 end
|
adamc@607
|
136 end
|
adamc@607
|
137 in
|
adamc@607
|
138 case e of
|
adamc@607
|
139 ENamed n => check n
|
adamc@1020
|
140 | EServerCall (n, _, _) => check n
|
adamc@607
|
141 | _ => s
|
adamc@607
|
142 end
|
adamc@23
|
143
|
adamc@100
|
144 and shakeExp s = U.Exp.fold {kind = kind, con = con, exp = exp} s
|
adamc@100
|
145
|
adamc@704
|
146 val s = {con = usedC, exp = usedE}
|
adamc@109
|
147
|
adamc@704
|
148 val s = IS.foldl (fn (n, s) =>
|
adamc@704
|
149 case IM.find (edef, n) of
|
adamc@704
|
150 NONE => raise Fail "Shake: Couldn't find 'val'"
|
adamc@704
|
151 | SOME (ns, t, e) =>
|
adamc@704
|
152 let
|
adamc@704
|
153 val s = shakeExp (shakeCon s t) e
|
adamc@704
|
154 in
|
adamc@704
|
155 foldl (fn (n, s) => exp (ENamed n, s)) s ns
|
adamc@704
|
156 end) s usedE
|
adamc@248
|
157
|
adamc@248
|
158 val s = foldl (fn (c, s) => shakeCon s c) s table_cs
|
adamc@100
|
159 in
|
adamc@100
|
160 List.filter (fn (DCon (_, n, _, _), _) => IS.member (#con s, n)
|
adamc@807
|
161 | (DDatatype dts, _) => List.exists (fn (_, n, _, _) => IS.member (#con s, n)) dts
|
adamc@109
|
162 | (DVal (_, n, _, _, _), _) => IS.member (#exp s, n)
|
adamc@125
|
163 | (DValRec vis, _) => List.exists (fn (_, n, _, _, _) => IS.member (#exp s, n)) vis
|
adamc@247
|
164 | (DExport _, _) => true
|
adamc@754
|
165 | (DView _, _) => true
|
adamc@754
|
166 | (DSequence _, _) => true
|
adamc@271
|
167 | (DTable _, _) => true
|
adamc@461
|
168 | (DDatabase _, _) => true
|
adamc@718
|
169 | (DCookie _, _) => true
|
adamc@718
|
170 | (DStyle _, _) => true) file
|
adamc@100
|
171 end
|
adamc@23
|
172
|
adamc@23
|
173 end
|