Commit | Line | Data |
---|---|---|
bc97a989 | 1 | #include <malloc.h> |
f2927108 | 2 | #include <math.h> |
87621fe1 | 3 | #include <stdio.h> |
bc97a989 | 4 | #include <stdlib.h> |
b9c1c40d | 5 | #include <string.h> |
bc97a989 LM |
6 | |
7 | #include "debug.h" | |
bc97a989 LM |
8 | |
9 | #include "parser.h" | |
10 | ||
5075f6ea LM |
11 | /* global variables */ |
12 | ||
13 | double answer = 0; | |
14 | ||
f438579a LM |
15 | #define DEFAULT_STORAGE_SIZE 10 |
16 | int storage_size = -1; | |
6ba1dd0f | 17 | |
f438579a LM |
18 | double *storage = NULL; |
19 | ||
20 | #define DEFAULT_FORMAT "=> %.6g\n" | |
2a5ec9d1 | 21 | char *format = NULL; |
9b759869 | 22 | char *minform = NULL; |
715580ff | 23 | |
c7cbb833 | 24 | workspace_t *programs = NULL; |
05aabb97 | 25 | int nb_programs = 0; |
c7cbb833 | 26 | |
bc97a989 LM |
27 | /* compare codes */ |
28 | ||
29 | int codecmp (char *ref, char *str) | |
30 | { | |
31 | int sig; | |
32 | ||
33 | while (*ref != '\0') { | |
0b9cc9b0 LM |
34 | if (*ref == '\t') { |
35 | sig = (*str == '.') ? -1 : ((*str >= '0') && (*str <= '9')); | |
36 | } else { | |
37 | sig = *str - *ref; | |
38 | } | |
bc97a989 LM |
39 | if (sig != 0) { |
40 | return (sig > 0) ? 1 : -1; | |
41 | } | |
0b9cc9b0 LM |
42 | str++; |
43 | ref++; | |
bc97a989 LM |
44 | } |
45 | ||
46 | return 0; | |
47 | } | |
48 | ||
6f14d1cc | 49 | /* calloc or die function */ |
bc97a989 | 50 | |
6f14d1cc | 51 | void *callocordie (size_t count, size_t size) |
bc97a989 | 52 | { |
d59a8079 LM |
53 | if (count * size == 0) { |
54 | return NULL; | |
55 | } | |
6f14d1cc | 56 | void *new = calloc (count, size); |
bc97a989 | 57 | if (new == NULL) { |
04d68907 | 58 | VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n")); |
d32ea0b0 | 59 | exit (1); |
bc97a989 | 60 | } |
6f14d1cc LM |
61 | return new; |
62 | } | |
63 | ||
64 | /* allocate new element */ | |
65 | ||
66 | element_t *newelement (func_t function, int nbops, int prio) | |
67 | { | |
68 | element_t *new = (element_t *) callocordie (1, sizeof (element_t)); | |
62d56da6 | 69 | if (nbops) { |
6f14d1cc | 70 | new->ops = (element_t **) callocordie (nbops, sizeof (element_t *)); |
0c95a3d3 | 71 | } |
bc97a989 LM |
72 | new->func = function; |
73 | new->nbops = nbops; | |
11cda8d7 | 74 | new->prio = prio; |
bc97a989 LM |
75 | |
76 | return new; | |
77 | } | |
78 | ||
031d7bba LM |
79 | /* desallocate element */ |
80 | ||
81 | void delelement (element_t *root) | |
82 | { | |
031d7bba | 83 | if ((root != NULL) && (root != ERROR_OP)) { |
0c95a3d3 | 84 | int i; |
031d7bba | 85 | for (i = 0; i < root->nbops; i++) { |
f50ed10b | 86 | delelement (root->ops[i]); |
031d7bba | 87 | } |
0c95a3d3 LM |
88 | if (root->nbops) { |
89 | free (root->ops); | |
90 | } | |
031d7bba LM |
91 | free (root); |
92 | } | |
93 | } | |
94 | ||
2a688642 LM |
95 | /* duplicate element */ |
96 | ||
97 | element_t *dupelement (element_t *root) | |
98 | { | |
99 | element_t *tmp = NULL; | |
100 | int i; | |
101 | ||
102 | if ((root == NULL) || (root == ERROR_OP)) { | |
103 | return root; | |
104 | } | |
105 | tmp = newelement (root->func, root->nbops, root->prio); | |
2a688642 LM |
106 | tmp->value = root->value; |
107 | for (i = 0; i < root->nbops; i++) { | |
108 | tmp->ops[i] = dupelement (root->ops[i]); | |
2a688642 LM |
109 | } |
110 | return tmp; | |
111 | } | |
112 | ||
bc97a989 LM |
113 | /* functions */ |
114 | ||
ca3e2a2f | 115 | #define NB_OPERATORS 14 |
bc97a989 | 116 | keyword_t operators[NB_OPERATORS] = { |
11cda8d7 LM |
117 | { "+\t", Add, 2, 1, 1}, |
118 | { "-\t", Sub, 2, 1, 1}, | |
119 | { "*", Mul, 2, 1, 2}, | |
120 | { "/", Div, 2, 1, 2}, | |
c47a9298 | 121 | { "%", Mod, 2, 1, 3}, |
7fe742c9 | 122 | { "^", Pow, 2, 1, 4}, |
ca3e2a2f LM |
123 | { "==", Equal, 2, 2, -1}, |
124 | { "!=", Diff, 2, 2, -1}, | |
125 | { ">=", Ge, 2, 2, -1}, | |
126 | { "<=", Le, 2, 2, -1}, | |
127 | { ">", Gt, 2, 1, -1}, | |
128 | { "<", Lt, 2, 1, -1}, | |
129 | { "&", And, 2, 1, -2}, | |
130 | { "|", Or, 2, 1, -2} | |
bc97a989 LM |
131 | }; |
132 | ||
72b7d4bc | 133 | #define NB_FUNCTIONS 34 |
bc97a989 | 134 | keyword_t functions[NB_FUNCTIONS] = { |
c47a9298 LM |
135 | { "sqrt", Sqr, 1, 4, 5}, |
136 | { "pow", Pow, 2, 3, 5}, | |
137 | { "cos", Cos, 1, 3, 5}, | |
138 | { "sin", Sin, 1, 3, 5}, | |
9e52bbc5 LM |
139 | { "tan", Tan, 1, 3, 5}, |
140 | { "acos", Acos, 1, 4, 5}, | |
141 | { "asin", Asin, 1, 4, 5}, | |
471da7c9 | 142 | { "atan", Atan, 1, 4, 5}, |
2a986c8f | 143 | { "ln", Ln, 1, 2, 5}, |
89cf0955 | 144 | { "log", Log, 1, 3, 5}, |
9e52bbc5 | 145 | { "exp", Exp, 1, 3, 5}, |
72b7d4bc LM |
146 | { "erfc", Erfc, 1, 4, 5}, |
147 | { "erf", Erf, 1, 3, 5}, | |
9e52bbc5 LM |
148 | { "abs", Abs, 1, 3, 5}, |
149 | { "floor", Floor, 1, 5, 5}, | |
150 | { "ceil", Ceil, 1, 4, 5}, | |
2a688642 | 151 | { "sto", Store, 2, 3, 5}, |
6ba1dd0f | 152 | { "rcl", Recall, 1, 3, 5}, |
a8cf32ba LM |
153 | { "inc", Inc, 1, 3, 5}, |
154 | { "dec", Dec, 1, 3, 5}, | |
ca3e2a2f | 155 | { "disp", Disp, 0, 4, 9}, |
f438579a | 156 | { "mem", Mem, 1, 3, 9}, |
143f91ae | 157 | { "clr", Clear, 0, 3, 9}, |
ca3e2a2f LM |
158 | { "quit", Quit, 0, 4, 9}, |
159 | { "help", Help, 0, 4, 9}, | |
94b4e517 | 160 | { "!", Not, 1, 1, 6}, |
2a688642 | 161 | { "cond", Cond, 3, 4, 5}, |
715580ff | 162 | { "while", While, 2, 5, 5}, |
c7cbb833 LM |
163 | { "print", Print, 1, 5, 5}, |
164 | { "prog", Prog, 3, 4, 9}, | |
165 | { "call", Call, 10, 4, 5}, | |
166 | { "ls", List, 0, 2, 9}, | |
167 | { "edit", Edit, 1, 4, 9}, | |
168 | { "del", Del, 1, 3, 9} | |
471da7c9 LM |
169 | }; |
170 | ||
5075f6ea | 171 | #define NB_CONSTANTS 3 |
471da7c9 | 172 | keyword_t constants[NB_CONSTANTS] = { |
5075f6ea LM |
173 | { "ans", Ans, 0, 3, 5}, |
174 | { "e", E, 0, 1, 5}, | |
175 | { "pi", Pi, 0, 2, 5} | |
bc97a989 LM |
176 | }; |
177 | ||
db660e60 LM |
178 | #define NB_SYMBOLS 4 |
179 | char *symbols[NB_SYMBOLS] = { | |
180 | "(", ")", "{", "}" | |
181 | }; | |
182 | ||
d2ff8478 LM |
183 | /* subparser function */ |
184 | ||
185 | element_t *subparser (element_t **proot, char **pstr, func_t func, int nbops, int prio) | |
186 | { | |
187 | element_t *new = newelement (func, nbops, prio); | |
d2ff8478 LM |
188 | new->ops[0] = *proot; |
189 | new->ops[1] = parser (*pstr, pstr, new->prio); | |
686c4bc2 | 190 | if ((new->ops[1] == NULL) || ((new->ops[1] != ERROR_OP) && (new->ops[1]->prio == 9))) { |
67b13e3d LM |
191 | delelement (new->ops[1]); |
192 | new->ops[1] = ERROR_OP; | |
193 | } | |
d2ff8478 | 194 | if (new->ops[1] == ERROR_OP) { |
031d7bba LM |
195 | delelement (new); |
196 | *proot = NULL; | |
d2ff8478 LM |
197 | return ERROR_OP; |
198 | } | |
3b4b0bbe | 199 | *proot = newelement (Val, 1, 5); |
d2ff8478 LM |
200 | (*proot)->ops[0] = new; |
201 | ||
202 | return *proot; | |
203 | } | |
204 | ||
bc97a989 LM |
205 | /* parser function */ |
206 | ||
ef37d966 | 207 | element_t *parser (char *str, char **next, int prio) |
0b489a77 | 208 | { |
bc97a989 | 209 | element_t *root = NULL; |
779282bb | 210 | char *string = str; |
85b4a72c | 211 | int i; |
bc97a989 | 212 | |
04d68907 | 213 | VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n")); |
49223129 | 214 | |
bc97a989 LM |
215 | /* main loop */ |
216 | while (*str != '\0') { | |
217 | int found = 0; | |
218 | element_t *new = NULL; | |
04d68907 | 219 | VERBOSE (INFO, fprintf (stdout, "Processing: %s\n", str)); |
bc97a989 | 220 | |
2d0cd54c LM |
221 | /* end without printing */ |
222 | ||
223 | if (*str == ';') { | |
224 | if (root) { | |
225 | root->hidden = 1; | |
226 | } | |
227 | break; | |
228 | } | |
229 | ||
bc97a989 LM |
230 | /* skip spaces and tabs */ |
231 | ||
232 | if ((*str == ' ') || (*str == '\t')) { | |
233 | str++; | |
234 | continue; | |
235 | } | |
236 | ||
124da7fd LM |
237 | /* check for open brace */ |
238 | ||
239 | if (*str == '{') { | |
240 | VERBOSE (DEBUG, fprintf (stdout, "start processing brace\n")); | |
62d56da6 | 241 | if (root != NULL) { |
124da7fd LM |
242 | delelement (root); |
243 | return ERROR_OP; | |
244 | } | |
f50ed10b | 245 | root = newelement (Code, 0, 5); |
124da7fd LM |
246 | |
247 | do { | |
124da7fd LM |
248 | new = parser (str + 1, &str, 0); |
249 | if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { | |
250 | delelement (new); | |
251 | new = ERROR_OP; | |
252 | } | |
7929d368 | 253 | if (new == ERROR_OP) { |
124da7fd | 254 | delelement (root); |
62d56da6 | 255 | return ERROR_OP; |
124da7fd | 256 | } |
f50ed10b ML |
257 | element_t *newprog = newelement (Code, root->nbops + 1, 5); |
258 | for (i = 0; i < root->nbops; i++) { | |
259 | newprog->ops[i] = root->ops[i]; | |
260 | root->ops[i] = NULL; | |
124da7fd | 261 | } |
f50ed10b ML |
262 | newprog->ops[root->nbops] = new; |
263 | delelement (root); | |
264 | root = newprog; | |
124da7fd LM |
265 | } while (*str == ','); |
266 | ||
267 | if (*str != '}') { | |
268 | delelement (root); | |
269 | return ERROR_OP; | |
270 | } | |
271 | str++; | |
272 | VERBOSE (DEBUG, fprintf (stdout, "stop processing brace\n")); | |
273 | continue; | |
274 | } | |
275 | ||
85b4a72c | 276 | /* check for open bracket */ |
0b489a77 | 277 | |
0b489a77 | 278 | if (*str == '(') { |
04d68907 | 279 | VERBOSE (DEBUG, fprintf (stdout, "start processing bracket\n")); |
0b489a77 | 280 | if (root) { |
85b4a72c LM |
281 | do { |
282 | found = 0; | |
ef37d966 | 283 | new = parser (str + 1, &str, 0); |
686c4bc2 | 284 | if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { |
67b13e3d LM |
285 | delelement (new); |
286 | new = ERROR_OP; | |
287 | } | |
686c4bc2 | 288 | if ((new == NULL) || (new == ERROR_OP)) { |
031d7bba | 289 | delelement (root); |
85b4a72c LM |
290 | return ERROR_OP; |
291 | } | |
292 | for (i = 0; i < root->nbops; i++) { | |
293 | if (root->ops[i] == NULL) { | |
0b489a77 LM |
294 | root->ops[i] = new; |
295 | found = 1; | |
296 | break; | |
297 | } | |
298 | } | |
85b4a72c | 299 | if (!found) { |
031d7bba LM |
300 | delelement (new); |
301 | delelement (root); | |
85b4a72c LM |
302 | return ERROR_OP; |
303 | } | |
304 | } while (*str == ','); | |
305 | } else { | |
3b4b0bbe | 306 | root = newelement (Val, 1, 5); |
ef37d966 | 307 | new = parser (str + 1, &str, 0); |
686c4bc2 | 308 | if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { |
67b13e3d LM |
309 | delelement (new); |
310 | new = ERROR_OP; | |
311 | } | |
686c4bc2 | 312 | if ((new == NULL) || (new == ERROR_OP) || (*str == ',')) { |
031d7bba LM |
313 | delelement (new); |
314 | delelement (root); | |
efdfb543 LM |
315 | return ERROR_OP; |
316 | } | |
85b4a72c | 317 | root->ops[0] = new; |
0b489a77 | 318 | } |
3c0db5bc LM |
319 | if (*str != ')') { |
320 | delelement (root); | |
321 | return ERROR_OP; | |
322 | } | |
85b4a72c | 323 | str++; |
04d68907 | 324 | VERBOSE (DEBUG, fprintf (stdout, "stop processing bracket\n")); |
efdfb543 | 325 | continue; |
49223129 | 326 | } |
85b4a72c | 327 | |
124da7fd | 328 | /* check for closing bracket, closing brace or koma */ |
85b4a72c | 329 | |
124da7fd | 330 | if ((*str == ')') || (*str == '}') || (*str == ',')) { |
45a631a8 LM |
331 | if (prio == -9) { |
332 | delelement (root); | |
333 | return ERROR_OP; | |
334 | } | |
49223129 | 335 | if (next != NULL) { |
85b4a72c | 336 | *next = str; |
49223129 LM |
337 | } |
338 | return root; | |
0b489a77 LM |
339 | } |
340 | ||
bc97a989 LM |
341 | /* look for operators */ |
342 | ||
343 | for (i = 0; i < NB_OPERATORS; i++) { | |
344 | keyword_t *operator = operators + i; | |
345 | if (codecmp (operator->keyword, str) == 0) { | |
04d68907 | 346 | VERBOSE (DEBUG, fprintf (stdout, "start processing operator\n")); |
11cda8d7 | 347 | if (root) { |
ef37d966 | 348 | if ((prio) && (prio > operator->prio)) { |
04d68907 | 349 | VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n")); |
ef37d966 LM |
350 | *next = str; |
351 | return root; | |
352 | } | |
353 | str += operator->offset; | |
04d68907 | 354 | VERBOSE (INFO, fprintf (stdout, "Oper: %d\n", operator->func)); |
d2ff8478 | 355 | if (subparser (&root, &str, operator->func, operator->nbops, operator->prio) == ERROR_OP) { |
031d7bba | 356 | delelement (root); |
ef37d966 | 357 | return ERROR_OP; |
11cda8d7 | 358 | } |
3b4b0bbe | 359 | } else if (*str == '-') { |
d32ea0b0 | 360 | root = newelement (Sig, 1, 9); |
49223129 | 361 | } else { |
0b489a77 | 362 | return ERROR_OP; |
bc97a989 | 363 | } |
bc97a989 | 364 | found = 1; |
04d68907 | 365 | VERBOSE (DEBUG, fprintf (stdout, "stop processing operator\n")); |
bc97a989 LM |
366 | break; |
367 | } | |
368 | } | |
369 | if (found) { | |
bc97a989 LM |
370 | continue; |
371 | } | |
49223129 | 372 | |
bc97a989 LM |
373 | /* look for functions */ |
374 | ||
375 | for (i = 0; i < NB_FUNCTIONS; i++) { | |
376 | keyword_t *function = functions + i; | |
377 | if (codecmp (function->keyword, str) == 0) { | |
04d68907 | 378 | VERBOSE (DEBUG, fprintf (stdout, "start processing function\n")); |
bc97a989 | 379 | if (root == NULL) { |
04d68907 | 380 | VERBOSE (INFO, fprintf (stdout, "Func: %d\n", function->func)); |
d32ea0b0 | 381 | root = newelement (function->func, function->nbops, function->prio); |
031d7bba LM |
382 | } else { |
383 | delelement (root); | |
0b489a77 | 384 | return ERROR_OP; |
bc97a989 LM |
385 | } |
386 | str += function->offset; | |
387 | found = 1; | |
04d68907 | 388 | VERBOSE (DEBUG, fprintf (stdout, "stop processing function\n")); |
bc97a989 LM |
389 | break; |
390 | } | |
391 | } | |
392 | if (found) { | |
bc97a989 LM |
393 | continue; |
394 | } | |
395 | ||
471da7c9 LM |
396 | /* look for constant */ |
397 | ||
398 | for (i = 0; i < NB_CONSTANTS; i++) { | |
399 | keyword_t *constant = constants + i; | |
400 | if (codecmp (constant->keyword, str) == 0) { | |
401 | VERBOSE (DEBUG, fprintf (stdout, "start processing constant\n")); | |
402 | if (root == NULL) { | |
5075f6ea | 403 | VERBOSE (INFO, fprintf (stdout, "Const: %d\n", constant->func)); |
d32ea0b0 | 404 | root = newelement (constant->func, constant->nbops, constant->prio); |
471da7c9 LM |
405 | } else { |
406 | delelement (root); | |
407 | return ERROR_OP; | |
408 | } | |
409 | str += constant->offset; | |
410 | found = 1; | |
411 | VERBOSE (DEBUG, fprintf (stdout, "stop processing constant\n")); | |
412 | break; | |
413 | } | |
414 | } | |
415 | if (found) { | |
416 | continue; | |
417 | } | |
418 | ||
bc97a989 LM |
419 | /* look for number */ |
420 | ||
0b9cc9b0 LM |
421 | if (((*str >= '0') && (*str <= '9')) || |
422 | (*str == '.') || (*str == '+') || (*str == '-')) { | |
04d68907 | 423 | VERBOSE (DEBUG, fprintf (stdout, "start processing value\n")); |
bc97a989 | 424 | char *pt; |
fd88e359 | 425 | double value = strtod (str, &pt); |
04d68907 | 426 | VERBOSE (INFO, fprintf (stdout, "Value: %f\n", value)); |
bc97a989 | 427 | if (str != pt) { |
ce6627f2 | 428 | if ((root == NULL) || (root->prio == 6)) { |
3b4b0bbe | 429 | new = newelement (Val, 1, 5); |
c47a9298 | 430 | new->value = value; |
ce6627f2 LM |
431 | if (root == NULL) { |
432 | root = new; | |
433 | } else { | |
434 | for (i = 0; i < root->nbops; i++) { | |
435 | if (root->ops[i] == NULL) { | |
436 | root->ops[i] = new; | |
437 | found = 1; | |
438 | break; | |
439 | } | |
440 | } | |
441 | if (!found) { | |
442 | delelement (new); | |
443 | delelement (root); | |
444 | return ERROR_OP; | |
445 | } | |
446 | } | |
c47a9298 | 447 | str = pt; |
32741902 LM |
448 | } else if ((*str == '+') || (*str == '-')) { |
449 | if ((prio) && (prio > 1)) { | |
450 | VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n")); | |
451 | *next = str; | |
452 | return root; | |
453 | } | |
454 | if (subparser (&root, &str, Add, 2, 1) == ERROR_OP) { | |
031d7bba | 455 | delelement (root); |
0b489a77 | 456 | return ERROR_OP; |
bc97a989 | 457 | } |
0b9cc9b0 | 458 | } else { |
031d7bba | 459 | delelement (root); |
0b9cc9b0 | 460 | return ERROR_OP; |
bc97a989 | 461 | } |
bc97a989 LM |
462 | found = 1; |
463 | } | |
04d68907 | 464 | VERBOSE (DEBUG, fprintf (stdout, "stop processing value\n")); |
bc97a989 LM |
465 | } |
466 | ||
467 | /* error */ | |
468 | ||
469 | if (!found) { | |
031d7bba | 470 | delelement (root); |
0b489a77 | 471 | return ERROR_OP; |
bc97a989 LM |
472 | } |
473 | ||
474 | } | |
475 | ||
49223129 LM |
476 | if (next != NULL) { |
477 | *next = str; | |
478 | } | |
031d7bba | 479 | |
779282bb | 480 | /* save string */ |
0a8a1de3 ML |
481 | if (root != NULL) { |
482 | root->string = string; | |
483 | } | |
779282bb | 484 | |
bc97a989 LM |
485 | return root; |
486 | } | |
487 | ||
488 | /* print element tree */ | |
489 | ||
490 | void print_element (element_t *root, int level) | |
491 | { | |
492 | char *func = NULL; | |
493 | int i; | |
494 | ||
49223129 | 495 | if ((root == NULL) || (root == ERROR_OP)) { |
bc97a989 | 496 | return; |
49223129 LM |
497 | } |
498 | ||
bc97a989 | 499 | for (i = 0; i < level; i++) { |
04d68907 | 500 | fprintf (stdout, " "); |
bc97a989 LM |
501 | } |
502 | ||
503 | switch (root->func) { | |
504 | case Val: func = "Value"; break; | |
89cf0955 | 505 | case Sig: func = "Sign"; break; |
bc97a989 LM |
506 | case Add: func = "Addition"; break; |
507 | case Sub: func = "Subtraction"; break; | |
508 | case Mul: func = "Multiplication"; break; | |
509 | case Div: func = "Division"; break; | |
c47a9298 | 510 | case Mod: func = "Modulo"; break; |
bc97a989 LM |
511 | case Pow: func = "Power"; break; |
512 | case Sqr: func = "Square Root"; break; | |
513 | case Cos: func = "Cosine"; break; | |
514 | case Sin: func = "Sine"; break; | |
9e52bbc5 LM |
515 | case Tan: func = "Tangent"; break; |
516 | case Acos: func = "Arc Cosine"; break; | |
517 | case Asin: func = "Arc Sine"; break; | |
471da7c9 | 518 | case Atan: func = "Arc Tangent"; break; |
532af887 | 519 | case Ln: func = "Logarithm (natural)"; break; |
2a986c8f | 520 | case Log: func = "Logarithm (10 base)"; break; |
bc97a989 | 521 | case Exp: func = "Exponantial"; break; |
72b7d4bc LM |
522 | case Erfc: func = "Complementary Error Function"; break; |
523 | case Erf: func = "Error Function"; break; | |
9e52bbc5 LM |
524 | case Abs: func = "Absolute value"; break; |
525 | case Ceil: func = "Ceil value"; break; | |
526 | case Floor: func = "Floor value"; break; | |
6ba1dd0f LM |
527 | case Store: func = "Store"; break; |
528 | case Recall: func = "Recall"; break; | |
a8cf32ba LM |
529 | case Inc: func = "Increase"; break; |
530 | case Dec: func = "Decrease"; break; | |
6ba1dd0f | 531 | case Disp: func = "Display"; break; |
f438579a | 532 | case Mem: func = "Memory"; break; |
143f91ae | 533 | case Clear: func = "Clear"; break; |
471da7c9 LM |
534 | case Quit: func = "Quit"; break; |
535 | case Help: func = "Help"; break; | |
5075f6ea | 536 | case Ans: func = "Ans"; break; |
471da7c9 LM |
537 | case Pi: func = "Pi"; break; |
538 | case E: func = "E"; break; | |
7fe742c9 LM |
539 | case Equal: func = "Equal"; break; |
540 | case Diff: func = "Different"; break; | |
541 | case Ge: func = "Greater or equal"; break; | |
542 | case Le: func = "Lesser or equal"; break; | |
543 | case Gt: func = "Greater"; break; | |
544 | case Lt: func = "Lesser"; break; | |
ca3e2a2f LM |
545 | case And: func = "And"; break; |
546 | case Or: func = "Or"; break; | |
547 | case Not: func = "Not"; break; | |
94b4e517 | 548 | case Cond: func = "Condition"; break; |
2a688642 | 549 | case While: func = "While"; break; |
05aabb97 | 550 | case Code: func = "Code"; break; |
715580ff | 551 | case Print: func = "Print"; break; |
c7cbb833 LM |
552 | case Prog: func = "Program"; break; |
553 | case Call: func = "Call"; break; | |
554 | case List: func = "List"; break; | |
555 | case Edit: func = "Edit"; break; | |
556 | case Del: func = "Del"; break; | |
bc97a989 LM |
557 | } |
558 | ||
04d68907 | 559 | fprintf (stdout, "Function: %s\n", func); |
bc97a989 | 560 | |
85b4a72c | 561 | if ((root->func == Val) && (root->ops[0] == NULL)) { |
bc97a989 | 562 | for (i = 0; i < level; i++) { |
04d68907 | 563 | fprintf (stdout, " "); |
bc97a989 | 564 | } |
04d68907 | 565 | fprintf (stdout, "value: %f\n", root->value); |
bc97a989 LM |
566 | } else { |
567 | for (i = 0; i < root->nbops; i++) { | |
568 | print_element (root->ops[i], level + 1); | |
569 | } | |
570 | } | |
571 | } | |
572 | ||
6ba1dd0f LM |
573 | /* storage functions */ |
574 | ||
f438579a LM |
575 | void memory (int nb) |
576 | { | |
577 | int i, l; | |
578 | double *tmp = NULL; | |
579 | if (nb != storage_size) { | |
580 | l = (nb < storage_size) ? nb : storage_size; | |
6f14d1cc | 581 | tmp = (double *) callocordie (nb, sizeof (double)); |
f438579a LM |
582 | for (i = 0; i < l; i++) { |
583 | tmp[i] = storage[i]; | |
584 | } | |
585 | if (storage != NULL) { | |
586 | free (storage); | |
587 | } | |
588 | storage = tmp; | |
589 | storage_size = nb; | |
590 | } | |
591 | } | |
592 | ||
3639df66 | 593 | double store (int index, double value) |
6ba1dd0f | 594 | { |
f438579a LM |
595 | if (storage_size == -1) { |
596 | memory (DEFAULT_STORAGE_SIZE); | |
597 | } | |
598 | if ((index > 0) && (index <= storage_size)) { | |
3639df66 | 599 | storage[index - 1] = value; |
6ba1dd0f | 600 | } else { |
9b759869 | 601 | VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size)); |
6ba1dd0f | 602 | } |
3639df66 | 603 | return value; |
6ba1dd0f LM |
604 | } |
605 | ||
606 | double recall (int index) | |
607 | { | |
f438579a LM |
608 | if (storage_size == -1) { |
609 | memory (DEFAULT_STORAGE_SIZE); | |
610 | } | |
611 | if ((index > 0) && (index <= storage_size)) { | |
6ba1dd0f LM |
612 | return storage[index - 1]; |
613 | } else { | |
9b759869 | 614 | VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size)); |
6ba1dd0f LM |
615 | } |
616 | return 0; | |
617 | } | |
618 | ||
a8cf32ba LM |
619 | double increase (int index) |
620 | { | |
f438579a LM |
621 | if (storage_size == -1) { |
622 | memory (DEFAULT_STORAGE_SIZE); | |
623 | } | |
624 | if ((index > 0) && (index <= storage_size)) { | |
a8cf32ba LM |
625 | return storage[index - 1]++; |
626 | } else { | |
9b759869 | 627 | VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size)); |
a8cf32ba LM |
628 | } |
629 | return 0; | |
630 | } | |
631 | ||
632 | double decrease (int index) | |
633 | { | |
f438579a LM |
634 | if (storage_size == -1) { |
635 | memory (DEFAULT_STORAGE_SIZE); | |
636 | } | |
637 | if ((index > 0) && (index <= storage_size)) { | |
a8cf32ba LM |
638 | return storage[index - 1]--; |
639 | } else { | |
9b759869 | 640 | VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size)); |
a8cf32ba LM |
641 | } |
642 | return 0; | |
643 | } | |
644 | ||
6ba1dd0f LM |
645 | void display (void) |
646 | { | |
647 | int i; | |
f438579a LM |
648 | if (storage_size == -1) { |
649 | memory (DEFAULT_STORAGE_SIZE); | |
650 | } | |
6ba1dd0f | 651 | fprintf (stdout, "storage:"); |
f438579a | 652 | for (i = 0; i < storage_size; i++) { |
9b759869 LM |
653 | fprintf (stdout, " "); |
654 | fprintf (stdout, minform, storage[i]); | |
6ba1dd0f LM |
655 | } |
656 | fprintf (stdout, "\n"); | |
657 | } | |
658 | ||
143f91ae LM |
659 | void clear () |
660 | { | |
661 | int i; | |
662 | for (i = 0; i < storage_size; i++) { | |
663 | storage[i] = 0; | |
664 | } | |
665 | } | |
666 | ||
2a688642 LM |
667 | /* While do function */ |
668 | ||
669 | double while_do (element_t *cond, element_t *action) | |
670 | { | |
671 | double ret = 0; | |
672 | element_t *temp = NULL; | |
673 | ||
674 | VERBOSE (DEBUG, fprintf (stdout, "starting while loop\n")); | |
2a688642 LM |
675 | while (1) { |
676 | VERBOSE (DEBUG, fprintf (stdout, "loop...\n")); | |
677 | ||
678 | temp = dupelement (cond); | |
523841a1 ML |
679 | double test = evaluate_element (temp, 0); |
680 | delelement (temp); | |
681 | if (!test) { | |
2a688642 LM |
682 | break; |
683 | } | |
684 | if (action) { | |
685 | temp = dupelement (action); | |
686 | ret = evaluate_element (temp, 0); | |
523841a1 | 687 | delelement (temp); |
2a688642 LM |
688 | } |
689 | } | |
690 | ||
691 | VERBOSE (DEBUG, fprintf (stdout, "ending while loop\n")); | |
692 | ||
693 | return ret; | |
694 | } | |
695 | ||
124da7fd LM |
696 | /* program function */ |
697 | ||
05aabb97 | 698 | double execute_code (element_t **prog, int nbcalls) |
124da7fd LM |
699 | { |
700 | double ret = 0; | |
701 | int i; | |
702 | for (i = 0; i < nbcalls; i++) { | |
703 | ret = evaluate_element (prog[i], 0); | |
124da7fd LM |
704 | } |
705 | return ret; | |
706 | } | |
707 | ||
2a5ec9d1 LM |
708 | /* print function */ |
709 | ||
710 | void set_format (char *prompt, int precision) | |
711 | { | |
712 | char buffer[128] = {0}; | |
2a5ec9d1 | 713 | free_format (); |
9b759869 | 714 | sprintf (buffer, "%s%%.%dg\n", prompt, precision); |
2a5ec9d1 | 715 | format = strdup (buffer); |
9b759869 LM |
716 | sprintf (buffer, "%%.%dg", precision); |
717 | minform = strdup (buffer); | |
2a5ec9d1 LM |
718 | } |
719 | ||
720 | void free_format () | |
721 | { | |
722 | if (format) { | |
723 | free (format); | |
724 | format = NULL; | |
725 | } | |
9b759869 LM |
726 | if (minform) { |
727 | free (minform); | |
728 | minform = NULL; | |
729 | } | |
2a5ec9d1 LM |
730 | } |
731 | ||
732 | double print (double value) | |
733 | { | |
f438579a | 734 | fprintf (stdout, format ? format : DEFAULT_FORMAT, value); |
2a5ec9d1 LM |
735 | fflush (stdout); |
736 | return value; | |
737 | } | |
738 | ||
89cf0955 LM |
739 | /* quit function */ |
740 | ||
741 | void quit (void) | |
742 | { | |
04d68907 | 743 | fprintf (stdout, "bye\n"); |
89cf0955 LM |
744 | exit (0); |
745 | } | |
746 | ||
c7cbb833 LM |
747 | /* program function */ |
748 | ||
749 | void prog (int id, int nbmems, element_t *root) | |
05aabb97 LM |
750 | { |
751 | int i, n = -1; | |
752 | ||
753 | if (programs == NULL) { | |
754 | ||
755 | /* initial memory allocation */ | |
6f14d1cc | 756 | programs = (workspace_t *) callocordie (1, sizeof (workspace_t)); |
05aabb97 LM |
757 | nb_programs = 1; |
758 | n = 0; | |
759 | ||
760 | } else { | |
761 | ||
762 | /* look for existing program */ | |
763 | for (i = 0; i < nb_programs; i++) { | |
764 | if ((programs + i)->id == id) { | |
765 | n = i; | |
766 | break; | |
767 | } | |
768 | } | |
769 | if (n == -1) { | |
770 | ||
771 | /* new program */ | |
772 | n = nb_programs++; | |
6f14d1cc LM |
773 | workspace_t *tmp = (workspace_t *) callocordie (nb_programs, sizeof (workspace_t)); |
774 | memcpy (tmp, programs, (nb_programs - 1) * sizeof (workspace_t)); | |
775 | free (programs); | |
776 | programs = tmp; | |
05aabb97 LM |
777 | } else { |
778 | ||
779 | /* clean old program */ | |
780 | if ((programs + n)->storage) { | |
781 | free ((programs + n)->storage); | |
782 | } | |
783 | if ((programs + n)->root) { | |
784 | delelement ((programs + n)->root); | |
785 | } | |
2e34899a LM |
786 | if ((programs + n)->string) { |
787 | free ((programs + n)->string); | |
0a8a1de3 | 788 | (programs + n)->string = NULL; |
2e34899a | 789 | } |
05aabb97 LM |
790 | } |
791 | } | |
792 | ||
793 | /* set program */ | |
794 | (programs + n)->id = id; | |
795 | (programs + n)->answer = 0; | |
6f14d1cc | 796 | (programs + n)->storage = (double *) callocordie (nbmems, sizeof (double)); |
05aabb97 | 797 | (programs + n)->storage_size = nbmems; |
e7d5c144 | 798 | (programs + n)->root = dupelement (root); |
05aabb97 | 799 | } |
c7cbb833 | 800 | |
e7d5c144 | 801 | double call (int id, int nbops, element_t **ops) |
c7cbb833 | 802 | { |
05aabb97 LM |
803 | workspace_t tmp = {0}; |
804 | int i, n = -1; | |
805 | double ret = 0; | |
806 | ||
807 | if (programs) { | |
e7d5c144 LM |
808 | |
809 | /* look for program */ | |
05aabb97 | 810 | for (i = 0; i < nb_programs; i++) { |
e7d5c144 | 811 | if ((programs + i)->id == id) { |
05aabb97 LM |
812 | n = i; |
813 | break; | |
814 | } | |
815 | } | |
d59a8079 LM |
816 | } |
817 | if (n == -1) { | |
818 | VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id)); | |
819 | return 0; | |
820 | } | |
05aabb97 | 821 | |
d59a8079 LM |
822 | /* store context */ |
823 | tmp.answer = answer; | |
824 | tmp.storage = storage; | |
825 | tmp.storage_size = storage_size; | |
05aabb97 | 826 | |
d59a8079 LM |
827 | /* change context */ |
828 | answer = 0; | |
829 | storage = (programs + n)->storage; | |
830 | storage_size = (programs + n)->storage_size; | |
831 | if (nbops > storage_size) { | |
832 | double *tmp = (double *) callocordie (nbops, sizeof (double)); | |
833 | memcpy (tmp, storage, storage_size * sizeof (double)); | |
834 | free (storage); | |
6c89afbd ML |
835 | (programs + n)->storage = storage = tmp; |
836 | (programs + n)->storage_size = storage_size = nbops; | |
05aabb97 | 837 | } |
d59a8079 LM |
838 | for (i = 0; i < nbops; i++) { |
839 | double val = evaluate_element (ops[i], 0); | |
840 | store (i + 1, val); | |
841 | } | |
842 | ||
843 | /* evaluate program */ | |
844 | element_t *elements = dupelement ((programs + n)->root); | |
845 | ret = evaluate_element (elements, 0); | |
523841a1 | 846 | delelement (elements); |
d59a8079 LM |
847 | |
848 | /* restore context */ | |
849 | answer = tmp.answer; | |
850 | storage = tmp.storage; | |
851 | storage_size = tmp.storage_size; | |
05aabb97 LM |
852 | |
853 | return ret; | |
c7cbb833 LM |
854 | } |
855 | ||
856 | void list () | |
05aabb97 LM |
857 | { |
858 | int i; | |
d59a8079 LM |
859 | fprintf (stdout, "programs:"); |
860 | for (i = 0; i < nb_programs; i++) { | |
861 | fprintf (stdout, " %d", (programs + i)->id); | |
05aabb97 | 862 | } |
d59a8079 | 863 | fprintf (stdout, "\n"); |
05aabb97 | 864 | } |
c7cbb833 LM |
865 | |
866 | void edit (int id) | |
2e34899a LM |
867 | { |
868 | int i, n = -1; | |
869 | ||
870 | if (programs) { | |
871 | ||
872 | /* look for program */ | |
873 | for (i = 0; i < nb_programs; i++) { | |
874 | if ((programs + i)->id == id) { | |
875 | n = i; | |
876 | break; | |
877 | } | |
878 | } | |
879 | } | |
880 | if (n == -1) { | |
881 | VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id)); | |
882 | return; | |
883 | } | |
884 | ||
885 | /* set string program */ | |
779282bb | 886 | fprintf (stdout, "edit: %s\n", (programs + n)->string); |
2e34899a LM |
887 | } |
888 | ||
779282bb | 889 | void savestring (int id, char *string) |
2e34899a LM |
890 | { |
891 | int i, n = -1; | |
892 | ||
893 | if (programs) { | |
894 | ||
895 | /* look for program */ | |
896 | for (i = 0; i < nb_programs; i++) { | |
897 | if ((programs + i)->id == id) { | |
898 | n = i; | |
899 | break; | |
900 | } | |
901 | } | |
902 | } | |
2e34899a | 903 | |
1b068216 LM |
904 | /* unnecesary code */ |
905 | //if (n == -1) { | |
906 | // VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id)); | |
907 | // return; | |
908 | //} | |
909 | //if ((programs + n)->string) { | |
910 | // free ((programs + n)->string); | |
911 | //} | |
912 | ||
2e34899a LM |
913 | (programs + n)->string = strdup (string); |
914 | } | |
c7cbb833 LM |
915 | |
916 | void del (int id) | |
d59a8079 LM |
917 | { |
918 | int i, j, n = -1; | |
919 | ||
920 | if (programs) { | |
921 | ||
922 | /* look for program */ | |
923 | for (i = 0; i < nb_programs; i++) { | |
924 | if ((programs + i)->id == id) { | |
925 | n = i; | |
926 | break; | |
927 | } | |
928 | } | |
929 | } | |
930 | if (n == -1) { | |
931 | VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id)); | |
932 | return; | |
933 | } | |
934 | ||
935 | /* clean program */ | |
936 | if ((programs + n)->storage) { | |
937 | free ((programs + n)->storage); | |
938 | } | |
939 | if ((programs + n)->root) { | |
940 | delelement ((programs + n)->root); | |
941 | } | |
2e34899a LM |
942 | if ((programs + n)->string) { |
943 | free ((programs + n)->string); | |
944 | } | |
d59a8079 LM |
945 | |
946 | /* remove entry */ | |
947 | workspace_t *tmp = (workspace_t *) callocordie (nb_programs - 1, sizeof (workspace_t)); | |
948 | for (i = 0, j = 0; i < nb_programs; i++) { | |
949 | if (i != n) { | |
950 | memcpy (tmp + j, programs + i, sizeof (workspace_t)); | |
951 | j++; | |
952 | } | |
953 | } | |
954 | free (programs); | |
955 | programs = tmp; | |
956 | nb_programs--; | |
957 | } | |
c7cbb833 | 958 | |
89cf0955 LM |
959 | /* help message */ |
960 | ||
961 | void help (void) | |
962 | { | |
04d68907 | 963 | fprintf (stdout, "calc is a simple calculator\n\n"); |
0e1004e3 | 964 | fprintf (stdout, "arithmetic op.:"); |
94b4e517 | 965 | fprintf (stdout, " + - * / %% ^\n"); |
0e1004e3 | 966 | fprintf (stdout, "comparison op.:"); |
94b4e517 | 967 | fprintf (stdout, " == != >= <= > <\n"); |
0e1004e3 | 968 | fprintf (stdout, "logical op.:"); |
94b4e517 | 969 | fprintf (stdout, " & | !\n"); |
0e1004e3 | 970 | fprintf (stdout, "mathematic func.:"); |
347b66f8 | 971 | fprintf (stdout, " exp ln log pow sqrt\n"); |
0e1004e3 | 972 | fprintf (stdout, "trigonometric func.:"); |
347b66f8 | 973 | fprintf (stdout, " acos asin atan cos sin tan\n"); |
72b7d4bc LM |
974 | fprintf (stdout, "error functions:"); |
975 | fprintf (stdout, " erf erfc\n"); | |
0e1004e3 | 976 | fprintf (stdout, "miscellaneous func.:"); |
9e52bbc5 | 977 | fprintf (stdout, " abs ceil floor\n"); |
0e1004e3 | 978 | fprintf (stdout, "storage func.:"); |
347b66f8 | 979 | fprintf (stdout, " clear dec disp inc mem rcl sto\n"); |
0e1004e3 | 980 | fprintf (stdout, "control flow prim.:"); |
347b66f8 | 981 | fprintf (stdout, " cond print while {} ;\n"); |
0e1004e3 | 982 | fprintf (stdout, "program management:"); |
347b66f8 | 983 | fprintf (stdout, " call del edit ls prog\n"); |
0e1004e3 | 984 | fprintf (stdout, "control management:"); |
347b66f8 | 985 | fprintf (stdout, " help quit\n"); |
0e1004e3 | 986 | fprintf (stdout, "constants:"); |
347b66f8 | 987 | fprintf (stdout, " ans e pi\n"); |
89cf0955 | 988 | } |
3b4b0bbe | 989 | |
f2927108 LM |
990 | /* evaluate element tree */ |
991 | ||
89cf0955 LM |
992 | #define MASK_SUB 0x1 |
993 | #define MASK_DIV 0x2 | |
994 | ||
3b4b0bbe | 995 | double evaluate_element (element_t *root, char mask) |
f2927108 LM |
996 | { |
997 | double op0 = 0, op1 = 0; | |
3b4b0bbe | 998 | char nextmask = mask; |
e7d5c144 | 999 | int i, nb; |
f2927108 LM |
1000 | |
1001 | if ((root == NULL) || (root == ERROR_OP)) { | |
04d68907 | 1002 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n")); |
f2927108 LM |
1003 | return 0; |
1004 | } | |
1005 | ||
3b4b0bbe LM |
1006 | /* mask to manage sub operator sub and div */ |
1007 | switch (root->func) { | |
1008 | case Add: | |
1009 | nextmask &= ~MASK_SUB; | |
1010 | nextmask &= ~MASK_DIV; | |
1011 | break; | |
1012 | case Sub: | |
1013 | nextmask |= MASK_SUB; | |
1014 | nextmask &= ~MASK_DIV; | |
1015 | break; | |
1016 | case Mul: | |
1017 | nextmask &= ~MASK_DIV; | |
1018 | break; | |
1019 | case Div: | |
1020 | nextmask |= MASK_DIV; | |
1021 | break; | |
1022 | default: | |
1023 | nextmask = mask; | |
1024 | } | |
1025 | ||
f2927108 LM |
1026 | switch (root->func) { |
1027 | case Val: | |
3b4b0bbe LM |
1028 | case Sig: |
1029 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value; | |
f2927108 LM |
1030 | break; |
1031 | case Add: | |
1032 | case Sub: | |
1033 | case Mul: | |
1034 | case Div: | |
c47a9298 | 1035 | case Mod: |
f2927108 | 1036 | case Pow: |
3639df66 | 1037 | case Store: |
7fe742c9 LM |
1038 | case Equal: |
1039 | case Diff: | |
1040 | case Ge: | |
1041 | case Le: | |
1042 | case Gt: | |
1043 | case Lt: | |
ca3e2a2f LM |
1044 | case And: |
1045 | case Or: | |
c7cbb833 | 1046 | case Prog: |
f2927108 | 1047 | if (root->ops[1]) { |
3b4b0bbe | 1048 | op1 = evaluate_element (root->ops[1], nextmask); |
3639df66 | 1049 | } else if (root->func != Store) { |
04d68907 | 1050 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n")); |
f2927108 LM |
1051 | return 0; |
1052 | } | |
1053 | /* fallthrough */ | |
1054 | case Sqr: | |
1055 | case Cos: | |
1056 | case Sin: | |
9e52bbc5 LM |
1057 | case Tan: |
1058 | case Acos: | |
1059 | case Asin: | |
471da7c9 | 1060 | case Atan: |
2a986c8f | 1061 | case Ln: |
f2927108 LM |
1062 | case Log: |
1063 | case Exp: | |
72b7d4bc LM |
1064 | case Erfc: |
1065 | case Erf: | |
9e52bbc5 LM |
1066 | case Abs: |
1067 | case Ceil: | |
1068 | case Floor: | |
6ba1dd0f | 1069 | case Recall: |
a8cf32ba LM |
1070 | case Inc: |
1071 | case Dec: | |
ca3e2a2f | 1072 | case Not: |
f438579a | 1073 | case Mem: |
94b4e517 | 1074 | case Cond: |
c7cbb833 | 1075 | case Call: |
c7cbb833 LM |
1076 | case Edit: |
1077 | case Del: | |
f2927108 | 1078 | if (root->ops[0]) { |
3b4b0bbe | 1079 | op0 = evaluate_element (root->ops[0], 0); |
f2927108 | 1080 | } else { |
04d68907 | 1081 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); |
f2927108 LM |
1082 | return 0; |
1083 | } | |
89cf0955 | 1084 | break; |
6ba1dd0f | 1085 | case Disp: |
143f91ae | 1086 | case Clear: |
471da7c9 LM |
1087 | case Quit: |
1088 | case Help: | |
5075f6ea | 1089 | case Ans: |
471da7c9 LM |
1090 | case Pi: |
1091 | case E: | |
05aabb97 | 1092 | case Code: |
e7d5c144 | 1093 | case List: |
09d87cae | 1094 | break; |
2a688642 | 1095 | case While: |
09d87cae LM |
1096 | if (root->ops[0] == NULL) { |
1097 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); | |
1098 | return 0; | |
1099 | } | |
89cf0955 | 1100 | break; |
715580ff LM |
1101 | case Print: |
1102 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : answer; | |
1103 | break; | |
f2927108 LM |
1104 | } |
1105 | ||
1106 | switch (root->func) { | |
3b4b0bbe LM |
1107 | case Val: return op0; |
1108 | case Sig: return -op0; | |
1109 | case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1; | |
1110 | case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1; | |
1111 | case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1; | |
1112 | case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1; | |
c47a9298 | 1113 | case Mod: return fmod (op0, op1); |
f2927108 LM |
1114 | case Pow: return pow (op0, op1); |
1115 | case Sqr: return sqrt (op0); | |
1116 | case Cos: return cos (op0); | |
1117 | case Sin: return sin (op0); | |
9e52bbc5 LM |
1118 | case Tan: return tan (op0); |
1119 | case Acos: return acos (op0); | |
1120 | case Asin: return asin (op0); | |
471da7c9 | 1121 | case Atan: return atan (op0); |
2a986c8f LM |
1122 | case Ln: return log (op0); |
1123 | case Log: return log10 (op0); | |
f2927108 | 1124 | case Exp: return exp (op0); |
72b7d4bc LM |
1125 | case Erfc: return erfc (op0); |
1126 | case Erf: return erf (op0); | |
9e52bbc5 LM |
1127 | case Abs: return fabs (op0); |
1128 | case Ceil: return ceil (op0); | |
1129 | case Floor: return floor (op0); | |
3639df66 | 1130 | case Store: return store ((int)op0, (op1) ? op1 : answer); |
6ba1dd0f | 1131 | case Recall: return recall ((int)op0); |
a8cf32ba LM |
1132 | case Inc: return increase ((int)op0); |
1133 | case Dec: return decrease ((int)op0); | |
6ba1dd0f | 1134 | case Disp: display (); break; |
f438579a | 1135 | case Mem: memory ((int)op0); break; |
143f91ae | 1136 | case Clear: clear (); break; |
471da7c9 LM |
1137 | case Quit: quit (); break; |
1138 | case Help: help (); break; | |
5075f6ea | 1139 | case Ans: return answer; |
471da7c9 LM |
1140 | case Pi: return M_PI; |
1141 | case E: return M_E; | |
7fe742c9 LM |
1142 | case Equal: return op0 == op1; |
1143 | case Diff: return op0 != op1; | |
1144 | case Ge: return op0 >= op1; | |
1145 | case Le: return op0 <= op1; | |
1146 | case Gt: return op0 > op1; | |
1147 | case Lt: return op0 < op1; | |
ca3e2a2f LM |
1148 | case And: return (op0 != 0) && (op1 != 0); |
1149 | case Or: return (op0 != 0) || (op1 != 0); | |
1150 | case Not: return (op0 == 0); | |
94b4e517 LM |
1151 | case Cond: |
1152 | if ((op0) && (root->ops[1])) { | |
1153 | return evaluate_element (root->ops[1], 0); | |
1154 | } else if ((!op0) && (root->ops[2])) { | |
1155 | return evaluate_element (root->ops[2], 0); | |
1156 | } else { | |
1157 | return 0; | |
1158 | } | |
2a688642 | 1159 | case While: return while_do (root->ops[0], root->ops[1]); |
05aabb97 | 1160 | case Code: return execute_code (root->ops, root->nbops); |
2a5ec9d1 | 1161 | case Print: return print (op0); |
779282bb LM |
1162 | case Prog: |
1163 | prog ((int)op0, (int)op1, root->ops[2]); | |
1164 | savestring ((int)op0, root->string); | |
1165 | break; | |
e7d5c144 LM |
1166 | case Call: |
1167 | for (i = 1, nb =0; i < root->nbops; i++) { | |
1168 | if (root->ops[i]) { | |
1169 | nb++; | |
1170 | } | |
1171 | } | |
1172 | return call ((int)op0, nb, root->ops + 1); | |
c7cbb833 LM |
1173 | case List: list (); break; |
1174 | case Edit: edit ((int)op0); break; | |
05aabb97 | 1175 | case Del: del ((int)op0); break; |
f2927108 LM |
1176 | } |
1177 | ||
1178 | return 0; | |
1179 | } | |
1180 | ||
b9c1c40d LM |
1181 | char **generate_completion_list () |
1182 | { | |
db660e60 | 1183 | int i, j, l = 0; |
6f14d1cc | 1184 | char **list = (char **) callocordie (NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1, sizeof (char *)); |
b9c1c40d | 1185 | |
db660e60 LM |
1186 | for (i = 0; i < NB_OPERATORS; i++) { |
1187 | list[l] = strdup ((operators + i)->keyword); | |
1188 | for (j = 0; j < (int)strlen (list[l]); j++) { | |
1189 | if (list[i][j] == '\t') { | |
1190 | list[i][j] = '\0'; | |
1191 | } | |
1192 | } | |
d8f4df0f LM |
1193 | if (list[l] != NULL) { |
1194 | l++; | |
db660e60 | 1195 | } |
db660e60 LM |
1196 | } |
1197 | ||
b9c1c40d LM |
1198 | for (i = 0; i < NB_FUNCTIONS; i++) { |
1199 | list[l] = strdup ((functions + i)->keyword); | |
d8f4df0f LM |
1200 | if (list[l] != NULL) { |
1201 | l++; | |
b9c1c40d | 1202 | } |
b9c1c40d LM |
1203 | } |
1204 | ||
1205 | for (i = 0; i < NB_CONSTANTS; i++) { | |
1206 | list[l] = strdup ((constants + i)->keyword); | |
d8f4df0f LM |
1207 | if (list[l] != NULL) { |
1208 | l++; | |
b9c1c40d | 1209 | } |
b9c1c40d LM |
1210 | } |
1211 | ||
db660e60 LM |
1212 | for (i = 0; i < NB_SYMBOLS; i++) { |
1213 | list[l] = strdup (symbols[i]); | |
d8f4df0f LM |
1214 | if (list[l] != NULL) { |
1215 | l++; | |
db660e60 | 1216 | } |
db660e60 LM |
1217 | } |
1218 | ||
b9c1c40d LM |
1219 | return (list); |
1220 | } | |
1221 | ||
1222 | void free_completion_list (char **list) | |
1223 | { | |
1224 | int i; | |
1225 | ||
1226 | if (list) { | |
3d3e6770 | 1227 | for (i = 0; i < NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1; i++) { |
b9c1c40d LM |
1228 | if (list[i] != NULL) { |
1229 | free (list[i]); | |
1230 | } | |
1231 | } | |
1232 | free (list); | |
1233 | } | |
1234 | } | |
1235 | ||
1236 | ||
bc97a989 | 1237 | /* vim: set ts=4 sw=4 et: */ |