| 33 |  | errno = 0; | 
| 34 |  | if (octbi(freet) >= MAXOBLK) | 
| 35 |  | return(EMPTY); | 
| 36 | < | if ((octblock[octbi(freet)] = (OCTREE *)malloc( | 
| 36 | > | if ((octblock[octbi(freet)] = (OCTREE *)bmalloc( | 
| 37 |  | (unsigned)256*8*sizeof(OCTREE))) == NULL) | 
| 38 |  | return(EMPTY); | 
| 39 |  | } | 
| 53 |  | octfree(octkid(ot, i)); | 
| 54 |  | octkid(ot, 0) = ofreelist; | 
| 55 |  | ofreelist = ot; | 
| 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 |  |  |