1 |
greg |
2.1 |
#ifndef lint |
2 |
greg |
2.11 |
static const char RCSid[] = "$Id: rc3.c,v 2.10 2012/06/16 17:09:49 greg Exp $"; |
3 |
greg |
2.1 |
#endif |
4 |
|
|
/* |
5 |
|
|
* Accumulate ray contributions for a set of materials |
6 |
|
|
* Controlling process for multiple children |
7 |
|
|
*/ |
8 |
|
|
|
9 |
|
|
#include "rcontrib.h" |
10 |
|
|
#include "platform.h" |
11 |
|
|
#include "rtprocess.h" |
12 |
|
|
#include "selcall.h" |
13 |
|
|
|
14 |
greg |
2.10 |
#define MAXIQ (int)(PIPE_BUF/(sizeof(FVECT)*2)) |
15 |
|
|
|
16 |
greg |
2.1 |
/* Modifier contribution queue (results waiting to be output) */ |
17 |
|
|
typedef struct s_binq { |
18 |
greg |
2.6 |
RNUMBER ndx; /* index for this entry */ |
19 |
|
|
RNUMBER nadded; /* accumulated so far */ |
20 |
greg |
2.1 |
struct s_binq *next; /* next in queue */ |
21 |
|
|
MODCONT *mca[1]; /* contrib. array (extends struct) */ |
22 |
|
|
} BINQ; |
23 |
|
|
|
24 |
|
|
static BINQ *out_bq = NULL; /* output bin queue */ |
25 |
|
|
static BINQ *free_bq = NULL; /* free queue entries */ |
26 |
|
|
|
27 |
greg |
2.6 |
static struct { |
28 |
|
|
RNUMBER r1; /* assigned ray starting index */ |
29 |
|
|
SUBPROC pr; /* PID, i/o descriptors */ |
30 |
|
|
FILE *infp; /* file pointer to read from process */ |
31 |
greg |
2.10 |
int nr; /* number of rays to sum (0 if free) */ |
32 |
greg |
2.6 |
} kida[MAXPROCESS]; /* our child processes */ |
33 |
greg |
2.1 |
|
34 |
|
|
|
35 |
greg |
2.4 |
/* Get new bin queue entry */ |
36 |
greg |
2.1 |
static BINQ * |
37 |
|
|
new_binq() |
38 |
|
|
{ |
39 |
greg |
2.4 |
BINQ *bp; |
40 |
greg |
2.1 |
int i; |
41 |
|
|
|
42 |
greg |
2.4 |
if (free_bq != NULL) { /* something already available? */ |
43 |
|
|
bp = free_bq; |
44 |
greg |
2.1 |
free_bq = bp->next; |
45 |
|
|
bp->next = NULL; |
46 |
greg |
2.6 |
bp->nadded = 0; |
47 |
greg |
2.1 |
return(bp); |
48 |
|
|
} |
49 |
|
|
/* else allocate fresh */ |
50 |
greg |
2.4 |
bp = (BINQ *)malloc(sizeof(BINQ) + sizeof(MODCONT *)*(nmods-1)); |
51 |
greg |
2.1 |
if (bp == NULL) |
52 |
|
|
goto memerr; |
53 |
|
|
for (i = nmods; i--; ) { |
54 |
|
|
MODCONT *mp = (MODCONT *)lu_find(&modconttab,modname[i])->data; |
55 |
|
|
bp->mca[i] = (MODCONT *)malloc(sizeof(MODCONT) + |
56 |
|
|
sizeof(DCOLOR)*(mp->nbins-1)); |
57 |
|
|
if (bp->mca[i] == NULL) |
58 |
|
|
goto memerr; |
59 |
|
|
memcpy(bp->mca[i], mp, sizeof(MODCONT)-sizeof(DCOLOR)); |
60 |
|
|
/* memset(bp->mca[i]->cbin, 0, sizeof(DCOLOR)*mp->nbins); */ |
61 |
|
|
} |
62 |
|
|
bp->ndx = 0; |
63 |
greg |
2.6 |
bp->nadded = 0; |
64 |
greg |
2.1 |
bp->next = NULL; |
65 |
|
|
return(bp); |
66 |
|
|
memerr: |
67 |
|
|
error(SYSTEM, "out of memory in new_binq()"); |
68 |
|
|
return(NULL); |
69 |
|
|
} |
70 |
|
|
|
71 |
|
|
|
72 |
|
|
/* Free a bin queue entry */ |
73 |
|
|
static void |
74 |
|
|
free_binq(BINQ *bp) |
75 |
|
|
{ |
76 |
|
|
int i; |
77 |
|
|
|
78 |
|
|
if (bp == NULL) { /* signal to release our free list */ |
79 |
|
|
while ((bp = free_bq) != NULL) { |
80 |
|
|
free_bq = bp->next; |
81 |
|
|
for (i = nmods; i--; ) |
82 |
|
|
free(bp->mca[i]); |
83 |
|
|
/* Note: we don't own bp->mca[i]->binv */ |
84 |
|
|
free(bp); |
85 |
|
|
} |
86 |
|
|
return; |
87 |
|
|
} |
88 |
|
|
/* clear sums for next use */ |
89 |
|
|
/* for (i = nmods; i--; ) |
90 |
|
|
memset(bp->mca[i]->cbin, 0, sizeof(DCOLOR)*bp->mca[i]->nbins); |
91 |
|
|
*/ |
92 |
|
|
bp->ndx = 0; |
93 |
|
|
bp->next = free_bq; /* push onto free list */ |
94 |
|
|
free_bq = bp; |
95 |
|
|
} |
96 |
|
|
|
97 |
|
|
|
98 |
|
|
/* Add modifier values to accumulation record in queue and clear */ |
99 |
greg |
2.10 |
static void |
100 |
greg |
2.1 |
queue_modifiers() |
101 |
|
|
{ |
102 |
|
|
MODCONT *mpin, *mpout; |
103 |
|
|
int i, j; |
104 |
|
|
|
105 |
|
|
if ((accumulate > 0) | (out_bq == NULL)) |
106 |
|
|
error(CONSISTENCY, "bad call to queue_modifiers()"); |
107 |
|
|
|
108 |
|
|
for (i = nmods; i--; ) { |
109 |
|
|
mpin = (MODCONT *)lu_find(&modconttab,modname[i])->data; |
110 |
|
|
mpout = out_bq->mca[i]; |
111 |
|
|
for (j = mpout->nbins; j--; ) |
112 |
|
|
addcolor(mpout->cbin[j], mpin->cbin[j]); |
113 |
|
|
memset(mpin->cbin, 0, sizeof(DCOLOR)*mpin->nbins); |
114 |
|
|
} |
115 |
greg |
2.5 |
out_bq->nadded++; |
116 |
greg |
2.1 |
} |
117 |
|
|
|
118 |
|
|
|
119 |
greg |
2.4 |
/* Sum one modifier record into another (updates nadded) */ |
120 |
greg |
2.1 |
static void |
121 |
|
|
add_modbin(BINQ *dst, BINQ *src) |
122 |
|
|
{ |
123 |
|
|
int i, j; |
124 |
|
|
|
125 |
|
|
for (i = nmods; i--; ) { |
126 |
|
|
MODCONT *mpin = src->mca[i]; |
127 |
|
|
MODCONT *mpout = dst->mca[i]; |
128 |
|
|
for (j = mpout->nbins; j--; ) |
129 |
|
|
addcolor(mpout->cbin[j], mpin->cbin[j]); |
130 |
|
|
} |
131 |
greg |
2.4 |
dst->nadded += src->nadded; |
132 |
greg |
2.1 |
} |
133 |
|
|
|
134 |
|
|
|
135 |
greg |
2.2 |
/* Queue values for later output */ |
136 |
|
|
static void |
137 |
greg |
2.1 |
queue_output(BINQ *bp) |
138 |
|
|
{ |
139 |
|
|
BINQ *b_last, *b_cur; |
140 |
|
|
|
141 |
|
|
if (accumulate <= 0) { /* just accumulating? */ |
142 |
|
|
if (out_bq == NULL) { |
143 |
|
|
bp->next = NULL; |
144 |
|
|
out_bq = bp; |
145 |
|
|
} else { |
146 |
|
|
add_modbin(out_bq, bp); |
147 |
|
|
free_binq(bp); |
148 |
|
|
} |
149 |
greg |
2.2 |
return; |
150 |
greg |
2.1 |
} |
151 |
greg |
2.10 |
b_last = NULL; /* insert in output queue */ |
152 |
greg |
2.1 |
for (b_cur = out_bq; b_cur != NULL && b_cur->ndx < bp->ndx; |
153 |
|
|
b_cur = b_cur->next) |
154 |
|
|
b_last = b_cur; |
155 |
greg |
2.4 |
|
156 |
greg |
2.1 |
if (b_last != NULL) { |
157 |
|
|
bp->next = b_cur; |
158 |
|
|
b_last->next = bp; |
159 |
|
|
} else { |
160 |
|
|
bp->next = out_bq; |
161 |
|
|
out_bq = bp; |
162 |
|
|
} |
163 |
greg |
2.3 |
if (accumulate == 1) /* no accumulation? */ |
164 |
greg |
2.2 |
return; |
165 |
|
|
b_cur = out_bq; /* else merge accumulation entries */ |
166 |
|
|
while (b_cur->next != NULL) { |
167 |
greg |
2.4 |
if (b_cur->nadded >= accumulate || |
168 |
greg |
2.2 |
(b_cur->ndx-1)/accumulate != |
169 |
|
|
(b_cur->next->ndx-1)/accumulate) { |
170 |
|
|
b_cur = b_cur->next; |
171 |
|
|
continue; |
172 |
greg |
2.1 |
} |
173 |
greg |
2.2 |
add_modbin(b_cur, b_cur->next); |
174 |
|
|
b_last = b_cur->next; |
175 |
|
|
b_cur->next = b_last->next; |
176 |
|
|
b_last->next = NULL; |
177 |
|
|
free_binq(b_last); |
178 |
greg |
2.1 |
} |
179 |
greg |
2.2 |
} |
180 |
|
|
|
181 |
|
|
|
182 |
greg |
2.4 |
/* Count number of records ready for output */ |
183 |
|
|
static int |
184 |
|
|
queue_ready() |
185 |
|
|
{ |
186 |
|
|
int nready = 0; |
187 |
|
|
BINQ *bp; |
188 |
|
|
|
189 |
|
|
for (bp = out_bq; bp != NULL && bp->nadded >= accumulate && |
190 |
|
|
bp->ndx == lastdone+nready*accumulate+1; |
191 |
|
|
bp = bp->next) |
192 |
|
|
++nready; |
193 |
|
|
|
194 |
|
|
return(nready); |
195 |
|
|
} |
196 |
|
|
|
197 |
|
|
|
198 |
|
|
/* Catch up with output queue by producing ready results */ |
199 |
greg |
2.2 |
static int |
200 |
greg |
2.4 |
output_catchup(int nmax) |
201 |
greg |
2.2 |
{ |
202 |
|
|
int nout = 0; |
203 |
|
|
BINQ *bp; |
204 |
|
|
int i; |
205 |
greg |
2.10 |
/* output ready results */ |
206 |
greg |
2.4 |
while (out_bq != NULL && out_bq->nadded >= accumulate |
207 |
|
|
&& out_bq->ndx == lastdone+1) { |
208 |
|
|
if ((nmax > 0) & (nout >= nmax)) |
209 |
|
|
break; |
210 |
greg |
2.2 |
bp = out_bq; /* pop off first entry */ |
211 |
|
|
out_bq = bp->next; |
212 |
|
|
bp->next = NULL; |
213 |
greg |
2.1 |
for (i = 0; i < nmods; i++) /* output record */ |
214 |
greg |
2.2 |
mod_output(bp->mca[i]); |
215 |
greg |
2.1 |
end_record(); |
216 |
greg |
2.2 |
free_binq(bp); /* free this entry */ |
217 |
greg |
2.1 |
lastdone += accumulate; |
218 |
|
|
++nout; |
219 |
|
|
} |
220 |
|
|
return(nout); |
221 |
|
|
} |
222 |
|
|
|
223 |
|
|
|
224 |
greg |
2.3 |
/* Put a zero record in results queue & output */ |
225 |
greg |
2.1 |
void |
226 |
greg |
2.3 |
put_zero_record(int ndx) |
227 |
greg |
2.1 |
{ |
228 |
|
|
BINQ *bp = new_binq(); |
229 |
|
|
int i; |
230 |
|
|
|
231 |
|
|
for (i = nmods; i--; ) |
232 |
|
|
memset(bp->mca[i]->cbin, 0, sizeof(DCOLOR)*bp->mca[i]->nbins); |
233 |
|
|
bp->ndx = ndx; |
234 |
greg |
2.6 |
bp->nadded = 1; |
235 |
greg |
2.1 |
queue_output(bp); |
236 |
greg |
2.4 |
output_catchup(0); |
237 |
greg |
2.1 |
} |
238 |
|
|
|
239 |
|
|
|
240 |
greg |
2.6 |
/* Get results from child process and add to queue */ |
241 |
|
|
static void |
242 |
|
|
queue_results(int k) |
243 |
|
|
{ |
244 |
|
|
BINQ *bq = new_binq(); /* get results holder */ |
245 |
|
|
int j; |
246 |
|
|
|
247 |
|
|
bq->ndx = kida[k].r1; |
248 |
|
|
bq->nadded = kida[k].nr; |
249 |
|
|
/* read from child */ |
250 |
|
|
for (j = 0; j < nmods; j++) |
251 |
|
|
if (fread(bq->mca[j]->cbin, sizeof(DCOLOR), bq->mca[j]->nbins, |
252 |
|
|
kida[k].infp) != bq->mca[j]->nbins) |
253 |
|
|
error(SYSTEM, "read error from render process"); |
254 |
|
|
|
255 |
|
|
queue_output(bq); /* put results in output queue */ |
256 |
|
|
kida[k].nr = 0; /* mark child as available */ |
257 |
|
|
} |
258 |
|
|
|
259 |
|
|
|
260 |
greg |
2.1 |
/* callback to set output spec to NULL (stdout) */ |
261 |
|
|
static int |
262 |
|
|
set_stdout(const LUENT *le, void *p) |
263 |
|
|
{ |
264 |
|
|
(*(MODCONT *)le->data).outspec = NULL; |
265 |
|
|
return(0); |
266 |
|
|
} |
267 |
|
|
|
268 |
|
|
|
269 |
|
|
/* Start child processes if we can */ |
270 |
|
|
int |
271 |
|
|
in_rchild() |
272 |
|
|
{ |
273 |
greg |
2.9 |
int rval; |
274 |
|
|
|
275 |
|
|
while (nchild < nproc) { /* fork until target reached */ |
276 |
greg |
2.3 |
errno = 0; |
277 |
greg |
2.9 |
rval = open_process(&kida[nchild].pr, NULL); |
278 |
|
|
if (rval < 0) |
279 |
|
|
error(SYSTEM, "open_process() call failed"); |
280 |
|
|
if (rval == 0) { /* if in child, set up & return true */ |
281 |
greg |
2.4 |
lu_doall(&modconttab, set_stdout, NULL); |
282 |
|
|
lu_done(&ofiletab); |
283 |
greg |
2.5 |
while (nchild--) { /* don't share other pipes */ |
284 |
greg |
2.6 |
close(kida[nchild].pr.w); |
285 |
|
|
fclose(kida[nchild].infp); |
286 |
greg |
2.4 |
} |
287 |
greg |
2.1 |
inpfmt = (sizeof(RREAL)==sizeof(double)) ? 'd' : 'f'; |
288 |
|
|
outfmt = 'd'; |
289 |
|
|
header = 0; |
290 |
|
|
yres = 0; |
291 |
|
|
raysleft = 0; |
292 |
greg |
2.6 |
if (accumulate == 1) { |
293 |
|
|
waitflush = xres = 1; |
294 |
|
|
account = accumulate = 1; |
295 |
|
|
} else { /* parent controls accumulation */ |
296 |
|
|
waitflush = xres = 0; |
297 |
|
|
account = accumulate = 0; |
298 |
|
|
} |
299 |
greg |
2.9 |
return(1); /* return "true" in child */ |
300 |
greg |
2.1 |
} |
301 |
greg |
2.9 |
if (rval != PIPE_BUF) |
302 |
|
|
error(CONSISTENCY, "bad value from open_process()"); |
303 |
|
|
/* connect to child's output */ |
304 |
|
|
kida[nchild].infp = fdopen(kida[nchild].pr.r, "rb"); |
305 |
greg |
2.6 |
if (kida[nchild].infp == NULL) |
306 |
greg |
2.2 |
error(SYSTEM, "out of memory in in_rchild()"); |
307 |
greg |
2.3 |
#ifdef getc_unlocked |
308 |
greg |
2.6 |
flockfile(kida[nchild].infp); /* avoid mutex overhead */ |
309 |
greg |
2.3 |
#endif |
310 |
greg |
2.6 |
kida[nchild++].nr = 0; /* mark as available */ |
311 |
greg |
2.1 |
} |
312 |
greg |
2.9 |
return(0); /* return "false" in parent */ |
313 |
greg |
2.1 |
} |
314 |
|
|
|
315 |
|
|
|
316 |
|
|
/* Close child processes */ |
317 |
|
|
void |
318 |
|
|
end_children() |
319 |
|
|
{ |
320 |
|
|
int status; |
321 |
|
|
|
322 |
greg |
2.5 |
while (nchild > 0) { |
323 |
|
|
nchild--; |
324 |
greg |
2.6 |
if ((status = close_process(&kida[nchild].pr)) > 0) { |
325 |
greg |
2.1 |
sprintf(errmsg, |
326 |
|
|
"rendering process returned bad status (%d)", |
327 |
|
|
status); |
328 |
|
|
error(WARNING, errmsg); |
329 |
|
|
} |
330 |
greg |
2.9 |
fclose(kida[nchild].infp); |
331 |
greg |
2.2 |
} |
332 |
greg |
2.1 |
} |
333 |
|
|
|
334 |
|
|
|
335 |
greg |
2.5 |
/* Wait for the next available child, managing output queue simultaneously */ |
336 |
greg |
2.1 |
static int |
337 |
greg |
2.5 |
next_child_nq(int flushing) |
338 |
greg |
2.1 |
{ |
339 |
greg |
2.2 |
static struct timeval polling; |
340 |
greg |
2.4 |
struct timeval *pmode; |
341 |
greg |
2.2 |
fd_set readset, errset; |
342 |
greg |
2.6 |
int i, n, nr, nqr; |
343 |
greg |
2.1 |
|
344 |
greg |
2.5 |
if (!flushing) /* see if there's one free */ |
345 |
greg |
2.1 |
for (i = nchild; i--; ) |
346 |
greg |
2.6 |
if (!kida[i].nr) |
347 |
greg |
2.1 |
return(i); |
348 |
greg |
2.4 |
|
349 |
greg |
2.5 |
nqr = queue_ready(); /* choose blocking mode or polling */ |
350 |
|
|
if ((nqr > 0) & !flushing) |
351 |
|
|
pmode = &polling; |
352 |
|
|
else |
353 |
greg |
2.4 |
pmode = NULL; |
354 |
greg |
2.5 |
tryagain: /* catch up with output? */ |
355 |
|
|
if (pmode == &polling) { |
356 |
|
|
if (nqr > nchild) /* don't get too far behind */ |
357 |
|
|
nqr -= output_catchup(nqr-nchild); |
358 |
|
|
} else if (nqr > 0) /* clear output before blocking */ |
359 |
|
|
nqr -= output_catchup(0); |
360 |
greg |
2.1 |
/* prepare select() call */ |
361 |
|
|
FD_ZERO(&readset); FD_ZERO(&errset); |
362 |
|
|
n = nr = 0; |
363 |
|
|
for (i = nchild; i--; ) { |
364 |
greg |
2.6 |
if (kida[i].nr) { |
365 |
|
|
FD_SET(kida[i].pr.r, &readset); |
366 |
greg |
2.1 |
++nr; |
367 |
|
|
} |
368 |
greg |
2.6 |
FD_SET(kida[i].pr.r, &errset); |
369 |
|
|
if (kida[i].pr.r >= n) |
370 |
|
|
n = kida[i].pr.r + 1; |
371 |
greg |
2.1 |
} |
372 |
greg |
2.3 |
if (!nr) /* nothing to wait for? */ |
373 |
|
|
return(-1); |
374 |
greg |
2.2 |
if ((nr > 1) | (pmode == &polling)) { |
375 |
greg |
2.1 |
errno = 0; |
376 |
greg |
2.5 |
nr = select(n, &readset, NULL, &errset, pmode); |
377 |
|
|
if (!nr) { |
378 |
greg |
2.2 |
pmode = NULL; /* try again, blocking this time */ |
379 |
|
|
goto tryagain; |
380 |
|
|
} |
381 |
greg |
2.5 |
if (nr < 0) |
382 |
greg |
2.3 |
error(SYSTEM, "select() error in next_child_nq()"); |
383 |
greg |
2.1 |
} else |
384 |
|
|
FD_ZERO(&errset); |
385 |
|
|
n = -1; /* read results from child(ren) */ |
386 |
|
|
for (i = nchild; i--; ) { |
387 |
greg |
2.6 |
if (FD_ISSET(kida[i].pr.r, &errset)) |
388 |
greg |
2.1 |
error(USER, "rendering process died"); |
389 |
greg |
2.6 |
if (FD_ISSET(kida[i].pr.r, &readset)) |
390 |
|
|
queue_results(n = i); |
391 |
greg |
2.1 |
} |
392 |
greg |
2.3 |
return(n); /* first available child */ |
393 |
greg |
2.1 |
} |
394 |
|
|
|
395 |
|
|
|
396 |
|
|
/* Run parental oversight loop */ |
397 |
|
|
void |
398 |
|
|
parental_loop() |
399 |
|
|
{ |
400 |
|
|
static int ignore_warning_given = 0; |
401 |
greg |
2.6 |
int qlimit = (accumulate == 1) ? 1 : MAXIQ-1; |
402 |
|
|
int ninq = 0; |
403 |
|
|
FVECT orgdir[2*MAXIQ]; |
404 |
|
|
int i, n; |
405 |
greg |
2.1 |
/* load rays from stdin & process */ |
406 |
|
|
#ifdef getc_unlocked |
407 |
|
|
flockfile(stdin); /* avoid lock/unlock overhead */ |
408 |
|
|
#endif |
409 |
greg |
2.6 |
while (getvec(orgdir[2*ninq]) == 0 && getvec(orgdir[2*ninq+1]) == 0) { |
410 |
greg |
2.8 |
if (orgdir[2*ninq+1][0] == 0.0 && /* asking for flush? */ |
411 |
|
|
(orgdir[2*ninq+1][1] == 0.0) & |
412 |
|
|
(orgdir[2*ninq+1][2] == 0.0)) { |
413 |
greg |
2.6 |
if (accumulate != 1) { |
414 |
|
|
if (!ignore_warning_given++) |
415 |
|
|
error(WARNING, |
416 |
greg |
2.1 |
"dummy ray(s) ignored during accumulation\n"); |
417 |
greg |
2.6 |
continue; |
418 |
|
|
} |
419 |
greg |
2.1 |
while (next_child_nq(1) >= 0) |
420 |
greg |
2.3 |
; /* clear the queue */ |
421 |
greg |
2.1 |
lastdone = lastray = 0; |
422 |
|
|
if ((yres <= 0) | (xres <= 0)) |
423 |
greg |
2.5 |
waitflush = 1; /* flush next */ |
424 |
greg |
2.3 |
put_zero_record(++lastray); |
425 |
greg |
2.10 |
} else if (++ninq >= qlimit || |
426 |
greg |
2.6 |
lastray/accumulate != (lastray+ninq)/accumulate) { |
427 |
greg |
2.5 |
i = next_child_nq(0); /* manages output */ |
428 |
greg |
2.6 |
n = ninq; |
429 |
|
|
if (accumulate != 1) /* request flush? */ |
430 |
|
|
memset(orgdir[2*n++], 0, sizeof(FVECT)*2); |
431 |
|
|
n *= sizeof(FVECT)*2; /* send assignment */ |
432 |
|
|
if (writebuf(kida[i].pr.w, (char *)orgdir, n) != n) |
433 |
greg |
2.1 |
error(SYSTEM, "pipe write error"); |
434 |
greg |
2.6 |
kida[i].r1 = lastray+1; |
435 |
|
|
lastray += kida[i].nr = ninq; /* mark as busy */ |
436 |
|
|
ninq = 0; |
437 |
|
|
if (lastray < lastdone) { /* RNUMBER wrapped? */ |
438 |
|
|
while (next_child_nq(1) >= 0) |
439 |
|
|
; |
440 |
|
|
lastdone = lastray = 0; |
441 |
|
|
} |
442 |
greg |
2.1 |
} |
443 |
|
|
if (raysleft && !--raysleft) |
444 |
|
|
break; /* preemptive EOI */ |
445 |
|
|
} |
446 |
|
|
while (next_child_nq(1) >= 0) /* empty results queue */ |
447 |
|
|
; |
448 |
greg |
2.10 |
if (account < accumulate) { |
449 |
|
|
error(WARNING, "partial accumulation in final record"); |
450 |
|
|
free_binq(out_bq); /* XXX just ignore it */ |
451 |
greg |
2.3 |
out_bq = NULL; |
452 |
greg |
2.1 |
} |
453 |
greg |
2.10 |
free_binq(NULL); /* clean up */ |
454 |
|
|
lu_done(&ofiletab); |
455 |
greg |
2.1 |
if (raysleft) |
456 |
|
|
error(USER, "unexpected EOF on input"); |
457 |
greg |
2.10 |
} |
458 |
|
|
|
459 |
|
|
|
460 |
|
|
/* Wait for the next available child by monitoring "to" pipes */ |
461 |
|
|
static int |
462 |
|
|
next_child_ready() |
463 |
|
|
{ |
464 |
|
|
fd_set writeset, errset; |
465 |
greg |
2.11 |
int i, n; |
466 |
greg |
2.10 |
|
467 |
|
|
for (i = nchild; i--; ) /* see if there's one free first */ |
468 |
|
|
if (!kida[i].nr) |
469 |
|
|
return(i); |
470 |
|
|
/* prepare select() call */ |
471 |
|
|
FD_ZERO(&writeset); FD_ZERO(&errset); |
472 |
|
|
n = 0; |
473 |
|
|
for (i = nchild; i--; ) { |
474 |
|
|
FD_SET(kida[i].pr.w, &writeset); |
475 |
|
|
FD_SET(kida[i].pr.r, &errset); |
476 |
|
|
if (kida[i].pr.w >= n) |
477 |
|
|
n = kida[i].pr.w + 1; |
478 |
|
|
if (kida[i].pr.r >= n) |
479 |
|
|
n = kida[i].pr.r + 1; |
480 |
|
|
} |
481 |
|
|
errno = 0; |
482 |
|
|
n = select(n, NULL, &writeset, &errset, NULL); |
483 |
|
|
if (n < 0) |
484 |
|
|
error(SYSTEM, "select() error in next_child_ready()"); |
485 |
|
|
n = -1; /* identify waiting child */ |
486 |
|
|
for (i = nchild; i--; ) { |
487 |
|
|
if (FD_ISSET(kida[i].pr.r, &errset)) |
488 |
|
|
error(USER, "rendering process died"); |
489 |
|
|
if (FD_ISSET(kida[i].pr.w, &writeset)) |
490 |
|
|
kida[n = i].nr = 0; |
491 |
|
|
} |
492 |
|
|
return(n); /* first available child */ |
493 |
|
|
} |
494 |
|
|
|
495 |
|
|
|
496 |
|
|
/* Modified parental loop for full accumulation mode (-c 0) */ |
497 |
|
|
void |
498 |
|
|
feeder_loop() |
499 |
|
|
{ |
500 |
|
|
static int ignore_warning_given = 0; |
501 |
|
|
int ninq = 0; |
502 |
|
|
FVECT orgdir[2*MAXIQ]; |
503 |
|
|
int i, n; |
504 |
|
|
/* load rays from stdin & process */ |
505 |
|
|
#ifdef getc_unlocked |
506 |
|
|
flockfile(stdin); /* avoid lock/unlock overhead */ |
507 |
|
|
#endif |
508 |
|
|
while (getvec(orgdir[2*ninq]) == 0 && getvec(orgdir[2*ninq+1]) == 0) { |
509 |
|
|
if (orgdir[2*ninq+1][0] == 0.0 && /* asking for flush? */ |
510 |
|
|
(orgdir[2*ninq+1][1] == 0.0) & |
511 |
|
|
(orgdir[2*ninq+1][2] == 0.0)) { |
512 |
|
|
if (!ignore_warning_given++) |
513 |
|
|
error(WARNING, |
514 |
|
|
"dummy ray(s) ignored during accumulation\n"); |
515 |
|
|
continue; |
516 |
|
|
} |
517 |
|
|
if (++ninq >= MAXIQ) { |
518 |
|
|
i = next_child_ready(); /* get eager child */ |
519 |
|
|
n = sizeof(FVECT)*2 * ninq; /* give assignment */ |
520 |
|
|
if (writebuf(kida[i].pr.w, (char *)orgdir, n) != n) |
521 |
|
|
error(SYSTEM, "pipe write error"); |
522 |
|
|
kida[i].r1 = lastray+1; |
523 |
|
|
lastray += kida[i].nr = ninq; |
524 |
|
|
ninq = 0; |
525 |
|
|
if (lastray < lastdone) /* RNUMBER wrapped? */ |
526 |
|
|
lastdone = lastray = 0; |
527 |
|
|
} |
528 |
|
|
if (raysleft && !--raysleft) |
529 |
|
|
break; /* preemptive EOI */ |
530 |
|
|
} |
531 |
|
|
if (ninq) { /* polish off input */ |
532 |
|
|
i = next_child_ready(); |
533 |
|
|
n = sizeof(FVECT)*2 * ninq; |
534 |
|
|
if (writebuf(kida[i].pr.w, (char *)orgdir, n) != n) |
535 |
|
|
error(SYSTEM, "pipe write error"); |
536 |
|
|
kida[i].r1 = lastray+1; |
537 |
|
|
lastray += kida[i].nr = ninq; |
538 |
|
|
ninq = 0; |
539 |
|
|
} |
540 |
|
|
for (i = nchild; i--; ) { /* get results */ |
541 |
|
|
close(kida[i].pr.w); |
542 |
|
|
queue_results(i); |
543 |
|
|
} |
544 |
|
|
if (recover) /* and from before? */ |
545 |
|
|
queue_modifiers(); |
546 |
|
|
end_children(); /* free up file descriptors */ |
547 |
|
|
for (i = 0; i < nmods; i++) |
548 |
|
|
mod_output(out_bq->mca[i]); /* output accumulated record */ |
549 |
|
|
end_record(); |
550 |
|
|
free_binq(out_bq); /* clean up */ |
551 |
|
|
out_bq = NULL; |
552 |
|
|
free_binq(NULL); |
553 |
greg |
2.1 |
lu_done(&ofiletab); |
554 |
greg |
2.10 |
if (raysleft) |
555 |
|
|
error(USER, "unexpected EOF on input"); |
556 |
greg |
2.1 |
} |