1 |
– |
/* Copyright (c) 1998 Silicon Graphics, Inc. */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ SGI"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* Routines for drawing samples using depth buffer checks. |
6 |
|
*/ |
7 |
|
|
8 |
|
#include "standard.h" |
9 |
|
|
13 |
– |
#include <sys/types.h> |
10 |
|
#include <GL/glx.h> |
11 |
|
#include <GL/glu.h> |
12 |
|
|
17 |
– |
#include "random.h" |
13 |
|
#include "rhd_odraw.h" |
14 |
|
|
15 |
|
#ifndef DEPTHEPS |
21 |
|
#ifndef SFREEFRAC |
22 |
|
#define SFREEFRAC 0.2 /* fraction to free at a time */ |
23 |
|
#endif |
24 |
+ |
#ifndef REDRAWTHRESH |
25 |
+ |
#define REDRAWTHRESH 10240 /* number of samples for dissolve */ |
26 |
+ |
#endif |
27 |
|
#ifndef MAXFAN |
28 |
|
#define MAXFAN 32 /* maximum arms in a triangle fan */ |
29 |
|
#endif |
56 |
|
int nbytes, i, j, k, nextsamp, count, blockdiv; |
57 |
|
int res[2]; |
58 |
|
|
59 |
< |
if (odNViews) { /* deallocate view structures */ |
60 |
< |
for (i = 0; i < odNViews; i++) { |
61 |
< |
free((char *)odView[i].bmap); |
59 |
> |
if (odNViews > 0) { /* deallocate view structures */ |
60 |
> |
for (i = odNViews; i--; ) { |
61 |
> |
free((void *)odView[i].bmap); |
62 |
> |
free((void *)odView[i].pmap); |
63 |
|
if (odView[i].emap != NULL) |
64 |
< |
free((char *)odView[i].emap); |
64 |
> |
free((void *)odView[i].emap); |
65 |
|
} |
66 |
< |
free((char *)odView); |
66 |
> |
free((void *)odView); |
67 |
|
odView = NULL; |
68 |
|
odNViews = 0; |
69 |
|
} |
108 |
|
if (blockdiv < 8) blockdiv = 8; |
109 |
|
nextsamp = 0; count /= blockdiv*blockdiv; /* # blocks */ |
110 |
|
while (i--) { /* initialize each view */ |
112 |
– |
odView[i].emap = NULL; |
113 |
– |
odView[i].dmap = NULL; |
111 |
|
dev_auxview(i, res); |
112 |
|
odView[i].hhi = res[0]; |
113 |
|
odView[i].hlow = (res[0] + blockdiv/2) / blockdiv; |
115 |
|
odView[i].vhi = res[1]; |
116 |
|
odView[i].vlow = (res[1] + blockdiv/2) / blockdiv; |
117 |
|
if (odView[i].vlow < 1) odView[i].vlow = 1; |
118 |
+ |
odView[i].emap = NULL; |
119 |
+ |
odView[i].dmap = NULL; |
120 |
+ |
odView[i].pmap = (int4 *)calloc(FL4NELS(res[0]*res[1]), |
121 |
+ |
sizeof(int4)); |
122 |
+ |
if (odView[i].pmap == NULL) |
123 |
+ |
return(0); |
124 |
|
j = odView[i].hlow*odView[i].vlow; |
125 |
|
odView[i].bmap = (struct ODblock *)malloc( |
126 |
|
j * sizeof(struct ODblock)); |
129 |
|
DCHECK(count<=0 | nextsamp>=n, |
130 |
|
CONSISTENCY, "counter botch in odInit"); |
131 |
|
if (!i) count = j; |
132 |
+ |
odView[i].sfirst = nextsamp; |
133 |
|
while (j--) { /* initialize blocks & free lists */ |
134 |
|
odView[i].bmap[j].pthresh = FHUGE; |
135 |
|
odView[i].bmap[j].first = k = nextsamp; |
141 |
|
odS.nextfree(k-1) = ENDFREE; |
142 |
|
odView[i].bmap[j].nused = 0; |
143 |
|
} |
144 |
+ |
odView[i].snext = nextsamp; |
145 |
+ |
odView[i].n2redraw = 0; |
146 |
|
} |
147 |
|
CLR4ALL(odS.redraw, odS.nsamp); /* clear redraw flags */ |
148 |
|
for (i = odS.nsamp; i--; ) { /* clear values */ |
185 |
|
if (prox > bp->pthresh) |
186 |
|
return(-1); /* worse than free list occupants */ |
187 |
|
/* check for duplicate pixel */ |
188 |
< |
for (i = bp->first+bp->nsamp; i-- > bp->first; ) |
188 |
> |
if (CHK4(odView[vn].pmap, vh*odView[vn].hhi + hh)) |
189 |
> |
i = bp->first + bp->nsamp; |
190 |
> |
else |
191 |
> |
i = 0; |
192 |
> |
while (i-- > bp->first) |
193 |
|
if (hh == odS.ip[i][0] && vh == odS.ip[i][1]) { /* found it! */ |
194 |
|
/* search free list for it */ |
195 |
|
if (i == bp->free) |
203 |
|
bp->nused++; |
204 |
|
goto gotit; |
205 |
|
} |
206 |
< |
if (prox >= 0.999*odS.closeness(i)) |
206 |
> |
if (prox >= 0.99*odS.closeness(i)) |
207 |
|
return(-1); /* previous sample is fine */ |
208 |
|
goto gotit; |
209 |
|
} |
210 |
|
if (bp->free != ENDFREE) { /* allocate from free list */ |
211 |
|
i = bp->free; |
212 |
+ |
if (odS.ip[i][0] >= 0 & odS.ip[i][1] >= 0) |
213 |
+ |
CLR4(odView[vn].pmap, odS.ip[i][1]*odView[vn].hhi + |
214 |
+ |
odS.ip[i][0]); |
215 |
|
bp->free = odS.nextfree(i); |
216 |
|
bp->nused++; |
217 |
|
goto gotit; |
235 |
|
bp->nused--; |
236 |
|
} |
237 |
|
i = si[0]; /* use worst sample */ |
238 |
+ |
CLR4(odView[vn].pmap, odS.ip[i][1]*odView[vn].hhi + odS.ip[i][0]); |
239 |
|
gotit: |
240 |
|
odS.ip[i][0] = hh; |
241 |
|
odS.ip[i][1] = vh; |
242 |
|
odS.closeness(i) = prox; |
243 |
+ |
SET4(odView[vn].pmap, vh*odView[vn].hhi + hh); |
244 |
|
return(i); |
245 |
|
} |
246 |
|
|
303 |
|
else /* else map it now */ |
304 |
|
tmMapPixels(odS.rgb[id], &odS.brt[id], odS.chr[id], 1); |
305 |
|
SET4(odS.redraw, id); /* mark for redraw */ |
306 |
+ |
odView[i].n2redraw++; |
307 |
|
} |
308 |
|
} |
309 |
|
|
317 |
|
} |
318 |
|
|
319 |
|
|
320 |
+ |
odRedrawAll() /* mark all samples for redraw */ |
321 |
+ |
{ |
322 |
+ |
register int i; |
323 |
+ |
|
324 |
+ |
if ((needmapping&(NEWMAP|NEWRGB)) == (NEWMAP|NEWRGB)) |
325 |
+ |
return; /* will be called later, anyway */ |
326 |
+ |
for (i = odS.nsamp; i--; ) |
327 |
+ |
if (odS.ip[i][0] >= 0) |
328 |
+ |
SET4(odS.redraw, i); |
329 |
+ |
/* not right, but not important */ |
330 |
+ |
for (i = 0; i < odNViews; i++) |
331 |
+ |
odView[i].n2redraw = odView[i].snext - odView[i].sfirst; |
332 |
+ |
} |
333 |
+ |
|
334 |
+ |
|
335 |
|
odRedraw(vn, hmin, vmin, hmax, vmax) /* redraw view region */ |
336 |
|
int vn, hmin, vmin, hmax, vmax; |
337 |
|
{ |
358 |
|
for (j = vmin; j <= vmax; j++) { |
359 |
|
bp = odView[vn].bmap + j*odView[vn].hlow + i; |
360 |
|
for (k = bp->nsamp; k--; ) |
361 |
< |
if (odS.ip[bp->first+k][0] >= 0) |
361 |
> |
if (odS.ip[bp->first+k][0] >= 0) { |
362 |
|
SET4(odS.redraw, bp->first+k); |
363 |
+ |
odView[vn].n2redraw++; |
364 |
+ |
} |
365 |
|
} |
366 |
|
} |
367 |
|
|
378 |
|
if (vn<0 | vn>=odNViews) |
379 |
|
return; /* too late -- they're gone! */ |
380 |
|
if (odView[vn].emap != NULL) |
381 |
< |
free((char *)odView[vn].emap); |
381 |
> |
free((void *)odView[vn].emap); |
382 |
|
odView[vn].emap = NULL; |
383 |
|
odView[vn].dmap = NULL; |
384 |
|
return; |
442 |
|
odUpdate(vn) /* update this view */ |
443 |
|
int vn; |
444 |
|
{ |
445 |
< |
int i, j; |
446 |
< |
register struct ODblock *bp; |
447 |
< |
register int k; |
445 |
> |
static short primes[] = {9431,6803,4177,2659,1609,887,587,251,47,1}; |
446 |
> |
int myprime; |
447 |
> |
register int i, n; |
448 |
|
|
449 |
|
DCHECK(vn<0 | vn>=odNViews, CONSISTENCY, |
450 |
|
"bad view number in odUpdate"); |
453 |
|
if (needmapping & NEWMAP) { |
454 |
|
if (needmapping & NEWHIST) |
455 |
|
tmClearHisto(); |
456 |
+ |
needmapping &= ~NEWHIST; |
457 |
|
if (tmAddHisto(odS.brt,odS.nsamp,1) != TM_E_OK) |
458 |
|
return; |
459 |
|
if (tmComputeMapping(0.,0.,0.) != TM_E_OK) |
460 |
|
return; |
461 |
< |
for (k = odS.nsamp; k--; ) /* redraw all */ |
462 |
< |
if (odS.ip[k][0] >= 0) |
429 |
< |
SET4(odS.redraw, k); |
461 |
> |
needmapping &= ~NEWMAP; |
462 |
> |
odRedrawAll(); /* redraw everything */ |
463 |
|
} |
464 |
|
if (tmMapPixels(odS.rgb,odS.brt,odS.chr,odS.nsamp) != TM_E_OK) |
465 |
|
return; |
466 |
< |
needmapping = 0; /* reset flag */ |
466 |
> |
needmapping &= ~NEWRGB; |
467 |
|
} |
468 |
< |
/* draw each block in view */ |
469 |
< |
for (j = odView[vn].vlow; j--; ) |
470 |
< |
for (i = 0; i < odView[vn].hlow; i++) { |
471 |
< |
/* get block */ |
472 |
< |
bp = odView[vn].bmap + j*odView[vn].hlow + i; |
473 |
< |
/* do quick, conservative flag check */ |
474 |
< |
for (k = (bp->first+bp->nsamp+31)>>5; |
475 |
< |
k-- > bp->first>>5; ) |
476 |
< |
if (odS.redraw[k]) |
477 |
< |
break; /* non-zero flag */ |
478 |
< |
if (k < bp->first>>5) |
479 |
< |
continue; /* no flags set */ |
480 |
< |
for (k = bp->nsamp; k--; ) /* sample by sample */ |
481 |
< |
if (CHK4(odS.redraw, bp->first+k)) { |
482 |
< |
odDrawBlockSamp(vn, i, j, bp->first+k); |
483 |
< |
CLR4(odS.redraw, bp->first+k); |
484 |
< |
} |
468 |
> |
if (odView[vn].n2redraw <= 0) |
469 |
> |
return; |
470 |
> |
#if REDRAWTHRESH |
471 |
> |
if (odView[vn].n2redraw < REDRAWTHRESH) |
472 |
> |
goto quickdraw; |
473 |
> |
/* pick a good prime step size */ |
474 |
> |
n = odView[vn].snext - odView[vn].sfirst; |
475 |
> |
for (i = 0; primes[i]<<5 >= n; i++) |
476 |
> |
; |
477 |
> |
while ((myprime = primes[i++]) > 1) |
478 |
> |
if (n % myprime) |
479 |
> |
break; |
480 |
> |
/* dissolve in new samples */ |
481 |
> |
for (i = odView[vn].sfirst; n-- > 0; i += myprime) { |
482 |
> |
if (i >= odView[vn].snext) |
483 |
> |
i -= odView[vn].snext - odView[vn].sfirst; |
484 |
> |
if (CHK4(odS.redraw, i)) { |
485 |
> |
odDrawSamp(vn, i); |
486 |
> |
CLR4(odS.redraw, i); |
487 |
|
} |
488 |
+ |
} |
489 |
+ |
odView[vn].n2redraw = 0; |
490 |
+ |
return; |
491 |
+ |
quickdraw: /* quicker sparse flag checking */ |
492 |
+ |
#endif |
493 |
+ |
/* redraw samples at end */ |
494 |
+ |
for (i = odView[vn].snext-31; i < odView[vn].snext; i++) |
495 |
+ |
if (CHK4(odS.redraw, i)) { |
496 |
+ |
odDrawSamp(vn, i); |
497 |
+ |
CLR4(odS.redraw, i); |
498 |
+ |
} |
499 |
+ |
/* faster flag checks in middle */ |
500 |
+ |
for (n = odView[vn].snext>>5; n-- > (odView[vn].sfirst+0x1f)>>5; ) |
501 |
+ |
for (i = 0; odS.redraw[n]; i++) /* skips faster */ |
502 |
+ |
if (odS.redraw[n] & 1L<<i) { |
503 |
+ |
odDrawSamp(vn, (n<<5)+i); |
504 |
+ |
odS.redraw[n] &= ~(1L<<i); |
505 |
+ |
} |
506 |
+ |
/* redraw samples at beginning */ |
507 |
+ |
for (i = odView[vn].sfirst; i < odView[vn].sfirst+31; i++) |
508 |
+ |
if (CHK4(odS.redraw, i)) { |
509 |
+ |
odDrawSamp(vn, i); |
510 |
+ |
CLR4(odS.redraw, i); |
511 |
+ |
} |
512 |
+ |
odView[vn].n2redraw = 0; |
513 |
|
} |
514 |
|
|
515 |
|
|
516 |
+ |
/* this turned out to be unnecessary */ |
517 |
|
#if 0 |
518 |
|
static |
519 |
|
clip_end(p, o, vp) /* clip line segment to view */ |
551 |
|
double sz; |
552 |
|
{ |
553 |
|
int na, dv; |
554 |
< |
double hrad, vrad, phi0, phi; |
554 |
> |
double hrad, vrad, phi; |
555 |
|
register int i; |
556 |
|
|
557 |
|
DCHECK(sz > 1, CONSISTENCY, "super-unary size in make_arms"); |
558 |
< |
na = MAXFAN*sz*sz + 0.5; /* keep area constant */ |
558 |
> |
na = MAXFAN*sz + 0.5; /* keep arc length constant */ |
559 |
|
if (na < MINFAN) na = MINFAN; |
560 |
|
hrad = FANSIZE*sz*vp->hhi/vp->hlow; |
561 |
|
vrad = FANSIZE*sz*vp->vhi/vp->vlow; |
562 |
|
if (hrad*vrad < 2.25) |
563 |
|
hrad = vrad = 1.5; |
503 |
– |
phi0 = (2.*PI) * frandom(); |
564 |
|
dv = OMAXDEPTH*sz + 0.5; |
565 |
|
for (i = 0; i < na; i++) { |
566 |
< |
phi = phi0 + (2.*PI)*i/na; |
566 |
> |
phi = (2.*PI)*i/na; |
567 |
|
ar[i][0] = cp[0] + tcos(phi)*hrad + 0.5; |
568 |
|
ar[i][1] = cp[1] + tsin(phi)*vrad + 0.5; |
569 |
|
ar[i][2] = dv; |
616 |
|
n = rise + run; |
617 |
|
while (n--) /* run out arm, checking depth */ |
618 |
|
if (run2 > rise2) { |
559 |
– |
if (depthchange(vp, x, y, x+xstep, y)) |
560 |
– |
break; |
619 |
|
x += xstep; |
620 |
|
rise2 += rise; |
621 |
< |
} else { |
564 |
< |
if (depthchange(vp, x, y, x, y+ystep)) |
621 |
> |
if (depthchange(vp, x-xstep, y, x, y)) |
622 |
|
break; |
623 |
+ |
} else { |
624 |
|
y += ystep; |
625 |
|
run2 += run; |
626 |
+ |
if (depthchange(vp, x, y-ystep, x, y)) |
627 |
+ |
break; |
628 |
|
} |
629 |
|
if (n < 0) /* found something? */ |
630 |
|
return; |
648 |
|
} |
649 |
|
|
650 |
|
|
651 |
< |
odDrawBlockSamp(vn, h, v, id) /* draw sample in view block */ |
652 |
< |
int vn, h, v; |
651 |
> |
static int |
652 |
> |
blockedge(vp, bi0, bi1) /* check for edge between blocks? */ |
653 |
> |
register struct ODview *vp; |
654 |
> |
register int bi0, bi1; |
655 |
> |
{ |
656 |
> |
if (bi1 == bi0) |
657 |
> |
return(0); /* same block */ |
658 |
> |
if (bi1 < 0) |
659 |
> |
return(1); /* end off view */ |
660 |
> |
if (CHK4(vp->emap, bi1)) |
661 |
> |
return(1); /* end block has edges */ |
662 |
> |
if (bi1 == bi0+1 || bi1 == bi0-1 || |
663 |
> |
bi1 == bi0+vp->hlow || bi1 == bi0-vp->hlow) |
664 |
> |
return(0); /* end in adjacent block -- no edges */ |
665 |
> |
return(1); /* conservative for rarer case */ |
666 |
> |
} |
667 |
> |
|
668 |
> |
|
669 |
> |
odDrawSamp(vn, id) /* draw view sample */ |
670 |
> |
int vn; |
671 |
|
register int id; |
672 |
|
{ |
673 |
|
GLshort arm[MAXFAN][3]; |
674 |
< |
int narms, blockindex, bi1; |
674 |
> |
int narms, blockindex; |
675 |
|
register struct ODview *vp; |
676 |
|
double size; |
677 |
|
int home_edges; |
678 |
|
register int i; |
679 |
|
|
680 |
|
vp = odView + vn; |
681 |
< |
blockindex = v*vp->hlow + h; |
682 |
< |
DCHECK(odS.ip[id][0]*vp->hlow/vp->hhi != h | |
605 |
< |
odS.ip[id][1]*vp->vlow/vp->vhi != v, |
606 |
< |
CONSISTENCY, "bad sample position in odDrawBlockSamp"); |
681 |
> |
blockindex = getblock(vp, odS.ip[id][0], odS.ip[id][1]); |
682 |
> |
DCHECK(blockindex<0, CONSISTENCY, "bad sample handed to odDrawSamp"); |
683 |
|
DCHECK(vp->bmap[blockindex].nused <= 0, |
684 |
< |
CONSISTENCY, "bad in-use count in odDrawBlockSamp"); |
684 |
> |
CONSISTENCY, "bad in-use count in odDrawSamp"); |
685 |
|
/* create triangle fan */ |
686 |
|
size = 1./sqrt((double)vp->bmap[blockindex].nused); |
687 |
|
narms = make_arms(arm, odS.ip[id], vp, size); |
688 |
|
if (vp->emap != NULL) { /* check for edge collisions */ |
689 |
|
home_edges = CHK4(vp->emap, blockindex); |
690 |
|
for (i = 0; i < narms; i++) |
691 |
< |
/* the following test is flawed, because we could |
692 |
< |
* be passing through a block on a diagonal run */ |
617 |
< |
if (home_edges || |
618 |
< |
( (bi1 = getblock(vp, arm[i][0], arm[i][1])) |
619 |
< |
!= blockindex && |
620 |
< |
(bi1 < 0 || CHK4(vp->emap, bi1)) )) |
691 |
> |
if (home_edges || blockedge(vp, blockindex, |
692 |
> |
getblock(vp, arm[i][0], arm[i][1]))) |
693 |
|
clip_edge(arm[i], odS.ip[id], vp); |
694 |
|
} |
695 |
|
/* draw triangle fan */ |