1 |
– |
/* Copyright (c) 1986 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 |
|
* Compute data values using expression parser |
6 |
|
* |
13 |
|
* 1/29/87 Made variables conditional (VARIABLE) |
14 |
|
* |
15 |
|
* 5/19/88 Added constant subexpression elimination (RCONST) |
16 |
+ |
* |
17 |
+ |
* 2/19/03 Eliminated conditional compiles in favor of esupport extern. |
18 |
|
*/ |
19 |
|
|
20 |
+ |
/* ==================================================================== |
21 |
+ |
* The Radiance Software License, Version 1.0 |
22 |
+ |
* |
23 |
+ |
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
24 |
+ |
* through Lawrence Berkeley National Laboratory. All rights reserved. |
25 |
+ |
* |
26 |
+ |
* Redistribution and use in source and binary forms, with or without |
27 |
+ |
* modification, are permitted provided that the following conditions |
28 |
+ |
* are met: |
29 |
+ |
* |
30 |
+ |
* 1. Redistributions of source code must retain the above copyright |
31 |
+ |
* notice, this list of conditions and the following disclaimer. |
32 |
+ |
* |
33 |
+ |
* 2. Redistributions in binary form must reproduce the above copyright |
34 |
+ |
* notice, this list of conditions and the following disclaimer in |
35 |
+ |
* the documentation and/or other materials provided with the |
36 |
+ |
* distribution. |
37 |
+ |
* |
38 |
+ |
* 3. The end-user documentation included with the redistribution, |
39 |
+ |
* if any, must include the following acknowledgment: |
40 |
+ |
* "This product includes Radiance software |
41 |
+ |
* (http://radsite.lbl.gov/) |
42 |
+ |
* developed by the Lawrence Berkeley National Laboratory |
43 |
+ |
* (http://www.lbl.gov/)." |
44 |
+ |
* Alternately, this acknowledgment may appear in the software itself, |
45 |
+ |
* if and wherever such third-party acknowledgments normally appear. |
46 |
+ |
* |
47 |
+ |
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
48 |
+ |
* and "The Regents of the University of California" must |
49 |
+ |
* not be used to endorse or promote products derived from this |
50 |
+ |
* software without prior written permission. For written |
51 |
+ |
* permission, please contact [email protected]. |
52 |
+ |
* |
53 |
+ |
* 5. Products derived from this software may not be called "Radiance", |
54 |
+ |
* nor may "Radiance" appear in their name, without prior written |
55 |
+ |
* permission of Lawrence Berkeley National Laboratory. |
56 |
+ |
* |
57 |
+ |
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
58 |
+ |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
59 |
+ |
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
60 |
+ |
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
61 |
+ |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
62 |
+ |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
63 |
+ |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
64 |
+ |
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
65 |
+ |
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
66 |
+ |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
67 |
+ |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
68 |
+ |
* SUCH DAMAGE. |
69 |
+ |
* ==================================================================== |
70 |
+ |
* |
71 |
+ |
* This software consists of voluntary contributions made by many |
72 |
+ |
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
73 |
+ |
* information on Lawrence Berkeley National Laboratory, please see |
74 |
+ |
* <http://www.lbl.gov/>. |
75 |
+ |
*/ |
76 |
+ |
|
77 |
|
#include <stdio.h> |
78 |
|
|
79 |
|
#include <ctype.h> |
80 |
|
|
81 |
|
#include <errno.h> |
82 |
|
|
83 |
+ |
#include <math.h> |
84 |
+ |
|
85 |
+ |
#include <stdlib.h> |
86 |
+ |
|
87 |
|
#include "calcomp.h" |
88 |
|
|
89 |
< |
#define MAXLINE 256 /* maximum line length */ |
89 |
> |
#define MAXLINE 256 /* maximum line length */ |
90 |
|
|
91 |
< |
#define newnode() (EPNODE *)ecalloc(1, sizeof(EPNODE)) |
91 |
> |
#define newnode() (EPNODE *)ecalloc(1, sizeof(EPNODE)) |
92 |
|
|
93 |
< |
#define isdecimal(c) (isdigit(c) || (c) == '.') |
93 |
> |
#define isdecimal(c) (isdigit(c) || (c) == '.') |
94 |
|
|
95 |
< |
extern double atof(), pow(); |
96 |
< |
extern char *fgets(), *savestr(); |
37 |
< |
extern char *emalloc(), *ecalloc(); |
38 |
< |
extern EPNODE *curfunc; |
39 |
< |
extern double efunc(), evariable(); |
40 |
< |
static double euminus(), echannel(), eargument(), enumber(); |
95 |
> |
static double euminus(), eargument(), enumber(); |
96 |
> |
static double echannel(); |
97 |
|
static double eadd(), esubtr(), emult(), edivi(), epow(); |
98 |
|
static double ebotch(); |
43 |
– |
extern int errno; |
99 |
|
|
100 |
+ |
unsigned int esupport = /* what to support */ |
101 |
+ |
E_VARIABLE | E_FUNCTION | E_REDEFW; |
102 |
+ |
|
103 |
|
int nextc; /* lookahead character */ |
104 |
|
|
105 |
< |
double (*eoper[])() = { /* expression operations */ |
105 |
> |
double (*eoper[])() = { /* expression operations */ |
106 |
|
ebotch, |
49 |
– |
#ifdef VARIABLE |
107 |
|
evariable, |
51 |
– |
#else |
52 |
– |
ebotch, |
53 |
– |
#endif |
108 |
|
enumber, |
109 |
|
euminus, |
56 |
– |
#ifdef INCHAN |
110 |
|
echannel, |
58 |
– |
#else |
59 |
– |
ebotch, |
60 |
– |
#endif |
61 |
– |
#ifdef FUNCTION |
111 |
|
efunc, |
112 |
|
eargument, |
64 |
– |
#else |
113 |
|
ebotch, |
114 |
|
ebotch, |
67 |
– |
#endif |
68 |
– |
ebotch, |
69 |
– |
ebotch, |
115 |
|
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, |
116 |
|
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, |
117 |
|
emult, |
143 |
|
EPNODE *ep; |
144 |
|
|
145 |
|
initstr(expr, NULL, 0); |
101 |
– |
#if defined(VARIABLE) && defined(FUNCTION) |
146 |
|
curfunc = NULL; |
103 |
– |
#endif |
147 |
|
ep = getE1(); |
148 |
|
if (nextc != EOF) |
149 |
|
syntax("unexpected character"); |
165 |
|
} |
166 |
|
|
167 |
|
|
168 |
+ |
int |
169 |
+ |
epcmp(ep1, ep2) /* compare two expressions for equivalence */ |
170 |
+ |
register EPNODE *ep1, *ep2; |
171 |
+ |
{ |
172 |
+ |
double d; |
173 |
+ |
|
174 |
+ |
if (ep1->type != ep2->type) |
175 |
+ |
return(1); |
176 |
+ |
|
177 |
+ |
switch (ep1->type) { |
178 |
+ |
|
179 |
+ |
case VAR: |
180 |
+ |
return(ep1->v.ln != ep2->v.ln); |
181 |
+ |
|
182 |
+ |
case NUM: |
183 |
+ |
if (ep2->v.num == 0) |
184 |
+ |
return(ep1->v.num != 0); |
185 |
+ |
d = ep1->v.num / ep2->v.num; |
186 |
+ |
return(d > 1.000000000001 | d < 0.999999999999); |
187 |
+ |
|
188 |
+ |
case CHAN: |
189 |
+ |
case ARG: |
190 |
+ |
return(ep1->v.chan != ep2->v.chan); |
191 |
+ |
|
192 |
+ |
case '=': |
193 |
+ |
case ':': |
194 |
+ |
return(epcmp(ep1->v.kid->sibling, ep2->v.kid->sibling)); |
195 |
+ |
|
196 |
+ |
case TICK: |
197 |
+ |
case SYM: /* should never get this one */ |
198 |
+ |
return(0); |
199 |
+ |
|
200 |
+ |
default: |
201 |
+ |
ep1 = ep1->v.kid; |
202 |
+ |
ep2 = ep2->v.kid; |
203 |
+ |
while (ep1 != NULL) { |
204 |
+ |
if (ep2 == NULL) |
205 |
+ |
return(1); |
206 |
+ |
if (epcmp(ep1, ep2)) |
207 |
+ |
return(1); |
208 |
+ |
ep1 = ep1->sibling; |
209 |
+ |
ep2 = ep2->sibling; |
210 |
+ |
} |
211 |
+ |
return(ep2 != NULL); |
212 |
+ |
} |
213 |
+ |
} |
214 |
+ |
|
215 |
+ |
|
216 |
+ |
void |
217 |
|
epfree(epar) /* free a parse tree */ |
218 |
< |
register EPNODE *epar; |
218 |
> |
register EPNODE *epar; |
219 |
|
{ |
220 |
|
register EPNODE *ep; |
221 |
|
|
222 |
|
switch (epar->type) { |
223 |
|
|
132 |
– |
#if defined(VARIABLE) || defined(FUNCTION) |
224 |
|
case VAR: |
225 |
|
varfree(epar->v.ln); |
226 |
|
break; |
136 |
– |
#endif |
227 |
|
|
228 |
|
case SYM: |
229 |
|
freestr(epar->v.name); |
236 |
|
break; |
237 |
|
|
238 |
|
default: |
239 |
< |
for (ep = epar->v.kid; ep != NULL; ep = ep->sibling) |
239 |
> |
while ((ep = epar->v.kid) != NULL) { |
240 |
> |
epar->v.kid = ep->sibling; |
241 |
|
epfree(ep); |
242 |
+ |
} |
243 |
|
break; |
244 |
|
|
245 |
|
} |
248 |
|
} |
249 |
|
|
250 |
|
/* the following used to be a switch */ |
159 |
– |
#ifdef FUNCTION |
251 |
|
static double |
252 |
|
eargument(ep) |
253 |
< |
EPNODE *ep; |
253 |
> |
EPNODE *ep; |
254 |
|
{ |
255 |
|
return(argument(ep->v.chan)); |
256 |
|
} |
166 |
– |
#endif |
257 |
|
|
258 |
|
static double |
259 |
|
enumber(ep) |
260 |
< |
EPNODE *ep; |
260 |
> |
EPNODE *ep; |
261 |
|
{ |
262 |
|
return(ep->v.num); |
263 |
|
} |
264 |
|
|
265 |
|
static double |
266 |
|
euminus(ep) |
267 |
< |
EPNODE *ep; |
267 |
> |
EPNODE *ep; |
268 |
|
{ |
269 |
|
register EPNODE *ep1 = ep->v.kid; |
270 |
|
|
271 |
|
return(-evalue(ep1)); |
272 |
|
} |
273 |
|
|
184 |
– |
#ifdef INCHAN |
274 |
|
static double |
275 |
|
echannel(ep) |
276 |
< |
EPNODE *ep; |
276 |
> |
EPNODE *ep; |
277 |
|
{ |
278 |
|
return(chanvalue(ep->v.chan)); |
279 |
|
} |
191 |
– |
#endif |
280 |
|
|
281 |
|
static double |
282 |
|
eadd(ep) |
283 |
< |
EPNODE *ep; |
283 |
> |
EPNODE *ep; |
284 |
|
{ |
285 |
|
register EPNODE *ep1 = ep->v.kid; |
286 |
|
|
289 |
|
|
290 |
|
static double |
291 |
|
esubtr(ep) |
292 |
< |
EPNODE *ep; |
292 |
> |
EPNODE *ep; |
293 |
|
{ |
294 |
|
register EPNODE *ep1 = ep->v.kid; |
295 |
|
|
298 |
|
|
299 |
|
static double |
300 |
|
emult(ep) |
301 |
< |
EPNODE *ep; |
301 |
> |
EPNODE *ep; |
302 |
|
{ |
303 |
|
register EPNODE *ep1 = ep->v.kid; |
304 |
|
|
307 |
|
|
308 |
|
static double |
309 |
|
edivi(ep) |
310 |
< |
EPNODE *ep; |
310 |
> |
EPNODE *ep; |
311 |
|
{ |
312 |
|
register EPNODE *ep1 = ep->v.kid; |
313 |
|
double d; |
323 |
|
|
324 |
|
static double |
325 |
|
epow(ep) |
326 |
< |
EPNODE *ep; |
326 |
> |
EPNODE *ep; |
327 |
|
{ |
328 |
|
register EPNODE *ep1 = ep->v.kid; |
329 |
|
double d; |
330 |
< |
int lasterrno; |
330 |
> |
int lasterrno; |
331 |
|
|
332 |
|
lasterrno = errno; |
333 |
|
errno = 0; |
334 |
|
d = pow(evalue(ep1), evalue(ep1->sibling)); |
335 |
< |
#ifdef IEEE |
335 |
> |
#ifdef IEEE |
336 |
|
if (!finite(d)) |
337 |
|
errno = EDOM; |
338 |
|
#endif |
346 |
|
|
347 |
|
static double |
348 |
|
ebotch(ep) |
349 |
< |
EPNODE *ep; |
349 |
> |
EPNODE *ep; |
350 |
|
{ |
351 |
|
eputs("Bad expression!\n"); |
352 |
|
quit(1); |
355 |
|
|
356 |
|
EPNODE * |
357 |
|
ekid(ep, n) /* return pointer to a node's nth kid */ |
358 |
< |
register EPNODE *ep; |
358 |
> |
register EPNODE *ep; |
359 |
|
register int n; |
360 |
|
{ |
361 |
|
|
369 |
|
|
370 |
|
int |
371 |
|
nekids(ep) /* return # of kids for node ep */ |
372 |
< |
register EPNODE *ep; |
372 |
> |
register EPNODE *ep; |
373 |
|
{ |
374 |
|
register int n = 0; |
375 |
|
|
380 |
|
} |
381 |
|
|
382 |
|
|
383 |
+ |
void |
384 |
|
initfile(fp, fn, ln) /* prepare input file */ |
385 |
|
FILE *fp; |
386 |
|
char *fn; |
387 |
|
int ln; |
388 |
|
{ |
389 |
< |
static char inpbuf[MAXLINE]; |
389 |
> |
static char inpbuf[MAXLINE]; |
390 |
|
|
391 |
|
infp = fp; |
392 |
|
linbuf = inpbuf; |
398 |
|
} |
399 |
|
|
400 |
|
|
401 |
+ |
void |
402 |
|
initstr(s, fn, ln) /* prepare input string */ |
403 |
|
char *s; |
404 |
|
char *fn; |
413 |
|
} |
414 |
|
|
415 |
|
|
416 |
+ |
void |
417 |
|
getscanpos(fnp, lnp, spp, fpp) /* return current scan position */ |
418 |
|
char **fnp; |
419 |
|
int *lnp; |
460 |
|
|
461 |
|
|
462 |
|
char * |
463 |
< |
ltoa(l) /* convert long to ascii */ |
463 |
> |
long2ascii(l) /* convert long to ascii */ |
464 |
|
long l; |
465 |
|
{ |
466 |
< |
static char buf[16]; |
466 |
> |
static char buf[16]; |
467 |
|
register char *cp; |
468 |
< |
int neg = 0; |
468 |
> |
int neg = 0; |
469 |
|
|
470 |
|
if (l == 0) |
471 |
|
return("0"); |
485 |
|
} |
486 |
|
|
487 |
|
|
488 |
+ |
void |
489 |
|
syntax(err) /* report syntax error and quit */ |
490 |
|
char *err; |
491 |
|
{ |
495 |
|
if (infile != NULL) eputs(infile); |
496 |
|
if (lineno != 0) { |
497 |
|
eputs(infile != NULL ? ", line " : "line "); |
498 |
< |
eputs(ltoa((long)lineno)); |
498 |
> |
eputs(long2ascii((long)lineno)); |
499 |
|
} |
500 |
< |
eputs(": syntax error:\n"); |
500 |
> |
eputs(":\n"); |
501 |
|
} |
502 |
|
eputs(linbuf); |
503 |
|
if (linbuf[strlen(linbuf)-1] != '\n') |
511 |
|
} |
512 |
|
|
513 |
|
|
514 |
+ |
void |
515 |
|
addekid(ep, ekid) /* add a child to ep */ |
516 |
< |
register EPNODE *ep; |
517 |
< |
EPNODE *ekid; |
516 |
> |
register EPNODE *ep; |
517 |
> |
EPNODE *ekid; |
518 |
|
{ |
519 |
|
if (ep->v.kid == NULL) |
520 |
|
ep->v.kid = ekid; |
530 |
|
char * |
531 |
|
getname() /* scan an identifier */ |
532 |
|
{ |
533 |
< |
static char str[MAXWORD+1]; |
533 |
> |
static char str[MAXWORD+1]; |
534 |
|
register int i, lnext; |
535 |
|
|
536 |
|
lnext = nextc; |
537 |
|
for (i = 0; i < MAXWORD && isid(lnext); i++, lnext = scan()) |
538 |
|
str[i] = lnext; |
539 |
|
str[i] = '\0'; |
540 |
+ |
while (isid(lnext)) /* skip rest of name */ |
541 |
+ |
lnext = scan(); |
542 |
|
|
543 |
|
return(str); |
544 |
|
} |
572 |
|
lnext = scan(); |
573 |
|
} |
574 |
|
if (lnext == '.' && i < MAXWORD) { |
575 |
< |
str[i++] = lnext; |
576 |
< |
lnext = scan(); |
575 |
> |
str[i++] = lnext; |
576 |
> |
lnext = scan(); |
577 |
> |
if (i == 1 && !isdigit(lnext)) |
578 |
> |
syntax("badly formed number"); |
579 |
|
while (isdigit(lnext) && i < MAXWORD) { |
580 |
|
str[i++] = lnext; |
581 |
|
lnext = scan(); |
582 |
|
} |
583 |
|
} |
584 |
< |
if ((lnext == 'e' || lnext == 'E') && i < MAXWORD) { |
585 |
< |
str[i++] = lnext; |
586 |
< |
lnext = scan(); |
587 |
< |
if ((lnext == '-' || lnext == '+') && i < MAXWORD) { |
584 |
> |
if ((lnext == 'e' | lnext == 'E') && i < MAXWORD) { |
585 |
> |
str[i++] = lnext; |
586 |
> |
lnext = scan(); |
587 |
> |
if ((lnext == '-' | lnext == '+') && i < MAXWORD) { |
588 |
|
str[i++] = lnext; |
589 |
|
lnext = scan(); |
590 |
|
} |
591 |
+ |
if (!isdigit(lnext)) |
592 |
+ |
syntax("missing exponent"); |
593 |
|
while (isdigit(lnext) && i < MAXWORD) { |
594 |
|
str[i++] = lnext; |
595 |
|
lnext = scan(); |
603 |
|
|
604 |
|
EPNODE * |
605 |
|
getE1() /* E1 -> E1 ADDOP E2 */ |
606 |
< |
/* E2 */ |
606 |
> |
/* E2 */ |
607 |
|
{ |
608 |
|
register EPNODE *ep1, *ep2; |
609 |
|
|
614 |
|
scan(); |
615 |
|
addekid(ep2, ep1); |
616 |
|
addekid(ep2, getE2()); |
617 |
< |
#ifdef RCONST |
618 |
< |
if (ep1->type == NUM && ep1->sibling->type == NUM) |
617 |
> |
if (esupport&E_RCONST && |
618 |
> |
ep1->type == NUM && ep1->sibling->type == NUM) |
619 |
|
ep2 = rconst(ep2); |
521 |
– |
#endif |
620 |
|
ep1 = ep2; |
621 |
|
} |
622 |
|
return(ep1); |
625 |
|
|
626 |
|
EPNODE * |
627 |
|
getE2() /* E2 -> E2 MULOP E3 */ |
628 |
< |
/* E3 */ |
628 |
> |
/* E3 */ |
629 |
|
{ |
630 |
|
register EPNODE *ep1, *ep2; |
631 |
|
|
636 |
|
scan(); |
637 |
|
addekid(ep2, ep1); |
638 |
|
addekid(ep2, getE3()); |
639 |
< |
#ifdef RCONST |
640 |
< |
if (ep1->type == NUM && ep1->sibling->type == NUM) |
639 |
> |
if (esupport&E_RCONST && |
640 |
> |
ep1->type == NUM && ep1->sibling->type == NUM) |
641 |
|
ep2 = rconst(ep2); |
544 |
– |
#endif |
642 |
|
ep1 = ep2; |
643 |
|
} |
644 |
|
return(ep1); |
647 |
|
|
648 |
|
EPNODE * |
649 |
|
getE3() /* E3 -> E4 ^ E3 */ |
650 |
< |
/* E4 */ |
650 |
> |
/* E4 */ |
651 |
|
{ |
652 |
|
register EPNODE *ep1, *ep2; |
653 |
|
|
658 |
|
scan(); |
659 |
|
addekid(ep2, ep1); |
660 |
|
addekid(ep2, getE3()); |
661 |
< |
#ifdef RCONST |
662 |
< |
if (ep1->type == NUM && ep1->sibling->type == NUM) |
661 |
> |
if (esupport&E_RCONST && |
662 |
> |
ep1->type == NUM && ep1->sibling->type == NUM) |
663 |
|
ep2 = rconst(ep2); |
567 |
– |
#endif |
664 |
|
return(ep2); |
665 |
|
} |
666 |
|
return(ep1); |
669 |
|
|
670 |
|
EPNODE * |
671 |
|
getE4() /* E4 -> ADDOP E5 */ |
672 |
< |
/* E5 */ |
672 |
> |
/* E5 */ |
673 |
|
{ |
674 |
|
register EPNODE *ep1, *ep2; |
675 |
|
|
680 |
|
ep2->v.num = -ep2->v.num; |
681 |
|
return(ep2); |
682 |
|
} |
683 |
+ |
if (ep2->type == UMINUS) { /* don't generate -(-E5) */ |
684 |
+ |
efree((char *)ep2); |
685 |
+ |
return(ep2->v.kid); |
686 |
+ |
} |
687 |
|
ep1 = newnode(); |
688 |
|
ep1->type = UMINUS; |
689 |
|
addekid(ep1, ep2); |
697 |
|
|
698 |
|
EPNODE * |
699 |
|
getE5() /* E5 -> (E1) */ |
700 |
< |
/* VAR */ |
701 |
< |
/* NUM */ |
702 |
< |
/* $N */ |
703 |
< |
/* FUNC(E1,..) */ |
704 |
< |
/* ARG */ |
700 |
> |
/* VAR */ |
701 |
> |
/* NUM */ |
702 |
> |
/* $N */ |
703 |
> |
/* FUNC(E1,..) */ |
704 |
> |
/* ARG */ |
705 |
|
{ |
706 |
< |
int i; |
706 |
> |
int i; |
707 |
> |
char *nam; |
708 |
|
register EPNODE *ep1, *ep2; |
709 |
|
|
710 |
|
if (nextc == '(') { |
716 |
|
return(ep1); |
717 |
|
} |
718 |
|
|
719 |
< |
#ifdef INCHAN |
619 |
< |
if (nextc == '$') { |
719 |
> |
if (esupport&E_INCHAN && nextc == '$') { |
720 |
|
scan(); |
721 |
|
ep1 = newnode(); |
722 |
|
ep1->type = CHAN; |
723 |
|
ep1->v.chan = getinum(); |
724 |
|
return(ep1); |
725 |
|
} |
626 |
– |
#endif |
726 |
|
|
727 |
< |
#if defined(VARIABLE) || defined(FUNCTION) |
728 |
< |
if (isalpha(nextc)) { |
729 |
< |
ep1 = newnode(); |
730 |
< |
ep1->type = VAR; |
731 |
< |
ep1->v.ln = varinsert(getname()); |
732 |
< |
|
634 |
< |
#if defined(VARIABLE) && defined(FUNCTION) |
635 |
< |
if (curfunc != NULL) |
727 |
> |
if (esupport&(E_VARIABLE|E_FUNCTION) && |
728 |
> |
(isalpha(nextc) || nextc == CNTXMARK)) { |
729 |
> |
nam = getname(); |
730 |
> |
ep1 = NULL; |
731 |
> |
if ((esupport&(E_VARIABLE|E_FUNCTION)) == (E_VARIABLE|E_FUNCTION) |
732 |
> |
&& curfunc != NULL) |
733 |
|
for (i = 1, ep2 = curfunc->v.kid->sibling; |
734 |
< |
ep2 != NULL; i++, ep2 = ep2->sibling) |
735 |
< |
if (!strcmp(ep2->v.name, ep1->v.ln->name)) { |
639 |
< |
epfree(ep1); |
734 |
> |
ep2 != NULL; i++, ep2 = ep2->sibling) |
735 |
> |
if (!strcmp(ep2->v.name, nam)) { |
736 |
|
ep1 = newnode(); |
737 |
|
ep1->type = ARG; |
738 |
|
ep1->v.chan = i; |
739 |
|
break; |
740 |
|
} |
741 |
< |
#endif |
742 |
< |
#ifdef FUNCTION |
743 |
< |
if (nextc == '(') { |
741 |
> |
if (ep1 == NULL) { |
742 |
> |
ep1 = newnode(); |
743 |
> |
ep1->type = VAR; |
744 |
> |
ep1->v.ln = varinsert(nam); |
745 |
> |
} |
746 |
> |
if (esupport&E_FUNCTION && nextc == '(') { |
747 |
|
ep2 = newnode(); |
748 |
|
ep2->type = FUNC; |
749 |
|
addekid(ep2, ep1); |
755 |
|
if (nextc != ')') |
756 |
|
syntax("')' expected"); |
757 |
|
scan(); |
758 |
< |
} |
660 |
< |
#ifndef VARIABLE |
661 |
< |
else |
758 |
> |
} else if (!(esupport&E_VARIABLE)) |
759 |
|
syntax("'(' expected"); |
760 |
< |
#endif |
664 |
< |
#endif |
665 |
< |
#ifdef RCONST |
666 |
< |
if (isconstvar(ep1)) |
760 |
> |
if (esupport&E_RCONST && isconstvar(ep1)) |
761 |
|
ep1 = rconst(ep1); |
668 |
– |
#endif |
762 |
|
return(ep1); |
763 |
|
} |
671 |
– |
#endif |
764 |
|
|
765 |
|
if (isdecimal(nextc)) { |
766 |
|
ep1 = newnode(); |
772 |
|
} |
773 |
|
|
774 |
|
|
683 |
– |
#ifdef RCONST |
775 |
|
EPNODE * |
776 |
|
rconst(epar) /* reduce a constant expression */ |
777 |
< |
register EPNODE *epar; |
777 |
> |
register EPNODE *epar; |
778 |
|
{ |
779 |
|
register EPNODE *ep; |
780 |
|
|
783 |
|
errno = 0; |
784 |
|
ep->v.num = evalue(epar); |
785 |
|
if (errno) |
786 |
< |
syntax("bad constant expression"); |
786 |
> |
syntax("bad constant expression"); |
787 |
|
epfree(epar); |
788 |
|
|
789 |
|
return(ep); |
790 |
|
} |
791 |
|
|
792 |
|
|
793 |
+ |
int |
794 |
|
isconstvar(ep) /* is ep linked to a constant expression? */ |
795 |
< |
register EPNODE *ep; |
795 |
> |
register EPNODE *ep; |
796 |
|
{ |
705 |
– |
#ifdef VARIABLE |
797 |
|
register EPNODE *ep1; |
707 |
– |
#ifdef FUNCTION |
798 |
|
|
799 |
< |
if (ep->type == FUNC) { |
799 |
> |
if (esupport&E_FUNCTION && ep->type == FUNC) { |
800 |
|
if (!isconstfun(ep->v.kid)) |
801 |
|
return(0); |
802 |
|
for (ep1 = ep->v.kid->sibling; ep1 != NULL; ep1 = ep1->sibling) |
804 |
|
return(0); |
805 |
|
return(1); |
806 |
|
} |
717 |
– |
#endif |
807 |
|
if (ep->type != VAR) |
808 |
|
return(0); |
809 |
|
ep1 = ep->v.ln->def; |
810 |
|
if (ep1 == NULL || ep1->type != ':') |
811 |
|
return(0); |
812 |
< |
#ifdef FUNCTION |
724 |
< |
if (ep1->v.kid->type != SYM) |
812 |
> |
if (esupport&E_FUNCTION && ep1->v.kid->type != SYM) |
813 |
|
return(0); |
726 |
– |
#endif |
814 |
|
return(1); |
728 |
– |
#else |
729 |
– |
return(ep->type == FUNC); |
730 |
– |
#endif |
815 |
|
} |
816 |
|
|
817 |
|
|
818 |
< |
#if defined(FUNCTION) && defined(VARIABLE) |
818 |
> |
int |
819 |
|
isconstfun(ep) /* is ep linked to a constant function? */ |
820 |
< |
register EPNODE *ep; |
820 |
> |
register EPNODE *ep; |
821 |
|
{ |
822 |
|
register EPNODE *dp; |
823 |
|
register LIBR *lp; |
824 |
|
|
825 |
|
if (ep->type != VAR) |
826 |
|
return(0); |
827 |
< |
dp = ep->v.ln->def; |
828 |
< |
if (dp != NULL && dp->type != ':') |
829 |
< |
return(0); |
830 |
< |
if ((dp == NULL || dp->v.kid->type != FUNC) |
831 |
< |
&& ((lp = liblookup(ep->v.ln->name)) == NULL |
832 |
< |
|| lp->atyp != ':')) |
833 |
< |
return(0); |
834 |
< |
return(1); |
827 |
> |
if ((dp = ep->v.ln->def) != NULL) |
828 |
> |
if (dp->v.kid->type == FUNC) |
829 |
> |
return(dp->type == ':'); |
830 |
> |
else |
831 |
> |
return(0); /* don't identify masked library functions */ |
832 |
> |
if ((lp = ep->v.ln->lib) != NULL) |
833 |
> |
return(lp->atyp == ':'); |
834 |
> |
return(0); |
835 |
|
} |
752 |
– |
#endif |
753 |
– |
#endif |