Mercurial > urweb

annotate src/shake.sml @ 1251:70092a661f70

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Basic handling of recursive functions in Iflow
author Adam Chlipala <adamc@hcoop.net>
date Sat, 01 May 2010 09:51:46 -0400
parents c316ca3c9ec6
children e8d68fd8ed4b
rev   line source
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@1112 32 val sliceDb = ref false
adamc@1112 33
adamc@23 34 open Core
adamc@23 35
adamc@23 36 structure U = CoreUtil
adamc@23 37
adamc@23 38 structure IS = IntBinarySet
adamc@23 39 structure IM = IntBinaryMap
adamc@23 40
adamc@23 41 type free = {
adamc@23 42 con : IS.set,
adamc@23 43 exp : IS.set
adamc@23 44 }
adamc@23 45
adamc@338 46 val dummyt = (TRecord (CRecord ((KType, ErrorMsg.dummySpan), []), ErrorMsg.dummySpan), ErrorMsg.dummySpan)
adamc@247 47 val dummye = (EPrim (Prim.String ""), ErrorMsg.dummySpan)
adamc@247 48
adamc@1060 49 fun tupleC cs = (CTuple cs, ErrorMsg.dummySpan)
adamc@1060 50 fun tupleE es = (ERecord (map (fn e => (dummyt, e, dummyt)) es), ErrorMsg.dummySpan)
adamc@1060 51
adamc@23 52 fun shake file =
adamc@100 53 let
adamc@1060 54 val usedVarsC = U.Con.fold {kind = fn (_, st) => st,
adamc@1060 55 con = fn (c, cs) =>
adamc@1060 56 case c of
adamc@1060 57 CNamed n => IS.add (cs, n)
adamc@1060 58 | _ => cs}
adamc@1060 59
adamc@704 60 val usedVars = U.Exp.fold {kind = fn (_, st) => st,
adamc@704 61 con = fn (c, st as (es, cs)) =>
adamc@704 62 case c of
adamc@704 63 CNamed n => (es, IS.add (cs, n))
adamc@704 64 | _ => st,
adamc@704 65 exp = fn (e, st as (es, cs)) =>
adamc@704 66 case e of
adamc@704 67 ENamed n => (IS.add (es, n), cs)
adamc@704 68 | _ => st}
adamc@704 69
adamc@1060 70 val (usedE, usedC) =
adamc@248 71 List.foldl
adamc@1112 72 (fn ((DExport (_, n, _), _), st as (usedE, usedC)) =>
adamc@1112 73 if !sliceDb then
adamc@1112 74 st
adamc@1112 75 else
adamc@1112 76 (IS.add (usedE, n), usedC)
adamc@1060 77 | ((DTable (_, _, c, _, pe, pc, ce, cc), _), (usedE, usedC)) =>
adamc@704 78 let
adamc@1060 79 val usedC = usedVarsC usedC c
adamc@1060 80 val usedC = usedVarsC usedC pc
adamc@1060 81 val usedC = usedVarsC usedC cc
adamc@1060 82
adamc@707 83 val (usedE, usedC) = usedVars (usedE, usedC) pe
adamc@707 84 val (usedE, usedC) = usedVars (usedE, usedC) ce
adamc@704 85 in
adamc@1060 86 (usedE, usedC)
adamc@704 87 end
adamc@1112 88 | ((DTask (e1, e2), _), st) =>
adamc@1112 89 if !sliceDb then
adamc@1112 90 st
adamc@1112 91 else
adamc@1112 92 usedVars (usedVars st e1) e2
adamc@1199 93 | ((DPolicy e1, _), st) =>
adamc@1199 94 if !sliceDb then
adamc@1199 95 st
adamc@1199 96 else
adamc@1199 97 usedVars st e1
adamc@1060 98 | (_, acc) => acc) (IS.empty, IS.empty) file
adamc@23 99
adamc@163 100 val (cdef, edef) = foldl (fn ((DCon (_, n, _, c), _), (cdef, edef)) => (IM.insert (cdef, n, [c]), edef)
adamc@807 101 | ((DDatatype dts, _), (cdef, edef)) =>
adamc@807 102 (foldl (fn ((_, n, _, xncs), cdef) =>
adamc@807 103 IM.insert (cdef, n, List.mapPartial #3 xncs)) cdef dts, edef)
adamc@453 104 | ((DVal (_, n, t, e, _), _), (cdef, edef)) => (cdef, IM.insert (edef, n, ([], t, e)))
adamc@125 105 | ((DValRec vis, _), (cdef, edef)) =>
adamc@453 106 let
adamc@453 107 val all_ns = map (fn (_, n, _, _, _) => n) vis
adamc@453 108 in
adamc@453 109 (cdef, foldl (fn ((_, n, t, e, _), edef) =>
adamc@453 110 IM.insert (edef, n, (all_ns, t, e))) edef vis)
adamc@453 111 end
adamc@247 112 | ((DExport _, _), acc) => acc
adamc@1060 113 | ((DTable (_, n, c, _, e1, c1, e2, c2), _), (cdef, edef)) =>
adamc@1060 114 (cdef, IM.insert (edef, n, ([], tupleC [c, c1, c2], tupleE [e1, e2])))
adamc@338 115 | ((DSequence (_, n, _), _), (cdef, edef)) =>
adamc@453 116 (cdef, IM.insert (edef, n, ([], dummyt, dummye)))
adamc@754 117 | ((DView (_, n, _, _, c), _), (cdef, edef)) =>
adamc@754 118 (cdef, IM.insert (edef, n, ([], c, dummye)))
adamc@461 119 | ((DDatabase _, _), acc) => acc
adamc@461 120 | ((DCookie (_, n, c, _), _), (cdef, edef)) =>
adamc@718 121 (cdef, IM.insert (edef, n, ([], c, dummye)))
adamc@720 122 | ((DStyle (_, n, _), _), (cdef, edef)) =>
adamc@1073 123 (cdef, IM.insert (edef, n, ([], dummyt, dummye)))
adamc@1199 124 | ((DTask _, _), acc) => acc
adamc@1199 125 | ((DPolicy _, _), acc) => acc)
adamc@100 126 (IM.empty, IM.empty) file
adamc@23 127
adamc@100 128 fun kind (_, s) = s
adamc@23 129
adamc@100 130 fun con (c, s) =
adamc@100 131 case c of
adamc@100 132 CNamed n =>
adamc@100 133 if IS.member (#con s, n) then
adamc@100 134 s
adamc@100 135 else
adamc@100 136 let
adamc@100 137 val s' = {con = IS.add (#con s, n),
adamc@100 138 exp = #exp s}
adamc@100 139 in
adamc@100 140 case IM.find (cdef, n) of
adamc@100 141 NONE => s'
adamc@163 142 | SOME cs => foldl (fn (c, s') => shakeCon s' c) s' cs
adamc@100 143 end
adamc@100 144 | _ => s
adamc@23 145
adamc@100 146 and shakeCon s = U.Con.fold {kind = kind, con = con} s
adamc@23 147
adamc@1080 148 (*val () = print "=====\nSHAKE\n=====\n"
adamc@1080 149 val current = ref 0*)
adamc@1080 150
adamc@100 151 fun exp (e, s) =
adamc@607 152 let
adamc@607 153 fun check n =
adamc@607 154 if IS.member (#exp s, n) then
adamc@607 155 s
adamc@607 156 else
adamc@607 157 let
adamc@607 158 val s' = {exp = IS.add (#exp s, n),
adamc@607 159 con = #con s}
adamc@607 160 in
adamc@1080 161 (*print ("Need " ^ Int.toString n ^ " <-- " ^ Int.toString (!current) ^ "\n");*)
adamc@607 162 case IM.find (edef, n) of
adamc@607 163 NONE => s'
adamc@607 164 | SOME (ns, t, e) =>
adamc@607 165 let
adamc@1080 166 (*val old = !current
adamc@1080 167 val () = current := n*)
adamc@607 168 val s' = shakeExp (shakeCon s' t) e
adamc@607 169 in
adamc@1080 170 (*current := old;*)
adamc@607 171 foldl (fn (n, s') => exp (ENamed n, s')) s' ns
adamc@607 172 end
adamc@607 173 end
adamc@607 174 in
adamc@607 175 case e of
adamc@607 176 ENamed n => check n
adamc@1020 177 | EServerCall (n, _, _) => check n
adamc@607 178 | _ => s
adamc@607 179 end
adamc@23 180
adamc@100 181 and shakeExp s = U.Exp.fold {kind = kind, con = con, exp = exp} s
adamc@100 182
adamc@704 183 val s = {con = usedC, exp = usedE}
adamc@109 184
adamc@704 185 val s = IS.foldl (fn (n, s) =>
adamc@704 186 case IM.find (edef, n) of
adamc@704 187 NONE => raise Fail "Shake: Couldn't find 'val'"
adamc@704 188 | SOME (ns, t, e) =>
adamc@704 189 let
adamc@1080 190 (*val () = current := n*)
adamc@704 191 val s = shakeExp (shakeCon s t) e
adamc@704 192 in
adamc@704 193 foldl (fn (n, s) => exp (ENamed n, s)) s ns
adamc@704 194 end) s usedE
adamc@248 195
adamc@1060 196 val s = IS.foldl (fn (n, s) =>
adamc@1060 197 case IM.find (cdef, n) of
adamc@1062 198 NONE => raise Fail ("Shake: Couldn't find 'con' " ^ Int.toString n)
adamc@1060 199 | SOME cs => foldl (fn (c, s) => shakeCon s c) s cs) s usedC
adamc@100 200 in
adamc@100 201 List.filter (fn (DCon (_, n, _, _), _) => IS.member (#con s, n)
adamc@807 202 | (DDatatype dts, _) => List.exists (fn (_, n, _, _) => IS.member (#con s, n)) dts
adamc@109 203 | (DVal (_, n, _, _, _), _) => IS.member (#exp s, n)
adamc@125 204 | (DValRec vis, _) => List.exists (fn (_, n, _, _, _) => IS.member (#exp s, n)) vis
adamc@1112 205 | (DExport _, _) => not (!sliceDb)
adamc@754 206 | (DView _, _) => true
adamc@754 207 | (DSequence _, _) => true
adamc@271 208 | (DTable _, _) => true
adamc@1112 209 | (DDatabase _, _) => not (!sliceDb)
adamc@1112 210 | (DCookie _, _) => not (!sliceDb)
adamc@1112 211 | (DStyle _, _) => not (!sliceDb)
adamc@1199 212 | (DTask _, _) => not (!sliceDb)
adamc@1199 213 | (DPolicy _, _) => not (!sliceDb)) file
adamc@100 214 end
adamc@23 215
adamc@23 216 end