ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/rt/ambient.c
Revision: 2.44
Committed: Wed Jun 17 13:29:55 1998 UTC (25 years, 10 months ago) by gwlarson
Content type: text/plain
Branch: MAIN
Changes since 2.43: +0 -1 lines
Log Message:
moved lseek() and ftell() declarations to standard.h

File Contents

# User Rev Content
1 greg 2.38 /* Copyright (c) 1996 Regents of the University of California */
2 greg 1.1
3     #ifndef lint
4     static char SCCSid[] = "$SunId$ LBL";
5     #endif
6    
7     /*
8     * ambient.c - routines dealing with ambient (inter-reflected) component.
9     */
10    
11     #include "ray.h"
12    
13     #include "octree.h"
14    
15 greg 1.8 #include "otypes.h"
16    
17 greg 1.14 #include "ambient.h"
18    
19 greg 1.1 #include "random.h"
20    
21 greg 2.32 #ifndef OCTSCALE
22 greg 2.29 #define OCTSCALE 1.0 /* ceil((valid rad.)/(cube size)) */
23 greg 2.32 #endif
24 greg 1.1
25 greg 1.14 typedef struct ambtree {
26 greg 2.12 AMBVAL *alist; /* ambient value list */
27     struct ambtree *kid; /* 8 child nodes */
28 greg 1.14 } AMBTREE; /* ambient octree */
29    
30 greg 1.1 extern CUBE thescene; /* contains space boundaries */
31    
32 greg 2.27 extern char *shm_boundary; /* memory sharing boundary */
33 greg 2.26
34 greg 2.12 #define MAXASET 511 /* maximum number of elements in ambient set */
35     OBJECT ambset[MAXASET+1]={0}; /* ambient include/exclude set */
36 greg 1.1
37 greg 2.12 double maxarad; /* maximum ambient radius */
38     double minarad; /* minimum ambient radius */
39 greg 1.1
40 greg 2.12 static AMBTREE atrunk; /* our ambient trunk node */
41 greg 1.1
42     static FILE *ambfp = NULL; /* ambient file pointer */
43 greg 2.16 static int nunflshed = 0; /* number of unflushed ambient values */
44 greg 1.1
45 greg 2.26 #ifndef SORT_THRESH
46     #ifdef BIGMEM
47 greg 2.27 #define SORT_THRESH ((9L<<20)/sizeof(AMBVAL))
48 greg 2.26 #else
49 greg 2.27 #define SORT_THRESH ((3L<<20)/sizeof(AMBVAL))
50 greg 2.26 #endif
51     #endif
52     #ifndef SORT_INTVL
53 greg 2.41 #define SORT_INTVL (SORT_THRESH<<1)
54 greg 2.26 #endif
55 greg 2.28 #ifndef MAX_SORT_INTVL
56 greg 2.41 #define MAX_SORT_INTVL (SORT_INTVL<<6)
57 greg 2.28 #endif
58 greg 2.26
59 gregl 2.43 static double avsum = 0.; /* computed ambient value sum (log) */
60     static unsigned int navsum = 0; /* number of values in avsum */
61 greg 2.35 static unsigned int nambvals = 0; /* total number of indirect values */
62     static unsigned int nambshare = 0; /* number of values from file */
63 greg 2.27 static unsigned long ambclock = 0; /* ambient access clock */
64     static unsigned long lastsort = 0; /* time of last value sort */
65 greg 2.26 static long sortintvl = SORT_INTVL; /* time until next sort */
66    
67     #define MAXACLOCK (1L<<30) /* clock turnover value */
68 greg 2.27 /*
69     * Track access times unless we are sharing ambient values
70     * through memory on a multiprocessor, when we want to avoid
71 greg 2.35 * claiming our own memory (copy on write). Go ahead anyway
72     * if more than two thirds of our values are unshared.
73 gregl 2.43 * Compile with -Dtracktime=0 to turn this code off.
74 greg 2.27 */
75 gregl 2.43 #ifndef tracktime
76 greg 2.35 #define tracktime (shm_boundary == NULL || nambvals > 3*nambshare)
77 gregl 2.43 #endif
78 greg 2.26
79 greg 2.12 #define AMBFLUSH (BUFSIZ/AMBVALSIZ)
80 greg 2.6
81 greg 2.12 #define newambval() (AMBVAL *)bmalloc(sizeof(AMBVAL))
82 greg 1.1
83 greg 2.40 static int initambfile(), avsave(), avinsert(), sortambvals(), avlmemi();
84 greg 2.20 static AMBVAL *avstore();
85 greg 2.19 #ifdef F_SETLKW
86     static aflock();
87     #endif
88 greg 1.1
89 greg 2.7
90 greg 2.3 setambres(ar) /* set ambient resolution */
91     int ar;
92     {
93 greg 2.21 ambres = ar < 0 ? 0 : ar; /* may be done already */
94 greg 2.3 /* set min & max radii */
95     if (ar <= 0) {
96 greg 2.25 minarad = 0;
97 greg 2.3 maxarad = thescene.cusize / 2.0;
98     } else {
99     minarad = thescene.cusize / ar;
100 greg 2.30 maxarad = 64 * minarad; /* heuristic */
101 greg 2.3 if (maxarad > thescene.cusize / 2.0)
102     maxarad = thescene.cusize / 2.0;
103     }
104 greg 2.25 if (minarad <= FTINY)
105     minarad = 10*FTINY;
106     if (maxarad <= minarad)
107     maxarad = 64 * minarad;
108 greg 2.3 }
109    
110    
111 greg 2.21 setambacc(newa) /* set ambient accuracy */
112 greg 2.20 double newa;
113     {
114 greg 2.33 double ambdiff;
115 greg 2.20
116 greg 2.33 if (newa < 0.0)
117     newa = 0.0;
118     ambdiff = fabs(newa - ambacc);
119     if (ambdiff >= .01 && (ambacc = newa) > FTINY && nambvals > 0)
120     sortambvals(1); /* rebuild tree */
121 greg 2.20 }
122    
123    
124 greg 1.1 setambient(afile) /* initialize calculation */
125     char *afile;
126     {
127 greg 2.37 long pos, flen;
128 greg 2.12 AMBVAL amb;
129 greg 2.3 /* init ambient limits */
130     setambres(ambres);
131 greg 2.21 setambacc(ambacc);
132 greg 2.19 if (afile == NULL)
133     return;
134 greg 2.20 if (ambacc <= FTINY) {
135 greg 2.21 sprintf(errmsg, "zero ambient accuracy so \"%s\" not opened",
136 greg 2.20 afile);
137     error(WARNING, errmsg);
138     return;
139     }
140 greg 2.3 /* open ambient file */
141 greg 2.19 if ((ambfp = fopen(afile, "r+")) != NULL) {
142     initambfile(0);
143 greg 2.37 pos = ftell(ambfp);
144 greg 2.19 while (readambval(&amb, ambfp))
145 greg 2.21 avinsert(avstore(&amb));
146 greg 2.19 /* align */
147 greg 2.37 pos += (long)nambvals*AMBVALSIZ;
148     flen = lseek(fileno(ambfp), 0L, 2);
149     if (flen != pos) {
150 greg 2.42 sprintf(errmsg,
151 greg 2.37 "ignoring last %ld values in ambient file (corrupted)",
152     (flen - pos)/AMBVALSIZ);
153 greg 2.42 error(WARNING, errmsg);
154 greg 2.37 fseek(ambfp, pos, 0);
155     ftruncate(fileno(ambfp), pos);
156     }
157 greg 2.35 nambshare = nambvals;
158 greg 2.19 } else if ((ambfp = fopen(afile, "w+")) != NULL)
159     initambfile(1);
160     else {
161     sprintf(errmsg, "cannot open ambient file \"%s\"", afile);
162     error(SYSTEM, errmsg);
163 greg 2.16 }
164 greg 2.19 nunflshed++; /* lie */
165     ambsync();
166 greg 1.8 }
167    
168    
169     ambnotify(obj) /* record new modifier */
170 greg 2.12 OBJECT obj;
171 greg 1.8 {
172 greg 1.11 static int hitlimit = 0;
173 greg 2.12 register OBJREC *o = objptr(obj);
174 greg 1.8 register char **amblp;
175    
176 greg 1.11 if (hitlimit || !ismodifier(o->otype))
177 greg 1.8 return;
178     for (amblp = amblist; *amblp != NULL; amblp++)
179     if (!strcmp(o->oname, *amblp)) {
180 greg 1.11 if (ambset[0] >= MAXASET) {
181     error(WARNING, "too many modifiers in ambient list");
182     hitlimit++;
183     return; /* should this be fatal? */
184     }
185 greg 1.8 insertelem(ambset, obj);
186     return;
187 greg 1.1 }
188     }
189    
190    
191 greg 2.34 ambient(acol, r, nrm) /* compute ambient component for ray */
192 greg 1.1 COLOR acol;
193     register RAY *r;
194 greg 2.34 FVECT nrm;
195 greg 1.1 {
196     static int rdepth = 0; /* ambient recursion */
197 gregl 2.43 double d, l;
198 greg 1.1
199     if (ambdiv <= 0) /* no ambient calculation */
200     goto dumbamb;
201     /* check number of bounces */
202 greg 1.16 if (rdepth >= ambounce)
203 greg 1.1 goto dumbamb;
204     /* check ambient list */
205     if (ambincl != -1 && r->ro != NULL &&
206     ambincl != inset(ambset, r->ro->omod))
207     goto dumbamb;
208    
209     if (ambacc <= FTINY) { /* no ambient storage */
210 greg 1.16 rdepth++;
211     d = doambient(acol, r, r->rweight, NULL, NULL);
212     rdepth--;
213 greg 2.32 if (d <= FTINY)
214 greg 1.1 goto dumbamb;
215 greg 1.16 return;
216 greg 1.1 }
217 greg 2.40
218     if (tracktime) /* sort to minimize thrashing */
219     sortambvals(0);
220 greg 1.1 /* get ambient value */
221     setcolor(acol, 0.0, 0.0, 0.0);
222 greg 2.34 d = sumambient(acol, r, nrm, rdepth,
223 greg 1.16 &atrunk, thescene.cuorg, thescene.cusize);
224 greg 2.32 if (d > FTINY) {
225 greg 1.16 scalecolor(acol, 1.0/d);
226 greg 2.32 return;
227 greg 1.16 }
228 greg 2.33 rdepth++; /* need to cache new value */
229 greg 2.34 d = makeambient(acol, r, nrm, rdepth-1);
230 greg 2.32 rdepth--;
231 greg 1.16 if (d > FTINY)
232     return;
233 greg 1.1 dumbamb: /* return global value */
234     copycolor(acol, ambval);
235 gregl 2.43 if (ambvwt <= 0 | navsum == 0)
236 greg 2.32 return;
237 gregl 2.43 l = bright(ambval); /* average in computations */
238     if (l > FTINY) {
239     d = (log(l)*(double)ambvwt + avsum) /
240     (double)(ambvwt + navsum);
241     d = exp(d) / l;
242     scalecolor(acol, d); /* apply color of ambval */
243     } else {
244     d = exp( avsum / (double)navsum );
245     setcolor(acol, d, d, d); /* neutral color */
246     }
247 greg 1.1 }
248    
249    
250     double
251 greg 2.34 sumambient(acol, r, rn, al, at, c0, s) /* get interpolated ambient value */
252 greg 1.1 COLOR acol;
253     register RAY *r;
254 greg 2.34 FVECT rn;
255 greg 1.16 int al;
256 greg 2.12 AMBTREE *at;
257 greg 1.1 FVECT c0;
258 greg 2.12 double s;
259 greg 1.1 {
260 greg 2.12 double d, e1, e2, wt, wsum;
261 greg 1.1 COLOR ct;
262     FVECT ck0;
263     int i;
264     register int j;
265 greg 2.12 register AMBVAL *av;
266 greg 2.29
267     wsum = 0.0;
268 greg 1.7 /* do this node */
269 greg 1.1 for (av = at->alist; av != NULL; av = av->next) {
270 greg 2.26 if (tracktime)
271 greg 2.40 av->latick = ambclock;
272 greg 1.1 /*
273 greg 1.16 * Ambient level test.
274 greg 1.1 */
275 greg 2.23 if (av->lvl > al) /* list sorted, so this works */
276     break;
277     if (av->weight < r->rweight-FTINY)
278 greg 1.1 continue;
279     /*
280     * Ambient radius test.
281     */
282 greg 2.29 d = av->pos[0] - r->rop[0];
283     e1 = d * d;
284     d = av->pos[1] - r->rop[1];
285     e1 += d * d;
286     d = av->pos[2] - r->rop[2];
287     e1 += d * d;
288 greg 1.1 e1 /= av->rad * av->rad;
289     if (e1 > ambacc*ambacc*1.21)
290     continue;
291     /*
292     * Normal direction test.
293     */
294     e2 = (1.0 - DOT(av->dir, r->ron)) * r->rweight;
295     if (e2 < 0.0) e2 = 0.0;
296     if (e1 + e2 > ambacc*ambacc*1.21)
297     continue;
298     /*
299     * Ray behind test.
300     */
301     d = 0.0;
302     for (j = 0; j < 3; j++)
303     d += (r->rop[j] - av->pos[j]) *
304     (av->dir[j] + r->ron[j]);
305 greg 1.18 if (d*0.5 < -minarad*ambacc-.001)
306 greg 1.1 continue;
307     /*
308     * Jittering final test reduces image artifacts.
309     */
310     wt = sqrt(e1) + sqrt(e2);
311 greg 2.31 if (wt > ambacc*(.9+.2*urand(9015+samplendx)))
312 greg 1.1 continue;
313     if (wt <= 1e-3)
314     wt = 1e3;
315     else
316     wt = 1.0 / wt;
317     wsum += wt;
318 greg 2.34 extambient(ct, av, r->rop, rn);
319 greg 1.1 scalecolor(ct, wt);
320     addcolor(acol, ct);
321 greg 1.7 }
322     if (at->kid == NULL)
323     return(wsum);
324     /* do children */
325     s *= 0.5;
326     for (i = 0; i < 8; i++) {
327     for (j = 0; j < 3; j++) {
328     ck0[j] = c0[j];
329     if (1<<j & i)
330     ck0[j] += s;
331     if (r->rop[j] < ck0[j] - OCTSCALE*s)
332     break;
333     if (r->rop[j] > ck0[j] + (1.0+OCTSCALE)*s)
334     break;
335     }
336     if (j == 3)
337 greg 2.34 wsum += sumambient(acol, r, rn, al, at->kid+i, ck0, s);
338 greg 1.1 }
339     return(wsum);
340     }
341    
342    
343     double
344 greg 2.34 makeambient(acol, r, rn, al) /* make a new ambient value */
345 greg 1.1 COLOR acol;
346     register RAY *r;
347 greg 2.34 FVECT rn;
348 greg 1.16 int al;
349 greg 1.1 {
350 greg 2.12 AMBVAL amb;
351 greg 1.14 FVECT gp, gd;
352 greg 1.16 /* compute weight */
353     amb.weight = pow(AVGREFL, (double)al);
354 greg 2.33 if (r->rweight < 0.1*amb.weight) /* heuristic */
355 greg 1.16 amb.weight = r->rweight;
356     /* compute ambient */
357     amb.rad = doambient(acol, r, amb.weight, gp, gd);
358 greg 2.33 if (amb.rad <= FTINY)
359 greg 1.1 return(0.0);
360     /* store it */
361     VCOPY(amb.pos, r->rop);
362     VCOPY(amb.dir, r->ron);
363 greg 1.16 amb.lvl = al;
364 greg 1.1 copycolor(amb.val, acol);
365 greg 1.14 VCOPY(amb.gpos, gp);
366     VCOPY(amb.gdir, gd);
367 greg 1.1 /* insert into tree */
368 greg 2.7 avsave(&amb); /* and save to file */
369 greg 2.34 if (rn != r->ron)
370     extambient(acol, &amb, r->rop, rn); /* texture */
371 greg 1.1 return(amb.rad);
372 greg 1.15 }
373    
374    
375     extambient(cr, ap, pv, nv) /* extrapolate value at pv, nv */
376     COLOR cr;
377 greg 2.12 register AMBVAL *ap;
378 greg 1.15 FVECT pv, nv;
379     {
380     FVECT v1, v2;
381     register int i;
382 greg 2.12 double d;
383 greg 1.15
384     d = 1.0; /* zeroeth order */
385     /* gradient due to translation */
386     for (i = 0; i < 3; i++)
387     d += ap->gpos[i]*(pv[i]-ap->pos[i]);
388     /* gradient due to rotation */
389     VCOPY(v1, ap->dir);
390     fcross(v2, v1, nv);
391     d += DOT(ap->gdir, v2);
392     if (d <= 0.0) {
393     setcolor(cr, 0.0, 0.0, 0.0);
394     return;
395     }
396     copycolor(cr, ap->val);
397     scalecolor(cr, d);
398 greg 1.1 }
399    
400    
401     static
402 greg 2.9 initambfile(creat) /* initialize ambient file */
403     int creat;
404     {
405     extern char *progname, *octname, VersionID[];
406    
407 greg 2.19 #ifdef F_SETLKW
408     aflock(creat ? F_WRLCK : F_RDLCK);
409     #endif
410 greg 2.12 #ifdef MSDOS
411     setmode(fileno(ambfp), O_BINARY);
412     #endif
413 greg 2.21 setbuf(ambfp, bmalloc(BUFSIZ+8));
414 greg 2.9 if (creat) { /* new file */
415 greg 2.24 newheader("RADIANCE", ambfp);
416 greg 2.41 fprintf(ambfp, "%s -av %g %g %g -aw %d -ab %d -aa %g ",
417 greg 2.9 progname, colval(ambval,RED),
418     colval(ambval,GRN), colval(ambval,BLU),
419 greg 2.41 ambvwt, ambounce, ambacc);
420 greg 2.9 fprintf(ambfp, "-ad %d -as %d -ar %d %s\n",
421     ambdiv, ambssamp, ambres,
422     octname==NULL ? "" : octname);
423     fprintf(ambfp, "SOFTWARE= %s\n", VersionID);
424     fputformat(AMBFMT, ambfp);
425     putc('\n', ambfp);
426     putambmagic(ambfp);
427 greg 2.17 } else if (checkheader(ambfp, AMBFMT, NULL) < 0 || !hasambmagic(ambfp))
428     error(USER, "bad ambient file");
429 greg 2.9 }
430    
431    
432     static
433 greg 2.7 avsave(av) /* insert and save an ambient value */
434 greg 2.12 AMBVAL *av;
435 greg 1.1 {
436 greg 2.21 avinsert(avstore(av));
437 greg 1.1 if (ambfp == NULL)
438     return;
439 greg 2.5 if (writambval(av, ambfp) < 0)
440 greg 1.1 goto writerr;
441 greg 2.16 if (++nunflshed >= AMBFLUSH)
442 greg 2.7 if (ambsync() == EOF)
443 greg 1.1 goto writerr;
444     return;
445     writerr:
446 greg 2.17 error(SYSTEM, "error writing ambient file");
447 greg 1.1 }
448    
449    
450 greg 2.20 static AMBVAL *
451     avstore(aval) /* allocate memory and store aval */
452     register AMBVAL *aval;
453     {
454     register AMBVAL *av;
455 gregl 2.43 double d;
456 greg 2.20
457     if ((av = newambval()) == NULL)
458     error(SYSTEM, "out of memory in avstore");
459     copystruct(av, aval);
460 greg 2.26 av->latick = ambclock;
461     av->next = NULL;
462     nambvals++;
463 gregl 2.43 d = bright(av->val);
464     if (d > FTINY) { /* add to log sum for averaging */
465     avsum += log(d);
466     navsum++;
467     }
468 greg 2.20 return(av);
469     }
470    
471    
472 greg 2.26 #define ATALLOCSZ 512 /* #/8 trees to allocate at once */
473    
474     static AMBTREE *atfreelist = NULL; /* free ambient tree structures */
475    
476    
477 greg 1.1 static
478 greg 2.26 AMBTREE *
479     newambtree() /* allocate 8 ambient tree structs */
480     {
481     register AMBTREE *atp, *upperlim;
482    
483     if (atfreelist == NULL) { /* get more nodes */
484     atfreelist = (AMBTREE *)bmalloc(ATALLOCSZ*8*sizeof(AMBTREE));
485     if (atfreelist == NULL)
486     return(NULL);
487     /* link new free list */
488     upperlim = atfreelist + 8*(ATALLOCSZ-1);
489     for (atp = atfreelist; atp < upperlim; atp += 8)
490     atp->kid = atp + 8;
491     atp->kid = NULL;
492     }
493     atp = atfreelist;
494     atfreelist = atp->kid;
495     bzero((char *)atp, 8*sizeof(AMBTREE));
496     return(atp);
497     }
498    
499    
500     static
501     freeambtree(atp) /* free 8 ambient tree structs */
502     AMBTREE *atp;
503     {
504     atp->kid = atfreelist;
505     atfreelist = atp;
506     }
507    
508    
509     static
510 greg 2.21 avinsert(av) /* insert ambient value in our tree */
511 greg 2.20 register AMBVAL *av;
512 greg 1.1 {
513 greg 2.21 register AMBTREE *at;
514 greg 2.23 register AMBVAL *ap;
515     AMBVAL avh;
516 greg 1.1 FVECT ck0;
517 greg 2.21 double s;
518 greg 1.1 int branch;
519     register int i;
520    
521 greg 2.20 if (av->rad <= FTINY)
522     error(CONSISTENCY, "zero ambient radius in avinsert");
523 greg 2.21 at = &atrunk;
524     VCOPY(ck0, thescene.cuorg);
525     s = thescene.cusize;
526 greg 1.1 while (s*(OCTSCALE/2) > av->rad*ambacc) {
527     if (at->kid == NULL)
528     if ((at->kid = newambtree()) == NULL)
529 greg 2.20 error(SYSTEM, "out of memory in avinsert");
530 greg 1.1 s *= 0.5;
531     branch = 0;
532     for (i = 0; i < 3; i++)
533     if (av->pos[i] > ck0[i] + s) {
534     ck0[i] += s;
535     branch |= 1 << i;
536     }
537     at = at->kid + branch;
538     }
539 greg 2.23 avh.next = at->alist; /* order by increasing level */
540     for (ap = &avh; ap->next != NULL; ap = ap->next)
541     if (ap->next->lvl >= av->lvl)
542     break;
543     av->next = ap->next;
544     ap->next = av;
545     at->alist = avh.next;
546 greg 2.7 }
547    
548    
549 greg 2.20 static
550 greg 2.26 unloadatree(at, f) /* unload an ambient value tree */
551 greg 2.20 register AMBTREE *at;
552 greg 2.26 int (*f)();
553 greg 2.20 {
554     register AMBVAL *av;
555     register int i;
556     /* transfer values at this node */
557     for (av = at->alist; av != NULL; av = at->alist) {
558     at->alist = av->next;
559 greg 2.26 (*f)(av);
560 greg 2.20 }
561 greg 2.21 if (at->kid == NULL)
562     return;
563 greg 2.20 for (i = 0; i < 8; i++) /* transfer and free children */
564 greg 2.26 unloadatree(at->kid+i, f);
565 greg 2.20 freeambtree(at->kid);
566 greg 2.26 at->kid = NULL;
567     }
568    
569    
570 greg 2.39 static struct avl {
571     AMBVAL *p;
572     unsigned long t;
573     } *avlist1; /* ambient value list with ticks */
574     static AMBVAL **avlist2; /* memory positions for sorting */
575 greg 2.26 static int i_avlist; /* index for lists */
576    
577    
578     static
579     av2list(av)
580 greg 2.39 register AMBVAL *av;
581 greg 2.26 {
582 greg 2.27 #ifdef DEBUG
583 greg 2.26 if (i_avlist >= nambvals)
584     error(CONSISTENCY, "too many ambient values in av2list1");
585 greg 2.27 #endif
586 greg 2.39 avlist1[i_avlist].p = avlist2[i_avlist] = av;
587     avlist1[i_avlist++].t = av->latick;
588 greg 2.26 }
589    
590    
591     static int
592 greg 2.39 alatcmp(av1, av2) /* compare ambient values for MRA */
593     struct avl *av1, *av2;
594 greg 2.26 {
595 greg 2.39 register long lc = av2->t - av1->t;
596 greg 2.38 return(lc<0 ? -1 : lc>0 ? 1 : 0);
597 greg 2.26 }
598    
599    
600     static int
601     aposcmp(avp1, avp2) /* compare ambient value positions */
602     AMBVAL **avp1, **avp2;
603     {
604     return(*avp1 - *avp2);
605     }
606    
607    
608 greg 2.39 #if 1
609 greg 2.27 static int
610     avlmemi(avaddr) /* find list position from address */
611     AMBVAL *avaddr;
612     {
613     register AMBVAL **avlpp;
614    
615     avlpp = (AMBVAL **)bsearch((char *)&avaddr, (char *)avlist2,
616     nambvals, sizeof(AMBVAL *), aposcmp);
617     if (avlpp == NULL)
618     error(CONSISTENCY, "address not found in avlmemi");
619     return(avlpp - avlist2);
620     }
621     #else
622     #define avlmemi(avaddr) ((AMBVAL **)bsearch((char *)&avaddr,(char *)avlist2, \
623     nambvals,sizeof(AMBVAL *),aposcmp) - avlist2)
624     #endif
625    
626    
627 greg 2.26 static
628     sortambvals(always) /* resort ambient values */
629     int always;
630     {
631     AMBTREE oldatrunk;
632     AMBVAL tav, *tap, *pnext;
633     register int i, j;
634 greg 2.28 /* see if it's time yet */
635 greg 2.40 if (!always && (ambclock++ < lastsort+sortintvl ||
636 greg 2.28 nambvals < SORT_THRESH))
637     return;
638 greg 2.26 /*
639     * The idea here is to minimize memory thrashing
640     * in VM systems by improving reference locality.
641     * We do this by periodically sorting our stored ambient
642     * values in memory in order of most recently to least
643     * recently accessed. This ordering was chosen so that new
644     * ambient values (which tend to be less important) go into
645     * higher memory with the infrequently accessed values.
646     * Since we expect our values to need sorting less
647     * frequently as the process continues, we double our
648     * waiting interval after each call.
649     * This routine is also called by setambacc() with
650     * the "always" parameter set to 1 so that the ambient
651     * tree will be rebuilt with the new accuracy parameter.
652     */
653 greg 2.27 if (tracktime) { /* allocate pointer arrays to sort */
654 greg 2.26 avlist2 = (AMBVAL **)malloc(nambvals*sizeof(AMBVAL *));
655 greg 2.39 avlist1 = (struct avl *)malloc(nambvals*sizeof(struct avl));
656     } else {
657     avlist2 = NULL;
658     avlist1 = NULL;
659     }
660     if (avlist1 == NULL) { /* no time tracking -- rebuild tree? */
661     if (avlist2 != NULL)
662     free((char *)avlist2);
663 greg 2.27 if (always) { /* rebuild without sorting */
664     copystruct(&oldatrunk, &atrunk);
665     atrunk.alist = NULL;
666     atrunk.kid = NULL;
667     unloadatree(&oldatrunk, avinsert);
668     }
669 greg 2.26 } else { /* sort memory by last access time */
670     /*
671     * Sorting memory is tricky because it isn't contiguous.
672     * We have to sort an array of pointers by MRA and also
673     * by memory position. We then copy values in "loops"
674     * to minimize memory hits. Nevertheless, we will visit
675 greg 2.27 * everyone at least twice, and this is an expensive process
676 greg 2.26 * when we're thrashing, which is when we need to do it.
677     */
678 greg 2.27 #ifdef DEBUG
679 greg 2.29 sprintf(errmsg, "sorting %u ambient values at ambclock=%lu...",
680     nambvals, ambclock);
681 greg 2.27 eputs(errmsg);
682     #endif
683     i_avlist = 0;
684     unloadatree(&atrunk, av2list); /* empty current tree */
685     #ifdef DEBUG
686     if (i_avlist < nambvals)
687     error(CONSISTENCY, "missing ambient values in sortambvals");
688     #endif
689 greg 2.39 qsort((char *)avlist1, nambvals, sizeof(struct avl), alatcmp);
690 greg 2.26 qsort((char *)avlist2, nambvals, sizeof(AMBVAL *), aposcmp);
691     for (i = 0; i < nambvals; i++) {
692 greg 2.39 if (avlist1[i].p == NULL)
693 greg 2.26 continue;
694     tap = avlist2[i];
695     copystruct(&tav, tap);
696 greg 2.39 for (j = i; (pnext = avlist1[j].p) != tap;
697 greg 2.27 j = avlmemi(pnext)) {
698 greg 2.26 copystruct(avlist2[j], pnext);
699     avinsert(avlist2[j]);
700 greg 2.39 avlist1[j].p = NULL;
701 greg 2.26 }
702     copystruct(avlist2[j], &tav);
703     avinsert(avlist2[j]);
704 greg 2.39 avlist1[j].p = NULL;
705 greg 2.26 }
706     free((char *)avlist1);
707     free((char *)avlist2);
708 greg 2.28 /* compute new sort interval */
709     sortintvl = ambclock - lastsort;
710 greg 2.32 if (sortintvl >= MAX_SORT_INTVL/2)
711 greg 2.28 sortintvl = MAX_SORT_INTVL;
712     else
713 greg 2.26 sortintvl <<= 1; /* wait twice as long next */
714 greg 2.27 #ifdef DEBUG
715     eputs("done\n");
716     #endif
717 greg 2.26 }
718     if (ambclock >= MAXACLOCK)
719     ambclock = MAXACLOCK/2;
720     lastsort = ambclock;
721 greg 2.20 }
722    
723    
724 greg 2.18 #ifdef F_SETLKW
725 greg 2.10
726 greg 2.19 static
727     aflock(typ) /* lock/unlock ambient file */
728     int typ;
729     {
730     static struct flock fls; /* static so initialized to zeroes */
731    
732     fls.l_type = typ;
733     if (fcntl(fileno(ambfp), F_SETLKW, &fls) < 0)
734     error(SYSTEM, "cannot (un)lock ambient file");
735     }
736    
737    
738 greg 2.16 int
739 greg 2.7 ambsync() /* synchronize ambient file */
740     {
741     static FILE *ambinp = NULL;
742 greg 2.15 static long lastpos = -1;
743     long flen;
744 greg 2.12 AMBVAL avs;
745 greg 2.7 register int n;
746 greg 2.16
747     if (nunflshed == 0)
748     return(0);
749 greg 2.19 if (lastpos < 0) /* initializing (locked in initambfile) */
750     goto syncend;
751 greg 2.7 /* gain exclusive access */
752 greg 2.19 aflock(F_WRLCK);
753 greg 2.7 /* see if file has grown */
754 greg 2.15 if ((flen = lseek(fileno(ambfp), 0L, 2)) < 0)
755 greg 2.21 goto seekerr;
756 greg 2.15 if (n = flen - lastpos) { /* file has grown */
757 greg 2.17 if (ambinp == NULL) { /* use duplicate filedes */
758     ambinp = fdopen(dup(fileno(ambfp)), "r");
759 greg 2.14 if (ambinp == NULL)
760 greg 2.17 error(SYSTEM, "fdopen failed in ambsync");
761 greg 2.14 }
762 greg 2.15 if (fseek(ambinp, lastpos, 0) < 0)
763 greg 2.21 goto seekerr;
764 greg 2.15 while (n >= AMBVALSIZ) { /* load contributed values */
765 greg 2.37 if (!readambval(&avs, ambinp)) {
766     sprintf(errmsg,
767     "ambient file corrupted near character %ld",
768     flen - n);
769     error(WARNING, errmsg);
770     break;
771     }
772 greg 2.21 avinsert(avstore(&avs));
773 greg 2.15 n -= AMBVALSIZ;
774     }
775 greg 2.22 /*** seek always as safety measure
776     if (n) ***/ /* alignment */
777 greg 2.21 if (lseek(fileno(ambfp), flen-n, 0) < 0)
778     goto seekerr;
779 greg 2.7 }
780 greg 2.21 #ifdef DEBUG
781     if (ambfp->_ptr - ambfp->_base != nunflshed*AMBVALSIZ) {
782     sprintf(errmsg, "ambient file buffer at %d rather than %d",
783     ambfp->_ptr - ambfp->_base,
784     nunflshed*AMBVALSIZ);
785     error(CONSISTENCY, errmsg);
786     }
787     #endif
788 greg 2.15 syncend:
789 greg 2.7 n = fflush(ambfp); /* calls write() at last */
790 greg 2.21 if ((lastpos = lseek(fileno(ambfp), 0L, 1)) < 0)
791     goto seekerr;
792 greg 2.19 aflock(F_UNLCK); /* release file */
793 greg 2.16 nunflshed = 0;
794 greg 2.7 return(n);
795 greg 2.21 seekerr:
796     error(SYSTEM, "seek failed in ambsync");
797 greg 2.18 }
798    
799     #else
800    
801     int
802     ambsync() /* flush ambient file */
803     {
804     if (nunflshed == 0)
805     return(0);
806     nunflshed = 0;
807     return(fflush(ambfp));
808 greg 1.1 }
809 greg 2.10
810     #endif