1 |
< |
/* Copyright (c) 1991 Regents of the University of California */ |
1 |
> |
/* Copyright (c) 1992 Regents of the University of California */ |
2 |
|
|
3 |
|
#ifndef lint |
4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
24 |
|
|
25 |
|
#include <errno.h> |
26 |
|
|
27 |
+ |
#include <math.h> |
28 |
+ |
|
29 |
|
#include "calcomp.h" |
30 |
|
|
31 |
< |
#define MAXLINE 256 /* maximum line length */ |
31 |
> |
#define MAXLINE 256 /* maximum line length */ |
32 |
|
|
33 |
< |
#define newnode() (EPNODE *)ecalloc(1, sizeof(EPNODE)) |
33 |
> |
#define newnode() (EPNODE *)ecalloc(1, sizeof(EPNODE)) |
34 |
|
|
35 |
< |
#define isdecimal(c) (isdigit(c) || (c) == '.') |
35 |
> |
#define isdecimal(c) (isdigit(c) || (c) == '.') |
36 |
|
|
37 |
< |
#ifndef atof |
36 |
< |
extern double atof(); |
37 |
< |
#endif |
38 |
< |
extern double pow(); |
39 |
< |
extern char *fgets(), *savestr(); |
37 |
> |
extern char *savestr(); |
38 |
|
extern char *emalloc(), *ecalloc(); |
39 |
|
extern EPNODE *curfunc; |
40 |
|
extern double efunc(), evariable(); |
41 |
< |
static double euminus(), echannel(), eargument(), enumber(); |
41 |
> |
static double euminus(), eargument(), enumber(); |
42 |
> |
#ifdef INCHAN |
43 |
> |
static double echannel(); |
44 |
> |
#endif |
45 |
|
static double eadd(), esubtr(), emult(), edivi(), epow(); |
46 |
|
static double ebotch(); |
46 |
– |
extern int errno; |
47 |
|
|
48 |
+ |
#ifdef DCL_ATOF |
49 |
+ |
extern double atof(); |
50 |
+ |
#endif |
51 |
+ |
|
52 |
|
int nextc; /* lookahead character */ |
53 |
|
|
54 |
< |
double (*eoper[])() = { /* expression operations */ |
54 |
> |
double (*eoper[])() = { /* expression operations */ |
55 |
|
ebotch, |
56 |
< |
#ifdef VARIABLE |
56 |
> |
#ifdef VARIABLE |
57 |
|
evariable, |
58 |
|
#else |
59 |
|
ebotch, |
60 |
|
#endif |
61 |
|
enumber, |
62 |
|
euminus, |
63 |
< |
#ifdef INCHAN |
63 |
> |
#ifdef INCHAN |
64 |
|
echannel, |
65 |
|
#else |
66 |
|
ebotch, |
67 |
|
#endif |
68 |
< |
#ifdef FUNCTION |
68 |
> |
#ifdef FUNCTION |
69 |
|
efunc, |
70 |
|
eargument, |
71 |
|
#else |
129 |
|
} |
130 |
|
|
131 |
|
|
132 |
+ |
epcmp(ep1, ep2) /* compare two expressions for equivalence */ |
133 |
+ |
register EPNODE *ep1, *ep2; |
134 |
+ |
{ |
135 |
+ |
double d; |
136 |
+ |
|
137 |
+ |
if (ep1->type != ep2->type) |
138 |
+ |
return(1); |
139 |
+ |
|
140 |
+ |
switch (ep1->type) { |
141 |
+ |
|
142 |
+ |
case VAR: |
143 |
+ |
return(ep1->v.ln != ep2->v.ln); |
144 |
+ |
|
145 |
+ |
case NUM: |
146 |
+ |
if (ep2->v.num == 0) |
147 |
+ |
return(ep1->v.num != 0); |
148 |
+ |
d = ep1->v.num / ep2->v.num; |
149 |
+ |
return(d > 1.000000000001 | d < 0.999999999999); |
150 |
+ |
|
151 |
+ |
case CHAN: |
152 |
+ |
case ARG: |
153 |
+ |
return(ep1->v.chan != ep2->v.chan); |
154 |
+ |
|
155 |
+ |
case '=': |
156 |
+ |
case ':': |
157 |
+ |
return(epcmp(ep1->v.kid->sibling, ep2->v.kid->sibling)); |
158 |
+ |
|
159 |
+ |
case TICK: |
160 |
+ |
case SYM: /* should never get this one */ |
161 |
+ |
return(0); |
162 |
+ |
|
163 |
+ |
default: |
164 |
+ |
ep1 = ep1->v.kid; |
165 |
+ |
ep2 = ep2->v.kid; |
166 |
+ |
while (ep1 != NULL) { |
167 |
+ |
if (ep2 == NULL) |
168 |
+ |
return(1); |
169 |
+ |
if (epcmp(ep1, ep2)) |
170 |
+ |
return(1); |
171 |
+ |
ep1 = ep1->sibling; |
172 |
+ |
ep2 = ep2->sibling; |
173 |
+ |
} |
174 |
+ |
return(ep2 != NULL); |
175 |
+ |
} |
176 |
+ |
} |
177 |
+ |
|
178 |
+ |
|
179 |
|
epfree(epar) /* free a parse tree */ |
180 |
< |
register EPNODE *epar; |
180 |
> |
register EPNODE *epar; |
181 |
|
{ |
182 |
|
register EPNODE *ep; |
183 |
|
|
200 |
|
break; |
201 |
|
|
202 |
|
default: |
203 |
< |
for (ep = epar->v.kid; ep != NULL; ep = ep->sibling) |
203 |
> |
while ((ep = epar->v.kid) != NULL) { |
204 |
> |
epar->v.kid = ep->sibling; |
205 |
|
epfree(ep); |
206 |
+ |
} |
207 |
|
break; |
208 |
|
|
209 |
|
} |
212 |
|
} |
213 |
|
|
214 |
|
/* the following used to be a switch */ |
215 |
< |
#ifdef FUNCTION |
215 |
> |
#ifdef FUNCTION |
216 |
|
static double |
217 |
|
eargument(ep) |
218 |
< |
EPNODE *ep; |
218 |
> |
EPNODE *ep; |
219 |
|
{ |
220 |
|
return(argument(ep->v.chan)); |
221 |
|
} |
223 |
|
|
224 |
|
static double |
225 |
|
enumber(ep) |
226 |
< |
EPNODE *ep; |
226 |
> |
EPNODE *ep; |
227 |
|
{ |
228 |
|
return(ep->v.num); |
229 |
|
} |
230 |
|
|
231 |
|
static double |
232 |
|
euminus(ep) |
233 |
< |
EPNODE *ep; |
233 |
> |
EPNODE *ep; |
234 |
|
{ |
235 |
|
register EPNODE *ep1 = ep->v.kid; |
236 |
|
|
237 |
|
return(-evalue(ep1)); |
238 |
|
} |
239 |
|
|
240 |
< |
#ifdef INCHAN |
240 |
> |
#ifdef INCHAN |
241 |
|
static double |
242 |
|
echannel(ep) |
243 |
< |
EPNODE *ep; |
243 |
> |
EPNODE *ep; |
244 |
|
{ |
245 |
|
return(chanvalue(ep->v.chan)); |
246 |
|
} |
248 |
|
|
249 |
|
static double |
250 |
|
eadd(ep) |
251 |
< |
EPNODE *ep; |
251 |
> |
EPNODE *ep; |
252 |
|
{ |
253 |
|
register EPNODE *ep1 = ep->v.kid; |
254 |
|
|
257 |
|
|
258 |
|
static double |
259 |
|
esubtr(ep) |
260 |
< |
EPNODE *ep; |
260 |
> |
EPNODE *ep; |
261 |
|
{ |
262 |
|
register EPNODE *ep1 = ep->v.kid; |
263 |
|
|
266 |
|
|
267 |
|
static double |
268 |
|
emult(ep) |
269 |
< |
EPNODE *ep; |
269 |
> |
EPNODE *ep; |
270 |
|
{ |
271 |
|
register EPNODE *ep1 = ep->v.kid; |
272 |
|
|
275 |
|
|
276 |
|
static double |
277 |
|
edivi(ep) |
278 |
< |
EPNODE *ep; |
278 |
> |
EPNODE *ep; |
279 |
|
{ |
280 |
|
register EPNODE *ep1 = ep->v.kid; |
281 |
|
double d; |
291 |
|
|
292 |
|
static double |
293 |
|
epow(ep) |
294 |
< |
EPNODE *ep; |
294 |
> |
EPNODE *ep; |
295 |
|
{ |
296 |
|
register EPNODE *ep1 = ep->v.kid; |
297 |
|
double d; |
298 |
< |
int lasterrno; |
298 |
> |
int lasterrno; |
299 |
|
|
300 |
|
lasterrno = errno; |
301 |
|
errno = 0; |
302 |
|
d = pow(evalue(ep1), evalue(ep1->sibling)); |
303 |
< |
#ifdef IEEE |
303 |
> |
#ifdef IEEE |
304 |
|
if (!finite(d)) |
305 |
|
errno = EDOM; |
306 |
|
#endif |
314 |
|
|
315 |
|
static double |
316 |
|
ebotch(ep) |
317 |
< |
EPNODE *ep; |
317 |
> |
EPNODE *ep; |
318 |
|
{ |
319 |
|
eputs("Bad expression!\n"); |
320 |
|
quit(1); |
323 |
|
|
324 |
|
EPNODE * |
325 |
|
ekid(ep, n) /* return pointer to a node's nth kid */ |
326 |
< |
register EPNODE *ep; |
326 |
> |
register EPNODE *ep; |
327 |
|
register int n; |
328 |
|
{ |
329 |
|
|
337 |
|
|
338 |
|
int |
339 |
|
nekids(ep) /* return # of kids for node ep */ |
340 |
< |
register EPNODE *ep; |
340 |
> |
register EPNODE *ep; |
341 |
|
{ |
342 |
|
register int n = 0; |
343 |
|
|
353 |
|
char *fn; |
354 |
|
int ln; |
355 |
|
{ |
356 |
< |
static char inpbuf[MAXLINE]; |
356 |
> |
static char inpbuf[MAXLINE]; |
357 |
|
|
358 |
|
infp = fp; |
359 |
|
linbuf = inpbuf; |
425 |
|
|
426 |
|
|
427 |
|
char * |
428 |
< |
ltoa(l) /* convert long to ascii */ |
428 |
> |
long2ascii(l) /* convert long to ascii */ |
429 |
|
long l; |
430 |
|
{ |
431 |
< |
static char buf[16]; |
431 |
> |
static char buf[16]; |
432 |
|
register char *cp; |
433 |
< |
int neg = 0; |
433 |
> |
int neg = 0; |
434 |
|
|
435 |
|
if (l == 0) |
436 |
|
return("0"); |
459 |
|
if (infile != NULL) eputs(infile); |
460 |
|
if (lineno != 0) { |
461 |
|
eputs(infile != NULL ? ", line " : "line "); |
462 |
< |
eputs(ltoa((long)lineno)); |
462 |
> |
eputs(long2ascii((long)lineno)); |
463 |
|
} |
464 |
< |
eputs(": syntax error:\n"); |
464 |
> |
eputs(":\n"); |
465 |
|
} |
466 |
|
eputs(linbuf); |
467 |
|
if (linbuf[strlen(linbuf)-1] != '\n') |
476 |
|
|
477 |
|
|
478 |
|
addekid(ep, ekid) /* add a child to ep */ |
479 |
< |
register EPNODE *ep; |
480 |
< |
EPNODE *ekid; |
479 |
> |
register EPNODE *ep; |
480 |
> |
EPNODE *ekid; |
481 |
|
{ |
482 |
|
if (ep->v.kid == NULL) |
483 |
|
ep->v.kid = ekid; |
494 |
|
char * |
495 |
|
getname() /* scan an identifier */ |
496 |
|
{ |
497 |
< |
static char str[MAXWORD+1]; |
497 |
> |
static char str[MAXWORD+1]; |
498 |
|
register int i, lnext; |
499 |
|
|
500 |
|
lnext = nextc; |
537 |
|
lnext = scan(); |
538 |
|
} |
539 |
|
if (lnext == '.' && i < MAXWORD) { |
540 |
< |
str[i++] = lnext; |
541 |
< |
lnext = scan(); |
540 |
> |
str[i++] = lnext; |
541 |
> |
lnext = scan(); |
542 |
|
while (isdigit(lnext) && i < MAXWORD) { |
543 |
|
str[i++] = lnext; |
544 |
|
lnext = scan(); |
545 |
|
} |
546 |
|
} |
547 |
|
if ((lnext == 'e' || lnext == 'E') && i < MAXWORD) { |
548 |
< |
str[i++] = lnext; |
549 |
< |
lnext = scan(); |
548 |
> |
str[i++] = lnext; |
549 |
> |
lnext = scan(); |
550 |
|
if ((lnext == '-' || lnext == '+') && i < MAXWORD) { |
551 |
|
str[i++] = lnext; |
552 |
|
lnext = scan(); |
564 |
|
|
565 |
|
EPNODE * |
566 |
|
getE1() /* E1 -> E1 ADDOP E2 */ |
567 |
< |
/* E2 */ |
567 |
> |
/* E2 */ |
568 |
|
{ |
569 |
|
register EPNODE *ep1, *ep2; |
570 |
|
|
575 |
|
scan(); |
576 |
|
addekid(ep2, ep1); |
577 |
|
addekid(ep2, getE2()); |
578 |
< |
#ifdef RCONST |
578 |
> |
#ifdef RCONST |
579 |
|
if (ep1->type == NUM && ep1->sibling->type == NUM) |
580 |
|
ep2 = rconst(ep2); |
581 |
|
#endif |
587 |
|
|
588 |
|
EPNODE * |
589 |
|
getE2() /* E2 -> E2 MULOP E3 */ |
590 |
< |
/* E3 */ |
590 |
> |
/* E3 */ |
591 |
|
{ |
592 |
|
register EPNODE *ep1, *ep2; |
593 |
|
|
598 |
|
scan(); |
599 |
|
addekid(ep2, ep1); |
600 |
|
addekid(ep2, getE3()); |
601 |
< |
#ifdef RCONST |
601 |
> |
#ifdef RCONST |
602 |
|
if (ep1->type == NUM && ep1->sibling->type == NUM) |
603 |
|
ep2 = rconst(ep2); |
604 |
|
#endif |
610 |
|
|
611 |
|
EPNODE * |
612 |
|
getE3() /* E3 -> E4 ^ E3 */ |
613 |
< |
/* E4 */ |
613 |
> |
/* E4 */ |
614 |
|
{ |
615 |
|
register EPNODE *ep1, *ep2; |
616 |
|
|
621 |
|
scan(); |
622 |
|
addekid(ep2, ep1); |
623 |
|
addekid(ep2, getE3()); |
624 |
< |
#ifdef RCONST |
624 |
> |
#ifdef RCONST |
625 |
|
if (ep1->type == NUM && ep1->sibling->type == NUM) |
626 |
|
ep2 = rconst(ep2); |
627 |
|
#endif |
633 |
|
|
634 |
|
EPNODE * |
635 |
|
getE4() /* E4 -> ADDOP E5 */ |
636 |
< |
/* E5 */ |
636 |
> |
/* E5 */ |
637 |
|
{ |
638 |
|
register EPNODE *ep1, *ep2; |
639 |
|
|
661 |
|
|
662 |
|
EPNODE * |
663 |
|
getE5() /* E5 -> (E1) */ |
664 |
< |
/* VAR */ |
665 |
< |
/* NUM */ |
666 |
< |
/* $N */ |
667 |
< |
/* FUNC(E1,..) */ |
668 |
< |
/* ARG */ |
664 |
> |
/* VAR */ |
665 |
> |
/* NUM */ |
666 |
> |
/* $N */ |
667 |
> |
/* FUNC(E1,..) */ |
668 |
> |
/* ARG */ |
669 |
|
{ |
670 |
< |
int i; |
670 |
> |
int i; |
671 |
|
char *nam; |
672 |
|
register EPNODE *ep1, *ep2; |
673 |
|
|
680 |
|
return(ep1); |
681 |
|
} |
682 |
|
|
683 |
< |
#ifdef INCHAN |
683 |
> |
#ifdef INCHAN |
684 |
|
if (nextc == '$') { |
685 |
|
scan(); |
686 |
|
ep1 = newnode(); |
697 |
|
ep1 = NULL; |
698 |
|
if (curfunc != NULL) |
699 |
|
for (i = 1, ep2 = curfunc->v.kid->sibling; |
700 |
< |
ep2 != NULL; i++, ep2 = ep2->sibling) |
700 |
> |
ep2 != NULL; i++, ep2 = ep2->sibling) |
701 |
|
if (!strcmp(ep2->v.name, nam)) { |
702 |
|
ep1 = newnode(); |
703 |
|
ep1->type = ARG; |
711 |
|
ep1->type = VAR; |
712 |
|
ep1->v.ln = varinsert(nam); |
713 |
|
} |
714 |
< |
#ifdef FUNCTION |
714 |
> |
#ifdef FUNCTION |
715 |
|
if (nextc == '(') { |
716 |
|
ep2 = newnode(); |
717 |
|
ep2->type = FUNC; |
725 |
|
syntax("')' expected"); |
726 |
|
scan(); |
727 |
|
} |
728 |
< |
#ifndef VARIABLE |
728 |
> |
#ifndef VARIABLE |
729 |
|
else |
730 |
|
syntax("'(' expected"); |
731 |
|
#endif |
732 |
|
#endif |
733 |
< |
#ifdef RCONST |
733 |
> |
#ifdef RCONST |
734 |
|
if (isconstvar(ep1)) |
735 |
|
ep1 = rconst(ep1); |
736 |
|
#endif |
748 |
|
} |
749 |
|
|
750 |
|
|
751 |
< |
#ifdef RCONST |
751 |
> |
#ifdef RCONST |
752 |
|
EPNODE * |
753 |
|
rconst(epar) /* reduce a constant expression */ |
754 |
< |
register EPNODE *epar; |
754 |
> |
register EPNODE *epar; |
755 |
|
{ |
756 |
|
register EPNODE *ep; |
757 |
|
|
760 |
|
errno = 0; |
761 |
|
ep->v.num = evalue(epar); |
762 |
|
if (errno) |
763 |
< |
syntax("bad constant expression"); |
763 |
> |
syntax("bad constant expression"); |
764 |
|
epfree(epar); |
765 |
|
|
766 |
|
return(ep); |
768 |
|
|
769 |
|
|
770 |
|
isconstvar(ep) /* is ep linked to a constant expression? */ |
771 |
< |
register EPNODE *ep; |
771 |
> |
register EPNODE *ep; |
772 |
|
{ |
773 |
< |
#ifdef VARIABLE |
773 |
> |
#ifdef VARIABLE |
774 |
|
register EPNODE *ep1; |
775 |
< |
#ifdef FUNCTION |
775 |
> |
#ifdef FUNCTION |
776 |
|
|
777 |
|
if (ep->type == FUNC) { |
778 |
|
if (!isconstfun(ep->v.kid)) |
788 |
|
ep1 = ep->v.ln->def; |
789 |
|
if (ep1 == NULL || ep1->type != ':') |
790 |
|
return(0); |
791 |
< |
#ifdef FUNCTION |
791 |
> |
#ifdef FUNCTION |
792 |
|
if (ep1->v.kid->type != SYM) |
793 |
|
return(0); |
794 |
|
#endif |
801 |
|
|
802 |
|
#if defined(FUNCTION) && defined(VARIABLE) |
803 |
|
isconstfun(ep) /* is ep linked to a constant function? */ |
804 |
< |
register EPNODE *ep; |
804 |
> |
register EPNODE *ep; |
805 |
|
{ |
806 |
|
register EPNODE *dp; |
807 |
|
register LIBR *lp; |