1 |
– |
/* Copyright (c) 1992 Regents of the University of California */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ LBL"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* Store variable definitions. |
6 |
|
* |
19 |
|
* 4/23/91 Added ':' assignment for constant expressions |
20 |
|
* |
21 |
|
* 8/7/91 Added optional context path to append to variable names |
22 |
+ |
* |
23 |
+ |
* 5/17/2001 Fixed clock counter wrapping behavior |
24 |
+ |
* |
25 |
+ |
* 2/19/03 Eliminated conditional compiles in favor of esupport extern. |
26 |
|
*/ |
27 |
|
|
28 |
+ |
/* ==================================================================== |
29 |
+ |
* The Radiance Software License, Version 1.0 |
30 |
+ |
* |
31 |
+ |
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
32 |
+ |
* through Lawrence Berkeley National Laboratory. All rights reserved. |
33 |
+ |
* |
34 |
+ |
* Redistribution and use in source and binary forms, with or without |
35 |
+ |
* modification, are permitted provided that the following conditions |
36 |
+ |
* are met: |
37 |
+ |
* |
38 |
+ |
* 1. Redistributions of source code must retain the above copyright |
39 |
+ |
* notice, this list of conditions and the following disclaimer. |
40 |
+ |
* |
41 |
+ |
* 2. Redistributions in binary form must reproduce the above copyright |
42 |
+ |
* notice, this list of conditions and the following disclaimer in |
43 |
+ |
* the documentation and/or other materials provided with the |
44 |
+ |
* distribution. |
45 |
+ |
* |
46 |
+ |
* 3. The end-user documentation included with the redistribution, |
47 |
+ |
* if any, must include the following acknowledgment: |
48 |
+ |
* "This product includes Radiance software |
49 |
+ |
* (http://radsite.lbl.gov/) |
50 |
+ |
* developed by the Lawrence Berkeley National Laboratory |
51 |
+ |
* (http://www.lbl.gov/)." |
52 |
+ |
* Alternately, this acknowledgment may appear in the software itself, |
53 |
+ |
* if and wherever such third-party acknowledgments normally appear. |
54 |
+ |
* |
55 |
+ |
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
56 |
+ |
* and "The Regents of the University of California" must |
57 |
+ |
* not be used to endorse or promote products derived from this |
58 |
+ |
* software without prior written permission. For written |
59 |
+ |
* permission, please contact [email protected]. |
60 |
+ |
* |
61 |
+ |
* 5. Products derived from this software may not be called "Radiance", |
62 |
+ |
* nor may "Radiance" appear in their name, without prior written |
63 |
+ |
* permission of Lawrence Berkeley National Laboratory. |
64 |
+ |
* |
65 |
+ |
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
66 |
+ |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
67 |
+ |
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
68 |
+ |
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
69 |
+ |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
70 |
+ |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
71 |
+ |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
72 |
+ |
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
73 |
+ |
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
74 |
+ |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
75 |
+ |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
76 |
+ |
* SUCH DAMAGE. |
77 |
+ |
* ==================================================================== |
78 |
+ |
* |
79 |
+ |
* This software consists of voluntary contributions made by many |
80 |
+ |
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
81 |
+ |
* information on Lawrence Berkeley National Laboratory, please see |
82 |
+ |
* <http://www.lbl.gov/>. |
83 |
+ |
*/ |
84 |
+ |
|
85 |
|
#include <stdio.h> |
86 |
|
|
87 |
+ |
#include <string.h> |
88 |
+ |
|
89 |
|
#include <ctype.h> |
90 |
|
|
91 |
|
#include "calcomp.h" |
94 |
|
#define NHASH 521 /* hash size (a prime!) */ |
95 |
|
#endif |
96 |
|
|
97 |
+ |
#define hash(s) (shash(s)%NHASH) |
98 |
+ |
|
99 |
|
#define newnode() (EPNODE *)ecalloc(1, sizeof(EPNODE)) |
100 |
|
|
101 |
< |
extern char *ecalloc(), *emalloc(), *savestr(), *strcpy(); |
101 |
> |
static double dvalue(); |
102 |
|
|
103 |
< |
static int hash(); |
103 |
> |
#define MAXCLOCK (1L<<31) /* clock wrap value */ |
104 |
|
|
105 |
< |
static double dvalue(); |
105 |
> |
unsigned long eclock = 0; /* value storage timer */ |
106 |
|
|
107 |
< |
long eclock = -1; /* value storage timer */ |
107 |
> |
#define MAXCNTX 1023 /* maximum context length */ |
108 |
|
|
109 |
< |
static char context[MAXWORD+1]; /* current context path */ |
109 |
> |
static char context[MAXCNTX+1]; /* current context path */ |
110 |
|
|
111 |
|
static VARDEF *hashtbl[NHASH]; /* definition list */ |
112 |
|
static int htndx; /* index for */ |
113 |
|
static VARDEF *htpos; /* ...dfirst() and */ |
52 |
– |
#ifdef OUTCHAN |
114 |
|
static EPNODE *ochpos; /* ...dnext */ |
115 |
|
static EPNODE *outchan; |
55 |
– |
#endif |
116 |
|
|
117 |
< |
#ifdef FUNCTION |
58 |
< |
EPNODE *curfunc; |
117 |
> |
EPNODE *curfunc = NULL; |
118 |
|
#define dname(ep) ((ep)->v.kid->type == SYM ? \ |
119 |
|
(ep)->v.kid->v.name : \ |
120 |
|
(ep)->v.kid->v.kid->v.name) |
62 |
– |
#else |
63 |
– |
#define dname(ep) ((ep)->v.kid->v.name) |
64 |
– |
#endif |
121 |
|
|
122 |
|
|
123 |
+ |
void |
124 |
|
fcompile(fname) /* get definitions from a file */ |
125 |
|
char *fname; |
126 |
|
{ |
141 |
|
} |
142 |
|
|
143 |
|
|
144 |
+ |
void |
145 |
|
scompile(str, fn, ln) /* get definitions from a string */ |
146 |
|
char *str; |
147 |
|
char *fn; |
171 |
|
} |
172 |
|
|
173 |
|
|
174 |
+ |
void |
175 |
|
varset(vname, assign, val) /* set a variable's value */ |
176 |
|
char *vname; |
177 |
|
int assign; |
206 |
|
} |
207 |
|
|
208 |
|
|
209 |
+ |
void |
210 |
|
dclear(name) /* delete variable definitions of name */ |
211 |
|
char *name; |
212 |
|
{ |
222 |
|
} |
223 |
|
|
224 |
|
|
225 |
+ |
void |
226 |
|
dremove(name) /* delete all definitions of name */ |
227 |
|
char *name; |
228 |
|
{ |
233 |
|
} |
234 |
|
|
235 |
|
|
236 |
+ |
int |
237 |
|
vardefined(name) /* return non-zero if variable defined */ |
238 |
|
char *name; |
239 |
|
{ |
251 |
|
|
252 |
|
if (ctx == NULL) |
253 |
|
return(context); /* just asking */ |
254 |
+ |
while (*ctx == CNTXMARK) |
255 |
+ |
ctx++; /* skip past marks */ |
256 |
|
if (!*ctx) { |
257 |
< |
context[0] = '\0'; /* clear context */ |
257 |
> |
context[0] = '\0'; /* empty means clear context */ |
258 |
|
return(context); |
259 |
|
} |
260 |
< |
cpp = context; /* else copy it (carefully!) */ |
261 |
< |
if (*ctx != CNTXMARK) |
262 |
< |
*cpp++ = CNTXMARK; /* make sure there's a mark */ |
263 |
< |
do { |
200 |
< |
if (cpp >= context+MAXWORD) |
260 |
> |
cpp = context; /* start context with mark */ |
261 |
> |
*cpp++ = CNTXMARK; |
262 |
> |
do { /* carefully copy new context */ |
263 |
> |
if (cpp >= context+MAXCNTX) |
264 |
|
break; /* just copy what we can */ |
265 |
|
if (isid(*ctx)) |
266 |
|
*cpp++ = *ctx++; |
268 |
|
*cpp++ = '_'; ctx++; |
269 |
|
} |
270 |
|
} while (*ctx); |
271 |
+ |
while (cpp[-1] == CNTXMARK) /* cannot end in context mark */ |
272 |
+ |
cpp--; |
273 |
|
*cpp = '\0'; |
274 |
|
return(context); |
275 |
|
} |
276 |
|
|
277 |
|
|
278 |
|
char * |
279 |
+ |
pushcontext(ctx) /* push on another context */ |
280 |
+ |
char *ctx; |
281 |
+ |
{ |
282 |
+ |
extern char *strncpy(), *strcpy(); |
283 |
+ |
char oldcontext[MAXCNTX+1]; |
284 |
+ |
register int n; |
285 |
+ |
|
286 |
+ |
strcpy(oldcontext, context); /* save old context */ |
287 |
+ |
setcontext(ctx); /* set new context */ |
288 |
+ |
n = strlen(context); /* tack on old */ |
289 |
+ |
if (n+strlen(oldcontext) > MAXCNTX) { |
290 |
+ |
strncpy(context+n, oldcontext, MAXCNTX-n); |
291 |
+ |
context[MAXCNTX] = '\0'; |
292 |
+ |
} else |
293 |
+ |
strcpy(context+n, oldcontext); |
294 |
+ |
return(context); |
295 |
+ |
} |
296 |
+ |
|
297 |
+ |
|
298 |
+ |
char * |
299 |
+ |
popcontext() /* pop off top context */ |
300 |
+ |
{ |
301 |
+ |
register char *cp1, *cp2; |
302 |
+ |
|
303 |
+ |
if (!context[0]) /* nothing left to pop */ |
304 |
+ |
return(context); |
305 |
+ |
cp2 = context; /* find mark */ |
306 |
+ |
while (*++cp2 && *cp2 != CNTXMARK) |
307 |
+ |
; |
308 |
+ |
cp1 = context; /* copy tail to front */ |
309 |
+ |
while (*cp1++ = *cp2++) |
310 |
+ |
; |
311 |
+ |
return(context); |
312 |
+ |
} |
313 |
+ |
|
314 |
+ |
|
315 |
+ |
char * |
316 |
|
qualname(nam, lvl) /* get qualified name */ |
317 |
|
register char *nam; |
318 |
|
int lvl; |
358 |
|
} |
359 |
|
|
360 |
|
|
361 |
+ |
int |
362 |
|
incontext(qn) /* is qualified name in current context? */ |
363 |
|
register char *qn; |
364 |
|
{ |
365 |
+ |
if (!context[0]) /* global context accepts all */ |
366 |
+ |
return(1); |
367 |
|
while (*qn && *qn != CNTXMARK) /* find context mark */ |
368 |
|
qn++; |
369 |
|
return(!strcmp(qn, context)); |
370 |
|
} |
371 |
|
|
372 |
|
|
373 |
< |
#ifdef OUTCHAN |
373 |
> |
void |
374 |
|
chanout(cs) /* set output channels */ |
375 |
|
int (*cs)(); |
376 |
|
{ |
380 |
|
(*cs)(ep->v.kid->v.chan, evalue(ep->v.kid->sibling)); |
381 |
|
|
382 |
|
} |
278 |
– |
#endif |
383 |
|
|
384 |
|
|
385 |
+ |
void |
386 |
|
dcleanup(lvl) /* clear definitions (0->vars,1->output,2->consts) */ |
387 |
|
int lvl; |
388 |
|
{ |
392 |
|
/* if context is global, clear all */ |
393 |
|
for (i = 0; i < NHASH; i++) |
394 |
|
for (vp = hashtbl[i]; vp != NULL; vp = vp->next) |
395 |
< |
if (!context[0] || incontext(vp->name)) |
395 |
> |
if (incontext(vp->name)) |
396 |
|
if (lvl >= 2) |
397 |
|
dremove(vp->name); |
398 |
|
else |
399 |
|
dclear(vp->name); |
295 |
– |
#ifdef OUTCHAN |
400 |
|
if (lvl >= 1) { |
401 |
|
for (ep = outchan; ep != NULL; ep = ep->sibling) |
402 |
|
epfree(ep); |
403 |
|
outchan = NULL; |
404 |
|
} |
301 |
– |
#endif |
405 |
|
} |
406 |
|
|
407 |
|
|
445 |
|
return(vp); |
446 |
|
} |
447 |
|
vp = (VARDEF *)emalloc(sizeof(VARDEF)); |
345 |
– |
#ifdef FUNCTION |
448 |
|
vp->lib = liblookup(name); |
347 |
– |
#else |
348 |
– |
vp->lib = NULL; |
349 |
– |
#endif |
449 |
|
if (vp->lib == NULL) /* if name not in library */ |
450 |
|
name = qualname(name, 0); /* use fully qualified version */ |
451 |
|
hv = hash(name); |
458 |
|
} |
459 |
|
|
460 |
|
|
461 |
< |
#ifdef FUNCTION |
461 |
> |
void |
462 |
|
libupdate(fn) /* update library links */ |
463 |
|
char *fn; |
464 |
|
{ |
470 |
|
if (vp->lib != NULL || fn == NULL || !strcmp(fn, vp->name)) |
471 |
|
vp->lib = liblookup(vp->name); |
472 |
|
} |
374 |
– |
#endif |
473 |
|
|
474 |
|
|
475 |
+ |
void |
476 |
|
varfree(ln) /* release link to variable */ |
477 |
|
register VARDEF *ln; |
478 |
|
{ |
501 |
|
{ |
502 |
|
htndx = 0; |
503 |
|
htpos = NULL; |
405 |
– |
#ifdef OUTCHAN |
504 |
|
ochpos = outchan; |
407 |
– |
#endif |
505 |
|
return(dnext()); |
506 |
|
} |
507 |
|
|
523 |
|
return(ep); |
524 |
|
} |
525 |
|
} |
429 |
– |
#ifdef OUTCHAN |
526 |
|
if ((ep = ochpos) != NULL) |
527 |
|
ochpos = ep->sibling; |
528 |
|
return(ep); |
433 |
– |
#else |
434 |
– |
return(NULL); |
435 |
– |
#endif |
529 |
|
} |
530 |
|
|
531 |
|
|
545 |
|
} |
546 |
|
|
547 |
|
|
548 |
+ |
void |
549 |
|
dpush(nm, ep) /* push on a definition */ |
550 |
|
char *nm; |
551 |
|
register EPNODE *ep; |
558 |
|
} |
559 |
|
|
560 |
|
|
561 |
< |
#ifdef OUTCHAN |
561 |
> |
void |
562 |
|
addchan(sp) /* add an output channel assignment */ |
563 |
|
EPNODE *sp; |
564 |
|
{ |
586 |
|
sp->sibling = NULL; |
587 |
|
|
588 |
|
} |
495 |
– |
#endif |
589 |
|
|
590 |
|
|
591 |
+ |
void |
592 |
|
getstatement() /* get next statement */ |
593 |
|
{ |
594 |
|
register EPNODE *ep; |
599 |
|
scan(); |
600 |
|
return; |
601 |
|
} |
602 |
< |
#ifdef OUTCHAN |
603 |
< |
if (nextc == '$') { /* channel assignment */ |
602 |
> |
if (esupport&E_OUTCHAN && |
603 |
> |
nextc == '$') { /* channel assignment */ |
604 |
|
ep = getchan(); |
605 |
|
addchan(ep); |
606 |
< |
} else |
513 |
< |
#endif |
514 |
< |
{ /* ordinary definition */ |
606 |
> |
} else { /* ordinary definition */ |
607 |
|
ep = getdefn(); |
608 |
|
qname = qualname(dname(ep), 0); |
609 |
< |
#ifdef REDEFW |
610 |
< |
if ((vdef = varlookup(qname)) != NULL) |
519 |
< |
if (vdef->def != NULL) { |
609 |
> |
if (esupport&E_REDEFW && (vdef = varlookup(qname)) != NULL) |
610 |
> |
if (vdef->def != NULL && epcmp(ep, vdef->def)) { |
611 |
|
wputs(qname); |
612 |
|
if (vdef->def->type == ':') |
613 |
|
wputs(": redefined constant expression\n"); |
614 |
|
else |
615 |
|
wputs(": redefined\n"); |
616 |
< |
} |
526 |
< |
#ifdef FUNCTION |
527 |
< |
else if (ep->v.kid->type == FUNC && vdef->lib != NULL) { |
616 |
> |
} else if (ep->v.kid->type == FUNC && vdef->lib != NULL) { |
617 |
|
wputs(qname); |
618 |
|
wputs(": definition hides library function\n"); |
619 |
|
} |
531 |
– |
#endif |
532 |
– |
#endif |
620 |
|
if (ep->type == ':') |
621 |
|
dremove(qname); |
622 |
|
else |
646 |
|
ep1->type = SYM; |
647 |
|
ep1->v.name = savestr(getname()); |
648 |
|
|
649 |
< |
#ifdef FUNCTION |
563 |
< |
if (nextc == '(') { |
649 |
> |
if (esupport&E_FUNCTION && nextc == '(') { |
650 |
|
ep2 = newnode(); |
651 |
|
ep2->type = FUNC; |
652 |
|
addekid(ep2, ep1); |
664 |
|
syntax("')' expected"); |
665 |
|
scan(); |
666 |
|
curfunc = ep1; |
667 |
< |
} else |
582 |
< |
curfunc = NULL; |
583 |
< |
#endif |
667 |
> |
} |
668 |
|
|
669 |
|
if (nextc != '=' && nextc != ':') |
670 |
|
syntax("'=' or ':' expected"); |
675 |
|
addekid(ep2, ep1); |
676 |
|
addekid(ep2, getE1()); |
677 |
|
|
678 |
< |
if ( |
595 |
< |
#ifdef FUNCTION |
596 |
< |
ep1->type == SYM && |
597 |
< |
#endif |
598 |
< |
ep1->sibling->type != NUM) { |
678 |
> |
if (ep1->type == SYM && ep1->sibling->type != NUM) { |
679 |
|
ep1 = newnode(); |
680 |
|
ep1->type = TICK; |
681 |
< |
ep1->v.tick = -1; |
681 |
> |
ep1->v.tick = 0; |
682 |
|
addekid(ep2, ep1); |
683 |
|
ep1 = newnode(); |
684 |
|
ep1->type = NUM; |
685 |
|
addekid(ep2, ep1); |
686 |
|
} |
687 |
+ |
curfunc = NULL; |
688 |
|
|
689 |
|
return(ep2); |
690 |
|
} |
691 |
|
|
692 |
|
|
612 |
– |
#ifdef OUTCHAN |
693 |
|
EPNODE * |
694 |
|
getchan() /* A -> $N = E1 */ |
695 |
|
{ |
714 |
|
|
715 |
|
return(ep2); |
716 |
|
} |
637 |
– |
#endif |
717 |
|
|
718 |
|
|
719 |
|
|
738 |
|
if (ep1->type == NUM) |
739 |
|
return(ep1->v.num); /* return if number */ |
740 |
|
ep2 = ep1->sibling; /* check time */ |
741 |
< |
if (ep2->v.tick < 0 || ep2->v.tick < eclock) { |
742 |
< |
ep2->v.tick = d->type == ':' ? 1L<<30 : eclock; |
741 |
> |
if (eclock >= MAXCLOCK) |
742 |
> |
eclock = 1; /* wrap clock counter */ |
743 |
> |
if (ep2->v.tick < MAXCLOCK && |
744 |
> |
ep2->v.tick == 0 | ep2->v.tick != eclock) { |
745 |
> |
ep2->v.tick = d->type == ':' ? MAXCLOCK : eclock; |
746 |
|
ep2 = ep2->sibling; |
747 |
|
ep2->v.num = evalue(ep1); /* needs new value */ |
748 |
|
} else |
749 |
|
ep2 = ep2->sibling; /* else reuse old value */ |
750 |
|
|
751 |
|
return(ep2->v.num); |
670 |
– |
} |
671 |
– |
|
672 |
– |
|
673 |
– |
static int |
674 |
– |
hash(s) /* hash a string */ |
675 |
– |
register char *s; |
676 |
– |
{ |
677 |
– |
register int rval = 0; |
678 |
– |
|
679 |
– |
while (*s) |
680 |
– |
rval += *s++; |
681 |
– |
|
682 |
– |
return(rval % NHASH); |
752 |
|
} |