]>
Commit | Line | Data |
---|---|---|
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 | ** declaratorInvNodeList.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 | declaratorInvNodeList | |
36 | declaratorInvNodeList_new () | |
37 | { | |
38 | declaratorInvNodeList s = (declaratorInvNodeList) dmalloc (sizeof (*s)); | |
39 | ||
40 | s->nelements = 0; | |
41 | ||
42 | s->nspace = declaratorInvNodeListBASESIZE; | |
43 | s->elements = (declaratorInvNode *) | |
44 | dmalloc (sizeof (*s->elements) * declaratorInvNodeListBASESIZE); | |
45 | ||
46 | return (s); | |
47 | } | |
48 | ||
49 | static void | |
50 | declaratorInvNodeList_grow (declaratorInvNodeList s) | |
51 | { | |
52 | int i; | |
53 | declaratorInvNode *newelements; | |
54 | ||
55 | s->nspace = declaratorInvNodeListBASESIZE + s->nspace; | |
56 | ||
57 | newelements = (declaratorInvNode *) | |
58 | dmalloc (sizeof (*newelements) * (s->nelements + s->nspace)); | |
59 | ||
60 | if (newelements == (declaratorInvNode *) 0) | |
61 | { | |
62 | llfatalerror (cstring_makeLiteral ("declaratorInvNodeList_grow: out of memory!")); | |
63 | } | |
64 | ||
65 | for (i = 0; i < s->nelements; i++) | |
66 | { | |
67 | newelements[i] = s->elements[i]; | |
68 | } | |
69 | ||
70 | sfree (s->elements); | |
71 | s->elements = newelements; | |
72 | } | |
73 | ||
74 | declaratorInvNodeList | |
75 | declaratorInvNodeList_add (declaratorInvNodeList s, declaratorInvNode el) | |
76 | { | |
77 | if (s->nspace <= 0) | |
78 | { | |
79 | declaratorInvNodeList_grow (s); | |
80 | } | |
81 | ||
82 | s->nspace--; | |
83 | s->elements[s->nelements] = el; | |
84 | s->nelements++; | |
85 | ||
86 | return s; | |
87 | } | |
88 | ||
89 | /*@only@*/ cstring | |
90 | declaratorInvNodeList_unparse (declaratorInvNodeList s) | |
91 | { | |
92 | int i; | |
93 | cstring st = cstring_undefined; | |
94 | ||
95 | for (i = 0; i < s->nelements; i++) | |
96 | { | |
97 | st = message ("%q%q", st, declaratorInvNode_unparse (s->elements[i])); | |
98 | } | |
99 | ||
100 | return st; | |
101 | } | |
102 | ||
103 | void | |
104 | declaratorInvNodeList_free (declaratorInvNodeList s) | |
105 | { | |
106 | int i; | |
107 | for (i = 0; i < s->nelements; i++) | |
108 | { | |
109 | declaratorInvNode_free (s->elements[i]); | |
110 | } | |
111 | ||
112 | sfree (s->elements); | |
113 | sfree (s); | |
114 | } |