ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/common/calfunc.c
(Generate patch)

Comparing ray/src/common/calfunc.c (file contents):
Revision 2.6 by greg, Sun Nov 22 12:11:48 1992 UTC vs.
Revision 2.19 by greg, Mon Mar 4 18:16:18 2019 UTC

# Line 1 | Line 1
1 – /* Copyright (c) 1992 Regents of the University of California */
2 –
1   #ifndef lint
2 < static char SCCSid[] = "$SunId$ LBL";
2 > static const char       RCSid[] = "$Id$";
3   #endif
6 –
4   /*
5   *  calfunc.c - routines for calcomp using functions.
6   *
7 < *      The define BIGLIB pulls in a large number of the
11 < *  available math routines.
12 < *
13 < *      If VARIABLE is not defined, only library functions
7 > *      If VARIABLE is not set, only library functions
8   *  can be accessed.
9   *
10 < *     4/2/86
10 > *  2/19/03     Eliminated conditional compiles in favor of esupport extern.
11   */
12  
13 < #include  <stdio.h>
13 > #include "copyright.h"
14  
15 + #include  <stdio.h>
16 + #include  <string.h>
17   #include  <errno.h>
22 –
18   #include  <math.h>
19  
20 + #include  "rterror.h"
21   #include  "calcomp.h"
22  
23                                  /* bits in argument flag (better be right!) */
24   #define  AFLAGSIZ       (8*sizeof(unsigned long))
25 < #define  ALISTSIZ       6       /* maximum saved argument list */
25 > #define  ALISTSIZ       8       /* maximum saved argument list */
26  
27   typedef struct activation {
28      char  *name;                /* function name */
# Line 38 | Line 34 | typedef struct activation {
34  
35   static ACTIVATION  *curact = NULL;
36  
37 < static double  libfunc();
37 > static double  libfunc(char *fname, VARDEF *vp);
38  
39 + #ifndef  MAXLIB
40   #define  MAXLIB         64      /* maximum number of library functions */
44 –
45 – static double  l_if(), l_select(), l_rand();
46 – static double  l_floor(), l_ceil();
47 – #ifdef  BIGLIB
48 – static double  l_sqrt();
49 – static double  l_sin(), l_cos(), l_tan();
50 – static double  l_asin(), l_acos(), l_atan(), l_atan2();
51 – static double  l_exp(), l_log(), l_log10();
41   #endif
42  
43 < #ifdef  BIGLIB
43 > static double  l_if(char *), l_select(char *), l_rand(char *);
44 > static double  l_floor(char *), l_ceil(char *);
45 > static double  l_sqrt(char *);
46 > static double  l_sin(char *), l_cos(char *), l_tan(char *);
47 > static double  l_asin(char *), l_acos(char *), l_atan(char *), l_atan2(char *);
48 > static double  l_exp(char *), l_log(char *), l_log10(char *);
49 >
50                          /* functions must be listed alphabetically */
51   static LIBR  library[MAXLIB] = {
52      { "acos", 1, ':', l_acos },
# Line 74 | Line 69 | static LIBR  library[MAXLIB] = {
69  
70   static int  libsize = 16;
71  
77 – #else
78 –                        /* functions must be listed alphabetically */
79 – static LIBR  library[MAXLIB] = {
80 –    { "ceil", 1, ':', l_ceil },
81 –    { "floor", 1, ':', l_floor },
82 –    { "if", 3, ':', l_if },
83 –    { "rand", 1, ':', l_rand },
84 –    { "select", 1, ':', l_select },
85 – };
86 –
87 – static int  libsize = 5;
88 –
89 – #endif
90 –
91 – extern char  *savestr(), *emalloc();
92 –
93 – extern VARDEF  *argf();
94 –
95 – #ifdef  VARIABLE
72   #define  resolve(ep)    ((ep)->type==VAR?(ep)->v.ln:argf((ep)->v.chan))
97 – #else
98 – #define  resolve(ep)    ((ep)->v.ln)
99 – #define varlookup(name) NULL
100 – #endif
73  
74  
75   int
76 < fundefined(fname)               /* return # of arguments for function */
77 < char  *fname;
76 > fundefined(                     /* return # of arguments for function */
77 >        char  *fname
78 > )
79   {
80      LIBR  *lp;
81 <    register VARDEF  *vp;
81 >    VARDEF  *vp;
82  
83 <    if ((vp = varlookup(fname)) == NULL || vp->def == NULL
84 <                || vp->def->v.kid->type != FUNC)
112 <        if ((lp = liblookup(fname)) == NULL)
113 <            return(0);
114 <        else
115 <            return(lp->nargs);
116 <    else
83 >    if ((vp = varlookup(fname)) != NULL && vp->def != NULL
84 >                && vp->def->v.kid->type == FUNC)
85          return(nekids(vp->def->v.kid) - 1);
86 +    lp = vp != NULL ? vp->lib : liblookup(fname);
87 +    if (lp == NULL)
88 +        return(0);
89 +    return(lp->nargs);
90   }
91  
92  
93   double
94 < funvalue(fname, n, a)           /* return a function value to the user */
95 < char  *fname;
96 < int  n;
97 < double  *a;
94 > funvalue(                       /* return a function value to the user */
95 >        char  *fname,
96 >        int  n,
97 >        double  *a
98 > )
99   {
100      ACTIVATION  act;
101 <    register VARDEF  *vp;
101 >    VARDEF  *vp;
102      double  rval;
103                                          /* push environment */
104      act.name = fname;
105      act.prev = curact;
106      act.ap = a;
107 <    if (n >= AFLAGSIZ)
135 <        act.an = ~0;
136 <    else
107 >    if (n < AFLAGSIZ)
108          act.an = (1L<<n)-1;
109 +    else {
110 +        act.an = ~0;
111 +        if (n > AFLAGSIZ)
112 +            wputs("Excess arguments in funvalue()\n");
113 +    }
114      act.fun = NULL;
115      curact = &act;
116  
# Line 149 | Line 125 | double  *a;
125   }
126  
127  
128 < funset(fname, nargs, assign, fptr)      /* set a library function */
129 < char  *fname;
130 < int  nargs;
131 < int  assign;
132 < double  (*fptr)();
128 > void
129 > funset(                         /* set a library function */
130 >        char  *fname,
131 >        int  nargs,
132 >        int  assign,
133 >        double  (*fptr)(char *)
134 > )
135   {
136      int  oldlibsize = libsize;
137 <    register LIBR  *lp;
138 <
137 >    char *cp;
138 >    LIBR  *lp;
139 >                                                /* check for context */
140 >    for (cp = fname; *cp; cp++)
141 >        ;
142 >    if (cp == fname)
143 >        return;
144 >    if (cp[-1] == CNTXMARK)
145 >        *--cp = '\0';
146      if ((lp = liblookup(fname)) == NULL) {      /* insert */
147          if (libsize >= MAXLIB) {
148              eputs("Too many library functons!\n");
149              quit(1);
150          }
151          for (lp = &library[libsize]; lp > library; lp--)
152 <            if (strcmp(lp[-1].fname, fname) > 0) {
153 <                lp[0].fname = lp[-1].fname;
154 <                lp[0].nargs = lp[-1].nargs;
170 <                lp[0].atyp = lp[-1].atyp;
171 <                lp[0].f = lp[-1].f;
172 <            } else
152 >            if (strcmp(lp[-1].fname, fname) > 0)
153 >                lp[0] = lp[-1];
154 >            else
155                  break;
156          libsize++;
157      }
158      if (fptr == NULL) {                         /* delete */
159          while (lp < &library[libsize-1]) {
160 <            lp[0].fname = lp[1].fname;
179 <            lp[0].nargs = lp[1].nargs;
180 <            lp[0].atyp = lp[1].atyp;
181 <            lp[0].f = lp[1].f;
160 >            lp[0] = lp[1];
161              lp++;
162          }
163          libsize--;
# Line 194 | Line 173 | double  (*fptr)();
173  
174  
175   int
176 < nargum()                        /* return number of available arguments */
176 > nargum(void)                    /* return number of available arguments */
177   {
178 <    register int  n;
178 >    int  n;
179  
180      if (curact == NULL)
181          return(0);
# Line 210 | Line 189 | nargum()                       /* return number of available arguments */
189  
190  
191   double
192 < argument(n)                     /* return nth argument for active function */
214 < register int  n;
192 > argument(int n)                 /* return nth argument for active function */
193   {
194 <    register ACTIVATION  *actp = curact;
195 <    register EPNODE  *ep;
194 >    ACTIVATION  *actp = curact;
195 >    EPNODE  *ep = NULL;
196      double  aval;
197  
198 <    if (actp == NULL || --n < 0) {
198 >    if (!actp | (--n < 0)) {
199          eputs("Bad call to argument!\n");
200          quit(1);
201      }
202 <                                                /* already computed? */
225 <    if (n < AFLAGSIZ && 1L<<n & actp->an)
202 >    if ((n < AFLAGSIZ) & (actp->an >> n))       /* already computed? */
203          return(actp->ap[n]);
204  
205 <    if (actp->fun == NULL || (ep = ekid(actp->fun, n+1)) == NULL) {
205 >    if (!actp->fun || !(ep = ekid(actp->fun, n+1))) {
206          eputs(actp->name);
207          eputs(": too few arguments\n");
208          quit(1);
209      }
210 <    curact = actp->prev;                        /* pop environment */
210 >    curact = actp->prev;                        /* previous context */
211      aval = evalue(ep);                          /* compute argument */
212 <    curact = actp;                              /* push back environment */
213 <    if (n < ALISTSIZ) {                         /* save value */
212 >    curact = actp;                              /* push back context */
213 >    if (n < ALISTSIZ) {                         /* save value if we can */
214          actp->ap[n] = aval;
215          actp->an |= 1L<<n;
216      }
# Line 241 | Line 218 | register int  n;
218   }
219  
220  
244 – #ifdef  VARIABLE
221   VARDEF *
222 < argf(n)                         /* return function def for nth argument */
247 < int  n;
222 > argf(int n)                     /* return function def for nth argument */
223   {
224 <    register ACTIVATION  *actp;
225 <    register EPNODE  *ep;
224 >    ACTIVATION  *actp;
225 >    EPNODE  *ep;
226  
227      for (actp = curact; actp != NULL; actp = actp->prev) {
228  
# Line 277 | Line 252 | badarg:
252      eputs(actp->name);
253      eputs(": argument not a function\n");
254      quit(1);
255 +        return NULL; /* pro forma return */
256   }
257  
258  
259   char *
260 < argfun(n)                       /* return function name for nth argument */
285 < int  n;
260 > argfun(int n)                   /* return function name for nth argument */
261   {
262      return(argf(n)->name);
263   }
289 – #endif
264  
265  
266   double
267 < efunc(ep)                               /* evaluate a function */
294 < register EPNODE  *ep;
267 > efunc(EPNODE *ep)                       /* evaluate a function */
268   {
269      ACTIVATION  act;
270      double  alist[ALISTSIZ];
271      double  rval;
272 <    register VARDEF  *dp;
272 >    VARDEF  *dp;
273                                          /* push environment */
274      dp = resolve(ep->v.kid);
275      act.name = dp->name;
# Line 317 | Line 290 | register EPNODE  *ep;
290  
291  
292   LIBR *
293 < liblookup(fname)                /* look up a library function */
321 < char  *fname;
293 > liblookup(char *fname)          /* look up a library function */
294   {
295      int  upper, lower;
296 <    register int  cm, i;
296 >    int  cm, i;
297  
298      lower = 0;
299      upper = cm = libsize;
# Line 340 | Line 312 | char  *fname;
312   }
313  
314  
343 – #ifndef  VARIABLE
344 – static VARDEF  *varlist = NULL;         /* our list of dummy variables */
345 –
346 –
347 – VARDEF *
348 – varinsert(vname)                /* dummy variable insert */
349 – char  *vname;
350 – {
351 –    register VARDEF  *vp;
352 –
353 –    vp = (VARDEF *)emalloc(sizeof(VARDEF));
354 –    vp->name = savestr(vname);
355 –    vp->nlinks = 1;
356 –    vp->def = NULL;
357 –    vp->lib = liblookup(vname);
358 –    vp->next = varlist;
359 –    varlist = vp;
360 –    return(vp);
361 – }
362 –
363 –
364 – varfree(vp)                     /* free dummy variable */
365 – register VARDEF  *vp;
366 – {
367 –    register VARDEF  *vp2;
368 –
369 –    if (vp == varlist)
370 –        varlist = vp->next;
371 –    else {
372 –        for (vp2 = varlist; vp2->next != vp; vp2 = vp2->next)
373 –                ;
374 –        vp2->next = vp->next;
375 –    }
376 –    freestr(vp->name);
377 –    efree((char *)vp);
378 – }
379 –
380 –
381 – libupdate(nm)                   /* update library */
382 – char  *nm;
383 – {
384 –    register VARDEF  *vp;
385 –
386 –    for (vp = varlist; vp != NULL; vp = vp->next)
387 –        vp->lib = liblookup(vp->name);
388 – }
389 – #endif
390 –
391 –
392 –
315   /*
316   *  The following routines are for internal use:
317   */
318  
319  
320   static double
321 < libfunc(fname, vp)                      /* execute library function */
322 < char  *fname;
323 < VARDEF  *vp;
321 > libfunc(                                /* execute library function */
322 >        char  *fname,
323 >        VARDEF  *vp
324 > )
325   {
326 <    register LIBR  *lp;
326 >    LIBR  *lp;
327      double  d;
328      int  lasterrno;
329  
# Line 416 | Line 339 | VARDEF  *vp;
339      lasterrno = errno;
340      errno = 0;
341      d = (*lp->f)(lp->fname);
342 < #ifdef  IEEE
343 <    if (errno == 0)
342 > #ifdef  isnan
343 >    if (errno == 0) {
344          if (isnan(d))
345              errno = EDOM;
346          else if (isinf(d))
347              errno = ERANGE;
348 +    }
349   #endif
350 <    if (errno) {
350 >    if (errno == EDOM || errno == ERANGE) {
351          wputs(fname);
352          if (errno == EDOM)
353                  wputs(": domain error\n");
# Line 444 | Line 368 | VARDEF  *vp;
368  
369  
370   static double
371 < l_if()                  /* if(cond, then, else) conditional expression */
371 > l_if(char *nm)          /* if(cond, then, else) conditional expression */
372                          /* cond evaluates true if greater than zero */
373   {
374      if (argument(1) > 0.0)
# Line 455 | Line 379 | l_if()                 /* if(cond, then, else) conditional expressio
379  
380  
381   static double
382 < l_select()              /* return argument #(A1+1) */
382 > l_select(char *nm)      /* return argument #(A1+1) */
383   {
384 <        register int  n;
384 >        int  n;
385  
386 <        n = argument(1) + .5;
386 >        n = (int)(argument(1) + .5);
387          if (n == 0)
388                  return(nargum()-1);
389          if (n < 1 || n > nargum()-1) {
# Line 471 | Line 395 | l_select()             /* return argument #(A1+1) */
395  
396  
397   static double
398 < l_rand()                /* random function between 0 and 1 */
398 > l_rand(char *nm)                /* random function between 0 and 1 */
399   {
400      double  x;
401  
# Line 484 | Line 408 | l_rand()               /* random function between 0 and 1 */
408  
409  
410   static double
411 < l_floor()               /* return largest integer not greater than arg1 */
411 > l_floor(char *nm)               /* return largest integer not greater than arg1 */
412   {
413      return(floor(argument(1)));
414   }
415  
416  
417   static double
418 < l_ceil()                /* return smallest integer not less than arg1 */
418 > l_ceil(char *nm)                /* return smallest integer not less than arg1 */
419   {
420      return(ceil(argument(1)));
421   }
422  
423  
500 – #ifdef  BIGLIB
424   static double
425 < l_sqrt()
425 > l_sqrt(char *nm)
426   {
427      return(sqrt(argument(1)));
428   }
429  
430  
431   static double
432 < l_sin()
432 > l_sin(char *nm)
433   {
434      return(sin(argument(1)));
435   }
436  
437  
438   static double
439 < l_cos()
439 > l_cos(char *nm)
440   {
441      return(cos(argument(1)));
442   }
443  
444  
445   static double
446 < l_tan()
446 > l_tan(char *nm)
447   {
448      return(tan(argument(1)));
449   }
450  
451  
452   static double
453 < l_asin()
453 > l_asin(char *nm)
454   {
455      return(asin(argument(1)));
456   }
457  
458  
459   static double
460 < l_acos()
460 > l_acos(char *nm)
461   {
462      return(acos(argument(1)));
463   }
464  
465  
466   static double
467 < l_atan()
467 > l_atan(char *nm)
468   {
469      return(atan(argument(1)));
470   }
471  
472  
473   static double
474 < l_atan2()
474 > l_atan2(char *nm)
475   {
476      return(atan2(argument(1), argument(2)));
477   }
478  
479  
480   static double
481 < l_exp()
481 > l_exp(char *nm)
482   {
483      return(exp(argument(1)));
484   }
485  
486  
487   static double
488 < l_log()
488 > l_log(char *nm)
489   {
490      return(log(argument(1)));
491   }
492  
493  
494   static double
495 < l_log10()
495 > l_log10(char *nm)
496   {
497      return(log10(argument(1)));
498   }
576 – #endif

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines