| 428 |
|
if (accumulate > 1) /* need terminator? */ |
| 429 |
|
memset(orgdir[2*n++], 0, sizeof(FVECT)*2); |
| 430 |
|
n *= sizeof(FVECT)*2; /* send assignment */ |
| 431 |
< |
if (writebuf(kidpr[i].w, (char *)orgdir, n) != n) |
| 431 |
> |
if (writebuf(kidpr[i].w, orgdir, n) != n) |
| 432 |
|
error(SYSTEM, "pipe write error"); |
| 433 |
|
kida[i].r1 = lastray+1; |
| 434 |
|
lastray += kida[i].nr = ninq; /* mark as busy */ |
| 527 |
|
if (++ninq >= MAXIQ) { |
| 528 |
|
i = next_child_ready(); /* get eager child */ |
| 529 |
|
n = sizeof(FVECT)*2 * ninq; /* give assignment */ |
| 530 |
< |
if (writebuf(kidpr[i].w, (char *)orgdir, n) != n) |
| 530 |
> |
if (writebuf(kidpr[i].w, orgdir, n) != n) |
| 531 |
|
error(SYSTEM, "pipe write error"); |
| 532 |
|
kida[i].r1 = lastray+1; |
| 533 |
|
lastray += kida[i].nr = ninq; |
| 541 |
|
if (ninq) { /* polish off input */ |
| 542 |
|
i = next_child_ready(); |
| 543 |
|
n = sizeof(FVECT)*2 * ninq; |
| 544 |
< |
if (writebuf(kidpr[i].w, (char *)orgdir, n) != n) |
| 544 |
> |
if (writebuf(kidpr[i].w, orgdir, n) != n) |
| 545 |
|
error(SYSTEM, "pipe write error"); |
| 546 |
|
kida[i].r1 = lastray+1; |
| 547 |
|
lastray += kida[i].nr = ninq; |
| 549 |
|
} |
| 550 |
|
memset(orgdir, 0, sizeof(FVECT)*2); /* get results */ |
| 551 |
|
for (i = nchild; i--; ) { |
| 552 |
< |
writebuf(kidpr[i].w, (char *)orgdir, sizeof(FVECT)*2); |
| 552 |
> |
writebuf(kidpr[i].w, orgdir, sizeof(FVECT)*2); |
| 553 |
|
queue_results(i); |
| 554 |
|
} |
| 555 |
|
if (recover) /* and from before? */ |