| 162 |
|
|
| 163 |
|
int ray_pnprocs = 0; /* number of child processes */ |
| 164 |
|
int ray_pnidle = 0; /* number of idle children */ |
| 165 |
– |
int ray_pnbatch = 0; /* throughput over responsiveness? */ |
| 165 |
|
|
| 166 |
|
static struct child_proc { |
| 167 |
|
RT_PID pid; /* child process id */ |
| 212 |
|
for (i = ray_pnprocs; nc && i--; ) { |
| 213 |
|
if (r_proc[i].npending > 0) |
| 214 |
|
continue; /* child looks busy */ |
| 215 |
< |
n = r_send_next - sfirst; |
| 217 |
< |
if (ray_pnbatch) |
| 218 |
< |
nc--; /* maximize bundling for batch calc */ |
| 219 |
< |
else |
| 220 |
< |
n /= nc--; /* distribute work for interactivity */ |
| 215 |
> |
n = (r_send_next - sfirst) / nc--; |
| 216 |
|
if (!n) |
| 217 |
|
continue; |
| 218 |
|
/* smuggle set size in crtype */ |
| 510 |
|
static int inclose = 0; |
| 511 |
|
RAY res; |
| 512 |
|
int i, status = 0; |
| 513 |
+ |
/* check no child / in child */ |
| 514 |
+ |
if (ray_pnprocs <= 0) |
| 515 |
+ |
return; |
| 516 |
|
/* check recursion */ |
| 517 |
|
if (inclose) |
| 518 |
|
return; |
| 519 |
|
inclose++; |
| 522 |
– |
/* check no child / in child */ |
| 523 |
– |
if (ray_pnprocs <= 0) |
| 524 |
– |
return; |
| 520 |
|
/* check argument */ |
| 521 |
|
if ((nsub <= 0) | (nsub > ray_pnprocs)) |
| 522 |
|
nsub = ray_pnprocs; |
| 523 |
< |
/* clear our ray queue */ |
| 523 |
> |
i = 0; /* clear our ray queue */ |
| 524 |
|
while (ray_presult(&res,0) > 0) |
| 525 |
< |
; |
| 525 |
> |
++i; |
| 526 |
> |
if (i) { |
| 527 |
> |
sprintf(errmsg, "dropped %d ray results in ray_pclose()", i); |
| 528 |
> |
error(WARNING, errmsg); |
| 529 |
> |
} |
| 530 |
|
r_send_next = 0; /* hard reset in case of error */ |
| 531 |
|
r_recv_first = r_recv_next = RAYQLEN; |
| 532 |
|
/* close send pipes */ |
