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 |
|
|
#define OSTSIZ 3037 /* object table size (a prime!) */ |
20 |
|
|
|
21 |
|
|
static OBJECT *ostable[OSTSIZ]; /* the object set table */ |
22 |
|
|
|
23 |
|
|
|
24 |
|
|
insertelem(os, obj) /* insert obj into os, no questions */ |
25 |
|
|
register OBJECT *os; |
26 |
|
|
OBJECT obj; |
27 |
|
|
{ |
28 |
|
|
register int i; |
29 |
|
|
|
30 |
|
|
for (i = os[0]++; i > 0; i--) |
31 |
|
|
if (os[i] > obj) |
32 |
|
|
os[i+1] = os[i]; |
33 |
|
|
else |
34 |
|
|
break; |
35 |
|
|
os[i+1] = obj; |
36 |
|
|
} |
37 |
|
|
|
38 |
|
|
|
39 |
|
|
deletelem(os, obj) /* delete obj from os, no questions */ |
40 |
|
|
register OBJECT *os; |
41 |
|
|
OBJECT obj; |
42 |
|
|
{ |
43 |
|
|
register int i; |
44 |
|
|
|
45 |
|
|
for (i = (*os++)--; i > 0 && *os < obj; i--, os++) |
46 |
|
|
; |
47 |
|
|
while (--i > 0) { |
48 |
|
|
os[0] = os[1]; |
49 |
|
|
os++; |
50 |
|
|
} |
51 |
|
|
} |
52 |
|
|
|
53 |
|
|
|
54 |
|
|
inset(os, obj) /* determine if object is in set */ |
55 |
|
|
register OBJECT *os; |
56 |
|
|
OBJECT obj; |
57 |
|
|
{ |
58 |
|
|
int upper, lower; |
59 |
|
|
register int cm, i; |
60 |
|
|
|
61 |
|
|
lower = 1; |
62 |
|
|
upper = cm = os[0] + 1; |
63 |
|
|
|
64 |
|
|
while ((i = (lower + upper) >> 1) != cm) { |
65 |
|
|
cm = obj - os[i]; |
66 |
|
|
if (cm > 0) |
67 |
|
|
lower = i; |
68 |
|
|
else if (cm < 0) |
69 |
|
|
upper = i; |
70 |
|
|
else |
71 |
|
|
return(1); |
72 |
|
|
cm = i; |
73 |
|
|
} |
74 |
|
|
return(0); |
75 |
|
|
} |
76 |
|
|
|
77 |
|
|
|
78 |
|
|
setequal(os1, os2) /* determine if two sets are equal */ |
79 |
|
|
register OBJECT *os1, *os2; |
80 |
|
|
{ |
81 |
|
|
register int i; |
82 |
|
|
|
83 |
|
|
for (i = *os1; i-- >= 0; ) |
84 |
|
|
if (*os1++ != *os2++) |
85 |
|
|
return(0); |
86 |
|
|
return(1); |
87 |
|
|
} |
88 |
|
|
|
89 |
|
|
|
90 |
|
|
setcopy(os1, os2) /* copy object set os2 into os1 */ |
91 |
|
|
register OBJECT *os1, *os2; |
92 |
|
|
{ |
93 |
|
|
register int i; |
94 |
|
|
|
95 |
|
|
for (i = *os2; i-- >= 0; ) |
96 |
|
|
*os1++ = *os2++; |
97 |
|
|
} |
98 |
|
|
|
99 |
|
|
|
100 |
|
|
OCTREE |
101 |
|
|
fullnode(oset) /* return octree for object set */ |
102 |
|
|
OBJECT *oset; |
103 |
|
|
{ |
104 |
|
|
int osentry, ntries; |
105 |
|
|
long hval; |
106 |
|
|
OCTREE ot; |
107 |
|
|
register int i; |
108 |
|
|
register OBJECT *os; |
109 |
|
|
/* hash on set */ |
110 |
|
|
hval = 0; |
111 |
|
|
os = oset; |
112 |
|
|
i = *os++; |
113 |
|
|
while (i-- > 0) |
114 |
|
|
hval += *os++; |
115 |
|
|
ntries = 0; |
116 |
|
|
tryagain: |
117 |
|
|
osentry = (hval + (long)ntries*ntries) % OSTSIZ; |
118 |
|
|
os = ostable[osentry]; |
119 |
|
|
if (os == NULL) { |
120 |
|
|
os = ostable[osentry] = (OBJECT *)malloc( |
121 |
|
|
(unsigned)(oset[0]+2)*sizeof(OBJECT)); |
122 |
|
|
if (os == NULL) |
123 |
|
|
goto memerr; |
124 |
|
|
ot = oseti(osentry); |
125 |
|
|
} else { |
126 |
|
|
/* look for set */ |
127 |
|
|
for (i = 0; *os > 0; i++, os += *os + 1) |
128 |
|
|
if (setequal(os, oset)) |
129 |
|
|
break; |
130 |
|
|
ot = oseti(i*OSTSIZ + osentry); |
131 |
|
|
if (*os > 0) /* found it */ |
132 |
|
|
return(ot); |
133 |
|
|
if (!isfull(ot)) /* entry overflow */ |
134 |
|
|
if (++ntries < OSTSIZ) |
135 |
|
|
goto tryagain; |
136 |
|
|
else |
137 |
|
|
error(INTERNAL, "hash table overflow in fullnode"); |
138 |
|
|
/* remember position */ |
139 |
|
|
i = os - ostable[osentry]; |
140 |
|
|
os = ostable[osentry] = (OBJECT *)realloc( |
141 |
|
|
(char *)ostable[osentry], |
142 |
|
|
(unsigned)(i+oset[0]+2)*sizeof(OBJECT)); |
143 |
|
|
if (os == NULL) |
144 |
|
|
goto memerr; |
145 |
|
|
os += i; /* last entry */ |
146 |
|
|
} |
147 |
|
|
setcopy(os, oset); /* add new set */ |
148 |
|
|
os += *os + 1; |
149 |
|
|
*os = 0; /* terminator */ |
150 |
|
|
return(ot); |
151 |
|
|
memerr: |
152 |
|
|
error(SYSTEM, "out of memory in fullnode"); |
153 |
|
|
} |
154 |
|
|
|
155 |
|
|
|
156 |
|
|
objset(oset, ot) /* get object set for full node */ |
157 |
|
|
register OBJECT *oset; |
158 |
|
|
OCTREE ot; |
159 |
|
|
{ |
160 |
|
|
register OBJECT *os; |
161 |
|
|
register int i; |
162 |
|
|
|
163 |
|
|
if (!isfull(ot)) |
164 |
|
|
goto noderr; |
165 |
|
|
i = oseti(ot); |
166 |
|
|
if ((os = ostable[i%OSTSIZ]) == NULL) |
167 |
|
|
goto noderr; |
168 |
|
|
for (i /= OSTSIZ; i--; os += *os + 1) |
169 |
|
|
if (*os <= 0) |
170 |
|
|
goto noderr; |
171 |
|
|
for (i = *os; i-- >= 0; ) /* copy set here */ |
172 |
|
|
*oset++ = *os++; |
173 |
|
|
return; |
174 |
|
|
noderr: |
175 |
|
|
error(CONSISTENCY, "bad node in objset"); |
176 |
|
|
} |