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
|
/*-----------------------------------------------------------------------
File : cto_cmpcache.c
Author: Stephan Schulz
Contents
Cache for LPO-like comparisons.
Copyright 1998, 1999 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 Jan 5 20:21:36 MET 2000
New
-----------------------------------------------------------------------*/
#include "cto_cmpcache.h"
/*---------------------------------------------------------------------*/
/* Global Variables */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Forward Declarations */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Internal Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: prepare_key()
//
// Turn the 4 values into an ordered key. Return false if values are
// reordered, true otherwise.
//
// Global Variables: -
//
// Side Effects : Builds the key in *key.
//
/----------------------------------------------------------------------*/
static bool prepare_key(Term_p t1, DerefType d1, Term_p t2, DerefType
d2, QuadKey_p key)
{
if(DoubleKeyCmp(t1, d1, t2, d2) > 0)
{
key->p1 = t1;
key->i1 = d1;
key->p2 = t2;
key->i2 = d2;
return true;
}
key->p1 = t2;
key->i1 = d2;
key->p2 = t1;
key->i2 = d1;
return false;
}
/*---------------------------------------------------------------------*/
/* Exported Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: CmpCacheFind()
//
// Find a certain comparison in the cache.
//
// Global Variables: -
//
// Side Effects : Only by splaying the tree.
//
/----------------------------------------------------------------------*/
CompareResult CmpCacheFind(CmpCache_p *cache, Term_p t1, DerefType d1,
Term_p t2, DerefType d2)
{
QuadKey key;
QuadTree_p handle;
CompareResult res = to_unknown;
bool nat_order;
if(TermIsVar(t1)||TermIsVar(t2))
{
return to_unknown;
}
nat_order = prepare_key(t1,d1,t2,d2,&key);
handle = QuadTreeFind(cache, &key);
if(nat_order)
{
if(handle)
{
res = handle->val.i_val;
}
}
else
{
if(handle)
{
res = POInverseRelation(handle->val.i_val);
}
}
return res;
}
/*-----------------------------------------------------------------------
//
// Function: CmpCacheInsert()
//
// Insert a comparison into an LPO cache. Return false if value
// already existed, true otherwise.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool CmpCacheInsert(CmpCache_p *cache, Term_p t1, DerefType d1, Term_p
t2, DerefType d2, CompareResult insert)
{
QuadKey key;
IntOrP val;
bool nat_order, res;
QuadTree_p handle;
assert(insert!=to_unknown);
/* printf("%p:%d:%p:%d:%d\n", t1,d1,t2,d2,insert); */
if(TermIsVar(t1)||TermIsVar(t2))
{
return false;
}
nat_order = prepare_key(t1,d1,t2,d2,&key);
if(nat_order)
{
val.i_val = insert;
}
else
{
val.i_val = POInverseRelation(insert);
}
handle = QuadTreeFind(cache, &key);
if(handle)
{
switch(handle->val.i_val)
{
case to_notgteq:
/* printf("notgteq=%ld\n", val.i_val); */
if(val.i_val==to_notleeq)
{
handle->val.i_val = to_uncomparable;
}
else
{
assert((val.i_val==to_notgteq)||
(val.i_val==to_lesser)||
(val.i_val==to_uncomparable));
handle->val.i_val = val.i_val;
}
break;
case to_notleeq:
/* printf("notleeq=%ld\n", val.i_val); */
if(val.i_val==to_notgteq)
{
handle->val.i_val = to_uncomparable;
}
else
{
assert((val.i_val==to_notleeq)||
(val.i_val==to_greater)||
(val.i_val==to_uncomparable));
handle->val.i_val = val.i_val;
}
break;
default:
assert((handle->val.i_val==val.i_val)
||((val.i_val==to_notgteq)
&&(handle->val.i_val==to_lesser))
||((val.i_val==to_notleeq)
&&(handle->val.i_val==to_greater)));
break;
}
return false;
}
else
{
res = QuadTreeStore(cache, &key, val);
return res;
}
}
/*---------------------------------------------------------------------*/
/* End of File */
/*---------------------------------------------------------------------*/
|
