1 |
– |
/* Copyright (c) 1998 Silicon Graphics, Inc. */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ SGI"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* Routines for converting holodeck coordinates, etc. |
6 |
|
* |
35 |
|
for (i = 0; i < 3; i++) { |
36 |
|
fcross(hp->wg[i], hp->xv[(i+1)%3], hp->xv[(i+2)%3]); |
37 |
|
d = DOT(hp->wg[i],hp->xv[i]); |
38 |
< |
if (d <= FTINY & d >= -FTINY) |
38 |
> |
if ((d <= FTINY) & (d >= -FTINY)) |
39 |
|
error(USER, "degenerate holodeck section"); |
40 |
|
d = hp->grid[i] / d; |
41 |
|
hp->wg[i][0] *= d; hp->wg[i][1] *= d; hp->wg[i][2] *= d; |
54 |
|
} |
55 |
|
|
56 |
|
|
60 |
– |
HOLO * |
61 |
– |
hdalloc(hproto) /* allocate and set holodeck section based on grid */ |
62 |
– |
HDGRID *hproto; |
63 |
– |
{ |
64 |
– |
HOLO hdhead; |
65 |
– |
register HOLO *hp; |
66 |
– |
int n; |
67 |
– |
/* copy grid to temporary header */ |
68 |
– |
bcopy((char *)hproto, (char *)&hdhead, sizeof(HDGRID)); |
69 |
– |
/* compute grid vectors and sizes */ |
70 |
– |
hdcompgrid(&hdhead); |
71 |
– |
/* allocate header with directory */ |
72 |
– |
n = sizeof(HOLO)+nbeams(&hdhead)*sizeof(BEAMI); |
73 |
– |
if ((hp = (HOLO *)malloc(n)) == NULL) |
74 |
– |
return(NULL); |
75 |
– |
/* copy header information */ |
76 |
– |
copystruct(hp, &hdhead); |
77 |
– |
/* allocate and clear beam list */ |
78 |
– |
hp->bl = (BEAM **)malloc((nbeams(hp)+1)*sizeof(BEAM *)+sizeof(BEAM)); |
79 |
– |
if (hp->bl == NULL) { |
80 |
– |
free((char *)hp); |
81 |
– |
return(NULL); |
82 |
– |
} |
83 |
– |
bzero((char *)hp->bl, (nbeams(hp)+1)*sizeof(BEAM *)+sizeof(BEAM)); |
84 |
– |
hp->bl[0] = (BEAM *)(hp->bl+nbeams(hp)+1); /* set blglob(hp) */ |
85 |
– |
hp->fd = -1; |
86 |
– |
hp->dirty = 0; |
87 |
– |
hp->priv = NULL; |
88 |
– |
/* clear beam directory */ |
89 |
– |
bzero((char *)hp->bi, (nbeams(hp)+1)*sizeof(BEAMI)); |
90 |
– |
return(hp); /* all is well */ |
91 |
– |
} |
92 |
– |
|
93 |
– |
|
57 |
|
hdbcoord(gc, hp, i) /* compute beam coordinates from index */ |
58 |
|
GCOORD gc[2]; /* returned */ |
59 |
|
register HOLO *hp; |
63 |
|
int n2, reverse; |
64 |
|
GCOORD g2[2]; |
65 |
|
/* check range */ |
66 |
< |
if (i < 1 | i > nbeams(hp)) |
66 |
> |
if ((i < 1) | (i > nbeams(hp))) |
67 |
|
return(0); |
68 |
< |
if (reverse = i >= hp->wi[5]) |
68 |
> |
if ( (reverse = i >= hp->wi[5]) ) |
69 |
|
i -= hp->wi[5] - 1; |
70 |
|
for (j = 0; j < 5; j++) /* find w0 */ |
71 |
|
if (hp->wi[j+1] > i) |
90 |
|
gc[1].i[1] = i / hp->grid[hdwg0[gc[1].w]]; |
91 |
|
gc[1].i[0] = i - gc[1].i[1]*hp->grid[hdwg0[gc[1].w]]; |
92 |
|
if (reverse) { |
93 |
< |
copystruct(g2, gc+1); |
94 |
< |
copystruct(gc+1, gc); |
95 |
< |
copystruct(gc, g2); |
93 |
> |
*g2 = *(gc+1); |
94 |
> |
*(gc+1) = *gc; |
95 |
> |
*gc = *g2; |
96 |
|
} |
97 |
|
return(1); /* we're done */ |
98 |
|
} |
107 |
|
int reverse; |
108 |
|
register int i, j; |
109 |
|
/* check ordering and limits */ |
110 |
< |
if (reverse = gc[0].w > gc[1].w) { |
111 |
< |
copystruct(g2, gc+1); |
112 |
< |
copystruct(g2+1, gc); |
110 |
> |
if ( (reverse = gc[0].w > gc[1].w) ) { |
111 |
> |
*g2 = *(gc+1); |
112 |
> |
*(g2+1) = *gc; |
113 |
|
gc = g2; |
114 |
|
} else if (gc[0].w == gc[1].w) |
115 |
|
return(0); |
116 |
< |
if (gc[0].w < 0 | gc[1].w > 5) |
116 |
> |
if ((gc[0].w < 0) | (gc[1].w > 5)) |
117 |
|
return(0); |
118 |
|
i = 0; /* compute index */ |
119 |
|
for (j = gc[0].w+1; j < gc[1].w; j++) |
134 |
|
register HOLO *hp; |
135 |
|
register GCOORD *gc; |
136 |
|
{ |
137 |
< |
register FLOAT *v; |
137 |
> |
register RREAL *v; |
138 |
|
double d; |
139 |
|
/* compute common component */ |
140 |
|
VCOPY(cp[0], hp->orig); |
263 |
|
{ |
264 |
|
FVECT p[2], vt; |
265 |
|
double d, t0, t1, d0, d1; |
266 |
< |
register FLOAT *v; |
266 |
> |
register RREAL *v; |
267 |
|
register int i; |
268 |
|
/* first, intersect walls */ |
269 |
|
gc[0].w = gc[1].w = -1; |
296 |
|
} |
297 |
|
} |
298 |
|
} |
299 |
< |
if (gc[0].w < 0 | gc[1].w < 0) /* paranoid check */ |
299 |
> |
if ((gc[0].w < 0) | (gc[1].w < 0)) /* paranoid check */ |
300 |
|
return(FHUGE); |
301 |
|
/* compute intersections */ |
302 |
|
VSUM(p[0], ro, rd, t0); |