]>
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 | ** varNodeList.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" |
616915dd | 33 | # include "llbasic.h" |
34 | ||
35 | varNodeList varNodeList_new () | |
36 | { | |
37 | varNodeList s = (varNodeList) dmalloc (sizeof (*s)); | |
38 | ||
39 | s->nelements = 0; | |
40 | s->nspace = varNodeListBASESIZE; | |
41 | s->elements = (varNode *) | |
42 | dmalloc (sizeof (*s->elements) * varNodeListBASESIZE); | |
43 | ||
44 | return (s); | |
45 | } | |
46 | ||
47 | static void | |
48 | varNodeList_grow (varNodeList s) | |
49 | { | |
50 | int i; | |
51 | varNode *newelements; | |
52 | ||
53 | s->nspace += varNodeListBASESIZE; | |
54 | newelements = (varNode *) dmalloc (sizeof (*newelements) | |
55 | * (s->nelements + s->nspace)); | |
56 | ||
57 | for (i = 0; i < s->nelements; i++) | |
58 | { | |
59 | newelements[i] = s->elements[i]; | |
60 | } | |
61 | ||
62 | sfree (s->elements); | |
63 | s->elements = newelements; | |
64 | } | |
65 | ||
66 | varNodeList | |
67 | varNodeList_add (varNodeList s, varNode el) | |
68 | { | |
69 | if (s->nspace <= 0) | |
70 | varNodeList_grow (s); | |
71 | ||
72 | s->nspace--; | |
73 | s->elements[s->nelements] = el; | |
74 | s->nelements++; | |
75 | return s; | |
76 | } | |
77 | ||
78 | cstring | |
79 | varNodeList_unparse (varNodeList s) | |
80 | { | |
81 | int i; | |
82 | cstring st = cstring_undefined; | |
83 | bool first = TRUE; | |
84 | ||
85 | for (i = 0; i < s->nelements; i++) | |
86 | { | |
87 | cstring type = cstring_undefined; | |
88 | varNode current = s->elements[i]; | |
89 | ||
90 | if (current->isObj) | |
91 | { | |
92 | type = cstring_makeLiteral ("obj "); | |
93 | } | |
94 | ||
95 | if (current->type != NULL) | |
96 | { | |
97 | type = message (": %q%q", type, lclTypeSpecNode_unparse (current->type)); | |
98 | } | |
99 | ||
100 | if (first) | |
101 | { | |
102 | st = type; | |
103 | first = FALSE; | |
104 | } | |
105 | else | |
106 | { | |
107 | st = message ("%q, %q", st, type); | |
108 | } | |
109 | } | |
110 | ||
111 | return st; | |
112 | } | |
113 | ||
114 | void | |
115 | varNodeList_free (varNodeList s) | |
116 | { | |
117 | int i; | |
118 | for (i = 0; i < s->nelements; i++) | |
119 | { | |
120 | varNode_free (s->elements[i]); | |
121 | } | |
122 | ||
123 | sfree (s->elements); | |
124 | sfree (s); | |
125 | } | |
126 | ||
127 | varNodeList | |
128 | varNodeList_copy (varNodeList s) | |
129 | { | |
130 | varNodeList ret = varNodeList_new (); | |
131 | ||
132 | varNodeList_elements (s, el) | |
133 | { | |
134 | ret = varNodeList_add (ret, varNode_copy (el)); | |
135 | } end_varNodeList_elements; | |
136 | ||
137 | return ret; | |
138 | } |