| 218 |
|
{ |
| 219 |
|
EPNODE *ep; |
| 220 |
|
|
| 221 |
< |
if (epar->nkids < 0) { |
| 222 |
< |
eputs("Cannot flatten EPNODE array\n"); |
| 223 |
< |
quit(1); |
| 224 |
< |
} |
| 221 |
> |
if (epar->nkids < 0) /* can't handle array allocations */ |
| 222 |
> |
return; |
| 223 |
> |
|
| 224 |
|
for (ep = epar->v.kid; ep != NULL; ep = ep->sibling) |
| 225 |
< |
while (ep->type == epar->type) { |
| 225 |
> |
while (ep->type == epar->type && ep->nkids > 0) { |
| 226 |
|
EPNODE *ep1 = ep->v.kid; |
| 227 |
|
while (ep1->sibling != NULL) |
| 228 |
|
ep1 = ep1->sibling; |
| 229 |
|
ep1->sibling = ep->sibling; |
| 230 |
< |
epar->nkids += nekids(ep) - 1; |
| 230 |
> |
epar->nkids += ep->nkids - 1; |
| 231 |
|
ep1 = ep->v.kid; |
| 232 |
|
*ep = *ep1; |
| 233 |
|
efree(ep1); /* not epfree()! */ |
| 346 |
|
) |
| 347 |
|
{ |
| 348 |
|
EPNODE *ep1 = ep->v.kid; |
| 349 |
< |
EPNODE *ep2 = ep1->sibling; |
| 351 |
< |
double d; |
| 349 |
> |
double den = evalue(ep1->sibling); |
| 350 |
|
|
| 351 |
< |
d = evalue(ep2); |
| 354 |
< |
if (d == 0.0) { |
| 351 |
> |
if (den == 0.0) { |
| 352 |
|
wputs("Division by zero\n"); |
| 353 |
|
errno = ERANGE; |
| 354 |
|
return(0.0); |
| 355 |
|
} |
| 356 |
< |
return(envalue(ep1) / d); |
| 356 |
> |
return(envalue(ep1) / den); |
| 357 |
|
} |
| 358 |
|
|
| 359 |
|
static double |