]> andersk Git - splint.git/blame - src/typeNameNodeList.c
Fixed all /*@i...@*/ tags (except 1).
[splint.git] / src / typeNameNodeList.c
CommitLineData
616915dd 1/*
11db3170 2** Splint - annotation-assisted static program checker
c59f5181 3** Copyright (C) 1994-2003 University of Virginia,
616915dd 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.
19**
155af98d 20** For information on splint: info@splint.org
21** To report a bug: splint-bug@splint.org
11db3170 22** For more information: http://www.splint.org
616915dd 23*/
24/*
25** typeNameNodeList.c
26**
27** based on list_template.c
28**
29** where T has T_equal (or change this) and T_unparse
30*/
31
1b8ae690 32# include "splintMacros.nf"
b73d1009 33# include "basic.h"
616915dd 34
35typeNameNodeList typeNameNodeList_new ()
36{
37 typeNameNodeList s = (typeNameNodeList) dmalloc (sizeof (*s));
38
39 s->nelements = 0;
40 s->nspace = typeNameNodeListBASESIZE;
41 s->elements = (typeNameNode *)
42 dmalloc (sizeof (*s->elements) * typeNameNodeListBASESIZE);
43
44 return (s);
45}
46
47static void
48typeNameNodeList_grow (typeNameNodeList s)
49{
50 int i;
51 typeNameNode *newelements;
52
53 s->nspace += typeNameNodeListBASESIZE;
54
55 newelements = (typeNameNode *) dmalloc (sizeof (*newelements)
56 * (s->nelements + s->nspace));
57
58 for (i = 0; i < s->nelements; i++)
59 {
60 newelements[i] = s->elements[i];
61 }
62
63 sfree (s->elements);
64 s->elements = newelements;
65}
66
67typeNameNodeList
68typeNameNodeList_add (typeNameNodeList s, typeNameNode el)
69{
70 if (s->nspace <= 0)
71 typeNameNodeList_grow (s);
72
73 s->nspace--;
74 s->elements[s->nelements] = el;
75 s->nelements++;
76
77 return s;
78}
79
80/*@only@*/ cstring
81typeNameNodeList_unparse (typeNameNodeList s)
82{
83 cstring st = cstring_undefined;
84 bool first = TRUE;
85
86 typeNameNodeList_elements (s, current)
87 {
88 if (first)
89 {
90 st = typeNameNode_unparse (current);
91 first = FALSE;
92 }
93 else
94 {
95 st = message ("%q, %q", st, typeNameNode_unparse (current));
96 }
97 } end_typeNameNodeList_elements;
98 return (st);
99}
100
101void
102typeNameNodeList_free (typeNameNodeList s)
103{
104 int i;
105 for (i = 0; i < s->nelements; i++)
106 {
107 typeNameNode_free (s->elements[i]);
108 }
109
110 sfree (s->elements);
111 sfree (s);
112}
This page took 0.133941 seconds and 5 git commands to generate.