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