2 ** Splint - annotation-assisted static program checker
3 ** Copyright (C) 1994-2003 University of Virginia,
4 ** Massachusetts Institute of Technology
6 ** This program is free software; you can redistribute it and/or modify it
7 ** under the terms of the GNU General Public License as published by the
8 ** Free Software Foundation; either version 2 of the License, or (at your
9 ** option) any later version.
11 ** This program is distributed in the hope that it will be useful, but
12 ** WITHOUT ANY WARRANTY; without even the implied warranty of
13 ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 ** General Public License for more details.
16 ** The GNU General Public License is available from http://www.gnu.org/ or
17 ** the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
18 ** MA 02111-1307, USA.
20 ** For information on splint: info@splint.org
21 ** To report a bug: splint-bug@splint.org
22 ** For more information: http://www.splint.org
27 ** based on set_template.c
29 ** where T has T_equal (or change this) and T_unparse
32 # include "splintMacros.nf"
35 sortSet sortSet_new ()
37 sortSet s = (sortSet) dmalloc (sizeof (*s));
40 s->nspace = sortSetBASESIZE;
41 s->elements = (sort *) dmalloc (sizeof (*s->elements) * sortSetBASESIZE);
46 static /*@notnull@*/ sortSet
47 sortSet_predict (int size)
49 sortSet s = (sortSet) dmalloc (sizeof (*s));
56 s->elements = (sort *) dmalloc (sizeof (*s->elements) * size);
68 sortSet_grow (/*@notnull@*/ sortSet s)
73 s->nspace = sortSetBASESIZE;
74 newelements = (sort *) dmalloc (sizeof (*newelements) * (s->entries + s->nspace));
76 if (newelements == (sort *) 0)
78 llfatalerror (cstring_makeLiteral ("sortSet_grow: out of memory!"));
81 for (i = 0; i < s->entries; i++)
83 newelements[i] = s->elements[i];
87 s->elements = newelements;
91 ** Ensures: if *e \in *s
92 ** then unchanged (*s) & result = false
93 ** else *s' = insert (*s, *e) & result = true
98 sortSet_insert (sortSet s, sort el)
100 llassert (sortSet_isDefined (s));
102 if (sortSet_member (s, el))
111 s->elements[s->entries] = el;
118 sortSet_choose (sortSet s)
120 llassert (sortSet_isDefined (s) && s->entries > 0);
121 return (s->elements[0]);
125 sortSet_member (sortSet s, sort el)
127 if (sortSet_isDefined (s))
131 for (i = 0; i < s->entries; i++)
133 if (sort_equal (el, s->elements[i]))
144 sortSet_unparse (sortSet s)
146 return (message ("{ %q }", sortSet_unparseClean (s)));
150 sortSet_unparseClean (sortSet s)
152 cstring st = cstring_undefined;
154 if (sortSet_isDefined (s))
158 for (i = 0; i < s->entries; i++)
162 st = message ("%q%s", st, sort_unparseName (s->elements[i]));
166 st = message ("%q, %s", st, sort_unparseName (s->elements[i]));
175 sortSet_unparseOr (sortSet s)
177 cstring st = cstring_undefined;
179 if (sortSet_isDefined (s))
182 int last = s->entries - 1;
184 for (i = 0; i < s->entries; i++)
188 st = cstring_concatFree (st, sort_unparse (s->elements[i]));
194 /* was sort_unparse ??? */
195 st = message ("%q or %q", st, sort_unparse (s->elements[i]));
199 st = message ("%q, %q", st, sort_unparse (s->elements[i]));
209 sortSet_free (sortSet s)
211 if (sortSet_isDefined (s))
219 sortSet_copy (sortSet s)
221 sortSet t = sortSet_predict (sortSet_size (s));
224 if (sortSet_isDefined (s))
226 for (i = 0; i < sortSet_size (s); i++)
228 (void) sortSet_insert (t, s->elements[i]);