src/common/modobject.c

#ifndef lint
static const char       RCSid[] = "$Id$";
#endif
/*
 *  Routines for tracking object modifiers
 *
 *  External symbols declared in object.h
 */

/* ====================================================================
 * The Radiance Software License, Version 1.0
 *
 * Copyright (c) 1990 - 2002 The Regents of the University of California,
 * through Lawrence Berkeley National Laboratory.   All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *         notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in
 *       the documentation and/or other materials provided with the
 *       distribution.
 *
 * 3. The end-user documentation included with the redistribution,
 *           if any, must include the following acknowledgment:
 *             "This product includes Radiance software
 *                 (http://radsite.lbl.gov/)
 *                 developed by the Lawrence Berkeley National Laboratory
 *               (http://www.lbl.gov/)."
 *       Alternately, this acknowledgment may appear in the software itself,
 *       if and wherever such third-party acknowledgments normally appear.
 *
 * 4. The names "Radiance," "Lawrence Berkeley National Laboratory"
 *       and "The Regents of the University of California" must
 *       not be used to endorse or promote products derived from this
 *       software without prior written permission. For written
 *       permission, please contact [email protected].
 *
 * 5. Products derived from this software may not be called "Radiance",
 *       nor may "Radiance" appear in their name, without prior written
 *       permission of Lawrence Berkeley National Laboratory.
 *
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED.   IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR
 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * ====================================================================
 *
 * This software consists of voluntary contributions made by many
 * individuals on behalf of Lawrence Berkeley National Laboratory.   For more
 * information on Lawrence Berkeley National Laboratory, please see
 * <http://www.lbl.gov/>.
 */

#include  "standard.h"

#include  "object.h"

#include  "otypes.h"


static struct ohtab {
        int  hsiz;                      /* current table size */
        OBJECT  *htab;                  /* table, if allocated */
}  modtab = {100, NULL}, objtab = {1000, NULL}; /* modifiers and objects */

static int  otndx();


int
objndx(op)                      /* get object number from pointer */
register OBJREC  *op;
{
        register int  i, j;

        for (i = nobjects>>OBJBLKSHFT; i >= 0; i--) {
                j = op - objblock[i];
                if (j >= 0 && j < OBJBLKSIZ)
                        return((i<<OBJBLKSHFT) + j);
        }
        return(OVOID);
}


int
lastmod(obj, mname)             /* find modifier definition before obj */
OBJECT  obj;
char  *mname;
{
        register OBJREC  *op;
        register int  i;

        i = modifier(mname);            /* try hash table first */
        if (i < obj)
                return(i);
        for (i = obj; i-- > 0; ) {      /* need to search */
                op = objptr(i);
                if (ismodifier(op->otype) && !strcmp(op->oname, mname))
                        return(i);
        }
        return(OVOID);
}


int
modifier(mname)                 /* get a modifier number from its name */
char  *mname;
{
        register int  ndx;

        ndx = otndx(mname, &modtab);
        return(modtab.htab[ndx]);
}


#ifdef  GETOBJ
int
object(oname)                   /* get an object number from its name */
char  *oname;
{
        register int  ndx;

        ndx = otndx(oname, &objtab);
        return(objtab.htab[ndx]);
}
#endif


void
insertobject(obj)               /* insert new object into our list */
register OBJECT  obj;
{
        register int  i;

        if (ismodifier(objptr(obj)->otype)) {
                i = otndx(objptr(obj)->oname, &modtab);
                modtab.htab[i] = obj;
        }
#ifdef  GETOBJ
        else {
                i = otndx(objptr(obj)->oname, &objtab);
                objtab.htab[i] = obj;
        }
#endif
        for (i = 0; addobjnotify[i] != NULL; i++)
                (*addobjnotify[i])(obj);
}


void
clearobjndx()                   /* clear object hash tables */
{
        if (modtab.htab != NULL) {
                free((void *)modtab.htab);
                modtab.htab = NULL;
                modtab.hsiz = 100;
        }
        if (objtab.htab != NULL) {
                free((void *)objtab.htab);
                objtab.htab = NULL;
                objtab.hsiz = 100;
        }
}


static int
nexthsiz(oldsiz)                /* return next hash table size */
int  oldsiz;
{
        static int  hsiztab[] = {
                251, 509, 1021, 2039, 4093, 8191, 16381, 0
        };
        register int  *hsp;

        for (hsp = hsiztab; *hsp; hsp++)
                if (*hsp > oldsiz)
                        return(*hsp);
        return(oldsiz*2 + 1);           /* not always prime */
}


static int
otndx(name, tab)                /* get object table index for name */
char  *name;
register struct ohtab  *tab;
{
        OBJECT  *oldhtab;
        int  hval, i;
        register int  ndx;

        if (tab->htab == NULL) {                /* new table */
                tab->hsiz = nexthsiz(tab->hsiz);
                tab->htab = (OBJECT *)malloc(tab->hsiz*sizeof(OBJECT));
                if (tab->htab == NULL)
                        error(SYSTEM, "out of memory in otndx");
                ndx = tab->hsiz;
                while (ndx--)                   /* empty it */
                        tab->htab[ndx] = OVOID;
        }
                                        /* look up object */
        hval = shash(name);
tryagain:
        for (i = 0; i < tab->hsiz; i++) {
                ndx = (hval + i*i) % tab->hsiz;
                if (tab->htab[ndx] == OVOID ||
                                !strcmp(objptr(tab->htab[ndx])->oname, name))
                        return(ndx);
        }
                                        /* table is full, reallocate */
        oldhtab = tab->htab;
        ndx = tab->hsiz;
        tab->htab = NULL;
        while (ndx--)
                if (oldhtab[ndx] != OVOID) {
                        i = otndx(objptr(oldhtab[ndx])->oname, tab);
                        tab->htab[i] = oldhtab[ndx];
                }
        free((void *)oldhtab);
        goto tryagain;                  /* should happen only once! */
}
Revision:	2.7
Committed:	Sat Feb 22 02:07:22 2003 UTC (22 years, 8 months ago) by greg
Content type:	text/plain
Branch:	MAIN
Changes since 2.6:	+78 -7 lines
Log Message:	Changes and check-in for 3.5 release Includes new source files and modifications not recorded for many years See ray/doc/notes/ReleaseNotes for notes between 3.1 and 3.5 release
#	User	Rev	Content
1	greg	1.1	#ifndef lint
2	greg	2.7	static const char RCSid[] = "$Id$";
3	greg	1.1	#endif
4			/*
5			* Routines for tracking object modifiers
6	greg	2.7	*
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	greg	1.1	*/
66
67			#include "standard.h"
68
69			#include "object.h"
70
71	greg	1.2	#include "otypes.h"
72
73	greg	1.1
74			static struct ohtab {
75			int hsiz; /* current table size */
76			OBJECT htab; / table, if allocated */
77			} modtab = {100, NULL}, objtab = {1000, NULL}; /* modifiers and objects */
78
79	greg	1.3	static int otndx();
80
81	greg	1.1
82			int
83	greg	2.3	objndx(op) /* get object number from pointer */
84			register OBJREC *op;
85	greg	1.1	{
86	greg	2.3	register int i, j;
87	greg	1.1
88	gwlarson	2.6	for (i = nobjects>>OBJBLKSHFT; i >= 0; i--) {
89	greg	2.3	j = op - objblock[i];
90	gwlarson	2.6	if (j >= 0 && j < OBJBLKSIZ)
91			return((i<<OBJBLKSHFT) + j);
92	greg	2.3	}
93			return(OVOID);
94	greg	1.1	}
95
96
97			int
98	greg	2.3	lastmod(obj, mname) /* find modifier definition before obj */
99			OBJECT obj;
100			char *mname;
101			{
102			register OBJREC *op;
103			register int i;
104
105	greg	2.4	i = modifier(mname); /* try hash table first */
106			if (i < obj)
107			return(i);
108			for (i = obj; i-- > 0; ) { /* need to search */
109	greg	2.3	op = objptr(i);
110			if (ismodifier(op->otype) && !strcmp(op->oname, mname))
111			return(i);
112			}
113			return(OVOID);
114			}
115
116
117			int
118	greg	1.1	modifier(mname) /* get a modifier number from its name */
119			char *mname;
120			{
121			register int ndx;
122
123			ndx = otndx(mname, &modtab);
124			return(modtab.htab[ndx]);
125			}
126
127
128	greg	2.3	#ifdef GETOBJ
129			int
130			object(oname) /* get an object number from its name */
131			char *oname;
132			{
133			register int ndx;
134
135			ndx = otndx(oname, &objtab);
136			return(objtab.htab[ndx]);
137			}
138			#endif
139
140
141	greg	2.7	void
142	greg	1.1	insertobject(obj) /* insert new object into our list */
143			register OBJECT obj;
144			{
145			register int i;
146
147			if (ismodifier(objptr(obj)->otype)) {
148			i = otndx(objptr(obj)->oname, &modtab);
149			modtab.htab[i] = obj;
150			}
151	greg	2.3	#ifdef GETOBJ
152			else {
153			i = otndx(objptr(obj)->oname, &objtab);
154			objtab.htab[i] = obj;
155			}
156			#endif
157	greg	1.1	for (i = 0; addobjnotify[i] != NULL; i++)
158			(*addobjnotify[i])(obj);
159			}
160
161
162	greg	2.7	void
163			clearobjndx() /* clear object hash tables */
164			{
165			if (modtab.htab != NULL) {
166			free((void *)modtab.htab);
167			modtab.htab = NULL;
168			modtab.hsiz = 100;
169			}
170			if (objtab.htab != NULL) {
171			free((void *)objtab.htab);
172			objtab.htab = NULL;
173			objtab.hsiz = 100;
174			}
175			}
176
177
178	greg	1.1	static int
179			nexthsiz(oldsiz) /* return next hash table size */
180			int oldsiz;
181			{
182			static int hsiztab[] = {
183			251, 509, 1021, 2039, 4093, 8191, 16381, 0
184			};
185			register int *hsp;
186
187			for (hsp = hsiztab; *hsp; hsp++)
188			if (*hsp > oldsiz)
189			return(*hsp);
190			return(oldsiz2 + 1); / not always prime */
191			}
192
193
194			static int
195			otndx(name, tab) /* get object table index for name */
196			char *name;
197			register struct ohtab *tab;
198			{
199			OBJECT *oldhtab;
200			int hval, i;
201			register int ndx;
202
203			if (tab->htab == NULL) { /* new table */
204			tab->hsiz = nexthsiz(tab->hsiz);
205			tab->htab = (OBJECT )malloc(tab->hsizsizeof(OBJECT));
206			if (tab->htab == NULL)
207			error(SYSTEM, "out of memory in otndx");
208			ndx = tab->hsiz;
209			while (ndx--) /* empty it */
210			tab->htab[ndx] = OVOID;
211			}
212			/* look up object */
213			hval = shash(name);
214			tryagain:
215			for (i = 0; i < tab->hsiz; i++) {
216			ndx = (hval + i*i) % tab->hsiz;
217			if (tab->htab[ndx] == OVOID \|\|
218			!strcmp(objptr(tab->htab[ndx])->oname, name))
219			return(ndx);
220			}
221			/* table is full, reallocate */
222			oldhtab = tab->htab;
223			ndx = tab->hsiz;
224			tab->htab = NULL;
225			while (ndx--)
226			if (oldhtab[ndx] != OVOID) {
227			i = otndx(objptr(oldhtab[ndx])->oname, tab);
228			tab->htab[i] = oldhtab[ndx];
229			}
230	greg	2.7	free((void *)oldhtab);
231	greg	1.1	goto tryagain; /* should happen only once! */
232			}