1 |
#ifndef lint |
2 |
static const char RCSid[] = "$Id: calfunc.c,v 2.28 2022/04/08 23:32:25 greg Exp $"; |
3 |
#endif |
4 |
/* |
5 |
* calfunc.c - routines for calcomp using functions. |
6 |
* |
7 |
* If VARIABLE is not set, only library functions |
8 |
* can be accessed. |
9 |
* |
10 |
* 2/19/03 Eliminated conditional compiles in favor of esupport extern. |
11 |
*/ |
12 |
|
13 |
#include "copyright.h" |
14 |
|
15 |
#include <stdio.h> |
16 |
#include <string.h> |
17 |
#include <errno.h> |
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 10 /* maximum saved argument list */ |
26 |
|
27 |
typedef struct activation { |
28 |
char *name; /* function name */ |
29 |
struct activation *prev; /* previous activation */ |
30 |
double *ap; /* argument list */ |
31 |
unsigned long an; /* computed argument flags */ |
32 |
EPNODE *fun; /* argument function */ |
33 |
} ACTIVATION; /* an activation record */ |
34 |
|
35 |
static ACTIVATION *curact = NULL; |
36 |
|
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(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] = { |
54 |
{ "acos", 1, ':', l_acos }, |
55 |
{ "asin", 1, ':', l_asin }, |
56 |
{ "atan", 1, ':', l_atan }, |
57 |
{ "atan2", 2, ':', l_atan2 }, |
58 |
{ "ceil", 1, ':', l_ceil }, |
59 |
{ "cos", 1, ':', l_cos }, |
60 |
{ "exp", 1, ':', l_exp }, |
61 |
{ "floor", 1, ':', l_floor }, |
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 }, |
70 |
{ "sqrt", 1, ':', l_sqrt }, |
71 |
{ "tan", 1, ':', l_tan }, |
72 |
}; |
73 |
|
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( /* return # of req'd arguments for function */ |
81 |
char *fname |
82 |
) |
83 |
{ |
84 |
LIBR *lp; |
85 |
VARDEF *vp; |
86 |
|
87 |
if ((vp = varlookup(fname)) != NULL && vp->def != NULL |
88 |
&& vp->def->v.kid->type == FUNC) |
89 |
return(nekids(vp->def->v.kid) - 1); |
90 |
lp = vp != NULL ? vp->lib : liblookup(fname); |
91 |
if (lp == NULL) |
92 |
return(0); |
93 |
return(lp->nargs); |
94 |
} |
95 |
|
96 |
|
97 |
double |
98 |
funvalue( /* return a function value to the user */ |
99 |
char *fname, |
100 |
int n, |
101 |
double *a |
102 |
) |
103 |
{ |
104 |
ACTIVATION act; |
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) |
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 |
|
121 |
if ((vp = varlookup(fname)) == NULL || vp->def == NULL |
122 |
|| vp->def->v.kid->type != FUNC) |
123 |
rval = libfunc(fname, vp); |
124 |
else |
125 |
rval = evalue(vp->def->v.kid->sibling); |
126 |
|
127 |
curact = act.prev; /* pop environment */ |
128 |
return(rval); |
129 |
} |
130 |
|
131 |
|
132 |
void |
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 |
LIBR *lp; |
143 |
/* check for context */ |
144 |
for (cp = fname; *cp; cp++) |
145 |
; |
146 |
if (cp == fname) |
147 |
return; |
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] = lp[-1]; |
162 |
else |
163 |
break; |
164 |
libsize++; |
165 |
} |
166 |
if (fptr == NULL) { /* delete */ |
167 |
while (lp < &library[libsize-1]) { |
168 |
lp[0] = lp[1]; |
169 |
lp++; |
170 |
} |
171 |
libsize--; |
172 |
} else { /* or assign */ |
173 |
lp[0].fname = fname; /* string must be static! */ |
174 |
lp[0].nargs = nargs; |
175 |
lp[0].atyp = assign; |
176 |
lp[0].f = fptr; |
177 |
} |
178 |
if (libsize != oldlibsize) |
179 |
libupdate(fname); /* relink library */ |
180 |
} |
181 |
|
182 |
|
183 |
int |
184 |
nargum(void) /* return number of available arguments */ |
185 |
{ |
186 |
int n; |
187 |
|
188 |
if (curact == NULL) |
189 |
return(0); |
190 |
if (curact->fun == NULL) { |
191 |
for (n = 0; (1L<<n) & curact->an; n++) |
192 |
; |
193 |
return(n); |
194 |
} |
195 |
return(nekids(curact->fun) - 1); |
196 |
} |
197 |
|
198 |
|
199 |
double |
200 |
argument(int n) /* return nth argument for active function */ |
201 |
{ |
202 |
ACTIVATION *actp = curact; |
203 |
EPNODE *ep = NULL; |
204 |
double aval; |
205 |
|
206 |
if (!actp | (--n < 0)) { |
207 |
eputs("Bad call to argument!\n"); |
208 |
quit(1); |
209 |
} |
210 |
if ((n < AFLAGSIZ) & actp->an >> n) /* already computed? */ |
211 |
return(actp->ap[n]); |
212 |
|
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; /* previous context */ |
219 |
aval = evalue(ep); /* compute argument */ |
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 |
} |
225 |
return(aval); |
226 |
} |
227 |
|
228 |
|
229 |
VARDEF * |
230 |
argf(int n) /* return function def for nth argument */ |
231 |
{ |
232 |
ACTIVATION *actp; |
233 |
EPNODE *ep; |
234 |
|
235 |
for (actp = curact; actp != NULL; actp = actp->prev) { |
236 |
|
237 |
if (n <= 0) |
238 |
break; |
239 |
|
240 |
if (actp->fun == NULL) |
241 |
goto badarg; |
242 |
|
243 |
if ((ep = ekid(actp->fun, n)) == NULL) { |
244 |
eputs(actp->name); |
245 |
eputs(": too few arguments\n"); |
246 |
quit(1); |
247 |
} |
248 |
if (ep->type == VAR) |
249 |
return(ep->v.ln); /* found it */ |
250 |
|
251 |
if (ep->type != ARG) |
252 |
goto badarg; |
253 |
|
254 |
n = ep->v.chan; /* try previous context */ |
255 |
} |
256 |
eputs("Bad call to argf!\n"); |
257 |
quit(1); |
258 |
|
259 |
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(int n) /* return function name for nth argument */ |
269 |
{ |
270 |
return(argf(n)->name); |
271 |
} |
272 |
|
273 |
|
274 |
double |
275 |
efunc(EPNODE *ep) /* evaluate a function */ |
276 |
{ |
277 |
ACTIVATION act; |
278 |
double alist[ALISTSIZ]; |
279 |
double rval; |
280 |
VARDEF *dp; |
281 |
/* push environment */ |
282 |
dp = resolve(ep->v.kid); |
283 |
act.name = dp->name; |
284 |
act.prev = curact; |
285 |
act.ap = alist; |
286 |
act.an = 0; |
287 |
act.fun = ep; |
288 |
curact = &act; |
289 |
|
290 |
if (dp->def == NULL || dp->def->v.kid->type != FUNC) |
291 |
rval = libfunc(act.name, dp); |
292 |
else |
293 |
rval = evalue(dp->def->v.kid->sibling); |
294 |
|
295 |
curact = act.prev; /* pop environment */ |
296 |
return(rval); |
297 |
} |
298 |
|
299 |
|
300 |
LIBR * |
301 |
liblookup(char *fname) /* look up a library function */ |
302 |
{ |
303 |
int upper, lower; |
304 |
int cm, i; |
305 |
|
306 |
lower = 0; |
307 |
upper = cm = libsize; |
308 |
|
309 |
while ((i = (lower + upper) >> 1) != cm) { |
310 |
cm = strcmp(fname, library[i].fname); |
311 |
if (cm > 0) |
312 |
lower = i; |
313 |
else if (cm < 0) |
314 |
upper = i; |
315 |
else |
316 |
return(&library[i]); |
317 |
cm = i; |
318 |
} |
319 |
return(NULL); |
320 |
} |
321 |
|
322 |
|
323 |
/* |
324 |
* The following routines are for internal use: |
325 |
*/ |
326 |
|
327 |
|
328 |
static double |
329 |
libfunc( /* execute library function */ |
330 |
char *fname, |
331 |
VARDEF *vp |
332 |
) |
333 |
{ |
334 |
LIBR *lp; |
335 |
double d; |
336 |
int lasterrno; |
337 |
|
338 |
if (vp != NULL) |
339 |
lp = vp->lib; |
340 |
else |
341 |
lp = liblookup(fname); |
342 |
if (lp == NULL) { |
343 |
eputs(fname); |
344 |
eputs(": undefined function\n"); |
345 |
quit(1); |
346 |
} |
347 |
lasterrno = errno; |
348 |
errno = 0; |
349 |
d = (*lp->f)(lp->fname); |
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 == EDOM) | (errno == ERANGE)) { |
359 |
wputs(fname); |
360 |
if (errno == EDOM) |
361 |
wputs(": domain error\n"); |
362 |
else if (errno == ERANGE) |
363 |
wputs(": range error\n"); |
364 |
else |
365 |
wputs(": error in call\n"); |
366 |
return(0.0); |
367 |
} |
368 |
errno = lasterrno; |
369 |
return(d); |
370 |
} |
371 |
|
372 |
|
373 |
/* |
374 |
* Library functions: |
375 |
*/ |
376 |
|
377 |
|
378 |
static double |
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) |
383 |
return(argument(2)); |
384 |
else |
385 |
return(argument(3)); |
386 |
} |
387 |
|
388 |
|
389 |
static double |
390 |
l_select(char *nm) /* return argument #(A1+1) */ |
391 |
{ |
392 |
int narg = nargum(); |
393 |
double a1 = argument(1); |
394 |
int n = (int)(a1 + .5); |
395 |
|
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_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); |
442 |
x *= 1.0/(1.0 + x*x) + 2.71828182845904; |
443 |
x += .785398163397447 - floor(x); |
444 |
x = 1e5 / x; |
445 |
return(x - floor(x)); |
446 |
} |
447 |
|
448 |
|
449 |
static double |
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(char *nm) /* return smallest integer not less than arg1 */ |
458 |
{ |
459 |
return(ceil(argument(1))); |
460 |
} |
461 |
|
462 |
|
463 |
static double |
464 |
l_sqrt(char *nm) |
465 |
{ |
466 |
return(sqrt(argument(1))); |
467 |
} |
468 |
|
469 |
|
470 |
static double |
471 |
l_sin(char *nm) |
472 |
{ |
473 |
return(sin(argument(1))); |
474 |
} |
475 |
|
476 |
|
477 |
static double |
478 |
l_cos(char *nm) |
479 |
{ |
480 |
return(cos(argument(1))); |
481 |
} |
482 |
|
483 |
|
484 |
static double |
485 |
l_tan(char *nm) |
486 |
{ |
487 |
return(tan(argument(1))); |
488 |
} |
489 |
|
490 |
|
491 |
static double |
492 |
l_asin(char *nm) |
493 |
{ |
494 |
return(asin(argument(1))); |
495 |
} |
496 |
|
497 |
|
498 |
static double |
499 |
l_acos(char *nm) |
500 |
{ |
501 |
return(acos(argument(1))); |
502 |
} |
503 |
|
504 |
|
505 |
static double |
506 |
l_atan(char *nm) |
507 |
{ |
508 |
return(atan(argument(1))); |
509 |
} |
510 |
|
511 |
|
512 |
static double |
513 |
l_atan2(char *nm) |
514 |
{ |
515 |
return(atan2(argument(1), argument(2))); |
516 |
} |
517 |
|
518 |
|
519 |
static double |
520 |
l_exp(char *nm) |
521 |
{ |
522 |
return(exp(argument(1))); |
523 |
} |
524 |
|
525 |
|
526 |
static double |
527 |
l_log(char *nm) |
528 |
{ |
529 |
return(log(argument(1))); |
530 |
} |
531 |
|
532 |
|
533 |
static double |
534 |
l_log10(char *nm) |
535 |
{ |
536 |
return(log10(argument(1))); |
537 |
} |