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.8 by greg, Sat Feb 22 02:07:21 2003 UTC vs.
Revision 2.29 by greg, Sun Feb 25 18:36:27 2024 UTC

# Line 10 | Line 10 | static const char      RCSid[] = "$Id$";
10   *  2/19/03     Eliminated conditional compiles in favor of esupport extern.
11   */
12  
13 < /* ====================================================================
14 < * The Radiance Software License, Version 1.0
15 < *
16 < * Copyright (c) 1990 - 2002 The Regents of the University of California,
17 < * through Lawrence Berkeley National Laboratory.   All rights reserved.
18 < *
19 < * Redistribution and use in source and binary forms, with or without
20 < * modification, are permitted provided that the following conditions
21 < * are met:
22 < *
23 < * 1. Redistributions of source code must retain the above copyright
24 < *         notice, this list of conditions and the following disclaimer.
25 < *
26 < * 2. Redistributions in binary form must reproduce the above copyright
27 < *       notice, this list of conditions and the following disclaimer in
28 < *       the documentation and/or other materials provided with the
29 < *       distribution.
30 < *
31 < * 3. The end-user documentation included with the redistribution,
32 < *           if any, must include the following acknowledgment:
33 < *             "This product includes Radiance software
34 < *                 (http://radsite.lbl.gov/)
35 < *                 developed by the Lawrence Berkeley National Laboratory
36 < *               (http://www.lbl.gov/)."
37 < *       Alternately, this acknowledgment may appear in the software itself,
38 < *       if and wherever such third-party acknowledgments normally appear.
39 < *
40 < * 4. The names "Radiance," "Lawrence Berkeley National Laboratory"
41 < *       and "The Regents of the University of California" must
42 < *       not be used to endorse or promote products derived from this
43 < *       software without prior written permission. For written
44 < *       permission, please contact [email protected].
45 < *
46 < * 5. Products derived from this software may not be called "Radiance",
47 < *       nor may "Radiance" appear in their name, without prior written
48 < *       permission of Lawrence Berkeley National Laboratory.
49 < *
50 < * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
51 < * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
52 < * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
53 < * DISCLAIMED.   IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR
54 < * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
55 < * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
56 < * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
57 < * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
58 < * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
59 < * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
60 < * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61 < * SUCH DAMAGE.
62 < * ====================================================================
63 < *
64 < * This software consists of voluntary contributions made by many
65 < * individuals on behalf of Lawrence Berkeley National Laboratory.   For more
66 < * information on Lawrence Berkeley National Laboratory, please see
67 < * <http://www.lbl.gov/>.
68 < */
13 > #include "copyright.h"
14  
15   #include  <stdio.h>
16 <
16 > #include  <string.h>
17   #include  <errno.h>
73 –
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       10      /* maximum saved argument list */
26  
27   typedef struct activation {
28      char  *name;                /* function name */
# Line 89 | 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 */
41   #endif
42  
43 < static double  l_if(), l_select(), l_rand();
44 < static double  l_floor(), l_ceil();
45 < static double  l_sqrt();
46 < static double  l_sin(), l_cos(), l_tan();
47 < static double  l_asin(), l_acos(), l_atan(), l_atan2();
48 < static double  l_exp(), l_log(), l_log10();
43 > static double  l_if(char *), l_select(char *);
44 > static double  l_min(char *), l_max(char *);
45 > static double  l_rand(char *);
46 > static double  l_floor(char *), l_ceil(char *);
47 > static double  l_sqrt(char *);
48 > static double  l_sin(char *), l_cos(char *), l_tan(char *);
49 > static double  l_asin(char *), l_acos(char *), l_atan(char *), l_atan2(char *);
50 > static double  l_exp(char *), l_log(char *), l_log10(char *);
51  
52                          /* functions must be listed alphabetically */
53   static LIBR  library[MAXLIB] = {
# Line 115 | Line 62 | static LIBR  library[MAXLIB] = {
62      { "if", 3, ':', l_if },
63      { "log", 1, ':', l_log },
64      { "log10", 1, ':', l_log10 },
65 +    { "max", 1, ':', l_max },
66 +    { "min", 1, ':', l_min },
67      { "rand", 1, ':', l_rand },
68      { "select", 1, ':', l_select },
69      { "sin", 1, ':', l_sin },
# Line 122 | Line 71 | static LIBR  library[MAXLIB] = {
71      { "tan", 1, ':', l_tan },
72   };
73  
74 < static int  libsize = 16;
74 > static int  libsize = 18;
75  
76   #define  resolve(ep)    ((ep)->type==VAR?(ep)->v.ln:argf((ep)->v.chan))
77  
78  
79   int
80 < fundefined(fname)               /* return # of arguments for function */
81 < char  *fname;
80 > fundefined(                     /* return # of req'd arguments for function */
81 >        char  *fname
82 > )
83   {
84 <    register LIBR  *lp;
85 <    register VARDEF  *vp;
84 >    LIBR  *lp;
85 >    VARDEF  *vp;
86  
87      if ((vp = varlookup(fname)) != NULL && vp->def != NULL
88                  && vp->def->v.kid->type == FUNC)
# Line 145 | Line 95 | char  *fname;
95  
96  
97   double
98 < funvalue(fname, n, a)           /* return a function value to the user */
99 < char  *fname;
100 < int  n;
101 < double  *a;
98 > funvalue(                       /* return a function value to the user */
99 >        char  *fname,
100 >        int  n,
101 >        double  *a
102 > )
103   {
104      ACTIVATION  act;
105 <    register VARDEF  *vp;
105 >    VARDEF  *vp;
106      double  rval;
107                                          /* push environment */
108      act.name = fname;
109      act.prev = curact;
110      act.ap = a;
111 <    if (n >= AFLAGSIZ)
161 <        act.an = ~0;
162 <    else
111 >    if (n < AFLAGSIZ)
112          act.an = (1L<<n)-1;
113 +    else {
114 +        act.an = ~0;
115 +        if (n > AFLAGSIZ)
116 +            wputs("Excess arguments in funvalue()\n");
117 +    }
118      act.fun = NULL;
119      curact = &act;
120  
# Line 176 | Line 130 | double  *a;
130  
131  
132   void
133 < funset(fname, nargs, assign, fptr)      /* set a library function */
134 < char  *fname;
135 < int  nargs;
136 < int  assign;
137 < double  (*fptr)();
133 > funset(                         /* set a library function */
134 >        char  *fname,
135 >        int  nargs,
136 >        int  assign,
137 >        double  (*fptr)(char *)
138 > )
139   {
140      int  oldlibsize = libsize;
141      char *cp;
142 <    register LIBR  *lp;
142 >    LIBR  *lp;
143                                                  /* check for context */
144      for (cp = fname; *cp; cp++)
145          ;
146      if (cp == fname)
147          return;
148 <    if (cp[-1] == CNTXMARK)
148 >    while (cp[-1] == CNTXMARK) {
149          *--cp = '\0';
150 +        if (cp == fname) return;
151 +    }
152      if ((lp = liblookup(fname)) == NULL) {      /* insert */
153 +        if (fptr == NULL)
154 +                return;                         /* nothing! */
155          if (libsize >= MAXLIB) {
156              eputs("Too many library functons!\n");
157              quit(1);
158          }
159          for (lp = &library[libsize]; lp > library; lp--)
160 <            if (strcmp(lp[-1].fname, fname) > 0) {
161 <                lp[0].fname = lp[-1].fname;
162 <                lp[0].nargs = lp[-1].nargs;
204 <                lp[0].atyp = lp[-1].atyp;
205 <                lp[0].f = lp[-1].f;
206 <            } else
160 >            if (strcmp(lp[-1].fname, fname) > 0)
161 >                lp[0] = lp[-1];
162 >            else
163                  break;
164          libsize++;
165      }
166      if (fptr == NULL) {                         /* delete */
167          while (lp < &library[libsize-1]) {
168 <            lp[0].fname = lp[1].fname;
213 <            lp[0].nargs = lp[1].nargs;
214 <            lp[0].atyp = lp[1].atyp;
215 <            lp[0].f = lp[1].f;
168 >            lp[0] = lp[1];
169              lp++;
170          }
171          libsize--;
# Line 228 | Line 181 | double  (*fptr)();
181  
182  
183   int
184 < nargum()                        /* return number of available arguments */
184 > nargum(void)                    /* return number of available arguments */
185   {
186 <    register int  n;
186 >    int  n;
187  
188      if (curact == NULL)
189          return(0);
# Line 244 | Line 197 | nargum()                       /* return number of available arguments */
197  
198  
199   double
200 < argument(n)                     /* return nth argument for active function */
248 < register int  n;
200 > argument(int n)                 /* return nth argument for active function */
201   {
202 <    register ACTIVATION  *actp = curact;
203 <    register EPNODE  *ep;
202 >    ACTIVATION  *actp = curact;
203 >    EPNODE  *ep = NULL;
204      double  aval;
205  
206 <    if (actp == NULL || --n < 0) {
206 >    if (!actp | (--n < 0)) {
207          eputs("Bad call to argument!\n");
208          quit(1);
209      }
210 <                                                /* already computed? */
259 <    if (n < AFLAGSIZ && 1L<<n & actp->an)
210 >    if ((n < AFLAGSIZ) & actp->an >> n)         /* already computed? */
211          return(actp->ap[n]);
212  
213 <    if (actp->fun == NULL || (ep = ekid(actp->fun, n+1)) == NULL) {
213 >    if (!actp->fun || !(ep = ekid(actp->fun, n+1))) {
214          eputs(actp->name);
215          eputs(": too few arguments\n");
216          quit(1);
217      }
218 <    curact = actp->prev;                        /* pop environment */
218 >    curact = actp->prev;                        /* previous context */
219      aval = evalue(ep);                          /* compute argument */
220 <    curact = actp;                              /* push back environment */
221 <    if (n < ALISTSIZ) {                         /* save value */
220 >    curact = actp;                              /* put back calling context */
221 >    if (n < ALISTSIZ) {                         /* save value if room */
222          actp->ap[n] = aval;
223          actp->an |= 1L<<n;
224      }
# Line 276 | Line 227 | register int  n;
227  
228  
229   VARDEF *
230 < argf(n)                         /* return function def for nth argument */
280 < int  n;
230 > argf(int n)                     /* return function def for nth argument */
231   {
232 <    register ACTIVATION  *actp;
233 <    register EPNODE  *ep;
232 >    ACTIVATION  *actp;
233 >    EPNODE  *ep;
234  
235      for (actp = curact; actp != NULL; actp = actp->prev) {
236  
# Line 310 | Line 260 | badarg:
260      eputs(actp->name);
261      eputs(": argument not a function\n");
262      quit(1);
263 +        return NULL; /* pro forma return */
264   }
265  
266  
267   char *
268 < argfun(n)                       /* return function name for nth argument */
318 < int  n;
268 > argfun(int n)                   /* return function name for nth argument */
269   {
270      return(argf(n)->name);
271   }
272  
273  
274   double
275 < efunc(ep)                               /* evaluate a function */
326 < register EPNODE  *ep;
275 > efunc(EPNODE *ep)                       /* evaluate a function */
276   {
277      ACTIVATION  act;
278      double  alist[ALISTSIZ];
279      double  rval;
280 <    register VARDEF  *dp;
280 >    VARDEF  *dp;
281                                          /* push environment */
282      dp = resolve(ep->v.kid);
283      act.name = dp->name;
# Line 349 | Line 298 | register EPNODE  *ep;
298  
299  
300   LIBR *
301 < liblookup(fname)                /* look up a library function */
353 < char  *fname;
301 > liblookup(char *fname)          /* look up a library function */
302   {
303      int  upper, lower;
304 <    register int  cm, i;
304 >    int  cm, i;
305  
306      lower = 0;
307      upper = cm = libsize;
# Line 378 | Line 326 | char  *fname;
326  
327  
328   static double
329 < libfunc(fname, vp)                      /* execute library function */
330 < char  *fname;
331 < VARDEF  *vp;
329 > libfunc(                                /* execute library function */
330 >        char  *fname,
331 >        VARDEF  *vp
332 > )
333   {
334 <    register LIBR  *lp;
334 >    LIBR  *lp;
335      double  d;
336      int  lasterrno;
337  
# Line 398 | Line 347 | VARDEF  *vp;
347      lasterrno = errno;
348      errno = 0;
349      d = (*lp->f)(lp->fname);
350 < #ifdef  IEEE
351 <    if (errno == 0)
350 > #ifdef  isnan
351 >    if (errno == 0) {
352          if (isnan(d))
353              errno = EDOM;
354          else if (isinf(d))
355              errno = ERANGE;
356 +    }
357   #endif
358 <    if (errno) {
358 >    if ((errno == EDOM) | (errno == ERANGE)) {
359          wputs(fname);
360          if (errno == EDOM)
361                  wputs(": domain error\n");
# Line 426 | Line 376 | VARDEF  *vp;
376  
377  
378   static double
379 < l_if()                  /* if(cond, then, else) conditional expression */
379 > l_if(char *nm)          /* if(cond, then, else) conditional expression */
380                          /* cond evaluates true if greater than zero */
381   {
382      if (argument(1) > 0.0)
# Line 437 | Line 387 | l_if()                 /* if(cond, then, else) conditional expressio
387  
388  
389   static double
390 < l_select()              /* return argument #(A1+1) */
390 > l_select(char *nm)      /* return argument #(A1+1) */
391   {
392 <        register int  n;
392 >        int     narg = nargum();
393 >        double  a1 = argument(1);
394 >        int  n = (int)(a1 + .5);
395  
396 <        n = argument(1) + .5;
445 <        if (n == 0)
446 <                return(nargum()-1);
447 <        if (n < 1 || n > nargum()-1) {
396 >        if ((a1 < -.5) | (n >= narg)) {
397                  errno = EDOM;
398                  return(0.0);
399          }
400 +        if (!n)         /* asking max index? */
401 +                return(narg-1);
402          return(argument(n+1));
403   }
404  
405  
406   static double
407 < l_rand()                /* random function between 0 and 1 */
407 > l_max(char *nm)         /* general maximum function */
408   {
409 +        int  n = nargum();
410 +        double  vmax = argument(1);
411 +
412 +        while (n > 1) {
413 +                double  v = argument(n--);
414 +                if (vmax < v)
415 +                        vmax = v;
416 +        }
417 +        return(vmax);
418 + }
419 +
420 +
421 + static double
422 + l_min(char *nm)         /* general minimum function */
423 + {
424 +        int  n = nargum();
425 +        double  vmin = argument(1);
426 +
427 +        while (n > 1) {
428 +                double  v = argument(n--);
429 +                if (vmin > v)
430 +                        vmin = v;
431 +        }
432 +        return(vmin);
433 + }
434 +
435 +
436 + static double
437 + l_rand(char *nm)                /* random function between 0 and 1 */
438 + {
439      double  x;
440  
441      x = argument(1);
# Line 466 | Line 447 | l_rand()               /* random function between 0 and 1 */
447  
448  
449   static double
450 < l_floor()               /* return largest integer not greater than arg1 */
450 > l_floor(char *nm)               /* return largest integer not greater than arg1 */
451   {
452      return(floor(argument(1)));
453   }
454  
455  
456   static double
457 < l_ceil()                /* return smallest integer not less than arg1 */
457 > l_ceil(char *nm)                /* return smallest integer not less than arg1 */
458   {
459      return(ceil(argument(1)));
460   }
461  
462  
463   static double
464 < l_sqrt()
464 > l_sqrt(char *nm)
465   {
466      return(sqrt(argument(1)));
467   }
468  
469  
470   static double
471 < l_sin()
471 > l_sin(char *nm)
472   {
473      return(sin(argument(1)));
474   }
475  
476  
477   static double
478 < l_cos()
478 > l_cos(char *nm)
479   {
480      return(cos(argument(1)));
481   }
482  
483  
484   static double
485 < l_tan()
485 > l_tan(char *nm)
486   {
487      return(tan(argument(1)));
488   }
489  
490  
491   static double
492 < l_asin()
492 > l_asin(char *nm)
493   {
494      return(asin(argument(1)));
495   }
496  
497  
498   static double
499 < l_acos()
499 > l_acos(char *nm)
500   {
501      return(acos(argument(1)));
502   }
503  
504  
505   static double
506 < l_atan()
506 > l_atan(char *nm)
507   {
508      return(atan(argument(1)));
509   }
510  
511  
512   static double
513 < l_atan2()
513 > l_atan2(char *nm)
514   {
515      return(atan2(argument(1), argument(2)));
516   }
517  
518  
519   static double
520 < l_exp()
520 > l_exp(char *nm)
521   {
522      return(exp(argument(1)));
523   }
524  
525  
526   static double
527 < l_log()
527 > l_log(char *nm)
528   {
529      return(log(argument(1)));
530   }
531  
532  
533   static double
534 < l_log10()
534 > l_log10(char *nm)
535   {
536      return(log10(argument(1)));
537   }

Diff Legend

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