Mercurial > urweb

comparison src/pathcheck.sml @ 377:78358e5df273

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Proper generation of relation names; checking that sequences exist
author Adam Chlipala <adamc@hcoop.net>
date Sun, 19 Oct 2008 12:12:59 -0400
parents
children 56aaa1941dad
comparison
equal deleted inserted replaced
376:6fd102fa28f9 377:78358e5df273
1 (* Copyright (c) 2008, 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 PathCheck :> PATH_CHECK = struct
29
30 open Mono
31
32 structure E = ErrorMsg
33
34 structure SS = BinarySetFn(struct
35 type ord_key = string
36 val compare = String.compare
37 end)
38
39 fun checkDecl ((d, loc), (funcs, rels)) =
40 let
41 fun doRel s =
42 (if SS.member (rels, s) then
43 E.errorAt loc ("Duplicate table/sequence path " ^ s)
44 else
45 ();
46 (funcs, SS.add (rels, s)))
47 in
48 case d of
49 DExport (_, s, _, _) =>
50 (if SS.member (funcs, s) then
51 E.errorAt loc ("Duplicate function path " ^ s)
52 else
53 ();
54 (SS.add (funcs, s), rels))
55
56 | DTable (s, _) => doRel s
57 | DSequence s => doRel s
58
59 | _ => (funcs, rels)
60 end
61
62 fun check ds = ignore (foldl checkDecl (SS.empty, SS.empty) ds)
63
64 end