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 */ |
40 |
|
#define MAXLIB 64 /* maximum number of library functions */ |
41 |
|
#endif |
42 |
|
|
43 |
< |
static double l_if(char *), l_select(char *), l_rand(char *); |
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 *); |
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 }, |
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( /* return # of arguments for function */ |
80 |
> |
fundefined( /* return # of req'd arguments for function */ |
81 |
|
char *fname |
82 |
|
) |
83 |
|
{ |
108 |
|
act.name = fname; |
109 |
|
act.prev = curact; |
110 |
|
act.ap = a; |
111 |
< |
if (n >= AFLAGSIZ) |
108 |
< |
act.an = ~0; |
109 |
< |
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 |
|
|
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); |
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? */ |
200 |
< |
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 |
|
} |
355 |
|
errno = ERANGE; |
356 |
|
} |
357 |
|
#endif |
358 |
< |
if (errno == EDOM || errno == ERANGE) { |
358 |
> |
if ((errno == EDOM) | (errno == ERANGE)) { |
359 |
|
wputs(fname); |
360 |
|
if (errno == EDOM) |
361 |
|
wputs(": domain error\n"); |
389 |
|
static double |
390 |
|
l_select(char *nm) /* return argument #(A1+1) */ |
391 |
|
{ |
392 |
< |
int n; |
392 |
> |
int narg = nargum(); |
393 |
> |
double a1 = argument(1); |
394 |
> |
int n = (int)(a1 + .5); |
395 |
|
|
396 |
< |
n = (int)(argument(1) + .5); |
385 |
< |
if (n == 0) |
386 |
< |
return(nargum()-1); |
387 |
< |
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_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 |
|
|