Mercurial > urweb

annotate src/shake.sml @ 494:1bbcc3345d12

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Map distributivity rule in hnormCon
author Adam Chlipala <adamc@hcoop.net>
date Tue, 11 Nov 2008 19:58:25 -0500
parents 5c9606deacb6
children 0dd40b6bfdf3
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@453 58 | ((DVal (_, n, t, e, _), _), (cdef, edef)) => (cdef, IM.insert (edef, n, ([], t, e)))
adamc@125 59 | ((DValRec vis, _), (cdef, edef)) =>
adamc@453 60 let
adamc@453 61 val all_ns = map (fn (_, n, _, _, _) => n) vis
adamc@453 62 in
adamc@453 63 (cdef, foldl (fn ((_, n, t, e, _), edef) =>
adamc@453 64 IM.insert (edef, n, (all_ns, t, e))) edef vis)
adamc@453 65 end
adamc@247 66 | ((DExport _, _), acc) => acc
adamc@247 67 | ((DTable (_, n, c, _), _), (cdef, edef)) =>
adamc@453 68 (cdef, IM.insert (edef, n, ([], c, dummye)))
adamc@338 69 | ((DSequence (_, n, _), _), (cdef, edef)) =>
adamc@453 70 (cdef, IM.insert (edef, n, ([], dummyt, dummye)))
adamc@461 71 | ((DDatabase _, _), acc) => acc
adamc@461 72 | ((DCookie (_, n, c, _), _), (cdef, edef)) =>
adamc@461 73 (cdef, IM.insert (edef, n, ([], c, dummye))))
adamc@100 74 (IM.empty, IM.empty) file
adamc@23 75
adamc@100 76 fun kind (_, s) = s
adamc@23 77
adamc@100 78 fun con (c, s) =
adamc@100 79 case c of
adamc@100 80 CNamed n =>
adamc@100 81 if IS.member (#con s, n) then
adamc@100 82 s
adamc@100 83 else
adamc@100 84 let
adamc@100 85 val s' = {con = IS.add (#con s, n),
adamc@100 86 exp = #exp s}
adamc@100 87 in
adamc@100 88 case IM.find (cdef, n) of
adamc@100 89 NONE => s'
adamc@163 90 | SOME cs => foldl (fn (c, s') => shakeCon s' c) s' cs
adamc@100 91 end
adamc@100 92 | _ => s
adamc@23 93
adamc@100 94 and shakeCon s = U.Con.fold {kind = kind, con = con} s
adamc@23 95
adamc@100 96 fun exp (e, s) =
adamc@100 97 case e of
adamc@100 98 ENamed n =>
adamc@100 99 if IS.member (#exp s, n) then
adamc@100 100 s
adamc@100 101 else
adamc@100 102 let
adamc@100 103 val s' = {exp = IS.add (#exp s, n),
adamc@100 104 con = #con s}
adamc@100 105 in
adamc@453 106 (*print ("Need " ^ Int.toString n ^ "\n");*)
adamc@100 107 case IM.find (edef, n) of
adamc@100 108 NONE => s'
adamc@453 109 | SOME (ns, t, e) =>
adamc@453 110 let
adamc@453 111 val s' = shakeExp (shakeCon s' t) e
adamc@453 112 in
adamc@453 113 foldl (fn (n, s') => exp (ENamed n, s')) s' ns
adamc@453 114 end
adamc@100 115 end
adamc@100 116 | _ => s
adamc@23 117
adamc@100 118 and shakeExp s = U.Exp.fold {kind = kind, con = con, exp = exp} s
adamc@100 119
adamc@109 120 val s = {con = IS.empty, exp = IS.addList (IS.empty, page_es)}
adamc@109 121
adamc@109 122 val s = foldl (fn (n, s) =>
adamc@109 123 case IM.find (edef, n) of
adamc@109 124 NONE => raise Fail "Shake: Couldn't find 'val'"
adamc@453 125 | SOME (ns, t, e) =>
adamc@453 126 let
adamc@453 127 val s = shakeExp (shakeCon s t) e
adamc@453 128 in
adamc@453 129 foldl (fn (n, s) => exp (ENamed n, s)) s ns
adamc@453 130 end) s page_es
adamc@248 131
adamc@248 132 val s = foldl (fn (c, s) => shakeCon s c) s table_cs
adamc@100 133 in
adamc@100 134 List.filter (fn (DCon (_, n, _, _), _) => IS.member (#con s, n)
adamc@192 135 | (DDatatype (_, n, _, _), _) => IS.member (#con s, n)
adamc@109 136 | (DVal (_, n, _, _, _), _) => IS.member (#exp s, n)
adamc@125 137 | (DValRec vis, _) => List.exists (fn (_, n, _, _, _) => IS.member (#exp s, n)) vis
adamc@247 138 | (DExport _, _) => true
adamc@271 139 | (DTable _, _) => true
adamc@338 140 | (DSequence _, _) => true
adamc@461 141 | (DDatabase _, _) => true
adamc@461 142 | (DCookie _, _) => true) file
adamc@100 143 end
adamc@23 144
adamc@23 145 end