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