15 |
|
#include "octree.h" |
16 |
|
|
17 |
|
OCTREE *octblock[MAXOBLK]; /* our octree */ |
18 |
< |
static OCTREE ofreelist = EMPTY; /* free octree nodes */ |
18 |
> |
static OCTREE ofreelist = EMPTY; /* freed octree nodes */ |
19 |
|
static OCTREE treetop = 0; /* next free node */ |
20 |
|
|
21 |
|
|
33 |
|
errno = 0; |
34 |
|
if (octbi(freet) >= MAXOBLK) |
35 |
|
return(EMPTY); |
36 |
< |
if ((octblock[octbi(freet)] = (OCTREE *)malloc( |
37 |
< |
(unsigned)256*8*sizeof(OCTREE))) == NULL) |
36 |
> |
if ((octblock[octbi(freet)] = (OCTREE *)bmalloc( |
37 |
> |
(unsigned)OCTBLKSIZ*8*sizeof(OCTREE))) == NULL) |
38 |
|
return(EMPTY); |
39 |
|
} |
40 |
|
treetop += 8; |
56 |
|
} |
57 |
|
|
58 |
|
|
59 |
+ |
octdone() /* free EVERYTHING */ |
60 |
+ |
{ |
61 |
+ |
register int i; |
62 |
+ |
|
63 |
+ |
for (i = 0; i < MAXOBLK; i++) { |
64 |
+ |
if (octblock[i] == NULL) |
65 |
+ |
break; |
66 |
+ |
bfree((char *)octblock[i], (unsigned)256*8*sizeof(OCTREE)); |
67 |
+ |
octblock[i] = NULL; |
68 |
+ |
} |
69 |
+ |
ofreelist = EMPTY; |
70 |
+ |
treetop = 0; |
71 |
+ |
} |
72 |
+ |
|
73 |
+ |
|
74 |
|
OCTREE |
75 |
|
combine(ot) /* recursively combine nodes */ |
76 |
|
register OCTREE ot; |
84 |
|
for (i = 1; i < 8; i++) |
85 |
|
if ((octkid(ot, i) = combine(octkid(ot, i))) != ores) |
86 |
|
ores = ot; |
87 |
< |
if (!istree(ores)) /* all were identical leaves */ |
88 |
< |
octfree(ot); |
87 |
> |
if (!istree(ores)) { /* all were identical leaves */ |
88 |
> |
octkid(ot, 0) = ofreelist; |
89 |
> |
ofreelist = ot; |
90 |
> |
} |
91 |
|
return(ores); |
92 |
|
} |
93 |
|
|