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"
35 typeNameNodeList typeNameNodeList_new ()
37 typeNameNodeList s = (typeNameNodeList) dmalloc (sizeof (*s));
40 s->nspace = typeNameNodeListBASESIZE;
41 s->elements = (typeNameNode *)
42 dmalloc (sizeof (*s->elements) * typeNameNodeListBASESIZE);
48 typeNameNodeList_grow (typeNameNodeList s)
51 typeNameNode *newelements;
53 s->nspace += typeNameNodeListBASESIZE;
55 newelements = (typeNameNode *) dmalloc (sizeof (*newelements)
56 * (s->nelements + s->nspace));
58 for (i = 0; i < s->nelements; i++)
60 newelements[i] = s->elements[i];
64 s->elements = newelements;
68 typeNameNodeList_add (typeNameNodeList s, typeNameNode el)
71 typeNameNodeList_grow (s);
74 s->elements[s->nelements] = el;
81 typeNameNodeList_unparse (typeNameNodeList s)
83 cstring st = cstring_undefined;
86 typeNameNodeList_elements (s, current)
90 st = typeNameNode_unparse (current);
95 st = message ("%q, %q", st, typeNameNode_unparse (current));
97 } end_typeNameNodeList_elements;
102 typeNameNodeList_free (typeNameNodeList s)
105 for (i = 0; i < s->nelements; i++)
107 typeNameNode_free (s->elements[i]);