1 |
< |
/* Copyright (c) 1986 Regents of the University of California */ |
1 |
> |
/* Copyright (c) 1991 Regents of the University of California */ |
2 |
|
|
3 |
|
#ifndef lint |
4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
17 |
|
#include "data.h" |
18 |
|
|
19 |
|
|
20 |
+ |
extern char *fgetword(); |
21 |
+ |
extern double atof(); |
22 |
+ |
|
23 |
|
extern char *libpath; /* library search path */ |
24 |
|
|
25 |
|
static DATARRAY *dlist = NULL; /* data array list */ |
31 |
|
getdata(dname) /* get data array dname */ |
32 |
|
char *dname; |
33 |
|
{ |
34 |
+ |
char word[64]; |
35 |
|
char *dfname; |
36 |
|
FILE *fp; |
37 |
|
int asize; |
38 |
< |
register int i; |
38 |
> |
register int i, j; |
39 |
|
register DATARRAY *dp; |
40 |
|
/* look for array in list */ |
41 |
|
for (dp = dlist; dp != NULL; dp = dp->next) |
48 |
|
* |
49 |
|
* The file has the following format: |
50 |
|
* |
51 |
< |
* #dimensions |
51 |
> |
* N |
52 |
|
* beg0 end0 n0 |
53 |
|
* beg1 end1 n1 |
54 |
|
* . . . |
55 |
+ |
* begN endN nN |
56 |
|
* data, later dimensions changing faster |
57 |
|
* . . . |
58 |
|
* |
59 |
+ |
* For irregularly spaced points, the following can be |
60 |
+ |
* substituted for begi endi ni: |
61 |
+ |
* |
62 |
+ |
* 0 0 ni p0i p1i .. pni |
63 |
|
*/ |
64 |
|
|
65 |
|
if ((dfname = getpath(dname, libpath, R_OK)) == NULL) { |
76 |
|
error(SYSTEM, errmsg); |
77 |
|
} |
78 |
|
/* get dimensions */ |
79 |
< |
if (fscanf(fp, "%d", &dp->nd) != 1) |
79 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isint(word)) |
80 |
|
goto scanerr; |
81 |
< |
if (dp->nd <= 0 || dp->nd > MAXDIM) { |
81 |
> |
dp->nd = atoi(word); |
82 |
> |
if (dp->nd <= 0 || dp->nd > MAXDDIM) { |
83 |
|
sprintf(errmsg, "bad number of dimensions for \"%s\"", dname); |
84 |
|
error(USER, errmsg); |
85 |
|
} |
86 |
|
asize = 1; |
87 |
|
for (i = 0; i < dp->nd; i++) { |
88 |
< |
if (fscanf(fp, "%lf %lf %d", |
79 |
< |
&dp->dim[i].org, &dp->dim[i].siz, |
80 |
< |
&dp->dim[i].ne) != 3) |
88 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isflt(word)) |
89 |
|
goto scanerr; |
90 |
< |
dp->dim[i].siz -= dp->dim[i].org; |
90 |
> |
dp->dim[i].org = atof(word); |
91 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isflt(word)) |
92 |
> |
goto scanerr; |
93 |
> |
dp->dim[i].siz = atof(word); |
94 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isint(word)) |
95 |
> |
goto scanerr; |
96 |
> |
dp->dim[i].ne = atoi(word); |
97 |
> |
if (dp->dim[i].ne < 2) |
98 |
> |
goto scanerr; |
99 |
|
asize *= dp->dim[i].ne; |
100 |
+ |
if ((dp->dim[i].siz -= dp->dim[i].org) == 0) { |
101 |
+ |
dp->dim[i].p = (double *)malloc(dp->dim[i].ne*sizeof(double)); |
102 |
+ |
if (dp->dim[i].p == NULL) |
103 |
+ |
goto memerr; |
104 |
+ |
for (j = 0; j < dp->dim[i].ne; j++) { |
105 |
+ |
if (fgetword(word, sizeof(word), fp) == NULL || |
106 |
+ |
!isflt(word)) |
107 |
+ |
goto scanerr; |
108 |
+ |
dp->dim[i].p[j] = atof(word); |
109 |
+ |
} |
110 |
+ |
for (j = 1; j < dp->dim[i].ne-1; j++) |
111 |
+ |
if ((dp->dim[i].p[j-1] < dp->dim[i].p[j]) != |
112 |
+ |
(dp->dim[i].p[j] < dp->dim[i].p[j+1])) |
113 |
+ |
goto scanerr; |
114 |
+ |
dp->dim[i].org = dp->dim[i].p[0]; |
115 |
+ |
dp->dim[i].siz = dp->dim[i].p[dp->dim[i].ne-1] |
116 |
+ |
- dp->dim[i].p[0]; |
117 |
+ |
} else |
118 |
+ |
dp->dim[i].p = NULL; |
119 |
|
} |
120 |
|
if ((dp->arr = (DATATYPE *)malloc(asize*sizeof(DATATYPE))) == NULL) |
121 |
|
goto memerr; |
122 |
|
|
123 |
< |
for (i = 0; i < asize; i++) |
124 |
< |
if (fscanf(fp, DSCANF, &dp->arr[i]) != 1) |
123 |
> |
for (i = 0; i < asize; i++) { |
124 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isflt(word)) |
125 |
|
goto scanerr; |
126 |
< |
|
126 |
> |
dp->arr[i] = atof(word); |
127 |
> |
} |
128 |
|
fclose(fp); |
129 |
|
dp->next = dlist; |
130 |
|
return(dlist = dp); |
138 |
|
} |
139 |
|
|
140 |
|
|
141 |
+ |
static double inpaspect; /* aspect ratio of input picture */ |
142 |
+ |
|
143 |
+ |
static |
144 |
+ |
headaspect(s) /* check string for aspect ratio */ |
145 |
+ |
char *s; |
146 |
+ |
{ |
147 |
+ |
if (isaspect(s)) |
148 |
+ |
inpaspect *= aspectval(s); |
149 |
+ |
} |
150 |
+ |
|
151 |
+ |
|
152 |
|
DATARRAY * |
153 |
|
getpict(pname) /* get picture pname */ |
154 |
|
char *pname; |
182 |
|
error(SYSTEM, errmsg); |
183 |
|
} |
184 |
|
/* get dimensions */ |
185 |
< |
getheader(fp, NULL); |
186 |
< |
if (fscanf(fp, "-Y %d +X %d\n", &height, &width) != 2) |
185 |
> |
inpaspect = 1.0; |
186 |
> |
getheader(fp, headaspect); |
187 |
> |
if (fgetresolu(&width, &height, fp) != (YMAJOR|YDECR)) |
188 |
|
goto readerr; |
189 |
|
for (i = 0; i < 3; i++) { |
190 |
|
pp[i].nd = 2; |
191 |
< |
pp[i].dim[0].ne = width; |
192 |
< |
pp[i].dim[1].ne = height; |
191 |
> |
pp[i].dim[0].ne = height; |
192 |
> |
pp[i].dim[1].ne = width; |
193 |
|
pp[i].dim[0].org = |
194 |
|
pp[i].dim[1].org = 0.0; |
195 |
< |
if (width <= height) { |
196 |
< |
pp[i].dim[0].siz = 1.0; |
149 |
< |
pp[i].dim[1].siz = (double)height/width; |
150 |
< |
} else { |
151 |
< |
pp[i].dim[0].siz = (double)width/height; |
195 |
> |
if (width <= height*inpaspect) { |
196 |
> |
pp[i].dim[0].siz = inpaspect*(double)height/width; |
197 |
|
pp[i].dim[1].siz = 1.0; |
198 |
+ |
} else { |
199 |
+ |
pp[i].dim[0].siz = 1.0; |
200 |
+ |
pp[i].dim[1].siz = (double)width/height/inpaspect; |
201 |
|
} |
202 |
+ |
pp[i].dim[0].p = pp[i].dim[1].p = NULL; |
203 |
|
pp[i].arr = (DATATYPE *)malloc(width*height*sizeof(DATATYPE)); |
204 |
|
if (pp[i].arr == NULL) |
205 |
|
goto memerr; |
212 |
|
goto readerr; |
213 |
|
for (x = 0; x < width; x++) |
214 |
|
for (i = 0; i < 3; i++) |
215 |
< |
pp[i].arr[x*height+y] = colval(scanin[x],i); |
215 |
> |
pp[i].arr[y*width+x] = colval(scanin[x],i); |
216 |
|
} |
217 |
|
free((char *)scanin); |
218 |
|
fclose(fp); |
233 |
|
char *dname; |
234 |
|
{ |
235 |
|
register DATARRAY *dp, *dpl; |
236 |
+ |
register int i; |
237 |
|
|
238 |
|
for (dpl = NULL, dp = dlist; dp != NULL; dpl = dp, dp = dp->next) |
239 |
|
if (!strcmp(dname, dp->name)) { |
242 |
|
else |
243 |
|
dpl->next = dp->next; |
244 |
|
free((char *)dp->arr); |
245 |
+ |
for (i = 0; i < dp->nd; i++) |
246 |
+ |
if (dp->dim[i].p != NULL) |
247 |
+ |
free((char *)dp->dim[i].p); |
248 |
|
freestr(dp->name); |
249 |
|
free((char *)dp); |
250 |
|
return; |
280 |
|
{ |
281 |
|
DATARRAY sd; |
282 |
|
int asize; |
283 |
+ |
int lower, upper; |
284 |
|
register int i; |
285 |
|
double x, y, y0, y1; |
286 |
< |
|
286 |
> |
/* set up dimensions for recursion */ |
287 |
|
sd.nd = dp->nd - 1; |
288 |
|
asize = 1; |
289 |
|
for (i = 0; i < sd.nd; i++) { |
290 |
|
sd.dim[i].org = dp->dim[i+1].org; |
291 |
|
sd.dim[i].siz = dp->dim[i+1].siz; |
292 |
+ |
sd.dim[i].p = dp->dim[i+1].p; |
293 |
|
asize *= sd.dim[i].ne = dp->dim[i+1].ne; |
294 |
|
} |
295 |
< |
|
296 |
< |
x = (pt[0] - dp->dim[0].org)/dp->dim[0].siz; |
297 |
< |
|
298 |
< |
x *= dp->dim[0].ne - 1; |
299 |
< |
|
300 |
< |
i = x; |
301 |
< |
if (i < 0) |
302 |
< |
i = 0; |
303 |
< |
else if (i > dp->dim[0].ne - 2) |
304 |
< |
i = dp->dim[0].ne - 2; |
305 |
< |
|
295 |
> |
/* get independent variable */ |
296 |
> |
if (dp->dim[0].p == NULL) { /* evenly spaced points */ |
297 |
> |
x = (pt[0] - dp->dim[0].org)/dp->dim[0].siz; |
298 |
> |
x = x * (dp->dim[0].ne - 1); |
299 |
> |
i = x; |
300 |
> |
if (i < 0) |
301 |
> |
i = 0; |
302 |
> |
else if (i > dp->dim[0].ne - 2) |
303 |
> |
i = dp->dim[0].ne - 2; |
304 |
> |
} else { /* unevenly spaced points */ |
305 |
> |
if (dp->dim[0].siz > 0.0) { |
306 |
> |
lower = 0; |
307 |
> |
upper = dp->dim[0].ne; |
308 |
> |
} else { |
309 |
> |
lower = dp->dim[0].ne; |
310 |
> |
upper = 0; |
311 |
> |
} |
312 |
> |
do { |
313 |
> |
i = (lower + upper) >> 1; |
314 |
> |
if (pt[0] >= dp->dim[0].p[i]) |
315 |
> |
lower = i; |
316 |
> |
else |
317 |
> |
upper = i; |
318 |
> |
} while (i != (lower + upper) >> 1); |
319 |
> |
if (i > dp->dim[0].ne - 2) |
320 |
> |
i = dp->dim[0].ne - 2; |
321 |
> |
x = i + (pt[0] - dp->dim[0].p[i]) / |
322 |
> |
(dp->dim[0].p[i+1] - dp->dim[0].p[i]); |
323 |
> |
} |
324 |
> |
/* get dependent variable */ |
325 |
|
if (dp->nd == 1) { |
326 |
|
y0 = dp->arr[i]; |
327 |
|
y1 = dp->arr[i+1]; |
331 |
|
sd.arr = &dp->arr[(i+1)*asize]; |
332 |
|
y1 = datavalue(&sd, pt+1); |
333 |
|
} |
260 |
– |
|
334 |
|
/* |
335 |
|
* Extrapolate as far as one division, then |
336 |
|
* taper off harmonically to zero. |