ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/rt/ambient.c
Revision: 2.71
Committed: Fri Apr 11 20:31:37 2014 UTC (10 years ago) by greg
Content type: text/plain
Branch: MAIN
Changes since 2.70: +362 -71 lines
Log Message:
Partial implementation of Hessian gradient calculation (-DNEWAMB)

File Contents

# User Rev Content
1 greg 1.1 #ifndef lint
2 greg 2.71 static const char RCSid[] = "$Id: ambient.c,v 2.70 2011/09/22 02:15:56 greg Exp $";
3 greg 1.1 #endif
4     /*
5     * ambient.c - routines dealing with ambient (inter-reflected) component.
6 greg 2.47 *
7     * Declarations of external symbols in ambient.h
8     */
9    
10 greg 2.48 #include "copyright.h"
11 greg 1.1
12 schorsch 2.52 #include <string.h>
13    
14 schorsch 2.50 #include "platform.h"
15 greg 1.1 #include "ray.h"
16 greg 1.8 #include "otypes.h"
17 schorsch 2.56 #include "resolu.h"
18 greg 1.14 #include "ambient.h"
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 2.27 extern char *shm_boundary; /* memory sharing boundary */
26 greg 2.26
27 greg 2.57 #ifndef MAXASET
28 greg 2.67 #define MAXASET 4095 /* maximum number of elements in ambient set */
29 greg 2.57 #endif
30 greg 2.12 OBJECT ambset[MAXASET+1]={0}; /* ambient include/exclude set */
31 greg 1.1
32 greg 2.12 double maxarad; /* maximum ambient radius */
33     double minarad; /* minimum ambient radius */
34 greg 1.1
35 greg 2.12 static AMBTREE atrunk; /* our ambient trunk node */
36 greg 1.1
37     static FILE *ambfp = NULL; /* ambient file pointer */
38 greg 2.16 static int nunflshed = 0; /* number of unflushed ambient values */
39 greg 1.1
40 greg 2.26 #ifndef SORT_THRESH
41 greg 2.49 #ifdef SMLMEM
42 greg 2.71 #define SORT_THRESH ((16L<<20)/sizeof(AMBVAL))
43 greg 2.49 #else
44 greg 2.71 #define SORT_THRESH ((64L<<20)/sizeof(AMBVAL))
45 greg 2.26 #endif
46     #endif
47     #ifndef SORT_INTVL
48 greg 2.41 #define SORT_INTVL (SORT_THRESH<<1)
49 greg 2.26 #endif
50 greg 2.28 #ifndef MAX_SORT_INTVL
51 greg 2.41 #define MAX_SORT_INTVL (SORT_INTVL<<6)
52 greg 2.28 #endif
53 greg 2.26
54 gregl 2.43 static double avsum = 0.; /* computed ambient value sum (log) */
55     static unsigned int navsum = 0; /* number of values in avsum */
56 greg 2.35 static unsigned int nambvals = 0; /* total number of indirect values */
57     static unsigned int nambshare = 0; /* number of values from file */
58 greg 2.27 static unsigned long ambclock = 0; /* ambient access clock */
59     static unsigned long lastsort = 0; /* time of last value sort */
60 greg 2.26 static long sortintvl = SORT_INTVL; /* time until next sort */
61 greg 2.47 static FILE *ambinp = NULL; /* auxiliary file for input */
62     static long lastpos = -1; /* last flush position */
63 greg 2.26
64     #define MAXACLOCK (1L<<30) /* clock turnover value */
65 greg 2.27 /*
66     * Track access times unless we are sharing ambient values
67     * through memory on a multiprocessor, when we want to avoid
68 greg 2.35 * claiming our own memory (copy on write). Go ahead anyway
69     * if more than two thirds of our values are unshared.
70 gregl 2.43 * Compile with -Dtracktime=0 to turn this code off.
71 greg 2.27 */
72 gregl 2.43 #ifndef tracktime
73 greg 2.35 #define tracktime (shm_boundary == NULL || nambvals > 3*nambshare)
74 gregl 2.43 #endif
75 greg 2.26
76 greg 2.12 #define AMBFLUSH (BUFSIZ/AMBVALSIZ)
77 greg 2.6
78 greg 2.47 #define newambval() (AMBVAL *)malloc(sizeof(AMBVAL))
79     #define freeav(av) free((void *)av);
80 greg 1.1
81 schorsch 2.56 static void initambfile(int creat);
82     static void avsave(AMBVAL *av);
83     static AMBVAL *avstore(AMBVAL *aval);
84     static AMBTREE *newambtree(void);
85     static void freeambtree(AMBTREE *atp);
86    
87 greg 2.71 typedef void unloadtf_t(AMBVAL *);
88 schorsch 2.56 static unloadtf_t avinsert;
89     static unloadtf_t av2list;
90 greg 2.71 static unloadtf_t avfree;
91 schorsch 2.56 static void unloadatree(AMBTREE *at, unloadtf_t *f);
92    
93     static int aposcmp(const void *avp1, const void *avp2);
94     static int avlmemi(AMBVAL *avaddr);
95     static void sortambvals(int always);
96    
97 greg 2.19 #ifdef F_SETLKW
98 schorsch 2.56 static void aflock(int typ);
99 greg 2.19 #endif
100 greg 1.1
101 greg 2.7
102 greg 2.71 void
103 schorsch 2.56 setambres( /* set ambient resolution */
104     int ar
105     )
106 greg 2.3 {
107 greg 2.21 ambres = ar < 0 ? 0 : ar; /* may be done already */
108 greg 2.3 /* set min & max radii */
109     if (ar <= 0) {
110 greg 2.25 minarad = 0;
111 greg 2.3 maxarad = thescene.cusize / 2.0;
112     } else {
113     minarad = thescene.cusize / ar;
114 greg 2.30 maxarad = 64 * minarad; /* heuristic */
115 greg 2.3 if (maxarad > thescene.cusize / 2.0)
116     maxarad = thescene.cusize / 2.0;
117     }
118 greg 2.25 if (minarad <= FTINY)
119     minarad = 10*FTINY;
120     if (maxarad <= minarad)
121     maxarad = 64 * minarad;
122 greg 2.3 }
123    
124    
125 greg 2.71 void
126 schorsch 2.56 setambacc( /* set ambient accuracy */
127     double newa
128     )
129 greg 2.20 {
130 greg 2.33 double ambdiff;
131 greg 2.20
132 greg 2.33 if (newa < 0.0)
133     newa = 0.0;
134     ambdiff = fabs(newa - ambacc);
135     if (ambdiff >= .01 && (ambacc = newa) > FTINY && nambvals > 0)
136     sortambvals(1); /* rebuild tree */
137 greg 2.20 }
138    
139    
140 greg 2.71 void
141 schorsch 2.56 setambient(void) /* initialize calculation */
142 greg 1.1 {
143 gwlarson 2.46 int readonly = 0;
144 greg 2.66 long flen;
145 greg 2.12 AMBVAL amb;
146 greg 2.47 /* make sure we're fresh */
147     ambdone();
148 greg 2.3 /* init ambient limits */
149     setambres(ambres);
150 greg 2.21 setambacc(ambacc);
151 greg 2.47 if (ambfile == NULL || !ambfile[0])
152 greg 2.19 return;
153 greg 2.20 if (ambacc <= FTINY) {
154 greg 2.21 sprintf(errmsg, "zero ambient accuracy so \"%s\" not opened",
155 greg 2.47 ambfile);
156 greg 2.20 error(WARNING, errmsg);
157     return;
158     }
159 greg 2.3 /* open ambient file */
160 greg 2.47 if ((ambfp = fopen(ambfile, "r+")) == NULL)
161     readonly = (ambfp = fopen(ambfile, "r")) != NULL;
162 gwlarson 2.46 if (ambfp != NULL) {
163     initambfile(0); /* file exists */
164 greg 2.66 lastpos = ftell(ambfp);
165 greg 2.19 while (readambval(&amb, ambfp))
166 greg 2.21 avinsert(avstore(&amb));
167 gwlarson 2.46 nambshare = nambvals; /* share loaded values */
168     if (readonly) {
169     sprintf(errmsg,
170     "loaded %u values from read-only ambient file",
171     nambvals);
172     error(WARNING, errmsg);
173     fclose(ambfp); /* close file so no writes */
174     ambfp = NULL;
175     return; /* avoid ambsync() */
176     }
177     /* align file pointer */
178 greg 2.66 lastpos += (long)nambvals*AMBVALSIZ;
179 greg 2.55 flen = lseek(fileno(ambfp), (off_t)0, SEEK_END);
180 greg 2.66 if (flen != lastpos) {
181 greg 2.42 sprintf(errmsg,
182 greg 2.37 "ignoring last %ld values in ambient file (corrupted)",
183 greg 2.66 (flen - lastpos)/AMBVALSIZ);
184 greg 2.42 error(WARNING, errmsg);
185 greg 2.66 fseek(ambfp, lastpos, SEEK_SET);
186 schorsch 2.51 #ifndef _WIN32 /* XXX we need a replacement for that one */
187 greg 2.66 ftruncate(fileno(ambfp), (off_t)lastpos);
188 schorsch 2.51 #endif
189 greg 2.37 }
190 greg 2.47 } else if ((ambfp = fopen(ambfile, "w+")) != NULL) {
191 gwlarson 2.46 initambfile(1); /* else create new file */
192 greg 2.68 fflush(ambfp);
193 greg 2.66 lastpos = ftell(ambfp);
194 gwlarson 2.46 } else {
195 greg 2.47 sprintf(errmsg, "cannot open ambient file \"%s\"", ambfile);
196 greg 2.19 error(SYSTEM, errmsg);
197 greg 2.16 }
198 greg 2.71 #ifdef getc_unlocked
199     flockfile(ambfp); /* application-level lock */
200     #endif
201 greg 2.68 #ifdef F_SETLKW
202     aflock(F_UNLCK); /* release file */
203     #endif
204 greg 1.8 }
205    
206    
207 greg 2.71 void
208 schorsch 2.56 ambdone(void) /* close ambient file and free memory */
209 greg 2.47 {
210     if (ambfp != NULL) { /* close ambient file */
211     ambsync();
212     fclose(ambfp);
213     ambfp = NULL;
214     if (ambinp != NULL) {
215     fclose(ambinp);
216     ambinp = NULL;
217     }
218     lastpos = -1;
219     }
220     /* free ambient tree */
221 greg 2.71 unloadatree(&atrunk, &avfree);
222 greg 2.47 /* reset state variables */
223     avsum = 0.;
224     navsum = 0;
225     nambvals = 0;
226     nambshare = 0;
227     ambclock = 0;
228     lastsort = 0;
229     sortintvl = SORT_INTVL;
230     }
231    
232    
233 greg 2.71 void
234 schorsch 2.56 ambnotify( /* record new modifier */
235     OBJECT obj
236     )
237 greg 1.8 {
238 greg 1.11 static int hitlimit = 0;
239 greg 2.70 OBJREC *o;
240     char **amblp;
241 greg 1.8
242 greg 2.47 if (obj == OVOID) { /* starting over */
243     ambset[0] = 0;
244     hitlimit = 0;
245     return;
246     }
247     o = objptr(obj);
248 greg 1.11 if (hitlimit || !ismodifier(o->otype))
249 greg 1.8 return;
250     for (amblp = amblist; *amblp != NULL; amblp++)
251     if (!strcmp(o->oname, *amblp)) {
252 greg 1.11 if (ambset[0] >= MAXASET) {
253     error(WARNING, "too many modifiers in ambient list");
254     hitlimit++;
255     return; /* should this be fatal? */
256     }
257 greg 1.8 insertelem(ambset, obj);
258     return;
259 greg 1.1 }
260     }
261    
262 greg 2.71 /************ THE FOLLOWING ROUTINES DIFFER BETWEEN NEW & OLD ***************/
263    
264     #ifdef NEWAMB
265    
266     #define tfunc(lwr, x, upr) (((x)-(lwr)/((upr)-(lwr)))
267 greg 1.1
268 greg 2.71
269     void
270     multambient( /* compute ambient component & multiply by coef. */
271     COLOR aval,
272     RAY *r,
273     FVECT nrm
274     )
275     {
276     static int rdepth = 0; /* ambient recursion */
277     COLOR acol;
278     int ok;
279     double d, l;
280    
281     if (ambdiv <= 0) /* no ambient calculation */
282     goto dumbamb;
283     /* check number of bounces */
284     if (rdepth >= ambounce)
285     goto dumbamb;
286     /* check ambient list */
287     if (ambincl != -1 && r->ro != NULL &&
288     ambincl != inset(ambset, r->ro->omod))
289     goto dumbamb;
290    
291     if (ambacc <= FTINY) { /* no ambient storage */
292     copycolor(acol, aval);
293     rdepth++;
294     ok = doambient(acol, r, r->rweight, NULL, NULL, NULL, NULL);
295     rdepth--;
296     if (!ok)
297     goto dumbamb;
298     copycolor(aval, acol);
299     return;
300     }
301    
302     if (tracktime) /* sort to minimize thrashing */
303     sortambvals(0);
304     /* interpolate ambient value */
305     setcolor(acol, 0.0, 0.0, 0.0);
306     d = sumambient(acol, r, nrm, rdepth,
307     &atrunk, thescene.cuorg, thescene.cusize);
308     if (d > FTINY) {
309     d = 1.0/d;
310     scalecolor(acol, d);
311     multcolor(aval, acol);
312     return;
313     }
314     rdepth++; /* need to cache new value */
315     ok = makeambient(acol, r, nrm, rdepth-1);
316     rdepth--;
317     if (ok) {
318     multcolor(aval, acol); /* got new value */
319     return;
320     }
321     dumbamb: /* return global value */
322     if ((ambvwt <= 0) | (navsum == 0)) {
323     multcolor(aval, ambval);
324     return;
325     }
326     l = bright(ambval); /* average in computations */
327     if (l > FTINY) {
328     d = (log(l)*(double)ambvwt + avsum) /
329     (double)(ambvwt + navsum);
330     d = exp(d) / l;
331     scalecolor(aval, d);
332     multcolor(aval, ambval); /* apply color of ambval */
333     } else {
334     d = exp( avsum / (double)navsum );
335     scalecolor(aval, d); /* neutral color */
336     }
337     }
338    
339    
340     double
341     sumambient( /* get interpolated ambient value */
342     COLOR acol,
343     RAY *r,
344     FVECT rn,
345     int al,
346     AMBTREE *at,
347     FVECT c0,
348     double s
349     )
350     { /* initial limit is ambacc radians */
351     const double maxangle = (ambacc-PI/2.)*pow(r->rweight,0.13) + PI/2.;
352     double wsum = 0.0;
353     FVECT ck0;
354     int i, j;
355     AMBVAL *av;
356     /* sum this node */
357     for (av = at->alist; av != NULL; av = av->next) {
358     double d, delta_r2, delta_t2;
359     COLOR ct;
360     FVECT uvw[3];
361     /* record access */
362     if (tracktime)
363     av->latick = ambclock;
364     /*
365     * Ambient level test.
366     */
367     if (av->lvl > al) /* list sorted, so this works */
368     break;
369     if (av->weight < 0.9*r->rweight)
370     continue;
371     /*
372     * Direction test using unperturbed normal.
373     */
374     decodedir(uvw[2], av->ndir);
375     d = DOT(uvw[2], r->ron);
376     if (d <= 0.0) /* >= 90 degrees */
377     continue;
378     delta_r2 = 2.0 - 2.0*d; /* approx. radians^2 */
379     if (delta_r2 >= maxangle*maxangle)
380     continue;
381     /*
382     * Ambient radius test.
383     */
384     decodedir(uvw[0], av->udir);
385     VCROSS(uvw[1], uvw[2], uvw[0]);
386     VSUB(ck0, av->pos, r->rop);
387     d = DOT(ck0, uvw[0]) / av->rad[0];
388     delta_t2 = d*d;
389     d = DOT(ck0, uvw[1]) / av->rad[1];
390     delta_t2 += d*d;
391     if (delta_t2 >= ambacc*ambacc)
392     continue;
393     /*
394     * Ray behind test.
395     */
396     d = 0.0;
397     for (j = 0; j < 3; j++)
398     d += (r->rop[j] - av->pos[j])*(uvw[2][j] + r->ron[j]);
399     if (d*0.5 < -minarad*ambacc-.001)
400     continue;
401     /*
402     * Convert to final weight (hat function)
403     */
404     d = tfunc(maxangle, sqrt(delta_r2), 0.0) *
405     tfunc(ambacc, sqrt(delta_t2), 0.0);
406     wsum += d;
407     extambient(ct, av, uvw, r->rop, rn);
408     scalecolor(ct, d);
409     addcolor(acol, ct);
410     }
411     if (at->kid == NULL)
412     return(wsum);
413     /* sum children */
414     s *= 0.5;
415     for (i = 0; i < 8; i++) {
416     for (j = 0; j < 3; j++) {
417     ck0[j] = c0[j];
418     if (1<<j & i)
419     ck0[j] += s;
420     if (r->rop[j] < ck0[j] - OCTSCALE*s)
421     break;
422     if (r->rop[j] > ck0[j] + (1.0+OCTSCALE)*s)
423     break;
424     }
425     if (j == 3)
426     wsum += sumambient(acol, r, rn, al,
427     at->kid+i, ck0, s);
428     }
429     return(wsum);
430     }
431    
432    
433     int
434     makeambient( /* make a new ambient value for storage */
435     COLOR acol,
436     RAY *r,
437     FVECT rn,
438     int al
439     )
440     {
441     AMBVAL amb;
442     FVECT uv[2];
443     int i;
444    
445     amb.weight = 1.0; /* compute weight */
446     for (i = al; i-- > 0; )
447     amb.weight *= AVGREFL;
448     if (r->rweight < 0.1*amb.weight) /* heuristic override */
449     amb.weight = 1.25*r->rweight;
450     setcolor(acol, AVGREFL, AVGREFL, AVGREFL);
451     /* compute ambient */
452     if (!doambient(acol, r, amb.weight, uv, amb.rad, amb.gpos, amb.gdir)) {
453     setcolor(acol, 0.0, 0.0, 0.0);
454     return(0);
455     }
456     scalecolor(acol, 1./AVGREFL); /* undo assumed reflectance */
457     /* store value */
458     VCOPY(amb.pos, r->rop);
459     amb.ndir = encodedir(r->ron);
460     amb.udir = encodedir(uv[0]);
461     amb.lvl = al;
462     copycolor(amb.val, acol);
463     /* insert into tree */
464     avsave(&amb); /* and save to file */
465     if (rn != r->ron)
466     extambient(acol, &amb, r->rop, rn); /* texture */
467     return(1);
468     }
469    
470    
471     void
472     extambient( /* extrapolate value at pv, nv */
473     COLOR cr,
474     AMBVAL *ap,
475     FVECT uvw[3],
476     FVECT pv,
477     FVECT nv
478     )
479     {
480     FVECT v1;
481     int i;
482     double d = 1.0; /* zeroeth order */
483    
484     for (i = 3; i--; ) /* gradient due to translation */
485     d += (pv[i] - ap->pos[i]) *
486     (ap->gpos[0]*uvw[0][i] + ap->gpos[1]*uvw[1][i]);
487    
488     VCROSS(v1, uvw[2], nv); /* gradient due to rotation */
489     for (i = 3; i--; )
490     d += v1[i] * (ap->gdir[0]*uvw[0][i] + ap->gdir[1]*uvw[1][i]);
491    
492     if (d <= 0.0) {
493     setcolor(cr, 0.0, 0.0, 0.0);
494     return;
495     }
496     copycolor(cr, ap->val);
497     scalecolor(cr, d);
498     }
499    
500    
501     static void
502     avinsert( /* insert ambient value in our tree */
503     AMBVAL *av
504     )
505     {
506     AMBTREE *at;
507     AMBVAL *ap;
508     AMBVAL avh;
509     FVECT ck0;
510     double s;
511     int branch;
512     int i;
513    
514     if (av->rad[0] <= FTINY)
515     error(CONSISTENCY, "zero ambient radius in avinsert");
516     at = &atrunk;
517     VCOPY(ck0, thescene.cuorg);
518     s = thescene.cusize;
519     while (s*(OCTSCALE/2) > av->rad[1]*ambacc) {
520     if (at->kid == NULL)
521     if ((at->kid = newambtree()) == NULL)
522     error(SYSTEM, "out of memory in avinsert");
523     s *= 0.5;
524     branch = 0;
525     for (i = 0; i < 3; i++)
526     if (av->pos[i] > ck0[i] + s) {
527     ck0[i] += s;
528     branch |= 1 << i;
529     }
530     at = at->kid + branch;
531     }
532     avh.next = at->alist; /* order by increasing level */
533     for (ap = &avh; ap->next != NULL; ap = ap->next)
534     if (ap->next->lvl >= av->lvl)
535     break;
536     av->next = ap->next;
537     ap->next = (AMBVAL*)av;
538     at->alist = avh.next;
539     }
540    
541    
542     #else /* ! NEWAMB */
543    
544    
545     void
546 greg 2.58 multambient( /* compute ambient component & multiply by coef. */
547     COLOR aval,
548 greg 2.70 RAY *r,
549 schorsch 2.56 FVECT nrm
550     )
551 greg 1.1 {
552     static int rdepth = 0; /* ambient recursion */
553 greg 2.58 COLOR acol;
554 gregl 2.43 double d, l;
555 greg 1.1
556     if (ambdiv <= 0) /* no ambient calculation */
557     goto dumbamb;
558     /* check number of bounces */
559 greg 1.16 if (rdepth >= ambounce)
560 greg 1.1 goto dumbamb;
561     /* check ambient list */
562     if (ambincl != -1 && r->ro != NULL &&
563     ambincl != inset(ambset, r->ro->omod))
564     goto dumbamb;
565    
566     if (ambacc <= FTINY) { /* no ambient storage */
567 greg 2.61 copycolor(acol, aval);
568 greg 1.16 rdepth++;
569 greg 2.61 d = doambient(acol, r, r->rweight, NULL, NULL);
570 greg 1.16 rdepth--;
571 greg 2.32 if (d <= FTINY)
572 greg 1.1 goto dumbamb;
573 greg 2.61 copycolor(aval, acol);
574 greg 1.16 return;
575 greg 1.1 }
576 greg 2.40
577     if (tracktime) /* sort to minimize thrashing */
578     sortambvals(0);
579 greg 2.61 /* interpolate ambient value */
580 greg 1.1 setcolor(acol, 0.0, 0.0, 0.0);
581 greg 2.61 d = sumambient(acol, r, nrm, rdepth,
582 greg 1.16 &atrunk, thescene.cuorg, thescene.cusize);
583 greg 2.32 if (d > FTINY) {
584 greg 2.61 d = 1.0/d;
585     scalecolor(acol, d);
586 greg 2.58 multcolor(aval, acol);
587 greg 2.32 return;
588 greg 1.16 }
589 greg 2.33 rdepth++; /* need to cache new value */
590 greg 2.61 d = makeambient(acol, r, nrm, rdepth-1);
591 greg 2.32 rdepth--;
592 greg 2.58 if (d > FTINY) {
593     multcolor(aval, acol); /* got new value */
594 greg 1.16 return;
595 greg 2.58 }
596 greg 1.1 dumbamb: /* return global value */
597 greg 2.58 if ((ambvwt <= 0) | (navsum == 0)) {
598     multcolor(aval, ambval);
599 greg 2.32 return;
600 greg 2.58 }
601 gregl 2.43 l = bright(ambval); /* average in computations */
602     if (l > FTINY) {
603     d = (log(l)*(double)ambvwt + avsum) /
604     (double)(ambvwt + navsum);
605     d = exp(d) / l;
606 greg 2.58 scalecolor(aval, d);
607     multcolor(aval, ambval); /* apply color of ambval */
608 gregl 2.43 } else {
609     d = exp( avsum / (double)navsum );
610 greg 2.58 scalecolor(aval, d); /* neutral color */
611 gregl 2.43 }
612 greg 1.1 }
613    
614    
615 greg 2.71 double
616 schorsch 2.56 sumambient( /* get interpolated ambient value */
617     COLOR acol,
618 greg 2.70 RAY *r,
619 schorsch 2.56 FVECT rn,
620     int al,
621     AMBTREE *at,
622     FVECT c0,
623     double s
624     )
625 greg 1.1 {
626 greg 2.12 double d, e1, e2, wt, wsum;
627 greg 1.1 COLOR ct;
628     FVECT ck0;
629     int i;
630 greg 2.70 int j;
631     AMBVAL *av;
632 greg 2.29
633     wsum = 0.0;
634 greg 1.7 /* do this node */
635 greg 1.1 for (av = at->alist; av != NULL; av = av->next) {
636 greg 2.47 double rn_dot = -2.0;
637 greg 2.26 if (tracktime)
638 greg 2.40 av->latick = ambclock;
639 greg 1.1 /*
640 greg 1.16 * Ambient level test.
641 greg 1.1 */
642 greg 2.23 if (av->lvl > al) /* list sorted, so this works */
643     break;
644 greg 2.61 if (av->weight < 0.9*r->rweight)
645 greg 1.1 continue;
646     /*
647     * Ambient radius test.
648     */
649 greg 2.70 VSUB(ck0, av->pos, r->rop);
650     e1 = DOT(ck0, ck0) / (av->rad * av->rad);
651 greg 1.1 if (e1 > ambacc*ambacc*1.21)
652     continue;
653     /*
654 greg 2.47 * Direction test using closest normal.
655 greg 1.1 */
656 greg 2.47 d = DOT(av->dir, r->ron);
657     if (rn != r->ron) {
658     rn_dot = DOT(av->dir, rn);
659     if (rn_dot > 1.0-FTINY)
660     rn_dot = 1.0-FTINY;
661     if (rn_dot >= d-FTINY) {
662     d = rn_dot;
663     rn_dot = -2.0;
664     }
665     }
666     e2 = (1.0 - d) * r->rweight;
667 greg 2.70 if (e2 < 0.0)
668     e2 = 0.0;
669     else if (e1 + e2 > ambacc*ambacc*1.21)
670 greg 1.1 continue;
671     /*
672     * Ray behind test.
673     */
674     d = 0.0;
675     for (j = 0; j < 3; j++)
676     d += (r->rop[j] - av->pos[j]) *
677     (av->dir[j] + r->ron[j]);
678 greg 1.18 if (d*0.5 < -minarad*ambacc-.001)
679 greg 1.1 continue;
680     /*
681     * Jittering final test reduces image artifacts.
682     */
683 greg 2.47 e1 = sqrt(e1);
684     e2 = sqrt(e2);
685     wt = e1 + e2;
686 greg 2.31 if (wt > ambacc*(.9+.2*urand(9015+samplendx)))
687 greg 1.1 continue;
688 greg 2.47 /*
689     * Recompute directional error using perturbed normal
690     */
691     if (rn_dot > 0.0) {
692     e2 = sqrt((1.0 - rn_dot)*r->rweight);
693     wt = e1 + e2;
694     }
695 greg 1.1 if (wt <= 1e-3)
696     wt = 1e3;
697     else
698     wt = 1.0 / wt;
699     wsum += wt;
700 greg 2.34 extambient(ct, av, r->rop, rn);
701 greg 1.1 scalecolor(ct, wt);
702     addcolor(acol, ct);
703 greg 1.7 }
704     if (at->kid == NULL)
705     return(wsum);
706     /* do children */
707     s *= 0.5;
708     for (i = 0; i < 8; i++) {
709     for (j = 0; j < 3; j++) {
710     ck0[j] = c0[j];
711     if (1<<j & i)
712     ck0[j] += s;
713     if (r->rop[j] < ck0[j] - OCTSCALE*s)
714     break;
715     if (r->rop[j] > ck0[j] + (1.0+OCTSCALE)*s)
716     break;
717     }
718     if (j == 3)
719 greg 2.61 wsum += sumambient(acol, r, rn, al,
720 greg 2.59 at->kid+i, ck0, s);
721 greg 1.1 }
722     return(wsum);
723     }
724    
725    
726 greg 2.71 double
727 greg 2.61 makeambient( /* make a new ambient value for storage */
728 schorsch 2.56 COLOR acol,
729 greg 2.58 RAY *r,
730 schorsch 2.56 FVECT rn,
731     int al
732     )
733 greg 1.1 {
734 greg 2.12 AMBVAL amb;
735 greg 1.14 FVECT gp, gd;
736 greg 2.60 int i;
737    
738 greg 2.61 amb.weight = 1.0; /* compute weight */
739     for (i = al; i-- > 0; )
740 greg 2.60 amb.weight *= AVGREFL;
741 greg 2.61 if (r->rweight < 0.1*amb.weight) /* heuristic override */
742 greg 2.62 amb.weight = 1.25*r->rweight;
743 greg 2.61 setcolor(acol, AVGREFL, AVGREFL, AVGREFL);
744 greg 1.16 /* compute ambient */
745 greg 2.61 amb.rad = doambient(acol, r, amb.weight, gp, gd);
746     if (amb.rad <= FTINY) {
747     setcolor(acol, 0.0, 0.0, 0.0);
748 greg 1.1 return(0.0);
749 greg 2.61 }
750     scalecolor(acol, 1./AVGREFL); /* undo assumed reflectance */
751     /* store value */
752 greg 1.1 VCOPY(amb.pos, r->rop);
753     VCOPY(amb.dir, r->ron);
754 greg 1.16 amb.lvl = al;
755 greg 1.1 copycolor(amb.val, acol);
756 greg 1.14 VCOPY(amb.gpos, gp);
757     VCOPY(amb.gdir, gd);
758 greg 1.1 /* insert into tree */
759 greg 2.7 avsave(&amb); /* and save to file */
760 greg 2.34 if (rn != r->ron)
761     extambient(acol, &amb, r->rop, rn); /* texture */
762 greg 1.1 return(amb.rad);
763 greg 1.15 }
764    
765    
766 greg 2.71 void
767 schorsch 2.56 extambient( /* extrapolate value at pv, nv */
768     COLOR cr,
769 greg 2.70 AMBVAL *ap,
770 schorsch 2.56 FVECT pv,
771     FVECT nv
772     )
773 greg 1.15 {
774 gwlarson 2.45 FVECT v1;
775 greg 2.70 int i;
776 greg 2.12 double d;
777 greg 1.15
778     d = 1.0; /* zeroeth order */
779     /* gradient due to translation */
780     for (i = 0; i < 3; i++)
781     d += ap->gpos[i]*(pv[i]-ap->pos[i]);
782     /* gradient due to rotation */
783 gwlarson 2.45 VCROSS(v1, ap->dir, nv);
784     d += DOT(ap->gdir, v1);
785 greg 1.15 if (d <= 0.0) {
786     setcolor(cr, 0.0, 0.0, 0.0);
787     return;
788     }
789     copycolor(cr, ap->val);
790     scalecolor(cr, d);
791 greg 1.1 }
792    
793    
794 greg 2.47 static void
795 greg 2.71 avinsert( /* insert ambient value in our tree */
796     AMBVAL *av
797     )
798     {
799     AMBTREE *at;
800     AMBVAL *ap;
801     AMBVAL avh;
802     FVECT ck0;
803     double s;
804     int branch;
805     int i;
806    
807     if (av->rad <= FTINY)
808     error(CONSISTENCY, "zero ambient radius in avinsert");
809     at = &atrunk;
810     VCOPY(ck0, thescene.cuorg);
811     s = thescene.cusize;
812     while (s*(OCTSCALE/2) > av->rad*ambacc) {
813     if (at->kid == NULL)
814     if ((at->kid = newambtree()) == NULL)
815     error(SYSTEM, "out of memory in avinsert");
816     s *= 0.5;
817     branch = 0;
818     for (i = 0; i < 3; i++)
819     if (av->pos[i] > ck0[i] + s) {
820     ck0[i] += s;
821     branch |= 1 << i;
822     }
823     at = at->kid + branch;
824     }
825     avh.next = at->alist; /* order by increasing level */
826     for (ap = &avh; ap->next != NULL; ap = ap->next)
827     if (ap->next->lvl >= av->lvl)
828     break;
829     av->next = ap->next;
830     ap->next = (AMBVAL*)av;
831     at->alist = avh.next;
832     }
833    
834     #endif /* ! NEWAMB */
835    
836     /************* FOLLOWING ROUTINES SAME FOR NEW & OLD METHODS ***************/
837    
838     static void
839 schorsch 2.56 initambfile( /* initialize ambient file */
840 greg 2.68 int cre8
841 schorsch 2.56 )
842 greg 2.9 {
843 greg 2.47 extern char *progname, *octname;
844     static char *mybuf = NULL;
845 greg 2.9
846 greg 2.19 #ifdef F_SETLKW
847 greg 2.69 aflock(cre8 ? F_WRLCK : F_RDLCK);
848 greg 2.19 #endif
849 schorsch 2.50 SET_FILE_BINARY(ambfp);
850 greg 2.47 if (mybuf == NULL)
851     mybuf = (char *)bmalloc(BUFSIZ+8);
852     setbuf(ambfp, mybuf);
853 greg 2.68 if (cre8) { /* new file */
854 greg 2.24 newheader("RADIANCE", ambfp);
855 greg 2.41 fprintf(ambfp, "%s -av %g %g %g -aw %d -ab %d -aa %g ",
856 greg 2.9 progname, colval(ambval,RED),
857     colval(ambval,GRN), colval(ambval,BLU),
858 greg 2.41 ambvwt, ambounce, ambacc);
859 greg 2.47 fprintf(ambfp, "-ad %d -as %d -ar %d ",
860     ambdiv, ambssamp, ambres);
861     if (octname != NULL)
862 greg 2.68 fputs(octname, ambfp);
863     fputc('\n', ambfp);
864 greg 2.9 fprintf(ambfp, "SOFTWARE= %s\n", VersionID);
865 greg 2.47 fputnow(ambfp);
866 greg 2.9 fputformat(AMBFMT, ambfp);
867 greg 2.68 fputc('\n', ambfp);
868 greg 2.9 putambmagic(ambfp);
869 greg 2.17 } else if (checkheader(ambfp, AMBFMT, NULL) < 0 || !hasambmagic(ambfp))
870     error(USER, "bad ambient file");
871 greg 2.9 }
872    
873    
874 greg 2.47 static void
875 schorsch 2.56 avsave( /* insert and save an ambient value */
876     AMBVAL *av
877     )
878 greg 1.1 {
879 greg 2.21 avinsert(avstore(av));
880 greg 1.1 if (ambfp == NULL)
881     return;
882 greg 2.5 if (writambval(av, ambfp) < 0)
883 greg 1.1 goto writerr;
884 greg 2.16 if (++nunflshed >= AMBFLUSH)
885 greg 2.7 if (ambsync() == EOF)
886 greg 1.1 goto writerr;
887     return;
888     writerr:
889 greg 2.47 error(SYSTEM, "error writing to ambient file");
890 greg 1.1 }
891    
892    
893 greg 2.20 static AMBVAL *
894 schorsch 2.56 avstore( /* allocate memory and store aval */
895 greg 2.70 AMBVAL *aval
896 schorsch 2.56 )
897 greg 2.20 {
898 greg 2.70 AMBVAL *av;
899 gregl 2.43 double d;
900 greg 2.20
901     if ((av = newambval()) == NULL)
902     error(SYSTEM, "out of memory in avstore");
903 schorsch 2.53 *av = *aval;
904 greg 2.26 av->latick = ambclock;
905     av->next = NULL;
906     nambvals++;
907 gregl 2.43 d = bright(av->val);
908     if (d > FTINY) { /* add to log sum for averaging */
909     avsum += log(d);
910     navsum++;
911     }
912 greg 2.20 return(av);
913     }
914    
915    
916 greg 2.26 #define ATALLOCSZ 512 /* #/8 trees to allocate at once */
917    
918     static AMBTREE *atfreelist = NULL; /* free ambient tree structures */
919    
920    
921 greg 2.47 static AMBTREE *
922 schorsch 2.56 newambtree(void) /* allocate 8 ambient tree structs */
923 greg 2.26 {
924 greg 2.70 AMBTREE *atp, *upperlim;
925 greg 2.26
926     if (atfreelist == NULL) { /* get more nodes */
927 greg 2.47 atfreelist = (AMBTREE *)malloc(ATALLOCSZ*8*sizeof(AMBTREE));
928 greg 2.26 if (atfreelist == NULL)
929     return(NULL);
930     /* link new free list */
931     upperlim = atfreelist + 8*(ATALLOCSZ-1);
932     for (atp = atfreelist; atp < upperlim; atp += 8)
933     atp->kid = atp + 8;
934     atp->kid = NULL;
935     }
936     atp = atfreelist;
937     atfreelist = atp->kid;
938 schorsch 2.52 memset((char *)atp, '\0', 8*sizeof(AMBTREE));
939 greg 2.26 return(atp);
940     }
941    
942    
943 greg 2.47 static void
944 schorsch 2.56 freeambtree( /* free 8 ambient tree structs */
945     AMBTREE *atp
946     )
947 greg 2.26 {
948     atp->kid = atfreelist;
949     atfreelist = atp;
950     }
951    
952    
953 greg 2.47 static void
954 schorsch 2.56 unloadatree( /* unload an ambient value tree */
955 greg 2.70 AMBTREE *at,
956 schorsch 2.56 unloadtf_t *f
957     )
958 greg 2.20 {
959 greg 2.70 AMBVAL *av;
960     int i;
961 greg 2.20 /* transfer values at this node */
962     for (av = at->alist; av != NULL; av = at->alist) {
963     at->alist = av->next;
964 greg 2.26 (*f)(av);
965 greg 2.20 }
966 greg 2.21 if (at->kid == NULL)
967     return;
968 greg 2.20 for (i = 0; i < 8; i++) /* transfer and free children */
969 greg 2.26 unloadatree(at->kid+i, f);
970 greg 2.20 freeambtree(at->kid);
971 greg 2.26 at->kid = NULL;
972     }
973    
974    
975 greg 2.39 static struct avl {
976     AMBVAL *p;
977     unsigned long t;
978     } *avlist1; /* ambient value list with ticks */
979     static AMBVAL **avlist2; /* memory positions for sorting */
980 greg 2.26 static int i_avlist; /* index for lists */
981    
982 schorsch 2.56 static int alatcmp(const void *av1, const void *av2);
983 greg 2.26
984 schorsch 2.56 static void
985 greg 2.71 avfree(AMBVAL *av)
986     {
987     free(av);
988     }
989    
990     static void
991 schorsch 2.56 av2list(
992 greg 2.71 AMBVAL *av
993 schorsch 2.56 )
994 greg 2.26 {
995 greg 2.27 #ifdef DEBUG
996 greg 2.26 if (i_avlist >= nambvals)
997     error(CONSISTENCY, "too many ambient values in av2list1");
998 greg 2.27 #endif
999 schorsch 2.56 avlist1[i_avlist].p = avlist2[i_avlist] = (AMBVAL*)av;
1000 greg 2.71 avlist1[i_avlist++].t = av->latick;
1001 greg 2.26 }
1002    
1003    
1004     static int
1005 schorsch 2.56 alatcmp( /* compare ambient values for MRA */
1006     const void *av1,
1007     const void *av2
1008     )
1009 greg 2.26 {
1010 greg 2.70 long lc = ((struct avl *)av2)->t - ((struct avl *)av1)->t;
1011 greg 2.38 return(lc<0 ? -1 : lc>0 ? 1 : 0);
1012 greg 2.26 }
1013    
1014    
1015 greg 2.47 /* GW NOTE 2002/10/3:
1016     * I used to compare AMBVAL pointers, but found that this was the
1017     * cause of a serious consistency error with gcc, since the optimizer
1018     * uses some dangerous trick in pointer subtraction that
1019     * assumes pointers differ by exact struct size increments.
1020     */
1021 greg 2.26 static int
1022 schorsch 2.56 aposcmp( /* compare ambient value positions */
1023     const void *avp1,
1024     const void *avp2
1025     )
1026 greg 2.26 {
1027 greg 2.70 long diff = *(char * const *)avp1 - *(char * const *)avp2;
1028 greg 2.47 if (diff < 0)
1029     return(-1);
1030     return(diff > 0);
1031 greg 2.26 }
1032    
1033 greg 2.71
1034 greg 2.27 static int
1035 schorsch 2.56 avlmemi( /* find list position from address */
1036     AMBVAL *avaddr
1037     )
1038 greg 2.27 {
1039 greg 2.70 AMBVAL **avlpp;
1040 greg 2.27
1041     avlpp = (AMBVAL **)bsearch((char *)&avaddr, (char *)avlist2,
1042 greg 2.71 nambvals, sizeof(AMBVAL *), &aposcmp);
1043 greg 2.27 if (avlpp == NULL)
1044     error(CONSISTENCY, "address not found in avlmemi");
1045     return(avlpp - avlist2);
1046     }
1047    
1048    
1049 greg 2.47 static void
1050 schorsch 2.56 sortambvals( /* resort ambient values */
1051     int always
1052     )
1053 greg 2.26 {
1054     AMBTREE oldatrunk;
1055     AMBVAL tav, *tap, *pnext;
1056 greg 2.70 int i, j;
1057 greg 2.28 /* see if it's time yet */
1058 greg 2.40 if (!always && (ambclock++ < lastsort+sortintvl ||
1059 greg 2.28 nambvals < SORT_THRESH))
1060     return;
1061 greg 2.26 /*
1062     * The idea here is to minimize memory thrashing
1063     * in VM systems by improving reference locality.
1064     * We do this by periodically sorting our stored ambient
1065     * values in memory in order of most recently to least
1066     * recently accessed. This ordering was chosen so that new
1067     * ambient values (which tend to be less important) go into
1068     * higher memory with the infrequently accessed values.
1069     * Since we expect our values to need sorting less
1070     * frequently as the process continues, we double our
1071     * waiting interval after each call.
1072     * This routine is also called by setambacc() with
1073     * the "always" parameter set to 1 so that the ambient
1074     * tree will be rebuilt with the new accuracy parameter.
1075     */
1076 greg 2.27 if (tracktime) { /* allocate pointer arrays to sort */
1077 greg 2.26 avlist2 = (AMBVAL **)malloc(nambvals*sizeof(AMBVAL *));
1078 greg 2.39 avlist1 = (struct avl *)malloc(nambvals*sizeof(struct avl));
1079     } else {
1080     avlist2 = NULL;
1081     avlist1 = NULL;
1082     }
1083     if (avlist1 == NULL) { /* no time tracking -- rebuild tree? */
1084     if (avlist2 != NULL)
1085 greg 2.47 free((void *)avlist2);
1086 greg 2.27 if (always) { /* rebuild without sorting */
1087 schorsch 2.53 oldatrunk = atrunk;
1088 greg 2.27 atrunk.alist = NULL;
1089     atrunk.kid = NULL;
1090 greg 2.71 unloadatree(&oldatrunk, &avinsert);
1091 greg 2.27 }
1092 greg 2.26 } else { /* sort memory by last access time */
1093     /*
1094     * Sorting memory is tricky because it isn't contiguous.
1095     * We have to sort an array of pointers by MRA and also
1096     * by memory position. We then copy values in "loops"
1097     * to minimize memory hits. Nevertheless, we will visit
1098 greg 2.27 * everyone at least twice, and this is an expensive process
1099 greg 2.26 * when we're thrashing, which is when we need to do it.
1100     */
1101 greg 2.27 #ifdef DEBUG
1102 greg 2.29 sprintf(errmsg, "sorting %u ambient values at ambclock=%lu...",
1103     nambvals, ambclock);
1104 greg 2.27 eputs(errmsg);
1105     #endif
1106     i_avlist = 0;
1107 greg 2.71 unloadatree(&atrunk, &av2list); /* empty current tree */
1108 greg 2.27 #ifdef DEBUG
1109     if (i_avlist < nambvals)
1110     error(CONSISTENCY, "missing ambient values in sortambvals");
1111     #endif
1112 greg 2.71 qsort((char *)avlist1, nambvals, sizeof(struct avl), &alatcmp);
1113     qsort((char *)avlist2, nambvals, sizeof(AMBVAL *), &aposcmp);
1114 greg 2.26 for (i = 0; i < nambvals; i++) {
1115 greg 2.39 if (avlist1[i].p == NULL)
1116 greg 2.26 continue;
1117     tap = avlist2[i];
1118 schorsch 2.53 tav = *tap;
1119 greg 2.39 for (j = i; (pnext = avlist1[j].p) != tap;
1120 greg 2.27 j = avlmemi(pnext)) {
1121 schorsch 2.53 *(avlist2[j]) = *pnext;
1122 greg 2.26 avinsert(avlist2[j]);
1123 greg 2.39 avlist1[j].p = NULL;
1124 greg 2.26 }
1125 schorsch 2.53 *(avlist2[j]) = tav;
1126 greg 2.26 avinsert(avlist2[j]);
1127 greg 2.39 avlist1[j].p = NULL;
1128 greg 2.26 }
1129 greg 2.47 free((void *)avlist1);
1130     free((void *)avlist2);
1131 greg 2.28 /* compute new sort interval */
1132     sortintvl = ambclock - lastsort;
1133 greg 2.32 if (sortintvl >= MAX_SORT_INTVL/2)
1134 greg 2.28 sortintvl = MAX_SORT_INTVL;
1135     else
1136 greg 2.26 sortintvl <<= 1; /* wait twice as long next */
1137 greg 2.27 #ifdef DEBUG
1138     eputs("done\n");
1139     #endif
1140 greg 2.26 }
1141     if (ambclock >= MAXACLOCK)
1142     ambclock = MAXACLOCK/2;
1143     lastsort = ambclock;
1144 greg 2.20 }
1145    
1146    
1147 greg 2.18 #ifdef F_SETLKW
1148 greg 2.10
1149 greg 2.47 static void
1150 schorsch 2.56 aflock( /* lock/unlock ambient file */
1151     int typ
1152     )
1153 greg 2.19 {
1154     static struct flock fls; /* static so initialized to zeroes */
1155    
1156 greg 2.66 if (typ == fls.l_type) /* already called? */
1157     return;
1158 greg 2.19 fls.l_type = typ;
1159     if (fcntl(fileno(ambfp), F_SETLKW, &fls) < 0)
1160     error(SYSTEM, "cannot (un)lock ambient file");
1161     }
1162    
1163    
1164 greg 2.71 int
1165 schorsch 2.56 ambsync(void) /* synchronize ambient file */
1166 greg 2.7 {
1167 greg 2.15 long flen;
1168 greg 2.12 AMBVAL avs;
1169 greg 2.70 int n;
1170 greg 2.16
1171 greg 2.65 if (ambfp == NULL) /* no ambient file? */
1172     return(0);
1173 greg 2.63 /* gain appropriate access */
1174     aflock(nunflshed ? F_WRLCK : F_RDLCK);
1175 greg 2.7 /* see if file has grown */
1176 greg 2.55 if ((flen = lseek(fileno(ambfp), (off_t)0, SEEK_END)) < 0)
1177 greg 2.21 goto seekerr;
1178 greg 2.68 if ((n = flen - lastpos) > 0) { /* file has grown */
1179 greg 2.17 if (ambinp == NULL) { /* use duplicate filedes */
1180     ambinp = fdopen(dup(fileno(ambfp)), "r");
1181 greg 2.14 if (ambinp == NULL)
1182 greg 2.17 error(SYSTEM, "fdopen failed in ambsync");
1183 greg 2.14 }
1184 greg 2.66 if (fseek(ambinp, lastpos, SEEK_SET) < 0)
1185 greg 2.21 goto seekerr;
1186 greg 2.15 while (n >= AMBVALSIZ) { /* load contributed values */
1187 greg 2.37 if (!readambval(&avs, ambinp)) {
1188     sprintf(errmsg,
1189 greg 2.47 "ambient file \"%s\" corrupted near character %ld",
1190     ambfile, flen - n);
1191 greg 2.37 error(WARNING, errmsg);
1192     break;
1193     }
1194 greg 2.21 avinsert(avstore(&avs));
1195 greg 2.15 n -= AMBVALSIZ;
1196     }
1197 greg 2.64 lastpos = flen - n;
1198 greg 2.22 /*** seek always as safety measure
1199     if (n) ***/ /* alignment */
1200 greg 2.64 if (lseek(fileno(ambfp), (off_t)lastpos, SEEK_SET) < 0)
1201 greg 2.21 goto seekerr;
1202 greg 2.7 }
1203     n = fflush(ambfp); /* calls write() at last */
1204 greg 2.66 if (n != EOF)
1205 greg 2.64 lastpos += (long)nunflshed*AMBVALSIZ;
1206 greg 2.66 else if ((lastpos = lseek(fileno(ambfp), (off_t)0, SEEK_CUR)) < 0)
1207     goto seekerr;
1208    
1209 greg 2.19 aflock(F_UNLCK); /* release file */
1210 greg 2.16 nunflshed = 0;
1211 greg 2.7 return(n);
1212 greg 2.21 seekerr:
1213     error(SYSTEM, "seek failed in ambsync");
1214 schorsch 2.56 return -1; /* pro forma return */
1215 greg 2.18 }
1216    
1217 greg 2.71 #else /* ! F_SETLKW */
1218 greg 2.18
1219 greg 2.71 int
1220 schorsch 2.56 ambsync(void) /* flush ambient file */
1221 greg 2.18 {
1222 greg 2.65 if (ambfp == NULL)
1223     return(0);
1224 greg 2.18 nunflshed = 0;
1225     return(fflush(ambfp));
1226 greg 1.1 }
1227 greg 2.10
1228 greg 2.71 #endif /* ! F_SETLKW */