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: info@splint.org
21 ** To report a bug: splint-bug@splint.org
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 /*@only@*/ pairNodeList
38 pairNodeList s = (pairNodeList) dmalloc (sizeof (*s));
41 s->nspace = pairNodeListBASESIZE;
42 s->elements = (pairNode *)
43 dmalloc (sizeof (*s->elements) * pairNodeListBASESIZE);
49 pairNodeList_grow (/*@notnull@*/ pairNodeList s)
52 pairNode *newelements;
54 s->nspace += pairNodeListBASESIZE;
55 newelements = (pairNode *) 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 pairNodeList_addh (pairNodeList s, pairNode el)
70 llassert (pairNodeList_isDefined (s));
71 llassert (pairNodeListBASESIZE > 0);
74 pairNodeList_grow (s);
77 s->elements[s->nelements] = el;
82 pairNodeList_unparse (pairNodeList s)
84 cstring st = cstring_undefined;
86 if (s != (pairNodeList)0)
88 pairNodeList_elements (s, current)
92 st = message ("%q%s %s; ", st,
93 sort_unparseName (current->sort),
94 ltoken_getRawString (current->tok));
96 } end_pairNodeList_elements;
103 pairNodeList_free (/*@only@*/ pairNodeList s)
105 if (pairNodeList_isDefined (s))
108 for (i = 0; i < s->nelements; i++)
110 pairNode_free (s->elements[i]);