1 |
– |
#ifndef lint |
1 |
|
static const char RCSid[] = "$Id$"; |
3 |
– |
#endif |
2 |
|
/* |
3 |
|
* ambient.c - routines dealing with ambient (inter-reflected) component. |
4 |
|
* |
12 |
|
#include "platform.h" |
13 |
|
#include "ray.h" |
14 |
|
#include "otypes.h" |
15 |
+ |
#include "otspecial.h" |
16 |
|
#include "resolu.h" |
17 |
|
#include "ambient.h" |
18 |
|
#include "random.h" |
19 |
+ |
#include "pmapamb.h" |
20 |
|
|
21 |
|
#ifndef OCTSCALE |
22 |
|
#define OCTSCALE 1.0 /* ceil((valid rad.)/(cube size)) */ |
23 |
|
#endif |
24 |
|
|
25 |
– |
extern char *shm_boundary; /* memory sharing boundary */ |
26 |
– |
|
25 |
|
#ifndef MAXASET |
26 |
|
#define MAXASET 4095 /* maximum number of elements in ambient set */ |
27 |
|
#endif |
35 |
|
static FILE *ambfp = NULL; /* ambient file pointer */ |
36 |
|
static int nunflshed = 0; /* number of unflushed ambient values */ |
37 |
|
|
40 |
– |
#ifndef SORT_THRESH |
41 |
– |
#ifdef SMLMEM |
42 |
– |
#define SORT_THRESH ((16L<<20)/sizeof(AMBVAL)) |
43 |
– |
#else |
44 |
– |
#define SORT_THRESH ((64L<<20)/sizeof(AMBVAL)) |
45 |
– |
#endif |
46 |
– |
#endif |
47 |
– |
#ifndef SORT_INTVL |
48 |
– |
#define SORT_INTVL (SORT_THRESH<<1) |
49 |
– |
#endif |
50 |
– |
#ifndef MAX_SORT_INTVL |
51 |
– |
#define MAX_SORT_INTVL (SORT_INTVL<<6) |
52 |
– |
#endif |
53 |
– |
|
54 |
– |
|
38 |
|
static double avsum = 0.; /* computed ambient value sum (log) */ |
39 |
|
static unsigned int navsum = 0; /* number of values in avsum */ |
40 |
|
static unsigned int nambvals = 0; /* total number of indirect values */ |
41 |
|
static unsigned int nambshare = 0; /* number of values from file */ |
59 |
– |
static unsigned long ambclock = 0; /* ambient access clock */ |
60 |
– |
static unsigned long lastsort = 0; /* time of last value sort */ |
61 |
– |
static long sortintvl = SORT_INTVL; /* time until next sort */ |
42 |
|
static FILE *ambinp = NULL; /* auxiliary file for input */ |
43 |
|
static long lastpos = -1; /* last flush position */ |
44 |
|
|
65 |
– |
#define MAXACLOCK (1L<<30) /* clock turnover value */ |
66 |
– |
/* |
67 |
– |
* Track access times unless we are sharing ambient values |
68 |
– |
* through memory on a multiprocessor, when we want to avoid |
69 |
– |
* claiming our own memory (copy on write). Go ahead anyway |
70 |
– |
* if more than two thirds of our values are unshared. |
71 |
– |
* Compile with -Dtracktime=0 to turn this code off. |
72 |
– |
*/ |
73 |
– |
#ifndef tracktime |
74 |
– |
#define tracktime (shm_boundary == NULL || nambvals > 3*nambshare) |
75 |
– |
#endif |
76 |
– |
|
45 |
|
#define AMBFLUSH (BUFSIZ/AMBVALSIZ) |
46 |
|
|
47 |
|
#define newambval() (AMBVAL *)malloc(sizeof(AMBVAL)) |
80 |
– |
#define freeav(av) free((void *)av); |
48 |
|
|
49 |
+ |
#define tfunc(lwr, x, upr) (((x)-(lwr))/((upr)-(lwr))) |
50 |
+ |
|
51 |
|
static void initambfile(int creat); |
52 |
|
static void avsave(AMBVAL *av); |
53 |
|
static AMBVAL *avstore(AMBVAL *aval); |
56 |
|
|
57 |
|
typedef void unloadtf_t(AMBVAL *); |
58 |
|
static unloadtf_t avinsert; |
90 |
– |
static unloadtf_t av2list; |
59 |
|
static unloadtf_t avfree; |
60 |
|
static void unloadatree(AMBTREE *at, unloadtf_t *f); |
61 |
|
|
62 |
< |
static int aposcmp(const void *avp1, const void *avp2); |
95 |
< |
static int avlmemi(AMBVAL *avaddr); |
96 |
< |
static void sortambvals(int always); |
62 |
> |
static void sortambvals(void); |
63 |
|
|
64 |
+ |
static int plugaleak(RAY *r, AMBVAL *ap, FVECT anorm, double ang); |
65 |
+ |
static double sumambient(COLOR acol, RAY *r, FVECT rn, int al, |
66 |
+ |
AMBTREE *at, FVECT c0, double s); |
67 |
+ |
static int makeambient(COLOR acol, RAY *r, FVECT rn, int al); |
68 |
+ |
static int extambient(COLOR cr, AMBVAL *ap, FVECT pv, FVECT nv, |
69 |
+ |
FVECT uvw[3]); |
70 |
+ |
|
71 |
|
#ifdef F_SETLKW |
72 |
|
static void aflock(int typ); |
73 |
|
#endif |
106 |
|
newa *= (newa > 0); |
107 |
|
if (fabs(newa - olda) >= .05*(newa + olda)) { |
108 |
|
ambacc = newa; |
109 |
< |
if (nambvals > 0) |
110 |
< |
sortambvals(1); /* rebuild tree */ |
109 |
> |
if (ambacc > FTINY && nambvals > 0) |
110 |
> |
sortambvals(); /* rebuild tree */ |
111 |
|
} |
112 |
|
} |
113 |
|
|
158 |
|
(flen - lastpos)/AMBVALSIZ); |
159 |
|
error(WARNING, errmsg); |
160 |
|
fseek(ambfp, lastpos, SEEK_SET); |
188 |
– |
#ifndef _WIN32 /* XXX we need a replacement for that one */ |
161 |
|
ftruncate(fileno(ambfp), (off_t)lastpos); |
190 |
– |
#endif |
162 |
|
} |
163 |
|
} else if ((ambfp = fopen(ambfile, "w+")) != NULL) { |
164 |
|
initambfile(1); /* else create new file */ |
168 |
|
sprintf(errmsg, "cannot open ambient file \"%s\"", ambfile); |
169 |
|
error(SYSTEM, errmsg); |
170 |
|
} |
200 |
– |
#ifdef getc_unlocked |
201 |
– |
flockfile(ambfp); /* application-level lock */ |
202 |
– |
#endif |
171 |
|
#ifdef F_SETLKW |
172 |
|
aflock(F_UNLCK); /* release file */ |
173 |
|
#endif |
188 |
|
lastpos = -1; |
189 |
|
} |
190 |
|
/* free ambient tree */ |
191 |
< |
unloadatree(&atrunk, &avfree); |
191 |
> |
unloadatree(&atrunk, avfree); |
192 |
|
/* reset state variables */ |
193 |
|
avsum = 0.; |
194 |
|
navsum = 0; |
195 |
|
nambvals = 0; |
196 |
|
nambshare = 0; |
229 |
– |
ambclock = 0; |
230 |
– |
lastsort = 0; |
231 |
– |
sortintvl = SORT_INTVL; |
197 |
|
} |
198 |
|
|
199 |
|
|
226 |
|
} |
227 |
|
} |
228 |
|
|
264 |
– |
/************ THE FOLLOWING ROUTINES DIFFER BETWEEN NEW & OLD ***************/ |
229 |
|
|
266 |
– |
#ifndef OLDAMB |
267 |
– |
|
268 |
– |
#define tfunc(lwr, x, upr) (((x)-(lwr))/((upr)-(lwr))) |
269 |
– |
|
270 |
– |
static int plugaleak(RAY *r, AMBVAL *ap, FVECT anorm, double ang); |
271 |
– |
static double sumambient(COLOR acol, RAY *r, FVECT rn, int al, |
272 |
– |
AMBTREE *at, FVECT c0, double s); |
273 |
– |
static int makeambient(COLOR acol, RAY *r, FVECT rn, int al); |
274 |
– |
static int extambient(COLOR cr, AMBVAL *ap, FVECT pv, FVECT nv, |
275 |
– |
FVECT uvw[3]); |
276 |
– |
|
230 |
|
void |
231 |
|
multambient( /* compute ambient component & multiply by coef. */ |
232 |
|
COLOR aval, |
234 |
|
FVECT nrm |
235 |
|
) |
236 |
|
{ |
237 |
+ |
static double logAvgAbsorp = 1; |
238 |
|
static int rdepth = 0; /* ambient recursion */ |
239 |
< |
COLOR acol; |
240 |
< |
int ok; |
239 |
> |
COLOR acol, caustic; |
240 |
> |
int i, ok; |
241 |
|
double d, l; |
242 |
|
|
243 |
+ |
/* PMAP: Factor in ambient from photon map, if enabled and ray is |
244 |
+ |
* ambient. Return as all ambient components accounted for, else |
245 |
+ |
* continue. */ |
246 |
+ |
if (ambPmap(aval, r, rdepth)) |
247 |
+ |
return; |
248 |
+ |
|
249 |
+ |
if (logAvgAbsorp > 0) /* exclude in -aw to avoid growth */ |
250 |
+ |
logAvgAbsorp = log(1.-AVGREFL); |
251 |
+ |
|
252 |
+ |
/* PMAP: Factor in specular-diffuse ambient (caustics) from photon |
253 |
+ |
* map, if enabled and ray is primary, else caustic is zero. Continue |
254 |
+ |
* with RADIANCE ambient calculation */ |
255 |
+ |
copycolor(caustic, aval); |
256 |
+ |
ambPmapCaustic(caustic, r, rdepth); |
257 |
+ |
|
258 |
|
if (ambdiv <= 0) /* no ambient calculation */ |
259 |
|
goto dumbamb; |
260 |
|
/* check number of bounces */ |
266 |
|
goto dumbamb; |
267 |
|
|
268 |
|
if (ambacc <= FTINY) { /* no ambient storage */ |
269 |
+ |
FVECT uvd[2]; |
270 |
+ |
float dgrad[2], *dgp = NULL; |
271 |
+ |
|
272 |
+ |
if (nrm != r->ron && DOT(nrm,r->ron) < 0.9999) |
273 |
+ |
dgp = dgrad; /* compute rotational grad. */ |
274 |
|
copycolor(acol, aval); |
275 |
|
rdepth++; |
276 |
|
ok = doambient(acol, r, r->rweight, |
277 |
< |
NULL, NULL, NULL, NULL, NULL); |
277 |
> |
uvd, NULL, NULL, dgp, NULL); |
278 |
|
rdepth--; |
279 |
|
if (!ok) |
280 |
|
goto dumbamb; |
281 |
+ |
if ((ok > 0) & (dgp != NULL)) { /* apply texture */ |
282 |
+ |
FVECT v1; |
283 |
+ |
VCROSS(v1, r->ron, nrm); |
284 |
+ |
d = 1.0; |
285 |
+ |
for (i = 3; i--; ) |
286 |
+ |
d += v1[i] * (dgp[0]*uvd[0][i] + dgp[1]*uvd[1][i]); |
287 |
+ |
if (d >= 0.05) |
288 |
+ |
scalecolor(acol, d); |
289 |
+ |
} |
290 |
|
copycolor(aval, acol); |
291 |
+ |
|
292 |
+ |
/* PMAP: add in caustic */ |
293 |
+ |
addcolor(aval, caustic); |
294 |
|
return; |
295 |
|
} |
310 |
– |
|
311 |
– |
if (tracktime) /* sort to minimize thrashing */ |
312 |
– |
sortambvals(0); |
296 |
|
/* interpolate ambient value */ |
297 |
|
setcolor(acol, 0.0, 0.0, 0.0); |
298 |
|
d = sumambient(acol, r, nrm, rdepth, |
299 |
|
&atrunk, thescene.cuorg, thescene.cusize); |
300 |
+ |
|
301 |
|
if (d > FTINY) { |
302 |
|
d = 1.0/d; |
303 |
|
scalecolor(acol, d); |
304 |
|
multcolor(aval, acol); |
305 |
+ |
|
306 |
+ |
/* PMAP: add in caustic */ |
307 |
+ |
addcolor(aval, caustic); |
308 |
|
return; |
309 |
|
} |
310 |
+ |
|
311 |
|
rdepth++; /* need to cache new value */ |
312 |
|
ok = makeambient(acol, r, nrm, rdepth-1); |
313 |
|
rdepth--; |
314 |
+ |
|
315 |
|
if (ok) { |
316 |
|
multcolor(aval, acol); /* computed new value */ |
317 |
+ |
|
318 |
+ |
/* PMAP: add in caustic */ |
319 |
+ |
addcolor(aval, caustic); |
320 |
|
return; |
321 |
|
} |
322 |
+ |
|
323 |
|
dumbamb: /* return global value */ |
324 |
|
if ((ambvwt <= 0) | (navsum == 0)) { |
325 |
|
multcolor(aval, ambval); |
326 |
+ |
|
327 |
+ |
/* PMAP: add in caustic */ |
328 |
+ |
addcolor(aval, caustic); |
329 |
|
return; |
330 |
|
} |
331 |
< |
l = bright(ambval); /* average in computations */ |
331 |
> |
|
332 |
> |
l = bright(ambval); /* average in computations */ |
333 |
|
if (l > FTINY) { |
334 |
< |
d = (log(l)*(double)ambvwt + avsum) / |
334 |
> |
d = (log(l)*(double)ambvwt + avsum + logAvgAbsorp*navsum) / |
335 |
|
(double)(ambvwt + navsum); |
336 |
|
d = exp(d) / l; |
337 |
|
scalecolor(aval, d); |
338 |
|
multcolor(aval, ambval); /* apply color of ambval */ |
339 |
|
} else { |
340 |
< |
d = exp( avsum / (double)navsum ); |
340 |
> |
d = exp( avsum/(double)navsum + logAvgAbsorp ); |
341 |
|
scalecolor(aval, d); /* neutral color */ |
342 |
|
} |
343 |
|
} |
376 |
|
VSUM(rtst.rdir, vdif, anorm, t[1]); /* further dist. > plane */ |
377 |
|
rtst.rmax = normalize(rtst.rdir); /* short ray test */ |
378 |
|
while (localhit(&rtst, &thescene)) { /* check for occluder */ |
379 |
< |
if (rtst.ro->omod != OVOID && |
379 |
> |
OBJREC *m = findmaterial(rtst.ro); |
380 |
> |
if (m != NULL && !istransp(m->otype) && !isBSDFproxy(m) && |
381 |
|
(rtst.clipset == NULL || |
382 |
|
!inset(rtst.clipset, rtst.ro->omod))) |
383 |
|
return(1); /* plug light leak */ |
435 |
|
double u, v, d, delta_r2, delta_t2; |
436 |
|
COLOR ct; |
437 |
|
FVECT uvw[3]; |
440 |
– |
/* record access */ |
441 |
– |
if (tracktime) |
442 |
– |
av->latick = ambclock; |
438 |
|
/* |
439 |
|
* Ambient level test |
440 |
|
*/ |
543 |
|
) |
544 |
|
{ |
545 |
|
const double min_d = 0.05; |
546 |
+ |
const double max_d = 20.; |
547 |
|
static FVECT my_uvw[3]; |
548 |
|
FVECT v1; |
549 |
|
int i; |
563 |
|
for (i = 3; i--; ) |
564 |
|
d += v1[i] * (ap->gdir[0]*uvw[0][i] + ap->gdir[1]*uvw[1][i]); |
565 |
|
|
566 |
< |
if (d < min_d) /* should not use if we can avoid it */ |
566 |
> |
if (d < min_d) /* clamp min/max scaling */ |
567 |
|
d = min_d; |
568 |
+ |
else if (d > max_d) |
569 |
+ |
d = max_d; |
570 |
|
copycolor(cr, ap->val); |
571 |
|
scalecolor(cr, d); |
572 |
|
return(d > min_d); |
616 |
|
} |
617 |
|
|
618 |
|
|
621 |
– |
#else /* ! NEWAMB */ |
622 |
– |
|
623 |
– |
static double sumambient(COLOR acol, RAY *r, FVECT rn, int al, |
624 |
– |
AMBTREE *at, FVECT c0, double s); |
625 |
– |
static double makeambient(COLOR acol, RAY *r, FVECT rn, int al); |
626 |
– |
static void extambient(COLOR cr, AMBVAL *ap, FVECT pv, FVECT nv); |
627 |
– |
|
628 |
– |
|
629 |
– |
void |
630 |
– |
multambient( /* compute ambient component & multiply by coef. */ |
631 |
– |
COLOR aval, |
632 |
– |
RAY *r, |
633 |
– |
FVECT nrm |
634 |
– |
) |
635 |
– |
{ |
636 |
– |
static int rdepth = 0; /* ambient recursion */ |
637 |
– |
COLOR acol; |
638 |
– |
double d, l; |
639 |
– |
|
640 |
– |
if (ambdiv <= 0) /* no ambient calculation */ |
641 |
– |
goto dumbamb; |
642 |
– |
/* check number of bounces */ |
643 |
– |
if (rdepth >= ambounce) |
644 |
– |
goto dumbamb; |
645 |
– |
/* check ambient list */ |
646 |
– |
if (ambincl != -1 && r->ro != NULL && |
647 |
– |
ambincl != inset(ambset, r->ro->omod)) |
648 |
– |
goto dumbamb; |
649 |
– |
|
650 |
– |
if (ambacc <= FTINY) { /* no ambient storage */ |
651 |
– |
copycolor(acol, aval); |
652 |
– |
rdepth++; |
653 |
– |
d = doambient(acol, r, r->rweight, NULL, NULL); |
654 |
– |
rdepth--; |
655 |
– |
if (d <= FTINY) |
656 |
– |
goto dumbamb; |
657 |
– |
copycolor(aval, acol); |
658 |
– |
return; |
659 |
– |
} |
660 |
– |
|
661 |
– |
if (tracktime) /* sort to minimize thrashing */ |
662 |
– |
sortambvals(0); |
663 |
– |
/* interpolate ambient value */ |
664 |
– |
setcolor(acol, 0.0, 0.0, 0.0); |
665 |
– |
d = sumambient(acol, r, nrm, rdepth, |
666 |
– |
&atrunk, thescene.cuorg, thescene.cusize); |
667 |
– |
if (d > FTINY) { |
668 |
– |
d = 1.0/d; |
669 |
– |
scalecolor(acol, d); |
670 |
– |
multcolor(aval, acol); |
671 |
– |
return; |
672 |
– |
} |
673 |
– |
rdepth++; /* need to cache new value */ |
674 |
– |
d = makeambient(acol, r, nrm, rdepth-1); |
675 |
– |
rdepth--; |
676 |
– |
if (d > FTINY) { |
677 |
– |
multcolor(aval, acol); /* got new value */ |
678 |
– |
return; |
679 |
– |
} |
680 |
– |
dumbamb: /* return global value */ |
681 |
– |
if ((ambvwt <= 0) | (navsum == 0)) { |
682 |
– |
multcolor(aval, ambval); |
683 |
– |
return; |
684 |
– |
} |
685 |
– |
l = bright(ambval); /* average in computations */ |
686 |
– |
if (l > FTINY) { |
687 |
– |
d = (log(l)*(double)ambvwt + avsum) / |
688 |
– |
(double)(ambvwt + navsum); |
689 |
– |
d = exp(d) / l; |
690 |
– |
scalecolor(aval, d); |
691 |
– |
multcolor(aval, ambval); /* apply color of ambval */ |
692 |
– |
} else { |
693 |
– |
d = exp( avsum / (double)navsum ); |
694 |
– |
scalecolor(aval, d); /* neutral color */ |
695 |
– |
} |
696 |
– |
} |
697 |
– |
|
698 |
– |
|
699 |
– |
static double |
700 |
– |
sumambient( /* get interpolated ambient value */ |
701 |
– |
COLOR acol, |
702 |
– |
RAY *r, |
703 |
– |
FVECT rn, |
704 |
– |
int al, |
705 |
– |
AMBTREE *at, |
706 |
– |
FVECT c0, |
707 |
– |
double s |
708 |
– |
) |
709 |
– |
{ |
710 |
– |
double d, e1, e2, wt, wsum; |
711 |
– |
COLOR ct; |
712 |
– |
FVECT ck0; |
713 |
– |
int i; |
714 |
– |
int j; |
715 |
– |
AMBVAL *av; |
716 |
– |
|
717 |
– |
wsum = 0.0; |
718 |
– |
/* do this node */ |
719 |
– |
for (av = at->alist; av != NULL; av = av->next) { |
720 |
– |
double rn_dot = -2.0; |
721 |
– |
if (tracktime) |
722 |
– |
av->latick = ambclock; |
723 |
– |
/* |
724 |
– |
* Ambient level test. |
725 |
– |
*/ |
726 |
– |
if (av->lvl > al || /* list sorted, so this works */ |
727 |
– |
(av->lvl == al) & (av->weight < 0.9*r->rweight)) |
728 |
– |
break; |
729 |
– |
/* |
730 |
– |
* Ambient radius test. |
731 |
– |
*/ |
732 |
– |
VSUB(ck0, av->pos, r->rop); |
733 |
– |
e1 = DOT(ck0, ck0) / (av->rad * av->rad); |
734 |
– |
if (e1 > ambacc*ambacc*1.21) |
735 |
– |
continue; |
736 |
– |
/* |
737 |
– |
* Direction test using closest normal. |
738 |
– |
*/ |
739 |
– |
d = DOT(av->dir, r->ron); |
740 |
– |
if (rn != r->ron) { |
741 |
– |
rn_dot = DOT(av->dir, rn); |
742 |
– |
if (rn_dot > 1.0-FTINY) |
743 |
– |
rn_dot = 1.0-FTINY; |
744 |
– |
if (rn_dot >= d-FTINY) { |
745 |
– |
d = rn_dot; |
746 |
– |
rn_dot = -2.0; |
747 |
– |
} |
748 |
– |
} |
749 |
– |
e2 = (1.0 - d) * r->rweight; |
750 |
– |
if (e2 < 0.0) |
751 |
– |
e2 = 0.0; |
752 |
– |
else if (e1 + e2 > ambacc*ambacc*1.21) |
753 |
– |
continue; |
754 |
– |
/* |
755 |
– |
* Ray behind test. |
756 |
– |
*/ |
757 |
– |
d = 0.0; |
758 |
– |
for (j = 0; j < 3; j++) |
759 |
– |
d += (r->rop[j] - av->pos[j]) * |
760 |
– |
(av->dir[j] + r->ron[j]); |
761 |
– |
if (d*0.5 < -minarad*ambacc-.001) |
762 |
– |
continue; |
763 |
– |
/* |
764 |
– |
* Jittering final test reduces image artifacts. |
765 |
– |
*/ |
766 |
– |
e1 = sqrt(e1); |
767 |
– |
e2 = sqrt(e2); |
768 |
– |
wt = e1 + e2; |
769 |
– |
if (wt > ambacc*(.9+.2*urand(9015+samplendx))) |
770 |
– |
continue; |
771 |
– |
/* |
772 |
– |
* Recompute directional error using perturbed normal |
773 |
– |
*/ |
774 |
– |
if (rn_dot > 0.0) { |
775 |
– |
e2 = sqrt((1.0 - rn_dot)*r->rweight); |
776 |
– |
wt = e1 + e2; |
777 |
– |
} |
778 |
– |
if (wt <= 1e-3) |
779 |
– |
wt = 1e3; |
780 |
– |
else |
781 |
– |
wt = 1.0 / wt; |
782 |
– |
wsum += wt; |
783 |
– |
extambient(ct, av, r->rop, rn); |
784 |
– |
scalecolor(ct, wt); |
785 |
– |
addcolor(acol, ct); |
786 |
– |
} |
787 |
– |
if (at->kid == NULL) |
788 |
– |
return(wsum); |
789 |
– |
/* do children */ |
790 |
– |
s *= 0.5; |
791 |
– |
for (i = 0; i < 8; i++) { |
792 |
– |
for (j = 0; j < 3; j++) { |
793 |
– |
ck0[j] = c0[j]; |
794 |
– |
if (1<<j & i) |
795 |
– |
ck0[j] += s; |
796 |
– |
if (r->rop[j] < ck0[j] - OCTSCALE*s) |
797 |
– |
break; |
798 |
– |
if (r->rop[j] > ck0[j] + (1.0+OCTSCALE)*s) |
799 |
– |
break; |
800 |
– |
} |
801 |
– |
if (j == 3) |
802 |
– |
wsum += sumambient(acol, r, rn, al, |
803 |
– |
at->kid+i, ck0, s); |
804 |
– |
} |
805 |
– |
return(wsum); |
806 |
– |
} |
807 |
– |
|
808 |
– |
|
809 |
– |
static double |
810 |
– |
makeambient( /* make a new ambient value for storage */ |
811 |
– |
COLOR acol, |
812 |
– |
RAY *r, |
813 |
– |
FVECT rn, |
814 |
– |
int al |
815 |
– |
) |
816 |
– |
{ |
817 |
– |
AMBVAL amb; |
818 |
– |
FVECT gp, gd; |
819 |
– |
int i; |
820 |
– |
|
821 |
– |
amb.weight = 1.0; /* compute weight */ |
822 |
– |
for (i = al; i-- > 0; ) |
823 |
– |
amb.weight *= AVGREFL; |
824 |
– |
if (r->rweight < 0.1*amb.weight) /* heuristic override */ |
825 |
– |
amb.weight = 1.25*r->rweight; |
826 |
– |
setcolor(acol, AVGREFL, AVGREFL, AVGREFL); |
827 |
– |
/* compute ambient */ |
828 |
– |
amb.rad = doambient(acol, r, amb.weight, gp, gd); |
829 |
– |
if (amb.rad <= FTINY) { |
830 |
– |
setcolor(acol, 0.0, 0.0, 0.0); |
831 |
– |
return(0.0); |
832 |
– |
} |
833 |
– |
scalecolor(acol, 1./AVGREFL); /* undo assumed reflectance */ |
834 |
– |
/* store value */ |
835 |
– |
VCOPY(amb.pos, r->rop); |
836 |
– |
VCOPY(amb.dir, r->ron); |
837 |
– |
amb.lvl = al; |
838 |
– |
copycolor(amb.val, acol); |
839 |
– |
VCOPY(amb.gpos, gp); |
840 |
– |
VCOPY(amb.gdir, gd); |
841 |
– |
/* insert into tree */ |
842 |
– |
avsave(&amb); /* and save to file */ |
843 |
– |
if (rn != r->ron) |
844 |
– |
extambient(acol, &amb, r->rop, rn); /* texture */ |
845 |
– |
return(amb.rad); |
846 |
– |
} |
847 |
– |
|
848 |
– |
|
619 |
|
static void |
850 |
– |
extambient( /* extrapolate value at pv, nv */ |
851 |
– |
COLOR cr, |
852 |
– |
AMBVAL *ap, |
853 |
– |
FVECT pv, |
854 |
– |
FVECT nv |
855 |
– |
) |
856 |
– |
{ |
857 |
– |
FVECT v1; |
858 |
– |
int i; |
859 |
– |
double d; |
860 |
– |
|
861 |
– |
d = 1.0; /* zeroeth order */ |
862 |
– |
/* gradient due to translation */ |
863 |
– |
for (i = 0; i < 3; i++) |
864 |
– |
d += ap->gpos[i]*(pv[i]-ap->pos[i]); |
865 |
– |
/* gradient due to rotation */ |
866 |
– |
VCROSS(v1, ap->dir, nv); |
867 |
– |
d += DOT(ap->gdir, v1); |
868 |
– |
if (d <= 0.0) { |
869 |
– |
setcolor(cr, 0.0, 0.0, 0.0); |
870 |
– |
return; |
871 |
– |
} |
872 |
– |
copycolor(cr, ap->val); |
873 |
– |
scalecolor(cr, d); |
874 |
– |
} |
875 |
– |
|
876 |
– |
|
877 |
– |
static void |
878 |
– |
avinsert( /* insert ambient value in our tree */ |
879 |
– |
AMBVAL *av |
880 |
– |
) |
881 |
– |
{ |
882 |
– |
AMBTREE *at; |
883 |
– |
AMBVAL *ap; |
884 |
– |
AMBVAL avh; |
885 |
– |
FVECT ck0; |
886 |
– |
double s; |
887 |
– |
int branch; |
888 |
– |
int i; |
889 |
– |
|
890 |
– |
if (av->rad <= FTINY) |
891 |
– |
error(CONSISTENCY, "zero ambient radius in avinsert"); |
892 |
– |
at = &atrunk; |
893 |
– |
VCOPY(ck0, thescene.cuorg); |
894 |
– |
s = thescene.cusize; |
895 |
– |
while (s*(OCTSCALE/2) > av->rad*ambacc) { |
896 |
– |
if (at->kid == NULL) |
897 |
– |
if ((at->kid = newambtree()) == NULL) |
898 |
– |
error(SYSTEM, "out of memory in avinsert"); |
899 |
– |
s *= 0.5; |
900 |
– |
branch = 0; |
901 |
– |
for (i = 0; i < 3; i++) |
902 |
– |
if (av->pos[i] > ck0[i] + s) { |
903 |
– |
ck0[i] += s; |
904 |
– |
branch |= 1 << i; |
905 |
– |
} |
906 |
– |
at = at->kid + branch; |
907 |
– |
} |
908 |
– |
avh.next = at->alist; /* order by increasing level */ |
909 |
– |
for (ap = &avh; ap->next != NULL; ap = ap->next) |
910 |
– |
if ( ap->next->lvl > av->lvl || |
911 |
– |
(ap->next->lvl == av->lvl) & |
912 |
– |
(ap->next->weight <= av->weight) ) |
913 |
– |
break; |
914 |
– |
av->next = ap->next; |
915 |
– |
ap->next = (AMBVAL*)av; |
916 |
– |
at->alist = avh.next; |
917 |
– |
} |
918 |
– |
|
919 |
– |
#endif /* ! NEWAMB */ |
920 |
– |
|
921 |
– |
/************* FOLLOWING ROUTINES SAME FOR NEW & OLD METHODS ***************/ |
922 |
– |
|
923 |
– |
static void |
620 |
|
initambfile( /* initialize ambient file */ |
621 |
|
int cre8 |
622 |
|
) |
682 |
|
if ((av = newambval()) == NULL) |
683 |
|
error(SYSTEM, "out of memory in avstore"); |
684 |
|
*av = *aval; |
989 |
– |
av->latick = ambclock; |
685 |
|
av->next = NULL; |
686 |
|
nambvals++; |
687 |
|
d = bright(av->val); |
716 |
|
} |
717 |
|
atp = atfreelist; |
718 |
|
atfreelist = atp->kid; |
719 |
< |
memset((char *)atp, '\0', 8*sizeof(AMBTREE)); |
719 |
> |
memset(atp, 0, 8*sizeof(AMBTREE)); |
720 |
|
return(atp); |
721 |
|
} |
722 |
|
|
742 |
|
/* transfer values at this node */ |
743 |
|
for (av = at->alist; av != NULL; av = at->alist) { |
744 |
|
at->alist = av->next; |
745 |
+ |
av->next = NULL; |
746 |
|
(*f)(av); |
747 |
|
} |
748 |
|
if (at->kid == NULL) |
754 |
|
} |
755 |
|
|
756 |
|
|
1061 |
– |
static struct avl { |
1062 |
– |
AMBVAL *p; |
1063 |
– |
unsigned long t; |
1064 |
– |
} *avlist1; /* ambient value list with ticks */ |
1065 |
– |
static AMBVAL **avlist2; /* memory positions for sorting */ |
1066 |
– |
static int i_avlist; /* index for lists */ |
1067 |
– |
|
1068 |
– |
static int alatcmp(const void *av1, const void *av2); |
1069 |
– |
|
757 |
|
static void |
758 |
|
avfree(AMBVAL *av) |
759 |
|
{ |
760 |
|
free(av); |
761 |
|
} |
762 |
|
|
763 |
+ |
|
764 |
|
static void |
765 |
< |
av2list( |
1078 |
< |
AMBVAL *av |
1079 |
< |
) |
765 |
> |
sortambvals(void) /* resort ambient values */ |
766 |
|
{ |
767 |
< |
#ifdef DEBUG |
1082 |
< |
if (i_avlist >= nambvals) |
1083 |
< |
error(CONSISTENCY, "too many ambient values in av2list1"); |
1084 |
< |
#endif |
1085 |
< |
avlist1[i_avlist].p = avlist2[i_avlist] = (AMBVAL*)av; |
1086 |
< |
avlist1[i_avlist++].t = av->latick; |
1087 |
< |
} |
767 |
> |
AMBTREE oldatrunk = atrunk; |
768 |
|
|
769 |
< |
|
770 |
< |
static int |
771 |
< |
alatcmp( /* compare ambient values for MRA */ |
1092 |
< |
const void *av1, |
1093 |
< |
const void *av2 |
1094 |
< |
) |
1095 |
< |
{ |
1096 |
< |
long lc = ((struct avl *)av2)->t - ((struct avl *)av1)->t; |
1097 |
< |
return(lc<0 ? -1 : lc>0 ? 1 : 0); |
769 |
> |
atrunk.alist = NULL; |
770 |
> |
atrunk.kid = NULL; |
771 |
> |
unloadatree(&oldatrunk, avinsert); |
772 |
|
} |
773 |
|
|
774 |
|
|
1101 |
– |
/* GW NOTE 2002/10/3: |
1102 |
– |
* I used to compare AMBVAL pointers, but found that this was the |
1103 |
– |
* cause of a serious consistency error with gcc, since the optimizer |
1104 |
– |
* uses some dangerous trick in pointer subtraction that |
1105 |
– |
* assumes pointers differ by exact struct size increments. |
1106 |
– |
*/ |
1107 |
– |
static int |
1108 |
– |
aposcmp( /* compare ambient value positions */ |
1109 |
– |
const void *avp1, |
1110 |
– |
const void *avp2 |
1111 |
– |
) |
1112 |
– |
{ |
1113 |
– |
long diff = *(char * const *)avp1 - *(char * const *)avp2; |
1114 |
– |
if (diff < 0) |
1115 |
– |
return(-1); |
1116 |
– |
return(diff > 0); |
1117 |
– |
} |
1118 |
– |
|
1119 |
– |
|
1120 |
– |
static int |
1121 |
– |
avlmemi( /* find list position from address */ |
1122 |
– |
AMBVAL *avaddr |
1123 |
– |
) |
1124 |
– |
{ |
1125 |
– |
AMBVAL **avlpp; |
1126 |
– |
|
1127 |
– |
avlpp = (AMBVAL **)bsearch((char *)&avaddr, (char *)avlist2, |
1128 |
– |
nambvals, sizeof(AMBVAL *), &aposcmp); |
1129 |
– |
if (avlpp == NULL) |
1130 |
– |
error(CONSISTENCY, "address not found in avlmemi"); |
1131 |
– |
return(avlpp - avlist2); |
1132 |
– |
} |
1133 |
– |
|
1134 |
– |
|
1135 |
– |
static void |
1136 |
– |
sortambvals( /* resort ambient values */ |
1137 |
– |
int always |
1138 |
– |
) |
1139 |
– |
{ |
1140 |
– |
AMBTREE oldatrunk; |
1141 |
– |
AMBVAL tav, *tap, *pnext; |
1142 |
– |
int i, j; |
1143 |
– |
/* see if it's time yet */ |
1144 |
– |
if (!always && (ambclock++ < lastsort+sortintvl || |
1145 |
– |
nambvals < SORT_THRESH)) |
1146 |
– |
return; |
1147 |
– |
/* |
1148 |
– |
* The idea here is to minimize memory thrashing |
1149 |
– |
* in VM systems by improving reference locality. |
1150 |
– |
* We do this by periodically sorting our stored ambient |
1151 |
– |
* values in memory in order of most recently to least |
1152 |
– |
* recently accessed. This ordering was chosen so that new |
1153 |
– |
* ambient values (which tend to be less important) go into |
1154 |
– |
* higher memory with the infrequently accessed values. |
1155 |
– |
* Since we expect our values to need sorting less |
1156 |
– |
* frequently as the process continues, we double our |
1157 |
– |
* waiting interval after each call. |
1158 |
– |
* This routine is also called by setambacc() with |
1159 |
– |
* the "always" parameter set to 1 so that the ambient |
1160 |
– |
* tree will be rebuilt with the new accuracy parameter. |
1161 |
– |
*/ |
1162 |
– |
if (tracktime) { /* allocate pointer arrays to sort */ |
1163 |
– |
avlist2 = (AMBVAL **)malloc(nambvals*sizeof(AMBVAL *)); |
1164 |
– |
avlist1 = (struct avl *)malloc(nambvals*sizeof(struct avl)); |
1165 |
– |
} else { |
1166 |
– |
avlist2 = NULL; |
1167 |
– |
avlist1 = NULL; |
1168 |
– |
} |
1169 |
– |
if (avlist1 == NULL) { /* no time tracking -- rebuild tree? */ |
1170 |
– |
if (avlist2 != NULL) |
1171 |
– |
free((void *)avlist2); |
1172 |
– |
if (always) { /* rebuild without sorting */ |
1173 |
– |
oldatrunk = atrunk; |
1174 |
– |
atrunk.alist = NULL; |
1175 |
– |
atrunk.kid = NULL; |
1176 |
– |
unloadatree(&oldatrunk, &avinsert); |
1177 |
– |
} |
1178 |
– |
} else { /* sort memory by last access time */ |
1179 |
– |
/* |
1180 |
– |
* Sorting memory is tricky because it isn't contiguous. |
1181 |
– |
* We have to sort an array of pointers by MRA and also |
1182 |
– |
* by memory position. We then copy values in "loops" |
1183 |
– |
* to minimize memory hits. Nevertheless, we will visit |
1184 |
– |
* everyone at least twice, and this is an expensive process |
1185 |
– |
* when we're thrashing, which is when we need to do it. |
1186 |
– |
*/ |
1187 |
– |
#ifdef DEBUG |
1188 |
– |
sprintf(errmsg, "sorting %u ambient values at ambclock=%lu...", |
1189 |
– |
nambvals, ambclock); |
1190 |
– |
eputs(errmsg); |
1191 |
– |
#endif |
1192 |
– |
i_avlist = 0; |
1193 |
– |
unloadatree(&atrunk, &av2list); /* empty current tree */ |
1194 |
– |
#ifdef DEBUG |
1195 |
– |
if (i_avlist < nambvals) |
1196 |
– |
error(CONSISTENCY, "missing ambient values in sortambvals"); |
1197 |
– |
#endif |
1198 |
– |
qsort((char *)avlist1, nambvals, sizeof(struct avl), alatcmp); |
1199 |
– |
qsort((char *)avlist2, nambvals, sizeof(AMBVAL *), aposcmp); |
1200 |
– |
for (i = 0; i < nambvals; i++) { |
1201 |
– |
if (avlist1[i].p == NULL) |
1202 |
– |
continue; |
1203 |
– |
tap = avlist2[i]; |
1204 |
– |
tav = *tap; |
1205 |
– |
for (j = i; (pnext = avlist1[j].p) != tap; |
1206 |
– |
j = avlmemi(pnext)) { |
1207 |
– |
*(avlist2[j]) = *pnext; |
1208 |
– |
avinsert(avlist2[j]); |
1209 |
– |
avlist1[j].p = NULL; |
1210 |
– |
} |
1211 |
– |
*(avlist2[j]) = tav; |
1212 |
– |
avinsert(avlist2[j]); |
1213 |
– |
avlist1[j].p = NULL; |
1214 |
– |
} |
1215 |
– |
free((void *)avlist1); |
1216 |
– |
free((void *)avlist2); |
1217 |
– |
/* compute new sort interval */ |
1218 |
– |
sortintvl = ambclock - lastsort; |
1219 |
– |
if (sortintvl >= MAX_SORT_INTVL/2) |
1220 |
– |
sortintvl = MAX_SORT_INTVL; |
1221 |
– |
else |
1222 |
– |
sortintvl <<= 1; /* wait twice as long next */ |
1223 |
– |
#ifdef DEBUG |
1224 |
– |
eputs("done\n"); |
1225 |
– |
#endif |
1226 |
– |
} |
1227 |
– |
if (ambclock >= MAXACLOCK) |
1228 |
– |
ambclock = MAXACLOCK/2; |
1229 |
– |
lastsort = ambclock; |
1230 |
– |
} |
1231 |
– |
|
1232 |
– |
|
775 |
|
#ifdef F_SETLKW |
776 |
|
|
777 |
|
static void |
783 |
|
|
784 |
|
if (typ == fls.l_type) /* already called? */ |
785 |
|
return; |
786 |
+ |
|
787 |
|
fls.l_type = typ; |
788 |
< |
if (fcntl(fileno(ambfp), F_SETLKW, &fls) < 0) |
789 |
< |
error(SYSTEM, "cannot (un)lock ambient file"); |
788 |
> |
do |
789 |
> |
if (fcntl(fileno(ambfp), F_SETLKW, &fls) != -1) |
790 |
> |
return; |
791 |
> |
while (errno == EINTR); |
792 |
> |
|
793 |
> |
error(SYSTEM, "cannot (un)lock ambient file"); |
794 |
|
} |
795 |
|
|
796 |
|
|
809 |
|
if ((flen = lseek(fileno(ambfp), (off_t)0, SEEK_END)) < 0) |
810 |
|
goto seekerr; |
811 |
|
if ((n = flen - lastpos) > 0) { /* file has grown */ |
812 |
< |
if (ambinp == NULL) { /* use duplicate filedes */ |
813 |
< |
ambinp = fdopen(dup(fileno(ambfp)), "r"); |
812 |
> |
if (ambinp == NULL) { /* get new file pointer */ |
813 |
> |
ambinp = fopen(ambfile, "rb"); |
814 |
|
if (ambinp == NULL) |
815 |
< |
error(SYSTEM, "fdopen failed in ambsync"); |
815 |
> |
error(SYSTEM, "fopen failed in ambsync"); |
816 |
|
} |
817 |
|
if (fseek(ambinp, lastpos, SEEK_SET) < 0) |
818 |
|
goto seekerr; |
827 |
|
avstore(&avs); |
828 |
|
n -= AMBVALSIZ; |
829 |
|
} |
830 |
< |
lastpos = flen - n; |
831 |
< |
/*** seek always as safety measure |
832 |
< |
if (n) ***/ /* alignment */ |
1286 |
< |
if (lseek(fileno(ambfp), (off_t)lastpos, SEEK_SET) < 0) |
1287 |
< |
goto seekerr; |
830 |
> |
lastpos = flen - n; /* check alignment */ |
831 |
> |
if (n && lseek(fileno(ambfp), (off_t)lastpos, SEEK_SET) < 0) |
832 |
> |
goto seekerr; |
833 |
|
} |
834 |
|
n = fflush(ambfp); /* calls write() at last */ |
835 |
< |
if (n != EOF) |
1291 |
< |
lastpos += (long)nunflshed*AMBVALSIZ; |
1292 |
< |
else if ((lastpos = lseek(fileno(ambfp), (off_t)0, SEEK_CUR)) < 0) |
1293 |
< |
goto seekerr; |
1294 |
< |
|
835 |
> |
lastpos += (long)nunflshed*AMBVALSIZ; |
836 |
|
aflock(F_UNLCK); /* release file */ |
837 |
|
nunflshed = 0; |
838 |
|
return(n); |
839 |
|
seekerr: |
840 |
|
error(SYSTEM, "seek failed in ambsync"); |
841 |
< |
return -1; /* pro forma return */ |
841 |
> |
return(EOF); /* pro forma return */ |
842 |
|
} |
843 |
|
|
844 |
|
#else /* ! F_SETLKW */ |