]> andersk Git - splint.git/blame - src/quantifierNodeList.c
Fixed all /*@i...@*/ tags (except 1).
[splint.git] / src / quantifierNodeList.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** quantifierNodeList.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
35/*@only@*/ quantifierNodeList
36quantifierNodeList_new ()
37{
38 quantifierNodeList s = (quantifierNodeList) dmalloc (sizeof (*s));
39
40 s->nelements = 0;
41 s->nspace = quantifierNodeListBASESIZE;
42 s->elements = (quantifierNode *)
43 dmalloc (sizeof (*s->elements) * quantifierNodeListBASESIZE);
44
45 return (s);
46}
47
48static void
49quantifierNodeList_grow (quantifierNodeList s)
50{
51 int i;
52 quantifierNode *newelements;
53
54 s->nspace += quantifierNodeListBASESIZE;
55
56 newelements = (quantifierNode *) dmalloc (sizeof (*newelements)
57 * (s->nelements + s->nspace));
58
59 for (i = 0; i < s->nelements; i++)
60 {
61 newelements[i] = s->elements[i];
62 }
63
64 sfree (s->elements);
65 s->elements = newelements;
66}
67
68quantifierNodeList
69quantifierNodeList_add (quantifierNodeList s, quantifierNode el)
70{
71 if (s->nspace <= 0)
72 quantifierNodeList_grow (s);
73
74 s->nspace--;
75 s->elements[s->nelements] = el;
76 s->nelements++;
77
78 return s;
79}
80
81/*@only@*/ quantifierNodeList
82quantifierNodeList_copy (quantifierNodeList s)
83{
84 quantifierNodeList r = quantifierNodeList_new ();
85
86 quantifierNodeList_elements (s, x)
87 {
88 r = quantifierNodeList_add (r, quantifierNode_copy (x));
89 } end_quantifierNodeList_elements;
90
91 return r;
92}
93
94/*@only@*/ cstring
95quantifierNodeList_unparse (quantifierNodeList s)
96{
97 cstring st = cstring_undefined;
98
99 quantifierNodeList_elements (s, current)
100 {
101 st = message ("%q%s %q",
102 st, ltoken_getRawString (current->quant),
103 varNodeList_unparse (current->vars));
104 } end_quantifierNodeList_elements;
105
106 return st;
107}
108
109void
110quantifierNodeList_free (quantifierNodeList s)
111{
112 int i;
113 for (i = 0; i < s->nelements; i++)
114 {
115 quantifierNode_free (s->elements[i]);
116 }
117
118 sfree (s->elements);
119 sfree (s);
120}
This page took 0.092724 seconds and 5 git commands to generate.