Mercurial > urweb

comparison src/sigcheck.sml @ 1856:3683d1a8c1c8

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add Sigcheck phase to avoid issues with signatures in global initializers
author Adam Chlipala <adam@chlipala.net>
date Sat, 15 Jun 2013 08:18:47 -0400
parents
children 25874084bf1f
comparison
equal deleted inserted replaced
1855:0480b8f29a47 1856:3683d1a8c1c8
1 (* Copyright (c) 2013, Adam Chlipala
2 * All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
6 *
7 * - Redistributions of source code must retain the above copyright notice,
8 * this list of conditions and the following disclaimer.
9 * - Redistributions in binary form must reproduce the above copyright notice,
10 * this list of conditions and the following disclaimer in the documentation
11 * and/or other materials provided with the distribution.
12 * - The names of contributors may not be used to endorse or promote products
13 * derived from this software without specific prior written permission.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25 * POSSIBILITY OF SUCH DAMAGE.
26 *)
27
28 structure SigCheck :> SIG_CHECK = struct
29
30 open Mono
31
32 structure IS = IntBinarySet
33 structure E = ErrorMsg
34
35 fun check (ds, sl) =
36 let
37 fun isSiggy siggers =
38 MonoUtil.Decl.exists {typ = fn _ => false,
39 decl = fn _ => false,
40 exp = fn e =>
41 case e of
42 ERel n => IS.member (siggers, n)
43 | EFfiApp ("Basis", "sigString", _) => true
44 | _ => false}
45
46 fun sigify' sigdecs e =
47 case e of
48 ENamed n => if IS.member (sigdecs, n) then
49 (EApp ((e, E.dummySpan),
50 (ERecord [], E.dummySpan)))
51 else
52 e
53 | _ => e
54
55 fun sigify sigdecs =
56 MonoUtil.Decl.map {typ = fn x => x,
57 decl = fn d => d,
58 exp = sigify' sigdecs}
59
60 fun sigifyE sigdecs =
61 MonoUtil.Exp.map {typ = fn x => x,
62 exp = sigify' sigdecs}
63
64 fun isFun (e, _) =
65 case e of
66 EAbs _ => true
67 | _ => false
68
69 fun doDecl (d : decl, (siggers, sigdecs)) =
70 case #1 d of
71 DVal (x, n, t, e, s) =>
72 if isSiggy siggers d then
73 if isFun e then
74 (sigify sigdecs d, (IS.add (siggers, n), sigdecs))
75 else
76 ((DVal (x, n, (TFun ((TRecord [], #2 d), t), #2 d),
77 (EAbs ("_", (TRecord [], #2 d), t, sigifyE sigdecs e), #2 d),
78 s), #2 d),
79 (IS.add (siggers, n),
80 IS.add (sigdecs, n)))
81 else
82 (sigify sigdecs d, (siggers, sigdecs))
83 | DValRec vis =>
84 if isSiggy siggers d then
85 (sigify sigdecs d,
86 (foldl IS.add' siggers (map #2 vis),
87 sigdecs))
88 else
89 (sigify sigdecs d, (siggers, sigdecs))
90 | _ => (sigify sigdecs d, (siggers, sigdecs))
91
92 val (ds, _) = ListUtil.foldlMap doDecl (IS.empty, IS.empty) ds
93 in
94 (ds, sl)
95 end
96
97 end