File: ccl_ext_index.c

package info (click to toggle)
eprover 2.6%2Bds-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 21,288 kB
  • sloc: ansic: 331,111; csh: 12,026; python: 10,178; awk: 5,825; makefile: 461; sh: 389
file content (386 lines) | stat: -rw-r--r-- 10,656 bytes parent folder | download
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
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
/*-----------------------------------------------------------------------

File  : ccl_ext_index.c

Author: Stephan Schulz (schulz@eprover.org)

Contents

  Maintaining an index that map symbol a to pairs (C,p) where C
  is a clause and p is a position such that C|_p is a term s
  headed by the symbol a such that s has a partially applied subterm.

  Copyright 2020 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.

-----------------------------------------------------------------------*/

#include "ccl_ext_index.h"
#include <ccl_clausecpos.h>
#include <ccl_clausepos_tree.h>

typedef void (*IdxOperator)(ExtIndex_p, Clause_p, PStack_p);



/*---------------------------------------------------------------------*/
/*                        Global Variables                             */
/*---------------------------------------------------------------------*/


/*---------------------------------------------------------------------*/
/*                      Forward Declarations                           */
/*---------------------------------------------------------------------*/


/*---------------------------------------------------------------------*/
/*                         Internal Functions                          */
/*---------------------------------------------------------------------*/

/*-----------------------------------------------------------------------
//
// Function: delete_idx()
//
//   Delete clause from the index.
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void delete_idx(ExtIndex_p idx, Clause_p cl, PStack_p collected_pos)
{
   FunCode fc;
   while(!PStackEmpty(collected_pos))
   {
      UNUSED(PStackPopInt(collected_pos));
      fc = PStackPopInt(collected_pos);

      ClauseTPosTreeDeleteClause(((ClauseTPosTree_p *)IntMapGetRef(idx, fc)), cl);
   }
}


/*-----------------------------------------------------------------------
//
// Function: insert_idx()
//
//   Given a clause and a stack containg pairs symbol, compact position
//   insert them into idx.
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void insert_idx(ExtIndex_p idx, Clause_p cl, PStack_p collected_pos)
{
   CompactPos pos;
   FunCode fc;
   while(!PStackEmpty(collected_pos))
   {
      pos = PStackPopInt(collected_pos);
      fc = PStackPopInt(collected_pos);

      ClauseTPosTreeInsertPos(((ClauseTPosTree_p *)IntMapGetRef(idx, fc)), cl, pos);
   }
}


/*-----------------------------------------------------------------------
//
// Function: collect_into_pos_term()
//
//   Fill the stack with pairs (function symbol, position) eligible for
//   ExtSup inferences. Returns true if t has a functional subterm.
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void collect_into_pos_term(Term_p t, CompactPos pos, PStack_p stack)
{
   PStackPointer old_top = PStackGetSP(stack);
   CompactPos new_pos = pos + DEFAULT_FWEIGHT*(TermIsAppliedVar(t) ? 0 : 1);
   bool has_func_subterm = false;
   for(int i=0; i < t->arity; i++)
   {
      Term_p arg = t->args[i];
      collect_into_pos_term(arg, new_pos, stack);
      has_func_subterm = has_func_subterm || 
                        (TYPE_EXT_ELIGIBLE(arg->type) && !TermIsTopLevelVar(arg));
      new_pos += TermStandardWeight(arg);
   }
   if(!TypeIsArrow(t->type) && !TermIsTopLevelVar(t))
   {
      if(has_func_subterm || PStackGetSP(stack) != old_top)
      {
         PStackPushInt(stack, t->f_code);
         PStackPushInt(stack, pos);
      }
   }
}


/*-----------------------------------------------------------------------
//
// Function: build_into_pos_stack()
//
//   Insert all positions that are into-targets of ExtSup inference to index.
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void build_into_pos_stack(Eqn_p lit, CompactPos pos, PStack_p collected_pos)
{
   collect_into_pos_term(lit->lterm, pos, collected_pos);
   collect_into_pos_term(lit->rterm, (pos + TermStandardWeight(lit->lterm)),
                         collected_pos);
}

/*-----------------------------------------------------------------------
//
// Function: handle_into_idx()
//
//    Perform a generic operation on into idx
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void handle_into_idx(ExtIndex_p into_index, Clause_p cl, IdxOperator op)
{
   PStack_p collected_pos = PStackAlloc();
   CollectExtSupIntoPos(cl, collected_pos);
   op(into_index, cl, collected_pos);
   PStackFree(collected_pos);
}


/*-----------------------------------------------------------------------
//
// Function: handle_from_idx()
//
//    Perform a generic operation on from idx
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void handle_from_idx(ExtIndex_p into_index, Clause_p cl, IdxOperator op)
{
   PStack_p collected_pos = PStackAlloc();
   CollectExtSupFromPos(cl, collected_pos);
   op(into_index, cl, collected_pos);
   PStackFree(collected_pos);
}



/*---------------------------------------------------------------------*/
/*                         Exported Functions                          */
/*---------------------------------------------------------------------*/

/*-----------------------------------------------------------------------
//
// Function: TermHasExtEligSubterm()
//
//   Check if a term actually has an eligible subterm for ExtSup
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

bool TermHasExtEligSubterm(Term_p t)
{
   bool ans = false;
   for(int i=0; !ans && i < t->arity; i++)
   {
      ans = ans || (TYPE_EXT_ELIGIBLE(t->args[i]->type)
                    && !TermIsTopLevelVar(t->args[i]))
                || TermHasExtEligSubterm(t->args[i]);
   }
   return ans;
}

/*-----------------------------------------------------------------------
//
// Function: ExtIndexInsertIntoClause()
//
//   Insert all positions that are into-targets of ExtSup inference to index.
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void ExtIndexInsertIntoClause(ExtIndex_p into_index, Clause_p cl)
{
   handle_into_idx(into_index, cl, insert_idx);
}


/*-----------------------------------------------------------------------
//
// Function: ExtIndexDeleteIntoClause()
//
//   Delete the clause from into index
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void ExtIndexDeleteIntoClause(ExtIndex_p into_index, Clause_p cl)
{
   handle_into_idx(into_index, cl, delete_idx);
}


/*-----------------------------------------------------------------------
//
// Function: ExtIndexInsertFromClause()
//
//   Insert all positions that are into-targets of ExtSup inference to index.
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void ExtIndexInsertFromClause(ExtIndex_p into_index, Clause_p cl)
{
   handle_from_idx(into_index, cl, insert_idx);
}

/*-----------------------------------------------------------------------
//
// Function: ExtIndexDeleteFromClause()
//
//   Delete the clause from into index
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void ExtIndexDeleteFromClause(ExtIndex_p into_index, Clause_p cl)
{
   handle_from_idx(into_index, cl, delete_idx);
}


/*-----------------------------------------------------------------------
//
// Function: ExtIndexFree()
//
//   Delete the clause from into index
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void ExtIndexFree(ExtIndex_p into_index)
{
   IntMapIter_p i = IntMapIterAlloc(into_index, 0, LONG_MAX);
   ClauseTPosTree_p value;
   long dummy;
   // static inline void* IntMapIterNext(IntMapIter_p iter, long *key);
   while((value = IntMapIterNext(i, &dummy)))
   {
      ClauseTPosTreeFree(value);
   }
   IntMapIterFree(i);
   IntMapFree(into_index);
}

/*-----------------------------------------------------------------------
//
// Function: CollectExtSupFromPos()
//
//   Put pairs (f_code, compact_pos) on pos_stack for all eligible from
//   positions
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/

void CollectExtSupFromPos(Clause_p cl, PStack_p pos_stack)
{
   CompactPos pos = 0;
   for(Eqn_p handle = cl->literals; handle; handle = handle->next)
   {
      if(!TypeIsArrow(handle->lterm) && EqnIsPositive(handle))
      {
         if(!TermIsTopLevelVar(handle->lterm) && TermHasExtEligSubterm(handle->lterm))
         {
            PStackPushInt(pos_stack, handle->lterm->f_code);
            PStackPushInt(pos_stack, pos);
         }
         pos += TermStandardWeight(handle->lterm);
         if(!TermIsTopLevelVar(handle->rterm) && TermHasExtEligSubterm(handle->rterm))
         {
            PStackPushInt(pos_stack, handle->rterm->f_code);
            PStackPushInt(pos_stack, pos);
         }
         pos += TermStandardWeight(handle->rterm);
      }
      else
      {
         pos += EqnStandardWeight(handle);
      }
   }

}

/*-----------------------------------------------------------------------
//
// Function: CollectExtSupIntoPos()
//
//   Put pairs (f_code, compact_pos) on pos_stack for all eligible into
//   positions
//
// Global Variables: -
//
// Side Effects    : -
//
/----------------------------------------------------------------------*/
void CollectExtSupIntoPos(Clause_p cl, PStack_p pos_stack)
{
   CompactPos pos = 0;
   for(Eqn_p handle = cl->literals; handle; handle = handle->next)
   {
      build_into_pos_stack(handle, pos, pos_stack);
      pos += EqnStandardWeight(handle);
   }
}


/*---------------------------------------------------------------------*/
/*                        End of File                                  */
/*---------------------------------------------------------------------*/