| 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 |
< |
extern GCOORD *getviewcells(); |
| 19 |
> |
#define MAXVOXEL 32 /* maximum number of active voxels */ |
| 20 |
|
|
| 21 |
– |
static VIEW dvw; /* current view corresponding to beam list */ |
| 22 |
– |
|
| 21 |
|
typedef struct { |
| 22 |
|
int hd; /* holodeck section number (-1 if inactive) */ |
| 23 |
|
int i[3]; /* voxel index (may be outside section) */ |
| 24 |
|
} VOXL; /* a voxel */ |
| 25 |
|
|
| 26 |
< |
static VOXL voxel[8] = { /* current voxel list */ |
| 29 |
< |
{-1}, {-1}, {-1}, {-1}, |
| 30 |
< |
{-1}, {-1}, {-1}, {-1} |
| 31 |
< |
}; |
| 26 |
> |
static VOXL voxel[MAXVOXEL] = {{-1}}; /* current voxel list */ |
| 27 |
|
|
| 28 |
|
#define CBEAMBLK 1024 /* cbeam allocation block size */ |
| 29 |
|
|
| 30 |
|
static struct beamcomp { |
| 31 |
< |
short wants; /* flags telling which voxels want us */ |
| 32 |
< |
short hd; /* holodeck section number */ |
| 33 |
< |
int bi; /* beam index */ |
| 31 |
> |
int hd; /* holodeck section number */ |
| 32 |
> |
int4 bi; /* beam index */ |
| 33 |
> |
int4 nr; /* number of samples desired */ |
| 34 |
|
} *cbeam = NULL; /* current beam list */ |
| 35 |
|
|
| 36 |
|
static int ncbeams = 0; /* number of sorted beams in cbeam */ |
| 39 |
|
|
| 40 |
|
struct cellact { |
| 41 |
|
short vi; /* voxel index */ |
| 47 |
– |
short add; /* zero means delete */ |
| 42 |
|
short rev; /* reverse ray direction? */ |
| 43 |
+ |
VIEW *vp; /* view for image */ |
| 44 |
+ |
short hr, vr; /* image resolution */ |
| 45 |
|
}; /* action for cell */ |
| 46 |
|
|
| 47 |
|
struct beamact { |
| 88 |
|
{ |
| 89 |
|
register int c; |
| 90 |
|
|
| 91 |
< |
if (!cb1->wants) /* put orphans at the end, unsorted */ |
| 92 |
< |
return(cb2->wants); |
| 91 |
> |
if (!cb1->nr) /* put orphans at the end, unsorted */ |
| 92 |
> |
return(cb2->nr); |
| 93 |
> |
if (!cb2->nr) |
| 94 |
> |
return(-1); |
| 95 |
|
if ((c = cb1->bi - cb2->bi)) /* sort on beam index first */ |
| 96 |
|
return(c); |
| 97 |
|
return(cb1->hd - cb2->hd); /* use hd to resolve matches */ |
| 107 |
|
|
| 108 |
|
if (ncbeams <= 0) |
| 109 |
|
return(-1); |
| 110 |
< |
cb.wants = 0; cb.hd = hd; cb.bi = bi; |
| 110 |
> |
cb.hd = hd; cb.bi = bi; cb.nr = 0; |
| 111 |
|
p = (struct beamcomp *)bsearch((char *)&cb, (char *)cbeam, ncbeams, |
| 112 |
|
sizeof(struct beamcomp), cbeamcmp); |
| 113 |
|
if (p == NULL) |
| 135 |
|
if (bi < 1 | bi > nbeams(hdlist[hd])) |
| 136 |
|
error(INTERNAL, "illegal beam index in getcbeam"); |
| 137 |
|
n = newcbeam(); /* allocate and assign */ |
| 138 |
< |
cbeam[n].wants = 0; cbeam[n].hd = hd; cbeam[n].bi = bi; |
| 138 |
> |
cbeam[n].nr = 0; cbeam[n].hd = hd; cbeam[n].bi = bi; |
| 139 |
|
return(n); |
| 140 |
|
} |
| 141 |
|
|
| 153 |
|
if (adopt) |
| 154 |
|
return; |
| 155 |
|
for (i = ncbeams; i--; ) /* identify orphans */ |
| 156 |
< |
if (cbeam[i].wants) |
| 156 |
> |
if (cbeam[i].nr) |
| 157 |
|
break; |
| 158 |
|
xcbeams = ncbeams - ++i; /* put orphans after ncbeams */ |
| 159 |
|
ncbeams = i; |
| 160 |
|
} |
| 161 |
|
|
| 162 |
|
|
| 163 |
< |
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) + 1; |
| 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 |
< |
|
| 201 |
< |
cbeamop(op, bl, n, v, hr, vr) /* update beams on server list */ |
| 163 |
> |
cbeamop(op, bl, n) /* update beams on server list */ |
| 164 |
|
int op; |
| 165 |
|
register struct beamcomp *bl; |
| 166 |
|
int n; |
| 205 |
– |
VIEW *v; |
| 206 |
– |
int hr, vr; |
| 167 |
|
{ |
| 168 |
|
register PACKHEAD *pa; |
| 169 |
|
register int i; |
| 172 |
|
return; |
| 173 |
|
pa = (PACKHEAD *)malloc(n*sizeof(PACKHEAD)); |
| 174 |
|
if (pa == NULL) |
| 175 |
< |
error(SYSTEM, "out of memory in cbeamadd"); |
| 175 |
> |
error(SYSTEM, "out of memory in cbeamop"); |
| 176 |
|
for (i = 0; i < n; i++) { |
| 177 |
|
pa[i].hd = bl[i].hd; |
| 178 |
|
pa[i].bi = bl[i].bi; |
| 179 |
< |
pa[i].nr = v==NULL ? 0 : |
| 180 |
< |
npixels(v, hr, vr, hdlist[bl[i].hd], bl[i].bi); |
| 179 |
> |
pa[i].nr = bl[i].nr; |
| 180 |
> |
pa[i].nc = 0; |
| 181 |
|
} |
| 182 |
|
serv_request(op, n*sizeof(PACKHEAD), (char *)pa); |
| 183 |
|
free((char *)pa); |
| 184 |
|
} |
| 185 |
|
|
| 186 |
|
|
| 187 |
< |
int |
| 188 |
< |
set_voxels(vl, n) /* set new voxel array */ |
| 229 |
< |
VOXL vl[8]; |
| 230 |
< |
int n; |
| 231 |
< |
{ |
| 232 |
< |
short wmap[256]; |
| 233 |
< |
int vmap[8]; |
| 234 |
< |
int comn = 0; |
| 235 |
< |
int no; |
| 236 |
< |
register int i, j; |
| 237 |
< |
/* find common voxels */ |
| 238 |
< |
for (j = 0; j < 8 && voxel[j].hd >= 0; j++) { |
| 239 |
< |
vmap[j] = -1; |
| 240 |
< |
for (i = n; i--; ) |
| 241 |
< |
if (!bcmp((char *)(vl+i), (char *)(voxel+j), |
| 242 |
< |
sizeof(VOXL))) { |
| 243 |
< |
vmap[j] = i; |
| 244 |
< |
comn |= 1<<i; |
| 245 |
< |
break; |
| 246 |
< |
} |
| 247 |
< |
} |
| 248 |
< |
no = comn ? j : 0; /* compute flag mapping */ |
| 249 |
< |
for (i = 256; i--; ) { |
| 250 |
< |
wmap[i] = 0; |
| 251 |
< |
for (j = no; j--; ) |
| 252 |
< |
if (vmap[j] >= 0 && i & 1<<j) |
| 253 |
< |
wmap[i] |= 1<<vmap[j]; |
| 254 |
< |
} |
| 255 |
< |
/* fix cbeam flags */ |
| 256 |
< |
for (i = ncbeams; i--; ) |
| 257 |
< |
cbeam[i].wants = wmap[cbeam[i].wants]; |
| 258 |
< |
/* update our voxel list */ |
| 259 |
< |
bcopy((char *)vl, (char *)voxel, n*sizeof(VOXL)); |
| 260 |
< |
for (j = n; j < 8; j++) |
| 261 |
< |
voxel[j].hd = -1; |
| 262 |
< |
return(comn); /* return bit array of common voxels */ |
| 263 |
< |
} |
| 264 |
< |
|
| 265 |
< |
|
| 266 |
< |
int |
| 267 |
< |
get_voxels(vl, vp) /* find voxels corresponding to view point */ |
| 268 |
< |
VOXL vl[8]; |
| 187 |
> |
unsigned int4 |
| 188 |
> |
add_voxels(vp) /* add voxels corresponding to view point */ |
| 189 |
|
FVECT vp; |
| 190 |
|
{ |
| 191 |
< |
static int lastn = 0, lastd = -1; |
| 272 |
< |
int n = 0; |
| 191 |
> |
int first, n, rfl = 0; |
| 192 |
|
FVECT gp; |
| 193 |
|
double d; |
| 194 |
|
int dist, bestd = 0x7fff; |
| 195 |
|
VOXL vox; |
| 196 |
|
register int i, j, k; |
| 197 |
+ |
/* count voxels in list already */ |
| 198 |
+ |
for (first = 0; first < MAXVOXEL && voxel[first].hd >= 0; first++) |
| 199 |
+ |
; |
| 200 |
|
/* find closest voxels */ |
| 201 |
< |
for (i = 0; n < 8 && hdlist[i]; i++) { |
| 201 |
> |
for (n = first, i = 0; n < MAXVOXEL && hdlist[i]; i++) { |
| 202 |
|
hdgrid(gp, hdlist[i], vp); |
| 203 |
< |
for (j = 0; n < 8 && j < 8; j++) { |
| 203 |
> |
for (j = 0; n < MAXVOXEL && j < 8; j++) { |
| 204 |
|
dist = 0; |
| 205 |
|
for (k = 0; k < 3; k++) { |
| 206 |
|
d = gp[k] - .5 + (j>>k & 1); |
| 213 |
|
if (dist > bestd) /* others were closer */ |
| 214 |
|
continue; |
| 215 |
|
if (dist < bestd) { /* start closer list */ |
| 216 |
< |
n = 0; |
| 216 |
> |
n = first; |
| 217 |
|
bestd = dist; |
| 218 |
+ |
rfl = 0; |
| 219 |
|
} |
| 220 |
+ |
/* check if already in list */ |
| 221 |
+ |
for (k = first; k--; ) |
| 222 |
+ |
if (voxel[k].hd == i && |
| 223 |
+ |
voxel[k].i[0] == vox.i[0] && |
| 224 |
+ |
voxel[k].i[1] == vox.i[1] && |
| 225 |
+ |
voxel[k].i[2] == vox.i[2]) |
| 226 |
+ |
break; |
| 227 |
+ |
if (k >= 0) { |
| 228 |
+ |
rfl |= 1<<k; |
| 229 |
+ |
continue; |
| 230 |
+ |
} |
| 231 |
|
vox.hd = i; /* add this voxel */ |
| 232 |
< |
copystruct(&vl[n], &vox); |
| 233 |
< |
n++; |
| 232 |
> |
copystruct(&voxel[n], &vox); |
| 233 |
> |
rfl |= 1<<n++; |
| 234 |
|
} |
| 235 |
|
} |
| 236 |
|
/* check for really stupid move */ |
| 238 |
|
error(COMMAND, "move past outer limits"); |
| 239 |
|
return(0); |
| 240 |
|
} |
| 241 |
< |
/* warn of dangerous moves */ |
| 242 |
< |
if (n < lastn && bestd >= lastd) |
| 243 |
< |
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); |
| 241 |
> |
if (n < MAXVOXEL) |
| 242 |
> |
voxel[n].hd = -1; |
| 243 |
> |
return(rfl); |
| 244 |
|
} |
| 245 |
|
|
| 246 |
|
|
| 247 |
|
int |
| 248 |
< |
dobeam(gcp, bp) /* express interest or disintrest in a beam */ |
| 248 |
> |
dobeam(gcp, bp) /* express interest in a beam */ |
| 249 |
|
GCOORD *gcp; |
| 250 |
|
register struct beamact *bp; |
| 251 |
|
{ |
| 252 |
|
GCOORD gc[2]; |
| 253 |
< |
int bi, i; |
| 253 |
> |
int bi, i, n; |
| 254 |
|
/* compute beam index */ |
| 255 |
|
if (bp->ca.rev) { |
| 256 |
|
copystruct(gc, &bp->gc); |
| 261 |
|
} |
| 262 |
|
if ((bi = hdbindex(hdlist[voxel[bp->ca.vi].hd], gc)) <= 0) |
| 263 |
|
error(CONSISTENCY, "bad grid coordinate in dobeam"); |
| 264 |
< |
if (bp->ca.add) { /* add it in */ |
| 265 |
< |
i = getcbeam(voxel[bp->ca.vi].hd, bi); |
| 266 |
< |
cbeam[i].wants |= 1<<bp->ca.vi; /* say we want it */ |
| 267 |
< |
return(i == ncbeams+xcbeams-1); /* return 1 if totally new */ |
| 268 |
< |
} |
| 269 |
< |
/* else delete it */ |
| 270 |
< |
i = findcbeam(voxel[bp->ca.vi].hd, bi); |
| 341 |
< |
if (i >= 0 && cbeam[i].wants & 1<<bp->ca.vi) { |
| 342 |
< |
cbeam[i].wants &= ~(1<<bp->ca.vi); /* we don't want it */ |
| 343 |
< |
return(1); /* indicate change */ |
| 344 |
< |
} |
| 345 |
< |
return(0); |
| 264 |
> |
/* add it in */ |
| 265 |
> |
i = getcbeam(voxel[bp->ca.vi].hd, bi); |
| 266 |
> |
n = npixels(bp->ca.vp, bp->ca.hr, bp->ca.vr, |
| 267 |
> |
hdlist[cbeam[i].hd], cbeam[i].bi); |
| 268 |
> |
if (n > cbeam[i].nr) |
| 269 |
> |
cbeam[i].nr = n; |
| 270 |
> |
return(i == ncbeams+xcbeams-1); /* return 1 if totally new */ |
| 271 |
|
} |
| 272 |
|
|
| 273 |
|
|
| 287 |
|
register int i; |
| 288 |
|
/* compute cell center */ |
| 289 |
|
cgp[gcp->w>>1] = gcp->w&1 ? hp->grid[gcp->w>>1] : 0 ; |
| 290 |
< |
cgp[((gcp->w>>1)+1)%3] = gcp->i[0] + .5; |
| 291 |
< |
cgp[((gcp->w>>1)+2)%3] = gcp->i[1] + .5; |
| 290 |
> |
cgp[hdwg0[gcp->w]] = gcp->i[0] + .5; |
| 291 |
> |
cgp[hdwg1[gcp->w]] = gcp->i[1] + .5; |
| 292 |
|
hdworld(org, hp, cgp); |
| 293 |
|
/* compute direction to voxel center */ |
| 294 |
|
for (i = 3; i--; ) |
| 315 |
|
for (i = 3; i--; ) |
| 316 |
|
v1[i] = hp->xv[j][i] * d; |
| 317 |
|
d = 0.5/hp->grid[j=(axmax+2)%3]; |
| 318 |
< |
if (DOT(hp->wn[axmax], vc) < 0.) |
| 319 |
< |
d = -d; /* reverse vertex ordering */ |
| 318 |
> |
if (DOT(hp->wg[axmax], vc) < 0.) |
| 319 |
> |
d = -d; /* reverse vertex order */ |
| 320 |
|
for (i = 3; i--; ) |
| 321 |
|
v2[i] = hp->xv[j][i] * d; |
| 322 |
|
/* compute voxel pyramid */ |
| 334 |
|
|
| 335 |
|
|
| 336 |
|
int |
| 337 |
< |
doview(cap, vp) /* visit cells for a given view */ |
| 337 |
> |
doview(cap) /* visit cells for a given view */ |
| 338 |
|
struct cellact *cap; |
| 414 |
– |
VIEW *vp; |
| 339 |
|
{ |
| 340 |
|
int orient; |
| 341 |
|
FVECT org, dir[4]; |
| 342 |
|
/* compute view pyramid */ |
| 343 |
< |
orient = viewpyramid(org, dir, hdlist[voxel[cap->vi].hd], vp); |
| 343 |
> |
orient = viewpyramid(org, dir, hdlist[voxel[cap->vi].hd], cap->vp); |
| 344 |
|
if (!orient) |
| 345 |
|
error(INTERNAL, "unusable view in doview"); |
| 346 |
|
cap->rev = orient < 0; |
| 349 |
|
} |
| 350 |
|
|
| 351 |
|
|
| 352 |
< |
mvview(voxi, vold, vnew) /* move view for a voxel */ |
| 429 |
< |
int voxi; |
| 430 |
< |
VIEW *vold, *vnew; |
| 352 |
> |
beam_init() /* clear beam list for new view(s) */ |
| 353 |
|
{ |
| 354 |
< |
int netchange = 0; |
| 355 |
< |
struct cellact oca, nca; |
| 356 |
< |
int ocnt, ncnt; |
| 357 |
< |
int c; |
| 358 |
< |
GCOORD *ogcl, *ngcl; |
| 437 |
< |
register GCOORD *ogcp, *ngcp; |
| 438 |
< |
/* get old and new cell lists */ |
| 439 |
< |
ogcp = ogcl = getviewcells(&ocnt, hdlist[voxel[voxi].hd], vold); |
| 440 |
< |
ngcp = ngcl = getviewcells(&ncnt, hdlist[voxel[voxi].hd], vnew); |
| 441 |
< |
/* set up actions */ |
| 442 |
< |
oca.vi = nca.vi = voxi; |
| 443 |
< |
oca.add = 0; nca.add = 1; |
| 444 |
< |
if ((oca.rev = ocnt < 0)) |
| 445 |
< |
ocnt = -ocnt; |
| 446 |
< |
if ((nca.rev = ncnt < 0)) |
| 447 |
< |
ncnt = -ncnt; |
| 448 |
< |
if (nca.rev == oca.rev) /* add and delete cells in order */ |
| 449 |
< |
while (ocnt > 0 & ncnt > 0) |
| 450 |
< |
if ((c = cellcmp(ogcp, ngcp)) > 0) { /* new cell */ |
| 451 |
< |
netchange += docell(ngcp++, &nca); |
| 452 |
< |
ncnt--; |
| 453 |
< |
} else if (c < 0) { /* old cell */ |
| 454 |
< |
netchange -= docell(ogcp++, &oca); |
| 455 |
< |
ocnt--; |
| 456 |
< |
} else { /* same cell */ |
| 457 |
< |
ogcp++; ocnt--; |
| 458 |
< |
ngcp++; ncnt--; |
| 459 |
< |
} |
| 460 |
< |
/* take care of list tails */ |
| 461 |
< |
for ( ; ncnt > 0; ncnt--) |
| 462 |
< |
netchange += docell(ngcp++, &nca); |
| 463 |
< |
for ( ; ocnt > 0; ocnt--) |
| 464 |
< |
netchange -= docell(ogcp++, &oca); |
| 465 |
< |
/* clean up */ |
| 466 |
< |
if (ogcl != NULL) free((char *)ogcl); |
| 467 |
< |
if (ngcl != NULL) free((char *)ngcl); |
| 468 |
< |
return(netchange); |
| 354 |
> |
register int i; |
| 355 |
> |
/* clear desire flags */ |
| 356 |
> |
for (i = ncbeams+xcbeams; i--; ) |
| 357 |
> |
cbeam[i].nr = 0; |
| 358 |
> |
voxel[0].hd = -1; /* clear voxel list */ |
| 359 |
|
} |
| 360 |
|
|
| 361 |
|
|
| 362 |
< |
int |
| 363 |
< |
beam_sync() /* synchronize beams on server */ |
| 362 |
> |
beam_view(vn, hr, vr) /* add beam view (if advisable) */ |
| 363 |
> |
VIEW *vn; |
| 364 |
> |
int hr, vr; |
| 365 |
|
{ |
| 366 |
< |
cbeamop(DR_NEWSET, cbeam, ncbeams, &odev.v, odev.hres, odev.vres); |
| 367 |
< |
return(ncbeams); |
| 366 |
> |
struct cellact ca; |
| 367 |
> |
unsigned int4 vfl; |
| 368 |
> |
/* sort our list */ |
| 369 |
> |
cbeamsort(1); |
| 370 |
> |
/* add new voxels */ |
| 371 |
> |
vfl = add_voxels(vn->vp); |
| 372 |
> |
if (!vfl) |
| 373 |
> |
return(0); |
| 374 |
> |
ca.vp = vn; ca.hr = hr; ca.vr = vr; |
| 375 |
> |
/* update our beam list */ |
| 376 |
> |
for (ca.vi = 0; vfl; vfl >>= 1, ca.vi++) |
| 377 |
> |
if (vfl & 1) |
| 378 |
> |
doview(&ca); |
| 379 |
> |
return(1); |
| 380 |
|
} |
| 381 |
|
|
| 382 |
|
|
| 383 |
< |
beam_view(vn) /* change beam view (if advisable) */ |
| 384 |
< |
VIEW *vn; |
| 383 |
> |
int |
| 384 |
> |
beam_sync(all) /* update beam list on server */ |
| 385 |
> |
int all; |
| 386 |
|
{ |
| 483 |
– |
struct cellact ca; |
| 484 |
– |
VOXL vlnew[8]; |
| 485 |
– |
int n, comn; |
| 486 |
– |
|
| 487 |
– |
if (!vn->type) { /* clear our beam list */ |
| 488 |
– |
set_voxels(vlnew, 0); |
| 489 |
– |
cbeamop(DR_DELSET, cbeam, ncbeams, NULL, 0, 0); |
| 490 |
– |
ncbeams = 0; |
| 491 |
– |
copystruct(&dvw, vn); |
| 492 |
– |
return(1); |
| 493 |
– |
} |
| 494 |
– |
/* find our new voxels */ |
| 495 |
– |
n = get_voxels(vlnew, vn->vp); |
| 496 |
– |
if (dvw.type && !n) { |
| 497 |
– |
copystruct(vn, &dvw); /* cancel move */ |
| 498 |
– |
return(0); |
| 499 |
– |
} |
| 500 |
– |
/* set the new voxels */ |
| 501 |
– |
comn = set_voxels(vlnew, n); |
| 502 |
– |
if (!dvw.type) |
| 503 |
– |
comn = 0; |
| 504 |
– |
ca.add = 1; /* update our beam list */ |
| 505 |
– |
for (ca.vi = n; ca.vi--; ) |
| 506 |
– |
if (comn & 1<<ca.vi) /* change which cells we see */ |
| 507 |
– |
mvview(ca.vi, &dvw, vn); |
| 508 |
– |
else /* else add all new cells */ |
| 509 |
– |
doview(&ca, vn); |
| 510 |
– |
#if 1 |
| 511 |
– |
cbeamadj(vn, odev.hres, odev.vres); |
| 512 |
– |
#else |
| 513 |
– |
/* inform server of new beams */ |
| 514 |
– |
cbeamop(DR_ADDSET, cbeam+ncbeams, xcbeams, vn, odev.hres, odev.vres); |
| 387 |
|
/* sort list to put orphans at end */ |
| 388 |
|
cbeamsort(0); |
| 389 |
< |
/* tell server to delete orphans */ |
| 390 |
< |
cbeamop(DR_DELSET, cbeam+ncbeams, xcbeams, NULL, 0, 0); |
| 389 |
> |
if (all) |
| 390 |
> |
cbeamop(DR_NEWSET, cbeam, ncbeams); |
| 391 |
> |
else |
| 392 |
> |
cbeamop(DR_ADJSET, cbeam, ncbeams+xcbeams); |
| 393 |
|
xcbeams = 0; /* truncate our list */ |
| 394 |
< |
#endif |
| 521 |
< |
copystruct(&dvw, vn); /* record new view */ |
| 522 |
< |
return(1); |
| 394 |
> |
return(ncbeams); |
| 395 |
|
} |
