1 |
< |
/* Copyright (c) 1986 Regents of the University of California */ |
1 |
> |
/* Copyright (c) 1992 Regents of the University of California */ |
2 |
|
|
3 |
|
#ifndef lint |
4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
14 |
|
|
15 |
|
#include "color.h" |
16 |
|
|
17 |
+ |
#include "resolu.h" |
18 |
+ |
|
19 |
|
#include "data.h" |
20 |
|
|
21 |
|
|
22 |
+ |
extern char *fgetword(); |
23 |
+ |
|
24 |
|
extern char *libpath; /* library search path */ |
25 |
|
|
26 |
< |
static DATARRAY *dlist = NULL; /* data array list */ |
26 |
> |
static DATARRAY *dlist = NULL; /* data array list */ |
27 |
|
|
28 |
< |
static DATARRAY *plist = NULL; /* picture list */ |
28 |
> |
static DATARRAY *plist = NULL; /* picture list */ |
29 |
|
|
30 |
|
|
31 |
|
DATARRAY * |
32 |
|
getdata(dname) /* get data array dname */ |
33 |
|
char *dname; |
34 |
|
{ |
35 |
+ |
char word[64]; |
36 |
|
char *dfname; |
37 |
|
FILE *fp; |
38 |
|
int asize; |
45 |
|
|
46 |
|
/* |
47 |
|
* If we haven't loaded the data already, we will look |
48 |
< |
* for it in the directorys specified by the library path. |
48 |
> |
* for it in the directories specified by the library path. |
49 |
|
* |
50 |
|
* The file has the following format: |
51 |
|
* |
60 |
|
* For irregularly spaced points, the following can be |
61 |
|
* substituted for begi endi ni: |
62 |
|
* |
63 |
< |
* @ ni p0i p1i .. pni |
63 |
> |
* 0 0 ni p0i p1i .. pni |
64 |
|
*/ |
65 |
|
|
66 |
|
if ((dfname = getpath(dname, libpath, R_OK)) == NULL) { |
77 |
|
error(SYSTEM, errmsg); |
78 |
|
} |
79 |
|
/* get dimensions */ |
80 |
< |
if (fscanf(fp, "%d", &dp->nd) != 1) |
80 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isint(word)) |
81 |
|
goto scanerr; |
82 |
< |
if (dp->nd <= 0 || dp->nd > MAXDIM) { |
82 |
> |
dp->nd = atoi(word); |
83 |
> |
if (dp->nd <= 0 || dp->nd > MAXDDIM) { |
84 |
|
sprintf(errmsg, "bad number of dimensions for \"%s\"", dname); |
85 |
|
error(USER, errmsg); |
86 |
|
} |
87 |
|
asize = 1; |
88 |
|
for (i = 0; i < dp->nd; i++) { |
89 |
< |
if (fscanf(fp, "%lf %lf %d", |
90 |
< |
&dp->dim[i].org, &dp->dim[i].siz, |
91 |
< |
&dp->dim[i].ne) == 3) { |
92 |
< |
dp->dim[i].siz -= dp->dim[i].org; |
93 |
< |
dp->dim[i].p = NULL; |
94 |
< |
} else if (fscanf(fp, "@ %d", &dp->dim[i].ne) == 1) { |
89 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isflt(word)) |
90 |
> |
goto scanerr; |
91 |
> |
dp->dim[i].org = atof(word); |
92 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isflt(word)) |
93 |
> |
goto scanerr; |
94 |
> |
dp->dim[i].siz = atof(word); |
95 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isint(word)) |
96 |
> |
goto scanerr; |
97 |
> |
dp->dim[i].ne = atoi(word); |
98 |
> |
if (dp->dim[i].ne < 2) |
99 |
> |
goto scanerr; |
100 |
> |
asize *= dp->dim[i].ne; |
101 |
> |
if ((dp->dim[i].siz -= dp->dim[i].org) == 0) { |
102 |
|
dp->dim[i].p = (double *)malloc(dp->dim[i].ne*sizeof(double)); |
103 |
|
if (dp->dim[i].p == NULL) |
104 |
|
goto memerr; |
105 |
< |
for (j = 0; j < dp->dim[i].ne; j++) |
106 |
< |
if (fscanf(fp, "%lf", &dp->dim[i].p[j]) != 1) |
105 |
> |
for (j = 0; j < dp->dim[i].ne; j++) { |
106 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || |
107 |
> |
!isflt(word)) |
108 |
|
goto scanerr; |
109 |
+ |
dp->dim[i].p[j] = atof(word); |
110 |
+ |
} |
111 |
|
for (j = 1; j < dp->dim[i].ne-1; j++) |
112 |
|
if ((dp->dim[i].p[j-1] < dp->dim[i].p[j]) != |
113 |
|
(dp->dim[i].p[j] < dp->dim[i].p[j+1])) |
116 |
|
dp->dim[i].siz = dp->dim[i].p[dp->dim[i].ne-1] |
117 |
|
- dp->dim[i].p[0]; |
118 |
|
} else |
119 |
< |
goto scanerr; |
104 |
< |
if (dp->dim[i].siz == 0.0 || dp->dim[i].ne < 2) |
105 |
< |
goto scanerr; |
106 |
< |
asize *= dp->dim[i].ne; |
119 |
> |
dp->dim[i].p = NULL; |
120 |
|
} |
121 |
|
if ((dp->arr = (DATATYPE *)malloc(asize*sizeof(DATATYPE))) == NULL) |
122 |
|
goto memerr; |
123 |
|
|
124 |
< |
for (i = 0; i < asize; i++) |
125 |
< |
if (fscanf(fp, DSCANF, &dp->arr[i]) != 1) |
124 |
> |
for (i = 0; i < asize; i++) { |
125 |
> |
if (fgetword(word, sizeof(word), fp) == NULL || !isflt(word)) |
126 |
|
goto scanerr; |
127 |
< |
|
127 |
> |
dp->arr[i] = atof(word); |
128 |
> |
} |
129 |
|
fclose(fp); |
130 |
|
dp->next = dlist; |
131 |
|
return(dlist = dp); |
139 |
|
} |
140 |
|
|
141 |
|
|
128 |
– |
static double inpaspect; /* aspect ratio of input picture */ |
129 |
– |
|
142 |
|
static |
143 |
< |
headaspect(s) /* check string for aspect ratio */ |
143 |
> |
headaspect(s, iap) /* check string for aspect ratio */ |
144 |
|
char *s; |
145 |
+ |
double *iap; |
146 |
|
{ |
147 |
|
if (isaspect(s)) |
148 |
< |
inpaspect *= aspectval(s); |
148 |
> |
*iap *= aspectval(s); |
149 |
|
} |
150 |
|
|
151 |
|
|
154 |
|
char *pname; |
155 |
|
{ |
156 |
|
extern char *libpath; |
157 |
+ |
double inpaspect; |
158 |
|
char *pfname; |
159 |
|
FILE *fp; |
160 |
|
COLOR *scanin; |
161 |
< |
int width, height; |
162 |
< |
int x, y; |
163 |
< |
register int i; |
161 |
> |
int sl, ns; |
162 |
> |
RESOLU inpres; |
163 |
> |
FLOAT loc[2]; |
164 |
> |
int y; |
165 |
> |
register int x, i; |
166 |
|
register DATARRAY *pp; |
167 |
|
/* look for array in list */ |
168 |
|
for (pp = plist; pp != NULL; pp = pp->next) |
184 |
|
sprintf(errmsg, "cannot open picture file \"%s\"", pfname); |
185 |
|
error(SYSTEM, errmsg); |
186 |
|
} |
187 |
+ |
#ifdef MSDOS |
188 |
+ |
setmode(fileno(fp), O_BINARY); |
189 |
+ |
#endif |
190 |
|
/* get dimensions */ |
191 |
|
inpaspect = 1.0; |
192 |
< |
getheader(fp, headaspect); |
193 |
< |
if (fgetresolu(&width, &height, fp) != (YMAJOR|YDECR)) |
192 |
> |
getheader(fp, headaspect, &inpaspect); |
193 |
> |
if (!fgetsresolu(&inpres, fp)) |
194 |
|
goto readerr; |
195 |
|
for (i = 0; i < 3; i++) { |
196 |
|
pp[i].nd = 2; |
197 |
< |
pp[i].dim[0].ne = width; |
198 |
< |
pp[i].dim[1].ne = height; |
197 |
> |
pp[i].dim[0].ne = inpres.yr; |
198 |
> |
pp[i].dim[1].ne = inpres.xr; |
199 |
|
pp[i].dim[0].org = |
200 |
|
pp[i].dim[1].org = 0.0; |
201 |
< |
if (width <= height*inpaspect) { |
202 |
< |
pp[i].dim[0].siz = 1.0; |
203 |
< |
pp[i].dim[1].siz = inpaspect*(double)height/width; |
185 |
< |
} else { |
186 |
< |
pp[i].dim[0].siz = (double)width/height/inpaspect; |
201 |
> |
if (inpres.xr <= inpres.yr*inpaspect) { |
202 |
> |
pp[i].dim[0].siz = inpaspect * |
203 |
> |
(double)inpres.yr/inpres.xr; |
204 |
|
pp[i].dim[1].siz = 1.0; |
205 |
+ |
} else { |
206 |
+ |
pp[i].dim[0].siz = 1.0; |
207 |
+ |
pp[i].dim[1].siz = (double)inpres.xr/inpres.yr / |
208 |
+ |
inpaspect; |
209 |
|
} |
210 |
< |
pp[i].arr = (DATATYPE *)malloc(width*height*sizeof(DATATYPE)); |
210 |
> |
pp[i].dim[0].p = pp[i].dim[1].p = NULL; |
211 |
> |
pp[i].arr = (DATATYPE *) |
212 |
> |
malloc(inpres.xr*inpres.yr*sizeof(DATATYPE)); |
213 |
|
if (pp[i].arr == NULL) |
214 |
|
goto memerr; |
215 |
|
} |
216 |
|
/* load picture */ |
217 |
< |
if ((scanin = (COLOR *)malloc(width*sizeof(COLOR))) == NULL) |
217 |
> |
sl = scanlen(&inpres); |
218 |
> |
ns = numscans(&inpres); |
219 |
> |
if ((scanin = (COLOR *)malloc(sl*sizeof(COLOR))) == NULL) |
220 |
|
goto memerr; |
221 |
< |
for (y = height-1; y >= 0; y--) { |
222 |
< |
if (freadscan(scanin, width, fp) < 0) |
221 |
> |
for (y = 0; y < ns; y++) { |
222 |
> |
if (freadscan(scanin, sl, fp) < 0) |
223 |
|
goto readerr; |
224 |
< |
for (x = 0; x < width; x++) |
225 |
< |
for (i = 0; i < 3; i++) |
226 |
< |
pp[i].arr[x*height+y] = colval(scanin[x],i); |
224 |
> |
for (x = 0; x < sl; x++) { |
225 |
> |
pix2loc(loc, &inpres, x, y); |
226 |
> |
i = (int)(loc[1]*inpres.yr)*inpres.xr + |
227 |
> |
(int)(loc[0]*inpres.xr); |
228 |
> |
pp[0].arr[i] = colval(scanin[x],RED); |
229 |
> |
pp[1].arr[i] = colval(scanin[x],GRN); |
230 |
> |
pp[2].arr[i] = colval(scanin[x],BLU); |
231 |
> |
} |
232 |
|
} |
233 |
|
free((char *)scanin); |
234 |
|
fclose(fp); |
248 |
|
freedata(dname) /* free memory associated with dname */ |
249 |
|
char *dname; |
250 |
|
{ |
251 |
+ |
DATARRAY head; |
252 |
|
register DATARRAY *dp, *dpl; |
253 |
|
register int i; |
254 |
|
|
255 |
< |
for (dpl = NULL, dp = dlist; dp != NULL; dpl = dp, dp = dp->next) |
256 |
< |
if (!strcmp(dname, dp->name)) { |
257 |
< |
if (dpl == NULL) |
258 |
< |
dlist = dp->next; |
259 |
< |
else |
229 |
< |
dpl->next = dp->next; |
255 |
> |
head.next = dlist; |
256 |
> |
dpl = &head; |
257 |
> |
while ((dp = dpl->next) != NULL) |
258 |
> |
if (dname == NULL || !strcmp(dname, dp->name)) { |
259 |
> |
dpl->next = dp->next; |
260 |
|
free((char *)dp->arr); |
261 |
|
for (i = 0; i < dp->nd; i++) |
262 |
|
if (dp->dim[i].p != NULL) |
263 |
|
free((char *)dp->dim[i].p); |
264 |
|
freestr(dp->name); |
265 |
|
free((char *)dp); |
266 |
< |
return; |
267 |
< |
} |
266 |
> |
} else |
267 |
> |
dpl = dp; |
268 |
> |
dlist = head.next; |
269 |
|
} |
270 |
|
|
271 |
|
|
272 |
|
freepict(pname) /* free memory associated with pname */ |
273 |
|
char *pname; |
274 |
|
{ |
275 |
+ |
DATARRAY head; |
276 |
|
register DATARRAY *pp, *ppl; |
277 |
|
|
278 |
< |
for (ppl = NULL, pp = plist; pp != NULL; ppl = pp, pp = pp->next) |
279 |
< |
if (!strcmp(pname, pp->name)) { |
280 |
< |
if (ppl == NULL) |
281 |
< |
plist = pp->next; |
282 |
< |
else |
251 |
< |
ppl->next = pp->next; |
278 |
> |
head.next = plist; |
279 |
> |
ppl = &head; |
280 |
> |
while ((pp = ppl->next) != NULL) |
281 |
> |
if (pname == NULL || !strcmp(pname, pp->name)) { |
282 |
> |
ppl->next = pp->next; |
283 |
|
free((char *)pp[0].arr); |
284 |
|
free((char *)pp[1].arr); |
285 |
|
free((char *)pp[2].arr); |
286 |
|
freestr(pp[0].name); |
287 |
|
free((char *)pp); |
288 |
< |
return; |
289 |
< |
} |
288 |
> |
} else |
289 |
> |
ppl = pp; |
290 |
> |
plist = head.next; |
291 |
|
} |
292 |
|
|
293 |
|
|
294 |
|
double |
295 |
|
datavalue(dp, pt) /* interpolate data value at a point */ |
296 |
|
register DATARRAY *dp; |
297 |
< |
double *pt; |
297 |
> |
double *pt; |
298 |
|
{ |
299 |
|
DATARRAY sd; |
300 |
|
int asize; |
301 |
+ |
int lower, upper; |
302 |
|
register int i; |
303 |
< |
double x, y, y0, y1; |
303 |
> |
double x, y, y0, y1; |
304 |
|
/* set up dimensions for recursion */ |
305 |
|
sd.nd = dp->nd - 1; |
306 |
|
asize = 1; |
320 |
|
else if (i > dp->dim[0].ne - 2) |
321 |
|
i = dp->dim[0].ne - 2; |
322 |
|
} else { /* unevenly spaced points */ |
323 |
< |
if (dp->dim[0].siz > 0.0) |
324 |
< |
for (i = 0; i < dp->dim[0].ne; i++) |
325 |
< |
if (pt[0] < dp->dim[0].p[i]) |
326 |
< |
break; |
327 |
< |
else |
328 |
< |
for (i = 0; i < dp->dim[0].ne; i++) |
329 |
< |
if (pt[0] >= dp->dim[0].p[i]) |
330 |
< |
break; |
331 |
< |
if (i <= 0) |
332 |
< |
i = 0; |
333 |
< |
else if (i >= dp->dim[0].ne) |
323 |
> |
if (dp->dim[0].siz > 0.0) { |
324 |
> |
lower = 0; |
325 |
> |
upper = dp->dim[0].ne; |
326 |
> |
} else { |
327 |
> |
lower = dp->dim[0].ne; |
328 |
> |
upper = 0; |
329 |
> |
} |
330 |
> |
do { |
331 |
> |
i = (lower + upper) >> 1; |
332 |
> |
if (pt[0] >= dp->dim[0].p[i]) |
333 |
> |
lower = i; |
334 |
> |
else |
335 |
> |
upper = i; |
336 |
> |
} while (i != (lower + upper) >> 1); |
337 |
> |
if (i > dp->dim[0].ne - 2) |
338 |
|
i = dp->dim[0].ne - 2; |
302 |
– |
else |
303 |
– |
i--; |
339 |
|
x = i + (pt[0] - dp->dim[0].p[i]) / |
340 |
|
(dp->dim[0].p[i+1] - dp->dim[0].p[i]); |
341 |
|
} |