Mercurial > urweb

annotate src/shake.sml @ 196:890a61991263

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Lists all the way through
author Adam Chlipala <adamc@hcoop.net>
date Sat, 09 Aug 2008 16:48:32 -0400
parents 9bbf4d383381
children 5c50b17f5e4a
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@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@23 44 fun shake file =
adamc@100 45 let
adamc@109 46 val page_es = List.foldl
adamc@144 47 (fn ((DExport (_, n), _), page_es) => n :: page_es
adamc@109 48 | (_, page_es) => page_es) [] file
adamc@23 49
adamc@163 50 val (cdef, edef) = foldl (fn ((DCon (_, n, _, c), _), (cdef, edef)) => (IM.insert (cdef, n, [c]), edef)
adamc@192 51 | ((DDatatype (_, n, _, xncs), _), (cdef, edef)) =>
adamc@163 52 (IM.insert (cdef, n, List.mapPartial #3 xncs), edef)
adamc@109 53 | ((DVal (_, n, t, e, _), _), (cdef, edef)) => (cdef, IM.insert (edef, n, (t, e)))
adamc@125 54 | ((DValRec vis, _), (cdef, edef)) =>
adamc@125 55 (cdef, foldl (fn ((_, n, t, e, _), edef) => IM.insert (edef, n, (t, e))) edef vis)
adamc@109 56 | ((DExport _, _), acc) => acc)
adamc@100 57 (IM.empty, IM.empty) file
adamc@23 58
adamc@100 59 fun kind (_, s) = s
adamc@23 60
adamc@100 61 fun con (c, s) =
adamc@100 62 case c of
adamc@100 63 CNamed n =>
adamc@100 64 if IS.member (#con s, n) then
adamc@100 65 s
adamc@100 66 else
adamc@100 67 let
adamc@100 68 val s' = {con = IS.add (#con s, n),
adamc@100 69 exp = #exp s}
adamc@100 70 in
adamc@100 71 case IM.find (cdef, n) of
adamc@100 72 NONE => s'
adamc@163 73 | SOME cs => foldl (fn (c, s') => shakeCon s' c) s' cs
adamc@100 74 end
adamc@100 75 | _ => s
adamc@23 76
adamc@100 77 and shakeCon s = U.Con.fold {kind = kind, con = con} s
adamc@23 78
adamc@100 79 fun exp (e, s) =
adamc@100 80 case e of
adamc@100 81 ENamed n =>
adamc@100 82 if IS.member (#exp s, n) then
adamc@100 83 s
adamc@100 84 else
adamc@100 85 let
adamc@100 86 val s' = {exp = IS.add (#exp s, n),
adamc@100 87 con = #con s}
adamc@100 88 in
adamc@100 89 case IM.find (edef, n) of
adamc@100 90 NONE => s'
adamc@100 91 | SOME (t, e) => shakeExp (shakeCon s' t) e
adamc@100 92 end
adamc@100 93 | _ => s
adamc@23 94
adamc@100 95 and shakeExp s = U.Exp.fold {kind = kind, con = con, exp = exp} s
adamc@100 96
adamc@109 97 val s = {con = IS.empty, exp = IS.addList (IS.empty, page_es)}
adamc@109 98
adamc@109 99 val s = foldl (fn (n, s) =>
adamc@109 100 case IM.find (edef, n) of
adamc@109 101 NONE => raise Fail "Shake: Couldn't find 'val'"
adamc@109 102 | SOME (t, e) => shakeExp (shakeCon s t) e) s page_es
adamc@100 103 in
adamc@100 104 List.filter (fn (DCon (_, n, _, _), _) => IS.member (#con s, n)
adamc@192 105 | (DDatatype (_, n, _, _), _) => IS.member (#con s, n)
adamc@109 106 | (DVal (_, n, _, _, _), _) => IS.member (#exp s, n)
adamc@125 107 | (DValRec vis, _) => List.exists (fn (_, n, _, _, _) => IS.member (#exp s, n)) vis
adamc@109 108 | (DExport _, _) => true) file
adamc@100 109 end
adamc@23 110
adamc@23 111 end