1 |
#ifndef lint |
2 |
static const char RCSid[] = "$Id: calfunc.c,v 2.16 2012/10/24 00:39:09 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 6 /* 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 *), 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 }, |
53 |
{ "asin", 1, ':', l_asin }, |
54 |
{ "atan", 1, ':', l_atan }, |
55 |
{ "atan2", 2, ':', l_atan2 }, |
56 |
{ "ceil", 1, ':', l_ceil }, |
57 |
{ "cos", 1, ':', l_cos }, |
58 |
{ "exp", 1, ':', l_exp }, |
59 |
{ "floor", 1, ':', l_floor }, |
60 |
{ "if", 3, ':', l_if }, |
61 |
{ "log", 1, ':', l_log }, |
62 |
{ "log10", 1, ':', l_log10 }, |
63 |
{ "rand", 1, ':', l_rand }, |
64 |
{ "select", 1, ':', l_select }, |
65 |
{ "sin", 1, ':', l_sin }, |
66 |
{ "sqrt", 1, ':', l_sqrt }, |
67 |
{ "tan", 1, ':', l_tan }, |
68 |
}; |
69 |
|
70 |
static int libsize = 16; |
71 |
|
72 |
#define resolve(ep) ((ep)->type==VAR?(ep)->v.ln:argf((ep)->v.chan)) |
73 |
|
74 |
|
75 |
int |
76 |
fundefined( /* return # of arguments for function */ |
77 |
char *fname |
78 |
) |
79 |
{ |
80 |
LIBR *lp; |
81 |
VARDEF *vp; |
82 |
|
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( /* return a function value to the user */ |
95 |
char *fname, |
96 |
int n, |
97 |
double *a |
98 |
) |
99 |
{ |
100 |
ACTIVATION act; |
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) |
108 |
act.an = ~0; |
109 |
else |
110 |
act.an = (1L<<n)-1; |
111 |
act.fun = NULL; |
112 |
curact = &act; |
113 |
|
114 |
if ((vp = varlookup(fname)) == NULL || vp->def == NULL |
115 |
|| vp->def->v.kid->type != FUNC) |
116 |
rval = libfunc(fname, vp); |
117 |
else |
118 |
rval = evalue(vp->def->v.kid->sibling); |
119 |
|
120 |
curact = act.prev; /* pop environment */ |
121 |
return(rval); |
122 |
} |
123 |
|
124 |
|
125 |
void |
126 |
funset( /* set a library function */ |
127 |
char *fname, |
128 |
int nargs, |
129 |
int assign, |
130 |
double (*fptr)(char *) |
131 |
) |
132 |
{ |
133 |
int oldlibsize = libsize; |
134 |
char *cp; |
135 |
LIBR *lp; |
136 |
/* check for context */ |
137 |
for (cp = fname; *cp; cp++) |
138 |
; |
139 |
if (cp == fname) |
140 |
return; |
141 |
if (cp[-1] == CNTXMARK) |
142 |
*--cp = '\0'; |
143 |
if ((lp = liblookup(fname)) == NULL) { /* insert */ |
144 |
if (libsize >= MAXLIB) { |
145 |
eputs("Too many library functons!\n"); |
146 |
quit(1); |
147 |
} |
148 |
for (lp = &library[libsize]; lp > library; lp--) |
149 |
if (strcmp(lp[-1].fname, fname) > 0) |
150 |
lp[0] = lp[-1]; |
151 |
else |
152 |
break; |
153 |
libsize++; |
154 |
} |
155 |
if (fptr == NULL) { /* delete */ |
156 |
while (lp < &library[libsize-1]) { |
157 |
lp[0] = lp[1]; |
158 |
lp++; |
159 |
} |
160 |
libsize--; |
161 |
} else { /* or assign */ |
162 |
lp[0].fname = fname; /* string must be static! */ |
163 |
lp[0].nargs = nargs; |
164 |
lp[0].atyp = assign; |
165 |
lp[0].f = fptr; |
166 |
} |
167 |
if (libsize != oldlibsize) |
168 |
libupdate(fname); /* relink library */ |
169 |
} |
170 |
|
171 |
|
172 |
int |
173 |
nargum(void) /* return number of available arguments */ |
174 |
{ |
175 |
int n; |
176 |
|
177 |
if (curact == NULL) |
178 |
return(0); |
179 |
if (curact->fun == NULL) { |
180 |
for (n = 0; (1L<<n) & curact->an; n++) |
181 |
; |
182 |
return(n); |
183 |
} |
184 |
return(nekids(curact->fun) - 1); |
185 |
} |
186 |
|
187 |
|
188 |
double |
189 |
argument(int n) /* return nth argument for active function */ |
190 |
{ |
191 |
ACTIVATION *actp = curact; |
192 |
EPNODE *ep = NULL; |
193 |
double aval; |
194 |
|
195 |
if (actp == NULL || --n < 0) { |
196 |
eputs("Bad call to argument!\n"); |
197 |
quit(1); |
198 |
} |
199 |
/* already computed? */ |
200 |
if (n < AFLAGSIZ && 1L<<n & actp->an) |
201 |
return(actp->ap[n]); |
202 |
|
203 |
if (actp->fun == NULL || (ep = ekid(actp->fun, n+1)) == NULL) { |
204 |
eputs(actp->name); |
205 |
eputs(": too few arguments\n"); |
206 |
quit(1); |
207 |
} |
208 |
curact = actp->prev; /* pop environment */ |
209 |
aval = evalue(ep); /* compute argument */ |
210 |
curact = actp; /* push back environment */ |
211 |
if (n < ALISTSIZ) { /* save value */ |
212 |
actp->ap[n] = aval; |
213 |
actp->an |= 1L<<n; |
214 |
} |
215 |
return(aval); |
216 |
} |
217 |
|
218 |
|
219 |
VARDEF * |
220 |
argf(int n) /* return function def for nth argument */ |
221 |
{ |
222 |
ACTIVATION *actp; |
223 |
EPNODE *ep; |
224 |
|
225 |
for (actp = curact; actp != NULL; actp = actp->prev) { |
226 |
|
227 |
if (n <= 0) |
228 |
break; |
229 |
|
230 |
if (actp->fun == NULL) |
231 |
goto badarg; |
232 |
|
233 |
if ((ep = ekid(actp->fun, n)) == NULL) { |
234 |
eputs(actp->name); |
235 |
eputs(": too few arguments\n"); |
236 |
quit(1); |
237 |
} |
238 |
if (ep->type == VAR) |
239 |
return(ep->v.ln); /* found it */ |
240 |
|
241 |
if (ep->type != ARG) |
242 |
goto badarg; |
243 |
|
244 |
n = ep->v.chan; /* try previous context */ |
245 |
} |
246 |
eputs("Bad call to argf!\n"); |
247 |
quit(1); |
248 |
|
249 |
badarg: |
250 |
eputs(actp->name); |
251 |
eputs(": argument not a function\n"); |
252 |
quit(1); |
253 |
return NULL; /* pro forma return */ |
254 |
} |
255 |
|
256 |
|
257 |
char * |
258 |
argfun(int n) /* return function name for nth argument */ |
259 |
{ |
260 |
return(argf(n)->name); |
261 |
} |
262 |
|
263 |
|
264 |
double |
265 |
efunc(EPNODE *ep) /* evaluate a function */ |
266 |
{ |
267 |
ACTIVATION act; |
268 |
double alist[ALISTSIZ]; |
269 |
double rval; |
270 |
VARDEF *dp; |
271 |
/* push environment */ |
272 |
dp = resolve(ep->v.kid); |
273 |
act.name = dp->name; |
274 |
act.prev = curact; |
275 |
act.ap = alist; |
276 |
act.an = 0; |
277 |
act.fun = ep; |
278 |
curact = &act; |
279 |
|
280 |
if (dp->def == NULL || dp->def->v.kid->type != FUNC) |
281 |
rval = libfunc(act.name, dp); |
282 |
else |
283 |
rval = evalue(dp->def->v.kid->sibling); |
284 |
|
285 |
curact = act.prev; /* pop environment */ |
286 |
return(rval); |
287 |
} |
288 |
|
289 |
|
290 |
LIBR * |
291 |
liblookup(char *fname) /* look up a library function */ |
292 |
{ |
293 |
int upper, lower; |
294 |
int cm, i; |
295 |
|
296 |
lower = 0; |
297 |
upper = cm = libsize; |
298 |
|
299 |
while ((i = (lower + upper) >> 1) != cm) { |
300 |
cm = strcmp(fname, library[i].fname); |
301 |
if (cm > 0) |
302 |
lower = i; |
303 |
else if (cm < 0) |
304 |
upper = i; |
305 |
else |
306 |
return(&library[i]); |
307 |
cm = i; |
308 |
} |
309 |
return(NULL); |
310 |
} |
311 |
|
312 |
|
313 |
/* |
314 |
* The following routines are for internal use: |
315 |
*/ |
316 |
|
317 |
|
318 |
static double |
319 |
libfunc( /* execute library function */ |
320 |
char *fname, |
321 |
VARDEF *vp |
322 |
) |
323 |
{ |
324 |
LIBR *lp; |
325 |
double d; |
326 |
int lasterrno; |
327 |
|
328 |
if (vp != NULL) |
329 |
lp = vp->lib; |
330 |
else |
331 |
lp = liblookup(fname); |
332 |
if (lp == NULL) { |
333 |
eputs(fname); |
334 |
eputs(": undefined function\n"); |
335 |
quit(1); |
336 |
} |
337 |
lasterrno = errno; |
338 |
errno = 0; |
339 |
d = (*lp->f)(lp->fname); |
340 |
#ifdef isnan |
341 |
if (errno == 0) |
342 |
if (isnan(d)) |
343 |
errno = EDOM; |
344 |
else if (isinf(d)) |
345 |
errno = ERANGE; |
346 |
#endif |
347 |
if (errno == EDOM || errno == ERANGE) { |
348 |
wputs(fname); |
349 |
if (errno == EDOM) |
350 |
wputs(": domain error\n"); |
351 |
else if (errno == ERANGE) |
352 |
wputs(": range error\n"); |
353 |
else |
354 |
wputs(": error in call\n"); |
355 |
return(0.0); |
356 |
} |
357 |
errno = lasterrno; |
358 |
return(d); |
359 |
} |
360 |
|
361 |
|
362 |
/* |
363 |
* Library functions: |
364 |
*/ |
365 |
|
366 |
|
367 |
static double |
368 |
l_if(char *nm) /* if(cond, then, else) conditional expression */ |
369 |
/* cond evaluates true if greater than zero */ |
370 |
{ |
371 |
if (argument(1) > 0.0) |
372 |
return(argument(2)); |
373 |
else |
374 |
return(argument(3)); |
375 |
} |
376 |
|
377 |
|
378 |
static double |
379 |
l_select(char *nm) /* return argument #(A1+1) */ |
380 |
{ |
381 |
int n; |
382 |
|
383 |
n = (int)(argument(1) + .5); |
384 |
if (n == 0) |
385 |
return(nargum()-1); |
386 |
if (n < 1 || n > nargum()-1) { |
387 |
errno = EDOM; |
388 |
return(0.0); |
389 |
} |
390 |
return(argument(n+1)); |
391 |
} |
392 |
|
393 |
|
394 |
static double |
395 |
l_rand(char *nm) /* random function between 0 and 1 */ |
396 |
{ |
397 |
double x; |
398 |
|
399 |
x = argument(1); |
400 |
x *= 1.0/(1.0 + x*x) + 2.71828182845904; |
401 |
x += .785398163397447 - floor(x); |
402 |
x = 1e5 / x; |
403 |
return(x - floor(x)); |
404 |
} |
405 |
|
406 |
|
407 |
static double |
408 |
l_floor(char *nm) /* return largest integer not greater than arg1 */ |
409 |
{ |
410 |
return(floor(argument(1))); |
411 |
} |
412 |
|
413 |
|
414 |
static double |
415 |
l_ceil(char *nm) /* return smallest integer not less than arg1 */ |
416 |
{ |
417 |
return(ceil(argument(1))); |
418 |
} |
419 |
|
420 |
|
421 |
static double |
422 |
l_sqrt(char *nm) |
423 |
{ |
424 |
return(sqrt(argument(1))); |
425 |
} |
426 |
|
427 |
|
428 |
static double |
429 |
l_sin(char *nm) |
430 |
{ |
431 |
return(sin(argument(1))); |
432 |
} |
433 |
|
434 |
|
435 |
static double |
436 |
l_cos(char *nm) |
437 |
{ |
438 |
return(cos(argument(1))); |
439 |
} |
440 |
|
441 |
|
442 |
static double |
443 |
l_tan(char *nm) |
444 |
{ |
445 |
return(tan(argument(1))); |
446 |
} |
447 |
|
448 |
|
449 |
static double |
450 |
l_asin(char *nm) |
451 |
{ |
452 |
return(asin(argument(1))); |
453 |
} |
454 |
|
455 |
|
456 |
static double |
457 |
l_acos(char *nm) |
458 |
{ |
459 |
return(acos(argument(1))); |
460 |
} |
461 |
|
462 |
|
463 |
static double |
464 |
l_atan(char *nm) |
465 |
{ |
466 |
return(atan(argument(1))); |
467 |
} |
468 |
|
469 |
|
470 |
static double |
471 |
l_atan2(char *nm) |
472 |
{ |
473 |
return(atan2(argument(1), argument(2))); |
474 |
} |
475 |
|
476 |
|
477 |
static double |
478 |
l_exp(char *nm) |
479 |
{ |
480 |
return(exp(argument(1))); |
481 |
} |
482 |
|
483 |
|
484 |
static double |
485 |
l_log(char *nm) |
486 |
{ |
487 |
return(log(argument(1))); |
488 |
} |
489 |
|
490 |
|
491 |
static double |
492 |
l_log10(char *nm) |
493 |
{ |
494 |
return(log10(argument(1))); |
495 |
} |