| 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 |
– |
|
| 55 |
– |
static double qambacc = 0.; /* ambient accuracy to the 1/4 power */ |
| 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 */ |
| 60 |
– |
static unsigned long ambclock = 0; /* ambient access clock */ |
| 61 |
– |
static unsigned long lastsort = 0; /* time of last value sort */ |
| 62 |
– |
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 |
|
|
| 66 |
– |
#define MAXACLOCK (1L<<30) /* clock turnover value */ |
| 67 |
– |
/* |
| 68 |
– |
* Track access times unless we are sharing ambient values |
| 69 |
– |
* through memory on a multiprocessor, when we want to avoid |
| 70 |
– |
* claiming our own memory (copy on write). Go ahead anyway |
| 71 |
– |
* if more than two thirds of our values are unshared. |
| 72 |
– |
* Compile with -Dtracktime=0 to turn this code off. |
| 73 |
– |
*/ |
| 74 |
– |
#ifndef tracktime |
| 75 |
– |
#define tracktime (shm_boundary == NULL || nambvals > 3*nambshare) |
| 76 |
– |
#endif |
| 77 |
– |
|
| 45 |
|
#define AMBFLUSH (BUFSIZ/AMBVALSIZ) |
| 46 |
|
|
| 47 |
|
#define newambval() (AMBVAL *)malloc(sizeof(AMBVAL)) |
| 81 |
– |
#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; |
| 91 |
– |
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); |
| 96 |
< |
static int avlmemi(AMBVAL *avaddr); |
| 97 |
< |
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 |
| 82 |
|
/* set min & max radii */ |
| 83 |
|
if (ar <= 0) { |
| 84 |
|
minarad = 0; |
| 85 |
< |
maxarad = thescene.cusize / 2.0; |
| 85 |
> |
maxarad = thescene.cusize*0.2; |
| 86 |
|
} else { |
| 87 |
|
minarad = thescene.cusize / ar; |
| 88 |
< |
maxarad = 64 * minarad; /* heuristic */ |
| 89 |
< |
if (maxarad > thescene.cusize / 2.0) |
| 90 |
< |
maxarad = thescene.cusize / 2.0; |
| 88 |
> |
maxarad = 64.0 * minarad; /* heuristic */ |
| 89 |
> |
if (maxarad > thescene.cusize*0.2) |
| 90 |
> |
maxarad = thescene.cusize*0.2; |
| 91 |
|
} |
| 92 |
|
if (minarad <= FTINY) |
| 93 |
< |
minarad = 10*FTINY; |
| 93 |
> |
minarad = 10.0*FTINY; |
| 94 |
|
if (maxarad <= minarad) |
| 95 |
< |
maxarad = 64 * minarad; |
| 95 |
> |
maxarad = 64.0 * minarad; |
| 96 |
|
} |
| 97 |
|
|
| 98 |
|
|
| 101 |
|
double newa |
| 102 |
|
) |
| 103 |
|
{ |
| 104 |
< |
double olda = qambacc*qambacc*qambacc*qambacc; |
| 104 |
> |
static double olda; /* remember previous setting here */ |
| 105 |
|
|
| 106 |
|
newa *= (newa > 0); |
| 107 |
|
if (fabs(newa - olda) >= .05*(newa + olda)) { |
| 108 |
< |
qambacc = sqrt(sqrt(ambacc = newa)); |
| 109 |
< |
if (nambvals > 0) |
| 110 |
< |
sortambvals(1); /* rebuild tree */ |
| 108 |
> |
ambacc = newa; |
| 109 |
> |
if (ambacc > FTINY && nambvals > 0) |
| 110 |
> |
sortambvals(); /* rebuild tree */ |
| 111 |
|
} |
| 112 |
|
} |
| 113 |
|
|
| 138 |
|
initambfile(0); /* file exists */ |
| 139 |
|
lastpos = ftell(ambfp); |
| 140 |
|
while (readambval(&amb, ambfp)) |
| 141 |
< |
avinsert(avstore(&amb)); |
| 141 |
> |
avstore(&amb); |
| 142 |
|
nambshare = nambvals; /* share loaded values */ |
| 143 |
|
if (readonly) { |
| 144 |
|
sprintf(errmsg, |
| 158 |
|
(flen - lastpos)/AMBVALSIZ); |
| 159 |
|
error(WARNING, errmsg); |
| 160 |
|
fseek(ambfp, lastpos, SEEK_SET); |
| 189 |
– |
#ifndef _WIN32 /* XXX we need a replacement for that one */ |
| 161 |
|
ftruncate(fileno(ambfp), (off_t)lastpos); |
| 191 |
– |
#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 |
|
} |
| 201 |
– |
#ifdef getc_unlocked |
| 202 |
– |
flockfile(ambfp); /* application-level lock */ |
| 203 |
– |
#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; |
| 230 |
– |
ambclock = 0; |
| 231 |
– |
lastsort = 0; |
| 232 |
– |
sortintvl = SORT_INTVL; |
| 197 |
|
} |
| 198 |
|
|
| 199 |
|
|
| 226 |
|
} |
| 227 |
|
} |
| 228 |
|
|
| 265 |
– |
/************ THE FOLLOWING ROUTINES DIFFER BETWEEN NEW & OLD ***************/ |
| 229 |
|
|
| 267 |
– |
#ifdef NEWAMB |
| 268 |
– |
|
| 269 |
– |
#define tfunc(lwr, x, upr) (((x)-(lwr))/((upr)-(lwr))) |
| 270 |
– |
|
| 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 void 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, NULL, NULL, NULL, NULL); |
| 276 |
> |
ok = doambient(acol, r, r->rweight, |
| 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 |
|
} |
| 309 |
– |
|
| 310 |
– |
if (tracktime) /* sort to minimize thrashing */ |
| 311 |
– |
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 |
|
} |
| 344 |
|
|
| 345 |
|
|
| 346 |
< |
double |
| 346 |
> |
/* Plug a potential leak where ambient cache value is occluded */ |
| 347 |
> |
static int |
| 348 |
> |
plugaleak(RAY *r, AMBVAL *ap, FVECT anorm, double ang) |
| 349 |
> |
{ |
| 350 |
> |
const double cost70sq = 0.1169778; /* cos(70deg)^2 */ |
| 351 |
> |
RAY rtst; |
| 352 |
> |
FVECT vdif; |
| 353 |
> |
double normdot, ndotd, nadotd; |
| 354 |
> |
double a, b, c, t[2]; |
| 355 |
> |
|
| 356 |
> |
ang += 2.*PI*(ang < 0); /* check direction flags */ |
| 357 |
> |
if ( !(ap->corral>>(int)(ang*(16./PI)) & 1) ) |
| 358 |
> |
return(0); |
| 359 |
> |
/* |
| 360 |
> |
* Generate test ray, targeting 20 degrees above sample point plane |
| 361 |
> |
* along surface normal from cache position. This should be high |
| 362 |
> |
* enough to miss local geometry we don't really care about. |
| 363 |
> |
*/ |
| 364 |
> |
VSUB(vdif, ap->pos, r->rop); |
| 365 |
> |
normdot = DOT(anorm, r->ron); |
| 366 |
> |
ndotd = DOT(vdif, r->ron); |
| 367 |
> |
nadotd = DOT(vdif, anorm); |
| 368 |
> |
a = normdot*normdot - cost70sq; |
| 369 |
> |
b = 2.0*(normdot*ndotd - nadotd*cost70sq); |
| 370 |
> |
c = ndotd*ndotd - DOT(vdif,vdif)*cost70sq; |
| 371 |
> |
if (quadratic(t, a, b, c) != 2) |
| 372 |
> |
return(1); /* should rarely happen */ |
| 373 |
> |
if (t[1] <= FTINY) |
| 374 |
> |
return(0); /* should fail behind test */ |
| 375 |
> |
rayorigin(&rtst, SHADOW, r, NULL); |
| 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 |
> |
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 */ |
| 384 |
> |
VCOPY(rtst.rorg, rtst.rop); /* skip invisible surface */ |
| 385 |
> |
rtst.rmax -= rtst.rot; |
| 386 |
> |
rayclear(&rtst); |
| 387 |
> |
} |
| 388 |
> |
return(0); /* seems we're OK */ |
| 389 |
> |
} |
| 390 |
> |
|
| 391 |
> |
|
| 392 |
> |
static double |
| 393 |
|
sumambient( /* get interpolated ambient value */ |
| 394 |
|
COLOR acol, |
| 395 |
|
RAY *r, |
| 401 |
|
) |
| 402 |
|
{ /* initial limit is 10 degrees plus ambacc radians */ |
| 403 |
|
const double minangle = 10.0 * PI/180.; |
| 404 |
< |
const double maxangle = (minangle+ambacc-PI/2.)*pow(r->rweight,0.13) |
| 361 |
< |
+ PI/2.; |
| 404 |
> |
double maxangle = minangle + ambacc; |
| 405 |
|
double wsum = 0.0; |
| 406 |
|
FVECT ck0; |
| 407 |
|
int i, j; |
| 408 |
|
AMBVAL *av; |
| 409 |
+ |
|
| 410 |
+ |
if (at->kid != NULL) { /* sum children first */ |
| 411 |
+ |
s *= 0.5; |
| 412 |
+ |
for (i = 0; i < 8; i++) { |
| 413 |
+ |
for (j = 0; j < 3; j++) { |
| 414 |
+ |
ck0[j] = c0[j]; |
| 415 |
+ |
if (1<<j & i) |
| 416 |
+ |
ck0[j] += s; |
| 417 |
+ |
if (r->rop[j] < ck0[j] - OCTSCALE*s) |
| 418 |
+ |
break; |
| 419 |
+ |
if (r->rop[j] > ck0[j] + (1.0+OCTSCALE)*s) |
| 420 |
+ |
break; |
| 421 |
+ |
} |
| 422 |
+ |
if (j == 3) |
| 423 |
+ |
wsum += sumambient(acol, r, rn, al, |
| 424 |
+ |
at->kid+i, ck0, s); |
| 425 |
+ |
} |
| 426 |
+ |
/* good enough? */ |
| 427 |
+ |
if (wsum >= 0.05 && s > minarad*10.0) |
| 428 |
+ |
return(wsum); |
| 429 |
+ |
} |
| 430 |
+ |
/* adjust maximum angle */ |
| 431 |
+ |
if (at->alist != NULL && (at->alist->lvl <= al) & (r->rweight < 0.6)) |
| 432 |
+ |
maxangle = (maxangle - PI/2.)*pow(r->rweight,0.13) + PI/2.; |
| 433 |
|
/* sum this node */ |
| 434 |
|
for (av = at->alist; av != NULL; av = av->next) { |
| 435 |
< |
double d, delta_r2, delta_t2; |
| 435 |
> |
double u, v, d, delta_r2, delta_t2; |
| 436 |
|
COLOR ct; |
| 437 |
|
FVECT uvw[3]; |
| 371 |
– |
/* record access */ |
| 372 |
– |
if (tracktime) |
| 373 |
– |
av->latick = ambclock; |
| 438 |
|
/* |
| 439 |
|
* Ambient level test |
| 440 |
|
*/ |
| 441 |
< |
if (av->lvl > al) /* list sorted, so this works */ |
| 441 |
> |
if (av->lvl > al || /* list sorted, so this works */ |
| 442 |
> |
(av->lvl == al) & (av->weight < 0.9*r->rweight)) |
| 443 |
|
break; |
| 379 |
– |
if (av->weight < 0.9*r->rweight) |
| 380 |
– |
continue; |
| 444 |
|
/* |
| 445 |
|
* Direction test using unperturbed normal |
| 446 |
|
*/ |
| 454 |
|
/* |
| 455 |
|
* Modified ray behind test |
| 456 |
|
*/ |
| 457 |
< |
VSUB(ck0, av->pos, r->rop); |
| 457 |
> |
VSUB(ck0, r->rop, av->pos); |
| 458 |
|
d = DOT(ck0, uvw[2]); |
| 459 |
< |
if (d < -minarad*qambacc-.001) |
| 459 |
> |
if (d < -minarad*ambacc) |
| 460 |
|
continue; |
| 461 |
|
d /= av->rad[0]; |
| 462 |
|
delta_t2 = d*d; |
| 463 |
< |
if (delta_t2 >= qambacc*qambacc) |
| 463 |
> |
if (delta_t2 >= ambacc*ambacc) |
| 464 |
|
continue; |
| 465 |
|
/* |
| 466 |
|
* Elliptical radii test based on Hessian |
| 467 |
|
*/ |
| 468 |
|
decodedir(uvw[0], av->udir); |
| 469 |
|
VCROSS(uvw[1], uvw[2], uvw[0]); |
| 470 |
< |
d = DOT(ck0, uvw[0]) / av->rad[0]; |
| 470 |
> |
d = (u = DOT(ck0, uvw[0])) / av->rad[0]; |
| 471 |
|
delta_t2 += d*d; |
| 472 |
< |
d = DOT(ck0, uvw[1]) / av->rad[1]; |
| 472 |
> |
d = (v = DOT(ck0, uvw[1])) / av->rad[1]; |
| 473 |
|
delta_t2 += d*d; |
| 474 |
< |
if (delta_t2 >= qambacc*qambacc) |
| 474 |
> |
if (delta_t2 >= ambacc*ambacc) |
| 475 |
|
continue; |
| 476 |
|
/* |
| 477 |
+ |
* Test for potential light leak |
| 478 |
+ |
*/ |
| 479 |
+ |
if (av->corral && plugaleak(r, av, uvw[2], atan2a(v,u))) |
| 480 |
+ |
continue; |
| 481 |
+ |
/* |
| 482 |
|
* Extrapolate value and compute final weight (hat function) |
| 483 |
|
*/ |
| 484 |
< |
extambient(ct, av, r->rop, rn, uvw); |
| 484 |
> |
if (!extambient(ct, av, r->rop, rn, uvw)) |
| 485 |
> |
continue; |
| 486 |
|
d = tfunc(maxangle, sqrt(delta_r2), 0.0) * |
| 487 |
< |
tfunc(qambacc, sqrt(delta_t2), 0.0); |
| 487 |
> |
tfunc(ambacc, sqrt(delta_t2), 0.0); |
| 488 |
|
scalecolor(ct, d); |
| 489 |
|
addcolor(acol, ct); |
| 490 |
|
wsum += d; |
| 491 |
|
} |
| 423 |
– |
if (at->kid == NULL) |
| 424 |
– |
return(wsum); |
| 425 |
– |
/* sum children */ |
| 426 |
– |
s *= 0.5; |
| 427 |
– |
for (i = 0; i < 8; i++) { |
| 428 |
– |
for (j = 0; j < 3; j++) { |
| 429 |
– |
ck0[j] = c0[j]; |
| 430 |
– |
if (1<<j & i) |
| 431 |
– |
ck0[j] += s; |
| 432 |
– |
if (r->rop[j] < ck0[j] - OCTSCALE*s) |
| 433 |
– |
break; |
| 434 |
– |
if (r->rop[j] > ck0[j] + (1.0+OCTSCALE)*s) |
| 435 |
– |
break; |
| 436 |
– |
} |
| 437 |
– |
if (j == 3) |
| 438 |
– |
wsum += sumambient(acol, r, rn, al, |
| 439 |
– |
at->kid+i, ck0, s); |
| 440 |
– |
} |
| 492 |
|
return(wsum); |
| 493 |
|
} |
| 494 |
|
|
| 495 |
|
|
| 496 |
< |
int |
| 496 |
> |
static int |
| 497 |
|
makeambient( /* make a new ambient value for storage */ |
| 498 |
|
COLOR acol, |
| 499 |
|
RAY *r, |
| 512 |
|
amb.weight = 1.25*r->rweight; |
| 513 |
|
setcolor(acol, AVGREFL, AVGREFL, AVGREFL); |
| 514 |
|
/* compute ambient */ |
| 515 |
< |
i = doambient(acol, r, amb.weight, uvw, amb.rad, amb.gpos, amb.gdir); |
| 515 |
> |
i = doambient(acol, r, amb.weight, |
| 516 |
> |
uvw, amb.rad, amb.gpos, amb.gdir, &amb.corral); |
| 517 |
|
scalecolor(acol, 1./AVGREFL); /* undo assumed reflectance */ |
| 518 |
|
if (i <= 0 || amb.rad[0] <= FTINY) /* no Hessian or zero radius */ |
| 519 |
|
return(i); |
| 533 |
|
} |
| 534 |
|
|
| 535 |
|
|
| 536 |
< |
void |
| 536 |
> |
static int |
| 537 |
|
extambient( /* extrapolate value at pv, nv */ |
| 538 |
|
COLOR cr, |
| 539 |
|
AMBVAL *ap, |
| 542 |
|
FVECT uvw[3] |
| 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 <= 0.0) { |
| 567 |
< |
setcolor(cr, 0.0, 0.0, 0.0); |
| 568 |
< |
return; |
| 569 |
< |
} |
| 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); |
| 573 |
|
} |
| 574 |
|
|
| 575 |
|
|
| 591 |
|
at = &atrunk; |
| 592 |
|
VCOPY(ck0, thescene.cuorg); |
| 593 |
|
s = thescene.cusize; |
| 594 |
< |
while (s*(OCTSCALE/2) > av->rad[1]*qambacc) { |
| 594 |
> |
while (s*(OCTSCALE/2) > av->rad[1]*ambacc) { |
| 595 |
|
if (at->kid == NULL) |
| 596 |
|
if ((at->kid = newambtree()) == NULL) |
| 597 |
|
error(SYSTEM, "out of memory in avinsert"); |
| 606 |
|
} |
| 607 |
|
avh.next = at->alist; /* order by increasing level */ |
| 608 |
|
for (ap = &avh; ap->next != NULL; ap = ap->next) |
| 609 |
< |
if (ap->next->lvl >= av->lvl) |
| 609 |
> |
if ( ap->next->lvl > av->lvl || |
| 610 |
> |
(ap->next->lvl == av->lvl) & |
| 611 |
> |
(ap->next->weight <= av->weight) ) |
| 612 |
|
break; |
| 613 |
|
av->next = ap->next; |
| 614 |
|
ap->next = (AMBVAL*)av; |
| 616 |
|
} |
| 617 |
|
|
| 618 |
|
|
| 562 |
– |
#else /* ! NEWAMB */ |
| 563 |
– |
|
| 564 |
– |
static double sumambient(COLOR acol, RAY *r, FVECT rn, int al, |
| 565 |
– |
AMBTREE *at, FVECT c0, double s); |
| 566 |
– |
static double makeambient(COLOR acol, RAY *r, FVECT rn, int al); |
| 567 |
– |
static void extambient(COLOR cr, AMBVAL *ap, FVECT pv, FVECT nv); |
| 568 |
– |
|
| 569 |
– |
|
| 570 |
– |
void |
| 571 |
– |
multambient( /* compute ambient component & multiply by coef. */ |
| 572 |
– |
COLOR aval, |
| 573 |
– |
RAY *r, |
| 574 |
– |
FVECT nrm |
| 575 |
– |
) |
| 576 |
– |
{ |
| 577 |
– |
static int rdepth = 0; /* ambient recursion */ |
| 578 |
– |
COLOR acol; |
| 579 |
– |
double d, l; |
| 580 |
– |
|
| 581 |
– |
if (ambdiv <= 0) /* no ambient calculation */ |
| 582 |
– |
goto dumbamb; |
| 583 |
– |
/* check number of bounces */ |
| 584 |
– |
if (rdepth >= ambounce) |
| 585 |
– |
goto dumbamb; |
| 586 |
– |
/* check ambient list */ |
| 587 |
– |
if (ambincl != -1 && r->ro != NULL && |
| 588 |
– |
ambincl != inset(ambset, r->ro->omod)) |
| 589 |
– |
goto dumbamb; |
| 590 |
– |
|
| 591 |
– |
if (ambacc <= FTINY) { /* no ambient storage */ |
| 592 |
– |
copycolor(acol, aval); |
| 593 |
– |
rdepth++; |
| 594 |
– |
d = doambient(acol, r, r->rweight, NULL, NULL); |
| 595 |
– |
rdepth--; |
| 596 |
– |
if (d <= FTINY) |
| 597 |
– |
goto dumbamb; |
| 598 |
– |
copycolor(aval, acol); |
| 599 |
– |
return; |
| 600 |
– |
} |
| 601 |
– |
|
| 602 |
– |
if (tracktime) /* sort to minimize thrashing */ |
| 603 |
– |
sortambvals(0); |
| 604 |
– |
/* interpolate ambient value */ |
| 605 |
– |
setcolor(acol, 0.0, 0.0, 0.0); |
| 606 |
– |
d = sumambient(acol, r, nrm, rdepth, |
| 607 |
– |
&atrunk, thescene.cuorg, thescene.cusize); |
| 608 |
– |
if (d > FTINY) { |
| 609 |
– |
d = 1.0/d; |
| 610 |
– |
scalecolor(acol, d); |
| 611 |
– |
multcolor(aval, acol); |
| 612 |
– |
return; |
| 613 |
– |
} |
| 614 |
– |
rdepth++; /* need to cache new value */ |
| 615 |
– |
d = makeambient(acol, r, nrm, rdepth-1); |
| 616 |
– |
rdepth--; |
| 617 |
– |
if (d > FTINY) { |
| 618 |
– |
multcolor(aval, acol); /* got new value */ |
| 619 |
– |
return; |
| 620 |
– |
} |
| 621 |
– |
dumbamb: /* return global value */ |
| 622 |
– |
if ((ambvwt <= 0) | (navsum == 0)) { |
| 623 |
– |
multcolor(aval, ambval); |
| 624 |
– |
return; |
| 625 |
– |
} |
| 626 |
– |
l = bright(ambval); /* average in computations */ |
| 627 |
– |
if (l > FTINY) { |
| 628 |
– |
d = (log(l)*(double)ambvwt + avsum) / |
| 629 |
– |
(double)(ambvwt + navsum); |
| 630 |
– |
d = exp(d) / l; |
| 631 |
– |
scalecolor(aval, d); |
| 632 |
– |
multcolor(aval, ambval); /* apply color of ambval */ |
| 633 |
– |
} else { |
| 634 |
– |
d = exp( avsum / (double)navsum ); |
| 635 |
– |
scalecolor(aval, d); /* neutral color */ |
| 636 |
– |
} |
| 637 |
– |
} |
| 638 |
– |
|
| 639 |
– |
|
| 640 |
– |
static double |
| 641 |
– |
sumambient( /* get interpolated ambient value */ |
| 642 |
– |
COLOR acol, |
| 643 |
– |
RAY *r, |
| 644 |
– |
FVECT rn, |
| 645 |
– |
int al, |
| 646 |
– |
AMBTREE *at, |
| 647 |
– |
FVECT c0, |
| 648 |
– |
double s |
| 649 |
– |
) |
| 650 |
– |
{ |
| 651 |
– |
double d, e1, e2, wt, wsum; |
| 652 |
– |
COLOR ct; |
| 653 |
– |
FVECT ck0; |
| 654 |
– |
int i; |
| 655 |
– |
int j; |
| 656 |
– |
AMBVAL *av; |
| 657 |
– |
|
| 658 |
– |
wsum = 0.0; |
| 659 |
– |
/* do this node */ |
| 660 |
– |
for (av = at->alist; av != NULL; av = av->next) { |
| 661 |
– |
double rn_dot = -2.0; |
| 662 |
– |
if (tracktime) |
| 663 |
– |
av->latick = ambclock; |
| 664 |
– |
/* |
| 665 |
– |
* Ambient level test. |
| 666 |
– |
*/ |
| 667 |
– |
if (av->lvl > al) /* list sorted, so this works */ |
| 668 |
– |
break; |
| 669 |
– |
if (av->weight < 0.9*r->rweight) |
| 670 |
– |
continue; |
| 671 |
– |
/* |
| 672 |
– |
* Ambient radius test. |
| 673 |
– |
*/ |
| 674 |
– |
VSUB(ck0, av->pos, r->rop); |
| 675 |
– |
e1 = DOT(ck0, ck0) / (av->rad * av->rad); |
| 676 |
– |
if (e1 > ambacc*ambacc*1.21) |
| 677 |
– |
continue; |
| 678 |
– |
/* |
| 679 |
– |
* Direction test using closest normal. |
| 680 |
– |
*/ |
| 681 |
– |
d = DOT(av->dir, r->ron); |
| 682 |
– |
if (rn != r->ron) { |
| 683 |
– |
rn_dot = DOT(av->dir, rn); |
| 684 |
– |
if (rn_dot > 1.0-FTINY) |
| 685 |
– |
rn_dot = 1.0-FTINY; |
| 686 |
– |
if (rn_dot >= d-FTINY) { |
| 687 |
– |
d = rn_dot; |
| 688 |
– |
rn_dot = -2.0; |
| 689 |
– |
} |
| 690 |
– |
} |
| 691 |
– |
e2 = (1.0 - d) * r->rweight; |
| 692 |
– |
if (e2 < 0.0) |
| 693 |
– |
e2 = 0.0; |
| 694 |
– |
else if (e1 + e2 > ambacc*ambacc*1.21) |
| 695 |
– |
continue; |
| 696 |
– |
/* |
| 697 |
– |
* Ray behind test. |
| 698 |
– |
*/ |
| 699 |
– |
d = 0.0; |
| 700 |
– |
for (j = 0; j < 3; j++) |
| 701 |
– |
d += (r->rop[j] - av->pos[j]) * |
| 702 |
– |
(av->dir[j] + r->ron[j]); |
| 703 |
– |
if (d*0.5 < -minarad*ambacc-.001) |
| 704 |
– |
continue; |
| 705 |
– |
/* |
| 706 |
– |
* Jittering final test reduces image artifacts. |
| 707 |
– |
*/ |
| 708 |
– |
e1 = sqrt(e1); |
| 709 |
– |
e2 = sqrt(e2); |
| 710 |
– |
wt = e1 + e2; |
| 711 |
– |
if (wt > ambacc*(.9+.2*urand(9015+samplendx))) |
| 712 |
– |
continue; |
| 713 |
– |
/* |
| 714 |
– |
* Recompute directional error using perturbed normal |
| 715 |
– |
*/ |
| 716 |
– |
if (rn_dot > 0.0) { |
| 717 |
– |
e2 = sqrt((1.0 - rn_dot)*r->rweight); |
| 718 |
– |
wt = e1 + e2; |
| 719 |
– |
} |
| 720 |
– |
if (wt <= 1e-3) |
| 721 |
– |
wt = 1e3; |
| 722 |
– |
else |
| 723 |
– |
wt = 1.0 / wt; |
| 724 |
– |
wsum += wt; |
| 725 |
– |
extambient(ct, av, r->rop, rn); |
| 726 |
– |
scalecolor(ct, wt); |
| 727 |
– |
addcolor(acol, ct); |
| 728 |
– |
} |
| 729 |
– |
if (at->kid == NULL) |
| 730 |
– |
return(wsum); |
| 731 |
– |
/* do children */ |
| 732 |
– |
s *= 0.5; |
| 733 |
– |
for (i = 0; i < 8; i++) { |
| 734 |
– |
for (j = 0; j < 3; j++) { |
| 735 |
– |
ck0[j] = c0[j]; |
| 736 |
– |
if (1<<j & i) |
| 737 |
– |
ck0[j] += s; |
| 738 |
– |
if (r->rop[j] < ck0[j] - OCTSCALE*s) |
| 739 |
– |
break; |
| 740 |
– |
if (r->rop[j] > ck0[j] + (1.0+OCTSCALE)*s) |
| 741 |
– |
break; |
| 742 |
– |
} |
| 743 |
– |
if (j == 3) |
| 744 |
– |
wsum += sumambient(acol, r, rn, al, |
| 745 |
– |
at->kid+i, ck0, s); |
| 746 |
– |
} |
| 747 |
– |
return(wsum); |
| 748 |
– |
} |
| 749 |
– |
|
| 750 |
– |
|
| 751 |
– |
static double |
| 752 |
– |
makeambient( /* make a new ambient value for storage */ |
| 753 |
– |
COLOR acol, |
| 754 |
– |
RAY *r, |
| 755 |
– |
FVECT rn, |
| 756 |
– |
int al |
| 757 |
– |
) |
| 758 |
– |
{ |
| 759 |
– |
AMBVAL amb; |
| 760 |
– |
FVECT gp, gd; |
| 761 |
– |
int i; |
| 762 |
– |
|
| 763 |
– |
amb.weight = 1.0; /* compute weight */ |
| 764 |
– |
for (i = al; i-- > 0; ) |
| 765 |
– |
amb.weight *= AVGREFL; |
| 766 |
– |
if (r->rweight < 0.1*amb.weight) /* heuristic override */ |
| 767 |
– |
amb.weight = 1.25*r->rweight; |
| 768 |
– |
setcolor(acol, AVGREFL, AVGREFL, AVGREFL); |
| 769 |
– |
/* compute ambient */ |
| 770 |
– |
amb.rad = doambient(acol, r, amb.weight, gp, gd); |
| 771 |
– |
if (amb.rad <= FTINY) { |
| 772 |
– |
setcolor(acol, 0.0, 0.0, 0.0); |
| 773 |
– |
return(0.0); |
| 774 |
– |
} |
| 775 |
– |
scalecolor(acol, 1./AVGREFL); /* undo assumed reflectance */ |
| 776 |
– |
/* store value */ |
| 777 |
– |
VCOPY(amb.pos, r->rop); |
| 778 |
– |
VCOPY(amb.dir, r->ron); |
| 779 |
– |
amb.lvl = al; |
| 780 |
– |
copycolor(amb.val, acol); |
| 781 |
– |
VCOPY(amb.gpos, gp); |
| 782 |
– |
VCOPY(amb.gdir, gd); |
| 783 |
– |
/* insert into tree */ |
| 784 |
– |
avsave(&amb); /* and save to file */ |
| 785 |
– |
if (rn != r->ron) |
| 786 |
– |
extambient(acol, &amb, r->rop, rn); /* texture */ |
| 787 |
– |
return(amb.rad); |
| 788 |
– |
} |
| 789 |
– |
|
| 790 |
– |
|
| 619 |
|
static void |
| 792 |
– |
extambient( /* extrapolate value at pv, nv */ |
| 793 |
– |
COLOR cr, |
| 794 |
– |
AMBVAL *ap, |
| 795 |
– |
FVECT pv, |
| 796 |
– |
FVECT nv |
| 797 |
– |
) |
| 798 |
– |
{ |
| 799 |
– |
FVECT v1; |
| 800 |
– |
int i; |
| 801 |
– |
double d; |
| 802 |
– |
|
| 803 |
– |
d = 1.0; /* zeroeth order */ |
| 804 |
– |
/* gradient due to translation */ |
| 805 |
– |
for (i = 0; i < 3; i++) |
| 806 |
– |
d += ap->gpos[i]*(pv[i]-ap->pos[i]); |
| 807 |
– |
/* gradient due to rotation */ |
| 808 |
– |
VCROSS(v1, ap->dir, nv); |
| 809 |
– |
d += DOT(ap->gdir, v1); |
| 810 |
– |
if (d <= 0.0) { |
| 811 |
– |
setcolor(cr, 0.0, 0.0, 0.0); |
| 812 |
– |
return; |
| 813 |
– |
} |
| 814 |
– |
copycolor(cr, ap->val); |
| 815 |
– |
scalecolor(cr, d); |
| 816 |
– |
} |
| 817 |
– |
|
| 818 |
– |
|
| 819 |
– |
static void |
| 820 |
– |
avinsert( /* insert ambient value in our tree */ |
| 821 |
– |
AMBVAL *av |
| 822 |
– |
) |
| 823 |
– |
{ |
| 824 |
– |
AMBTREE *at; |
| 825 |
– |
AMBVAL *ap; |
| 826 |
– |
AMBVAL avh; |
| 827 |
– |
FVECT ck0; |
| 828 |
– |
double s; |
| 829 |
– |
int branch; |
| 830 |
– |
int i; |
| 831 |
– |
|
| 832 |
– |
if (av->rad <= FTINY) |
| 833 |
– |
error(CONSISTENCY, "zero ambient radius in avinsert"); |
| 834 |
– |
at = &atrunk; |
| 835 |
– |
VCOPY(ck0, thescene.cuorg); |
| 836 |
– |
s = thescene.cusize; |
| 837 |
– |
while (s*(OCTSCALE/2) > av->rad*ambacc) { |
| 838 |
– |
if (at->kid == NULL) |
| 839 |
– |
if ((at->kid = newambtree()) == NULL) |
| 840 |
– |
error(SYSTEM, "out of memory in avinsert"); |
| 841 |
– |
s *= 0.5; |
| 842 |
– |
branch = 0; |
| 843 |
– |
for (i = 0; i < 3; i++) |
| 844 |
– |
if (av->pos[i] > ck0[i] + s) { |
| 845 |
– |
ck0[i] += s; |
| 846 |
– |
branch |= 1 << i; |
| 847 |
– |
} |
| 848 |
– |
at = at->kid + branch; |
| 849 |
– |
} |
| 850 |
– |
avh.next = at->alist; /* order by increasing level */ |
| 851 |
– |
for (ap = &avh; ap->next != NULL; ap = ap->next) |
| 852 |
– |
if (ap->next->lvl >= av->lvl) |
| 853 |
– |
break; |
| 854 |
– |
av->next = ap->next; |
| 855 |
– |
ap->next = (AMBVAL*)av; |
| 856 |
– |
at->alist = avh.next; |
| 857 |
– |
} |
| 858 |
– |
|
| 859 |
– |
#endif /* ! NEWAMB */ |
| 860 |
– |
|
| 861 |
– |
/************* FOLLOWING ROUTINES SAME FOR NEW & OLD METHODS ***************/ |
| 862 |
– |
|
| 863 |
– |
static void |
| 620 |
|
initambfile( /* initialize ambient file */ |
| 621 |
|
int cre8 |
| 622 |
|
) |
| 639 |
|
ambvwt, ambounce, ambacc); |
| 640 |
|
fprintf(ambfp, "-ad %d -as %d -ar %d ", |
| 641 |
|
ambdiv, ambssamp, ambres); |
| 642 |
+ |
fprintf(ambfp, "-dr %d -ds %g -dt %g -dc %g ", directrelay, |
| 643 |
+ |
srcsizerat, shadthresh, shadcert); |
| 644 |
+ |
fprintf(ambfp, "-ss %g -st %g -lr %d -lw %g ", specjitter, |
| 645 |
+ |
specthresh, maxdepth, minweight); |
| 646 |
|
if (octname != NULL) |
| 647 |
|
fputs(octname, ambfp); |
| 648 |
|
fputc('\n', ambfp); |
| 661 |
|
AMBVAL *av |
| 662 |
|
) |
| 663 |
|
{ |
| 664 |
< |
avinsert(avstore(av)); |
| 664 |
> |
avstore(av); |
| 665 |
|
if (ambfp == NULL) |
| 666 |
|
return; |
| 667 |
|
if (writambval(av, ambfp) < 0) |
| 676 |
|
|
| 677 |
|
|
| 678 |
|
static AMBVAL * |
| 679 |
< |
avstore( /* allocate memory and store aval */ |
| 679 |
> |
avstore( /* allocate memory and save aval */ |
| 680 |
|
AMBVAL *aval |
| 681 |
|
) |
| 682 |
|
{ |
| 686 |
|
if ((av = newambval()) == NULL) |
| 687 |
|
error(SYSTEM, "out of memory in avstore"); |
| 688 |
|
*av = *aval; |
| 929 |
– |
av->latick = ambclock; |
| 689 |
|
av->next = NULL; |
| 690 |
|
nambvals++; |
| 691 |
|
d = bright(av->val); |
| 693 |
|
avsum += log(d); |
| 694 |
|
navsum++; |
| 695 |
|
} |
| 696 |
+ |
avinsert(av); /* insert in our cache tree */ |
| 697 |
|
return(av); |
| 698 |
|
} |
| 699 |
|
|
| 720 |
|
} |
| 721 |
|
atp = atfreelist; |
| 722 |
|
atfreelist = atp->kid; |
| 723 |
< |
memset((char *)atp, '\0', 8*sizeof(AMBTREE)); |
| 723 |
> |
memset(atp, 0, 8*sizeof(AMBTREE)); |
| 724 |
|
return(atp); |
| 725 |
|
} |
| 726 |
|
|
| 746 |
|
/* transfer values at this node */ |
| 747 |
|
for (av = at->alist; av != NULL; av = at->alist) { |
| 748 |
|
at->alist = av->next; |
| 749 |
+ |
av->next = NULL; |
| 750 |
|
(*f)(av); |
| 751 |
|
} |
| 752 |
|
if (at->kid == NULL) |
| 758 |
|
} |
| 759 |
|
|
| 760 |
|
|
| 1000 |
– |
static struct avl { |
| 1001 |
– |
AMBVAL *p; |
| 1002 |
– |
unsigned long t; |
| 1003 |
– |
} *avlist1; /* ambient value list with ticks */ |
| 1004 |
– |
static AMBVAL **avlist2; /* memory positions for sorting */ |
| 1005 |
– |
static int i_avlist; /* index for lists */ |
| 1006 |
– |
|
| 1007 |
– |
static int alatcmp(const void *av1, const void *av2); |
| 1008 |
– |
|
| 761 |
|
static void |
| 762 |
|
avfree(AMBVAL *av) |
| 763 |
|
{ |
| 764 |
|
free(av); |
| 765 |
|
} |
| 766 |
|
|
| 767 |
+ |
|
| 768 |
|
static void |
| 769 |
< |
av2list( |
| 1017 |
< |
AMBVAL *av |
| 1018 |
< |
) |
| 769 |
> |
sortambvals(void) /* resort ambient values */ |
| 770 |
|
{ |
| 771 |
< |
#ifdef DEBUG |
| 1021 |
< |
if (i_avlist >= nambvals) |
| 1022 |
< |
error(CONSISTENCY, "too many ambient values in av2list1"); |
| 1023 |
< |
#endif |
| 1024 |
< |
avlist1[i_avlist].p = avlist2[i_avlist] = (AMBVAL*)av; |
| 1025 |
< |
avlist1[i_avlist++].t = av->latick; |
| 1026 |
< |
} |
| 771 |
> |
AMBTREE oldatrunk = atrunk; |
| 772 |
|
|
| 773 |
< |
|
| 774 |
< |
static int |
| 775 |
< |
alatcmp( /* compare ambient values for MRA */ |
| 1031 |
< |
const void *av1, |
| 1032 |
< |
const void *av2 |
| 1033 |
< |
) |
| 1034 |
< |
{ |
| 1035 |
< |
long lc = ((struct avl *)av2)->t - ((struct avl *)av1)->t; |
| 1036 |
< |
return(lc<0 ? -1 : lc>0 ? 1 : 0); |
| 773 |
> |
atrunk.alist = NULL; |
| 774 |
> |
atrunk.kid = NULL; |
| 775 |
> |
unloadatree(&oldatrunk, avinsert); |
| 776 |
|
} |
| 777 |
|
|
| 778 |
|
|
| 1040 |
– |
/* GW NOTE 2002/10/3: |
| 1041 |
– |
* I used to compare AMBVAL pointers, but found that this was the |
| 1042 |
– |
* cause of a serious consistency error with gcc, since the optimizer |
| 1043 |
– |
* uses some dangerous trick in pointer subtraction that |
| 1044 |
– |
* assumes pointers differ by exact struct size increments. |
| 1045 |
– |
*/ |
| 1046 |
– |
static int |
| 1047 |
– |
aposcmp( /* compare ambient value positions */ |
| 1048 |
– |
const void *avp1, |
| 1049 |
– |
const void *avp2 |
| 1050 |
– |
) |
| 1051 |
– |
{ |
| 1052 |
– |
long diff = *(char * const *)avp1 - *(char * const *)avp2; |
| 1053 |
– |
if (diff < 0) |
| 1054 |
– |
return(-1); |
| 1055 |
– |
return(diff > 0); |
| 1056 |
– |
} |
| 1057 |
– |
|
| 1058 |
– |
|
| 1059 |
– |
static int |
| 1060 |
– |
avlmemi( /* find list position from address */ |
| 1061 |
– |
AMBVAL *avaddr |
| 1062 |
– |
) |
| 1063 |
– |
{ |
| 1064 |
– |
AMBVAL **avlpp; |
| 1065 |
– |
|
| 1066 |
– |
avlpp = (AMBVAL **)bsearch((char *)&avaddr, (char *)avlist2, |
| 1067 |
– |
nambvals, sizeof(AMBVAL *), &aposcmp); |
| 1068 |
– |
if (avlpp == NULL) |
| 1069 |
– |
error(CONSISTENCY, "address not found in avlmemi"); |
| 1070 |
– |
return(avlpp - avlist2); |
| 1071 |
– |
} |
| 1072 |
– |
|
| 1073 |
– |
|
| 1074 |
– |
static void |
| 1075 |
– |
sortambvals( /* resort ambient values */ |
| 1076 |
– |
int always |
| 1077 |
– |
) |
| 1078 |
– |
{ |
| 1079 |
– |
AMBTREE oldatrunk; |
| 1080 |
– |
AMBVAL tav, *tap, *pnext; |
| 1081 |
– |
int i, j; |
| 1082 |
– |
/* see if it's time yet */ |
| 1083 |
– |
if (!always && (ambclock++ < lastsort+sortintvl || |
| 1084 |
– |
nambvals < SORT_THRESH)) |
| 1085 |
– |
return; |
| 1086 |
– |
/* |
| 1087 |
– |
* The idea here is to minimize memory thrashing |
| 1088 |
– |
* in VM systems by improving reference locality. |
| 1089 |
– |
* We do this by periodically sorting our stored ambient |
| 1090 |
– |
* values in memory in order of most recently to least |
| 1091 |
– |
* recently accessed. This ordering was chosen so that new |
| 1092 |
– |
* ambient values (which tend to be less important) go into |
| 1093 |
– |
* higher memory with the infrequently accessed values. |
| 1094 |
– |
* Since we expect our values to need sorting less |
| 1095 |
– |
* frequently as the process continues, we double our |
| 1096 |
– |
* waiting interval after each call. |
| 1097 |
– |
* This routine is also called by setambacc() with |
| 1098 |
– |
* the "always" parameter set to 1 so that the ambient |
| 1099 |
– |
* tree will be rebuilt with the new accuracy parameter. |
| 1100 |
– |
*/ |
| 1101 |
– |
if (tracktime) { /* allocate pointer arrays to sort */ |
| 1102 |
– |
avlist2 = (AMBVAL **)malloc(nambvals*sizeof(AMBVAL *)); |
| 1103 |
– |
avlist1 = (struct avl *)malloc(nambvals*sizeof(struct avl)); |
| 1104 |
– |
} else { |
| 1105 |
– |
avlist2 = NULL; |
| 1106 |
– |
avlist1 = NULL; |
| 1107 |
– |
} |
| 1108 |
– |
if (avlist1 == NULL) { /* no time tracking -- rebuild tree? */ |
| 1109 |
– |
if (avlist2 != NULL) |
| 1110 |
– |
free((void *)avlist2); |
| 1111 |
– |
if (always) { /* rebuild without sorting */ |
| 1112 |
– |
oldatrunk = atrunk; |
| 1113 |
– |
atrunk.alist = NULL; |
| 1114 |
– |
atrunk.kid = NULL; |
| 1115 |
– |
unloadatree(&oldatrunk, &avinsert); |
| 1116 |
– |
} |
| 1117 |
– |
} else { /* sort memory by last access time */ |
| 1118 |
– |
/* |
| 1119 |
– |
* Sorting memory is tricky because it isn't contiguous. |
| 1120 |
– |
* We have to sort an array of pointers by MRA and also |
| 1121 |
– |
* by memory position. We then copy values in "loops" |
| 1122 |
– |
* to minimize memory hits. Nevertheless, we will visit |
| 1123 |
– |
* everyone at least twice, and this is an expensive process |
| 1124 |
– |
* when we're thrashing, which is when we need to do it. |
| 1125 |
– |
*/ |
| 1126 |
– |
#ifdef DEBUG |
| 1127 |
– |
sprintf(errmsg, "sorting %u ambient values at ambclock=%lu...", |
| 1128 |
– |
nambvals, ambclock); |
| 1129 |
– |
eputs(errmsg); |
| 1130 |
– |
#endif |
| 1131 |
– |
i_avlist = 0; |
| 1132 |
– |
unloadatree(&atrunk, &av2list); /* empty current tree */ |
| 1133 |
– |
#ifdef DEBUG |
| 1134 |
– |
if (i_avlist < nambvals) |
| 1135 |
– |
error(CONSISTENCY, "missing ambient values in sortambvals"); |
| 1136 |
– |
#endif |
| 1137 |
– |
qsort((char *)avlist1, nambvals, sizeof(struct avl), &alatcmp); |
| 1138 |
– |
qsort((char *)avlist2, nambvals, sizeof(AMBVAL *), &aposcmp); |
| 1139 |
– |
for (i = 0; i < nambvals; i++) { |
| 1140 |
– |
if (avlist1[i].p == NULL) |
| 1141 |
– |
continue; |
| 1142 |
– |
tap = avlist2[i]; |
| 1143 |
– |
tav = *tap; |
| 1144 |
– |
for (j = i; (pnext = avlist1[j].p) != tap; |
| 1145 |
– |
j = avlmemi(pnext)) { |
| 1146 |
– |
*(avlist2[j]) = *pnext; |
| 1147 |
– |
avinsert(avlist2[j]); |
| 1148 |
– |
avlist1[j].p = NULL; |
| 1149 |
– |
} |
| 1150 |
– |
*(avlist2[j]) = tav; |
| 1151 |
– |
avinsert(avlist2[j]); |
| 1152 |
– |
avlist1[j].p = NULL; |
| 1153 |
– |
} |
| 1154 |
– |
free((void *)avlist1); |
| 1155 |
– |
free((void *)avlist2); |
| 1156 |
– |
/* compute new sort interval */ |
| 1157 |
– |
sortintvl = ambclock - lastsort; |
| 1158 |
– |
if (sortintvl >= MAX_SORT_INTVL/2) |
| 1159 |
– |
sortintvl = MAX_SORT_INTVL; |
| 1160 |
– |
else |
| 1161 |
– |
sortintvl <<= 1; /* wait twice as long next */ |
| 1162 |
– |
#ifdef DEBUG |
| 1163 |
– |
eputs("done\n"); |
| 1164 |
– |
#endif |
| 1165 |
– |
} |
| 1166 |
– |
if (ambclock >= MAXACLOCK) |
| 1167 |
– |
ambclock = MAXACLOCK/2; |
| 1168 |
– |
lastsort = ambclock; |
| 1169 |
– |
} |
| 1170 |
– |
|
| 1171 |
– |
|
| 779 |
|
#ifdef F_SETLKW |
| 780 |
|
|
| 781 |
|
static void |
| 787 |
|
|
| 788 |
|
if (typ == fls.l_type) /* already called? */ |
| 789 |
|
return; |
| 790 |
+ |
|
| 791 |
|
fls.l_type = typ; |
| 792 |
< |
if (fcntl(fileno(ambfp), F_SETLKW, &fls) < 0) |
| 793 |
< |
error(SYSTEM, "cannot (un)lock ambient file"); |
| 792 |
> |
do |
| 793 |
> |
if (fcntl(fileno(ambfp), F_SETLKW, &fls) != -1) |
| 794 |
> |
return; |
| 795 |
> |
while (errno == EINTR); |
| 796 |
> |
|
| 797 |
> |
error(SYSTEM, "cannot (un)lock ambient file"); |
| 798 |
|
} |
| 799 |
|
|
| 800 |
|
|
| 813 |
|
if ((flen = lseek(fileno(ambfp), (off_t)0, SEEK_END)) < 0) |
| 814 |
|
goto seekerr; |
| 815 |
|
if ((n = flen - lastpos) > 0) { /* file has grown */ |
| 816 |
< |
if (ambinp == NULL) { /* use duplicate filedes */ |
| 817 |
< |
ambinp = fdopen(dup(fileno(ambfp)), "r"); |
| 816 |
> |
if (ambinp == NULL) { /* get new file pointer */ |
| 817 |
> |
ambinp = fopen(ambfile, "rb"); |
| 818 |
|
if (ambinp == NULL) |
| 819 |
< |
error(SYSTEM, "fdopen failed in ambsync"); |
| 819 |
> |
error(SYSTEM, "fopen failed in ambsync"); |
| 820 |
|
} |
| 821 |
|
if (fseek(ambinp, lastpos, SEEK_SET) < 0) |
| 822 |
|
goto seekerr; |
| 828 |
|
error(WARNING, errmsg); |
| 829 |
|
break; |
| 830 |
|
} |
| 831 |
< |
avinsert(avstore(&avs)); |
| 831 |
> |
avstore(&avs); |
| 832 |
|
n -= AMBVALSIZ; |
| 833 |
|
} |
| 834 |
< |
lastpos = flen - n; |
| 835 |
< |
/*** seek always as safety measure |
| 836 |
< |
if (n) ***/ /* alignment */ |
| 1225 |
< |
if (lseek(fileno(ambfp), (off_t)lastpos, SEEK_SET) < 0) |
| 1226 |
< |
goto seekerr; |
| 834 |
> |
lastpos = flen - n; /* check alignment */ |
| 835 |
> |
if (n && lseek(fileno(ambfp), (off_t)lastpos, SEEK_SET) < 0) |
| 836 |
> |
goto seekerr; |
| 837 |
|
} |
| 838 |
|
n = fflush(ambfp); /* calls write() at last */ |
| 839 |
< |
if (n != EOF) |
| 1230 |
< |
lastpos += (long)nunflshed*AMBVALSIZ; |
| 1231 |
< |
else if ((lastpos = lseek(fileno(ambfp), (off_t)0, SEEK_CUR)) < 0) |
| 1232 |
< |
goto seekerr; |
| 1233 |
< |
|
| 839 |
> |
lastpos += (long)nunflshed*AMBVALSIZ; |
| 840 |
|
aflock(F_UNLCK); /* release file */ |
| 841 |
|
nunflshed = 0; |
| 842 |
|
return(n); |
| 843 |
|
seekerr: |
| 844 |
|
error(SYSTEM, "seek failed in ambsync"); |
| 845 |
< |
return -1; /* pro forma return */ |
| 845 |
> |
return(EOF); /* pro forma return */ |
| 846 |
|
} |
| 847 |
|
|
| 848 |
|
#else /* ! F_SETLKW */ |
