373 |
|
if (dta == NULL) { /* free all if NULL */ |
374 |
|
hval = 0; nents = TABSIZ; |
375 |
|
} else { |
376 |
+ |
if (dta->next == dta) { |
377 |
+ |
free(dta); /* unlisted temp array */ |
378 |
+ |
return; |
379 |
+ |
} |
380 |
|
hval = hash(dta->name); nents = 1; |
381 |
+ |
if (!*dta->name) { /* not a data file? */ |
382 |
+ |
dta->next = dtab[hval]; |
383 |
+ |
dtab[hval] = dta; /* ...fake position */ |
384 |
+ |
} |
385 |
|
} |
386 |
|
while (nents--) { |
387 |
|
head.next = dtab[hval]; |
402 |
|
} |
403 |
|
|
404 |
|
|
405 |
< |
double |
406 |
< |
datavalue( /* interpolate data value at a point */ |
407 |
< |
DATARRAY *dp, |
400 |
< |
double *pt |
401 |
< |
) |
405 |
> |
/* internal call to interpolate data value or vector */ |
406 |
> |
static double |
407 |
> |
data_interp(DATARRAY *dp, double *pt, double coef, DATATYPE *rvec) |
408 |
|
{ |
409 |
< |
DATARRAY sd; |
410 |
< |
int asize; |
411 |
< |
int lower, upper; |
412 |
< |
int i; |
413 |
< |
double x, y0, y1; |
409 |
> |
DATARRAY sd; |
410 |
> |
int stride, i; |
411 |
> |
double x, c0, c1, y0, y1; |
412 |
> |
/* unlikely, but may as well check */ |
413 |
> |
if ((-FTINY <= coef) & (coef <= FTINY)) |
414 |
> |
return(0.); |
415 |
|
/* set up dimensions for recursion */ |
416 |
|
if (dp->nd > 1) { |
417 |
|
sd.name = dp->name; |
418 |
|
sd.type = dp->type; |
419 |
|
sd.nd = dp->nd - 1; |
420 |
< |
asize = 1; |
421 |
< |
for (i = 0; i < sd.nd; i++) { |
422 |
< |
sd.dim[i].org = dp->dim[i+1].org; |
423 |
< |
sd.dim[i].siz = dp->dim[i+1].siz; |
417 |
< |
sd.dim[i].p = dp->dim[i+1].p; |
418 |
< |
asize *= (sd.dim[i].ne = dp->dim[i+1].ne) + |
419 |
< |
((sd.type==SPECTY) & (i==sd.nd-1)); |
420 |
< |
} |
420 |
> |
memcpy(sd.dim, dp->dim+1, sd.nd*sizeof(struct dadim)); |
421 |
> |
stride = sd.dim[i = sd.nd-1].ne + (sd.type==SPECTY); |
422 |
> |
while (i-- > 0) |
423 |
> |
stride *= sd.dim[i].ne; |
424 |
|
} |
425 |
|
/* get independent variable */ |
426 |
|
if (dp->dim[0].p == NULL) { /* evenly spaced points */ |
432 |
|
else if (i > dp->dim[0].ne - 2) |
433 |
|
i = dp->dim[0].ne - 2; |
434 |
|
} else { /* unevenly spaced points */ |
435 |
< |
if (dp->dim[0].siz > 0.0) { |
435 |
> |
int lower, upper; |
436 |
> |
if (dp->dim[0].siz > 0.) { |
437 |
|
lower = 0; |
438 |
|
upper = dp->dim[0].ne; |
439 |
|
} else { |
454 |
|
x = i + (pt[0] - dp->dim[0].p[i]) / |
455 |
|
(dp->dim[0].p[i+1] - dp->dim[0].p[i]); |
456 |
|
} |
457 |
+ |
/* |
458 |
+ |
* Compute interpolation coefficients: |
459 |
+ |
* extrapolate as far as one division, then |
460 |
+ |
* taper off harmonically to zero. |
461 |
+ |
*/ |
462 |
+ |
if (x > i+2) { |
463 |
+ |
c0 = 1./(i-1 - x); |
464 |
+ |
c1 = -2.*c0; |
465 |
+ |
} else if (x < i-1) { |
466 |
+ |
c1 = 1./(i - x); |
467 |
+ |
c0 = -2.*c1; |
468 |
+ |
} else { |
469 |
+ |
c0 = i+1 - x; |
470 |
+ |
c1 = x - i; |
471 |
+ |
} |
472 |
+ |
c0 *= coef; |
473 |
+ |
c1 *= coef; |
474 |
+ |
/* check if vector interp */ |
475 |
+ |
if ((dp->nd == 2) & (rvec != NULL)) { |
476 |
+ |
if (dp->type == DATATY) { |
477 |
+ |
sd.arr.d = dp->arr.d + i*stride; |
478 |
+ |
for (i = sd.dim[0].ne; i--; ) |
479 |
+ |
rvec[i] += c0*sd.arr.d[i] |
480 |
+ |
+ c1*sd.arr.d[i+stride]; |
481 |
+ |
} else if (dp->type == SPECTY) { |
482 |
+ |
double f; |
483 |
+ |
sd.arr.s = dp->arr.s + i*stride; |
484 |
+ |
if ((sd.arr.s[sd.dim[0].ne] > 0) & ((-FTINY>c0)|(c0>FTINY))) { |
485 |
+ |
f = ldexp(c0, (int)sd.arr.s[sd.dim[0].ne]-(COLXS+8)); |
486 |
+ |
for (i = sd.dim[0].ne; i--; ) |
487 |
+ |
rvec[i] += f*(sd.arr.s[i] + .5); |
488 |
+ |
} |
489 |
+ |
sd.arr.s += stride; |
490 |
+ |
if ((sd.arr.s[sd.dim[0].ne] > 0) & ((-FTINY>c1)|(c1>FTINY))) { |
491 |
+ |
f = ldexp(c1, (int)sd.arr.s[sd.dim[0].ne]-(COLXS+8)); |
492 |
+ |
for (i = sd.dim[0].ne; i--; ) |
493 |
+ |
rvec[i] += f*(sd.arr.s[i] + .5); |
494 |
+ |
} |
495 |
+ |
} else { |
496 |
+ |
sd.arr.c = dp->arr.c + i*stride; |
497 |
+ |
for (i = sd.dim[0].ne; i--; ) |
498 |
+ |
rvec[i] += c0*colrval(sd.arr.c[i],sd.type) |
499 |
+ |
+ c1*colrval(sd.arr.c[i+stride],sd.type); |
500 |
+ |
} |
501 |
+ |
return(0.); /* return value ignored */ |
502 |
+ |
} |
503 |
|
/* get dependent variable */ |
504 |
|
if (dp->nd > 1) { |
505 |
|
if (dp->type == DATATY) { |
506 |
< |
sd.arr.d = dp->arr.d + i*asize; |
507 |
< |
y0 = datavalue(&sd, pt+1); |
508 |
< |
sd.arr.d += asize; |
459 |
< |
y1 = datavalue(&sd, pt+1); |
506 |
> |
sd.arr.d = dp->arr.d + i*stride; |
507 |
> |
y0 = data_interp(&sd, pt+1, c0, rvec); |
508 |
> |
sd.arr.d += stride; |
509 |
|
} else if (dp->type == SPECTY) { |
510 |
< |
sd.arr.s = dp->arr.s + i*asize; |
511 |
< |
y0 = datavalue(&sd, pt+1); |
512 |
< |
sd.arr.s += asize; |
464 |
< |
y1 = datavalue(&sd, pt+1); |
510 |
> |
sd.arr.s = dp->arr.s + i*stride; |
511 |
> |
y0 = data_interp(&sd, pt+1, c0, rvec); |
512 |
> |
sd.arr.s += stride; |
513 |
|
} else { |
514 |
< |
sd.arr.c = dp->arr.c + i*asize; |
515 |
< |
y0 = datavalue(&sd, pt+1); |
516 |
< |
sd.arr.c += asize; |
469 |
< |
y1 = datavalue(&sd, pt+1); |
514 |
> |
sd.arr.c = dp->arr.c + i*stride; |
515 |
> |
y0 = data_interp(&sd, pt+1, c0, rvec); |
516 |
> |
sd.arr.c += stride; |
517 |
|
} |
518 |
< |
} else { |
518 |
> |
y1 = data_interp(&sd, pt+1, c1, rvec); |
519 |
> |
} else { /* end of recursion */ |
520 |
|
if (dp->type == DATATY) { |
521 |
|
y0 = dp->arr.d[i]; |
522 |
|
y1 = dp->arr.d[i+1]; |
523 |
|
} else if (dp->type == SPECTY) { |
524 |
|
if (dp->arr.s[dp->dim[0].ne]) { |
525 |
< |
double f = ldexp(1.0, -(COLXS+8) + |
526 |
< |
(int)dp->arr.s[dp->dim[0].ne]); |
527 |
< |
y0 = (dp->arr.s[i] + 0.5)*f; |
528 |
< |
y1 = (dp->arr.s[i+1] + 0.5)*f; |
525 |
> |
double f = dp->arr.s[dp->dim[0].ne] |
526 |
> |
? ldexp(1., -(COLXS+8) + |
527 |
> |
(int)dp->arr.s[dp->dim[0].ne]) |
528 |
> |
: 0.; |
529 |
> |
y0 = f*(dp->arr.s[i] + 0.5); |
530 |
> |
y1 = f*(dp->arr.s[i+1] + 0.5); |
531 |
|
} else |
532 |
< |
y0 = y1 = 0.0; |
532 |
> |
y0 = y1 = 0.; |
533 |
|
} else { |
534 |
|
y0 = colrval(dp->arr.c[i],dp->type); |
535 |
|
y1 = colrval(dp->arr.c[i+1],dp->type); |
536 |
|
} |
537 |
+ |
y0 *= c0; |
538 |
+ |
y1 *= c1; |
539 |
|
} |
540 |
< |
/* |
541 |
< |
* Extrapolate as far as one division, then |
490 |
< |
* taper off harmonically to zero. |
491 |
< |
*/ |
492 |
< |
if (x > i+2) |
493 |
< |
return( (2*y1-y0)/(x-(i-1)) ); |
540 |
> |
return(y0 + y1); /* coefficients already applied */ |
541 |
> |
} |
542 |
|
|
495 |
– |
if (x < i-1) |
496 |
– |
return( (2*y0-y1)/(i-x) ); |
543 |
|
|
544 |
< |
return( y0*((i+1)-x) + y1*(x-i) ); |
544 |
> |
double |
545 |
> |
datavalue( /* interpolate data value at a point */ |
546 |
> |
DATARRAY *dp, |
547 |
> |
double *pt |
548 |
> |
) |
549 |
> |
{ |
550 |
> |
return(data_interp(dp, pt, 1., NULL)); |
551 |
|
} |
552 |
+ |
|
553 |
+ |
|
554 |
+ |
/* Interpolate final vector corresponding to last dimension in data array */ |
555 |
+ |
DATARRAY * |
556 |
+ |
datavector(DATARRAY *dp, double *pt) |
557 |
+ |
{ |
558 |
+ |
DATARRAY *newdp; |
559 |
+ |
|
560 |
+ |
if (dp->nd < 2) |
561 |
+ |
error(INTERNAL, "datavector() called with 1-D array"); |
562 |
+ |
/* create vector array */ |
563 |
+ |
newdp = (DATARRAY *)malloc(sizeof(DATARRAY) - |
564 |
+ |
(MAXDDIM-1)*sizeof(struct dadim) + |
565 |
+ |
sizeof(DATATYPE)*dp->dim[dp->nd-1].ne); |
566 |
+ |
if (newdp == NULL) |
567 |
+ |
error(SYSTEM, "out of memory in datavector"); |
568 |
+ |
newdp->next = newdp; /* flags us as temp vector */ |
569 |
+ |
newdp->name = dp->name; |
570 |
+ |
newdp->type = DATATY; |
571 |
+ |
newdp->nd = 1; /* vector data goes here */ |
572 |
+ |
newdp->dim[0] = dp->dim[dp->nd-1]; |
573 |
+ |
newdp->arr.d = (DATATYPE *)(newdp->dim + 1); |
574 |
+ |
memset(newdp->arr.d, 0, sizeof(DATATYPE)*newdp->dim[0].ne); |
575 |
+ |
|
576 |
+ |
(void)data_interp(dp, pt, 1., newdp->arr.d); |
577 |
+ |
|
578 |
+ |
return(newdp); /* will be free'd using free() */ |
579 |
+ |
} |
580 |
+ |
|