1 |
– |
/* Copyright (c) 1997 Silicon Graphics, Inc. */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ SGI"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
< |
* Holodeck beam tracking |
5 |
> |
* Holodeck beam tracking for display process |
6 |
|
*/ |
7 |
|
|
8 |
|
#include "rholo.h" |
9 |
|
#include "rhdisp.h" |
10 |
|
#include "rhdriver.h" |
11 |
|
|
12 |
< |
extern int *getviewcells(); |
12 |
> |
#ifndef MEYERNG |
13 |
> |
#define MEYERNG 0.2 /* target mean eye range (rel. to grid) */ |
14 |
> |
#endif |
15 |
|
|
17 |
– |
typedef struct { |
18 |
– |
int hd; /* holodeck section number */ |
19 |
– |
int i[3]; /* voxel index (may be outside section) */ |
20 |
– |
} VOXL; /* a voxel */ |
21 |
– |
|
22 |
– |
static VOXL voxel[8] = { /* current voxel list */ |
23 |
– |
{-1}, {-1}, {-1}, {-1}, |
24 |
– |
{-1}, {-1}, {-1}, {-1} |
25 |
– |
}; |
26 |
– |
|
16 |
|
#define CBEAMBLK 1024 /* cbeam allocation block size */ |
17 |
|
|
18 |
< |
static struct beamcomp { |
30 |
< |
short wants; /* flags telling which voxels want us */ |
31 |
< |
short hd; /* holodeck section number */ |
32 |
< |
int bi; /* beam index */ |
33 |
< |
} *cbeam = NULL; /* current beam list */ |
34 |
< |
|
18 |
> |
static PACKHEAD *cbeam = NULL; /* current beam list */ |
19 |
|
static int ncbeams = 0; /* number of sorted beams in cbeam */ |
20 |
|
static int xcbeams = 0; /* extra (unregistered) beams past ncbeams */ |
21 |
|
static int maxcbeam = 0; /* size of cbeam array */ |
22 |
|
|
23 |
+ |
VIEWPOINT cureye; /* current eye position */ |
24 |
|
|
25 |
< |
struct cellact { |
26 |
< |
short vi; /* voxel index */ |
27 |
< |
short add; /* zero means delete */ |
28 |
< |
}; /* action for cell */ |
25 |
> |
static int newcbeam(void); |
26 |
> |
static int cbeamcmp(const void *cb1, const void *cb2); |
27 |
> |
static int cbeamcmp2(const void *cb1, const void *cb2); |
28 |
> |
static int findcbeam(int hd, int bi); |
29 |
> |
static int getcbeam(int hd, int bi); |
30 |
> |
static void cbeamsort(int adopt); |
31 |
|
|
32 |
|
|
33 |
< |
struct beamact { |
34 |
< |
struct cellact ca; /* cell action */ |
48 |
< |
GCOORD gc; /* grid coordinate */ |
49 |
< |
}; /* beam origin and action */ |
50 |
< |
|
51 |
< |
|
52 |
< |
int |
53 |
< |
newcbeam() /* allocate new entry at end of cbeam array */ |
33 |
> |
static int |
34 |
> |
newcbeam(void) /* allocate new entry at end of cbeam array */ |
35 |
|
{ |
36 |
|
int i; |
37 |
|
|
38 |
|
if ((i = ncbeams + xcbeams++) >= maxcbeam) { /* grow array */ |
39 |
|
maxcbeam += CBEAMBLK; |
40 |
|
if (cbeam == NULL) |
41 |
< |
cbeam = (struct beamcomp *)malloc( |
42 |
< |
maxcbeam*sizeof(struct beamcomp) ); |
41 |
> |
cbeam = (PACKHEAD *)malloc( |
42 |
> |
maxcbeam*sizeof(PACKHEAD) ); |
43 |
|
else |
44 |
< |
cbeam = (struct beamcomp *)realloc( (char *)cbeam, |
45 |
< |
maxcbeam*sizeof(struct beamcomp) ); |
44 |
> |
cbeam = (PACKHEAD *)realloc((void *)cbeam, |
45 |
> |
maxcbeam*sizeof(PACKHEAD) ); |
46 |
|
if (cbeam == NULL) |
47 |
|
error(SYSTEM, "out of memory in newcbeam"); |
48 |
|
} |
50 |
|
} |
51 |
|
|
52 |
|
|
53 |
< |
int |
54 |
< |
cbeamcmp(cb1, cb2) /* compare two cbeam entries for sort: keep orphans */ |
55 |
< |
register struct beamcomp *cb1, *cb2; |
53 |
> |
static int |
54 |
> |
cbeamcmp( /* compare two cbeam entries for sort: keep orphans */ |
55 |
> |
const void *cb1, |
56 |
> |
const void *cb2 |
57 |
> |
) |
58 |
|
{ |
59 |
|
register int c; |
60 |
|
|
61 |
< |
if ((c = cb1->bi - cb2->bi)) /* sort on beam index first */ |
61 |
> |
if ((c = ((PACKHEAD*)cb1)->bi - ((PACKHEAD*)cb2)->bi)) /* sort on beam index first */ |
62 |
|
return(c); |
63 |
< |
return(cb1->hd - cb2->hd); /* use hd to resolve matches */ |
63 |
> |
return(((PACKHEAD*)cb1)->hd - ((PACKHEAD*)cb2)->hd); /* use hd to resolve matches */ |
64 |
|
} |
65 |
|
|
66 |
|
|
67 |
< |
int |
68 |
< |
cbeamcmp2(cb1, cb2) /* compare two cbeam entries for sort: no orphans */ |
69 |
< |
register struct beamcomp *cb1, *cb2; |
67 |
> |
static int |
68 |
> |
cbeamcmp2( /* compare two cbeam entries for sort: no orphans */ |
69 |
> |
const void *cb1, |
70 |
> |
const void *cb2 |
71 |
> |
) |
72 |
|
{ |
73 |
|
register int c; |
74 |
|
|
75 |
< |
if (!cb1->wants) /* put orphans at the end, unsorted */ |
76 |
< |
return(cb2->wants); |
77 |
< |
if ((c = cb1->bi - cb2->bi)) /* sort on beam index first */ |
75 |
> |
if (!((PACKHEAD*)cb1)->nr) /* put orphans at the end, unsorted */ |
76 |
> |
return(((PACKHEAD*)cb2)->nr); |
77 |
> |
if (!((PACKHEAD*)cb2)->nr) |
78 |
> |
return(-1); |
79 |
> |
if ((c = ((PACKHEAD*)cb1)->bi - ((PACKHEAD*)cb2)->bi)) /* sort on beam index first */ |
80 |
|
return(c); |
81 |
< |
return(cb1->hd - cb2->hd); /* use hd to resolve matches */ |
81 |
> |
return(((PACKHEAD*)cb1)->hd - ((PACKHEAD*)cb2)->hd); /* use hd to resolve matches */ |
82 |
|
} |
83 |
|
|
84 |
|
|
85 |
< |
int |
86 |
< |
findcbeam(hd, bi) /* find the specified beam in our sorted list */ |
87 |
< |
int hd, bi; |
85 |
> |
static int |
86 |
> |
findcbeam( /* find the specified beam in our sorted list */ |
87 |
> |
int hd, |
88 |
> |
int bi |
89 |
> |
) |
90 |
|
{ |
91 |
< |
struct beamcomp cb; |
92 |
< |
register struct beamcomp *p; |
91 |
> |
PACKHEAD cb; |
92 |
> |
register PACKHEAD *p; |
93 |
|
|
94 |
|
if (ncbeams <= 0) |
95 |
|
return(-1); |
96 |
< |
cb.wants = 0; cb.hd = hd; cb.bi = bi; |
97 |
< |
p = (struct beamcomp *)bsearch((char *)&cb, (char *)cbeam, ncbeams, |
98 |
< |
sizeof(struct beamcomp), cbeamcmp); |
96 |
> |
cb.hd = hd; cb.bi = bi; cb.nr = cb.nc = 0; |
97 |
> |
p = (PACKHEAD *)bsearch((char *)&cb, (char *)cbeam, ncbeams, |
98 |
> |
sizeof(PACKHEAD), cbeamcmp); |
99 |
|
if (p == NULL) |
100 |
|
return(-1); |
101 |
|
return(p - cbeam); |
102 |
|
} |
103 |
|
|
104 |
|
|
105 |
< |
int |
106 |
< |
getcbeam(hd, bi) /* get the specified beam, allocating as necessary */ |
107 |
< |
register int hd; |
108 |
< |
int bi; |
105 |
> |
static int |
106 |
> |
getcbeam( /* get the specified beam, allocating as necessary */ |
107 |
> |
register int hd, |
108 |
> |
int bi |
109 |
> |
) |
110 |
|
{ |
111 |
|
register int n; |
112 |
|
/* first, look in sorted list */ |
117 |
|
if (cbeam[n].bi == bi && cbeam[n].hd == hd) |
118 |
|
return(n); |
119 |
|
/* check legality */ |
120 |
< |
if (hd < 0 | hd >= HDMAX || hdlist[hd] == NULL) |
120 |
> |
if ((hd < 0) | (hd >= HDMAX) || hdlist[hd] == NULL) |
121 |
|
error(INTERNAL, "illegal holodeck number in getcbeam"); |
122 |
< |
if (bi < 1 | bi > nbeams(hdlist[hd])) |
122 |
> |
if ((bi < 1) | (bi > nbeams(hdlist[hd]))) |
123 |
|
error(INTERNAL, "illegal beam index in getcbeam"); |
124 |
|
n = newcbeam(); /* allocate and assign */ |
125 |
< |
cbeam[n].wants = 0; cbeam[n].hd = hd; cbeam[n].bi = bi; |
125 |
> |
cbeam[n].hd = hd; cbeam[n].bi = bi; cbeam[n].nr = cbeam[n].nc = 0; |
126 |
|
return(n); |
127 |
|
} |
128 |
|
|
129 |
|
|
130 |
< |
cbeamsort(adopt) /* sort our beam list, possibly turning out orphans */ |
131 |
< |
int adopt; |
130 |
> |
static void |
131 |
> |
cbeamsort( /* sort our beam list, possibly turning out orphans */ |
132 |
> |
int adopt |
133 |
> |
) |
134 |
|
{ |
135 |
|
register int i; |
136 |
|
|
137 |
|
if (!(ncbeams += xcbeams)) |
138 |
|
return; |
139 |
|
xcbeams = 0; |
140 |
< |
qsort((char *)cbeam, ncbeams, sizeof(struct beamcomp), |
140 |
> |
qsort((char *)cbeam, ncbeams, sizeof(PACKHEAD), |
141 |
|
adopt ? cbeamcmp : cbeamcmp2); |
142 |
|
if (adopt) |
143 |
|
return; |
144 |
|
for (i = ncbeams; i--; ) /* identify orphans */ |
145 |
< |
if (cbeam[i].wants) |
145 |
> |
if (cbeam[i].nr) |
146 |
|
break; |
147 |
|
xcbeams = ncbeams - ++i; /* put orphans after ncbeams */ |
148 |
|
ncbeams = i; |
149 |
|
} |
150 |
|
|
151 |
|
|
152 |
< |
cbeamadd(bl, n, v, hr, vr) /* add beams to server list */ |
153 |
< |
register struct beamcomp *bl; |
154 |
< |
int n; |
155 |
< |
VIEW *v; |
164 |
< |
int hr, vr; |
152 |
> |
extern void |
153 |
> |
beam_init( /* clear beam list for new view(s) */ |
154 |
> |
int fresh |
155 |
> |
) |
156 |
|
{ |
166 |
– |
register PACKHEAD *pa; |
157 |
|
register int i; |
158 |
|
|
159 |
< |
if (n <= 0) |
160 |
< |
return; |
161 |
< |
pa = (PACKHEAD *)malloc(n*sizeof(PACKHEAD)); |
162 |
< |
if (pa == NULL) |
163 |
< |
error(SYSTEM, "out of memory in cbeamadd"); |
164 |
< |
for (i = 0; i < n; i++) |
175 |
< |
pa[i].nr = npixels(v, hr, vr, |
176 |
< |
hdlist[pa[i].hd=bl[i].hd], |
177 |
< |
pa[i].bi=bl[i].bi) / 8; |
178 |
< |
|
179 |
< |
serv_request(DR_ADDSET, n*sizeof(PACKHEAD), (char *)pa); |
180 |
< |
free((char *)pa); |
159 |
> |
if (fresh) /* discard old beams? */ |
160 |
> |
ncbeams = xcbeams = 0; |
161 |
> |
else /* else clear sample requests */ |
162 |
> |
for (i = ncbeams+xcbeams; i--; ) |
163 |
> |
cbeam[i].nr = 0; |
164 |
> |
cureye.rng = 0.; |
165 |
|
} |
166 |
|
|
167 |
|
|
168 |
< |
cbeamdel(bl, n) /* delete unwanted beam requests */ |
169 |
< |
register struct beamcomp *bl; |
170 |
< |
int n; |
168 |
> |
extern int16 * |
169 |
> |
beam_view( /* add beam view (if advisable) */ |
170 |
> |
VIEW *vn, |
171 |
> |
int hr, |
172 |
> |
int vr |
173 |
> |
) |
174 |
|
{ |
175 |
< |
register PACKHEAD *pa; |
176 |
< |
register int i; |
177 |
< |
|
178 |
< |
if (n <= 0) |
179 |
< |
return; |
180 |
< |
pa = (PACKHEAD *)malloc(n*sizeof(PACKHEAD)); |
181 |
< |
if (pa == NULL) |
182 |
< |
error(SYSTEM, "out of memory in cbeamdel"); |
183 |
< |
for (i = 0; i < n; i++) { |
184 |
< |
pa[i].hd = bl[i].hd; |
198 |
< |
pa[i].bi = bl[i].bi; |
199 |
< |
pa[i].nr = 0; /* removes any request */ |
175 |
> |
int16 *slist; |
176 |
> |
BEAMLIST blist; |
177 |
> |
double eravg, d; |
178 |
> |
register HOLO *hp; |
179 |
> |
register int i, n; |
180 |
> |
/* compute beams for view */ |
181 |
> |
slist = viewbeams(vn, hr, vr, &blist); |
182 |
> |
if (*slist < 0) { |
183 |
> |
error(COMMAND, "no sections visible from this view"); |
184 |
> |
return(NULL); |
185 |
|
} |
186 |
< |
serv_request(DR_DELSET, n*sizeof(PACKHEAD), (char *)pa); |
187 |
< |
free((char *)pa); |
188 |
< |
} |
189 |
< |
|
190 |
< |
|
191 |
< |
int |
192 |
< |
set_voxels(vl, n) /* set new voxel array */ |
208 |
< |
VOXL vl[8]; |
209 |
< |
int n; |
210 |
< |
{ |
211 |
< |
short wmap[256]; |
212 |
< |
int vmap[8]; |
213 |
< |
int comn = 0; |
214 |
< |
int no; |
215 |
< |
register int i, j; |
216 |
< |
/* find common voxels */ |
217 |
< |
for (j = 0; j < 8 && voxel[j].hd >= 0; j++) { |
218 |
< |
vmap[j] = -1; |
219 |
< |
for (i = n; i--; ) |
220 |
< |
if (!bcmp((char *)(vl+i), (char *)(voxel+j), |
221 |
< |
sizeof(VOXL))) { |
222 |
< |
vmap[j] = i; |
223 |
< |
comn |= 1<<i; |
224 |
< |
break; |
225 |
< |
} |
186 |
> |
/* sort current beam list */ |
187 |
> |
cbeamsort(1); |
188 |
> |
/* add new beams to list */ |
189 |
> |
for (i = blist.nb; i--; ) { |
190 |
> |
n = getcbeam(blist.bl[i].hd, blist.bl[i].bi); |
191 |
> |
if (blist.bl[i].nr > cbeam[n].nr) |
192 |
> |
cbeam[n].nr = blist.bl[i].nr; |
193 |
|
} |
194 |
< |
no = comn ? j : 0; /* compute flag mapping */ |
195 |
< |
for (i = 256; i--; ) { |
196 |
< |
wmap[i] = 0; |
197 |
< |
for (j = no; j--; ) |
198 |
< |
if (vmap[j] >= 0 && i & 1<<j) |
199 |
< |
wmap[i] |= 1<<vmap[j]; |
194 |
> |
free((void *)blist.bl); /* free list */ |
195 |
> |
if (MEYERNG <= FTINY) |
196 |
> |
return(slist); |
197 |
> |
/* compute average eye range */ |
198 |
> |
eravg = 0.; |
199 |
> |
for (n = 0; slist[n] >= 0; n++) { |
200 |
> |
hp = hdlist[slist[n]]; |
201 |
> |
eravg += MEYERNG/3. / VLEN(hp->wg[0]) + |
202 |
> |
MEYERNG/3. / VLEN(hp->wg[1]) + |
203 |
> |
MEYERNG/3. / VLEN(hp->wg[2]) ; |
204 |
|
} |
205 |
< |
/* fix cbeam flags */ |
206 |
< |
for (i = ncbeams; i--; ) |
207 |
< |
cbeam[i].wants = wmap[cbeam[i].wants]; |
208 |
< |
/* update our voxel list */ |
209 |
< |
bcopy((char *)vl, (char *)voxel, n*sizeof(VOXL)); |
210 |
< |
for (j = n; j < 8; j++) |
211 |
< |
voxel[j].hd = -1; |
212 |
< |
return(comn); /* return bit array of common voxels */ |
213 |
< |
} |
243 |
< |
|
244 |
< |
|
245 |
< |
int |
246 |
< |
get_voxels(vl, vp) /* find voxels corresponding to view point */ |
247 |
< |
VOXL vl[8]; |
248 |
< |
FVECT vp; |
249 |
< |
{ |
250 |
< |
int n = 0; |
251 |
< |
FVECT gp; |
252 |
< |
double d; |
253 |
< |
int dist, bestd = 0x7fff; |
254 |
< |
VOXL vox; |
255 |
< |
register int i, j, k; |
256 |
< |
/* find closest voxels */ |
257 |
< |
for (i = 0; n < 8 && hdlist[i]; i++) { |
258 |
< |
hdgrid(gp, hdlist[i], vp); |
259 |
< |
for (j = 0; n < 8 && j < 8; j++) { |
260 |
< |
dist = 0; |
261 |
< |
for (k = 0; k < 3; k++) { |
262 |
< |
d = gp[k] - .5 + (j>>k & 1); |
263 |
< |
if (d < 0.) |
264 |
< |
dist += -(vox.i[k] = (int)d - 1); |
265 |
< |
else if ((vox.i[k] = d) >= hdlist[i]->grid[k]) |
266 |
< |
dist += vox.i[k] - |
267 |
< |
hdlist[i]->grid[k] + 1; |
268 |
< |
} |
269 |
< |
if (dist > bestd) /* others were closer */ |
270 |
< |
continue; |
271 |
< |
if (dist < bestd) { /* start closer list */ |
272 |
< |
n = 0; |
273 |
< |
bestd = dist; |
274 |
< |
} |
275 |
< |
vox.hd = i; /* add this voxel */ |
276 |
< |
copystruct(&vl[n], &vox); |
277 |
< |
n++; |
278 |
< |
} |
205 |
> |
eravg /= (double)n; |
206 |
> |
/* add to current eye position */ |
207 |
> |
if (cureye.rng <= FTINY) { |
208 |
> |
VCOPY(cureye.vpt, vn->vp); |
209 |
> |
cureye.rng = eravg; |
210 |
> |
} else if ((d = sqrt(dist2(vn->vp,cureye.vpt))) + eravg > cureye.rng) { |
211 |
> |
for (i = 3; i--; ) |
212 |
> |
cureye.vpt[i] = 0.5*(cureye.vpt[i] + vn->vp[i]); |
213 |
> |
cureye.rng = 0.5*(cureye.rng + eravg + d); |
214 |
|
} |
215 |
< |
return(n); |
215 |
> |
return(slist); |
216 |
|
} |
217 |
|
|
218 |
|
|
219 |
< |
int |
220 |
< |
dobeam(gcp, bp) /* express interest or disintrest in a beam */ |
221 |
< |
GCOORD *gcp; |
222 |
< |
register struct beamact *bp; |
219 |
> |
extern int |
220 |
> |
beam_sync( /* update beam list on server */ |
221 |
> |
int all |
222 |
> |
) |
223 |
|
{ |
224 |
< |
GCOORD gc[2]; |
225 |
< |
int bi, i; |
226 |
< |
/* compute beam index */ |
227 |
< |
copystruct(gc, gcp); |
228 |
< |
copystruct(gc+1, &bp->gc); |
229 |
< |
if ((bi = hdbindex(hdlist[voxel[bp->ca.vi].hd], gc)) <= 0) |
230 |
< |
return(0); /* should report an error? */ |
231 |
< |
if (bp->ca.add) { /* add it in */ |
232 |
< |
i = getcbeam(voxel[bp->ca.vi].hd, bi); |
298 |
< |
cbeam[i].wants |= 1<<bp->ca.vi; /* say we want it */ |
299 |
< |
return(i == ncbeams+xcbeams-1); /* return 1 if totally new */ |
300 |
< |
} |
301 |
< |
/* else delete it */ |
302 |
< |
i = findcbeam(voxel[bp->ca.vi].hd, bi); |
303 |
< |
if (i >= 0 && cbeam[i].wants & 1<<bp->ca.vi) { |
304 |
< |
cbeam[i].wants &= ~(1<<bp->ca.vi); /* we don't want it */ |
305 |
< |
return(1); /* indicate change */ |
306 |
< |
} |
307 |
< |
return(0); |
308 |
< |
} |
309 |
< |
|
310 |
< |
|
311 |
< |
|
312 |
< |
int |
313 |
< |
docell(gcp, cap) /* find beams corresponding to cell and voxel */ |
314 |
< |
GCOORD *gcp; |
315 |
< |
register struct cellact *cap; |
316 |
< |
{ |
317 |
< |
FVECT org, dir[4]; |
318 |
< |
FVECT gp, cv[4], vc; |
319 |
< |
struct beamact bo; |
320 |
< |
register int i; |
321 |
< |
/* compute cell vertices */ |
322 |
< |
hdcell(cv, hdlist[voxel[cap->vi].hd], gcp); |
323 |
< |
/* compute cell and voxel centers */ |
324 |
< |
for (i = 0; i < 3; i++) { |
325 |
< |
org[i] = 0.5*(cv[0][i] + cv[2][i]); |
326 |
< |
gp[i] = voxel[cap->vi].i[i] + 0.5; |
327 |
< |
} |
328 |
< |
hdworld(vc, hdlist[voxel[cap->vi].hd], gp); |
329 |
< |
/* compute voxel pyramid using vector trick */ |
330 |
< |
for (i = 0; i < 3; i++) { |
331 |
< |
dir[0][i] = vc[i] - cv[0][i]; /* to 3 */ |
332 |
< |
dir[2][i] = vc[i] - cv[3][i]; /* to 0 */ |
333 |
< |
if (gcp->w & 1) { /* watch vertex order! */ |
334 |
< |
dir[1][i] = vc[i] - cv[2][i]; /* to 1 */ |
335 |
< |
dir[3][i] = vc[i] - cv[1][i]; /* to 2 */ |
336 |
< |
} else { |
337 |
< |
dir[1][i] = vc[i] - cv[1][i]; /* to 2 */ |
338 |
< |
dir[3][i] = vc[i] - cv[2][i]; /* to 1 */ |
339 |
< |
} |
340 |
< |
} |
341 |
< |
/* visit beams for opposite cells */ |
342 |
< |
copystruct(&bo.ca, cap); |
343 |
< |
copystruct(&bo.gc, gcp); |
344 |
< |
return(visit_cells(org, dir, hdlist[voxel[cap->vi].hd], dobeam, &bo)); |
345 |
< |
} |
346 |
< |
|
347 |
< |
|
348 |
< |
int |
349 |
< |
doview(cap, vp) /* visit cells for a given view */ |
350 |
< |
struct cellact *cap; |
351 |
< |
VIEW *vp; |
352 |
< |
{ |
353 |
< |
FVECT org, dir[4]; |
354 |
< |
/* compute view pyramid */ |
355 |
< |
if (vp->type == VT_PAR) goto viewerr; |
356 |
< |
if (viewray(org, dir[0], vp, 0., 0.) < -FTINY) goto viewerr; |
357 |
< |
if (viewray(org, dir[1], vp, 0., 1.) < -FTINY) goto viewerr; |
358 |
< |
if (viewray(org, dir[2], vp, 1., 1.) < -FTINY) goto viewerr; |
359 |
< |
if (viewray(org, dir[3], vp, 1., 0.) < -FTINY) goto viewerr; |
360 |
< |
/* visit cells within pyramid */ |
361 |
< |
return(visit_cells(org, dir, hdlist[voxel[cap->vi].hd], docell, cap)); |
362 |
< |
viewerr: |
363 |
< |
error(INTERNAL, "unusable view in doview"); |
364 |
< |
} |
365 |
< |
|
366 |
< |
|
367 |
< |
mvview(voxi, vold, vnew) /* move view for a voxel */ |
368 |
< |
int voxi; |
369 |
< |
VIEW *vold, *vnew; |
370 |
< |
{ |
371 |
< |
int netchange = 0; |
372 |
< |
int *ocl, *ncl; |
373 |
< |
struct cellact ca; |
374 |
< |
int ocnt, ncnt; |
375 |
< |
int c; |
376 |
< |
register GCOORD *ogcp, *ngcp; |
377 |
< |
/* get old and new cell lists */ |
378 |
< |
ocl = getviewcells(hdlist[voxel[voxi].hd], vold); |
379 |
< |
ncl = getviewcells(hdlist[voxel[voxi].hd], vnew); |
380 |
< |
if (ocl != NULL) { |
381 |
< |
ocnt = *ocl; ogcp = (GCOORD *)(ocl+1); |
224 |
> |
/* set new eye position */ |
225 |
> |
serv_request(DR_VIEWPOINT, sizeof(VIEWPOINT), (char *)&cureye); |
226 |
> |
/* sort list (put orphans at end) */ |
227 |
> |
cbeamsort(all < 0); |
228 |
> |
/* send beam request */ |
229 |
> |
if (all) { |
230 |
> |
if (ncbeams > 0) |
231 |
> |
serv_request(DR_NEWSET, |
232 |
> |
ncbeams*sizeof(PACKHEAD), (char *)cbeam); |
233 |
|
} else { |
234 |
< |
ocnt = 0; ogcp = NULL; |
234 |
> |
if (ncbeams+xcbeams > 0) |
235 |
> |
serv_request(DR_ADJSET, |
236 |
> |
(ncbeams+xcbeams)*sizeof(PACKHEAD), (char *)cbeam); |
237 |
|
} |
238 |
< |
if (ncl != NULL) { |
239 |
< |
ncnt = *ncl; ngcp = (GCOORD *)(ncl+1); |
387 |
< |
} else { |
388 |
< |
ncnt = 0; ngcp = NULL; |
389 |
< |
} |
390 |
< |
ca.vi = voxi; /* add and delete cells */ |
391 |
< |
while (ocnt > 0 & ncnt > 0) |
392 |
< |
if ((c = cellcmp(ogcp, ngcp)) > 0) { |
393 |
< |
ca.add = 1; /* new cell */ |
394 |
< |
netchange += docell(ngcp++, &ca); |
395 |
< |
ncnt--; |
396 |
< |
} else if (c < 0) { |
397 |
< |
ca.add = 0; /* obsolete cell */ |
398 |
< |
netchange -= docell(ogcp++, &ca); |
399 |
< |
ocnt--; |
400 |
< |
} else { |
401 |
< |
ogcp++; ocnt--; /* unchanged cell */ |
402 |
< |
ngcp++; ncnt--; |
403 |
< |
} |
404 |
< |
/* take care of list tails */ |
405 |
< |
for (ca.add = 1; ncnt > 0; ncnt--) |
406 |
< |
docell(ngcp++, &ca); |
407 |
< |
for (ca.add = 0; ocnt > 0; ocnt--) |
408 |
< |
docell(ogcp++, &ca); |
409 |
< |
/* clean up */ |
410 |
< |
if (ocl != NULL) free((char *)ocl); |
411 |
< |
if (ncl != NULL) free((char *)ncl); |
412 |
< |
return(netchange); |
238 |
> |
xcbeams = 0; /* truncate our list */ |
239 |
> |
return(ncbeams); |
240 |
|
} |
241 |
|
|
242 |
|
|
243 |
< |
beam_view(vo, vn) /* change beam view */ |
244 |
< |
VIEW *vo, *vn; |
243 |
> |
extern void |
244 |
> |
gridlines( /* run through holodeck section grid lines */ |
245 |
> |
void (*f)(FVECT wp[2]) |
246 |
> |
) |
247 |
|
{ |
248 |
< |
struct cellact ca; |
249 |
< |
VOXL vlnew[8]; |
250 |
< |
int n, comn; |
251 |
< |
|
252 |
< |
if (!vn->type) { /* clear our beam list */ |
253 |
< |
set_voxels(vlnew, 0); |
254 |
< |
cbeamdel(cbeam, ncbeams); |
255 |
< |
ncbeams = 0; |
256 |
< |
return; |
257 |
< |
} |
258 |
< |
/* find our new voxels */ |
259 |
< |
n = get_voxels(vlnew, vn->vp); |
260 |
< |
/* set the new voxels */ |
261 |
< |
comn = set_voxels(vlnew, n); |
262 |
< |
if (!vo->type) |
263 |
< |
comn = 0; |
264 |
< |
ca.add = 1; /* update our beam list */ |
265 |
< |
for (ca.vi = n; ca.vi--; ) |
266 |
< |
if (comn & 1<<ca.vi) /* change which cells we see */ |
267 |
< |
mvview(ca.vi, vo, vn); |
268 |
< |
else /* else add all new cells */ |
269 |
< |
doview(&ca, vn); |
270 |
< |
/* inform server of new beams */ |
271 |
< |
cbeamadd(cbeam+ncbeams, xcbeams, vn, odev.hres, odev.vres); |
272 |
< |
/* sort list to put orphans at end */ |
273 |
< |
cbeamsort(0); |
274 |
< |
/* tell server to delete orphans */ |
275 |
< |
cbeamdel(cbeam+ncbeams, xcbeams); |
276 |
< |
xcbeams = 0; /* truncate our list */ |
248 |
> |
register int hd, w, i; |
249 |
> |
int g0, g1; |
250 |
> |
FVECT wp[2], mov; |
251 |
> |
double d; |
252 |
> |
/* do each wall on each section */ |
253 |
> |
for (hd = 0; hdlist[hd] != NULL; hd++) |
254 |
> |
for (w = 0; w < 6; w++) { |
255 |
> |
g0 = hdwg0[w]; |
256 |
> |
g1 = hdwg1[w]; |
257 |
> |
d = 1.0/hdlist[hd]->grid[g0]; |
258 |
> |
mov[0] = d * hdlist[hd]->xv[g0][0]; |
259 |
> |
mov[1] = d * hdlist[hd]->xv[g0][1]; |
260 |
> |
mov[2] = d * hdlist[hd]->xv[g0][2]; |
261 |
> |
if (w & 1) { |
262 |
> |
VSUM(wp[0], hdlist[hd]->orig, |
263 |
> |
hdlist[hd]->xv[w>>1], 1.); |
264 |
> |
VSUM(wp[0], wp[0], mov, 1.); |
265 |
> |
} else |
266 |
> |
VCOPY(wp[0], hdlist[hd]->orig); |
267 |
> |
VSUM(wp[1], wp[0], hdlist[hd]->xv[g1], 1.); |
268 |
> |
for (i = hdlist[hd]->grid[g0]; ; ) { /* g0 lines */ |
269 |
> |
(*f)(wp); |
270 |
> |
if (!--i) break; |
271 |
> |
wp[0][0] += mov[0]; wp[0][1] += mov[1]; |
272 |
> |
wp[0][2] += mov[2]; wp[1][0] += mov[0]; |
273 |
> |
wp[1][1] += mov[1]; wp[1][2] += mov[2]; |
274 |
> |
} |
275 |
> |
d = 1.0/hdlist[hd]->grid[g1]; |
276 |
> |
mov[0] = d * hdlist[hd]->xv[g1][0]; |
277 |
> |
mov[1] = d * hdlist[hd]->xv[g1][1]; |
278 |
> |
mov[2] = d * hdlist[hd]->xv[g1][2]; |
279 |
> |
if (w & 1) |
280 |
> |
VSUM(wp[0], hdlist[hd]->orig, |
281 |
> |
hdlist[hd]->xv[w>>1], 1.); |
282 |
> |
else |
283 |
> |
VSUM(wp[0], hdlist[hd]->orig, mov, 1.); |
284 |
> |
VSUM(wp[1], wp[0], hdlist[hd]->xv[g0], 1.); |
285 |
> |
for (i = hdlist[hd]->grid[g1]; ; ) { /* g1 lines */ |
286 |
> |
(*f)(wp); |
287 |
> |
if (!--i) break; |
288 |
> |
wp[0][0] += mov[0]; wp[0][1] += mov[1]; |
289 |
> |
wp[0][2] += mov[2]; wp[1][0] += mov[0]; |
290 |
> |
wp[1][1] += mov[1]; wp[1][2] += mov[2]; |
291 |
> |
} |
292 |
> |
} |
293 |
|
} |