| 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 |
|
} |
| 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); |
| 111 |
> |
*g2 = *(gc+1); |
| 112 |
> |
*(g2+1) = *gc; |
| 113 |
|
gc = g2; |
| 114 |
|
} else if (gc[0].w == gc[1].w) |
| 115 |
|
return(0); |
| 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; |