Back to index

radiance  4R0+20100331
Classes | Defines | Typedefs | Functions | Variables
ambient.c File Reference
#include "copyright.h"
#include <string.h>
#include "platform.h"
#include "ray.h"
#include "otypes.h"
#include "resolu.h"
#include "ambient.h"
#include "random.h"

Go to the source code of this file.

Classes

struct  avl

Defines

#define OCTSCALE   1.0 /* ceil((valid rad.)/(cube size)) */
#define MAXASET   4095 /* maximum number of elements in ambient set */
#define SORT_THRESH   ((9L<<20)/sizeof(AMBVAL))
#define SORT_INTVL   (SORT_THRESH<<1)
#define MAX_SORT_INTVL   (SORT_INTVL<<6)
#define MAXACLOCK   (1L<<30) /* clock turnover value */
#define tracktime   (shm_boundary == NULL || nambvals > 3*nambshare)
#define AMBFLUSH   (BUFSIZ/AMBVALSIZ)
#define newambval()   (AMBVAL *)malloc(sizeof(AMBVAL))
#define freeav(av)   free((void *)av);
#define ATALLOCSZ   512 /* #/8 trees to allocate at once */

Typedefs

typedef void unloadtf_t (void *)

Functions

static void initambfile (int creat)
static void avsave (AMBVAL *av)
static AMBVALavstore (AMBVAL *aval)
static AMBTREEnewambtree (void)
static void freeambtree (AMBTREE *atp)
static void unloadatree (AMBTREE *at, unloadtf_t *f)
static int aposcmp (const void *avp1, const void *avp2)
static int avlmemi (AMBVAL *avaddr)
static void sortambvals (int always)
void setambres (int ar)
void setambacc (double newa)
void setambient (void)
void ambdone (void)
void ambnotify (OBJECT obj)
void multambient (COLOR aval, register RAY *r, FVECT nrm)
double sumambient (COLOR acol, register RAY *r, FVECT rn, int al, AMBTREE *at, FVECT c0, double s)
double makeambient (COLOR acol, RAY *r, FVECT rn, int al)
void extambient (COLOR cr, register AMBVAL *ap, FVECT pv, FVECT nv)
static AMBVALavstore (register AMBVAL *aval)
static void avinsert (void *av)
static void unloadatree (register AMBTREE *at, unloadtf_t *f)
static int alatcmp (const void *av1, const void *av2)
static void av2list (void *av)
int ambsync (void)

Variables

static const char RCSid [] = "$Id: ambient.c,v 2.67 2007/11/17 06:21:58 greg Exp $"
char * shm_boundary
OBJECT ambset [MAXASET+1] = {0}
double maxarad
double minarad
static AMBTREE atrunk
static FILE * ambfp = NULL
static int nunflshed = 0
static double avsum = 0.
static unsigned int navsum = 0
static unsigned int nambvals = 0
static unsigned int nambshare = 0
static unsigned long ambclock = 0
static unsigned long lastsort = 0
static long sortintvl = SORT_INTVL
static FILE * ambinp = NULL
static long lastpos = -1
static unloadtf_t avinsert
static unloadtf_t av2list
static AMBTREEatfreelist = NULL
static struct avlavlist1
static AMBVAL ** avlist2
static int i_avlist

Class Documentation

struct avl

Definition at line 688 of file ambient.c.

Collaboration diagram for avl:
Class Members
AMBVAL * p
unsigned long t

Define Documentation

#define AMBFLUSH   (BUFSIZ/AMBVALSIZ)

Definition at line 76 of file ambient.c.

#define ATALLOCSZ   512 /* #/8 trees to allocate at once */

Definition at line 588 of file ambient.c.

#define freeav (   av)    free((void *)av);

Definition at line 79 of file ambient.c.

#define MAX_SORT_INTVL   (SORT_INTVL<<6)

Definition at line 51 of file ambient.c.

#define MAXACLOCK   (1L<<30) /* clock turnover value */

Definition at line 64 of file ambient.c.

#define MAXASET   4095 /* maximum number of elements in ambient set */

Definition at line 28 of file ambient.c.

#define newambval ( )    (AMBVAL *)malloc(sizeof(AMBVAL))

Definition at line 78 of file ambient.c.

#define OCTSCALE   1.0 /* ceil((valid rad.)/(cube size)) */

Definition at line 22 of file ambient.c.

#define SORT_INTVL   (SORT_THRESH<<1)

Definition at line 48 of file ambient.c.

#define SORT_THRESH   ((9L<<20)/sizeof(AMBVAL))

Definition at line 44 of file ambient.c.

#define tracktime   (shm_boundary == NULL || nambvals > 3*nambshare)

Definition at line 73 of file ambient.c.


Typedef Documentation

typedef void unloadtf_t(void *)

Definition at line 87 of file ambient.c.


Function Documentation

static int alatcmp ( const void *  av1,
const void *  av2 
) [static]

Definition at line 712 of file ambient.c.

{
       register long  lc = ((struct avl *)av2)->t - ((struct avl *)av1)->t;
       return(lc<0 ? -1 : lc>0 ? 1 : 0);
}

Here is the caller graph for this function:

void ambdone ( void  )

Definition at line 201 of file ambient.c.

{
       if (ambfp != NULL) {        /* close ambient file */
              ambsync();
              fclose(ambfp);
              ambfp = NULL;
              if (ambinp != NULL) {       
                     fclose(ambinp);
                     ambinp = NULL;
              }
              lastpos = -1;
       }
                                   /* free ambient tree */
       unloadatree(&atrunk, free);
                                   /* reset state variables */
       avsum = 0.;
       navsum = 0;
       nambvals = 0;
       nambshare = 0;
       ambclock = 0;
       lastsort = 0;
       sortintvl = SORT_INTVL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void ambnotify ( OBJECT  obj)

Definition at line 227 of file ambient.c.

{
       static int  hitlimit = 0;
       register OBJREC       *o;
       register char  **amblp;

       if (obj == OVOID) {         /* starting over */
              ambset[0] = 0;
              hitlimit = 0;
              return;
       }
       o = objptr(obj);
       if (hitlimit || !ismodifier(o->otype))
              return;
       for (amblp = amblist; *amblp != NULL; amblp++)
              if (!strcmp(o->oname, *amblp)) {
                     if (ambset[0] >= MAXASET) {
                            error(WARNING, "too many modifiers in ambient list");
                            hitlimit++;
                            return;              /* should this be fatal? */
                     }
                     insertelem(ambset, obj);
                     return;
              }
}

Here is the call graph for this function:

Here is the caller graph for this function:

int ambsync ( void  )

Definition at line 939 of file ambient.c.

{
       if (ambfp == NULL)
              return(0);
       nunflshed = 0;
       return(fflush(ambfp));
}

Here is the caller graph for this function:

static int aposcmp ( const void *  avp1,
const void *  avp2 
) [static]

Definition at line 729 of file ambient.c.

{
       register long diff = *(char * const *)avp1 - *(char * const *)avp2;
       if (diff < 0)
              return(-1);
       return(diff > 0);
}

Here is the caller graph for this function:

static void av2list ( void *  av) [static]

Definition at line 698 of file ambient.c.

{
#ifdef DEBUG
       if (i_avlist >= nambvals)
              error(CONSISTENCY, "too many ambient values in av2list1");
#endif
       avlist1[i_avlist].p = avlist2[i_avlist] = (AMBVAL*)av;
       avlist1[i_avlist++].t = ((AMBVAL*)av)->latick;
}

Here is the call graph for this function:

static void avinsert ( void *  av) [static]

Definition at line 626 of file ambient.c.

{
       register AMBTREE  *at;
       register AMBVAL  *ap;
       AMBVAL  avh;
       FVECT  ck0;
       double s;
       int  branch;
       register int  i;

       if (((AMBVAL*)av)->rad <= FTINY)
              error(CONSISTENCY, "zero ambient radius in avinsert");
       at = &atrunk;
       VCOPY(ck0, thescene.cuorg);
       s = thescene.cusize;
       while (s*(OCTSCALE/2) > ((AMBVAL*)av)->rad*ambacc) {
              if (at->kid == NULL)
                     if ((at->kid = newambtree()) == NULL)
                            error(SYSTEM, "out of memory in avinsert");
              s *= 0.5;
              branch = 0;
              for (i = 0; i < 3; i++)
                     if (((AMBVAL*)av)->pos[i] > ck0[i] + s) {
                            ck0[i] += s;
                            branch |= 1 << i;
                     }
              at = at->kid + branch;
       }
       avh.next = at->alist;              /* order by increasing level */
       for (ap = &avh; ap->next != NULL; ap = ap->next)
              if (ap->next->lvl >= ((AMBVAL*)av)->lvl)
                     break;
       ((AMBVAL*)av)->next = ap->next;
       ap->next = (AMBVAL*)av;
       at->alist = avh.next;
}

Here is the call graph for this function:

static int avlmemi ( AMBVAL avaddr) [static]

Definition at line 742 of file ambient.c.

{
       register AMBVAL  **avlpp;

       avlpp = (AMBVAL **)bsearch((char *)&avaddr, (char *)avlist2,
                     nambvals, sizeof(AMBVAL *), aposcmp);
       if (avlpp == NULL)
              error(CONSISTENCY, "address not found in avlmemi");
       return(avlpp - avlist2);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void avsave ( AMBVAL av) [static]

Definition at line 547 of file ambient.c.

{
       avinsert(avstore(av));
       if (ambfp == NULL)
              return;
       if (writambval(av, ambfp) < 0)
              goto writerr;
       if (++nunflshed >= AMBFLUSH)
              if (ambsync() == EOF)
                     goto writerr;
       return;
writerr:
       error(SYSTEM, "error writing to ambient file");
}

Here is the call graph for this function:

Here is the caller graph for this function:

static AMBVAL* avstore ( AMBVAL aval) [static]

Here is the caller graph for this function:

static AMBVAL* avstore ( register AMBVAL aval) [static]

Definition at line 566 of file ambient.c.

{
       register AMBVAL  *av;
       double d;

       if ((av = newambval()) == NULL)
              error(SYSTEM, "out of memory in avstore");
       *av = *aval;
       av->latick = ambclock;
       av->next = NULL;
       nambvals++;
       d = bright(av->val);
       if (d > FTINY) {            /* add to log sum for averaging */
              avsum += log(d);
              navsum++;
       }
       return(av);
}

Here is the call graph for this function:

void extambient ( COLOR  cr,
register AMBVAL ap,
FVECT  pv,
FVECT  nv 
)

Definition at line 482 of file ambient.c.

{
       FVECT  v1;
       register int  i;
       double d;

       d = 1.0;                    /* zeroeth order */
                                   /* gradient due to translation */
       for (i = 0; i < 3; i++)
              d += ap->gpos[i]*(pv[i]-ap->pos[i]);
                                   /* gradient due to rotation */
       VCROSS(v1, ap->dir, nv);
       d += DOT(ap->gdir, v1);
       if (d <= 0.0) {
              setcolor(cr, 0.0, 0.0, 0.0);
              return;
       }
       copycolor(cr, ap->val);
       scalecolor(cr, d);
}

Here is the caller graph for this function:

static void freeambtree ( AMBTREE atp) [static]

Definition at line 616 of file ambient.c.

{
       atp->kid = atfreelist;
       atfreelist = atp;
}

Here is the caller graph for this function:

static void initambfile ( int  creat) [static]

Definition at line 510 of file ambient.c.

{
       extern char  *progname, *octname;
       static char  *mybuf = NULL;

#ifdef F_SETLKW
       aflock(creat ? F_WRLCK : F_RDLCK);
#endif
       SET_FILE_BINARY(ambfp);
       if (mybuf == NULL)
              mybuf = (char *)bmalloc(BUFSIZ+8);
       setbuf(ambfp, mybuf);
       if (creat) {                /* new file */
              newheader("RADIANCE", ambfp);
              fprintf(ambfp, "%s -av %g %g %g -aw %d -ab %d -aa %g ",
                            progname, colval(ambval,RED),
                            colval(ambval,GRN), colval(ambval,BLU),
                            ambvwt, ambounce, ambacc);
              fprintf(ambfp, "-ad %d -as %d -ar %d ",
                            ambdiv, ambssamp, ambres);
              if (octname != NULL)
                     printargs(1, &octname, ambfp);
              else
                     fputc('\n', ambfp);
              fprintf(ambfp, "SOFTWARE= %s\n", VersionID);
              fputnow(ambfp);
              fputformat(AMBFMT, ambfp);
              putc('\n', ambfp);
              putambmagic(ambfp);
       } else if (checkheader(ambfp, AMBFMT, NULL) < 0 || !hasambmagic(ambfp))
              error(USER, "bad ambient file");
}

Here is the call graph for this function:

Here is the caller graph for this function:

double makeambient ( COLOR  acol,
RAY r,
FVECT  rn,
int  al 
)

Definition at line 442 of file ambient.c.

{
       AMBVAL amb;
       FVECT  gp, gd;
       int    i;

       amb.weight = 1.0;                  /* compute weight */
       for (i = al; i-- > 0; )
              amb.weight *= AVGREFL;
       if (r->rweight < 0.1*amb.weight)   /* heuristic override */
              amb.weight = 1.25*r->rweight;
       setcolor(acol, AVGREFL, AVGREFL, AVGREFL);
                                          /* compute ambient */
       amb.rad = doambient(acol, r, amb.weight, gp, gd);
       if (amb.rad <= FTINY) {
              setcolor(acol, 0.0, 0.0, 0.0);
              return(0.0);
       }
       scalecolor(acol, 1./AVGREFL);             /* undo assumed reflectance */
                                          /* store value */
       VCOPY(amb.pos, r->rop);
       VCOPY(amb.dir, r->ron);
       amb.lvl = al;
       copycolor(amb.val, acol);
       VCOPY(amb.gpos, gp);
       VCOPY(amb.gdir, gd);
                                          /* insert into tree */
       avsave(&amb);                      /* and save to file */
       if (rn != r->ron)
              extambient(acol, &amb, r->rop, rn);       /* texture */
       return(amb.rad);
}

Here is the call graph for this function:

Here is the caller graph for this function:

void multambient ( COLOR  aval,
register RAY r,
FVECT  nrm 
)

Definition at line 257 of file ambient.c.

{
       static int  rdepth = 0;                   /* ambient recursion */
       COLOR  acol;
       double d, l;

       if (ambdiv <= 0)                   /* no ambient calculation */
              goto dumbamb;
                                          /* check number of bounces */
       if (rdepth >= ambounce)
              goto dumbamb;
                                          /* check ambient list */
       if (ambincl != -1 && r->ro != NULL &&
                     ambincl != inset(ambset, r->ro->omod))
              goto dumbamb;

       if (ambacc <= FTINY) {                    /* no ambient storage */
              copycolor(acol, aval);
              rdepth++;
              d = doambient(acol, r, r->rweight, NULL, NULL);
              rdepth--;
              if (d <= FTINY)
                     goto dumbamb;
              copycolor(aval, acol);
              return;
       }

       if (tracktime)                            /* sort to minimize thrashing */
              sortambvals(0);
                                          /* interpolate ambient value */
       setcolor(acol, 0.0, 0.0, 0.0);
       d = sumambient(acol, r, nrm, rdepth,
                     &atrunk, thescene.cuorg, thescene.cusize);
       if (d > FTINY) {
              d = 1.0/d;
              scalecolor(acol, d);
              multcolor(aval, acol);
              return;
       }
       rdepth++;                          /* need to cache new value */
       d = makeambient(acol, r, nrm, rdepth-1);
       rdepth--;
       if (d > FTINY) {
              multcolor(aval, acol);             /* got new value */
              return;
       }
dumbamb:                                  /* return global value */
       if ((ambvwt <= 0) | (navsum == 0)) {
              multcolor(aval, ambval);
              return;
       }
       l = bright(ambval);                /* average in computations */
       if (l > FTINY) {
              d = (log(l)*(double)ambvwt + avsum) /
                            (double)(ambvwt + navsum);
              d = exp(d) / l;
              scalecolor(aval, d);
              multcolor(aval, ambval);    /* apply color of ambval */
       } else {
              d = exp( avsum / (double)navsum );
              scalecolor(aval, d);        /* neutral color */
       }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static AMBTREE * newambtree ( void  ) [static]

Definition at line 594 of file ambient.c.

{
       register AMBTREE  *atp, *upperlim;

       if (atfreelist == NULL) {   /* get more nodes */
              atfreelist = (AMBTREE *)malloc(ATALLOCSZ*8*sizeof(AMBTREE));
              if (atfreelist == NULL)
                     return(NULL);
                                   /* link new free list */
              upperlim = atfreelist + 8*(ATALLOCSZ-1);
              for (atp = atfreelist; atp < upperlim; atp += 8)
                     atp->kid = atp + 8;
              atp->kid = NULL;
       }
       atp = atfreelist;
       atfreelist = atp->kid;
       memset((char *)atp, '\0', 8*sizeof(AMBTREE));
       return(atp);
}

Here is the caller graph for this function:

void setambacc ( double  newa)

Definition at line 125 of file ambient.c.

{
       double  ambdiff;

       if (newa < 0.0)
              newa = 0.0;
       ambdiff = fabs(newa - ambacc);
       if (ambdiff >= .01 && (ambacc = newa) > FTINY && nambvals > 0)
              sortambvals(1);                    /* rebuild tree */
}

Here is the call graph for this function:

Here is the caller graph for this function:

void setambient ( void  )

Definition at line 140 of file ambient.c.

{
       int    readonly = 0;
       long   flen;
       AMBVAL amb;
                                          /* make sure we're fresh */
       ambdone();
                                          /* init ambient limits */
       setambres(ambres);
       setambacc(ambacc);
       if (ambfile == NULL || !ambfile[0])
              return;
       if (ambacc <= FTINY) {
              sprintf(errmsg, "zero ambient accuracy so \"%s\" not opened",
                            ambfile);
              error(WARNING, errmsg);
              return;
       }
                                          /* open ambient file */
       if ((ambfp = fopen(ambfile, "r+")) == NULL)
              readonly = (ambfp = fopen(ambfile, "r")) != NULL;
       if (ambfp != NULL) {
              initambfile(0);                    /* file exists */
              lastpos = ftell(ambfp);
              while (readambval(&amb, ambfp))
                     avinsert(avstore(&amb));
              nambshare = nambvals;              /* share loaded values */
              if (readonly) {
                     sprintf(errmsg,
                            "loaded %u values from read-only ambient file",
                                   nambvals);
                     error(WARNING, errmsg);
                     fclose(ambfp);              /* close file so no writes */
                     ambfp = NULL;
                     return;                     /* avoid ambsync() */
              }
                                          /* align file pointer */
              lastpos += (long)nambvals*AMBVALSIZ;
              flen = lseek(fileno(ambfp), (off_t)0, SEEK_END);
              if (flen != lastpos) {
                     sprintf(errmsg,
                     "ignoring last %ld values in ambient file (corrupted)",
                                   (flen - lastpos)/AMBVALSIZ);
                     error(WARNING, errmsg);
                     fseek(ambfp, lastpos, SEEK_SET);
#ifndef _WIN32 /* XXX we need a replacement for that one */
                     ftruncate(fileno(ambfp), (off_t)lastpos);
#endif
              }
       } else if ((ambfp = fopen(ambfile, "w+")) != NULL) {
              initambfile(1);                    /* else create new file */
              lastpos = ftell(ambfp);
       } else {
              sprintf(errmsg, "cannot open ambient file \"%s\"", ambfile);
              error(SYSTEM, errmsg);
       }
       ambsync();                  /* load previous values */
}

Here is the call graph for this function:

Here is the caller graph for this function:

void setambres ( int  ar)

Definition at line 102 of file ambient.c.

{
       ambres = ar < 0 ? 0 : ar;          /* may be done already */
                                          /* set min & max radii */
       if (ar <= 0) {
              minarad = 0;
              maxarad = thescene.cusize / 2.0;
       } else {
              minarad = thescene.cusize / ar;
              maxarad = 64 * minarad;                   /* heuristic */
              if (maxarad > thescene.cusize / 2.0)
                     maxarad = thescene.cusize / 2.0;
       }
       if (minarad <= FTINY)
              minarad = 10*FTINY;
       if (maxarad <= minarad)
              maxarad = 64 * minarad;
}

Here is the caller graph for this function:

static void sortambvals ( int  always) [static]

Definition at line 761 of file ambient.c.

{
       AMBTREE  oldatrunk;
       AMBVAL tav, *tap, *pnext;
       register int  i, j;
                                   /* see if it's time yet */
       if (!always && (ambclock++ < lastsort+sortintvl ||
                     nambvals < SORT_THRESH))
              return;
       /*
        * The idea here is to minimize memory thrashing
        * in VM systems by improving reference locality.
        * We do this by periodically sorting our stored ambient
        * values in memory in order of most recently to least
        * recently accessed.  This ordering was chosen so that new
        * ambient values (which tend to be less important) go into
        * higher memory with the infrequently accessed values.
        *     Since we expect our values to need sorting less
        * frequently as the process continues, we double our
        * waiting interval after each call.
        *     This routine is also called by setambacc() with
        * the "always" parameter set to 1 so that the ambient
        * tree will be rebuilt with the new accuracy parameter.
        */
       if (tracktime) {            /* allocate pointer arrays to sort */
              avlist2 = (AMBVAL **)malloc(nambvals*sizeof(AMBVAL *));
              avlist1 = (struct avl *)malloc(nambvals*sizeof(struct avl));
       } else {
              avlist2 = NULL;
              avlist1 = NULL;
       }
       if (avlist1 == NULL) {             /* no time tracking -- rebuild tree? */
              if (avlist2 != NULL)
                     free((void *)avlist2);
              if (always) {        /* rebuild without sorting */
                     oldatrunk = atrunk;
                     atrunk.alist = NULL;
                     atrunk.kid = NULL;
                     unloadatree(&oldatrunk, avinsert);
              }
       } else {                    /* sort memory by last access time */
              /*
               * Sorting memory is tricky because it isn't contiguous.
               * We have to sort an array of pointers by MRA and also
               * by memory position.  We then copy values in "loops"
               * to minimize memory hits.  Nevertheless, we will visit
               * everyone at least twice, and this is an expensive process
               * when we're thrashing, which is when we need to do it.
               */
#ifdef DEBUG
              sprintf(errmsg, "sorting %u ambient values at ambclock=%lu...",
                            nambvals, ambclock);
              eputs(errmsg);
#endif
              i_avlist = 0;
              unloadatree(&atrunk, av2list);     /* empty current tree */
#ifdef DEBUG
              if (i_avlist < nambvals)
                     error(CONSISTENCY, "missing ambient values in sortambvals");
#endif
              qsort((char *)avlist1, nambvals, sizeof(struct avl), alatcmp);
              qsort((char *)avlist2, nambvals, sizeof(AMBVAL *), aposcmp);
              for (i = 0; i < nambvals; i++) {
                     if (avlist1[i].p == NULL)
                            continue;
                     tap = avlist2[i];
                     tav = *tap;
                     for (j = i; (pnext = avlist1[j].p) != tap;
                                   j = avlmemi(pnext)) {
                            *(avlist2[j]) = *pnext;
                            avinsert(avlist2[j]);
                            avlist1[j].p = NULL;
                     }
                     *(avlist2[j]) = tav;
                     avinsert(avlist2[j]);
                     avlist1[j].p = NULL;
              }
              free((void *)avlist1);
              free((void *)avlist2);
                                          /* compute new sort interval */
              sortintvl = ambclock - lastsort;
              if (sortintvl >= MAX_SORT_INTVL/2)
                     sortintvl = MAX_SORT_INTVL;
              else
                     sortintvl <<= 1;     /* wait twice as long next */
#ifdef DEBUG
              eputs("done\n");
#endif
       }
       if (ambclock >= MAXACLOCK)
              ambclock = MAXACLOCK/2;
       lastsort = ambclock;
}

Here is the call graph for this function:

Here is the caller graph for this function:

double sumambient ( COLOR  acol,
register RAY r,
FVECT  rn,
int  al,
AMBTREE at,
FVECT  c0,
double  s 
)

Definition at line 327 of file ambient.c.

{
       double d, e1, e2, wt, wsum;
       COLOR  ct;
       FVECT  ck0;
       int  i;
       register int  j;
       register AMBVAL       *av;

       wsum = 0.0;
                                   /* do this node */
       for (av = at->alist; av != NULL; av = av->next) {
              double rn_dot = -2.0;
              if (tracktime)
                     av->latick = ambclock;
              /*
               *  Ambient level test.
               */
              if (av->lvl > al)    /* list sorted, so this works */
                     break;
              if (av->weight < 0.9*r->rweight)
                     continue;
              /*
               *  Ambient radius test.
               */
              d = av->pos[0] - r->rop[0];
              e1 = d * d;
              d = av->pos[1] - r->rop[1];
              e1 += d * d;
              d = av->pos[2] - r->rop[2];
              e1 += d * d;
              e1 /= av->rad * av->rad;
              if (e1 > ambacc*ambacc*1.21)
                     continue;
              /*
               *  Direction test using closest normal.
               */
              d = DOT(av->dir, r->ron);
              if (rn != r->ron) {
                     rn_dot = DOT(av->dir, rn);
                     if (rn_dot > 1.0-FTINY)
                            rn_dot = 1.0-FTINY;
                     if (rn_dot >= d-FTINY) {
                            d = rn_dot;
                            rn_dot = -2.0;
                     }
              }
              e2 = (1.0 - d) * r->rweight;
              if (e2 < 0.0) e2 = 0.0;
              if (e1 + e2 > ambacc*ambacc*1.21)
                     continue;
              /*
               *  Ray behind test.
               */
              d = 0.0;
              for (j = 0; j < 3; j++)
                     d += (r->rop[j] - av->pos[j]) *
                                   (av->dir[j] + r->ron[j]);
              if (d*0.5 < -minarad*ambacc-.001)
                     continue;
              /*
               *  Jittering final test reduces image artifacts.
               */
              e1 = sqrt(e1);
              e2 = sqrt(e2);
              wt = e1 + e2;
              if (wt > ambacc*(.9+.2*urand(9015+samplendx)))
                     continue;
              /*
               *  Recompute directional error using perturbed normal
               */
              if (rn_dot > 0.0) {
                     e2 = sqrt((1.0 - rn_dot)*r->rweight);
                     wt = e1 + e2;
              }
              if (wt <= 1e-3)
                     wt = 1e3;
              else
                     wt = 1.0 / wt;
              wsum += wt;
              extambient(ct, av, r->rop, rn);
              scalecolor(ct, wt);
              addcolor(acol, ct);
       }
       if (at->kid == NULL)
              return(wsum);
                                   /* do children */
       s *= 0.5;
       for (i = 0; i < 8; i++) {
              for (j = 0; j < 3; j++) {
                     ck0[j] = c0[j];
                     if (1<<j & i)
                            ck0[j] += s;
                     if (r->rop[j] < ck0[j] - OCTSCALE*s)
                            break;
                     if (r->rop[j] > ck0[j] + (1.0+OCTSCALE)*s)
                            break;
              }
              if (j == 3)
                     wsum += sumambient(acol, r, rn, al,
                                          at->kid+i, ck0, s);
       }
       return(wsum);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void unloadatree ( AMBTREE at,
unloadtf_t f 
) [static]

Here is the caller graph for this function:

static void unloadatree ( register AMBTREE at,
unloadtf_t f 
) [static]

Definition at line 667 of file ambient.c.

{
       register AMBVAL  *av;
       register int  i;
                                   /* transfer values at this node */
       for (av = at->alist; av != NULL; av = at->alist) {
              at->alist = av->next;
              (*f)(av);
       }
       if (at->kid == NULL)
              return;
       for (i = 0; i < 8; i++)            /* transfer and free children */
              unloadatree(at->kid+i, f);
       freeambtree(at->kid);
       at->kid = NULL;
}

Here is the call graph for this function:


Variable Documentation

unsigned long ambclock = 0 [static]

Definition at line 58 of file ambient.c.

FILE* ambfp = NULL [static]

Definition at line 37 of file ambient.c.

FILE* ambinp = NULL [static]

Definition at line 61 of file ambient.c.

OBJECT ambset[MAXASET+1] = {0}

Definition at line 30 of file ambient.c.

AMBTREE* atfreelist = NULL [static]

Definition at line 590 of file ambient.c.

AMBTREE atrunk [static]

Definition at line 35 of file ambient.c.

unloadtf_t av2list [static]

Definition at line 89 of file ambient.c.

unloadtf_t avinsert [static]

Definition at line 88 of file ambient.c.

struct avl * avlist1 [static]
AMBVAL** avlist2 [static]

Definition at line 692 of file ambient.c.

double avsum = 0. [static]

Definition at line 54 of file ambient.c.

int i_avlist [static]

Definition at line 693 of file ambient.c.

long lastpos = -1 [static]

Definition at line 62 of file ambient.c.

unsigned long lastsort = 0 [static]

Definition at line 59 of file ambient.c.

double maxarad

Definition at line 32 of file ambient.c.

double minarad

Definition at line 33 of file ambient.c.

unsigned int nambshare = 0 [static]

Definition at line 57 of file ambient.c.

unsigned int nambvals = 0 [static]

Definition at line 56 of file ambient.c.

unsigned int navsum = 0 [static]

Definition at line 55 of file ambient.c.

int nunflshed = 0 [static]

Definition at line 38 of file ambient.c.

const char RCSid[] = "$Id: ambient.c,v 2.67 2007/11/17 06:21:58 greg Exp $" [static]

Definition at line 2 of file ambient.c.

char* shm_boundary

Definition at line 107 of file raycalls.c.

long sortintvl = SORT_INTVL [static]

Definition at line 60 of file ambient.c.