src/common/modobject.c

#ifndef lint
static const char RCSid[] = "$Id: modobject.c,v 2.15 2013/12/08 19:25:36 greg Exp $";
#endif
/*
 *  Routines for tracking object modifiers
 *
 *  External symbols declared in object.h
 */

#include "copyright.h"

#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(char *, struct ohtab *);


OBJECT
objndx(                         /* get object number from pointer */
        OBJREC  *op
)
{
        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);
}


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

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


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

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


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

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


int
eqreal(                         /* are two real values close enough to equal? */
        double  d1,
        double  d2
)
{
        if (d2 != 0.0)
                d1 = d1/d2 - 1.0;
        return((-FTINY <= d1) & (d1 <= FTINY));
}


int
eqobjects(                      /* check if two objects are equal */
        OBJECT  obj1,
        OBJECT  obj2
)
{
        OBJREC  *op1, *op2;
        int     i;

        while (obj1 != obj2) {
                if (obj1 == OVOID)
                        return(0);
                if (obj2 == OVOID)
                        return(0);
                op1 = objptr(obj1);
                op2 = objptr(obj2);
                if (op1->otype != op2->otype)
                        return(0);
                if (op1->oargs.nsargs != op2->oargs.nsargs)
                        return(0);
                if (op1->oargs.nfargs != op2->oargs.nfargs)
                        return(0);
#ifdef IARGS
                if (op1->oargs.niargs != op2->oargs.niargs)
                        return(0);
                for (i = op1->oargs.niargs; i-- > 0; )
                        if (op1->oargs.iarg[i] != op2->oargs.iarg[i])
                                return(0);
#endif
                for (i = op1->oargs.nfargs; i-- > 0; )
                        if (!eqreal(op1->oargs.farg[i], op2->oargs.farg[i]))
                                return(0);
                for (i = op1->oargs.nsargs; i-- > 0; )
                        if (strcmp(op1->oargs.sarg[i], op2->oargs.sarg[i]))
                                return(0);
                i = 0;
                switch (op1->otype) {   /* special cases (KEEP CONSISTENT!) */
                case MOD_ALIAS:
                case MAT_ILLUM:
                case MAT_MIRROR:
                        i = (op1->oargs.nsargs > 0);
                        break;
                case MIX_FUNC:
                case MIX_DATA:
                case MIX_TEXT:
                case MIX_PICT:
                        i = 2*(op1->oargs.nsargs >= 2);
                        break;
                case MAT_CLIP:
                        i = op1->oargs.nsargs;
                        break;
                }
                while (i-- > 0)         /* check modifier references */
                        if (!eqobjects( lastmod(obj1, op1->oargs.sarg[i]),
                                        lastmod(obj2, op2->oargs.sarg[i]) ))
                                return(0);
                obj1 = op1->omod;
                obj2 = op2->omod;
        }
        return(1);
}


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

        if (ismodifier(objptr(obj)->otype)) {
                i = otndx(objptr(obj)->oname, &modtab);
                if (eqobjects(obj, modtab.htab[i]))
                        return; /* don't index if same as earlier def. */
                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(void)               /* 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(                       /* return next hash table size */
        int  oldsiz
)
{
        static int  hsiztab[] = {
                251, 509, 1021, 2039, 4093, 8191, 16381, 0
        };
        int  *hsp;

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


static int
otndx(                          /* get object table index for name */
        char  *name,
        struct ohtab  *tab
)
{
        OBJECT  *oldhtab;
        int  hval, i;
        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 + (unsigned long)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.16
Committed:	Mon Dec 9 17:57:44 2013 UTC (10 years, 5 months ago) by greg
Content type:	text/plain
Branch:	MAIN
Changes since 2.15:	+23 -2 lines
Log Message:	Added check for references to different, identically-named modifiers
#	User	Rev	Content
1	greg	1.1	#ifndef lint
2	greg	2.16	static const char RCSid[] = "$Id: modobject.c,v 2.15 2013/12/08 19:25:36 greg Exp $";
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	greg	2.8	#include "copyright.h"
11	greg	1.1
12			#include "standard.h"
13
14			#include "object.h"
15
16	greg	1.2	#include "otypes.h"
17
18	greg	1.1
19			static struct ohtab {
20			int hsiz; /* current table size */
21			OBJECT htab; / table, if allocated */
22			} modtab = {100, NULL}, objtab = {1000, NULL}; /* modifiers and objects */
23
24	schorsch	2.10	static int otndx(char , struct ohtab );
25	greg	1.3
26	greg	1.1
27	greg	2.9	OBJECT
28	greg	2.13	objndx( /* get object number from pointer */
29			OBJREC *op
30			)
31	greg	1.1	{
32	greg	2.13	int i, j;
33	greg	1.1
34	gwlarson	2.6	for (i = nobjects>>OBJBLKSHFT; i >= 0; i--) {
35	greg	2.3	j = op - objblock[i];
36	greg	2.12	if ((j >= 0) & (j < OBJBLKSIZ))
37	gwlarson	2.6	return((i<<OBJBLKSHFT) + j);
38	greg	2.3	}
39			return(OVOID);
40	greg	1.1	}
41
42
43	greg	2.9	OBJECT
44	greg	2.13	lastmod( /* find modifier definition before obj */
45			OBJECT obj,
46			char *mname
47			)
48	greg	2.3	{
49	greg	2.13	OBJREC *op;
50			int i;
51	greg	2.3
52	greg	2.4	i = modifier(mname); /* try hash table first */
53	greg	2.12	if ((obj == OVOID) \| (i < obj))
54	greg	2.4	return(i);
55			for (i = obj; i-- > 0; ) { /* need to search */
56	greg	2.3	op = objptr(i);
57	greg	2.13	if (ismodifier(op->otype) && op->oname[0] == mname[0] &&
58			!strcmp(op->oname, mname))
59	greg	2.3	return(i);
60			}
61			return(OVOID);
62			}
63
64
65	greg	2.9	OBJECT
66	greg	2.13	modifier( /* get a modifier number from its name */
67			char *mname
68			)
69	greg	1.1	{
70	greg	2.13	int ndx;
71	greg	1.1
72			ndx = otndx(mname, &modtab);
73			return(modtab.htab[ndx]);
74			}
75
76
77	greg	2.3	#ifdef GETOBJ
78	greg	2.9	OBJECT
79	greg	2.13	object( /* get an object number from its name */
80			char *oname
81			)
82	greg	2.3	{
83	greg	2.13	int ndx;
84	greg	2.3
85			ndx = otndx(oname, &objtab);
86			return(objtab.htab[ndx]);
87			}
88			#endif
89
90
91	greg	2.15	int
92	greg	2.14	eqreal( /* are two real values close enough to equal? */
93			double d1,
94			double d2
95			)
96			{
97			if (d2 != 0.0)
98			d1 = d1/d2 - 1.0;
99			return((-FTINY <= d1) & (d1 <= FTINY));
100			}
101
102
103			int
104			eqobjects( /* check if two objects are equal */
105			OBJECT obj1,
106			OBJECT obj2
107			)
108			{
109			OBJREC op1, op2;
110			int i;
111
112	greg	2.15	while (obj1 != obj2) {
113			if (obj1 == OVOID)
114			return(0);
115			if (obj2 == OVOID)
116			return(0);
117			op1 = objptr(obj1);
118			op2 = objptr(obj2);
119			if (op1->otype != op2->otype)
120			return(0);
121			if (op1->oargs.nsargs != op2->oargs.nsargs)
122			return(0);
123			if (op1->oargs.nfargs != op2->oargs.nfargs)
124			return(0);
125	greg	2.14	#ifdef IARGS
126	greg	2.15	if (op1->oargs.niargs != op2->oargs.niargs)
127	greg	2.14	return(0);
128	greg	2.15	for (i = op1->oargs.niargs; i-- > 0; )
129			if (op1->oargs.iarg[i] != op2->oargs.iarg[i])
130			return(0);
131	greg	2.14	#endif
132	greg	2.15	for (i = op1->oargs.nfargs; i-- > 0; )
133			if (!eqreal(op1->oargs.farg[i], op2->oargs.farg[i]))
134			return(0);
135			for (i = op1->oargs.nsargs; i-- > 0; )
136			if (strcmp(op1->oargs.sarg[i], op2->oargs.sarg[i]))
137			return(0);
138	greg	2.16	i = 0;
139			switch (op1->otype) { /* special cases (KEEP CONSISTENT!) */
140			case MOD_ALIAS:
141			case MAT_ILLUM:
142			case MAT_MIRROR:
143			i = (op1->oargs.nsargs > 0);
144			break;
145			case MIX_FUNC:
146			case MIX_DATA:
147			case MIX_TEXT:
148			case MIX_PICT:
149			i = 2*(op1->oargs.nsargs >= 2);
150			break;
151			case MAT_CLIP:
152			i = op1->oargs.nsargs;
153			break;
154			}
155			while (i-- > 0) /* check modifier references */
156			if (!eqobjects( lastmod(obj1, op1->oargs.sarg[i]),
157			lastmod(obj2, op2->oargs.sarg[i]) ))
158			return(0);
159	greg	2.15	obj1 = op1->omod;
160			obj2 = op2->omod;
161			}
162	greg	2.14	return(1);
163			}
164
165
166	greg	2.7	void
167	greg	2.13	insertobject( /* insert new object into our list */
168			OBJECT obj
169			)
170	greg	1.1	{
171	greg	2.13	int i;
172	greg	1.1
173			if (ismodifier(objptr(obj)->otype)) {
174			i = otndx(objptr(obj)->oname, &modtab);
175	greg	2.14	if (eqobjects(obj, modtab.htab[i]))
176	greg	2.16	return; /* don't index if same as earlier def. */
177	greg	1.1	modtab.htab[i] = obj;
178			}
179	greg	2.3	#ifdef GETOBJ
180			else {
181			i = otndx(objptr(obj)->oname, &objtab);
182			objtab.htab[i] = obj;
183			}
184			#endif
185	greg	1.1	for (i = 0; addobjnotify[i] != NULL; i++)
186			(*addobjnotify[i])(obj);
187			}
188
189
190	greg	2.7	void
191	greg	2.13	clearobjndx(void) /* clear object hash tables */
192	greg	2.7	{
193			if (modtab.htab != NULL) {
194			free((void *)modtab.htab);
195			modtab.htab = NULL;
196			modtab.hsiz = 100;
197			}
198			if (objtab.htab != NULL) {
199			free((void *)objtab.htab);
200			objtab.htab = NULL;
201			objtab.hsiz = 100;
202			}
203			}
204
205
206	greg	1.1	static int
207	greg	2.13	nexthsiz( /* return next hash table size */
208			int oldsiz
209			)
210	greg	1.1	{
211			static int hsiztab[] = {
212			251, 509, 1021, 2039, 4093, 8191, 16381, 0
213			};
214	greg	2.13	int *hsp;
215	greg	1.1
216			for (hsp = hsiztab; *hsp; hsp++)
217			if (*hsp > oldsiz)
218			return(*hsp);
219			return(oldsiz2 + 1); / not always prime */
220			}
221
222
223			static int
224	greg	2.13	otndx( /* get object table index for name */
225			char *name,
226			struct ohtab *tab
227			)
228	greg	1.1	{
229			OBJECT *oldhtab;
230			int hval, i;
231	greg	2.13	int ndx;
232	greg	1.1
233			if (tab->htab == NULL) { /* new table */
234			tab->hsiz = nexthsiz(tab->hsiz);
235			tab->htab = (OBJECT )malloc(tab->hsizsizeof(OBJECT));
236			if (tab->htab == NULL)
237			error(SYSTEM, "out of memory in otndx");
238			ndx = tab->hsiz;
239			while (ndx--) /* empty it */
240			tab->htab[ndx] = OVOID;
241			}
242			/* look up object */
243			hval = shash(name);
244			tryagain:
245			for (i = 0; i < tab->hsiz; i++) {
246	greg	2.11	ndx = (hval + (unsigned long)i*i) % tab->hsiz;
247	greg	1.1	if (tab->htab[ndx] == OVOID \|\|
248			!strcmp(objptr(tab->htab[ndx])->oname, name))
249			return(ndx);
250			}
251			/* table is full, reallocate */
252			oldhtab = tab->htab;
253			ndx = tab->hsiz;
254			tab->htab = NULL;
255			while (ndx--)
256			if (oldhtab[ndx] != OVOID) {
257			i = otndx(objptr(oldhtab[ndx])->oname, tab);
258			tab->htab[i] = oldhtab[ndx];
259			}
260	greg	2.7	free((void *)oldhtab);
261	greg	1.1	goto tryagain; /* should happen only once! */
262			}