ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/rt/data.c
Revision: 2.23
Committed: Mon Jul 21 22:30:19 2003 UTC (20 years, 9 months ago) by schorsch
Content type: text/plain
Branch: MAIN
Changes since 2.22: +3 -3 lines
Log Message:
Eliminated copystruct() macro, which is unnecessary in ANSI.
Reduced ambiguity warnings for nested if/if/else clauses.

File Contents

# User Rev Content
1 greg 1.1 #ifndef lint
2 schorsch 2.23 static const char RCSid[] = "$Id: data.c,v 2.22 2003/07/16 01:32:53 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 1.1 #include "standard.h"
13 schorsch 2.20 #include "platform.h"
14 greg 1.1 #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    
37     DATARRAY *
38     getdata(dname) /* get data array dname */
39     char *dname;
40     {
41     char *dfname;
42     FILE *fp;
43     int asize;
44 greg 1.4 register int i, j;
45 greg 1.1 register DATARRAY *dp;
46     /* look for array in list */
47 greg 2.6 for (dp = dtab[hash(dname)]; dp != NULL; dp = dp->next)
48 greg 1.1 if (!strcmp(dname, dp->name))
49     return(dp); /* found! */
50     /*
51     * If we haven't loaded the data already, we will look
52 greg 2.5 * for it in the directories specified by the library path.
53 greg 1.1 *
54     * The file has the following format:
55     *
56 greg 1.4 * N
57 greg 1.1 * beg0 end0 n0
58     * beg1 end1 n1
59     * . . .
60 greg 1.4 * begN endN nN
61 greg 1.1 * data, later dimensions changing faster
62     * . . .
63     *
64 greg 1.4 * For irregularly spaced points, the following can be
65     * substituted for begi endi ni:
66     *
67 greg 1.6 * 0 0 ni p0i p1i .. pni
68 greg 1.1 */
69    
70 greg 2.17 if ((dfname = getpath(dname, getrlibpath(), R_OK)) == NULL) {
71 greg 1.1 sprintf(errmsg, "cannot find data file \"%s\"", dname);
72     error(USER, errmsg);
73     }
74     if ((fp = fopen(dfname, "r")) == NULL) {
75     sprintf(errmsg, "cannot open data file \"%s\"", dfname);
76     error(SYSTEM, errmsg);
77     }
78     /* get dimensions */
79 greg 2.15 if (fgetval(fp, 'i', (char *)&asize) <= 0)
80 greg 1.1 goto scanerr;
81 greg 2.12 if (asize <= 0 | asize > MAXDDIM) {
82 greg 1.1 sprintf(errmsg, "bad number of dimensions for \"%s\"", dname);
83     error(USER, errmsg);
84     }
85 greg 2.12 if ((dp = (DATARRAY *)malloc(sizeof(DATARRAY))) == NULL)
86     goto memerr;
87     dp->name = savestr(dname);
88     dp->type = DATATY;
89     dp->nd = asize;
90 greg 1.1 asize = 1;
91     for (i = 0; i < dp->nd; i++) {
92 greg 2.15 if (fgetval(fp, DATATY, (char *)&dp->dim[i].org) <= 0)
93 greg 1.6 goto scanerr;
94 greg 2.15 if (fgetval(fp, DATATY, (char *)&dp->dim[i].siz) <= 0)
95 greg 1.10 goto scanerr;
96 greg 2.15 if (fgetval(fp, 'i', (char *)&dp->dim[i].ne) <= 0)
97 greg 1.10 goto scanerr;
98 greg 1.6 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 greg 2.12 dp->dim[i].p = (DATATYPE *)
103     malloc(dp->dim[i].ne*sizeof(DATATYPE));
104 greg 1.4 if (dp->dim[i].p == NULL)
105     goto memerr;
106 greg 2.10 for (j = 0; j < dp->dim[i].ne; j++)
107 greg 2.15 if (fgetval(fp, DATATY,
108     (char *)&dp->dim[i].p[j]) <= 0)
109 greg 1.4 goto scanerr;
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 greg 1.6 dp->dim[i].p = NULL;
119 greg 1.1 }
120 greg 2.12 if ((dp->arr.d = (DATATYPE *)malloc(asize*sizeof(DATATYPE))) == NULL)
121 greg 1.1 goto memerr;
122    
123 greg 2.10 for (i = 0; i < asize; i++)
124 greg 2.15 if (fgetval(fp, DATATY, (char *)&dp->arr.d[i]) <= 0)
125 greg 1.1 goto scanerr;
126     fclose(fp);
127 greg 2.6 i = hash(dname);
128     dp->next = dtab[i];
129     return(dtab[i] = dp);
130 greg 1.1
131     memerr:
132     error(SYSTEM, "out of memory in getdata");
133     scanerr:
134     sprintf(errmsg, "%s in data file \"%s\"",
135     feof(fp) ? "unexpected EOF" : "bad format", dfname);
136     error(USER, errmsg);
137     }
138    
139    
140 greg 2.15 static int
141 greg 2.4 headaspect(s, iap) /* check string for aspect ratio */
142 greg 1.5 char *s;
143 greg 2.4 double *iap;
144 greg 1.5 {
145 gwlarson 2.14 char fmt[32];
146    
147 greg 1.5 if (isaspect(s))
148 greg 2.4 *iap *= aspectval(s);
149 greg 2.15 else if (formatval(fmt, s) && !globmatch(PICFMT, fmt))
150 gwlarson 2.14 *iap = 0.0;
151     return(0);
152 greg 1.5 }
153    
154    
155 greg 1.1 DATARRAY *
156     getpict(pname) /* get picture pname */
157     char *pname;
158     {
159 greg 2.4 double inpaspect;
160 greg 1.1 char *pfname;
161     FILE *fp;
162 greg 2.12 COLR *scanin;
163 greg 1.11 int sl, ns;
164 greg 2.3 RESOLU inpres;
165 schorsch 2.21 RREAL loc[2];
166 greg 1.11 int y;
167     register int x, i;
168 greg 1.1 register DATARRAY *pp;
169     /* look for array in list */
170 greg 2.12 for (pp = dtab[hash(pname)]; pp != NULL; pp = pp->next)
171 greg 1.1 if (!strcmp(pname, pp->name))
172     return(pp); /* found! */
173    
174 greg 2.17 if ((pfname = getpath(pname, getrlibpath(), R_OK)) == NULL) {
175 greg 1.1 sprintf(errmsg, "cannot find picture file \"%s\"", pname);
176     error(USER, errmsg);
177     }
178 greg 2.12 if ((pp = (DATARRAY *)malloc(3*sizeof(DATARRAY))) == NULL)
179 greg 1.1 goto memerr;
180    
181 greg 2.12 pp[0].name = savestr(pname);
182 greg 1.1
183     if ((fp = fopen(pfname, "r")) == NULL) {
184     sprintf(errmsg, "cannot open picture file \"%s\"", pfname);
185     error(SYSTEM, errmsg);
186     }
187 schorsch 2.19 SET_FILE_BINARY(fp);
188 greg 1.1 /* get dimensions */
189 greg 1.5 inpaspect = 1.0;
190 greg 2.15 getheader(fp, headaspect, (char *)&inpaspect);
191 gwlarson 2.14 if (inpaspect <= FTINY || !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 greg 2.15 free((void *)scanin);
234 greg 1.1 fclose(fp);
235 greg 2.6 i = hash(pname);
236 greg 2.12 pp[0].next = dtab[i]; /* link into picture list */
237 schorsch 2.23 pp[1] = pp[0];
238     pp[2] = pp[0];
239 greg 2.12 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 greg 2.15 void
253     freedata(dta) /* release data array reference */
254     DATARRAY *dta;
255 greg 1.1 {
256 greg 2.5 DATARRAY head;
257 greg 2.6 int hval, nents;
258 greg 2.15 register DATARRAY *dpl, *dp;
259 greg 1.4 register int i;
260 greg 1.1
261 greg 2.15 if (dta == NULL) { /* free all if NULL */
262 greg 2.6 hval = 0; nents = TABSIZ;
263     } else {
264 greg 2.15 hval = hash(dta->name); nents = 1;
265 greg 2.6 }
266     while (nents--) {
267     head.next = dtab[hval];
268     dpl = &head;
269     while ((dp = dpl->next) != NULL)
270 greg 2.15 if ((dta == NULL | dta == dp)) {
271 greg 2.6 dpl->next = dp->next;
272 greg 2.12 if (dp->type == DATATY)
273 greg 2.15 free((void *)dp->arr.d);
274 greg 2.12 else
275 greg 2.15 free((void *)dp->arr.c);
276 greg 2.6 for (i = 0; i < dp->nd; i++)
277     if (dp->dim[i].p != NULL)
278 greg 2.15 free((void *)dp->dim[i].p);
279 greg 2.6 freestr(dp->name);
280 greg 2.15 free((void *)dp);
281 greg 2.6 } else
282     dpl = dp;
283     dtab[hval++] = head.next;
284     }
285 greg 1.1 }
286    
287    
288     double
289     datavalue(dp, pt) /* interpolate data value at a point */
290     register DATARRAY *dp;
291 greg 2.3 double *pt;
292 greg 1.1 {
293     DATARRAY sd;
294     int asize;
295 greg 1.6 int lower, upper;
296 greg 1.1 register int i;
297 greg 2.9 double x, y0, y1;
298 greg 1.4 /* set up dimensions for recursion */
299 greg 2.12 if (dp->nd > 1) {
300     sd.name = dp->name;
301     sd.type = dp->type;
302     sd.nd = dp->nd - 1;
303     asize = 1;
304     for (i = 0; i < sd.nd; i++) {
305     sd.dim[i].org = dp->dim[i+1].org;
306     sd.dim[i].siz = dp->dim[i+1].siz;
307     sd.dim[i].p = dp->dim[i+1].p;
308     asize *= sd.dim[i].ne = dp->dim[i+1].ne;
309     }
310 greg 1.1 }
311 greg 1.4 /* get independent variable */
312     if (dp->dim[0].p == NULL) { /* evenly spaced points */
313     x = (pt[0] - dp->dim[0].org)/dp->dim[0].siz;
314 greg 2.9 x *= (double)(dp->dim[0].ne - 1);
315 greg 1.4 i = x;
316     if (i < 0)
317     i = 0;
318     else if (i > dp->dim[0].ne - 2)
319     i = dp->dim[0].ne - 2;
320     } else { /* unevenly spaced points */
321 greg 1.6 if (dp->dim[0].siz > 0.0) {
322     lower = 0;
323     upper = dp->dim[0].ne;
324     } else {
325     lower = dp->dim[0].ne;
326     upper = 0;
327     }
328     do {
329     i = (lower + upper) >> 1;
330     if (pt[0] >= dp->dim[0].p[i])
331     lower = i;
332 greg 1.8 else
333 greg 1.6 upper = i;
334     } while (i != (lower + upper) >> 1);
335 greg 1.8 if (i > dp->dim[0].ne - 2)
336 greg 1.4 i = dp->dim[0].ne - 2;
337     x = i + (pt[0] - dp->dim[0].p[i]) /
338     (dp->dim[0].p[i+1] - dp->dim[0].p[i]);
339     }
340     /* get dependent variable */
341 greg 2.12 if (dp->nd > 1) {
342     if (dp->type == DATATY) {
343     sd.arr.d = dp->arr.d + i*asize;
344     y0 = datavalue(&sd, pt+1);
345     sd.arr.d = dp->arr.d + (i+1)*asize;
346     y1 = datavalue(&sd, pt+1);
347     } else {
348     sd.arr.c = dp->arr.c + i*asize;
349     y0 = datavalue(&sd, pt+1);
350     sd.arr.c = dp->arr.c + (i+1)*asize;
351     y1 = datavalue(&sd, pt+1);
352     }
353 greg 1.1 } else {
354 greg 2.12 if (dp->type == DATATY) {
355     y0 = dp->arr.d[i];
356     y1 = dp->arr.d[i+1];
357     } else {
358     y0 = colrval(dp->arr.c[i],dp->type);
359     y1 = colrval(dp->arr.c[i+1],dp->type);
360     }
361 greg 1.1 }
362     /*
363     * Extrapolate as far as one division, then
364     * taper off harmonically to zero.
365     */
366     if (x > i+2)
367 greg 2.9 return( (2*y1-y0)/(x-(i-1)) );
368 greg 1.1
369 greg 2.9 if (x < i-1)
370     return( (2*y0-y1)/(i-x) );
371    
372     return( y0*((i+1)-x) + y1*(x-i) );
373 greg 1.1 }