| 12 |
|
#include "rhdisp.h" |
| 13 |
|
#include "rhdriver.h" |
| 14 |
|
|
| 15 |
< |
#ifndef MAXDIST |
| 16 |
< |
#define MAXDIST 42 /* maximum distance outside section */ |
| 15 |
> |
#ifndef MEYERNG |
| 16 |
> |
#define MEYERNG 0.2 /* target mean eye range (rel. to grid) */ |
| 17 |
|
#endif |
| 18 |
|
|
| 19 |
– |
#define MAXVOXEL 16 /* maximum number of active voxels */ |
| 20 |
– |
|
| 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[MAXVOXEL] = {{-1}}; /* current voxel list */ |
| 27 |
– |
|
| 19 |
|
#define CBEAMBLK 1024 /* cbeam allocation block size */ |
| 20 |
|
|
| 21 |
< |
static struct beamcomp { |
| 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 |
< |
|
| 21 |
> |
static PACKHEAD *cbeam = NULL; /* current beam list */ |
| 22 |
|
static int ncbeams = 0; /* number of sorted beams in cbeam */ |
| 23 |
|
static int xcbeams = 0; /* extra (unregistered) beams past ncbeams */ |
| 24 |
|
static int maxcbeam = 0; /* size of cbeam array */ |
| 25 |
|
|
| 26 |
< |
struct cellact { |
| 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 */ |
| 26 |
> |
VIEWPOINT cureye; /* current eye position */ |
| 27 |
|
|
| 49 |
– |
struct beamact { |
| 50 |
– |
struct cellact ca; /* cell action */ |
| 51 |
– |
GCOORD gc; /* grid coordinate */ |
| 52 |
– |
}; /* beam origin and action */ |
| 28 |
|
|
| 54 |
– |
|
| 29 |
|
int |
| 30 |
|
newcbeam() /* allocate new entry at end of cbeam array */ |
| 31 |
|
{ |
| 34 |
|
if ((i = ncbeams + xcbeams++) >= maxcbeam) { /* grow array */ |
| 35 |
|
maxcbeam += CBEAMBLK; |
| 36 |
|
if (cbeam == NULL) |
| 37 |
< |
cbeam = (struct beamcomp *)malloc( |
| 38 |
< |
maxcbeam*sizeof(struct beamcomp) ); |
| 37 |
> |
cbeam = (PACKHEAD *)malloc( |
| 38 |
> |
maxcbeam*sizeof(PACKHEAD) ); |
| 39 |
|
else |
| 40 |
< |
cbeam = (struct beamcomp *)realloc( (char *)cbeam, |
| 41 |
< |
maxcbeam*sizeof(struct beamcomp) ); |
| 40 |
> |
cbeam = (PACKHEAD *)realloc( (char *)cbeam, |
| 41 |
> |
maxcbeam*sizeof(PACKHEAD) ); |
| 42 |
|
if (cbeam == NULL) |
| 43 |
|
error(SYSTEM, "out of memory in newcbeam"); |
| 44 |
|
} |
| 48 |
|
|
| 49 |
|
int |
| 50 |
|
cbeamcmp(cb1, cb2) /* compare two cbeam entries for sort: keep orphans */ |
| 51 |
< |
register struct beamcomp *cb1, *cb2; |
| 51 |
> |
register PACKHEAD *cb1, *cb2; |
| 52 |
|
{ |
| 53 |
|
register int c; |
| 54 |
|
|
| 60 |
|
|
| 61 |
|
int |
| 62 |
|
cbeamcmp2(cb1, cb2) /* compare two cbeam entries for sort: no orphans */ |
| 63 |
< |
register struct beamcomp *cb1, *cb2; |
| 63 |
> |
register PACKHEAD *cb1, *cb2; |
| 64 |
|
{ |
| 65 |
|
register int c; |
| 66 |
|
|
| 67 |
< |
if (!cb1->wants) /* put orphans at the end, unsorted */ |
| 68 |
< |
return(cb2->wants); |
| 69 |
< |
if (!cb2->wants) |
| 67 |
> |
if (!cb1->nr) /* put orphans at the end, unsorted */ |
| 68 |
> |
return(cb2->nr); |
| 69 |
> |
if (!cb2->nr) |
| 70 |
|
return(-1); |
| 71 |
|
if ((c = cb1->bi - cb2->bi)) /* sort on beam index first */ |
| 72 |
|
return(c); |
| 78 |
|
findcbeam(hd, bi) /* find the specified beam in our sorted list */ |
| 79 |
|
int hd, bi; |
| 80 |
|
{ |
| 81 |
< |
struct beamcomp cb; |
| 82 |
< |
register struct beamcomp *p; |
| 81 |
> |
PACKHEAD cb; |
| 82 |
> |
register PACKHEAD *p; |
| 83 |
|
|
| 84 |
|
if (ncbeams <= 0) |
| 85 |
|
return(-1); |
| 86 |
< |
cb.wants = 0; cb.hd = hd; cb.bi = bi; cb.nr = 0; |
| 87 |
< |
p = (struct beamcomp *)bsearch((char *)&cb, (char *)cbeam, ncbeams, |
| 88 |
< |
sizeof(struct beamcomp), cbeamcmp); |
| 86 |
> |
cb.hd = hd; cb.bi = bi; cb.nr = cb.nc = 0; |
| 87 |
> |
p = (PACKHEAD *)bsearch((char *)&cb, (char *)cbeam, ncbeams, |
| 88 |
> |
sizeof(PACKHEAD), cbeamcmp); |
| 89 |
|
if (p == NULL) |
| 90 |
|
return(-1); |
| 91 |
|
return(p - cbeam); |
| 111 |
|
if (bi < 1 | bi > nbeams(hdlist[hd])) |
| 112 |
|
error(INTERNAL, "illegal beam index in getcbeam"); |
| 113 |
|
n = newcbeam(); /* allocate and assign */ |
| 114 |
< |
cbeam[n].wants = cbeam[n].nr = 0; cbeam[n].hd = hd; cbeam[n].bi = bi; |
| 114 |
> |
cbeam[n].hd = hd; cbeam[n].bi = bi; cbeam[n].nr = cbeam[n].nc = 0; |
| 115 |
|
return(n); |
| 116 |
|
} |
| 117 |
|
|
| 124 |
|
if (!(ncbeams += xcbeams)) |
| 125 |
|
return; |
| 126 |
|
xcbeams = 0; |
| 127 |
< |
qsort((char *)cbeam, ncbeams, sizeof(struct beamcomp), |
| 127 |
> |
qsort((char *)cbeam, ncbeams, sizeof(PACKHEAD), |
| 128 |
|
adopt ? cbeamcmp : cbeamcmp2); |
| 129 |
|
if (adopt) |
| 130 |
|
return; |
| 131 |
|
for (i = ncbeams; i--; ) /* identify orphans */ |
| 132 |
< |
if (cbeam[i].wants) |
| 132 |
> |
if (cbeam[i].nr) |
| 133 |
|
break; |
| 134 |
|
xcbeams = ncbeams - ++i; /* put orphans after ncbeams */ |
| 135 |
|
ncbeams = i; |
| 136 |
|
} |
| 137 |
|
|
| 138 |
|
|
| 139 |
< |
cbeamop(op, bl, n) /* update beams on server list */ |
| 140 |
< |
int op; |
| 167 |
< |
register struct beamcomp *bl; |
| 168 |
< |
int n; |
| 139 |
> |
beam_init(fresh) /* clear beam list for new view(s) */ |
| 140 |
> |
int fresh; |
| 141 |
|
{ |
| 170 |
– |
register PACKHEAD *pa; |
| 142 |
|
register int i; |
| 143 |
|
|
| 144 |
< |
if (n <= 0) |
| 145 |
< |
return; |
| 146 |
< |
pa = (PACKHEAD *)malloc(n*sizeof(PACKHEAD)); |
| 147 |
< |
if (pa == NULL) |
| 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 = bl[i].nr; |
| 182 |
< |
pa[i].nc = 0; |
| 183 |
< |
} |
| 184 |
< |
serv_request(op, n*sizeof(PACKHEAD), (char *)pa); |
| 185 |
< |
free((char *)pa); |
| 186 |
< |
} |
| 187 |
< |
|
| 188 |
< |
|
| 189 |
< |
add_voxels(vp) /* add voxels corresponding to view point */ |
| 190 |
< |
FVECT vp; |
| 191 |
< |
{ |
| 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 && voxel[first].hd >= 0; first++) |
| 200 |
< |
; |
| 201 |
< |
/* find closest voxels */ |
| 202 |
< |
for (n = first, i = 0; n < MAXVOXEL && hdlist[i]; i++) { |
| 203 |
< |
hdgrid(gp, hdlist[i], vp); |
| 204 |
< |
for (j = 0; n < MAXVOXEL && j < 8; j++) { |
| 205 |
< |
dist = 0; |
| 206 |
< |
for (k = 0; k < 3; k++) { |
| 207 |
< |
d = gp[k] - .5 + (j>>k & 1); |
| 208 |
< |
if (d < 0.) |
| 209 |
< |
dist += -(vox.i[k] = (int)d - 1); |
| 210 |
< |
else if ((vox.i[k] = d) >= hdlist[i]->grid[k]) |
| 211 |
< |
dist += vox.i[k] - |
| 212 |
< |
hdlist[i]->grid[k] + 1; |
| 213 |
< |
} |
| 214 |
< |
if (dist > bestd) /* others were closer */ |
| 215 |
< |
continue; |
| 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 (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) { |
| 229 |
< |
rfl |= 1<<k; |
| 230 |
< |
continue; |
| 231 |
< |
} |
| 232 |
< |
vox.hd = i; /* add this voxel */ |
| 233 |
< |
copystruct(&voxel[n], &vox); |
| 234 |
< |
rfl |= 1<<n++; |
| 235 |
< |
} |
| 236 |
< |
} |
| 237 |
< |
/* check for really stupid move */ |
| 238 |
< |
if (bestd > MAXDIST) { |
| 239 |
< |
error(COMMAND, "move past outer limits"); |
| 240 |
< |
return(0); |
| 241 |
< |
} |
| 242 |
< |
if (n < MAXVOXEL) |
| 243 |
< |
voxel[n].hd = -1; |
| 244 |
< |
return(rfl); |
| 245 |
< |
} |
| 246 |
< |
|
| 247 |
< |
|
| 248 |
< |
int |
| 249 |
< |
dobeam(gcp, bp) /* express interest or disintrest in a beam */ |
| 250 |
< |
GCOORD *gcp; |
| 251 |
< |
register struct beamact *bp; |
| 252 |
< |
{ |
| 253 |
< |
GCOORD gc[2]; |
| 254 |
< |
int bi, i, n; |
| 255 |
< |
/* compute beam index */ |
| 256 |
< |
if (bp->ca.rev) { |
| 257 |
< |
copystruct(gc, &bp->gc); |
| 258 |
< |
copystruct(gc+1, gcp); |
| 259 |
< |
} else { |
| 260 |
< |
copystruct(gc, gcp); |
| 261 |
< |
copystruct(gc+1, &bp->gc); |
| 262 |
< |
} |
| 263 |
< |
if ((bi = hdbindex(hdlist[voxel[bp->ca.vi].hd], gc)) <= 0) |
| 264 |
< |
error(CONSISTENCY, "bad grid coordinate in dobeam"); |
| 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) |
| 144 |
> |
if (fresh) /* discard old beams? */ |
| 145 |
> |
ncbeams = xcbeams = 0; |
| 146 |
> |
else /* else clear sample requests */ |
| 147 |
> |
for (i = ncbeams+xcbeams; i--; ) |
| 148 |
|
cbeam[i].nr = 0; |
| 149 |
< |
return(1); /* indicate change */ |
| 281 |
< |
} |
| 282 |
< |
return(0); |
| 149 |
> |
cureye.rng = 0.; |
| 150 |
|
} |
| 151 |
|
|
| 152 |
|
|
| 153 |
< |
|
| 287 |
< |
int |
| 288 |
< |
docell(gcp, cap) /* find beams corresponding to cell and voxel */ |
| 289 |
< |
GCOORD *gcp; |
| 290 |
< |
register struct cellact *cap; |
| 291 |
< |
{ |
| 292 |
< |
register HOLO *hp = hdlist[voxel[cap->vi].hd]; |
| 293 |
< |
FVECT org, dir[4]; |
| 294 |
< |
FVECT vgp, cgp, vc; |
| 295 |
< |
FVECT v1, v2; |
| 296 |
< |
struct beamact bo; |
| 297 |
< |
int axmax, j; |
| 298 |
< |
double d, avmax; |
| 299 |
< |
register int i; |
| 300 |
< |
/* compute cell center */ |
| 301 |
< |
cgp[gcp->w>>1] = gcp->w&1 ? hp->grid[gcp->w>>1] : 0 ; |
| 302 |
< |
cgp[hdwg0[gcp->w]] = gcp->i[0] + .5; |
| 303 |
< |
cgp[hdwg1[gcp->w]] = gcp->i[1] + .5; |
| 304 |
< |
hdworld(org, hp, cgp); |
| 305 |
< |
/* compute direction to voxel center */ |
| 306 |
< |
for (i = 3; i--; ) |
| 307 |
< |
vgp[i] = voxel[cap->vi].i[i] + .5; |
| 308 |
< |
hdworld(vc, hp, vgp); |
| 309 |
< |
for (i = 3; i--; ) |
| 310 |
< |
vc[i] -= org[i]; |
| 311 |
< |
/* compute maximum area axis */ |
| 312 |
< |
axmax = -1; avmax = 0; |
| 313 |
< |
for (i = 3; i--; ) { |
| 314 |
< |
d = vgp[i] - cgp[i]; |
| 315 |
< |
if (d < 0.) d = -d; |
| 316 |
< |
if (d > avmax) { |
| 317 |
< |
avmax = d; |
| 318 |
< |
axmax = i; |
| 319 |
< |
} |
| 320 |
< |
} |
| 321 |
< |
#ifdef DEBUG |
| 322 |
< |
if (axmax < 0.) |
| 323 |
< |
error(CONSISTENCY, "botched axis computation in docell"); |
| 324 |
< |
#endif |
| 325 |
< |
/* compute offset vectors */ |
| 326 |
< |
d = 0.5/hp->grid[j=(axmax+1)%3]; |
| 327 |
< |
for (i = 3; i--; ) |
| 328 |
< |
v1[i] = hp->xv[j][i] * d; |
| 329 |
< |
d = 0.5/hp->grid[j=(axmax+2)%3]; |
| 330 |
< |
if (DOT(hp->wg[axmax], vc) < 0.) |
| 331 |
< |
d = -d; /* reverse vertex order */ |
| 332 |
< |
for (i = 3; i--; ) |
| 333 |
< |
v2[i] = hp->xv[j][i] * d; |
| 334 |
< |
/* compute voxel pyramid */ |
| 335 |
< |
for (i = 3; i--; ) { |
| 336 |
< |
dir[0][i] = vc[i] - v1[i] - v2[i]; |
| 337 |
< |
dir[1][i] = vc[i] + v1[i] - v2[i]; |
| 338 |
< |
dir[2][i] = vc[i] + v1[i] + v2[i]; |
| 339 |
< |
dir[3][i] = vc[i] - v1[i] + v2[i]; |
| 340 |
< |
} |
| 341 |
< |
/* visit beams for opposite cells */ |
| 342 |
< |
copystruct(&bo.ca, cap); |
| 343 |
< |
copystruct(&bo.gc, gcp); |
| 344 |
< |
return(visit_cells(org, dir, hp, dobeam, &bo)); |
| 345 |
< |
} |
| 346 |
< |
|
| 347 |
< |
|
| 348 |
< |
int |
| 349 |
< |
doview(cap) /* visit cells for a given view */ |
| 350 |
< |
struct cellact *cap; |
| 351 |
< |
{ |
| 352 |
< |
int orient; |
| 353 |
< |
FVECT org, dir[4]; |
| 354 |
< |
/* compute view pyramid */ |
| 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; |
| 359 |
< |
/* visit cells within pyramid */ |
| 360 |
< |
return(visit_cells(org, dir, hdlist[voxel[cap->vi].hd], docell, cap)); |
| 361 |
< |
} |
| 362 |
< |
|
| 363 |
< |
|
| 364 |
< |
beam_init() /* clear beam list for new view(s) */ |
| 365 |
< |
{ |
| 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 |
< |
|
| 153 |
> |
int2 * |
| 154 |
|
beam_view(vn, hr, vr) /* add beam view (if advisable) */ |
| 155 |
|
VIEW *vn; |
| 156 |
|
int hr, vr; |
| 157 |
|
{ |
| 158 |
< |
struct cellact ca; |
| 159 |
< |
int vfl; |
| 160 |
< |
/* sort our list */ |
| 158 |
> |
int2 *slist; |
| 159 |
> |
BEAMLIST blist; |
| 160 |
> |
double eravg, d; |
| 161 |
> |
register HOLO *hp; |
| 162 |
> |
register int i, n; |
| 163 |
> |
/* compute beams for view */ |
| 164 |
> |
slist = viewbeams(vn, hr, vr, &blist); |
| 165 |
> |
if (*slist < 0) { |
| 166 |
> |
error(COMMAND, "no sections visible from this view"); |
| 167 |
> |
return(NULL); |
| 168 |
> |
} |
| 169 |
> |
/* sort current beam list */ |
| 170 |
|
cbeamsort(1); |
| 171 |
< |
/* add new voxels */ |
| 172 |
< |
vfl = add_voxels(vn->vp); |
| 173 |
< |
if (!vfl) |
| 174 |
< |
return(0); |
| 175 |
< |
ca.vp = vn; ca.hr = hr; ca.vr = vr; |
| 176 |
< |
ca.add = 1; /* update our beam list */ |
| 177 |
< |
for (ca.vi = 0; vfl; vfl >>= 1, ca.vi++) |
| 178 |
< |
if (vfl & 1) |
| 179 |
< |
doview(&ca); |
| 180 |
< |
return(1); |
| 171 |
> |
/* add new beams to list */ |
| 172 |
> |
for (i = blist.nb; i--; ) { |
| 173 |
> |
n = getcbeam(blist.bl[i].hd, blist.bl[i].bi); |
| 174 |
> |
if (blist.bl[i].nr > cbeam[n].nr) |
| 175 |
> |
cbeam[n].nr = blist.bl[i].nr; |
| 176 |
> |
} |
| 177 |
> |
free((char *)blist.bl); /* free list */ |
| 178 |
> |
if (MEYERNG <= FTINY) |
| 179 |
> |
return(slist); |
| 180 |
> |
/* compute average eye range */ |
| 181 |
> |
eravg = 0.; |
| 182 |
> |
for (n = 0; slist[n] >= 0; n++) { |
| 183 |
> |
hp = hdlist[slist[n]]; |
| 184 |
> |
eravg += MEYERNG/3. / VLEN(hp->wg[0]) + |
| 185 |
> |
MEYERNG/3. / VLEN(hp->wg[1]) + |
| 186 |
> |
MEYERNG/3. / VLEN(hp->wg[2]) ; |
| 187 |
> |
} |
| 188 |
> |
eravg /= (double)n; |
| 189 |
> |
/* add to current eye position */ |
| 190 |
> |
if (cureye.rng <= FTINY) { |
| 191 |
> |
VCOPY(cureye.vpt, vn->vp); |
| 192 |
> |
cureye.rng = eravg; |
| 193 |
> |
} else if ((d = sqrt(dist2(vn->vp,cureye.vpt))) + eravg > cureye.rng) { |
| 194 |
> |
for (i = 3; i--; ) |
| 195 |
> |
cureye.vpt[i] = 0.5*(cureye.vpt[i] + vn->vp[i]); |
| 196 |
> |
cureye.rng = 0.5*(cureye.rng + eravg + d); |
| 197 |
> |
} |
| 198 |
> |
return(slist); |
| 199 |
|
} |
| 200 |
|
|
| 201 |
|
|
| 203 |
|
beam_sync(all) /* update beam list on server */ |
| 204 |
|
int all; |
| 205 |
|
{ |
| 206 |
< |
/* sort list to put orphans at end */ |
| 207 |
< |
cbeamsort(0); |
| 208 |
< |
if (all) |
| 209 |
< |
cbeamop(DR_NEWSET, cbeam, ncbeams); |
| 210 |
< |
else |
| 211 |
< |
cbeamop(DR_ADJSET, cbeam, ncbeams+xcbeams); |
| 206 |
> |
/* set new eye position */ |
| 207 |
> |
serv_request(DR_VIEWPOINT, sizeof(VIEWPOINT), (char *)&cureye); |
| 208 |
> |
/* sort list (put orphans at end) */ |
| 209 |
> |
cbeamsort(all < 0); |
| 210 |
> |
/* send beam request */ |
| 211 |
> |
if (all) { |
| 212 |
> |
if (ncbeams > 0) |
| 213 |
> |
serv_request(DR_NEWSET, |
| 214 |
> |
ncbeams*sizeof(PACKHEAD), cbeam); |
| 215 |
> |
} else { |
| 216 |
> |
if (ncbeams+xcbeams > 0) |
| 217 |
> |
serv_request(DR_ADJSET, |
| 218 |
> |
(ncbeams+xcbeams)*sizeof(PACKHEAD), cbeam); |
| 219 |
> |
} |
| 220 |
|
xcbeams = 0; /* truncate our list */ |
| 221 |
|
return(ncbeams); |
| 222 |
+ |
} |
| 223 |
+ |
|
| 224 |
+ |
|
| 225 |
+ |
gridlines(f) /* run through holodeck section grid lines */ |
| 226 |
+ |
int (*f)(); |
| 227 |
+ |
{ |
| 228 |
+ |
register int hd, w, i; |
| 229 |
+ |
int g0, g1; |
| 230 |
+ |
FVECT wp[2], mov; |
| 231 |
+ |
double d; |
| 232 |
+ |
/* do each wall on each section */ |
| 233 |
+ |
for (hd = 0; hdlist[hd] != NULL; hd++) |
| 234 |
+ |
for (w = 0; w < 6; w++) { |
| 235 |
+ |
g0 = hdwg0[w]; |
| 236 |
+ |
g1 = hdwg1[w]; |
| 237 |
+ |
d = 1.0/hdlist[hd]->grid[g0]; |
| 238 |
+ |
mov[0] = d * hdlist[hd]->xv[g0][0]; |
| 239 |
+ |
mov[1] = d * hdlist[hd]->xv[g0][1]; |
| 240 |
+ |
mov[2] = d * hdlist[hd]->xv[g0][2]; |
| 241 |
+ |
if (w & 1) { |
| 242 |
+ |
VSUM(wp[0], hdlist[hd]->orig, |
| 243 |
+ |
hdlist[hd]->xv[w>>1], 1.); |
| 244 |
+ |
VSUM(wp[0], wp[0], mov, 1.); |
| 245 |
+ |
} else |
| 246 |
+ |
VCOPY(wp[0], hdlist[hd]->orig); |
| 247 |
+ |
VSUM(wp[1], wp[0], hdlist[hd]->xv[g1], 1.); |
| 248 |
+ |
for (i = hdlist[hd]->grid[g0]; ; ) { /* g0 lines */ |
| 249 |
+ |
(*f)(wp); |
| 250 |
+ |
if (!--i) break; |
| 251 |
+ |
wp[0][0] += mov[0]; wp[0][1] += mov[1]; |
| 252 |
+ |
wp[0][2] += mov[2]; wp[1][0] += mov[0]; |
| 253 |
+ |
wp[1][1] += mov[1]; wp[1][2] += mov[2]; |
| 254 |
+ |
} |
| 255 |
+ |
d = 1.0/hdlist[hd]->grid[g1]; |
| 256 |
+ |
mov[0] = d * hdlist[hd]->xv[g1][0]; |
| 257 |
+ |
mov[1] = d * hdlist[hd]->xv[g1][1]; |
| 258 |
+ |
mov[2] = d * hdlist[hd]->xv[g1][2]; |
| 259 |
+ |
if (w & 1) |
| 260 |
+ |
VSUM(wp[0], hdlist[hd]->orig, |
| 261 |
+ |
hdlist[hd]->xv[w>>1], 1.); |
| 262 |
+ |
else |
| 263 |
+ |
VSUM(wp[0], hdlist[hd]->orig, mov, 1.); |
| 264 |
+ |
VSUM(wp[1], wp[0], hdlist[hd]->xv[g0], 1.); |
| 265 |
+ |
for (i = hdlist[hd]->grid[g1]; ; ) { /* g1 lines */ |
| 266 |
+ |
(*f)(wp); |
| 267 |
+ |
if (!--i) break; |
| 268 |
+ |
wp[0][0] += mov[0]; wp[0][1] += mov[1]; |
| 269 |
+ |
wp[0][2] += mov[2]; wp[1][0] += mov[0]; |
| 270 |
+ |
wp[1][1] += mov[1]; wp[1][2] += mov[2]; |
| 271 |
+ |
} |
| 272 |
+ |
} |
| 273 |
|
} |
