1 |
greg |
1.1 |
/* Copyright (c) 1986 Regents of the University of California */ |
2 |
|
|
|
3 |
|
|
#ifndef lint |
4 |
|
|
static char SCCSid[] = "$SunId$ LBL"; |
5 |
|
|
#endif |
6 |
|
|
|
7 |
|
|
/* |
8 |
|
|
* data.c - routines dealing with interpolated data. |
9 |
|
|
* |
10 |
|
|
* 6/4/86 |
11 |
|
|
*/ |
12 |
|
|
|
13 |
|
|
#include "standard.h" |
14 |
|
|
|
15 |
|
|
#include "color.h" |
16 |
|
|
|
17 |
|
|
#include "data.h" |
18 |
|
|
|
19 |
|
|
|
20 |
|
|
extern char *libpath; /* library search path */ |
21 |
|
|
|
22 |
|
|
static DATARRAY *dlist = NULL; /* data array list */ |
23 |
|
|
|
24 |
|
|
static DATARRAY *plist = NULL; /* picture list */ |
25 |
|
|
|
26 |
|
|
|
27 |
|
|
DATARRAY * |
28 |
|
|
getdata(dname) /* get data array dname */ |
29 |
|
|
char *dname; |
30 |
|
|
{ |
31 |
|
|
char *dfname; |
32 |
|
|
FILE *fp; |
33 |
|
|
int asize; |
34 |
greg |
1.4 |
register int i, j; |
35 |
greg |
1.1 |
register DATARRAY *dp; |
36 |
|
|
/* look for array in list */ |
37 |
|
|
for (dp = dlist; dp != NULL; dp = dp->next) |
38 |
|
|
if (!strcmp(dname, dp->name)) |
39 |
|
|
return(dp); /* found! */ |
40 |
|
|
|
41 |
|
|
/* |
42 |
|
|
* If we haven't loaded the data already, we will look |
43 |
|
|
* for it in the directorys specified by the library path. |
44 |
|
|
* |
45 |
|
|
* The file has the following format: |
46 |
|
|
* |
47 |
greg |
1.4 |
* N |
48 |
greg |
1.1 |
* beg0 end0 n0 |
49 |
|
|
* beg1 end1 n1 |
50 |
|
|
* . . . |
51 |
greg |
1.4 |
* begN endN nN |
52 |
greg |
1.1 |
* data, later dimensions changing faster |
53 |
|
|
* . . . |
54 |
|
|
* |
55 |
greg |
1.4 |
* For irregularly spaced points, the following can be |
56 |
|
|
* substituted for begi endi ni: |
57 |
|
|
* |
58 |
greg |
1.6 |
* 0 0 ni p0i p1i .. pni |
59 |
greg |
1.1 |
*/ |
60 |
|
|
|
61 |
greg |
1.2 |
if ((dfname = getpath(dname, libpath, R_OK)) == NULL) { |
62 |
greg |
1.1 |
sprintf(errmsg, "cannot find data file \"%s\"", dname); |
63 |
|
|
error(USER, errmsg); |
64 |
|
|
} |
65 |
|
|
if ((dp = (DATARRAY *)malloc(sizeof(DATARRAY))) == NULL) |
66 |
|
|
goto memerr; |
67 |
|
|
|
68 |
|
|
dp->name = savestr(dname); |
69 |
|
|
|
70 |
|
|
if ((fp = fopen(dfname, "r")) == NULL) { |
71 |
|
|
sprintf(errmsg, "cannot open data file \"%s\"", dfname); |
72 |
|
|
error(SYSTEM, errmsg); |
73 |
|
|
} |
74 |
|
|
/* get dimensions */ |
75 |
|
|
if (fscanf(fp, "%d", &dp->nd) != 1) |
76 |
|
|
goto scanerr; |
77 |
|
|
if (dp->nd <= 0 || dp->nd > MAXDIM) { |
78 |
|
|
sprintf(errmsg, "bad number of dimensions for \"%s\"", dname); |
79 |
|
|
error(USER, errmsg); |
80 |
|
|
} |
81 |
|
|
asize = 1; |
82 |
|
|
for (i = 0; i < dp->nd; i++) { |
83 |
|
|
if (fscanf(fp, "%lf %lf %d", |
84 |
|
|
&dp->dim[i].org, &dp->dim[i].siz, |
85 |
greg |
1.6 |
&dp->dim[i].ne) != 3) |
86 |
|
|
goto scanerr; |
87 |
|
|
if (dp->dim[i].ne < 2) |
88 |
|
|
goto scanerr; |
89 |
|
|
asize *= dp->dim[i].ne; |
90 |
|
|
if ((dp->dim[i].siz -= dp->dim[i].org) == 0) { |
91 |
greg |
1.4 |
dp->dim[i].p = (double *)malloc(dp->dim[i].ne*sizeof(double)); |
92 |
|
|
if (dp->dim[i].p == NULL) |
93 |
|
|
goto memerr; |
94 |
|
|
for (j = 0; j < dp->dim[i].ne; j++) |
95 |
|
|
if (fscanf(fp, "%lf", &dp->dim[i].p[j]) != 1) |
96 |
|
|
goto scanerr; |
97 |
|
|
for (j = 1; j < dp->dim[i].ne-1; j++) |
98 |
|
|
if ((dp->dim[i].p[j-1] < dp->dim[i].p[j]) != |
99 |
|
|
(dp->dim[i].p[j] < dp->dim[i].p[j+1])) |
100 |
|
|
goto scanerr; |
101 |
|
|
dp->dim[i].org = dp->dim[i].p[0]; |
102 |
|
|
dp->dim[i].siz = dp->dim[i].p[dp->dim[i].ne-1] |
103 |
|
|
- dp->dim[i].p[0]; |
104 |
|
|
} else |
105 |
greg |
1.6 |
dp->dim[i].p = NULL; |
106 |
greg |
1.1 |
} |
107 |
|
|
if ((dp->arr = (DATATYPE *)malloc(asize*sizeof(DATATYPE))) == NULL) |
108 |
|
|
goto memerr; |
109 |
|
|
|
110 |
|
|
for (i = 0; i < asize; i++) |
111 |
|
|
if (fscanf(fp, DSCANF, &dp->arr[i]) != 1) |
112 |
|
|
goto scanerr; |
113 |
|
|
|
114 |
|
|
fclose(fp); |
115 |
|
|
dp->next = dlist; |
116 |
|
|
return(dlist = dp); |
117 |
|
|
|
118 |
|
|
memerr: |
119 |
|
|
error(SYSTEM, "out of memory in getdata"); |
120 |
|
|
scanerr: |
121 |
|
|
sprintf(errmsg, "%s in data file \"%s\"", |
122 |
|
|
feof(fp) ? "unexpected EOF" : "bad format", dfname); |
123 |
|
|
error(USER, errmsg); |
124 |
|
|
} |
125 |
|
|
|
126 |
|
|
|
127 |
greg |
1.5 |
static double inpaspect; /* aspect ratio of input picture */ |
128 |
|
|
|
129 |
|
|
static |
130 |
|
|
headaspect(s) /* check string for aspect ratio */ |
131 |
|
|
char *s; |
132 |
|
|
{ |
133 |
|
|
if (isaspect(s)) |
134 |
|
|
inpaspect *= aspectval(s); |
135 |
|
|
} |
136 |
|
|
|
137 |
|
|
|
138 |
greg |
1.1 |
DATARRAY * |
139 |
|
|
getpict(pname) /* get picture pname */ |
140 |
|
|
char *pname; |
141 |
|
|
{ |
142 |
|
|
extern char *libpath; |
143 |
|
|
char *pfname; |
144 |
|
|
FILE *fp; |
145 |
|
|
COLOR *scanin; |
146 |
|
|
int width, height; |
147 |
|
|
int x, y; |
148 |
|
|
register int i; |
149 |
|
|
register DATARRAY *pp; |
150 |
|
|
/* look for array in list */ |
151 |
|
|
for (pp = plist; pp != NULL; pp = pp->next) |
152 |
|
|
if (!strcmp(pname, pp->name)) |
153 |
|
|
return(pp); /* found! */ |
154 |
|
|
|
155 |
greg |
1.2 |
if ((pfname = getpath(pname, libpath, R_OK)) == NULL) { |
156 |
greg |
1.1 |
sprintf(errmsg, "cannot find picture file \"%s\"", pname); |
157 |
|
|
error(USER, errmsg); |
158 |
|
|
} |
159 |
|
|
if ((pp = (DATARRAY *)calloc(3, sizeof(DATARRAY))) == NULL) |
160 |
|
|
goto memerr; |
161 |
|
|
|
162 |
|
|
pp[0].name = |
163 |
|
|
pp[1].name = |
164 |
|
|
pp[2].name = savestr(pname); |
165 |
|
|
|
166 |
|
|
if ((fp = fopen(pfname, "r")) == NULL) { |
167 |
|
|
sprintf(errmsg, "cannot open picture file \"%s\"", pfname); |
168 |
|
|
error(SYSTEM, errmsg); |
169 |
|
|
} |
170 |
|
|
/* get dimensions */ |
171 |
greg |
1.5 |
inpaspect = 1.0; |
172 |
|
|
getheader(fp, headaspect); |
173 |
greg |
1.3 |
if (fgetresolu(&width, &height, fp) != (YMAJOR|YDECR)) |
174 |
greg |
1.1 |
goto readerr; |
175 |
|
|
for (i = 0; i < 3; i++) { |
176 |
|
|
pp[i].nd = 2; |
177 |
greg |
1.7 |
pp[i].dim[0].ne = height; |
178 |
|
|
pp[i].dim[1].ne = width; |
179 |
greg |
1.1 |
pp[i].dim[0].org = |
180 |
|
|
pp[i].dim[1].org = 0.0; |
181 |
greg |
1.5 |
if (width <= height*inpaspect) { |
182 |
greg |
1.7 |
pp[i].dim[0].siz = inpaspect*(double)height/width; |
183 |
|
|
pp[i].dim[1].siz = 1.0; |
184 |
|
|
} else { |
185 |
greg |
1.1 |
pp[i].dim[0].siz = 1.0; |
186 |
greg |
1.7 |
pp[i].dim[1].siz = (double)width/height/inpaspect; |
187 |
greg |
1.1 |
} |
188 |
greg |
1.7 |
pp[i].dim[0].p = pp[i].dim[1].p = NULL; |
189 |
greg |
1.1 |
pp[i].arr = (DATATYPE *)malloc(width*height*sizeof(DATATYPE)); |
190 |
|
|
if (pp[i].arr == NULL) |
191 |
|
|
goto memerr; |
192 |
|
|
} |
193 |
|
|
/* load picture */ |
194 |
|
|
if ((scanin = (COLOR *)malloc(width*sizeof(COLOR))) == NULL) |
195 |
|
|
goto memerr; |
196 |
|
|
for (y = height-1; y >= 0; y--) { |
197 |
|
|
if (freadscan(scanin, width, fp) < 0) |
198 |
|
|
goto readerr; |
199 |
|
|
for (x = 0; x < width; x++) |
200 |
|
|
for (i = 0; i < 3; i++) |
201 |
greg |
1.7 |
pp[i].arr[y*width+x] = colval(scanin[x],i); |
202 |
greg |
1.1 |
} |
203 |
|
|
free((char *)scanin); |
204 |
|
|
fclose(fp); |
205 |
|
|
pp[0].next = |
206 |
|
|
pp[1].next = |
207 |
|
|
pp[2].next = plist; |
208 |
|
|
return(plist = pp); |
209 |
|
|
|
210 |
|
|
memerr: |
211 |
|
|
error(SYSTEM, "out of memory in getpict"); |
212 |
|
|
readerr: |
213 |
|
|
sprintf(errmsg, "bad picture file \"%s\"", pfname); |
214 |
|
|
error(USER, errmsg); |
215 |
|
|
} |
216 |
|
|
|
217 |
|
|
|
218 |
|
|
freedata(dname) /* free memory associated with dname */ |
219 |
|
|
char *dname; |
220 |
|
|
{ |
221 |
|
|
register DATARRAY *dp, *dpl; |
222 |
greg |
1.4 |
register int i; |
223 |
greg |
1.1 |
|
224 |
|
|
for (dpl = NULL, dp = dlist; dp != NULL; dpl = dp, dp = dp->next) |
225 |
|
|
if (!strcmp(dname, dp->name)) { |
226 |
|
|
if (dpl == NULL) |
227 |
|
|
dlist = dp->next; |
228 |
|
|
else |
229 |
|
|
dpl->next = dp->next; |
230 |
|
|
free((char *)dp->arr); |
231 |
greg |
1.4 |
for (i = 0; i < dp->nd; i++) |
232 |
|
|
if (dp->dim[i].p != NULL) |
233 |
|
|
free((char *)dp->dim[i].p); |
234 |
greg |
1.1 |
freestr(dp->name); |
235 |
|
|
free((char *)dp); |
236 |
|
|
return; |
237 |
|
|
} |
238 |
|
|
} |
239 |
|
|
|
240 |
|
|
|
241 |
|
|
freepict(pname) /* free memory associated with pname */ |
242 |
|
|
char *pname; |
243 |
|
|
{ |
244 |
|
|
register DATARRAY *pp, *ppl; |
245 |
|
|
|
246 |
|
|
for (ppl = NULL, pp = plist; pp != NULL; ppl = pp, pp = pp->next) |
247 |
|
|
if (!strcmp(pname, pp->name)) { |
248 |
|
|
if (ppl == NULL) |
249 |
|
|
plist = pp->next; |
250 |
|
|
else |
251 |
|
|
ppl->next = pp->next; |
252 |
|
|
free((char *)pp[0].arr); |
253 |
|
|
free((char *)pp[1].arr); |
254 |
|
|
free((char *)pp[2].arr); |
255 |
|
|
freestr(pp[0].name); |
256 |
|
|
free((char *)pp); |
257 |
|
|
return; |
258 |
|
|
} |
259 |
|
|
} |
260 |
|
|
|
261 |
|
|
|
262 |
|
|
double |
263 |
|
|
datavalue(dp, pt) /* interpolate data value at a point */ |
264 |
|
|
register DATARRAY *dp; |
265 |
|
|
double *pt; |
266 |
|
|
{ |
267 |
|
|
DATARRAY sd; |
268 |
|
|
int asize; |
269 |
greg |
1.6 |
int lower, upper; |
270 |
greg |
1.1 |
register int i; |
271 |
|
|
double x, y, y0, y1; |
272 |
greg |
1.4 |
/* set up dimensions for recursion */ |
273 |
greg |
1.1 |
sd.nd = dp->nd - 1; |
274 |
|
|
asize = 1; |
275 |
|
|
for (i = 0; i < sd.nd; i++) { |
276 |
|
|
sd.dim[i].org = dp->dim[i+1].org; |
277 |
|
|
sd.dim[i].siz = dp->dim[i+1].siz; |
278 |
greg |
1.4 |
sd.dim[i].p = dp->dim[i+1].p; |
279 |
greg |
1.1 |
asize *= sd.dim[i].ne = dp->dim[i+1].ne; |
280 |
|
|
} |
281 |
greg |
1.4 |
/* get independent variable */ |
282 |
|
|
if (dp->dim[0].p == NULL) { /* evenly spaced points */ |
283 |
|
|
x = (pt[0] - dp->dim[0].org)/dp->dim[0].siz; |
284 |
|
|
x = x * (dp->dim[0].ne - 1); |
285 |
|
|
i = x; |
286 |
|
|
if (i < 0) |
287 |
|
|
i = 0; |
288 |
|
|
else if (i > dp->dim[0].ne - 2) |
289 |
|
|
i = dp->dim[0].ne - 2; |
290 |
|
|
} else { /* unevenly spaced points */ |
291 |
greg |
1.6 |
if (dp->dim[0].siz > 0.0) { |
292 |
|
|
lower = 0; |
293 |
|
|
upper = dp->dim[0].ne; |
294 |
|
|
} else { |
295 |
|
|
lower = dp->dim[0].ne; |
296 |
|
|
upper = 0; |
297 |
|
|
} |
298 |
|
|
do { |
299 |
|
|
i = (lower + upper) >> 1; |
300 |
|
|
if (pt[0] >= dp->dim[0].p[i]) |
301 |
|
|
lower = i; |
302 |
|
|
else if (pt[0] < dp->dim[0].p[i]) |
303 |
|
|
upper = i; |
304 |
|
|
} while (i != (lower + upper) >> 1); |
305 |
|
|
if (i < 0) |
306 |
greg |
1.4 |
i = 0; |
307 |
greg |
1.6 |
else if (i > dp->dim[0].ne - 2) |
308 |
greg |
1.4 |
i = dp->dim[0].ne - 2; |
309 |
|
|
x = i + (pt[0] - dp->dim[0].p[i]) / |
310 |
|
|
(dp->dim[0].p[i+1] - dp->dim[0].p[i]); |
311 |
|
|
} |
312 |
|
|
/* get dependent variable */ |
313 |
greg |
1.1 |
if (dp->nd == 1) { |
314 |
|
|
y0 = dp->arr[i]; |
315 |
|
|
y1 = dp->arr[i+1]; |
316 |
|
|
} else { |
317 |
|
|
sd.arr = &dp->arr[i*asize]; |
318 |
|
|
y0 = datavalue(&sd, pt+1); |
319 |
|
|
sd.arr = &dp->arr[(i+1)*asize]; |
320 |
|
|
y1 = datavalue(&sd, pt+1); |
321 |
|
|
} |
322 |
|
|
/* |
323 |
|
|
* Extrapolate as far as one division, then |
324 |
|
|
* taper off harmonically to zero. |
325 |
|
|
*/ |
326 |
|
|
if (x > i+2) |
327 |
|
|
y = (2*y1-y0)/(x-i-1); |
328 |
|
|
else if (x < i-1) |
329 |
|
|
y = (2*y0-y1)/(i-x); |
330 |
|
|
else |
331 |
|
|
y = y0*((i+1)-x) + y1*(x-i); |
332 |
|
|
|
333 |
|
|
return(y); |
334 |
|
|
} |