211 |
|
} |
212 |
|
|
213 |
|
|
214 |
< |
void |
214 |
> |
static void |
215 |
|
epflatten( /* flatten hierarchies for '+', '*' */ |
216 |
|
EPNODE *epar |
217 |
|
) |
218 |
|
{ |
219 |
|
EPNODE *ep; |
220 |
|
|
221 |
< |
if (epar->nkids < 0) /* don't really handle this properly */ |
221 |
> |
if (epar->nkids < 0) /* we don't really handle this properly */ |
222 |
|
epar->nkids *= -1; |
223 |
|
|
224 |
|
for (ep = epar->v.kid; ep != NULL; ep = ep->sibling) |
242 |
|
{ |
243 |
|
EPNODE *ep; |
244 |
|
|
245 |
< |
if ((epar->type == '+') | (epar->type == '*')) |
245 |
> |
if ((epar->type == '+') | (epar->type == '*')) |
246 |
|
epflatten(epar); /* commutative & associative */ |
247 |
|
|
248 |
< |
if (epar->nkids) /* do children if any */ |
248 |
> |
if (epar->nkids) /* do children if any */ |
249 |
|
for (ep = epar->v.kid; ep != NULL; ep = ep->sibling) |
250 |
|
epoptimize(ep); |
251 |
|
|
349 |
|
EPNODE *ep2 = ep1->sibling; |
350 |
|
double d; |
351 |
|
|
352 |
< |
d = envalue(ep2); |
352 |
> |
d = evalue(ep2); |
353 |
|
if (d == 0.0) { |
354 |
|
wputs("Division by zero\n"); |
355 |
|
errno = ERANGE; |