| 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 */ |
| 24 |
– |
|
| 21 |
|
typedef struct { |
| 22 |
|
int hd; /* holodeck section number (-1 if inactive) */ |
| 23 |
|
int i[3]; /* voxel index (may be outside section) */ |
| 28 |
|
#define CBEAMBLK 1024 /* cbeam allocation block size */ |
| 29 |
|
|
| 30 |
|
static struct beamcomp { |
| 31 |
< |
unsigned short wants; /* flags telling which voxels want us */ |
| 32 |
< |
unsigned short hd; /* holodeck section number */ |
| 33 |
< |
int bi; /* beam index */ |
| 31 |
> |
unsigned int2 wants; /* flags telling which voxels want us */ |
| 32 |
> |
unsigned int2 hd; /* holodeck section number */ |
| 33 |
> |
int4 bi; /* beam index */ |
| 34 |
> |
int4 nr; /* number of samples desired */ |
| 35 |
|
} *cbeam = NULL; /* current beam list */ |
| 36 |
|
|
| 37 |
|
static int ncbeams = 0; /* number of sorted beams in cbeam */ |
| 42 |
|
short vi; /* voxel index */ |
| 43 |
|
short add; /* zero means delete */ |
| 44 |
|
short rev; /* reverse ray direction? */ |
| 45 |
+ |
VIEW *vp; /* view for image */ |
| 46 |
+ |
short hr, vr; /* image resolution */ |
| 47 |
|
}; /* action for cell */ |
| 48 |
|
|
| 49 |
|
struct beamact { |
| 109 |
|
|
| 110 |
|
if (ncbeams <= 0) |
| 111 |
|
return(-1); |
| 112 |
< |
cb.wants = 0; cb.hd = hd; cb.bi = bi; |
| 112 |
> |
cb.wants = 0; cb.hd = hd; cb.bi = bi; cb.nr = 0; |
| 113 |
|
p = (struct beamcomp *)bsearch((char *)&cb, (char *)cbeam, ncbeams, |
| 114 |
|
sizeof(struct beamcomp), cbeamcmp); |
| 115 |
|
if (p == NULL) |
| 137 |
|
if (bi < 1 | bi > nbeams(hdlist[hd])) |
| 138 |
|
error(INTERNAL, "illegal beam index in getcbeam"); |
| 139 |
|
n = newcbeam(); /* allocate and assign */ |
| 140 |
< |
cbeam[n].wants = 0; cbeam[n].hd = hd; cbeam[n].bi = bi; |
| 140 |
> |
cbeam[n].wants = cbeam[n].nr = 0; cbeam[n].hd = hd; cbeam[n].bi = bi; |
| 141 |
|
return(n); |
| 142 |
|
} |
| 143 |
|
|
| 162 |
|
} |
| 163 |
|
|
| 164 |
|
|
| 165 |
< |
cbeamop(op, bl, n, v, hr, vr) /* update beams on server list */ |
| 165 |
> |
cbeamop(op, bl, n) /* update beams on server list */ |
| 166 |
|
int op; |
| 167 |
|
register struct beamcomp *bl; |
| 168 |
|
int n; |
| 170 |
– |
VIEW *v; |
| 171 |
– |
int hr, vr; |
| 169 |
|
{ |
| 170 |
|
register PACKHEAD *pa; |
| 171 |
|
register int i; |
| 174 |
|
return; |
| 175 |
|
pa = (PACKHEAD *)malloc(n*sizeof(PACKHEAD)); |
| 176 |
|
if (pa == NULL) |
| 177 |
< |
error(SYSTEM, "out of memory in cbeamadd"); |
| 177 |
> |
error(SYSTEM, "out of memory in cbeamop"); |
| 178 |
|
for (i = 0; i < n; i++) { |
| 179 |
|
pa[i].hd = bl[i].hd; |
| 180 |
|
pa[i].bi = bl[i].bi; |
| 181 |
< |
pa[i].nr = v==NULL ? 0 : |
| 185 |
< |
npixels(v, hr, vr, hdlist[bl[i].hd], bl[i].bi); |
| 181 |
> |
pa[i].nr = bl[i].nr; |
| 182 |
|
pa[i].nc = 0; |
| 183 |
|
} |
| 184 |
|
serv_request(op, n*sizeof(PACKHEAD), (char *)pa); |
| 186 |
|
} |
| 187 |
|
|
| 188 |
|
|
| 189 |
< |
int |
| 194 |
< |
set_voxels(vl, n) /* set new voxel array */ |
| 195 |
< |
VOXL vl[MAXVOXEL]; |
| 196 |
< |
int n; |
| 197 |
< |
{ |
| 198 |
< |
short wmap[256]; |
| 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 < MAXVOXEL && voxel[j].hd >= 0; j++) { |
| 205 |
< |
vmap[j] = -1; |
| 206 |
< |
for (i = n; i--; ) |
| 207 |
< |
if (!bcmp((char *)(vl+i), (char *)(voxel+j), |
| 208 |
< |
sizeof(VOXL))) { |
| 209 |
< |
vmap[j] = i; |
| 210 |
< |
comn |= 1<<i; |
| 211 |
< |
break; |
| 212 |
< |
} |
| 213 |
< |
} |
| 214 |
< |
no = comn ? j : 0; /* compute flag mapping */ |
| 215 |
< |
for (i = 256; i--; ) { |
| 216 |
< |
wmap[i] = 0; |
| 217 |
< |
for (j = no; j--; ) |
| 218 |
< |
if (vmap[j] >= 0 && i & 1<<j) |
| 219 |
< |
wmap[i] |= 1<<vmap[j]; |
| 220 |
< |
} |
| 221 |
< |
/* fix cbeam flags */ |
| 222 |
< |
for (i = ncbeams; i--; ) |
| 223 |
< |
cbeam[i].wants = wmap[cbeam[i].wants]; |
| 224 |
< |
/* update our voxel list */ |
| 225 |
< |
bcopy((char *)vl, (char *)voxel, n*sizeof(VOXL)); |
| 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[MAXVOXEL]; |
| 189 |
> |
add_voxels(vp) /* add voxels corresponding to view point */ |
| 190 |
|
FVECT vp; |
| 191 |
|
{ |
| 192 |
< |
int first, n; |
| 192 |
> |
int first, n, rfl = 0; |
| 193 |
|
FVECT gp; |
| 194 |
|
double d; |
| 195 |
|
int dist, bestd = 0x7fff; |
| 196 |
|
VOXL vox; |
| 197 |
|
register int i, j, k; |
| 198 |
|
/* count voxels in list already */ |
| 199 |
< |
for (first = 0; first < MAXVOXEL && vl[first].hd >= 0; first++) |
| 199 |
> |
for (first = 0; first < MAXVOXEL && voxel[first].hd >= 0; first++) |
| 200 |
|
; |
| 201 |
|
/* find closest voxels */ |
| 202 |
|
for (n = first, i = 0; n < MAXVOXEL && hdlist[i]; i++) { |
| 216 |
|
if (dist < bestd) { /* start closer list */ |
| 217 |
|
n = first; |
| 218 |
|
bestd = dist; |
| 219 |
+ |
rfl = 0; |
| 220 |
|
} |
| 221 |
|
/* check if already in list */ |
| 222 |
|
for (k = first; k--; ) |
| 223 |
< |
if (vl[k].hd == i && |
| 224 |
< |
vl[k].i[0] == vox.i[0] && |
| 225 |
< |
vl[k].i[1] == vox.i[1] && |
| 226 |
< |
vl[k].i[2] == vox.i[2]) |
| 223 |
> |
if (voxel[k].hd == i && |
| 224 |
> |
voxel[k].i[0] == vox.i[0] && |
| 225 |
> |
voxel[k].i[1] == vox.i[1] && |
| 226 |
> |
voxel[k].i[2] == vox.i[2]) |
| 227 |
|
break; |
| 228 |
< |
if (k >= 0) |
| 228 |
> |
if (k >= 0) { |
| 229 |
> |
rfl |= 1<<k; |
| 230 |
|
continue; |
| 231 |
+ |
} |
| 232 |
|
vox.hd = i; /* add this voxel */ |
| 233 |
< |
copystruct(&vl[n], &vox); |
| 234 |
< |
n++; |
| 233 |
> |
copystruct(&voxel[n], &vox); |
| 234 |
> |
rfl |= 1<<n++; |
| 235 |
|
} |
| 236 |
|
} |
| 237 |
|
/* check for really stupid move */ |
| 240 |
|
return(0); |
| 241 |
|
} |
| 242 |
|
if (n < MAXVOXEL) |
| 243 |
< |
vl[n].hd = -1; |
| 244 |
< |
return(n); |
| 243 |
> |
voxel[n].hd = -1; |
| 244 |
> |
return(rfl); |
| 245 |
|
} |
| 246 |
|
|
| 247 |
|
|
| 251 |
|
register struct beamact *bp; |
| 252 |
|
{ |
| 253 |
|
GCOORD gc[2]; |
| 254 |
< |
int bi, i; |
| 254 |
> |
int bi, i, n; |
| 255 |
|
/* compute beam index */ |
| 256 |
|
if (bp->ca.rev) { |
| 257 |
|
copystruct(gc, &bp->gc); |
| 265 |
|
if (bp->ca.add) { /* add it in */ |
| 266 |
|
i = getcbeam(voxel[bp->ca.vi].hd, bi); |
| 267 |
|
cbeam[i].wants |= 1<<bp->ca.vi; /* say we want it */ |
| 268 |
+ |
n = npixels(bp->ca.vp, bp->ca.hr, bp->ca.vr, |
| 269 |
+ |
hdlist[cbeam[i].hd], cbeam[i].bi); |
| 270 |
+ |
if (n > cbeam[i].nr) |
| 271 |
+ |
cbeam[i].nr = n; |
| 272 |
|
return(i == ncbeams+xcbeams-1); /* return 1 if totally new */ |
| 273 |
|
} |
| 274 |
|
/* else delete it */ |
| 275 |
|
i = findcbeam(voxel[bp->ca.vi].hd, bi); |
| 276 |
|
if (i >= 0 && cbeam[i].wants & 1<<bp->ca.vi) { |
| 277 |
|
cbeam[i].wants &= ~(1<<bp->ca.vi); /* we don't want it */ |
| 278 |
+ |
if (!cbeam[i].wants) |
| 279 |
+ |
cbeam[i].nr = 0; |
| 280 |
|
return(1); /* indicate change */ |
| 281 |
|
} |
| 282 |
|
return(0); |
| 346 |
|
|
| 347 |
|
|
| 348 |
|
int |
| 349 |
< |
doview(cap, vp) /* visit cells for a given view */ |
| 349 |
> |
doview(cap) /* visit cells for a given view */ |
| 350 |
|
struct cellact *cap; |
| 387 |
– |
VIEW *vp; |
| 351 |
|
{ |
| 352 |
|
int orient; |
| 353 |
|
FVECT org, dir[4]; |
| 354 |
|
/* compute view pyramid */ |
| 355 |
< |
orient = viewpyramid(org, dir, hdlist[voxel[cap->vi].hd], vp); |
| 355 |
> |
orient = viewpyramid(org, dir, hdlist[voxel[cap->vi].hd], cap->vp); |
| 356 |
|
if (!orient) |
| 357 |
|
error(INTERNAL, "unusable view in doview"); |
| 358 |
|
cap->rev = orient < 0; |
| 361 |
|
} |
| 362 |
|
|
| 363 |
|
|
| 364 |
< |
mvview(voxi, vold, vnew) /* move view for a voxel */ |
| 402 |
< |
int voxi; |
| 403 |
< |
VIEW *vold, *vnew; |
| 364 |
> |
beam_init() /* clear beam list for new view(s) */ |
| 365 |
|
{ |
| 366 |
< |
int netchange = 0; |
| 367 |
< |
struct cellact oca, nca; |
| 368 |
< |
int ocnt, ncnt; |
| 369 |
< |
int nmatch = 0; |
| 370 |
< |
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; |
| 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 (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); |
| 456 |
< |
for ( ; ocnt > 0; ocnt--) |
| 457 |
< |
netchange -= docell(ogcp++, &oca); |
| 458 |
< |
/* clean up */ |
| 459 |
< |
if (ogcl != NULL) free((char *)ogcl); |
| 460 |
< |
if (ngcl != NULL) free((char *)ngcl); |
| 461 |
< |
return(netchange); |
| 366 |
> |
register int i; |
| 367 |
> |
/* clear desire flags */ |
| 368 |
> |
for (i = ncbeams+xcbeams; i--; ) |
| 369 |
> |
cbeam[i].wants = cbeam[i].nr = 0; |
| 370 |
> |
voxel[0].hd = -1; /* clear voxel list */ |
| 371 |
|
} |
| 372 |
|
|
| 373 |
|
|
| 374 |
< |
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 |
< |
|
| 473 |
< |
beam_view(vn) /* change beam view (if advisable) */ |
| 374 |
> |
beam_view(vn, hr, vr) /* add beam view (if advisable) */ |
| 375 |
|
VIEW *vn; |
| 376 |
+ |
int hr, vr; |
| 377 |
|
{ |
| 378 |
|
struct cellact ca; |
| 379 |
< |
VOXL vlnew[MAXVOXEL]; |
| 380 |
< |
int n, comn; |
| 381 |
< |
|
| 382 |
< |
if (vn == NULL || !vn->type) { /* clear our beam list */ |
| 383 |
< |
set_voxels(vlnew, 0); |
| 384 |
< |
cbeamop(DR_DELSET, cbeam, ncbeams, NULL, 0, 0); |
| 483 |
< |
ncbeams = 0; |
| 484 |
< |
dvw.type = 0; |
| 485 |
< |
return(1); |
| 486 |
< |
} |
| 487 |
< |
/* find our new voxels */ |
| 488 |
< |
n = get_voxels(vlnew, vn->vp); |
| 489 |
< |
if (dvw.type && !n) { |
| 490 |
< |
copystruct(vn, &dvw); /* cancel move */ |
| 379 |
> |
int vfl; |
| 380 |
> |
/* sort our list */ |
| 381 |
> |
cbeamsort(1); |
| 382 |
> |
/* add new voxels */ |
| 383 |
> |
vfl = add_voxels(vn->vp); |
| 384 |
> |
if (!vfl) |
| 385 |
|
return(0); |
| 386 |
< |
} |
| 493 |
< |
/* set the new voxels */ |
| 494 |
< |
comn = set_voxels(vlnew, n); |
| 495 |
< |
if (!dvw.type) |
| 496 |
< |
comn = 0; |
| 386 |
> |
ca.vp = vn; ca.hr = hr; ca.vr = vr; |
| 387 |
|
ca.add = 1; /* update our beam list */ |
| 388 |
< |
for (ca.vi = n; ca.vi--; ) |
| 389 |
< |
if (comn & 1<<ca.vi) /* change which cells we see */ |
| 390 |
< |
mvview(ca.vi, &dvw, vn); |
| 391 |
< |
else /* else add all new cells */ |
| 392 |
< |
doview(&ca, vn); |
| 393 |
< |
/* inform server of new beams */ |
| 394 |
< |
cbeamop(DR_ADDSET, cbeam+ncbeams, xcbeams, vn, odev.hres, odev.vres); |
| 388 |
> |
for (ca.vi = 0; vfl; vfl >>= 1, ca.vi++) |
| 389 |
> |
if (vfl & 1) |
| 390 |
> |
doview(&ca); |
| 391 |
> |
return(1); |
| 392 |
> |
} |
| 393 |
> |
|
| 394 |
> |
|
| 395 |
> |
int |
| 396 |
> |
beam_sync(all) /* update beam list on server */ |
| 397 |
> |
int all; |
| 398 |
> |
{ |
| 399 |
|
/* sort list to put orphans at end */ |
| 400 |
|
cbeamsort(0); |
| 401 |
< |
/* tell server to delete orphans */ |
| 402 |
< |
cbeamop(DR_DELSET, cbeam+ncbeams, xcbeams, NULL, 0, 0); |
| 401 |
> |
if (all) |
| 402 |
> |
cbeamop(DR_NEWSET, cbeam, ncbeams); |
| 403 |
> |
else |
| 404 |
> |
cbeamop(DR_ADJSET, cbeam, ncbeams+xcbeams); |
| 405 |
|
xcbeams = 0; /* truncate our list */ |
| 406 |
< |
copystruct(&dvw, vn); /* record new view */ |
| 511 |
< |
return(1); |
| 406 |
> |
return(ncbeams); |
| 407 |
|
} |
