105 |
|
char *expr |
106 |
|
) |
107 |
|
{ |
108 |
< |
register EPNODE *ep; |
108 |
> |
EPNODE *ep; |
109 |
|
double rval; |
110 |
|
|
111 |
|
ep = eparse(expr); |
117 |
|
|
118 |
|
int |
119 |
|
epcmp( /* compare two expressions for equivalence */ |
120 |
< |
register EPNODE *ep1, |
121 |
< |
register EPNODE *ep2 |
120 |
> |
EPNODE *ep1, |
121 |
> |
EPNODE *ep2 |
122 |
|
) |
123 |
|
{ |
124 |
|
double d; |
145 |
|
case ':': |
146 |
|
return(epcmp(ep1->v.kid->sibling, ep2->v.kid->sibling)); |
147 |
|
|
148 |
< |
case TICK: |
148 |
> |
case CLKT: |
149 |
|
case SYM: /* should never get this one */ |
150 |
|
return(0); |
151 |
|
|
167 |
|
|
168 |
|
void |
169 |
|
epfree( /* free a parse tree */ |
170 |
< |
register EPNODE *epar |
170 |
> |
EPNODE *epar |
171 |
|
) |
172 |
|
{ |
173 |
< |
register EPNODE *ep; |
173 |
> |
EPNODE *ep; |
174 |
|
|
175 |
|
switch (epar->type) { |
176 |
|
|
185 |
|
case NUM: |
186 |
|
case CHAN: |
187 |
|
case ARG: |
188 |
< |
case TICK: |
188 |
> |
case CLKT: |
189 |
|
break; |
190 |
|
|
191 |
|
default: |
222 |
|
EPNODE *ep |
223 |
|
) |
224 |
|
{ |
225 |
< |
register EPNODE *ep1 = ep->v.kid; |
225 |
> |
EPNODE *ep1 = ep->v.kid; |
226 |
|
|
227 |
|
return(-evalue(ep1)); |
228 |
|
} |
240 |
|
EPNODE *ep |
241 |
|
) |
242 |
|
{ |
243 |
< |
register EPNODE *ep1 = ep->v.kid; |
243 |
> |
EPNODE *ep1 = ep->v.kid; |
244 |
|
|
245 |
|
return(evalue(ep1) + evalue(ep1->sibling)); |
246 |
|
} |
250 |
|
EPNODE *ep |
251 |
|
) |
252 |
|
{ |
253 |
< |
register EPNODE *ep1 = ep->v.kid; |
253 |
> |
EPNODE *ep1 = ep->v.kid; |
254 |
|
|
255 |
|
return(evalue(ep1) - evalue(ep1->sibling)); |
256 |
|
} |
260 |
|
EPNODE *ep |
261 |
|
) |
262 |
|
{ |
263 |
< |
register EPNODE *ep1 = ep->v.kid; |
263 |
> |
EPNODE *ep1 = ep->v.kid; |
264 |
|
|
265 |
|
return(evalue(ep1) * evalue(ep1->sibling)); |
266 |
|
} |
270 |
|
EPNODE *ep |
271 |
|
) |
272 |
|
{ |
273 |
< |
register EPNODE *ep1 = ep->v.kid; |
273 |
> |
EPNODE *ep1 = ep->v.kid; |
274 |
|
double d; |
275 |
|
|
276 |
|
d = evalue(ep1->sibling); |
287 |
|
EPNODE *ep |
288 |
|
) |
289 |
|
{ |
290 |
< |
register EPNODE *ep1 = ep->v.kid; |
290 |
> |
EPNODE *ep1 = ep->v.kid; |
291 |
|
double d; |
292 |
|
int lasterrno; |
293 |
|
|
295 |
|
errno = 0; |
296 |
|
d = pow(evalue(ep1), evalue(ep1->sibling)); |
297 |
|
#ifdef isnan |
298 |
< |
if (errno == 0) |
298 |
> |
if (errno == 0) { |
299 |
|
if (isnan(d)) |
300 |
|
errno = EDOM; |
301 |
|
else if (isinf(d)) |
302 |
|
errno = ERANGE; |
303 |
+ |
} |
304 |
|
#endif |
305 |
|
if (errno == EDOM || errno == ERANGE) { |
306 |
|
wputs("Illegal power\n"); |
323 |
|
|
324 |
|
EPNODE * |
325 |
|
ekid( /* return pointer to a node's nth kid */ |
326 |
< |
register EPNODE *ep, |
327 |
< |
register int n |
326 |
> |
EPNODE *ep, |
327 |
> |
int n |
328 |
|
) |
329 |
|
{ |
330 |
|
|
338 |
|
|
339 |
|
int |
340 |
|
nekids( /* return # of kids for node ep */ |
341 |
< |
register EPNODE *ep |
341 |
> |
EPNODE *ep |
342 |
|
) |
343 |
|
{ |
344 |
< |
register int n = 0; |
344 |
> |
int n = 0; |
345 |
|
|
346 |
|
for (ep = ep->v.kid; ep != NULL; ep = ep->sibling) |
347 |
|
n++; |
403 |
|
int |
404 |
|
scan(void) /* scan next character, return literal next */ |
405 |
|
{ |
406 |
< |
register int lnext = 0; |
406 |
> |
int lnext = 0; |
407 |
|
|
408 |
|
do { |
409 |
|
if (linbuf[linepos] == '\0') |
442 |
|
) |
443 |
|
{ |
444 |
|
static char buf[16]; |
445 |
< |
register char *cp; |
445 |
> |
char *cp; |
446 |
|
int neg = 0; |
447 |
|
|
448 |
|
if (l == 0) |
468 |
|
char *err |
469 |
|
) |
470 |
|
{ |
471 |
< |
register int i; |
471 |
> |
int i; |
472 |
|
|
473 |
|
if (infile != NULL || lineno != 0) { |
474 |
|
if (infile != NULL) eputs(infile); |
492 |
|
|
493 |
|
void |
494 |
|
addekid( /* add a child to ep */ |
495 |
< |
register EPNODE *ep, |
495 |
> |
EPNODE *ep, |
496 |
|
EPNODE *ekid |
497 |
|
) |
498 |
|
{ |
511 |
|
getname(void) /* scan an identifier */ |
512 |
|
{ |
513 |
|
static char str[RMAXWORD+1]; |
514 |
< |
register int i, lnext; |
514 |
> |
int i, lnext; |
515 |
|
|
516 |
|
lnext = nextc; |
517 |
|
for (i = 0; i < RMAXWORD && isid(lnext); i++, lnext = scan()) |
527 |
|
int |
528 |
|
getinum(void) /* scan a positive integer */ |
529 |
|
{ |
530 |
< |
register int n, lnext; |
530 |
> |
int n, lnext; |
531 |
|
|
532 |
|
n = 0; |
533 |
|
lnext = nextc; |
542 |
|
double |
543 |
|
getnum(void) /* scan a positive float */ |
544 |
|
{ |
545 |
< |
register int i, lnext; |
545 |
> |
int i, lnext; |
546 |
|
char str[RMAXWORD+1]; |
547 |
|
|
548 |
|
i = 0; |
582 |
|
|
583 |
|
|
584 |
|
EPNODE * |
585 |
< |
getE1(void) /* E1 -> E1 ADDOP E2 */ |
585 |
> |
getE1(void) /* E1 -> E1 ADDOP E2 */ |
586 |
|
/* E2 */ |
587 |
|
{ |
588 |
< |
register EPNODE *ep1, *ep2; |
588 |
> |
EPNODE *ep1, *ep2; |
589 |
|
|
590 |
|
ep1 = getE2(); |
591 |
|
while (nextc == '+' || nextc == '-') { |
604 |
|
|
605 |
|
|
606 |
|
EPNODE * |
607 |
< |
getE2(void) /* E2 -> E2 MULOP E3 */ |
607 |
> |
getE2(void) /* E2 -> E2 MULOP E3 */ |
608 |
|
/* E3 */ |
609 |
|
{ |
610 |
< |
register EPNODE *ep1, *ep2; |
610 |
> |
EPNODE *ep1, *ep2; |
611 |
|
|
612 |
|
ep1 = getE3(); |
613 |
|
while (nextc == '*' || nextc == '/') { |
616 |
|
scan(); |
617 |
|
addekid(ep2, ep1); |
618 |
|
addekid(ep2, getE3()); |
619 |
< |
if (esupport&E_RCONST && |
620 |
< |
ep1->type == NUM && ep1->sibling->type == NUM) |
621 |
< |
ep2 = rconst(ep2); |
619 |
> |
if (esupport&E_RCONST) { |
620 |
> |
EPNODE *ep3 = ep1->sibling; |
621 |
> |
if (ep1->type == NUM && ep3->type == NUM) { |
622 |
> |
ep2 = rconst(ep2); |
623 |
> |
} else if (ep3->type == NUM) { |
624 |
> |
if (ep2->type == '/') { |
625 |
> |
if (ep3->v.num == 0) |
626 |
> |
syntax("divide by zero constant"); |
627 |
> |
ep2->type = '*'; /* for speed */ |
628 |
> |
ep3->v.num = 1./ep3->v.num; |
629 |
> |
} else if (ep3->v.num == 0) { |
630 |
> |
ep1->sibling = NULL; /* (E2 * 0) */ |
631 |
> |
epfree(ep2); |
632 |
> |
ep2 = ep3; |
633 |
> |
} |
634 |
> |
} else if (ep1->type == NUM && ep1->v.num == 0) { |
635 |
> |
epfree(ep3); /* (0 * E3) or (0 / E3) */ |
636 |
> |
ep1->sibling = NULL; |
637 |
> |
efree((char *)ep2); |
638 |
> |
ep2 = ep1; |
639 |
> |
} |
640 |
> |
} |
641 |
|
ep1 = ep2; |
642 |
|
} |
643 |
|
return(ep1); |
645 |
|
|
646 |
|
|
647 |
|
EPNODE * |
648 |
< |
getE3(void) /* E3 -> E4 ^ E3 */ |
648 |
> |
getE3(void) /* E3 -> E4 ^ E3 */ |
649 |
|
/* E4 */ |
650 |
|
{ |
651 |
< |
register EPNODE *ep1, *ep2; |
651 |
> |
EPNODE *ep1, *ep2; |
652 |
|
|
653 |
< |
ep1 = getE4(); |
654 |
< |
if (nextc == '^') { |
653 |
> |
ep1 = getE4(); |
654 |
> |
if (nextc != '^') |
655 |
> |
return(ep1); |
656 |
|
ep2 = newnode(); |
657 |
|
ep2->type = nextc; |
658 |
|
scan(); |
659 |
|
addekid(ep2, ep1); |
660 |
|
addekid(ep2, getE3()); |
661 |
< |
if (esupport&E_RCONST && |
662 |
< |
ep1->type == NUM && ep1->sibling->type == NUM) |
663 |
< |
ep2 = rconst(ep2); |
661 |
> |
if (esupport&E_RCONST) { |
662 |
> |
EPNODE *ep3 = ep1->sibling; |
663 |
> |
if (ep1->type == NUM && ep3->type == NUM) { |
664 |
> |
ep2 = rconst(ep2); |
665 |
> |
} else if (ep1->type == NUM && ep1->v.num == 0) { |
666 |
> |
epfree(ep3); /* (0 ^ E3) */ |
667 |
> |
ep1->sibling = NULL; |
668 |
> |
efree((char *)ep2); |
669 |
> |
ep2 = ep1; |
670 |
> |
} else if ((ep3->type == NUM && ep3->v.num == 0) || |
671 |
> |
(ep1->type == NUM && ep1->v.num == 1)) { |
672 |
> |
epfree(ep2); /* (E4 ^ 0) or (1 ^ E3) */ |
673 |
> |
ep2 = newnode(); |
674 |
> |
ep2->type = NUM; |
675 |
> |
ep2->v.num = 1; |
676 |
> |
} |
677 |
> |
} |
678 |
|
return(ep2); |
644 |
– |
} |
645 |
– |
return(ep1); |
679 |
|
} |
680 |
|
|
681 |
|
|
682 |
|
EPNODE * |
683 |
< |
getE4(void) /* E4 -> ADDOP E5 */ |
683 |
> |
getE4(void) /* E4 -> ADDOP E5 */ |
684 |
|
/* E5 */ |
685 |
|
{ |
686 |
< |
register EPNODE *ep1, *ep2; |
686 |
> |
EPNODE *ep1, *ep2; |
687 |
|
|
688 |
|
if (nextc == '-') { |
689 |
|
scan(); |
693 |
|
return(ep2); |
694 |
|
} |
695 |
|
if (ep2->type == UMINUS) { /* don't generate -(-E5) */ |
696 |
+ |
ep1 = ep2->v.kid; |
697 |
|
efree((char *)ep2); |
698 |
< |
return(ep2->v.kid); |
698 |
> |
return(ep1); |
699 |
|
} |
700 |
|
ep1 = newnode(); |
701 |
|
ep1->type = UMINUS; |
718 |
|
{ |
719 |
|
int i; |
720 |
|
char *nam; |
721 |
< |
register EPNODE *ep1, *ep2; |
721 |
> |
EPNODE *ep1, *ep2; |
722 |
|
|
723 |
|
if (nextc == '(') { |
724 |
|
scan(); |
788 |
|
|
789 |
|
EPNODE * |
790 |
|
rconst( /* reduce a constant expression */ |
791 |
< |
register EPNODE *epar |
791 |
> |
EPNODE *epar |
792 |
|
) |
793 |
|
{ |
794 |
< |
register EPNODE *ep; |
794 |
> |
EPNODE *ep; |
795 |
|
|
796 |
|
ep = newnode(); |
797 |
|
ep->type = NUM; |
807 |
|
|
808 |
|
int |
809 |
|
isconstvar( /* is ep linked to a constant expression? */ |
810 |
< |
register EPNODE *ep |
810 |
> |
EPNODE *ep |
811 |
|
) |
812 |
|
{ |
813 |
< |
register EPNODE *ep1; |
813 |
> |
EPNODE *ep1; |
814 |
|
|
815 |
|
if (esupport&E_FUNCTION && ep->type == FUNC) { |
816 |
|
if (!isconstfun(ep->v.kid)) |
833 |
|
|
834 |
|
int |
835 |
|
isconstfun( /* is ep linked to a constant function? */ |
836 |
< |
register EPNODE *ep |
836 |
> |
EPNODE *ep |
837 |
|
) |
838 |
|
{ |
839 |
< |
register EPNODE *dp; |
840 |
< |
register LIBR *lp; |
839 |
> |
EPNODE *dp; |
840 |
> |
LIBR *lp; |
841 |
|
|
842 |
|
if (ep->type != VAR) |
843 |
|
return(0); |