src/hd/rholo3.c

#ifndef lint
static const char       RCSid[] = "$Id$";
#endif
/*
 * Routines for tracking beam compuatations
 */

#include "rholo.h"
#include "view.h"

#ifndef NFRAG2CHUNK
#define NFRAG2CHUNK     4096    /* number of fragments to start chunking */
#endif

#ifndef abs
#define abs(x)          ((x) > 0 ? (x) : -(x))
#endif
#ifndef sgn
#define sgn(x)          ((x) > 0 ? 1 : (x) < 0 ? -1 : 0)
#endif

#define rchunk(n)       (((n)+(RPACKSIZ/2))/RPACKSIZ)

extern time_t   time();

int     chunkycmp = 0;          /* clump beams together on disk */

static PACKHEAD *complist=NULL; /* list of beams to compute */
static int      complen=0;      /* length of complist */
static int      listpos=0;      /* current list position for next_packet */
static int      lastin= -1;     /* last ordered position in list */


int
beamcmp(b0, b1)                         /* comparison for compute order */
register PACKHEAD       *b0, *b1;
{
        BEAMI   *bip0, *bip1;
        register long   c;
                                        /* first check desired quantities */
        if (chunkycmp)
                c = rchunk(b1->nr)*(rchunk(b0->nc)+1L) -
                                rchunk(b0->nr)*(rchunk(b1->nc)+1L);
        else
                c = b1->nr*(b0->nc+1L) - b0->nr*(b1->nc+1L);
        if (c > 0) return(1);
        if (c < 0) return(-1);
                                /* only one file, so skip the following: */
#if 0
                                        /* next, check file descriptors */
        c = hdlist[b0->hd]->fd - hdlist[b1->hd]->fd;
        if (c) return(c);
#endif
                                        /* finally, check file positions */
        bip0 = &hdlist[b0->hd]->bi[b0->bi];
        bip1 = &hdlist[b1->hd]->bi[b1->bi];
                                        /* put diskless beams last */
        if (!bip0->nrd)
                return(bip1->nrd > 0);
        if (!bip1->nrd)
                return(-1);
        c = bip0->fo - bip1->fo;
        return(c < 0 ? -1 : c > 0);
}


int
beamidcmp(b0, b1)                       /* comparison for beam searching */
register PACKHEAD       *b0, *b1;
{
        register int    c = b0->hd - b1->hd;

        if (c) return(c);
        return(b0->bi - b1->bi);
}


int
dispbeam(b, hb)                         /* display a holodeck beam */
register BEAM   *b;
register HDBEAMI        *hb;
{
        static int      n = 0;
        static PACKHEAD *p = NULL;

        if (b == NULL)
                return;
        if (b->nrm > n) {               /* (re)allocate packet holder */
                n = b->nrm;
                if (p == NULL) p = (PACKHEAD *)malloc(packsiz(n));
                else p = (PACKHEAD *)realloc((char *)p, packsiz(n));
                CHECK(p==NULL, SYSTEM, "out of memory in dispbeam");
        }
                                        /* assign packet fields */
        bcopy((char *)hdbray(b), (char *)packra(p), b->nrm*sizeof(RAYVAL));
        p->nr = p->nc = b->nrm;
        for (p->hd = 0; hdlist[p->hd] != hb->h; p->hd++)
                if (hdlist[p->hd] == NULL)
                        error(CONSISTENCY, "unregistered holodeck in dispbeam");
        p->bi = hb->b;
        disp_packet(p);                 /* display it */
        if (n >= 1024) {                /* free ridiculous packets */
                free((void *)p);
                p = NULL; n = 0;
        }
}


bundle_set(op, clist, nents)    /* bundle set operation */
int     op;
PACKHEAD        *clist;
int     nents;
{
        int     oldnr, n;
        HDBEAMI *hbarr;
        register PACKHEAD       *csm;
        register int    i;
                                        /* search for common members */
        for (csm = clist+nents; csm-- > clist; )
                csm->nc = -1;
        qsort((char *)clist, nents, sizeof(PACKHEAD), beamidcmp);
        for (i = 0; i < complen; i++) {
                csm = (PACKHEAD *)bsearch((char *)(complist+i), (char *)clist,
                                nents, sizeof(PACKHEAD), beamidcmp);
                if (csm == NULL)
                        continue;
                oldnr = complist[i].nr;
                csm->nc = complist[i].nc;
                switch (op) {
                case BS_ADD:            /* add to count */
                        complist[i].nr += csm->nr;
                        csm->nr = 0;
                        break;
                case BS_MAX:            /* maximum of counts */
                        if (csm->nr > complist[i].nr)
                                complist[i].nr = csm->nr;
                        csm->nr = 0;
                        break;
                case BS_ADJ:            /* reset count */
                        complist[i].nr = csm->nr;
                        csm->nr = 0;
                        break;
                case BS_DEL:            /* delete count */
                        if (csm->nr == 0 || csm->nr >= complist[i].nr)
                                complist[i].nr = 0;
                        else
                                complist[i].nr -= csm->nr;
                        break;
                }
                if (complist[i].nr != oldnr)
                        lastin = -1;    /* flag sort */
        }
                                /* record computed rays for uncommon beams */
        for (csm = clist+nents; csm-- > clist; )
                if (csm->nc < 0)
                        csm->nc = bnrays(hdlist[csm->hd], csm->bi);
                                /* complete list operations */
        switch (op) {
        case BS_NEW:                    /* new computation set */
                listpos = 0; lastin = -1;
                if (complen)            /* free old list */
                        free((void *)complist);
                complist = NULL;
                if (!(complen = nents))
                        return;
                complist = (PACKHEAD *)malloc(nents*sizeof(PACKHEAD));
                if (complist == NULL)
                        goto memerr;
                bcopy((char *)clist, (char *)complist, nents*sizeof(PACKHEAD));
                break;
        case BS_ADD:                    /* add to computation set */
        case BS_MAX:                    /* maximum of quantities */
        case BS_ADJ:                    /* adjust set quantities */
                if (nents <= 0)
                        return;
                sortcomplist();         /* sort updated list & new entries */
                qsort((char *)clist, nents, sizeof(PACKHEAD), beamcmp);
                                        /* what can't we satisfy? */
                for (i = nents, csm = clist; i-- && csm->nr > csm->nc; csm++)
                        ;
                n = csm - clist;
                if (op != BS_ADD) {     /* don't regenerate adjusted beams */
                        for (++i; i-- && csm->nr > 0; csm++)
                                ;
                        nents = csm - clist;
                }
                if (n) {                /* allocate space for merged list */
                        PACKHEAD        *newlist;
                        newlist = (PACKHEAD *)malloc(
                                        (complen+n)*sizeof(PACKHEAD) );
                        if (newlist == NULL)
                                goto memerr;
                                                /* merge lists */
                        mergeclists(newlist, clist, n, complist, complen);
                        if (complen)
                                free((void *)complist);
                        complist = newlist;
                        complen += n;
                }
                listpos = 0;
                lastin = complen-1;     /* list is now sorted */
                break;
        case BS_DEL:                    /* delete from computation set */
                return;                 /* already done */
        default:
                error(CONSISTENCY, "bundle_set called with unknown operation");
        }
        if (outdev == NULL || !nents)   /* nothing to display? */
                return;
                                        /* load and display beams we have */
        hbarr = (HDBEAMI *)malloc(nents*sizeof(HDBEAMI));
        for (i = nents; i--; ) {
                hbarr[i].h = hdlist[clist[i].hd];
                hbarr[i].b = clist[i].bi;
        }
        hdloadbeams(hbarr, nents, dispbeam);
        free((void *)hbarr);
        if (hdfragflags&FF_READ) {
                listpos = 0;
                lastin = -1;            /* need to re-sort list */
        }
        return;
memerr:
        error(SYSTEM, "out of memory in bundle_set");
}


double
beamvolume(hp, bi)      /* compute approximate volume of a beam */
HOLO    *hp;
int     bi;
{
        GCOORD  gc[2];
        FVECT   cp[4], edgeA, edgeB, cent[2];
        FVECT   v, crossp[2], diffv;
        double  vol[2];
        register int    i;
                                        /* get grid coordinates */
        if (!hdbcoord(gc, hp, bi))
                error(CONSISTENCY, "bad beam index in beamvolume");
        for (i = 0; i < 2; i++) {       /* compute cell area vectors */
                hdcell(cp, hp, gc+i);
                VSUM(edgeA, cp[1], cp[0], -1.0);
                VSUM(edgeB, cp[3], cp[1], -1.0);
                fcross(crossp[i], edgeA, edgeB);
                                        /* compute center */
                cent[i][0] = 0.5*(cp[0][0] + cp[2][0]);
                cent[i][1] = 0.5*(cp[0][1] + cp[2][1]);
                cent[i][2] = 0.5*(cp[0][2] + cp[2][2]);
        }
                                        /* compute difference vector */
        VSUM(diffv, cent[1], cent[0], -1.0);
        for (i = 0; i < 2; i++) {       /* compute volume contributions */
                vol[i] = 0.5*DOT(crossp[i], diffv);
                if (vol[i] < 0.) vol[i] = -vol[i];
        }
        return(vol[0] + vol[1]);        /* return total volume */
}


ambient_list()                  /* compute ambient beam list */
{
        int4    wtotal, minrt;
        double  frac;
        int     i;
        register int    j, k;

        complen = 0;
        for (j = 0; hdlist[j] != NULL; j++)
                complen += nbeams(hdlist[j]);
        complist = (PACKHEAD *)malloc(complen*sizeof(PACKHEAD));
        CHECK(complist==NULL, SYSTEM, "out of memory in ambient_list");
                                        /* compute beam weights */
        k = 0; wtotal = 0;
        for (j = 0; hdlist[j] != NULL; j++) {
                frac = 512. * VLEN(hdlist[j]->wg[0]) *
                                VLEN(hdlist[j]->wg[1]) *
                                VLEN(hdlist[j]->wg[2]);
                for (i = nbeams(hdlist[j]); i > 0; i--) {
                        complist[k].hd = j;
                        complist[k].bi = i;
                        complist[k].nr = frac*beamvolume(hdlist[j], i) + 0.5;
                        complist[k].nc = bnrays(hdlist[j], i);
                        wtotal += complist[k++].nr;
                }
        }
                                        /* adjust sample weights */
        if (vdef(DISKSPACE))
                frac = 1024.*1024.*vflt(DISKSPACE) / (wtotal*sizeof(RAYVAL));
        else
                frac = 1024.*1024.*2048. / (wtotal*sizeof(RAYVAL));
        minrt = .02*frac*wtotal/complen + .5;   /* heuristic mimimum */
        if (minrt > RPACKSIZ)
                minrt = RPACKSIZ;
        for (k = complen; k--; )
                if ((complist[k].nr = frac*complist[k].nr + 0.5) < minrt)
                        complist[k].nr = minrt;
        listpos = 0; lastin = -1;       /* flag initial sort */
}


view_list(fp)                   /* assign beam priority from view list */
FILE    *fp;
{
        double  pa = 1.;
        VIEW    curview;
        int     xr, yr;
        char    *err;
        BEAMLIST        blist;

        copystruct(&curview, &stdview);
        while (nextview(&curview, fp) != EOF) {
                if ((err = setview(&curview)) != NULL) {
                        error(WARNING, err);
                        continue;
                }
                xr = yr = 1024;
                normaspect(viewaspect(&curview), &pa, &xr, &yr);
                viewbeams(&curview, xr, yr, &blist);
                bundle_set(BS_MAX, blist.bl, blist.nb);
                free((void *)blist.bl);
        }
}


init_global()                   /* initialize global ray computation */
{
        register int    k;
                                        /* free old list and empty queue */
        if (complen > 0) {
                free((void *)complist);
                done_packets(flush_queue());
        }
                                        /* reseed random number generator */
        srandom(time(NULL));
                                        /* allocate beam list */
        if (readinp)
                view_list(stdin);
        else
                ambient_list();
                                        /* no view vicinity */
        myeye.rng = 0;
}


mergeclists(cdest, cl1, n1, cl2, n2)    /* merge two sorted lists */
register PACKHEAD       *cdest;
register PACKHEAD       *cl1, *cl2;
int     n1, n2;
{
        register int    cmp;

        while (n1 | n2) {
                if (!n1) cmp = 1;
                else if (!n2) cmp = -1;
                else cmp = beamcmp(cl1, cl2);
                if (cmp > 0) {
                        copystruct(cdest, cl2);
                        cl2++; n2--;
                } else {
                        copystruct(cdest, cl1);
                        cl1++; n1--;
                }
                cdest++;
        }
}


sortcomplist()                  /* fix our list order */
{
        PACKHEAD        *list2;
        int     listlen;
        register int    i;

        if (complen <= 0)       /* check to see if there is even a list */
                return;
        if (!chunkycmp)         /* check to see if fragment list is full */
                if (!hdfragOK(hdlist[0]->fd, &listlen, NULL)
#if NFRAG2CHUNK
                                || listlen >= NFRAG2CHUNK
#endif
                                ) {
                        chunkycmp++;    /* use "chunky" comparison */
                        lastin = -1;    /* need to re-sort list */
#ifdef DEBUG
                        error(WARNING, "using chunky comparison mode");
#endif
                }
        if (lastin < 0 || listpos*4 >= complen*3)
                qsort((char *)complist, complen, sizeof(PACKHEAD), beamcmp);
        else if (listpos) {     /* else sort and merge sublist */
                list2 = (PACKHEAD *)malloc(listpos*sizeof(PACKHEAD));
                CHECK(list2==NULL, SYSTEM, "out of memory in sortcomplist");
                bcopy((char *)complist,(char *)list2,listpos*sizeof(PACKHEAD));
                qsort((char *)list2, listpos, sizeof(PACKHEAD), beamcmp);
                mergeclists(complist, list2, listpos,
                                complist+listpos, complen-listpos);
                free((void *)list2);
        }
                                        /* drop satisfied requests */
        for (i = complen; i-- && complist[i].nr <= complist[i].nc; )
                ;
        if (i < 0) {
                free((void *)complist);
                complist = NULL;
                complen = 0;
        } else if (i < complen-1) {
                list2 = (PACKHEAD *)realloc((char *)complist,
                                (i+1)*sizeof(PACKHEAD));
                if (list2 != NULL)
                        complist = list2;
                complen = i+1;
        }
        listpos = 0; lastin = i;
}


/*
 * The following routine works on the assumption that the bundle weights are
 * more or less evenly distributed, such that computing a packet causes
 * a given bundle to move way down in the computation order.  We keep
 * track of where the computed bundle with the highest priority would end
 * up, and if we get further in our compute list than this, we re-sort the
 * list and start again from the beginning.  Since
 * a merge sort is used, the sorting costs are minimal.
 */
next_packet(p, n)               /* prepare packet for computation */
register PACKET *p;
int     n;
{
        register int    i;

        if (listpos > lastin)           /* time to sort the list */
                sortcomplist();
        if (complen <= 0)
                return(0);
        p->hd = complist[listpos].hd;
        p->bi = complist[listpos].bi;
        p->nc = complist[listpos].nc;
        p->nr = complist[listpos].nr - p->nc;
        if (p->nr <= 0)
                return(0);
        DCHECK(n < 1 | n > RPACKSIZ,
                        CONSISTENCY, "next_packet called with bad n value");
        if (p->nr > n)
                p->nr = n;
        complist[listpos].nc += p->nr;  /* find where this one would go */
        if (hdgetbeam(hdlist[p->hd], p->bi) != NULL)
                hdfreefrag(hdlist[p->hd], p->bi);
        while (lastin > listpos && 
                        beamcmp(complist+lastin, complist+listpos) > 0)
                lastin--;
        listpos++;
        return(1);
}
Revision:	3.34
Committed:	Sat Feb 22 02:07:25 2003 UTC (21 years, 7 months ago) by greg
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rad3R5
Changes since 3.33:	+9 -12 lines
Log Message:	Changes and check-in for 3.5 release Includes new source files and modifications not recorded for many years See ray/doc/notes/ReleaseNotes for notes between 3.1 and 3.5 release
#	User	Rev	Content
1	gwlarson	3.23	#ifndef lint
2	greg	3.34	static const char RCSid[] = "$Id$";
3	gwlarson	3.23	#endif
4	gregl	3.1	/*
5			* Routines for tracking beam compuatations
6			*/
7
8			#include "rholo.h"
9	gwlarson	3.31	#include "view.h"
10	gregl	3.1
11	gwlarson	3.27	#ifndef NFRAG2CHUNK
12			#define NFRAG2CHUNK 4096 /* number of fragments to start chunking */
13			#endif
14
15			#ifndef abs
16	gregl	3.1	#define abs(x) ((x) > 0 ? (x) : -(x))
17	gwlarson	3.27	#endif
18			#ifndef sgn
19	gregl	3.1	#define sgn(x) ((x) > 0 ? 1 : (x) < 0 ? -1 : 0)
20	gwlarson	3.27	#endif
21	gregl	3.1
22	gwlarson	3.27	#define rchunk(n) (((n)+(RPACKSIZ/2))/RPACKSIZ)
23
24	gwlarson	3.28	extern time_t time();
25
26	gwlarson	3.30	int chunkycmp = 0; /* clump beams together on disk */
27
28	gregl	3.4	static PACKHEAD complist=NULL; / list of beams to compute */
29			static int complen=0; /* length of complist */
30			static int listpos=0; /* current list position for next_packet */
31			static int lastin= -1; /* last ordered position in list */
32	gregl	3.1
33
34			int
35	gwlarson	3.23	beamcmp(b0, b1) /* comparison for compute order */
36	gregl	3.2	register PACKHEAD b0, b1;
37			{
38	gwlarson	3.27	BEAMI bip0, bip1;
39			register long c;
40			/* first check desired quantities */
41	gwlarson	3.30	if (chunkycmp)
42	gwlarson	3.28	c = rchunk(b1->nr)*(rchunk(b0->nc)+1L) -
43			rchunk(b0->nr)*(rchunk(b1->nc)+1L);
44	gwlarson	3.27	else
45	gwlarson	3.28	c = b1->nr(b0->nc+1L) - b0->nr(b1->nc+1L);
46			if (c > 0) return(1);
47			if (c < 0) return(-1);
48	gwlarson	3.27	/* only one file, so skip the following: */
49			#if 0
50			/* next, check file descriptors */
51			c = hdlist[b0->hd]->fd - hdlist[b1->hd]->fd;
52			if (c) return(c);
53			#endif
54			/* finally, check file positions */
55			bip0 = &hdlist[b0->hd]->bi[b0->bi];
56			bip1 = &hdlist[b1->hd]->bi[b1->bi];
57			/* put diskless beams last */
58			if (!bip0->nrd)
59			return(bip1->nrd > 0);
60			if (!bip1->nrd)
61			return(-1);
62			c = bip0->fo - bip1->fo;
63			return(c < 0 ? -1 : c > 0);
64	gregl	3.2	}
65
66
67	gregl	3.14	int
68	gwlarson	3.23	beamidcmp(b0, b1) /* comparison for beam searching */
69			register PACKHEAD b0, b1;
70			{
71			register int c = b0->hd - b1->hd;
72
73			if (c) return(c);
74			return(b0->bi - b1->bi);
75			}
76
77
78			int
79			dispbeam(b, hb) /* display a holodeck beam */
80	gregl	3.14	register BEAM *b;
81	gwlarson	3.23	register HDBEAMI *hb;
82	gregl	3.14	{
83			static int n = 0;
84			static PACKHEAD *p = NULL;
85
86			if (b == NULL)
87			return;
88			if (b->nrm > n) { /* (re)allocate packet holder */
89			n = b->nrm;
90			if (p == NULL) p = (PACKHEAD *)malloc(packsiz(n));
91			else p = (PACKHEAD )realloc((char )p, packsiz(n));
92	gwlarson	3.31	CHECK(p==NULL, SYSTEM, "out of memory in dispbeam");
93	gregl	3.14	}
94			/* assign packet fields */
95			bcopy((char )hdbray(b), (char )packra(p), b->nrm*sizeof(RAYVAL));
96			p->nr = p->nc = b->nrm;
97	gwlarson	3.23	for (p->hd = 0; hdlist[p->hd] != hb->h; p->hd++)
98	gregl	3.14	if (hdlist[p->hd] == NULL)
99			error(CONSISTENCY, "unregistered holodeck in dispbeam");
100	gwlarson	3.23	p->bi = hb->b;
101	gregl	3.14	disp_packet(p); /* display it */
102	gwlarson	3.29	if (n >= 1024) { /* free ridiculous packets */
103	greg	3.34	free((void *)p);
104	gwlarson	3.29	p = NULL; n = 0;
105			}
106	gregl	3.14	}
107
108
109	gregl	3.2	bundle_set(op, clist, nents) /* bundle set operation */
110			int op;
111	gwlarson	3.23	PACKHEAD *clist;
112	gregl	3.2	int nents;
113			{
114	gwlarson	3.23	int oldnr, n;
115			HDBEAMI *hbarr;
116			register PACKHEAD *csm;
117			register int i;
118			/* search for common members */
119			for (csm = clist+nents; csm-- > clist; )
120			csm->nc = -1;
121	gwlarson	3.25	qsort((char *)clist, nents, sizeof(PACKHEAD), beamidcmp);
122	gwlarson	3.23	for (i = 0; i < complen; i++) {
123			csm = (PACKHEAD )bsearch((char )(complist+i), (char *)clist,
124			nents, sizeof(PACKHEAD), beamidcmp);
125			if (csm == NULL)
126			continue;
127			oldnr = complist[i].nr;
128			csm->nc = complist[i].nc;
129			switch (op) {
130			case BS_ADD: /* add to count */
131			complist[i].nr += csm->nr;
132			csm->nr = 0;
133			break;
134	gwlarson	3.31	case BS_MAX: /* maximum of counts */
135			if (csm->nr > complist[i].nr)
136			complist[i].nr = csm->nr;
137			csm->nr = 0;
138			break;
139	gwlarson	3.23	case BS_ADJ: /* reset count */
140			complist[i].nr = csm->nr;
141			csm->nr = 0;
142			break;
143			case BS_DEL: /* delete count */
144			if (csm->nr == 0 \|\| csm->nr >= complist[i].nr)
145			complist[i].nr = 0;
146			else
147			complist[i].nr -= csm->nr;
148			break;
149			}
150			if (complist[i].nr != oldnr)
151			lastin = -1; /* flag sort */
152	gregl	3.20	}
153	gwlarson	3.24	/* record computed rays for uncommon beams */
154	gwlarson	3.23	for (csm = clist+nents; csm-- > clist; )
155			if (csm->nc < 0)
156			csm->nc = bnrays(hdlist[csm->hd], csm->bi);
157	gregl	3.20	/* complete list operations */
158	gregl	3.2	switch (op) {
159			case BS_NEW: /* new computation set */
160	gwlarson	3.21	listpos = 0; lastin = -1;
161	gregl	3.20	if (complen) /* free old list */
162	greg	3.34	free((void *)complist);
163	gregl	3.20	complist = NULL;
164			if (!(complen = nents))
165	gregl	3.2	return;
166			complist = (PACKHEAD )malloc(nentssizeof(PACKHEAD));
167			if (complist == NULL)
168			goto memerr;
169			bcopy((char )clist, (char )complist, nents*sizeof(PACKHEAD));
170			break;
171			case BS_ADD: /* add to computation set */
172	gwlarson	3.31	case BS_MAX: /* maximum of quantities */
173	gregl	3.11	case BS_ADJ: /* adjust set quantities */
174	gregl	3.2	if (nents <= 0)
175			return;
176	gregl	3.20	sortcomplist(); /* sort updated list & new entries */
177	gregl	3.2	qsort((char *)clist, nents, sizeof(PACKHEAD), beamcmp);
178			/* what can't we satisfy? */
179	gwlarson	3.23	for (i = nents, csm = clist; i-- && csm->nr > csm->nc; csm++)
180	gregl	3.2	;
181	gwlarson	3.23	n = csm - clist;
182	gwlarson	3.31	if (op != BS_ADD) { /* don't regenerate adjusted beams */
183	gwlarson	3.24	for (++i; i-- && csm->nr > 0; csm++)
184	gwlarson	3.22	;
185	gwlarson	3.24	nents = csm - clist;
186	gwlarson	3.22	}
187	gregl	3.2	if (n) { /* allocate space for merged list */
188			PACKHEAD *newlist;
189			newlist = (PACKHEAD *)malloc(
190			(complen+n)*sizeof(PACKHEAD) );
191			if (newlist == NULL)
192			goto memerr;
193			/* merge lists */
194			mergeclists(newlist, clist, n, complist, complen);
195			if (complen)
196	greg	3.34	free((void *)complist);
197	gregl	3.2	complist = newlist;
198			complen += n;
199			}
200			listpos = 0;
201			lastin = complen-1; /* list is now sorted */
202			break;
203			case BS_DEL: /* delete from computation set */
204	gregl	3.20	return; /* already done */
205	gregl	3.2	default:
206			error(CONSISTENCY, "bundle_set called with unknown operation");
207			}
208	gwlarson	3.27	if (outdev == NULL \|\| !nents) /* nothing to display? */
209	gwlarson	3.22	return;
210			/* load and display beams we have */
211	gwlarson	3.23	hbarr = (HDBEAMI )malloc(nentssizeof(HDBEAMI));
212			for (i = nents; i--; ) {
213			hbarr[i].h = hdlist[clist[i].hd];
214			hbarr[i].b = clist[i].bi;
215	gregl	3.11	}
216	gwlarson	3.23	hdloadbeams(hbarr, nents, dispbeam);
217	greg	3.34	free((void *)hbarr);
218	gwlarson	3.27	if (hdfragflags&FF_READ) {
219			listpos = 0;
220			lastin = -1; /* need to re-sort list */
221			}
222	gregl	3.2	return;
223			memerr:
224			error(SYSTEM, "out of memory in bundle_set");
225			}
226
227
228	gregl	3.13	double
229			beamvolume(hp, bi) /* compute approximate volume of a beam */
230	gregl	3.1	HOLO *hp;
231	gregl	3.13	int bi;
232	gregl	3.1	{
233	gregl	3.13	GCOORD gc[2];
234			FVECT cp[4], edgeA, edgeB, cent[2];
235			FVECT v, crossp[2], diffv;
236			double vol[2];
237			register int i;
238			/* get grid coordinates */
239			if (!hdbcoord(gc, hp, bi))
240			error(CONSISTENCY, "bad beam index in beamvolume");
241			for (i = 0; i < 2; i++) { /* compute cell area vectors */
242			hdcell(cp, hp, gc+i);
243			VSUM(edgeA, cp[1], cp[0], -1.0);
244			VSUM(edgeB, cp[3], cp[1], -1.0);
245			fcross(crossp[i], edgeA, edgeB);
246			/* compute center */
247			cent[i][0] = 0.5*(cp[0][0] + cp[2][0]);
248			cent[i][1] = 0.5*(cp[0][1] + cp[2][1]);
249			cent[i][2] = 0.5*(cp[0][2] + cp[2][2]);
250	gregl	3.1	}
251	gregl	3.13	/* compute difference vector */
252			VSUM(diffv, cent[1], cent[0], -1.0);
253			for (i = 0; i < 2; i++) { /* compute volume contributions */
254	gregl	3.15	vol[i] = 0.5*DOT(crossp[i], diffv);
255	gregl	3.13	if (vol[i] < 0.) vol[i] = -vol[i];
256			}
257			return(vol[0] + vol[1]); /* return total volume */
258	gregl	3.1	}
259
260
261	gwlarson	3.31	ambient_list() /* compute ambient beam list */
262	gregl	3.1	{
263	gwlarson	3.32	int4 wtotal, minrt;
264	gregl	3.1	double frac;
265	gregl	3.13	int i;
266			register int j, k;
267	gwlarson	3.31
268	gregl	3.1	complen = 0;
269			for (j = 0; hdlist[j] != NULL; j++)
270			complen += nbeams(hdlist[j]);
271			complist = (PACKHEAD )malloc(complensizeof(PACKHEAD));
272	gwlarson	3.31	CHECK(complist==NULL, SYSTEM, "out of memory in ambient_list");
273	gregl	3.1	/* compute beam weights */
274	gwlarson	3.32	k = 0; wtotal = 0;
275	gregl	3.13	for (j = 0; hdlist[j] != NULL; j++) {
276	gregl	3.19	frac = 512. * VLEN(hdlist[j]->wg[0]) *
277			VLEN(hdlist[j]->wg[1]) *
278			VLEN(hdlist[j]->wg[2]);
279	gregl	3.1	for (i = nbeams(hdlist[j]); i > 0; i--) {
280			complist[k].hd = j;
281			complist[k].bi = i;
282	gregl	3.13	complist[k].nr = frac*beamvolume(hdlist[j], i) + 0.5;
283	gregl	3.18	complist[k].nc = bnrays(hdlist[j], i);
284	gregl	3.1	wtotal += complist[k++].nr;
285			}
286	gregl	3.13	}
287	gwlarson	3.31	/* adjust sample weights */
288	gregl	3.12	if (vdef(DISKSPACE))
289	gwlarson	3.32	frac = 1024.1024.vflt(DISKSPACE) / (wtotal*sizeof(RAYVAL));
290	gregl	3.12	else
291	gwlarson	3.32	frac = 1024.1024.2048. / (wtotal*sizeof(RAYVAL));
292			minrt = .02fracwtotal/complen + .5; /* heuristic mimimum */
293			if (minrt > RPACKSIZ)
294			minrt = RPACKSIZ;
295			for (k = complen; k--; )
296			if ((complist[k].nr = frac*complist[k].nr + 0.5) < minrt)
297			complist[k].nr = minrt;
298	gwlarson	3.31	listpos = 0; lastin = -1; /* flag initial sort */
299			}
300
301
302			view_list(fp) /* assign beam priority from view list */
303			FILE *fp;
304			{
305			double pa = 1.;
306			VIEW curview;
307			int xr, yr;
308			char *err;
309			BEAMLIST blist;
310
311			copystruct(&curview, &stdview);
312			while (nextview(&curview, fp) != EOF) {
313			if ((err = setview(&curview)) != NULL) {
314			error(WARNING, err);
315			continue;
316			}
317			xr = yr = 1024;
318			normaspect(viewaspect(&curview), &pa, &xr, &yr);
319			viewbeams(&curview, xr, yr, &blist);
320			bundle_set(BS_MAX, blist.bl, blist.nb);
321	greg	3.34	free((void *)blist.bl);
322	gwlarson	3.31	}
323			}
324
325
326			init_global() /* initialize global ray computation */
327			{
328			register int k;
329			/* free old list and empty queue */
330			if (complen > 0) {
331	greg	3.34	free((void *)complist);
332	gwlarson	3.31	done_packets(flush_queue());
333			}
334			/* reseed random number generator */
335			srandom(time(NULL));
336			/* allocate beam list */
337			if (readinp)
338			view_list(stdin);
339			else
340			ambient_list();
341	gwlarson	3.25	/* no view vicinity */
342			myeye.rng = 0;
343	gregl	3.1	}
344
345
346			mergeclists(cdest, cl1, n1, cl2, n2) /* merge two sorted lists */
347	gregl	3.16	register PACKHEAD *cdest;
348			register PACKHEAD cl1, cl2;
349	gregl	3.1	int n1, n2;
350			{
351	gregl	3.16	register int cmp;
352	gregl	3.1
353			while (n1 \| n2) {
354			if (!n1) cmp = 1;
355			else if (!n2) cmp = -1;
356			else cmp = beamcmp(cl1, cl2);
357			if (cmp > 0) {
358			copystruct(cdest, cl2);
359			cl2++; n2--;
360			} else {
361			copystruct(cdest, cl1);
362			cl1++; n1--;
363			}
364			cdest++;
365			}
366			}
367
368
369			sortcomplist() /* fix our list order */
370			{
371			PACKHEAD *list2;
372	gwlarson	3.27	int listlen;
373	gregl	3.2	register int i;
374
375	gregl	3.3	if (complen <= 0) /* check to see if there is even a list */
376	gregl	3.2	return;
377	gwlarson	3.30	if (!chunkycmp) /* check to see if fragment list is full */
378	gwlarson	3.27	if (!hdfragOK(hdlist[0]->fd, &listlen, NULL)
379			#if NFRAG2CHUNK
380			\|\| listlen >= NFRAG2CHUNK
381			#endif
382			) {
383	gwlarson	3.30	chunkycmp++; /* use "chunky" comparison */
384			lastin = -1; /* need to re-sort list */
385	gwlarson	3.27	#ifdef DEBUG
386			error(WARNING, "using chunky comparison mode");
387			#endif
388			}
389	gregl	3.6	if (lastin < 0 \|\| listpos4 >= complen3)
390	gregl	3.1	qsort((char *)complist, complen, sizeof(PACKHEAD), beamcmp);
391			else if (listpos) { /* else sort and merge sublist */
392			list2 = (PACKHEAD )malloc(listpossizeof(PACKHEAD));
393	gwlarson	3.31	CHECK(list2==NULL, SYSTEM, "out of memory in sortcomplist");
394	gregl	3.1	bcopy((char )complist,(char )list2,listpos*sizeof(PACKHEAD));
395			qsort((char *)list2, listpos, sizeof(PACKHEAD), beamcmp);
396			mergeclists(complist, list2, listpos,
397			complist+listpos, complen-listpos);
398	greg	3.34	free((void *)list2);
399	gregl	3.1	}
400	gregl	3.2	/* drop satisfied requests */
401	gregl	3.11	for (i = complen; i-- && complist[i].nr <= complist[i].nc; )
402	gregl	3.2	;
403	gregl	3.4	if (i < 0) {
404	greg	3.34	free((void *)complist);
405	gregl	3.4	complist = NULL;
406			complen = 0;
407			} else if (i < complen-1) {
408	gregl	3.2	list2 = (PACKHEAD )realloc((char )complist,
409			(i+1)*sizeof(PACKHEAD));
410	gwlarson	3.26	if (list2 != NULL)
411	gregl	3.2	complist = list2;
412	gwlarson	3.26	complen = i+1;
413	gregl	3.2	}
414			listpos = 0; lastin = i;
415	gregl	3.1	}
416
417
418			/*
419			* The following routine works on the assumption that the bundle weights are
420			* more or less evenly distributed, such that computing a packet causes
421			* a given bundle to move way down in the computation order. We keep
422			* track of where the computed bundle with the highest priority would end
423	gwlarson	3.27	* up, and if we get further in our compute list than this, we re-sort the
424	gregl	3.11	* list and start again from the beginning. Since
425			* a merge sort is used, the sorting costs are minimal.
426	gregl	3.1	*/
427	gregl	3.17	next_packet(p, n) /* prepare packet for computation */
428	gregl	3.1	register PACKET *p;
429	gregl	3.17	int n;
430	gregl	3.1	{
431			register int i;
432
433	gregl	3.10	if (listpos > lastin) /* time to sort the list */
434			sortcomplist();
435	gregl	3.1	if (complen <= 0)
436			return(0);
437			p->hd = complist[listpos].hd;
438			p->bi = complist[listpos].bi;
439	gregl	3.11	p->nc = complist[listpos].nc;
440			p->nr = complist[listpos].nr - p->nc;
441	gregl	3.1	if (p->nr <= 0)
442			return(0);
443	gwlarson	3.28	DCHECK(n < 1 \| n > RPACKSIZ,
444			CONSISTENCY, "next_packet called with bad n value");
445	gregl	3.17	if (p->nr > n)
446			p->nr = n;
447	gregl	3.11	complist[listpos].nc += p->nr; /* find where this one would go */
448	gwlarson	3.27	if (hdgetbeam(hdlist[p->hd], p->bi) != NULL)
449			hdfreefrag(hdlist[p->hd], p->bi);
450	gregl	3.11	while (lastin > listpos &&
451			beamcmp(complist+lastin, complist+listpos) > 0)
452	gregl	3.1	lastin--;
453			listpos++;
454			return(1);
455			}