src/hd/rhd_qtree.h

/* RCSid: $Id$ */
/*
 * Quadtree data structures for holodeck display drivers.
 */

#undef NOPROTO
#define NOPROTO 1
#include "color.h"
#include "tonemap.h"
#include "rhdriver.h"

#define DL              0               /* down left */
#define DR              1               /* down right */
#define UL              2               /* up left */
#define UR              3               /* up right */

#define BRF(i)          (0x1<<(i))      /* branch flag bit */
#define LFF(i)          (0x10<<(i))     /* leaf flag bit */
#define CHF(i)          (0x100<<(i))    /* change flag bit */
#define CHBRF(i)        (0x101<<(i))    /* changed branch bit */
#define CHLFF(i)        (0x110<<(i))    /* changed leaf bit */
#define BR_ANY          0xf             /* flags for any branches */
#define LF_ANY          0xf0            /* flags for any leaves */
#define CH_ANY          0xf00           /* flags for any change */

typedef struct rtree {
        short   flgs;                   /* content flags (defined above) */
        union {
                struct rtree    *b;             /* if branch */
                int     li;                     /* if leaf */
        } k[4];                         /* children */
}       RTREE;

extern struct rleaves {
        float           (*wp)[3];       /* world intersection point array */
        int4            *wd;            /* world direction array */
        TMbright        *brt;           /* encoded brightness array */
        BYTE            (*chr)[3];      /* encoded chrominance array */
        BYTE            (*rgb)[3];      /* tone-mapped color array */
        int             nl;             /* count of leaves in our pile */
        int             bl, tl;         /* bottom and top (next) leaf index */
        int             tml;            /* next leaf needing tone-mapping */
        char            *base;          /* base of allocated memory */
}       qtL;                    /* our pile of leaves */

#define is_stump(t)     (!((t)->flgs & (BR_ANY|LF_ANY)))

extern RTREE    qtrunk;         /* trunk of quadtree */
extern double   qtDepthEps;     /* epsilon to compare depths (z fraction) */
extern int      qtMinNodesiz;   /* minimum node dimension (pixels) */

extern int      rayqleft;       /* number of rays to queue before flush */

extern int4     encodedir();
extern double   fdir2diff(), dir2diff();
Revision:	3.13
Committed:	Sat Feb 22 02:07:24 2003 UTC (21 years, 2 months ago) by greg
Content type:	text/plain
Branch:	MAIN
Changes since 3.12:	+1 -4 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
#	Content
1	/* RCSid: $Id$ */
2	/*
3	* Quadtree data structures for holodeck display drivers.
4	*/
5
6	#undef NOPROTO
7	#define NOPROTO 1
8	#include "color.h"
9	#include "tonemap.h"
10	#include "rhdriver.h"
11
12	#define DL 0 /* down left */
13	#define DR 1 /* down right */
14	#define UL 2 /* up left */
15	#define UR 3 /* up right */
16
17	#define BRF(i) (0x1<<(i)) /* branch flag bit */
18	#define LFF(i) (0x10<<(i)) /* leaf flag bit */
19	#define CHF(i) (0x100<<(i)) /* change flag bit */
20	#define CHBRF(i) (0x101<<(i)) /* changed branch bit */
21	#define CHLFF(i) (0x110<<(i)) /* changed leaf bit */
22	#define BR_ANY 0xf /* flags for any branches */
23	#define LF_ANY 0xf0 /* flags for any leaves */
24	#define CH_ANY 0xf00 /* flags for any change */
25
26	typedef struct rtree {
27	short flgs; /* content flags (defined above) */
28	union {
29	struct rtree b; / if branch */
30	int li; /* if leaf */
31	} k[4]; /* children */
32	} RTREE;
33
34	extern struct rleaves {
35	float (wp)[3]; / world intersection point array */
36	int4 wd; / world direction array */
37	TMbright brt; / encoded brightness array */
38	BYTE (chr)[3]; / encoded chrominance array */
39	BYTE (rgb)[3]; / tone-mapped color array */
40	int nl; /* count of leaves in our pile */
41	int bl, tl; /* bottom and top (next) leaf index */
42	int tml; /* next leaf needing tone-mapping */
43	char base; / base of allocated memory */
44	} qtL; /* our pile of leaves */
45
46	#define is_stump(t) (!((t)->flgs & (BR_ANY\|LF_ANY)))
47
48	extern RTREE qtrunk; /* trunk of quadtree */
49	extern double qtDepthEps; /* epsilon to compare depths (z fraction) */
50	extern int qtMinNodesiz; /* minimum node dimension (pixels) */
51
52	extern int rayqleft; /* number of rays to queue before flush */
53
54	extern int4 encodedir();
55	extern double fdir2diff(), dir2diff();