295 |
|
/* check queued results first */ |
296 |
|
if (r_recv_first < r_recv_next) { |
297 |
|
*r = r_queue[r_recv_first++]; |
298 |
+ |
/* make sure send queue has room */ |
299 |
+ |
if (sendq_full() && ray_pflush() <= 0) |
300 |
+ |
return(-1); |
301 |
|
return(1); |
302 |
|
} |
303 |
|
n = ray_pnprocs - ray_pnidle; /* pending before flush? */ |
311 |
|
n = ray_pnprocs - ray_pnidle; |
312 |
|
if (n <= 0) /* return if nothing to await */ |
313 |
|
return(0); |
314 |
+ |
if (!poll && ray_pnprocs == 1) /* one process -> skip select() */ |
315 |
+ |
FD_SET(r_proc[0].fd_recv, &readset); |
316 |
+ |
|
317 |
|
getready: /* any children waiting for us? */ |
318 |
|
for (pn = ray_pnprocs; pn--; ) |
319 |
|
if (FD_ISSET(r_proc[pn].fd_recv, &readset) || |