| 1 |
< |
/* Copyright (c) 1997 Silicon Graphics, Inc. */ |
| 1 |
> |
/* Copyright (c) 1998 Silicon Graphics, Inc. */ |
| 2 |
|
|
| 3 |
|
#ifndef lint |
| 4 |
|
static char SCCSid[] = "$SunId$ SGI"; |
| 13 |
|
#include "rhdriver.h" |
| 14 |
|
|
| 15 |
|
#ifndef MAXDIST |
| 16 |
< |
#define MAXDIST 13 /* maximum distance outside section */ |
| 16 |
> |
#define MAXDIST 42 /* maximum distance outside section */ |
| 17 |
|
#endif |
| 18 |
|
|
| 19 |
+ |
#define MAXVOXEL 16 /* maximum number of active voxels */ |
| 20 |
+ |
|
| 21 |
|
extern GCOORD *getviewcells(); |
| 22 |
|
|
| 23 |
|
static VIEW dvw; /* current view corresponding to beam list */ |
| 27 |
|
int i[3]; /* voxel index (may be outside section) */ |
| 28 |
|
} VOXL; /* a voxel */ |
| 29 |
|
|
| 30 |
< |
static VOXL voxel[8] = { /* current voxel list */ |
| 29 |
< |
{-1}, {-1}, {-1}, {-1}, |
| 30 |
< |
{-1}, {-1}, {-1}, {-1} |
| 31 |
< |
}; |
| 30 |
> |
static VOXL voxel[MAXVOXEL] = {{-1}}; /* current voxel list */ |
| 31 |
|
|
| 32 |
|
#define CBEAMBLK 1024 /* cbeam allocation block size */ |
| 33 |
|
|
| 34 |
|
static struct beamcomp { |
| 35 |
< |
short wants; /* flags telling which voxels want us */ |
| 36 |
< |
short hd; /* holodeck section number */ |
| 35 |
> |
unsigned short wants; /* flags telling which voxels want us */ |
| 36 |
> |
unsigned short hd; /* holodeck section number */ |
| 37 |
|
int bi; /* beam index */ |
| 38 |
|
} *cbeam = NULL; /* current beam list */ |
| 39 |
|
|
| 93 |
|
|
| 94 |
|
if (!cb1->wants) /* put orphans at the end, unsorted */ |
| 95 |
|
return(cb2->wants); |
| 96 |
+ |
if (!cb2->wants) |
| 97 |
+ |
return(-1); |
| 98 |
|
if ((c = cb1->bi - cb2->bi)) /* sort on beam index first */ |
| 99 |
|
return(c); |
| 100 |
|
return(cb1->hd - cb2->hd); /* use hd to resolve matches */ |
| 163 |
|
} |
| 164 |
|
|
| 165 |
|
|
| 165 |
– |
cbeamadj(v, hr, vr) /* adjust our beam list */ |
| 166 |
– |
VIEW *v; |
| 167 |
– |
int hr, vr; |
| 168 |
– |
{ |
| 169 |
– |
register PACKHEAD *pa; |
| 170 |
– |
register int i; |
| 171 |
– |
int n; |
| 172 |
– |
/* first handle additions */ |
| 173 |
– |
pa = (PACKHEAD *)malloc(xcbeams*sizeof(PACKHEAD)); |
| 174 |
– |
if (xcbeams && pa == NULL) |
| 175 |
– |
goto memerr; |
| 176 |
– |
for (i = xcbeams; i--; ) { |
| 177 |
– |
pa[i].hd = cbeam[ncbeams+i].hd; |
| 178 |
– |
pa[i].bi = cbeam[ncbeams+i].bi; |
| 179 |
– |
pa[i].nr = npixels(v, hr, vr, hdlist[pa[i].hd], pa[i].bi); |
| 180 |
– |
} |
| 181 |
– |
n = xcbeams; /* now sort list for deletions */ |
| 182 |
– |
cbeamsort(0); |
| 183 |
– |
pa = (PACKHEAD *)realloc((char *)pa, (n+xcbeams)*sizeof(PACKHEAD)); |
| 184 |
– |
if (n+xcbeams && pa == NULL) |
| 185 |
– |
goto memerr; |
| 186 |
– |
for (i = xcbeams; i--; ) { |
| 187 |
– |
pa[n+i].hd = cbeam[ncbeams+i].hd; |
| 188 |
– |
pa[n+i].bi = cbeam[ncbeams+i].bi; |
| 189 |
– |
pa[n+i].nr = 0; |
| 190 |
– |
} |
| 191 |
– |
n += xcbeams; |
| 192 |
– |
xcbeams = 0; /* delete orphans */ |
| 193 |
– |
serv_request(DR_ADJSET, n*sizeof(PACKHEAD), (char *)pa); |
| 194 |
– |
free((char *)pa); |
| 195 |
– |
return; |
| 196 |
– |
memerr: |
| 197 |
– |
error(SYSTEM, "out of memory in cbeamadj"); |
| 198 |
– |
} |
| 199 |
– |
|
| 200 |
– |
|
| 166 |
|
cbeamop(op, bl, n, v, hr, vr) /* update beams on server list */ |
| 167 |
|
int op; |
| 168 |
|
register struct beamcomp *bl; |
| 183 |
|
pa[i].bi = bl[i].bi; |
| 184 |
|
pa[i].nr = v==NULL ? 0 : |
| 185 |
|
npixels(v, hr, vr, hdlist[bl[i].hd], bl[i].bi); |
| 186 |
+ |
pa[i].nc = 0; |
| 187 |
|
} |
| 188 |
|
serv_request(op, n*sizeof(PACKHEAD), (char *)pa); |
| 189 |
|
free((char *)pa); |
| 192 |
|
|
| 193 |
|
int |
| 194 |
|
set_voxels(vl, n) /* set new voxel array */ |
| 195 |
< |
VOXL vl[8]; |
| 195 |
> |
VOXL vl[MAXVOXEL]; |
| 196 |
|
int n; |
| 197 |
|
{ |
| 198 |
|
short wmap[256]; |
| 199 |
< |
int vmap[8]; |
| 199 |
> |
int vmap[MAXVOXEL]; |
| 200 |
|
int comn = 0; |
| 201 |
|
int no; |
| 202 |
|
register int i, j; |
| 203 |
|
/* find common voxels */ |
| 204 |
< |
for (j = 0; j < 8 && voxel[j].hd >= 0; j++) { |
| 204 |
> |
for (j = 0; j < MAXVOXEL && voxel[j].hd >= 0; j++) { |
| 205 |
|
vmap[j] = -1; |
| 206 |
|
for (i = n; i--; ) |
| 207 |
|
if (!bcmp((char *)(vl+i), (char *)(voxel+j), |
| 223 |
|
cbeam[i].wants = wmap[cbeam[i].wants]; |
| 224 |
|
/* update our voxel list */ |
| 225 |
|
bcopy((char *)vl, (char *)voxel, n*sizeof(VOXL)); |
| 226 |
< |
for (j = n; j < 8; j++) |
| 227 |
< |
voxel[j].hd = -1; |
| 226 |
> |
if (n < MAXVOXEL) |
| 227 |
> |
voxel[n].hd = -1; |
| 228 |
|
return(comn); /* return bit array of common voxels */ |
| 229 |
|
} |
| 230 |
|
|
| 231 |
|
|
| 232 |
|
int |
| 233 |
|
get_voxels(vl, vp) /* find voxels corresponding to view point */ |
| 234 |
< |
VOXL vl[8]; |
| 234 |
> |
VOXL vl[MAXVOXEL]; |
| 235 |
|
FVECT vp; |
| 236 |
|
{ |
| 237 |
< |
static int lastn = 0, lastd = -1; |
| 272 |
< |
int n = 0; |
| 237 |
> |
int first, n; |
| 238 |
|
FVECT gp; |
| 239 |
|
double d; |
| 240 |
|
int dist, bestd = 0x7fff; |
| 241 |
|
VOXL vox; |
| 242 |
|
register int i, j, k; |
| 243 |
+ |
/* count voxels in list already */ |
| 244 |
+ |
for (first = 0; first < MAXVOXEL && vl[first].hd >= 0; first++) |
| 245 |
+ |
; |
| 246 |
|
/* find closest voxels */ |
| 247 |
< |
for (i = 0; n < 8 && hdlist[i]; i++) { |
| 247 |
> |
for (n = first, i = 0; n < MAXVOXEL && hdlist[i]; i++) { |
| 248 |
|
hdgrid(gp, hdlist[i], vp); |
| 249 |
< |
for (j = 0; n < 8 && j < 8; j++) { |
| 249 |
> |
for (j = 0; n < MAXVOXEL && j < 8; j++) { |
| 250 |
|
dist = 0; |
| 251 |
|
for (k = 0; k < 3; k++) { |
| 252 |
|
d = gp[k] - .5 + (j>>k & 1); |
| 259 |
|
if (dist > bestd) /* others were closer */ |
| 260 |
|
continue; |
| 261 |
|
if (dist < bestd) { /* start closer list */ |
| 262 |
< |
n = 0; |
| 262 |
> |
n = first; |
| 263 |
|
bestd = dist; |
| 264 |
|
} |
| 265 |
+ |
/* check if already in list */ |
| 266 |
+ |
for (k = first; k--; ) |
| 267 |
+ |
if (vl[k].hd == i && |
| 268 |
+ |
vl[k].i[0] == vox.i[0] && |
| 269 |
+ |
vl[k].i[1] == vox.i[1] && |
| 270 |
+ |
vl[k].i[2] == vox.i[2]) |
| 271 |
+ |
break; |
| 272 |
+ |
if (k >= 0) |
| 273 |
+ |
continue; |
| 274 |
|
vox.hd = i; /* add this voxel */ |
| 275 |
|
copystruct(&vl[n], &vox); |
| 276 |
|
n++; |
| 278 |
|
} |
| 279 |
|
/* check for really stupid move */ |
| 280 |
|
if (bestd > MAXDIST) { |
| 281 |
< |
error(WARNING, "move to outer solar system"); |
| 281 |
> |
error(COMMAND, "move past outer limits"); |
| 282 |
|
return(0); |
| 283 |
|
} |
| 284 |
< |
/* warn of dangerous moves */ |
| 285 |
< |
if (n < lastn && bestd >= lastd) |
| 286 |
< |
error(WARNING, "moving outside holodeck section"); |
| 310 |
< |
else if (n > lastn && bestd <= lastd) |
| 311 |
< |
error(WARNING, "moving inside holodeck section"); |
| 312 |
< |
lastd = bestd; |
| 313 |
< |
return(lastn = n); |
| 284 |
> |
if (n < MAXVOXEL) |
| 285 |
> |
vl[n].hd = -1; |
| 286 |
> |
return(n); |
| 287 |
|
} |
| 288 |
|
|
| 289 |
|
|
| 325 |
|
GCOORD *gcp; |
| 326 |
|
register struct cellact *cap; |
| 327 |
|
{ |
| 328 |
+ |
register HOLO *hp = hdlist[voxel[cap->vi].hd]; |
| 329 |
|
FVECT org, dir[4]; |
| 330 |
< |
FVECT gp, cv[4], vc; |
| 330 |
> |
FVECT vgp, cgp, vc; |
| 331 |
> |
FVECT v1, v2; |
| 332 |
|
struct beamact bo; |
| 333 |
+ |
int axmax, j; |
| 334 |
+ |
double d, avmax; |
| 335 |
|
register int i; |
| 336 |
< |
/* compute cell vertices */ |
| 337 |
< |
hdcell(cv, hdlist[voxel[cap->vi].hd], gcp); |
| 338 |
< |
/* compute cell and voxel centers */ |
| 339 |
< |
for (i = 0; i < 3; i++) { |
| 340 |
< |
org[i] = 0.5*(cv[0][i] + cv[2][i]); |
| 341 |
< |
gp[i] = voxel[cap->vi].i[i] + 0.5; |
| 342 |
< |
} |
| 343 |
< |
hdworld(vc, hdlist[voxel[cap->vi].hd], gp); |
| 344 |
< |
/* compute voxel pyramid using vector trick */ |
| 345 |
< |
for (i = 0; i < 3; i++) { |
| 346 |
< |
dir[0][i] = vc[i] - cv[0][i]; /* to 3 */ |
| 347 |
< |
dir[2][i] = vc[i] - cv[3][i]; /* to 0 */ |
| 348 |
< |
if (gcp->w & 1) { /* watch vertex order! */ |
| 349 |
< |
dir[1][i] = vc[i] - cv[2][i]; /* to 1 */ |
| 350 |
< |
dir[3][i] = vc[i] - cv[1][i]; /* to 2 */ |
| 351 |
< |
} else { |
| 352 |
< |
dir[1][i] = vc[i] - cv[1][i]; /* to 2 */ |
| 353 |
< |
dir[3][i] = vc[i] - cv[2][i]; /* to 1 */ |
| 336 |
> |
/* compute cell center */ |
| 337 |
> |
cgp[gcp->w>>1] = gcp->w&1 ? hp->grid[gcp->w>>1] : 0 ; |
| 338 |
> |
cgp[hdwg0[gcp->w]] = gcp->i[0] + .5; |
| 339 |
> |
cgp[hdwg1[gcp->w]] = gcp->i[1] + .5; |
| 340 |
> |
hdworld(org, hp, cgp); |
| 341 |
> |
/* compute direction to voxel center */ |
| 342 |
> |
for (i = 3; i--; ) |
| 343 |
> |
vgp[i] = voxel[cap->vi].i[i] + .5; |
| 344 |
> |
hdworld(vc, hp, vgp); |
| 345 |
> |
for (i = 3; i--; ) |
| 346 |
> |
vc[i] -= org[i]; |
| 347 |
> |
/* compute maximum area axis */ |
| 348 |
> |
axmax = -1; avmax = 0; |
| 349 |
> |
for (i = 3; i--; ) { |
| 350 |
> |
d = vgp[i] - cgp[i]; |
| 351 |
> |
if (d < 0.) d = -d; |
| 352 |
> |
if (d > avmax) { |
| 353 |
> |
avmax = d; |
| 354 |
> |
axmax = i; |
| 355 |
|
} |
| 356 |
|
} |
| 357 |
+ |
#ifdef DEBUG |
| 358 |
+ |
if (axmax < 0.) |
| 359 |
+ |
error(CONSISTENCY, "botched axis computation in docell"); |
| 360 |
+ |
#endif |
| 361 |
+ |
/* compute offset vectors */ |
| 362 |
+ |
d = 0.5/hp->grid[j=(axmax+1)%3]; |
| 363 |
+ |
for (i = 3; i--; ) |
| 364 |
+ |
v1[i] = hp->xv[j][i] * d; |
| 365 |
+ |
d = 0.5/hp->grid[j=(axmax+2)%3]; |
| 366 |
+ |
if (DOT(hp->wg[axmax], vc) < 0.) |
| 367 |
+ |
d = -d; /* reverse vertex order */ |
| 368 |
+ |
for (i = 3; i--; ) |
| 369 |
+ |
v2[i] = hp->xv[j][i] * d; |
| 370 |
+ |
/* compute voxel pyramid */ |
| 371 |
+ |
for (i = 3; i--; ) { |
| 372 |
+ |
dir[0][i] = vc[i] - v1[i] - v2[i]; |
| 373 |
+ |
dir[1][i] = vc[i] + v1[i] - v2[i]; |
| 374 |
+ |
dir[2][i] = vc[i] + v1[i] + v2[i]; |
| 375 |
+ |
dir[3][i] = vc[i] - v1[i] + v2[i]; |
| 376 |
+ |
} |
| 377 |
|
/* visit beams for opposite cells */ |
| 378 |
|
copystruct(&bo.ca, cap); |
| 379 |
|
copystruct(&bo.gc, gcp); |
| 380 |
< |
return(visit_cells(org, dir, hdlist[voxel[cap->vi].hd], dobeam, &bo)); |
| 380 |
> |
return(visit_cells(org, dir, hp, dobeam, &bo)); |
| 381 |
|
} |
| 382 |
|
|
| 383 |
|
|
| 405 |
|
int netchange = 0; |
| 406 |
|
struct cellact oca, nca; |
| 407 |
|
int ocnt, ncnt; |
| 408 |
< |
int c; |
| 408 |
> |
int nmatch = 0; |
| 409 |
|
GCOORD *ogcl, *ngcl; |
| 410 |
+ |
register int c; |
| 411 |
|
register GCOORD *ogcp, *ngcp; |
| 412 |
|
/* get old and new cell lists */ |
| 413 |
|
ogcp = ogcl = getviewcells(&ocnt, hdlist[voxel[voxi].hd], vold); |
| 414 |
|
ngcp = ngcl = getviewcells(&ncnt, hdlist[voxel[voxi].hd], vnew); |
| 415 |
|
/* set up actions */ |
| 416 |
|
oca.vi = nca.vi = voxi; |
| 418 |
– |
oca.rev = nca.rev = 0; |
| 417 |
|
oca.add = 0; nca.add = 1; |
| 418 |
|
if ((oca.rev = ocnt < 0)) |
| 419 |
|
ocnt = -ocnt; |
| 420 |
|
if ((nca.rev = ncnt < 0)) |
| 421 |
|
ncnt = -ncnt; |
| 422 |
< |
if (nca.rev == oca.rev) /* add and delete cells in order */ |
| 423 |
< |
while (ocnt > 0 & ncnt > 0) |
| 424 |
< |
if ((c = cellcmp(ogcp, ngcp)) > 0) { /* new cell */ |
| 425 |
< |
netchange += docell(ngcp++, &nca); |
| 426 |
< |
ncnt--; |
| 427 |
< |
} else if (c < 0) { /* old cell */ |
| 428 |
< |
netchange -= docell(ogcp++, &oca); |
| 429 |
< |
ocnt--; |
| 430 |
< |
} else { /* same cell */ |
| 431 |
< |
ogcp++; ocnt--; |
| 432 |
< |
ngcp++; ncnt--; |
| 422 |
> |
if (oca.rev == nca.rev) { /* count matches */ |
| 423 |
> |
int oc = ocnt, nc = ncnt; |
| 424 |
> |
while (oc > 0 & nc > 0) { |
| 425 |
> |
c = cellcmp(ogcp, ngcp); |
| 426 |
> |
if (c >= 0) { ngcp++; nc--; } |
| 427 |
> |
if (c <= 0) { ogcp++; oc--; } |
| 428 |
> |
nmatch += c==0; |
| 429 |
> |
} |
| 430 |
> |
ogcp = ogcl; ngcp = ngcl; |
| 431 |
> |
} |
| 432 |
> |
if (nmatch < ocnt>>1) { /* faster to just delete old cells? */ |
| 433 |
> |
for (c = ncbeams; c--; ) |
| 434 |
> |
if (cbeam[c].wants & 1<<voxi) { |
| 435 |
> |
cbeam[c].wants &= ~(1<<voxi); |
| 436 |
> |
netchange--; |
| 437 |
|
} |
| 438 |
+ |
free((char *)ogcl); |
| 439 |
+ |
ogcl = NULL; ocnt = 0; |
| 440 |
+ |
} |
| 441 |
+ |
/* add and delete cells in order */ |
| 442 |
+ |
while (ocnt > 0 & ncnt > 0) |
| 443 |
+ |
if ((c = cellcmp(ogcp, ngcp)) > 0) { /* new cell */ |
| 444 |
+ |
netchange += docell(ngcp++, &nca); |
| 445 |
+ |
ncnt--; |
| 446 |
+ |
} else if (c < 0) { /* old cell */ |
| 447 |
+ |
netchange -= docell(ogcp++, &oca); |
| 448 |
+ |
ocnt--; |
| 449 |
+ |
} else { /* same cell */ |
| 450 |
+ |
ogcp++; ocnt--; |
| 451 |
+ |
ngcp++; ncnt--; |
| 452 |
+ |
} |
| 453 |
|
/* take care of list tails */ |
| 454 |
|
for ( ; ncnt > 0; ncnt--) |
| 455 |
|
netchange += docell(ngcp++, &nca); |
| 462 |
|
} |
| 463 |
|
|
| 464 |
|
|
| 465 |
+ |
int |
| 466 |
|
beam_sync() /* synchronize beams on server */ |
| 467 |
|
{ |
| 468 |
|
cbeamop(DR_NEWSET, cbeam, ncbeams, &odev.v, odev.hres, odev.vres); |
| 469 |
+ |
return(ncbeams); |
| 470 |
|
} |
| 471 |
|
|
| 472 |
|
|
| 474 |
|
VIEW *vn; |
| 475 |
|
{ |
| 476 |
|
struct cellact ca; |
| 477 |
< |
VOXL vlnew[8]; |
| 477 |
> |
VOXL vlnew[MAXVOXEL]; |
| 478 |
|
int n, comn; |
| 479 |
|
|
| 480 |
< |
if (!vn->type) { /* clear our beam list */ |
| 480 |
> |
if (vn == NULL || !vn->type) { /* clear our beam list */ |
| 481 |
|
set_voxels(vlnew, 0); |
| 482 |
|
cbeamop(DR_DELSET, cbeam, ncbeams, NULL, 0, 0); |
| 483 |
|
ncbeams = 0; |
| 484 |
< |
copystruct(&dvw, vn); |
| 484 |
> |
dvw.type = 0; |
| 485 |
|
return(1); |
| 486 |
|
} |
| 487 |
|
/* find our new voxels */ |
| 500 |
|
mvview(ca.vi, &dvw, vn); |
| 501 |
|
else /* else add all new cells */ |
| 502 |
|
doview(&ca, vn); |
| 484 |
– |
#if 1 |
| 485 |
– |
cbeamadj(vn, odev.hres, odev.vres); |
| 486 |
– |
#else |
| 503 |
|
/* inform server of new beams */ |
| 504 |
|
cbeamop(DR_ADDSET, cbeam+ncbeams, xcbeams, vn, odev.hres, odev.vres); |
| 505 |
|
/* sort list to put orphans at end */ |
| 507 |
|
/* tell server to delete orphans */ |
| 508 |
|
cbeamop(DR_DELSET, cbeam+ncbeams, xcbeams, NULL, 0, 0); |
| 509 |
|
xcbeams = 0; /* truncate our list */ |
| 494 |
– |
#endif |
| 510 |
|
copystruct(&dvw, vn); /* record new view */ |
| 511 |
|
return(1); |
| 512 |
|
} |
