ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/rt/data.c
Revision: 2.26
Committed: Fri Jan 2 11:43:42 2004 UTC (20 years, 4 months ago) by schorsch
Content type: text/plain
Branch: MAIN
Changes since 2.25: +10 -7 lines
Log Message:
Fixed typing/prototype of getheader() and its callback.

File Contents

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