7 |
|
* External symbols declared in object.h |
8 |
|
*/ |
9 |
|
|
10 |
< |
/* ==================================================================== |
11 |
< |
* The Radiance Software License, Version 1.0 |
12 |
< |
* |
13 |
< |
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
14 |
< |
* through Lawrence Berkeley National Laboratory. All rights reserved. |
15 |
< |
* |
16 |
< |
* Redistribution and use in source and binary forms, with or without |
17 |
< |
* modification, are permitted provided that the following conditions |
18 |
< |
* are met: |
19 |
< |
* |
20 |
< |
* 1. Redistributions of source code must retain the above copyright |
21 |
< |
* notice, this list of conditions and the following disclaimer. |
22 |
< |
* |
23 |
< |
* 2. Redistributions in binary form must reproduce the above copyright |
24 |
< |
* notice, this list of conditions and the following disclaimer in |
25 |
< |
* the documentation and/or other materials provided with the |
26 |
< |
* distribution. |
27 |
< |
* |
28 |
< |
* 3. The end-user documentation included with the redistribution, |
29 |
< |
* if any, must include the following acknowledgment: |
30 |
< |
* "This product includes Radiance software |
31 |
< |
* (http://radsite.lbl.gov/) |
32 |
< |
* developed by the Lawrence Berkeley National Laboratory |
33 |
< |
* (http://www.lbl.gov/)." |
34 |
< |
* Alternately, this acknowledgment may appear in the software itself, |
35 |
< |
* if and wherever such third-party acknowledgments normally appear. |
36 |
< |
* |
37 |
< |
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
38 |
< |
* and "The Regents of the University of California" must |
39 |
< |
* not be used to endorse or promote products derived from this |
40 |
< |
* software without prior written permission. For written |
41 |
< |
* permission, please contact [email protected]. |
42 |
< |
* |
43 |
< |
* 5. Products derived from this software may not be called "Radiance", |
44 |
< |
* nor may "Radiance" appear in their name, without prior written |
45 |
< |
* permission of Lawrence Berkeley National Laboratory. |
46 |
< |
* |
47 |
< |
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
48 |
< |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
49 |
< |
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
50 |
< |
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
51 |
< |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
52 |
< |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
53 |
< |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
54 |
< |
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
55 |
< |
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
56 |
< |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
57 |
< |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
58 |
< |
* SUCH DAMAGE. |
59 |
< |
* ==================================================================== |
60 |
< |
* |
61 |
< |
* This software consists of voluntary contributions made by many |
62 |
< |
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
63 |
< |
* information on Lawrence Berkeley National Laboratory, please see |
64 |
< |
* <http://www.lbl.gov/>. |
65 |
< |
*/ |
10 |
> |
#include "copyright.h" |
11 |
|
|
12 |
|
#include "standard.h" |
13 |
|
|
16 |
|
#include "object.h" |
17 |
|
|
18 |
|
#ifndef OSTSIZ |
19 |
< |
#ifdef BIGMEM |
75 |
< |
#define OSTSIZ 262139 /* object table size (a prime!) */ |
76 |
< |
#else |
19 |
> |
#ifdef SMLMEM |
20 |
|
#define OSTSIZ 32749 /* object table size (a prime!) */ |
21 |
+ |
#else |
22 |
+ |
#define OSTSIZ 262139 /* object table size (a prime!) */ |
23 |
|
#endif |
24 |
|
#endif |
25 |
|
|
209 |
|
ot = oseti(i*OSTSIZ + osentry); |
210 |
|
if (*os > 0) /* found it */ |
211 |
|
return(ot); |
212 |
< |
if (!isfull(ot)) /* entry overflow */ |
212 |
> |
if (!isfull(ot)) { /* entry overflow */ |
213 |
|
if (++ntries < OSTSIZ) |
214 |
|
goto tryagain; |
215 |
|
else |
216 |
|
error(INTERNAL, "hash table overflow in fullnode"); |
217 |
+ |
} |
218 |
|
/* remember position */ |
219 |
|
i = os - ostable[osentry]; |
220 |
|
os = ostable[osentry] = (OBJECT *)realloc( |
221 |
< |
(char *)ostable[osentry], |
221 |
> |
(void *)ostable[osentry], |
222 |
|
(unsigned)(i+oset[0]+2)*sizeof(OBJECT)); |
223 |
|
if (os == NULL) |
224 |
|
goto memerr; |
230 |
|
return(ot); |
231 |
|
memerr: |
232 |
|
error(SYSTEM, "out of memory in fullnode"); |
233 |
+ |
return 0; /* pro forma return */ |
234 |
|
} |
235 |
|
|
236 |
|
|
255 |
|
return; |
256 |
|
noderr: |
257 |
|
error(CONSISTENCY, "bad node in objset"); |
311 |
– |
} |
312 |
– |
|
313 |
– |
|
314 |
– |
int |
315 |
– |
dosets(f) /* loop through all sets */ |
316 |
– |
int (*f)(); |
317 |
– |
{ |
318 |
– |
int res = 0; |
319 |
– |
int n; |
320 |
– |
register OBJECT *os; |
321 |
– |
|
322 |
– |
for (n = 0; n < OSTSIZ; n++) { |
323 |
– |
if ((os = ostable[n]) == NULL) |
324 |
– |
continue; |
325 |
– |
while (*os > 0) { |
326 |
– |
res += (*f)(os); |
327 |
– |
os += *os + 1; |
328 |
– |
} |
329 |
– |
} |
330 |
– |
return(res); |
258 |
|
} |
259 |
|
|
260 |
|
|