]>
Commit | Line | Data |
---|---|---|
616915dd | 1 | /* |
11db3170 | 2 | ** Splint - annotation-assisted static program checker |
77d37419 | 3 | ** Copyright (C) 1994-2002 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 | ** clauseStack.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 "basic.h" |
34 | ||
35 | clauseStack | |
36 | clauseStack_new () | |
37 | { | |
38 | clauseStack s = (clauseStack) dmalloc (sizeof (*s)); | |
39 | ||
40 | s->nelements = 0; | |
41 | s->nspace = clauseStackBASESIZE; | |
42 | s->elements = (clause *) dmalloc (sizeof (*s->elements) * clauseStackBASESIZE); | |
43 | s->current = 0; | |
44 | ||
45 | return (s); | |
46 | } | |
47 | ||
48 | static void | |
49 | clauseStack_grow (clauseStack s) | |
50 | { | |
51 | int i; | |
52 | clause *newelements; | |
53 | ||
54 | s->nspace += clauseStackBASESIZE; | |
55 | ||
56 | newelements = (clause *) dmalloc (sizeof (*newelements) | |
57 | * (s->nelements + s->nspace)); | |
58 | ||
59 | if (newelements == (clause *) 0) | |
60 | { | |
61 | llfatalerror (cstring_makeLiteral ("clauseStack_grow: out of memory!")); | |
62 | } | |
63 | ||
64 | for (i = 0; i < s->nelements; i++) | |
65 | { | |
66 | newelements[i] = s->elements[i]; | |
67 | } | |
68 | ||
69 | sfree (s->elements); | |
70 | s->elements = newelements; | |
71 | } | |
72 | ||
73 | void clauseStack_push (clauseStack s, clause el) | |
74 | { | |
75 | if (s->nspace <= 0) | |
76 | clauseStack_grow (s); | |
77 | ||
78 | s->nspace--; | |
79 | s->elements[s->nelements] = el; | |
80 | s->nelements++; | |
81 | } | |
82 | ||
83 | void clauseStack_pop (clauseStack s) | |
84 | { | |
85 | s->nelements--; | |
86 | s->nspace++; | |
87 | } | |
88 | ||
89 | clause clauseStack_top (clauseStack s) | |
90 | { | |
91 | return (s->elements[s->nelements - 1]); | |
92 | } | |
93 | ||
94 | void clauseStack_switchTop (clauseStack s, clause x) | |
95 | { | |
96 | llassert (s->nelements > 0); | |
97 | ||
98 | s->elements[s->nelements - 1] = x; | |
99 | } | |
100 | ||
101 | void | |
102 | clauseStack_removeFirst (clauseStack s, clause key) | |
103 | { | |
104 | if (clauseStack_top (s) == key) | |
105 | { | |
106 | clauseStack_pop (s); | |
107 | } | |
108 | else | |
109 | { | |
110 | int i; | |
111 | ||
112 | for (i = s->nelements - 2; i >= 0; i--) | |
113 | { | |
114 | clause el = s->elements[i]; | |
115 | ||
116 | if (el == key) | |
117 | { | |
118 | int j; | |
119 | ||
120 | for (j = i; j < s->nelements - 1; j++) | |
121 | { | |
122 | s->elements[j] = s->elements[j + 1]; | |
123 | } | |
124 | ||
125 | s->nelements--; | |
126 | s->nspace++; | |
127 | return; | |
128 | } | |
129 | } | |
130 | ||
131 | llbuglit ("clauseStack_removeFirst: not found"); | |
132 | } | |
133 | } | |
134 | ||
135 | int | |
136 | clauseStack_controlDepth (clauseStack s) | |
137 | { | |
138 | int depth = 0; | |
139 | int i; | |
140 | ||
141 | for (i = 0; i < s->nelements; i++) | |
142 | { | |
143 | clause current = s->elements[i]; | |
144 | ||
145 | if (clause_isConditional (current)) | |
146 | { | |
147 | depth++; | |
148 | } | |
149 | } | |
150 | ||
151 | return depth; | |
152 | } | |
153 | ||
154 | cstring | |
155 | clauseStack_unparse (clauseStack s) | |
156 | { | |
157 | int i; | |
158 | cstring st = cstring_makeLiteral ("["); | |
159 | ||
160 | for (i = 0; i < s->nelements; i++) | |
161 | { | |
162 | if (i == 0) | |
163 | { | |
164 | st = message ("%q %s", st, clause_unparse (s->elements[i])); | |
165 | } | |
166 | else | |
167 | st = message ("%q, %s", st, clause_unparse (s->elements[i])); | |
168 | } | |
169 | ||
170 | st = message ("%q ]", st); | |
171 | return st; | |
172 | } | |
173 | ||
174 | void | |
175 | clauseStack_clear (clauseStack s) | |
176 | { | |
177 | s->nspace += s->nelements; | |
178 | s->nelements = 0; | |
179 | } | |
180 | ||
181 | void | |
182 | clauseStack_free (clauseStack s) | |
183 | { | |
184 | sfree (s->elements); | |
185 | sfree (s); | |
186 | } |