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 buffers RAYQLEN rays before sending to |
34 |
< |
* children, each of which may internally buffer RAYQLEN rays. |
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 |
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 |
162 |
|
int fd_send; /* write to child here */ |
163 |
|
int fd_recv; /* read from child here */ |
164 |
|
int npending; /* # rays in process */ |
165 |
< |
unsigned long rno[RAYQLEN]; /* working on these rays */ |
165 |
> |
RNUMBER rno[RAYQLEN]; /* working on these rays */ |
166 |
|
} r_proc[MAX_NPROCS]; /* our child processes */ |
167 |
|
|
168 |
|
static RAY r_queue[2*RAYQLEN]; /* ray i/o buffer */ |
169 |
|
static int r_send_next; /* next send ray placement */ |
170 |
|
static int r_recv_first; /* position of first unreported ray */ |
171 |
< |
static int r_recv_next; /* next receive ray placement */ |
171 |
> |
static int r_recv_next; /* next received ray placement */ |
172 |
|
|
173 |
|
#define sendq_full() (r_send_next >= RAYQLEN) |
174 |
|
|
176 |
|
static void ray_pchild(int fd_in, int fd_out); |
177 |
|
|
178 |
|
|
179 |
< |
extern void |
179 |
> |
void |
180 |
|
ray_pinit( /* initialize ray-tracing processes */ |
181 |
|
char *otnm, |
182 |
|
int nproc |
229 |
|
} |
230 |
|
|
231 |
|
|
232 |
< |
extern void |
232 |
> |
void |
233 |
|
ray_psend( /* add a ray to our send queue */ |
234 |
|
RAY *r |
235 |
|
) |
244 |
|
} |
245 |
|
|
246 |
|
|
247 |
< |
extern int |
247 |
> |
int |
248 |
|
ray_pqueue( /* queue a ray for computation */ |
249 |
|
RAY *r |
250 |
|
) |
273 |
|
} |
274 |
|
|
275 |
|
|
276 |
< |
extern int |
276 |
> |
int |
277 |
|
ray_presult( /* check for a completed ray */ |
278 |
|
RAY *r, |
279 |
|
int poll |
310 |
|
if (FD_ISSET(r_proc[pn].fd_recv, &readset) || |
311 |
|
FD_ISSET(r_proc[pn].fd_recv, &errset)) |
312 |
|
break; |
313 |
< |
/* call select if we must */ |
313 |
> |
/* call select() if we must */ |
314 |
|
if (pn < 0) { |
315 |
|
FD_ZERO(&readset); FD_ZERO(&errset); n = 0; |
316 |
|
for (pn = ray_pnprocs; pn--; ) { |
370 |
|
} |
371 |
|
|
372 |
|
|
373 |
< |
extern void |
373 |
> |
void |
374 |
|
ray_pdone( /* reap children and free data */ |
375 |
|
int freall |
376 |
|
) |
417 |
|
r_queue[i].parent = NULL; |
418 |
|
r_queue[i].clipset = NULL; |
419 |
|
r_queue[i].slights = NULL; |
420 |
+ |
r_queue[i].rlvl = 0; |
421 |
|
samplendx++; |
422 |
|
rayclear(&r_queue[i]); |
423 |
|
rayvalue(&r_queue[i]); |
434 |
|
} |
435 |
|
|
436 |
|
|
437 |
< |
extern void |
437 |
> |
void |
438 |
|
ray_popen( /* open the specified # processes */ |
439 |
|
int nadd |
440 |
|
) |
484 |
|
} |
485 |
|
|
486 |
|
|
487 |
< |
extern void |
487 |
> |
void |
488 |
|
ray_pclose( /* close one or more child processes */ |
489 |
|
int nsub |
490 |
|
) |