--- ray/src/hd/rhd_qtree.h	1997/11/25 16:52:04	3.5
+++ ray/src/hd/rhd_qtree.h	2018/10/05 19:46:26	3.20
@@ -1,14 +1,18 @@
-/* Copyright (c) 1997 Silicon Graphics, Inc. */
-
-/* SCCSid "$SunId$ SGI" */
-
+/* RCSid $Id: rhd_qtree.h,v 3.20 2018/10/05 19:46:26 greg Exp $ */
 /*
  * Quadtree data structures for holodeck display drivers.
  */
+#ifndef _RAD_RHD_QTREE_H_
+#define _RAD_RHD_QTREE_H_
 
+#include "color.h"
 #include "tonemap.h"
 #include "rhdriver.h"
-				/* child ordering */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
 #define	DL		0		/* down left */
 #define	DR		1		/* down right */
 #define	UL		2		/* up left */
@@ -33,9 +37,10 @@ typedef struct rtree {
 
 extern struct rleaves {
 	float		(*wp)[3];	/* world intersection point array */
+	int32		*wd;		/* world direction array */
 	TMbright	*brt;		/* encoded brightness array */
-	BYTE		(*chr)[3];	/* encoded chrominance array */
-	BYTE		(*rgb)[3];	/* tone-mapped color array */
+	uby8		(*chr)[3];	/* encoded chrominance array */
+	uby8		(*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 */
@@ -47,3 +52,24 @@ extern struct rleaves {
 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 TMstruct	*tmGlobal;	/* global tone-mapping structure */
+
+	/* rhd_qtree.c */
+extern int qtAllocLeaves(register int n);
+extern void qtFreeLeaves(void);
+extern int qtCompost(int pct);
+extern void qtReplant(void);
+extern int qtFindLeaf(int x, int y);
+extern int qtMapLeaves(int redo);
+	/* rhd_qtree2c.c rhd_qtree2r.c */
+extern void qtRedraw(int x0, int y0, int x1, int y1);
+extern void qtUpdate(void);
+
+#ifdef __cplusplus
+}
+#endif
+#endif /* _RAD_RHD_QTREE_H_ */
+