5 |
|
* Quadtree driver support routines. |
6 |
|
*/ |
7 |
|
|
8 |
+ |
#include <string.h> |
9 |
+ |
|
10 |
|
#include "standard.h" |
11 |
|
#include "rhd_qtree.h" |
12 |
|
/* quantity of leaves to free at a time */ |
83 |
|
nexttwig = 0; |
84 |
|
if (!really) { /* just clear allocated blocks */ |
85 |
|
while (i--) |
86 |
< |
bzero((char *)twigbundle[i], TBUNDLESIZ*sizeof(RTREE)); |
86 |
> |
memset((char *)twigbundle[i], '\0', TBUNDLESIZ*sizeof(RTREE)); |
87 |
|
return; |
88 |
|
} |
89 |
|
/* else "really" means free up memory */ |
319 |
|
tp->k[q].li = lo; |
320 |
|
} |
321 |
|
dropit: |
322 |
< |
if (drop) |
322 |
> |
if (drop) { |
323 |
|
if (li+1 == (qtL.tl ? qtL.tl : qtL.nl)) |
324 |
|
qtL.tl = li; /* special case */ |
325 |
|
else { |
327 |
|
qtL.wd[li] = falleaves; |
328 |
|
falleaves = li; |
329 |
|
} |
330 |
+ |
} |
331 |
|
return(li == lo); |
332 |
|
} |
333 |
|
|