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; |
406 |
< |
int i; |
407 |
< |
double x, y0, y1; |
409 |
> |
DATARRAY sd; |
410 |
> |
int stride, i; |
411 |
> |
double x, c0, c1, y0, y1; |
412 |
|
/* set up dimensions for recursion */ |
413 |
|
if (dp->nd > 1) { |
414 |
|
sd.name = dp->name; |
415 |
|
sd.type = dp->type; |
416 |
|
sd.nd = dp->nd - 1; |
417 |
< |
asize = 1; |
418 |
< |
for (i = 0; i < sd.nd; i++) { |
419 |
< |
sd.dim[i].org = dp->dim[i+1].org; |
420 |
< |
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 |
< |
} |
417 |
> |
memcpy(sd.dim, dp->dim+1, sd.nd*sizeof(struct dadim)); |
418 |
> |
stride = sd.dim[i = sd.nd-1].ne + (sd.type==SPECTY); |
419 |
> |
while (i-- > 0) |
420 |
> |
stride *= sd.dim[i].ne; |
421 |
|
} |
422 |
|
/* get independent variable */ |
423 |
|
if (dp->dim[0].p == NULL) { /* evenly spaced points */ |
429 |
|
else if (i > dp->dim[0].ne - 2) |
430 |
|
i = dp->dim[0].ne - 2; |
431 |
|
} else { /* unevenly spaced points */ |
432 |
+ |
int lower, upper; |
433 |
|
if (dp->dim[0].siz > 0.0) { |
434 |
|
lower = 0; |
435 |
|
upper = dp->dim[0].ne; |
451 |
|
x = i + (pt[0] - dp->dim[0].p[i]) / |
452 |
|
(dp->dim[0].p[i+1] - dp->dim[0].p[i]); |
453 |
|
} |
454 |
+ |
/* |
455 |
+ |
* Compute interpolation coefficients: |
456 |
+ |
* extrapolate as far as one division, then |
457 |
+ |
* taper off harmonically to zero. |
458 |
+ |
*/ |
459 |
+ |
if (x > i+2) { |
460 |
+ |
c0 = 1./(i-1 - x); |
461 |
+ |
c1 = -2.*c0; |
462 |
+ |
} else if (x < i-1) { |
463 |
+ |
c1 = 1./(i - x); |
464 |
+ |
c0 = -2.*c1; |
465 |
+ |
} else { |
466 |
+ |
c0 = i+1 - x; |
467 |
+ |
c1 = x - i; |
468 |
+ |
} |
469 |
+ |
c0 *= coef; |
470 |
+ |
c1 *= coef; |
471 |
+ |
/* check if vector interp */ |
472 |
+ |
if ((dp->nd == 2) & (rvec != NULL)) { |
473 |
+ |
if (dp->type == DATATY) { |
474 |
+ |
sd.arr.d = dp->arr.d + i*stride; |
475 |
+ |
for (i = sd.dim[0].ne; i--; ) |
476 |
+ |
rvec[i] += c0*sd.arr.d[i] |
477 |
+ |
+ c1*sd.arr.d[i+stride]; |
478 |
+ |
} else if (dp->type == SPECTY) { |
479 |
+ |
double f; |
480 |
+ |
sd.arr.s = dp->arr.s + i*stride; |
481 |
+ |
f = ldexp(1.0, (int)sd.arr.s[sd.dim[0].ne] |
482 |
+ |
- (COLXS+8)); |
483 |
+ |
for (i = sd.dim[0].ne; i--; ) |
484 |
+ |
rvec[i] += c0*f*(sd.arr.s[i] + 0.5); |
485 |
+ |
sd.arr.s += stride; |
486 |
+ |
f = ldexp(1.0, (int)sd.arr.s[sd.dim[0].ne] |
487 |
+ |
- (COLXS+8)); |
488 |
+ |
for (i = sd.dim[0].ne; i--; ) |
489 |
+ |
rvec[i] += c1*f*(sd.arr.s[i] + 0.5); |
490 |
+ |
} else { |
491 |
+ |
sd.arr.c = dp->arr.c + i*stride; |
492 |
+ |
for (i = sd.dim[0].ne; i--; ) |
493 |
+ |
rvec[i] += c0*colrval(sd.arr.c[i],sd.type) |
494 |
+ |
+ c1*colrval(sd.arr.c[i+stride],sd.type); |
495 |
+ |
} |
496 |
+ |
return(0.); /* return value ignored */ |
497 |
+ |
} |
498 |
|
/* get dependent variable */ |
499 |
|
if (dp->nd > 1) { |
500 |
|
if (dp->type == DATATY) { |
501 |
< |
sd.arr.d = dp->arr.d + i*asize; |
502 |
< |
y0 = datavalue(&sd, pt+1); |
503 |
< |
sd.arr.d += asize; |
459 |
< |
y1 = datavalue(&sd, pt+1); |
501 |
> |
sd.arr.d = dp->arr.d + i*stride; |
502 |
> |
y0 = data_interp(&sd, pt+1, c0, rvec); |
503 |
> |
sd.arr.d += stride; |
504 |
|
} else if (dp->type == SPECTY) { |
505 |
< |
sd.arr.s = dp->arr.s + i*asize; |
506 |
< |
y0 = datavalue(&sd, pt+1); |
507 |
< |
sd.arr.s += asize; |
464 |
< |
y1 = datavalue(&sd, pt+1); |
505 |
> |
sd.arr.s = dp->arr.s + i*stride; |
506 |
> |
y0 = data_interp(&sd, pt+1, c0, rvec); |
507 |
> |
sd.arr.s += stride; |
508 |
|
} else { |
509 |
< |
sd.arr.c = dp->arr.c + i*asize; |
510 |
< |
y0 = datavalue(&sd, pt+1); |
511 |
< |
sd.arr.c += asize; |
469 |
< |
y1 = datavalue(&sd, pt+1); |
509 |
> |
sd.arr.c = dp->arr.c + i*stride; |
510 |
> |
y0 = data_interp(&sd, pt+1, c0, rvec); |
511 |
> |
sd.arr.c += stride; |
512 |
|
} |
513 |
< |
} else { |
513 |
> |
y1 = data_interp(&sd, pt+1, c1, rvec); |
514 |
> |
} else { /* end of recursion */ |
515 |
|
if (dp->type == DATATY) { |
516 |
|
y0 = dp->arr.d[i]; |
517 |
|
y1 = dp->arr.d[i+1]; |
527 |
|
y0 = colrval(dp->arr.c[i],dp->type); |
528 |
|
y1 = colrval(dp->arr.c[i+1],dp->type); |
529 |
|
} |
530 |
+ |
y0 *= c0; |
531 |
+ |
y1 *= c1; |
532 |
|
} |
533 |
< |
/* |
534 |
< |
* 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)) ); |
533 |
> |
return(y0 + y1); /* coefficients already applied */ |
534 |
> |
} |
535 |
|
|
495 |
– |
if (x < i-1) |
496 |
– |
return( (2*y0-y1)/(i-x) ); |
536 |
|
|
537 |
< |
return( y0*((i+1)-x) + y1*(x-i) ); |
537 |
> |
double |
538 |
> |
datavalue( /* interpolate data value at a point */ |
539 |
> |
DATARRAY *dp, |
540 |
> |
double *pt |
541 |
> |
) |
542 |
> |
{ |
543 |
> |
return(data_interp(dp, pt, 1., NULL)); |
544 |
|
} |
545 |
+ |
|
546 |
+ |
|
547 |
+ |
/* Interpolate final vector corresponding to last dimension in data array */ |
548 |
+ |
DATARRAY * |
549 |
+ |
datavector(DATARRAY *dp, double *pt) |
550 |
+ |
{ |
551 |
+ |
DATARRAY *newdp; |
552 |
+ |
|
553 |
+ |
if (dp->nd < 2) |
554 |
+ |
error(INTERNAL, "datavector() called with 1-D array"); |
555 |
+ |
/* create vector array */ |
556 |
+ |
newdp = (DATARRAY *)malloc(sizeof(DATARRAY) - |
557 |
+ |
(MAXDDIM-1)*sizeof(struct dadim) + |
558 |
+ |
sizeof(DATATYPE)*dp->dim[dp->nd-1].ne); |
559 |
+ |
if (newdp == NULL) |
560 |
+ |
error(SYSTEM, "out of memory in datavector"); |
561 |
+ |
newdp->next = newdp; /* flags us as temp vector */ |
562 |
+ |
newdp->name = dp->name; |
563 |
+ |
newdp->type = DATATY; |
564 |
+ |
newdp->nd = 1; /* vector data goes here */ |
565 |
+ |
newdp->dim[0] = dp->dim[dp->nd-1]; |
566 |
+ |
newdp->arr.d = (DATATYPE *)(newdp->dim + 1); |
567 |
+ |
memset(newdp->arr.d, 0, sizeof(DATATYPE)*newdp->dim[0].ne); |
568 |
+ |
|
569 |
+ |
(void)data_interp(dp, pt, 1., newdp->arr.d); |
570 |
+ |
|
571 |
+ |
return(newdp); /* will be free'd using free() */ |
572 |
+ |
} |
573 |
+ |
|