--- ray/src/common/octree.c	1991/11/12 16:55:14	2.1
+++ ray/src/common/octree.c	2003/02/25 02:47:21	2.6
@@ -1,15 +1,12 @@
-/* Copyright (c) 1986 Regents of the University of California */
-
 #ifndef lint
-static char SCCSid[] = "$SunId$ LBL";
+static const char	RCSid[] = "$Id: octree.c,v 2.6 2003/02/25 02:47:21 greg Exp $";
 #endif
-
 /*
  *  octree.c - routines dealing with octrees and cubes.
- *
- *     7/28/85
  */
 
+#include "copyright.h"
+
 #include  "standard.h"
 
 #include  "octree.h"
@@ -33,8 +30,8 @@ octalloc()			/* allocate an octree */
 		errno = 0;
 		if (octbi(freet) >= MAXOBLK)
 			return(EMPTY);
-		if ((octblock[octbi(freet)] = (OCTREE *)bmalloc(
-				(unsigned)256*8*sizeof(OCTREE))) == NULL)
+		if ((octblock[octbi(freet)] = (OCTREE *)malloc(
+				(unsigned)OCTBLKSIZ*8*sizeof(OCTREE))) == NULL)
 			return(EMPTY);
 	}
 	treetop += 8;
@@ -42,6 +39,7 @@ octalloc()			/* allocate an octree */
 }
 
 
+void
 octfree(ot)			/* free an octree */
 register OCTREE  ot;
 {
@@ -56,6 +54,22 @@ register OCTREE  ot;
 }
 
 
+void
+octdone()			/* free EVERYTHING */
+{
+	register int	i;
+
+	for (i = 0; i < MAXOBLK; i++) {
+		if (octblock[i] == NULL)
+			break;
+		free((void *)octblock[i]);
+		octblock[i] = NULL;
+	}
+	ofreelist = EMPTY;
+	treetop = 0;
+}
+
+
 OCTREE
 combine(ot)			/* recursively combine nodes */
 register OCTREE  ot;
@@ -77,6 +91,7 @@ register OCTREE  ot;
 }
 
 
+void
 culocate(cu, pt)		/* locate point within cube */
 register CUBE  *cu;
 register FVECT  pt;
@@ -97,6 +112,7 @@ register FVECT  pt;
 }
 
 
+void
 cucopy(cu1, cu2)		/* copy cu2 into cu1 */
 register CUBE  *cu1, *cu2;
 {
@@ -106,6 +122,7 @@ register CUBE  *cu1, *cu2;
 }
 
 
+int
 incube(cu, pt)			/* determine if a point is inside a cube */
 register CUBE  *cu;
 register FVECT  pt;