41 |
|
static RTREE **twigbundle; /* free twig blocks (NULL term.) */ |
42 |
|
static int nexttwig; /* next free twig */ |
43 |
|
|
44 |
+ |
static RTREE *newtwig(void); |
45 |
+ |
static void qtFreeTree(int really); |
46 |
+ |
static void shaketree(RTREE *tp); |
47 |
+ |
static int putleaf(int li, int drop); |
48 |
|
|
49 |
+ |
|
50 |
|
static RTREE * |
51 |
< |
newtwig() /* allocate a twig */ |
51 |
> |
newtwig(void) /* allocate a twig */ |
52 |
|
{ |
53 |
|
register int bi; |
54 |
|
|
73 |
|
return(twigbundle[bi] + (nexttwig++ - bi*TBUNDLESIZ)); |
74 |
|
memerr: |
75 |
|
error(SYSTEM, "out of memory in newtwig"); |
76 |
+ |
return NULL; /* pro forma return */ |
77 |
|
} |
78 |
|
|
79 |
|
|
80 |
< |
qtFreeTree(really) /* free allocated twigs */ |
81 |
< |
int really; |
80 |
> |
static void |
81 |
> |
qtFreeTree( /* free allocated twigs */ |
82 |
> |
int really |
83 |
> |
) |
84 |
|
{ |
85 |
|
register int i; |
86 |
|
|
105 |
|
#define LEAFSIZ (3*sizeof(float)+sizeof(int32)+\ |
106 |
|
sizeof(TMbright)+6*sizeof(BYTE)) |
107 |
|
|
108 |
< |
int |
109 |
< |
qtAllocLeaves(n) /* allocate space for n leaves */ |
110 |
< |
register int n; |
108 |
> |
extern int |
109 |
> |
qtAllocLeaves( /* allocate space for n leaves */ |
110 |
> |
register int n |
111 |
> |
) |
112 |
|
{ |
113 |
|
unsigned nbytes; |
114 |
|
register unsigned i; |
143 |
|
#undef LEAFSIZ |
144 |
|
|
145 |
|
|
146 |
< |
qtFreeLeaves() /* free our allocated leaves and twigs */ |
146 |
> |
extern void |
147 |
> |
qtFreeLeaves(void) /* free our allocated leaves and twigs */ |
148 |
|
{ |
149 |
|
qtFreeTree(1); /* free tree also */ |
150 |
|
if (qtL.nl <= 0) |
155 |
|
} |
156 |
|
|
157 |
|
|
158 |
< |
static |
159 |
< |
shaketree(tp) /* shake dead leaves from tree */ |
160 |
< |
register RTREE *tp; |
158 |
> |
static void |
159 |
> |
shaketree( /* shake dead leaves from tree */ |
160 |
> |
register RTREE *tp |
161 |
> |
) |
162 |
|
{ |
163 |
|
register int i, li; |
164 |
|
|
175 |
|
} |
176 |
|
|
177 |
|
|
178 |
< |
int |
179 |
< |
qtCompost(pct) /* free up some leaves */ |
180 |
< |
int pct; |
178 |
> |
extern int |
179 |
> |
qtCompost( /* free up some leaves */ |
180 |
> |
int pct |
181 |
> |
) |
182 |
|
{ |
183 |
|
register int32 *fl; |
184 |
|
int nused, nclear, nmapped; |
210 |
|
} |
211 |
|
|
212 |
|
|
213 |
< |
int |
214 |
< |
qtFindLeaf(x, y) /* find closest leaf to (x,y) */ |
215 |
< |
int x, y; |
213 |
> |
extern int |
214 |
> |
qtFindLeaf( /* find closest leaf to (x,y) */ |
215 |
> |
int x, |
216 |
> |
int y |
217 |
> |
) |
218 |
|
{ |
219 |
|
register RTREE *tp = &qtrunk; |
220 |
|
int li = -1; |
249 |
|
} |
250 |
|
|
251 |
|
|
252 |
< |
static |
253 |
< |
putleaf(li, drop) /* put a leaf in our tree */ |
254 |
< |
register int li; |
255 |
< |
int drop; |
252 |
> |
static int |
253 |
> |
putleaf( /* put a leaf in our tree */ |
254 |
> |
register int li, |
255 |
> |
int drop |
256 |
> |
) |
257 |
|
{ |
258 |
|
register RTREE *tp = &qtrunk; |
259 |
|
int x0=0, y0=0, x1=odev.hres, y1=odev.vres; |
347 |
|
} |
348 |
|
|
349 |
|
|
350 |
< |
dev_value(c, d, p) /* add a pixel value to our quadtree */ |
351 |
< |
COLR c; |
352 |
< |
FVECT d, p; |
350 |
> |
extern void |
351 |
> |
dev_value( /* add a pixel value to our quadtree */ |
352 |
> |
COLR c, |
353 |
> |
FVECT d, |
354 |
> |
FVECT p |
355 |
> |
) |
356 |
|
{ |
357 |
|
register int li; |
358 |
|
int mapit; |
387 |
|
} |
388 |
|
|
389 |
|
|
390 |
< |
qtReplant() /* replant our tree using new view */ |
390 |
> |
extern void |
391 |
> |
qtReplant(void) /* replant our tree using new view */ |
392 |
|
{ |
393 |
|
register int i; |
394 |
|
/* anything to replant? */ |
403 |
|
} |
404 |
|
|
405 |
|
|
406 |
< |
qtMapLeaves(redo) /* map our leaves to RGB */ |
407 |
< |
int redo; |
406 |
> |
extern int |
407 |
> |
qtMapLeaves( /* map our leaves to RGB */ |
408 |
> |
int redo |
409 |
> |
) |
410 |
|
{ |
411 |
|
int aorg, alen, borg, blen; |
412 |
|
/* recompute mapping? */ |