1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
|
/*-----------------------------------------------------------------------
File : ccl_clausepos_tree.c
Author: Stephan Schulz (schulz@eprover.org)
Contents
A tree-based mapping mapping clauses to sets of compact positions.
Copyright 2010 by the author.
This code is released under the GNU General Public Licence and
the GNU Lesser General Public License.
See the file COPYING in the main E directory for details..
Run "eprover -h" for contact information.
Changes
<1> Wed Apr 14 09:27:17 CEST 2010
New
-----------------------------------------------------------------------*/
#include "ccl_clausepos_tree.h"
/*---------------------------------------------------------------------*/
/* Global Variables */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Forward Declarations */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Internal Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: clause_tpos_free_wrapper()
//
// Wrapper of type ObjFreeFun.
//
// Global Variables: -
//
// Side Effects : Via ClauseTPosFree()
//
/----------------------------------------------------------------------*/
static void clause_tpos_free_wrapper(void *junk)
{
ClauseTPosFree(junk);
}
/*---------------------------------------------------------------------*/
/* Exported Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: ClauseTPosAlloc()
//
// Allocate a ClauseTPosCell for clause clause.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
ClauseTPos_p ClauseTPosAlloc(Clause_p clause)
{
ClauseTPos_p handle = ClauseTPosCellAlloc();
handle->clause = clause;
handle->pos = NULL;
return handle;
}
/*-----------------------------------------------------------------------
//
// Function: ClauseTPosFree()
//
// Free a ClauseTPosCell, including the position tree, but not the
// clause.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
void ClauseTPosFree(ClauseTPos_p soc)
{
NumTreeFree(soc->pos);
ClauseTPosCellFree(soc);
}
/*-----------------------------------------------------------------------
//
// Function: ClauseTPosTreeFree()
//
// Free a ClauseTPOS-Tree.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
void ClauseTPosTreeFree(ClauseTPosTree_p tree)
{
PObjTreeFree(tree, clause_tpos_free_wrapper);
}
/*-----------------------------------------------------------------------
//
// Function: CmpClauseTPosCells()
//
// Compare two ClauseTPos cells via their clausepointers.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
int CmpClauseTPosCells(const void *soc1, const void *soc2)
{
const ClauseTPos_p c1 = (const ClauseTPos_p) soc1;
const ClauseTPos_p c2 = (const ClauseTPos_p) soc2;
return PCmp(c1->clause, c2->clause);
}
/*-----------------------------------------------------------------------
//
// Function: ClauseTPosTreeFreeWrapper()
//
// Free a subterm tree, with proper signature for FPIndexFree().
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
void ClauseTPosTreeFreeWrapper(void *junk)
{
ClauseTPosTreeFree(junk);
}
/*-----------------------------------------------------------------------
//
// Function: ClauseTPosTreeInsertPos()
//
// Add a clause->pos association to the tree.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
void ClauseTPosTreeInsertPos(ClauseTPosTree_p *tree, Clause_p clause,
CompactPos pos)
{
ClauseTPos_p old, newnode = ClauseTPosAlloc(clause);
IntOrP dummy;
dummy.i_val = 0;
old = PTreeObjStore(tree, newnode, CmpClauseTPosCells);
if(old)
{
ClauseTPosFree(newnode);
newnode = old;
}
NumTreeStore(&(newnode->pos), pos, dummy, dummy);
}
/*-----------------------------------------------------------------------
//
// Function: ClauseTPosTreeDeletePos()
//
// Delete a clause->pos association (and the clause, if there is no
// remaining position).
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
void ClauseTPosTreeDeletePos(ClauseTPosTree_p *tree , Clause_p clause,
CompactPos pos)
{
ClauseTPos_p found, key = ClauseTPosAlloc(clause);
PObjTree_p cell;
cell = PTreeObjFind(tree, key, CmpClauseTPosCells);
ClauseTPosFree(key);
if(cell)
{
found = cell->key;
NumTreeDeleteEntry(&(found->pos), pos);
if(!found->pos)
{
found = PTreeObjExtractObject(tree, found,
CmpClauseTPosCells);
ClauseTPosFree(found);
}
}
}
/*-----------------------------------------------------------------------
//
// Function: ClauseTPosTreeDeleteClause()
//
// Delete all associations clause->pos for any pos from the tree.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
void ClauseTPosTreeDeleteClause(ClauseTPosTree_p *tree, Clause_p clause)
{
ClauseTPos_p found, key = ClauseTPosAlloc(clause);
found = PTreeObjExtractObject(tree, key, CmpClauseTPosCells);
ClauseTPosFree(key);
if(found)
{
ClauseTPosFree(found);
}
}
/*-----------------------------------------------------------------------
//
// Function: ClauseTPosTreePrint()
//
// Print a ClauseTposTree (mostly for debuging).
//
// Global Variables: -
//
// Side Effects : Output, temp memory operations
//
/----------------------------------------------------------------------*/
void ClauseTPosTreePrint(FILE* out, ClauseTPos_p tree)
{
fprintf(out, "OLs: ");
ClausePrint(out, tree->clause, true);
fprintf(out, "\nocc: ");
NumTreeDebugPrint(out, tree->pos, true);
fprintf(out, "\n");
}
/*---------------------------------------------------------------------*/
/* End of File */
/*---------------------------------------------------------------------*/
|
