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
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
|
/*-----------------------------------------------------------------------
File : ccl_subterm_index.c
Author: Stephan Schulz (schulz@eprover.org)
Contents
An index mapping subterms to occurrences in clauses.
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_subterm_index.h"
/*---------------------------------------------------------------------*/
/* Global Variables */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Forward Declarations */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Internal Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: term_collect_idx_subterms()
//
//
// Collect all non-variable subterms in term either into rest or
// full (rest for "restricted rewriting" terms, full for the "full
// rewriting" terms).
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
static long term_collect_idx_subterms(Term_p term, PTree_p *rest,
PTree_p *full, bool restricted)
{
long res = 0;
int i;
PTree_p *tree;
if(TermIsVar(term))
{
return 0;
}
tree = restricted?rest:full;
if(PTreeStore(tree, term))
{
res++;
}
for(i=0; i<term->arity; i++)
{
res += term_collect_idx_subterms(term->args[i], rest, full, false);
}
return res;
}
/*-----------------------------------------------------------------------
//
// Function: eqn_collect_idx_subterms()
//
// Collect all non-variable subterms in eqn either into rest or
// full (rest for "restricted rewriting" terms, full for the "full
// rewriting" terms).
//
// Global Variables: -
//
// Side Effects : Via term_collect_idx_subterms()
//
/----------------------------------------------------------------------*/
static long eqn_collect_idx_subterms(Eqn_p eqn, PTree_p *rest, PTree_p *full)
{
long res = 0;
bool restricted_rw = EqnIsMaximal(eqn) && EqnIsPositive(eqn) && EqnIsOriented(eqn);
res += term_collect_idx_subterms(eqn->lterm, rest, full, restricted_rw);
res += term_collect_idx_subterms(eqn->rterm, rest, full, false);
return res;
}
/*-----------------------------------------------------------------------
//
// Function: subterm_index_insert_set()
//
// Insert all the subterm/clause relationships in set (represented
// as a PTree) into the index.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
static void subterm_index_insert_set(SubtermIndex_p index,
Clause_p clause,
PTree_p terms, bool restricted)
{
PStack_p stack = PTreeTraverseInit(terms);
PTree_p cell;
while((cell = PTreeTraverseNext(stack)))
{
SubtermIndexInsertOcc(index, clause, cell->key, restricted);
}
PTreeTraverseExit(stack);
}
/*-----------------------------------------------------------------------
//
// Function: subterm_index_delete_set()
//
// Delete all the subterm/clause relationships in set (represented
// as a PTree) into the index.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
static void subterm_index_delete_set(SubtermIndex_p index,
Clause_p clause,
PTree_p terms, bool restricted)
{
PStack_p stack = PTreeTraverseInit(terms);
PTree_p cell;
while((cell = PTreeTraverseNext(stack)))
{
SubtermIndexDeleteOcc(index, clause, cell->key, restricted);
}
PTreeTraverseExit(stack);
}
/*---------------------------------------------------------------------*/
/* Exported Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: SubtermIndexInsertOcc()
//
// Insert a given occurrence of a subterm into the index. Return
// true if it was new, false if it already existed.
//
// Global Variables: -
//
// Side Effects : Memory operatios
//
/----------------------------------------------------------------------*/
bool SubtermIndexInsertOcc(SubtermIndex_p index, Clause_p clause,
Term_p term, bool restricted)
{
FPTree_p fp_node;
SubtermOcc_p subterm_node;
PTree_p *root;
fp_node = FPIndexInsert(index, term);
subterm_node = SubtermTreeInsertTerm((void*)&(fp_node->payload), term);
root = restricted?&(subterm_node->pl.occs.rw_rest):&(subterm_node->pl.occs.rw_full);
return PTreeStore(root, clause);
}
/*-----------------------------------------------------------------------
//
// Function: SubtermIndexDeleteOcc()
//
// Delete a given occurrence of a subterm from the index. Return true
// if the clause existed, false otherwise.
//
// Global Variables: -
//
// Side Effects : Memory operations.
//
/----------------------------------------------------------------------*/
bool SubtermIndexDeleteOcc(SubtermIndex_p index, Clause_p clause,
Term_p term, bool restricted)
{
FPTree_p fp_node;
bool res;
fp_node = FPIndexFind(index, term);
if(!fp_node)
{
return false;
}
res = SubtermTreeDeleteTermOcc((void*)&(fp_node->payload), term,
clause, restricted);
if(fp_node->payload == NULL)
{
FPIndexDelete(index, term);
}
return res;
}
/*-----------------------------------------------------------------------
//
// Function: ClauseCollectIdxSubterms()
//
// Collect all non-variable subterms in clause either into rest or
// full (rest for "restricted rewriting" terms, full for the "full
// rewriting" terms).
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
long ClauseCollectIdxSubterms(Clause_p clause,
PTree_p *rest,
PTree_p *full)
{
long res = 0;
Eqn_p handle;
for(handle = clause->literals; handle; handle = handle->next)
{
res += eqn_collect_idx_subterms(handle, rest, full);
}
return res;
}
/*-----------------------------------------------------------------------
//
// Function: SubtermIndexInsertClause()
//
// Insert a clause into the subterm index.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void SubtermIndexInsertClause(SubtermIndex_p index, Clause_p clause)
{
PTree_p rest=NULL, full=NULL;
ClauseCollectIdxSubterms(clause, &rest, &full);
subterm_index_insert_set(index, clause, rest, true);
subterm_index_insert_set(index, clause, full, false);
PTreeFree(rest);
PTreeFree(full);
}
/*-----------------------------------------------------------------------
//
// Function: SubtermIndexDeleteClause()
//
// Delete a clause from the subterm index.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void SubtermIndexDeleteClause(SubtermIndex_p index, Clause_p clause)
{
PTree_p rest=NULL, full=NULL;
ClauseCollectIdxSubterms(clause, &rest, &full);
subterm_index_delete_set(index, clause, rest, true);
subterm_index_delete_set(index, clause, full, false);
PTreeFree(rest);
PTreeFree(full);
}
/*---------------------------------------------------------------------*/
/* End of File */
/*---------------------------------------------------------------------*/
|
