Various minor fixes for compiler/linter (other then splint itself) warnings.
[splint-patched.git] / src / replaceNodeList.c
blobf6642ebb73f37f8e2f08e171c847323c13e5b4f6
1 /*
2 ** Splint - annotation-assisted static program checker
3 ** Copyright (C) 1994-2003 University of Virginia,
4 ** Massachusetts Institute of Technology
5 **
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.
10 **
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.
15 **
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
25 ** replaceNodeList.c
27 ** based on list_template.c
29 ** where T has T_equal (or change this) and T_unparse
32 # include "splintMacros.nf"
33 # include "basic.h"
35 /*@constant int replaceNodeListBASESIZE;@*/
36 # define replaceNodeListBASESIZE SMALLBASESIZE
38 /*@only@*/ replaceNodeList
39 replaceNodeList_new (void)
41 replaceNodeList s = (replaceNodeList) dmalloc (sizeof (*s));
43 s->nelements = 0;
44 s->nspace = replaceNodeListBASESIZE;
45 s->elements = (replaceNode *)
46 dmalloc (sizeof (*s->elements) * replaceNodeListBASESIZE);
48 return (s);
51 static void
52 replaceNodeList_grow (replaceNodeList s)
54 int i;
55 replaceNode *newelements;
57 s->nspace += replaceNodeListBASESIZE;
59 newelements = (replaceNode *) dmalloc (sizeof (*newelements)
60 * (s->nelements + s->nspace));
62 for (i = 0; i < s->nelements; i++)
64 newelements[i] = s->elements[i];
67 sfree (s->elements);
68 s->elements = newelements;
71 replaceNodeList
72 replaceNodeList_add (replaceNodeList s, replaceNode el)
74 if (s->nspace <= 0)
75 replaceNodeList_grow (s);
77 s->nspace--;
78 s->elements[s->nelements] = el;
79 s->nelements++;
81 return s;
84 # ifdef DEADCODE
85 /*@only@*/ cstring
86 replaceNodeList_unparse (replaceNodeList s)
88 bool first = TRUE;
89 cstring st = cstring_undefined;
91 replaceNodeList_elements (s, current)
93 if (first)
95 st = replaceNode_unparse (current);
96 first = FALSE;
98 else
100 st = message ("%q, %q", st, replaceNode_unparse (current));
102 } end_replaceNodeList_elements;
104 return st;
106 # endif /* DEADCODE */
108 void
109 replaceNodeList_free (replaceNodeList s)
111 int i;
112 for (i = 0; i < s->nelements; i++)
114 replaceNode_free (s->elements[i]);
117 sfree (s->elements);
118 sfree (s);