| 115 |
|
if (!(inflags & 1<<gc.w)) /* origin on wrong side */ |
| 116 |
|
continue; |
| 117 |
|
/* scanline algorithm */ |
| 118 |
< |
for (gc.i[1] = hp->grid[((gc.w>>1)+2)%3]; gc.i[1]--; ) { |
| 118 |
> |
for (gc.i[1] = hp->grid[hdwg1[gc.w]]; gc.i[1]--; ) { |
| 119 |
|
/* compute scanline */ |
| 120 |
|
gp[gc.w>>1] = gc.w&1 ? hp->grid[gc.w>>1] : 0; |
| 121 |
< |
gp[((gc.w>>1)+1)%3] = 0; |
| 122 |
< |
gp[((gc.w>>1)+2)%3] = gc.i[1] + 0.5; |
| 121 |
> |
gp[hdwg0[gc.w]] = 0; |
| 122 |
> |
gp[hdwg1[gc.w]] = gc.i[1] + 0.5; |
| 123 |
|
hdworld(lo, hp, gp); |
| 124 |
< |
gp[((gc.w>>1)+1)%3] = 1; |
| 124 |
> |
gp[hdwg0[gc.w]] = 1; |
| 125 |
|
hdworld(ld, hp, gp); |
| 126 |
|
ld[0] -= lo[0]; ld[1] -= lo[1]; ld[2] -= lo[2]; |
| 127 |
|
/* find scanline limits */ |
| 128 |
< |
lbeg = 0; lend = hp->grid[((gc.w>>1)+1)%3]; |
| 128 |
> |
lbeg = 0; lend = hp->grid[hdwg0[gc.w]]; |
| 129 |
|
for (i = 0; i < 4; i++) { |
| 130 |
|
t = DOT(pn[i], lo) - po[i]; |
| 131 |
|
d = -DOT(pn[i], ld); |
| 299 |
|
/* do each wall on each section */ |
| 300 |
|
for (hd = 0; hdlist[hd] != NULL; hd++) |
| 301 |
|
for (w = 0; w < 6; w++) { |
| 302 |
< |
g0 = ((w>>1)+1)%3; |
| 303 |
< |
g1 = ((w>>1)+2)%3; |
| 302 |
> |
g0 = hdwg0[w]; |
| 303 |
> |
g1 = hdwg1[w]; |
| 304 |
|
d = 1.0/hdlist[hd]->grid[g0]; |
| 305 |
|
mov[0] = d * hdlist[hd]->xv[g0][0]; |
| 306 |
|
mov[1] = d * hdlist[hd]->xv[g0][1]; |
