13 |
|
* These calls are designed similarly to the ones in raycalls.c, |
14 |
|
* but allow for multiple rendering processes on the same host |
15 |
|
* machine. There is no sense in specifying more child processes |
16 |
< |
* than you have processors, but one child may help by allowing |
16 |
> |
* than you have processor cores, but one child may help by allowing |
17 |
|
* asynchronous ray computation in an interactive program, and |
18 |
|
* will protect the caller from fatal rendering errors. |
19 |
|
* |
20 |
< |
* You should first read and undrstand the header in raycalls.c, |
20 |
> |
* You should first read and understand the header in raycalls.c, |
21 |
|
* as some things are explained there that are not repated here. |
22 |
|
* |
23 |
|
* The first step is opening one or more rendering processes |
25 |
|
* ray_pinit() loads the octree and data structures into the |
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 |
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 |
30 |
> |
* between processes. Rays are traced using a simple |
31 |
|
* queuing mechanism, explained below. |
32 |
|
* |
33 |
< |
* The ray queue holds at least RAYQLEN rays, up to |
34 |
< |
* as many rays as there are rendering processes. |
33 |
> |
* The ray queue buffers RAYQLEN rays before sending to |
34 |
> |
* children, each of which may internally buffer RAYQLEN rays |
35 |
> |
* during evaluation. Rays are not returned in the order |
36 |
> |
* they are sent when multiple processes are open. |
37 |
> |
* |
38 |
|
* Rays are queued and returned by a single |
39 |
|
* ray_pqueue() call. A ray_pqueue() return |
40 |
|
* value of 0 indicates that no rays are ready |
75 |
|
* until a value is available, returning 0 only if the |
76 |
|
* queue is completely empty. A negative return value |
77 |
|
* indicates that a rendering process died. If this |
78 |
< |
* happens, ray_close(0) is automatically called to close |
78 |
> |
* happens, ray_pclose(0) is automatically called to close |
79 |
|
* all child processes, and ray_pnprocs is set to zero. |
80 |
|
* |
81 |
|
* If you just want to fill the ray queue without checking for |
95 |
|
* Any queued ray calculations will be awaited and discarded. |
96 |
|
* As with ray_done(), ray_pdone(0) hangs onto data files |
97 |
|
* and fonts that are likely to be used in subsequent renderings. |
98 |
< |
* Whether you want to bother cleaning up memory or not, you |
99 |
< |
* should at least call ray_pclose(0) to clean the child processes. |
98 |
> |
* Whether you need to clean up memory or not, you should |
99 |
> |
* at least call ray_pclose(0) to await the child processes. |
100 |
|
* |
101 |
|
* Warning: You cannot affect any of the rendering processes |
102 |
|
* by changing global parameter values onece ray_pinit() has |
126 |
|
* returning a negative value from ray_pqueue() or |
127 |
|
* ray_presult(). If you get a negative value from either |
128 |
|
* of these calls, you can assume that the processes have |
129 |
< |
* been cleaned up with a call to ray_close(), though you |
129 |
> |
* been cleaned up with a call to ray_pclose(), though you |
130 |
|
* will have to call ray_pdone() yourself if you want to |
131 |
|
* free memory. Obviously, you cannot continue rendering |
132 |
|
* without risking further errors, but otherwise your |
133 |
|
* process should not be compromised. |
134 |
|
*/ |
135 |
|
|
133 |
– |
#include <stdio.h> |
134 |
– |
#include <sys/types.h> |
135 |
– |
#include <sys/wait.h> /* XXX platform */ |
136 |
– |
|
136 |
|
#include "rtprocess.h" |
137 |
|
#include "ray.h" |
138 |
|
#include "ambient.h" |
139 |
+ |
#include <sys/types.h> |
140 |
+ |
#include <sys/wait.h> |
141 |
|
#include "selcall.h" |
142 |
|
|
143 |
|
#ifndef RAYQLEN |
154 |
|
|
155 |
|
extern char *shm_boundary; /* boundary of shared memory */ |
156 |
|
|
157 |
+ |
int ray_pfifo = 0; /* maintain ray call order? */ |
158 |
|
int ray_pnprocs = 0; /* number of child processes */ |
159 |
|
int ray_pnidle = 0; /* number of idle children */ |
160 |
|
|
163 |
|
int fd_send; /* write to child here */ |
164 |
|
int fd_recv; /* read from child here */ |
165 |
|
int npending; /* # rays in process */ |
166 |
< |
unsigned long rno[RAYQLEN]; /* working on these rays */ |
166 |
> |
RNUMBER rno[RAYQLEN]; /* working on these rays */ |
167 |
|
} r_proc[MAX_NPROCS]; /* our child processes */ |
168 |
|
|
169 |
|
static RAY r_queue[2*RAYQLEN]; /* ray i/o buffer */ |
188 |
|
|
189 |
|
ray_init(otnm); /* load the shared scene */ |
190 |
|
|
189 |
– |
preload_objs(); /* preload auxiliary data */ |
190 |
– |
|
191 |
– |
/* set shared memory boundary */ |
192 |
– |
shm_boundary = (char *)malloc(16); |
193 |
– |
strcpy(shm_boundary, "SHM_BOUNDARY"); |
194 |
– |
|
191 |
|
r_send_next = 0; /* set up queue */ |
192 |
|
r_recv_first = r_recv_next = RAYQLEN; |
193 |
|
|
241 |
|
if (sendq_full() && ray_pflush() <= 0) |
242 |
|
error(INTERNAL, "ray_pflush failed in ray_psend"); |
243 |
|
|
244 |
< |
r_queue[r_send_next] = *r; |
249 |
< |
r_send_next++; |
244 |
> |
r_queue[r_send_next++] = *r; |
245 |
|
} |
246 |
|
|
247 |
|
|
254 |
|
return(0); |
255 |
|
/* check for full send queue */ |
256 |
|
if (sendq_full()) { |
257 |
< |
RAY mySend; |
263 |
< |
int rval; |
264 |
< |
mySend = *r; |
257 |
> |
RAY mySend = *r; |
258 |
|
/* wait for a result */ |
259 |
< |
rval = ray_presult(r, 0); |
259 |
> |
if (ray_presult(r, 0) <= 0) |
260 |
> |
return(-1); |
261 |
|
/* put new ray in queue */ |
262 |
< |
r_queue[r_send_next] = mySend; |
263 |
< |
r_send_next++; |
264 |
< |
return(rval); /* done */ |
262 |
> |
r_queue[r_send_next++] = mySend; |
263 |
> |
/* XXX r_send_next may now be > RAYQLEN */ |
264 |
> |
return(1); |
265 |
|
} |
266 |
|
/* else add ray to send queue */ |
267 |
< |
r_queue[r_send_next] = *r; |
274 |
< |
r_send_next++; |
267 |
> |
r_queue[r_send_next++] = *r; |
268 |
|
/* check for returned ray... */ |
269 |
|
if (r_recv_first >= r_recv_next) |
270 |
|
return(0); |
271 |
|
/* ...one is sitting in queue */ |
272 |
< |
*r = r_queue[r_recv_first]; |
280 |
< |
r_recv_first++; |
272 |
> |
*r = r_queue[r_recv_first++]; |
273 |
|
return(1); |
274 |
|
} |
275 |
|
|
289 |
|
return(0); |
290 |
|
/* check queued results first */ |
291 |
|
if (r_recv_first < r_recv_next) { |
292 |
< |
*r = r_queue[r_recv_first]; |
301 |
< |
r_recv_first++; |
292 |
> |
*r = r_queue[r_recv_first++]; |
293 |
|
return(1); |
294 |
|
} |
295 |
|
n = ray_pnprocs - ray_pnidle; /* pending before flush? */ |
303 |
|
n = ray_pnprocs - ray_pnidle; |
304 |
|
if (n <= 0) /* return if nothing to await */ |
305 |
|
return(0); |
306 |
+ |
if (!poll && ray_pnprocs == 1) /* one process -> skip select() */ |
307 |
+ |
FD_SET(r_proc[0].fd_recv, &readset); |
308 |
+ |
|
309 |
|
getready: /* any children waiting for us? */ |
310 |
|
for (pn = ray_pnprocs; pn--; ) |
311 |
|
if (FD_ISSET(r_proc[pn].fd_recv, &readset) || |
394 |
|
{ |
395 |
|
int n; |
396 |
|
register int i; |
397 |
+ |
/* flag child process for quit() */ |
398 |
+ |
ray_pnprocs = -1; |
399 |
|
/* read each ray request set */ |
400 |
|
while ((n = read(fd_in, (char *)r_queue, sizeof(r_queue))) > 0) { |
401 |
|
int n2; |
418 |
|
r_queue[i].parent = NULL; |
419 |
|
r_queue[i].clipset = NULL; |
420 |
|
r_queue[i].slights = NULL; |
421 |
+ |
r_queue[i].rlvl = 0; |
422 |
|
samplendx++; |
423 |
|
rayclear(&r_queue[i]); |
424 |
|
rayvalue(&r_queue[i]); |
446 |
|
if (nadd <= 0) |
447 |
|
return; |
448 |
|
ambsync(); /* load any new ambient values */ |
449 |
+ |
if (shm_boundary == NULL) { /* first child process? */ |
450 |
+ |
preload_objs(); /* preload auxiliary data */ |
451 |
+ |
/* set shared memory boundary */ |
452 |
+ |
shm_boundary = (char *)malloc(16); |
453 |
+ |
strcpy(shm_boundary, "SHM_BOUNDARY"); |
454 |
+ |
} |
455 |
|
fflush(NULL); /* clear pending output */ |
456 |
|
while (nadd--) { /* fork each new process */ |
457 |
|
int p0[2], p1[2]; |
526 |
|
quit(ec) /* make sure exit is called */ |
527 |
|
int ec; |
528 |
|
{ |
529 |
+ |
if (ray_pnprocs > 0) /* close children if any */ |
530 |
+ |
ray_pclose(0); |
531 |
|
exit(ec); |
532 |
|
} |