Mercurial > urweb

annotate src/shake.sml @ 399:2d64457eedb1

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
listFun uses length
author Adam Chlipala <adamc@hcoop.net>
date Tue, 21 Oct 2008 13:41:03 -0400
parents e976b187d73a
children 787d4931fb07
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@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@248 49 val (page_es, table_cs) =
adamc@248 50 List.foldl
adamc@248 51 (fn ((DExport (_, n), _), (page_es, table_cs)) => (n :: page_es, table_cs)
adamc@248 52 | ((DTable (_, _, c, _), _), (page_es, table_cs)) => (page_es, c :: table_cs)
adamc@248 53 | (_, acc) => acc) ([], []) file
adamc@23 54
adamc@163 55 val (cdef, edef) = foldl (fn ((DCon (_, n, _, c), _), (cdef, edef)) => (IM.insert (cdef, n, [c]), edef)
adamc@192 56 | ((DDatatype (_, n, _, xncs), _), (cdef, edef)) =>
adamc@163 57 (IM.insert (cdef, n, List.mapPartial #3 xncs), edef)
adamc@109 58 | ((DVal (_, n, t, e, _), _), (cdef, edef)) => (cdef, IM.insert (edef, n, (t, e)))
adamc@125 59 | ((DValRec vis, _), (cdef, edef)) =>
adamc@125 60 (cdef, foldl (fn ((_, n, t, e, _), edef) => IM.insert (edef, n, (t, e))) edef vis)
adamc@247 61 | ((DExport _, _), acc) => acc
adamc@247 62 | ((DTable (_, n, c, _), _), (cdef, edef)) =>
adamc@271 63 (cdef, IM.insert (edef, n, (c, dummye)))
adamc@338 64 | ((DSequence (_, n, _), _), (cdef, edef)) =>
adamc@338 65 (cdef, IM.insert (edef, n, (dummyt, dummye)))
adamc@271 66 | ((DDatabase _, _), acc) => acc)
adamc@100 67 (IM.empty, IM.empty) file
adamc@23 68
adamc@100 69 fun kind (_, s) = s
adamc@23 70
adamc@100 71 fun con (c, s) =
adamc@100 72 case c of
adamc@100 73 CNamed n =>
adamc@100 74 if IS.member (#con s, n) then
adamc@100 75 s
adamc@100 76 else
adamc@100 77 let
adamc@100 78 val s' = {con = IS.add (#con s, n),
adamc@100 79 exp = #exp s}
adamc@100 80 in
adamc@100 81 case IM.find (cdef, n) of
adamc@100 82 NONE => s'
adamc@163 83 | SOME cs => foldl (fn (c, s') => shakeCon s' c) s' cs
adamc@100 84 end
adamc@100 85 | _ => s
adamc@23 86
adamc@100 87 and shakeCon s = U.Con.fold {kind = kind, con = con} s
adamc@23 88
adamc@100 89 fun exp (e, s) =
adamc@100 90 case e of
adamc@100 91 ENamed n =>
adamc@100 92 if IS.member (#exp s, n) then
adamc@100 93 s
adamc@100 94 else
adamc@100 95 let
adamc@100 96 val s' = {exp = IS.add (#exp s, n),
adamc@100 97 con = #con s}
adamc@100 98 in
adamc@100 99 case IM.find (edef, n) of
adamc@100 100 NONE => s'
adamc@100 101 | SOME (t, e) => shakeExp (shakeCon s' t) e
adamc@100 102 end
adamc@100 103 | _ => s
adamc@23 104
adamc@100 105 and shakeExp s = U.Exp.fold {kind = kind, con = con, exp = exp} s
adamc@100 106
adamc@109 107 val s = {con = IS.empty, exp = IS.addList (IS.empty, page_es)}
adamc@109 108
adamc@109 109 val s = foldl (fn (n, s) =>
adamc@109 110 case IM.find (edef, n) of
adamc@109 111 NONE => raise Fail "Shake: Couldn't find 'val'"
adamc@109 112 | SOME (t, e) => shakeExp (shakeCon s t) e) s page_es
adamc@248 113
adamc@248 114 val s = foldl (fn (c, s) => shakeCon s c) s table_cs
adamc@100 115 in
adamc@100 116 List.filter (fn (DCon (_, n, _, _), _) => IS.member (#con s, n)
adamc@192 117 | (DDatatype (_, n, _, _), _) => IS.member (#con s, n)
adamc@109 118 | (DVal (_, n, _, _, _), _) => IS.member (#exp s, n)
adamc@125 119 | (DValRec vis, _) => List.exists (fn (_, n, _, _, _) => IS.member (#exp s, n)) vis
adamc@247 120 | (DExport _, _) => true
adamc@271 121 | (DTable _, _) => true
adamc@338 122 | (DSequence _, _) => true
adamc@271 123 | (DDatabase _, _) => true) file
adamc@100 124 end
adamc@23 125
adamc@23 126 end