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
|
/*-----------------------------------------------------------------------
File : ccl_clausecpos.c
Author: Stephan Schulz (schulz@eprover.org)
Contents
Code for handling full and compact clause 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> Fri Feb 19 01:24:59 EET 2010
New
-----------------------------------------------------------------------*/
#include "ccl_clausecpos.h"
/*---------------------------------------------------------------------*/
/* Global Variables */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Forward Declarations */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Internal Functions */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Exported Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: PackTermPos()
//
// Pack a term position.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
CompactPos PackTermPos(TermPos_p pos)
{
CompactPos res = 0;
PStackPointer sp;
Term_p t;
int p,i;
assert(pos);
for(sp = 0; sp< PStackGetSP(pos); sp+=2)
{
t = PStackElementP(pos, sp);
p = PStackElementInt(pos, sp+1);
assert(!TermIsVar(t));
assert(p < t->arity);
res += ((!TermIsAppliedVar(t)) ? DEFAULT_FWEIGHT : 0);
for(i=0; i<p; i++)
{
res += TermStandardWeight(t->args[i]);
}
}
return res;
}
/*-----------------------------------------------------------------------
//
// Function: PackPos()
//
// Convert a full position into an integer-encoded position.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
CompactPos PackClausePos(ClausePos_p pos)
{
CompactPos res = 0;
Eqn_p handle;
handle = pos->clause->literals;
assert(pos->literal);
while(handle != pos->literal)
{
res += EqnStandardWeight(handle);
handle = handle->next;
assert(handle);
}
if(pos->side == RightSide)
{
res += TermStandardWeight(handle->lterm);
}
res += PackTermPos(pos->pos);
return res;
}
/*-----------------------------------------------------------------------
//
// Function: UnpackTermPos()
//
// Given a compact term position in t, encode it into the given full
// postion.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void UnpackTermPos(TermPos_p pos, Term_p t, CompactPos cpos)
{
int i;
PStackReset(pos);
while(cpos > 0)
{
assert(!TermIsVar(t));
cpos -= DEFAULT_FWEIGHT*(TermIsAppliedVar(t) ? 0 : 1);
assert(cpos>=0);
PStackPushP(pos, t);
for(i=0; i< t->arity; i++)
{
if(cpos < TermStandardWeight(t->args[i]))
{
PStackPushInt(pos, i);
t = t->args[i];
break;
}
cpos -= TermStandardWeight(t->args[i]);
assert(cpos>=0);
}
}
}
/*-----------------------------------------------------------------------
//
// Function: UnpackClausePosInto()
//
// Unpack the compact position cpos in clause into the existing
// ClausePos pos.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void UnpackClausePosInto(CompactPos cpos, Clause_p clause,
ClausePos_p pos)
{
Eqn_p handle;
Term_p t;
assert(clause);
pos->clause = clause;
handle = clause->literals;
assert(handle);
while(EqnStandardWeight(handle) <= cpos)
{
cpos -= EqnStandardWeight(handle);
handle = handle->next;
assert(handle);
}
pos->literal = handle;
if(cpos >= TermStandardWeight(handle->lterm))
{
cpos -= TermStandardWeight(handle->lterm);
pos->side = RightSide;
t = handle->rterm;
}
else
{
pos->side = LeftSide;
t = handle->lterm;
}
UnpackTermPos(pos->pos, t, cpos);
}
/*-----------------------------------------------------------------------
//
// Function: UnpackClausePos()
//
// Unpack a clause compact position, returning a newly allocated
// clause position.
//
// Global Variables: -
//
// Side Effects : Memory allocation
//
/----------------------------------------------------------------------*/
ClausePos_p UnpackClausePos(CompactPos cpos, Clause_p clause)
{
ClausePos_p handle = ClausePosAlloc();
UnpackClausePosInto(cpos, clause, handle);
return handle;
}
/*-----------------------------------------------------------------------
//
// Function: ClauseCPosGetSubterm()
//
// Given a clause and a compact position, return the indicated
// term. This is a very simple but obviously correct version.
//
// Global Variables: -
//
// Side Effects : Memory allocations/deallocations
//
/----------------------------------------------------------------------*/
Term_p ClauseCPosGetSubterm(Clause_p clause, CompactPos cpos)
{
Term_p res;
ClausePos_p pos = UnpackClausePos(cpos, clause);
res = ClausePosGetSubterm(pos);
ClausePosFree(pos);
return res;
}
/*---------------------------------------------------------------------*/
/* End of File */
/*---------------------------------------------------------------------*/
|
