147 |
|
#include "selcall.h" |
148 |
|
|
149 |
|
#ifndef RAYQLEN |
150 |
< |
#define RAYQLEN 12 /* # rays to send at once */ |
150 |
> |
#define RAYQLEN 24 /* # rays to send at once */ |
151 |
|
#endif |
152 |
|
|
153 |
|
#ifndef MAX_RPROCS |
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)/nc--; |
215 |
> |
n = (r_send_next - sfirst) / nc--; |
216 |
|
if (!n) |
217 |
|
continue; |
218 |
|
/* smuggle set size in crtype */ |
290 |
|
static struct timeval tpoll; /* zero timeval struct */ |
291 |
|
static fd_set readset, errset; |
292 |
|
int n, ok; |
293 |
< |
register int pn; |
293 |
> |
int pn; |
294 |
|
|
295 |
|
if (r == NULL) |
296 |
|
return(0); |
368 |
|
} |
369 |
|
/* preen returned rays */ |
370 |
|
for (n = r_recv_next - r_recv_first; n--; ) { |
371 |
< |
register RAY *rp = &r_queue[r_recv_first + n]; |
371 |
> |
RAY *rp = &r_queue[r_recv_first + n]; |
372 |
|
rp->rno = r_proc[pn].rno[n]; |
373 |
|
rp->parent = NULL; |
374 |
|
rp->newcset = rp->clipset = NULL; |
404 |
|
) |
405 |
|
{ |
406 |
|
int n; |
407 |
< |
register int i; |
407 |
> |
int i; |
408 |
|
/* flag child process for quit() */ |
409 |
|
ray_pnprocs = -1; |
410 |
|
/* read each ray request set */ |