1 |
< |
/* Copyright (c) 1998 Silicon Graphics, Inc. */ |
1 |
> |
/* Copyright (c) 1999 Silicon Graphics, Inc. */ |
2 |
|
|
3 |
|
#ifndef lint |
4 |
|
static char SCCSid[] = "$SunId$ SGI"; |
10 |
|
|
11 |
|
#include "standard.h" |
12 |
|
|
13 |
– |
#include <sys/types.h> |
13 |
|
#include <GL/glx.h> |
14 |
|
#include <GL/glu.h> |
15 |
|
|
24 |
|
#ifndef SFREEFRAC |
25 |
|
#define SFREEFRAC 0.2 /* fraction to free at a time */ |
26 |
|
#endif |
27 |
+ |
#ifndef REDRAWTHRESH |
28 |
+ |
#define REDRAWTHRESH 10240 /* number of samples for dissolve */ |
29 |
+ |
#endif |
30 |
|
#ifndef MAXFAN |
31 |
|
#define MAXFAN 32 /* maximum arms in a triangle fan */ |
32 |
|
#endif |
145 |
|
odView[i].bmap[j].nused = 0; |
146 |
|
} |
147 |
|
odView[i].snext = nextsamp; |
148 |
+ |
odView[i].n2redraw = 0; |
149 |
|
} |
150 |
|
CLR4ALL(odS.redraw, odS.nsamp); /* clear redraw flags */ |
151 |
|
for (i = odS.nsamp; i--; ) { /* clear values */ |
191 |
|
if (CHK4(odView[vn].pmap, vh*odView[vn].hhi + hh)) |
192 |
|
i = bp->first + bp->nsamp; |
193 |
|
else |
194 |
< |
i = -1; |
194 |
> |
i = 0; |
195 |
|
while (i-- > bp->first) |
196 |
|
if (hh == odS.ip[i][0] && vh == odS.ip[i][1]) { /* found it! */ |
197 |
|
/* search free list for it */ |
206 |
|
bp->nused++; |
207 |
|
goto gotit; |
208 |
|
} |
209 |
< |
if (prox >= 0.999*odS.closeness(i)) |
209 |
> |
if (prox >= 0.99*odS.closeness(i)) |
210 |
|
return(-1); /* previous sample is fine */ |
211 |
|
goto gotit; |
212 |
|
} |
210 |
– |
DCHECK(i>=-1, WARNING, "pixel in presence map not found in block"); |
213 |
|
if (bp->free != ENDFREE) { /* allocate from free list */ |
214 |
|
i = bp->free; |
215 |
|
if (odS.ip[i][0] >= 0 & odS.ip[i][1] >= 0) |
306 |
|
else /* else map it now */ |
307 |
|
tmMapPixels(odS.rgb[id], &odS.brt[id], odS.chr[id], 1); |
308 |
|
SET4(odS.redraw, id); /* mark for redraw */ |
309 |
+ |
odView[i].n2redraw++; |
310 |
|
} |
311 |
|
} |
312 |
|
|
329 |
|
for (i = odS.nsamp; i--; ) |
330 |
|
if (odS.ip[i][0] >= 0) |
331 |
|
SET4(odS.redraw, i); |
332 |
+ |
/* not right, but not important */ |
333 |
+ |
for (i = 0; i < odNViews; i++) |
334 |
+ |
odView[i].n2redraw = odView[i].snext - odView[i].sfirst; |
335 |
|
} |
336 |
|
|
337 |
|
|
361 |
|
for (j = vmin; j <= vmax; j++) { |
362 |
|
bp = odView[vn].bmap + j*odView[vn].hlow + i; |
363 |
|
for (k = bp->nsamp; k--; ) |
364 |
< |
if (odS.ip[bp->first+k][0] >= 0) |
364 |
> |
if (odS.ip[bp->first+k][0] >= 0) { |
365 |
|
SET4(odS.redraw, bp->first+k); |
366 |
+ |
odView[vn].n2redraw++; |
367 |
+ |
} |
368 |
|
} |
369 |
|
} |
370 |
|
|
445 |
|
odUpdate(vn) /* update this view */ |
446 |
|
int vn; |
447 |
|
{ |
448 |
< |
register int i, j; |
448 |
> |
static short primes[] = {9431,6803,4177,2659,1609,887,587,251,47,1}; |
449 |
> |
int myprime; |
450 |
> |
register int i, n; |
451 |
|
|
452 |
|
DCHECK(vn<0 | vn>=odNViews, CONSISTENCY, |
453 |
|
"bad view number in odUpdate"); |
468 |
|
return; |
469 |
|
needmapping &= ~NEWRGB; |
470 |
|
} |
471 |
< |
/* this code segment was too slow */ |
472 |
< |
#if 0 |
473 |
< |
for (i = odView[vn].sfirst; i < odView[vn].snext; i++) |
471 |
> |
if (odView[vn].n2redraw <= 0) |
472 |
> |
return; |
473 |
> |
#if REDRAWTHRESH |
474 |
> |
if (odView[vn].n2redraw < REDRAWTHRESH) |
475 |
> |
goto quickdraw; |
476 |
> |
/* pick a good prime step size */ |
477 |
> |
n = odView[vn].snext - odView[vn].sfirst; |
478 |
> |
for (i = 0; primes[i]<<5 >= n; i++) |
479 |
> |
; |
480 |
> |
while ((myprime = primes[i++]) > 1) |
481 |
> |
if (n % myprime) |
482 |
> |
break; |
483 |
> |
/* dissolve in new samples */ |
484 |
> |
for (i = odView[vn].sfirst; n-- > 0; i += myprime) { |
485 |
> |
if (i >= odView[vn].snext) |
486 |
> |
i -= odView[vn].snext - odView[vn].sfirst; |
487 |
|
if (CHK4(odS.redraw, i)) { |
488 |
|
odDrawSamp(vn, i); |
489 |
|
CLR4(odS.redraw, i); |
490 |
|
} |
491 |
< |
#else |
492 |
< |
/* redraw samples at each end */ |
493 |
< |
for (i = odView[vn].sfirst; i < odView[vn].sfirst+31; i++) |
491 |
> |
} |
492 |
> |
odView[vn].n2redraw = 0; |
493 |
> |
return; |
494 |
> |
quickdraw: /* quicker sparse flag checking */ |
495 |
> |
#endif |
496 |
> |
/* redraw samples at end */ |
497 |
> |
for (i = odView[vn].snext-31; i < odView[vn].snext; i++) |
498 |
|
if (CHK4(odS.redraw, i)) { |
499 |
|
odDrawSamp(vn, i); |
500 |
|
CLR4(odS.redraw, i); |
501 |
|
} |
502 |
< |
for (i = odView[vn].snext-31; i < odView[vn].snext; i++) |
502 |
> |
/* faster flag checks in middle */ |
503 |
> |
for (n = odView[vn].snext>>5; n-- > (odView[vn].sfirst+0x1f)>>5; ) |
504 |
> |
for (i = 0; odS.redraw[n]; i++) /* skips faster */ |
505 |
> |
if (odS.redraw[n] & 1L<<i) { |
506 |
> |
odDrawSamp(vn, (n<<5)+i); |
507 |
> |
odS.redraw[n] &= ~(1L<<i); |
508 |
> |
} |
509 |
> |
/* redraw samples at beginning */ |
510 |
> |
for (i = odView[vn].sfirst; i < odView[vn].sfirst+31; i++) |
511 |
|
if (CHK4(odS.redraw, i)) { |
512 |
|
odDrawSamp(vn, i); |
513 |
|
CLR4(odS.redraw, i); |
514 |
|
} |
515 |
< |
/* faster flag checks in middle */ |
481 |
< |
for (j = odView[vn].snext>>5; j-- > (odView[vn].sfirst+0x1f)>>5; ) |
482 |
< |
for (i = 0; odS.redraw[j]; i++) /* skips faster */ |
483 |
< |
if (odS.redraw[j] & 1L<<i) { |
484 |
< |
odDrawSamp(vn, (j<<5)+i); |
485 |
< |
odS.redraw[j] &= ~(1L<<i); |
486 |
< |
} |
487 |
< |
#endif |
515 |
> |
odView[vn].n2redraw = 0; |
516 |
|
} |
517 |
|
|
518 |
|
|
558 |
|
register int i; |
559 |
|
|
560 |
|
DCHECK(sz > 1, CONSISTENCY, "super-unary size in make_arms"); |
561 |
< |
na = MAXFAN*sz*sz + 0.5; /* keep area constant */ |
561 |
> |
na = MAXFAN*sz + 0.5; /* keep arc length constant */ |
562 |
|
if (na < MINFAN) na = MINFAN; |
563 |
|
hrad = FANSIZE*sz*vp->hhi/vp->hlow; |
564 |
|
vrad = FANSIZE*sz*vp->vhi/vp->vlow; |
656 |
|
register struct ODview *vp; |
657 |
|
register int bi0, bi1; |
658 |
|
{ |
659 |
+ |
if (bi1 == bi0) |
660 |
+ |
return(0); /* same block */ |
661 |
|
if (bi1 < 0) |
662 |
|
return(1); /* end off view */ |
663 |
|
if (CHK4(vp->emap, bi1)) |
664 |
< |
return(1); /* end has edges */ |
664 |
> |
return(1); /* end block has edges */ |
665 |
|
if (bi1 == bi0+1 || bi1 == bi0-1 || |
666 |
|
bi1 == bi0+vp->hlow || bi1 == bi0-vp->hlow) |
667 |
|
return(0); /* end in adjacent block -- no edges */ |