34 |
|
#define hash(s) (shash(s)%TABSIZ) |
35 |
|
|
36 |
|
|
37 |
< |
extern char *fgetword(); |
37 |
> |
extern char *getlibpath(); /* library search path */ |
38 |
|
|
39 |
– |
extern char *libpath; /* library search path */ |
40 |
– |
|
39 |
|
static DATARRAY *dtab[TABSIZ]; /* data array list */ |
40 |
|
|
41 |
|
static DATARRAY *ptab[TABSIZ]; /* picture list */ |
45 |
|
getdata(dname) /* get data array dname */ |
46 |
|
char *dname; |
47 |
|
{ |
50 |
– |
char word[64]; |
48 |
|
char *dfname; |
49 |
|
FILE *fp; |
50 |
|
int asize; |
75 |
|
* 0 0 ni p0i p1i .. pni |
76 |
|
*/ |
77 |
|
|
78 |
< |
if ((dfname = getpath(dname, libpath, R_OK)) == NULL) { |
78 |
> |
if ((dfname = getpath(dname, getlibpath(), R_OK)) == NULL) { |
79 |
|
sprintf(errmsg, "cannot find data file \"%s\"", dname); |
80 |
|
error(USER, errmsg); |
81 |
|
} |
89 |
|
error(SYSTEM, errmsg); |
90 |
|
} |
91 |
|
/* get dimensions */ |
92 |
< |
if (fgetword(word, sizeof(word), fp) == NULL || !isint(word)) |
92 |
> |
if (fgetval(fp, 'i', &dp->nd) <= 0) |
93 |
|
goto scanerr; |
97 |
– |
dp->nd = atoi(word); |
94 |
|
if (dp->nd <= 0 || dp->nd > MAXDDIM) { |
95 |
|
sprintf(errmsg, "bad number of dimensions for \"%s\"", dname); |
96 |
|
error(USER, errmsg); |
97 |
|
} |
98 |
|
asize = 1; |
99 |
|
for (i = 0; i < dp->nd; i++) { |
100 |
< |
if (fgetword(word, sizeof(word), fp) == NULL || !isflt(word)) |
100 |
> |
if (fgetval(fp, 'd', &dp->dim[i].org) <= 0) |
101 |
|
goto scanerr; |
102 |
< |
dp->dim[i].org = atof(word); |
107 |
< |
if (fgetword(word, sizeof(word), fp) == NULL || !isflt(word)) |
102 |
> |
if (fgetval(fp, 'd', &dp->dim[i].siz) <= 0) |
103 |
|
goto scanerr; |
104 |
< |
dp->dim[i].siz = atof(word); |
110 |
< |
if (fgetword(word, sizeof(word), fp) == NULL || !isint(word)) |
104 |
> |
if (fgetval(fp, 'i', &dp->dim[i].ne) <= 0) |
105 |
|
goto scanerr; |
112 |
– |
dp->dim[i].ne = atoi(word); |
106 |
|
if (dp->dim[i].ne < 2) |
107 |
|
goto scanerr; |
108 |
|
asize *= dp->dim[i].ne; |
110 |
|
dp->dim[i].p = (double *)malloc(dp->dim[i].ne*sizeof(double)); |
111 |
|
if (dp->dim[i].p == NULL) |
112 |
|
goto memerr; |
113 |
< |
for (j = 0; j < dp->dim[i].ne; j++) { |
114 |
< |
if (fgetword(word, sizeof(word), fp) == NULL || |
122 |
< |
!isflt(word)) |
113 |
> |
for (j = 0; j < dp->dim[i].ne; j++) |
114 |
> |
if (fgetval(fp, 'd', &dp->dim[i].p[i]) <= 0) |
115 |
|
goto scanerr; |
124 |
– |
dp->dim[i].p[j] = atof(word); |
125 |
– |
} |
116 |
|
for (j = 1; j < dp->dim[i].ne-1; j++) |
117 |
|
if ((dp->dim[i].p[j-1] < dp->dim[i].p[j]) != |
118 |
|
(dp->dim[i].p[j] < dp->dim[i].p[j+1])) |
126 |
|
if ((dp->arr = (DATATYPE *)malloc(asize*sizeof(DATATYPE))) == NULL) |
127 |
|
goto memerr; |
128 |
|
|
129 |
< |
for (i = 0; i < asize; i++) { |
130 |
< |
if (fgetword(word, sizeof(word), fp) == NULL || !isflt(word)) |
129 |
> |
for (i = 0; i < asize; i++) |
130 |
> |
if (fgetval(fp, DATATY, &dp->arr[i]) <= 0) |
131 |
|
goto scanerr; |
142 |
– |
dp->arr[i] = atof(word); |
143 |
– |
} |
132 |
|
fclose(fp); |
133 |
|
i = hash(dname); |
134 |
|
dp->next = dtab[i]; |
157 |
|
getpict(pname) /* get picture pname */ |
158 |
|
char *pname; |
159 |
|
{ |
172 |
– |
extern char *libpath; |
160 |
|
double inpaspect; |
161 |
|
char *pfname; |
162 |
|
FILE *fp; |
172 |
|
if (!strcmp(pname, pp->name)) |
173 |
|
return(pp); /* found! */ |
174 |
|
|
175 |
< |
if ((pfname = getpath(pname, libpath, R_OK)) == NULL) { |
175 |
> |
if ((pfname = getpath(pname, getlibpath(), R_OK)) == NULL) { |
176 |
|
sprintf(errmsg, "cannot find picture file \"%s\"", pname); |
177 |
|
error(USER, errmsg); |
178 |
|
} |
329 |
|
int asize; |
330 |
|
int lower, upper; |
331 |
|
register int i; |
332 |
< |
double x, y, y0, y1; |
332 |
> |
double x, y0, y1; |
333 |
|
/* set up dimensions for recursion */ |
334 |
|
sd.nd = dp->nd - 1; |
335 |
|
asize = 1; |
342 |
|
/* get independent variable */ |
343 |
|
if (dp->dim[0].p == NULL) { /* evenly spaced points */ |
344 |
|
x = (pt[0] - dp->dim[0].org)/dp->dim[0].siz; |
345 |
< |
x = x * (dp->dim[0].ne - 1); |
345 |
> |
x *= (double)(dp->dim[0].ne - 1); |
346 |
|
i = x; |
347 |
|
if (i < 0) |
348 |
|
i = 0; |
383 |
|
* taper off harmonically to zero. |
384 |
|
*/ |
385 |
|
if (x > i+2) |
386 |
< |
y = (2*y1-y0)/(x-i-1); |
400 |
< |
else if (x < i-1) |
401 |
< |
y = (2*y0-y1)/(i-x); |
402 |
< |
else |
403 |
< |
y = y0*((i+1)-x) + y1*(x-i); |
386 |
> |
return( (2*y1-y0)/(x-(i-1)) ); |
387 |
|
|
388 |
< |
return(y); |
388 |
> |
if (x < i-1) |
389 |
> |
return( (2*y0-y1)/(i-x) ); |
390 |
> |
|
391 |
> |
return( y0*((i+1)-x) + y1*(x-i) ); |
392 |
|
} |