1 |
greg |
1.1 |
/* Copyright (c) 1986 Regents of the University of California */ |
2 |
|
|
|
3 |
|
|
#ifndef lint |
4 |
|
|
static char SCCSid[] = "$SunId$ LBL"; |
5 |
|
|
#endif |
6 |
|
|
|
7 |
|
|
/* |
8 |
|
|
* objset.c - routines for maintaining object sets. |
9 |
|
|
* |
10 |
|
|
* 7/28/85 |
11 |
|
|
*/ |
12 |
|
|
|
13 |
|
|
#include "standard.h" |
14 |
|
|
|
15 |
|
|
#include "octree.h" |
16 |
|
|
|
17 |
|
|
#include "object.h" |
18 |
|
|
|
19 |
greg |
1.4 |
#ifndef OSTSIZ |
20 |
greg |
1.8 |
#ifdef BIGMEM |
21 |
gregl |
2.5 |
#define OSTSIZ 262139 /* object table size (a prime!) */ |
22 |
greg |
1.8 |
#else |
23 |
gregl |
2.5 |
#define OSTSIZ 32749 /* object table size (a prime!) */ |
24 |
greg |
1.8 |
#endif |
25 |
greg |
1.4 |
#endif |
26 |
greg |
1.1 |
|
27 |
|
|
static OBJECT *ostable[OSTSIZ]; /* the object set table */ |
28 |
|
|
|
29 |
|
|
|
30 |
|
|
insertelem(os, obj) /* insert obj into os, no questions */ |
31 |
|
|
register OBJECT *os; |
32 |
|
|
OBJECT obj; |
33 |
|
|
{ |
34 |
|
|
register int i; |
35 |
|
|
|
36 |
|
|
for (i = os[0]++; i > 0; i--) |
37 |
|
|
if (os[i] > obj) |
38 |
|
|
os[i+1] = os[i]; |
39 |
|
|
else |
40 |
|
|
break; |
41 |
|
|
os[i+1] = obj; |
42 |
|
|
} |
43 |
|
|
|
44 |
|
|
|
45 |
|
|
deletelem(os, obj) /* delete obj from os, no questions */ |
46 |
|
|
register OBJECT *os; |
47 |
|
|
OBJECT obj; |
48 |
|
|
{ |
49 |
|
|
register int i; |
50 |
|
|
|
51 |
greg |
1.6 |
i = (*os)--; |
52 |
|
|
os++; |
53 |
|
|
while (i > 0 && *os < obj) { |
54 |
|
|
i--; |
55 |
|
|
os++; |
56 |
|
|
} |
57 |
greg |
1.1 |
while (--i > 0) { |
58 |
|
|
os[0] = os[1]; |
59 |
|
|
os++; |
60 |
|
|
} |
61 |
|
|
} |
62 |
|
|
|
63 |
|
|
|
64 |
|
|
inset(os, obj) /* determine if object is in set */ |
65 |
|
|
register OBJECT *os; |
66 |
|
|
OBJECT obj; |
67 |
|
|
{ |
68 |
|
|
int upper, lower; |
69 |
|
|
register int cm, i; |
70 |
|
|
|
71 |
gwlarson |
2.7 |
if ((i = os[0]) <= 6) { /* linear search algorithm */ |
72 |
|
|
cm = obj; |
73 |
|
|
while (i-- > 0) |
74 |
|
|
if (*++os == cm) |
75 |
|
|
return(1); |
76 |
|
|
return(0); |
77 |
|
|
} |
78 |
greg |
1.1 |
lower = 1; |
79 |
gwlarson |
2.7 |
upper = cm = i + 1; |
80 |
greg |
2.4 |
/* binary search algorithm */ |
81 |
greg |
1.1 |
while ((i = (lower + upper) >> 1) != cm) { |
82 |
|
|
cm = obj - os[i]; |
83 |
|
|
if (cm > 0) |
84 |
|
|
lower = i; |
85 |
|
|
else if (cm < 0) |
86 |
|
|
upper = i; |
87 |
|
|
else |
88 |
|
|
return(1); |
89 |
|
|
cm = i; |
90 |
|
|
} |
91 |
|
|
return(0); |
92 |
|
|
} |
93 |
|
|
|
94 |
|
|
|
95 |
|
|
setequal(os1, os2) /* determine if two sets are equal */ |
96 |
|
|
register OBJECT *os1, *os2; |
97 |
|
|
{ |
98 |
|
|
register int i; |
99 |
|
|
|
100 |
|
|
for (i = *os1; i-- >= 0; ) |
101 |
|
|
if (*os1++ != *os2++) |
102 |
|
|
return(0); |
103 |
|
|
return(1); |
104 |
|
|
} |
105 |
|
|
|
106 |
|
|
|
107 |
|
|
setcopy(os1, os2) /* copy object set os2 into os1 */ |
108 |
|
|
register OBJECT *os1, *os2; |
109 |
|
|
{ |
110 |
|
|
register int i; |
111 |
|
|
|
112 |
|
|
for (i = *os2; i-- >= 0; ) |
113 |
|
|
*os1++ = *os2++; |
114 |
|
|
} |
115 |
|
|
|
116 |
|
|
|
117 |
greg |
2.4 |
OBJECT * |
118 |
|
|
setsave(os) /* allocate space and save set */ |
119 |
|
|
register OBJECT *os; |
120 |
|
|
{ |
121 |
|
|
OBJECT *osnew; |
122 |
|
|
register OBJECT *oset; |
123 |
|
|
register int i; |
124 |
|
|
|
125 |
|
|
if ((osnew = oset = (OBJECT *)malloc((*os+1)*sizeof(OBJECT))) == NULL) |
126 |
|
|
error(SYSTEM, "out of memory in setsave\n"); |
127 |
|
|
for (i = *os; i-- >= 0; ) /* inline setcopy */ |
128 |
|
|
*oset++ = *os++; |
129 |
|
|
return(osnew); |
130 |
|
|
} |
131 |
|
|
|
132 |
|
|
|
133 |
|
|
setunion(osr, os1, os2) /* osr = os1 Union os2 */ |
134 |
|
|
register OBJECT *osr, *os1, *os2; |
135 |
|
|
{ |
136 |
|
|
register int i1, i2; |
137 |
|
|
|
138 |
|
|
osr[0] = 0; |
139 |
|
|
for (i1 = i2 = 1; i1 <= os1[0] || i2 <= os2[0]; ) { |
140 |
|
|
while (i1 <= os1[0] && (i2 > os2[0] || os1[i1] <= os2[i2])) { |
141 |
|
|
osr[++osr[0]] = os1[i1]; |
142 |
|
|
if (i2 <= os2[0] && os2[i2] == os1[i1]) |
143 |
|
|
i2++; |
144 |
|
|
i1++; |
145 |
|
|
} |
146 |
|
|
while (i2 <= os2[0] && (i1 > os1[0] || os2[i2] < os1[i1])) |
147 |
|
|
osr[++osr[0]] = os2[i2++]; |
148 |
|
|
} |
149 |
|
|
} |
150 |
|
|
|
151 |
|
|
|
152 |
|
|
setintersect(osr, os1, os2) /* osr = os1 Intersect os2 */ |
153 |
|
|
register OBJECT *osr, *os1, *os2; |
154 |
|
|
{ |
155 |
|
|
register int i1, i2; |
156 |
|
|
|
157 |
|
|
osr[0] = 0; |
158 |
|
|
if (os1[0] <= 0) |
159 |
|
|
return; |
160 |
|
|
for (i1 = i2 = 1; i2 <= os2[0]; ) { |
161 |
|
|
while (os1[i1] < os2[i2]) |
162 |
|
|
if (++i1 > os1[0]) |
163 |
|
|
return; |
164 |
|
|
while (os2[i2] < os1[i1]) |
165 |
|
|
if (++i2 > os2[0]) |
166 |
|
|
return; |
167 |
|
|
if (os1[i1] == os2[i2]) |
168 |
|
|
osr[++osr[0]] = os2[i2++]; |
169 |
|
|
} |
170 |
|
|
} |
171 |
|
|
|
172 |
|
|
|
173 |
greg |
1.1 |
OCTREE |
174 |
|
|
fullnode(oset) /* return octree for object set */ |
175 |
|
|
OBJECT *oset; |
176 |
|
|
{ |
177 |
|
|
int osentry, ntries; |
178 |
|
|
long hval; |
179 |
|
|
OCTREE ot; |
180 |
|
|
register int i; |
181 |
|
|
register OBJECT *os; |
182 |
|
|
/* hash on set */ |
183 |
|
|
hval = 0; |
184 |
|
|
os = oset; |
185 |
|
|
i = *os++; |
186 |
|
|
while (i-- > 0) |
187 |
|
|
hval += *os++; |
188 |
|
|
ntries = 0; |
189 |
|
|
tryagain: |
190 |
|
|
osentry = (hval + (long)ntries*ntries) % OSTSIZ; |
191 |
|
|
os = ostable[osentry]; |
192 |
|
|
if (os == NULL) { |
193 |
|
|
os = ostable[osentry] = (OBJECT *)malloc( |
194 |
|
|
(unsigned)(oset[0]+2)*sizeof(OBJECT)); |
195 |
|
|
if (os == NULL) |
196 |
|
|
goto memerr; |
197 |
|
|
ot = oseti(osentry); |
198 |
|
|
} else { |
199 |
|
|
/* look for set */ |
200 |
|
|
for (i = 0; *os > 0; i++, os += *os + 1) |
201 |
|
|
if (setequal(os, oset)) |
202 |
|
|
break; |
203 |
|
|
ot = oseti(i*OSTSIZ + osentry); |
204 |
|
|
if (*os > 0) /* found it */ |
205 |
|
|
return(ot); |
206 |
|
|
if (!isfull(ot)) /* entry overflow */ |
207 |
|
|
if (++ntries < OSTSIZ) |
208 |
|
|
goto tryagain; |
209 |
|
|
else |
210 |
|
|
error(INTERNAL, "hash table overflow in fullnode"); |
211 |
|
|
/* remember position */ |
212 |
|
|
i = os - ostable[osentry]; |
213 |
|
|
os = ostable[osentry] = (OBJECT *)realloc( |
214 |
|
|
(char *)ostable[osentry], |
215 |
|
|
(unsigned)(i+oset[0]+2)*sizeof(OBJECT)); |
216 |
|
|
if (os == NULL) |
217 |
|
|
goto memerr; |
218 |
|
|
os += i; /* last entry */ |
219 |
|
|
} |
220 |
|
|
setcopy(os, oset); /* add new set */ |
221 |
|
|
os += *os + 1; |
222 |
|
|
*os = 0; /* terminator */ |
223 |
|
|
return(ot); |
224 |
|
|
memerr: |
225 |
|
|
error(SYSTEM, "out of memory in fullnode"); |
226 |
|
|
} |
227 |
|
|
|
228 |
|
|
|
229 |
|
|
objset(oset, ot) /* get object set for full node */ |
230 |
|
|
register OBJECT *oset; |
231 |
|
|
OCTREE ot; |
232 |
|
|
{ |
233 |
|
|
register OBJECT *os; |
234 |
|
|
register int i; |
235 |
|
|
|
236 |
|
|
if (!isfull(ot)) |
237 |
|
|
goto noderr; |
238 |
gwlarson |
2.6 |
ot = oseti(ot); |
239 |
|
|
if ((os = ostable[ot%OSTSIZ]) == NULL) |
240 |
greg |
1.1 |
goto noderr; |
241 |
gwlarson |
2.6 |
for (i = ot/OSTSIZ; i--; os += *os + 1) |
242 |
greg |
1.1 |
if (*os <= 0) |
243 |
|
|
goto noderr; |
244 |
|
|
for (i = *os; i-- >= 0; ) /* copy set here */ |
245 |
|
|
*oset++ = *os++; |
246 |
|
|
return; |
247 |
|
|
noderr: |
248 |
|
|
error(CONSISTENCY, "bad node in objset"); |
249 |
greg |
1.2 |
} |
250 |
|
|
|
251 |
|
|
|
252 |
greg |
2.4 |
int |
253 |
|
|
dosets(f) /* loop through all sets */ |
254 |
|
|
int (*f)(); |
255 |
greg |
1.2 |
{ |
256 |
greg |
2.4 |
int res = 0; |
257 |
greg |
1.2 |
int n; |
258 |
|
|
register OBJECT *os; |
259 |
greg |
1.3 |
|
260 |
greg |
1.2 |
for (n = 0; n < OSTSIZ; n++) { |
261 |
|
|
if ((os = ostable[n]) == NULL) |
262 |
|
|
continue; |
263 |
greg |
2.4 |
while (*os > 0) { |
264 |
|
|
res += (*f)(os); |
265 |
|
|
os += *os + 1; |
266 |
|
|
} |
267 |
greg |
1.2 |
} |
268 |
greg |
2.4 |
return(res); |
269 |
|
|
} |
270 |
|
|
|
271 |
|
|
|
272 |
|
|
donesets() /* free ALL SETS in our table */ |
273 |
|
|
{ |
274 |
|
|
register int n; |
275 |
|
|
|
276 |
|
|
for (n = 0; n < OSTSIZ; n++) |
277 |
|
|
if (ostable[n] != NULL) { |
278 |
|
|
free((char *)ostable[n]); |
279 |
|
|
ostable[n] = NULL; |
280 |
|
|
} |
281 |
greg |
1.1 |
} |