2 ** LCLint - annotation-assisted static program checker
3 ** Copyright (C) 1994-2000 University of Virginia,
4 ** Massachusetts Institute of Technology
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.
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.
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.
20 ** For information on lclint: lclint-request@cs.virginia.edu
21 ** To report a bug: lclint-bug@cs.virginia.edu
22 ** For more information: http://lclint.cs.virginia.edu
27 ** based on list_template.c
29 ** where T has T_equal (or change this) and T_unparse
32 # include "lclintMacros.nf"
35 constraintList constraintList_new ()
37 constraintList s = (constraintList) dmalloc (sizeof (*s));
40 s->nspace = constraintListBASESIZE;
41 s->elements = (constraint *)
42 dmalloc (sizeof (*s->elements) * constraintListBASESIZE);
48 constraintList_grow (constraintList s)
51 constraint *newelements;
53 s->nspace += constraintListBASESIZE;
54 newelements = (constraint *) dmalloc (sizeof (*newelements)
55 * (s->nelements + s->nspace));
57 for (i = 0; i < s->nelements; i++)
59 newelements[i] = s->elements[i];
63 s->elements = newelements;
66 /* void constraintList_exprNodemerge(void) */
70 constraintList_add (constraintList s, constraint el)
76 constraintList_grow (s);
79 s->elements[s->nelements] = el;
84 constraintList constraintList_addList (constraintList s, constraintList new)
89 if (new == constraintList_undefined)
92 constraintList_elements(new, elem)
94 s = constraintList_add (s, elem);
96 end_constraintList_elements
101 constraintList_print (constraintList s) /*@*/
104 cstring st = cstring_undefined;
107 if (s->nelements == 0)
108 st = cstring_makeLiteral("<List Empty>");
110 for (i = 0; i < s->nelements; i++)
112 cstring type = cstring_undefined;
113 constraint current = s->elements[i];
117 cstring temp1 = constraint_print(current);
118 type = message ("%q %q\n", type, temp1 );
128 st = message ("%q, %q", st, type);
134 void constraintList_printError (constraintList s, fileloc loc)
137 constraintList_elements (s, elem)
141 constraint_printError (elem, loc);
144 end_constraintList_elements;
149 constraintList_printDetailed (constraintList s)
152 cstring st = cstring_undefined;
155 if (s->nelements == 0)
156 st = cstring_makeLiteral("<List Empty>");
158 for (i = 0; i < s->nelements; i++)
160 cstring type = cstring_undefined;
161 constraint current = s->elements[i];
165 cstring temp1 = constraint_printDetailed (current);
166 type = message ("%s %s\n", type, temp1 );
176 st = message ("%s %s", st, type);
182 /*{ x: constraint | (x in l1 -> resolve (x, l2) || (x in l2 -> resolve (x, l1)
186 constraintList_logicalOr (constraintList l1, constraintList l2)
190 DPRINTF ( (message ("Logical of on %s and %s",
191 constraintList_print(l1),
192 constraintList_print(l2)) ) );
194 ret = constraintList_new();
195 constraintList_elements (l1, el)
197 temp = substitute (el, l2);
199 if (resolve (el, l2) || resolve(temp,l2) )
200 { /*avoid redundant constraints*/
201 if (!resolve (el, ret) )
202 ret = constraintList_add (ret, el);
205 end_constraintList_elements;
207 constraintList_elements (l2, el)
209 temp = substitute (el, l1);
211 if (resolve (el, l1) || resolve(temp,l1) )
213 /*avoid redundant constraints*/
214 if (!resolve (el, ret) )
215 ret = constraintList_add (ret, el);
218 end_constraintList_elements;
225 constraintList_free (constraintList s)
228 for (i = 0; i < s->nelements; i++)
230 // constraint_free (s->elements[i]);
238 constraintList_copy (constraintList s)
240 constraintList ret = constraintList_new ();
242 constraintList_elements (s, el)
244 ret = constraintList_add (ret, constraint_copy (el));
245 } end_constraintList_elements;
250 constraintList constraintList_preserveOrig (constraintList c)
252 constraintList_elements (c, el)
254 el = constraint_preserveOrig (el);
256 end_constraintList_elements;
260 constraintList constraintList_doFixResult (constraintList postconditions, exprNode fcnCall)
263 ret = constraintList_new();
264 constraintList_elements (postconditions, el)
266 ret = constraintList_add (ret, constraint_doFixResult (el, fcnCall) );
268 end_constraintList_elements;
273 constraintList constraintList_doSRefFixConstraintParam (constraintList preconditions, exprNodeList arglist)
276 ret = constraintList_new();
278 constraintList_elements (preconditions, el)
280 ret = constraintList_add(ret, constraint_doSRefFixConstraintParam (el, arglist) );
282 end_constraintList_elements;
286 constraintList constraintList_doSRefFixBaseParam (constraintList preconditions,
287 exprNodeList arglist)
290 ret = constraintList_new();
292 constraintList_elements (preconditions, el)
294 ret = constraintList_add(ret, constraint_doSRefFixBaseParam (el, arglist) );
296 end_constraintList_elements;
301 constraintList constraintList_togglePost (/*@returned@*/ constraintList c)
303 constraintList_elements (c, el)
305 el->post = !el->post;
307 end_constraintList_elements;