1 |
– |
/* Copyright (c) 1997 Silicon Graphics, Inc. */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ SGI"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* Quadtree driver support routines. |
6 |
|
*/ |
26 |
|
int qtMinNodesiz = 2; /* minimum node dimension (pixels) */ |
27 |
|
struct rleaves qtL; /* our pile of leaves */ |
28 |
|
|
29 |
+ |
int rayqleft = 0; /* rays left to queue before flush */ |
30 |
+ |
|
31 |
+ |
static int4 falleaves; /* our list of fallen leaves */ |
32 |
+ |
|
33 |
+ |
#define composted(li) (qtL.bl <= qtL.tl ? \ |
34 |
+ |
((li) < qtL.bl || (li) >= qtL.tl) : \ |
35 |
+ |
((li) < qtL.bl && (li) >= qtL.tl)) |
36 |
+ |
|
37 |
|
#define TBUNDLESIZ 409 /* number of twigs in a bundle */ |
38 |
|
|
39 |
|
static RTREE **twigbundle; /* free twig blocks (NULL term.) */ |
86 |
|
} |
87 |
|
/* else "really" means free up memory */ |
88 |
|
for (i = 0; twigbundle[i] != NULL; i++) |
89 |
< |
free((char *)twigbundle[i]); |
90 |
< |
free((char *)twigbundle); |
89 |
> |
free((void *)twigbundle[i]); |
90 |
> |
free((void *)twigbundle); |
91 |
|
twigbundle = NULL; |
92 |
|
} |
93 |
|
|
125 |
|
qtL.rgb = (BYTE (*)[3])(qtL.chr + n); |
126 |
|
qtL.nl = n; |
127 |
|
qtL.tml = qtL.bl = qtL.tl = 0; |
128 |
+ |
falleaves = -1; |
129 |
|
return(n); |
130 |
|
} |
131 |
|
|
156 |
|
tp->flgs &= ~BRF(i); |
157 |
|
} else if (tp->flgs & LFF(i)) { |
158 |
|
li = tp->k[i].li; |
159 |
< |
if (qtL.bl < qtL.tl ? |
154 |
< |
(li < qtL.bl || li >= qtL.tl) : |
155 |
< |
(li < qtL.bl && li >= qtL.tl)) |
159 |
> |
if (composted(li)) |
160 |
|
tp->flgs &= ~LFF(i); |
161 |
|
} |
162 |
|
} |
166 |
|
qtCompost(pct) /* free up some leaves */ |
167 |
|
int pct; |
168 |
|
{ |
169 |
+ |
register int4 *fl; |
170 |
|
int nused, nclear, nmapped; |
166 |
– |
|
171 |
|
/* figure out how many leaves to clear */ |
172 |
|
nclear = qtL.nl * pct / 100; |
173 |
|
nused = qtL.tl - qtL.bl; |
178 |
|
if (nclear >= nused) { /* clear them all */ |
179 |
|
qtFreeTree(0); |
180 |
|
qtL.tml = qtL.bl = qtL.tl = 0; |
181 |
+ |
falleaves = -1; |
182 |
|
return(nused); |
183 |
|
} |
184 |
|
/* else clear leaves from bottom */ |
187 |
|
qtL.bl += nclear; |
188 |
|
if (qtL.bl >= qtL.nl) qtL.bl -= qtL.nl; |
189 |
|
if (nmapped <= nclear) qtL.tml = qtL.bl; |
190 |
< |
shaketree(&qtrunk); |
190 |
> |
shaketree(&qtrunk); /* dereference composted leaves */ |
191 |
> |
for (fl = &falleaves; *fl >= 0; fl = qtL.wd + *fl) |
192 |
> |
while (composted(*fl)) |
193 |
> |
if ((*fl = qtL.wd[*fl]) < 0) |
194 |
> |
return(nclear); |
195 |
|
return(nclear); |
196 |
|
} |
197 |
|
|
234 |
|
|
235 |
|
|
236 |
|
static |
237 |
< |
addleaf(li) /* add a leaf to our tree */ |
238 |
< |
int li; |
237 |
> |
putleaf(li, drop) /* put a leaf in our tree */ |
238 |
> |
register int li; |
239 |
> |
int drop; |
240 |
|
{ |
241 |
|
register RTREE *tp = &qtrunk; |
242 |
|
int x0=0, y0=0, x1=odev.hres, y1=odev.vres; |
243 |
< |
int lo = -1; |
243 |
> |
register int lo = -1; |
244 |
|
double d2; |
245 |
|
int x, y, mx, my; |
246 |
|
double z; |
247 |
|
FVECT ip, wp, vd; |
248 |
|
register int q; |
249 |
+ |
/* check for dead leaf */ |
250 |
+ |
if (!qtL.chr[li][1] && !(qtL.chr[li][0] | qtL.chr[li][2])) |
251 |
+ |
return(0); |
252 |
|
/* compute leaf location in view */ |
253 |
|
VCOPY(wp, qtL.wp[li]); |
254 |
|
viewloc(ip, &odev.v, wp); |
255 |
|
if (ip[2] <= 0. || ip[0] < 0. || ip[0] >= 1. |
256 |
|
|| ip[1] < 0. || ip[1] >= 1.) |
257 |
< |
return(-1); /* behind or outside view */ |
257 |
> |
goto dropit; /* behind or outside view */ |
258 |
|
#ifdef DEBUG |
259 |
|
if (odev.v.type == VT_PAR | odev.v.vfore > FTINY) |
260 |
< |
error(INTERNAL, "bad view assumption in addleaf"); |
260 |
> |
error(INTERNAL, "bad view assumption in putleaf"); |
261 |
|
#endif |
262 |
|
for (q = 0; q < 3; q++) |
263 |
|
vd[q] = (wp[q] - odev.v.vp[q])/ip[2]; |
264 |
|
d2 = fdir2diff(qtL.wd[li], vd); |
265 |
|
#ifdef MAXDIFF2 |
266 |
|
if (d2 > MAXDIFF2) |
267 |
< |
return(0); /* leaf dir. too far off */ |
267 |
> |
goto dropit; /* leaf dir. too far off */ |
268 |
|
#endif |
269 |
|
x = ip[0] * odev.hres; |
270 |
|
y = ip[1] * odev.vres; |
286 |
|
if (!(tp->flgs & LFF(q))) { /* found stem for leaf */ |
287 |
|
tp->k[q].li = li; |
288 |
|
tp->flgs |= CHLFF(q); |
289 |
< |
break; |
289 |
> |
return(1); |
290 |
|
} |
291 |
|
if (lo != tp->k[q].li) { /* check old leaf */ |
292 |
|
lo = tp->k[q].li; |
296 |
|
/* is node minimum size? */ |
297 |
|
if (y1-y0 <= qtMinNodesiz || x1-x0 <= qtMinNodesiz) { |
298 |
|
if (z > (1.+qtDepthEps)*ip[2]) |
299 |
< |
return(0); /* old one closer */ |
299 |
> |
break; /* old one closer */ |
300 |
|
if (z >= (1.-qtDepthEps)*ip[2] && |
301 |
|
fdir2diff(qtL.wd[lo], vd) < d2) |
302 |
< |
return(0); /* old one better */ |
303 |
< |
tp->k[q].li = li; /* else new one is */ |
302 |
> |
break; /* old one better */ |
303 |
> |
tp->k[q].li = li; /* attach new */ |
304 |
|
tp->flgs |= CHF(q); |
305 |
+ |
li = lo; /* drop old... */ |
306 |
|
break; |
307 |
|
} |
308 |
|
tp->flgs &= ~LFF(q); /* else grow tree */ |
316 |
|
tp->flgs = CH_ANY|LFF(q); /* all new */ |
317 |
|
tp->k[q].li = lo; |
318 |
|
} |
319 |
< |
return(1); /* done */ |
319 |
> |
dropit: |
320 |
> |
if (drop) |
321 |
> |
if (li+1 == (qtL.tl ? qtL.tl : qtL.nl)) |
322 |
> |
qtL.tl = li; /* special case */ |
323 |
> |
else { |
324 |
> |
qtL.chr[li][0] = qtL.chr[li][1] = qtL.chr[li][2] = 0; |
325 |
> |
qtL.wd[li] = falleaves; |
326 |
> |
falleaves = li; |
327 |
> |
} |
328 |
> |
return(li == lo); |
329 |
|
} |
330 |
|
|
331 |
|
|
332 |
< |
dev_value(c, p, v) /* add a pixel value to our quadtree */ |
332 |
> |
dev_value(c, d, p) /* add a pixel value to our quadtree */ |
333 |
|
COLR c; |
334 |
< |
FVECT p, v; |
334 |
> |
FVECT d, p; |
335 |
|
{ |
336 |
|
register int li; |
337 |
< |
|
338 |
< |
li = qtL.tl++; |
339 |
< |
if (qtL.tl >= qtL.nl) /* advance to next leaf in ring */ |
340 |
< |
qtL.tl = 0; |
341 |
< |
if (qtL.tl == qtL.bl) /* need to shake some free */ |
342 |
< |
qtCompost(LFREEPCT); |
343 |
< |
VCOPY(qtL.wp[li], p); |
344 |
< |
qtL.wd[li] = encodedir(v); |
337 |
> |
int mapit; |
338 |
> |
/* grab a leaf */ |
339 |
> |
if (!imm_mode && falleaves >= 0) { /* check for fallen leaves */ |
340 |
> |
li = falleaves; |
341 |
> |
falleaves = qtL.wd[li]; |
342 |
> |
mapit = qtL.tml <= qtL.tl ? |
343 |
> |
(li < qtL.tml || li >= qtL.tl) : |
344 |
> |
(li < qtL.tml && li >= qtL.tl) ; |
345 |
> |
} else { /* else allocate new one */ |
346 |
> |
li = qtL.tl++; |
347 |
> |
if (qtL.tl >= qtL.nl) /* next leaf in ring */ |
348 |
> |
qtL.tl = 0; |
349 |
> |
if (qtL.tl == qtL.bl) /* need to shake some free */ |
350 |
> |
qtCompost(LFREEPCT); |
351 |
> |
mapit = 0; /* we'll map it later */ |
352 |
> |
} |
353 |
> |
if (p == NULL) |
354 |
> |
VSUM(qtL.wp[li], odev.v.vp, d, FHUGE); |
355 |
> |
else |
356 |
> |
VCOPY(qtL.wp[li], p); |
357 |
> |
qtL.wd[li] = encodedir(d); |
358 |
|
tmCvColrs(&qtL.brt[li], qtL.chr[li], c, 1); |
359 |
< |
if (!addleaf(li)) |
360 |
< |
qtL.tl = li; /* unget this leaf */ |
359 |
> |
if (putleaf(li, 1)) { |
360 |
> |
if (mapit) |
361 |
> |
tmMapPixels(qtL.rgb+li, qtL.brt+li, qtL.chr+li, 1); |
362 |
> |
if (--rayqleft == 0) |
363 |
> |
dev_flush(); /* flush output */ |
364 |
> |
} |
365 |
|
} |
366 |
|
|
367 |
|
|
374 |
|
qtFreeTree(0); /* blow the old tree away */ |
375 |
|
/* regrow it in new place */ |
376 |
|
for (i = qtL.bl; i != qtL.tl; ) { |
377 |
< |
addleaf(i); |
377 |
> |
putleaf(i, 0); |
378 |
|
if (++i >= qtL.nl) i = 0; |
379 |
|
} |
380 |
|
} |