| 1 |
/* Copyright (c) 1997 Silicon Graphics, Inc. */ |
| 2 |
|
| 3 |
/* SCCSid "$SunId$ SGI" */ |
| 4 |
|
| 5 |
/* |
| 6 |
* Quadtree data structures for holodeck display drivers. |
| 7 |
*/ |
| 8 |
|
| 9 |
#include "tonemap.h" |
| 10 |
#include "rhdriver.h" |
| 11 |
/* child ordering */ |
| 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 |
short (*wd)[2]; /* 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) */ |
