2 ** Splint - annotation-assisted static program checker
3 ** Copyright (C) 1994-2002 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: splint@cs.virginia.edu
21 ** To report a bug: splint-bug@cs.virginia.edu
22 ** For more information: http://www.splint.org
27 ** based on list_template.c
29 ** where T has T_equal (or change this) and T_unparse
32 # include "splintMacros.nf"
38 sortList s = (sortList) dmalloc (sizeof (*s));
41 s->nspace = sortListBASESIZE;
42 s->elements = (sort *) dmalloc (sizeof (*s->elements) * sortListBASESIZE);
49 sortList_grow (sortList s)
54 s->nspace += sortListBASESIZE;
56 newelements = (sort *) dmalloc (sizeof (*newelements) * (s->nelements + s->nspace));
58 if (newelements == (sort *) 0)
60 llfatalerror (cstring_makeLiteral ("sortList_grow: out of memory!"));
63 for (i = 0; i < s->nelements; i++)
65 newelements[i] = s->elements[i];
69 s->elements = newelements;
73 sortList_addh (sortList s, sort el)
79 s->elements[s->nelements] = el;
84 sortList_reset (sortList s)
90 sortList_advance (sortList s)
93 llassert (s->current < s->nelements);
97 sortList_current (sortList s)
99 if (s->current < 0 || s->current >= s->nelements)
101 llbug (message ("sortList_current: current out of range: %d (size: %d)",
102 s->current, s->nelements));
104 return (s->elements[s->current]);
108 sortList_unparse (sortList s)
111 cstring st = cstring_undefined;
113 for (i = 0; i < s->nelements; i++)
117 st = cstring_copy (sort_unparseName (s->elements[i])); /* !!! NEED COPY HERE !!! */
121 st = message ("%q, %s", st, sort_unparseName (s->elements[i]));
129 sortList_free (sortList s)
132 for (i = 0; i < s->nelements; i++)
134 /* sort_free (s->elements[i]); */
137 sfree (s->elements); /* not quite!!! */