| 24 |
|
FVECT vpos; |
| 25 |
|
double d; |
| 26 |
|
register int i; |
| 27 |
< |
|
| 27 |
> |
nextsample: |
| 28 |
|
while (++si->sp >= si->np) { /* get next sample */ |
| 29 |
|
if (++si->sn >= nsources) |
| 30 |
|
return(0.0); /* no more */ |
| 31 |
< |
if (srcsizerat <= FTINY) |
| 31 |
> |
if (source[si->sn].sflags & SSKIP) |
| 32 |
> |
si->np = 0; |
| 33 |
> |
else if (srcsizerat <= FTINY) |
| 34 |
|
nopart(si, r); |
| 35 |
|
else { |
| 36 |
|
for (i = si->sn; source[i].sflags & SVIRTUAL; |
| 76 |
|
r->rdir[i] -= r->rorg[i]; |
| 77 |
|
/* compute distance */ |
| 78 |
|
if ((d = normalize(r->rdir)) == 0.0) |
| 79 |
< |
return(nextssamp(r, si)); /* at source! */ |
| 79 |
> |
goto nextsample; /* at source! */ |
| 80 |
|
|
| 81 |
|
/* compute sample size */ |
| 82 |
|
si->dom = source[si->sn].ss2; |
| 83 |
|
if (source[si->sn].sflags & SFLAT) { |
| 84 |
|
si->dom *= sflatform(si->sn, r->rdir); |
| 85 |
< |
si->dom *= (double)(size[SU]*size[SV])/(MAXSPART*MAXSPART); |
| 85 |
> |
si->dom *= size[SU]*size[SV]/(MAXSPART*(double)MAXSPART); |
| 86 |
|
} else if (source[si->sn].sflags & SCYL) { |
| 87 |
|
si->dom *= scylform(si->sn, r->rdir); |
| 88 |
< |
si->dom *= (double)size[SU]/MAXSPART; |
| 88 |
> |
si->dom *= size[SU]/(double)MAXSPART; |
| 89 |
|
} else { |
| 90 |
< |
si->dom *= (double)(size[SU]*size[SV]*size[SW]) / |
| 91 |
< |
(MAXSPART*MAXSPART*MAXSPART) ; |
| 90 |
> |
si->dom *= size[SU]*size[SV]*(double)size[SW] / |
| 91 |
> |
(MAXSPART*MAXSPART*(double)MAXSPART) ; |
| 92 |
|
} |
| 93 |
|
if (source[si->sn].sflags & SDISTANT) |
| 94 |
|
return(FHUGE); |
| 95 |
+ |
if (si->dom <= 1e-4) |
| 96 |
+ |
goto nextsample; /* behind source? */ |
| 97 |
|
si->dom /= d*d; |
| 98 |
|
return(d); /* sample OK, return distance */ |
| 99 |
|
} |
