]>
Commit | Line | Data |
---|---|---|
28bf4b0b | 1 | /* |
11db3170 | 2 | ** Splint - annotation-assisted static program checker |
c59f5181 | 3 | ** Copyright (C) 1994-2003 University of Virginia, |
28bf4b0b | 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 |
28bf4b0b | 23 | */ |
24 | /* | |
25 | ** functionClauseList.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" |
28bf4b0b | 33 | # include "basic.h" |
28bf4b0b | 34 | |
35 | functionClauseList | |
36 | functionClauseList_new () | |
37 | { | |
38 | return functionClauseList_undefined; | |
39 | } | |
40 | ||
41 | static /*@notnull@*/ functionClauseList | |
42 | functionClauseList_newEmpty (void) | |
43 | { | |
44 | functionClauseList s = (functionClauseList) dmalloc (sizeof (*s)); | |
45 | ||
46 | s->nelements = 0; | |
47 | s->nspace = functionClauseListBASESIZE; | |
48 | s->elements = (functionClause *) dmalloc (sizeof (*s->elements) * functionClauseListBASESIZE); | |
49 | ||
50 | return (s); | |
51 | } | |
52 | ||
53 | static void | |
54 | functionClauseList_grow (/*@notnull@*/ functionClauseList s) | |
55 | { | |
56 | int i; | |
57 | functionClause *newelements; | |
58 | ||
59 | s->nspace += functionClauseListBASESIZE; | |
60 | ||
61 | newelements = (functionClause *) dmalloc (sizeof (*newelements) * (s->nelements + s->nspace)); | |
62 | ||
63 | if (newelements == (functionClause *) 0) | |
64 | { | |
65 | llfatalerror (cstring_makeLiteral ("functionClauseList_grow: out of memory!")); | |
66 | } | |
67 | ||
68 | for (i = 0; i < s->nelements; i++) | |
69 | { | |
70 | newelements[i] = s->elements[i]; | |
71 | } | |
72 | ||
73 | sfree (s->elements); | |
74 | s->elements = newelements; | |
75 | } | |
76 | ||
77 | functionClauseList functionClauseList_single (/*@keep@*/ functionClause el) | |
78 | { | |
79 | functionClauseList s = functionClauseList_new (); | |
80 | s = functionClauseList_add (s, el); | |
81 | return s; | |
82 | } | |
83 | ||
84 | functionClauseList functionClauseList_add (functionClauseList s, /*@keep@*/ functionClause el) | |
85 | { | |
86 | if (!functionClauseList_isDefined (s)) | |
87 | { | |
88 | s = functionClauseList_newEmpty (); | |
89 | } | |
90 | ||
91 | if (s->nspace <= 0) | |
92 | { | |
93 | functionClauseList_grow (s); | |
94 | } | |
95 | ||
96 | s->nspace--; | |
b73d1009 | 97 | s->elements[s->nelements] = el; |
28bf4b0b | 98 | s->nelements++; |
99 | ||
b73d1009 | 100 | return s; |
28bf4b0b | 101 | } |
102 | ||
103 | functionClauseList functionClauseList_prepend (functionClauseList s, /*@keep@*/ functionClause el) | |
104 | { | |
105 | int i; | |
106 | ||
107 | if (!functionClauseList_isDefined (s)) | |
108 | { | |
b73d1009 | 109 | return functionClauseList_single (el); |
28bf4b0b | 110 | } |
111 | ||
112 | if (s->nspace <= 0) | |
113 | { | |
114 | functionClauseList_grow (s); | |
115 | } | |
116 | ||
117 | s->nspace--; | |
118 | ||
119 | for (i = s->nelements; i > 0; i--) | |
120 | { | |
121 | s->elements[i] = s->elements [i - 1]; | |
122 | } | |
123 | ||
b73d1009 | 124 | s->elements[0] = el; |
28bf4b0b | 125 | s->nelements++; |
b73d1009 | 126 | |
127 | return s; | |
28bf4b0b | 128 | } |
129 | ||
130 | cstring | |
131 | functionClauseList_unparse (functionClauseList s) | |
132 | { | |
133 | return functionClauseList_unparseSep (s, cstring_makeLiteralTemp (" ")); | |
134 | } | |
135 | ||
136 | cstring | |
137 | functionClauseList_unparseSep (functionClauseList s, cstring sep) | |
138 | { | |
139 | cstring st = cstring_undefined; | |
140 | ||
141 | if (functionClauseList_isDefined (s)) | |
142 | { | |
143 | int i; | |
144 | ||
145 | for (i = 0; i < s->nelements; i++) | |
146 | { | |
147 | if (i == 0) | |
148 | { | |
149 | st = functionClause_unparse (s->elements[i]); | |
150 | } | |
151 | else | |
152 | st = message ("%q%s%q", st, sep, functionClause_unparse (s->elements[i])); | |
153 | } | |
154 | } | |
155 | ||
156 | return st; | |
157 | } | |
158 | ||
159 | void | |
160 | functionClauseList_free (functionClauseList s) | |
161 | { | |
162 | if (functionClauseList_isDefined (s)) | |
163 | { | |
164 | int i; | |
165 | ||
166 | for (i = 0; i < s->nelements; i++) { | |
167 | functionClause_free (s->elements[i]); | |
168 | } | |
169 | ||
170 | sfree (s->elements); | |
171 | sfree (s); | |
172 | } | |
173 | } | |
174 | ||
4287634e | 175 | functionClauseList |
176 | functionClauseList_setImplictConstraints (/*@returned@*/ functionClauseList s) | |
312c9815 | 177 | { |
4287634e | 178 | bool addedConstraints; |
179 | ||
180 | constraintList c; | |
181 | ||
182 | DPRINTF ((message ("functionClauseList_setImplictConstraints called ") )); | |
183 | ||
184 | addedConstraints = FALSE; | |
185 | ||
186 | ||
187 | c = getImplicitFcnConstraints (); | |
188 | ||
189 | if (constraintList_isEmpty(c) ) | |
190 | { | |
191 | return s; | |
192 | } | |
193 | ||
312c9815 | 194 | functionClauseList_elements(s, el) |
195 | { | |
c3be2604 | 196 | if (functionClause_isRequires(el)) |
312c9815 | 197 | { |
c3be2604 | 198 | functionConstraint con = functionClause_getRequires(el); |
199 | ||
200 | if (functionConstraint_hasBufferConstraint(con)) | |
312c9815 | 201 | { |
c3be2604 | 202 | if (functionConstraint_isBufferConstraint (con)) |
312c9815 | 203 | { |
204 | constraintList implCons = getImplicitFcnConstraints (); | |
312c9815 | 205 | |
c3be2604 | 206 | DPRINTF ((message ("functionClauseList_ImplictConstraints adding the implict constraints: %s to %s", |
4287634e | 207 | constraintList_print(implCons), constraintList_print (con->constraint.buffer)))); |
312c9815 | 208 | |
4287634e | 209 | functionConstraint_addBufferConstraints (con, constraintList_copy (implCons) ); |
210 | ||
211 | addedConstraints = TRUE; | |
c3be2604 | 212 | |
213 | DPRINTF ((message ("functionClauseList_ImplictConstraints the new constraint is %s", | |
214 | functionConstraint_unparse (con)))); | |
4287634e | 215 | |
312c9815 | 216 | } |
217 | else | |
218 | { | |
c3be2604 | 219 | llassert (FALSE); |
312c9815 | 220 | } |
221 | } | |
222 | } | |
223 | } | |
c3be2604 | 224 | |
4287634e | 225 | end_functionClauseList_elements; |
226 | ||
227 | if (!addedConstraints) | |
228 | { | |
229 | functionConstraint fCon; | |
230 | functionClause fClause; | |
231 | ||
232 | constraintList implCons = getImplicitFcnConstraints (); | |
233 | ||
234 | fCon = functionConstraint_createBufferConstraint(constraintList_copy (implCons) ); | |
235 | fClause = functionClause_createRequires(fCon); | |
236 | s = functionClauseList_add(s, fClause); | |
237 | ||
238 | ||
239 | } | |
240 | return s; | |
312c9815 | 241 | } |