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