| 23 |
|
* The first step is opening one or more rendering processes |
| 24 |
|
* with a call to ray_pinit(oct, nproc). Before calling fork(), |
| 25 |
|
* ray_pinit() loads the octree and data structures into the |
| 26 |
< |
* caller's memory. This permits all sorts of queries that |
| 27 |
< |
* wouldn't be possible otherwise, without causing any real |
| 26 |
> |
* caller's memory, and ray_popen() synchronizes the ambient |
| 27 |
> |
* file, if any. Shared memory permits all sorts of queries |
| 28 |
> |
* that wouldn't be possible otherwise, without causing any real |
| 29 |
|
* memory overhead, since all the static data are shared |
| 30 |
|
* between processes. Rays are then traced using a simple |
| 31 |
|
* queuing mechanism, explained below. |
| 32 |
|
* |
| 33 |
< |
* The ray queue holds as many rays as there are rendering |
| 34 |
< |
* processes. Rays are queued and returned by a single |
| 33 |
> |
* The ray queue buffers RAYQLEN rays before sending to |
| 34 |
> |
* children, each of which may internally buffer RAYQLEN rays. |
| 35 |
> |
* |
| 36 |
> |
* Rays are queued and returned by a single |
| 37 |
|
* ray_pqueue() call. A ray_pqueue() return |
| 38 |
|
* value of 0 indicates that no rays are ready |
| 39 |
|
* and the queue is not yet full. A return value of 1 |
| 46 |
|
* myRay.rorg = ( ray origin point ) |
| 47 |
|
* myRay.rdir = ( normalized ray direction ) |
| 48 |
|
* myRay.rmax = ( maximum length, or zero for no limit ) |
| 49 |
< |
* rayorigin(&myRay, NULL, PRIMARY, 1.0); |
| 49 |
> |
* rayorigin(&myRay, PRIMARY, NULL, NULL); |
| 50 |
|
* myRay.rno = ( my personal ray identifier ) |
| 51 |
|
* if (ray_pqueue(&myRay) == 1) |
| 52 |
|
* { do something with results } |
| 108 |
|
* Note: These routines are written to coordinate with the |
| 109 |
|
* definitions in raycalls.c, and in fact depend on them. |
| 110 |
|
* If you want to trace a ray and get a result synchronously, |
| 111 |
< |
* use the ray_trace() call to compute it in the parent process |
| 111 |
> |
* use the ray_trace() call to compute it in the parent process. |
| 112 |
|
* This will not interfere with any subprocess calculations, |
| 113 |
|
* but beware that a fatal error may end with a call to quit(). |
| 114 |
|
* |
| 141 |
|
#include "selcall.h" |
| 142 |
|
|
| 143 |
|
#ifndef RAYQLEN |
| 144 |
< |
#define RAYQLEN 16 /* # rays to send at once */ |
| 144 |
> |
#define RAYQLEN 12 /* # rays to send at once */ |
| 145 |
|
#endif |
| 146 |
|
|
| 147 |
|
#ifndef MAX_RPROCS |
| 173 |
|
#define sendq_full() (r_send_next >= RAYQLEN) |
| 174 |
|
|
| 175 |
|
static int ray_pflush(void); |
| 176 |
< |
static void ray_pchild(int fd_in, int fd_out); |
| 176 |
> |
static void ray_pchild(int fd_in, int fd_out); |
| 177 |
|
|
| 178 |
|
|
| 179 |
|
extern void |
| 246 |
|
if (sendq_full() && ray_pflush() <= 0) |
| 247 |
|
error(INTERNAL, "ray_pflush failed in ray_psend"); |
| 248 |
|
|
| 249 |
< |
r_queue[r_send_next] = *r; |
| 247 |
< |
r_send_next++; |
| 249 |
> |
r_queue[r_send_next++] = *r; |
| 250 |
|
} |
| 251 |
|
|
| 252 |
|
|
| 265 |
|
/* wait for a result */ |
| 266 |
|
rval = ray_presult(r, 0); |
| 267 |
|
/* put new ray in queue */ |
| 268 |
< |
r_queue[r_send_next] = mySend; |
| 267 |
< |
r_send_next++; |
| 268 |
> |
r_queue[r_send_next++] = mySend; |
| 269 |
|
return(rval); /* done */ |
| 270 |
|
} |
| 271 |
< |
/* add ray to send queue */ |
| 272 |
< |
r_queue[r_send_next] = *r; |
| 272 |
< |
r_send_next++; |
| 271 |
> |
/* else add ray to send queue */ |
| 272 |
> |
r_queue[r_send_next++] = *r; |
| 273 |
|
/* check for returned ray... */ |
| 274 |
|
if (r_recv_first >= r_recv_next) |
| 275 |
|
return(0); |
| 276 |
|
/* ...one is sitting in queue */ |
| 277 |
< |
*r = r_queue[r_recv_first]; |
| 278 |
< |
r_recv_first++; |
| 277 |
> |
*r = r_queue[r_recv_first++]; |
| 278 |
|
return(1); |
| 279 |
|
} |
| 280 |
|
|
| 294 |
|
return(0); |
| 295 |
|
/* check queued results first */ |
| 296 |
|
if (r_recv_first < r_recv_next) { |
| 297 |
< |
*r = r_queue[r_recv_first]; |
| 299 |
< |
r_recv_first++; |
| 297 |
> |
*r = r_queue[r_recv_first++]; |
| 298 |
|
return(1); |
| 299 |
|
} |
| 300 |
|
n = ray_pnprocs - ray_pnidle; /* pending before flush? */ |
| 368 |
|
rp->slights = NULL; |
| 369 |
|
} |
| 370 |
|
/* return first ray received */ |
| 371 |
< |
*r = r_queue[r_recv_first]; |
| 374 |
< |
r_recv_first++; |
| 371 |
> |
*r = r_queue[r_recv_first++]; |
| 372 |
|
return(1); |
| 373 |
|
} |
| 374 |
|
|
| 399 |
|
/* read each ray request set */ |
| 400 |
|
while ((n = read(fd_in, (char *)r_queue, sizeof(r_queue))) > 0) { |
| 401 |
|
int n2; |
| 402 |
< |
if (n % sizeof(RAY)) |
| 402 |
> |
if (n < sizeof(RAY)) |
| 403 |
|
break; |
| 407 |
– |
n /= sizeof(RAY); |
| 404 |
|
/* get smuggled set length */ |
| 405 |
< |
n2 = r_queue[0].crtype - n; |
| 405 |
> |
n2 = sizeof(RAY)*r_queue[0].crtype - n; |
| 406 |
|
if (n2 < 0) |
| 407 |
|
error(INTERNAL, "buffer over-read in ray_pchild"); |
| 408 |
|
if (n2 > 0) { /* read the rest of the set */ |
| 409 |
< |
i = readbuf(fd_in, (char *)(r_queue+n), |
| 410 |
< |
sizeof(RAY)*n2); |
| 415 |
< |
if (i != sizeof(RAY)*n2) |
| 409 |
> |
i = readbuf(fd_in, (char *)r_queue + n, n2); |
| 410 |
> |
if (i != n2) |
| 411 |
|
break; |
| 412 |
|
n += n2; |
| 413 |
|
} |
| 414 |
+ |
n /= sizeof(RAY); |
| 415 |
|
/* evaluate rays */ |
| 416 |
|
for (i = 0; i < n; i++) { |
| 417 |
|
r_queue[i].crtype = r_queue[i].rtype; |
| 444 |
|
nadd = MAX_NPROCS - ray_pnprocs; |
| 445 |
|
if (nadd <= 0) |
| 446 |
|
return; |
| 447 |
< |
fflush(stderr); /* clear pending output */ |
| 448 |
< |
fflush(stdout); |
| 447 |
> |
ambsync(); /* load any new ambient values */ |
| 448 |
> |
fflush(NULL); /* clear pending output */ |
| 449 |
|
while (nadd--) { /* fork each new process */ |
| 450 |
|
int p0[2], p1[2]; |
| 451 |
|
if (pipe(p0) < 0 || pipe(p1) < 0) |
