10 |
|
|
11 |
|
|
12 |
|
static void redraw(RTREE *tp, int x0, int y0, int x1, int y1, int l[2][2]); |
13 |
< |
static void update( BYTE ca[3], RTREE *tp, int x0, int y0, int x1, int y1); |
13 |
> |
static void update( uby8 ca[3], RTREE *tp, int x0, int y0, int x1, int y1); |
14 |
|
|
15 |
|
|
16 |
|
static void |
17 |
|
redraw( /* mark portion of a tree for redraw */ |
18 |
< |
register RTREE *tp, |
18 |
> |
RTREE *tp, |
19 |
|
int x0, |
20 |
|
int y0, |
21 |
|
int x1, |
25 |
|
{ |
26 |
|
int quads = CH_ANY; |
27 |
|
int mx, my; |
28 |
< |
register int i; |
28 |
> |
int i; |
29 |
|
/* compute midpoint */ |
30 |
|
mx = (x0 + x1) >> 1; |
31 |
|
my = (y0 + y1) >> 1; |
49 |
|
|
50 |
|
static void |
51 |
|
update( /* update tree display as needed */ |
52 |
< |
BYTE ca[3], /* returned average color */ |
53 |
< |
register RTREE *tp, |
52 |
> |
uby8 ca[3], /* returned average color */ |
53 |
> |
RTREE *tp, |
54 |
|
int x0, |
55 |
|
int y0, |
56 |
|
int x1, |
58 |
|
) |
59 |
|
{ |
60 |
|
int csm[3], nc; |
61 |
< |
register BYTE *cp; |
62 |
< |
BYTE rgb[3]; |
61 |
> |
uby8 *cp; |
62 |
> |
uby8 rgb[3]; |
63 |
|
double dpth2[4], d2; |
64 |
|
int gaps = 0; |
65 |
|
int mx, my; |
66 |
< |
register int i; |
66 |
> |
int i; |
67 |
|
/* compute leaf depths */ |
68 |
|
d2 = FHUGE*FHUGE; |
69 |
|
for (i = 0; i < 4; i++) |
70 |
|
if (tp->flgs & LFF(i)) { |
71 |
|
FVECT dv; |
72 |
< |
register float *wp = qtL.wp[tp->k[i].li]; |
72 |
> |
float *wp = qtL.wp[tp->k[i].li]; |
73 |
|
|
74 |
|
dv[0] = wp[0] - odev.v.vp[0]; |
75 |
|
dv[1] = wp[1] - odev.v.vp[1]; |
117 |
|
} |
118 |
|
|
119 |
|
|
120 |
< |
extern void |
120 |
> |
void |
121 |
|
qtRedraw( /* redraw part or all of our screen */ |
122 |
|
int x0, |
123 |
|
int y0, |
136 |
|
} |
137 |
|
|
138 |
|
|
139 |
< |
extern void |
139 |
> |
void |
140 |
|
qtUpdate(void) /* update our tree display */ |
141 |
|
{ |
142 |
< |
BYTE ca[3]; |
142 |
> |
uby8 ca[3]; |
143 |
|
|
144 |
|
if (is_stump(&qtrunk)) |
145 |
|
return; |