2 ** Splint - annotation-assisted static program checker
3 ** Copyright (C) 1994-2003 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 splint: info@splint.org
21 ** To report a bug: splint-bug@splint.org
22 ** For more information: http://www.splint.org
27 ** based on list_template.c
29 ** where T has T_equal (or change this) and T_unparse
32 # include "splintMacros.nf"
38 clauseStack s = (clauseStack) dmalloc (sizeof (*s));
41 s->nspace = clauseStackBASESIZE;
42 s->elements = (clause *) dmalloc (sizeof (*s->elements) * clauseStackBASESIZE);
49 clauseStack_grow (clauseStack s)
54 s->nspace += clauseStackBASESIZE;
56 newelements = (clause *) dmalloc (sizeof (*newelements)
57 * (s->nelements + s->nspace));
59 if (newelements == (clause *) 0)
61 llfatalerror (cstring_makeLiteral ("clauseStack_grow: out of memory!"));
64 for (i = 0; i < s->nelements; i++)
66 newelements[i] = s->elements[i];
70 s->elements = newelements;
73 void clauseStack_push (clauseStack s, clause el)
79 s->elements[s->nelements] = el;
83 void clauseStack_pop (clauseStack s)
89 clause clauseStack_top (clauseStack s)
91 return (s->elements[s->nelements - 1]);
94 void clauseStack_switchTop (clauseStack s, clause x)
96 llassert (s->nelements > 0);
98 s->elements[s->nelements - 1] = x;
102 clauseStack_removeFirst (clauseStack s, clause key)
104 if (clauseStack_top (s) == key)
112 for (i = s->nelements - 2; i >= 0; i--)
114 clause el = s->elements[i];
120 for (j = i; j < s->nelements - 1; j++)
122 s->elements[j] = s->elements[j + 1];
131 llbuglit ("clauseStack_removeFirst: not found");
136 clauseStack_controlDepth (clauseStack s)
141 for (i = 0; i < s->nelements; i++)
143 clause current = s->elements[i];
145 if (clause_isConditional (current))
155 clauseStack_unparse (clauseStack s)
158 cstring st = cstring_makeLiteral ("[");
160 for (i = 0; i < s->nelements; i++)
164 st = message ("%q %s", st, clause_unparse (s->elements[i]));
167 st = message ("%q, %s", st, clause_unparse (s->elements[i]));
170 st = message ("%q ]", st);
175 clauseStack_clear (clauseStack s)
177 s->nspace += s->nelements;
182 clauseStack_free (clauseStack s)