28 |
|
|
29 |
|
int rayqleft = 0; /* rays left to queue before flush */ |
30 |
|
|
31 |
< |
static int4 falleaves; /* our list of fallen leaves */ |
31 |
> |
static int32 falleaves; /* our list of fallen leaves */ |
32 |
|
|
33 |
|
#define composted(li) (qtL.bl <= qtL.tl ? \ |
34 |
|
((li) < qtL.bl || (li) >= qtL.tl) : \ |
92 |
|
} |
93 |
|
|
94 |
|
|
95 |
< |
#define LEAFSIZ (3*sizeof(float)+sizeof(int4)+\ |
95 |
> |
#define LEAFSIZ (3*sizeof(float)+sizeof(int32)+\ |
96 |
|
sizeof(TMbright)+6*sizeof(BYTE)) |
97 |
|
|
98 |
|
int |
119 |
|
return(0); |
120 |
|
/* assign larger alignment types earlier */ |
121 |
|
qtL.wp = (float (*)[3])qtL.base; |
122 |
< |
qtL.wd = (int4 *)(qtL.wp + n); |
122 |
> |
qtL.wd = (int32 *)(qtL.wp + n); |
123 |
|
qtL.brt = (TMbright *)(qtL.wd + n); |
124 |
|
qtL.chr = (BYTE (*)[3])(qtL.brt + n); |
125 |
|
qtL.rgb = (BYTE (*)[3])(qtL.chr + n); |
166 |
|
qtCompost(pct) /* free up some leaves */ |
167 |
|
int pct; |
168 |
|
{ |
169 |
< |
register int4 *fl; |
169 |
> |
register int32 *fl; |
170 |
|
int nused, nclear, nmapped; |
171 |
|
/* figure out how many leaves to clear */ |
172 |
|
nclear = qtL.nl * pct / 100; |