10 |
|
* |
11 |
|
*/ |
12 |
|
|
13 |
+ |
#define _USE_MATH_DEFINES |
14 |
|
#include "rtio.h" |
15 |
|
#include <stdlib.h> |
16 |
|
#include <math.h> |
29 |
|
static const unsigned iwmax = (1<<(sizeof(unsigned)*4))-1; |
30 |
|
/* maximum cumulative value */ |
31 |
|
static const unsigned cumlmax = ~0; |
32 |
+ |
/* constant z-vector */ |
33 |
+ |
static const FVECT zvec = {.0, .0, 1.}; |
34 |
|
|
35 |
|
/* Struct used for our distribution-building callback */ |
36 |
|
typedef struct { |
193 |
|
const unsigned skipsiz = 1 << --nd*shft; |
194 |
|
double sum = .0; |
195 |
|
int i; |
196 |
< |
|
196 |
> |
|
197 |
> |
va += *imin * skipsiz; |
198 |
> |
|
199 |
|
if (skipsiz == 1) |
200 |
|
for (i = *imin; i < *imax; i++) |
201 |
< |
sum += va[i]; |
201 |
> |
sum += *va++; |
202 |
|
else |
203 |
< |
for (i = *imin; i < *imax; i++) |
204 |
< |
sum += SDiterSum(va + i*skipsiz, nd, shft, imin+1, imax+1); |
203 |
> |
for (i = *imin; i < *imax; i++, va += skipsiz) |
204 |
> |
sum += SDiterSum(va, nd, shft, imin+1, imax+1); |
205 |
|
return sum; |
206 |
|
} |
207 |
|
|
209 |
|
static double |
210 |
|
SDavgTreBox(const SDNode *st, const double *bmin, const double *bmax) |
211 |
|
{ |
207 |
– |
int imin[SD_MAXDIM], imax[SD_MAXDIM]; |
212 |
|
unsigned n; |
213 |
|
int i; |
214 |
|
|
226 |
|
if (st->log2GR < 0) { /* iterate on subtree */ |
227 |
|
double sum = .0, wsum = 1e-20; |
228 |
|
double sbmin[SD_MAXDIM], sbmax[SD_MAXDIM], w; |
225 |
– |
|
229 |
|
for (n = 1 << st->ndim; n--; ) { |
230 |
|
w = 1.; |
231 |
|
for (i = st->ndim; i--; ) { |
249 |
|
} |
250 |
|
} |
251 |
|
return sum / wsum; |
252 |
+ |
} else { /* iterate over leaves */ |
253 |
+ |
int imin[SD_MAXDIM], imax[SD_MAXDIM]; |
254 |
+ |
|
255 |
+ |
n = 1; |
256 |
+ |
for (i = st->ndim; i--; ) { |
257 |
+ |
imin[i] = (bmin[i] <= 0) ? 0 : |
258 |
+ |
(int)((1 << st->log2GR)*bmin[i]); |
259 |
+ |
imax[i] = (bmax[i] >= 1.) ? (1 << st->log2GR) : |
260 |
+ |
(int)((1 << st->log2GR)*bmax[i] + .999999); |
261 |
+ |
n *= imax[i] - imin[i]; |
262 |
+ |
} |
263 |
+ |
if (n) |
264 |
+ |
return SDiterSum(st->u.v, st->ndim, |
265 |
+ |
st->log2GR, imin, imax) / (double)n; |
266 |
|
} |
267 |
< |
n = 1; /* iterate over leaves */ |
251 |
< |
for (i = st->ndim; i--; ) { |
252 |
< |
imin[i] = (bmin[i] <= 0) ? 0 |
253 |
< |
: (int)((1 << st->log2GR)*bmin[i]); |
254 |
< |
imax[i] = (bmax[i] >= 1.) ? (1 << st->log2GR) |
255 |
< |
: (int)((1 << st->log2GR)*bmax[i] + .999999); |
256 |
< |
n *= imax[i] - imin[i]; |
257 |
< |
} |
258 |
< |
if (!n) |
259 |
< |
return .0; |
260 |
< |
|
261 |
< |
return SDiterSum(st->u.v, st->ndim, st->log2GR, imin, imax) / (double)n; |
267 |
> |
return .0; |
268 |
|
} |
269 |
|
|
270 |
|
/* Recursive call for SDtraverseTre() */ |
325 |
|
clim[i][0] = 0; |
326 |
|
clim[i][1] = 1 << st->log2GR; |
327 |
|
} |
322 |
– |
/* fill in unused dimensions */ |
323 |
– |
for (i = SD_MAXDIM; i-- > st->ndim; ) { |
324 |
– |
clim[i][0] = 0; clim[i][1] = 1; |
325 |
– |
} |
328 |
|
#if (SD_MAXDIM == 4) |
329 |
|
bmin[0] = cmin[0] + csiz*clim[0][0]; |
330 |
|
for (cpos[0] = clim[0][0]; cpos[0] < clim[0][1]; cpos[0]++) { |
331 |
|
bmin[1] = cmin[1] + csiz*clim[1][0]; |
332 |
|
for (cpos[1] = clim[1][0]; cpos[1] < clim[1][1]; cpos[1]++) { |
333 |
|
bmin[2] = cmin[2] + csiz*clim[2][0]; |
334 |
< |
for (cpos[2] = clim[2][0]; cpos[2] < clim[2][1]; cpos[2]++) { |
335 |
< |
bmin[3] = cmin[3] + csiz*(cpos[3] = clim[3][0]); |
334 |
> |
if (st->ndim == 3) { |
335 |
> |
cpos[2] = clim[2][0]; |
336 |
|
n = cpos[0]; |
337 |
< |
for (i = 1; i < st->ndim; i++) |
337 |
> |
for (i = 1; i < 3; i++) |
338 |
|
n = (n << st->log2GR) + cpos[i]; |
339 |
< |
for ( ; cpos[3] < clim[3][1]; cpos[3]++) { |
339 |
> |
for ( ; cpos[2] < clim[2][1]; cpos[2]++) { |
340 |
|
rval += rv = (*cf)(st->u.v[n++], bmin, csiz, cptr); |
341 |
|
if (rv < 0) |
342 |
|
return rv; |
343 |
< |
bmin[3] += csiz; |
343 |
> |
bmin[2] += csiz; |
344 |
|
} |
345 |
< |
bmin[2] += csiz; |
345 |
> |
} else { |
346 |
> |
for (cpos[2] = clim[2][0]; cpos[2] < clim[2][1]; cpos[2]++) { |
347 |
> |
bmin[3] = cmin[3] + csiz*(cpos[3] = clim[3][0]); |
348 |
> |
n = cpos[0]; |
349 |
> |
for (i = 1; i < 4; i++) |
350 |
> |
n = (n << st->log2GR) + cpos[i]; |
351 |
> |
for ( ; cpos[3] < clim[3][1]; cpos[3]++) { |
352 |
> |
rval += rv = (*cf)(st->u.v[n++], bmin, csiz, cptr); |
353 |
> |
if (rv < 0) |
354 |
> |
return rv; |
355 |
> |
bmin[3] += csiz; |
356 |
> |
} |
357 |
> |
bmin[2] += csiz; |
358 |
> |
} |
359 |
|
} |
360 |
|
bmin[1] += csiz; |
361 |
|
} |
430 |
|
static float |
431 |
|
SDqueryTre(const SDTre *sdt, const FVECT outVec, const FVECT inVec, double *hc) |
432 |
|
{ |
418 |
– |
static const FVECT zvec = {.0, .0, 1.}; |
433 |
|
FVECT rOutVec; |
434 |
|
double gridPos[4]; |
435 |
|
|
451 |
|
} |
452 |
|
/* convert vector coordinates */ |
453 |
|
if (sdt->st->ndim == 3) { |
454 |
< |
spinvector(rOutVec, outVec, zvec, -atan2(inVec[1],inVec[0])); |
454 |
> |
spinvector(rOutVec, outVec, zvec, -atan2(-inVec[1],-inVec[0])); |
455 |
|
gridPos[0] = .5 - .5*sqrt(inVec[0]*inVec[0] + inVec[1]*inVec[1]); |
456 |
|
SDdisk2square(gridPos+1, rOutVec[0], rOutVec[1]); |
457 |
|
} else if (sdt->st->ndim == 4) { |
564 |
|
free(myScaffold.darr); |
565 |
|
return NULL; |
566 |
|
} |
567 |
+ |
cd->isodist = (myScaffold.nic == 1); |
568 |
|
/* sort the distribution */ |
569 |
|
qsort(myScaffold.darr, cd->calen = myScaffold.alen, |
570 |
|
sizeof(struct outdir_s), &sscmp); |
575 |
|
cd->clim[i][0] = floor(pos[i]/scale) * scale; |
576 |
|
cd->clim[i][1] = cd->clim[i][0] + scale; |
577 |
|
} |
578 |
+ |
if (cd->isodist) { /* avoid issue in SDqueryTreProjSA() */ |
579 |
+ |
cd->clim[1][0] = cd->clim[0][0]; |
580 |
+ |
cd->clim[1][1] = cd->clim[0][1]; |
581 |
+ |
} |
582 |
|
cd->max_psa = myScaffold.wmax / (double)iwmax; |
583 |
|
cd->max_psa *= cd->max_psa * M_PI; |
584 |
|
cd->sidef = sdt->sidef; |
698 |
|
const SDTreCDst *cd = (const SDTreCDst *)cdp; |
699 |
|
const unsigned target = randX*cumlmax; |
700 |
|
bitmask_t hndx, hcoord[2]; |
701 |
< |
double gpos[3]; |
701 |
> |
double gpos[3], rotangle; |
702 |
|
int i, iupper, ilower; |
703 |
|
/* check arguments */ |
704 |
|
if ((ioVec == NULL) | (cd == NULL)) |
734 |
|
/* emit from back? */ |
735 |
|
if (ioVec[2] > 0 ^ cd->sidef != SD_XMIT) |
736 |
|
gpos[2] = -gpos[2]; |
737 |
< |
VCOPY(ioVec, gpos); |
737 |
> |
if (cd->isodist) { /* rotate isotropic result */ |
738 |
> |
rotangle = atan2(-ioVec[1],-ioVec[0]); |
739 |
> |
VCOPY(ioVec, gpos); |
740 |
> |
spinvector(ioVec, ioVec, zvec, rotangle); |
741 |
> |
} else |
742 |
> |
VCOPY(ioVec, gpos); |
743 |
|
return SDEnone; |
744 |
|
} |
745 |
|
|
809 |
|
} else { /* else load value grid */ |
810 |
|
int bsiz; |
811 |
|
n = count_values(*spp); /* see how big the grid is */ |
812 |
< |
for (bsiz = 0; bsiz < 8*sizeof(size_t)-1; bsiz += nd) |
812 |
> |
for (bsiz = 0; bsiz < 8*sizeof(size_t); bsiz += nd) |
813 |
|
if (1<<bsiz == n) |
814 |
|
break; |
815 |
|
if (bsiz >= 8*sizeof(size_t)) { |
986 |
|
SDsubtractTreVal(st->u.t[n], val); |
987 |
|
} else { |
988 |
|
for (n = 1<<(st->ndim*st->log2GR); n--; ) |
989 |
< |
st->u.v[n] -= val; |
989 |
> |
if ((st->u.v[n] -= val) < 0) |
990 |
> |
st->u.v[n] = .0f; |
991 |
|
} |
992 |
|
} |
993 |
|
|
1001 |
|
int n; |
1002 |
|
vmin = 1./M_PI; |
1003 |
|
if (st->log2GR < 0) { |
1004 |
< |
for (n = 0; n < 4; n++) { |
1004 |
> |
for (n = 0; n < 8; n += 2) { |
1005 |
|
float v = SDgetTreMin(st->u.t[n]); |
1006 |
|
if (v < vmin) |
1007 |
|
vmin = v; |